java.util.Collection<Object2ObjectMap.Entry<K,V>>
, java.lang.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>>
, java.util.Set<Object2ObjectMap.Entry<K,V>>
, java.util.SortedSet<Object2ObjectMap.Entry<K,V>>
public static interface Object2ObjectSortedMap.FastSortedEntrySet<K,V> extends ObjectSortedSet<Object2ObjectMap.Entry<K,V>>, Object2ObjectMap.FastEntrySet<K,V>
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).
Modifier and Type | Method | Description |
---|---|---|
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.
|
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.
|
fastForEach
headSet, iterator, iterator, subSet, tailSet
ObjectBidirectionalIterator<Object2ObjectMap.Entry<K,V>> fastIterator()
fastIterator
in interface Object2ObjectMap.FastEntrySet<K,V>
Map.Entry
instance, suitably mutated.ObjectBidirectionalIterator<Object2ObjectMap.Entry<K,V>> fastIterator(Object2ObjectMap.Entry<K,V> from)
from
- an element to start from.from
;
the iterator might return always the same entry object, suitably
mutated.