| I am trying to implement data compression code (lzw) and have been using a
| home grown binary tree implementation which runs too slowly.
|
| I would prefer to use a fast/destructive finite map implementation...
| Can anyone recommend one?
What about tries? They are purely functional ;-) and fast. A (real old)
Haskell 1.2 implementation can be found at
http://www.informatik.uni-bonn.de/~ralf/Library/Trie.html
Chris Okasaki's book on Functional Data structures contains further
information. See also,
http://www.cs.columbia.edu/~cdo/papers.html#ml98maps
HTH, Ralf
