Difference between revisions of "Loop"
(expand on reduction bit) |
(put nodal def at start) |
||
| Line 1: | Line 1: | ||
[[Category:Nodal Concepts]][[Category:Glossary]] | [[Category:Nodal Concepts]][[Category:Glossary]] | ||
| + | In [[Nodal Reduction]], a node's ''current focus'' is a node from it's ''current loop'' which is reached by following the node's ''current-loop-asociation''. In the [[nodeSpace.c]] source, the ''current-loop-association'' is reffered to by a constant called ''nodeLOOP''. Strurally, nodal loops are [[Wikipedia:Linked_list#Circularly-linked_list|circularly linked lists]]. | ||
| + | |||
| + | |||
| + | |||
| + | ;Loops in general | ||
A Loop is formed when all ''[[next]]s'' form a complete loop in one direction and all ''[[prevs]]'' link up in exactly the opposite direction. A Loop does not distinguish any [[List-Item]] as being the start or finish. | A Loop is formed when all ''[[next]]s'' form a complete loop in one direction and all ''[[prevs]]'' link up in exactly the opposite direction. A Loop does not distinguish any [[List-Item]] as being the start or finish. | ||
| Line 5: | Line 10: | ||
This has important implications when it comes to structures composed of [[Node]]s which can be Loops. Since none of the [[Node]]s is the start or finish, a Loop can be referenced by ''any'' of its items. | This has important implications when it comes to structures composed of [[Node]]s which can be Loops. Since none of the [[Node]]s is the start or finish, a Loop can be referenced by ''any'' of its items. | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 11:21, 24 August 2006
In Nodal Reduction, a node's current focus is a node from it's current loop which is reached by following the node's current-loop-asociation. In the nodeSpace.c source, the current-loop-association is reffered to by a constant called nodeLOOP. Strurally, nodal loops are circularly linked lists.
- Loops in general
A Loop is formed when all nexts form a complete loop in one direction and all prevs link up in exactly the opposite direction. A Loop does not distinguish any List-Item as being the start or finish.
Loops are structurally identical to Queues, but are treated differently by the contexts that use them.
This has important implications when it comes to structures composed of Nodes which can be Loops. Since none of the Nodes is the start or finish, a Loop can be referenced by any of its items.
