| | Name | Description |
|---|
 | AnyBetweenHereAndLeavesT | |
| AnyBetweenLeavesAndHereT | |
| AreAllNodesFromSameLevelT |
Determines whether all nodes in the provided enumeration have the same level (see LevelT(T) for an explanation of level).
|
| ElementAtT |
Gets a node inside a tree by using an index array.
|
| EnsureValidityOfNodeIndexT |
Ensures that a list of indices that point to a node in a tree is valid.
|
| FirstAncestorImplementingM, T |
Returns the firsts ancestor of this node that has the type M.
|
| FixAndTestParentChildRelationsT |
Fixes the and test the parent-child relationship in a tree.
|
| FromHereToLeavesDoT | |
| FromLeavesToHereDoT | |
  | HaveSameParentT |
Determines whether a couple of nodes share the same parent node.
|
| IndexOfT(T) |
Gets the index of a given node inside a tree.
|
| IndexOfT(T, IListInt32) |
Gets the index of a given node inside a tree.
|
| InsertT |
Inserts the specified node at a certain index in the tree.
|
| InsertAfterT |
Inserts the specified node after a certain index in the tree.
|
| InsertLastT |
Inserts the specified node after all other siblings of the node at a certain index in the tree.
|
| IsStructuralEquivalentToT, M | |
| IsValidIndexT(T, IEnumerableInt32) |
Determines whether the given index is valid or not.
|
| IsValidIndexT(T, IEnumerableInt32, T) |
Determines whether the given index is valid or not.
|
| LevelT |
Determines the level of the specified node. The root node (= node that has no parent) will return a level of 0, the child nodes of the root node a level of 1 and so on.
|
| MoveNodesUpDownT |
This procedure will move nodes some indices up or down. All nodes to move should have the same parent.
|
| NodesOfSameHighestLevelT |
Returns only the nodes with the highest hierarchy level among all the provided nodes (i.e. the nodes most close to the leaf nodes of the true).
First, the nodes collection is iterated through to determine the highest node level. Then only those nodes with the hightest node level are returned.
|
| ProjectTreeToNewTreeS, D(S, FuncS, D, ActionD, D) |
Projects a tree (source tree) to a new tree (destination tree).
|
| ProjectTreeToNewTreeS, D(S, IListInt32, FuncS, IListInt32, D, ActionD, D) |
Projects a tree (source tree) to a new tree (destination tree). The creation function for the new tree nodes gets information about the node indices.
|
| ProjectTreeToTreeS, D(S, D, ActionS, D) |
Projects a source tree onto a destination tree.
Nodes are updated, added, or deleted in the destination tree to match the source tree.
|
| ProjectTreeToTreeS, D(S, D, ActionS, D, FuncD, D) |
Projects a source tree onto a destination tree.
Nodes are updated, added, or deleted in the destination tree to match the source tree.
|
| ProjectTreeToTreeS, D(S, D, ActionS, D, FuncD, D, ActionD, D, Int32) |
Projects a source tree onto a destination tree.
Nodes are updated, added, or deleted in the destination tree to match the source tree.
|
| ProjectTreeToTreeS, D(S, D, ActionS, D, FuncD, D, ActionD, D, Int32, ListValueTupleD, D, Int32) |
Projects a source tree onto a destination tree.
Nodes are updated, added, or deleted in the destination tree to match the source tree.
|
| ProjectTreeToTreeS, D(S, D, FuncS, IEnumeratorS, FuncD, IEnumeratorD, ActionS, D, FuncD, D, ActionD, D, Int32, ListValueTupleD, D, Int32) |
Projects a source tree onto a destination tree.
Nodes are updated, added, or deleted in the destination tree to match the source tree.
|
| RemoveT |
Frees this node, i.e. removes the node from it's parent collection.
|
| RootNodeT |
Gets the root node of a tree to which the given node node belongs.
|
| TakeFromFirstLeavesToHereT(T) |
Enumerates through all tree nodes from the upmost leaf of the tree down to the provided node node. The provided node node is included in the enumeration.
Attention: Since the order of the nodes must be reversed, this enumeration is only efficient for ITreeListNodeT types.
|
| TakeFromFirstLeavesToHereT(T, Boolean) |
Enumerates through all tree nodes from the upmost leaf of the tree down to the provided node node. If includeThisNode is true, the provided node node is included in the enumeration.
|
| TakeFromHereToFirstLeavesT(T) |
Enumerates through all tree nodes from (and including) the provided node node up to the leaves of the tree.
|
| TakeFromHereToFirstLeavesT(T, Boolean) |
Enumerates through all tree nodes from the provided node node up to the leaves of the tree. If includeThisNode is true, the provided node node is included in the enumeration.
|
| TakeFromHereToLastLeavesT(T) |
Enumerates through all tree nodes from (and including) the provided node node to the leaves of the tree. The downmost leaves will be enumerated first.
|
| TakeFromHereToLastLeavesT(T, Boolean) |
Enumerates through all tree nodes from the provided node node to the leaves of the tree. The downmost leaves will be enumerated first. If includeThisNode is true, the provided node node is included in the enumeration.
Attention: Since the order of the nodes must be reversed, this enumeration is only efficient for ITreeListNodeT types.
|
| TakeFromHereToLeavesT |
Enumerates through all tree nodes from the provided node node up to the leaves of the tree. If includeThisNode is true, the provided node node is included in the enumeration.
The direction of the enumeration of the child nodes depend on the return value of a function directionSelector, which is applied to the parent node.
|
| TakeFromHereToLeavesWithIndexT |
Enumerates through all tree nodes from the provided node node up to the leaves of the tree. If includeThisNode is true, the provided node node is included in the enumeration.
The direction of the enumeration of the child nodes depend on the return value of a function directionSelector, which is applied to the parent node.
In addition to the node itself, the enumeration also delivers the index of the node in the parent's collection.
|
| TakeFromHereToRootT |
Enumerates through all tree nodes from (and including) the provided node node down to the root node.
|
| TakeFromLastLeavesToHereT(T, Boolean) |
Enumerates through all tree nodes from the downmost leaf of the tree down to the provided node node.
If includeThisNode is true, the provided node node is included in the enumeration.
Attention: Since the order of the nodes must be reversed, this enumeration is only efficient for ITreeListNodeT types.
|
| TakeFromLastLeavesToHereT, D(T, D, Boolean, FuncT, D, D) |
Enumerates through all tree nodes from the downmost leaf of the tree down to the provided node node.
Local data is provided for each enumerated node. The local data is calculated from the root node up to the enumerated node.
If includeThisNode is true, the provided node node is included in the enumeration.
Attention: Since the order of the nodes must be reversed, this enumeration is only efficient for ITreeListNodeT types.
|
| TakeFromLeavesToHereT |
Enumerates through all tree nodes from the downmost leaf of the tree down to the provided node node. The provided node node is included in the enumeration.
Attention: Since the order of the nodes must be reversed, this enumeration is only efficient for ITreeListNodeT types.
|
| TakeFromRootToHereT |
Enumerates through all tree nodes from the root node of the tree to (and including) the provided node node.
|
Methods