DO NOT REPLY TO THIS EMAIL, BUT PLEASE POST YOUR BUG RELATED COMMENTS THROUGH THE WEB INTERFACE AVAILABLE AT <http://nagoya.apache.org/bugzilla/show_bug.cgi?id=26679>. ANY REPLY MADE TO THIS MESSAGE WILL NOT BE COLLECTED AND INSERTED IN THE BUG DATABASE.
http://nagoya.apache.org/bugzilla/show_bug.cgi?id=26679 Implementation of List with an AVLTree (TreeList) Summary: Implementation of List with an AVLTree (TreeList) Product: Commons Version: unspecified Platform: All OS/Version: All Status: NEW Severity: Normal Priority: Other Component: Collections AssignedTo: [EMAIL PROTECTED] ReportedBy: [EMAIL PROTECTED] The existing Java List implementations are rather slow if it comes to big lists and insertions and/or random access. To mitigate that this List is based on an AVL-Tree and uses offsets to locate objects. The following benchmarks show the performance compared to LinkedList and ArrayList. add insert get TreeList 300 501 110 ArrayList 70 20390 20 LinkedList 50 226636 279742 add - 100K times add( new Object() ) insert - 100k times add( random() * 100K, new Object() ) on a List with 100K elements. get - 100k times get( random() * 100k ) on a List with 200K elements. P.S.: I will try to attach the code as a zip. --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
