public abstract class AbstractObject2DoubleSortedMap<K> extends AbstractObject2DoubleMap<K> implements Object2DoubleSortedMap<K>
AbstractObject2DoubleMap.BasicEntry<K>, AbstractObject2DoubleMap.BasicEntrySet<K>
Object2DoubleSortedMap.FastSortedEntrySet<K>
Object2DoubleMap.Entry<K>, Object2DoubleMap.FastEntrySet<K>
Modifier and Type | Method and Description |
---|---|
ObjectSortedSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
DoubleCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, mergeDouble, putAll, toString
defaultReturnValue, defaultReturnValue
comparator, entrySet, headMap, object2DoubleEntrySet, subMap, tailMap
clear, computeDouble, computeDoubleIfAbsent, computeDoubleIfAbsentPartial, computeDoubleIfPresent, computeIfAbsent, computeIfAbsent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeDouble, mergeDouble, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort, getDouble, put, removeDouble
public ObjectSortedSet<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 Object2DoubleMap<K>
keySet
in interface Object2DoubleSortedMap<K>
keySet
in interface java.util.Map<K,java.lang.Double>
keySet
in interface java.util.SortedMap<K,java.lang.Double>
keySet
in class AbstractObject2DoubleMap<K>
Map.keySet()
public DoubleCollection 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 Object2DoubleMap<K>
values
in interface Object2DoubleSortedMap<K>
values
in interface java.util.Map<K,java.lang.Double>
values
in interface java.util.SortedMap<K,java.lang.Double>
values
in class AbstractObject2DoubleMap<K>
Map.values()