/** * A sensible definition of {@link #tailMap(Object)} in terms of {@link #tailMap(Object, * boolean)}. If you override {@code tailMap(K, boolean)}, you may wish to override {@code * tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of {@link #tailMap(Object, * boolean)}. If you override {@code tailMap(K, boolean)}, you may wish to override {@code * tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of {@link #tailMap(Object, * boolean)}. If you override {@code tailMap(K, boolean)}, you may wish to override {@code * tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }
/** * A sensible definition of {@link #tailMap(Object)} in terms of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap(K, boolean)}, you may wish * to override {@code tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap(K, boolean)}, you may wish * to override {@code tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap(K, boolean)}, you may wish * to override {@code tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap(K, boolean)}, you may wish * to override {@code tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #tailMap(Object)} in terms of {@link #tailMap(Object, * boolean)}. If you override {@code tailMap(K, boolean)}, you may wish to override {@code * tailMap} to forward to this implementation. */ protected SortedMap<K, V> standardTailMap(K fromKey) { return tailMap(fromKey, true); } }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override * {@code higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override * {@code higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override * {@code ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override * {@code ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }
/** * A sensible definition of {@link #higherEntry} in terms of the {@code firstEntry()} of {@link * #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override {@code * higherEntry} to forward to this implementation. */ protected Entry<K, V> standardHigherEntry(K key) { return tailMap(key, false).firstEntry(); }
/** * A sensible definition of {@link #ceilingEntry} in terms of the {@code firstEntry()} of * {@link #tailMap(Object, boolean)}. If you override {@code tailMap}, you may wish to override * {@code ceilingEntry} to forward to this implementation. */ protected Entry<K, V> standardCeilingEntry(K key) { return tailMap(key, true).firstEntry(); }