private void checkKeyBounds(Object key) throws IllegalArgumentException { if (key == null) throw new NullPointerException(); if (!inBounds(key)) throw new IllegalArgumentException("key out of range"); }
private void checkKeyBounds(Object key) throws IllegalArgumentException { if (key == null) throw new NullPointerException(); if (!inBounds(key)) throw new IllegalArgumentException("key out of range"); }
private void checkKeyBounds(Object key) throws IllegalArgumentException { if (key == null) throw new NullPointerException(); if (!inBounds(key)) throw new IllegalArgumentException("key out of range"); }
private Map.Entry removeLowest() { for (;;) { Node n = loNode(); if (n == null) return null; Object k = n.key; if (!inBounds(k)) return null; Object v = m.doRemove(k, null); if (v != null) return new AbstractMap.SimpleImmutableEntry(k, v); } }
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 containsKey(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return inBounds(k) && m.containsKey(k); }
private Map.Entry removeHighest() { for (;;) { Node n = hiNode(); if (n == null) return null; Object k = n.key; if (!inBounds(k)) return null; Object v = m.doRemove(k, null); if (v != null) return new AbstractMap.SimpleImmutableEntry(k, v); } }
private Map.Entry removeLowest() { for (;;) { Node n = loNode(); if (n == null) return null; Object k = n.key; if (!inBounds(k)) return null; Object v = m.doRemove(k, null); if (v != null) return new AbstractMap.SimpleImmutableEntry(k, v); } }
public boolean containsKey(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return inBounds(k) && m.containsKey(k); }
/** * Returns highest absolute key (ignoring directonality) */ private Object highestKey() { ConcurrentSkipListMap.Node n = hiNode(); if (n != null) { Object last = n.key; if (inBounds(last)) return last; } throw new NoSuchElementException(); }
public Object get(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return ((!inBounds(k)) ? null : m.get(k)); }
/** * Returns highest absolute key (ignoring directonality) */ private Object highestKey() { ConcurrentSkipListMap.Node n = hiNode(); if (n != null) { Object last = n.key; if (inBounds(last)) return last; } throw new NoSuchElementException(); }
public boolean containsKey(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return inBounds(k) && m.containsKey(k); }
public Object get(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return ((!inBounds(k)) ? null : m.get(k)); }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
public Object get(Object key) { if (key == null) throw new NullPointerException(); Object k = key; return ((!inBounds(k)) ? null : m.get(k)); }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry highestEntry() { for (;;) { ConcurrentSkipListMap.Node n = hiNode(); if (n == null || !inBounds(n.key)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns highest absolute key (ignoring directonality) */ private Object highestKey() { ConcurrentSkipListMap.Node n = hiNode(); if (n != null) { Object last = n.key; if (inBounds(last)) return last; } throw new NoSuchElementException(); }