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

1 2 3 4 5 6 7 8

  /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));
  /hardware/qcom/display/msm8998/sdm/libs/utils/
utils.cpp 41 float gcd(float a, float b) { function in namespace:sdm
56 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:__anon36986
112 initial_delay_(block_size_ - gcd(chunk_size, shift_amount)),
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 60 BigInteger p, q, n, d, e, pSub1, qSub1, gcd, lcm; local
112 gcd = p;
114 q = gcd;
119 gcd = pSub1.gcd(qSub1);
120 lcm = pSub1.divide(gcd).multiply(qSub1);
181 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);
  /packages/apps/Camera2/src/com/android/camera/util/
AspectRatio.java 49 int gcd = BigInteger.valueOf(width).gcd(BigInteger.valueOf(height)).intValue(); local
50 int simplifiedWidth = width / gcd;
51 int simplifiedHeight = height / gcd;
  /platform_testing/libraries/aupt-lib/src/android/support/test/aupt/
DataCollector.java 76 mSleepInterval = gcd(generatorsWithIntervals.values());
146 private long gcd(Collection<Long> values) { method in class:DataCollector
154 gcdSoFar = gcd(gcdSoFar, value);
160 private long gcd(long a, long b) { method in class:DataCollector
166 return gcd(b, a % b);
168 return gcd(a, b % a);
  /system/core/logcat/
getopt_long.cpp 75 static int gcd(int a, int b) { function
92 int ncycle = gcd(nnonopts, nopts);
  /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/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);
  /external/tcpdump/missing/
getopt_long.c 89 static int gcd(int, int);
119 gcd(int a, int b) function
150 ncycle = gcd(nnonopts, nopts);
  /external/zlib/src/examples/
gzappend.c 102 local unsigned gcd(unsigned a, unsigned b) function
154 cycles = gcd(len, rot); /* number of cycles */
  /frameworks/base/core/java/android/util/
Rational.java 122 int gcd = gcd(numerator, denominator); local
124 mNumerator = numerator / gcd;
125 mDenominator = denominator / gcd;
303 * @return An int value representing the gcd. Always positive.
306 public static int gcd(int numerator, int denominator) { method in class:Rational
310 * gcd(a, 0) := a
311 * gcd(a, b) := gcd(b, a mod b)
537 if (gcd(mNumerator, mDenominator) > 1)
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/
fractions.py 13 __all__ = ['Fraction', 'gcd']
18 def gcd(a, b): function
163 g = gcd(numerator, denominator)

Completed in 970 milliseconds

1 2 3 4 5 6 7 8