Interface Object2BooleanSortedMap.FastSortedEntrySet<K>

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

public static interface Object2BooleanSortedMap.FastSortedEntrySet<K>
extends ObjectSortedSet<Object2BooleanMap.Entry<K>>, Object2BooleanMap.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).