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

Felipe Lessa felipe.lessa at gmail.com
Mon Jun 29 14:31:13 EDT 2009

On Tue, Jun 30, 2009 at 03:29:45AM +1000, Alex Mason wrote:
> (being able to insert 230,000+ words, check that all those
> words are actually in the set, write the set out to disk using
> the Data.Binary instance, reading them back in, and checking
> the old and new sets are equal takes about 3.5 seconds on my
> machine).

It would be nice to know how much time the same test takes using
other kinds of containers.


More information about the Haskell-Cafe mailing list