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
, sorted by key. - 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 theEntry
enum. - 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 theEntry
enum. - An iterator over the values of a
BTreeMap
. - A mutable iterator over the values of a
BTreeMap
. - Cursor
Experimental A cursor over aBTreeMap
. - Cursor
Mut Experimental A cursor over aBTreeMap
with editing operations. - Cursor
MutKey Experimental A cursor over aBTreeMap
with editing operations, and which allows mutating the key of elements. - Extract
If Experimental An iterator produced by callingextract_if
on BTreeMap. - Occupied
Error Experimental The error returned bytry_insert
when the key already exists. - Unordered
KeyError Experimental Error type returned byCursorMut::insert_before
andCursorMut::insert_after
if 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.