Gwern Branwen wrote: >>> You could look at them yourself; I attached the files.
Max Bolingbroke wrote: >> Frankly I am surprised how much "size" gets used. >> It seems that making it fast is more important than >> I thought. Johan Tibell wrote: > IntMap (which shares data structure with HashMap) only hash O(n) size. > I wonder if people avoid using IntMap because of this. Another common usage for Map is as a functional integer-indexed random access array. Once I implemented the standard algorithm for random shuffle of a list using Data.Map Int. It was much nicer than the STArray version, in my opinion. But when I tried switching to Data.IntMap, hoping to make it faster, I was devastatingly disappointed. Now I understand why. -Yitz _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
