@Override public boolean hasNext() { assert populationCount == bitVector.populationCount(); return count < populationCount; }
@Override public int size() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; return populationCount; }
@Override public boolean hasNext() { assert populationCount == bitVector.populationCount(); return count < populationCount; }
@Override public int size() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; return populationCount; }
@Override public int size() { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; return populationCount; }
@Override public boolean hasNext() { assert populationCount == bitVector.populationCount(); return count < populationCount; }
public int size() { return vector.populationCount(); }
public int size() { return vector.populationCount(); }
public int size() { return vector.populationCount(); }
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 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); } }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
private void slowForeachExcluding(IntSet X, IntSetAction action) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; for (int i = 0, count = 0; count < populationCount; i++) { if (contains(i)) { if (!X.contains(i)) { action.act(i); } count++; } } }
/** */ private boolean sameValueInternal(SparseIntSet that) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; if (populationCount != that.size()) { return false; } for (int i = 0; i < that.size(); i++) { int val = that.elementAt(i); if (!bitVector.contains(val)) { return false; } } return true; }
/** */ private boolean sameValueInternal(SparseIntSet that) { populationCount = (populationCount == UNDEFINED) ? bitVector.populationCount() : populationCount; if (populationCount != that.size()) { return false; } for (int i = 0; i < that.size(); i++) { int val = that.elementAt(i); if (!bitVector.contains(val)) { return false; } } return true; }