← 返回首页
TreeSet (Java SE 26 & JDK 26)
JavaScript is disabled on your browser.
  1. java.base
  2. java.util
  3. TreeSet
Contents  
  1. Description
  2. Constructor Summary
  3. Method Summary
    1. Methods declared in class AbstractSet
    2. Methods declared in class AbstractCollection
    3. Methods declared in class Object
    4. Methods declared in interface Collection
    5. Methods declared in interface Iterable
    6. Methods declared in interface NavigableSet
    7. Methods declared in interface Set
    8. Methods declared in interface SortedSet
  4. Constructor Details
    1. TreeSet()
    2. TreeSet(Comparator)
    3. TreeSet(Collection)
    4. TreeSet(SortedSet)
  5. Method Details
    1. iterator()
    2. descendingIterator()
    3. descendingSet()
    4. size()
    5. isEmpty()
    6. contains(Object)
    7. add(E)
    8. remove(Object)
    9. clear()
    10. addAll(Collection)
    11. subSet(E, boolean, E, boolean)
    12. headSet(E, boolean)
    13. tailSet(E, boolean)
    14. subSet(E, E)
    15. headSet(E)
    16. tailSet(E)
    17. comparator()
    18. first()
    19. last()
    20. lower(E)
    21. floor(E)
    22. ceiling(E)
    23. higher(E)
    24. pollFirst()
    25. pollLast()
    26. addFirst(E)
    27. addLast(E)
    28. clone()
    29. spliterator()
Hide sidebar  Show sidebar

Class TreeSet<E>

java.lang.Object
java.util.AbstractCollection<E>
java.util.AbstractSet<E>
java.util.TreeSet<E>
Type Parameters: E - the type of elements maintained by this set All Implemented Interfaces: Serializable, Cloneable, Iterable<E>, Collection<E>, NavigableSet<E>, SequencedCollection<E>, SequencedSet<E>, Set<E>, SortedSet<E>
public class TreeSet<E> extends AbstractSet<E> implements NavigableSet<E>, Cloneable, Serializable
A NavigableSet implementation based on a TreeMap. The elements are ordered using their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.

This implementation provides guaranteed log(n) time cost for the basic operations (add, remove and contains).

Note that the ordering maintained by a set (whether or not an explicit comparator is provided) must be consistent with equals if it is to correctly implement the Set interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Set interface is defined in terms of the equals operation, but a TreeSet instance performs all element comparisons using its compareTo (or compare) method, so two elements that are deemed equal by this method are, from the standpoint of the set, equal. The behavior of a set is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Set interface.

Note that this implementation is not synchronized. If multiple threads access a tree set concurrently, and at least one of the threads modifies the set, it must be synchronized externally. This is typically accomplished by synchronizing on some object that naturally encapsulates the set. If no such object exists, the set should be "wrapped" using the Collections.synchronizedSortedSet method. This is best done at creation time, to prevent accidental unsynchronized access to the set: SortedSet s = Collections.synchronizedSortedSet(new TreeSet(...));

The iterators returned by this class's iterator method are fail-fast: if the set is 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 addFirst and addLast methods of this class throw UnsupportedOperationException. The encounter order of elements 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.