public boolean isEmpty() { return absLowest() == null; }
final TreeMap.Entry absHigher(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getHigherEntry(key)); }
final TreeMap.Entry absCeiling(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getCeilingEntry(key)); }
public boolean isEmpty() { return absLowest() == null; }
final TreeMap.Entry absHigher(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getHigherEntry(key)); }
final TreeMap.Entry absCeiling(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getCeilingEntry(key)); }
public boolean isEmpty() { return absLowest() == null; }
final TreeMap.Entry absCeiling(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getCeilingEntry(key)); }
final TreeMap.Entry absHigher(Object key) { return absTooLow(key) ? absLowest() : checkHiRange(getHigherEntry(key)); }
private int recalculateSize() { TreeMap.Entry terminator = absHighest(); Object terminalKey = terminator != null ? terminator.key : null; int size = 0; for (TreeMap.Entry e = absLowest(); e != null; e = (e.key == terminalKey) ? null : successor(e)) { size++; } return size; }
private int recalculateSize() { TreeMap.Entry terminator = absHighest(); Object terminalKey = terminator != null ? terminator.key : null; int size = 0; for (TreeMap.Entry e = absLowest(); e != null; e = (e.key == terminalKey) ? null : successor(e)) { size++; } return size; }
private int recalculateSize() { TreeMap.Entry terminator = absHighest(); Object terminalKey = terminator != null ? terminator.key : null; int size = 0; for (TreeMap.Entry e = absLowest(); e != null; e = (e.key == terminalKey) ? null : successor(e)) { size++; } return size; }