TreeMap

java.lang.Object
- java.util.AbstractMap<K,V>
- - java.util.TreeMap<K,V>

类型参数:

K - the type of keys maintained by this map

V - the type of mapped values

所有已实现的接口:

Serializable, Cloneable, Map<K,V>, NavigableMap<K,V>, SortedMap<K,V>
```
public class TreeMap<K,V>
extends AbstractMap<K,V>
implements NavigableMap<K,V>, Cloneable, Serializable
```
A Red-Black tree based NavigableMap implementation. The map is sorted according to the Comparable of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to Algorithms.
Note that the ordering maintained by a tree map, like any sorted map, and whether or not an explicit comparator is provided, must be consistent with equals if this sorted map is to correctly implement the Map interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Map interface is defined in terms of the equals operation, but a sorted map performs all key comparisons using its compareTo (or compare) method, so two keys that are deemed equal by this method are, from the standpoint of the sorted map, equal. The behavior of a sorted map is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Map interface.
Note that this implementation is not synchronized. If multiple threads access a map concurrently, and at least one of the threads modifies the map structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more mappings; merely changing the value associated with an existing key is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the map. If no such object exists, the map should be "wrapped" using the Collections#synchronizedSortedMap method. This is best done at creation time, to prevent accidental unsynchronized access to the map:
```
   SortedMap m = Collections.synchronizedSortedMap(new TreeMap(...));
```
The iterators returned by the iterator method of the collections returned by all of this class's "collection view methods" are fail-fast: if the map is structurally modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
All Map.Entry pairs returned by methods in this class and its views represent snapshots of mappings at the time they were produced. They do not support the Entry.setValue method. (Note however that it is possible to change mappings in the associated map using put.)
This class is a member of the Java Collections Framework.
从以下版本开始:

1.2

另请参阅:

Map, HashMap, Hashtable, Comparable, Comparator, Collection, 序列化表格

嵌套类概要
- 从类继承的嵌套类/接口 java.util.AbstractMap
  AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>
- 从接口继承的嵌套类/接口 java.util.Map
  Map.Entry<K,V>

构造器概要

构造器
构造器	说明
`TreeMap()`	Constructs a new, empty tree map, using the natural ordering of its keys.
`TreeMap(Comparator<? super K> comparator)`	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.
`TreeMap(SortedMap<K,? extends V> m)`	Constructs a new tree map containing the same mappings and using the same ordering as the specified sorted map.

方法概要

所有方法实例方法具体方法
限定符和类型	方法	说明
`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.
`void`	`clear()`	Removes all of the mappings from this map.
`Object`	`clone()`	Returns a shallow copy of this `TreeMap` instance.
`Comparator<? super K>`	`comparator()`	Returns the comparator used to order the keys in this map, or `null` if this map uses the Comparable of its keys.
`boolean`	`containsKey(Object key)`	Returns `true` if this map contains a mapping for the specified key.
`boolean`	`containsValue(Object value)`	Returns `true` if this map maps one or more keys to the specified value.
`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.
`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.
`K`	`firstKey()`	Returns the first (lowest) key currently in this map.
`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.
`void`	`forEach(BiConsumer<? super K,? super V> action)`	Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
`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.
`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`.
`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.
`K`	`higherKey(K key)`	Returns the least key strictly greater than the given key, or `null` if there is no such key.
`Set<K>`	`keySet()`	Returns a `Set` view of the keys contained in this map.
`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.
`K`	`lastKey()`	Returns the last (highest) key currently in this map.
`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.
`NavigableSet<K>`	`navigableKeySet()`	Returns a `NavigableSet` view of the keys contained in this map.
`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.
`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.
`V`	`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.
`V`	`remove(Object key)`	Removes the mapping for this key from this TreeMap if present.
`V`	`replace(K key, V value)`	Replaces the entry for the specified key only if it is currently mapped to some value.
`boolean`	`replace(K key, V oldValue, V newValue)`	Replaces the entry for the specified key only if currently mapped to the specified value.
`void`	`replaceAll(BiFunction<? super K,? super V,? extends V> function)`	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.
`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.
`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`.
`Collection<V>`	`values()`	Returns a `Collection` view of the values contained in this map.

