Expand description
An ordered map based on a B-Tree.
Structs§
- BTree
Map - An ordered map based on a B-Tree.
- Into
Iter - An owning iterator over the entries of a
BTreeMap, sorted by key. - Into
Keys - An owning iterator over the keys of a
BTreeMap. - Into
Values - An owning iterator over the values of a
BTreeMap. - Iter
- An iterator over the entries of a
BTreeMap. - IterMut
- A mutable iterator over the entries of a
BTreeMap. - Keys
- An iterator over the keys of a
BTreeMap. - Occupied
Entry - A view into an occupied entry in a
BTreeMap. It is part of theEntryenum. - Range
- An iterator over a sub-range of entries in a
BTreeMap. - Range
Mut - A mutable iterator over a sub-range of entries in a
BTreeMap. - Vacant
Entry - A view into a vacant entry in a
BTreeMap. It is part of theEntryenum. - Values
- An iterator over the values of a
BTreeMap. - Values
Mut - A mutable iterator over the values of a
BTreeMap. - Cursor
Experimental - A cursor over a
BTreeMap. - Cursor
Mut Experimental - A cursor over a
BTreeMapwith editing operations. - Cursor
MutKey Experimental - A cursor over a
BTreeMapwith editing operations, and which allows mutating the key of elements. - Extract
If Experimental - An iterator produced by calling
extract_ifon BTreeMap. - Occupied
Error Experimental - The error returned by
try_insertwhen the key already exists. - Unordered
KeyError Experimental - Error type returned by
CursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys.
Enums§
- Entry
- A view into a single entry in a map, which may either be vacant or occupied.