public class IntAVLTreeSet extends AbstractIntSortedSet implements java.io.Serializable, java.lang.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 |
---|
IntAVLTreeSet()
Creates a new empty tree set.
|
IntAVLTreeSet(java.util.Collection<? extends java.lang.Integer> c)
Creates a new tree set copying a given set.
|
IntAVLTreeSet(java.util.Comparator<? super java.lang.Integer> c)
Creates a new empty tree set with the given comparator.
|
IntAVLTreeSet(int[] a)
Creates a new tree set copying the elements of an array.
|
IntAVLTreeSet(int[] a,
java.util.Comparator<? super java.lang.Integer> c)
Creates a new tree set copying the elements of an array using a given
Comparator . |
IntAVLTreeSet(int[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
IntAVLTreeSet(int[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.Integer> c)
Creates a new tree set and fills it with the elements of a given array using a given
Comparator . |
IntAVLTreeSet(IntCollection c)
Creates a new tree set copying a given type-specific collection.
|
IntAVLTreeSet(IntIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
IntAVLTreeSet(IntSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator ). |
IntAVLTreeSet(java.util.Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
IntAVLTreeSet(java.util.SortedSet<java.lang.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() |
java.lang.Object |
clone()
Returns a deep copy of this tree set.
|
IntComparator |
comparator() |
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() |
IntBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of 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() |
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, rem
add, addAll, addAll, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toIntArray, toIntArray, toString
first, headSet, last, spliterator, subSet, tailSet
add, contains, of, of, of, of, of, rem, remove
addAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toIntArray, toIntArray
forEach, forEach, forEach
public IntAVLTreeSet()
public IntAVLTreeSet(java.util.Comparator<? super java.lang.Integer> c)
c
- a Comparator
(even better, a type-specific comparator).public IntAVLTreeSet(java.util.Collection<? extends java.lang.Integer> c)
c
- a collection to be copied into the new tree set.public IntAVLTreeSet(java.util.SortedSet<java.lang.Integer> s)
Comparator
).s
- a SortedSet
to be copied into the new tree set.public IntAVLTreeSet(IntCollection c)
c
- a type-specific collection to be copied into the new tree set.public IntAVLTreeSet(IntSortedSet s)
Comparator
).s
- a type-specific sorted set to be copied into the new tree set.public IntAVLTreeSet(IntIterator i)
i
- a type-specific iterator whose elements will fill the set.public IntAVLTreeSet(java.util.Iterator<?> i)
i
- an iterator whose elements will fill the set.public IntAVLTreeSet(int[] a, int offset, int length, java.util.Comparator<? super java.lang.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 IntAVLTreeSet(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 IntAVLTreeSet(int[] a)
a
- an array to be copied into the new tree set.public IntAVLTreeSet(int[] a, java.util.Comparator<? super java.lang.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
add
in interface IntCollection
add
in class AbstractIntCollection
Collection.add(Object)
public boolean remove(int k)
AbstractIntSet
rem()
method
implemented by type-specific abstract Collection
superclass.remove
in interface IntSet
remove
in class AbstractIntSet
Collection.remove(Object)
public boolean contains(int k)
AbstractIntCollection
true
if this collection contains the specified element.contains
in interface IntCollection
contains
in class AbstractIntCollection
Collection.contains(Object)
public void clear()
clear
in interface java.util.Collection<java.lang.Integer>
clear
in interface java.util.Set<java.lang.Integer>
clear
in class java.util.AbstractCollection<java.lang.Integer>
public int size()
size
in interface java.util.Collection<java.lang.Integer>
size
in interface java.util.Set<java.lang.Integer>
size
in class java.util.AbstractCollection<java.lang.Integer>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<java.lang.Integer>
isEmpty
in interface java.util.Set<java.lang.Integer>
isEmpty
in class java.util.AbstractCollection<java.lang.Integer>
public int firstInt()
IntSortedSet
firstInt
in interface IntSortedSet
SortedSet.first()
public int lastInt()
IntSortedSet
lastInt
in interface IntSortedSet
SortedSet.last()
public IntBidirectionalIterator iterator()
IntCollection
iterator
in interface IntBidirectionalIterable
iterator
in interface IntCollection
iterator
in interface IntIterable
iterator
in interface IntSet
iterator
in interface IntSortedSet
iterator
in interface java.lang.Iterable<java.lang.Integer>
iterator
in interface java.util.Collection<java.lang.Integer>
iterator
in interface java.util.Set<java.lang.Integer>
iterator
in class AbstractIntSortedSet
Iterable.iterator()
public IntBidirectionalIterator iterator(int from)
IntSortedSet
BidirectionalIterator
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 IntSortedSet
from
- an element to start from.public IntComparator comparator()
IntSortedSet
comparator
in interface IntSortedSet
comparator
in interface java.util.SortedSet<java.lang.Integer>
public IntSortedSet headSet(int to)
IntSortedSet
toElement
.headSet
in interface IntSortedSet
SortedSet.headSet(Object)
public IntSortedSet tailSet(int from)
IntSortedSet
fromElement
.tailSet
in interface IntSortedSet
SortedSet.tailSet(Object)
public IntSortedSet subSet(int from, int to)
IntSortedSet
fromElement
, inclusive, to toElement
, exclusive.subSet
in interface IntSortedSet
SortedSet.subSet(Object,Object)
public java.lang.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.
clone
in class java.lang.Object