[COLLECTIONS-545] Documented runtime complexity of CollectionUtils#removeAll(Collection, Collection).

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/collections/trunk@1654156 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Thomas Neidhart 2015-01-23 09:34:18 +00:00
parent 943e710f7c
commit 5d42c95c33
2 changed files with 9 additions and 0 deletions

View File

@ -22,6 +22,9 @@
<body>
<release version="4.1" date="TBD" description="">
<action issue="COLLECTIONS-545" dev="tn" type="fix" due-to="Oswaldo Olivo">
Documented runtime complexity of "CollectionUtils#removeAll(Collection, Collection).
</action>
<action issue="COLLECTIONS-543" dev="tn" type="fix">
"AbstractCollectionDecorator" doesn't forward equals and hashCode anymore.
</action>

View File

@ -1957,6 +1957,12 @@ public class CollectionUtils {
* in <code>collection</code> unless <code>remove</code> contains <code>e</code>, in which
* case the cardinality is zero. This method is useful if you do not wish to modify
* the collection <code>c</code> and thus cannot call <code>collection.removeAll(remove);</code>.
* <p>
* This implementation iterates over <code>collection</code>, checking each element in
* turn to see if it's contained in <code>remove</code>. If it's not contained, it's added
* to the returned list. As a consequence, it is advised to use a collection type for
* <code>remove</code> that provides a fast (e.g. O(1)) implementation of
* {@link Collection#contains(Object)}.
*
* @param <E> the type of object the {@link Collection} contains
* @param collection the collection from which items are removed (in the returned collection)