HomeSort by relevance Sort by last modified time
    Searched refs:factorial (Results 1 - 25 of 32) sorted by null

1 2

  /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)) {
  /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)
test_math.py 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x)))
381 self.assertRaises(ValueError, math.factorial, -1)
382 self.assertRaises(ValueError, math.factorial, math.pi)
    [all...]
  /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)
test_math.py 380 self.assertEqual(math.factorial(cast(x)), fact(x), (x, fact(x), math.factorial(x)))
381 self.assertRaises(ValueError, math.factorial, -1)
382 self.assertRaises(ValueError, math.factorial, math.pi)
    [all...]
  /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/guava/guava-tests/test/com/google/common/math/
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);
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));
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);
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/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) {}
  /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/guava/guava/src/com/google/common/math/
DoubleMath.java 271 public static double factorial(int n) { method in class:DoubleMath
IntMath.java 438 public static int factorial(int n) {
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.
LongMath.java 535 public static long factorial(int n) {
  /packages/apps/Calculator/
arity-2.1.2.jar 
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/math/special_functions/
math_fwd.hpp 343 // Factorial functions.
348 RT factorial(unsigned int);
350 RT factorial(unsigned int, const Policy& pol);
    [all...]
  /external/droiddriver/libs/
guava-13.0.jar 
  /prebuilts/devtools/tools/lib/
guava-13.0.1.jar 

Completed in 1019 milliseconds

1 2