OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:factorial
(Results
1 - 11
of
11
) sorted by null
/external/clang/test/Analysis/
inline.c
33
unsigned
factorial
(unsigned x) {
function
36
return x *
factorial
(x - 1);
40
if (
factorial
(3) == 6) {
51
unsigned x =
factorial
(3);
52
if (x ==
factorial
(3)) {
/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
218
constexpr int
factorial
(int n) {
function in namespace:NonLiteralConstexpr
219
return n ?
factorial
(n-1) * n : 1;
224
constexpr NonTrivialDtor() : n(
factorial
(5)), p(&n) {}
/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
Completed in 573 milliseconds