public abstract class AbstractObject2DoubleSortedMap<K> extends AbstractObject2DoubleMap<K> implements Object2DoubleSortedMap<K>
AbstractObject2DoubleMap.BasicEntry<K>Object2DoubleSortedMap.FastSortedEntrySet<K>Object2DoubleMap.Entry<K>, Object2DoubleMap.FastEntrySet<K>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<K,Double>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
ObjectSortedSet<K> |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, defaultReturnValue, defaultReturnValue, get, put, put, remove, removeDoublecomparator, headMap, object2DoubleEntrySet, subMap, tailMapcontainsValuedefaultReturnValue, defaultReturnValue, getDouble, put, removeDoubleclear, containsKey, get, put, remove, sizeclear, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, sizepublic ObjectSortedSet<K> keySet()
The view is backed by the sorted set returned by 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 sorted set returned by 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()public ObjectSortedSet<Map.Entry<K,Double>> entrySet()
Object2DoubleMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Object2DoubleMap<K>entrySet in interface Object2DoubleSortedMap<K>entrySet in interface Map<K,Double>entrySet in interface SortedMap<K,Double>entrySet in class AbstractObject2DoubleMap<K>Map.entrySet()