Lines Matching refs:length
56 private int length;
68 * constructor, BitSieve(BigInteger base, int searchLen). The length
72 * for primality. The length was chosen experimentally to yield good
76 length = 150 * 64;
77 bits = new long[(unitIndex(length - 1) + 1)];
86 sieveSingle(length, nextIndex + nextPrime, nextPrime);
87 nextIndex = sieveSearch(length, nextIndex + 1);
89 } while((nextIndex > 0) && (nextPrime < length));
106 length = searchLen;
109 int step = smallSieve.sieveSearch(smallSieve.length, start);
126 step = smallSieve.sieveSearch(smallSieve.length, step+1);
197 for (int i=0; i<bits.length; i++) {