it.unimi.dsi.fastutil.objects
Interface Reference2CharSortedMap.FastSortedEntrySet<K>
- All Superinterfaces:
- Collection<Reference2CharMap.Entry<K>>, Iterable<Reference2CharMap.Entry<K>>, ObjectCollection<Reference2CharMap.Entry<K>>, ObjectIterable<Reference2CharMap.Entry<K>>, ObjectSet<Reference2CharMap.Entry<K>>, ObjectSortedSet<Reference2CharMap.Entry<K>>, Reference2CharMap.FastEntrySet<K>, Set<Reference2CharMap.Entry<K>>, SortedSet<Reference2CharMap.Entry<K>>
- Enclosing interface:
- Reference2CharSortedMap<K>
public static interface Reference2CharSortedMap.FastSortedEntrySet<K>
- extends ObjectSortedSet<Reference2CharMap.Entry<K>>, Reference2CharMap.FastEntrySet<K>
A sorted entry set providing fast iteration.
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).
Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSet |
remove |
Methods inherited from interface java.util.Set |
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray |
Methods inherited from interface java.util.Set |
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray |
Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSet |
remove |
Methods inherited from interface java.util.Set |
add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray |
fastIterator
ObjectBidirectionalIterator<Reference2CharMap.Entry<K>> fastIterator(Reference2CharMap.Entry<K> from)
- Returns a fast iterator over this sorted entry set; the iterator might return always the same entry object, suitably mutated.
- Returns:
- a fast iterator over this sorted entry set; the iterator might return always the same entry object, suitably mutated.