@Override public int remove(final int k) { modified = false; if (!in(k)) return this.defRetValue; final int oldValue = Int2IntRBTreeMap.this.remove(k); return modified ? oldValue : this.defRetValue; } @Override
@Override public boolean remove(final Object o) { if (!(o instanceof Map.Entry)) return false; final Map.Entry<?, ?> e = (Map.Entry<?, ?>) o; if (e.getKey() == null || !(e.getKey() instanceof Integer)) return false; if (e.getValue() == null || !(e.getValue() instanceof Integer)) return false; final Entry f = findKey(((Integer) (e.getKey())).intValue()); if (f == null || !((f.getIntValue()) == (((Integer) (e.getValue())).intValue()))) return false; Int2IntRBTreeMap.this.remove(f.key); return true; } @Override
public void remove() { if (curr == null) throw new IllegalStateException(); /* * If the last operation was a next(), we are removing an entry that preceeds * the current index, and thus we must decrement it. */ if (curr == prev) index--; next = prev = curr; updatePrevious(); updateNext(); Int2IntRBTreeMap.this.remove(curr.key); curr = null; } public int skip(final int n) {