Difference between revisions of "List"
m (Caretaker: categories) |
m (Caretaker: nodal-directions) |
||
| Line 2: | Line 2: | ||
In the [[nodal model]], a [[list]] is a [[w:Linked list|linked list]] formed from nodal [[association]]s which link each item in a list with the previous and next items. These lists are the basis of the arrow of time in the nodal model. | In the [[nodal model]], a [[list]] is a [[w:Linked list|linked list]] formed from nodal [[association]]s which link each item in a list with the previous and next items. These lists are the basis of the arrow of time in the nodal model. | ||
| − | A list is called a [[loop]] if all the items form a closed circuit, or a [[thread]] if not. Threads have a start item signified by its | + | A list is called a [[loop]] if all the items form a closed circuit, or a [[thread]] if not. Threads have a start item signified by its {{left}} being unconnected (connected to [[root]]), and a last item having its {{right}} unconnected. In [[nodal reduction]], threads only rotate once and are then automatically unhooked because every [[quanta]] sent to root is a new quanta. |
Since none of the items in a [[loop]] is a starting or finishing point, a loop can be [[node references|referenced]] by ''any'' of its node-items. This means that a reference to a loop can also encapsulate the concept of an item of ''current focus'', a concept used heavily by [[nodal reduction]]. | Since none of the items in a [[loop]] is a starting or finishing point, a loop can be [[node references|referenced]] by ''any'' of its node-items. This means that a reference to a loop can also encapsulate the concept of an item of ''current focus'', a concept used heavily by [[nodal reduction]]. | ||
Revision as of 15:26, 27 February 2007
In the nodal model, a list is a linked list formed from nodal associations which link each item in a list with the previous and next items. These lists are the basis of the arrow of time in the nodal model.
A list is called a loop if all the items form a closed circuit, or a thread if not. Threads have a start item signified by its Left being unconnected (connected to root), and a last item having its Right unconnected. In nodal reduction, threads only rotate once and are then automatically unhooked because every quanta sent to root is a new quanta.
Since none of the items in a loop is a starting or finishing point, a loop can be referenced by any of its node-items. This means that a reference to a loop can also encapsulate the concept of an item of current focus, a concept used heavily by nodal reduction.
In nodal reduction, a node's value (obtained by calling nodeGet/SetValue with the key parameter set to zero) is called the current focus which is a node within the local list. This node of current-focus is the one which will receive the next quantum of execution from its parent node, and is part of the unified tree of current "work" being processed by nodal reduction.
If a list has static structure, then it can appear in many contexts simaltaneously, it's parent association will be dynamically maintained by the nodal reduction algorithm.
