Structs
-
BTreeMap
An ordered map based on a [B-Tree].
-
Cursor
A cursor over a
BTreeMap.
-
CursorMut
A cursor over a
BTreeMap with editing operations.
-
CursorMutKey
A cursor over a
BTreeMap with editing operations, and which allows
mutating the key of elements.
-
ExtractIf
This
struct is created by the extract_if method on BTreeMap.
-
ExtractIfInner
Most of the implementation of ExtractIf are generic over the type
of the predicate, thus also serving for BTreeSet::ExtractIf.
-
IntoIter
An owning iterator over the entries of a
BTreeMap, sorted by key.
-
IntoKeys
An owning iterator over the keys of a
BTreeMap.
-
IntoValues
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.
-
OccupiedEntry
A view into an occupied entry in a
BTreeMap.
It is part of the Entry enum.
-
OccupiedError
The error returned by
try_insert when the key already exists.
-
Range
An iterator over a sub-range of entries in a
BTreeMap.
-
RangeMut
A mutable iterator over a sub-range of entries in a
BTreeMap.
-
UnorderedKeyError
Error type returned by
CursorMut::insert_before and
CursorMut::insert_after if the key being inserted is not properly
ordered with regards to adjacent keys.
-
VacantEntry
A view into a vacant entry in a
BTreeMap.
It is part of the Entry enum.
-
Values
An iterator over the values of a
BTreeMap.
-
ValuesMut
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.
Constants
-
MIN_LEN
Minimum number of elements in a node that is not a root.
We might temporarily have fewer elements during methods.