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 aBTreeMap, sorted by key.
- 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.
- CursorExperimental A cursor over aBTreeMap.
- CursorMut Experimental A cursor over aBTreeMapwith editing operations.
- CursorMutKey Experimental A cursor over aBTreeMapwith editing operations, and which allows mutating the key of elements.
- ExtractIf Experimental An iterator produced by callingextract_ifon BTreeMap.
- OccupiedError Experimental The error returned bytry_insertwhen the key already exists.
- UnorderedKeyError Experimental Error type returned byCursorMut::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.