从类继承的方法 java.util.AbstractMap
equals, hashCode, isEmpty, toString

从接口继承的方法 java.util.Map
compute, computeIfAbsent, computeIfPresent, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, remove

从类继承的方法 java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, wait

- 构造器详细资料
  - TreeMap
```
public TreeMap()
```
    Constructs a new, empty tree map, using the natural ordering of its keys. All keys inserted into the map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint (for example, the user attempts to put a string key into a map whose keys are integers), the put(Object key, Object value) call will throw a ClassCastException.
  - TreeMap
```
public TreeMap(Comparator<? super K> comparator)
```
    Constructs a new, empty tree map, ordered according to the given comparator. All keys inserted into the map must be mutually comparable by the given comparator: comparator.compare(k1, k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint, the put(Object key, Object value) call will throw a ClassCastException.
    
    参数:
    
    comparator - the comparator that will be used to order this map. If null, the Comparable of the keys will be used.
  - TreeMap
```
public 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. All keys inserted into the new map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any keys k1 and k2 in the map. This method runs in n*log(n) time.
    
    参数:
    
    m - the map whose mappings are to be placed in this map
    
    抛出:
    
    ClassCastException - if the keys in m are not Comparable, or are not mutually comparable
    
    NullPointerException - if the specified map is null
  - TreeMap
```
public TreeMap(SortedMap<K,? extends V> m)
```
    Constructs a new tree map containing the same mappings and using the same ordering as the specified sorted map. This method runs in linear time.
    
    参数:
    
    m - the sorted map whose mappings are to be placed in this map, and whose comparator is to be used to sort this map
    
    抛出:
    
    NullPointerException - if the specified map is null
- 方法详细资料
  - size
```
public int size()
```
    Returns the number of key-value mappings in this map.
    
    指定者:
    
    size 在接口中 Map<K,V>
    
    覆盖:
    
    size 在类中 AbstractMap<K,V>
    
    返回:
    
    the number of key-value mappings in this map
  - containsKey
```
public boolean containsKey(Object key)
```
    Returns true if this map contains a mapping for the specified key.
    
    指定者:
    
    containsKey 在接口中 Map<K,V>
    
    覆盖:
    
    containsKey 在类中 AbstractMap<K,V>
    
    参数:
    
    key - key whose presence in this map is to be tested
    
    返回:
    
    true if this map contains a mapping for the specified key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
  - containsValue
```
public boolean containsValue(Object value)
```
    Returns true if this map maps one or more keys to the specified value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations.
    
    指定者:
    
    containsValue 在接口中 Map<K,V>
    
    覆盖:
    
    containsValue 在类中 AbstractMap<K,V>
    
    参数:
    
    value - value whose presence in this map is to be tested
    
    返回:
    
    true if a mapping to value exists; false otherwise
    
    从以下版本开始:
    
    1.2
  - get
```
public 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.
    More formally, if this map contains a mapping from a key k to a value v such that key compares equal to k according to the map's ordering, then this method returns v; otherwise it returns null. (There can be at most one such mapping.)
    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.
    
    指定者:
    
    get 在接口中 Map<K,V>
    
    覆盖:
    
    get 在类中 AbstractMap<K,V>
    
    参数:
    
    key - the key whose associated value is to be returned
    
    返回:
    
    the value to which the specified key is mapped, or null if this map contains no mapping for the key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
  - comparator
```
public Comparator<? super K> comparator()
```
    从接口复制的说明: SortedMap
    
    Returns the comparator used to order the keys in this map, or null if this map uses the Comparable of its keys.
    
    指定者:
    
    comparator 在接口中 SortedMap<K,V>
    
    返回:
    
    the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys
  - firstKey
```
public K firstKey()
```
    从接口复制的说明: SortedMap
    
    Returns the first (lowest) key currently in this map.
    
    指定者:
    
    firstKey 在接口中 SortedMap<K,V>
    
    返回:
    
    the first (lowest) key currently in this map
    
    抛出:
    
    NoSuchElementException - if this map is empty
  - lastKey
```
public K lastKey()
```
    从接口复制的说明: SortedMap
    
    Returns the last (highest) key currently in this map.
    
    指定者:
    
    lastKey 在接口中 SortedMap<K,V>
    
    返回:
    
    the last (highest) key currently in this map
    
    抛出:
    
    NoSuchElementException - if this map is empty
  - putAll
```
public void putAll(Map<? extends K,? extends V> map)
```
    Copies all of the mappings from the specified map to this map. These mappings replace any mappings that this map had for any of the keys currently in the specified map.
    
    指定者:
    
    putAll 在接口中 Map<K,V>
    
    覆盖:
    
    putAll 在类中 AbstractMap<K,V>
    
    参数:
    
    map - mappings to be stored in this map
    
    抛出:
    
    ClassCastException - if the class of a key or value in the specified map prevents it from being stored in this map
    
    NullPointerException - if the specified map is null or the specified map contains a null key and this map does not permit null keys
  - put
```
public V put(K key,
             V value)
```
    Associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.
    
    指定者:
    
    put 在接口中 Map<K,V>
    
    覆盖:
    
    put 在类中 AbstractMap<K,V>
    
    参数:
    
    key - key with which the specified value is to be associated
    
    value - value to be associated with the specified key
    
    返回:
    
    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.)
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
  - remove
