21 Apr
2008
21 Apr
'08
5:26 a.m.
On Mon, 2008-04-21 at 09:38 +0200, Milan Straka wrote:
It is difficult to measure these things in Haskell for me (just adding a SPECIALIZE of increasing/decreasing heap size can change order of execution time), but anyway, here are times of 50000 sequential inserts, then 800000 lookups and 50000 deletes (the source is attached for the freaks): Data.Set with \delta=4 180 300 72 Data.Set with \delta=5 208 304 76 Data.Map with \delta=4 212 328 84 Data.Map with \delta=5 256 324 88 IntSet 56 356 48 IntMap 56 360 48
Sorry, I'm confused, what are the columns here exactly? Duncan