Expand description
OrderMap
is a hash table where the iteration order of the key-value
pairs is independent of the hash values of the keys.
It is based on IndexMap
, and even shares many of the auxiliary types
like Slice
and all of the iterators.
Unlike IndexMap
, OrderMap
does consider the order for PartialEq
and Eq
, and it also implements PartialOrd
, Ord
, and Hash
.
Methods like OrderMap::remove
use IndexMap
’s “shift” semantics, so
they preserve the relative order of remaining entries.
Re-exports§
pub use self::raw_entry_v1::RawEntryApiV1;
Modules§
- Opt-in access to the experimental raw entry API.
- rayon
rayon
- serde_
seq serde
Functions to serialize and deserialize anOrderMap
as an ordered sequence.
Structs§
- A draining iterator over the entries of an
IndexMap
. - A view into an occupied entry in an
OrderMap
obtained by index. - An owning iterator over the entries of an
IndexMap
. - An owning iterator over the keys of an
IndexMap
. - An owning iterator over the values of an
IndexMap
. - An iterator over the entries of an
IndexMap
. - A mutable iterator over the entries of an
IndexMap
. - A mutable iterator over the entries of an
IndexMap
. - An iterator over the keys of an
IndexMap
. - A hash table where the iteration order of the key-value pairs is independent of the hash values of the keys.
- A dynamically-sized slice of key-value pairs in an
IndexMap
. - A splicing iterator for
IndexMap
. - An iterator over the values of an
IndexMap
. - A mutable iterator over the values of an
IndexMap
.
Enums§
- Entry for an existing key-value pair in an
OrderMap
or a vacant location to insert one.