Module std::collections::btree_map
1.0.0 · source · Expand description
An ordered map based on a B-Tree.
Structs§
- An ordered map based on a B-Tree.
- An owning iterator over the entries of a
BTreeMap. - An owning iterator over the keys of a
BTreeMap. - An owning iterator over the values of a
BTreeMap. - An iterator over the entries of a
BTreeMap. - A mutable iterator over the entries of a
BTreeMap. - An iterator over the keys of a
BTreeMap. - A view into an occupied entry in a
BTreeMap. It is part of theEntryenum. - An iterator over a sub-range of entries in a
BTreeMap. - A mutable iterator over a sub-range of entries in a
BTreeMap. - A view into a vacant entry in a
BTreeMap. It is part of theEntryenum. - An iterator over the values of a
BTreeMap. - A mutable iterator over the values of a
BTreeMap. - CursorExperimentalA cursor over a
BTreeMap. - CursorMutExperimentalA cursor over a
BTreeMapwith editing operations. - CursorMutKeyExperimentalA cursor over a
BTreeMapwith editing operations, and which allows mutating the key of elements. - ExtractIfExperimentalAn iterator produced by calling
extract_ifon BTreeMap. - OccupiedErrorExperimentalThe error returned by
try_insertwhen the key already exists. - UnorderedKeyErrorExperimentalError type returned by
CursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys.
Enums§
- A view into a single entry in a map, which may either be vacant or occupied.