Sounds interesting. See
http://jakarta.apache.org/commons/patches.html
Also see Bugzilla for an AVLTree/Set already proposed. (You may want to
reuse this in some way)
http://issues.apache.org/bugzilla/show_bug.cgi?id=22853
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.
Stephen
----- Original Message -----
From: "Jörg Schmücker" <joerg.schmuecker@ekkono.com>
> 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: commons-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-dev-help@jakarta.apache.org
|