NodeSpace.h

1. define ROOT 0
2. define NULL 0
3. define CURRENT 1
4. define AND 2
5. define CODE 3
6. define THEN 4
7. define NETWORK 5
8. define DESKTOP 6

typedef int node; // node: a type for referring to nodes typedef void (*code)(); // code: a type for referring to functions

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) { node cur; code state; // return if no CURRENT node if ((cur = nodeGetValue(subject, CURRENT)) == NULL) return; nodeSetValue(subject, CURRENT, nodeGetValue(cur, AND)); // test AND first? if (nodeGetValue(cur, CODE) != NULL) { state = (code)nodeGetState(cur); state(); // Later this must declare and build if no function-reference // replace self in loop with n.THEN if non-zero } else nodeReduce(cur); return 1; }