Searched refs:biggestBinomials (Results 1 – 11 of 11) sorted by relevance
218 } else if (k >= biggestBinomials.length || n > biggestBinomials[k]) { in binomial()282 static final int[] biggestBinomials = field in LongMath
224 if (k < LongMath.biggestBinomials.length && n <= LongMath.biggestBinomials[k]) { in binomial()
397 @VisibleForTesting static int[] biggestBinomials = {
107 for (int k = 0; k < LongMath.biggestBinomials.length; k++) { in testConstantsBiggestBinomials()108 assertTrue(fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k], k))); in testConstantsBiggestBinomials()109 assertTrue(LongMath.biggestBinomials[k] == Integer.MAX_VALUE in testConstantsBiggestBinomials()110 || !fitsInLong(BigIntegerMath.binomial(LongMath.biggestBinomials[k] + 1, k))); in testConstantsBiggestBinomials()114 int k = LongMath.biggestBinomials.length; in testConstantsBiggestBinomials()122 assertTrue(LongMath.biggestSimpleBinomials[k] <= LongMath.biggestBinomials[k]); in testConstantsBiggestSimpleBinomials()574 for (int k = 3; k < LongMath.biggestBinomials.length; k++) { in testBinomial_exhaustiveNotOverflowing()575 for (int n = 70; n <= LongMath.biggestBinomials[k]; n++) { in testBinomial_exhaustiveNotOverflowing()
82 for (int k = 0; k < IntMath.biggestBinomials.length; k++) { in testConstantsBiggestBinomials()83 assertTrue(fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k], k))); in testConstantsBiggestBinomials()84 assertTrue(IntMath.biggestBinomials[k] == Integer.MAX_VALUE in testConstantsBiggestBinomials()85 || !fitsInInt(BigIntegerMath.binomial(IntMath.biggestBinomials[k] + 1, k))); in testConstantsBiggestBinomials()91 2 * IntMath.biggestBinomials.length, IntMath.biggestBinomials.length))); in testConstantsBiggestBinomials()
43 static final int[] biggestBinomials = field in MathBenchmarking
51 binomialArguments[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length); in setUp()54 RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k; in setUp()
161 int k = binomials[i][1] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials.length); in setUp()162 binomials[i][0] = RANDOM_SOURCE.nextInt(MathBenchmarking.biggestBinomials[k] - k) + k; in setUp()
531 if (k >= biggestBinomials.length || n > biggestBinomials[k]) {550 @VisibleForTesting static int[] biggestBinomials = {
663 } else if (k >= biggestBinomials.length || n > biggestBinomials[k]) {727 static final int[] biggestBinomials =
407 if (k < LongMath.biggestBinomials.length && n <= LongMath.biggestBinomials[k]) { in binomial()