[commons-statistics] 03/15: Consistent text for inverse probability functions

[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

commit 3c178c29afcd4710bd6af2d1bec9a58be38b784b
Author: aherbert <aherb...@apache.org>
AuthorDate: Wed Nov 30 11:46:15 2022 +0000

    Consistent text for inverse probability functions
    
    Updated to match the text from the abstract continuous distribution.
---
 .../statistics/distribution/AbstractDiscreteDistribution.java     | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git 
a/commons-statistics-distribution/src/main/java/org/apache/commons/statistics/distribution/AbstractDiscreteDistribution.java
 
b/commons-statistics-distribution/src/main/java/org/apache/commons/statistics/distribution/AbstractDiscreteDistribution.java
index 54d3c3d..dc63dac 100644
--- 
a/commons-statistics-distribution/src/main/java/org/apache/commons/statistics/distribution/AbstractDiscreteDistribution.java
+++ 
b/commons-statistics-distribution/src/main/java/org/apache/commons/statistics/distribution/AbstractDiscreteDistribution.java
@@ -105,8 +105,8 @@ abstract class AbstractDiscreteDistribution
      * <li>{@link #getSupportLowerBound()} for {@code p = 0},</li>
      * <li>{@link #getSupportUpperBound()} for {@code p = 1}, or</li>
      * <li>the result of a binary search between the lower and upper bound 
using
-     *     {@link #cumulativeProbability(int)}. The bounds may be bracketed for
-     *     efficiency.</li>
+     *     {@link #cumulativeProbability(int) cumulativeProbability(x)}.
+     *     The bounds may be bracketed for efficiency.</li>
      * </ul>
      *
      * @throws IllegalArgumentException if {@code p < 0} or {@code p > 1}
@@ -124,8 +124,8 @@ abstract class AbstractDiscreteDistribution
      * <ul>
      * <li>{@link #getSupportLowerBound()} for {@code p = 1},</li>
      * <li>{@link #getSupportUpperBound()} for {@code p = 0}, or</li>
-     * <li>the result of a search for a root between the lower and upper bound 
using
-     *     {@link #survivalProbability(int) survivalProbability(x) - p}.
+     * <li>the result of a binary search between the lower and upper bound 
using
+     *     {@link #survivalProbability(int) survivalProbability(x)}.
      *     The bounds may be bracketed for efficiency.</li>
      * </ul>
      *