public void invert(int pos) { bits[pos >>> ROOM_SHIFT] ^= bit(pos); }
public void clear() { bs.clear(); flags = 0; mbuf = null; }
int numOn() { int num = 0; for (int i=0; i<SINGLE_BYTE_SIZE; i++) { if (at(i)) num++; } return num; }
bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; sb.append(":" + n); bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; sb.append(":" + n); bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; len = code[bp];
public boolean isEmpty() { return mbuf == null && bs.isEmpty(); }
public void clearNotFlag(ScanEnvironment env) { if (isNot()) { bs.invert(); if (!env.enc.isSingleByte()) { mbuf = CodeRangeBuffer.notCodeRangeBuff(env, mbuf); } clearNot(); } }
int numOn() { int num = 0; for (int i=0; i<SINGLE_BYTE_SIZE; i++) { if (at(i)) num++; } return num; }
bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; sb.append(":" + n); bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; sb.append(":" + n); bs = new BitSet(); System.arraycopy(code, bp, bs.bits, 0, BitSet.BITSET_SIZE); n = bs.numOn(); bp += BitSet.BITSET_SIZE; len = code[bp];
public boolean isEmpty() { return mbuf == null && bs.isEmpty(); }
public void clearNotFlag(ScanEnvironment env) { if (isNot()) { bs.invert(); if (!env.enc.isSingleByte()) { mbuf = CodeRangeBuffer.notCodeRangeBuff(env, mbuf); } clearNot(); } }
public String toString() { StringBuilder buffer = new StringBuilder(); buffer.append("BitSet"); for (int i=0; i<SINGLE_BYTE_SIZE; i++) { if ((i % (SINGLE_BYTE_SIZE / BITS_TO_STRING_WRAP)) == 0) buffer.append("\n "); buffer.append(at(i) ? "1" : "0"); } return buffer.toString(); } }
public void clear(int pos) { bits[pos >>> ROOM_SHIFT] &= ~bit(pos); }
private int compileLengthCClassNode(CClassNode cc) { int len; if (cc.mbuf == null) { len = OPSize.OPCODE + BitSet.BITSET_SIZE; } else { if (enc.minLength() > 1 || cc.bs.isEmpty()) { len = OPSize.OPCODE; } else { len = OPSize.OPCODE + BitSet.BITSET_SIZE; } len += OPSize.LENGTH + cc.mbuf.getUsed(); } return len; }
public void clear() { bs.clear(); flags = 0; mbuf = null; }