DData

[Adrian Hey]

On Tuesday 25 May 2004 10:25 am, Simon Marlow wrote:
> Yes, IntMap should get faster lookup.  I looked at the code and managed
> to make a couple of improvements: adding a 'seq k $' at the beginning of
> lookup helps, and I fixed a small performance problem with the Word
> library, but interestingly these don't help the results.  I still get
> 0.16s for the lookup test, so perhaps it is dominated by something else.

I think yesterdays changes announced by JP Bernardy probably improve
matters a lot if there's any truth in my No. of heap records theory.
Before this change it would have had the same 2 records/tree node
overhead as FiniteMap/DData.Map.

Regards
--
Adrian Hey