Improving containers library

[Milan Straka]

Hi all,

I have started an internship in Cambridge and will spend 3 months on
Haskell. One of the possible projects is improving the containers
library. Things I am thinking about:
- measuring the performance of existing implementations (notably Map and
  Set) and possibly improve them (either without or with API changes),
- adding Queue and a PriorityQueue,
- maybe adding a generalized trie,
- maybe adding a hashtable (more like a trie of the hashes, something in
  the line of Ideal hash trees; and maybe a 'classic' hash modifiable in
  the ST monad?)

I would be grateful for any comments, thoughts or wishes.

Milan Straka