Javadoc

Author: garydgregory

src/main/java/org/apache/commons/collections4/SetUtils.java

@@ -61,6 +61,13 @@ public class SetUtils {
      */
     public abstract static class SetView<E> extends AbstractSet<E> {
 
+        /**
+         * Constructs a new instance.
+         */
+        public SetView() {
+            // empty
+        }
+
         /**
          * Copies the contents of this view into the provided set.
          *

src/main/java/org/apache/commons/collections4/functors/AbstractPredicate.java

@@ -26,6 +26,13 @@
  */
 public abstract class AbstractPredicate<T> implements Predicate<T> {
 
+    /**
+     * Constructs a new instance.
+     */
+    public AbstractPredicate() {
+        // empty
+    }
+
     @Override
     public boolean evaluate(final T object) {
         return test(object);

src/main/java/org/apache/commons/collections4/functors/CatchAndRethrowClosure.java

@@ -48,6 +48,13 @@
  */
 public abstract class CatchAndRethrowClosure<T> implements Closure<T> {
 
+    /**
+     * Constructs a new instance.
+     */
+    public CatchAndRethrowClosure() {
+        // empty
+    }
+
     /**
      * Execute this closure on the specified input object.
      *

src/main/java/org/apache/commons/collections4/iterators/LazyIteratorChain.java

@@ -67,6 +67,13 @@ public abstract class LazyIteratorChain<E> implements Iterator<E> {
      */
     private Iterator<? extends E> lastUsedIterator;
 
+    /**
+     * Constructs a new instance.
+     */
+    public LazyIteratorChain() {
+        // empty
+    }
+
     /**
      * Return true if any Iterator in the chain has a remaining element.
      *

src/main/java/org/apache/commons/collections4/map/ConcurrentReferenceHashMap.java

@@ -155,6 +155,13 @@ public static class Builder<K, V> implements Supplier<ConcurrentReferenceHashMap
         @SuppressWarnings("unchecked")
         private Map<? extends K, ? extends V> sourceMap = (Map<? extends K, ? extends V>) DEFAULT_SOURCE_MAP;
 
+        /**
+         * Constructs a new instances of {@link ConcurrentReferenceHashMap}.
+         */
+        public Builder() {
+            // empty
+        }
+
         /**
          * Builds a new {@link ConcurrentReferenceHashMap}.
          * <p>

src/main/java/org/apache/commons/collections4/multiset/AbstractMultiSet.java

@@ -46,6 +46,13 @@ public abstract class AbstractMultiSet<E> extends AbstractCollection<E> implemen
      */
     protected abstract static class AbstractEntry<E> implements Entry<E> {
 
+        /**
+         * Constructs a new instance.
+         */
+        public AbstractEntry() {
+            // empty
+        }
+
         @Override
         public boolean equals(final Object object) {
             if (object instanceof Entry) {
@@ -240,7 +247,7 @@ public int size() {
     private transient Set<Entry<E>> entrySet;
 
     /**
-     * Constructor needed for subclass serialization.
+     * Constructs a new instance subclasses.
      */
     protected AbstractMultiSet() {
     }

src/main/java/org/apache/commons/collections4/properties/OrderedProperties.java

@@ -48,6 +48,13 @@ public class OrderedProperties extends Properties {
      */
     private final LinkedHashSet<Object> orderedKeys = new LinkedHashSet<>();
 
+    /**
+     * Constructs a new instance.
+     */
+    public OrderedProperties() {
+        // empty
+    }
+
     @Override
     public synchronized void clear() {
         orderedKeys.clear();

src/main/java/org/apache/commons/collections4/trie/KeyAnalyzer.java

@@ -84,6 +84,13 @@ static boolean isValidBitIndex(final int bitIndex) {
         return bitIndex >= 0;
     }
 
+    /**
+     * Constructs a new instance.
+     */
+    public KeyAnalyzer() {
+        // empty
+    }
+
     /**
      * Returns the n-th different bit between key and other. This starts the comparison in
      * key at 'offsetInBits' and goes for 'lengthInBits' bits, and compares to the other key starting