```
public V remove(Object key)
```
    Removes the mapping for this key from this TreeMap if present.
    
    指定者:
    
    remove 在接口中 Map<K,V>
    
    覆盖:
    
    remove 在类中 AbstractMap<K,V>
    
    参数:
    
    key - key for which mapping should be removed
    
    返回:
    
    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.)
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
  - clear
```
public void clear()
```
    Removes all of the mappings from this map. The map will be empty after this call returns.
    
    指定者:
    
    clear 在接口中 Map<K,V>
    
    覆盖:
    
    clear 在类中 AbstractMap<K,V>
  - clone
```
public Object clone()
```
    Returns a shallow copy of this TreeMap instance. (The keys and values themselves are not cloned.)
    
    覆盖:
    
    clone 在类中 AbstractMap<K,V>
    
    返回:
    
    a shallow copy of this map
    
    另请参阅:
    
    Cloneable
  - firstEntry
```
public Map.Entry<K,V> firstEntry()
```
    从接口复制的说明: NavigableMap
    
    Returns a key-value mapping associated with the least key in this map, or null if the map is empty.
    
    指定者:
    
    firstEntry 在接口中 NavigableMap<K,V>
    
    返回:
    
    an entry with the least key, or null if this map is empty
    
    从以下版本开始:
    
    1.6
  - lastEntry
```
public Map.Entry<K,V> lastEntry()
```
    从接口复制的说明: NavigableMap
    
    Returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
    
    指定者:
    
    lastEntry 在接口中 NavigableMap<K,V>
    
    返回:
    
    an entry with the greatest key, or null if this map is empty
    
    从以下版本开始:
    
    1.6
  - pollFirstEntry
```
public Map.Entry<K,V> pollFirstEntry()
```
    从接口复制的说明: NavigableMap
    
    Removes and returns a key-value mapping associated with the least key in this map, or null if the map is empty.
    
    指定者:
    
    pollFirstEntry 在接口中 NavigableMap<K,V>
    
    返回:
    
    the removed first entry of this map, or null if this map is empty
    
    从以下版本开始:
    
    1.6
  - pollLastEntry
```
public Map.Entry<K,V> pollLastEntry()
```
    从接口复制的说明: NavigableMap
    
    Removes and returns a key-value mapping associated with the greatest key in this map, or null if the map is empty.
    
    指定者:
    
    pollLastEntry 在接口中 NavigableMap<K,V>
    
    返回:
    
    the removed last entry of this map, or null if this map is empty
    
    从以下版本开始:
    
    1.6
  - lowerEntry
```
public Map.Entry<K,V> lowerEntry(K key)
```
    从接口复制的说明: 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.
    
    指定者:
    
    lowerEntry 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    an entry with the greatest key less than key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - lowerKey
