|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.shorts.AbstractShortCollection
it.unimi.dsi.fastutil.shorts.AbstractShortSet
it.unimi.dsi.fastutil.shorts.ShortRBTreeSet
A type-specific red-black tree set with a fast, small-footprint implementation.
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.
Field Summary | |
static long |
serialVersionUID
|
Constructor Summary | |
ShortRBTreeSet()
Creates a new empty tree set. |
|
ShortRBTreeSet(Collection c)
Creates a new tree set copying a given collection. |
|
ShortRBTreeSet(Comparator 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 c)
Creates a new tree set copying the elements of an 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 s)
Creates a new tree set copying a given sorted set (and its Comparator ). |
Method Summary | |
boolean |
add(short k)
|
void |
clear()
|
Object |
clone()
Returns a deep copy of this tree set. |
Comparator |
comparator()
|
boolean |
contains(short k)
|
Object |
first()
|
short |
firstShort()
|
SortedSet |
headSet(Object oto)
|
ShortSortedSet |
headSet(short to)
|
boolean |
isEmpty()
|
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). |
Object |
last()
|
short |
lastShort()
|
boolean |
remove(short k)
|
ShortIterator |
shortIterator()
Returns a type-specific iterator on the collection. |
int |
size()
|
SortedSet |
subSet(Object ofrom,
Object oto)
|
ShortSortedSet |
subSet(short from,
short to)
|
SortedSet |
tailSet(Object ofrom)
|
ShortSortedSet |
tailSet(short from)
|
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSet |
equals, hashCode |
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortCollection |
add, addAll, addAll, contains, containsAll, containsAll, iterator, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toShortArray, toShortArray, toString |
Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.Set |
add, addAll, contains, containsAll, equals, hashCode, iterator, remove, removeAll, retainAll, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortCollection |
addAll, containsAll, removeAll, retainAll, toArray, toShortArray, toShortArray |
Field Detail |
public static final long serialVersionUID
Constructor Detail |
public ShortRBTreeSet()
public ShortRBTreeSet(Comparator c)
c
- a Comparator
(even better, a type-specific comparator).public ShortRBTreeSet(Collection c)
public ShortRBTreeSet(SortedSet 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)
a
- an array to be copied into the new tree set.public ShortRBTreeSet(short[] a, Comparator c)
Comparator
.
a
- an array to be copied into the new tree set.c
- a Comparator
(even better, a type-specific comparator).Method Detail |
public final boolean add(short k)
add
in interface ShortCollection
add
in class AbstractShortCollection
public final boolean remove(short k)
remove
in interface ShortCollection
remove
in class AbstractShortCollection
public boolean contains(short k)
contains
in interface ShortCollection
Collection.contains(Object)
public void clear()
clear
in interface Set
public int size()
size
in interface Set
public boolean isEmpty()
isEmpty
in interface Set
isEmpty
in class AbstractShortCollection
public short firstShort()
firstShort
in interface ShortSortedSet
SortedSet.first()
public short lastShort()
lastShort
in interface ShortSortedSet
SortedSet.last()
public Object first()
first
in interface SortedSet
public Object last()
last
in interface SortedSet
public ShortIterator shortIterator()
ShortCollection
The iterator returned by the Collection.iterator()
method and by this
method are identical; however, using this method you can save a type casting.
shortIterator
in interface ShortCollection
Collection.iterator()
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
iterator
in class AbstractShortSet
public Comparator comparator()
comparator
in interface SortedSet
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)
public SortedSet headSet(Object oto)
headSet
in interface SortedSet
public SortedSet tailSet(Object ofrom)
tailSet
in interface SortedSet
public SortedSet subSet(Object ofrom, Object oto)
subSet
in interface SortedSet
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.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |