Module ordermap::map

source ·
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§

Modules§

Structs§

Enums§

  • Entry for an existing key-value pair in an OrderMap or a vacant location to insert one.

Traits§