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