public class IntRBTreeSet extends AbstractIntSortedSet implements Serializable, Cloneable, IntSortedSet
The iterators provided by this class are type-specific
bidirectional iterators.
Moreover, the iterator returned by iterator() can be safely cast to a
type-specific list iterator.
| Constructor and Description |
|---|
IntRBTreeSet()
Creates a new empty tree set.
|
IntRBTreeSet(Collection<? extends Integer> c)
Creates a new tree set copying a given collection.
|
IntRBTreeSet(Comparator<? super Integer> c)
Creates a new empty tree set with the given comparator.
|
IntRBTreeSet(int[] a)
Creates a new tree set copying the elements of an array.
|
IntRBTreeSet(int[] a,
Comparator<? super Integer> c)
Creates a new tree set copying the elements of an array using a given
Comparator. |
IntRBTreeSet(int[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
IntRBTreeSet(int[] a,
int offset,
int length,
Comparator<? super Integer> c)
Creates a new tree set and fills it with the elements of a given array
using a given
Comparator. |
IntRBTreeSet(IntCollection c)
Creates a new tree set copying a given type-specific collection.
|
IntRBTreeSet(IntIterator i)
Creates a new tree set using elements provided by a type-specific
iterator.
|
IntRBTreeSet(IntSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator). |
IntRBTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
IntRBTreeSet(SortedSet<Integer> s)
Creates a new tree set copying a given sorted set (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int k)
Ensures that this collection contains the specified element (optional
operation).
|
void |
clear()
Removes all of the elements from this collection (optional operation).
|
Object |
clone()
Returns a deep copy of this tree set.
|
IntComparator |
comparator()
Returns the comparator used to order the elements in this set,
or null if this set uses the natural ordering of its elements.
|
boolean |
contains(int k)
Returns
true if this collection contains the specified element. |
int |
firstInt()
Returns the first (lowest) element currently in this set.
|
IntSortedSet |
headSet(int to)
Returns a view of the portion of this sorted set whose elements are
strictly less than
toElement. |
boolean |
isEmpty()
Returns true if this collection contains no elements.
|
IntBidirectionalIterator |
iterator()
Returns an iterator over the elements contained in this collection.
|
IntBidirectionalIterator |
iterator(int from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation). |
int |
lastInt()
Returns the last (highest) element currently in this set.
|
boolean |
remove(int k)
Removes an element from this set.
|
int |
size()
Returns the number of elements in this collection.
|
IntSortedSet |
subSet(int from,
int to)
Returns a view of the portion of this sorted set whose elements range
from
fromElement, inclusive, to toElement, exclusive. |
IntSortedSet |
tailSet(int from)
Returns a view of the portion of this sorted set whose elements are
greater than or equal to
fromElement. |
equals, hashCode, remadd, addAll, contains, containsAll, remove, removeAll, retainAll, toArray, toIntArray, toIntArray, toStringaddAll, containsAll, removeAll, retainAll, toArray, toArrayfirst, headSet, last, subSet, tailSetaddAll, containsAll, removeAll, retainAll, toArray, toIntArray, toIntArrayforEach, forEachspliteratoraddAll, containsAll, equals, hashCode, removeAll, retainAll, toArray, toArrayparallelStream, removeIf, streampublic IntRBTreeSet()
public IntRBTreeSet(Comparator<? super Integer> c)
c - a Comparator (even better, a type-specific
comparator).public IntRBTreeSet(Collection<? extends Integer> c)
c - a collection to be copied into the new tree set.public IntRBTreeSet(SortedSet<Integer> s)
Comparator).s - a SortedSet to be copied into the new tree set.public IntRBTreeSet(IntCollection c)
c - a type-specific collection to be copied into the new tree set.public IntRBTreeSet(IntSortedSet s)
Comparator).s - a type-specific sorted set to be copied into the new tree set.public IntRBTreeSet(IntIterator i)
i - a type-specific iterator whose elements will fill the set.public IntRBTreeSet(Iterator<?> i)
i - an iterator whose elements will fill the set.public IntRBTreeSet(int[] a,
int offset,
int length,
Comparator<? super Integer> c)
Comparator.a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.c - a Comparator (even better, a type-specific
comparator).public IntRBTreeSet(int[] a,
int offset,
int length)
a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.public IntRBTreeSet(int[] a)
a - an array to be copied into the new tree set.public IntRBTreeSet(int[] a,
Comparator<? super Integer> c)
Comparator.a - an array to be copied into the new tree set.c - a Comparator (even better, a type-specific
comparator).public boolean add(int k)
AbstractIntCollection
This implementation always throws an
UnsupportedOperationException.
add in interface IntCollectionadd in class AbstractIntCollectionCollection.add(Object)public boolean remove(int k)
AbstractIntSet
Note that the corresponding method of a type-specific collection is
rem(). This unfortunate situation is caused by the clash with the
similarly named index-based method in the List
interface. Delegates to the type-specific rem() method
implemented by type-specific abstract Collection
superclass.
remove in interface IntSetremove in class AbstractIntSetCollection.remove(Object)public boolean contains(int k)
AbstractIntCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface IntCollectioncontains in class AbstractIntCollectionCollection.contains(Object)public void clear()
java.util.AbstractCollectionThis implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
clear in interface Collection<Integer>clear in interface Set<Integer>clear in class AbstractCollection<Integer>public int size()
java.util.Collectionsize in interface Collection<Integer>size in interface Set<Integer>size in class AbstractCollection<Integer>public boolean isEmpty()
java.util.AbstractCollectionThis implementation returns size() == 0.
isEmpty in interface Collection<Integer>isEmpty in interface Set<Integer>isEmpty in class AbstractCollection<Integer>public int firstInt()
IntSortedSetfirstInt in interface IntSortedSetSortedSet.first()public int lastInt()
IntSortedSetlastInt in interface IntSortedSetSortedSet.last()public IntBidirectionalIterator iterator()
java.util.AbstractCollectioniterator in interface IntBidirectionalIterableiterator in interface IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface IntSortedSetiterator in interface Iterable<Integer>iterator in interface Collection<Integer>iterator in interface Set<Integer>iterator in class AbstractIntSortedSetIterable.iterator()public IntBidirectionalIterator iterator(int from)
IntSortedSetBidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional
operation).
This method returns a type-specific bidirectional iterator with given
starting point. The starting point is any element comparable to the
elements of this set (even if it does not actually belong to the set).
The next element of the returned iterator is the least element of the set
that is greater than the starting point (if there are no elements greater
than the starting point,
hasNext()
will return false). The previous element of the returned iterator
is the greatest element of the set that is smaller than or equal to the
starting point (if there are no elements smaller than or equal to the
starting point,
hasPrevious() will return false).
Note that passing the last element of the set as starting point and
calling previous() you can traverse the entire set in reverse order.
iterator in interface IntSortedSetfrom - an element to start from.public IntComparator comparator()
IntSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator().
comparator in interface IntSortedSetcomparator in interface SortedSet<Integer>public IntSortedSet headSet(int to)
IntSortedSettoElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
headSet in interface IntSortedSetSortedSet.headSet(Object)public IntSortedSet tailSet(int from)
IntSortedSetfromElement.
Note that this specification strengthens the one given in
SortedSet.headSet(Object).
tailSet in interface IntSortedSetSortedSet.tailSet(Object)public IntSortedSet subSet(int from, int to)
IntSortedSetfromElement, inclusive, to toElement, exclusive.
Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object).
subSet in interface IntSortedSetSortedSet.subSet(Object,Object)public Object clone()
This method performs a deep copy of this tree set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.