java.util.Collection<Int2ReferenceMap.Entry<V>>
, Int2ReferenceMap.FastEntrySet<V>
, java.lang.Iterable<Int2ReferenceMap.Entry<V>>
, ObjectBidirectionalIterable<Int2ReferenceMap.Entry<V>>
, ObjectCollection<Int2ReferenceMap.Entry<V>>
, ObjectIterable<Int2ReferenceMap.Entry<V>>
, ObjectSet<Int2ReferenceMap.Entry<V>>
, ObjectSortedSet<Int2ReferenceMap.Entry<V>>
, java.util.Set<Int2ReferenceMap.Entry<V>>
, java.util.SortedSet<Int2ReferenceMap.Entry<V>>
public static interface Int2ReferenceSortedMap.FastSortedEntrySet<V> extends ObjectSortedSet<Int2ReferenceMap.Entry<V>>, Int2ReferenceMap.FastEntrySet<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<Int2ReferenceMap.Entry<V>> |
fastIterator() |
Returns a fast iterator over this entry set; the iterator might return always
the same entry instance, suitably mutated.
|
ObjectBidirectionalIterator<Int2ReferenceMap.Entry<V>> |
fastIterator(Int2ReferenceMap.Entry<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<Int2ReferenceMap.Entry<V>> fastIterator()
fastIterator
in interface Int2ReferenceMap.FastEntrySet<V>
Map.Entry
instance, suitably mutated.ObjectBidirectionalIterator<Int2ReferenceMap.Entry<V>> fastIterator(Int2ReferenceMap.Entry<V> from)
from
- an element to start from.from
;
the iterator might return always the same entry object, suitably
mutated.