final TreeMap.Entry absLower(Object key) { return absTooHigh(key) ? absHighest() : checkLoRange(getLowerEntry(key)); }
public boolean isEmpty() { return absLowest() == null; }
final boolean inRange(Object key) { return !absTooLow(key) && !absTooHigh(key); }
public void clear() { NavigableSubMap.this.clear(); }
public Comparator comparator() { return NavigableSubMap.this.comparator(); }
public Comparator comparator() { return NavigableSubMap.this.comparator(); }
public Object ceiling(Object e) { return NavigableSubMap.this.ceilingKey(e); } public Object higher(Object e) { return NavigableSubMap.this.higherKey(e); }
public void clear() { NavigableSubMap.this.clear(); }
public Object ceiling(Object e) { return NavigableSubMap.this.ceilingKey(e); } public Object higher(Object e) { return NavigableSubMap.this.higherKey(e); }
public Comparator comparator() { return NavigableSubMap.this.comparator(); }
public Object ceiling(Object e) { return NavigableSubMap.this.ceilingKey(e); } public Object higher(Object e) { return NavigableSubMap.this.higherKey(e); }
public void clear() { NavigableSubMap.this.clear(); }
final TreeMap.Entry checkHiRange(TreeMap.Entry e) { return (e == null || absTooHigh(e.key)) ? null : e; }
final TreeMap.Entry checkHiRange(TreeMap.Entry e) { return (e == null || absTooHigh(e.key)) ? null : e; }
final boolean inRange(Object key) { return !absTooLow(key) && !absTooHigh(key); }
final TreeMap.Entry checkLoRange(TreeMap.Entry e) { return (e == null || absTooLow(e.key)) ? null : e; }
final TreeMap.Entry checkHiRange(TreeMap.Entry e) { return (e == null || absTooHigh(e.key)) ? null : e; }
final TreeMap.Entry checkLoRange(TreeMap.Entry e) { return (e == null || absTooLow(e.key)) ? null : e; }
public Object ceilingKey(Object key) { TreeMap.Entry e = ceiling(key); return (e == null) ? null : e.key; }
public Map.Entry ceilingEntry(Object key) { TreeMap.Entry e = ceiling(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }