public class ShortRBTreeSet extends AbstractShortSortedSet implements java.io.Serializable, java.lang.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.
| Modifier and Type | Field and Description |
|---|---|
protected it.unimi.dsi.fastutil.shorts.ShortComparator |
actualComparator
This set's actual comparator; it may differ from
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping. |
protected int |
count
Number of elements in this set.
|
protected it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry |
firstEntry
The entry of the first element of this set.
|
protected it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry |
lastEntry
The entry of the last element of this set.
|
protected java.util.Comparator<? super java.lang.Short> |
storedComparator
This set's comparator, as provided in the constructor.
|
protected it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry |
tree
A reference to the root entry.
|
| Constructor and Description |
|---|
ShortRBTreeSet()
Creates a new empty tree set.
|
ShortRBTreeSet(java.util.Collection<? extends java.lang.Short> c)
Creates a new tree set copying a given collection.
|
ShortRBTreeSet(java.util.Comparator<? super java.lang.Short> c)
Creates a new empty tree set with the given comparator.
|
ShortRBTreeSet(java.util.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,
java.util.Comparator<? super java.lang.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,
java.util.Comparator<? super java.lang.Short> c)
Creates a new tree set and fills it with the elements of a given array using a given
Comparator. |
ShortRBTreeSet(it.unimi.dsi.fastutil.shorts.ShortCollection c)
Creates a new tree set copying a given type-specific collection.
|
ShortRBTreeSet(it.unimi.dsi.fastutil.shorts.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(java.util.SortedSet<java.lang.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() |
java.lang.Object |
clone()
Returns a deep copy of this tree set.
|
it.unimi.dsi.fastutil.shorts.ShortComparator |
comparator() |
boolean |
contains(short k) |
short |
firstShort()
Returns the first (lowest) element currently in this set.
|
ShortSortedSet |
headSet(short to)
Returns a view of the portion of this sorted set whose elements are strictly less than
toElement. |
boolean |
isEmpty() |
it.unimi.dsi.fastutil.shorts.ShortBidirectionalIterator |
iterator()
Returns a type-specific iterator on the elements of this set.
|
it.unimi.dsi.fastutil.shorts.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()
Returns the last (highest) element currently in this set.
|
boolean |
remove(short k)
Removes an element from this set.
|
int |
size() |
ShortSortedSet |
subSet(short from,
short to)
Returns a view of the portion of this sorted set whose elements range from
fromElement, inclusive, to toElement, exclusive. |
ShortSortedSet |
tailSet(short from)
Returns a view of the portion of this sorted set whose elements are greater than or equal to
fromElement. |
equals, hashCode, remadd, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toShortArray, toShortArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitfirst, headSet, last, spliterator, subSet, tailSetadd, contains, of, of, of, of, of, rem, removeaddAll, containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toShortArray, toShortArrayprotected transient it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry tree
protected int count
protected transient it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry firstEntry
protected transient it.unimi.dsi.fastutil.shorts.ShortRBTreeSet.Entry lastEntry
protected java.util.Comparator<? super java.lang.Short> storedComparator
protected transient it.unimi.dsi.fastutil.shorts.ShortComparator actualComparator
storedComparator because it is
always a type-specific comparator, so it could be derived from the former by wrapping.public ShortRBTreeSet()
public ShortRBTreeSet(java.util.Comparator<? super java.lang.Short> c)
c - a Comparator (even better, a type-specific comparator).public ShortRBTreeSet(java.util.Collection<? extends java.lang.Short> c)
c - a collection to be copied into the new tree set.public ShortRBTreeSet(java.util.SortedSet<java.lang.Short> s)
Comparator).s - a SortedSet to be copied into the new tree set.public ShortRBTreeSet(it.unimi.dsi.fastutil.shorts.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(it.unimi.dsi.fastutil.shorts.ShortIterator i)
i - a type-specific iterator whose elements will fill the set.public ShortRBTreeSet(java.util.Iterator<?> i)
i - an iterator whose elements will fill the set.public ShortRBTreeSet(short[] a,
int offset,
int length,
java.util.Comparator<? super java.lang.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,
java.util.Comparator<? super java.lang.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 it.unimi.dsi.fastutil.shorts.ShortCollectionadd in class it.unimi.dsi.fastutil.shorts.AbstractShortCollectionpublic boolean remove(short k)
AbstractShortSetrem() method
implemented by type-specific abstract Collection superclass.remove in interface ShortSetremove in class AbstractShortSetCollection.remove(Object)public boolean contains(short k)
contains in interface it.unimi.dsi.fastutil.shorts.ShortCollectioncontains in class it.unimi.dsi.fastutil.shorts.AbstractShortCollectionpublic void clear()
clear in interface java.util.Collection<java.lang.Short>clear in interface java.util.Set<java.lang.Short>clear in class java.util.AbstractCollection<java.lang.Short>public int size()
size in interface java.util.Collection<java.lang.Short>size in interface java.util.Set<java.lang.Short>size in class java.util.AbstractCollection<java.lang.Short>public boolean isEmpty()
isEmpty in interface java.util.Collection<java.lang.Short>isEmpty in interface java.util.Set<java.lang.Short>isEmpty in class java.util.AbstractCollection<java.lang.Short>public short firstShort()
ShortSortedSetfirstShort in interface ShortSortedSetSortedSet.first()public short lastShort()
ShortSortedSetlastShort in interface ShortSortedSetSortedSet.last()public it.unimi.dsi.fastutil.shorts.ShortBidirectionalIterator iterator()
ShortSetiterator in interface it.unimi.dsi.fastutil.shorts.ShortBidirectionalIterableiterator in interface it.unimi.dsi.fastutil.shorts.ShortCollectioniterator in interface it.unimi.dsi.fastutil.shorts.ShortIterableiterator in interface ShortSetiterator in interface ShortSortedSetiterator in interface java.lang.Iterable<java.lang.Short>iterator in interface java.util.Collection<java.lang.Short>iterator in interface java.util.Set<java.lang.Short>iterator in class AbstractShortSortedSetpublic it.unimi.dsi.fastutil.shorts.ShortBidirectionalIterator iterator(short from)
ShortSortedSetBidirectionalIterator 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 ShortSortedSetfrom - an element to start from.public it.unimi.dsi.fastutil.shorts.ShortComparator comparator()
ShortSortedSetcomparator in interface ShortSortedSetcomparator in interface java.util.SortedSet<java.lang.Short>public ShortSortedSet headSet(short to)
ShortSortedSettoElement.headSet in interface ShortSortedSetSortedSet.headSet(Object)public ShortSortedSet tailSet(short from)
ShortSortedSetfromElement.tailSet in interface ShortSortedSetSortedSet.tailSet(Object)public ShortSortedSet subSet(short from, short to)
ShortSortedSetfromElement, inclusive, to toElement, exclusive.subSet in interface ShortSortedSetSortedSet.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