HomeSort by relevance Sort by last modified time
    Searched defs:factorial (Results 1 - 24 of 24) sorted by null

  /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/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/droiddriver/libs/
guava-13.0.jar 
  /prebuilts/devtools/tools/lib/
guava-13.0.1.jar 
  /prebuilts/misc/common/tradefed/
tradefed-prebuilt.jar 
  /prebuilts/tools/common/gradle-plugins/repository/com/google/guava/guava/14.0/
guava-14.0.jar 
  /prebuilts/tools/common/guava-tools/
guava-13.0.1.jar 
  /prebuilts/tools/common/m2/repository/com/google/guava/guava/13.0.1/
guava-13.0.1.jar 
  /prebuilts/tools/common/m2/internal/org/gradle/gradle-tooling-api/1.6/
gradle-tooling-api-1.6.jar 
  /prebuilts/tools/common/m2/internal/org/gradle/gradle-tooling-api/1.6-rc-1/
gradle-tooling-api-1.6-rc-1.jar 
  /prebuilts/tools/common/m2/internal/org/gradle/gradle-tooling-api/1.7/
gradle-tooling-api-1.7.jar 

Completed in 1267 milliseconds