- 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>,- Set<E>,- SortedSet<E>
 
 public class TreeSet<E> extends AbstractSet<E> implements NavigableSet<E>, Cloneable, Serializable ANavigableSetimplementation based on aTreeMap. The elements are ordered using their natural ordering, or by aComparatorprovided at set creation time, depending on which constructor is used.This implementation provides guaranteed log(n) time cost for the basic operations ( add,removeandcontains).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 Setinterface. (SeeComparableorComparatorfor a precise definition of consistent with equals.) This is so because theSetinterface is defined in terms of theequalsoperation, but aTreeSetinstance performs all element comparisons using itscompareTo(orcompare) 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 theSetinterface.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.synchronizedSortedSetmethod. 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 iteratormethod are fail-fast: if the set is modified at any time after the iterator is created, in any way except through the iterator's ownremovemethod, the iterator will throw aConcurrentModificationException. 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 ConcurrentModificationExceptionon 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.This class is a member of the Java Collections Framework. - Since:
- 1.2
- See Also:
- Collection,- Set,- HashSet,- Comparable,- Comparator,- TreeMap, Serialized Form
 
- 
- 
Constructor SummaryConstructors Constructor Description TreeSet()Constructs a new, empty tree set, sorted according to the natural ordering of its elements.TreeSet(Collection<? extends E> c)Constructs a new tree set containing the elements in the specified collection, sorted according to the natural ordering of its elements.TreeSet(Comparator<? super E> comparator)Constructs a new, empty tree set, sorted according to the specified comparator.TreeSet(SortedSet<E> s)Constructs a new tree set containing the same elements and using the same ordering as the specified sorted set.
 - 
Method SummaryAll Methods Instance Methods Concrete Methods Modifier and Type Method Description booleanadd(E e)Adds the specified element to this set if it is not already present.booleanaddAll(Collection<? extends E> c)Adds all of the elements in the specified collection to this set.Eceiling(E e)Returns the least element in this set greater than or equal to the given element, ornullif there is no such element.voidclear()Removes all of the elements from this set.Objectclone()Returns a shallow copy of thisTreeSetinstance.booleancontains(Object o)Returnstrueif this set contains the specified element.Iterator<E>descendingIterator()Returns an iterator over the elements in this set in descending order.NavigableSet<E>descendingSet()Returns a reverse order view of the elements contained in this set.Efirst()Returns the first (lowest) element currently in this set.Efloor(E e)Returns the greatest element in this set less than or equal to the given element, ornullif there is no such element.SortedSet<E>headSet(E toElement)Returns a view of the portion of this set whose elements are strictly less thantoElement.NavigableSet<E>headSet(E toElement, boolean inclusive)Returns a view of the portion of this set whose elements are less than (or equal to, ifinclusiveis true)toElement.Ehigher(E e)Returns the least element in this set strictly greater than the given element, ornullif there is no such element.booleanisEmpty()Returnstrueif this set contains no elements.Iterator<E>iterator()Returns an iterator over the elements in this set in ascending order.Elast()Returns the last (highest) element currently in this set.Elower(E e)Returns the greatest element in this set strictly less than the given element, ornullif there is no such element.EpollFirst()Retrieves and removes the first (lowest) element, or returnsnullif this set is empty.EpollLast()Retrieves and removes the last (highest) element, or returnsnullif this set is empty.booleanremove(Object o)Removes the specified element from this set if it is present.intsize()Returns the number of elements in this set (its cardinality).Spliterator<E>spliterator()Creates a late-binding and fail-fastSpliteratorover the elements in this set.NavigableSet<E>subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)Returns a view of the portion of this set whose elements range fromfromElementtotoElement.SortedSet<E>subSet(E fromElement, E toElement)Returns a view of the portion of this set whose elements range fromfromElement, inclusive, totoElement, exclusive.SortedSet<E>tailSet(E fromElement)Returns a view of the portion of this set whose elements are greater than or equal tofromElement.NavigableSet<E>tailSet(E fromElement, boolean inclusive)Returns a view of the portion of this set whose elements are greater than (or equal to, ifinclusiveis true)fromElement.- 
Methods declared in class java.util.AbstractSetequals, hashCode, removeAll
 - 
