This is an automated email from the ASF dual-hosted git repository.

ggregory pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-rng.git


The following commit(s) were added to refs/heads/master by this push:
     new e1ba680f Fix malformed Javadoc comments
e1ba680f is described below

commit e1ba680feefa3de4bf27237dd83407a865440090
Author: Gary Gregory <[email protected]>
AuthorDate: Sat Dec 13 15:51:23 2025 -0500

    Fix malformed Javadoc comments
---
 .../commons/rng/UniformRandomProviderSupport.java  | 12 +++++-----
 .../org/apache/commons/rng/core/BaseProvider.java  |  8 +++----
 .../commons/rng/core/source32/IntProvider.java     |  8 +++----
 .../core/source32/MiddleSquareWeylSequence.java    |  6 ++---
 .../commons/rng/core/util/RandomStreams.java       |  8 +++----
 .../jmh/core/BaselineGenerationPerformance.java    | 10 ++++----
 .../rng/examples/jmh/core/LXMBenchmark.java        | 18 +++++++-------
 .../commons/rng/examples/jmh/package-info.java     |  6 ++---
 .../jmh/sampling/ArrayShuffleBenchmark.java        |  2 +-
 .../distribution/StableSamplerPerformance.java     | 10 ++++----
 .../sampling/ExamplesSamplingApplication.java      |  4 ++--
 .../examples/stress/AlphaNumericComparator.java    |  6 ++---
 .../examples/stress/ExamplesStressApplication.java | 10 ++++----
 .../commons/rng/examples/stress/ListCommand.java   |  4 ++--
 .../commons/rng/examples/stress/RNGUtils.java      |  2 +-
 .../rng/examples/stress/ResultsCommand.java        |  4 ++--
 .../rng/examples/stress/StressTestData.java        |  8 +++----
 .../apache/commons/rng/sampling/ArraySampler.java  | 10 ++++----
 .../commons/rng/sampling/CompositeSamplers.java    |  8 +++----
 .../commons/rng/sampling/UnitSphereSampler.java    |  4 ++--
 .../AhrensDieterExponentialSampler.java            |  4 ++--
 .../AhrensDieterMarsagliaTsangGammaSampler.java    |  4 ++--
 .../distribution/BoxMullerGaussianSampler.java     |  4 ++--
 .../distribution/BoxMullerLogNormalSampler.java    |  4 ++--
 .../BoxMullerNormalizedGaussianSampler.java        |  4 ++--
 .../sampling/distribution/DirichletSampler.java    |  4 ++--
 .../FastLoadedDiceRollerDiscreteSampler.java       |  8 +++----
 .../distribution/LargeMeanPoissonSampler.java      |  4 ++--
 .../MarsagliaTsangWangDiscreteSampler.java         |  6 ++---
 .../rng/sampling/distribution/PoissonSampler.java  |  4 ++--
 .../sampling/distribution/PoissonSamplerCache.java | 18 +++++++-------
 .../rng/sampling/distribution/StableSampler.java   | 24 +++++++++----------
 .../ZigguratNormalizedGaussianSampler.java         |  4 ++--
 .../rng/sampling/distribution/ZigguratSampler.java | 28 +++++++++++-----------
 .../commons/rng/sampling/shape/BoxSampler.java     |  2 +-
 .../commons/rng/sampling/shape/LineSampler.java    |  2 +-
 .../rng/sampling/shape/TetrahedronSampler.java     |  2 +-
 .../rng/sampling/shape/TriangleSampler.java        |  2 +-
 .../rng/sampling/shape/UnitBallSampler.java        |  4 ++--
 39 files changed, 140 insertions(+), 140 deletions(-)

diff --git 
a/commons-rng-client-api/src/main/java/org/apache/commons/rng/UniformRandomProviderSupport.java
 
b/commons-rng-client-api/src/main/java/org/apache/commons/rng/UniformRandomProviderSupport.java
index e4039c0c..e1a58102 100644
--- 
a/commons-rng-client-api/src/main/java/org/apache/commons/rng/UniformRandomProviderSupport.java
+++ 
b/commons-rng-client-api/src/main/java/org/apache/commons/rng/UniformRandomProviderSupport.java
@@ -167,19 +167,19 @@ final class UniformRandomProviderSupport {
      * <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 size < 0}
-     * <li>{@code fromIndex + size > length}, taking into account integer 
overflow
-     * <li>{@code length < 0}, which is implied from the former inequalities
+     * <li>{@code fromIndex < 0}</li>
+     * <li>{@code size < 0}</li>
+     * <li>{@code fromIndex + size > length}, taking into account integer 
overflow</li>
+     * <li>{@code length < 0}, which is implied from the former 
inequalities</li>
      * </ul>
      *
      * <p>Note: This is not an exact implementation of the functionality of
      * {@code Objects.checkFromIndexSize}. The following changes have been 
made:
      * <ul>
      * <li>The method signature has been changed to avoid the return of {@code 
fromIndex};
-     * this value is not used within this package.
+     * this value is not used within this package.</li>
      * <li>No checks are made for {@code length < 0} as this is assumed to be 
derived from
-     * an array length.
+     * an array length.</li>
      * </ul>
      *
      * @param fromIndex the lower-bound (inclusive) of the sub-interval
