Home
last modified time | relevance | path

Searched refs:gcd (Results 1 – 25 of 47) sorted by relevance

12

/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
DMath.java4 public static long gcd(long a, long b) { in gcd() method in Math
13 public static int gcd(int a, int b) { in gcd() method in Math
23 return a * (b / gcd(a, b)); in lcm()
27 return a * (b / gcd(a, b)); in lcm()
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/
DMovie.java79 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale);
84 public static long gcd(long a, long b) {
88 return gcd(b, a % b);
/external/guava/guava-tests/test/com/google/common/math/
DIntMathTest.java339 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); in testGCD()
346 assertEquals(a, IntMath.gcd(a, 0)); in testGCDZero()
347 assertEquals(a, IntMath.gcd(0, a)); in testGCDZero()
349 assertEquals(0, IntMath.gcd(0, 0)); in testGCDZero()
355 IntMath.gcd(a, 3); in testGCDNegativePositiveThrows()
359 IntMath.gcd(3, a); in testGCDNegativePositiveThrows()
368 IntMath.gcd(a, 0); in testGCDNegativeZeroThrows()
372 IntMath.gcd(0, a); in testGCDNegativeZeroThrows()
DLongMathTest.java380 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); in testGCD()
387 assertEquals(a, LongMath.gcd(a, 0)); in testGCDZero()
388 assertEquals(a, LongMath.gcd(0, a)); in testGCDZero()
390 assertEquals(0, LongMath.gcd(0, 0)); in testGCDZero()
396 LongMath.gcd(a, 3); in testGCDNegativePositiveThrows()
400 LongMath.gcd(3, a); in testGCDNegativePositiveThrows()
409 LongMath.gcd(a, 0); in testGCDNegativeZeroThrows()
413 LongMath.gcd(0, a); in testGCDNegativeZeroThrows()
/external/llvm/test/CodeGen/X86/
D2011-01-24-DbgValue-Before-Use.ll23 define i64 @gcd(i64 %a, i64 %b) nounwind readnone optsize noinline ssp {
57 %call6 = tail call i64 @gcd(i64 %conv, i64 %conv5) optsize, !dbg !26
81gcd", metadata !"gcd", metadata !"", i32 5, metadata !3, i1 false, i1 true, i32 0, i32 0, null, i3…
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
DRSAKeyPairGenerator.java62 if (e.gcd(p.subtract(ONE)).equals(ONE)) in generateKeyPair()
95 if (e.gcd(q.subtract(ONE)).equals(ONE)) in generateKeyPair()
/external/mesa3d/src/getopt/
Dgetopt_long.c81 static int gcd(int, int);
102 gcd(int a, int b) in gcd() function
133 ncycle = gcd(nnonopts, nopts); in permute_args()
/external/chromium_org/third_party/mesa/src/src/getopt/
Dgetopt_long.c81 static int gcd(int, int);
102 gcd(int a, int b) in gcd() function
133 ncycle = gcd(nnonopts, nopts); in permute_args()
/external/chromium_org/third_party/boringssl/src/crypto/rsa/
Drsa.c508 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; in RSA_check_key() local
543 BN_init(&gcd); in RSA_check_key()
555 !BN_gcd(&gcd, &pm1, &qm1, ctx) || in RSA_check_key()
556 !BN_div(&lcm, NULL, &lcm, &gcd, ctx) || in RSA_check_key()
606 BN_free(&gcd); in RSA_check_key()
/external/clang/test/CXX/drs/
Ddr3xx.cpp1022 friend number gcd(number &x, number &y) {}
1027 a = gcd(a, b);
1028 b = gcd(3, 4); // expected-error {{undeclared}}
1036 friend number gcd(number x, number y) { return 0; }
1041 a = gcd(a, b);
1042 b = gcd(3, 4); // expected-error {{undeclared}}
/external/llvm/lib/CodeGen/
DTargetSchedule.cpp39 static unsigned gcd(unsigned Dividend, unsigned Divisor) { in gcd() function
49 unsigned LCM = (uint64_t(A) * B) / gcd(A, B); in lcm()
/external/chromium_org/components/cloud_devices/tools/prototype/
Dprototype.py511 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/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/
DIntMath.java109 public static int gcd(int a, int b) { in gcd() method in IntMath
/external/chromium_org/third_party/tlslite/tlslite/utils/
Dcryptomath.py178 def gcd(a,b): function
185 return (a * b) // gcd(a, b)
/external/chromium_org/third_party/boringssl/src/crypto/bn/
DCMakeLists.txt50 gcd.c
/external/guava/guava/src/com/google/common/math/
DLongMath.java400 public static long gcd(long a, long b) { in gcd() method
591 int d = IntMath.gcd(n, i);
DIntMath.java333 public static int gcd(int a, int b) { in gcd() method
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
DMultiplyTimeScaleTrack.java29 import static com.googlecode.mp4parser.util.Math.gcd;
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
DDefaultMp4Builder.java543 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale); in getTimescale()
548 public static long gcd(long a, long b) { in gcd() method
552 return gcd(b, a % b); in gcd()
/external/zlib/src/examples/
Dgzappend.c102 local unsigned gcd(unsigned a, unsigned b) in gcd() function
154 cycles = gcd(len, rot); /* number of cycles */ in rotate()
/external/icu/icu4c/source/i18n/
Dnfrs.cpp95 int64_t gcd = x1 << p2; in util_lcm() local
98 return x / gcd * y; in util_lcm()
/external/chromium_org/third_party/icu/source/i18n/
Dnfrs.cpp95 int64_t gcd = x1 << p2; in util_lcm() local
98 return x / gcd * y; in util_lcm()
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/common/
Dutilities.js369 Number.gcd = function(a, b) function
374 return Number.gcd(b, a % b);
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
Dv8-crypto.js1324 BigInteger.prototype.gcd = bnGCD; method in BigInteger
1594 …if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrim…
1598 …if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrim…
1608 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {
/external/chromium_org/v8/benchmarks/
Dcrypto.js1332 BigInteger.prototype.gcd = bnGCD; method in BigInteger
1602 …if(this.p.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.p.isProbablePrim…
1606 …if(this.q.subtract(BigInteger.ONE).gcd(ee).compareTo(BigInteger.ONE) == 0 && this.q.isProbablePrim…
1616 if(phi.gcd(ee).compareTo(BigInteger.ONE) == 0) {

12