Methods declared in class java.util.AbstractCollectioncontainsAll, retainAll, toArray, toArray, toString
 - 
Methods declared in interface java.util.CollectionparallelStream, removeIf, stream, toArray
 - 
Methods declared in interface java.util.SetcontainsAll, equals, hashCode, removeAll, retainAll, toArray, toArray
 - 
Methods declared in interface java.util.SortedSetcomparator
 
- 
 
- 
- 
- 
Constructor Detail- 
TreeSetpublic TreeSet() Constructs a new, empty tree set, sorted according to the natural ordering of its elements. All elements inserted into the set must implement theComparableinterface. Furthermore, all such elements must be mutually comparable:e1.compareTo(e2)must not throw aClassCastExceptionfor any elementse1ande2in the set. If the user attempts to add an element to the set that violates this constraint (for example, the user attempts to add a string element to a set whose elements are integers), theaddcall will throw aClassCastException.
 - 
TreeSetpublic TreeSet(Comparator<? super E> comparator) Constructs a new, empty tree set, sorted according to the specified comparator. All elements inserted into the set must be mutually comparable by the specified comparator:comparator.compare(e1, e2)must not throw aClassCastExceptionfor any elementse1ande2in the set. If the user attempts to add an element to the set that violates this constraint, theaddcall will throw aClassCastException.- Parameters:
- comparator- the comparator that will be used to order this set. If- null, the natural ordering of the elements will be used.
 
 - 
TreeSetpublic TreeSet(Collection<? extends E> c) Constructs a new tree set containing the elements in the specified collection, sorted according to the natural ordering of its elements. All elements inserted into the set must implement theComparableinterface. Furthermore, all such elements must be mutually comparable:e1.compareTo(e2)must not throw aClassCastExceptionfor any elementse1ande2in the set.- Parameters:
- c- collection whose elements will comprise the new set
- Throws:
- ClassCastException- if the elements in- care not- Comparable, or are not mutually comparable
- NullPointerException- if the specified collection is null
 
 - 
TreeSetpublic TreeSet(SortedSet<E> s) Constructs a new tree set containing the same elements and using the same ordering as the specified sorted set.- Parameters:
- s- sorted set whose elements will comprise the new set
- Throws:
- NullPointerException- if the specified sorted set is null
 
 
- 
 - 
Method Detail- 
iteratorpublic Iterator<E> iterator() Returns an iterator over the elements in this set in ascending order.- Specified by:
- iteratorin interface- Collection<E>
- Specified by:
- iteratorin interface- Iterable<E>
- Specified by:
- iteratorin interface- NavigableSet<E>
- Specified by:
- iteratorin interface- Set<E>
- Specified by:
- iteratorin class- AbstractCollection<E>
- Returns:
- an iterator over the elements in this set in ascending order
 
 - 
descendingIteratorpublic Iterator<E> descendingIterator() Returns an iterator over the elements in this set in descending order.- Specified by:
- descendingIteratorin interface- NavigableSet<E>
- Returns:
- an iterator over the elements in this set in descending order
- Since:
- 1.6
 
 - 
