HomeSort by relevance Sort by last modified time
    Searched full:euclid (Results 1 - 25 of 59) sorted by null

1 2 3

  /frameworks/base/libs/common_time/
LinearTransform.h 56 // Helpers which will reduce the fraction N/D using Euclid's method.
LinearTransform.cpp 242 // This implements Euclid's method to find GCD.
  /external/llvm/test/CodeGen/Generic/
2003-07-06-BadIntCmp.ll 12 ;; is wrong because the value being compared (int euclid = x*x + y*y)
  /external/swiftshader/third_party/LLVM/test/CodeGen/Generic/
2003-07-06-BadIntCmp.ll 12 ;; is wrong because the value being compared (int euclid = x*x + y*y)
  /external/tensorflow/tensorflow/contrib/signal/python/ops/
util_ops.py 31 """Returns the greatest common divisor via Euclid's algorithm.
  /external/boringssl/src/crypto/fipsmodule/bn/
gcd.c 117 static BIGNUM *euclid(BIGNUM *a, BIGNUM *b) { function
212 t = euclid(a, b);
368 // The while loop (Euclid's algorithm) ends when
574 // The while loop (Euclid's algorithm) ends when
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /external/python/cpython2/Lib/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /prebuilts/gdb/darwin-x86/lib/python2.7/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /prebuilts/gdb/linux-x86/lib/python2.7/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /prebuilts/go/darwin-x86/src/crypto/dsa/
dsa.go 177 // This has better constant-time properties than Euclid's method (implemented
  /prebuilts/go/darwin-x86/src/crypto/ecdsa/
ecdsa.go 138 // This has better constant-time properties than Euclid's method (implemented
  /prebuilts/go/linux-x86/src/crypto/dsa/
dsa.go 177 // This has better constant-time properties than Euclid's method (implemented
  /prebuilts/go/linux-x86/src/crypto/ecdsa/
ecdsa.go 138 // This has better constant-time properties than Euclid's method (implemented
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_binop.py 7 """Greatest common divisor using Euclid's algorithm."""
  /frameworks/base/core/java/android/util/
Rational.java 296 * Calculates the greatest common divisor using Euclid's algorithm.
308 * Non-recursive implementation of Euclid's algorithm:
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.56/
bcprov-jdk15on-1.56-sources.jar 
  /external/capstone/
MathExtras.h 299 /// values using Euclid's algorithm.
  /external/libconstrainedcrypto/
p256.c 290 // b = 1/a mod MOD, binary euclid.
  /external/python/cpython3/Lib/test/
test_binop.py 9 """Greatest common divisor using Euclid's algorithm."""
  /external/swiftshader/third_party/LLVM/include/llvm/Support/
MathExtras.h 335 /// values using Euclid's algorithm.
  /prebuilts/tools/common/m2/repository/org/bouncycastle/bcprov-jdk15on/1.48/
bcprov-jdk15on-1.48-sources.jar 
  /external/webrtc/webrtc/common_audio/resampler/
resampler.cc 142 // Start with a math exercise, Euclid's algorithm to find the gcd:
  /external/zlib/src/examples/
gzappend.c 99 /* return the greatest common divisor of a and b using Euclid's algorithm,

Completed in 1288 milliseconds

1 2 3