diff --git a/docs/classes/AEG_AEGTree.AEGTree.html b/docs/classes/AEG_AEGTree.AEGTree.html index aeabeca1..3089510a 100644 --- a/docs/classes/AEG_AEGTree.AEGTree.html +++ b/docs/classes/AEG_AEGTree.AEGTree.html @@ -1,7 +1,7 @@
Gets The Sheet of Assertion of this AEGTree.
The Sheet of Assertion of this AEGTree.
-Set The Sheet of Assertion of this AEGTree to the incoming CutNode.
+Set The Sheet of Assertion of this AEGTree to the incoming CutNode.
Incoming CutNode.
-Finds the depth of the node within the tree.
+Finds the lowest node that contains the point in the AEG.
+Finds the parent of the lowest node that contains the point in the AEG.
+Inserts the incoming node into this tree, if insertion is possible.
+Checks if this AEGTree is equal to the incoming AEGTree. These are considered equal if they have the same children and the same number of children in the same hierarchy. In a given CutNode, these children do not have to be in the same order to be considered equal.
incoming AEGTree.
True if the trees are equal by the above metric.
-Removes the node containing the incoming Point.
+Removes the node containing the incoming Point.
Incoming Point.
True if the node containing incomingPoint was removed.
-Returns a string representation of this AEGTree.
+Verifies the structural consistency of this AEGTree.
+Verifies the structural consistency of this AEGTree.
Structural consistency is achieved when: All bounding boxes of The Sheet's children do not overlap, The same is true for each CutNode within The Sheet and that CutNode's children, And none of the children at any cut level overlap each other.
True if structural consistency is achieved.
-
Represents an AEG tree structure. This tree is a hierarchical composition of AtomNodes and CutNodes. Its height corresponds to the deepest CutNode nesting within.
-