```
public K lowerKey(K key)
```
    从接口复制的说明: NavigableMap
    
    Returns the greatest key strictly less than the given key, or null if there is no such key.
    
    指定者:
    
    lowerKey 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    the greatest key less than key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - floorEntry
```
public Map.Entry<K,V> floorEntry(K key)
```
    从接口复制的说明: 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.
    
    指定者:
    
    floorEntry 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    an entry with the greatest key less than or equal to key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - floorKey
```
public K floorKey(K key)
```
    从接口复制的说明: NavigableMap
    
    Returns the greatest key less than or equal to the given key, or null if there is no such key.
    
    指定者:
    
    floorKey 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    the greatest key less than or equal to key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - ceilingEntry
```
public Map.Entry<K,V> ceilingEntry(K key)
```
    从接口复制的说明: 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.
    
    指定者:
    
    ceilingEntry 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    an entry with the least key greater than or equal to key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - ceilingKey
```
public K ceilingKey(K key)
```
    从接口复制的说明: NavigableMap
    
    Returns the least key greater than or equal to the given key, or null if there is no such key.
    
    指定者:
    
    ceilingKey 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    the least key greater than or equal to key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - higherEntry
```
public Map.Entry<K,V> higherEntry(K key)
```
    从接口复制的说明: 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.
    
    指定者:
    
    higherEntry 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    an entry with the least key greater than key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - higherKey
```
public K higherKey(K key)
```
    从接口复制的说明: NavigableMap
    
    Returns the least key strictly greater than the given key, or null if there is no such key.
    
    指定者:
    
    higherKey 在接口中 NavigableMap<K,V>
    
    参数:
    
    key - the key
    
    返回:
    
    the least key greater than key, or null if there is no such key
    
    抛出:
    
    ClassCastException - if the specified key cannot be compared with the keys currently in the map
    
    NullPointerException - if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys
    
    从以下版本开始:
    
    1.6
  - keySet
```
public Set<K> keySet()
```
    Returns a Set view of the keys contained in this map.
    The set's iterator returns the keys in ascending order. The set's spliterator is late-binding, fail-fast, and additionally reports Spliterator#SORTED and Spliterator#ORDERED with an encounter order that is ascending key order. The spliterator's comparator (see Spliterator.getComparator()) is null if the tree map's comparator (see comparator()) is null. Otherwise, the spliterator's comparator is the same as or imposes the same total ordering as the tree map's comparator.
    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.
    
    指定者:
    
    keySet 在接口中 Map<K,V>
    
    指定者:
    
    keySet 在接口中 SortedMap<K,V>
    
    覆盖:
    
    keySet 在类中 AbstractMap<K,V>
    
    返回:
    
    a set view of the keys contained in this map
  - navigableKeySet
```
public NavigableSet<K> navigableKeySet()
```
    从接口复制的说明: NavigableMap
    
    Returns a NavigableSet view of the keys contained in this map. The set's iterator returns the keys in ascending 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.
    
    指定者:
    
    navigableKeySet 在接口中 NavigableMap<K,V>
    
    返回:
    
    a navigable set view of the keys in this map
    
    从以下版本开始:
    
    1.6
  - descendingKeySet
```
public NavigableSet<K> descendingKeySet()
```
    从接口复制的说明: 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.
    
    指定者:
    
    descendingKeySet 在接口中 NavigableMap<K,V>
    
    返回:
    
    a reverse order navigable set view of the keys in this map
    
    从以下版本开始:
    
    1.6
  - values
```
public Collection<V> values()
```
    Returns a Collection view of the values contained in this map.
    The collection's iterator returns the values in ascending order of the corresponding keys. The collection's spliterator is late-binding, fail-fast, and additionally reports Spliterator#ORDERED with an encounter order that is ascending order of the corresponding keys.
    The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Collection.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
    
    指定者:
    
    values 在接口中 Map<K,V>
    
    指定者:
    
    values 在接口中 SortedMap<K,V>
    
    覆盖:
    
    values 在类中 AbstractMap<K,V>
    
    返回:
    
    a collection view of the values contained in this map
  - entrySet