descendingSetpublic NavigableSet<E> descendingSet() Description copied from interface:NavigableSetReturns a reverse order view of the elements contained in this set. The descending set is backed by this set, so changes to the set are reflected in the descending set, and vice-versa. If either set is modified while an iteration over either set is in progress (except through the iterator's ownremoveoperation), the results of the iteration are undefined.The returned set has an ordering equivalent to Collections.reverseOrder(comparator()). The expressions.descendingSet().descendingSet()returns a view ofsessentially equivalent tos.- Specified by:
- descendingSetin interface- NavigableSet<E>
- Returns:
- a reverse order view of this set
- Since:
- 1.6
 
 - 
sizepublic int size() Returns the number of elements in this set (its cardinality).
 - 
isEmptypublic boolean isEmpty() Returnstrueif this set contains no elements.- Specified by:
- isEmptyin interface- Collection<E>
- Specified by:
- isEmptyin interface- Set<E>
- Overrides:
- isEmptyin class- AbstractCollection<E>
- Returns:
- trueif this set contains no elements
 
 - 
containspublic boolean contains(Object o) Returnstrueif this set contains the specified element. More formally, returnstrueif and only if this set contains an elementesuch thatObjects.equals(o, e).- Specified by:
- containsin interface- Collection<E>
- Specified by:
- containsin interface- Set<E>
- Overrides:
- containsin class- AbstractCollection<E>
- Parameters:
- o- object to be checked for containment in this set
- Returns:
- trueif this set contains the specified element
- Throws:
- ClassCastException- if the specified object cannot be compared with the elements currently in the set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
 
 - 
addpublic boolean add(E e) Adds the specified element to this set if it is not already present. More formally, adds the specified elementeto this set if the set contains no elemente2such thatObjects.equals(e, e2). If this set already contains the element, the call leaves the set unchanged and returnsfalse.- Specified by:
- addin interface- Collection<E>
- Specified by:
- addin interface- Set<E>
- Overrides:
- addin class- AbstractCollection<E>
- Parameters:
- e- element to be added to this set
- Returns:
- trueif this set did not already contain the specified element
- Throws:
- ClassCastException- if the specified object cannot be compared with the elements currently in this set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
 
 - 
removepublic boolean remove(Object o) Removes the specified element from this set if it is present. More formally, removes an elementesuch thatObjects.equals(o, e), if this set contains such an element. Returnstrueif this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)- Specified by:
- removein interface- Collection<E>
- Specified by:
- removein interface- Set<E>
- Overrides:
- removein class- AbstractCollection<E>
- Parameters:
- o- object to be removed from this set, if present
- Returns:
- trueif this set contained the specified element
- Throws:
- ClassCastException- if the specified object cannot be compared with the elements currently in this set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
 
 - 
clearpublic void clear() Removes all of the elements from this set. The set will be empty after this call returns.- Specified by:
- clearin interface- Collection<E>
- Specified by:
- clearin interface- Set<E>
- Overrides:
- clearin class- AbstractCollection<E>
 
 - 
addAllpublic boolean addAll(Collection<? extends E> c) Adds all of the elements in the specified collection to this set.- Specified by:
- addAllin interface- Collection<E>
- Specified by:
- addAllin interface- Set<E>
- Overrides:
- addAllin class- AbstractCollection<E>
- Parameters:
- c- collection containing elements to be added to this set
- Returns:
- trueif this set changed as a result of the call
- Throws:
- ClassCastException- if the elements provided cannot be compared with the elements currently in the set
- NullPointerException- if the specified collection is null or if any element is null and this set uses natural ordering, or its comparator does not permit null elements
- See Also:
- AbstractCollection.add(Object)
 
 - 
subSetpublic NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements range fromfromElementtotoElement. IffromElementandtoElementare equal, the returned set is empty unlessfromInclusiveandtoInclusiveare both true. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.- Specified by:
- subSetin interface- NavigableSet<E>
- Parameters:
- fromElement- low endpoint of the returned set
- fromInclusive-- trueif the low endpoint is to be included in the returned view
- toElement- high endpoint of the returned set
- toInclusive-- trueif the high endpoint is to be included in the returned view
- Returns:
- a view of the portion of this set whose elements range from
         fromElement, inclusive, totoElement, exclusive
- Throws:
- ClassCastException- if- fromElementand- toElementcannot be compared to one another using this set's comparator (or, if the set has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if- fromElementor- toElementcannot be compared to elements currently in the set.
- NullPointerException- if- fromElementor- toElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if- fromElementis greater than- toElement; or if this set itself has a restricted range, and- fromElementor- toElementlies outside the bounds of the range.
- Since:
- 1.6
 
 - 
headSetpublic NavigableSet<E> headSet(E toElement, boolean inclusive) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements are less than (or equal to, ifinclusiveis true)toElement. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.- Specified by:
- headSetin interface- NavigableSet<E>
- Parameters:
- toElement- high endpoint of the returned set
- inclusive-- trueif the high endpoint is to be included in the returned view
- Returns:
- a view of the portion of this set whose elements are less than
         (or equal to, if inclusiveis true)toElement
