it.unimi.dsi.fastutil.chars
Interface Char2IntSortedMap.FastSortedEntrySet

All Superinterfaces:

Char2IntMap.FastEntrySet, Collection<Char2IntMap.Entry>, Iterable<Char2IntMap.Entry>, ObjectCollection<Char2IntMap.Entry>, ObjectIterable<Char2IntMap.Entry>, ObjectSet<Char2IntMap.Entry>, ObjectSortedSet<Char2IntMap.Entry>, Set<Char2IntMap.Entry>, SortedSet<Char2IntMap.Entry>

Enclosing interface:

Char2IntSortedMap

public static interface Char2IntSortedMap.FastSortedEntrySet
extends ObjectSortedSet<Char2IntMap.Entry>, Char2IntMap.FastEntrySet

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).

Method Summary

ObjectBidirectionalIterator<Char2IntMap.Entry>

fastIterator(Char2IntMap.Entry from) Returns a fast iterator over this sorted entry set; the iterator might return always the same entry object, suitably mutated.

Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSortedSet

headSet, iterator, iterator, objectIterator, subSet, tailSet

Methods inherited from interface java.util.SortedSet

comparator, first, last

Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2IntMap.FastEntrySet

fastIterator

Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectSet

remove

Methods inherited from interface it.unimi.dsi.fastutil.objects.ObjectCollection

toArray

Methods inherited from interface java.util.Set

add, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, removeAll, retainAll, size, toArray, toArray

Method Detail

fastIterator

ObjectBidirectionalIterator<Char2IntMap.Entry> fastIterator(Char2IntMap.Entry 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.