Module java.base
Package java.util

Class TreeMap.AscendingSubMap<K,V>

java.lang.Object
java.util.AbstractMap<K,V>
java.util.TreeMapAbstractMap<K,V>
java.util.TreeMap.AscendingSubMap<K,V>
All Implemented Interfaces:
Serializable, Map<K,V>, NavigableMap<K,V>, SortedMap<K,V>
Enclosing class:
TreeMap<K,V>
public static class TreeMap.AscendingSubMap<K,V> extends TreeMapAbstractMap<K,V> implements Serializable
See Also:

  • Nested Class Summary

    Nested classes/interfaces declared in class java.util.AbstractMap

    AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>

    Nested classes/interfaces declared in interface java.util.Map

    Map.Entry<K,V>

  • Field Summary

    Fields declared in class java.util.TreeMapAbstractMap

    keySet, values

  • Method Summary

    Modifier and Type
    Method
    Description
    final Map.Entry<K,V>
    ceilingEntry(K key)
    Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such key.
    K
    ceilingKey(K key)
    Returns the least key greater than or equal to the given key, or null if there is no such key.
    Comparator<? super K>
    comparator()
    Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.
    V
    compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
    Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).
    V
    computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)
    If the specified key is not already associated with a value (or is mapped to null), attempts to compute its value using the given mapping function and enters it into this map unless null.
    V
    computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
    If the value for the specified key is present and non-null, attempts to compute a new mapping given the key and its current mapped value.
    final boolean
    containsKey(Object key)
    Returns true if this map contains a mapping for the specified key.
    NavigableSet<K>
    descendingKeySet()
    Returns a reverse order NavigableSet view of the keys contained in this map.
    NavigableMap<K,V>
    descendingMap()
    Returns a reverse order view of the mappings contained in this map.
    Set<Map.Entry<K,V>>
    entrySet()
    Returns a Set view of the mappings contained in this map.
    java.util.TreeMap.Entry_I<K,V>
    findEndNode()
     
    final Map.Entry<K,V>
    firstEntry()
    Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
    final K
    firstKey()
    Returns the first (lowest) key currently in this map.
    final Map.Entry<K,V>
    floorEntry(K key)
    Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such key.
    K
    floorKey(K key)
    Returns the greatest key less than or equal to the given key, or null if there is no such key.
    final V
    get(Object key)
    Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
    java.util.TreeMap.Entry_I<K,V>
    getCeilingEntry(K key)
     
    java.util.TreeMap.Entry_I<K,V>
    getFloorEntry(K key)
     
    java.util.TreeMap.Entry_I<K,V>
    getLowerEntry(K key)
     
    final SortedMap<K,V>
    headMap(K toKey)
    Returns a view of the portion of this map whose keys are strictly less than toKey.
    NavigableMap<K,V>
    headMap(K toKey, boolean inclusive)
    Returns a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey.
    final Map.Entry<K,V>
    higherEntry(K key)
    Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.
    final K
    higherKey(K key)
    Returns the least key strictly greater than the given key, or null if there is no such key.
    boolean
    isEmpty()
    Returns true if this map contains no key-value mappings.
    Set<K>
    keySet()
    Returns a Set view of the keys contained in this map.
    final Map.Entry<K,V>
    lastEntry()
    Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
    final K
    lastKey()
    Returns the last (highest) key currently in this map.
    final Map.Entry<K,V>
    lowerEntry(K key)
    Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such key.
    K
    lowerKey(K key)
    Returns the greatest key strictly less than the given key, or null if there is no such key.
    V
    merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
    If the specified key is not already associated with a value or is associated with null, associates it with the given non-null value.
    final NavigableSet<K>
    navigableKeySet()
    Returns a NavigableSet view of the keys contained in this map.
    final Map.Entry<K,V>
    pollFirstEntry()
    Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
    final Map.Entry<K,V>
    pollLastEntry()
    Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
    final V
    put(K key, V value)
    Associates the specified value with the specified key in this map (optional operation).
    V
    putIfAbsent(K key, V value)
    If the specified key is not already associated with a value (or is mapped to null) associates it with the given value and returns null, else returns the current value.
    final V
    remove(Object key)
    Removes the mapping for a key from this map if it is present (optional operation).
    int
    size()
    Returns the number of key-value mappings in this map.
    NavigableMap<K,V>
    subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
    Returns a view of the portion of this map whose keys range from fromKey to toKey.
    SortedMap<K,V>
    subMap(K fromKey, K toKey)
    Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
    final SortedMap<K,V>
    tailMap(K fromKey)
    Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
    NavigableMap<K,V>
    tailMap(K fromKey, boolean inclusive)
    Returns a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey.

    Methods declared in class java.util.AbstractMap

    clear, clone, containsValue, equals, hashCode, putAll, toString, values

    Methods declared in class java.lang.Object

    finalize, getClass, notify, notifyAll, wait, wait, wait

    Methods declared in interface java.util.Map

    clear, containsValue, equals, forEach, getOrDefault, hashCode, putAll, remove, replace, replace, replaceAll

    Methods declared in interface java.util.SortedMap

    values

  • Method Details

    • subMap

      public NavigableMap<K,V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys range from fromKey to toKey. If fromKey and toKey are equal, the returned map is empty unless fromInclusive and toInclusive are both true. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside of its range, or to construct a submap either of whose endpoints lie outside its range.

      Specified by:
      subMap in interface NavigableMap<K,V>
      Parameters:
      fromKey - low endpoint of the keys in the returned map
      fromInclusive - true if the low endpoint is to be included in the returned view
      toKey - high endpoint of the keys in the returned map
      toInclusive - true if the high endpoint is to be included in the returned view
      Returns:
      a view of the portion of this map whose keys range from fromKey to toKey

    • headMap

      public NavigableMap<K,V> headMap(K toKey, boolean inclusive)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

      Specified by:
      headMap in interface NavigableMap<K,V>
      Parameters:
      toKey - high endpoint of the keys in the returned map
      inclusive - true if the high endpoint is to be included in the returned view
      Returns:
      a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey

    • tailMap

      public NavigableMap<K,V> tailMap(K fromKey, boolean inclusive)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

      Specified by:
      tailMap in interface NavigableMap<K,V>
      Parameters:
      fromKey - low endpoint of the keys in the returned map
      inclusive - true if the low endpoint is to be included in the returned view
      Returns:
      a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey

    • descendingMap

      public NavigableMap<K,V> descendingMap()
      Description copied from interface: NavigableMap
      Returns a reverse order view of the mappings contained in this map. The descending map is backed by this map, so changes to the map are reflected in the descending map, and vice-versa. If either map is modified while an iteration over a collection view of either map is in progress (except through the iterator's own remove operation), the results of the iteration are undefined.

      The returned map has an ordering equivalent to Collections.reverseOrder(comparator()). The expression m.descendingMap().descendingMap() returns a view of m essentially equivalent to m.

      Specified by:
      descendingMap in interface NavigableMap<K,V>
      Returns:
      a reverse order view of this map

    • comparator

      public Comparator<? super K> comparator()
      Description copied from interface: SortedMap
      Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.
      Specified by:
      comparator in interface SortedMap<K,V>
      Returns:
      the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys

    • entrySet

      public Set<Map.Entry<K,V>> entrySet()
      Description copied from interface: SortedMap
      Returns a Set view of the mappings contained in this map. The set's iterator returns the entries in ascending key order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation, or through the setValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
      Specified by:
      entrySet in interface Map<K,V>
      Specified by:
      entrySet in interface SortedMap<K,V>
      Returns:
      a set view of the mappings contained in this map, sorted in ascending key order

    • containsKey

      public final boolean containsKey(Object key)
      Description copied from class: AbstractMap
      Returns true if this map contains a mapping for the specified key. More formally, returns true if and only if this map contains a mapping for a key k such that Objects.equals(key, k). (There can be at most one such mapping.)
      Specified by:
      containsKey in interface Map<K,V>
      Overrides:
      containsKey in class AbstractMap<K,V>
      Parameters:
      key - key whose presence in this map is to be tested
      Returns:
      true if this map contains a mapping for the specified key

    • isEmpty

      public boolean isEmpty()
      Description copied from class: AbstractMap
      Returns true if this map contains no key-value mappings.
      Specified by:
      isEmpty in interface Map<K,V>
      Overrides:
      isEmpty in class AbstractMap<K,V>
      Returns:
      true if this map contains no key-value mappings

    • size

      public int size()
      Description copied from class: AbstractMap
      Returns the number of key-value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.
      Specified by:
      size in interface Map<K,V>
      Overrides:
      size in class AbstractMap<K,V>
      Returns:
      the number of key-value mappings in this map

    • put

      public final V put(K key, V value)
      Description copied from class: AbstractMap
      Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A map m is said to contain a mapping for a key k if and only if m.containsKey(k) would return true.)
      Specified by:
      put in interface Map<K,V>
      Overrides:
      put in class AbstractMap<K,V>
      Parameters:
      key - key with which the specified value is to be associated
      value - value to be associated with the specified key
      Returns:
      the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key, if the implementation supports null values.)

    • putIfAbsent

      public V putIfAbsent(K key, V value)
      Description copied from interface: Map
      If the specified key is not already associated with a value (or is mapped to null) associates it with the given value and returns null, else returns the current value.
      Specified by:
      putIfAbsent in interface Map<K,V>
      Parameters:
      key - key with which the specified value is to be associated
      value - value to be associated with the specified key
      Returns:
      the previous value associated with the specified key, or null if there was no mapping for the key. (A null return can also indicate that the map previously associated null with the key, if the implementation supports null values.)

    • merge

      public V merge(K key, V value, BiFunction<? super V,? super V,? extends V> remappingFunction)
      Description copied from interface: Map
      If the specified key is not already associated with a value or is associated with null, associates it with the given non-null value. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result is null. This method may be of use when combining multiple mapped values for a key. For example, to either create or append a String msg to a value mapping: 
       
 map.merge(key, msg, String::concat)

      If the remapping function returns null, the mapping is removed. If the remapping function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.

      The remapping function should not modify this map during computation.

      Specified by:
      merge in interface Map<K,V>
      Parameters:
      key - key with which the resulting value is to be associated
      value - the non-null value to be merged with the existing value associated with the key or, if no existing value or a null value is associated with the key, to be associated with the key
      remappingFunction - the remapping function to recompute a value if present
      Returns:
      the new value associated with the specified key, or null if no value is associated with the key

    • computeIfAbsent

      public V computeIfAbsent(K key, Function<? super K,? extends V> mappingFunction)
      Description copied from interface: Map
      If the specified key is not already associated with a value (or is mapped to null), attempts to compute its value using the given mapping function and enters it into this map unless null.

      If the mapping function returns null, no mapping is recorded. If the mapping function itself throws an (unchecked) exception, the exception is rethrown, and no mapping is recorded. The most common usage is to construct a new object serving as an initial mapped value or memoized result, as in: 

       
 map.computeIfAbsent(key, k -> new Value(f(k)));

      Or to implement a multi-value map, Map<K,Collection<V>>, supporting multiple values per key: 

       
 map.computeIfAbsent(key, k -> new HashSet<V>()).add(v);

      The mapping function should not modify this map during computation.

      Specified by:
      computeIfAbsent in interface Map<K,V>
      Parameters:
      key - key with which the specified value is to be associated
      mappingFunction - the mapping function to compute a value
      Returns:
      the current (existing or computed) value associated with the specified key, or null if the computed value is null

    • compute

      public V compute(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
      Description copied from interface: Map
      Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping). For example, to either create or append a String msg to a value mapping: 
       
 map.compute(key, (k, v) -> (v == null) ? msg : v.concat(msg))
      (Method merge() is often simpler to use for such purposes.)

      If the remapping function returns null, the mapping is removed (or remains absent if initially absent). If the remapping function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.

      The remapping function should not modify this map during computation.

      Specified by:
      compute in interface Map<K,V>
      Parameters:
      key - key with which the specified value is to be associated
      remappingFunction - the remapping function to compute a value
      Returns:
      the new value associated with the specified key, or null if none

    • computeIfPresent

      public V computeIfPresent(K key, BiFunction<? super K,? super V,? extends V> remappingFunction)
      Description copied from interface: Map
      If the value for the specified key is present and non-null, attempts to compute a new mapping given the key and its current mapped value.

      If the remapping function returns null, the mapping is removed. If the remapping function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.

      The remapping function should not modify this map during computation.

      Specified by:
      computeIfPresent in interface Map<K,V>
      Parameters:
      key - key with which the specified value is to be associated
      remappingFunction - the remapping function to compute a value
      Returns:
      the new value associated with the specified key, or null if none

    • get

      public final V get(Object key)
      Description copied from class: AbstractMap
      Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

      More formally, if this map contains a mapping from a key k to a value v such that Objects.equals(key, k), then this method returns v; otherwise it returns null. (There can be at most one such mapping.)

      If this map permits null values, then a return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.

      Specified by:
      get in interface Map<K,V>
      Overrides:
      get in class AbstractMap<K,V>
      Parameters:
      key - the key whose associated value is to be returned
      Returns:
      the value to which the specified key is mapped, or null if this map contains no mapping for the key

    • remove

      public final V remove(Object key)
      Description copied from class: AbstractMap
      Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from key k to value v such that Objects.equals(key, k), that mapping is removed. (The map can contain at most one such mapping.)

      Returns the value to which this map previously associated the key, or null if the map contained no mapping for the key.

      If this map permits null values, then a return value of null does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key to null.

      The map will not contain a mapping for the specified key once the call returns.

      Specified by:
      remove in interface Map<K,V>
      Overrides:
      remove in class AbstractMap<K,V>
      Parameters:
      key - key whose mapping is to be removed from the map
      Returns:
      the previous value associated with key, or null if there was no mapping for key.

    • firstEntry

      public final Map.Entry<K,V> firstEntry()
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
      Specified by:
      firstEntry in interface NavigableMap<K,V>
      Returns:
      an entry with the least key, or null if this map is empty

    • lastEntry

      public final Map.Entry<K,V> lastEntry()
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
      Specified by:
      lastEntry in interface NavigableMap<K,V>
      Returns:
      an entry with the greatest key, or null if this map is empty

    • pollFirstEntry

      public final Map.Entry<K,V> pollFirstEntry()
      Description copied from interface: NavigableMap
      Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
      Specified by:
      pollFirstEntry in interface NavigableMap<K,V>
      Returns:
      the removed first entry of this map, or null if this map is empty

    • pollLastEntry

      public final Map.Entry<K,V> pollLastEntry()
      Description copied from interface: NavigableMap
      Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
      Specified by:
      pollLastEntry in interface NavigableMap<K,V>
      Returns:
      the removed last entry of this map, or null if this map is empty

    • higherEntry

      public final Map.Entry<K,V> higherEntry(K key)
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the least key strictly greater than the given key, or null if there is no such key.
      Specified by:
      higherEntry in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      an entry with the least key greater than key, or null if there is no such key

    • lowerEntry

      public final Map.Entry<K,V> lowerEntry(K key)
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the greatest key strictly less than the given key, or null if there is no such key.
      Specified by:
      lowerEntry in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      an entry with the greatest key less than key, or null if there is no such key

    • ceilingEntry

      public final Map.Entry<K,V> ceilingEntry(K key)
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the least key greater than or equal to the given key, or null if there is no such key.
      Specified by:
      ceilingEntry in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      an entry with the least key greater than or equal to key, or null if there is no such key

    • floorEntry

      public final Map.Entry<K,V> floorEntry(K key)
      Description copied from interface: NavigableMap
      Returns a key-value mapping associated with the greatest key less than or equal to the given key, or null if there is no such key.
      Specified by:
      floorEntry in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      an entry with the greatest key less than or equal to key, or null if there is no such key

    • firstKey

      public final K firstKey()
      Description copied from interface: SortedMap
      Returns the first (lowest) key currently in this map.
      Specified by:
      firstKey in interface SortedMap<K,V>
      Returns:
      the first (lowest) key currently in this map

    • lastKey

      public final K lastKey()
      Description copied from interface: SortedMap
      Returns the last (highest) key currently in this map.
      Specified by:
      lastKey in interface SortedMap<K,V>
      Returns:
      the last (highest) key currently in this map

    • higherKey

      public final K higherKey(K key)
      Description copied from interface: NavigableMap
      Returns the least key strictly greater than the given key, or null if there is no such key.
      Specified by:
      higherKey in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      the least key greater than key, or null if there is no such key

    • lowerKey

      public K lowerKey(K key)
      Description copied from interface: NavigableMap
      Returns the greatest key strictly less than the given key, or null if there is no such key.
      Specified by:
      lowerKey in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      the greatest key less than key, or null if there is no such key

    • ceilingKey

      public K ceilingKey(K key)
      Description copied from interface: NavigableMap
      Returns the least key greater than or equal to the given key, or null if there is no such key.
      Specified by:
      ceilingKey in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      the least key greater than or equal to key, or null if there is no such key

    • floorKey

      public K floorKey(K key)
      Description copied from interface: NavigableMap
      Returns the greatest key less than or equal to the given key, or null if there is no such key.
      Specified by:
      floorKey in interface NavigableMap<K,V>
      Parameters:
      key - the key
      Returns:
      the greatest key less than or equal to key, or null if there is no such key

    • keySet

      public Set<K> keySet()
      Description copied from class: AbstractMap
      Returns a Set view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.
      Specified by:
      keySet in interface Map<K,V>
      Specified by:
      keySet in interface SortedMap<K,V>
      Overrides:
      keySet in class AbstractMap<K,V>
      Returns:
      a set view of the keys contained in this map

    • descendingKeySet

      public NavigableSet<K> descendingKeySet()
      Description copied from interface: NavigableMap
      Returns a reverse order NavigableSet view of the keys contained in this map. The set's iterator returns the keys in descending order. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.
      Specified by:
      descendingKeySet in interface NavigableMap<K,V>
      Returns:
      a reverse order navigable set view of the keys in this map

    • subMap

      public SortedMap<K,V> subMap(K fromKey, K toKey)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive. (If fromKey and toKey are equal, the returned map is empty.) The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

      Equivalent to subMap(fromKey, true, toKey, false).

      Specified by:
      subMap in interface NavigableMap<K,V>
      Specified by:
      subMap in interface SortedMap<K,V>
      Parameters:
      fromKey - low endpoint (inclusive) of the keys in the returned map
      toKey - high endpoint (exclusive) of the keys in the returned map
      Returns:
      a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive

    • headMap

      public final SortedMap<K,V> headMap(K toKey)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys are strictly less than toKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

      Equivalent to headMap(toKey, false).

      Specified by:
      headMap in interface NavigableMap<K,V>
      Specified by:
      headMap in interface SortedMap<K,V>
      Parameters:
      toKey - high endpoint (exclusive) of the keys in the returned map
      Returns:
      a view of the portion of this map whose keys are strictly less than toKey

    • tailMap

      public final SortedMap<K,V> tailMap(K fromKey)
      Description copied from interface: NavigableMap
      Returns a view of the portion of this map whose keys are greater than or equal to fromKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.

      The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range.

      Equivalent to tailMap(fromKey, true).

      Specified by:
      tailMap in interface NavigableMap<K,V>
      Specified by:
      tailMap in interface SortedMap<K,V>
      Parameters:
      fromKey - low endpoint (inclusive) of the keys in the returned map
      Returns:
      a view of the portion of this map whose keys are greater than or equal to fromKey

    • getFloorEntry

      public java.util.TreeMap.Entry_I<K,V> getFloorEntry(K key)

    • findEndNode

      public java.util.TreeMap.Entry_I<K,V> findEndNode()

    • getLowerEntry

      public java.util.TreeMap.Entry_I<K,V> getLowerEntry(K key)

    • getCeilingEntry

      public java.util.TreeMap.Entry_I<K,V> getCeilingEntry(K key)