Package it.unimi.dsi.fastutil.objects

Class ReferenceSortedSets.EmptySet<K>

java.lang.Object

java.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>

All Implemented Interfaces:

ObjectBidirectionalIterable<K>, ObjectIterable<K>, ReferenceCollection<K>, ReferenceSet<K>, ReferenceSortedSet<K>, Serializable, Cloneable, Iterable<K>, Collection<K>, SequencedCollection<K>, SequencedSet<K>, Set<K>, SortedSet<K>

Enclosing class:

ReferenceSortedSets

public static class ReferenceSortedSets.EmptySet<K>
extends ReferenceSets.EmptySet<K>
implements ReferenceSortedSet<K>, Serializable, Cloneable

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.

See Also:

• Serialized Form

Method Summary

Modifier and Type	Method	Description
Object	clone()
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()
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.ReferenceSets.EmptySet

equals, remove

Methods inherited from class it.unimi.dsi.fastutil.objects.ReferenceCollections.EmptyCollection

addAll, clear, contains, containsAll, forEach, hashCode, iterator, removeAll, removeIf, retainAll, size, spliterator, toArray, toArray

Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReferenceCollection

toString

Methods inherited from class java.util.AbstractCollection

add, isEmpty

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface java.lang.Iterable

forEach

Methods inherited from interface it.unimi.dsi.fastutil.objects.ReferenceSortedSet

iterator, spliterator

Methods inherited from interface java.util.Set

add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArray

Methods inherited from interface java.util.SortedSet

addFirst, addLast, getFirst, getLast, removeFirst, removeLast, reversed

Method Details

iterator

public ObjectBidirectionalIterator<K> iterator(K from)

Description copied from interface: ReferenceSortedSet

Returns a type-specific 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.

Specified by:

iterator in interface ReferenceSortedSet<K>

Parameters:

from - an element to start from.

Returns:

a bidirectional iterator on the element in this set, starting at the given element.

subSet

public ReferenceSortedSet<K> subSet(K from,
 K to)

Description copied from interface: ReferenceSortedSet

Returns a view of the portion of this sorted set whose elements range from fromElement, inclusive, to toElement, exclusive.

Specified by:

subSet in interface ReferenceSortedSet<K>

Specified by:

subSet in interface SortedSet<K>

See Also:

• SortedSet.subSet(Object,Object)

headSet

public ReferenceSortedSet<K> headSet(K from)

Description copied from interface: ReferenceSortedSet

Returns a view of the portion of this sorted set whose elements are strictly less than toElement.

Specified by:

headSet in interface ReferenceSortedSet<K>

Specified by:

headSet in interface SortedSet<K>

See Also:

• SortedSet.headSet(Object)

tailSet

public ReferenceSortedSet<K> tailSet(K to)

Description copied from interface: ReferenceSortedSet

Returns a view of the portion of this sorted set whose elements are greater than or equal to fromElement.

Specified by:

tailSet in interface ReferenceSortedSet<K>

Specified by:

tailSet in interface SortedSet<K>

See Also:

• SortedSet.tailSet(Object)

first

public K first()

Specified by:

first in interface SortedSet<K>

last

public K last()

Specified by:

last in interface SortedSet<K>

comparator

public Comparator<? super K> comparator()

Specified by:

comparator in interface SortedSet<K>

clone

public Object clone()

Overrides:

clone in class ReferenceSets.EmptySet<K>