public abstract class AbstractReference2IntSortedMap<K> extends AbstractReference2IntMap<K> implements Reference2IntSortedMap<K>
AbstractReference2IntMap.BasicEntry<K>, AbstractReference2IntMap.BasicEntrySet<K>
Reference2IntSortedMap.FastSortedEntrySet<K>
Reference2IntMap.Entry<K>, Reference2IntMap.FastEntrySet<K>
Modifier and Type | Method and Description |
---|---|
ReferenceSortedSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
IntCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, mergeInt, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, entrySet, headMap, reference2IntEntrySet, subMap, tailMap
clear, computeIfAbsent, computeIfAbsent, computeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeInt, mergeInt, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, getInt, put, removeInt
public ReferenceSortedSet<K> keySet()
The view is backed by the set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
The view is backed by the sorted set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
keySet
in interface Reference2IntMap<K>
keySet
in interface Reference2IntSortedMap<K>
keySet
in interface java.util.Map<K,java.lang.Integer>
keySet
in interface java.util.SortedMap<K,java.lang.Integer>
keySet
in class AbstractReference2IntMap<K>
Map.keySet()
public IntCollection values()
The view is backed by the set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
The view is backed by the sorted set returned by Map.entrySet()
. Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
values
in interface Reference2IntMap<K>
values
in interface Reference2IntSortedMap<K>
values
in interface java.util.Map<K,java.lang.Integer>
values
in interface java.util.SortedMap<K,java.lang.Integer>
values
in class AbstractReference2IntMap<K>
Map.values()