| /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 25 int factorial(int x) function
57 assert(count == factorial(e));
|
| next_permutation_comp.pass.cpp | 26 int factorial(int x) function
59 assert(count == factorial(e));
|
| prev_permutation.pass.cpp | 25 int factorial(int x) function
57 assert(count == factorial(e));
|
| prev_permutation_comp.pass.cpp | 26 int factorial(int x) function
59 assert(count == factorial(e));
|
| /external/vixl/examples/ |
| 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));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| next_permutation.pass.cpp | 25 int factorial(int x) function
57 assert(count == factorial(e));
|
| next_permutation_comp.pass.cpp | 26 int factorial(int x) function
59 assert(count == factorial(e));
|
| prev_permutation.pass.cpp | 25 int factorial(int x) function
57 assert(count == factorial(e));
|
| prev_permutation_comp.pass.cpp | 26 int factorial(int x) function
59 assert(count == factorial(e));
|
| /external/chromium_org/v8/test/mjsunit/ |
| 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]);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| profilee.py | 33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| test_random.py | 87 def factorial(n): function in function:TestBasicOps.test_sample_distribution
90 expected = factorial(n) // factorial(n-k)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| profilee.py | 33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| test_random.py | 87 def factorial(n): function in function:TestBasicOps.test_sample_distribution
90 expected = factorial(n) // factorial(n-k)
|
| /external/clang/test/Analysis/ |
| 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/guava/guava/src/com/google/common/math/ |
| DoubleMath.java | 271 public static double factorial(int n) { method in class:DoubleMath
|
| 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.
|
| /external/jemalloc/test/unit/ |
| 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/ |
| test-examples.cc | 171 TEST_FUNCTION(factorial); \
175 TEST(factorial) {
178 Label factorial; local
179 masm.Bind(&factorial);
|
| /external/chromium_org/third_party/gtk+/gtk/ |
| 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)
[all...] |
| /external/clang/test/CodeGenCXX/ |
| 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) {}
|
| /packages/apps/Calculator/ |
| arity-2.1.2.jar | |
| /external/owasp/sanitizer/distrib/lib/ |
| guava.jar | |
| /external/owasp/sanitizer/lib/guava-libraries/ |
| guava.jar | |
| /packages/services/Telecomm/libs/ |
| guava.jar | |
