Expand description
An ordered map based on a B-Tree.
Structs§
- An ordered map based on a B-Tree.
- A cursor over a
BTreeMap
. - A cursor over a
BTreeMap
with editing operations. - A cursor over a
BTreeMap
with editing operations, and which allows mutating the key of elements. - An iterator produced by calling
extract_if
on BTreeMap. - 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. - The error returned by
try_insert
when the key already exists. - An iterator over a sub-range of entries in a
BTreeMap
. - A mutable iterator over a sub-range of entries in a
BTreeMap
. - Error type returned by
CursorMut::insert_before
andCursorMut::insert_after
if the key being inserted is not properly ordered with regards to adjacent keys. - 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
.
Enums§
- A view into a single entry in a map, which may either be vacant or occupied.