public boolean containsValue(Object value) { if (value == null) throw new NullPointerException(); for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { Object v = n.getValidValue(); if (v != null && value.equals(v)) return true; } return false; }
public boolean containsValue(Object value) { if (value == null) throw new NullPointerException(); for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { Object v = n.getValidValue(); if (v != null && value.equals(v)) return true; } return false; }
public boolean containsValue(Object value) { if (value == null) throw new NullPointerException(); for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { Object v = n.getValidValue(); if (v != null && value.equals(v)) return true; } return false; }
public boolean isEmpty() { return !isBeforeEnd(loNode()); }
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); } }
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); } }
/** * Returns lowest absolute key (ignoring directonality) */ private Object lowestKey() { ConcurrentSkipListMap.Node n = loNode(); if (isBeforeEnd(n)) return n.key; else throw new NoSuchElementException(); }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
public boolean isEmpty() { return !isBeforeEnd(loNode()); }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }
/** * Returns lowest absolute key (ignoring directonality) */ private Object lowestKey() { ConcurrentSkipListMap.Node n = loNode(); if (isBeforeEnd(n)) return n.key; else throw new NoSuchElementException(); }
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 int size() { long count = 0; for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) ++count; } return count >= Integer.MAX_VALUE? Integer.MAX_VALUE : (int)count; }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }
public int size() { long count = 0; for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) ++count; } return count >= Integer.MAX_VALUE? Integer.MAX_VALUE : (int)count; }
public int size() { long count = 0; for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) ++count; } return count >= Integer.MAX_VALUE? Integer.MAX_VALUE : (int)count; }
public void clear() { for (ConcurrentSkipListMap.Node n = loNode(); isBeforeEnd(n); n = n.next) { if (n.getValidValue() != null) m.remove(n.key); } }
private Map.Entry lowestEntry() { for (;;) { ConcurrentSkipListMap.Node n = loNode(); if (!isBeforeEnd(n)) return null; Map.Entry e = n.createSnapshot(); if (e != null) return e; } }
/** * Returns lowest absolute key (ignoring directonality) */ private Object lowestKey() { ConcurrentSkipListMap.Node n = loNode(); if (isBeforeEnd(n)) return n.key; else throw new NoSuchElementException(); }