Data.HashTable performance
Bernie Pope
florbitous at gmail.com
Wed Apr 6 12:46:27 CEST 2011
On 6 April 2011 20:37, Gregory Collins <greg at gregorycollins.net> wrote:
> On Wed, Apr 6, 2011 at 10:23 AM, Johan Tibell <johan.tibell at gmail.com> wrote:
>> If you want a fast mutable hash table Gregory Collins (CCed) have been
>> working on a few implementations that beat Data.Hashtable by a large
>> margin. I don't know if they're ready for general use yet (i.e. they
>> haven't been released on Hackage yet).
>
> Hi all,
>
> The code:
>
> a) isn't finished
> b) needs to go through my employer's open-source releasing process
>
> But yes, it currently beats Data.Hashtable by something like 4-6x. I
> could work on it with some more urgency if people were interested.
I'm very interested! A mutable hashtable is a key data structure in
berp, the python compiler that I am writing.
Cheers,
Bernie.
More information about the Libraries
mailing list