public static interface Reference2ReferenceSortedMap.FastSortedEntrySet<K,V> extends ObjectSortedSet<Reference2ReferenceMap.Entry<K,V>>, Reference2ReferenceMap.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 and Description |
|---|---|
ObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> |
fastIterator()
Returns a fast iterator over this entry set; the iterator might return always the same entry instance, suitably mutated.
|
ObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> |
fastIterator(Reference2ReferenceMap.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.
|
headSet, iterator, iterator, subSet, tailSetcomparator, first, last, spliteratorfastForEachadd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, remove, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streamObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> fastIterator()
fastIterator in interface Reference2ReferenceMap.FastEntrySet<K,V>Map.Entry instance, suitably mutated.ObjectBidirectionalIterator<Reference2ReferenceMap.Entry<K,V>> fastIterator(Reference2ReferenceMap.Entry<K,V> from)
from - an element to start from.from; the iterator might return always the same entry object, suitably mutated.Copyright © 2020. All rights reserved.