Expand description
Immutable, path-addressable tree data structure.
Structs§
- Ancestor
Tree Node Iter - Iterator over all ancestor nodes of the given node.
- Depth
First Descendants Iter - Iterator over descendants of a node
- Half
Edge - Half-edge to another node in the tree.
- Half
Edge Owned - Half-edge to another node in the tree.
- Half
Edge Tree Node - Half-edge to another node in the tree.
- Inner
Node - Intrinsic data of an inner node.
- Leaf
Node - Intrinsic data of a leaf node.
- Node
Inserted OrUpdated - Node
Path Resolved - Parent
Node Updated - Path
Tree - Cheaply clonable path tree structure.
- Subtree
Inserted OrReplaced - Return type when inserting or replacing a subtree.
- Subtree
Removed - Return type when removing a node from the tree.
- Tree
Node - Immutable node in the tree.
- Tree
Node Parent Child Path Conflict - A conflicting path from a parent to a child node.
Enums§
Traits§
- NewNode
Id - Path
Segment - Borrowed path segment.
- Path
Tree Types - Type system for
PathTree
. - Root
Path SegmentedPath
with a root element.- Segmented
Path - Decomposition of a path into segments.