public abstract class AbstractDouble2ReferenceSortedMap<V> extends AbstractDouble2ReferenceMap<V> implements Double2ReferenceSortedMap<V>
AbstractDouble2ReferenceMap.BasicEntry<V>Double2ReferenceSortedMap.FastSortedEntrySet<V>Double2ReferenceMap.Entry<V>, Double2ReferenceMap.FastEntrySet<V>| Modifier and Type | Method and Description |
|---|---|
ObjectSortedSet<Map.Entry<Double,V>> |
entrySet()
Returns a set view of the mappings contained in this map.
|
Double |
firstKey()
Delegates to the corresponding type-specific method.
|
Double2ReferenceSortedMap<V> |
headMap(Double to)
Delegates to the corresponding type-specific method.
|
DoubleSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
Double |
lastKey()
Delegates to the corresponding type-specific method.
|
Double2ReferenceSortedMap<V> |
subMap(Double from,
Double to)
Delegates to the corresponding type-specific method.
|
Double2ReferenceSortedMap<V> |
tailMap(Double from)
Delegates to the corresponding type-specific method.
|
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map.
|
containsKey, containsValue, equals, hashCode, isEmpty, putAll, toStringclear, containsKey, defaultReturnValue, defaultReturnValue, get, put, put, remove, removecomparator, double2ReferenceEntrySet, firstDoubleKey, headMap, lastDoubleKey, subMap, tailMapcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removeclear, 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 Double2ReferenceSortedMap<V> headMap(Double to)
headMap in interface Double2ReferenceSortedMap<V>headMap in interface SortedMap<Double,V>SortedMap.headMap(Object)public Double2ReferenceSortedMap<V> tailMap(Double from)
tailMap in interface Double2ReferenceSortedMap<V>tailMap in interface SortedMap<Double,V>SortedMap.tailMap(Object)public Double2ReferenceSortedMap<V> subMap(Double from, Double to)
subMap in interface Double2ReferenceSortedMap<V>subMap in interface SortedMap<Double,V>SortedMap.subMap(Object,Object)public Double firstKey()
public Double lastKey()
public DoubleSortedSet 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 Double2ReferenceMap<V>keySet in interface Double2ReferenceSortedMap<V>keySet in interface Map<Double,V>keySet in interface SortedMap<Double,V>keySet in class AbstractDouble2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> 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 Double2ReferenceMap<V>values in interface Double2ReferenceSortedMap<V>values in interface Map<Double,V>values in interface SortedMap<Double,V>values in class AbstractDouble2ReferenceMap<V>Map.values()public ObjectSortedSet<Map.Entry<Double,V>> entrySet()
Double2ReferenceMapNote that this specification strengthens the one given in Map.entrySet().
entrySet in interface Double2ReferenceMap<V>entrySet in interface Double2ReferenceSortedMap<V>entrySet in interface Map<Double,V>entrySet in interface SortedMap<Double,V>entrySet in class AbstractDouble2ReferenceMap<V>Map.entrySet()