Apache
/
commons-collections
mirror of https://github.com/apache/commons-collections.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Remove dead in-line comments.

This commit is contained in:
Gary Gregory 2021-07-10 09:41:23 -04:00
parent 3cbb1dce0b
commit 0b365e4c18
255 changed files with 0 additions and 858 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/org/apache/commons/collections4/BagUtils.java
View File

@ -53,7 +53,6 @@ public class BagUtils {
*/
private BagUtils() {}
//-----------------------------------------------------------------------
/**
* Returns a synchronized (thread-safe) bag backed by the given bag. In
* order to guarantee serial access, it is critical that all access to the
@ -153,7 +152,6 @@ public class BagUtils {
return CollectionBag.collectionBag(bag);
}
//-----------------------------------------------------------------------
/**
* Returns a synchronized (thread-safe) sorted bag backed by the given
* sorted bag. In order to guarantee serial access, it is critical that all

7
src/main/java/org/apache/commons/collections4/CollectionUtils.java
View File

@ -1250,7 +1250,6 @@ public class CollectionUtils {
return outputCollection;
}
//-----------------------------------------------------------------------
/**
* Adds an element to the collection unless the element is null.
*
@ -1580,7 +1579,6 @@ public class CollectionUtils {
}
}
//-----------------------------------------------------------------------
/**
* Null-safe check if the specified collection is empty.
* <p>
@ -1609,7 +1607,6 @@ public class CollectionUtils {
return !isEmpty(coll);
}
//-----------------------------------------------------------------------
/**
* Reverses the order of the given array.
*
@ -1692,7 +1689,6 @@ public class CollectionUtils {
}
}
//-----------------------------------------------------------------------
/**
* Merges two sorted Collections, a and b, into a single, sorted List
* such that the natural ordering of the elements is retained.
@ -1801,7 +1797,6 @@ public class CollectionUtils {
return mergedList;
}
//-----------------------------------------------------------------------
/**
* Returns a {@link Collection} of all the permutations of the input collection.
@ -1833,7 +1828,6 @@ public class CollectionUtils {
return result;
}
//-----------------------------------------------------------------------
/**
* Returns a collection containing all the elements in {@code collection}
* that are also in {@code retain}. The cardinality of an element {@code e}
@ -2048,7 +2042,6 @@ public class CollectionUtils {
return list;
}
//-----------------------------------------------------------------------
/**
* Returns a synchronized collection backed by the given collection.
* <p>

19
src/main/java/org/apache/commons/collections4/IteratorUtils.java
View File

@ -117,7 +117,6 @@ public class IteratorUtils {
private IteratorUtils() {}
// Empty
//-----------------------------------------------------------------------
/**
* Gets an empty iterator.
* <p>
@ -185,7 +184,6 @@ public class IteratorUtils {
}
// Singleton
//-----------------------------------------------------------------------
/**
* Gets a singleton iterator.
* <p>
@ -215,7 +213,6 @@ public class IteratorUtils {
}
// Arrays
//-----------------------------------------------------------------------
/**
* Gets an iterator over an object array.
*
@ -313,7 +310,6 @@ public class IteratorUtils {
return new ArrayIterator<>(array, start, end);
}
//-----------------------------------------------------------------------
/**
* Gets a list iterator over an object array.
*
@ -410,7 +406,6 @@ public class IteratorUtils {
}
// Bounded
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to return at most the given number
* of elements.
@ -450,7 +445,6 @@ public class IteratorUtils {
}
// Unmodifiable
//-----------------------------------------------------------------------
/**
* Gets an immutable version of an {@link Iterator}. The returned object
* will always throw an {@link UnsupportedOperationException} for
@ -493,7 +487,6 @@ public class IteratorUtils {
}
// Chained
//-----------------------------------------------------------------------
/**
* Gets an iterator that iterates through two {@link Iterator}s
@ -540,7 +533,6 @@ public class IteratorUtils {
}
// Collated
//-----------------------------------------------------------------------
/**
* Gets an iterator that provides an ordered iteration over the elements
* contained in a collection of ordered {@link Iterator}s.
@ -617,7 +609,6 @@ public class IteratorUtils {
}
// Object Graph
//-----------------------------------------------------------------------
/**
* Gets an iterator that operates over an object graph.
* <p>
@ -678,7 +669,6 @@ public class IteratorUtils {
}
// Transformed
//-----------------------------------------------------------------------
/**
* Gets an iterator that transforms the elements of another iterator.
* <p>
@ -701,7 +691,6 @@ public class IteratorUtils {
}
// Filtered
//-----------------------------------------------------------------------
/**
* Gets an iterator that filters another iterator.
* <p>
@ -742,7 +731,6 @@ public class IteratorUtils {
}
// Looping
//-----------------------------------------------------------------------
/**
* Gets an iterator that loops continuously over the supplied collection.
* <p>
@ -776,7 +764,6 @@ public class IteratorUtils {
}
// org.w3c.dom.NodeList iterators
//-----------------------------------------------------------------------
/**
* Gets an {@link Iterator} that wraps the specified {@link NodeList}.
* The returned {@link Iterator} can be used for a single iteration.
@ -812,7 +799,6 @@ public class IteratorUtils {
}
// Peeking
//-----------------------------------------------------------------------
/**
* Gets an iterator that supports one-element lookahead.
@ -828,7 +814,6 @@ public class IteratorUtils {
}
// Pushback
//-----------------------------------------------------------------------
/**
* Gets an iterator that supports pushback of elements.
@ -844,7 +829,6 @@ public class IteratorUtils {
}
// Skipping
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to skip the first N elements.
*
@ -861,7 +845,6 @@ public class IteratorUtils {
}
// Zipping
//-----------------------------------------------------------------------
/**
* Returns an iterator that interleaves elements from the decorated iterators.
*
@ -908,7 +891,6 @@ public class IteratorUtils {
}
// Views
//-----------------------------------------------------------------------
/**
* Gets an iterator that provides an iterator view of the given enumeration.
*
@ -1139,7 +1121,6 @@ public class IteratorUtils {
}
// Utility methods
//-----------------------------------------------------------------------
/**
* Applies the closure to each element of the provided iterator.

6
src/main/java/org/apache/commons/collections4/ListUtils.java
View File

@ -47,7 +47,6 @@ public class ListUtils {
*/
private ListUtils() {}
//-----------------------------------------------------------------------
/**
* Returns an immutable empty list if the argument is {@code null},
@ -285,7 +284,6 @@ public class ListUtils {
return hashCode;
}
//-----------------------------------------------------------------------
/**
* Returns a List containing all the elements in {@code collection}
* that are also in {@code retain}. The cardinality of an element {@code e}
@ -352,7 +350,6 @@ public class ListUtils {
return list;
}
//-----------------------------------------------------------------------
/**
* Returns a synchronized list backed by the given list.
* <p>
@ -517,7 +514,6 @@ public class ListUtils {
return FixedSizeList.fixedSizeList(list);
}
//-----------------------------------------------------------------------
/**
* Finds the first index in the given List which matches the given predicate.
* <p>
@ -541,7 +537,6 @@ public class ListUtils {
return CollectionUtils.INDEX_NOT_FOUND;
}
//-----------------------------------------------------------------------
/**
* Returns the longest common subsequence (LCS) of two sequences (lists).
*
@ -655,7 +650,6 @@ public class ListUtils {
}
}
//-----------------------------------------------------------------------
/**
* Returns consecutive {@link List#subList(int, int) sublists} of a
* list, each of the same size (the final list may be smaller). For example,

2
src/main/java/org/apache/commons/collections4/MapIterator.java
View File

@ -66,7 +66,6 @@ public interface MapIterator<K, V> extends Iterator<K> {
@Override
K next();
//-----------------------------------------------------------------------
/**
* Gets the current key, which is the key returned by the last call
* to {@code next()}.
@ -85,7 +84,6 @@ public interface MapIterator<K, V> extends Iterator<K> {
*/
V getValue();
//-----------------------------------------------------------------------
/**
* Removes the last returned key from the underlying {@code Map} (optional operation).
* <p>

1
src/main/java/org/apache/commons/collections4/MultiMap.java
View File

@ -72,7 +72,6 @@ public interface MultiMap<K, V> extends IterableMap<K, Object> {
*/
boolean removeMapping(K key, V item);
//-----------------------------------------------------------------------
/**
* Gets the number of keys in this map.
* <p>

1
src/main/java/org/apache/commons/collections4/MultiSetUtils.java
View File

@ -40,7 +40,6 @@ public class MultiSetUtils {
*/
private MultiSetUtils() {}
//-----------------------------------------------------------------------
/**
* Returns a synchronized (thread-safe) multiset backed by the given multiset.
* In order to guarantee serial access, it is critical that all access to the

1
src/main/java/org/apache/commons/collections4/PredicateUtils.java
View File

@ -518,7 +518,6 @@ public class PredicateUtils {
}
// Transformed
//-----------------------------------------------------------------------
/**
* Creates a predicate that transforms the input object before passing it
* to the predicate.

1
src/main/java/org/apache/commons/collections4/QueueUtils.java
View File

@ -42,7 +42,6 @@ public class QueueUtils {
*/
private QueueUtils() {}
//-----------------------------------------------------------------------
/**
* Returns a synchronized (thread-safe) queue backed by the given queue.

5
src/main/java/org/apache/commons/collections4/SetUtils.java
View File

@ -198,7 +198,6 @@ public class SetUtils {
return set == null ? Collections.<T>emptySet() : set;
}
//-----------------------------------------------------------------------
/**
* Get a typed empty unmodifiable Set.
@ -429,7 +428,6 @@ public class SetUtils {
}
// Set
//-----------------------------------------------------------------------
/**
* Returns a synchronized set backed by the given set.
* <p>
@ -458,7 +456,6 @@ public class SetUtils {
}
// SortedSet
//-----------------------------------------------------------------------
/**
* Returns a synchronized sorted set backed by the given sorted set.
* <p>
@ -551,7 +548,6 @@ public class SetUtils {
}
// Set operations
//-----------------------------------------------------------------------
/**
* Returns a unmodifiable <b>view</b> of the union of the given {@link Set}s.
@ -596,7 +592,6 @@ public class SetUtils {
}
// NavigableSet
//-----------------------------------------------------------------------
/**
* Returns an unmodifiable navigable set backed by the given navigable set.
* <p>

2
src/main/java/org/apache/commons/collections4/SplitMapUtils.java
View File

@ -43,7 +43,6 @@ public class SplitMapUtils {
*/
private SplitMapUtils() {}
//-----------------------------------------------------------------------
private static class WrappedGet<K, V> implements IterableMap<K, V>, Unmodifiable {
private final Get<K, V> get;
@ -219,7 +218,6 @@ public class SplitMapUtils {
}
}
//-----------------------------------------------------------------------
/**
* Get the specified {@link Get} as an instance of {@link IterableMap}.

1
src/main/java/org/apache/commons/collections4/bag/AbstractBagDecorator.java
View File

@ -73,7 +73,6 @@ public abstract class AbstractBagDecorator<E>
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public int getCount(final Object object) {

9
src/main/java/org/apache/commons/collections4/bag/AbstractMapBag.java
View File

@ -80,7 +80,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return map;
}
//-----------------------------------------------------------------------
/**
* Returns the number of elements in this bag.
*
@ -117,7 +116,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return 0;
}
//-----------------------------------------------------------------------
/**
* Determines if the bag contains the given element by checking if the
* underlying map contains the element as a key.
@ -162,7 +160,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return true;
}
//-----------------------------------------------------------------------
/**
* Gets an iterator over the bag elements. Elements present in the Bag more
* than once will be returned repeatedly.
@ -239,7 +236,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
}
}
//-----------------------------------------------------------------------
/**
* Adds a new element to the bag, incrementing its count in the underlying map.
*
@ -290,7 +286,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return changed;
}
//-----------------------------------------------------------------------
/**
* Clears the bag by clearing the underlying map.
*/
@ -409,7 +404,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return result;
}
//-----------------------------------------------------------------------
/**
* Mutable integer class for storing the data.
*/
@ -439,7 +433,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
}
}
//-----------------------------------------------------------------------
/**
* Returns an array of all of this bag's elements.
*
@ -510,7 +503,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
return uniqueSet;
}
//-----------------------------------------------------------------------
/**
* Write the map out using a custom routine.
* @param out the output stream
@ -545,7 +537,6 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
}
}
//-----------------------------------------------------------------------
/**
* Compares this Bag to another. This Bag equals another Bag if it contains
* the same number of occurrences of the same elements.

1
src/main/java/org/apache/commons/collections4/bag/AbstractSortedBagDecorator.java
View File

@ -62,7 +62,6 @@ public abstract class AbstractSortedBagDecorator<E>
return (SortedBag<E>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public E first() {

6
src/main/java/org/apache/commons/collections4/bag/CollectionBag.java
View File

@ -56,7 +56,6 @@ public final class CollectionBag<E> extends AbstractBagDecorator<E> {
return new CollectionBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -67,7 +66,6 @@ public final class CollectionBag<E> extends AbstractBagDecorator<E> {
super(bag);
}
//-----------------------------------------------------------------------
/**
* Write the collection out using a custom routine.
*
@ -93,9 +91,7 @@ public final class CollectionBag<E> extends AbstractBagDecorator<E> {
setCollection((Collection<E>) in.readObject());
}
//-----------------------------------------------------------------------
// Collection interface
//-----------------------------------------------------------------------
/**
* <i>(Change)</i>
@ -218,9 +214,7 @@ public final class CollectionBag<E> extends AbstractBagDecorator<E> {
return decorated().retainAll(null);
}
//-----------------------------------------------------------------------
// Bag interface
//-----------------------------------------------------------------------
/**
* <i>(Change)</i>

6
src/main/java/org/apache/commons/collections4/bag/CollectionSortedBag.java
View File

@ -47,7 +47,6 @@ public final class CollectionSortedBag<E> extends AbstractSortedBagDecorator<E>
return new CollectionSortedBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -58,7 +57,6 @@ public final class CollectionSortedBag<E> extends AbstractSortedBagDecorator<E>
super(bag);
}
//-----------------------------------------------------------------------
/**
* Write the collection out using a custom routine.
*
@ -84,9 +82,7 @@ public final class CollectionSortedBag<E> extends AbstractSortedBagDecorator<E>
setCollection((Collection<E>) in.readObject());
}
//-----------------------------------------------------------------------
// Collection interface
//-----------------------------------------------------------------------
@Override
public boolean containsAll(final Collection<?> coll) {
@ -153,9 +149,7 @@ public final class CollectionSortedBag<E> extends AbstractSortedBagDecorator<E>
return decorated().retainAll(null);
}
//-----------------------------------------------------------------------
// Bag interface
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int count) {

1
src/main/java/org/apache/commons/collections4/bag/HashBag.java
View File

@ -59,7 +59,6 @@ public class HashBag<E> extends AbstractMapBag<E> implements Serializable {
addAll(coll);
}
//-----------------------------------------------------------------------
/**
* Write the bag out using a custom routine.
*

2
src/main/java/org/apache/commons/collections4/bag/PredicatedBag.java
View File

@ -66,7 +66,6 @@ public class PredicatedBag<E> extends PredicatedCollection<E> implements Bag<E>
return new PredicatedBag<>(bag, predicate);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -102,7 +101,6 @@ public class PredicatedBag<E> extends PredicatedCollection<E> implements Bag<E>
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int count) {

2
src/main/java/org/apache/commons/collections4/bag/PredicatedSortedBag.java
View File

@ -65,7 +65,6 @@ public class PredicatedSortedBag<E> extends PredicatedBag<E> implements SortedBa
return new PredicatedSortedBag<>(bag, predicate);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>If there are any elements already in the bag being decorated, they
@ -90,7 +89,6 @@ public class PredicatedSortedBag<E> extends PredicatedBag<E> implements SortedBa
return (SortedBag<E>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public E first() {

3
src/main/java/org/apache/commons/collections4/bag/SynchronizedBag.java
View File

@ -53,7 +53,6 @@ public class SynchronizedBag<E> extends SynchronizedCollection<E> implements Bag
return new SynchronizedBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -101,7 +100,6 @@ public class SynchronizedBag<E> extends SynchronizedCollection<E> implements Bag
}
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int count) {
@ -132,7 +130,6 @@ public class SynchronizedBag<E> extends SynchronizedCollection<E> implements Bag
}
}
//-----------------------------------------------------------------------
/**
* Synchronized Set for the Bag class.
*/

