Class ShortRBTreeSet
- java.lang.Object
-
- java.util.AbstractCollection<Short>
-
- it.unimi.dsi.fastutil.shorts.AbstractShortCollection
-
- it.unimi.dsi.fastutil.shorts.AbstractShortSet
-
- it.unimi.dsi.fastutil.shorts.AbstractShortSortedSet
-
- it.unimi.dsi.fastutil.shorts.ShortRBTreeSet
-
- All Implemented Interfaces:
ShortBidirectionalIterable
,ShortCollection
,ShortIterable
,ShortSet
,ShortSortedSet
,Serializable
,Cloneable
,Iterable<Short>
,Collection<Short>
,Set<Short>
,SortedSet<Short>
public class ShortRBTreeSet extends AbstractShortSortedSet implements Serializable, Cloneable, ShortSortedSet
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 byiterator()
can be safely cast to a type-specific list iterator.- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description ShortRBTreeSet()
Creates a new empty tree set.ShortRBTreeSet(short[] a)
Creates a new tree set copying the elements of an array.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 givenComparator
.ShortRBTreeSet(short[] a, Comparator<? super Short> c)
Creates a new tree set copying the elements of an array using a givenComparator
.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 itsComparator
).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(SortedSet<Short> s)
Creates a new tree set copying a given sorted set (and itsComparator
).
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description boolean
add(short k)
Ensures that this collection contains the specified element (optional operation).void
clear()
Object
clone()
Returns a deep copy of this tree set.ShortComparator
comparator()
boolean
contains(short k)
Returnstrue
if this collection contains the specified element.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 thantoElement
.boolean
isEmpty()
ShortBidirectionalIterator
iterator()
Returns a type-specific iterator on the elements of this collection.ShortBidirectionalIterator
iterator(short from)
Returns a type-specificBidirectionalIterator
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 fromfromElement
, inclusive, totoElement
, exclusive.ShortSortedSet
tailSet(short from)
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.-
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortSet
equals, hashCode, rem
-
Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShortCollection
add, addAll, addAll, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toShortArray, toShortArray, toString
-
Methods inherited from class java.util.AbstractCollection
toArray, toArray
-
Methods inherited from interface java.util.Collection
parallelStream, stream, toArray
-
Methods inherited from interface java.util.Set
add, addAll, contains, containsAll, equals, hashCode, remove, removeAll, retainAll, toArray, toArray
-
Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortCollection
addAll, containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toShortArray, toShortArray
-
Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortIterable
forEach, forEach
-
Methods inherited from interface it.unimi.dsi.fastutil.shorts.ShortSortedSet
first, headSet, last, subSet, tailSet
-
Methods inherited from interface java.util.SortedSet
spliterator
-
-
-
-
Constructor Detail
-
ShortRBTreeSet
public ShortRBTreeSet()
Creates a new empty tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(Comparator<? super Short> c)
Creates a new empty tree set with the given comparator.- Parameters:
c
- aComparator
(even better, a type-specific comparator).
-
ShortRBTreeSet
public ShortRBTreeSet(Collection<? extends Short> c)
Creates a new tree set copying a given collection.- Parameters:
c
- a collection to be copied into the new tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(SortedSet<Short> s)
Creates a new tree set copying a given sorted set (and itsComparator
).- Parameters:
s
- aSortedSet
to be copied into the new tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(ShortCollection c)
Creates a new tree set copying a given type-specific collection.- Parameters:
c
- a type-specific collection to be copied into the new tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(ShortSortedSet s)
Creates a new tree set copying a given type-specific sorted set (and itsComparator
).- Parameters:
s
- a type-specific sorted set to be copied into the new tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(ShortIterator i)
Creates a new tree set using elements provided by a type-specific iterator.- Parameters:
i
- a type-specific iterator whose elements will fill the set.
-
ShortRBTreeSet
public ShortRBTreeSet(Iterator<?> i)
Creates a new tree set using elements provided by an iterator.- Parameters:
i
- an iterator whose elements will fill the set.
-
ShortRBTreeSet
public 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 givenComparator
.- Parameters:
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
- aComparator
(even better, a type-specific comparator).
-
ShortRBTreeSet
public ShortRBTreeSet(short[] a, int offset, int length)
Creates a new tree set and fills it with the elements of a given array.- Parameters:
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.
-
ShortRBTreeSet
public ShortRBTreeSet(short[] a)
Creates a new tree set copying the elements of an array.- Parameters:
a
- an array to be copied into the new tree set.
-
ShortRBTreeSet
public ShortRBTreeSet(short[] a, Comparator<? super Short> c)
Creates a new tree set copying the elements of an array using a givenComparator
.- Parameters:
a
- an array to be copied into the new tree set.c
- aComparator
(even better, a type-specific comparator).
-
-
Method Detail
-
add
public boolean add(short k)
Description copied from class:AbstractShortCollection
Ensures that this collection contains the specified element (optional operation).This implementation always throws an
UnsupportedOperationException
.- Specified by:
add
in interfaceShortCollection
- Overrides:
add
in classAbstractShortCollection
- See Also:
Collection.add(Object)
-
remove
public boolean remove(short k)
Description copied from class:AbstractShortSet
Removes an element from this set.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 theList
interface. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceShortSet
- Overrides:
remove
in classAbstractShortSet
- See Also:
Collection.remove(Object)
-
contains
public boolean contains(short k)
Description copied from class:AbstractShortCollection
Returnstrue
if this collection contains the specified element.This implementation iterates over the elements in the collection, looking for the specified element.
- Specified by:
contains
in interfaceShortCollection
- Overrides:
contains
in classAbstractShortCollection
- See Also:
Collection.contains(Object)
-
clear
public void clear()
- Specified by:
clear
in interfaceCollection<Short>
- Specified by:
clear
in interfaceSet<Short>
- Overrides:
clear
in classAbstractCollection<Short>
-
size
public int size()
- Specified by:
size
in interfaceCollection<Short>
- Specified by:
size
in interfaceSet<Short>
- Specified by:
size
in classAbstractCollection<Short>
-
isEmpty
public boolean isEmpty()
- Specified by:
isEmpty
in interfaceCollection<Short>
- Specified by:
isEmpty
in interfaceSet<Short>
- Overrides:
isEmpty
in classAbstractCollection<Short>
-
firstShort
public short firstShort()
Description copied from interface:ShortSortedSet
Returns the first (lowest) element currently in this set.- Specified by:
firstShort
in interfaceShortSortedSet
- See Also:
SortedSet.first()
-
lastShort
public short lastShort()
Description copied from interface:ShortSortedSet
Returns the last (highest) element currently in this set.- Specified by:
lastShort
in interfaceShortSortedSet
- See Also:
SortedSet.last()
-
iterator
public ShortBidirectionalIterator iterator()
Description copied from interface:ShortCollection
Returns a type-specific iterator on the elements of this collection.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 extendsCollection
.- Specified by:
iterator
in interfaceCollection<Short>
- Specified by:
iterator
in interfaceIterable<Short>
- Specified by:
iterator
in interfaceSet<Short>
- Specified by:
iterator
in interfaceShortBidirectionalIterable
- Specified by:
iterator
in interfaceShortCollection
- Specified by:
iterator
in interfaceShortIterable
- Specified by:
iterator
in interfaceShortSet
- Specified by:
iterator
in interfaceShortSortedSet
- Specified by:
iterator
in classAbstractShortSortedSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
iterator
public ShortBidirectionalIterator iterator(short from)
Description copied from interface:ShortSortedSet
Returns a type-specificBidirectionalIterator
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 returnfalse
). 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 returnfalse
).Note that passing the last element of the set as starting point and calling
previous()
you can traverse the entire set in reverse order.- Specified by:
iterator
in interfaceShortSortedSet
- Parameters:
from
- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
public ShortComparator comparator()
Description copied from interface:ShortSortedSet
Note that this specification strengthens the one given in
SortedSet.comparator()
.- Specified by:
comparator
in interfaceShortSortedSet
- Specified by:
comparator
in interfaceSortedSet<Short>
-
headSet
public ShortSortedSet headSet(short to)
Description copied from interface:ShortSortedSet
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
headSet
in interfaceShortSortedSet
- See Also:
SortedSet.headSet(Object)
-
tailSet
public ShortSortedSet tailSet(short from)
Description copied from interface:ShortSortedSet
Returns a view of the portion of this sorted set whose elements are greater than or equal tofromElement
.Note that this specification strengthens the one given in
SortedSet.headSet(Object)
.- Specified by:
tailSet
in interfaceShortSortedSet
- See Also:
SortedSet.tailSet(Object)
-
subSet
public ShortSortedSet subSet(short from, short to)
Description copied from interface:ShortSortedSet
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.Note that this specification strengthens the one given in
SortedSet.subSet(Object,Object)
.- Specified by:
subSet
in interfaceShortSortedSet
- See Also:
SortedSet.subSet(Object,Object)
-
clone
public Object clone()
Returns a deep copy of this tree set.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.
- Returns:
- a deep copy of this tree set.
-
-