Expand description
An ordered map based on a B-Tree.
Structs§
- BTreeMap 
- An ordered map based on a B-Tree.
- 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 theEntryenum.
- 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.
- VacantEntry 
- A view into a vacant entry in a BTreeMap. It is part of theEntryenum.
- 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.
- CursorMut Experimental 
- A cursor over a BTreeMapwith editing operations.
- CursorMutKey Experimental 
- A cursor over a BTreeMapwith editing operations, and which allows mutating the key of elements.
- ExtractIf Experimental 
- An iterator produced by calling extract_ifon BTreeMap.
- OccupiedError Experimental 
- The error returned by try_insertwhen the key already exists.
- UnorderedKeyError Experimental 
- Error type returned by CursorMut::insert_beforeandCursorMut::insert_afterif the key being inserted is not properly ordered with regards to adjacent keys.
Enums§
- Entry
- A view into a single entry in a map, which may either be vacant or occupied.