Hello Tillmann, 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 -- Best regards, Bulat mailto:[EMAIL PROTECTED] _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
