Javadoc: Use semantic tag <strong> instead of style tag <b>

Author: garydgregory

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

@@ -34,7 +34,7 @@
  * <p>
  * Unlike {@code Stack}, {@code ArrayStack} accepts null entries.
  * <p>
- * <b>Note:</b> From version 4.0 onwards, this class does not implement the
+ * <strong>Note:</strong> From version 4.0 onwards, this class does not implement the
  * removed {@code Buffer} interface anymore.
  * </p>
  *

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

@@ -1214,7 +1214,7 @@ public static boolean isEqualCollection(final Collection<?> a, final Collection<
      * for each element <em>e</em> in <em>a</em> or <em>b</em>.
      * </p>
      * <p>
-     * <b>Note:</b> from version 4.1 onwards this method requires the input
+     * <strong>Note:</strong> from version 4.1 onwards this method requires the input
      * collections and equator to be of compatible type (using bounded wildcards).
      * Providing incompatible arguments (e.g. by casting to their rawtypes)
      * will result in a {@code ClassCastException} thrown at runtime.
@@ -1404,7 +1404,7 @@ public static int maxSize(final Collection<? extends Object> collection) {
      * <p>
      * NOTE: the number of permutations of a given collection is equal to n!, where
      * n is the size of the collection. Thus, the resulting collection will become
-     * <b>very</b> large for collections &gt; 10 (e.g. 10! = 3628800, 15! = 1307674368000).
+     * <strong>very</strong> large for collections &gt; 10 (e.g. 10! = 3628800, 15! = 1307674368000).
      * </p>
      * <p>
      * For larger collections it is advised to use a {@link PermutationIterator} to
@@ -1792,7 +1792,7 @@ public static <O, R extends Collection<? super O>> R select(final Iterable<? ext
      * @param <O>  the type of object the {@link Iterable} contains
      * @param inputCollection  the collection to get the input from, may not be null
      * @param predicate  the predicate to use, may be null
-     * @return the elements <b>not</b> matching the predicate (new list)
+     * @return the elements <strong>not</strong> matching the predicate (new list)
      */
     public static <O> Collection<O> selectRejected(final Iterable<? extends O> inputCollection,
                                                    final Predicate<? super O> predicate) {
@@ -1962,7 +1962,7 @@ public static <O> Collection<O> subtract(final Iterable<? extends O> a, final It
      * minus the cardinality of <em>e</em> in <em>b</em>, or zero, whichever is greater.
      * </p>
      * <p>
-     * The cardinality of each element <em>e</em> in the returned {@link Collection} that does <b>not</b>
+     * The cardinality of each element <em>e</em> in the returned {@link Collection} that does <strong>not</strong>
      * satisfy the predicate condition will be equal to the cardinality of <em>e</em> in <em>a</em>.
      * </p>
      *

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

@@ -35,7 +35,7 @@
 /**
  * Provides utility methods and decorators for {@link Iterable} instances.
  * <p>
- * <b>Note</b>: This utility class has been designed with fail-fast argument checking.
+ * <strong>Note</strong>: This utility class has been designed with fail-fast argument checking.
  * </p>
  * <ul>
  * <li>All decorator methods are <em>not</em> null-safe for the provided Iterable argument; for example, they will throw a {@link NullPointerException} if a
@@ -685,7 +685,7 @@ public static <E> boolean matchesAny(final Iterable<E> iterable, final Predicate
      *  R = collection of elements rejected by all predicates
      * </pre>
      * <p>
-     * <b>Note</b>: elements are only added to the output collection of the first matching
+     * <strong>Note</strong>: elements are only added to the output collection of the first matching
      * predicate, determined by the order of arguments.
      * </p>
      * <p>
@@ -818,7 +818,7 @@ public static <O> List<List<O>> partition(final Iterable<? extends O> iterable,
      *  R = collection of elements rejected by all predicates
      * </pre>
      * <p>
-     * <b>Note</b>: elements are only added to the output collection of the first matching
+     * <strong>Note</strong>: elements are only added to the output collection of the first matching
      * predicate, determined by the order of arguments.
      * </p>
      * <p>

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

@@ -309,7 +309,7 @@ public static <E> List<E> intersection(final List<? extends E> list1, final List
      * different implementations of the {@code List} interface.
      * </blockquote>
      * <p>
-     * <b>Note:</b> The behavior of this method is undefined if the lists are
+     * <strong>Note:</strong> The behavior of this method is undefined if the lists are
      * modified during the equals comparison.
      * </p>
      *
@@ -625,7 +625,7 @@ public static <E> List<E> select(final Collection<? extends E> inputCollection,
      * @param <E> the element type
      * @param inputCollection the collection to get the input from, may not be null
      * @param predicate the predicate to use, may be null
-     * @return the elements <b>not</b> matching the predicate (new list)
+     * @return the elements <strong>not</strong> matching the predicate (new list)
      * @throws NullPointerException if the input collection is null
      *
      * @since 4.0

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

@@ -37,7 +37,7 @@ public interface ListValuedMap<K, V> extends MultiValuedMap<K, V> {
     /**
      * Gets the list of values associated with the specified key.
      * <p>
-     * This method will return an <b>empty</b> list if
+     * This method will return an <strong>empty</strong> list if
      * {@link #containsKey(Object)} returns {@code false}. Changes to the
      * returned list will update the underlying {@code ListValuedMap} and
      * vice-versa.

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

@@ -128,7 +128,7 @@ public interface MultiValuedMap<K, V> {
     /**
      * Returns a view collection of the values associated with the specified key.
      * <p>
-     * This method will return an <b>empty</b> collection if {@link #containsKey(Object)}
+     * This method will return an <strong>empty</strong> collection if {@link #containsKey(Object)}
      * returns {@code false}. Changes to the returned collection will update the underlying
      * {@code MultiValuedMap} and vice-versa.
      * </p>

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

@@ -49,7 +49,7 @@
 public class SetUtils {
 
     /**
-     * An unmodifiable <b>view</b> of a set that may be backed by other sets.
+     * An unmodifiable <strong>view</strong> of a set that may be backed by other sets.
      * <p>
      * If the decorated sets change, this view will change as well. The contents
      * of this view can be transferred to another instance via the {@link #copyInto(Set)}
@@ -109,7 +109,7 @@ public Set<E> toSet() {
             UnmodifiableSortedSet.unmodifiableSortedSet(new TreeSet<>());
 
     /**
-     * Returns an unmodifiable <b>view</b> containing the difference of the given
+     * Returns an unmodifiable <strong>view</strong> containing the difference of the given
      * {@link Set}s, denoted by {@code a \ b} (or {@code a - b}).
      * <p>
      * The returned view contains all elements of {@code a} that are not a member
@@ -142,7 +142,7 @@ public Iterator<E> createIterator() {
     }
 
     /**
-     * Returns an unmodifiable <b>view</b> of the symmetric difference of the given
+     * Returns an unmodifiable <strong>view</strong> of the symmetric difference of the given
      * {@link Set}s.
      * <p>
      * The returned view contains all elements of {@code a} and {@code b} that are
@@ -261,7 +261,7 @@ public static <E> HashSet<E> hashSet(final E... items) {
     }
 
     /**
-     * Returns an unmodifiable <b>view</b> of the intersection of the given {@link Set}s.
+     * Returns an unmodifiable <strong>view</strong> of the intersection of the given {@link Set}s.
      * <p>
      * The returned view contains all elements that are members of both input sets
      * ({@code a} and {@code b}).
@@ -548,7 +548,7 @@ public static <E> SortedSet<E> transformedSortedSet(final SortedSet<E> set,
     // Set operations
 
     /**
-     * Returns an unmodifiable <b>view</b> of the union of the given {@link Set}s.
+     * Returns an unmodifiable <strong>view</strong> of the union of the given {@link Set}s.
      * <p>
      * The returned view contains all elements of {@code a} and {@code b}.
      *

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

@@ -112,7 +112,7 @@ public boolean addAll(final Collection<? extends E> coll) {
     /**
      * <em>(Change)</em>
      * Returns {@code true} if the bag contains all elements in
-     * the given collection, <b>not</b> respecting cardinality. That is,
+     * the given collection, <strong>not</strong> respecting cardinality. That is,
      * if the given collection {@code coll} contains at least one of
      * every object contained in this object.
      *
@@ -157,7 +157,7 @@ public boolean remove(final Object object) {
     /**
      * <em>(Change)</em>
      * Remove all elements represented in the given collection,
-     * <b>not</b> respecting cardinality. That is, remove <em>all</em>
+     * <strong>not</strong> respecting cardinality. That is, remove <em>all</em>
      * occurrences of every object contained in the given collection.
      *
      * @param coll  the collection to remove

src/main/java/org/apache/commons/collections4/collection/AbstractCollectionDecorator.java

@@ -153,7 +153,7 @@ public boolean retainAll(final Collection<?> coll) {
     /**
      * Sets the collection being decorated.
      * <p>
-     * <b>NOTE:</b> this method should only be used during deserialization
+     * <strong>NOTE:</strong> this method should only be used during deserialization
      *
      * @param collection  the decorated collection
      */

src/main/java/org/apache/commons/collections4/comparators/ReverseComparator.java

@@ -42,7 +42,7 @@ public class ReverseComparator<E> implements Comparator<E>, Serializable {
      * Creates a comparator that compares objects based on the inverse of their
      * natural ordering.  Using this Constructor will create a ReverseComparator
      * that is functionally identical to the Comparator returned by
-     * java.util.Collections.<b>reverseOrder()</b>.
+     * java.util.Collections.<strong>reverseOrder()</strong>.
      *
      * @see java.util.Collections#reverseOrder()
      */