HomeSort by relevance Sort by last modified time
    Searched defs:newBits (Results 1 - 5 of 5) sorted by null

  /dalvik/dexgen/src/com/android/dexgen/util/
BitIntSet.java 51 int[] newBits = Bits.makeBitSet(
53 System.arraycopy(bits, 0, newBits, 0, bits.length);
54 bits = newBits;
  /dalvik/dx/src/com/android/dx/util/
BitIntSet.java 51 int[] newBits = Bits.makeBitSet(
53 System.arraycopy(bits, 0, newBits, 0, bits.length);
54 bits = newBits;
  /libcore/luni/src/main/java/java/util/
MiniEnumSet.java 111 long newBits = oldBits | (1L << element.ordinal());
112 if (oldBits != newBits) {
113 bits = newBits;
131 long newBits = oldBits | miniSet.bits;
132 bits = newBits;
133 size = Long.bitCount(newBits);
134 return (oldBits != newBits);
177 long newBits = oldBits & ~miniSet.bits;
178 if (oldBits != newBits) {
179 bits = newBits;
    [all...]
HugeEnumSet.java 127 long newBits = oldBits | (1L << inBits);
128 if (oldBits != newBits) {
129 bits[index] = newBits;
150 long newBits = oldBits | hugeSet.bits[i];
151 if (oldBits != newBits) {
152 bits[i] = newBits;
153 size += Long.bitCount(newBits) - Long.bitCount(oldBits);
256 long newBits = oldBits & ~(1L << inBits);
257 if (oldBits != newBits) {
258 bits[index] = newBits;
    [all...]
BitSet.java 142 long[] newBits = new long[newLength];
143 System.arraycopy(bits, 0, newBits, 0, longCount);
144 this.bits = newBits;
271 long[] newBits = new long[lastArrayIndex - firstArrayIndex + 1];
274 newBits[0] = bits[firstArrayIndex] & lowMask;
275 newBits[newBits.length - 1] = bits[lastArrayIndex] & highMask;
279 newBits[i] = bits[firstArrayIndex + i];
284 int actualLen = newBits.length;
286 for (int i = 0; i < newBits.length; i++)
    [all...]

Completed in 1952 milliseconds