public abstract class AbstractInt2LongSortedMap extends AbstractInt2LongMap implements Int2LongSortedMap
AbstractInt2LongMap.BasicEntry, AbstractInt2LongMap.BasicEntrySet
Int2LongSortedMap.FastSortedEntrySet
Int2LongMap.Entry, Int2LongMap.FastEntrySet
Modifier and Type | Method and Description |
---|---|
IntSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
LongCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, mergeLong, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, entrySet, firstIntKey, firstKey, headMap, headMap, int2LongEntrySet, lastIntKey, lastKey, subMap, subMap, tailMap, tailMap
clear, compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeLong, mergeLong, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsLong, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, get, put, remove
public IntSortedSet 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 Int2LongMap
keySet
in interface Int2LongSortedMap
keySet
in interface java.util.Map<java.lang.Integer,java.lang.Long>
keySet
in interface java.util.SortedMap<java.lang.Integer,java.lang.Long>
keySet
in class AbstractInt2LongMap
Map.keySet()
public LongCollection 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 Int2LongMap
values
in interface Int2LongSortedMap
values
in interface java.util.Map<java.lang.Integer,java.lang.Long>
values
in interface java.util.SortedMap<java.lang.Integer,java.lang.Long>
values
in class AbstractInt2LongMap
Map.values()