[Haskell-cafe] ANN: unordered-containers - a new, faster hashing-based containers library

[Roman Cheplyaka]

Hi Johan,

this work is highly appreciated, thanks!

* Johan Tibell <johan.tibell at gmail.com> [2011-02-18 17:38:51-0800]
> Hi all,
> 
> I am delighted to announce the release of preview versions of two new packages:
> 
> unordered-containers 0.1
> Efficient hashing-based container types.
> http://hackage.haskell.org/package/unordered-containers
> 
> hashable 1.1
> Efficient hashing of common types.
> http://hackage.haskell.org/package/hashable
> 
> These packages address a need for faster container types in Haskell,
> especially for string types like ByteString and Text. The package
> achieves better performance by using hashing and a Patricia trie (also
> known as a radix tree), instead of a balanced tree, in its
> implementation.

-- 
Roman I. Cheplyaka :: http://ro-che.info/
Don't worry what people think, they don't do it very often.