while (iterator.hasNext()) { if (!predicateEvaluator.applySV(iterator.nextInt())) { iterator.remove();
@Override public void remove() { iterator.remove(); } @Override
@Override public void remove() { it.remove(); } }
@Override public void remove() { iterator.remove(); } @Override
@Override public void remove() { it.remove(); } }
public void remove() { iterator.remove(); } };
@Override public void remove() { if (lastOffset == -1) throw new IllegalStateException(); a[lastOffset].remove(); } @Override
/** * {@inheritDoc} * * <p> * This implementation iterates over the elements in the collection, looking for * the specified element and tries to remove it. */ @Override public boolean rem(final int k) { final IntIterator iterator = iterator(); while (iterator.hasNext()) if (k == iterator.nextInt()) { iterator.remove(); return true; } return false; } /**
/** * Remove from this collection all elements which satisfy the given predicate. * * @param filter * a predicate which returns {@code true} for elements to be removed. * @see Collection#removeIf(java.util.function.Predicate) * @return {@code true} if any elements were removed. */ @SuppressWarnings("overloads") default boolean removeIf(final java.util.function.IntPredicate filter) { java.util.Objects.requireNonNull(filter); boolean removed = false; final IntIterator each = iterator(); while (each.hasNext()) { if (filter.test(each.nextInt())) { each.remove(); removed = true; } } return removed; } /**
@Override public boolean retainAll(final IntCollection c) { boolean retVal = false; for (final IntIterator i = iterator(); i.hasNext();) if (!c.contains(i.nextInt())) { i.remove(); retVal = true; } return retVal; } @Override
private void clearImpl(IntSet objects) { for (IntIterator iterator = objects.iterator(); iterator.hasNext(); ) { int childId = iterator.nextInt(); removeImpl(childId); iterator.remove(); } }