/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/ |
D | Math.java | 4 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/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/ |
D | RSAKeyPairGenerator.java | 60 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; in generateKeyPair() local 112 gcd = p; in generateKeyPair() 114 q = gcd; in generateKeyPair() 119 gcd = pSub1.gcd(qSub1); in generateKeyPair() 120 lcm = pSub1.divide(gcd).multiply(qSub1); in generateKeyPair() 181 if (!e.gcd(p.subtract(ONE)).equals(ONE)) in chooseRandomPrime()
|
/external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/ |
D | IntMathTest.java | 196 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); in testGCD() 203 assertEquals(a, IntMath.gcd(a, 0)); in testGCDZero() 204 assertEquals(a, IntMath.gcd(0, a)); in testGCDZero() 206 assertEquals(0, IntMath.gcd(0, 0)); in testGCDZero() 212 IntMath.gcd(a, 3); in testGCDNegativePositiveThrows() 216 IntMath.gcd(3, a); in testGCDNegativePositiveThrows() 225 IntMath.gcd(a, 0); in testGCDNegativeZeroThrows() 229 IntMath.gcd(0, a); in testGCDNegativeZeroThrows()
|
D | LongMathTest.java | 114 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); in testGCDExhaustive()
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
D | Fraction.java | 270 final int d = MathUtils.gcd(num, den); in Fraction() 489 int d1 = MathUtils.gcd(denominator, fraction.denominator); in addSub() 510 int d2 = (tmodd1==0)?d1:MathUtils.gcd(tmodd1, d1); in addSub() 542 int d1 = MathUtils.gcd(numerator, fraction.denominator); in multiply() 543 int d2 = MathUtils.gcd(fraction.numerator, denominator); in multiply() 622 int gcd = MathUtils.gcd(numerator, denominator); in getReducedFraction() local 623 numerator /= gcd; in getReducedFraction() 624 denominator /= gcd; in getReducedFraction()
|
D | BigFraction.java | 131 final BigInteger gcd = num.gcd(den); in BigFraction() local 132 if (BigInteger.ONE.compareTo(gcd) < 0) { in BigFraction() 133 num = num.divide(gcd); in BigFraction() 134 den = den.divide(gcd); in BigFraction() 1021 final BigInteger gcd = numerator.gcd(denominator); in reduce() local 1022 return new BigFraction(numerator.divide(gcd), denominator.divide(gcd)); in reduce()
|
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/ |
D | Movie.java | 79 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/ |
D | IntMathTest.java | 363 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b))); in testGCD() 370 assertEquals(a, IntMath.gcd(a, 0)); in testGCDZero() 371 assertEquals(a, IntMath.gcd(0, a)); in testGCDZero() 373 assertEquals(0, IntMath.gcd(0, 0)); in testGCDZero() 379 IntMath.gcd(a, 3); in testGCDNegativePositiveThrows() 383 IntMath.gcd(3, a); in testGCDNegativePositiveThrows() 392 IntMath.gcd(a, 0); in testGCDNegativeZeroThrows() 396 IntMath.gcd(0, a); in testGCDNegativeZeroThrows()
|
D | LongMathTest.java | 433 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b))); in testGCDExhaustive() 441 assertEquals(a, LongMath.gcd(a, 0)); in testGCDZero() 442 assertEquals(a, LongMath.gcd(0, a)); in testGCDZero() 444 assertEquals(0, LongMath.gcd(0, 0)); in testGCDZero() 451 LongMath.gcd(a, 3); in testGCDNegativePositiveThrows() 455 LongMath.gcd(3, a); in testGCDNegativePositiveThrows() 465 LongMath.gcd(a, 0); in testGCDNegativeZeroThrows() 469 LongMath.gcd(0, a); in testGCDNegativeZeroThrows()
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/rsa/rsa/ |
D | prime.py | 27 def gcd(p, q): function 151 d = gcd(a, b)
|
D | _version133.py | 37 def gcd(p, q): function 44 if p<q: return gcd(q, p) 46 return gcd(q, abs(p%q)) 250 d = gcd(a, b)
|
/external/boringssl/src/crypto/rsa/ |
D | rsa.c | 534 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; in RSA_check_key() local 569 BN_init(&gcd); in RSA_check_key() 580 !BN_gcd(&gcd, &pm1, &qm1, ctx)) { in RSA_check_key() 597 !BN_gcd(&gcd, &gcd, &pm1, ctx)) { in RSA_check_key() 603 if (!BN_div(&lcm, NULL, &lcm, &gcd, ctx) || in RSA_check_key() 604 !BN_gcd(&gcd, &pm1, &qm1, ctx) || in RSA_check_key() 654 BN_free(&gcd); in RSA_check_key()
|
/external/mesa3d/src/getopt/ |
D | getopt_long.c | 81 static int gcd(int, int); 102 gcd(int a, int b) in gcd() function 133 ncycle = gcd(nnonopts, nopts); in permute_args()
|
/external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
D | LongMath.java | 126 public static long gcd(long a, long b) { in gcd() method in LongMath 270 long commonDivisor = gcd(x, denominator); in multiplyFraction()
|
/external/webrtc/webrtc/common_audio/ |
D | blocker.cc | 87 size_t gcd(size_t a, size_t b) { in gcd() function 112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)), in Blocker()
|
/external/llvm/test/CodeGen/X86/ |
D | 2011-01-24-DbgValue-Before-Use.ll | 23 define i64 @gcd(i64 %a, i64 %b) nounwind readnone optsize noinline ssp !dbg !0 { 57 %call6 = tail call i64 @gcd(i64 %conv, i64 %conv5) optsize, !dbg !26 81 !0 = distinct !DISubprogram(name: "gcd", line: 5, isLocal: false, isDefinition: true, virtualIndex:…
|
/external/tcpdump/missing/ |
D | getopt_long.c | 89 static int gcd(int, int); 119 gcd(int a, int b) in gcd() function 150 ncycle = gcd(nnonopts, nopts); in permute_args()
|
/external/libavc/encoder/ |
D | ih264e_time_stamp.c | 116 static WORD32 gcd(WORD32 i4_x, WORD32 i4_y) in gcd() function 280 WORD32 i4_gcd = gcd(u4_src_frm_rate, u4_tgt_frm_rate); in ih264e_init_frame_time()
|
/external/libweave/src/privet/ |
D | wifi_ssid_generator.h | 20 WifiSsidGenerator(const CloudDelegate* gcd, const WifiDelegate* wifi);
|
D | privet_handler.cc | 290 std::unique_ptr<base::DictionaryValue> gcd(new base::DictionaryValue()); in CreateGcdSection() local 291 gcd->SetString(kInfoIdKey, cloud.GetCloudId()); in CreateGcdSection() 292 SetStateProperties(cloud.GetConnectionState(), gcd.get()); in CreateGcdSection() 293 return gcd; in CreateGcdSection() 822 base::DictionaryValue* gcd = new base::DictionaryValue; in ReplyWithSetupStatus() local 823 output.Set(kGcdKey, gcd); in ReplyWithSetupStatus() 824 SetStateProperties(state, gcd); in ReplyWithSetupStatus() 826 gcd->SetString(kInfoIdKey, cloud_->GetCloudId()); in ReplyWithSetupStatus()
|
D | wifi_bootstrap_manager.cc | 42 CloudDelegate* gcd) in WifiBootstrapManager() argument 47 ssid_generator_{gcd, this} {
|
/external/clang/test/CXX/drs/ |
D | dr3xx.cpp | 1028 friend number gcd(number &x, number &y) {} 1033 a = gcd(a, b); 1034 b = gcd(3, 4); // expected-error {{undeclared}} 1042 friend number gcd(number x, number y) { return 0; } 1047 a = gcd(a, b); 1048 b = gcd(3, 4); // expected-error {{undeclared}}
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
D | MathUtils.java | 233 final long d = gcd(i, j); in binomialCoefficient() 243 final long d = gcd(i, j); in binomialCoefficient() 897 public static int gcd(final int p, final int q) { 986 public static long gcd(final long p, final long q) { 1165 int lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b)); 1200 long lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
|
/external/guava/guava-tests/benchmark/com/google/common/math/ |
D | ApacheBenchmark.java | 49 return IntMath.gcd(a, b); in gcdInt() 54 return LongMath.gcd(a, b); in gcdLong()
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ |
D | Primes.java | 182 BigInteger g = b.gcd(w); in enhancedMRProbablePrimeTest() 230 g = x.subtract(ONE).gcd(w); in enhancedMRProbablePrimeTest() 563 if (c.gcd(z.subtract(ONE)).equals(ONE) && z.modPow(c0, c).equals(ONE)) in implSTRandomPrime()
|