```
public Set<Map.Entry<K,V>> entrySet()
```
    Returns a Set view of the mappings contained in this map.
    The set's iterator returns the entries in ascending key order. The sets's spliterator is late-binding, fail-fast, and additionally reports Spliterator#SORTED and Spliterator#ORDERED with an encounter order that is 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.
    
    指定者:
    
    entrySet 在接口中 Map<K,V>
    
    指定者:
    
    entrySet 在接口中 SortedMap<K,V>
    
    指定者:
    
    entrySet 在类中 AbstractMap<K,V>
    
    返回:
    
    a set view of the mappings contained in this map
  - descendingMap
```
public NavigableMap<K,V> descendingMap()
```
    从接口复制的说明: 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)(comparator()). The expression m.descendingMap().descendingMap() returns a view of m essentially equivalent to m.
    
    指定者:
    
    descendingMap 在接口中 NavigableMap<K,V>
    
    返回:
    
    a reverse order view of this map
    
    从以下版本开始:
    
    1.6
  - subMap
```
public NavigableMap<K,V> subMap(K fromKey,
                                boolean fromInclusive,
                                K toKey,
                                boolean toInclusive)
```
    从接口复制的说明: 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.
    
    指定者:
    
    subMap 在接口中 NavigableMap<K,V>
    
    参数:
    
    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
    
    返回:
    
    a view of the portion of this map whose keys range from fromKey to toKey
    
    抛出:
    
    ClassCastException - if fromKey and toKey cannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromKey or toKey cannot be compared to keys currently in the map.
    
    NullPointerException - if fromKey or toKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if fromKey is greater than toKey; or if this map itself has a restricted range, and fromKey or toKey lies outside the bounds of the range
    
    从以下版本开始:
    
    1.6
  - headMap
```
public NavigableMap<K,V> headMap(K toKey,
                                 boolean inclusive)
```
    从接口复制的说明: 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.
    
    指定者:
    
    headMap 在接口中 NavigableMap<K,V>
    
    参数:
    
    toKey - high endpoint of the keys in the returned map
    
    inclusive - true if the high endpoint is to be included in the returned view
    
    返回:
    
    a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey
    
    抛出:
    
    ClassCastException - if toKey is not compatible with this map's comparator (or, if the map has no comparator, if toKey does not implement Comparable). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map.
    
    NullPointerException - if toKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if this map itself has a restricted range, and toKey lies outside the bounds of the range
    
    从以下版本开始:
    
    1.6
  - tailMap
```
public NavigableMap<K,V> tailMap(K fromKey,
                                 boolean inclusive)
```
    从接口复制的说明: 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.
    
    指定者:
    
    tailMap 在接口中 NavigableMap<K,V>
    
    参数:
    
    fromKey - low endpoint of the keys in the returned map
    
    inclusive - true if the low endpoint is to be included in the returned view
    
    返回:
    
    a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey
    
    抛出:
    
    ClassCastException - if fromKey is not compatible with this map's comparator (or, if the map has no comparator, if fromKey does not implement Comparable). Implementations may, but are not required to, throw this exception if fromKey cannot be compared to keys currently in the map.
    
    NullPointerException - if fromKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if this map itself has a restricted range, and fromKey lies outside the bounds of the range
    
    从以下版本开始:
    
    1.6
  - subMap
```
public SortedMap<K,V> subMap(K fromKey,
                             K toKey)
```
    从接口复制的说明: 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).
    
    指定者:
    
    subMap 在接口中 NavigableMap<K,V>
    
    指定者:
    
    subMap 在接口中 SortedMap<K,V>
    
    参数:
    
    fromKey - low endpoint (inclusive) of the keys in the returned map
    
    toKey - high endpoint (exclusive) of the keys in the returned map
    
    返回:
    
    a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive
    
    抛出:
    
    ClassCastException - if fromKey and toKey cannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromKey or toKey cannot be compared to keys currently in the map.
    
    NullPointerException - if fromKey or toKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if fromKey is greater than toKey; or if this map itself has a restricted range, and fromKey or toKey lies outside the bounds of the range
  - headMap
