Searched defs:lcm (Results 1 - 6 of 6) sorted by relevance

/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/util/
H A DMath.java22 public static long lcm(long a, long b) { method in class:Math
26 public static int lcm(int a, int b) { method in class:Math
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DNFRuleSet.java581 leastCommonMultiple = lcm(leastCommonMultiple, rules[i].getBaseValue());
639 private static long lcm(long x, long y) { method in class:NFRuleSet
672 // x * y == gcd(x, y) * lcm(x, y)
/external/llvm/lib/CodeGen/
H A DTargetSchedule.cpp47 static unsigned lcm(unsigned A, unsigned B) { function
67 ResourceLCM = lcm(ResourceLCM, NumUnits);
/external/apache-commons-math/src/main/java/org/apache/commons/math/util/
H A DMathUtils.java1141 * using the formula <code>lcm(a,b) = (a / gcd(a,b)) * b</code>.
1145 * <li>The invocations <code>lcm(Integer.MIN_VALUE, n)</code> and
1146 * <code>lcm(n, Integer.MIN_VALUE)</code>, where <code>abs(n)</code> is a
1149 * <li>The result of <code>lcm(0, x)</code> and <code>lcm(x, 0)</code> is
1161 public static int lcm(int a, int b) { method in class:MathUtils
1165 int lcm = FastMath.abs(mulAndCheck(a / gcd(a, b), b));
1166 if (lcm == Integer.MIN_VALUE) {
1171 return lcm;
1177 * using the formula <code>lcm(
1196 public static long lcm(long a, long b) { method in class:MathUtils
[all...]
/external/boringssl/src/crypto/rsa/
H A Drsa.c502 BIGNUM n, pm1, qm1, lcm, gcd, de, dmp1, dmq1, iqmp; local
536 BN_init(&lcm);
545 /* lcm = lcm(p-1, q-1) */
548 !BN_mul(&lcm, &pm1, &qm1, ctx) ||
550 !BN_div(&lcm, NULL, &lcm, &gcd, ctx) ||
551 /* de = d*e mod lcm(p-1, q-1) */
552 !BN_mod_mul(&de, key->d, key->e, &lcm, ctx)) {
599 BN_free(&lcm);
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 492 milliseconds