/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/ |
H A D | Math.java | 4 public static long gcd(long a, long b) { method in class:Math 13 public static int gcd(int a, int b) { method in class:Math 23 return a * (b / gcd(a, b)); 27 return a * (b / gcd(a, b));
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/ |
H A D | Movie.java | 79 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale); 84 public static long gcd(long a, long b) { method in class:Movie 88 return gcd(b, a % b);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
H A D | Fraction.java | 270 final int d = MathUtils.gcd(num, den); 489 int d1 = MathUtils.gcd(denominator, fraction.denominator); 508 // d2 = gcd(t,d1) = gcd(t mod d1, d1) 510 int d2 = (tmodd1==0)?d1:MathUtils.gcd(tmodd1, d1); 542 int d1 = MathUtils.gcd(numerator, fraction.denominator); 543 int d2 = MathUtils.gcd(fraction.numerator, denominator); 622 int gcd = MathUtils.gcd(numerator, denominator); 623 numerator /= gcd; [all...] |
H A D | BigFraction.java | 131 final BigInteger gcd = num.gcd(den); 132 if (BigInteger.ONE.compareTo(gcd) < 0) { 133 num = num.divide(gcd); 134 den = den.divide(gcd); 1021 final BigInteger gcd = numerator.gcd(denominator); 1022 return new BigFraction(numerator.divide(gcd), denominator.divide(gcd));
|
/external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/ |
H A D | IntMathTest.java | 196 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); 203 assertEquals(a, IntMath.gcd(a, 0)); 204 assertEquals(a, IntMath.gcd(0, a)); 206 assertEquals(0, IntMath.gcd(0, 0)); 212 IntMath.gcd(a, 3); 216 IntMath.gcd(3, a); 225 IntMath.gcd(a, 0); 229 IntMath.gcd(0, a);
|
H A D | LongMathTest.java | 114 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b)));
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
H A D | RSAKeyPairGenerator.java | 107 lcm = phi.divide(pSub1.gcd(qSub1)); 167 if (!e.gcd(p.subtract(ONE)).equals(ONE))
|
/external/guava/guava-tests/test/com/google/common/math/ |
H A D | IntMathTest.java | 363 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); 370 assertEquals(a, IntMath.gcd(a, 0)); 371 assertEquals(a, IntMath.gcd(0, a)); 373 assertEquals(0, IntMath.gcd(0, 0)); 379 IntMath.gcd(a, 3); 383 IntMath.gcd(3, a); 392 IntMath.gcd(a, 0); 396 IntMath.gcd(0, a);
|
H A D | LongMathTest.java | 433 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); 441 assertEquals(a, LongMath.gcd(a, 0)); 442 assertEquals(a, LongMath.gcd(0, a)); 444 assertEquals(0, LongMath.gcd(0, 0)); 451 LongMath.gcd(a, 3); 455 LongMath.gcd(3, a); 465 LongMath.gcd(a, 0); 469 LongMath.gcd(0, a);
|
/external/mesa3d/src/getopt/ |
H A D | getopt_long.c | 81 static int gcd(int, int); 102 gcd(int a, int b) function 133 ncycle = gcd(nnonopts, nopts);
|
/external/openssh/openbsd-compat/ |
H A D | getopt_long.c | 98 static int gcd(int, int); 119 gcd(int a, int b) function 150 ncycle = gcd(nnonopts, nopts);
|
/external/guava/guava-tests/benchmark/com/google/common/math/ |
H A D | IntMathBenchmark.java | 77 tmp += IntMath.gcd(nonnegative[j], positive[j]);
|
H A D | ApacheBenchmark.java | 49 return IntMath.gcd(a, b); 54 return LongMath.gcd(a, b);
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
H A D | MultiplyTimeScaleTrack.java | 29 import static com.googlecode.mp4parser.util.Math.gcd;
|
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
H A D | LongMath.java | 126 public static long gcd(long a, long b) { method in class:LongMath 129 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't 136 // BigInteger.gcd is consistent with this decision. 151 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). 152 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. 270 long commonDivisor = gcd(x, denominator); 273 // We know gcd(x, denominator) = 1, and x * numerator / denominator is exact,
|
/external/libavc/encoder/ |
H A D | ih264e_time_stamp.c | 33 * - gcd() 98 * @brief Function to compute gcd of two numbers 101 * Function to compute gcd of two numbers 116 static WORD32 gcd(WORD32 i4_x, WORD32 i4_y) function 280 WORD32 i4_gcd = gcd(u4_src_frm_rate, u4_tgt_frm_rate);
|
/external/llvm/lib/CodeGen/ |
H A D | TargetSchedule.cpp | 38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function 48 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
H A D | NFRuleSet.java | 640 // binary gcd algorithm from Knuth, "The Art of Computer Programming," 670 long gcd = x1 << p2; 672 // x * y == gcd(x, y) * lcm(x, y) 673 return x / gcd * y;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
H A D | MathUtils.java | 229 // Filter out the gcd, d, so j/d and i/d are integer. 233 final long d = gcd(i, j); 243 final long d = gcd(i, j); 871 * using the "binary gcd" method which avoids division and modulo 878 * <code>gcd(Integer.MIN_VALUE, Integer.MIN_VALUE)</code>, 879 * <code>gcd(Integer.MIN_VALUE, 0)</code> and 880 * <code>gcd(0, Integer.MIN_VALUE)</code> throw an 883 * <li>The result of <code>gcd(x, x)</code>, <code>gcd(0, x)</code> and 884 * <code>gcd( 897 public static int gcd(final int p, final int q) { method in class:MathUtils 986 public static long gcd(final long p, final long q) { method in class:MathUtils [all...] |
/external/clang/test/CXX/drs/ |
H A D | dr3xx.cpp | 1040 friend number gcd(number &x, number &y) {} function in class:dr387::old::number 1045 a = gcd(a, b); 1046 b = gcd(3, 4); // expected-error {{undeclared}} 1054 friend number gcd(number x, number y) { return 0; } function in class:dr387::newer::number 1059 a = gcd(a, b); 1060 b = gcd(3, 4); // expected-error {{undeclared}}
|
/external/boringssl/src/crypto/rsa/ |
H A D | rsa.c | 502 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; local 537 BN_init(&gcd); 549 !BN_gcd(&gcd, &pm1, &qm1, ctx) || 550 !BN_div(&lcm, NULL, &lcm, &gcd, ctx) || 600 BN_free(&gcd);
|
/external/guava/guava/src/com/google/common/io/ |
H A D | BaseEncoding.java | 510 int gcd = Math.min(8, Integer.lowestOneBit(bitsPerChar)); 511 this.charsPerChunk = 8 / gcd; 512 this.bytesPerChunk = bitsPerChar / gcd;
|
/external/guava/guava-gwt/src-super/com/google/common/io/super/com/google/common/io/ |
H A D | BaseEncoding.java | 413 int gcd = Math.min(8, Integer.lowestOneBit(bitsPerChar)); 414 this.charsPerChunk = 8 / gcd; 415 this.bytesPerChunk = bitsPerChar / gcd;
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
H A D | DefaultMp4Builder.java | 543 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale); 548 public static long gcd(long a, long b) { method in class:DefaultMp4Builder 552 return gcd(b, a % b);
|
/external/guava/guava/src/com/google/common/math/ |
H A D | LongMath.java | 457 public static long gcd(long a, long b) { method in class:LongMath 460 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't 467 // BigInteger.gcd is consistent with this decision. 482 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). 483 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. 715 long commonDivisor = gcd(x, denominator); 718 // We know gcd(x, denominator) = 1, and x * numerator / denominator is exact,
|