Generic dictionary from hashable keys to values.

Unlike Dict from the "core" library it is not limited to any specific set of supported types for keys.

Unlike the association list implementations it does not suffer from linear performance characteristics.

Construct an empty HashDict, providing instances of Equality and Hashing explicit typeclasses for key.

Construct HashDict from a list of association pairs, providing instances of Equality and Hashing explicit typeclasses for key.

Construct HashDict from an array of association pairs, providing instances of Equality and Hashing explicit typeclasses for key.

Insert an association pair into dictionary, replacing a value if it already exists.

Remove a key-value pair from a dictionary. If the key is not found, no changes are made.

Update the value of a dictionary for a specific key with a given function.

Lookup a value by key. Returns Nothing, when there is none.

Determine if a dictionary is empty.

Fold over the key-value pairs in the dictionary.

Convert a dictionary into an association list of key-value pairs.