- Throws:
- ClassCastException- if- toElementis not compatible with this set's comparator (or, if the set has no comparator, if- toElementdoes not implement- Comparable). Implementations may, but are not required to, throw this exception if- toElementcannot be compared to elements currently in the set.
- NullPointerException- if- toElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if this set itself has a restricted range, and- toElementlies outside the bounds of the range
- Since:
- 1.6
 
 - 
tailSetpublic NavigableSet<E> tailSet(E fromElement, boolean inclusive) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements are greater than (or equal to, ifinclusiveis true)fromElement. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.- Specified by:
- tailSetin interface- NavigableSet<E>
- Parameters:
- fromElement- low endpoint of the returned set
- inclusive-- trueif the low endpoint is to be included in the returned view
- Returns:
- a view of the portion of this set whose elements are greater
         than or equal to fromElement
- Throws:
- ClassCastException- if- fromElementis not compatible with this set's comparator (or, if the set has no comparator, if- fromElementdoes not implement- Comparable). Implementations may, but are not required to, throw this exception if- fromElementcannot be compared to elements currently in the set.
- NullPointerException- if- fromElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if this set itself has a restricted range, and- fromElementlies outside the bounds of the range
- Since:
- 1.6
 
 - 
subSetpublic SortedSet<E> subSet(E fromElement, E toElement) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements range fromfromElement, inclusive, totoElement, exclusive. (IffromElementandtoElementare equal, the returned set is empty.) The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.Equivalent to subSet(fromElement, true, toElement, false).- Specified by:
- subSetin interface- NavigableSet<E>
- Specified by:
- subSetin interface- SortedSet<E>
- Parameters:
- fromElement- low endpoint (inclusive) of the returned set
- toElement- high endpoint (exclusive) of the returned set
- Returns:
- a view of the portion of this set whose elements range from
         fromElement, inclusive, totoElement, exclusive
- Throws:
- ClassCastException- if- fromElementand- toElementcannot be compared to one another using this set's comparator (or, if the set has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if- fromElementor- toElementcannot be compared to elements currently in the set.
- NullPointerException- if- fromElementor- toElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if- fromElementis greater than- toElement; or if this set itself has a restricted range, and- fromElementor- toElementlies outside the bounds of the range
 
 - 
headSetpublic SortedSet<E> headSet(E toElement) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements are strictly less thantoElement. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.Equivalent to headSet(toElement, false).- Specified by:
- headSetin interface- NavigableSet<E>
- Specified by:
- headSetin interface- SortedSet<E>
- Parameters:
- toElement- high endpoint (exclusive) of the returned set
- Returns:
- a view of the portion of this set whose elements are strictly
         less than toElement
- Throws:
- ClassCastException- if- toElementis not compatible with this set's comparator (or, if the set has no comparator, if- toElementdoes not implement- Comparable). Implementations may, but are not required to, throw this exception if- toElementcannot be compared to elements currently in the set.
- NullPointerException- if- toElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if this set itself has a restricted range, and- toElementlies outside the bounds of the range
 
 - 
tailSetpublic SortedSet<E> tailSet(E fromElement) Description copied from interface:NavigableSetReturns a view of the portion of this set whose elements are greater than or equal tofromElement. The returned set is backed by this set, so changes in the returned set are reflected in this set, and vice-versa. The returned set supports all optional set operations that this set supports.The returned set will throw an IllegalArgumentExceptionon an attempt to insert an element outside its range.Equivalent to tailSet(fromElement, true).- Specified by:
- tailSetin interface- NavigableSet<E>
- Specified by:
- tailSetin interface- SortedSet<E>
- Parameters:
- fromElement- low endpoint (inclusive) of the returned set
- Returns:
- a view of the portion of this set whose elements are greater
         than or equal to fromElement
- Throws:
- ClassCastException- if- fromElementis not compatible with this set's comparator (or, if the set has no comparator, if- fromElementdoes not implement- Comparable). Implementations may, but are not required to, throw this exception if- fromElementcannot be compared to elements currently in the set.
- NullPointerException- if- fromElementis null and this set uses natural ordering, or its comparator does not permit null elements
- IllegalArgumentException- if this set itself has a restricted range, and- fromElementlies outside the bounds of the range
 
 - 
