Does anybody knows of an implementation for an efficient dictionary (such
as a hash, an AVL tree, a B-Tree etc. ) in Haskell? Can an array do that?
I'd like something that can map any type to any other type based on a
comparison function, and perhaps a hashing function.
TIA,
Shlomi Fish
----------------------------------------------------------------------
Shlomi Fish [EMAIL PROTECTED]
Home Page: http://t2.technion.ac.il/~shlomif/
Home E-mail: [EMAIL PROTECTED]
The prefix "God Said" has the extraordinary logical property of
converting any statement that follows it into a true one.
_______________________________________________
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
