[Haskell-cafe] implementing python-style dictionary in Haskell
bulat.ziganshin at gmail.com
Tue Nov 18 07:03:01 EST 2008
Tuesday, November 18, 2008, 2:46:47 PM, you wrote:
> Why should a Haskell hash table need more memory then a Python hash
> table? I've heard that Data.HashTable is bad, so maybe writing a good
> one could be an option.
about Data.HashTable: it uses one huge array to store all the entries.
the catch is that GC need to scan entire array on every (major) GC.
using array of hashtables may improve situation a lot
plus check GC times for every version: +RTS -Soutfile
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe