Expand description
Binary tree representing the relationships between Node
s.
Implementation details
The binary tree is stored in a Vec
indexed by NodeIndex
.
The root is always at index 0.
For a given node n:
- left child of n will be at index n * 2 + 1.
- right child of n will be at index n * 2 + 2.
Re-exports
pub use node::Node;
pub use node_index::NodeIndex;
pub use tab_index::TabIndex;
pub use tab_iter::TabIter;
Modules
- Represents an abstract node of a
Tree
. - Wrapper around indices to the collection of nodes inside a
Tree
. - Identifies a tab within a
Node
. - Iterates over all tabs in a
Tree
.
Structs
- Binary tree representing the relationships between
Node
s.
Enums
- Direction in which a new node is created relatively to the parent node at which the split occurs.
- Specify how a tab should be added to a Node.