Lines Matching refs:bits
42 private int[] bits;
52 public Bits(int[] bits) {
53 this.bits = bits;
64 if (bits.length < len) {
66 System.arraycopy(bits, 0, newbits, 0, bits.length);
67 bits = newbits;
74 for (int i = 0; i < bits.length; i++) bits[i] = 0;
80 int[] newbits = new int[bits.length];
81 System.arraycopy(bits, 0, newbits, 0, bits.length);
90 bits[x >>> wordshift] = bits[x >>> wordshift] |
100 bits[x >>> wordshift] = bits[x >>> wordshift] |
108 temp.sizeTo(bits.length);
118 bits[x >>> wordshift] = bits[x >>> wordshift] &
126 0 <= x && x < (bits.length << wordshift) &&
127 (bits[x >>> wordshift] & (1 << (x & wordmask))) != 0;
133 sizeTo(xs.bits.length);
134 for (int i = 0; i < xs.bits.length; i++)
135 bits[i] = bits[i] & xs.bits[i];
142 sizeTo(xs.bits.length);
143 for (int i = 0; i < xs.bits.length; i++)
144 bits[i] = bits[i] | xs.bits[i];
151 for (int i = 0; i < bits.length; i++) {
152 if (i < xs.bits.length) {
153 bits[i] = bits[i] & ~xs.bits[i];
162 sizeTo(xs.bits.length);
163 for (int i = 0; i < xs.bits.length; i++)
164 bits[i] = bits[i] ^ xs.bits[i];
168 /** Count trailing zero bits in an int. Algorithm from "Hacker's
186 * for (int i = bits.nextBit(0); i>=0; i = bits.nextBit(i+1)) ...
191 if (windex >= bits.length) return -1;
192 int word = bits[windex] & ~((1 << (x & wordmask))-1);
197 if (windex >= bits.length) return -1;
198 word = bits[windex];
205 char[] digits = new char[bits.length * wordlen];
206 for (int i = 0; i < bits.length * wordlen; i++)
214 Bits bits = new Bits();
220 } while (bits.isMember(k));
222 bits.incl(k);
225 for (int i = bits.nextBit(0); i >= 0; i = bits.nextBit(i+1)) {