/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-tests/test/com/google/common/math/ |
H A D | IntMathTest.java | 339 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); 346 assertEquals(a, IntMath.gcd(a, 0)); 347 assertEquals(a, IntMath.gcd(0, a)); 349 assertEquals(0, IntMath.gcd(0, 0)); 355 IntMath.gcd(a, 3); 359 IntMath.gcd(3, a); 368 IntMath.gcd(a, 0); 372 IntMath.gcd(0, a);
|
H A D | LongMathTest.java | 380 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); 387 assertEquals(a, LongMath.gcd(a, 0)); 388 assertEquals(a, LongMath.gcd(0, a)); 390 assertEquals(0, LongMath.gcd(0, 0)); 396 LongMath.gcd(a, 3); 400 LongMath.gcd(3, a); 409 LongMath.gcd(a, 0); 413 LongMath.gcd(0, a);
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
H A D | RSAKeyPairGenerator.java | 62 if (e.gcd(p.subtract(ONE)).equals(ONE)) 95 if (e.gcd(q.subtract(ONE)).equals(ONE))
|
/external/harfbuzz/src/ |
H A D | 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 [all...] |
/external/harfbuzz_ng/src/hb-old/ |
H A D | 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 [all...] |
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
H A D | 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
|
/external/chromium_org/third_party/mesa/src/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/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/tracks/ |
H A D | MultiplyTimeScaleTrack.java | 29 import static com.googlecode.mp4parser.util.Math.gcd;
|
/external/llvm/lib/CodeGen/ |
H A D | TargetSchedule.cpp | 39 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function 49 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
|
/external/chromium_org/third_party/tlslite/tlslite/utils/ |
H A D | cryptomath.py | 235 def gcd(a,b): function 244 return (a * b) / gcd(a, b)
|
/external/dropbear/libtomcrypt/src/headers/ |
H A D | tomcrypt_math.h | 248 /** gcd 254 int (*gcd)(void *a, void *b, void *c); member in struct:__anon16800 481 #define mp_gcd(a, b, c) ltc_mp.gcd(a, b, c)
|
/external/dropbear/libtomcrypt/src/math/ |
H A D | gmp_desc.c | 288 /* gcd */ 289 static int gcd(void *a, void *b, void *c) function 427 &gcd,
|
H A D | ltm_desc.c | 293 /* gcd */ 294 static int gcd(void *a, void *b, void *c) function 433 &gcd,
|
H A D | tfm_desc.c | 302 /* gcd */ 303 static int gcd(void *a, void *b, void *c) function 721 &gcd,
|
/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/guava/guava/src/com/google/common/math/ |
H A D | LongMath.java | 400 public static long gcd(long a, long b) { method in class:LongMath 403 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't 591 int d = IntMath.gcd(n, i);
|
H A D | IntMath.java | 333 public static int gcd(int a, int b) { method in class:IntMath 336 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
|
/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/chromium_org/third_party/icu/source/i18n/ |
H A D | nfrs.cpp | 65 // binary gcd algorithm from Knuth, "The Art of Computer Programming," 96 int64_t gcd = x1 << p2; local 98 // x * y == gcd(x, y) * lcm(x, y) 99 return x / gcd * y;
|
/external/icu4c/i18n/ |
H A D | 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;
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | utilities.js | 298 Number.gcd = function(a, b) 303 return Number.gcd(b, a % b);
|
/external/dropbear/libtommath/mtest/ |
H A D | mpi.c | 2018 ... by computing the product, and dividing out the gcd. 2023 mp_int gcd, prod; local 2029 if((res = mp_init(&gcd)) != MP_OKAY) 2036 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY) 2039 res = mp_div(&prod, &gcd, c, NULL); 2044 mp_clear(&gcd);
|