Javadoc
This commit is contained in:
parent
ae7219445d
commit
8e0bc678ad
|
@ -181,7 +181,7 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
|
|||
private boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent bag
|
||||
*/
|
||||
|
@ -406,7 +406,7 @@ public abstract class AbstractMapBag<E> implements Bag<E> {
|
|||
protected int value;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param value the initial value
|
||||
*/
|
||||
MutableInteger(final int value) {
|
||||
|
|
|
@ -137,7 +137,7 @@ public class SynchronizedBag<E> extends SynchronizedCollection<E> implements Bag
|
|||
private static final long serialVersionUID = 2990565892366827855L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param set the set to decorate
|
||||
* @param lock the lock to use, shared with the bag
|
||||
*/
|
||||
|
|
|
@ -346,7 +346,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected final AbstractDualBidiMap<K, V> parent;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param coll the collection view being decorated
|
||||
* @param parent the parent BidiMap
|
||||
|
@ -445,7 +445,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
private static final long serialVersionUID = -7107935777385040694L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent BidiMap
|
||||
*/
|
||||
|
@ -492,7 +492,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param iterator the iterator to decorate
|
||||
* @param parent the parent map
|
||||
*/
|
||||
|
@ -532,7 +532,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
private static final long serialVersionUID = 4023777119829639864L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent BidiMap
|
||||
*/
|
||||
|
@ -579,7 +579,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param iterator the iterator to decorate
|
||||
* @param parent the parent map
|
||||
*/
|
||||
|
@ -620,7 +620,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
private static final long serialVersionUID = 4040410962603292348L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent BidiMap
|
||||
*/
|
||||
|
@ -670,7 +670,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param iterator the iterator to decorate
|
||||
* @param parent the parent map
|
||||
*/
|
||||
|
@ -712,7 +712,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected final AbstractDualBidiMap<K, V> parent;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param entry the entry to decorate
|
||||
* @param parent the parent map
|
||||
*/
|
||||
|
@ -755,7 +755,7 @@ public abstract class AbstractDualBidiMap<K, V> implements BidiMap<K, V> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param parent the parent map
|
||||
*/
|
||||
protected BidiMapIterator(final AbstractDualBidiMap<K, V> parent) {
|
||||
|
|
|
@ -235,7 +235,7 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
|
|||
*/
|
||||
protected static class ViewMap<K, V> extends AbstractSortedMapDecorator<K, V> {
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param bidi the parent bidi map
|
||||
* @param sm the subMap sorted map
|
||||
*/
|
||||
|
@ -310,7 +310,7 @@ public class DualTreeBidiMap<K, V> extends AbstractDualBidiMap<K, V>
|
|||
private Map.Entry<K, V> last;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param parent the parent map
|
||||
*/
|
||||
protected BidiOrderedMapIterator(final AbstractDualBidiMap<K, V> parent) {
|
||||
|
|
|
@ -1477,7 +1477,7 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
|
|||
final DataElement orderType;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param orderType the KEY or VALUE int for the order
|
||||
*/
|
||||
AbstractView(final DataElement orderType) {
|
||||
|
@ -1648,7 +1648,7 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
|
|||
private int expectedModifications;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param orderType the KEY or VALUE int for the order
|
||||
*/
|
||||
AbstractViewIterator(final DataElement orderType) {
|
||||
|
@ -1720,7 +1720,7 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
|
|||
final class ViewMapIterator extends AbstractViewIterator implements OrderedMapIterator<K, V> {
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
ViewMapIterator(final DataElement orderType) {
|
||||
super(orderType);
|
||||
|
@ -1812,7 +1812,7 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
|
|||
final class ViewMapEntryIterator extends AbstractViewIterator implements OrderedIterator<Map.Entry<K, V>> {
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
ViewMapEntryIterator() {
|
||||
super(KEY);
|
||||
|
@ -1835,7 +1835,7 @@ public class TreeBidiMap<K extends Comparable<K>, V extends Comparable<V>>
|
|||
final class InverseViewMapEntryIterator extends AbstractViewIterator implements OrderedIterator<Map.Entry<V, K>> {
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
InverseViewMapEntryIterator() {
|
||||
super(VALUE);
|
||||
|
|
|
@ -50,7 +50,7 @@ public class CloneTransformer<T> implements Transformer<T, T> {
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
private CloneTransformer() {
|
||||
}
|
||||
|
|
|
@ -46,7 +46,7 @@ public final class NOPClosure<E> implements Closure<E>, Serializable {
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
private NOPClosure() {
|
||||
}
|
||||
|
|
|
@ -46,7 +46,7 @@ public class NOPTransformer<T> implements Transformer<T, T>, Serializable {
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
private NOPTransformer() {
|
||||
}
|
||||
|
|
|
@ -26,7 +26,7 @@ import java.util.NoSuchElementException;
|
|||
abstract class AbstractEmptyIterator<E> {
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected AbstractEmptyIterator() {
|
||||
}
|
||||
|
|
|
@ -65,7 +65,7 @@ public class EmptyIterator<E> extends AbstractEmptyIterator<E> implements Resett
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected EmptyIterator() {
|
||||
}
|
||||
|
|
|
@ -66,7 +66,7 @@ public class EmptyListIterator<E> extends AbstractEmptyIterator<E> implements
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected EmptyListIterator() {
|
||||
}
|
||||
|
|
|
@ -47,7 +47,7 @@ public class EmptyMapIterator<K, V> extends AbstractEmptyMapIterator<K, V> imple
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected EmptyMapIterator() {
|
||||
}
|
||||
|
|
|
@ -45,7 +45,7 @@ public class EmptyOrderedIterator<E> extends AbstractEmptyIterator<E>
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected EmptyOrderedIterator() {
|
||||
}
|
||||
|
|
|
@ -47,7 +47,7 @@ public class EmptyOrderedMapIterator<K, V> extends AbstractEmptyMapIterator<K, V
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
protected EmptyOrderedMapIterator() {
|
||||
}
|
||||
|
|
|
@ -46,7 +46,7 @@ public class EntrySetMapIterator<K, V> implements MapIterator<K, V>, ResettableI
|
|||
private boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param map the map to iterate over
|
||||
*/
|
||||
|
|
|
@ -65,7 +65,7 @@ public class PeekingIterator<E> implements Iterator<E> {
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -62,7 +62,7 @@ public class PushbackIterator<E> implements Iterator<E> {
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -56,7 +56,7 @@ public final class UnmodifiableIterator<E> implements Iterator<E>, Unmodifiable
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -68,7 +68,7 @@ public final class UnmodifiableListIterator<E> implements ListIterator<E>, Unmod
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -57,7 +57,7 @@ public final class UnmodifiableMapIterator<K, V> implements MapIterator<K, V>, U
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -58,7 +58,7 @@ public final class UnmodifiableOrderedMapIterator<K, V> implements OrderedMapIte
|
|||
}
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param iterator the iterator to decorate
|
||||
*/
|
||||
|
|
|
@ -109,7 +109,7 @@ public class Flat3Map<K, V> implements IterableMap<K, V>, Serializable, Cloneabl
|
|||
private transient AbstractHashedMap<K, V> delegateMap;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*/
|
||||
public Flat3Map() {
|
||||
}
|
||||
|
|
|
@ -156,7 +156,7 @@ public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E> {
|
|||
private boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent multiset
|
||||
*/
|
||||
|
@ -273,7 +273,7 @@ public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E> {
|
|||
protected int value;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param value the initial value
|
||||
*/
|
||||
MutableInteger(final int value) {
|
||||
|
@ -324,7 +324,7 @@ public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param iterator the iterator to decorate
|
||||
* @param parent the parent multiset
|
||||
*/
|
||||
|
@ -370,7 +370,7 @@ public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E> {
|
|||
protected boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param iterator the iterator to decorate
|
||||
* @param parent the parent multiset
|
||||
*/
|
||||
|
@ -411,7 +411,7 @@ public abstract class AbstractMapMultiSet<E> extends AbstractMultiSet<E> {
|
|||
protected final Map.Entry<E, MutableInteger> parentEntry;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param parentEntry the entry to decorate
|
||||
*/
|
||||
protected MultiSetEntry(final Map.Entry<E, MutableInteger> parentEntry) {
|
||||
|
|
|
@ -130,7 +130,7 @@ public abstract class AbstractMultiSet<E> extends AbstractCollection<E> implemen
|
|||
private boolean canRemove;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param parent the parent multiset
|
||||
*/
|
||||
|
|
|
@ -149,7 +149,7 @@ public class SynchronizedMultiSet<E> extends SynchronizedCollection<E> implement
|
|||
private static final long serialVersionUID = 20150629L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
* @param set the set to decorate
|
||||
* @param lock the lock to use, shared with the multiset
|
||||
*/
|
||||
|
|
|
@ -35,7 +35,7 @@ public abstract class AbstractSerializableSetDecorator<E>
|
|||
private static final long serialVersionUID = 1229469966212206107L;
|
||||
|
||||
/**
|
||||
* Constructor.
|
||||
* Constructs a new instance.
|
||||
*
|
||||
* @param set the list to decorate, must not be null
|
||||
* @throws NullPointerException if set is null
|
||||
|
|
Loading…
Reference in New Issue