Fix malformed Javadoc comments

Author: garydgregory

commons-numbers-arrays/src/main/java/org/apache/commons/numbers/arrays/IndexSupport.java

@@ -252,10 +252,10 @@ static int countIndices(UpdatingInterval keys, int n) {
      * <p>The sub-range is defined to be out of bounds if any of the following
      * inequalities is true:
      * <ul>
-     * <li>{@code fromIndex < 0}
-     * <li>{@code fromIndex > toIndex}
-     * <li>{@code toIndex > length}
-     * <li>{@code length < 0}, which is implied from the former inequalities
+     * <li>{@code fromIndex < 0}</li>
+     * <li>{@code fromIndex > toIndex}</li>
+     * <li>{@code toIndex > length}</li>
+     * <li>{@code length < 0}, which is implied from the former inequalities</li>
      * </ul>
      *
      * @param fromIndex Lower-bound (inclusive) of the sub-range.

commons-numbers-arrays/src/main/java/org/apache/commons/numbers/arrays/KeyUpdatingInterval.java

@@ -143,10 +143,10 @@ int size() {
      * <p>This is similar to using {@link java.util.Arrays#binarySearch(int[], int, int, int)
      * Arrays.binarySearch}. The method differs in:
      * <ul>
-     * <li>use of an inclusive upper bound;
-     * <li>returning the closest index with a value below {@code key} if no match was not found;
+     * <li>use of an inclusive upper bound;</li>
+     * <li>returning the closest index with a value below {@code key} if no match was not found;</li>
      * <li>performing no range checks: it is assumed {@code left <= right} and they are valid
-     * indices into the array.
+     * indices into the array.</li>
      * </ul>
      *
      * <p>An equivalent use of binary search is:

commons-numbers-arrays/src/main/java/org/apache/commons/numbers/arrays/QuickSelect.java

@@ -1276,10 +1276,10 @@ static void dualPivotQuickSelect(double[] a, int left, int right, UpdatingInterv
      * }</pre>
      *
      * <ul>
-     * <li>k0: lower pivot1 point
-     * <li>k1: upper pivot1 point (inclusive)
-     * <li>k2: lower pivot2 point
-     * <li>k3: upper pivot2 point (inclusive)
+     * <li>k0: lower pivot1 point</li>
+     * <li>k1: upper pivot1 point (inclusive)</li>
+     * <li>k2: lower pivot2 point</li>
+     * <li>k3: upper pivot2 point (inclusive)</li>
      * </ul>
      *
      * <p>Bounds are set so {@code i < k0}, {@code i > k3} and {@code k1 < i < k2} are
@@ -2535,10 +2535,10 @@ static void dualPivotQuickSelect(int[] a, int left, int right, UpdatingInterval
      * }</pre>
      *
      * <ul>
-     * <li>k0: lower pivot1 point
-     * <li>k1: upper pivot1 point (inclusive)
-     * <li>k2: lower pivot2 point
-     * <li>k3: upper pivot2 point (inclusive)
+     * <li>k0: lower pivot1 point</li>
+     * <li>k1: upper pivot1 point (inclusive)</li>
+     * <li>k2: lower pivot2 point</li>
+     * <li>k3: upper pivot2 point (inclusive)</li>
      * </ul>
      *
      * <p>Bounds are set so {@code i < k0}, {@code i > k3} and {@code k1 < i < k2} are

commons-numbers-arrays/src/main/java/org/apache/commons/numbers/arrays/Selection.java

@@ -91,29 +91,29 @@
  * <ol>
  * <li>Hoare (1961)
  * Algorithm 65: Find
- * <a href="https://doi.org/10.1145%2F366622.366647">Comm. ACM. 4 (7): 321–322</a>
+ * <a href="https://doi.org/10.1145%2F366622.366647">Comm. ACM. 4 (7): 321–322</a></li>
  * <li>Musser (1999)
  * Introspective Sorting and Selection Algorithms
  * <a href="https://doi.org/10.1002/(SICI)1097-024X(199708)27:8%3C983::AID-SPE117%3E3.0.CO;2-%23">
- * Software: Practice and Experience 27, 983-993.</a>
+ * Software: Practice and Experience 27, 983-993.</a></li>
  * <li>Floyd and Rivest (1975)
  * Algorithm 489: The Algorithm SELECT—for Finding the ith Smallest of n elements.
- * Comm. ACM. 18 (3): 173.
+ * Comm. ACM. 18 (3): 173.</li>
  * <li>Kiwiel (2005)
  * On Floyd and Rivest's SELECT algorithm.
- * Theoretical Computer Science 347, 214-238.
+ * Theoretical Computer Science 347, 214-238.</li>
  * <li>Blum, Floyd, Pratt, Rivest, and Tarjan (1973)
  * Time bounds for selection.
  * <a href="https://doi.org/10.1016%2FS0022-0000%2873%2980033-9">
- * Journal of Computer and System Sciences. 7 (4): 448–461</a>.
+ * Journal of Computer and System Sciences. 7 (4): 448–461</a>.</li>
  * <li>Alexandrescu (2016)
  * Fast Deterministic Selection
- * <a href="https://arxiv.org/abs/1606.00484">arXiv:1606.00484</a>.
- * <li><a href="https://en.wikipedia.org/wiki/Quickselect">Quickselect (Wikipedia)</a>
- * <li><a href="https://en.wikipedia.org/wiki/Introsort">Introsort (Wikipedia)</a>
- * <li><a href="https://en.wikipedia.org/wiki/Introselect">Introselect (Wikipedia)</a>
- * <li><a href="https://en.wikipedia.org/wiki/Floyd%E2%80%93Rivest_algorithm">Floyd-Rivest algorithm (Wikipedia)</a>
- * <li><a href="https://en.wikipedia.org/wiki/Median_of_medians">Median of medians (Wikipedia)</a>
+ * <a href="https://arxiv.org/abs/1606.00484">arXiv:1606.00484</a>.</li>
+ * <li><a href="https://en.wikipedia.org/wiki/Quickselect">Quickselect (Wikipedia)</a></li>
+ * <li><a href="https://en.wikipedia.org/wiki/Introsort">Introsort (Wikipedia)</a></li>
+ * <li><a href="https://en.wikipedia.org/wiki/Introselect">Introselect (Wikipedia)</a></li>
+ * <li><a href="https://en.wikipedia.org/wiki/Floyd%E2%80%93Rivest_algorithm">Floyd-Rivest algorithm (Wikipedia)</a></li>
+ * <li><a href="https://en.wikipedia.org/wiki/Median_of_medians">Median of medians (Wikipedia)</a></li>
  * </ol>
  *
  * @since 1.2

commons-numbers-arrays/src/main/java/org/apache/commons/numbers/arrays/UpdatingInterval.java

@@ -22,9 +22,9 @@
  * <p>The interval provides the following functionality:
  *
  * <ul>
- * <li>Return the supported bounds of the interval {@code [left <= right]}.
- * <li>Update the left or right bound of the interval using an index {@code k} inside the interval.
- * <li>Split the interval around two indices {@code k1} and {@code k2}.
+ * <li>Return the supported bounds of the interval {@code [left <= right]}.</li>
+ * <li>Update the left or right bound of the interval using an index {@code k} inside the interval.</li>
+ * <li>Split the interval around two indices {@code k1} and {@code k2}.</li>
  * </ul>
  *
  * <p>Note that the interval provides the supported bounds. If an search index {@code k} is

commons-numbers-combinatorics/src/main/java/org/apache/commons/numbers/combinatorics/Stirling.java

@@ -271,9 +271,9 @@ private static void checkN(int n, int k, int threshold, String msgFormat) {
      * Return {@code a*b/4} without intermediate overflow.
      * It is assumed that:
      * <ul>
-     * <li>The coefficients a and b are positive
-     * <li>The product (a*b) is an exact multiple of 4
-     * <li>The result (a*b/4) is an exact integer that does not overflow a {@code long}
+     * <li>The coefficients a and b are positive</li>
+     * <li>The product (a*b) is an exact multiple of 4</li>
+     * <li>The result (a*b/4) is an exact integer that does not overflow a {@code long}</li>
      * </ul>
      *
      * <p>A conditional branch is performed on the odd/even property of {@code b}.