public static class Double2ReferenceSortedMaps.SynchronizedSortedMap<V> extends Double2ReferenceMaps.SynchronizedMap<V> implements Double2ReferenceSortedMap<V>, Serializable
Double2ReferenceSortedMap.FastSortedEntrySet<V>Double2ReferenceMap.Entry<V>, Double2ReferenceMap.FastEntrySet<V>| Modifier and Type | Method and Description |
|---|---|
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
ObjectSortedSet<Double2ReferenceMap.Entry<V>> |
double2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
ObjectSortedSet<Map.Entry<Double,V>> |
entrySet()
Deprecated.
Please use the corresponding type-specific method
instead.
|
double |
firstDoubleKey()
Returns the first (lowest) key currently in this map.
|
Double |
firstKey()
Deprecated.
Please use the corresponding type-specific method
instead.
|
Double2ReferenceSortedMap<V> |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
Double2ReferenceSortedMap<V> |
headMap(Double to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
DoubleSortedSet |
keySet()
Returns a
Set view of the keys contained in this map. |
double |
lastDoubleKey()
Returns the last (highest) key currently in this map.
|
Double |
lastKey()
Deprecated.
Please use the corresponding type-specific method
instead.
|
Double2ReferenceSortedMap<V> |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2ReferenceSortedMap<V> |
subMap(Double from,
Double to)
Deprecated.
Please use the corresponding type-specific method
instead.
|
Double2ReferenceSortedMap<V> |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
Double2ReferenceSortedMap<V> |
tailMap(Double from)
Deprecated.
Please use the corresponding type-specific method
instead.
|
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsValue, equals, forEach, getOrDefault, getOrDefault, hashCode, isEmpty, merge, merge, putAll, putIfAbsent, putIfAbsent, remove, remove, replace, replace, replace, replace, replaceAll, valuesapply, apply, clear, containsKey, containsKey, defaultReturnValue, defaultReturnValue, get, get, put, put, remove, remove, size, toStringvaluesclear, compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsKey, defaultReturnValue, defaultReturnValue, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace, sizeapply, get, put, removecontainsValue, equals, forEach, hashCode, isEmpty, putAll, replaceAllpublic DoubleComparator comparator()
Double2ReferenceSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Double2ReferenceSortedMap<V>comparator in interface SortedMap<Double,V>null if this map uses the natural ordering
of its keysSortedMap.comparator()public ObjectSortedSet<Double2ReferenceMap.Entry<V>> double2ReferenceEntrySet()
Double2ReferenceMap
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).
double2ReferenceEntrySet in interface Double2ReferenceMap<V>double2ReferenceEntrySet in interface Double2ReferenceSortedMap<V>double2ReferenceEntrySet in class Double2ReferenceMaps.SynchronizedMap<V>Map.entrySet()@Deprecated public ObjectSortedSet<Map.Entry<Double,V>> entrySet()
Note 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 Double2ReferenceMaps.SynchronizedMap<V>Map.entrySet()public DoubleSortedSet keySet()
Double2ReferenceMapSet 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 Double2ReferenceMap<V>keySet in interface Double2ReferenceSortedMap<V>keySet in interface Map<Double,V>keySet in interface SortedMap<Double,V>keySet in class Double2ReferenceMaps.SynchronizedMap<V>Map.keySet()public Double2ReferenceSortedMap<V> subMap(double from, double to)
Double2ReferenceSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Double2ReferenceSortedMap<V>SortedMap.subMap(Object,Object)public Double2ReferenceSortedMap<V> headMap(double to)
Double2ReferenceSortedMaptoKey.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
headMap in interface Double2ReferenceSortedMap<V>SortedMap.headMap(Object)public Double2ReferenceSortedMap<V> tailMap(double from)
Double2ReferenceSortedMapfromKey.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).
tailMap in interface Double2ReferenceSortedMap<V>SortedMap.tailMap(Object)public double firstDoubleKey()
Double2ReferenceSortedMapfirstDoubleKey in interface Double2ReferenceSortedMap<V>SortedMap.firstKey()public double lastDoubleKey()
Double2ReferenceSortedMaplastDoubleKey in interface Double2ReferenceSortedMap<V>SortedMap.lastKey()@Deprecated public Double firstKey()
@Deprecated public Double lastKey()
@Deprecated public Double2ReferenceSortedMap<V> subMap(Double from, Double to)
fromKey, inclusive, to toKey, exclusive. (If
fromKey and toKey are equal, the returned map
is empty.) The returned map is backed by this map, so changes
in the returned map are reflected in this map, and vice-versa.
The returned map supports all optional map operations that this
map supports.
The returned map will throw an IllegalArgumentException
on an attempt to insert a key outside its range.
Note that this specification strengthens the one given in
SortedMap.subMap(Object,Object).
subMap in interface Double2ReferenceSortedMap<V>subMap in interface SortedMap<Double,V>from - low endpoint (inclusive) of the keys in the returned mapto - high endpoint (exclusive) of the keys in the returned mapfromKey, inclusive, to toKey, exclusive@Deprecated public Double2ReferenceSortedMap<V> headMap(Double to)
toKey. The returned map is backed
by this map, so changes in the returned map are reflected in
this map, and vice-versa. The returned map supports all
optional map operations that this map supports.
The returned map will throw an IllegalArgumentException
on an attempt to insert a key outside its range.
Note that this specification strengthens the one given in
SortedMap.headMap(Object).
@Deprecated public Double2ReferenceSortedMap<V> tailMap(Double from)
fromKey. The returned map is
backed by this map, so changes in the returned map are
reflected in this map, and vice-versa. The returned map
supports all optional map operations that this map supports.
The returned map will throw an IllegalArgumentException
on an attempt to insert a key outside its range.
Note that this specification strengthens the one given in
SortedMap.tailMap(Object).