Description
Provides efficient hash-based container types for Haskell, such as unordered maps and sets. Hash containers are often faster than ordered structures when key order is not important.
It is useful for lookup tables, caches, indexes, counting, grouping, and data-processing code. Developers should choose good hashable keys and remember that iteration order is not meant to be stable.