public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); m.remove(l.key); lastReturned = null; }
public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); // It would not be worth all of the overhead to directly // unlink from here. Using remove is fast enough. ConcurrentSkipListMap.this.remove(l.key); lastReturned = null; }
public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); m.remove(l.key); lastReturned = null; }
public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); // It would not be worth all of the overhead to directly // unlink from here. Using remove is fast enough. ConcurrentSkipListMap.this.remove(l.key); lastReturned = null; }
public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); // It would not be worth all of the overhead to directly // unlink from here. Using remove is fast enough. ConcurrentSkipListMap.this.remove(l.key); lastReturned = null; }
public void remove() { Node l = lastReturned; if (l == null) throw new IllegalStateException(); m.remove(l.key); lastReturned = null; }
public Object remove(Object key) { Object k = key; return (!inBounds(k))? null : m.remove(k); }
public boolean remove(Object key, Object value) { Object k = key; return inBounds(k) && m.remove(k, value); }
public Object remove(Object key) { Object k = key; return (!inBounds(k))? null : m.remove(k); }
public boolean remove(Object key, Object value) { Object k = key; return inBounds(k) && m.remove(k, value); }
public Object remove(Object key) { Object k = key; return (!inBounds(k))? null : m.remove(k); }
public boolean remove(Object key, Object value) { Object k = key; return inBounds(k) && m.remove(k, value); }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }