Type Parameters:
K - the type of keys maintained by this map
V - the type of mapped values
All Implemented Interfaces:
Serializable, Cloneable, Map<K,V>, NavigableMap<K,V>, SequencedMap<K,V>, SortedMap<K,V>

  • Nested Class Summary

  • Constructor Summary

    Constructors

    TreeMap()

    Constructs a new, empty tree map, using the natural ordering of its keys.

    Constructs a new, empty tree map, ordered according to the given comparator.

    TreeMap(Map<? extends K, ? extends V> m)

    Constructs a new tree map containing the same mappings as the given map, ordered according to the natural ordering of its keys.

    Constructs a new tree map containing the same mappings and using the same ordering as the specified sorted map.

  • Method Summary

    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.

    ceilingKey(K key)

    Returns the least key greater than or equal to the given key, or null if there is no such key.

    void

    clear()

    Removes all of the mappings from this map.

    clone()

    Returns a shallow copy of this TreeMap instance.

    Returns the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys.

    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 (optional operation).

    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 (optional operation).

    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 (optional operation).

    boolean

    Returns true if this map contains a mapping for the specified key.

    boolean

    Returns true if this map maps one or more keys to the specified value.

    Returns a reverse order NavigableSet view of the keys contained in this map.

    Returns a reverse order view of the mappings contained in this map.

    entrySet()

    Returns a Set view of the mappings contained in this map.

    Returns a key-value mapping associated with the least key in this map, or null if the map is empty.

    firstKey()

    Returns the first (lowest) key currently in this map.

    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.

    floorKey(K key)

    Returns the greatest key less than or equal to the given key, or null if there is no such key.

    Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.

    headMap(K toKey)

    Returns a view of the portion of this map whose keys are strictly less than toKey.

    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.

    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.

    higherKey(K key)

    Returns the least key strictly greater than the given key, or null if there is no such key.

    keySet()

    Returns a Set view of the keys contained in this map.

    lastEntry()

    Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.

    lastKey()

    Returns the last (highest) key currently in this map.

    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.

    lowerKey(K key)

    Returns the greatest key strictly less than the given key, or null if there is no such key.

    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 (optional operation).

    Returns a NavigableSet view of the keys contained in this map.

    Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty (optional operation).

    Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty (optional operation).

    put(K key, V value)

    Associates the specified value with the specified key in this map.

    void

    putAll(Map<? extends K, ? extends V> map)

    Copies all of the mappings from the specified map to this map.

    putFirst(K k, V v)

    Throws UnsupportedOperationException.

    putLast(K k, V v)

    Throws UnsupportedOperationException.

    Removes the mapping for this key from this TreeMap if present.

    int

    size()

    Returns the number of key-value mappings in this map.

    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.

    subMap(K fromKey, K toKey)

    Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.

    tailMap(K fromKey)

    Returns a view of the portion of this map whose keys are greater than or equal to fromKey.

    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.

    values()

    Returns a Collection view of the values contained in this map.

    Methods declared in class AbstractMap

    equals, hashCode, isEmpty, toString

    boolean

    Compares the specified object with this map for equality.

    int

    Returns the hash code value for this map.

    boolean

    Returns true if this map contains no key-value mappings.

    Returns a string representation of this map.

    Methods declared in class Object

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

    protected void

    Deprecated, for removal: This API element is subject to removal in a future version.

    Returns the runtime class of this Object.

    final void

    Wakes up a single thread that is waiting on this object's monitor.

    final void

    Wakes up all threads that are waiting on this object's monitor.

    final void

    Causes the current thread to wait until it is awakened, typically by being notified or interrupted.

    final void

    wait(long timeoutMillis)

    Causes the current thread to wait until it is awakened, typically by being notified or interrupted, or until a certain amount of real time has elapsed.

    final void

    wait(long timeoutMillis, int nanos)

    Causes the current thread to wait until it is awakened, typically by being notified or interrupted, or until a certain amount of real time has elapsed.

    Methods declared in interface Map

    forEach, getOrDefault, putIfAbsent, remove, replace, replace, replaceAll

    default void

    Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.

    default V

    Returns the value to which the specified key is mapped, or defaultValue if this map contains no mapping for the key.

    default V

    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 (optional operation).

    default boolean

    Removes the entry for the specified key only if it is currently mapped to the specified value (optional operation).

    default V

    Replaces the entry for the specified key only if it is currently mapped to some value (optional operation).

    default boolean

    replace(K key, V oldValue, V newValue)

    Replaces the entry for the specified key only if currently mapped to the specified value (optional operation).

    default void

    Replaces each entry's value with the result of invoking the given function on that entry until all entries have been processed or the function throws an exception (optional operation).

  • Constructor Details

    • TreeMap

    • TreeMap

    • TreeMap

    • TreeMap

  • Method Details

    • size

    • containsKey

    • containsValue

    • get

    • comparator

    • firstKey

    • lastKey

    • putFirst

    • putLast

    • putAll

    • put

    • computeIfAbsent

    • computeIfPresent

    • compute

    • merge

    • remove

    • clear

    • clone

    • firstEntry

    • lastEntry

    • pollFirstEntry

    • pollLastEntry

    • lowerEntry

    • lowerKey

    • floorEntry

    • floorKey

    • ceilingEntry

    • ceilingKey

    • higherEntry

    • higherKey

    • keySet

    • descendingKeySet

    • values

    • entrySet

    • descendingMap

    • subMap

    • headMap

    • tailMap

    • subMap

    • headMap

    • tailMap