Searched refs:factorials (Results 1 – 15 of 15) sorted by relevance
39 private static final int[] factorials = new int[ARRAY_SIZE]; field in BigIntegerMathBenchmark49 factorials[i] = RANDOM_SOURCE.nextInt(factorialBound); in setUp()51 binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1); in setUp()102 tmp += BigIntegerMath.factorial(factorials[j]).intValue(); in factorial()111 tmp += BigIntegerMath.binomial(factorials[j], binomials[j]).intValue(); in binomial()
35 private static final int[] factorials = new int[ARRAY_SIZE]; field in DoubleMathBenchmark43 factorials[i] = RANDOM_SOURCE.nextInt(100); in setUp()60 tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); in factorial()
120 private final int[] factorials = new int[ARRAY_SIZE]; field in ApacheBenchmark135 factorials[i] = RANDOM_SOURCE.nextInt(200); in setUp()170 tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); in factorialDouble()
173 static final long[] factorials = { field in LongMath216 if (n < factorials.length) { in binomial()217 return factorials[n] / (factorials[k] * factorials[n - k]); in binomial()
137 if (n < LongMath.factorials.length) { in factorial()138 return BigInteger.valueOf(LongMath.factorials[n]); in factorial()146 int startingNumber = LongMath.factorials.length; in factorial()147 long product = LongMath.factorials[startingNumber - 1]; in factorial()
378 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;381 private static final int[] factorials = {
615 return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE;618 static final long[] factorials = {661 if (n < factorials.length) {662 return factorials[n] / (factorials[k] * factorials[n - k]);
320 if (n < LongMath.factorials.length) { in factorial()321 return BigInteger.valueOf(LongMath.factorials[n]); in factorial()329 int startingNumber = LongMath.factorials.length; in factorial()330 long product = LongMath.factorials[startingNumber - 1]; in factorial()
499 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;502 private static final int[] factorials = {
95 for (int i = 0; i < LongMath.factorials.length; i++, expected *= i) { in testConstantsFactorials()96 assertEquals(expected, LongMath.factorials[i]); in testConstantsFactorials()100 LongMath.factorials[LongMath.factorials.length - 1], LongMath.factorials.length); in testConstantsFactorials()
3 summary: "Output a fact about factorials."
187 -- small positive integers give factorials291 -- small positive integers give factorials
35 …mples/010-TestCase.cpp)). Say you have written a function to calculate factorials and now you want…102 …n the return value starts to exceed the range of an unsigned int. With factorials that can happen …
1078 the function is related to factorials, it grows large even for small values of