| /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/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| IntMath.java | 109 public static int gcd(int a, int b) { method in class:IntMath
112 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
|
| /frameworks/base/core/java/android/hardware/camera2/ |
| Rational.java | 124 int thisGcd = gcd();
125 int otherGcd = other.gcd();
177 * @return An int value representing the gcd. Always positive.
180 public int gcd() { method in class:Rational
184 * gcd(a, 0) := a
185 * gcd(a, b) := gcd(b, a mod b)
|
| /external/guava/guava/src/com/google/common/math/ |
| IntMath.java | 333 public static int gcd(int a, int b) { method
336 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
|
| LongMath.java | 400 public static long gcd(long a, long b) { method
403 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't
412 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
589 // Dividing by the GCD suffices to avoid overflow in all the remaining cases.
591 int d = IntMath.gcd(n, i);
609 * binomial(BIGGEST_SIMPLE_BINOMIALS[k], k) doesn't need to use the slower GCD-based impl,
|
| /external/llvm/lib/CodeGen/ |
| TargetSchedule.cpp | 39 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
49 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| hwint.h | 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| hwint.h | 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| hwint.h | 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| hwint.h | 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
|
| /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/chromium_org/third_party/mesa/src/src/getopt/ |
| getopt_long.c | 81 static int gcd(int, int);
102 gcd(int a, int b) function
133 ncycle = gcd(nnonopts, nopts);
|
| /external/chromium_org/third_party/tlslite/tlslite/utils/ |
| cryptomath.py | 235 def gcd(a,b): function
244 return (a * b) / gcd(a, b)
|
| /external/dropbear/libtomcrypt/src/math/ |
| gmp_desc.c | 288 /* gcd */
289 static int gcd(void *a, void *b, void *c) function
427 &gcd,
|
| ltm_desc.c | 293 /* gcd */
294 static int gcd(void *a, void *b, void *c) function
433 &gcd,
|
| tfm_desc.c | 302 /* gcd */
303 static int gcd(void *a, void *b, void *c) function
721 &gcd,
|
| /external/harfbuzz/src/ |
| harfbuzz-gdef.c | 797 HB_ClassDefinition* gcd; local
805 gcd = &gdef->GlyphClassDef;
809 gcd->ClassFormat = 2;
811 gcd->cd.cd2.ClassRangeCount = 0;
812 gcd->cd.cd2.ClassRangeRecord = NULL;
832 if ( ( error = Make_ClassRange( gcd, start,
850 if ( ( error = Make_ClassRange( gcd, start,
873 if ( ( error = Make_ClassRange( gcd, start,
895 gcd->cd.cd2.ClassRangeCount + 1, HB_UShort* ) )
898 count = gcd->cd.cd2.ClassRangeCount
[all...] |
| /external/harfbuzz_ng/src/hb-old/ |
| harfbuzz-gdef.c | 797 HB_ClassDefinition* gcd; local
805 gcd = &gdef->GlyphClassDef;
809 gcd->ClassFormat = 2;
811 gcd->cd.cd2.ClassRangeCount = 0;
812 gcd->cd.cd2.ClassRangeRecord = NULL;
832 if ( ( error = Make_ClassRange( gcd, start,
850 if ( ( error = Make_ClassRange( gcd, start,
873 if ( ( error = Make_ClassRange( gcd, start,
895 gcd->cd.cd2.ClassRangeCount + 1, HB_UShort* ) )
898 count = gcd->cd.cd2.ClassRangeCount
[all...] |
| /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/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/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/ |
| 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/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...] |
