[Haskell-cafe] ANN: unordered-container

Johan Tibell johan.tibell at gmail.com
Thu May 5 23:02:17 CEST 2011

Hi all,

I've just uploaded a new version of the unordered-containers package,
a package of fast hashing-based container types. Version [1] adds:

* the ability to take the union of two maps,
* lower memory overhead per key/value pair (contributed by Jan-Willem
  Maessen), and
* the beginning of a `Data.HashSet` module (contributed by Bryan

If you want to contribute, you can get the source from the git

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

Alternatively, just fork the project on GitHub [2].

1. http://http://hackage.haskell.org/package/unordered-containers-
2. https://github.com/tibbe/unordered-containers

More information about the Haskell-Cafe mailing list