Module std::collections::btree_map  
1.0.0 · source · Expand description
An ordered map based on a B-Tree.
Structs
- CursorExperimentalA cursor over aBTreeMap.
- CursorMutExperimentalA cursor over aBTreeMapwith editing operations.
- ExtractIfExperimentalAn iterator produced by callingextract_ifon BTreeMap.
- OccupiedErrorExperimentalThe error returned bytry_insertwhen the key already exists.
- An ordered map based on a B-Tree.
- An owning iterator over the entries of aBTreeMap.
- An owning iterator over the keys of aBTreeMap.
- An owning iterator over the values of aBTreeMap.
- An iterator over the entries of aBTreeMap.
- A mutable iterator over the entries of aBTreeMap.
- An iterator over the keys of aBTreeMap.
- A view into an occupied entry in aBTreeMap. It is part of theEntryenum.
- An iterator over a sub-range of entries in aBTreeMap.
- A mutable iterator over a sub-range of entries in aBTreeMap.
- A view into a vacant entry in aBTreeMap. It is part of theEntryenum.
- An iterator over the values of aBTreeMap.
- A mutable iterator over the values of aBTreeMap.
Enums
- A view into a single entry in a map, which may either be vacant or occupied.