Expand description
This crate provides BTree, a fast B+ Tree implementation using integer
keys.
Re-exports§
pub use nonmax;
Structs§
- BTree
- An ordered map based on a B+ Tree.
- Cursor
- A cursor over the elements of a
BTree. - Cursor
Mut - A mutable cursor over the elements of a
BTreewhich allows editing operations. - Into
Iter - An owning iterator over the entries of a
BTree. - Iter
- An iterator over the entries of a
BTree. - IterMut
- A mutable iterator over the entries of a
BTree. - Keys
- An iterator over the keys of a
BTree. - Range
- An iterator over a sub-range of the entries of a
BTree. - Range
Mut - A mutable iterator over a sub-range of the entries of a
BTree. - Values
- An iterator over the values of a
BTree. - Values
Mut - A mutable iterator over the values of a
BTree.