Efficient hashing-based container types https://github.com/tibbe/unordered-containers
|Version on this page:||[email protected]:1|
|LTS Haskell 15.15:||[email protected]:1|
|Stackage Nightly 2020-06-03:||[email protected]:1|
|Latest on Hackage:||[email protected]:1|
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.