Difference between revisions of "NR.c"
From Organic Design wiki
({{c}}{{Category:Nodal Concepts}}) |
m |
||
| Line 1: | Line 1: | ||
// Moves "this" to node's focus if exists then rotates loop and executes/reduces the focus item{{c}}{{Category:Nodal Concepts}} | // Moves "this" to node's focus if exists then rotates loop and executes/reduces the focus item{{c}}{{Category:Nodal Concepts}} | ||
void nodeReduce() { | void nodeReduce() { | ||
| − | if (this = nodeLoopRotate(parent = this)) { | + | if (this = nodeLoopRotate(parent = this)) { // Move "this" to the focus in the node's loop and rotate |
nodeSetValue(this,nodePARENT,parent); // Update the parent association | nodeSetValue(this,nodePARENT,parent); // Update the parent association | ||
if (code = *nodeState(this,nodeCODE)) code(); // nodeCODE value is a pointer-index, execute as function-reference if non-zero | if (code = *nodeState(this,nodeCODE)) code(); // nodeCODE value is a pointer-index, execute as function-reference if non-zero | ||
} | } | ||
} | } | ||
Revision as of 02:47, 5 October 2007
// Moves "this" to node's focus if exists then rotates loop and executes/reduces the focus itemTemplate:CThis is a category for all the concepts relating to the nodal model and its workings.
- The nodal network is formed from many peers, each running the nodal reduction algorithm on their local node space
- A node space is a collection of nodes on top of (and being a subset of) a list space.
- There was a runnable version of the principle in peerd.c
void nodeReduce() { if (this = nodeLoopRotate(parent = this)) { // Move "this" to the focus in the node's loop and rotate nodeSetValue(this,nodePARENT,parent); // Update the parent association if (code = *nodeState(this,nodeCODE)) code(); // nodeCODE value is a pointer-index, execute as function-reference if non-zero } }
