public class Float2DoubleRBTreeMap extends AbstractFloat2DoubleSortedMap 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.
AbstractFloat2DoubleMap.BasicEntryFloat2DoubleSortedMap.FastSortedEntrySetFloat2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Float2DoubleRBTreeMap()
Creates a new empty tree map.
|
Float2DoubleRBTreeMap(Comparator<? super Float> c)
Creates a new empty tree map with the given comparator.
|
Float2DoubleRBTreeMap(float[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Float2DoubleRBTreeMap(float[] k,
double[] v,
Comparator<? super Float> c)
Creates a new tree map using the elements of two parallel arrays and the
given comparator.
|
Float2DoubleRBTreeMap(Float2DoubleMap m)
Creates a new tree map copying a given map.
|
Float2DoubleRBTreeMap(Float2DoubleSortedMap m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Float2DoubleRBTreeMap(Map<? extends Float,? extends Double> m)
Creates a new tree map copying a given map.
|
Float2DoubleRBTreeMap(SortedMap<Float,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(float k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2DoubleRBTreeMap |
clone()
Returns a deep copy of this tree map.
|
FloatComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(float k)
Checks whether the given value is contained in
AbstractFloat2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractFloat2DoubleMap.values(). |
float |
firstFloatKey() |
ObjectSortedSet<Float2DoubleMap.Entry> |
float2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
get(float k)
Returns the value to which the given key is mapped.
|
Float2DoubleSortedMap |
headMap(float to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
FloatSortedSet |
keySet()
Returns a type-specific sorted set view of the keys contained in this
map.
|
float |
lastFloatKey() |
double |
put(float k,
double v)
Adds a pair to the map.
|
Double |
put(Float ok,
Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
remove(float k)
Removes the mapping with the given key.
|
Double |
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.
|
Float2DoubleSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2DoubleSortedMap |
tailMap(float from)
Returns a view of the portion of this sorted map whose keys are greater
than or equal to
fromKey. |
DoubleCollection |
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 Float2DoubleRBTreeMap()
public Float2DoubleRBTreeMap(Comparator<? super Float> c)
c - a (possibly type-specific) comparator.public Float2DoubleRBTreeMap(Map<? extends Float,? extends Double> m)
m - a Map to be copied into the new tree map.public Float2DoubleRBTreeMap(SortedMap<Float,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Float2DoubleRBTreeMap(Float2DoubleMap m)
m - a type-specific map to be copied into the new tree map.public Float2DoubleRBTreeMap(Float2DoubleSortedMap m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Float2DoubleRBTreeMap(float[] k,
double[] v,
Comparator<? super Float> 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 Float2DoubleRBTreeMap(float[] k,
double[] 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 double addTo(float k,
double 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 double put(float k,
double v)
Float2DoubleFunctionput in interface Float2DoubleFunctionput in class AbstractFloat2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(float k)
Float2DoubleFunctionremove in interface Float2DoubleFunctionremove in class AbstractFloat2DoubleFunctionk - the key.Function.remove(Object)@Deprecated public Double put(Float ok, Double 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<Float,Double>put in interface Map<Float,Double>put in class AbstractFloat2DoubleFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)@Deprecated public Double 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(double v)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.values().containsValue in interface Float2DoubleMapcontainsValue in class AbstractFloat2DoubleMapMap.containsValue(Object)public void clear()
Functionpublic boolean containsKey(float k)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.keySet().containsKey in interface Float2DoubleFunctioncontainsKey in class AbstractFloat2DoubleMapFunction.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 double get(float k)
Float2DoubleFunctionget in interface Float2DoubleFunctionk - the key.Function.get(Object)public float firstFloatKey()
firstFloatKey in interface Float2DoubleSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2DoubleSortedMapSortedMap.lastKey()public ObjectSortedSet<Float2DoubleMap.Entry> float2DoubleEntrySet()
Float2DoubleSortedMapfloat2DoubleEntrySet in interface Float2DoubleMapfloat2DoubleEntrySet in interface Float2DoubleSortedMapFloat2DoubleSortedMap.entrySet()public FloatSortedSet 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 Float2DoubleMapkeySet in interface Float2DoubleSortedMapkeySet in interface Map<Float,Double>keySet in interface SortedMap<Float,Double>keySet in class AbstractFloat2DoubleSortedMapMap.keySet()public DoubleCollection 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 Float2DoubleMapvalues in interface Float2DoubleSortedMapvalues in interface Map<Float,Double>values in interface SortedMap<Float,Double>values in class AbstractFloat2DoubleSortedMapMap.values()public FloatComparator comparator()
Float2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Float2DoubleSortedMapcomparator in interface SortedMap<Float,Double>SortedMap.comparator()public Float2DoubleSortedMap headMap(float to)
Float2DoubleSortedMaptoKey.headMap in interface Float2DoubleSortedMapSortedMap.headMap(Object)public Float2DoubleSortedMap tailMap(float from)
Float2DoubleSortedMapfromKey.tailMap in interface Float2DoubleSortedMapSortedMap.tailMap(Object)public Float2DoubleSortedMap subMap(float from, float to)
Float2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2DoubleSortedMapSortedMap.subMap(Object,Object)public Float2DoubleRBTreeMap 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.