/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/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | math_semantic_attr.js | 805 'log', 'ln', 'lg', 'exp', 'expt', 'gcd', 'gcd', 'arg', 'im', 're', 'Pr'
|
/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/chromium_org/third_party/tlslite/tlslite/utils/ |
H A D | cryptomath.py | 178 def gcd(a,b): function 185 return (a * b) // gcd(a, b)
|
/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/components/cloud_devices/tools/prototype/ |
H A D | prototype.py | 511 self.gcd = build_from_document(discovery, developerKey=self.api_key, 540 self.gcd.registrationTickets().patch(registrationTicketId=token, 543 final_ticket = self.gcd.registrationTickets().finalize( 561 self.gcd.devices().get(deviceId=self.device_id).execute() 577 commands = self.gcd.commands().list(deviceId=self.device_id, 602 self.gcd.commands().patch(commandId=command['id'],
|
/external/clang/test/CXX/drs/ |
H A D | dr3xx.cpp | 1022 friend number gcd(number &x, number &y) {} function in class:dr387::old::number 1027 a = gcd(a, b); 1028 b = gcd(3, 4); // expected-error {{undeclared}} 1036 friend number gcd(number x, number y) { return 0; } function in class:dr387::newer::number 1041 a = gcd(a, b); 1042 b = gcd(3, 4); // expected-error {{undeclared}}
|
/external/chromium_org/third_party/boringssl/src/crypto/rsa/ |
H A D | rsa.c | 508 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; local 543 BN_init(&gcd); 555 !BN_gcd(&gcd, &pm1, &qm1, ctx) || 556 !BN_div(&lcm, NULL, &lcm, &gcd, ctx) || 606 BN_free(&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 | 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/icu/icu4c/source/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/common/ |
H A D | utilities.js | 369 Number.gcd = function(a, b) 374 return Number.gcd(b, a % b);
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-crypto.js | 1149 // (public) gcd(this,a) (HAC 14.54) 1324 BigInteger.prototype.gcd = bnGCD; 1594 if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break; 1598 if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break; 1608 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-crypto.js | 1149 // (public) gcd(this,a) (HAC 14.54) 1324 BigInteger.prototype.gcd = bnGCD; 1594 if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break; 1598 if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break; 1608 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-crypto.js | 1149 // (public) gcd(this,a) (HAC 14.54) 1324 BigInteger.prototype.gcd = bnGCD; 1594 if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrime(10)) break; 1598 if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrime(10)) break; 1608 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
|