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

On Wed, Feb 23, 2011 at 3:49 PM, Max Bolingbroke wrote:

On 23 February 2011 12:05, Gregory Collins wrote:

...

I've been working on one lately, some preliminary benchmarks:

   https://gist.github.com/826935

It's probably a month or two away from a releasable state, but my work-in-progress is substantially faster (4-6X) than Data.Hashtable for inserts and lookups.

Sounds cool. Can you use your HashTable in the ST monad? I have often found myself wanting a mutable hashtable as a subcomponent in an externally-pure computation.

Yep, all of the functions are currently in ST. G -- Gregory Collins