NodeSpace.h

1. define CURRENT 2
2. define AND 3
3. define THEN 4
4. define CODE 5

typedef int node;

node nodeTraverse(node subject, node path) { // select node wco selNode return subject; }

// set nodal value of node/path // - path is array-of-node node nodeGetValue(node subject, node path) { node value; return value; }

void nodeSetValue(node subject, node path, node value) { }

void* nodeGetState(node subject) { void* state; return state; }

void nodeSetState(node subject, void* state) { }

node nodeInsertKey(node subject, node key) { node instance; return instance; }

void nodeRemoveKey(node subject, node key) { }

// - Consumes quanta of execution // - Creates History from change events // - Builds, declares and executes functionality // - Should reduction handle cyles (current-cycle etc), or a separate root-thread // - returns false if no more to reduce int nodeReduce(node subject) { // return if no CURRENT node (either nonexistent, or ref to node 0) node n; if ((n = nodeGetValue(subject, CURRENT)) == 0) return; nodeSetValue(subject, CURRENT, nodeGetValue(n, AND)); if (nodeGetValue(n, CODE)) { void (*code)() = nodeGetState(n); code(); // Later this must declare and build if no function-reference // replace self in loop with n.THEN if non-zero } else nodeReduce(n); return 1; }