public abstract class AbstractDouble2ByteSortedMap extends AbstractDouble2ByteMap implements Double2ByteSortedMap
AbstractDouble2ByteMap.BasicEntry, AbstractDouble2ByteMap.BasicEntrySet
Double2ByteSortedMap.FastSortedEntrySet
Double2ByteMap.Entry, Double2ByteMap.FastEntrySet
Modifier and Type | Method and Description |
---|---|
DoubleSortedSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
ByteCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, double2ByteEntrySet, 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, mergeByte, mergeByte, 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 Double2ByteMap
keySet
in interface Double2ByteSortedMap
keySet
in interface java.util.Map<java.lang.Double,java.lang.Byte>
keySet
in interface java.util.SortedMap<java.lang.Double,java.lang.Byte>
keySet
in class AbstractDouble2ByteMap
Map.keySet()
public ByteCollection 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 Double2ByteMap
values
in interface Double2ByteSortedMap
values
in interface java.util.Map<java.lang.Double,java.lang.Byte>
values
in interface java.util.SortedMap<java.lang.Double,java.lang.Byte>
values
in class AbstractDouble2ByteMap
Map.values()