Home
last modified time | relevance | path

Searched refs:factorial (Results 1 – 25 of 32) sorted by relevance

12

/third_party/skia/third_party/externals/oboe/samples/RhythmGame/third_party/glm/gtx/
Dinteger.inl71 // factorial (!12 max, integer only)
73 GLM_FUNC_QUALIFIER genType factorial(genType const & x) function
83 GLM_FUNC_QUALIFIER tvec2<T, P> factorial( function
87 factorial(x.x),
88 factorial(x.y));
92 GLM_FUNC_QUALIFIER tvec3<T, P> factorial( function
96 factorial(x.x),
97 factorial(x.y),
98 factorial(x.z));
102 GLM_FUNC_QUALIFIER tvec4<T, P> factorial( function
[all …]
Dinteger.hpp47 GLM_FUNC_DECL genType factorial(genType const & x);
Dcolor_space.inl19 // factorial part of h
/third_party/alsa-lib/alsalisp/
Dhello.lisp13 (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/
Dbench.py57 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/
Dprofilee.py33 factorial(14) # 130
35 def factorial(n): function
43 return mul(n, factorial(n-1))
86 factorial(3) # 20
Dtest_math.py495 self.assertEqual(math.factorial(0), 1)
499 self.assertEqual(math.factorial(i), total)
500 self.assertEqual(math.factorial(i), py_factorial(i))
501 self.assertRaises(ValueError, math.factorial, -1)
502 self.assertRaises(ValueError, math.factorial, -10**100)
505 self.assertRaises(TypeError, math.factorial, 5.0)
506 self.assertRaises(TypeError, math.factorial, 5.2)
507 self.assertRaises(TypeError, math.factorial, -1.0)
508 self.assertRaises(TypeError, math.factorial, -1e100)
509 self.assertRaises(TypeError, math.factorial, decimal.Decimal('5'))
[all …]
Dtest_random.py11 from math import log, exp, pi, fsum, sin, factorial
147 expected = factorial(n) // factorial(n-k)
/third_party/typescript/tests/arkTSTest/testcase/arkts-no-func-props/
Darkts-no-func-props-5-error.ets24 calculateFactorial.description = "This function calculates the factorial of a number.";
34 const factorial = calculateFactorial(5);
35 console.log(`The factorial of 5 is ${factorial}.`);
/third_party/vixl/examples/aarch64/
Dfactorial.cc65 Label factorial; in main() local
66 masm.Bind(&factorial); in main()
73 simulator.RunFrom(masm.GetLabelAddress<Instruction*>(&factorial)); in main()
/third_party/rust/crates/syn/examples/trace-var/
DREADME.md7 Consider the following factorial implementation.
11 fn factorial(mut n: u64) -> u64 {
21 Invoking this with `factorial(8)` prints all the values of `p` and `n` during
/third_party/rust/crates/syn/examples/trace-var/example/src/
Dmain.rs4 println!("{}", factorial(8)); in main()
8 fn factorial(mut n: u64) -> u64 { in factorial() function
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/pipeline/
DvktPipelineCombinationsIterator.hpp51 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/
DvktPipelineCombinationsIterator.hpp51 static deUint32 factorial (deUint32 x);
128 deUint32 CombinationsIterator<T>::factorial (deUint32 x) in factorial() function in vkt::pipeline::CombinationsIterator
/third_party/python/Doc/library/
Dasyncio-task.rst383 async def factorial(name, number):
386 print(f"Task {name}: Compute factorial({number}), currently i={i}...")
389 print(f"Task {name}: factorial({number}) = {f}")
395 factorial("A", 2),
396 factorial("B", 3),
397 factorial("C", 4),
405 # Task A: Compute factorial(2), currently i=2...
406 # Task B: Compute factorial(3), currently i=2...
407 # Task C: Compute factorial(4), currently i=2...
408 # Task A: factorial(2) = 2
[all …]
Ddoctest.rst36 The example module supplies one function, factorial(). For example,
38 >>> factorial(5)
42 def factorial(n):
43 """Return the factorial of n, an exact integer >= 0.
45 >>> [factorial(n) for n in range(6)]
47 >>> factorial(30)
49 >>> factorial(-1)
55 >>> factorial(30.1)
59 >>> factorial(30.0)
63 >>> factorial(1e100)
[all …]
Dfunctools.rst42 def factorial(n):
43 return n * factorial(n-1) if n else 1
45 >>> factorial(10) # no previously cached result, makes 11 recursive calls
47 >>> factorial(5) # just looks up cached value result
49 >>> factorial(12) # makes two new recursive calls, the other 10 are cached
Dmath.rst69 .. function:: factorial(x)
71 Return *x* factorial as an integer. Raises :exc:`ValueError` if *x* is not integral or
/third_party/vixl/test/aarch64/examples/
Dtest-examples.cc192 TEST_FUNCTION(factorial); \
196 TEST(factorial) { in TEST() argument
199 Label factorial; in TEST() local
200 masm.Bind(&factorial); in TEST()
/third_party/googletest/docs/
Dprimer.md173 int Factorial(int n); // Returns the factorial of n
179 // Tests factorial of 0.
184 // Tests factorial of positive numbers.
/third_party/python/Doc/whatsnew/
D2.6.rst580 factorial. The function doing the calculation is written strangely so
590 def factorial(queue, N):
591 "Compute a factorial."
609 p = Process(target=factorial, args=(queue, N))
616 A :class:`~queue.Queue` is used to communicate the result of the factorial.
634 def factorial(N, dictionary):
635 "Compute a factorial."
638 result = p.map(factorial, range(1, 1000, 10))
666 def factorial(N, dictionary):
667 "Compute a factorial."
[all …]
D3.1.rst536 return sum(1/math.factorial(x) for x in reversed(range(30)))
D3.2.rst1078 The :func:`~math.gamma` function is a continuous extension of the factorial
1085 >>> gamma(7.0) # six factorial
1087 >>> lgamma(801.0) # log(800 factorial)
/third_party/python/Doc/tools/
Dsusp-ignored.csv130 library/doctest,,`,``factorial`` from the ``example`` module:
132 library/doctest,,`,Using ``factorial``
/third_party/python/Misc/NEWS.d/
D3.9.0a1.rst2945 :func:`math.factorial`.
3143 math.factorial().
3153 factorial.

12