public static interface Reference2ByteSortedMap.FastSortedEntrySet<K> extends ObjectSortedSet<Reference2ByteMap.Entry<K>>, Reference2ByteMap.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<Reference2ByteMap.Entry<K>> |
fastIterator(Reference2ByteMap.Entry<K> from)
Returns a fast iterator over this sorted entry set; the iterator
might return always the same entry object, suitably mutated.
|
headSet, iterator, iterator, objectIterator, subSet, tailSetcomparator, first, last, spliteratorfastIteratortoArrayadd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArrayparallelStream, removeIf, streamObjectBidirectionalIterator<Reference2ByteMap.Entry<K>> fastIterator(Reference2ByteMap.Entry<K> from)