private void ensureCapacity(int newOffset, int newCapacity) { if (newOffset < offset || newCapacity > (bits.length << LOG_BITS_PER_UNIT)) { expand(newOffset, newCapacity); } }
private void ensureCapacity(int newOffset, int newCapacity) { if (newOffset < offset || newCapacity > (bits.length << LOG_BITS_PER_UNIT)) { expand(newOffset, newCapacity); } }
private void ensureCapacity(int newOffset, int newCapacity) { if (newOffset < offset || newCapacity > (bits.length << LOG_BITS_PER_UNIT)) { expand(newOffset, newCapacity); } }
void growCapacity(float fraction) { expand(offset, (int) (fraction * (bits.length << LOG_BITS_PER_UNIT))); }
void growCapacity(float fraction) { expand(offset, (int) (fraction * (bits.length << LOG_BITS_PER_UNIT))); }
void growCapacity(float fraction) { expand(offset, (int) (fraction * (bits.length << LOG_BITS_PER_UNIT))); }
/** * Logically NOT this bit string */ public final void not() { if (offset != 0) { expand(0, offset + length() - 1); } for (int i = 0; i < bits.length; i++) { bits[i] ^= MASK; } }
/** * Sets all bits. */ public final void setAll() { expand(0, length() - 1); for (int i = 0; i < bits.length; i++) { bits[i] = MASK; } }
/** * Logically NOT this bit string */ public final void not() { if (offset != 0) { expand(0, offset + length() - 1); } for (int i = 0; i < bits.length; i++) { bits[i] ^= MASK; } }
/** * Logically NOT this bit string */ public final void not() { if (offset != 0) { expand(0, offset + length() - 1); } for (int i = 0; i < bits.length; i++) { bits[i] ^= MASK; } }
/** * Sets all bits. */ public final void setAll() { expand(0, length() - 1); for (int i = 0; i < bits.length; i++) { bits[i] = MASK; } }
/** * Sets all bits. */ public final void setAll() { expand(0, length() - 1); for (int i = 0; i < bits.length; i++) { bits[i] = MASK; } }