public Object firstKey() { TreeMap.Entry e = first(); if (e == null) throw new NoSuchElementException(); return e.key; }
public Object firstKey() { TreeMap.Entry e = first(); if (e == null) throw new NoSuchElementException(); return e.key; }
public Object firstKey() { TreeMap.Entry e = first(); if (e == null) throw new NoSuchElementException(); return e.key; }
public Map.Entry firstEntry() { TreeMap.Entry e = first(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
public Map.Entry firstEntry() { TreeMap.Entry e = first(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Map.Entry firstEntry() { TreeMap.Entry e = first(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
SubEntryIterator() { super(first()); TreeMap.Entry terminator = last(); this.terminalKey = terminator == null ? null : terminator.key; } public boolean hasNext() {
SubEntryIterator() { super(first()); TreeMap.Entry terminator = last(); this.terminalKey = terminator == null ? null : terminator.key; } public boolean hasNext() {
SubEntryIterator() { super(first()); TreeMap.Entry terminator = last(); this.terminalKey = terminator == null ? null : terminator.key; } public boolean hasNext() {
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }