I've just uploaded a new version of the unordered-containers package, a package of fast hashing-based container types. Version 0.1.3.0 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.HashSetmodule (contributed by Bryan O'Sullivan).
If you want to contribute, you can get the source from the git repository:
git clone https://github.com/tibbe/unordered-containers.git
Alternatively, just fork the project on GitHub.