2
src/main/java/org/apache/commons/collections4/bag/SynchronizedSortedBag.java
View File

@ -53,7 +53,6 @@ public class SynchronizedSortedBag<E> extends SynchronizedBag<E> implements Sort
return new SynchronizedSortedBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -84,7 +83,6 @@ public class SynchronizedSortedBag<E> extends SynchronizedBag<E> implements Sort
return (SortedBag<E>) decorated();
}
//-----------------------------------------------------------------------
@Override
public synchronized E first() {

3
src/main/java/org/apache/commons/collections4/bag/TransformedBag.java
View File

@ -88,7 +88,6 @@ public class TransformedBag<E> extends TransformedCollection<E> implements Bag<E
return decorated;
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -122,7 +121,6 @@ public class TransformedBag<E> extends TransformedCollection<E> implements Bag<E
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public int getCount(final Object object) {
@ -134,7 +132,6 @@ public class TransformedBag<E> extends TransformedCollection<E> implements Bag<E
return getBag().remove(object, nCopies);
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int nCopies) {

2
src/main/java/org/apache/commons/collections4/bag/TransformedSortedBag.java
View File

@ -89,7 +89,6 @@ public class TransformedSortedBag<E> extends TransformedBag<E> implements Sorted
return decorated;
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -113,7 +112,6 @@ public class TransformedSortedBag<E> extends TransformedBag<E> implements Sorted
return (SortedBag<E>) decorated();
}
//-----------------------------------------------------------------------
@Override
public E first() {

3
src/main/java/org/apache/commons/collections4/bag/TreeBag.java
View File

@ -77,7 +77,6 @@ public class TreeBag<E> extends AbstractMapBag<E> implements SortedBag<E>, Seria
addAll(coll);
}
//-----------------------------------------------------------------------
/**
* {@inheritDoc}
*
@ -96,7 +95,6 @@ public class TreeBag<E> extends AbstractMapBag<E> implements SortedBag<E>, Seria
return super.add(object);
}
//-----------------------------------------------------------------------
@Override
public E first() {
@ -118,7 +116,6 @@ public class TreeBag<E> extends AbstractMapBag<E> implements SortedBag<E>, Seria
return (SortedMap<E, AbstractMapBag.MutableInteger>) super.getMap();
}
//-----------------------------------------------------------------------
/**
* Write the bag out using a custom routine.
*

4
src/main/java/org/apache/commons/collections4/bag/UnmodifiableBag.java
View File

@ -67,7 +67,6 @@ public final class UnmodifiableBag<E>
return new UnmodifiableBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -79,7 +78,6 @@ public final class UnmodifiableBag<E>
super((Bag<E>) bag);
}
//-----------------------------------------------------------------------
/**
* Write the collection out using a custom routine.
*
@ -105,7 +103,6 @@ public final class UnmodifiableBag<E>
setCollection((Collection<E>) in.readObject());
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
return UnmodifiableIterator.<E>unmodifiableIterator(decorated().iterator());
@ -149,7 +146,6 @@ public final class UnmodifiableBag<E>
throw new UnsupportedOperationException();
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int count) {
throw new UnsupportedOperationException();

4
src/main/java/org/apache/commons/collections4/bag/UnmodifiableSortedBag.java
View File

@ -65,7 +65,6 @@ public final class UnmodifiableSortedBag<E>
return new UnmodifiableSortedBag<>(bag);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -76,7 +75,6 @@ public final class UnmodifiableSortedBag<E>
super(bag);
}
//-----------------------------------------------------------------------
/**
* Write the collection out using a custom routine.
*
@ -102,7 +100,6 @@ public final class UnmodifiableSortedBag<E>
setCollection((Collection<E>) in.readObject());
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
return UnmodifiableIterator.unmodifiableIterator(decorated().iterator());
@ -146,7 +143,6 @@ public final class UnmodifiableSortedBag<E>
throw new UnsupportedOperationException();
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object, final int count) {
throw new UnsupportedOperationException();

1
src/main/java/org/apache/commons/collections4/bidimap/AbstractBidiMapDecorator.java
View File

@ -63,7 +63,6 @@ public abstract class AbstractBidiMapDecorator<K, V>
return (BidiMap<K, V>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public MapIterator<K, V> mapIterator() {
return decorated().mapIterator();

8
src/main/java/org/apache/commons/collections4/bidimap/AbstractDualBidiMap.java
View File

@ -131,7 +131,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
protected abstract BidiMap<V, K> createBidiMap(Map<V, K> normalMap, Map<K, V> reverseMap, BidiMap<K, V> inverseMap);
// Map delegation
//-----------------------------------------------------------------------
@Override
public V get(final Object key) {
@ -169,7 +168,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
// BidiMap changes
//-----------------------------------------------------------------------
@Override
public V put(final K key, final V value) {
@ -213,7 +211,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
// BidiMap
//-----------------------------------------------------------------------
/**
* Obtains a {@code MapIterator} over the map.
* The iterator implements {@link BidiMapIterator}.
@ -251,7 +248,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
// Map views
//-----------------------------------------------------------------------
/**
* Gets a keySet view of the map.
* Changes made on the view are reflected in the map.
@ -334,7 +330,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
return new EntrySetIterator<>(iterator, this);
}
//-----------------------------------------------------------------------
/**
* Inner class View.
*/
@ -436,7 +431,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
}
//-----------------------------------------------------------------------
/**
* Inner class KeySet.
*/
@ -520,7 +514,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
}
//-----------------------------------------------------------------------
/**
* Inner class Values.
*/
@ -604,7 +597,6 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
}
}
//-----------------------------------------------------------------------
/**
* Inner class EntrySet.
*/

