| /third_party/alsa-lib/alsalisp/ |
| H A D | hello.lisp | 13 (defun factorial (n) (if (> n 1) (* n (factorial (- n 1))) 1)) function
14 (princ "Factorial of 10: " (factorial 10) "\n")
16 (princ "Factorial of 10.0: " (factorial 10.0) "\n")
17 (princ "Factorial of 20.0: " (factorial 20.0) "\n")
18 (unsetq factorial)
|
| /third_party/python/Modules/_decimal/tests/ |
| H A D | bench.py | 57 def factorial(n, m): function
59 return factorial(m, n)
65 return factorial(n, (n+m)//2) * factorial((n+m)//2 + 1, m)
107 x = factorial(C.Decimal(n), 0)
118 y = factorial(n, 0)
|
| /third_party/python/Lib/test/ |
| H A D | profilee.py | 33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
|
| H A D | test_math.py | 56 # Here's a pure Python version of the math.factorial algorithm, for
61 # factorial(n) = factorial_odd_part(n) << (n - count_set_bits(n))
97 described at http://www.luschny.de/math/factorial/binarysplitfact.html
522 self.assertEqual(math.factorial(0), 1)
526 self.assertEqual(math.factorial(i), total)
527 self.assertEqual(math.factorial(i), py_factorial(i))
528 self.assertRaises(ValueError, math.factorial, -1)
529 self.assertRaises(ValueError, math.factorial, -10**100)
532 self.assertRaises(TypeError, math.factorial, 5.0)
533 self.assertRaises(TypeError, math.factorial, 5.
[all...] |
| H A D | test_random.py | 11 from math import log, exp, pi, fsum, sin, factorial namespace
96 # permutations of 1000 objects is 1000! (factorial of 1000),
152 expected = factorial(n) // factorial(n-k)
|
| /third_party/vixl/examples/aarch64/ |
| H A D | factorial.cc | 35 // uint64_t factorial(uint64_t n) in GenerateFactorial()
65 Label factorial; in main() local
66 masm.Bind(&factorial); in main()
73 simulator.RunFrom(masm.GetLabelAddress<Instruction*>(&factorial)); in main()
74 printf("factorial(%" PRIu64 ") = %" PRId64 "\n", in main()
|
| /third_party/rust/crates/syn/examples/trace-var/example/src/ |
| H A D | main.rs | 4 println!("{}", factorial(8)); in main()
8 fn factorial(mut n: u64) -> u64 { in factorial() functions
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/pipeline/ |
| H A D | vktPipelineCombinationsIterator.hpp | 51 static deUint32 factorial (deUint32 x);
128 deUint32 CombinationsIterator<T>::factorial (deUint32 x) in factorial() function in vkt::pipeline::CombinationsIterator
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/pipeline/ |
| H A D | vktPipelineCombinationsIterator.hpp | 51 static deUint32 factorial (deUint32 x);
128 deUint32 CombinationsIterator<T>::factorial (deUint32 x) in factorial() function in vkt::pipeline::CombinationsIterator
|
| /third_party/skia/third_party/externals/oboe/samples/RhythmGame/third_party/glm/gtx/ |
| H A D | integer.hpp | 44 //! Return the factorial value of a number (!12 max, integer only)
47 GLM_FUNC_DECL genType factorial(genType const & x);
|
| /third_party/vixl/test/aarch64/examples/ |
| H A D | test-examples.cc | 192 TEST_FUNCTION(factorial); \
196 TEST(factorial) { in TEST()
199 Label factorial; in TEST() local
200 masm.Bind(&factorial); in TEST()
|