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 c888d4a03d19c8cfb0b4ff3be84bc9ff40aff650 Author: aherbert <[email protected]> AuthorDate: Tue Jun 23 12:32:16 2020 +0100 Replace invalid javadoc link to private method. --- .../statistics/distribution/AbstractDiscreteDistribution.java | 7 ++++--- 1 file changed, 4 insertions(+), 3 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 0a5d24e..abc16ca 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 @@ -48,9 +48,10 @@ abstract class AbstractDiscreteDistribution * The default implementation returns * <ul> * <li>{@link #getSupportLowerBound()} for {@code p = 0},</li> - * <li>{@link #getSupportUpperBound()} for {@code p = 1}, and</li> - * <li>{@link #solveInverseCumulativeProbability(double, int, int)} for - * {@code 0 < p < 1}.</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> * </ul> */ @Override
