Searched refs:primes (Results 1 - 3 of 3) sorted by relevance
/openjdk9/jdk/test/java/math/BigInteger/ |
H A D | PrimeTest.java | 70 // Get primes through specified bound (inclusive) and Integer.MAX_VALUE 71 NavigableSet<BigInteger> primes = getPrimes(upperBound); 73 // Check whether known primes are identified as such 74 boolean primeTest = checkPrime(primes, certainty, parallel); 80 // Check whether known non-primes are not identified as primes 81 boolean nonPrimeTest = checkNonPrime(primes, certainty); 103 * @return bits indicating which indexes represent primes 121 * Load the primes up to the specified bound (inclusive) into a 125 * @return a set of primes 143 checkPrime(Set<BigInteger> primes, int certainty, boolean parallel) argument 175 checkNonPrime(NavigableSet<BigInteger> primes, int certainty) argument [all...] |
/openjdk9/jdk/src/jdk.crypto.ec/share/native/libsunec/impl/ |
H A D | mpprime.h | 44 extern const int prime_tab_size; /* number of primes available */ 59 mp_err mpp_fermat_list(mp_int *a, const mp_digit *primes, mp_size nPrimes); 61 mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes,
|
/openjdk9/jdk/test/java/math/BigDecimal/ |
H A D | DivideTests.java | 182 int[] primes = {1, 3, 7, 13, 17}; 187 for(int i = 0; i < primes.length; i++) { 188 for(int j = i+1; j < primes.length; j++) { 190 for(int m = 0; m < primes.length; m++) { 191 for(int n = m+1; n < primes.length; n++) { 192 int dividend = primes[i] * primes[j]; 193 int divisor = primes[m] * primes[n];
|
Completed in 107 milliseconds