Re: summary of storing highly shared data structures

Hi Bulat, The difference between IntMap and HashTable is not large despite -A10m (without this option HashTable is unusable). HashTable: <> IntMap: <> I must admit, though, that my hash function may be bad: data EqKey = EqKey (StableName ()) TypeRep deriving Eq hashKey :: EqKey -> Int32 hashKey (EqKey p t) = HTab.hashInt (hashStableName p) and calling "HashTable.new (==) hashKey". (Adding hashString on show <TypeRep> is worse.) A hash-function for TypeReps would be better. But my IntMap also uses Eq on EqKey ("IntMap [(EqKey, Int)]") Cheers Christian Bulat Ziganshin wrote:

Hello Christian,

Wednesday, January 11, 2006, 5:13:25 PM, you wrote:

CM> It turned out that the IntMap was not slower than the HashTable (What is CM> HashTable good for, then? Why is it so slow?)

see the http://cvs.haskell.org/trac/ghc/ticket/650

and the attached letter. "-A10m" should help in this case