Lines Matching defs:bit
29 * A simple bit sieve used for finding prime number candidates. Allows setting
35 * represented in the sieve (each bit in the sieve represents an odd number).
36 * The relationship between the index of a bit and the number it represents is
39 * Where N is the integer represented by a bit in the sieve, offset is some
41 * index of a bit in the sieve array.
93 * Construct a bit sieve of searchLen bits used for finding prime number
100 * nonprimality is calculated, a bit is set in the sieve to eliminate
102 * are represented in the sieve (each bit in the sieve represents an
132 * Given a bit index return unit index containing it.
139 * Return a unit that masks the specified bit in its unit.
141 private static long bit(int bitIndex) {
146 * Get the value of the bit at the specified index.
150 return ((bits[unitIndex] & bit(bitIndex)) != 0);
154 * Set the bit at the specified index.
158 bits[unitIndex] |= bit(bitIndex);
162 * This method returns the index of the first clear bit in the search
164 * specified limit. It returns -1 if there is no such clear bit.