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, putAll, toStringdefaultReturnValue, defaultReturnValuecomparator, entrySet, headMap, object2DoubleEntrySet, subMap, tailMapclear, computeDouble, computeDoubleIfAbsent, computeDoubleIfAbsentPartial, computeDoubleIfPresent, containsKey, containsValue, containsValue, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapplyAsDouble, getDouble, put, removeDoublecompute, computeIfAbsent, computeIfPresent, equals, forEach, hashCode, isEmpty, putAll, replaceAllpublic 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 Map<K,Double>keySet in interface SortedMap<K,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 Map<K,Double>values in interface SortedMap<K,Double>values in class AbstractObject2DoubleMap<K>Map.values()