private TreeMap.Entry getMatchingSubEntry(Object o) { if (!(o instanceof Map.Entry)) return null; Map.Entry e = (Map.Entry)o; Object key = e.getKey(); if (!inRange(key)) return null; TreeMap.Entry found = getEntry(key); return (found != null && eq(found.getValue(), e.getValue())) ? found : null; }
private TreeMap.Entry getMatchingSubEntry(Object o) { if (!(o instanceof Map.Entry)) return null; Map.Entry e = (Map.Entry)o; Object key = e.getKey(); if (!inRange(key)) return null; TreeMap.Entry found = getEntry(key); return (found != null && eq(found.getValue(), e.getValue())) ? found : null; }
private TreeMap.Entry getMatchingSubEntry(Object o) { if (!(o instanceof Map.Entry)) return null; Map.Entry e = (Map.Entry)o; Object key = e.getKey(); if (!inRange(key)) return null; TreeMap.Entry found = getEntry(key); return (found != null && eq(found.getValue(), e.getValue())) ? found : null; }
public boolean containsKey(Object key) { return (inRange(key) && TreeMap.this.containsKey(key)); }
final boolean inRange(Object key, boolean inclusive) { return inclusive ? inRange(key) : inRangeExclusive(key); }
final boolean inRange(Object key, boolean inclusive) { return inclusive ? inRange(key) : inRangeExclusive(key); }
final boolean inRange(Object key, boolean inclusive) { return inclusive ? inRange(key) : inRangeExclusive(key); }
public boolean containsKey(Object key) { return (inRange(key) && TreeMap.this.containsKey(key)); }
public Object remove(Object key) { if (!inRange(key)) return null; return TreeMap.this.remove(key); }
public Object remove(Object key) { if (!inRange(key)) return null; return TreeMap.this.remove(key); }
public Object get(Object key) { if (!inRange(key)) return null; else return TreeMap.this.get(key); }
public Object get(Object key) { if (!inRange(key)) return null; else return TreeMap.this.get(key); }
public Object get(Object key) { if (!inRange(key)) return null; else return TreeMap.this.get(key); }
public Object remove(Object key) { if (!inRange(key)) return null; return TreeMap.this.remove(key); }
public Object put(Object key, Object value) { if (!inRange(key)) throw new IllegalArgumentException("Key out of range"); return TreeMap.this.put(key, value); }
public boolean remove(Object o) { if (!inRange(o)) return false; TreeMap.Entry found = getEntry(o); if (found == null) return false; delete(found); return true; } public SortedSet subSet(Object fromElement, Object toElement) {
public boolean remove(Object o) { if (!inRange(o)) return false; TreeMap.Entry found = getEntry(o); if (found == null) return false; delete(found); return true; } public SortedSet subSet(Object fromElement, Object toElement) {
public boolean remove(Object o) { if (!inRange(o)) return false; TreeMap.Entry found = getEntry(o); if (found == null) return false; delete(found); return true; } public SortedSet subSet(Object fromElement, Object toElement) {
public Object put(Object key, Object value) { if (!inRange(key)) throw new IllegalArgumentException("Key out of range"); return TreeMap.this.put(key, value); }
public Object put(Object key, Object value) { if (!inRange(key)) throw new IllegalArgumentException("Key out of range"); return TreeMap.this.put(key, value); }