/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/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,
|
H A D | IntMath.java | 243 public static int gcd(int a, int b) { method in class:IntMath 246 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31 253 // BigInteger.gcd is consistent with this decision. 268 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). 269 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
|
/external/guava/guava/src/com/google/common/math/ |
H A D | IntMath.java | 364 public static int gcd(int a, int b) { method in class:IntMath 367 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31 374 // BigInteger.gcd is consistent with this decision. 389 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). 390 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
|
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,
|
/external/webrtc/webrtc/common_audio/ |
H A D | blocker.cc | 87 size_t gcd(size_t a, size_t b) { function in namespace:__anon26045 112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)),
|
/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/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/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/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/python/cpython2/Lib/ |
H A D | fractions.py | 13 __all__ = ['Fraction', 'gcd'] 18 def gcd(a, b): function 163 g = gcd(numerator, denominator)
|
/external/python/cpython2/Lib/test/ |
H A D | test_binop.py | 6 def gcd(a, b): function 44 g = gcd(den, num) 217 self.assertEqual(gcd(10, 12), 2) 218 self.assertEqual(gcd(10, 15), 5) 219 self.assertEqual(gcd(10, 11), 1) 220 self.assertEqual(gcd(100, 15), 5) 221 self.assertEqual(gcd(-10, 2), -2) 222 self.assertEqual(gcd(10, -2), 2) 223 self.assertEqual(gcd(-10, -2), -2) 226 self.assertTrue(gcd( [all...] |
H A D | test_fractions.py | 14 gcd = fractions.gcd variable 60 g = gcd(num, den) 98 self.assertEqual(0, gcd(0, 0)) 99 self.assertEqual(1, gcd(1, 0)) 100 self.assertEqual(-1, gcd(-1, 0)) 101 self.assertEqual(1, gcd(0, 1)) 102 self.assertEqual(-1, gcd(0, -1)) 103 self.assertEqual(1, gcd(7, 1)) 104 self.assertEqual(-1, gcd( [all...] |
/external/zlib/src/examples/ |
H A D | gzappend.c | 102 local unsigned gcd(unsigned a, unsigned b) function 154 cycles = gcd(len, rot); /* number of cycles */
|
/external/boringssl/src/crypto/fipsmodule/rsa/ |
H A D | rsa_impl.c | 880 /* Check gcd(out-1, e) is one (steps 4.5 and 5.6). */ 939 BIGNUM *gcd = BN_CTX_get(ctx); local 940 if (totient == NULL || pm1 == NULL || qm1 == NULL || gcd == NULL) { 987 !BN_gcd(gcd, pm1, qm1, ctx) || 988 !BN_div(totient, NULL, totient, gcd, ctx) ||
|
H A D | rsa.c | 569 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp_times_q; local 604 BN_init(&gcd); 615 !BN_gcd(&gcd, &pm1, &qm1, ctx)) { 620 if (!BN_div(&lcm, NULL, &lcm, &gcd, ctx) || 621 !BN_gcd(&gcd, &pm1, &qm1, ctx) || 672 BN_free(&gcd);
|
/external/tcpdump/missing/ |
H A D | getopt_long.c | 89 static int gcd(int, int); 119 gcd(int a, int b) function 150 ncycle = gcd(nnonopts, nopts);
|
/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/icu/icu4c/source/i18n/ |
H A D | nfrs.cpp | 82 // binary gcd algorithm from Knuth, "The Art of Computer Programming," 113 int64_t gcd = x1 << p2; local 115 // x * y == gcd(x, y) * lcm(x, y) 116 return x / gcd * y;
|
/external/clang/test/SemaCXX/ |
H A D | constant-expression-cxx11.cpp | 164 constexpr int gcd(int a, int b) { function in namespace:Recursion 168 static_assert(gcd(1749237, 5628959) == 7, "");
|
/external/python/cpython2/Modules/ |
H A D | audioop.c | 1073 gcd(int a, int b) function 1127 d = gcd(inrate, outrate); 1131 d = gcd(weightA, weightB);
|
/external/webrtc/webrtc/modules/video_coding/codecs/vp8/ |
H A D | vp8_impl.cc | 415 int gcd = GCD(inst->simulcastStream[idx].width, local 417 downsampling_factors_[i].num = inst->simulcastStream[idx].width / gcd; 418 downsampling_factors_[i].den = inst->simulcastStream[idx - 1].width / gcd;
|
/external/clang/test/CXX/drs/ |
H A D | dr3xx.cpp | 1028 friend number gcd(number &x, number &y) {} function in class:dr387::old::number 1033 a = gcd(a, b); 1034 b = gcd(3, 4); // expected-error {{undeclared}} 1042 friend number gcd(number x, number y) { return 0; } function in class:dr387::newer::number 1047 a = gcd(a, b); 1048 b = gcd(3, 4); // expected-error {{undeclared}}
|