Expand description
Indexable containers
This crate contains set and map implementations backed by a balanced binary tree with subtree node count tracking, allowing easy random access by index of the value within the order implied by the set value or map key. Tree nodes are stored on heap using Box.
Features
| Feature | HiSet | HiMap |
|---|---|---|
| Zero allocation initialization | new | todo |
| Insert with automatic conversion | insert | todo |
| Borrow value by index | get_by_index get_by_index_mut | todo |
| Borrow value by key | get get_mut | todo |
| Find index of value by key | index_of | todo |
| Remove first/last entry | take_first take_last | todo |
| Remove entry by index | take_by_index | todo |
| Remove entry by key reference | take | todo |