← 返回首页
TreeMap (Java SE 26 & JDK 26)
JavaScript is disabled on your browser.
  1. java.base
  2. java.util
  3. TreeMap
Contents  
  1. Description
  2. Nested Class Summary
  3. Constructor Summary
  4. Method Summary
    1. Methods declared in class AbstractMap
    2. Methods declared in class Object
    3. Methods declared in interface Map
    4. Methods declared in interface NavigableMap
    5. Methods declared in interface SequencedMap
  5. Constructor Details
    1. TreeMap()
    2. TreeMap(Comparator)
    3. TreeMap(Map)
    4. TreeMap(SortedMap)
  6. Method Details
    1. size()
    2. containsKey(Object)
    3. containsValue(Object)
    4. get(Object)
    5. comparator()
    6. firstKey()
    7. lastKey()
    8. putFirst(K, V)
    9. putLast(K, V)
    10. putAll(Map)
    11. put(K, V)
    12. computeIfAbsent(K, Function)
    13. computeIfPresent(K, BiFunction)
    14. compute(K, BiFunction)
    15. merge(K, V, BiFunction)
    16. remove(Object)
    17. clear()
    18. clone()
    19. firstEntry()
    20. lastEntry()
    21. pollFirstEntry()
    22. pollLastEntry()
    23. lowerEntry(K)
    24. lowerKey(K)
    25. floorEntry(K)
    26. floorKey(K)
    27. ceilingEntry(K)
    28. ceilingKey(K)
    29. higherEntry(K)
    30. higherKey(K)
    31. keySet()
    32. navigableKeySet()
    33. descendingKeySet()
    34. values()
    35. entrySet()
    36. descendingMap()
    37. subMap(K, boolean, K, boolean)
    38. headMap(K, boolean)
    39. tailMap(K, boolean)
    40. subMap(K, K)
    41. headMap(K)
    42. tailMap(K)
Hide sidebar  Show sidebar

Class TreeMap<K,V>

java.lang.Object
java.util.AbstractMap<K,V>
java.util.TreeMap<K,V>
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>
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 natural ordering 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.

The methods ceilingEntry(K), firstEntry(), floorEntry(K), higherEntry(K), lastEntry(), lowerEntry(K), pollFirstEntry(), and pollLastEntry() return Map.Entry instances that represent snapshots of mappings as of the time of the call. They do not support mutation of the underlying map via the optional setValue method.

The putFirst and putLast methods of this class throw UnsupportedOperationException. The encounter order of mappings is determined by the comparison method; therefore, explicit positioning is not supported.

This class is a member of the Java Collections Framework.

Since: 1.2 See Also:

Report a bug or suggest an enhancement
For further API reference and developer documentation see the Java SE Documentation, which contains more detailed, developer-targeted descriptions with conceptual overviews, definitions of terms, workarounds, and working code examples. Other versions.
Java is a trademark or registered trademark of Oracle and/or its affiliates in the US and other countries.
Copyright © 1993, 2026, Oracle and/or its affiliates, 500 Oracle Parkway, Redwood Shores, CA 94065 USA.
All rights reserved. Use is subject to license terms and the documentation redistribution policy.

Scripting on this page tracks web page traffic, but does not change the content in any way.