-/* -*-sod-*- */
+/* -*-sod-*- *
+ *
+ * Test program for Sod functionality
+ *
+ * (c) 2016 Straylight/Edgeware
+ */
+
+/*----- Licensing notice --------------------------------------------------*
+ *
+ * This file is part of the Sensible Object Design, an object system for C.
+ *
+ * SOD is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * SOD is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with SOD; if not, write to the Free Software Foundation,
+ * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
code h: includes {
#include "sod.h"
[link = SodObject, nick = base]
class T1Base: SodObject {
+ int plain(int x) { STEP(x); return (x + 1); }
+
[combination = progn] void aprogn();
[combination = sum] int asum();
[combination = and] int aand();
[combination = max] int amax();
+ [role = around] int base.asum() { return (CALL_NEXT_METHOD); }
[combination = custom,
empty = { sod_ret = 0; },
[link = T1Base, nick = mid]
class T1Mid: T1Base {
+ int base.plain(int x) { STEP(x - 1); return (CALL_NEXT_METHOD); }
void base.aprogn() { STEP(1); }
int base.asum() { return 1; }
int base.aand() { return 8; }
if (!l) STEP(5);
v = T1Base_avec(t1);
if (!v.n) STEP(6);
- DONE(7);
+ STEP(T1Base_plain(t1, 7)); /* 7, 8 */
+ DONE(9);
}
prepare("aggregate, mid");
{ SOD_DECL(T1Mid, t1, NO_KWARGS);
v = T1Base_avec(t1);
if (!check_vec(&v, 19, -1)) STEP(6);
free_vec(&v);
- DONE(7);
+ STEP(T1Base_plain(t1, 8)); /* 7, 8, 9 */
+ DONE(10);
}
prepare("aggregate, sub");
{ SOD_DECL(T1Sub, t1, NO_KWARGS);
[link = SodObject, nick = t2]
class T2: SodObject {
[initarg = x] int x = 0;
+ [initarg = z] t2.x;
initarg int y = 1;
init { if (!y) STEP(0); }
}
+[link = T2]
+class T2Sub: T2 {
+ [initarg = a] t2.x;
+ [initarg = b] t2.x;
+ [initarg = x] t2.x;
+ [initarg = c] t2.x;
+}
+
code c: tests {
prepare("initargs, defaults");
{ SOD_DECL(T2, t, NO_KWARGS);
if (t->t2.x == 42) STEP(1);
DONE(2);
}
+ prepare("initargs, inheritance");
+ { SOD_DECL(T2Sub, t, KWARGS(K(c, 1) K(z, 2)));
+ if (t->t2.x == 1) STEP(0);
+ DONE(1);
+ }
+ prepare("initargs, ordering");
+ { SOD_DECL(T2Sub, t, KWARGS(K(a, 1) K(b, 2)));
+ if (t->t2.x == 1) STEP(0);
+ DONE(1);
+ }
+ prepare("initargs, reprioritizing");
+ { SOD_DECL(T2Sub, t, KWARGS(K(x, 1) K(c, 2)));
+ if (t->t2.x == 1) STEP(0);
+ DONE(1);
+ }
}
/*----- Keyword argument propagation --------------------------------------*/
}
}
+/*----- Metaclass initialization ------------------------------------------*/
+
+[link = SodClass, nick = mycls]
+class MyClass: SodClass {
+ int x = -1, y, z = 2;
+}
+
+[nick = myobj, metaclass = MyClass]
+class MyObject: SodObject {
+ class mycls.x = 0, mycls.y = 1;
+}
+
+code c: tests {
+ prepare("metaclass, init");
+ STEP(MyObject__cls_obj->mycls.x);
+ STEP(MyObject__cls_obj->mycls.y);
+ STEP(MyObject__cls_obj->mycls.z);
+ DONE(3);
+}
+
+/*----- Static instances --------------------------------------------------*/
+
+[link = SodObject, nick = st]
+class StaticObject: SodObject {
+ int x, y = 2, z = 3;
+ [readonly = t] void step() { STEP(me->st.x); }
+}
+
+[extern = t] instance StaticObject mystatic: st.x = 0, st.z = 69;
+[const = nil] instance StaticObject otherstatic: st.x = 3, st.y = 42;
+
+code c: tests {
+ prepare("static instance");
+ StaticObject_step(mystatic);
+ if (mystatic->st.y == 2) STEP(1);
+ if (mystatic->st.z == 69) STEP(2);
+ StaticObject_step(otherstatic);
+ if (otherstatic->st.y == 42) STEP(4);
+ if (otherstatic->st.z == 3) STEP(5);
+ DONE(6);
+}
+
/*----- That's all, folks -------------------------------------------------*/