/** * @return min j >= n s.t get(j) */ public int nextSetBit(int n) { return bitVector.nextSetBit(n); }
/** * @return min j >= n s.t get(j) */ public int nextSetBit(int n) { return bitVector.nextSetBit(n); }
/** * @return min j >= n s.t get(j) */ public int nextSetBit(int n) { return bitVector.nextSetBit(n); }
@Override public void foreach(IntSetAction action) { if (action == null) { throw new IllegalArgumentException("null action"); } int nextBit = bitVector.nextSetBit(0); populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0; i < populationCount; i++) { action.act(nextBit); nextBit = bitVector.nextSetBit(nextBit + 1); } }
@Override public void foreach(IntSetAction action) { if (action == null) { throw new IllegalArgumentException("null action"); } int nextBit = bitVector.nextSetBit(0); populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0; i < populationCount; i++) { action.act(nextBit); nextBit = bitVector.nextSetBit(nextBit + 1); } }
@Override public void foreach(IntSetAction action) { if (action == null) { throw new IllegalArgumentException("null action"); } int nextBit = bitVector.nextSetBit(0); populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0; i < populationCount; i++) { action.act(nextBit); nextBit = bitVector.nextSetBit(nextBit + 1); } }
public SparseIntSet makeSparseCopy() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; int[] elements = new int[populationCount]; int i = 0; int nextBit = -1; while (i < populationCount) elements[i++] = nextBit = bitVector.nextSetBit(nextBit + 1); return new SparseIntSet(elements); }
public SparseIntSet makeSparseCopy() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; int[] elements = new int[populationCount]; int i = 0; int nextBit = -1; while (i < populationCount) elements[i++] = nextBit = bitVector.nextSetBit(nextBit + 1); return new SparseIntSet(elements); }
public SparseIntSet makeSparseCopy() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; int[] elements = new int[populationCount]; int i = 0; int nextBit = -1; while (i < populationCount) elements[i++] = nextBit = bitVector.nextSetBit(nextBit + 1); return new SparseIntSet(elements); }
@Override public BitVector getCatchBlocks() { BitVector result = new BitVector(); BitVector blocks = cfg.getCatchBlocks(); int i = 0; while ((i = blocks.nextSetBit(i)) != -1) { if (nodes.containsNode(getNode(i))) { result.set(i); } } return result; }
@Override public BitVector getCatchBlocks() { BitVector result = new BitVector(); BitVector blocks = cfg.getCatchBlocks(); int i = 0; while ((i = blocks.nextSetBit(i)) != -1) { if (nodes.containsNode(getNode(i))) { result.set(i); } } return result; }