commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Stephen Colebourne" <>
Subject Re: [collections] Implementation of List with a tree
Date Tue, 03 Feb 2004 22:14:05 GMT
Sounds interesting. See

Also see Bugzilla for an AVLTree/Set already proposed. (You may want to
reuse this in some way)

What I really need is a good implementation with tests written using the
collections testframework. Plus a reason for including it. (Performance
between Array and Linked is a good reason ;-)

Finally, you must declare that your submission is donated to the Apache
Software Foundation.


----- Original Message -----
From: "Jörg Schmücker" <>
> We have implemented a list based on a tree which allows insertion in log n
> and access in log n.  This means it is not as slow as an ArrayList for the
> insertion of elements anywhere but at the end of the list, and not as slow
> as LinkedList for locating an element.  But not as fast as LinkedList with
> insertion at the end.  It uses an AVL-Tree and offsets to accomplish that.
> I would like to contribute it.  How should I go forward?

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message