Efficient hashing-based container types https://github.com/tibbe/unordered-containers
|Version on this page:||0.2.8.0|
|LTS Haskell 15.15:||[email protected]:1|
|Stackage Nightly 2020-06-05:||[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.
Eq (HashSet a)doesn’t require
Hashable aanymore, only
Don’t use -fregs-graphs
Fix benchmark compilation on stack.
Fix linker error related to popcnt.
Fix benchmark compilation when downloaded from Hackage.
Support criterion 1.1
Add unionWithKey for hash maps.
Mark several modules as Trustworthy.
Add Hashable instances for HashMap and HashSet.
Add mapMaybe, mapMaybeWithKey, update, alter, and intersectionWithKey.
Add Hashable and Semigroup instances.
- Support base-4.8