23 Feb
2011
23 Feb
'11
9:49 a.m.
On 23 February 2011 12:05, Gregory Collins
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