public static class Object2DoubleSortedMaps.SynchronizedSortedMap<K> extends Object2DoubleMaps.SynchronizedMap<K> implements Object2DoubleSortedMap<K>, Serializable
Object2DoubleSortedMap.FastSortedEntrySet<K>Object2DoubleMap.Entry<K>, Object2DoubleMap.FastEntrySet<K>| Modifier and Type | Method and Description |
|---|---|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
ObjectSortedSet<Map.Entry<K,Double>> |
entrySet()
Deprecated.
Please use the corresponding type-specific method
instead.
|
K |
firstKey()
Returns the first (lowest) key currently in this map.
|
Object2DoubleSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
ObjectSortedSet<K> |
keySet()
Returns a
Set view of the keys contained in this map. |
K |
lastKey()
Returns the last (highest) key currently in this map.
|
ObjectSortedSet<Object2DoubleMap.Entry<K>> |
object2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
Object2DoubleSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2DoubleSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
compute, computeDouble, computeDoubleIfAbsent, computeDoubleIfAbsentPartial, computeDoubleIfPresent, computeIfAbsent, computeIfPresent, containsValue, containsValue, equals, forEach, getOrDefault, getOrDefault, hashCode, isEmpty, merge, mergeDouble, putAll, putIfAbsent, putIfAbsent, remove, remove, replace, replace, replace, replace, replaceAll, valuesapply, applyAsDouble, clear, containsKey, defaultReturnValue, defaultReturnValue, get, getDouble, put, put, remove, removeDouble, size, toStringvaluesclear, 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 Comparator<? super K> comparator()
Object2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Object2DoubleSortedMap<K>comparator in interface SortedMap<K,Double>null if this map uses the natural ordering
of its keysSortedMap.comparator()public ObjectSortedSet<Object2DoubleMap.Entry<K>> object2DoubleEntrySet()
Object2DoubleMap
This method is necessary because there is no inheritance along type
parameters: it is thus impossible to strengthen Map.entrySet() so
that it returns an ObjectSet of
type-specific entries (the latter makes it possible to access keys and
values with type-specific methods).
object2DoubleEntrySet in interface Object2DoubleMap<K>object2DoubleEntrySet in interface Object2DoubleSortedMap<K>object2DoubleEntrySet in class Object2DoubleMaps.SynchronizedMap<K>Map.entrySet()@Deprecated public ObjectSortedSet<Map.Entry<K,Double>> entrySet()
Note 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 Object2DoubleMaps.SynchronizedMap<K>Map.entrySet()public ObjectSortedSet<K> keySet()
Object2DoubleMapSet view of the keys contained in this map.
The set is backed by the map, so changes to the map are
reflected in the set, and vice-versa. If the map is modified
while an iteration over the set is in progress (except through
the iterator's own remove operation), the results of
the iteration are undefined. The set supports element removal,
which removes the corresponding mapping from the map, via the
Iterator.remove, Set.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations.
Note that this specification strengthens the one given in
Map.keySet().
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 Object2DoubleMaps.SynchronizedMap<K>Map.keySet()public Object2DoubleSortedMap<K> subMap(K from, K to)
Object2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Object2DoubleSortedMap<K>subMap in interface SortedMap<K,Double>from - low endpoint (inclusive) of the keys in the returned mapto - high endpoint (exclusive) of the keys in the returned mapfromKey, inclusive, to toKey, exclusiveSortedMap.subMap(Object,Object)public Object2DoubleSortedMap<K> headMap(K to)
Object2DoubleSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Object2DoubleSortedMap<K>headMap in interface SortedMap<K,Double>to - high endpoint (exclusive) of the keys in the returned maptoKeySortedMap.headMap(Object)public Object2DoubleSortedMap<K> tailMap(K from)
Object2DoubleSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Object2DoubleSortedMap<K>tailMap in interface SortedMap<K,Double>from - low endpoint (inclusive) of the keys in the returned mapfromKeySortedMap.tailMap(Object)public K firstKey()
java.util.SortedMap