Interface Double2ReferenceSortedMap.FastSortedEntrySet<V>

All Superinterfaces:
Collection<Double2ReferenceMap.Entry<V>>, Double2ReferenceMap.FastEntrySet<V>, Iterable<Double2ReferenceMap.Entry<V>>, ObjectBidirectionalIterable<Double2ReferenceMap.Entry<V>>, ObjectCollection<Double2ReferenceMap.Entry<V>>, ObjectIterable<Double2ReferenceMap.Entry<V>>, ObjectSet<Double2ReferenceMap.Entry<V>>, ObjectSortedSet<Double2ReferenceMap.Entry<V>>, Set<Double2ReferenceMap.Entry<V>>, SortedSet<Double2ReferenceMap.Entry<V>>
Enclosing interface:
Double2ReferenceSortedMap<V>

public static interface Double2ReferenceSortedMap.FastSortedEntrySet<V>
extends ObjectSortedSet<Double2ReferenceMap.Entry<V>>, Double2ReferenceMap.FastEntrySet<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).