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

1 2 3 4

  /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/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/
Movie.java 79 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale);
84 public static long gcd(long a, long b) {
88 return gcd(b, a % b);
  /libcore/benchmarks/src/benchmarks/regression/
BigIntegerBenchmark.java 39 x.gcd(y);
  /external/guava/guava-tests/test/com/google/common/math/
IntMathTest.java 339 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(IntMath.gcd(a, b)));
346 assertEquals(a, IntMath.gcd(a, 0));
347 assertEquals(a, IntMath.gcd(0, a));
349 assertEquals(0, IntMath.gcd(0, 0));
355 IntMath.gcd(a, 3);
359 IntMath.gcd(3, a);
368 IntMath.gcd(a, 0);
372 IntMath.gcd(0, a);
LongMathTest.java 380 assertEquals(valueOf(a).gcd(valueOf(b)), valueOf(LongMath.gcd(a, b)));
387 assertEquals(a, LongMath.gcd(a, 0));
388 assertEquals(a, LongMath.gcd(0, a));
390 assertEquals(0, LongMath.gcd(0, 0));
396 LongMath.gcd(a, 3);
400 LongMath.gcd(3, a);
409 LongMath.gcd(a, 0);
413 LongMath.gcd(0, a);
  /external/apache-harmony/math/src/test/java/org/apache/harmony/tests/java/math/
BigIntegerModPowTest.java 28 * Methods: modPow, modInverse, and gcd
240 * gcd: the second number is zero
250 BigInteger result = aNumber.gcd(bNumber);
260 * gcd: the first number is zero
270 BigInteger result = aNumber.gcd(bNumber);
280 * gcd: the first number is ZERO
288 BigInteger result = aNumber.gcd(bNumber);
298 * gcd: both numbers are zeros
304 BigInteger result = aNumber.gcd(bNumber);
313 * gcd: the first number is longe
    [all...]
BigIntegerHashCodeTest.java 45 aNumber1.gcd(aNumber2).pow(7);
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/generators/
RSAKeyPairGenerator.java 62 if (e.gcd(p.subtract(ONE)).equals(ONE))
95 if (e.gcd(q.subtract(ONE)).equals(ONE))
  /external/harfbuzz/src/
harfbuzz-gdef.c 797 HB_ClassDefinition* gcd; local
805 gcd = &gdef->GlyphClassDef;
809 gcd->ClassFormat = 2;
811 gcd->cd.cd2.ClassRangeCount = 0;
812 gcd->cd.cd2.ClassRangeRecord = NULL;
832 if ( ( error = Make_ClassRange( gcd, start,
850 if ( ( error = Make_ClassRange( gcd, start,
873 if ( ( error = Make_ClassRange( gcd, start,
895 gcd->cd.cd2.ClassRangeCount + 1, HB_UShort* ) )
898 count = gcd->cd.cd2.ClassRangeCount
    [all...]
  /external/harfbuzz_ng/src/hb-old/
harfbuzz-gdef.c 797 HB_ClassDefinition* gcd; local
805 gcd = &gdef->GlyphClassDef;
809 gcd->ClassFormat = 2;
811 gcd->cd.cd2.ClassRangeCount = 0;
812 gcd->cd.cd2.ClassRangeRecord = NULL;
832 if ( ( error = Make_ClassRange( gcd, start,
850 if ( ( error = Make_ClassRange( gcd, start,
873 if ( ( error = Make_ClassRange( gcd, start,
895 gcd->cd.cd2.ClassRangeCount + 1, HB_UShort* ) )
898 count = gcd->cd.cd2.ClassRangeCount
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
hwint.h 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
hwint.h 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
hwint.h 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
hwint.h 235 gcd (int a, int b) function
257 return (abs (a) * abs (b) / gcd (a, b));
  /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/
IntMath.java 109 public static int gcd(int a, int b) { method in class:IntMath
112 * gcd(0, Integer.MIN_VALUE)? BigInteger.gcd would return positive 2^31, but positive 2^31
  /bionic/libc/unistd/
getopt_long.c 93 static int gcd(int, int);
114 gcd(int a, int b) function
145 ncycle = gcd(nnonopts, nopts);
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/
MultiplyTimeScaleTrack.java 29 import static com.googlecode.mp4parser.util.Math.gcd;
  /external/llvm/lib/CodeGen/
TargetSchedule.cpp 39 static unsigned gcd(unsigned Dividend, unsigned Divisor) { function
49 unsigned LCM = (uint64_t(A) * B) / gcd(A, B);
  /external/libvpx/libvpx/vpx_scale/generic/
bicubic_scaler.c 229 int gcd(int a, int b) { function
310 // reduce in/out width and height ratios using the gcd
311 gcd_w = gcd(out_width, in_width);
312 gcd_h = gcd(out_height, in_height);
313 gcd_h_uv = gcd(out_height, in_height / 2);
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt_math.h 248 /** gcd
254 int (*gcd)(void *a, void *b, void *c); member in struct:__anon7178
481 #define mp_gcd(a, b, c) ltc_mp.gcd(a, b, c)
  /external/dropbear/libtomcrypt/src/math/
gmp_desc.c 288 /* gcd */
289 static int gcd(void *a, void *b, void *c) function
427 &gcd,
ltm_desc.c 293 /* gcd */
294 static int gcd(void *a, void *b, void *c) function
433 &gcd,
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/
DefaultMp4Builder.java 543 timescale = gcd(track.getTrackMetaData().getTimescale(), timescale);
548 public static long gcd(long a, long b) { method
552 return gcd(b, a % b);
  /external/guava/guava/src/com/google/common/math/
LongMath.java 400 public static long gcd(long a, long b) { method
403 * gcd(0, Long.MIN_VALUE)? BigInteger.gcd would return positive 2^63, but positive 2^63 isn't
412 * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm.
589 // Dividing by the GCD suffices to avoid overflow in all the remaining cases.
591 int d = IntMath.gcd(n, i);
609 * binomial(BIGGEST_SIMPLE_BINOMIALS[k], k) doesn't need to use the slower GCD-based impl,
  /external/zlib/src/examples/
gzappend.c 100 local unsigned gcd(unsigned a, unsigned b) function
152 cycles = gcd(len, rot); /* number of cycles */

Completed in 1483 milliseconds

1 2 3 4