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.
boolean add(E e)
Adds the specified element to this set if it is not already present.
boolean addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this set.
E ceiling(E e)
Returns the least element in this set greater than or equal to the given element, or null if there is no such element.
void clear()
Removes all of the elements from this set.
Object clone()
Returns a shallow copy of this TreeSet instance.
boolean contains(Object o)
Returns true if 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.
E first()
Returns the first (lowest) element currently in this set.
E floor(E e)
Returns the greatest element in this set less than or equal to the given element, or null if there is no such element.
SortedSet<E> headSet(E toElement)
Returns a view of the portion of this set whose elements are strictly less than toElement.
NavigableSet<E> headSet(E toElement, boolean inclusive)
Returns a view of the portion of this set whose elements are less than (or equal to, if inclusive is true) toElement.
E higher(E e)
Returns the least element in this set strictly greater than the given element, or null if there is no such element.
boolean isEmpty()
Returns true if this set contains no elements.
Iterator<E> iterator()
Returns an iterator over the elements in this set in ascending order.
E last()
Returns the last (highest) element currently in this set.
E lower(E e)
Returns the greatest element in this set strictly less than the given element, or null if there is no such element.
E pollFirst()
Retrieves and removes the first (lowest) element, or returns null if this set is empty.
E pollLast()
Retrieves and removes the last (highest) element, or returns null if this set is empty.
boolean remove(Object o)
Removes the specified element from this set if it is present.
int size()
Returns the number of elements in this set (its cardinality).
Spliterator<E> spliterator()
Creates a
late-bindingand
fail-fastSpliterator
over 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 from fromElement to toElement.
SortedSet<E> subSet(E fromElement, E toElement)
Returns a view of the portion of this set whose elements range from fromElement, inclusive, to toElement, exclusive.
SortedSet<E> tailSet(E fromElement)
Returns a view of the portion of this set whose elements are greater than or equal to fromElement.
NavigableSet<E> tailSet(E fromElement, boolean inclusive)
Returns a view of the portion of this set whose elements are greater than (or equal to, if inclusive is true) fromElement.
equals, hashCode, removeAllcontainsAll, retainAll, toArray, toArray, toStringparallelStream, removeIf, stream, toArraycontainsAll, equals, hashCode, removeAll, retainAll, toArray, toArraycomparatorpublic TreeSet()
Constructs a new, empty tree set, sorted according to the natural ordering of its elements. All elements inserted into the set must implement the
Comparable
interface. Furthermore, all such elements must be
mutually comparable:
e1.compareTo(e2)
must not throw a
ClassCastException
for any elements
e1
and
e2
in 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), the
add
call will throw a
ClassCastException
.
public 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 a ClassCastException for any elements e1 and e2 in the set. If the user attempts to add an element to the set that violates this constraint, the add call will throw a ClassCastException.
comparator - the comparator that will be used to order this set. If null, the natural ordering of the elements will be used.
public TreeSet(Collection<? extends E> c)
Constructs a new tree set containing the elements in the specified collection, sorted according to the
natural orderingof its elements. All elements inserted into the set must implement the
Comparable
interface. Furthermore, all such elements must be
mutually comparable:
e1.compareTo(e2)
must not throw a
ClassCastException
for any elements
e1
and
e2
in the set.
c - collection whose elements will comprise the new set
ClassCastException - if the elements in c are not Comparable, or are not mutually comparable
NullPointerException - if the specified collection is null
public TreeSet(SortedSet<E> s)
Constructs a new tree set containing the same elements and using the same ordering as the specified sorted set.
s - sorted set whose elements will comprise the new set
NullPointerException - if the specified sorted set is null
public Iterator<E> iterator()
Returns an iterator over the elements in this set in ascending order.
iterator in interface Collection<E>
iterator in interface Iterable<E>
iterator in interface NavigableSet<E>
iterator in interface Set<E>
iterator in class AbstractCollection<E>
public Iterator<E> descendingIterator()
Returns an iterator over the elements in this set in descending order.
descendingIterator in interface NavigableSet<E>
public NavigableSet<E> descendingSet()
Returns 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 own
remove
operation), the results of the iteration are undefined.
The returned set has an ordering equivalent to Collections.reverseOrder(comparator()). The expression s.descendingSet().descendingSet() returns a view of s essentially equivalent to s.
descendingSet in interface NavigableSet<E>
public int size()
Returns the number of elements in this set (its cardinality).
public boolean isEmpty()
Returns true if this set contains no elements.
isEmpty in interface Collection<E>
isEmpty in interface Set<E>
isEmpty in class AbstractCollection<E>
true if this set contains no elements
public boolean contains(Object o)
Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).
contains in interface Collection<E>
contains in interface Set<E>
contains in class AbstractCollection<E>
o - object to be checked for containment in this set
true if this set contains the specified element
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
public boolean add(E e)
Adds the specified element to this set if it is not already present. More formally, adds the specified element e to this set if the set contains no element e2 such that Objects.equals(e, e2). If this set already contains the element, the call leaves the set unchanged and returns false.
add in interface Collection<E>
add in interface Set<E>
add in class AbstractCollection<E>
e - element to be added to this set
true if this set did not already contain the specified element
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
public boolean remove(Object o)
Removes the specified element from this set if it is present. More formally, removes an element e such that Objects.equals(o, e), if this set contains such an element. Returns true if 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.)
remove in interface Collection<E>
remove in interface Set<E>
remove in class AbstractCollection<E>
o - object to be removed from this set, if present
true if this set contained the specified element
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
public void clear()
Removes all of the elements from this set. The set will be empty after this call returns.
clear in interface Collection<E>
clear in interface Set<E>
clear in class AbstractCollection<E>
public boolean addAll(Collection<? extends E> c)
Adds all of the elements in the specified collection to this set.
addAll in interface Collection<E>
addAll in interface Set<E>
addAll in class AbstractCollection<E>
c - collection containing elements to be added to this set
true if this set changed as a result of the call
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
AbstractCollection.add(Object)
public NavigableSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, boolean toInclusive)
Returns a view of the portion of this set whose elements range from
fromElement
to
toElement
. If
fromElement
and
toElement
are equal, the returned set is empty unless
fromInclusive
and
toInclusive
are 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 IllegalArgumentException on an attempt to insert an element outside its range.
subSet in interface NavigableSet<E>
fromElement - low endpoint of the returned set
fromInclusive - true if the low endpoint is to be included in the returned view
toElement - high endpoint of the returned set
toInclusive - true if the high endpoint is to be included in the returned view
fromElement, inclusive, to toElement, exclusive
ClassCastException - if fromElement and toElement cannot 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 fromElement or toElement cannot be compared to elements currently in the set.
NullPointerException - if fromElement or toElement is null and this set uses natural ordering, or its comparator does not permit null elements
IllegalArgumentException - if fromElement is greater than toElement; or if this set itself has a restricted range, and fromElement or toElement lies outside the bounds of the range.
public NavigableSet<E> headSet(E toElement, boolean inclusive)
Returns a view of the portion of this set whose elements are less than (or equal to, if
inclusive
is 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 IllegalArgumentException on an attempt to insert an element outside its range.
headSet in interface NavigableSet<E>
toElement - high endpoint of the returned set
inclusive - true if the high endpoint is to be included in the returned view
inclusive is true) toElement
ClassCastException - if toElement is not compatible with this set's comparator (or, if the set has no comparator, if toElement does not implement Comparable). Implementations may, but are not required to, throw this exception if toElement cannot be compared to elements currently in the set.
NullPointerException - if toElement is 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 toElement lies outside the bounds of the range
public NavigableSet<E> tailSet(E fromElement, boolean inclusive)
Returns a view of the portion of this set whose elements are greater than (or equal to, if
inclusive
is 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 IllegalArgumentException on an attempt to insert an element outside its range.
tailSet in interface NavigableSet<E>
fromElement - low endpoint of the returned set
inclusive - true if the low endpoint is to be included in the returned view
fromElement
ClassCastException - if fromElement is not compatible with this set's comparator (or, if the set has no comparator, if fromElement does not implement Comparable). Implementations may, but are not required to, throw this exception if fromElement cannot be compared to elements currently in the set.
NullPointerException - if fromElement is 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 fromElement lies outside the bounds of the range
public SortedSet<E> subSet(E fromElement, E toElement)
Returns a view of the portion of this set whose elements range from
fromElement
, inclusive, to
toElement
, exclusive. (If
fromElement
and
toElement
are 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 IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to subSet(fromElement, true, toElement, false).
subSet in interface NavigableSet<E>
subSet in interface SortedSet<E>
fromElement - low endpoint (inclusive) of the returned set
toElement - high endpoint (exclusive) of the returned set
fromElement, inclusive, to toElement, exclusive
ClassCastException - if fromElement and toElement cannot 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 fromElement or toElement cannot be compared to elements currently in the set.
NullPointerException - if fromElement or toElement is null and this set uses natural ordering, or its comparator does not permit null elements
IllegalArgumentException - if fromElement is greater than toElement; or if this set itself has a restricted range, and fromElement or toElement lies outside the bounds of the range
public SortedSet<E> headSet(E toElement)
Returns a view of the portion of this set whose elements are strictly less than
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 IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to headSet(toElement, false).
headSet in interface NavigableSet<E>
headSet in interface SortedSet<E>
toElement - high endpoint (exclusive) of the returned set
toElement
ClassCastException - if toElement is not compatible with this set's comparator (or, if the set has no comparator, if toElement does not implement Comparable). Implementations may, but are not required to, throw this exception if toElement cannot be compared to elements currently in the set.
NullPointerException - if toElement is 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 toElement lies outside the bounds of the range
public SortedSet<E> tailSet(E fromElement)
Returns a view of the portion of this set whose elements are greater than or equal to
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 IllegalArgumentException on an attempt to insert an element outside its range.
Equivalent to tailSet(fromElement, true).
tailSet in interface NavigableSet<E>
tailSet in interface SortedSet<E>
fromElement - low endpoint (inclusive) of the returned set
fromElement
ClassCastException - if fromElement is not compatible with this set's comparator (or, if the set has no comparator, if fromElement does not implement Comparable). Implementations may, but are not required to, throw this exception if fromElement cannot be compared to elements currently in the set.
NullPointerException - if fromElement is 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 fromElement lies outside the bounds of the range
public E first()
Returns the first (lowest) element currently in this set.
first in interface SortedSet<E>
NoSuchElementException - if this set is empty
public E last()
Returns the last (highest) element currently in this set.
last in interface SortedSet<E>
NoSuchElementException - if this set is empty
public E lower(E e)
Returns the greatest element in this set strictly less than the given element, or null if there is no such element.
lower in interface NavigableSet<E>
e - the value to match
e, or null if there is no such element
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
public E floor(E e)
Returns the greatest element in this set less than or equal to the given element, or null if there is no such element.
floor in interface NavigableSet<E>
e - the value to match
e, or null if there is no such element
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
public E ceiling(E e)
Returns the least element in this set greater than or equal to the given element, or null if there is no such element.
ceiling in interface NavigableSet<E>
e - the value to match
e, or null if there is no such element
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
public E higher(E e)
Returns the least element in this set strictly greater than the given element, or null if there is no such element.
higher in interface NavigableSet<E>
e - the value to match
e, or null if there is no such element
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
public E pollFirst()
Retrieves and removes the first (lowest) element, or returns null if this set is empty.
pollFirst in interface NavigableSet<E>
null if this set is empty
public E pollLast()
Retrieves and removes the last (highest) element, or returns null if this set is empty.
pollLast in interface NavigableSet<E>
null if this set is empty
public Object clone()
Returns a shallow copy of this TreeSet instance. (The elements themselves are not cloned.)
public Spliterator<E> spliterator()
spliterator in interface Collection<E>
spliterator in interface Iterable<E>
spliterator in interface Set<E>
spliterator in interface SortedSet<E>
Spliterator over the elements in this set
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4