diff --git 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/BaseProvider.java 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/BaseProvider.java
index 30f9cbf1..991aed43 100644
--- 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/BaseProvider.java
+++ 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/BaseProvider.java
@@ -296,8 +296,8 @@ public abstract class BaseProvider
      * Extend the seed to the specified minimum length. If the seed is equal 
or greater than the
      * minimum length, return the same seed unchanged. Otherwise:
      * <ol>
-     *  <li>Create a new array of the specified length
-     *  <li>Copy all elements of the seed into the array
+     *  <li>Create a new array of the specified length</li>
+     *  <li>Copy all elements of the seed into the array</li>
      *  <li>Fill the remaining values. The additional values will have at most 
one occurrence
      *   of zero. If the original seed is all zero, the first extended value 
will be non-zero.
      *  </li>
@@ -355,8 +355,8 @@ public abstract class BaseProvider
      * Extend the seed to the specified minimum length. If the seed is equal 
or greater than the
      * minimum length, return the same seed unchanged. Otherwise:
      * <ol>
-     *  <li>Create a new array of the specified length
-     *  <li>Copy all elements of the seed into the array
+     *  <li>Create a new array of the specified length</li>
+     *  <li>Copy all elements of the seed into the array</li>
      *  <li>Fill the remaining values. The additional values will have at most 
one occurrence
      *   of zero. If the original seed is all zero, the first extended value 
will be non-zero.
      *  </li>
diff --git 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/IntProvider.java
 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/IntProvider.java
index cbf4a857..8bd4ccc4 100644
--- 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/IntProvider.java
+++ 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/IntProvider.java
@@ -202,10 +202,10 @@ public abstract class IntProvider
      * <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 size < 0}
-     * <li>{@code fromIndex + size > length}, taking into account integer 
overflow
-     * <li>{@code length < 0}, which is implied from the former inequalities
+     * <li>{@code fromIndex < 0}</li>
+     * <li>{@code size < 0}</li>
+     * <li>{@code fromIndex + size > length}, taking into account integer 
overflow</li>
+     * <li>{@code length < 0}, which is implied from the former 
inequalities</li>
      * </ul>
      *
      * @param fromIndex the lower-bound (inclusive) of the sub-interval
diff --git 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/MiddleSquareWeylSequence.java
 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/MiddleSquareWeylSequence.java
