[commons-statistics] branch master updated: Comment typos

[aherbert]

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-statistics.git


The following commit(s) were added to refs/heads/master by this push:
     new b69d7ad  Comment typos
b69d7ad is described below

commit b69d7ad0f2429395fed3971603479855450e4a7e
Author: Alex Herbert <aherb...@apache.org>
AuthorDate: Fri Jul 21 00:00:29 2023 +0100

    Comment typos
---
 .../commons/statistics/inference/KolmogorovSmirnovDistribution.java   | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git 
a/commons-statistics-inference/src/main/java/org/apache/commons/statistics/inference/KolmogorovSmirnovDistribution.java
 
b/commons-statistics-inference/src/main/java/org/apache/commons/statistics/inference/KolmogorovSmirnovDistribution.java
index 5af7738..5ea3fdb 100644
--- 
a/commons-statistics-inference/src/main/java/org/apache/commons/statistics/inference/KolmogorovSmirnovDistribution.java
+++ 
b/commons-statistics-inference/src/main/java/org/apache/commons/statistics/inference/KolmogorovSmirnovDistribution.java
@@ -911,9 +911,9 @@ final class KolmogorovSmirnovDistribution {
             } else {
                 fpow = power;
             }
-            // SD requires a more precise summation using all the terms that 
can ba added.
+            // SD requires a more precise summation using all the terms that 
can be added.
             // For the regular summation we must sum at least 50% of the 
terms. The number
-            // of bits required bits to sum remaining terms of the same 
magnitude is log2(N/2).
+            // of required bits to sum remaining terms of the same magnitude 
is log2(N/2).
             // These guards bits are conservative and > ~99% of terms are 
typically used.
             final DDAdd fadd = sd ? DD::add : DD::fastAdd;
             final int sumBits = sd ? SD_SUM_PRECISION_BITS : 
SUM_PRECISION_BITS + log2(maxN >> 1);