```
public SortedMap<K,V> headMap(K toKey)
```
    从接口复制的说明: 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).
    
    指定者:
    
    headMap 在接口中 NavigableMap<K,V>
    
    指定者:
    
    headMap 在接口中 SortedMap<K,V>
    
    参数:
    
    toKey - high endpoint (exclusive) of the keys in the returned map
    
    返回:
    
    a view of the portion of this map whose keys are strictly less than toKey
    
    抛出:
    
    ClassCastException - if toKey is not compatible with this map's comparator (or, if the map has no comparator, if toKey does not implement Comparable). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map.
    
    NullPointerException - if toKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if this map itself has a restricted range, and toKey lies outside the bounds of the range
  - tailMap
```
public SortedMap<K,V> tailMap(K fromKey)
```
    从接口复制的说明: 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).
    
    指定者:
    
    tailMap 在接口中 NavigableMap<K,V>
    
    指定者:
    
    tailMap 在接口中 SortedMap<K,V>
    
    参数:
    
    fromKey - low endpoint (inclusive) of the keys in the returned map
    
    返回:
    
    a view of the portion of this map whose keys are greater than or equal to fromKey
    
    抛出:
    
    ClassCastException - if fromKey is not compatible with this map's comparator (or, if the map has no comparator, if fromKey does not implement Comparable). Implementations may, but are not required to, throw this exception if fromKey cannot be compared to keys currently in the map.
    
    NullPointerException - if fromKey is null and this map uses natural ordering, or its comparator does not permit null keys
    
    IllegalArgumentException - if this map itself has a restricted range, and fromKey lies outside the bounds of the range
  - replace
```
public boolean replace(K key,
                       V oldValue,
                       V newValue)
```
    从接口复制的说明: Map
    
    Replaces the entry for the specified key only if currently mapped to the specified value.
    
    指定者:
    
    replace 在接口中 Map<K,V>
    
    参数:
    
    key - key with which the specified value is associated
    
    oldValue - value expected to be associated with the specified key
    
    newValue - value to be associated with the specified key
    
    返回:
    
    true if the value was replaced
  - replace
```
public V replace(K key,
                 V value)
```
    从接口复制的说明: Map
    
    Replaces the entry for the specified key only if it is currently mapped to some value.
    
    指定者:
    
    replace 在接口中 Map<K,V>
    
    参数:
    
    key - key with which the specified value is associated
    
    value - value to be associated with the specified key
    
    返回:
    
    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.)
  - forEach
```
public void forEach(BiConsumer<? super K,? super V> action)
```
    从接口复制的说明: Map
    
    Performs the given action for each entry in this map until all entries have been processed or the action throws an exception. Unless otherwise specified by the implementing class, actions are performed in the order of entry set iteration (if an iteration order is specified.) Exceptions thrown by the action are relayed to the caller.
    
    指定者:
    
    forEach 在接口中 Map<K,V>
    
    参数:
    
    action - The action to be performed for each entry
  - replaceAll
```
public void replaceAll(BiFunction<? super K,? super V,? extends V> function)
```
    从接口复制的说明: Map
    
    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. Exceptions thrown by the function are relayed to the caller.
    
    指定者:
    
    replaceAll 在接口中 Map<K,V>
    
    参数:
    
    function - the function to apply to each entry

类 TreeMap<K,V>

嵌套类概要

从类继承的嵌套类/接口 java.util.AbstractMap

从接口继承的嵌套类/接口 java.util.Map

构造器概要

方法概要

从类继承的方法 java.util.AbstractMap

从接口继承的方法 java.util.Map

从类继承的方法 java.lang.Object

构造器详细资料

TreeMap

TreeMap

TreeMap

TreeMap

方法详细资料

size

containsKey

containsValue

get

comparator

firstKey

lastKey

putAll

put

remove

clear

clone

firstEntry

lastEntry

pollFirstEntry

pollLastEntry

lowerEntry

lowerKey

floorEntry

floorKey

ceilingEntry

ceilingKey

higherEntry

higherKey

keySet

navigableKeySet

descendingKeySet

values

entrySet

descendingMap

subMap

headMap

tailMap

subMap

headMap

tailMap

replace

replace

forEach

replaceAll