Home
last modified time | relevance | path

Searched refs:factorials (Results 1 – 11 of 11) sorted by relevance

/external/guava/guava-tests/benchmark/com/google/common/math/
DBigIntegerMathBenchmark.java39 private static final int[] factorials = new int[ARRAY_SIZE]; field in BigIntegerMathBenchmark
49 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()
DDoubleMathBenchmark.java35 private static final int[] factorials = new int[ARRAY_SIZE]; field in DoubleMathBenchmark
43 factorials[i] = RANDOM_SOURCE.nextInt(100); in setUp()
60 tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); in factorial()
DApacheBenchmark.java120 private final int[] factorials = new int[ARRAY_SIZE]; field in ApacheBenchmark
135 factorials[i] = RANDOM_SOURCE.nextInt(200); in setUp()
170 tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); in factorialDouble()
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/
DLongMath.java173 static final long[] factorials = { field in LongMath
216 if (n < factorials.length) { in binomial()
217 return factorials[n] / (factorials[k] * factorials[n - k]); in binomial()
DBigIntegerMath.java137 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()
DIntMath.java378 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;
381 private static final int[] factorials = {
/external/guava/guava/src/com/google/common/math/
DLongMath.java615 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]);
DBigIntegerMath.java320 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()
DIntMath.java499 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;
502 private static final int[] factorials = {
/external/guava/guava-tests/test/com/google/common/math/
DLongMathTest.java95 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()
/external/python/cpython2/Lib/test/
Dmath_testcases.txt187 -- small positive integers give factorials
291 -- small positive integers give factorials