On 23 February 2011 12:05, Gregory Collins <[email protected]> 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. Max _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
