Difference between revisions of "LT.c"
From Organic Design wiki
m |
m |
||
| Line 1: | Line 1: | ||
| + | <c> | ||
// Start at subject listItem and traverse the key as an association to a new listItem{{c}}{{Category:Nodal Concepts}} | // Start at subject listItem and traverse the key as an association to a new listItem{{c}}{{Category:Nodal Concepts}} | ||
// - key is also a listItem reference and its binary address is used as the traversal path | // - key is also a listItem reference and its binary address is used as the traversal path | ||
| Line 15: | Line 16: | ||
return subject; | return subject; | ||
} | } | ||
| + | </c> | ||
Revision as of 01:38, 9 January 2011
<c> // Start at subject listItem and traverse the key as an association to a new listItemTemplate: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
// - key is also a listItem reference and its binary address is used as the traversal path // - subject and key (all list-item references are ints starting at item 0) // - if key is 0 the subject is returned unchanged, key 1 and 2 are the two single-iteration traversals item listTraverse(item subject, item key) { if (key++ > 0) { int i,j; for (i = 1; i <= key >> 1; i <<= 1) { j = subject * 3; if (key & i) j++; if (space[j] == 0) space[j] = listInsert(); subject = space[j]; } } return subject; } </c>
