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-numbers.git
The following commit(s) were added to refs/heads/master by this push:
new d4d27468 Javadoc fixes
d4d27468 is described below
commit d4d2746817b9c98a7b5ffa5a0eeadf2da7d927d4
Author: Gary Gregory <[email protected]>
AuthorDate: Fri Jan 13 14:48:16 2023 -0500
Javadoc fixes
---
.../src/test/java/org/apache/commons/numbers/core/SumTest.java | 2 +-
.../org/apache/commons/numbers/examples/jmh/core/LinearCombination.java | 2 +-
.../apache/commons/numbers/examples/jmh/core/LinearCombinations.java | 2 +-
.../commons/numbers/examples/jmh/core/LinearCombinationsTest.java | 2 +-
.../src/main/java/org/apache/commons/numbers/gamma/BoostGamma.java | 2 +-
5 files changed, 5 insertions(+), 5 deletions(-)
diff --git
a/commons-numbers-core/src/test/java/org/apache/commons/numbers/core/SumTest.java
b/commons-numbers-core/src/test/java/org/apache/commons/numbers/core/SumTest.java
index 19faaa3f..f358ba36 100644
---
a/commons-numbers-core/src/test/java/org/apache/commons/numbers/core/SumTest.java
+++
b/commons-numbers-core/src/test/java/org/apache/commons/numbers/core/SumTest.java
@@ -340,7 +340,7 @@ class SumTest {
*
* <p>Note: This test assumes that LinearCombination computes a split
number
* using Dekker's method. This can result in the high part of the number
being
- * greater in magnitude than the the original number due to round-off in
the split.
+ * greater in magnitude than the original number due to round-off in the
split.
*/
@Test
void testSumOfProducts_overflow() {
diff --git
a/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombination.java
b/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombination.java
index 7f406713..df86c6eb 100644
---
a/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombination.java
+++
b/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombination.java
@@ -17,7 +17,7 @@
package org.apache.commons.numbers.examples.jmh.core;
/**
- * Computes linear combinations as the the sum of the products of two
sequences of numbers
+ * Computes linear combinations as the sum of the products of two sequences of
numbers
* <code>a<sub>i</sub> b<sub>i</sub></code>.
*
* @see <a href="https://en.wikipedia.org/wiki/Dot_product";>Dot product</a>
diff --git
a/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinations.java
b/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinations.java
index a2445663..723680b8 100644
---
a/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinations.java
+++
b/commons-numbers-examples/examples-jmh/src/main/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinations.java
@@ -25,7 +25,7 @@ import
org.apache.commons.numbers.examples.jmh.core.LinearCombination.ThreeD;
import org.apache.commons.numbers.examples.jmh.core.LinearCombination.TwoD;
/**
- * Provides implementations to computes linear combinations as the the sum of
+ * Provides implementations to computes linear combinations as the sum of
* the products of two sequences of numbers
* <code>a<sub>i</sub> b<sub>i</sub></code>.
*
diff --git
a/commons-numbers-examples/examples-jmh/src/test/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinationsTest.java
b/commons-numbers-examples/examples-jmh/src/test/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinationsTest.java
index 776726e6..c390d75a 100644
---
a/commons-numbers-examples/examples-jmh/src/test/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinationsTest.java
+++
b/commons-numbers-examples/examples-jmh/src/test/java/org/apache/commons/numbers/examples/jmh/core/LinearCombinationsTest.java
@@ -356,7 +356,7 @@ class LinearCombinationsTest {
*
* <p>Note: This test assumes that LinearCombination computes a split
number
* using Dekker's method. This can result in the high part of the number
being
- * greater in magnitude than the the original number due to round-off in
the split.
+ * greater in magnitude than the original number due to round-off in the
split.
*/
@Test
void testOverflow() {
diff --git
a/commons-numbers-gamma/src/main/java/org/apache/commons/numbers/gamma/BoostGamma.java
b/commons-numbers-gamma/src/main/java/org/apache/commons/numbers/gamma/BoostGamma.java
index bec83a50..4607bb94 100644
---
a/commons-numbers-gamma/src/main/java/org/apache/commons/numbers/gamma/BoostGamma.java
+++
b/commons-numbers-gamma/src/main/java/org/apache/commons/numbers/gamma/BoostGamma.java
@@ -1747,7 +1747,7 @@ final class BoostGamma {
// Update to the Boost code.
// Use some of the logic from fullIgammaPrefix(a, z) to use the direct
// computation if it is valid. Assuming pow and exp are accurate to 1
ULP it
- // puts most of the the error in evaluation of tgamma(a). This is
accurate
+ // puts most of the error in evaluation of tgamma(a). This is accurate
// enough that this reduces max error on the current test data.
//
// Overflow cases fall-through to the Lanczos approximation that
incorporates
