[Haskell-cafe] Fwd: signficant improvements to the containers package

[Ketil Malde]

Don Stewart <dons at galois.com> writes:

> Some people might be quite excited by Milan's work on significant
> performance improvements to the containers package...

Yes, this is great news - both a well written article and an important
piece of work on a cornerstone of the Haskell libraries.

But I am also somewhat disturbed that, all this time I've been using
Data.Set/Map, AVL has apparently been a much faster alternative, and I
never got around to trying it out.  Is there a downside to using AVL
compared to Data.Set/Map?  And would similar improvements apply to it?

When performance is starting to matter, it is often because I have large
Sets or Maps - it would also be interesting to compare the memory
requirement of these data structures.  (No matter how much faster a
HashMap is, if it exceeds physical RAM it will be outperformed by any
structure that manages to fit).

-k
-- 
If I haven't seen further, it is by standing in the footprints of giants