Efficient hashing-based container types

Version on this page:
LTS Haskell 19.18:
Stackage Nightly 2022-08-04:
Latest on Hackage:

See all snapshots unordered-containers appears in

BSD-3-Clause licensed by Johan Tibell
This version can be pinned in stack with:unordered-containers-,4139

Module documentation for

  • Data
    • Data.HashMap
      • Data.HashMap.Lazy
      • Data.HashMap.Strict
    • Data.HashSet

Efficient hashing-based container types. The containers have been optimized for performance critical use, both in terms of large data quantities and high speed.

The declared cost of each operation is either worst-case or amortized, but remains valid even if structures are shared.