Searched refs:gcd (Results 1 - 4 of 4) sorted by relevance

/frameworks/base/core/java/android/util/
H A DRational.java122 int gcd = gcd(numerator, denominator);
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(mNumerato
[all...]
/frameworks/base/media/java/android/media/
H A DUtils.java111 static int gcd(int a, int b) { method in class:Utils
152 int common = gcd(num, den);
190 return (long)a * b / gcd(a, b);
/frameworks/base/media/tests/MediaFrameworkTest/src/com/android/mediaframeworktest/unit/
H A DRationalTest.java50 assertEquals(1, Rational.gcd(1, 2));
51 assertEquals(1, Rational.gcd(2, 3));
52 assertEquals(78, Rational.gcd(5*78, 7*78));
53 assertEquals(1, Rational.gcd(-1, 2));
54 assertEquals(1, Rational.gcd(-2, 3));
/frameworks/av/services/audioflinger/
H A DAudioResamplerDyn.cpp250 // recursive gcd. Using objdump, it appears the tail recursion is converted to a while loop.
251 static int gcd(int n, int m) function in namespace:android
256 return gcd(m, n % m);
362 int phases = mSampleRate / gcd(mSampleRate, inSampleRate);

Completed in 97 milliseconds