Class ReferenceSortedSets.Singleton<K>
- All Implemented Interfaces:
ObjectBidirectionalIterable<K>,ObjectIterable<K>,ReferenceCollection<K>,ReferenceSet<K>,ReferenceSortedSet<K>,Serializable,Cloneable,Iterable<K>,Collection<K>,Set<K>,SortedSet<K>
- Enclosing class:
- ReferenceSortedSets
public static class ReferenceSortedSets.Singleton<K> extends ReferenceSets.Singleton<K> implements ReferenceSortedSet<K>, Serializable, Cloneable
This class may be useful to implement your own in case you subclass a type-specific sorted set.
- See Also:
- Serialized Form
-
Method Summary
Modifier and Type Method Description Comparator<? super K>comparator()Kfirst()ReferenceSortedSet<K>headSet(K to)Returns a view of the portion of this sorted set whose elements are strictly less thantoElement.ObjectBidirectionalIterator<K>iterator(K from)Returns a type-specificBidirectionalIteratoron the elements in this set, starting from a given element of the domain (optional operation).Klast()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.ReferenceSets.Singleton
addAll, clone, contains, iterator, remove, removeAll, retainAll, sizeMethods inherited from class java.util.AbstractCollection
add, clear, containsAll, isEmpty, toArray, toArray
-
Method Details
-
iterator
Description copied from interface:ReferenceSortedSetReturns a type-specificBidirectionalIteratoron 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:
iteratorin interfaceReferenceSortedSet<K>- Parameters:
from- an element to start from.- Returns:
- a bidirectional iterator on the element in this set, starting at the given element.
-
comparator
- Specified by:
comparatorin interfaceSortedSet<K>
-
subSet
Description copied from interface:ReferenceSortedSetReturns 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:
subSetin interfaceReferenceSortedSet<K>- Specified by:
subSetin interfaceSortedSet<K>- See Also:
SortedSet.subSet(Object,Object)
-
headSet
Description copied from interface:ReferenceSortedSetReturns 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:
headSetin interfaceReferenceSortedSet<K>- Specified by:
headSetin interfaceSortedSet<K>- See Also:
SortedSet.headSet(Object)
-
tailSet
Description copied from interface:ReferenceSortedSetReturns 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:
tailSetin interfaceReferenceSortedSet<K>- Specified by:
tailSetin interfaceSortedSet<K>- See Also:
SortedSet.tailSet(Object)
-
first
-
last
-