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

// - path is array-of-node node nodeTraverse(node subject,node *path) { // select node wco selNode return subject; }

// set nodal value of node/path node nodeGetValue(node subject,node key) { return listGetValue((item)listTraverse((item)subject,(item)key)); }

node nodeSetValue(node subject,node key,node value) { // todo: onChange return listSetValue((item)listTraverse((item)subject,(item)key),(item)value); }

node nodeInsertKey(node subject, node key) { // todo: onInstall node instance; return instance; }

void nodeRemoveKey(node subject, node key) { // todo: onRemove }

// State is a pointer to a locally meaningful item which is associated with a node // - not very efficient using text-trie based hash, but good enough for now // - doesn't need separate get/set since pointer-based, but should keep this lang-independent void *nodeGetState(node subject) { return *hash(itoa((int)subject); }

void *nodeSetState(node subject, void *state) { return *hash(itoa((int)subject) = state; }

// - 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; if ((cur = nodeGetValue(subject, CURRENT)) == NULL) return; // return if no CURRENT node nodeSetValue(subject, CURRENT, nodeGetValue(cur, AND)); // test AND first? if (nodeGetValue(cur, CODE) != NULL) { ((code)nodeGetState(cur))(); // execute code-ref returned in 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; }