You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@commons.apache.org by "Stephen Colebourne (JIRA)" <ji...@apache.org> on 2006/05/31 01:04:30 UTC
[jira] Closed: (COLLECTIONS-179) [collections] Implementation of
List with an AVLTree (TreeList)
[ http://issues.apache.org/jira/browse/COLLECTIONS-179?page=all ]
Stephen Colebourne closed COLLECTIONS-179:
------------------------------------------
> [collections] Implementation of List with an AVLTree (TreeList)
> ---------------------------------------------------------------
>
> Key: COLLECTIONS-179
> URL: http://issues.apache.org/jira/browse/COLLECTIONS-179
> Project: Commons Collections
> Type: Improvement
> Environment: Operating System: All
> Platform: All
> Reporter: Joerg Schmuecker
> Priority: Minor
> Fix For: 3.1
> Attachments: TreeList.tar.gz
>
> 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.
--
This message is automatically generated by JIRA.
-
If you think it was sent incorrectly contact one of the administrators:
http://issues.apache.org/jira/secure/Administrators.jspa
-
For more information on JIRA, see:
http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: commons-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: commons-dev-help@jakarta.apache.org