Interface Reference2BooleanSortedMap.FastSortedEntrySet<K>

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

public static interface Reference2BooleanSortedMap.FastSortedEntrySet<K> extends ObjectSortedSet<Reference2BooleanMap.Entry<K>>, Reference2BooleanMap.FastEntrySet<K>
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).