Interface Double2DoubleSortedMap.FastSortedEntrySet

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

public static interface Double2DoubleSortedMap.FastSortedEntrySet
extends ObjectSortedSet<Double2DoubleMap.Entry>, Double2DoubleMap.FastEntrySet
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).