Difference between revisions of "Loop"

From Organic Design wiki
m (Caretaker: categories)
m
Line 1: Line 1:
 
[[Category:Diagrams]][[Category:Glossary]][[Category:Nodal Concepts]]
 
[[Category:Diagrams]][[Category:Glossary]][[Category:Nodal Concepts]]
In the [[nodal model]], a [[loop]] is a [[Wikipedia:Linked list#Circularly-linked list|circularly linked list]] formed from nodal [[association]]s. Since none of the [[node]]s 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]]
+
In the [[nodal model]], a [[loop]] is a [[Wikipedia:Linked list#Circularly-linked list|circularly linked list]] formed from nodal [[association]]s. Since none of the [[node]]s 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]].
 +
 
 +
If a loop is not circularly-linked, then the last item must link to [[root]] and it is called a [[thread]] instead. Threads only rotate once and are then automatically unhooked because every [[quanta]] sent to root is a new quanta.
  
 
In [[nodal reduction]], a [[node]]'s value (obtained by calling nodeGet/SetValue with the key parameter set to zero) is called the current [[focus]] and it is a [[node]] in the [[loop]]. This node of current-focus is the one which will receive the next [[quantum]] of execution from its parent node, and is part of a loop of nodes which all reveive quanta as the loop is rotated by the nodal reduction process.
 
In [[nodal reduction]], a [[node]]'s value (obtained by calling nodeGet/SetValue with the key parameter set to zero) is called the current [[focus]] and it is a [[node]] in the [[loop]]. This node of current-focus is the one which will receive the next [[quantum]] of execution from its parent node, and is part of a loop of nodes which all reveive quanta as the loop is rotated by the nodal reduction process.
  
Note that although one [[node]] can be the value of many [[association]]s at the same time, it can only occupy a single [[loop]] at any one time, because its position in a loop is determined by its [[nodePREV|prev]] and [[nodeNEXT|next]] associations. Since the loop is occupied by the recipients of the nodes energy, the node plays the role of [[nodePARENT|parent]] to the items in the loop.
+
If a loop has static structure, then it can appear in many contexts simaltaneously, it's [[parent]] [[association]] will be dynamically maintained by the [[nodal reduction]] algorithm.
  
 
<table class=expandable title="Diagram of a loop"><tr><td>
 
<table class=expandable title="Diagram of a loop"><tr><td>
 
[[Image:loop.png]]
 
[[Image:loop.png]]
 
</table>
 
</table>

Revision as of 02:15, 11 December 2006

In the nodal model, a loop is a circularly linked list formed from nodal associations. Since none of the nodes 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.

If a loop is not circularly-linked, then the last item must link to root and it is called a thread instead. Threads only rotate once and are then automatically unhooked because every quanta sent to root is a new quanta.

In nodal reduction, a node's value (obtained by calling nodeGet/SetValue with the key parameter set to zero) is called the current focus and it is a node in the loop. This node of current-focus is the one which will receive the next quantum of execution from its parent node, and is part of a loop of nodes which all reveive quanta as the loop is rotated by the nodal reduction process.

If a loop has static structure, then it can appear in many contexts simaltaneously, it's parent association will be dynamically maintained by the nodal reduction algorithm.