Searched refs:gcd (Results 1 - 7 of 7) sorted by relevance
/openjdk7/hotspot/src/share/vm/libadt/ |
H A D | port.cpp | 45 //------------------------------gcd-------------------------------------------- 47 uint32 gcd( register uint32 x, register uint32 y ) function
|
H A D | port.hpp | 200 uint32 gcd( uint32 x, uint32 y );
|
/openjdk7/jdk/src/share/classes/javax/swing/table/ |
H A D | DefaultTableModel.java | 392 private static int gcd(int i, int j) { method in class:DefaultTableModel 393 return (j == 0) ? i : gcd(j, i%j); 399 int g = gcd(size, r);
|
/openjdk7/jdk/src/share/classes/sun/security/rsa/ |
H A D | RSAKeyPairGenerator.java | 152 if (e.gcd(phi).equals(BigInteger.ONE) == false) {
|
/openjdk7/jdk/test/java/math/BigDecimal/ |
H A D | DivideTests.java | 63 * first compute to see if b_prime =(b/gcd(a,b)) is equal 73 BigInteger b_prime = divisorIntvalue.divide(dividendIntvalue.gcd(divisorIntvalue));
|
/openjdk7/jdk/src/share/native/sun/security/ec/impl/ |
H A D | mpi.c | 1880 ... by computing the product, and dividing out the gcd. 1885 mp_int gcd, prod; local 1891 if((res = mp_init(&gcd, FLAG(a))) != MP_OKAY) 1898 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY) 1901 res = mp_div(&prod, &gcd, c, NULL); 1906 mp_clear(&gcd);
|
/openjdk7/jdk/src/share/classes/java/math/ |
H A D | BigInteger.java | 1426 public BigInteger gcd(BigInteger val) { method in class:BigInteger
|
Completed in 40 milliseconds