index 3761b475..a9453cc8 100644
--- 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/MiddleSquareWeylSequence.java
+++ 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/source32/MiddleSquareWeylSequence.java
@@ -63,9 +63,9 @@ public class MiddleSquareWeylSequence extends IntProvider {
      * The seed elements are used to set:</p>
      *
      * <ol>
-     *   <li>The state of the generator
-     *   <li>The state of the Weyl sequence
-     *   <li>The increment of the Weyl sequence
+     *   <li>The state of the generator</li>
+     *   <li>The state of the Weyl sequence</li>
+     *   <li>The increment of the Weyl sequence</li>
      * </ol>
      *
      * <p>The third element is set to odd to ensure a period of at least 
2<sup>64</sup>. If the
diff --git 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/util/RandomStreams.java
 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/util/RandomStreams.java
index b4c3995e..f8bfb60e 100644
--- 
a/commons-rng-core/src/main/java/org/apache/commons/rng/core/util/RandomStreams.java
+++ 
b/commons-rng-core/src/main/java/org/apache/commons/rng/core/util/RandomStreams.java
@@ -96,10 +96,10 @@ public final class RandomStreams {
      * Creates a seed to prepend to a counter. The seed is created to satisfy 
the following
      * requirements:
      * <ul>
-     * <li>The least significant bit is set
-     * <li>The seed is composed of characters from an n-bit alphabet
-     * <li>The character used in the least significant bits is unique
-     * <li>The other characters are sampled uniformly from the remaining (n-1) 
characters
+     * <li>The least significant bit is set</li>
+     * <li>The seed is composed of characters from an n-bit alphabet</li>
+     * <li>The character used in the least significant bits is unique</li>
+     * <li>The other characters are sampled uniformly from the remaining (n-1) 
characters</li>
      * </ul>
      *
      * <p>The composed seed is created using {@code ((seed << shift) | count)}
diff --git 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/BaselineGenerationPerformance.java
 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/BaselineGenerationPerformance.java
index f3535e1e..4ac24004 100644
--- 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/BaselineGenerationPerformance.java
+++ 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/BaselineGenerationPerformance.java
@@ -41,8 +41,8 @@ import java.util.concurrent.TimeUnit;
  * baseline will:</p>
  *
  * <ul>
- *  <li>Run as fast as possible
- *  <li>Not be removed from the execution path
+ *  <li>Run as fast as possible</li>
+ *  <li>Not be removed from the execution path</li>
  * </ul>
  *
  * <p>The results of this benchmark should be plotted for each method using 
[numValues] vs [run time]
@@ -62,12 +62,12 @@ public class BaselineGenerationPerformance {
      *
      * <ul>
      *   <li>The number of bytes will be allocated when testing so the 
allocation overhead
-     *   should be small.
+     *   should be small.</li>
      *   <li>The number must be set so that filling the bytes from an {@code 
int} or {@code long}
      *   source has no advantage for the 32-bit source, e.g. the same number 
of underlying bits have
-     *   to be generated. Note: 127 / 4 ~ 32 ints or 127 / 8 ~ 16 longs.
+     *   to be generated. Note: 127 / 4 ~ 32 ints or 127 / 8 ~ 16 longs.</li>
      *   <li>The number should not be a factor of 4 to prevent filling 
completely using a 32-bit
-     *   source. This tests the edge case of partial fill.
+     *   source. This tests the edge case of partial fill.</li>
      * </ul>
      */
     static final int NEXT_BYTES_SIZE = 127;
diff --git 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/LXMBenchmark.java
 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/LXMBenchmark.java
index 333e24ef..0935c7e3 100644
--- 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/LXMBenchmark.java
+++ 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/core/LXMBenchmark.java
@@ -647,17 +647,17 @@ public class LXMBenchmark {
          *
          * <p>Notes:
          * <ul>
-         * <li>Final LCG additive parameters make no significant difference.
-         * <li>Inlining the compareUnsigned operation is a marginal 
improvement.
+         * <li>Final LCG additive parameters make no significant 
difference.</li>
+         * <li>Inlining the compareUnsigned operation is a marginal 
improvement.</li>
          * <li>Using the conditional load of the addition is of benefit when 
the add parameter
          *     is close to 2^63. When close to 0 or 2^64 then branch 
prediction is good and
-         *     this path is fast.
+         *     this path is fast.</li>
          * <li>Using the full branchless version creates code with a constant 
time cost which
          *     is fast. The branch code is faster when the branch is ~100% 
predictable, but can
-         *     be much slower.
+         *     be much slower.</li>
          * <li>The branchless version assuming the add parameter is odd is 
constant time cost
          *     and fastest. The code is very small and putting it in a method 
will be inlined
-         *     and allows code reuse.
+         *     and allows code reuse.</li>
          * </ul>
          */
         @Param({
@@ -695,10 +695,10 @@ public class LXMBenchmark {
         /**
          * Range for a random addition to the additive parameter.
          * <ul>
-         * <li>{@code range == 0}: no addition
-         * <li>{@code range == Long.MIN_VALUE}: random addition
-         * <li>{@code range > 0}: random in [0, range)
-         * <li>{@code range < 0}: random in [0, -range) + 2^63
+         * <li>{@code range == 0}: no addition</li>
+         * <li>{@code range == Long.MIN_VALUE}: random addition</li>
+         * <li>{@code range > 0}: random in [0, range)</li>
+         * <li>{@code range < 0}: random in [0, -range) + 2^63</li>
          * </ul>
          */
         @Param({
diff --git 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/package-info.java
 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/package-info.java
index 25f21997..cfbf122c 100644
--- 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/package-info.java
+++ 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/package-info.java
@@ -26,10 +26,10 @@
  * </p>
  *
  * <ul>
- *   <li>The {@link org.apache.commons.rng.examples.jmh.RandomSourceValues 
RandomSourceValues} class
- *   <li>The {@link org.apache.commons.rng.examples.jmh.core.BaselineSources 
BaselineSources} class
+ *   <li>The {@link org.apache.commons.rng.examples.jmh.RandomSourceValues 
RandomSourceValues} class</li>
+ *   <li>The {@link org.apache.commons.rng.examples.jmh.core.BaselineSources 
BaselineSources} class</li>
  *   <li>The {@link 
org.apache.commons.rng.examples.jmh.simple.ConstructionPerformance
- *       ConstructionPerformance} class
+ *       ConstructionPerformance} class</li>
  * </ul>
  */
 package org.apache.commons.rng.examples.jmh;
diff --git 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/ArrayShuffleBenchmark.java
 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/ArrayShuffleBenchmark.java
index 264e7291..e4acf279 100644
--- 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/ArrayShuffleBenchmark.java
+++ 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/ArrayShuffleBenchmark.java
@@ -47,7 +47,7 @@ import org.openjdk.jmh.annotations.Warmup;
  * <ul>
  * <li>Nevin Brackett-Rozinsky, Daniel Lemire,
  * Batched Ranged Random Integer Generation, Software: Practice and Experience 
(to appear)
- * <a href="https://arxiv.org/abs/2408.06213";>arXiv:2408.06213M</a>
+ * <a href="https://arxiv.org/abs/2408.06213";>arXiv:2408.06213M</a></li>
  * </ul>
  */
 @BenchmarkMode(Mode.AverageTime)
diff --git 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/StableSamplerPerformance.java
 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/StableSamplerPerformance.java
index d8800a59..1d3046ac 100644
--- 
a/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/StableSamplerPerformance.java
+++ 
b/commons-rng-examples/examples-jmh/src/main/java/org/apache/commons/rng/examples/jmh/sampling/distribution/StableSamplerPerformance.java
@@ -65,12 +65,12 @@ public class StableSamplerPerformance {
      * This is a translation of the FORTRAN routine RSTAB; it computes a 
rearrangement
      * of the original formula to use double-angle identities and output a 
0-parameterization
      * stable deviate.
-     *
+     *</li>
      * <li>The implementation uses the Chambers-Mallows-Stuck (CMS) method 
using
      * the formula proven in Weron (1996) "On the Chambers-Mallows-Stuck 
method for
      * simulating skewed stable random variables". Statistics &amp; Probability
      * Letters. 28 (2): 165–171. This outputs a 1-parameterization stable 
deviate and
-     * has been modified to the 0-parameterization using a translation.
+     * has been modified to the 0-parameterization using a translation.</li>
      * </ol>
      *
      * <p>The code has been copied from 
o.a.c.rng.sampling.distributions.StableSampler.
@@ -1088,9 +1088,9 @@ public class StableSamplerPerformance {
          * a result in {@code [0, inf]}.
          *
          * <ul>
-         * <li>For {@code x=-inf} this returns {@code 0}.
-         * <li>For {@code x=0} this returns {@code 1}.
-         * <li>For {@code x=inf} this returns {@code inf}.
+         * <li>For {@code x=-inf} this returns {@code 0}.</li>
+         * <li>For {@code x=0} this returns {@code 1}.</li>
+         * <li>For {@code x=inf} this returns {@code inf}.</li>
          * </ul>
          *
          * <p> This corrects {@code 0 / 0} and {@code inf / inf} division from
diff --git 
a/commons-rng-examples/examples-sampling/src/main/java/org/apache/commons/rng/examples/sampling/ExamplesSamplingApplication.java
 
b/commons-rng-examples/examples-sampling/src/main/java/org/apache/commons/rng/examples/sampling/ExamplesSamplingApplication.java
index 35bdd208..7dac432f 100644
--- 
a/commons-rng-examples/examples-sampling/src/main/java/org/apache/commons/rng/examples/sampling/ExamplesSamplingApplication.java
+++ 
b/commons-rng-examples/examples-sampling/src/main/java/org/apache/commons/rng/examples/sampling/ExamplesSamplingApplication.java
@@ -24,8 +24,8 @@ import picocli.CommandLine;
  * <p>Functionality includes:</p>
  *
  * <ul>
- *   <li>Creating a PDF approximation using sample data from a distribution
- *   <li>Sampling from a small range from a distribution to visually inspect 
sampling density
+ *   <li>Creating a PDF approximation using sample data from a 
distribution</li>
+ *   <li>Sampling from a small range from a distribution to visually inspect 
sampling density</li>
  * </ul>
  */
 public final class ExamplesSamplingApplication {
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/AlphaNumericComparator.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/AlphaNumericComparator.java
index 35de79b9..476cf29c 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/AlphaNumericComparator.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/AlphaNumericComparator.java
@@ -38,9 +38,9 @@ import java.util.Comparator;
  * <p>This implementation supports:</p>
  *
  * <ul>
- *  <li>{@link CharSequence} comparison
- *  <li>Direct use of input sequences for minimal memory consumption
- *  <li>Numbers with leading zeros
+ *  <li>{@link CharSequence} comparison</li>
+ *  <li>Direct use of input sequences for minimal memory consumption</li>
+ *  <li>Numbers with leading zeros</li>
  * </ul>
  *
  * <p>Any null sequences are ordered before non-null sequences.</p>
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ExamplesStressApplication.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ExamplesStressApplication.java
index ffeee51e..b366731d 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ExamplesStressApplication.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ExamplesStressApplication.java
@@ -37,11 +37,11 @@ import picocli.CommandLine.RunLast;
  * <p>Other functionality includes:</p>
  *
  * <ul>
- *   <li>Listing all the available generators
- *   <li>Collating results from known stress test applications
- *   <li>Outputting data from a random generator
- *   <li>Showing the platform native byte order
- *   <li>Testing data transfer to an application sub-process via its standard 
input
+ *   <li>Listing all the available generators</li>
+ *   <li>Collating results from known stress test applications</li>
+ *   <li>Outputting data from a random generator</li>
+ *   <li>Showing the platform native byte order</li>
+ *   <li>Testing data transfer to an application sub-process via its standard 
input</li>
  * </ul>
  */
 public final class ExamplesStressApplication {
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ListCommand.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ListCommand.java
index d1b2816c..ca5b2b72 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ListCommand.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ListCommand.java
@@ -163,9 +163,9 @@ class ListCommand implements Callable<Void> {
      * <p>Performs adjustment of the number of trials for each item:
      *
      * <ul>
-     *   <li>Any item with trials {@code <= 0} will be written as zero.
+     *   <li>Any item with trials {@code <= 0} will be written as zero.</li>
      *   <li>Any item with trials {@code > 0} will be written as the maximum 
of the value and
-     *       the input parameter {@code numberOfTrials}.
+     *       the input parameter {@code numberOfTrials}.</li>
      * </ul>
      *
      * <p>This allows the output to contain a configurable number of trials 
for the
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/RNGUtils.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/RNGUtils.java
index c511577d..f747e3ba 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/RNGUtils.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/RNGUtils.java
@@ -536,7 +536,7 @@ final class RNGUtils {
      * Parses the argument into an object suitable for the RandomSource 
constructor. Supports:
      *
      * <ul>
-     *   <li>Integer
+     *   <li>Integer</li>
      * </ul>
      *
      * @param argument the argument
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ResultsCommand.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ResultsCommand.java
index d5d7f9c6..e41a29a8 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ResultsCommand.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/ResultsCommand.java
@@ -57,8 +57,8 @@ import java.util.stream.Collectors;
  * <p>This command creates a summary of the results from known test 
applications.</p>
  *
  * <ul>
- *   <li>Dieharder
- *   <li>Test U01 (BigCrush, Crush, SmallCrush)
+ *   <li>Dieharder</li>
+ *   <li>Test U01 (BigCrush, Crush, SmallCrush)</li>
  * </ul>
  */
 @Command(name = "results",
diff --git 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/StressTestData.java
 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/StressTestData.java
index b946eb39..97e29f52 100644
--- 
a/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/StressTestData.java
+++ 
b/commons-rng-examples/examples-stress/src/main/java/org/apache/commons/rng/examples/stress/StressTestData.java
@@ -23,10 +23,10 @@ import org.apache.commons.rng.simple.RandomSource;
  * Encapsulate the data needed to create and test a random generator. This 
includes:
  *
  * <ul>
- *   <li>An identifier for the random source
- *   <li>The random source
- *   <li>The constructor arguments
- *   <li>The number of trials for each random source
+ *   <li>An identifier for the random source</li>
+ *   <li>The random source</li>
+ *   <li>The constructor arguments</li>
+ *   <li>The number of trials for each random source</li>
  * </ul>
  */
 class StressTestData {
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/ArraySampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/ArraySampler.java
index 86886705..9217ddab 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/ArraySampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/ArraySampler.java
@@ -31,7 +31,7 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <ul>
  * <li>Nevin Brackett-Rozinsky, Daniel Lemire,
  * Batched Ranged Random Integer Generation, Software: Practice and Experience 
(to appear)
- * <a href="https://arxiv.org/abs/2408.06213";>arXiv:2408.06213M</a>
+ * <a href="https://arxiv.org/abs/2408.06213";>arXiv:2408.06213M</a></li>
  * </ul>
  *
  * @since 1.6
@@ -725,10 +725,10 @@ public final class ArraySampler {
      * <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.
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/CompositeSamplers.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/CompositeSamplers.java
index de05e602..b2e8eee8 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/CompositeSamplers.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/CompositeSamplers.java
@@ -41,8 +41,8 @@ import 
org.apache.commons.rng.sampling.distribution.SharedStateLongSampler;
  * Samples are returned using a 2 step algorithm:
  *
  * <ol>
- *  <li>Select a sampler based on its weighting
- *  <li>Return a sample from the selected sampler
+ *  <li>Select a sampler based on its weighting</li>
+ *  <li>Return a sample from the selected sampler</li>
  * </ol>
  *
  * <p>The weights used for each sampler create a discrete probability 
distribution. This is
@@ -171,8 +171,8 @@ public final class CompositeSamplers {
      * Samples are returned using a 2 step algorithm:
      *
      * <ol>
-     *  <li>Select a sampler based on its weighting
-     *  <li>Return a sample from the selected sampler
+     *  <li>Select a sampler based on its weighting</li>
+     *  <li>Return a sample from the selected sampler</li>
      * </ol>
      *
      * <p>Step 1 requires a discrete sampler constructed from a discrete 
probability distribution.
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/UnitSphereSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/UnitSphereSampler.java
index c689b5d8..bdcef4ac 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/UnitSphereSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/UnitSphereSampler.java
@@ -28,8 +28,8 @@ import 
org.apache.commons.rng.sampling.distribution.ZigguratSampler;
  * <p>Sampling in 2 or more dimensions uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * <p>Sampling in 1D uses the sign bit from {@link 
UniformRandomProvider#nextInt()} to set
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterExponentialSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterExponentialSampler.java
index b19fb33d..844d50e4 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterExponentialSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterExponentialSampler.java
@@ -24,8 +24,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.0
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterMarsagliaTsangGammaSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterMarsagliaTsangGammaSampler.java
index 5fe37af6..3bb16cd3 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterMarsagliaTsangGammaSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/AhrensDieterMarsagliaTsangGammaSampler.java
@@ -42,8 +42,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()} (both algorithms)
- *   <li>{@link UniformRandomProvider#nextLong()} (only for {@code alpha >= 1})
+ *   <li>{@link UniformRandomProvider#nextDouble()} (both algorithms)</li>
+ *   <li>{@link UniformRandomProvider#nextLong()} (only for {@code alpha >= 
1})</li>
  * </ul>
  *
  * @see <a 
href="https://mathworld.wolfram.com/GammaDistribution.html";>MathWorld Gamma 
distribution</a>
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerGaussianSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerGaussianSampler.java
index fb6ab72a..7831a01d 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerGaussianSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerGaussianSampler.java
@@ -25,8 +25,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
- *   <li>{@link UniformRandomProvider#nextLong()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
  * </ul>
  *
  * @since 1.0
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerLogNormalSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerLogNormalSampler.java
index 049bba1c..3e23fde4 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerLogNormalSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerLogNormalSampler.java
@@ -26,8 +26,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
- *   <li>{@link UniformRandomProvider#nextLong()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
  * </ul>
  *
  * @since 1.0
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerNormalizedGaussianSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerNormalizedGaussianSampler.java
index ced4024d..a21e95b6 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerNormalizedGaussianSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/BoxMullerNormalizedGaussianSampler.java
@@ -26,8 +26,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
- *   <li>{@link UniformRandomProvider#nextLong()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
  * </ul>
  *
  * @since 1.1
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/DirichletSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/DirichletSampler.java
index 23980cc6..23c5274e 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/DirichletSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/DirichletSampler.java
@@ -26,8 +26,8 @@ import 
org.apache.commons.rng.sampling.SharedStateObjectSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.4
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/FastLoadedDiceRollerDiscreteSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/FastLoadedDiceRollerDiscreteSampler.java
index 7d11f380..474a307e 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/FastLoadedDiceRollerDiscreteSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/FastLoadedDiceRollerDiscreteSampler.java
@@ -32,10 +32,10 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>FLDR produces <em>exact</em> samples from the specified probability 
distribution.
  * <ul>
  *   <li>For integer weights, the probability of returning {@code i} is 
precisely equal to the
- *   rational number {@code L[i] / m}, where {@code m} is the sum of {@code L}.
+ *   rational number {@code L[i] / m}, where {@code m} is the sum of {@code 
L}.</li>
  *   <li>For floating-points weights, each weight {@code L[i]} is converted to 
the
  *   corresponding rational number {@code p[i] / q[i]} where {@code p[i]} is a 
positive integer and
- *   {@code q[i]} is a power of 2. The rational weights are then normalized 
(exactly) to sum to unity.
+ *   {@code q[i]} is a power of 2. The rational weights are then normalized 
(exactly) to sum to unity.</li>
  * </ul>
  *
  * <p>Note that if <em>exact</em> samples are not required then an alternative 
sampler that
@@ -357,8 +357,8 @@ public abstract class FastLoadedDiceRollerDiscreteSampler
      * <p>This method creates a sampler with <em>exact</em> samples from the
      * specified probability distribution. It is recommended to use this 
method:
      * <ul>
-     *  <li>if the weights are computed, for example from a probability mass 
function; or
-     *  <li>if the weights sum to an infinite value.
+     *  <li>if the weights are computed, for example from a probability mass 
function; or</li>
+     *  <li>if the weights sum to an infinite value.</li>
      * </ul>
      *
      * <p>If the weights are computed from empirical observations then it is
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
index f936cc06..4b22e433 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/LargeMeanPoissonSampler.java
@@ -37,8 +37,8 @@ import 
org.apache.commons.rng.sampling.distribution.InternalUtils.FactorialLog;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.1
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/MarsagliaTsangWangDiscreteSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/MarsagliaTsangWangDiscreteSampler.java
index 4ad0158d..6987d8c0 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/MarsagliaTsangWangDiscreteSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/MarsagliaTsangWangDiscreteSampler.java
@@ -40,9 +40,9 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>The sampler supports the following distributions:</p>
  *
  * <ul>
- *  <li>Enumerated distribution (probabilities must be provided for each 
sample)
- *  <li>Poisson distribution up to {@code mean = 1024}
- *  <li>Binomial distribution up to {@code trials = 65535}
+ *  <li>Enumerated distribution (probabilities must be provided for each 
sample)</li>
+ *  <li>Poisson distribution up to {@code mean = 1024}</li>
+ *  <li>Binomial distribution up to {@code trials = 65535}</li>
  * </ul>
  *
  * @see <a href="https://dx.doi.org/10.18637/jss.v011.i03";>Margsglia, et al 
(2004) JSS Vol.
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSampler.java
index 046b3351..7a4e3c37 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSampler.java
@@ -43,8 +43,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
- *   <li>{@link UniformRandomProvider#nextLong()} (large means only)
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
+ *   <li>{@link UniformRandomProvider#nextLong()} (large means only)</li>
  * </ul>
  *
  * @since 1.0
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSamplerCache.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSamplerCache.java
index 6b41b65c..ada00fa9 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSamplerCache.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/PoissonSamplerCache.java
@@ -35,11 +35,11 @@ import 
org.apache.commons.rng.sampling.distribution.LargeMeanPoissonSampler.Larg
  * <p>The cache is advantageous under the following conditions:</p>
  *
  * <ul>
- *   <li>The mean of the Poisson distribution falls within a known range.
+ *   <li>The mean of the Poisson distribution falls within a known range.</li>
  *   <li>The sample size to be made with the <strong>same</strong> sampler is
- *       small.
+ *       small.</li>
  *   <li>The Poisson samples have different means with the same integer
- *       value(s) after rounding down.
+ *       value(s) after rounding down.</li>
  * </ul>
  *
  * <p>If the sample size to be made with the <strong>same</strong> sampler is 
large
@@ -57,8 +57,8 @@ import 
org.apache.commons.rng.sampling.distribution.LargeMeanPoissonSampler.Larg
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
- *   <li>{@link UniformRandomProvider#nextLong()} (large means only)
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
+ *   <li>{@link UniformRandomProvider#nextLong()} (large means only)</li>
  * </ul>
  *
  * @since 1.2
@@ -276,9 +276,9 @@ public class PoissonSamplerCache {
      *
      * <ul>
      *   <li>At small mean values a different algorithm is used for Poisson
-     *       sampling and the cache is unnecessary.
+     *       sampling and the cache is unnecessary.</li>
      *   <li>The minimum is always an integer so may be below the constructor
-     *       minimum mean.
+     *       minimum mean.</li>
      * </ul>
      *
      * <p>If {@link #isValidRange()} returns {@code true} the cache will store
@@ -303,9 +303,9 @@ public class PoissonSamplerCache {
      * due to the following reasons:
      * <ul>
      *   <li>At small mean values a different algorithm is used for Poisson
-     *       sampling and the cache is unnecessary.
+     *       sampling and the cache is unnecessary.</li>
      *   <li>The maximum is always the double value below an integer so
-     *       may be above the constructor maximum mean.
+     *       may be above the constructor maximum mean.</li>
      * </ul>
      *
      * <p>If {@link #isValidRange()} returns {@code true} the cache will store
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/StableSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/StableSampler.java
index 0e45fbfa..50115a38 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/StableSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/StableSampler.java
@@ -44,9 +44,9 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>The implementation uses the Chambers-Mallows-Stuck (CMS) method as 
described in:
  * <ul>
  *  <li>Chambers, Mallows &amp; Stuck (1976) "A Method for Simulating Stable 
Random Variables".
- *      Journal of the American Statistical Association. 71 (354): 340–344.
+ *      Journal of the American Statistical Association. 71 (354): 
340–344.</li>
  *  <li>Weron (1996) "On the Chambers-Mallows-Stuck method for simulating 
skewed stable
- *      random variables". Statistics &amp; Probability Letters. 28 (2): 
165–171.
+ *      random variables". Statistics &amp; Probability Letters. 28 (2): 
165–171.</li>
  * </ul>
  *
  * @see <a href="https://en.wikipedia.org/wiki/Stable_distribution";>Stable 
distribution (Wikipedia)</a>
@@ -1164,10 +1164,10 @@ public abstract class StableSampler implements 
SharedStateContinuousSampler {
          * a result in {@code [0, inf]}.
          *
          * <ul>
-         * <li>For {@code x=-inf} this returns {@code 0}.
-         * <li>For {@code x=0} this returns {@code 1}.
-         * <li>For {@code x=inf} this returns {@code inf}.
-         * <li>For {@code x=nan} this returns {@code nan}.
+         * <li>For {@code x=-inf} this returns {@code 0}.</li>
+         * <li>For {@code x=0} this returns {@code 1}.</li>
+         * <li>For {@code x=inf} this returns {@code inf}.</li>
+         * <li>For {@code x=nan} this returns {@code nan}.</li>
          * </ul>
          *
          * <p> This corrects {@code 0 / 0} and {@code inf / inf} division from
@@ -1205,9 +1205,9 @@ public abstract class StableSampler implements 
SharedStateContinuousSampler {
          * <p>The following properties are desirable for the CMS algorithm:
          *
          * <ul>
-         * <li>For {@code x=0} this returns {@code 1}.
-         * <li>For {@code x=pi/4} this returns {@code 4/pi}.
-         * <li>For {@code x=pi/4} this multiplied by {@code x} returns {@code 
1}.
+         * <li>For {@code x=0} this returns {@code 1}.</li>
+         * <li>For {@code x=pi/4} this returns {@code 4/pi}.</li>
+         * <li>For {@code x=pi/4} this multiplied by {@code x} returns {@code 
1}.</li>
          * </ul>
          *
          * <p>This method is called by the CMS algorithm when {@code x < pi/4}.
@@ -1303,12 +1303,12 @@ public abstract class StableSampler implements 
SharedStateContinuousSampler {
      *
      * <ul>
      * <li>{@code alpha=2} returns a Gaussian distribution sampler with
-     *     {@code mean=0} and {@code variance=2} (Note: {@code beta} has no 
effect on the distribution).
+     *     {@code mean=0} and {@code variance=2} (Note: {@code beta} has no 
effect on the distribution).</li>
      * <li>{@code alpha=1} and {@code beta=0} returns a Cauchy distribution 
sampler with
-     *     {@code location=0} and {@code scale=1}.
+     *     {@code location=0} and {@code scale=1}.</li>
      * <li>{@code alpha=0.5} and {@code beta=1} returns a Levy distribution 
sampler with
      *     {@code location=-1} and {@code scale=1}. This location shift is due 
to the
-     *     0-parameterization of the stable distribution.
+     *     0-parameterization of the stable distribution.</li>
      * </ul>
      *
      * <p>Note: To allow the computation of the stable distribution the 
parameter alpha
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratNormalizedGaussianSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratNormalizedGaussianSampler.java
index 9da3bdd5..8b378189 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratNormalizedGaussianSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratNormalizedGaussianSampler.java
@@ -31,8 +31,8 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.1
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratSampler.java
index dd7b4475..0887c962 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/distribution/ZigguratSampler.java
@@ -36,10 +36,10 @@ import org.apache.commons.rng.UniformRandomProvider;
  * <ol>
  * <li>Creating layers of the ziggurat entirely inside the probability density 
function (area B);
  * this allows the majority of samples to be obtained without checking if the 
value is in the
- * region of the ziggurat layer that requires a rejection test.
+ * region of the ziggurat layer that requires a rejection test.</li>
  * <li>For samples not within the main ziggurat (area A) alias sampling is 
used to choose a
  * layer and rejection of points above the PDF is accelerated using 
precomputation of
- * triangle regions entirely below or above the curve.
+ * triangle regions entirely below or above the curve.</li>
  * </ol>
  *
  * <pre>
@@ -380,9 +380,9 @@ public abstract class ZigguratSampler implements 
SharedStateContinuousSampler {
         /**
          * The precomputed ziggurat lengths, denoted X_i in the main text.
          * <ul>
-         * <li>X_i = length of ziggurat layer i.
-         * <li>X_j is the upper-left X coordinate of overhang j (starting from 
1).
-         * <li>X_(j-1) is the lower-right X coordinate of overhang j.
+         * <li>X_i = length of ziggurat layer i.</li>
+         * <li>X_j is the upper-left X coordinate of overhang j (starting from 
1).</li>
+         * <li>X_(j-1) is the lower-right X coordinate of overhang j.</li>
          * </ul>
          * <p>Values have been scaled by 2^-63.
          * Contains {@code I_MAX + 1} entries as the final value is 0.
@@ -456,9 +456,9 @@ public abstract class ZigguratSampler implements 
SharedStateContinuousSampler {
         /**
          * The precomputed ziggurat heights, denoted Y_i in the main text.
          * <ul>
-         * <li>Y_i = height of ziggurat layer i.
-         * <li>Y_j is the upper-left Y coordinate of overhang j (starting from 
1).
-         * <li>Y_(j-1) is the lower-right Y coordinate of overhang j.
+         * <li>Y_i = height of ziggurat layer i.</li>
+         * <li>Y_j is the upper-left Y coordinate of overhang j (starting from 
1).</li>
+         * <li>Y_(j-1) is the lower-right Y coordinate of overhang j.</li>
          * </ul>
          * <p>Values have been scaled by 2^-63.
          * Contains {@code I_MAX + 1} entries as the final value is pdf(x=0).
@@ -881,9 +881,9 @@ public abstract class ZigguratSampler implements 
SharedStateContinuousSampler {
         /**
          * The precomputed ziggurat lengths, denoted X_i in the main text.
          * <ul>
-         * <li>X_i = length of ziggurat layer i.
-         * <li>X_j is the upper-left X coordinate of overhang j (starting from 
1).
-         * <li>X_(j-1) is the lower-right X coordinate of overhang j.
+         * <li>X_i = length of ziggurat layer i.</li>
+         * <li>X_j is the upper-left X coordinate of overhang j (starting from 
1).</li>
+         * <li>X_(j-1) is the lower-right X coordinate of overhang j.</li>
          * </ul>
          * <p>Values have been scaled by 2^-63.
          * Contains {@code I_MAX + 1} entries as the final value is 0.
@@ -957,9 +957,9 @@ public abstract class ZigguratSampler implements 
SharedStateContinuousSampler {
         /**
          * The precomputed ziggurat heights, denoted Y_i in the main text.
          * <ul>
-         * <li>Y_i = height of ziggurat layer i.
-         * <li>Y_j is the upper-left Y coordinate of overhang j (starting from 
1).
-         * <li>Y_(j-1) is the lower-right Y coordinate of overhang j.
+         * <li>Y_i = height of ziggurat layer i.</li>
+         * <li>Y_j is the upper-left Y coordinate of overhang j (starting from 
1).</li>
+         * <li>Y_(j-1) is the lower-right Y coordinate of overhang j.</li>
          * </ul>
          * <p>Values have been scaled by 2^-63.
          * Contains {@code I_MAX + 1} entries as the final value is pdf(x=0).
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/BoxSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/BoxSampler.java
index 8e607f62..d93efa4d 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/BoxSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/BoxSampler.java
@@ -26,7 +26,7 @@ import 
org.apache.commons.rng.sampling.SharedStateObjectSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @see <a href="https://en.wikipedia.org/wiki/Hyperrectangle";>Hyperrectangle 
(Wikipedia)</a>
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/LineSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/LineSampler.java
index b02ec12d..086e5469 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/LineSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/LineSampler.java
@@ -26,7 +26,7 @@ import 
org.apache.commons.rng.sampling.SharedStateObjectSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.4
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TetrahedronSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TetrahedronSampler.java
index d7c281e9..c476dc7b 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TetrahedronSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TetrahedronSampler.java
@@ -38,7 +38,7 @@ import 
org.apache.commons.rng.sampling.SharedStateObjectSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @see <a href="https://doi.org/10.1080/10867651.2000.10487528";>
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TriangleSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TriangleSampler.java
index e7ab9b30..660bfabb 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TriangleSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/TriangleSampler.java
@@ -37,7 +37,7 @@ import 
org.apache.commons.rng.sampling.SharedStateObjectSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextDouble()}
+ *   <li>{@link UniformRandomProvider#nextDouble()}</li>
  * </ul>
  *
  * @since 1.4
diff --git 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/UnitBallSampler.java
 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/UnitBallSampler.java
index 7253b30a..c7c12565 100644
--- 
a/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/UnitBallSampler.java
+++ 
b/commons-rng-sampling/src/main/java/org/apache/commons/rng/sampling/shape/UnitBallSampler.java
@@ -30,8 +30,8 @@ import 
org.apache.commons.rng.sampling.distribution.ZigguratSampler;
  * <p>Sampling uses:</p>
  *
  * <ul>
- *   <li>{@link UniformRandomProvider#nextLong()}
- *   <li>{@link UniformRandomProvider#nextDouble()} (only for dimensions above 
2)
+ *   <li>{@link UniformRandomProvider#nextLong()}</li>
+ *   <li>{@link UniformRandomProvider#nextDouble()} (only for dimensions above 
2)</li>
  * </ul>
  *
  * @since 1.4

Reply via email to