DData

[ajb at spamcop.net]

G'day all.

Quoting Adrian Hey <ahey at iee.org>:

> I've just been trying some simple benchmarks of my AVL implementation vs.
> current FiniteMap implementation and using AVL trees seems to about twice
> as fast for insertion. On my machine building an AVL tree of 1000000
> (key,value) pairs takes about 5 seconds, whereas the same takes about 10
> seconds with FiniteMap (the keys are Ints for this test).

Just curious: Have you timed deletions?

Cheers,
Andrew Bromage