Crate flat_tree

source ·

Structs

Iterator over a flat-tree.

Functions

Returns both children of a node.
Returns both children of a node, with a depth.
Returns how many nodes are in the tree that the node spans.
Returns how many nodes are in the tree that the node spans, with a depth.
Returns the depth of a node.
Returns a list of all the full roots (subtrees where all nodes have either 2 or 0 children) < index. For example fullRoots(8) returns [3] since the subtree rooted at 3 spans 0 -> 6, and the tree rooted at 7 has a child located at 9 which is >= 8.
Returns the flat-tree of the tree node at the specified depth and offset.
Returns only the left child of a node.
Returns only the left child of a node, with a depth
Returns the left most node in the tree that it spans.
Returns the left most node in the tree that the node spans, with a depth.
Returns the offset of a node.
Returns the offset of a node with a depth.
Returns the parent of a node.
Returns the parent of a node with a depth.
Returns only the left child of a node.
Returns only the left child of a node, with a depth.
Returns the right most node in the tree that the node spans.
Returns the right most node in the tree that the node spans, with a depth.
Returns the sibling of a node.
Returns the sibling of a node with a depth.
Returns the left and right most nodes in the tree that the node spans.
Returns the left and right most nodes in the tree that the node spans, with a depth.
Returns the parent’s sibling, of a node.
Returns the parent’s sibling, of a node, with a depth.