Repository: commons-math Updated Branches: refs/heads/MATH_3_X 41642aaaa -> cc893e499
Reverted unecessary escapes. Project: http://git-wip-us.apache.org/repos/asf/commons-math/repo Commit: http://git-wip-us.apache.org/repos/asf/commons-math/commit/cc893e49 Tree: http://git-wip-us.apache.org/repos/asf/commons-math/tree/cc893e49 Diff: http://git-wip-us.apache.org/repos/asf/commons-math/diff/cc893e49 Branch: refs/heads/MATH_3_X Commit: cc893e4998927ed09d4f4c40e08ccceb600212c0 Parents: 41642aa Author: Phil Steitz <phil.ste...@gmail.com> Authored: Sat Dec 26 09:51:33 2015 -0700 Committer: Phil Steitz <phil.ste...@gmail.com> Committed: Sat Dec 26 09:51:33 2015 -0700 ---------------------------------------------------------------------- .../commons/math3/util/CombinatoricsUtils.java | 28 ++++++++++---------- 1 file changed, 14 insertions(+), 14 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/commons-math/blob/cc893e49/src/main/java/org/apache/commons/math3/util/CombinatoricsUtils.java ---------------------------------------------------------------------- diff --git a/src/main/java/org/apache/commons/math3/util/CombinatoricsUtils.java b/src/main/java/org/apache/commons/math3/util/CombinatoricsUtils.java index 62025ad..ee2718a 100644 --- a/src/main/java/org/apache/commons/math3/util/CombinatoricsUtils.java +++ b/src/main/java/org/apache/commons/math3/util/CombinatoricsUtils.java @@ -57,7 +57,7 @@ public final class CombinatoricsUtils { * <p> * <Strong>Preconditions</strong>: * <ul> - * <li> {@code 0 ≤ k ≤ n } (otherwise + * <li> {@code 0 <= k <= n } (otherwise * {@code MathIllegalArgumentException} is thrown)</li> * <li> The result is small enough to fit into a {@code long}. The * largest value of {@code n} for which all coefficients are @@ -69,8 +69,8 @@ public final class CombinatoricsUtils { * @param n the size of the set * @param k the size of the subsets to be counted * @return {@code n choose k} - * @throws NotPositiveException if {@code n < 0}. - * @throws NumberIsTooLargeException if {@code k > n}. + * @throws NotPositiveException if {@code n < 0}. + * @throws NumberIsTooLargeException if {@code k > n}. * @throws MathArithmeticException if the result is too large to be * represented by a long integer. */ @@ -139,10 +139,10 @@ public final class CombinatoricsUtils { * <p> * <Strong>Preconditions</strong>: * <ul> - * <li> {@code 0 ≤ k ≤ n } (otherwise + * <li> {@code 0 <= k <= n } (otherwise * {@code IllegalArgumentException} is thrown)</li> * <li> The result is small enough to fit into a {@code double}. The - * largest value of {@code n} for which all coefficients are < + * largest value of {@code n} for which all coefficients are less than * Double.MAX_VALUE is 1029. If the computed value exceeds Double.MAX_VALUE, * Double.POSITIVE_INFINITY is returned</li> * </ul></p> @@ -150,8 +150,8 @@ public final class CombinatoricsUtils { * @param n the size of the set * @param k the size of the subsets to be counted * @return {@code n choose k} - * @throws NotPositiveException if {@code n < 0}. - * @throws NumberIsTooLargeException if {@code k > n}. + * @throws NotPositiveException if {@code n < 0}. + * @throws NumberIsTooLargeException if {@code k > n}. * @throws MathArithmeticException if the result is too large to be * represented by a long integer. */ @@ -188,7 +188,7 @@ public final class CombinatoricsUtils { * <p> * <Strong>Preconditions</strong>: * <ul> - * <li> {@code 0 ≤ k ≤ n } (otherwise + * <li> {@code 0 <= k <= n } (otherwise * {@code MathIllegalArgumentException} is thrown)</li> * </ul></p> * @@ -255,7 +255,7 @@ public final class CombinatoricsUtils { * <p> * <Strong>Preconditions</strong>: * <ul> - * <li> {@code n ≥ 0} (otherwise + * <li> {@code n >= 0} (otherwise * {@code MathIllegalArgumentException} is thrown)</li> * <li> The result is small enough to fit into a {@code long}. The * largest value of {@code n} for which {@code n!} does not exceed @@ -268,8 +268,8 @@ public final class CombinatoricsUtils { * @return {@code n!} * @throws MathArithmeticException if the result is too large to be represented * by a {@code long}. - * @throws NotPositiveException if {@code n < 0}. - * @throws MathArithmeticException if {@code n > 20}: The factorial value is too + * @throws NotPositiveException if {@code n < 0}. + * @throws MathArithmeticException if {@code n > 20}: The factorial value is too * large to fit in a {@code long}. */ public static long factorial(final int n) throws NotPositiveException, MathArithmeticException { @@ -312,7 +312,7 @@ public final class CombinatoricsUtils { * * @param n Argument. * @return {@code n!} - * @throws NotPositiveException if {@code n < 0}. + * @throws NotPositiveException if {@code n < 0}. */ public static double factorialLog(final int n) throws NotPositiveException { if (n < 0) { @@ -444,8 +444,8 @@ public final class CombinatoricsUtils { * * @param n Size of the set. * @param k Size of the subsets to be counted. - * @throws NotPositiveException if {@code n < 0}. - * @throws NumberIsTooLargeException if {@code k > n}. + * @throws NotPositiveException if {@code n < 0}. + * @throws NumberIsTooLargeException if {@code k > n}. */ public static void checkBinomial(final int n, final int k)
