public abstract class AbstractInt2DoubleSortedMap extends AbstractInt2DoubleMap implements Int2DoubleSortedMap
AbstractInt2DoubleMap.BasicEntry, AbstractInt2DoubleMap.BasicEntrySet
Int2DoubleSortedMap.FastSortedEntrySet
Int2DoubleMap.Entry, Int2DoubleMap.FastEntrySet
Modifier and Type | Method and Description |
---|---|
IntSortedSet |
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, firstIntKey, firstKey, headMap, headMap, int2DoubleEntrySet, 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, mergeDouble, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, size
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, 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 Int2DoubleMap
keySet
in interface Int2DoubleSortedMap
keySet
in interface java.util.Map<java.lang.Integer,java.lang.Double>
keySet
in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>
keySet
in class AbstractInt2DoubleMap
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 Int2DoubleMap
values
in interface Int2DoubleSortedMap
values
in interface java.util.Map<java.lang.Integer,java.lang.Double>
values
in interface java.util.SortedMap<java.lang.Integer,java.lang.Double>
values
in class AbstractInt2DoubleMap
Map.values()