HomeSort by relevance Sort by last modified time
    Searched defs:gcd (Results 1 - 25 of 66) sorted by null

1 2 3

  /external/tensorflow/tensorflow/python/ops/signal/
util_ops.py 30 def gcd(a, b, name=None): function
45 with ops.name_scope(name, 'gcd', [a, b]):
57 # TPU requires static shape inference. GCD is used for subframe size
62 return ops.convert_to_tensor(fractions.gcd(const_a, const_b))
  /external/epid-sdk/ext/ipp/sources/ippcp/
pcpbnu_arith_gcd.c 58 // Purpose: compute GCD value.
61 // GCD value
71 BNU_CHUNK_T gcd, t, r; local
74 gcd = a;
78 gcd = b;
82 r = gcd % t;
83 gcd = t;
86 return gcd;
pcpbnarithgcd.c 59 // Purpose: compute GCD value.
75 // pGCD GCD value
129 BNU_CHUNK_T gcd = cpGcd_BNU(BN_NUMBER(x)[0], BN_NUMBER(y)[0]); local
130 BN_NUMBER(g)[0] = gcd;
  /external/python/rsa/rsa/
prime.py 30 def gcd(p, q): function
33 >>> gcd(48, 180)
185 d = gcd(a, b)
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
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/webrtc/webrtc/common_audio/
blocker.cc 87 size_t gcd(size_t a, size_t b) { function in namespace:__anon49652
112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)),
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 59 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; local
111 gcd = p;
113 q = gcd;
118 gcd = pSub1.gcd(qSub1);
119 lcm = pSub1.divide(gcd).multiply(qSub1);
180 if (!e.gcd(p.subtract(ONE)).equals(ONE))
  /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 61 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; local
113 gcd = p;
115 q = gcd;
120 gcd = pSub1.gcd(qSub1);
121 lcm = pSub1.divide(gcd).multiply(qSub1);
182 if (!e.gcd(p.subtract(ONE)).equals(ONE))
  /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/
IntMath.java 243 public static int gcd(int a, int b) { method
246 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
253 // BigInteger.gcd is consistent with this decision.
259 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
267 // The key to the binary GCD algorithm is as follows:
268 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
269 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
LongMath.java 126 public static long gcd(long a, long b) { method in class:LongMath
129 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't
136 // BigInteger.gcd is consistent with this decision.
142 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
150 // The key to the binary GCD algorithm is as follows:
151 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
152 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
270 long commonDivisor = gcd(x, denominator)
    [all...]
  /external/guava/guava-gwt/test-super/com/google/common/math/super/com/google/common/math/
LongMathTest.java 114 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b)));
IntMathTest.java 196 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b)));
203 assertEquals(a, IntMath.gcd(a, 0));
204 assertEquals(a, IntMath.gcd(0, a));
206 assertEquals(0, IntMath.gcd(0, 0));
212 IntMath.gcd(a, 3);
216 IntMath.gcd(3, a);
225 IntMath.gcd(a, 0);
229 IntMath.gcd(0, a);
  /external/libavc/encoder/
ih264e_time_stamp.c 33 * - gcd()
98 * @brief Function to compute gcd of two numbers
101 * Function to compute gcd of two numbers
110 * GCD(value 1, value 2)
116 static WORD32 gcd(WORD32 i4_x, WORD32 i4_y) function
280 WORD32 i4_gcd = gcd(u4_src_frm_rate, u4_tgt_frm_rate);
  /external/llvm/lib/CodeGen/
TargetSchedule.cpp 38 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
48 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
TargetSchedule.cpp 48 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
59 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
  /external/tensorflow/tensorflow/core/lib/math/
math_util_test.cc 206 unsigned int gcd; member in struct:tensorflow::__anon45611::GCDTestCase
209 TEST(MathUtil, GCD) {
221 EXPECT_EQ(tc.gcd, MathUtil::GCD<uint32>(tc.x, tc.y));
222 EXPECT_EQ(tc.gcd, MathUtil::GCD<uint32>(tc.y, tc.x));
223 EXPECT_EQ(tc.gcd, MathUtil::GCD<uint64>(tc.x, tc.y));
224 EXPECT_EQ(tc.gcd, MathUtil::GCD<uint64>(tc.y, tc.x))
    [all...]
  /bionic/libc/upstream-freebsd/lib/libc/stdlib/
getopt_long.c 104 static int gcd(int, int);
135 gcd(int a, int b) function
166 ncycle = gcd(nnonopts, nopts);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
fractions.py 13 __all__ = ['Fraction', 'gcd']
18 def gcd(a, b): function
163 g = gcd(numerator, denominator)
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
test_binop.py 6 def gcd(a, b): function
44 g = gcd(den, num)
217 self.assertEqual(gcd(10, 12), 2)
218 self.assertEqual(gcd(10, 15), 5)
219 self.assertEqual(gcd(10, 11), 1)
220 self.assertEqual(gcd(100, 15), 5)
221 self.assertEqual(gcd(-10, 2), -2)
222 self.assertEqual(gcd(10, -2), 2)
223 self.assertEqual(gcd(-10, -2), -2)
226 self.assertTrue(gcd(i, j) > 0)
    [all...]
test_fractions.py 13 gcd = fractions.gcd variable
59 g = gcd(num, den)
94 self.assertEqual(0, gcd(0, 0))
95 self.assertEqual(1, gcd(1, 0))
96 self.assertEqual(-1, gcd(-1, 0))
97 self.assertEqual(1, gcd(0, 1))
98 self.assertEqual(-1, gcd(0, -1))
99 self.assertEqual(1, gcd(7, 1))
100 self.assertEqual(-1, gcd(7, -1))
    [all...]
  /external/boringssl/src/crypto/fipsmodule/bn/
gcd_extra.c 58 // This is a constant-time implementation of Stein's algorithm (binary GCD).
98 // If both are even, the final GCD gains a factor of two.
133 BIGNUM *gcd = BN_CTX_get(ctx); local
134 if (gcd == NULL ||
135 !bn_gcd_consttime(gcd, &shift, x, y, ctx)) {
139 // Check that 2^|shift| * |gcd| is one.
140 if (gcd->width == 0) {
143 BN_ULONG mask = shift | (gcd->d[0] ^ 1);
144 for (int i = 1; i < gcd->width; i++) {
145 mask |= gcd->d[i]
159 BIGNUM *gcd = BN_CTX_get(ctx); local
    [all...]
  /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.
LongMath.java 457 public static long gcd(long a, long b) { method
460 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't
467 // BigInteger.gcd is consistent with this decision.
473 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
481 // The key to the binary GCD algorithm is as follows:
482 // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
483 // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
715 long commonDivisor = gcd(x, denominator)
    [all...]
  /external/mesa3d/src/getopt/
getopt_long.c 81 static int gcd(int, int);
102 gcd(int a, int b) function
133 ncycle = gcd(nnonopts, nopts);
  /external/openssh/openbsd-compat/
getopt_long.c 98 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);

Completed in 2487 milliseconds

1 2 3