| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| MultiplyTimeScaleTrack.java | 29 import static com.googlecode.mp4parser.util.Math.gcd;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/isl/ |
| seq.h | 41 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/isl/ |
| seq.h | 41 void isl_seq_gcd(isl_int *p, unsigned len, isl_int *gcd);
|
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| 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.
142 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
150 // The key to the binary GCD algorithm is as follows:
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)
[all...] |
| IntMath.java | 243 public static int gcd(int a, int b) { method
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.
259 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
267 // The key to the binary GCD algorithm is as follows:
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-tests/benchmark/com/google/common/math/ |
| ApacheBenchmark.java | 49 return IntMath.gcd(a, b);
54 return LongMath.gcd(a, b);
|
| /external/libavc/encoder/ |
| ih264e_time_stamp.c | 33 * - gcd()
98 * @brief Function to compute gcd of two numbers
101 * Function to compute gcd of two numbers
110 * GCD(value 1, value 2)
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/ |
| TargetSchedule.cpp | 38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
48 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
| /frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/unit/ |
| RationalTest.java | 50 assertEquals(1, Rational.gcd(1, 2));
51 assertEquals(1, Rational.gcd(2, 3));
52 assertEquals(78, Rational.gcd(5*78, 7*78));
53 assertEquals(1, Rational.gcd(-1, 2));
54 assertEquals(1, Rational.gcd(-2, 3));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| hwint.h | 274 extern HOST_WIDE_INT gcd (HOST_WIDE_INT, HOST_WIDE_INT);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| NFRuleSet.java | 640 // binary gcd algorithm from Knuth, "The Art of Computer Programming,"
670 long gcd = x1 << p2; local
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/ |
| 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(x, 0)</code> is the absolute value of <code>x</code>, excep
[all...] |
| /external/clang/test/CXX/drs/ |
| 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}}
[all...] |
| /external/boringssl/src/crypto/rsa/ |
| 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/ |
| 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/ |
| BaseEncoding.java | 413 int gcd = Math.min(8, Integer.lowestOneBit(bitsPerChar)); local
414 this.charsPerChunk = 8 / gcd;
415 this.bytesPerChunk = bitsPerChar / gcd;
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| DefaultMp4Builder.java | 543 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale);
548 public static long gcd(long a, long b) { method
552 return gcd(b, a % b);
|
| /frameworks/av/services/audioflinger/ |
| AudioResamplerDyn.cpp | 250 // recursive gcd. Using objdump, it appears the tail recursion is converted to a while loop.
251 static int gcd(int n, int m) function in namespace:android
256 return gcd(m, n % m);
362 int phases = mSampleRate / gcd(mSampleRate, inSampleRate);
|
| /external/guava/guava/src/com/google/common/math/ |
| LongMath.java | 457 public static long gcd(long a, long b) { method
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.
473 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
481 // The key to the binary GCD algorithm is as follows:
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)
[all...] |
| /external/zlib/src/examples/ |
| gzappend.c | 102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| fractions.py | 13 __all__ = ['Fraction', 'gcd']
18 def gcd(a, b): function
163 g = gcd(numerator, denominator)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| fractions.py | 13 __all__ = ['Fraction', 'gcd']
18 def gcd(a, b): function
163 g = gcd(numerator, denominator)
|
| /packages/apps/Calculator/ |
| arity-2.1.2.jar | |
| /external/icu/icu4c/source/i18n/ |
| nfrs.cpp | 64 // 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;
|
| /libcore/luni/src/main/java/java/math/ |
| BigInteger.java | 885 public BigInteger gcd(BigInteger value) { method in class:BigInteger
886 return new BigInteger(BigInt.gcd(getBigInt(), value.getBigInt()));
[all...] |
