commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Thomas Neidhart (JIRA)" <>
Subject [jira] [Commented] (COLLECTIONS-433) TreeList.addAll() complexity
Date Sat, 02 Mar 2013 16:17:13 GMT


Thomas Neidhart commented on COLLECTIONS-433:

Regarding the bug wrt the iterator: I tried to come up with a testcase for this bug but failed.
Do you have one at hand that illustrates the problem? We should also create a separate issue
for this.

The patch also uses an ArrayStack, but this one will at least be deprecated for the 4.0 release
if not removed completely, could you adapt the patch with a different datastructure that is
available either in CC or JDK 1.5+?


> TreeList.addAll() complexity
> ----------------------------
>                 Key: COLLECTIONS-433
>                 URL:
>             Project: Commons Collections
>          Issue Type: Improvement
>    Affects Versions: 3.2.1
>            Reporter: Adrian Nistor
>         Attachments: COLLECTIONS-433.patch
> "TreeList.addAll(Collection coll)" has a higher complexity than
> necessary when "coll" is a "TreeList" object (because "addAll" just
> adds one element at a time).  This can be done in just O(N) as
> described for example here:
> Are there any plans to improve this?

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see:

View raw message