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

/openjdk7/jdk/src/share/classes/java/math/
H A DBitSieve.java68 * constructor, BitSieve(BigInteger base, int searchLen). The length
93 * Construct a bit sieve of searchLen bits used for finding prime number
97 BitSieve(BigInteger base, int searchLen) { argument
105 bits = new long[(unitIndex(searchLen-1) + 1)];
106 length = searchLen;
123 sieveSingle(searchLen, (start-1)/2, convertedStep);
H A DBigInteger.java629 int searchLen = (bitLength / 20) * 64;
630 BitSieve searchSieve = new BitSieve(p, searchLen);
634 p = p.add(BigInteger.valueOf(2*searchLen));
638 searchSieve = new BitSieve(p, searchLen);
702 int searchLen = (result.bitLength() / 20) * 64;
705 BitSieve searchSieve = new BitSieve(result, searchLen);
710 result = result.add(BigInteger.valueOf(2 * searchLen));

Completed in 37 milliseconds