Searched defs:gcd (Results 1 - 25 of 25) sorted by relevance

/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
H A DMath.java4 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 DMovie.java79 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 DLongMath.java126 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 DIntMath.java243 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 DIntMath.java364 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 DLongMath.java457 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/libavc/encoder/
H A Dih264e_time_stamp.c33 * - 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 DTargetSchedule.cpp38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
48 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
/external/mesa3d/src/getopt/
H A Dgetopt_long.c81 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 DDefaultMp4Builder.java543 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 Dgetopt_long.c98 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);
/external/zlib/src/examples/
H A Dgzappend.c102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DMathUtils.java229 // 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/boringssl/src/crypto/rsa/
H A Drsa.c502 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/icu/icu4c/source/i18n/
H A Dnfrs.cpp64 // binary gcd algorithm from Knuth, "The Art of Computer Programming,"
95 int64_t gcd = x1 << p2; local
97 // x * y == gcd(x, y) * lcm(x, y)
98 return x / gcd * y;
/external/clang/test/SemaCXX/
H A Dconstant-expression-cxx11.cpp164 constexpr int gcd(int a, int b) { function in namespace:Recursion
168 static_assert(gcd(1749237, 5628959) == 7, "");
/external/clang/test/CXX/drs/
H A Ddr3xx.cpp1040 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/v8/benchmarks/
H A Dcrypto.js1157 // (public) gcd(this,a) (HAC 14.54)
1332 BigInteger.prototype.gcd = bnGCD;
1602 if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break;
1606 if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break;
1616 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dcommons-lang-2.6.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/commons/ org/apache/commons/lang/ ...
/external/owasp/sanitizer/distrib/lib/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/owasp/sanitizer/lib/guava-libraries/
H A Dguava.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/robolectric/lib/main/
H A Dandroid.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ...

Completed in 2214 milliseconds