Class ReferenceSortedSets.SynchronizedSortedSet<K>
- All Implemented Interfaces:
ObjectBidirectionalIterable<K>
,ObjectIterable<K>
,ReferenceCollection<K>
,ReferenceSet<K>
,ReferenceSortedSet<K>
,Serializable
,Iterable<K>
,Collection<K>
,Set<K>
,SortedSet<K>
- Enclosing class:
- ReferenceSortedSets
public static class ReferenceSortedSets.SynchronizedSortedSet<K> extends ReferenceSets.SynchronizedSet<K> implements ReferenceSortedSet<K>, Serializable
- See Also:
- Serialized Form
-
Method Summary
Modifier and Type Method Description Comparator<? super K>
comparator()
K
first()
ReferenceSortedSet<K>
headSet(K to)
Returns a view of the portion of this sorted set whose elements are strictly less thantoElement
.ObjectBidirectionalIterator<K>
iterator()
Returns a type-specific iterator on the elements of this collection.ObjectBidirectionalIterator<K>
iterator(K from)
Returns a type-specificBidirectionalIterator
on the elements in this set, starting from a given element of the domain (optional operation).K
last()
ReferenceSortedSet<K>
subSet(K from, K to)
Returns a view of the portion of this sorted set whose elements range fromfromElement
, inclusive, totoElement
, exclusive.ReferenceSortedSet<K>
tailSet(K 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.objects.ReferenceCollections.SynchronizedCollection
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray, toString
-
Method Details
-
comparator
- Specified by:
comparator
in interfaceSortedSet<K>
-
subSet
Description copied from interface:ReferenceSortedSet
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 interfaceReferenceSortedSet<K>
- Specified by:
subSet
in interfaceSortedSet<K>
- See Also:
SortedSet.subSet(Object,Object)
-
headSet
Description copied from interface:ReferenceSortedSet
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 interfaceReferenceSortedSet<K>
- Specified by:
headSet
in interfaceSortedSet<K>
- See Also:
SortedSet.headSet(Object)
-
tailSet
Description copied from interface:ReferenceSortedSet
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 interfaceReferenceSortedSet<K>
- Specified by:
tailSet
in interfaceSortedSet<K>
- See Also:
SortedSet.tailSet(Object)
-
iterator
Description copied from interface:ReferenceCollection
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<K>
- Specified by:
iterator
in interfaceIterable<K>
- Specified by:
iterator
in interfaceObjectBidirectionalIterable<K>
- Specified by:
iterator
in interfaceObjectIterable<K>
- Specified by:
iterator
in interfaceReferenceCollection<K>
- Specified by:
iterator
in interfaceReferenceSet<K>
- Specified by:
iterator
in interfaceReferenceSortedSet<K>
- Specified by:
iterator
in interfaceSet<K>
- Overrides:
iterator
in classReferenceCollections.SynchronizedCollection<K>
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
iterator
Description copied from interface:ReferenceSortedSet
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 interfaceReferenceSortedSet<K>
- Parameters:
from
- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
first
-
last
-