/external/clang/test/Analysis/ |
H A D | inline.c | 37 unsigned factorial(unsigned x) { function 40 return x * factorial(x - 1); 44 if (factorial(3) == 6) { 55 unsigned x = factorial(3); 56 if (x == factorial(3)) {
|
/external/vixl/examples/ |
H A D | factorial.cc | 33 // uint64_t factorial(uint64_t n) 64 Label factorial; local 65 masm.Bind(&factorial); 72 simulator.RunFrom(factorial.target()); 73 printf("factorial(%ld) = %ld\n", input_val, simulator.xreg(0));
|
/external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
H A D | next_permutation.pass.cpp | 25 int factorial(int x) function 57 assert(count == factorial(e));
|
H A D | next_permutation_comp.pass.cpp | 26 int factorial(int x) function 59 assert(count == factorial(e));
|
H A D | prev_permutation.pass.cpp | 25 int factorial(int x) function 57 assert(count == factorial(e));
|
H A D | prev_permutation_comp.pass.cpp | 26 int factorial(int x) function 59 assert(count == factorial(e));
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | sin-cos.js | 71 var factorial = [1]; variable 74 factorial[i] = factorial[i-1] * i; 92 terms.push(sign * x / factorial[i]); 105 terms.push(sign * x / factorial[i]);
|
/external/guava/guava-tests/test/com/google/common/math/ |
H A D | DoubleMathTest.java | 60 assertTrue(BigIntegerMath.factorial(DoubleMath.MAX_FACTORIAL).compareTo(MAX_DOUBLE_VALUE) <= 0); 62 BigIntegerMath.factorial(DoubleMath.MAX_FACTORIAL + 1).compareTo(MAX_DOUBLE_VALUE) > 0); 68 BigIntegerMath.factorial(n).doubleValue(), DoubleMath.EVERY_SIXTEENTH_FACTORIAL[i]); 459 double actual = BigIntegerMath.factorial(i).doubleValue(); 460 double result = DoubleMath.factorial(i); 466 assertEquals(Double.POSITIVE_INFINITY, DoubleMath.factorial(DoubleMath.MAX_FACTORIAL + 1)); 467 assertEquals(Double.POSITIVE_INFINITY, DoubleMath.factorial(DoubleMath.MAX_FACTORIAL + 20)); 473 DoubleMath.factorial(n);
|
H A D | BigIntegerMathTest.java | 393 assertEquals(expected, BigIntegerMath.factorial(i)); 398 assertEquals(BigInteger.ONE, BigIntegerMath.factorial(0)); 404 BigIntegerMath.factorial(n); 410 // Depends on the correctness of BigIntegerMath.factorial 415 .factorial(n) 416 .divide(BigIntegerMath.factorial(k)) 417 .divide(BigIntegerMath.factorial(n - k));
|
H A D | IntMathTest.java | 439 // Depends on the correctness of BigIntegerMath.factorial. 443 BigInteger expectedBig = BigIntegerMath.factorial(n); 445 assertEquals(expectedInt, IntMath.factorial(n)); 449 @GwtIncompatible("factorial") 453 IntMath.factorial(n);
|
H A D | LongMathTest.java | 479 // Depends on the correctness of BigIntegerMath.factorial. 482 BigInteger expectedBig = BigIntegerMath.factorial(n); 484 assertEquals(expectedLong, LongMath.factorial(n)); 491 LongMath.factorial(n);
|
/external/jemalloc/test/unit/ |
H A D | math.c | 24 factorial(unsigned x) function 42 (double)factorial(x-1), MAX_REL_ERR, MAX_ABS_ERR), 43 "Incorrect factorial result for x=%u", x);
|
/external/vixl/test/examples/ |
H A D | test-examples.cc | 171 TEST_FUNCTION(factorial); \ 175 TEST(factorial) { 178 Label factorial; local 179 masm.Bind(&factorial);
|
/external/clang/test/CodeGenCXX/ |
H A D | const-init-cxx11.cpp | 274 constexpr int factorial(int n) { function in namespace:NonLiteralConstexpr 275 return n ? factorial(n-1) * n : 1; 280 constexpr NonTrivialDtor() : n(factorial(5)), p(&n) {}
|
/external/chromium_org/third_party/gtk+/gtk/ |
H A D | compose-parse.py | 118 def factorial(n): function 122 return n * factorial(n-1) 915 counter_combinations += factorial(len(decomposedsequence)-1) 919 counter_combinations_greek += factorial(len(decomposedsequence)-1)
|
/external/guava/guava/src/com/google/common/math/ |
H A D | DoubleMath.java | 271 public static double factorial(int n) { method in class:DoubleMath
|
H A D | IntMath.java | 438 public static int factorial(int n) { method in class:IntMath
|
H A D | BigIntegerMath.java | 278 * <p>This uses an efficient binary recursive algorithm to compute the factorial 284 public static BigInteger factorial(int n) { method in class:BigIntegerMath 287 // If the factorial is small enough, just use LongMath to do it. 296 // Start from the pre-computed maximum long factorial.
|
H A D | LongMath.java | 535 public static long factorial(int n) { method in class:LongMath
|
/external/owasp/sanitizer/distrib/lib/ |
H A D | guava.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ... |
/external/owasp/sanitizer/lib/guava-libraries/ |
H A D | guava.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ... |
/external/chromium_org/third_party/checkstyle/ |
H A D | checkstyle-5.7-all.jar | META-INF/MANIFEST.MF META-INF/ checkstyle_packages.xml checkstylecompilation.properties checkstyletask.properties com/ ... |
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/closure_compiler/compiler/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |