| /external/guava/guava/src/com/google/common/math/ |
| IntMath.java | 364 public static int gcd(int a, int b) { method
367 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
374 // BigInteger.gcd is consistent with this decision.
380 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
388 // The key to the binary GCD algorithm is as follows:
389 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
390 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
|
| /libcore/luni/src/main/java/java/math/ |
| BigInt.java | 271 static BigInt gcd(BigInt a, BigInt b) { method in class:BigInt
|
| BigDecimal.java | 1197 BigInteger gcd; \/\/ greatest common divisor between 'p' and 'q' local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/cloog/ |
| int.h | 166 void cloog_seq_gcd(cloog_int_t *p, unsigned len, cloog_int_t *gcd);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/ |
| int.h | 166 void cloog_seq_gcd(cloog_int_t *p, unsigned len, cloog_int_t *gcd);
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerTest.java | 386 + mod, !one.equals(a.gcd(mod)));
407 + mod, !one.equals(a.gcd(mod)));
|
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| crypto.js | 1157 // (public) gcd(this,a) (HAC 14.54)
[all...] |
| earley-boyer.js | 410 var gcd = 0;
412 gcd = sc_euclid_gcd(gcd, arguments[i]);
413 return gcd;
[all...] |
| /external/v8/benchmarks/ |
| crypto.js | 1157 // (public) gcd(this,a) (HAC 14.54)
[all...] |
| earley-boyer.js | 410 var gcd = 0;
412 gcd = sc_euclid_gcd(gcd, arguments[i]);
413 return gcd;
[all...] |
| /packages/apps/ExactCalculator/src/com/android/calculator2/ |
| BoundedRational.java | 109 BigInteger divisor = mNum.gcd(mDen);
|
| /device/lge/hammerhead/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg.c | 109 /** GCD:
112 * @gcd: gcd of x and y
114 * Find the GCD of 2 numbers
116 #define GCD( x, y, gcd) ({ \
123 *gcd = *x; \
[all...] |
| /external/boringssl/ |
| sources.mk | 78 src/crypto/bn/gcd.c\
|
| /external/clang/test/SemaCXX/ |
| constant-expression-cxx11.cpp | 164 constexpr int gcd(int a, int b) { function in namespace:Recursion
168 static_assert(gcd(1749237, 5628959) == 7, "");
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/ |
| gmp.h | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/ |
| gmp.h | [all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/include/ |
| gmp.h | [all...] |
| /prebuilts/tools/common/m2/repository/commons-lang/commons-lang/2.4/ |
| commons-lang-2.4.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| commons-lang-2.6.jar | |
| /prebuilts/eclipse/maven/apache-maven-3.2.1/lib/ |
| commons-lang-2.6.jar | |
| /prebuilts/tools/common/m2/repository/commons-lang/commons-lang/2.6/ |
| commons-lang-2.6.jar | |
| /prebuilts/tools/common/m2/repository/org/apache/commons/commons-lang3/3.2.1/ |
| commons-lang3-3.2.1.jar | |
| /prebuilts/tools/common/m2/repository/org/apache/commons/commons-lang3/3.3/ |
| commons-lang3-3.3.jar | |
| /external/llvm/lib/Analysis/ |
| ScalarEvolution.cpp | [all...] |
| /prebuilts/devtools/tools/lib/ |
| bcprov-jdk15on-1.48.jar | |
