Home
last modified time | relevance | path

Searched refs:searchLen (Results 1 – 2 of 2) sorted by relevance

/libcore/ojluni/src/main/java/java/math/
DBitSieve.java97 BitSieve(BigInteger base, int searchLen) { in BitSieve() argument
105 bits = new long[(unitIndex(searchLen-1) + 1)]; in BitSieve()
106 length = searchLen; in BitSieve()
123 sieveSingle(searchLen, (start-1)/2, convertedStep); in BitSieve()
DBigInteger.java763 int searchLen = getPrimeSearchLen(bitLength); in largePrime() local
764 BitSieve searchSieve = new BitSieve(p, searchLen); in largePrime()
768 p = p.add(BigInteger.valueOf(2*searchLen)); in largePrime()
772 searchSieve = new BitSieve(p, searchLen); in largePrime()
836 int searchLen = getPrimeSearchLen(result.bitLength()); in nextProbablePrime() local
839 BitSieve searchSieve = new BitSieve(result, searchLen); in nextProbablePrime()
844 result = result.add(BigInteger.valueOf(2 * searchLen)); in nextProbablePrime()