[Haskell-cafe] Boxed Mutable Arrays
brad.larsen at gmail.com
Tue Dec 15 11:16:18 EST 2009
On Tue, Dec 15, 2009 at 11:00 AM, Bulat Ziganshin
<bulat.ziganshin at gmail.com> wrote:
> Hello Brad,
> Tuesday, December 15, 2009, 6:53:14 PM, you wrote:
>>>> How about a fast STHashTable?
>>> you can use array of arrays instead of large array
>> Can you elaborate?
> what exactly? how to implement this or why it will be faster?
> Best regards,
> Bulat mailto:Bulat.Ziganshin at gmail.com
You said to use an array of arrays instead of a large array, in the
context of a fast hash table in ST. Do you mean I should use an array
for hash buckets, rather than a list?
Is that what you meant? And why would it be faster?
If the number of buckets was fixed, one could use an array of STRefs
to lists. I believe this would avoid the bug from Ticket #650?
More information about the Haskell-Cafe