Crate ordermap

OrderMap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys.

Re-exports

pub use set::OrderSet;

Modules

equivalent 🔒

macros 🔒

mutable_keys 🔒

set

A hash set implemented using OrderMap

util 🔒

Macros

dispatch_32_vs_64 🔒

Call self.method(args) with ::<u32> or ::<u64> depending on self size class.

ordermap

Create an OrderMap from a list of key-value pairs

orderset

Create an OrderSet from a list of values

probe_loop 🔒

Structs

Bucket 🔒

Drain

HashValue 🔒

Hash value newtype. Not larger than usize, since anything larger isn’t used for selecting position anyway.

IntoIter

Iter

IterMut

Keys

OccupiedEntry

OrderMap

A hash table where the iteration order of the key-value pairs is independent of the hash values of the keys.

Pos 🔒

Pos is stored in the indices array and it points to the index of a Bucket in self.entries.

ShortHash 🔒

A possibly truncated hash value.

ShortHashProxy 🔒

VacantEntry

Values

ValuesMut

Enums

Entry

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

Inserted 🔒

Traits

Equivalent

Key equivalence trait.

MutableKeys

Opt-in mutable access to keys.

Size 🔒

Trait for the “size class”. Either u32 or u64 depending on the index size needed to address an entry’s indes in self.entries.

Functions

desired_pos 🔒

find_existing_entry_at 🔒

Find, in the indices, an entry that already exists at a known position inside self.entries in the OrderMap.

hash_elem_using 🔒

lo32 🔒

probe_distance 🔒

The number of steps that current is forward of the desired position for hash

split_lo_hi 🔒

to_raw_capacity 🔒

usable_capacity 🔒