Module iodyn::tree_cursor
[−]
[src]
Incremental Tree Cursor
Tree Cursor for level_tree
- a cursor within an ordered, binary tree
- optimised for splitting and combining trees at the cursor in a cannonical way
- uses non-increasing levels for each subtree to maintain cannonical form
- in the general case the most efficent levels will be drawn from
a negative binomial distribution
Reexports
pub use level_tree::Tree; |
pub use level_tree::gen_branch_level as gen_level; |
Structs
Cursor |
tree cursor, centered on a node of the underlying persistent tree |
IterL | |
IterR |
Enums
Force |
cursor movement qualifier |
UpResult |
Result for |
Traits
DeriveTreeUpdate |
marker that allows a default implementation of TreeUpdate if the data is also |
TreeUpdate |
Used for updating data when the tree is mutated |