Lines Matching defs:bits
30 private long[] bits;
45 bits = new long[(enums.length + BIT_IN_LONG - 1) / BIT_IN_LONG];
52 * The bits yet to be returned for the long in bits[index]. As values from the current index
53 * are returned, their bits are zeroed out. When this reaches zero, the index must be
56 private long currentBits = bits[0];
59 * The index into HugeEnumSet.bits of the next value to return.
85 } else if (++index < bits.length) {
86 currentBits = bits[index];
131 long oldBits = bits[index];
134 bits[index] = newBits;
155 for (int i = 0; i < bits.length; i++) {
156 long oldBits = bits[i];
157 long newBits = oldBits | hugeSet.bits[i];
159 bits[i] = newBits;
176 Arrays.fill(bits, 0);
183 for (int i = 0, length = bits.length; i < length; i++) {
184 long b = ~bits[i];
186 // zero out unused bits on the last element
192 bits[i] = b;
206 return (bits[index] & (1L << inBits)) != 0;
212 set.bits = bits.clone();
224 for (int i = 0; i < bits.length; i++) {
225 long setBits = set.bits[i];
226 if ((bits[i] & setBits) != setBits) {
244 return Arrays.equals(bits, ((HugeEnumSet<?>) object).bits);
262 long oldBits = bits[index];
265 bits[index] = newBits;
286 for (int i = 0; i < bits.length; i++) {
287 long oldBits = bits[i];
288 long newBits = oldBits & ~hugeSet.bits[i];
290 bits[i] = newBits;
315 for (int i = 0; i < bits.length; i++) {
316 long oldBits = bits[i];
317 long newBits = oldBits & hugeSet.bits[i];
319 bits[i] = newBits;
341 size -= Long.bitCount(bits[startIndex]);
342 bits[startIndex] |= range;
343 size += Long.bitCount(bits[startIndex]);
347 size -= Long.bitCount(bits[startIndex]);
348 bits[startIndex] |= range;
349 size += Long.bitCount(bits[startIndex]);
354 size -= Long.bitCount(bits[endIndex]);
355 bits[endIndex] |= range;
356 size += Long.bitCount(bits[endIndex]);
358 size -= Long.bitCount(bits[i]);
359 bits[i] = -1L;
360 size += Long.bitCount(bits[i]);