firstpublic E first() Description copied from interface:SortedSetReturns the first (lowest) element currently in this set.- Specified by:
- firstin interface- SortedSet<E>
- Returns:
- the first (lowest) element currently in this set
- Throws:
- NoSuchElementException- if this set is empty
 
 - 
lastpublic E last() Description copied from interface:SortedSetReturns the last (highest) element currently in this set.- Specified by:
- lastin interface- SortedSet<E>
- Returns:
- the last (highest) element currently in this set
- Throws:
- NoSuchElementException- if this set is empty
 
 - 
lowerpublic E lower(E e) Description copied from interface:NavigableSetReturns the greatest element in this set strictly less than the given element, ornullif there is no such element.- Specified by:
- lowerin interface- NavigableSet<E>
- Parameters:
- e- the value to match
- Returns:
- the greatest element less than e, ornullif there is no such element
- Throws:
- ClassCastException- if the specified element cannot be compared with the elements currently in the set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
- Since:
- 1.6
 
 - 
floorpublic E floor(E e) Description copied from interface:NavigableSetReturns the greatest element in this set less than or equal to the given element, ornullif there is no such element.- Specified by:
- floorin interface- NavigableSet<E>
- Parameters:
- e- the value to match
- Returns:
- the greatest element less than or equal to e, ornullif there is no such element
- Throws:
- ClassCastException- if the specified element cannot be compared with the elements currently in the set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
- Since:
- 1.6
 
 - 
ceilingpublic E ceiling(E e) Description copied from interface:NavigableSetReturns the least element in this set greater than or equal to the given element, ornullif there is no such element.- Specified by:
- ceilingin interface- NavigableSet<E>
- Parameters:
- e- the value to match
- Returns:
- the least element greater than or equal to e, ornullif there is no such element
- Throws:
- ClassCastException- if the specified element cannot be compared with the elements currently in the set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
- Since:
- 1.6
 
 - 
higherpublic E higher(E e) Description copied from interface:NavigableSetReturns the least element in this set strictly greater than the given element, ornullif there is no such element.- Specified by:
- higherin interface- NavigableSet<E>
- Parameters:
- e- the value to match
- Returns:
- the least element greater than e, ornullif there is no such element
- Throws:
- ClassCastException- if the specified element cannot be compared with the elements currently in the set
- NullPointerException- if the specified element is null and this set uses natural ordering, or its comparator does not permit null elements
- Since:
- 1.6
 
 - 
pollFirstpublic E pollFirst() Description copied from interface:NavigableSetRetrieves and removes the first (lowest) element, or returnsnullif this set is empty.- Specified by:
- pollFirstin interface- NavigableSet<E>
- Returns:
- the first element, or nullif this set is empty
- Since:
- 1.6
 
 - 
pollLastpublic E pollLast() Description copied from interface:NavigableSetRetrieves and removes the last (highest) element, or returnsnullif this set is empty.- Specified by:
- pollLastin interface- NavigableSet<E>
- Returns:
- the last element, or nullif this set is empty
- Since:
- 1.6
 
 - 
clonepublic Object clone() Returns a shallow copy of thisTreeSetinstance. (The elements themselves are not cloned.)
 - 
spliteratorpublic Spliterator<E> spliterator() Creates a late-binding and fail-fastSpliteratorover the elements in this set.The SpliteratorreportsSpliterator.SIZED,Spliterator.DISTINCT,Spliterator.SORTED, andSpliterator.ORDERED. Overriding implementations should document the reporting of additional characteristic values.The spliterator's comparator (see Spliterator.getComparator()) isnullif the tree set's comparator (seeSortedSet.comparator()) isnull. Otherwise, the spliterator's comparator is the same as or imposes the same total ordering as the tree set's comparator.- Specified by:
- spliteratorin interface- Collection<E>
- Specified by:
- spliteratorin interface- Iterable<E>
- Specified by:
- spliteratorin interface- Set<E>
- Specified by:
- spliteratorin interface- SortedSet<E>
- Returns:
- a Spliteratorover the elements in this set
- Since:
- 1.8
 
 
- 
 
-