Package it.unimi.dsi.fastutil.objects
Interface Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>
- All Superinterfaces:
Collection<Reference2ReferenceMap.Entry<K,,V>> Iterable<Reference2ReferenceMap.Entry<K,,V>> ObjectBidirectionalIterable<Reference2ReferenceMap.Entry<K,,V>> ObjectCollection<Reference2ReferenceMap.Entry<K,,V>> ObjectIterable<Reference2ReferenceMap.Entry<K,,V>> ObjectSet<Reference2ReferenceMap.Entry<K,,V>> ObjectSortedSet<Reference2ReferenceMap.Entry<K,,V>> Reference2ReferenceMap.FastEntrySet<K,,V> SequencedCollection<Reference2ReferenceMap.Entry<K,,V>> SequencedSet<Reference2ReferenceMap.Entry<K,,V>> Set<Reference2ReferenceMap.Entry<K,,V>> SortedSet<Reference2ReferenceMap.Entry<K,V>>
- Enclosing interface:
Reference2ReferenceSortedMap<K,V>
public static interface Reference2ReferenceSortedMap.FastSortedEntrySet<K,V>
extends ObjectSortedSet<Reference2ReferenceMap.Entry<K,V>>, Reference2ReferenceMap.FastEntrySet<K,V>
A sorted entry set providing fast iteration.
In some cases (e.g., hash-based classes) iteration over an entry set requires the creation of a
large number of entry objects. Some fastutil maps might return entry set objects of type FastSortedEntrySet: in this case, fastIterator() will return an iterator that is guaranteed not to create a large number of
objects, possibly by returning always the same entry (of course, mutated).
-
Method Summary
Modifier and TypeMethodDescriptionReturns a fast iterator over this entry set; the iterator might return always the same entry instance, suitably mutated.Returns a fast iterator over this entry set, starting from a given element of the domain (optional operation); the iterator might return always the same entry instance, suitably mutated.Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream, toArrayMethods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSortedSet
headSet, iterator, iterator, spliterator, subSet, tailSetMethods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap.FastEntrySet
fastForEachMethods inherited from interface java.util.Set
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArrayMethods inherited from interface java.util.SortedSet
addFirst, addLast, comparator, first, getFirst, getLast, last, removeFirst, removeLast, reversed
-
Method Details
-
fastIterator
ObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> fastIterator()Returns a fast iterator over this entry set; the iterator might return always the same entry instance, suitably mutated.- Specified by:
fastIteratorin interfaceReference2ReferenceMap.FastEntrySet<K,V> - Returns:
- a fast iterator over this entry set; the iterator might return always the same
Map.Entryinstance, suitably mutated.
-
fastIterator
ObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> fastIterator(Reference2ReferenceMap.Entry<K, V> from) Returns a fast iterator over this entry set, starting from a given element of the domain (optional operation); the iterator might return always the same entry instance, suitably mutated.- Parameters:
from- an element to start from.- Returns:
- a fast iterator over this sorted entry set starting at
from; the iterator might return always the same entry object, suitably mutated.
-