Spelling

src/main/java/org/apache/commons/collections4/bag/AbstractMapBag.java

@@ -468,7 +468,7 @@ public <T> T[] toArray(T[] array) {
         int i = 0;
         for (final E current : map.keySet()) {
             for (int index = getCount(current); index > 0; index--) {
-                // unsafe, will throw ArrayStoreException if types are not compatible, see javadoc
+                // unsafe, will throw ArrayStoreException if types are not compatible, see Javadoc
                 @SuppressWarnings("unchecked")
                 final T unchecked = (T) current;
                 array[i++] = unchecked;

src/main/java/org/apache/commons/collections4/bag/CollectionBag.java

@@ -32,7 +32,7 @@
  * are fully compliant with the Collection contract.
  * </p>
  * <p>
- * The method javadoc highlights the differences compared to the original Bag interface.
+ * The method Javadoc highlights the differences compared to the original Bag interface.
  * </p>
  *
  * @see Bag

src/main/java/org/apache/commons/collections4/bag/HashBag.java

@@ -30,7 +30,7 @@
  * A {@code Bag} stores each object in the collection together with a
  * count of occurrences. Extra methods on the interface allow multiple copies
  * of an object to be added or removed at once. It is important to read the
- * interface javadoc carefully as several methods violate the
+ * interface Javadoc carefully as several methods violate the
  * {@link Collection} interface specification.
  * </p>
  *

src/main/java/org/apache/commons/collections4/bag/TreeBag.java

@@ -38,7 +38,7 @@
  * A {@link org.apache.commons.collections4.Bag Bag} stores each object in the collection
  * together with a count of occurrences. Extra methods on the interface allow multiple
  * copies of an object to be added or removed at once. It is important to read the interface
- * javadoc carefully as several methods violate the {@link Collection} interface specification.
+ * Javadoc carefully as several methods violate the {@link Collection} interface specification.
  * </p>
  *
  * @param <E> the type of elements in this bag

src/main/java/org/apache/commons/collections4/bloomfilter/BloomFilter.java

@@ -216,7 +216,7 @@ default boolean isFull() {
      * shape and cardinality of this filter.</p>
      *
      * <p>This produces an estimate roughly equivalent to the number of Hashers that have been merged into the filter
-     * by rounding the value from the calculation described in the {@link Shape} class javadoc.</p>
+     * by rounding the value from the calculation described in the {@link Shape} class Javadoc.</p>
      *
      * <p><em>Note:</em></p>
      * <ul>
@@ -246,7 +246,7 @@ default int estimateN() {
      * Estimates the number of items in the union of this Bloom filter with the other bloom filter.
      *
      * <p>This produces an estimate roughly equivalent to the number of unique Hashers that have been merged into either
-     * of the filters by rounding the value from the calculation described in the {@link Shape} class javadoc.</p>
+     * of the filters by rounding the value from the calculation described in the {@link Shape} class Javadoc.</p>
      *
      * <p><em>{@code estimateUnion} should only be called with Bloom filters of the same Shape.  If called on Bloom
      * filters of differing shape this method is not symmetric. If {@code other} has more bits an {@code IllegalArgumentException}
@@ -269,7 +269,7 @@ default int estimateUnion(final BloomFilter other) {
      * Estimates the number of items in the intersection of this Bloom filter with the other bloom filter.
      *
      * <p>This method produces estimate is roughly equivalent to the number of unique Hashers that have been merged into both
-     * of the filters by rounding the value from the calculation described in the {@link Shape} class javadoc.</p>
+     * of the filters by rounding the value from the calculation described in the {@link Shape} class Javadoc.</p>
      *
      * <p><em>{@code estimateIntersection} should only be called with Bloom filters of the same Shape.  If called on Bloom
      * filters of differing shape this method is not symmetric. If {@code other} has more bits an {@code IllegalArgumentException}

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

@@ -177,7 +177,7 @@ public void add(final Object o) {
      * <b>Note:</b> {@link java.util.ListIterator} implementations that support
      * {@code add()} and {@code remove()} only allow {@code set()} to be called
      * once per call to {@code next()} or {@code previous} (see the {@link java.util.ListIterator}
-     * javadoc for more details). Since this implementation does
+     * Javadoc for more details). Since this implementation does
      * not support {@code add()} or {@code remove()}, {@code set()} may be
      * called as often as desired.
      *

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

@@ -167,7 +167,7 @@ public void add(final E obj) {
      * <b>Note:</b> {@link java.util.ListIterator} implementations that support {@code add()}
      * and {@code remove()} only allow {@code set()} to be called once per call
      * to {@code next()} or {@code previous} (see the {@link java.util.ListIterator}
-     * javadoc for more details). Since this implementation does not support
+     * Javadoc for more details). Since this implementation does not support
      * {@code add()} or {@code remove()}, {@code set()} may be
      * called as often as desired.
      *

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

@@ -508,7 +508,7 @@ public <T> T[] toArray(T[] array) {
             final E current = entry.getKey();
             final MutableInteger count = entry.getValue();
             for (int index = count.value; index > 0; index--) {
-                // unsafe, will throw ArrayStoreException if types are not compatible, see javadoc
+                // unsafe, will throw ArrayStoreException if types are not compatible, see Javadoc
                 @SuppressWarnings("unchecked")
                 final T unchecked = (T) current;
                 array[i++] = unchecked;

src/main/java/org/apache/commons/collections4/queue/AbstractQueueDecorator.java

@@ -30,7 +30,7 @@
  * to the backing object, but relies on Object's implementation. This is
  * necessary as some Queue implementations, e.g. LinkedList, have a custom
  * equals implementation for which symmetry can not be preserved.
- * See class javadoc of AbstractCollectionDecorator for more information.
+ * See class Javadoc of AbstractCollectionDecorator for more information.
  * </p>
  *
  * @param <E> the type of the elements in the queue