unordered-containers

Efficient hashing-based container types

https://github.com/tibbe/unordered-containers

Version on this page:0.2.8.0
LTS Haskell 22.43:0.2.20@rev:3
Stackage Nightly 2024-12-05:0.2.20@rev:3
Latest on Hackage:0.2.20@rev:3

See all snapshots unordered-containers appears in

BSD-3-Clause licensed by Johan Tibell
Maintained by [email protected]
This version can be pinned in stack with:unordered-containers-0.2.8.0@sha256:aea434c2e3a4c6de9c656451577d21eabf28acb44b7c4f033a8fe0187ba45667,4304

Module documentation for 0.2.8.0

Depends on 3 packages(full list with versions):
base, deepseq, hashable

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.

Changes

0.2.8.0

  • Add Eq1/2, Show1/2, Read1 instances with base-4.9

  • Eq (HashSet a) doesn’t require Hashable a anymore, only Eq a.

  • Add Hashable1/2 with hashable-1.2.6.0

  • Add differenceWith function.

0.2.7.2

  • Don’t use -fregs-graphs

  • Fix benchmark compilation on stack.

0.2.7.1

  • Fix linker error related to popcnt.

  • Haddock improvements.

  • Fix benchmark compilation when downloaded from Hackage.

0.2.7.0

  • Support criterion 1.1

  • Add unionWithKey for hash maps.

0.2.6.0

  • Mark several modules as Trustworthy.

  • Add Hashable instances for HashMap and HashSet.

  • Add mapMaybe, mapMaybeWithKey, update, alter, and intersectionWithKey.

  • Add roles.

  • Add Hashable and Semigroup instances.

0.2.5.1 (2014-10-11)

  • Support base-4.8