Expand description
An ordered map based on a B-Tree.
Structs§
- BTree
Map - An ordered map based on a B-Tree.
- Cursor
- A cursor over a
BTreeMap
. - Cursor
Mut - A cursor over a
BTreeMap
with editing operations. - Extract
If - An iterator produced by calling
extract_if
on BTreeMap. - Into
Iter - An owning iterator over the entries of a
BTreeMap
. - 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
. - IterRaw
- A raw iterator over a map where the caller is responsible for ensuring that it doesn’t outlive the data it’s iterating over.
- Keys
- An iterator over the keys of a
BTreeMap
. - Occupied
Entry - A view into an occupied entry in a
BTreeMap
. It is part of theEntry
enum. - Occupied
Error - The error returned by
try_insert
when the key already exists. - 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 theEntry
enum. - Values
- An iterator over the values of a
BTreeMap
. - Values
Mut - A mutable iterator over the values of a
BTreeMap
.
Enums§
- Entry
- A view into a single entry in a map, which may either be vacant or occupied.