HomeSort by relevance Sort by last modified time
    Searched refs:Factorial (Results 26 - 34 of 34) sorted by null

12

  /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/samples/
sample1.cc 36 // Returns n! (the factorial of n). For negative n, n! is defined to be 1.
37 int Factorial(int n) {
  /external/google-benchmark/test/
benchmark_test.cc 29 int BENCHMARK_NOINLINE Factorial(uint32_t n) {
30 return (n == 1) ? 1 : n * Factorial(n - 1);
56 for (auto _ : state) fac_42 = Factorial(8);
  /external/libcxx/utils/google-benchmark/test/
benchmark_test.cc 29 int BENCHMARK_NOINLINE Factorial(uint32_t n) {
30 return (n == 1) ? 1 : n * Factorial(n - 1);
56 for (auto _ : state) fac_42 = Factorial(8);
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/test/
benchmark_test.cc 29 int BENCHMARK_NOINLINE Factorial(uint32_t n) {
30 return (n == 1) ? 1 : n * Factorial(n - 1);
56 while (state.KeepRunning()) fac_42 = Factorial(8);
  /prebuilts/go/darwin-x86/test/bench/garbage/
peano.go 109 // Factorial
  /prebuilts/go/darwin-x86/test/
peano.go 111 // Factorial
  /prebuilts/go/linux-x86/test/bench/garbage/
peano.go 109 // Factorial
  /prebuilts/go/linux-x86/test/
peano.go 111 // Factorial
  /external/python/cpython3/Lib/test/
test_math.py 76 # Here's a pure Python version of the math.factorial algorithm, for
81 # factorial(n) = factorial_odd_part(n) << (n - count_set_bits(n))
116 """Factorial of nonnegative integer n, via "Binary Split Factorial Formula"
117 described at http://www.luschny.de/math/factorial/binarysplitfact.html
496 self.assertEqual(math.factorial(0), 1)
497 self.assertEqual(math.factorial(0.0), 1)
501 self.assertEqual(math.factorial(i), total)
502 self.assertEqual(math.factorial(float(i)), total)
503 self.assertEqual(math.factorial(i), py_factorial(i)
    [all...]

Completed in 481 milliseconds

12