Module im::hashmap

An unordered map.

An immutable hash map using [hash array mapped tries] 1.

Most operations on this map are O(log_x n) for a suitably high x that it should be nearly O(1) for most maps. Because of this, it's a great choice for a generic map as long as you don't mind that keys will need to implement Hash and Eq.

Map entries will have a predictable order based on the hasher being used. Unless otherwise specified, this will be the standard RandomState hasher.

Structs

ConsumingIter
HashMap	An unordered map.
Iter
IterMut
Keys
OccupiedEntry	An entry for a mapping that already exists in the map.
VacantEntry	An entry for a mapping that does not already exist in the map.
Values

Enums

Entry

A handle for a key and its associated value.