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>, 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).