| /external/guava/android/guava-tests/benchmark/com/google/common/math/ |
| D | BigIntegerMathBenchmark.java | 35 private static final int[] factorials = new int[ARRAY_SIZE]; field in BigIntegerMathBenchmark
45 factorials[i] = RANDOM_SOURCE.nextInt(factorialBound); in setUp()
47 binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1); in setUp()
96 tmp += BigIntegerMath.factorial(factorials[j]).intValue(); in factorial()
106 tmp += BigIntegerMath.binomial(factorials[j], binomials[j]).intValue(); in binomial()
|
| D | DoubleMathBenchmark.java | 35 private static final int[] factorials = new int[ARRAY_SIZE]; field in DoubleMathBenchmark
43 factorials[i] = RANDOM_SOURCE.nextInt(100); in setUp()
62 tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); in factorial()
|
| D | ApacheBenchmark.java | 117 private final int[] factorials = new int[ARRAY_SIZE]; field in ApacheBenchmark
132 factorials[i] = RANDOM_SOURCE.nextInt(200); in setUp()
168 tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); in factorialDouble()
|
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| D | BigIntegerMathBenchmark.java | 35 private static final int[] factorials = new int[ARRAY_SIZE]; field in BigIntegerMathBenchmark
45 factorials[i] = RANDOM_SOURCE.nextInt(factorialBound); in setUp()
47 binomials[i] = RANDOM_SOURCE.nextInt(factorials[i] + 1); in setUp()
96 tmp += BigIntegerMath.factorial(factorials[j]).intValue(); in factorial()
106 tmp += BigIntegerMath.binomial(factorials[j], binomials[j]).intValue(); in binomial()
|
| D | DoubleMathBenchmark.java | 35 private static final int[] factorials = new int[ARRAY_SIZE]; field in DoubleMathBenchmark
43 factorials[i] = RANDOM_SOURCE.nextInt(100); in setUp()
62 tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); in factorial()
|
| D | ApacheBenchmark.java | 117 private final int[] factorials = new int[ARRAY_SIZE]; field in ApacheBenchmark
132 factorials[i] = RANDOM_SOURCE.nextInt(200); in setUp()
168 tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); in factorialDouble()
|
| /external/guava/android/guava/src/com/google/common/math/ |
| D | LongMath.java | 776 return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE; in factorial()
779 static final long[] factorials = { local
822 if (n < factorials.length) { in binomial()
823 return factorials[n] / (factorials[k] * factorials[n - k]); in binomial()
|
| D | BigIntegerMath.java | 394 if (n < LongMath.factorials.length) { in factorial()
395 return BigInteger.valueOf(LongMath.factorials[n]); in factorial()
403 int startingNumber = LongMath.factorials.length; in factorial()
404 long product = LongMath.factorials[startingNumber - 1]; in factorial()
|
| D | IntMath.java | 624 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;
627 private static final int[] factorials = {
|
| /external/guava/guava/src/com/google/common/math/ |
| D | LongMath.java | 776 return (n < factorials.length) ? factorials[n] : Long.MAX_VALUE; in factorial()
779 static final long[] factorials = { local
822 if (n < factorials.length) { in binomial()
823 return factorials[n] / (factorials[k] * factorials[n - k]); in binomial()
|
| D | BigIntegerMath.java | 394 if (n < LongMath.factorials.length) { in factorial()
395 return BigInteger.valueOf(LongMath.factorials[n]); in factorial()
403 int startingNumber = LongMath.factorials.length; in factorial()
404 long product = LongMath.factorials[startingNumber - 1]; in factorial()
|
| D | IntMath.java | 624 return (n < factorials.length) ? factorials[n] : Integer.MAX_VALUE;
627 private static final int[] factorials = {
|
| /external/tensorflow/tensorflow/core/api_def/base_api/ |
| D | api_def_Fact.pbtxt | 3 summary: "Output a fact about factorials."
|
| /external/guava/android/guava-tests/test/com/google/common/math/ |
| D | LongMathTest.java | 166 for (int i = 0; i < LongMath.factorials.length; i++, expected *= i) { in testConstantsFactorials()
167 assertEquals(expected, LongMath.factorials[i]); in testConstantsFactorials()
171 LongMath.factorials[LongMath.factorials.length - 1], LongMath.factorials.length); in testConstantsFactorials()
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| D | LongMathTest.java | 166 for (int i = 0; i < LongMath.factorials.length; i++, expected *= i) { in testConstantsFactorials()
167 assertEquals(expected, LongMath.factorials[i]); in testConstantsFactorials()
171 LongMath.factorials[LongMath.factorials.length - 1], LongMath.factorials.length); in testConstantsFactorials()
|
| /external/python/cpython2/Lib/test/ |
| D | math_testcases.txt | 187 -- small positive integers give factorials
291 -- small positive integers give factorials
|
| /external/python/cpython3/Lib/test/ |
| D | math_testcases.txt | 187 -- small positive integers give factorials
291 -- small positive integers give factorials
|
| /external/catch2/docs/ |
| D | tutorial.md | 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 …
|
| /external/python/cpython3/Doc/whatsnew/ |
| D | 3.2.rst | 1080 the function is related to factorials, it grows large even for small values of
|