1
src/main/java/org/apache/commons/collections4/bidimap/AbstractOrderedBidiMapDecorator.java
View File

@ -61,7 +61,6 @@ public abstract class AbstractOrderedBidiMapDecorator<K, V>
return (OrderedBidiMap<K, V>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public OrderedMapIterator<K, V> mapIterator() {
return decorated().mapIterator();

1
src/main/java/org/apache/commons/collections4/bidimap/AbstractSortedBidiMapDecorator.java
View File

@ -62,7 +62,6 @@ public abstract class AbstractSortedBidiMapDecorator<K, V>
return (SortedBidiMap<K, V>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public SortedBidiMap<V, K> inverseBidiMap() {
return decorated().inverseBidiMap();

1
src/main/java/org/apache/commons/collections4/bidimap/DualHashBidiMap.java
View File

@ -93,7 +93,6 @@ public class DualHashBidiMap<K, V> extends AbstractDualBidiMap<K, V> implements
}
// Serialization
//-----------------------------------------------------------------------
private void writeObject(final ObjectOutputStream out) throws IOException {
out.defaultWriteObject();
out.writeObject(normalMap);

1
src/main/java/org/apache/commons/collections4/bidimap/DualLinkedHashBidiMap.java
View File

@ -87,7 +87,6 @@ public class DualLinkedHashBidiMap<K, V> extends AbstractDualBidiMap<K, V> imple
}
// Serialization
//-----------------------------------------------------------------------
private void writeObject(final ObjectOutputStream out) throws IOException {
out.defaultWriteObject();
out.writeObject(normalMap);

6
src/main/java/org/apache/commons/collections4/bidimap/DualTreeBidiMap.java
View File

@ -130,7 +130,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
return new DualTreeBidiMap<>(normalMap, reverseMap, inverseMap);
}
//-----------------------------------------------------------------------
@Override
public Comparator<? super K> comparator() {
@ -185,7 +184,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
return hm.lastKey();
}
//-----------------------------------------------------------------------
/**
* Obtains an ordered map iterator.
* <p>
@ -207,7 +205,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
return inverseBidiMap();
}
//-----------------------------------------------------------------------
@Override
public SortedMap<K, V> headMap(final K toKey) {
@ -232,7 +229,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
return (SortedBidiMap<V, K>) super.inverseBidiMap();
}
//-----------------------------------------------------------------------
/**
* Internal sorted map view.
*/
@ -295,7 +291,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* Inner class MapIterator.
*/
@ -400,7 +395,6 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
}
// Serialization
//-----------------------------------------------------------------------
private void writeObject(final ObjectOutputStream out) throws IOException {
out.defaultWriteObject();
out.writeObject(normalMap);

19
src/main/java/org/apache/commons/collections4/bidimap/TreeBidiMap.java
View File

@ -116,7 +116,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
private transient Set<Map.Entry<K, V>> entrySet;
private transient Inverse inverse;
//-----------------------------------------------------------------------
/**
* Constructs a new empty TreeBidiMap.
*/
@ -138,7 +137,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
putAll(map);
}
//-----------------------------------------------------------------------
/**
* Returns the number of key-value mappings in this map.
*
@ -283,7 +281,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
rootNode[VALUE.ordinal()] = null;
}
//-----------------------------------------------------------------------
/**
* Returns the key to which this map maps the specified value.
* Returns null if the map contains no mapping for this value.
@ -319,7 +316,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return doRemoveValue(value);
}
//-----------------------------------------------------------------------
/**
* Gets the first (lowest) key currently in this map.
*
@ -378,7 +374,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return node == null ? null : node.getKey();
}
//-----------------------------------------------------------------------
/**
* Returns a set view of the keys contained in this map in key order.
* <p>
@ -399,7 +394,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return keySet;
}
//-----------------------------------------------------------------------
/**
* Returns a set view of the values contained in this map in key order.
* The returned object can be cast to a Set.
@ -421,7 +415,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return valuesSet;
}
//-----------------------------------------------------------------------
/**
* Returns a set view of the entries contained in this map in key order.
* For simple iteration through the map, the MapIterator is quicker.
@ -444,7 +437,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return entrySet;
}
//-----------------------------------------------------------------------
@Override
public OrderedMapIterator<K, V> mapIterator() {
if (isEmpty()) {
@ -453,7 +445,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return new ViewMapIterator(KEY);
}
//-----------------------------------------------------------------------
/**
* Gets the inverse map for comparison.
*
@ -467,7 +458,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return inverse;
}
//-----------------------------------------------------------------------
/**
* Compares for equals as per the API.
*
@ -499,7 +489,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return this.doToString(KEY);
}
//-----------------------------------------------------------------------
/**
* Puts logic.
*
@ -683,7 +672,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
return rval;
}
//-----------------------------------------------------------------------
/**
* Compares two objects.
@ -1349,7 +1337,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
/**
* Compares for equals as per the API.
*
@ -1482,7 +1469,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
/**
* A view of this map.
*/
@ -1646,7 +1632,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
/**
* An iterator over the map.
*/
@ -1730,7 +1715,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
/**
* An iterator over the map.
*/
@ -1873,8 +1857,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
//-----------------------------------------------------------------------
/**
* A node used to store the data.
*/
@ -2099,7 +2081,6 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
}
}
//-----------------------------------------------------------------------
/**
* The inverse map implementation.
*/

3
src/main/java/org/apache/commons/collections4/bidimap/UnmodifiableBidiMap.java
View File

