|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<K>
it.unimi.dsi.fastutil.objects.AbstractReferenceCollection<K>
it.unimi.dsi.fastutil.objects.ReferenceCollections.EmptyCollection<K>
it.unimi.dsi.fastutil.objects.ReferenceSets.EmptySet<K>
it.unimi.dsi.fastutil.objects.ReferenceSortedSets.EmptySet<K>
public static class ReferenceSortedSets.EmptySet<K>
An immutable class representing the empty sorted set and implementing a type-specific set interface.
This class may be useful to implement your own in case you subclass a type-specific sorted set.
Method Summary | |
---|---|
java.lang.Object |
clone()
|
java.util.Comparator<? super K> |
comparator()
|
K |
first()
|
ReferenceSortedSet<K> |
headSet(K from)
Returns a view of the portion of this sorted set whose elements are strictly less than toElement . |
ObjectBidirectionalIterator<K> |
iterator(K from)
Returns a type-specific BidirectionalIterator on the elements in
this set, starting from a given element of the domain (optional operation). |
K |
last()
|
ObjectBidirectionalIterator<K> |
objectIterator()
Deprecated. |
boolean |
remove(java.lang.Object ok)
Removes an element from this set. |
ReferenceSortedSet<K> |
subSet(K from,
K to)
Returns a view of the portion of this sorted set whose elements range from fromElement , inclusive, to toElement , exclusive. |
ReferenceSortedSet<K> |
tailSet(K to)
Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement . |
Methods inherited from class it.unimi.dsi.fastutil.objects.ReferenceCollections.EmptyCollection |
---|
add, clear, contains, equals, hashCode, iterator, size, toArray, toArray |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceCollection |
---|
addAll, containsAll, isEmpty, removeAll, retainAll, toString |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ReferenceSortedSet |
---|
iterator |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ReferenceCollection |
---|
toArray |
Methods inherited from interface java.util.Set |
---|
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray |
Method Detail |
---|
public boolean remove(java.lang.Object ok)
ReferenceSet
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 ReferenceSet<K>
remove
in interface java.util.Collection<K>
remove
in interface java.util.Set<K>
remove
in class ReferenceSets.EmptySet<K>
Collection.remove(Object)
@Deprecated public ObjectBidirectionalIterator<K> objectIterator()
AbstractReferenceCollection
objectIterator
in interface ReferenceCollection<K>
objectIterator
in interface ReferenceSortedSet<K>
objectIterator
in class AbstractReferenceCollection<K>
ReferenceCollection.iterator()
public ObjectBidirectionalIterator<K> iterator(K from)
ReferenceSortedSet
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 ReferenceSortedSet<K>
from
- an element to start from.
public ReferenceSortedSet<K> subSet(K from, K to)
ReferenceSortedSet
fromElement
, inclusive, to toElement
, exclusive.
Note that this specification strengthens the one given in SortedSet.subSet(Object,Object)
.
subSet
in interface ReferenceSortedSet<K>
subSet
in interface java.util.SortedSet<K>
SortedSet.subSet(Object,Object)
public ReferenceSortedSet<K> headSet(K from)
ReferenceSortedSet
toElement
.
Note that this specification strengthens the one given in SortedSet.headSet(Object)
.
headSet
in interface ReferenceSortedSet<K>
headSet
in interface java.util.SortedSet<K>
SortedSet.headSet(Object)
public ReferenceSortedSet<K> tailSet(K to)
ReferenceSortedSet
fromElement
.
Note that this specification strengthens the one given in SortedSet.tailSet(Object)
.
tailSet
in interface ReferenceSortedSet<K>
tailSet
in interface java.util.SortedSet<K>
SortedSet.tailSet(Object)
public K first()
first
in interface java.util.SortedSet<K>
public K last()
last
in interface java.util.SortedSet<K>
public java.util.Comparator<? super K> comparator()
comparator
in interface java.util.SortedSet<K>
public java.lang.Object clone()
clone
in class ReferenceSets.EmptySet<K>
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |