Expand description
The internally used arbitrary data map type.
It is currently backed by the linked-hash-map
crate’s hash map so that
insertion order is preserved.
Structs
An iterator produced by calling drain_filter
on BTreeMap.
The error returned by try_insert
when the key already exists.
An owning iterator over the entries of a BTreeMap
.
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 the Entry
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 the Entry
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.