@ -63,7 +63,6 @@ public final class UnmodifiableBidiMap<K, V>
return new UnmodifiableBidiMap<>(map);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -75,7 +74,6 @@ public final class UnmodifiableBidiMap<K, V>
super((BidiMap<K, V>) map);
}
//-----------------------------------------------------------------------
@Override
public void clear() {
throw new UnsupportedOperationException();
@ -114,7 +112,6 @@ public final class UnmodifiableBidiMap<K, V>
return UnmodifiableSet.unmodifiableSet(set);
}
//-----------------------------------------------------------------------
@Override
public K removeValue(final Object value) {
throw new UnsupportedOperationException();

4
src/main/java/org/apache/commons/collections4/bidimap/UnmodifiableOrderedBidiMap.java
View File

@ -64,7 +64,6 @@ public final class UnmodifiableOrderedBidiMap<K, V>
return new UnmodifiableOrderedBidiMap<>(map);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -76,7 +75,6 @@ public final class UnmodifiableOrderedBidiMap<K, V>
super((OrderedBidiMap<K, V>) map);
}
//-----------------------------------------------------------------------
@Override
public void clear() {
throw new UnsupportedOperationException();
@ -115,7 +113,6 @@ public final class UnmodifiableOrderedBidiMap<K, V>
return UnmodifiableSet.unmodifiableSet(set);
}
//-----------------------------------------------------------------------
@Override
public K removeValue(final Object value) {
throw new UnsupportedOperationException();
@ -126,7 +123,6 @@ public final class UnmodifiableOrderedBidiMap<K, V>
return inverseOrderedBidiMap();
}
//-----------------------------------------------------------------------
@Override
public OrderedMapIterator<K, V> mapIterator() {
final OrderedMapIterator<K, V> it = decorated().mapIterator();

5
src/main/java/org/apache/commons/collections4/bidimap/UnmodifiableSortedBidiMap.java
View File

@ -65,7 +65,6 @@ public final class UnmodifiableSortedBidiMap<K, V>
return new UnmodifiableSortedBidiMap<>(map);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -77,7 +76,6 @@ public final class UnmodifiableSortedBidiMap<K, V>
super((SortedBidiMap<K, V>) map);
}
//-----------------------------------------------------------------------
@Override
public void clear() {
throw new UnsupportedOperationException();
@ -116,20 +114,17 @@ public final class UnmodifiableSortedBidiMap<K, V>
return UnmodifiableSet.unmodifiableSet(set);
}
//-----------------------------------------------------------------------
@Override
public K removeValue(final Object value) {
throw new UnsupportedOperationException();
}
//-----------------------------------------------------------------------
@Override
public OrderedMapIterator<K, V> mapIterator() {
final OrderedMapIterator<K, V> it = decorated().mapIterator();
return UnmodifiableOrderedMapIterator.unmodifiableOrderedMapIterator(it);
}
//-----------------------------------------------------------------------
@Override
public SortedBidiMap<V, K> inverseBidiMap() {
if (inverse == null) {

1
src/main/java/org/apache/commons/collections4/collection/AbstractCollectionDecorator.java
View File

@ -103,7 +103,6 @@ public abstract class AbstractCollectionDecorator<E>
this.collection = coll;
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object) {

4
src/main/java/org/apache/commons/collections4/collection/CompositeCollection.java
View File

@ -86,7 +86,6 @@ public class CompositeCollection<E> implements Collection<E>, Serializable {
addComposited(compositeCollections);
}
//-----------------------------------------------------------------------
/**
* Gets the size of this composite collection.
* <p>
@ -368,7 +367,6 @@ public class CompositeCollection<E> implements Collection<E>, Serializable {
}
}
//-----------------------------------------------------------------------
/**
* Specify a CollectionMutator strategy instance to handle changes.
*
@ -427,7 +425,6 @@ public class CompositeCollection<E> implements Collection<E>, Serializable {
all.remove(coll);
}
//-----------------------------------------------------------------------
/**
* Returns a new collection containing all of the elements
*
@ -455,7 +452,6 @@ public class CompositeCollection<E> implements Collection<E>, Serializable {
return mutator;
}
//-----------------------------------------------------------------------
/**
* Pluggable strategy to handle changes to the composite.
*

1
src/main/java/org/apache/commons/collections4/collection/IndexedCollection.java
View File

@ -257,7 +257,6 @@ public class IndexedCollection<K, C> extends AbstractCollectionDecorator<C> {
return changed;
}
//-----------------------------------------------------------------------
/**
* Provides checking for adding the index.

2
src/main/java/org/apache/commons/collections4/collection/PredicatedCollection.java
View File

@ -109,7 +109,6 @@ public class PredicatedCollection<E> extends AbstractCollectionDecorator<E> {
return new PredicatedCollection<>(coll, predicate);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -145,7 +144,6 @@ public class PredicatedCollection<E> extends AbstractCollectionDecorator<E> {
}
}
//-----------------------------------------------------------------------
/**
* Override to validate the object being added to ensure it matches
* the predicate.

2
src/main/java/org/apache/commons/collections4/collection/SynchronizedCollection.java
View File

@ -64,7 +64,6 @@ public class SynchronizedCollection<E> implements Collection<E>, Serializable {
return new SynchronizedCollection<>(coll);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -97,7 +96,6 @@ public class SynchronizedCollection<E> implements Collection<E>, Serializable {
return collection;
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object) {

2
src/main/java/org/apache/commons/collections4/collection/TransformedCollection.java
View File

@ -96,7 +96,6 @@ public class TransformedCollection<E> extends AbstractCollectionDecorator<E> {
return decorated;
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -140,7 +139,6 @@ public class TransformedCollection<E> extends AbstractCollectionDecorator<E> {
return list;
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object) {
return decorated().add(transform(object));

2
src/main/java/org/apache/commons/collections4/collection/UnmodifiableBoundedCollection.java
View File

@ -115,7 +115,6 @@ public final class UnmodifiableBoundedCollection<E> extends AbstractCollectionDe
super((BoundedCollection<E>) coll);
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
return UnmodifiableIterator.unmodifiableIterator(decorated().iterator());
@ -159,7 +158,6 @@ public final class UnmodifiableBoundedCollection<E> extends AbstractCollectionDe
throw new UnsupportedOperationException();
}
//-----------------------------------------------------------------------
@Override
public boolean isFull() {
return decorated().isFull();

2
src/main/java/org/apache/commons/collections4/collection/UnmodifiableCollection.java
View File

@ -62,7 +62,6 @@ public final class UnmodifiableCollection<E>
return new UnmodifiableCollection<>(coll);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -74,7 +73,6 @@ public final class UnmodifiableCollection<E>
super((Collection<E>) coll);
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
return UnmodifiableIterator.unmodifiableIterator(decorated().iterator());

5
src/main/java/org/apache/commons/collections4/comparators/BooleanComparator.java
View File

@ -43,7 +43,6 @@ public final class BooleanComparator implements Comparator<Boolean>, Serializabl
/** {@code true} iff {@code true} values sort before {@code false} values. */
private final boolean trueFirst;
//-----------------------------------------------------------------------
/**
* Returns a BooleanComparator instance that sorts
* {@code true} values before {@code false} values.
@ -99,7 +98,6 @@ public final class BooleanComparator implements Comparator<Boolean>, Serializabl
return trueFirst ? TRUE_FIRST : FALSE_FIRST;
}
//-----------------------------------------------------------------------
/**
* Creates a {@code BooleanComparator} that sorts
* {@code false} values before {@code true} values.
@ -126,7 +124,6 @@ public final class BooleanComparator implements Comparator<Boolean>, Serializabl
this.trueFirst = trueFirst;
}
//-----------------------------------------------------------------------
/**
* Compares two non-{@code null} {@code Boolean} objects
* according to the value of {@link #sortsTrueFirst()}.
@ -144,7 +141,6 @@ public final class BooleanComparator implements Comparator<Boolean>, Serializabl
return (v1 ^ v2) ? ( (v1 ^ trueFirst) ? 1 : -1 ) : 0;
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.
@ -176,7 +172,6 @@ public final class BooleanComparator implements Comparator<Boolean>, Serializabl
(this.trueFirst == ((BooleanComparator) object).trueFirst));
}
//-----------------------------------------------------------------------
/**
* Returns {@code true} iff
* I sort {@code true} values before

4
src/main/java/org/apache/commons/collections4/comparators/ComparableComparator.java
View File

@ -51,7 +51,6 @@ public class ComparableComparator<E extends Comparable<? super E>> implements Co
@SuppressWarnings("rawtypes")
public static final ComparableComparator INSTANCE = new ComparableComparator();
//-----------------------------------------------------------------------
/**
* Gets the singleton instance of a ComparableComparator.
* <p>
@ -67,7 +66,6 @@ public class ComparableComparator<E extends Comparable<? super E>> implements Co
return INSTANCE;
}
//-----------------------------------------------------------------------
/**
* Constructor whose use should be avoided.
* <p>
@ -76,7 +74,6 @@ public class ComparableComparator<E extends Comparable<? super E>> implements Co
public ComparableComparator() {
}
//-----------------------------------------------------------------------
/**
* Compare the two {@link Comparable Comparable} arguments.
* This method is equivalent to:
@ -95,7 +92,6 @@ public class ComparableComparator<E extends Comparable<? super E>> implements Co
return obj1.compareTo(obj2);
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.

4
src/main/java/org/apache/commons/collections4/comparators/ComparatorChain.java
View File

@ -62,7 +62,6 @@ public class ComparatorChain<E> implements Comparator<E>, Serializable {
/** Whether the chain has been "locked". */
private boolean isLocked;
//-----------------------------------------------------------------------
/**
* Construct a ComparatorChain with no Comparators.
* You must add at least one Comparator before calling
@ -131,7 +130,6 @@ public class ComparatorChain<E> implements Comparator<E>, Serializable {
orderingBits = bits;
}
//-----------------------------------------------------------------------
/**
* Add a Comparator to the end of the chain using the
* forward sort order
@ -256,7 +254,6 @@ public class ComparatorChain<E> implements Comparator<E>, Serializable {
}
}
//-----------------------------------------------------------------------
/**
* Perform comparisons on the Objects as per
* Comparator.compare(o1,o2).
@ -296,7 +293,6 @@ public class ComparatorChain<E> implements Comparator<E>, Serializable {
return 0;
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.

5
src/main/java/org/apache/commons/collections4/comparators/FixedOrderComparator.java
View File

@ -76,7 +76,6 @@ public class FixedOrderComparator<T> implements Comparator<T>, Serializable {
private UnknownObjectBehavior unknownObjectBehavior = UnknownObjectBehavior.EXCEPTION;
// Constructors
//-----------------------------------------------------------------------
/**
* Constructs an empty FixedOrderComparator.
*/
@ -114,7 +113,6 @@ public class FixedOrderComparator<T> implements Comparator<T>, Serializable {
}
// Bean methods / state querying methods
//-----------------------------------------------------------------------
/**
* Returns true if modifications cannot be made to the FixedOrderComparator.
* FixedOrderComparators cannot be modified once they have performed a comparison.
@ -160,7 +158,6 @@ public class FixedOrderComparator<T> implements Comparator<T>, Serializable {
}
// Methods for adding items
//-----------------------------------------------------------------------
/**
* Adds an item, which compares as after all items known to the Comparator.
* If the item is already known to the Comparator, its old position is
@ -201,7 +198,6 @@ public class FixedOrderComparator<T> implements Comparator<T>, Serializable {
}
// Comparator methods
//-----------------------------------------------------------------------
/**
* Compares two objects according to the order of this Comparator.
* <p>
@ -239,7 +235,6 @@ public class FixedOrderComparator<T> implements Comparator<T>, Serializable {
return position1.compareTo(position2);
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.

3
src/main/java/org/apache/commons/collections4/comparators/NullComparator.java
View File

@ -45,7 +45,6 @@ public class NullComparator<E> implements Comparator<E>, Serializable {
**/
private final boolean nullsAreHigh;
//-----------------------------------------------------------------------
/**
* Construct an instance that sorts {@code null} higher than any
* non-{@code null} object it is compared with. When comparing two
@ -113,7 +112,6 @@ public class NullComparator<E> implements Comparator<E>, Serializable {
this.nullsAreHigh = nullsAreHigh;
}
//-----------------------------------------------------------------------
/**
* Perform a comparison between two objects. If both objects are
* {@code null}, a {@code 0} value is returned. If one object
@ -144,7 +142,6 @@ public class NullComparator<E> implements Comparator<E>, Serializable {
return this.nonNullComparator.compare(o1, o2);
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object)}.

3
src/main/java/org/apache/commons/collections4/comparators/ReverseComparator.java
View File

@ -38,7 +38,6 @@ public class ReverseComparator<E> implements Comparator<E>, Serializable {
/** The comparator being decorated. */
private final Comparator<? super E> comparator;
//-----------------------------------------------------------------------
/**
* Creates a comparator that compares objects based on the inverse of their
* natural ordering. Using this Constructor will create a ReverseComparator
@ -63,7 +62,6 @@ public class ReverseComparator<E> implements Comparator<E>, Serializable {
this.comparator = comparator == null ? ComparatorUtils.NATURAL_COMPARATOR : comparator;
}
//-----------------------------------------------------------------------
/**
* Compares two objects in reverse order.
*
@ -76,7 +74,6 @@ public class ReverseComparator<E> implements Comparator<E>, Serializable {
return comparator.compare(obj2, obj1);
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.

3
src/main/java/org/apache/commons/collections4/comparators/TransformingComparator.java
View File

@ -48,7 +48,6 @@ public class TransformingComparator<I, O> implements Comparator<I>, Serializable
/** The transformer being used. */
private final Transformer<? super I, ? extends O> transformer;
//-----------------------------------------------------------------------
/**
* Constructs an instance with the given Transformer and a
* {@link ComparableComparator ComparableComparator}.
@ -71,7 +70,6 @@ public class TransformingComparator<I, O> implements Comparator<I>, Serializable
this.transformer = transformer;
}
//-----------------------------------------------------------------------
/**
* Returns the result of comparing the values from the transform operation.
*
@ -86,7 +84,6 @@ public class TransformingComparator<I, O> implements Comparator<I>, Serializable
return this.decorated.compare(value1, value2);
}
//-----------------------------------------------------------------------
/**
* Implement a hash code for this comparator that is consistent with
* {@link #equals(Object) equals}.

2
src/main/java/org/apache/commons/collections4/functors/PrototypeFactory.java
View File

@ -94,7 +94,6 @@ public class PrototypeFactory {
}
// PrototypeCloneFactory
//-----------------------------------------------------------------------
/**
* PrototypeCloneFactory creates objects by copying a prototype using the clone method.
*/
@ -148,7 +147,6 @@ public class PrototypeFactory {
}
// PrototypeSerializationFactory
//-----------------------------------------------------------------------
/**
* PrototypeSerializationFactory creates objects by cloning a prototype using serialization.
*/

1
src/main/java/org/apache/commons/collections4/iterators/AbstractIteratorDecorator.java
View File

@ -27,7 +27,6 @@ import java.util.Iterator;
*/
public abstract class AbstractIteratorDecorator<E> extends AbstractUntypedIteratorDecorator<E, E> {
//-----------------------------------------------------------------------
/**
* Constructor that decorates the specified iterator.
*

2
src/main/java/org/apache/commons/collections4/iterators/AbstractListIteratorDecorator.java
View File

@ -31,7 +31,6 @@ public class AbstractListIteratorDecorator<E> implements ListIterator<E> {
/** The iterator being decorated */
private final ListIterator<E> iterator;
//-----------------------------------------------------------------------
/**
* Constructor that decorates the specified iterator.
*
@ -51,7 +50,6 @@ public class AbstractListIteratorDecorator<E> implements ListIterator<E> {
return iterator;
}
//-----------------------------------------------------------------------
/** {@inheritDoc} */
@Override

2
src/main/java/org/apache/commons/collections4/iterators/AbstractMapIteratorDecorator.java
View File

@ -34,7 +34,6 @@ public class AbstractMapIteratorDecorator<K, V> implements MapIterator<K, V> {
/** The iterator being decorated */
private final MapIterator<K, V> iterator;
//-----------------------------------------------------------------------
/**
* Constructor that decorates the specified iterator.
*
@ -54,7 +53,6 @@ public class AbstractMapIteratorDecorator<K, V> implements MapIterator<K, V> {
return iterator;
}
//-----------------------------------------------------------------------
/** {@inheritDoc} */
@Override

2
src/main/java/org/apache/commons/collections4/iterators/AbstractOrderedMapIteratorDecorator.java
View File

@ -34,7 +34,6 @@ public class AbstractOrderedMapIteratorDecorator<K, V> implements OrderedMapIter
/** The iterator being decorated */
private final OrderedMapIterator<K, V> iterator;
//-----------------------------------------------------------------------
/**
* Constructor that decorates the specified iterator.
*
@ -54,7 +53,6 @@ public class AbstractOrderedMapIteratorDecorator<K, V> implements OrderedMapIter
return iterator;
}
//-----------------------------------------------------------------------
/** {@inheritDoc} */
@Override

2
src/main/java/org/apache/commons/collections4/iterators/ArrayIterator.java
View File

@ -123,7 +123,6 @@ public class ArrayIterator<E> implements ResettableIterator<E> {
}
// Iterator interface
//-----------------------------------------------------------------------
/**
* Returns true if there are more elements to return from the array.
*
@ -161,7 +160,6 @@ public class ArrayIterator<E> implements ResettableIterator<E> {
}
// Properties
//-----------------------------------------------------------------------
/**
* Gets the array that this iterator is iterating over.
*

1
src/main/java/org/apache/commons/collections4/iterators/ArrayListIterator.java
View File

@ -95,7 +95,6 @@ public class ArrayListIterator<E> extends ArrayIterator<E>
}
// ListIterator interface
//-----------------------------------------------------------------------
/**
* Returns true if there are previous elements to return from the array.
*

2
src/main/java/org/apache/commons/collections4/iterators/BoundedIterator.java
View File

@ -49,7 +49,6 @@ public class BoundedIterator<E> implements Iterator<E> {
/** The position of the current element */
private long pos;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to return at most the given number of elements,
@ -89,7 +88,6 @@ public class BoundedIterator<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {

4
src/main/java/org/apache/commons/collections4/iterators/EntrySetMapIterator.java
View File

@ -55,7 +55,6 @@ public class EntrySetMapIterator<K, V> implements MapIterator<K, V>, ResettableI
this.iterator = map.entrySet().iterator();
}
//-----------------------------------------------------------------------
/**
* Checks to see if there are more entries still to be iterated.
*
@ -79,7 +78,6 @@ public class EntrySetMapIterator<K, V> implements MapIterator<K, V>, ResettableI
return last.getKey();
}
//-----------------------------------------------------------------------
/**
* Removes the last returned key from the underlying {@code Map}.
* <p>
@ -100,7 +98,6 @@ public class EntrySetMapIterator<K, V> implements MapIterator<K, V>, ResettableI
canRemove = false;
}
//-----------------------------------------------------------------------
/**
* Gets the current key, which is the key returned by the last call
* to {@code next()}.
@ -149,7 +146,6 @@ public class EntrySetMapIterator<K, V> implements MapIterator<K, V>, ResettableI
return last.setValue(value);
}
//-----------------------------------------------------------------------
/**
* Resets the state of the iterator.
*/

3
src/main/java/org/apache/commons/collections4/iterators/EnumerationIterator.java
View File

@ -37,7 +37,6 @@ public class EnumerationIterator<E> implements Iterator<E> {
private E last;
// Constructors
//-----------------------------------------------------------------------
/**
* Constructs a new {@code EnumerationIterator} that will not
* function until {@link #setEnumeration(Enumeration)} is called.
@ -70,7 +69,6 @@ public class EnumerationIterator<E> implements Iterator<E> {
}
// Iterator interface
//-----------------------------------------------------------------------
/**
* Returns true if the underlying enumeration has more elements.
*
@ -116,7 +114,6 @@ public class EnumerationIterator<E> implements Iterator<E> {
}
// Properties
//-----------------------------------------------------------------------
/**
* Returns the underlying enumeration.
*

5
src/main/java/org/apache/commons/collections4/iterators/FilterIterator.java
View File

@ -41,7 +41,6 @@ public class FilterIterator<E> implements Iterator<E> {
/** Whether the next object has been calculated yet */
private boolean nextObjectSet;
//-----------------------------------------------------------------------
/**
* Constructs a new {@code FilterIterator} that will not function
* until {@link #setIterator(Iterator) setIterator} is invoked.
@ -71,7 +70,6 @@ public class FilterIterator<E> implements Iterator<E> {
this.predicate = predicate;
}
//-----------------------------------------------------------------------
/**
* Returns true if the underlying iterator contains an object that
* matches the predicate.
@ -120,7 +118,6 @@ public class FilterIterator<E> implements Iterator<E> {
iterator.remove();
}
//-----------------------------------------------------------------------
/**
* Gets the iterator this iterator is using.
*
@ -142,7 +139,6 @@ public class FilterIterator<E> implements Iterator<E> {
nextObjectSet = false;
}
//-----------------------------------------------------------------------
/**
* Gets the predicate this iterator is using.
*
@ -163,7 +159,6 @@ public class FilterIterator<E> implements Iterator<E> {
nextObjectSet = false;
}
//-----------------------------------------------------------------------
/**
* Set nextObject to the next object. If there are no more
* objects then return false. Otherwise, return true.

5
src/main/java/org/apache/commons/collections4/iterators/FilterListIterator.java
View File

@ -67,7 +67,6 @@ public class FilterListIterator<E> implements ListIterator<E> {
*/
private int nextIndex;
//-----------------------------------------------------------------------
/**
* Constructs a new {@code FilterListIterator} that will not function
* until {@link #setListIterator(ListIterator) setListIterator}
@ -107,7 +106,6 @@ public class FilterListIterator<E> implements ListIterator<E> {
this.predicate = predicate;
}
//-----------------------------------------------------------------------
/**
* Not supported.
* @param o the element to insert
@ -175,7 +173,6 @@ public class FilterListIterator<E> implements ListIterator<E> {
throw new UnsupportedOperationException("FilterListIterator.set(Object) is not supported.");
}
//-----------------------------------------------------------------------
/**
* Gets the iterator this iterator is using.
*
@ -195,7 +192,6 @@ public class FilterListIterator<E> implements ListIterator<E> {
this.iterator = iterator;
}
//-----------------------------------------------------------------------
/**
* Gets the predicate this iterator is using.
*
@ -214,7 +210,6 @@ public class FilterListIterator<E> implements ListIterator<E> {
this.predicate = predicate;
}
//-----------------------------------------------------------------------
private void clearNextObject() {
nextObject = null;
nextObjectSet = false;

3
src/main/java/org/apache/commons/collections4/iterators/IteratorChain.java
View File

@ -68,7 +68,6 @@ public class IteratorChain<E> implements Iterator<E> {
*/
private boolean isLocked;
//-----------------------------------------------------------------------
/**
* Construct an IteratorChain with no Iterators.
* <p>
@ -143,7 +142,6 @@ public class IteratorChain<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
/**
* Add an Iterator to the end of the chain
*
@ -217,7 +215,6 @@ public class IteratorChain<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
/**
* Return true if any Iterator in the IteratorChain has a remaining element.
*

2
src/main/java/org/apache/commons/collections4/iterators/LazyIteratorChain.java
View File

@ -62,7 +62,6 @@ public abstract class LazyIteratorChain<E> implements Iterator<E> {
*/
private Iterator<? extends E> lastUsedIterator;
//-----------------------------------------------------------------------
/**
* Gets the next iterator after the previous one has been exhausted.
@ -100,7 +99,6 @@ public abstract class LazyIteratorChain<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
/**
* Return true if any Iterator in the chain has a remaining element.

3
src/main/java/org/apache/commons/collections4/iterators/ObjectGraphIterator.java
View File

@ -92,7 +92,6 @@ public class ObjectGraphIterator<E> implements Iterator<E> {
/** The last used iterator, needed for remove() */
private Iterator<? extends E> lastUsedIterator;
//-----------------------------------------------------------------------
/**
* Constructs an ObjectGraphIterator using a root object and transformer.
* <p>
@ -127,7 +126,6 @@ public class ObjectGraphIterator<E> implements Iterator<E> {
this.transformer = null;
}
//-----------------------------------------------------------------------
/**
* Loops around the iterators to find the next value to return.
*/
@ -197,7 +195,6 @@ public class ObjectGraphIterator<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
/**
* Checks whether there are any more elements in the iteration to obtain.
*

3
src/main/java/org/apache/commons/collections4/iterators/PeekingIterator.java
View File

@ -44,7 +44,6 @@ public class PeekingIterator<E> implements Iterator<E> {
/** The current slot for lookahead. */
private E slot;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to support one-element lookahead.
* <p>
@ -65,7 +64,6 @@ public class PeekingIterator<E> implements Iterator<E> {
return new PeekingIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.
@ -90,7 +88,6 @@ public class PeekingIterator<E> implements Iterator<E> {
}
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
if (exhausted) {

2
src/main/java/org/apache/commons/collections4/iterators/PushbackIterator.java
View File

@ -41,7 +41,6 @@ public class PushbackIterator<E> implements Iterator<E> {
/** The LIFO queue containing the pushed back items. */
private final Deque<E> items = new ArrayDeque<>();
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to support one-element lookahead.
* <p>
@ -62,7 +61,6 @@ public class PushbackIterator<E> implements Iterator<E> {
return new PushbackIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.

1
src/main/java/org/apache/commons/collections4/iterators/ReverseListIterator.java
View File

@ -57,7 +57,6 @@ public class ReverseListIterator<E> implements ResettableListIterator<E> {
iterator = list.listIterator(list.size());
}
//-----------------------------------------------------------------------
/**
* Checks whether there is another element.
*

1
src/main/java/org/apache/commons/collections4/iterators/SingletonIterator.java
View File

@ -62,7 +62,6 @@ public class SingletonIterator<E>
this.removeAllowed = removeAllowed;
}
//-----------------------------------------------------------------------
/**
* Is another object available from the iterator?
* <p>

2
src/main/java/org/apache/commons/collections4/iterators/SkippingIterator.java
View File

@ -37,7 +37,6 @@ public class SkippingIterator<E> extends AbstractIteratorDecorator<E> {
/** The position of the current element */
private long pos;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator to skip all elements until the iterator
@ -72,7 +71,6 @@ public class SkippingIterator<E> extends AbstractIteratorDecorator<E> {
}
}
//-----------------------------------------------------------------------
@Override
public E next() {

5
src/main/java/org/apache/commons/collections4/iterators/TransformIterator.java
View File

@ -32,7 +32,6 @@ public class TransformIterator<I, O> implements Iterator<O> {
/** The transformer being used */
private Transformer<? super I, ? extends O> transformer;
//-----------------------------------------------------------------------
/**
* Constructs a new {@code TransformIterator} that will not function
* until the {@link #setIterator(Iterator) setIterator} and
@ -65,7 +64,6 @@ public class TransformIterator<I, O> implements Iterator<O> {
this.transformer = transformer;
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
return iterator.hasNext();
@ -89,7 +87,6 @@ public class TransformIterator<I, O> implements Iterator<O> {
iterator.remove();
}
//-----------------------------------------------------------------------
/**
* Gets the iterator this iterator is using.
*
@ -109,7 +106,6 @@ public class TransformIterator<I, O> implements Iterator<O> {
this.iterator = iterator;
}
//-----------------------------------------------------------------------
/**
* Gets the transformer this iterator is using.
*
@ -129,7 +125,6 @@ public class TransformIterator<I, O> implements Iterator<O> {
this.transformer = transformer;
}
//-----------------------------------------------------------------------
/**
* Transforms the given object using the transformer.
* If the transformer is null, the original object is returned as-is.

3
src/main/java/org/apache/commons/collections4/iterators/UnmodifiableIterator.java
View File

@ -35,7 +35,6 @@ public final class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
/** The iterator being decorated */
private final Iterator<? extends E> iterator;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator such that it cannot be modified.
* <p>
@ -56,7 +55,6 @@ public final class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
return new UnmodifiableIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.
*
@ -66,7 +64,6 @@ public final class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
this.iterator = iterator;
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
return iterator.hasNext();

3
src/main/java/org/apache/commons/collections4/iterators/UnmodifiableListIterator.java
View File

@ -35,7 +35,6 @@ public final class UnmodifiableListIterator<E> implements ListIterator<E>, Unmod
/** The iterator being decorated */
private final ListIterator<? extends E> iterator;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator such that it cannot be modified.
*
@ -54,7 +53,6 @@ public final class UnmodifiableListIterator<E> implements ListIterator<E>, Unmod
return new UnmodifiableListIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.
*
@ -64,7 +62,6 @@ public final class UnmodifiableListIterator<E> implements ListIterator<E>, Unmod
this.iterator = iterator;
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
return iterator.hasNext();

3
src/main/java/org/apache/commons/collections4/iterators/UnmodifiableMapIterator.java
View File

@ -36,7 +36,6 @@ public final class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, U
/** The iterator being decorated */
private final MapIterator<? extends K, ? extends V> iterator;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator such that it cannot be modified.
*
@ -57,7 +56,6 @@ public final class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, U
return new UnmodifiableMapIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.
*
@ -67,7 +65,6 @@ public final class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, U
this.iterator = iterator;
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
return iterator.hasNext();

3
src/main/java/org/apache/commons/collections4/iterators/UnmodifiableOrderedMapIterator.java
View File

@ -37,7 +37,6 @@ public final class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIte
/** The iterator being decorated */
private final OrderedMapIterator<? extends K, ? extends V> iterator;
//-----------------------------------------------------------------------
/**
* Decorates the specified iterator such that it cannot be modified.
*
@ -58,7 +57,6 @@ public final class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIte
return new UnmodifiableOrderedMapIterator<>(iterator);
}
//-----------------------------------------------------------------------
/**
* Constructor.
*
@ -68,7 +66,6 @@ public final class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIte
this.iterator = iterator;
}
//-----------------------------------------------------------------------
@Override
public boolean hasNext() {
return iterator.hasNext();

1
src/main/java/org/apache/commons/collections4/keyvalue/AbstractMapEntryDecorator.java
View File

@ -53,7 +53,6 @@ public abstract class AbstractMapEntryDecorator<K, V> implements Map.Entry<K, V>
return entry;
}
//-----------------------------------------------------------------------
@Override
public K getKey() {

3
src/main/java/org/apache/commons/collections4/keyvalue/DefaultKeyValue.java
View File

@ -71,7 +71,6 @@ public class DefaultKeyValue<K, V> extends AbstractKeyValue<K, V> {
super(entry.getKey(), entry.getValue());
}
//-----------------------------------------------------------------------
/**
* Sets the key.
*
@ -104,7 +103,6 @@ public class DefaultKeyValue<K, V> extends AbstractKeyValue<K, V> {
return super.setValue(value);
}
//-----------------------------------------------------------------------
/**
* Returns a new {@code Map.Entry} object with key and value from this pair.
*
@ -114,7 +112,6 @@ public class DefaultKeyValue<K, V> extends AbstractKeyValue<K, V> {
return new DefaultMapEntry<>(this);
}
//-----------------------------------------------------------------------
/**
* Compares this {@code Map.Entry} with another {@code Map.Entry}.
* <p>

2
src/main/java/org/apache/commons/collections4/keyvalue/MultiKey.java
View File

@ -236,7 +236,6 @@ public class MultiKey<K> implements Serializable {
hashCode = total;
}
//-----------------------------------------------------------------------
/**
* Compares this object to another.
* <p>
@ -273,7 +272,6 @@ public class MultiKey<K> implements Serializable {
return keys[index];
}
//-----------------------------------------------------------------------
/**
* Gets a clone of the array of keys.
* <p>

16
src/main/java/org/apache/commons/collections4/list/AbstractLinkedList.java
View File

@ -98,7 +98,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
header = createHeaderNode();
}
//-----------------------------------------------------------------------
@Override
public int size() {
@ -116,7 +115,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return node.getValue();
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
@ -133,7 +131,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return new LinkedListIterator<>(this, fromIndex);
}
//-----------------------------------------------------------------------
@Override
public int indexOf(final Object value) {
@ -174,7 +171,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return true;
}
//-----------------------------------------------------------------------
@Override
public Object[] toArray() {
@ -213,7 +209,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return new LinkedSubList<>(this, fromIndexInclusive, toIndexExclusive);
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E value) {
@ -241,7 +236,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return true;
}
//-----------------------------------------------------------------------
@Override
public E remove(final int index) {
@ -284,7 +278,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return modified;
}
//-----------------------------------------------------------------------
/**
* {@inheritDoc}
@ -321,7 +314,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
removeAllNodes();
}
//-----------------------------------------------------------------------
public E getFirst() {
final Node<E> node = header.next;
@ -369,7 +361,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return oldValue;
}
//-----------------------------------------------------------------------
@Override
public boolean equals(final Object obj) {
if (obj == this) {
@ -423,7 +414,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return buf.toString();
}
//-----------------------------------------------------------------------
/**
* Compares two values for equals.
* This implementation uses the equals method.
@ -590,7 +580,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return node;
}
//-----------------------------------------------------------------------
/**
* Creates an iterator for the sublist.
*
@ -612,7 +601,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
return new LinkedSubListIterator<>(subList, fromIndex);
}
//-----------------------------------------------------------------------
/**
* Serializes the data held in this object to the stream specified.
* <p>
@ -649,7 +637,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
}
}
//-----------------------------------------------------------------------
/**
* A node within the linked list.
* <p>
@ -756,7 +743,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
}
}
//-----------------------------------------------------------------------
/**
* A list iterator over the linked list.
*/
@ -916,7 +902,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
}
//-----------------------------------------------------------------------
/**
* A list iterator over the linked sub list.
*/
@ -960,7 +945,6 @@ public abstract class AbstractLinkedList<E> implements List<E> {
}
}
//-----------------------------------------------------------------------
/**
* The sublist implementation for AbstractLinkedList.
*/

1
src/main/java/org/apache/commons/collections4/list/AbstractListDecorator.java
View File

@ -74,7 +74,6 @@ public abstract class AbstractListDecorator<E> extends AbstractCollectionDecorat
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public void add(final int index, final E object) {

1
src/main/java/org/apache/commons/collections4/list/AbstractSerializableListDecorator.java
View File

@ -43,7 +43,6 @@ public abstract class AbstractSerializableListDecorator<E>
super(list);
}
//-----------------------------------------------------------------------
/**
* Write the list out using a custom routine.
*

9
src/main/java/org/apache/commons/collections4/list/CursorableLinkedList.java
View File

@ -66,7 +66,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
/** A list of the cursor currently open on this list */
private transient List<WeakReference<Cursor<E>>> cursors;
//-----------------------------------------------------------------------
/**
* Constructor that creates.
*/
@ -93,7 +92,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
cursors = new ArrayList<>();
}
//-----------------------------------------------------------------------
/**
* Returns an iterator that does <b>not</b> support concurrent modification.
* <p>
@ -209,7 +207,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
return cursor;
}
//-----------------------------------------------------------------------
/**
* Updates the node with a new value.
* This implementation sets the value on the node.
@ -264,7 +261,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
}
}
//-----------------------------------------------------------------------
/**
* Registers a cursor to be notified of changes to this list.
*
@ -299,7 +295,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
}
}
//-----------------------------------------------------------------------
/**
* Informs all of my registered cursors that the specified
* element was changed.
@ -357,7 +352,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
}
}
//-----------------------------------------------------------------------
/**
* Serializes the data held in this object to the stream specified.
*
@ -381,7 +375,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
doReadObject(in);
}
//-----------------------------------------------------------------------
/**
* Creates a list iterator for the sublist.
*
@ -396,7 +389,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
return cursor;
}
//-----------------------------------------------------------------------
/**
* An extended {@code ListIterator} that allows concurrent changes to
* the underlying list.
@ -567,7 +559,6 @@ public class CursorableLinkedList<E> extends AbstractLinkedList<E> implements Se
}
}
//-----------------------------------------------------------------------
/**
* A cursor for the sublist based on LinkedSubListIterator.
*

2
src/main/java/org/apache/commons/collections4/list/FixedSizeList.java
View File

@ -65,7 +65,6 @@ public class FixedSizeList<E>
return new FixedSizeList<>(list);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -76,7 +75,6 @@ public class FixedSizeList<E>
super(list);
}
//-----------------------------------------------------------------------
@Override
public boolean add(final E object) {
throw unsupportedOperationException();

4
src/main/java/org/apache/commons/collections4/list/GrowthList.java
View File

@ -75,7 +75,6 @@ public class GrowthList<E> extends AbstractSerializableListDecorator<E> {
return new GrowthList<>(list);
}
//-----------------------------------------------------------------------
/**
* Constructor that uses an ArrayList internally.
*/
@ -103,7 +102,6 @@ public class GrowthList<E> extends AbstractSerializableListDecorator<E> {
super(list);
}
//-----------------------------------------------------------------------
/**
* Decorate the add method to perform the growth behavior.
* <p>
@ -131,7 +129,6 @@ public class GrowthList<E> extends AbstractSerializableListDecorator<E> {
decorated().add(index, element);
}
//-----------------------------------------------------------------------
/**
* Decorate the addAll method to perform the growth behavior.
* <p>
@ -162,7 +159,6 @@ public class GrowthList<E> extends AbstractSerializableListDecorator<E> {
return decorated().addAll(index, coll) || result;
}
//-----------------------------------------------------------------------
/**
* Decorate the set method to perform the growth behavior.
* <p>

2
src/main/java/org/apache/commons/collections4/list/LazyList.java
View File

@ -103,7 +103,6 @@ public class LazyList<E> extends AbstractSerializableListDecorator<E> {
return new LazyList<>(list, transformer);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -130,7 +129,6 @@ public class LazyList<E> extends AbstractSerializableListDecorator<E> {
this.transformer = Objects.requireNonNull(transformer);
}
//-----------------------------------------------------------------------
/**
* Decorate the get method to perform the lazy behavior.
* <p>

4
src/main/java/org/apache/commons/collections4/list/NodeCachingLinkedList.java
View File

@ -68,7 +68,6 @@ public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements S
*/
private int maximumCacheSize;
//-----------------------------------------------------------------------
/**
* Constructor that creates.
*/
@ -96,7 +95,6 @@ public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements S
init(); // must call init() as use super();
}
//-----------------------------------------------------------------------
/**
* Gets the maximum size of the cache.
*
@ -174,7 +172,6 @@ public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements S
cacheSize++;
}
//-----------------------------------------------------------------------
/**
* Creates a new node, either by reusing one from the cache or creating
* a new one.
@ -225,7 +222,6 @@ public class NodeCachingLinkedList<E> extends AbstractLinkedList<E> implements S
super.removeAllNodes();
}
//-----------------------------------------------------------------------
/**
* Serializes the data held in this object to the stream specified.
*

3
src/main/java/org/apache/commons/collections4/list/PredicatedList.java
View File

@ -70,7 +70,6 @@ public class PredicatedList<E> extends PredicatedCollection<E> implements List<E
return new PredicatedList<>(list, predicate);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -106,7 +105,6 @@ public class PredicatedList<E> extends PredicatedCollection<E> implements List<E
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public E get(final int index) {
@ -128,7 +126,6 @@ public class PredicatedList<E> extends PredicatedCollection<E> implements List<E
return decorated().remove(index);
}
//-----------------------------------------------------------------------
@Override
public void add(final int index, final E object) {

3
src/main/java/org/apache/commons/collections4/list/TransformedList.java
View File

@ -91,7 +91,6 @@ public class TransformedList<E> extends TransformedCollection<E> implements List
return decorated;
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
* <p>
@ -125,7 +124,6 @@ public class TransformedList<E> extends TransformedCollection<E> implements List
return decorated().hashCode();
}
//-----------------------------------------------------------------------
@Override
public E get(final int index) {
@ -147,7 +145,6 @@ public class TransformedList<E> extends TransformedCollection<E> implements List
return getList().remove(index);
}
//-----------------------------------------------------------------------
@Override
public void add(final int index, E object) {

7
src/main/java/org/apache/commons/collections4/list/TreeList.java
View File

@ -73,7 +73,6 @@ public class TreeList<E> extends AbstractList<E> {
/** The current size of the list */
private int size;
//-----------------------------------------------------------------------
/**
* Constructs a new empty list.
*/
@ -93,7 +92,6 @@ public class TreeList<E> extends AbstractList<E> {
}
}
//-----------------------------------------------------------------------
/**
* Gets the element at the specified index.
*
@ -193,7 +191,6 @@ public class TreeList<E> extends AbstractList<E> {
return array;
}
//-----------------------------------------------------------------------
/**
* Adds a new element to the list.
*
@ -278,7 +275,6 @@ public class TreeList<E> extends AbstractList<E> {
size = 0;
}
//-----------------------------------------------------------------------
/**
* Checks whether the index is valid.
*
@ -293,7 +289,6 @@ public class TreeList<E> extends AbstractList<E> {
}
}
//-----------------------------------------------------------------------
/**
* Implements an AVLNode which keeps the offset updated.
* <p>
@ -532,7 +527,6 @@ public class TreeList<E> extends AbstractList<E> {
return ret;
}
//-----------------------------------------------------------------------
/**
* Gets the left node, returning null if its a faedelung.
*/
@ -672,7 +666,6 @@ public class TreeList<E> extends AbstractList<E> {
return this;
}
//-----------------------------------------------------------------------
/**
* Balances according to the AVL algorithm.
*/

3
src/main/java/org/apache/commons/collections4/list/UnmodifiableList.java
View File

@ -62,7 +62,6 @@ public final class UnmodifiableList<E>
return new UnmodifiableList<>(list);
}
//-----------------------------------------------------------------------
/**
* Constructor that wraps (not copies).
*
@ -74,7 +73,6 @@ public final class UnmodifiableList<E>
super((List<E>) list);
}
//-----------------------------------------------------------------------
@Override
public Iterator<E> iterator() {
return UnmodifiableIterator.unmodifiableIterator(decorated().iterator());
@ -118,7 +116,6 @@ public final class UnmodifiableList<E>
throw new UnsupportedOperationException();
}
//-----------------------------------------------------------------------
@Override
public ListIterator<E> listIterator() {
return UnmodifiableListIterator.umodifiableListIterator(decorated().listIterator());

17
src/main/java/org/apache/commons/collections4/map/AbstractHashedMap.java
View File

@ -169,7 +169,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
// noop
}
//-----------------------------------------------------------------------
/**
* Gets the value mapped to the key specified.
*
@ -210,7 +209,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return size == 0;
}
//-----------------------------------------------------------------------
/**
* Checks whether the map contains the specified key.
*
@ -263,7 +261,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return false;
}
//-----------------------------------------------------------------------
/**
* Puts a key-value mapping into this map.
*
@ -365,7 +362,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
size = 0;
}
//-----------------------------------------------------------------------
/**
* Converts input keys to another object for storage in the map.
* This implementation masks nulls.
@ -438,7 +434,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return hashCode & dataSize - 1;
}
//-----------------------------------------------------------------------
/**
* Gets the entry mapped to the key specified.
* <p>
@ -462,7 +457,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return null;
}
//-----------------------------------------------------------------------
/**
* Updates an existing key-value mapping to change the value.
* <p>
@ -496,7 +490,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
entry.value = value;
}
//-----------------------------------------------------------------------
/**
* Adds a new key-value mapping into this map.
* <p>
@ -548,7 +541,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
data[hashIndex] = entry;
}
//-----------------------------------------------------------------------
/**
* Removes a mapping from the map.
* <p>
@ -600,7 +592,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
entry.value = null;
}
//-----------------------------------------------------------------------
/**
* Checks the capacity of the map and enlarges it if necessary.
* <p>
@ -686,7 +677,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return (int) (newCapacity * factor);
}
//-----------------------------------------------------------------------
/**
* Gets the {@code next} field from a {@code HashEntry}.
* Used in subclasses that have no visibility of the field.
@ -739,7 +729,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
return entry.getValue();
}
//-----------------------------------------------------------------------
/**
* Gets an iterator over the map.
* Changes made to the iterator affect this map.
@ -804,7 +793,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* Gets the entrySet view of the map.
* Changes made to the view affect this map.
@ -904,7 +892,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* Gets the keySet view of the map.
* Changes made to the view affect this map.
@ -992,7 +979,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* Gets the values view of the map.
* Changes made to the view affect this map.
@ -1073,7 +1059,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* HashEntry used to store the data.
* <p>
@ -1232,7 +1217,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* Writes the map data to the stream. This method must be overridden if a
* subclass must be setup before {@code put()} is used.
@ -1298,7 +1282,6 @@ public class AbstractHashedMap<K, V> extends AbstractMap<K, V> implements Iterab
}
}
//-----------------------------------------------------------------------
/**
* Clones the map without cloning the keys or values.
* <p>

3
src/main/java/org/apache/commons/collections4/map/AbstractInputCheckedMapDecorator.java
View File

@ -63,7 +63,6 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
super(map);
}
//-----------------------------------------------------------------------
/**
* Hook method called when a value is being set using {@code setValue}.
* <p>
@ -97,7 +96,6 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
return true;
}
//-----------------------------------------------------------------------
@Override
public Set<Map.Entry<K, V>> entrySet() {
if (isSetValueChecking()) {
@ -106,7 +104,6 @@ abstract class AbstractInputCheckedMapDecorator<K, V>
return map.entrySet();
}
//-----------------------------------------------------------------------
/**
* Implementation of an entry set that checks additions via setValue.
*/

9
src/main/java/org/apache/commons/collections4/map/AbstractLinkedMap.java
View File

@ -134,7 +134,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
header.before = header.after = header;
}
//-----------------------------------------------------------------------
/**
* Checks whether the map contains the specified value.
*
@ -171,7 +170,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
header.before = header.after = header;
}
//-----------------------------------------------------------------------
/**
* Gets the first key in the map, which is the first inserted.
*
@ -227,7 +225,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
return entry == null || entry.before == header ? null : entry.before.getKey();
}
//-----------------------------------------------------------------------
/**
* Gets the key at the specified index.
*
@ -314,7 +311,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
super.removeEntry(entry, hashIndex, previous);
}
//-----------------------------------------------------------------------
/**
* Gets the {@code before} field from a {@code LinkEntry}.
* Used in subclasses that have no visibility of the field.
@ -341,7 +337,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
return entry.after;
}
//-----------------------------------------------------------------------
/**
* {@inheritDoc}
*/
@ -401,7 +396,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
}
}
//-----------------------------------------------------------------------
/**
* Creates an entry set iterator.
* Subclasses can override this to return iterators with different properties.
@ -437,7 +431,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
}
}
//-----------------------------------------------------------------------
/**
* Creates a key set iterator.
* Subclasses can override this to return iterators with different properties.
@ -474,7 +467,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
}
}
//-----------------------------------------------------------------------
/**
* Creates a values iterator.
* Subclasses can override this to return iterators with different properties.
@ -511,7 +503,6 @@ public abstract class AbstractLinkedMap<K, V> extends AbstractHashedMap<K, V> im
}
}
//-----------------------------------------------------------------------
/**
* LinkEntry that stores the data.
* <p>

1
src/main/java/org/apache/commons/collections4/map/AbstractMapDecorator.java
View File

@ -71,7 +71,6 @@ public abstract class AbstractMapDecorator<K, V> extends AbstractIterableMap<K,
return map;
}
//-----------------------------------------------------------------------
@Override
public void clear() {
decorated().clear();

1
src/main/java/org/apache/commons/collections4/map/AbstractOrderedMapDecorator.java
View File

@ -67,7 +67,6 @@ public abstract class AbstractOrderedMapDecorator<K, V> extends AbstractMapDecor
return (OrderedMap<K, V>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public K firstKey() {
return decorated().firstKey();

12
src/main/java/org/apache/commons/collections4/map/AbstractReferenceMap.java
View File

@ -146,7 +146,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
*/
private transient ReferenceQueue<Object> queue;
//-----------------------------------------------------------------------
/**
* Constructor used during deserialization.
*/
@ -187,7 +186,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
queue = new ReferenceQueue<>();
}
//-----------------------------------------------------------------------
/**
* Gets the size of the map.
*
@ -302,7 +300,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* Gets a MapIterator over the reference map.
* The iterator only returns valid key/value pairs.
@ -355,7 +352,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
return values;
}
//-----------------------------------------------------------------------
/**
* Purges stale mappings from this map before read operations.
* <p>
@ -421,7 +417,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
//-----------------------------------------------------------------------
/**
* Gets the entry mapped to the key specified.
*
@ -511,7 +506,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
return new ReferenceValuesIterator<>(this);
}
//-----------------------------------------------------------------------
/**
* EntrySet implementation.
*/
@ -537,7 +531,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* KeySet implementation.
*/
@ -563,7 +556,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* Values implementation.
*/
@ -589,7 +581,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* A MapEntry implementation for the map.
* <p>
@ -772,7 +763,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* Base iterator class.
*/
@ -959,7 +949,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
// These two classes store the hashCode of the key of
// of the mapping, so that after they're dequeued a quick
// lookup of the bucket in the table can occur.
@ -1000,7 +989,6 @@ public abstract class AbstractReferenceMap<K, V> extends AbstractHashedMap<K, V>
}
}
//-----------------------------------------------------------------------
/**
* Replaces the superclass method to store the state of this class.
* <p>

1
src/main/java/org/apache/commons/collections4/map/AbstractSortedMapDecorator.java
View File

@ -75,7 +75,6 @@ public abstract class AbstractSortedMapDecorator<K, V> extends AbstractMapDecora
return (SortedMap<K, V>) super.decorated();
}
//-----------------------------------------------------------------------
@Override
public Comparator<? super K> comparator() {
return decorated().comparator();

2
src/main/java/org/apache/commons/collections4/map/CaseInsensitiveMap.java
View File

@ -120,7 +120,6 @@ public class CaseInsensitiveMap<K, V> extends AbstractHashedMap<K, V> implements
super(map);
}
//-----------------------------------------------------------------------
/**
* Overrides convertKey() from {@link AbstractHashedMap} to convert keys to
* lower case.
@ -142,7 +141,6 @@ public class CaseInsensitiveMap<K, V> extends AbstractHashedMap<K, V> implements
return AbstractHashedMap.NULL;
}
//-----------------------------------------------------------------------
/**
* Clones the map without cloning the keys or values.
*

Some files were not shown because too many files have changed in this diff Show More