public void remove(int x) { int index = indices.getIndex(x); if (index == -1) { return; } else { System.arraycopy(data, index + 1, data, index, size() - index - 1); indices.remove(x); } } }
public void remove(int x) { int index = indices.getIndex(x); if (index == -1) { return; } else { System.arraycopy(data, index + 1, data, index, size() - index - 1); indices.remove(x); } } }
public void remove(int x) { int index = indices.getIndex(x); if (index == -1) { return; } else { System.arraycopy(data, index + 1, data, index, size() - index - 1); indices.remove(x); } } }
/** * TODO optimize * * @throws IllegalArgumentException * if set is null */ public void removeAll(MutableSparseIntSet set) { if (set == null) { throw new IllegalArgumentException("set is null"); } for (IntIterator it = set.intIterator(); it.hasNext();) { remove(it.next()); } }
/** * TODO optimize * * @throws IllegalArgumentException * if set is null */ public void removeAll(MutableSparseIntSet set) { if (set == null) { throw new IllegalArgumentException("set is null"); } for (IntIterator it = set.intIterator(); it.hasNext();) { remove(it.next()); } }
/** * TODO optimize * * @throws IllegalArgumentException * if set is null */ public void removeAll(MutableSparseIntSet set) { if (set == null) { throw new IllegalArgumentException("set is null"); } for (IntIterator it = set.intIterator(); it.hasNext();) { remove(it.next()); } }
@Override public boolean remove(int i) { if (privatePart != null) { if (privatePart.contains(i)) { privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } return true; } } if (sharedPart != null) { if (sharedPart.contains(i)) { privatePart = makeSparseCopy(); privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } sharedPart = null; checkOverflow(); return true; } } return false; }
@Override public boolean remove(int i) { if (privatePart != null) { if (privatePart.contains(i)) { privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } return true; } } if (sharedPart != null) { if (sharedPart.contains(i)) { privatePart = makeSparseCopy(); privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } sharedPart = null; checkOverflow(); return true; } } return false; }
@Override public boolean remove(int i) { if (privatePart != null) { if (privatePart.contains(i)) { privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } return true; } } if (sharedPart != null) { if (sharedPart.contains(i)) { privatePart = makeSparseCopy(); privatePart.remove(i); if (privatePart.size() == 0) { privatePart = null; } sharedPart = null; checkOverflow(); return true; } } return false; }
/** * Remove an integer from this set. * * @param i integer to remove * @return true iff the value of this changes. */ @Override public boolean remove(int i) { if (densePart != null && densePart.get(i)) { densePart.clear(i); if (densePart.nextSetBit(0) == -1) { densePart = null; } return true; } else if (sparsePart.contains(i)) { sparsePart.remove(i); return true; } else { return false; } }
/** * Remove an integer from this set. * * @param i integer to remove * @return true iff the value of this changes. */ @Override public boolean remove(int i) { if (densePart != null && densePart.get(i)) { densePart.clear(i); if (densePart.nextSetBit(0) == -1) { densePart = null; } return true; } else if (sparsePart.contains(i)) { sparsePart.remove(i); return true; } else { return false; } }
/** * Remove an integer from this set. * * @param i integer to remove * @return true iff the value of this changes. */ @Override public boolean remove(int i) { if (densePart != null && densePart.get(i)) { densePart.clear(i); if (densePart.nextSetBit(0) == -1) { densePart = null; } return true; } else if (sparsePart.contains(i)) { sparsePart.remove(i); return true; } else { return false; } }
@Override public IntIterator intIterator() { MutableSparseIntSet bits = MutableSparseIntSet.makeEmpty(); for (IntIterator pi = primaryImpl.intIterator(); pi.hasNext();) { int x = pi.next(); assert !bits.contains(x); bits.add(x); } for (IntIterator si = secondaryImpl.intIterator(); si.hasNext();) { int x = si.next(); assert bits.contains(x); bits.remove(x); } assert bits.isEmpty(); return primaryImpl.intIterator(); }
@Override public IntIterator intIterator() { MutableSparseIntSet bits = MutableSparseIntSet.makeEmpty(); for (IntIterator pi = primaryImpl.intIterator(); pi.hasNext();) { int x = pi.next(); assert !bits.contains(x); bits.add(x); } for (IntIterator si = secondaryImpl.intIterator(); si.hasNext();) { int x = si.next(); assert bits.contains(x); bits.remove(x); } assert bits.isEmpty(); return primaryImpl.intIterator(); }
@Override public IntIterator intIterator() { MutableSparseIntSet bits = MutableSparseIntSet.makeEmpty(); for (IntIterator pi = primaryImpl.intIterator(); pi.hasNext();) { int x = pi.next(); assert !bits.contains(x); bits.add(x); } for (IntIterator si = secondaryImpl.intIterator(); si.hasNext();) { int x = si.next(); assert bits.contains(x); bits.remove(x); } assert bits.isEmpty(); return primaryImpl.intIterator(); }