/** * A sensible definition of {@link #headMap(Object)} in terms of {@link #headMap(Object, * boolean)}. If you override {@code headMap(K, boolean)}, you may wish to override {@code * headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #headMap(Object)} in terms of {@link #headMap(Object, * boolean)}. If you override {@code headMap(K, boolean)}, you may wish to override {@code * headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #headMap(Object)} in terms of {@link #headMap(Object, * boolean)}. If you override {@code headMap(K, boolean)}, you may wish to override {@code * headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #headMap(Object)} in terms of * {@link #headMap(Object, boolean)}. If you override {@code headMap(K, boolean)}, you may wish * to override {@code headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #headMap(Object)} in terms of * {@link #headMap(Object, boolean)}. If you override {@code headMap(K, boolean)}, you may wish * to override {@code headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #headMap(Object)} in terms of {@link #headMap(Object, * boolean)}. If you override {@code headMap(K, boolean)}, you may wish to override {@code * headMap} to forward to this implementation. */ protected SortedMap<K, V> standardHeadMap(K toKey) { return headMap(toKey, false); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of * {@link #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override * {@code floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of * {@link #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override * {@code floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of * {@link #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override * {@code lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #lowerEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * lowerEntry} to forward to this implementation. */ protected Entry<K, V> standardLowerEntry(K key) { return headMap(key, false).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of {@link * #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override {@code * floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }
/** * A sensible definition of {@link #floorEntry} in terms of the {@code lastEntry()} of * {@link #headMap(Object, boolean)}. If you override {@code headMap}, you may wish to override * {@code floorEntry} to forward to this implementation. */ protected Entry<K, V> standardFloorEntry(K key) { return headMap(key, true).lastEntry(); }