public class ShortRBTreeSet extends AbstractShortSortedSet implements Serializable, Cloneable, ShortSortedSet
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 |
---|
ShortRBTreeSet()
Creates a new empty tree set.
|
ShortRBTreeSet(Collection<? extends Short> c)
Creates a new tree set copying a given collection.
|
ShortRBTreeSet(Comparator<? super Short> c)
Creates a new empty tree set with the given comparator.
|
ShortRBTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.
|
ShortRBTreeSet(short[] a)
Creates a new tree set copying the elements of an array.
|
ShortRBTreeSet(short[] a,
Comparator<? super Short> c)
Creates a new tree set copying the elements of an array using a given
Comparator . |
ShortRBTreeSet(short[] a,
int offset,
int length)
Creates a new tree set and fills it with the elements of a given array.
|
ShortRBTreeSet(short[] a,
int offset,
int length,
Comparator<? super Short> c)
Creates a new tree set and fills it with the elements of a given array using a given
Comparator . |
ShortRBTreeSet(ShortCollection c)
Creates a new tree set copying a given type-specific collection.
|
ShortRBTreeSet(ShortIterator i)
Creates a new tree set using elements provided by a type-specific iterator.
|
ShortRBTreeSet(ShortSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and its
Comparator ). |
ShortRBTreeSet(SortedSet<Short> s)
Creates a new tree set copying a given sorted set (and its
Comparator ). |
Modifier and Type | Method and Description |
---|---|
boolean |
add(short k) |
void |
clear() |
Object |
clone()
Returns a deep copy of this tree set.
|
ShortComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its elements' natural ordering.
|
boolean |
contains(short k) |
short |
firstShort() |
ShortSortedSet |
headSet(short to) |
boolean |
isEmpty() |
ShortBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
ShortBidirectionalIterator |
iterator(short from)
Returns a type-specific
BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
short |
lastShort() |
boolean |
remove(short k)
Removes an element from this set.
|
int |
size() |
ShortSortedSet |
subSet(short from,
short to) |
ShortSortedSet |
tailSet(short from) |
first, headSet, last, shortIterator, subSet, tailSet
equals, hashCode, rem, remove
add, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toShortArray, toShortArray, toString
headSet, shortIterator, subSet, tailSet
addAll, containsAll, rem, removeAll, retainAll, toArray, toArray, toShortArray, toShortArray
public ShortRBTreeSet()
public ShortRBTreeSet(Comparator<? super Short> c)
c
- a Comparator
(even better, a type-specific comparator).public ShortRBTreeSet(Collection<? extends Short> c)
c
- a collection to be copied into the new tree set.public ShortRBTreeSet(SortedSet<Short> s)
Comparator
).s
- a SortedSet
to be copied into the new tree set.public ShortRBTreeSet(ShortCollection c)
c
- a type-specific collection to be copied into the new tree set.public ShortRBTreeSet(ShortSortedSet s)
Comparator
).s
- a type-specific sorted set to be copied into the new tree set.public ShortRBTreeSet(ShortIterator i)
i
- a type-specific iterator whose elements will fill the set.public ShortRBTreeSet(Iterator<?> i)
i
- an iterator whose elements will fill the set.public ShortRBTreeSet(short[] a, int offset, int length, Comparator<? super Short> 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 ShortRBTreeSet(short[] 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 ShortRBTreeSet(short[] a)
a
- an array to be copied into the new tree set.public ShortRBTreeSet(short[] a, Comparator<? super Short> 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(short k)
add
in interface ShortCollection
add
in class AbstractShortCollection
Collection.add(Object)
public boolean remove(short k)
ShortSet
Note that the corresponding method of the type-specific collection is rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface ShortSet
remove
in class AbstractShortSet
Collection.remove(Object)
public boolean contains(short k)
contains
in interface ShortCollection
contains
in class AbstractShortCollection
Collection.contains(Object)
public void clear()
clear
in interface Collection<Short>
clear
in interface Set<Short>
clear
in class AbstractCollection<Short>
public int size()
size
in interface Collection<Short>
size
in interface Set<Short>
size
in class AbstractCollection<Short>
public boolean isEmpty()
isEmpty
in interface Collection<Short>
isEmpty
in interface Set<Short>
isEmpty
in class AbstractShortCollection
public short firstShort()
firstShort
in interface ShortSortedSet
SortedSet.first()
public short lastShort()
lastShort
in interface ShortSortedSet
SortedSet.last()
public ShortBidirectionalIterator iterator()
ShortCollection
Note that this specification strengthens the one given in
Iterable.iterator()
, which was already
strengthened in the corresponding type-specific class,
but was weakened by the fact that this interface extends Collection
.
iterator
in interface ShortCollection
iterator
in interface ShortIterable
iterator
in interface ShortSet
iterator
in interface ShortSortedSet
iterator
in interface Iterable<Short>
iterator
in interface Collection<Short>
iterator
in interface Set<Short>
iterator
in class AbstractShortSortedSet
public ShortBidirectionalIterator iterator(short from)
ShortSortedSet
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 ShortSortedSet
from
- an element to start from.public ShortComparator comparator()
ShortSortedSet
Note that this specification strengthens the one given in SortedSet.comparator()
.
comparator
in interface ShortSortedSet
comparator
in interface SortedSet<Short>
SortedSet.comparator()
public ShortSortedSet headSet(short to)
headSet
in interface ShortSortedSet
SortedSet.headSet(Object)
public ShortSortedSet tailSet(short from)
tailSet
in interface ShortSortedSet
SortedSet.tailSet(Object)
public ShortSortedSet subSet(short from, short to)
subSet
in interface ShortSortedSet
SortedSet.subSet(Object,Object)