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

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

commit 9c14dad8c77da4205742a29a9bc82ed317e7de99
Author: Alex Herbert <[email protected]>
AuthorDate: Thu Sep 25 13:03:11 2025 +0100

    Use @code in javadoc
---
 .../org/apache/commons/numbers/primes/SmallPrimes.java     | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git 
a/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java
 
b/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java
index 41aeb3b6..e9df7341 100644
--- 
a/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java
+++ 
b/commons-numbers-primes/src/main/java/org/apache/commons/numbers/primes/SmallPrimes.java
@@ -26,14 +26,14 @@ import java.util.Map.Entry;
 import java.util.Set;
 
 /**
- * Utility methods to work on primes within the <code>int</code> range.
+ * Utility methods to work on primes within the {@code int} range.
  */
 final class SmallPrimes {
     /**
      * The first 512 prime numbers.
-     * <p>
-     * It contains all primes smaller or equal to the cubic square of 
Integer.MAX_VALUE.
-     * As a result, <code>int</code> numbers which are not reduced by those 
primes are guaranteed
+     *
+     * <p>It contains all primes smaller or equal to the cubic square of 
Integer.MAX_VALUE.
+     * As a result, {@code int} numbers which are not reduced by those primes 
are guaranteed
      * to be either prime or semi prime.
      */
     static final int[] PRIMES = {
@@ -232,10 +232,10 @@ final class SmallPrimes {
     }
 
     /**
-     * Miller-Rabin probabilistic primality test for int type, used in such
+     * Miller-Rabin probabilistic primality test for {@code int} type, used in 
such
      * a way that a result is always guaranteed.
-     * <p>
-     * It uses the prime numbers as successive base therefore it is guaranteed
+     *
+     * <p>It uses the prime numbers as successive base therefore it is 
guaranteed
      * to be always correct (see Handbook of applied cryptography by Menezes,
      * table 4.1).
      *

Reply via email to