Package it.unimi.dsi.fastutil.objects

Interface Object2ObjectSortedMap.FastSortedEntrySet<K,V>

All Superinterfaces:
Collection<Object2ObjectMap.Entry<K,V>>, Iterable<Object2ObjectMap.Entry<K,V>>, Object2ObjectMap.FastEntrySet<K,V>, ObjectBidirectionalIterable<Object2ObjectMap.Entry<K,V>>, ObjectCollection<Object2ObjectMap.Entry<K,V>>, ObjectIterable<Object2ObjectMap.Entry<K,V>>, ObjectSet<Object2ObjectMap.Entry<K,V>>, ObjectSortedSet<Object2ObjectMap.Entry<K,V>>, Set<Object2ObjectMap.Entry<K,V>>, SortedSet<Object2ObjectMap.Entry<K,V>>
Enclosing interface:
Object2ObjectSortedMap<K,V>
public static interface Object2ObjectSortedMap.FastSortedEntrySet<K,V> extends ObjectSortedSet<Object2ObjectMap.Entry<K,V>>, Object2ObjectMap.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).

  • Method Details

    • fastIterator

      ObjectBidirectionalIterator<Object2ObjectMap.Entry<K,V>> 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 Object2ObjectMap.FastEntrySet<K,V>
      Returns:
      a fast iterator over this entry set; the iterator might return always the same Map.Entry instance, suitably mutated.

    • fastIterator

      ObjectBidirectionalIterator<Object2ObjectMap.Entry<K,V>> fastIterator(Object2ObjectMap.Entry<K,V> 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.