Module imbl::hashmap

source ·
Expand description

An unordered map.

An immutable hash map using hash array mapped tries.

Most operations on this map are O(logx 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.

Macros§

  • Construct a hash map from a sequence of key/value pairs.

Structs§

  • A consuming iterator over the elements of a map.
  • An unordered map.
  • A memory pool for the appropriate node type.
  • An iterator over the elements of a map.
  • A mutable iterator over the elements of a map.
  • An iterator over the keys of a map.
  • An entry for a mapping that already exists in the map.
  • An entry for a mapping that does not already exist in the map.
  • An iterator over the values of a map.

Enums§

  • A handle for a key and its associated value.