Interface Object2BooleanSortedMap.FastSortedEntrySet<K>

All Superinterfaces:
Collection<Object2BooleanMap.Entry<K>>, Iterable<Object2BooleanMap.Entry<K>>, Object2BooleanMap.FastEntrySet<K>, it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterable<Object2BooleanMap.Entry<K>>, it.unimi.dsi.fastutil.objects.ObjectCollection<Object2BooleanMap.Entry<K>>, it.unimi.dsi.fastutil.objects.ObjectIterable<Object2BooleanMap.Entry<K>>, it.unimi.dsi.fastutil.objects.ObjectSet<Object2BooleanMap.Entry<K>>, it.unimi.dsi.fastutil.objects.ObjectSortedSet<Object2BooleanMap.Entry<K>>, SequencedCollection<Object2BooleanMap.Entry<K>>, SequencedSet<Object2BooleanMap.Entry<K>>, Set<Object2BooleanMap.Entry<K>>, SortedSet<Object2BooleanMap.Entry<K>>
Enclosing interface:
Object2BooleanSortedMap<K>

public static interface Object2BooleanSortedMap.FastSortedEntrySet<K> extends it.unimi.dsi.fastutil.objects.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).

  • Method Details

    • fastIterator

      it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterator<Object2BooleanMap.Entry<K>> fastIterator()
      Returns a fast iterator over this entry set; the iterator might return always the same entry instance, suitably mutated.
      Specified by:
      fastIterator in interface Object2BooleanMap.FastEntrySet<K>
      Returns:
      a fast iterator over this entry set; the iterator might return always the same Map.Entry instance, suitably mutated.
    • fastIterator

      it.unimi.dsi.fastutil.objects.ObjectBidirectionalIterator<Object2BooleanMap.Entry<K>> fastIterator(Object2BooleanMap.Entry<K> from)
      Returns a fast iterator over this entry set, starting from a given element of the domain (optional operation); the iterator might return always the same entry instance, suitably mutated.
      Parameters:
      from - an element to start from.
      Returns:
      a fast iterator over this sorted entry set starting at from; the iterator might return always the same entry object, suitably mutated.