public class Double2FloatRBTreeMap extends AbstractDouble2FloatSortedMap implements Serializable, Cloneable
The iterators provided by the views of this class are type-specific
bidirectional
iterators. Moreover, the iterator returned by iterator() can be
safely cast to a type-specific list
iterator.
AbstractDouble2FloatMap.BasicEntryDouble2FloatSortedMap.FastSortedEntrySetDouble2FloatMap.FastEntrySet| Constructor and Description |
|---|
Double2FloatRBTreeMap()
Creates a new empty tree map.
|
Double2FloatRBTreeMap(Comparator<? super Double> c)
Creates a new empty tree map with the given comparator.
|
Double2FloatRBTreeMap(double[] k,
float[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Double2FloatRBTreeMap(double[] k,
float[] v,
Comparator<? super Double> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Double2FloatRBTreeMap(Double2FloatMap m)
Creates a new tree map copying a given map.
|
Double2FloatRBTreeMap(Double2FloatSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Double2FloatRBTreeMap(Map<? extends Double,? extends Float> m)
Creates a new tree map copying a given map.
|
Double2FloatRBTreeMap(SortedMap<Double,Float> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
float |
addTo(double k,
float incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2FloatRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractDouble2FloatMap.values(). |
ObjectSortedSet<Double2FloatMap.Entry> |
double2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
firstDoubleKey() |
float |
get(double k)
Returns the value to which the given key is mapped.
|
Double2FloatSortedMap |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
DoubleSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
double |
lastDoubleKey() |
float |
put(double k,
float v)
Adds a pair to the map.
|
Float |
put(Double ok,
Float ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
float |
remove(double k)
Removes the mapping with the given key.
|
Float |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Double2FloatSortedMap |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Double2FloatSortedMap |
tailMap(double from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this
map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Double2FloatRBTreeMap()
public Double2FloatRBTreeMap(Comparator<? super Double> c)
c - a (possibly type-specific) comparator.public Double2FloatRBTreeMap(Map<? extends Double,? extends Float> m)
m - a Map to be copied into the new tree map.public Double2FloatRBTreeMap(SortedMap<Double,Float> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Double2FloatRBTreeMap(Double2FloatMap m)
m - a type-specific map to be copied into the new tree map.public Double2FloatRBTreeMap(Double2FloatSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Double2FloatRBTreeMap(double[] k,
float[] v,
Comparator<? super Double> c)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.c - a (possibly type-specific) comparator.IllegalArgumentException - if k and v have different lengths.public Double2FloatRBTreeMap(double[] k,
float[] v)
k - the array of keys of the new tree map.v - the array of corresponding values in the new tree map.IllegalArgumentException - if k and v have different lengths.public float addTo(double k,
float incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public float put(double k,
float v)
Double2FloatFunctionput in interface Double2FloatFunctionput in class AbstractDouble2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(double k)
Double2FloatFunctionremove in interface Double2FloatFunctionremove in class AbstractDouble2FloatFunctionk - the key.Function.remove(Object)@Deprecated public Float put(Double ok, Float ov)
null on a missing key.
This method must check whether the provided key is in the map using
containsKey(). Thus, it probes the map twice.
Implementors of subclasses should override it with a more efficient
method.
put in interface Function<Double,Float>put in interface Map<Double,Float>put in class AbstractDouble2FloatFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Float remove(Object ok)
null on a missing key.
This method must check whether the provided key is in the map using
containsKey(). Thus, it probes the map twice.
Implementors of subclasses should override it with a more efficient
method.
public boolean containsValue(float v)
AbstractDouble2FloatMapAbstractDouble2FloatMap.values().containsValue in interface Double2FloatMapcontainsValue in class AbstractDouble2FloatMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2FloatMapAbstractDouble2FloatMap.keySet().containsKey in interface Double2FloatFunctioncontainsKey in class AbstractDouble2FloatMapFunction.containsKey(Object)public int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
public float get(double k)
Double2FloatFunctionget in interface Double2FloatFunctionk - the key.Function.get(Object)public double firstDoubleKey()
firstDoubleKey in interface Double2FloatSortedMapSortedMap.firstKey()public double lastDoubleKey()
lastDoubleKey in interface Double2FloatSortedMapSortedMap.lastKey()public ObjectSortedSet<Double2FloatMap.Entry> double2FloatEntrySet()
Double2FloatSortedMapdouble2FloatEntrySet in interface Double2FloatMapdouble2FloatEntrySet in interface Double2FloatSortedMapDouble2FloatSortedMap.entrySet()public DoubleSortedSet keySet()
In addition to the semantics of Map.keySet(), you can
safely cast the set returned by this call to a type-specific sorted set
interface.
keySet in interface Double2FloatMapkeySet in interface Double2FloatSortedMapkeySet in interface Map<Double,Float>keySet in interface SortedMap<Double,Float>keySet in class AbstractDouble2FloatSortedMapMap.keySet()public FloatCollection values()
In addition to the semantics of Map.values(), you can
safely cast the collection returned by this call to a type-specific
collection interface.
values in interface Double2FloatMapvalues in interface Double2FloatSortedMapvalues in interface Map<Double,Float>values in interface SortedMap<Double,Float>values in class AbstractDouble2FloatSortedMapMap.values()public DoubleComparator comparator()
Double2FloatSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Double2FloatSortedMapcomparator in interface SortedMap<Double,Float>SortedMap.comparator()public Double2FloatSortedMap headMap(double to)
Double2FloatSortedMaptoKey.headMap in interface Double2FloatSortedMapSortedMap.headMap(Object)public Double2FloatSortedMap tailMap(double from)
Double2FloatSortedMapfromKey.tailMap in interface Double2FloatSortedMapSortedMap.tailMap(Object)public Double2FloatSortedMap subMap(double from, double to)
Double2FloatSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Double2FloatSortedMapSortedMap.subMap(Object,Object)public Double2FloatRBTreeMap clone()
This method performs a deep copy of this tree map; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.