| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/ |
| 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/ |
| Movie.java | 79 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale);
84 public static long gcd(long a, long b) {
88 return gcd(b, a % b);
|
| /frameworks/base/core/java/android/util/ |
| Rational.java | 122 int gcd = gcd(numerator, denominator); local
124 mNumerator = numerator / gcd;
125 mDenominator = denominator / gcd;
303 * @return An int value representing the gcd. Always positive.
306 public static int gcd(int numerator, int denominator) { method in class:Rational
310 * gcd(a, 0) := a
311 * gcd(a, b) := gcd(b, a mod b)
537 if (gcd(mNumerator, mDenominator) > 1)
[all...] |
| /packages/apps/Camera2/src/com/android/camera/util/ |
| AspectRatio.java | 49 int gcd = BigInteger.valueOf(width).gcd(BigInteger.valueOf(height)).intValue(); local
50 int simplifiedWidth = width / gcd;
51 int simplifiedHeight = height / gcd;
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| 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(i, j) > 0
[all...] |
| 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(7, -1)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| 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(i, j) > 0
[all...] |
| 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(7, -1)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
| 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); local
623 numerator /= gcd;
[all...] |
| BigFraction.java | 131 final BigInteger gcd = num.gcd(den); local
132 if (BigInteger.ONE.compareTo(gcd) < 0) {
133 num = num.divide(gcd);
134 den = den.divide(gcd);
1021 final BigInteger gcd = numerator.gcd(denominator); local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/ |
| 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);
|
| LongMathTest.java | 114 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b)));
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| BigIntegerBenchmark.java | 39 x.gcd(y);
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerModPowTest.java | 28 * Methods: modPow, modInverse, and gcd
240 * gcd: the second number is zero
250 BigInteger result = aNumber.gcd(bNumber);
260 * gcd: the first number is zero
270 BigInteger result = aNumber.gcd(bNumber);
280 * gcd: the first number is ZERO
288 BigInteger result = aNumber.gcd(bNumber);
298 * gcd: both numbers are zeros
304 BigInteger result = aNumber.gcd(bNumber);
313 * gcd: the first number is longe
[all...] |
| BigIntegerHashCodeTest.java | 45 aNumber1.gcd(aNumber2).pow(7);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
| RSAKeyPairGenerator.java | 107 lcm = phi.divide(pSub1.gcd(qSub1));
167 if (!e.gcd(p.subtract(ONE)).equals(ONE))
|
| /packages/apps/Camera2/src/com/android/camera/settings/ |
| ResolutionUtil.java | 291 BigInteger gcd = width.gcd(height); local
292 int numerator = Math.max(width.intValue(), height.intValue()) / gcd.intValue();
293 int denominator = Math.min(width.intValue(), height.intValue()) / gcd.intValue();
335 BigInteger gcd = width.gcd(height); local
336 int denominator = Math.min(width.intValue(), height.intValue()) / gcd.intValue();
|
| /external/guava/guava-tests/test/com/google/common/math/ |
| 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);
|
| 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);
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/ |
| dag.py | 2 from fractions import gcd namespace
266 g = gcd(g, levels[u]-levels[v] + 1)
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| getopt_long.c | 104 static int gcd(int, int);
135 gcd(int a, int b) function
166 ncycle = gcd(nnonopts, nopts);
|
| /external/mesa3d/src/getopt/ |
| 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/ |
| getopt_long.c | 98 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);
|
| /frameworks/base/media/java/android/media/ |
| Utils.java | 109 static int gcd(int a, int b) {
150 int common = gcd(num, den);
188 return (long)a * b / gcd(a, b);
|
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| IntMathBenchmark.java | 73 @Benchmark int gCD(int reps) {
77 tmp += IntMath.gcd(nonnegative[j], positive[j]);
|
