Module map
Source pub use entry::Entry;pub use entry::OccupiedEntry;pub use entry::OccupiedError;Experimentalpub use entry::VacantEntry;
- entry 🔒
- BTreeMap
- An ordered map based on a B-Tree.
- 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. - 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. - Values
- An iterator over the values of a
BTreeMap. - ValuesMut
- A mutable iterator over the values of a
BTreeMap. - CursorExperimental
- A cursor over a
BTreeMap. - CursorMutExperimental
- A cursor over a
BTreeMap with editing operations. - CursorMutKeyExperimental
- A cursor over a
BTreeMap with editing operations, and which allows
mutating the key of elements. - ExtractIfExperimental
- An iterator produced by calling
extract_if on BTreeMap. - UnorderedKeyErrorExperimental
- 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.
- MIN_LEN 🔒
- Minimum number of elements in a node that is not a root.
We might temporarily have fewer elements during methods.