Lines Matching refs:bits
30 * and clearing of bits in a storage array. The size of the sieve is assumed to
31 * be constant to reduce overhead. All the bits of a new bitSieve are zero, and
32 * bits are removed from it by setting them.
49 * Stores the bits in this bitSieve.
51 private long bits[];
54 * Length is how many bits this sieve holds.
77 bits = new long[(unitIndex(length - 1) + 1)];
93 * Construct a bit sieve of searchLen bits used for finding prime number
99 * Candidates are indicated by clear bits in the sieve. As a candidates
105 bits = new long[(unitIndex(searchLen-1) + 1)];
150 return ((bits[unitIndex] & bit(bitIndex)) != 0);
158 bits[unitIndex] |= bit(bitIndex);
197 for (int i=0; i<bits.length; i++) {
198 long nextLong = ~bits[i];