| /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/vixl/examples/aarch64/ |
| factorial.cc | 32 // uint64_t factorial(uint64_t n)
62 Label factorial; local
63 masm.Bind(&factorial);
70 simulator.RunFrom(masm.GetLabelAddress<Instruction*>(&factorial));
71 printf("factorial(%" PRIu64 ") = %" PRId64 "\n",
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Lua/scripts/ |
| Fact.lua | 1 -- defines a factorial function
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| profilee.py | 33 factorial(14) # 130
35 def factorial(n):
function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| /external/python/cpython2/Lib/test/ |
| profilee.py | 33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| /external/python/cpython3/Lib/test/ |
| profilee.py | 33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| /prebuilts/gdb/darwin-x86/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
|
| /prebuilts/gdb/linux-x86/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
|
| /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
|
| /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
|
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| IntMathBenchmark.java | 37 private static int[] factorial = new int[ARRAY_SIZE]; field in class:IntMathBenchmark
47 factorial[i] = RANDOM_SOURCE.nextInt(50);
48 binomial[i] = RANDOM_SOURCE.nextInt(factorial[i] + 1);
82 @Benchmark int factorial(int reps) { method in class:IntMathBenchmark
86 tmp += IntMath.factorial(factorial[j]);
95 tmp += IntMath.binomial(factorial[j], binomial[j]);
|
| BigIntegerMathBenchmark.java | 56 * Previous version of BigIntegerMath.factorial, kept for timing purposes.
60 return BigInteger.valueOf(LongMath.factorial(n));
63 return BigInteger.valueOf(LongMath.factorial(k)).multiply(oldSlowFactorial(k, n));
98 @Benchmark int factorial(int reps) { method in class:BigIntegerMathBenchmark
102 tmp += BigIntegerMath.factorial(factorials[j]).intValue();
|
| DoubleMathBenchmark.java | 56 @Benchmark long factorial(int reps) { method in class:DoubleMathBenchmark
60 tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j]));
|
| /external/libcxx/test/std/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));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/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/python/cpython3/Modules/_decimal/tests/ |
| bench.py | 61 def factorial(n, m): function
63 return factorial(m, n)
69 return factorial(n, (n+m)//2) * factorial((n+m)//2 + 1, m)
95 print("# Factorial")
111 x = factorial(C.Decimal(n), 0)
122 y = factorial(n, 0)
|
| /external/vulkan-validation-layers/libs/glm/gtx/ |
| integer.hpp | 74 //! Return the factorial value of a number (!12 max, integer only)
77 GLM_FUNC_DECL genType factorial(genType const & x);
|
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/libs/glm/gtx/ |
| integer.hpp | 74 //! Return the factorial value of a number (!12 max, integer only)
77 GLM_FUNC_DECL genType factorial(genType const & x);
|
| /external/deqp/external/vulkancts/modules/vulkan/pipeline/ |
| vktPipelineCombinationsIterator.hpp | 51 static deUint32 factorial (deUint32 x);
128 deUint32 CombinationsIterator<T>::factorial (deUint32 x) function in class:vkt::pipeline::CombinationsIterator
|
