public abstract class AbstractDouble2ShortSortedMap extends AbstractDouble2ShortMap implements Double2ShortSortedMap
AbstractDouble2ShortMap.BasicEntry, AbstractDouble2ShortMap.BasicEntrySet
Double2ShortSortedMap.FastSortedEntrySet
Double2ShortMap.Entry, Double2ShortMap.FastEntrySet
Modifier and Type | Method and Description |
---|---|
DoubleSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ShortCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, double2ShortEntrySet, entrySet, firstDoubleKey, firstKey, headMap, headMap, lastDoubleKey, 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, mergeShort, mergeShort, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, get, put, remove
public DoubleSortedSet 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 Double2ShortMap
keySet
in interface Double2ShortSortedMap
keySet
in interface java.util.Map<java.lang.Double,java.lang.Short>
keySet
in interface java.util.SortedMap<java.lang.Double,java.lang.Short>
keySet
in class AbstractDouble2ShortMap
Map.keySet()
public ShortCollection 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 Double2ShortMap
values
in interface Double2ShortSortedMap
values
in interface java.util.Map<java.lang.Double,java.lang.Short>
values
in interface java.util.SortedMap<java.lang.Double,java.lang.Short>
values
in class AbstractDouble2ShortMap
Map.values()