[Haskell-cafe] ANN: TernaryTrees-0.1.1.1 - An efficient ternary tree implementation of Sets and Maps

ajb at spamcop.net ajb at spamcop.net
Mon Jun 29 20:47:32 EDT 2009


G'day all.

Quoting Andrew Coppin <andrewcoppin at btinternet.com>:

> That's just scary. I was just in the middle of writing the exact same
> thing! :-D (I read that very article...)

When you're both done, please compare with the implementation that's
been in Edison for about five years:

http://www.cs.princeton.edu/~rdockins/edison/edison-core/src/Data/Edison/Assoc/

If you've got something that's an improvement (and believe me, it
shouldn't be hard to improve on it), I'm sure that Rob would appreciate
a patch.

Cheers,
Andrew Bromage


More information about the Haskell-Cafe mailing list