public class Object2DoubleRBTreeMap<K> extends AbstractObject2DoubleSortedMap<K> 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.
AbstractObject2DoubleMap.BasicEntry<K>Object2DoubleSortedMap.FastSortedEntrySet<K>Object2DoubleMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2DoubleRBTreeMap()
Creates a new empty tree map.
|
Object2DoubleRBTreeMap(Comparator<? super K> c)
Creates a new empty tree map with the given comparator.
|
Object2DoubleRBTreeMap(K[] k,
double[] v)
Creates a new tree map using the elements of two parallel arrays.
|
Object2DoubleRBTreeMap(K[] k,
double[] v,
Comparator<? super K> c)
Creates a new tree map using the elements of two parallel arrays and the given comparator.
|
Object2DoubleRBTreeMap(Map<? extends K,? extends Double> m)
Creates a new tree map copying a given map.
|
Object2DoubleRBTreeMap(Object2DoubleMap<? extends K> m)
Creates a new tree map copying a given map.
|
Object2DoubleRBTreeMap(Object2DoubleSortedMap<K> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
Object2DoubleRBTreeMap(SortedMap<K,Double> m)
Creates a new tree map copying a given sorted map (and its
Comparator). |
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2DoubleRBTreeMap<K> |
clone()
Returns a deep copy of this tree map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractObject2DoubleMap.values(). |
K |
firstKey() |
Double |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
getDouble(Object k)
Returns the value to which the given key is mapped.
|
Object2DoubleSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific sorted set view of the keys contained in this map.
|
K |
lastKey() |
ObjectSortedSet<Object2DoubleMap.Entry<K>> |
object2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
double |
put(K k,
double v)
Adds a pair to the map.
|
Double |
put(K ok,
Double ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
Double |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
double |
removeDouble(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
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. |
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySetcontainsValue, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, containsValue, equals, forEach, getOrDefault, hashCode, merge, putAll, putIfAbsent, remove, replace, replace, replaceAllpublic Object2DoubleRBTreeMap()
public Object2DoubleRBTreeMap(Comparator<? super K> c)
c - a (possibly type-specific) comparator.public Object2DoubleRBTreeMap(Map<? extends K,? extends Double> m)
m - a Map to be copied into the new tree map.public Object2DoubleRBTreeMap(SortedMap<K,Double> m)
Comparator).m - a SortedMap to be copied into the new tree map.public Object2DoubleRBTreeMap(Object2DoubleMap<? extends K> m)
m - a type-specific map to be copied into the new tree map.public Object2DoubleRBTreeMap(Object2DoubleSortedMap<K> m)
Comparator).m - a type-specific sorted map to be copied into the new tree map.public Object2DoubleRBTreeMap(K[] k, double[] v, Comparator<? super K> 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 Object2DoubleRBTreeMap(K[] 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 put(K k, double v)
Object2DoubleFunctionput in interface Object2DoubleFunction<K>put in class AbstractObject2DoubleFunction<K>k - the key.v - the value.Function.put(Object,Object)public double removeDouble(Object k)
Object2DoubleFunctionremoveDouble in interface Object2DoubleFunction<K>removeDouble in class AbstractObject2DoubleFunction<K>k - the key.Function.remove(Object)public Double put(K ok, Double ov)
AbstractObject2DoubleFunctionnull 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<K,Double>put in interface Map<K,Double>put in class AbstractObject2DoubleFunction<K>ok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public Double remove(Object ok)
AbstractObject2DoubleFunctionnull 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)
AbstractObject2DoubleMapAbstractObject2DoubleMap.values().containsValue in interface Object2DoubleMap<K>containsValue in class AbstractObject2DoubleMap<K>Map.containsValue(Object)public void clear()
Functionpublic boolean containsKey(Object k)
AbstractObject2DoubleMapAbstractObject2DoubleMap.keySet().containsKey in interface Function<K,Double>containsKey in interface Map<K,Double>containsKey in class AbstractObject2DoubleMap<K>k - the key.key.Map.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 getDouble(Object k)
Object2DoubleFunctiongetDouble in interface Object2DoubleFunction<K>k - the key.Function.get(Object)public Double get(Object ok)
AbstractObject2DoubleFunctionnull 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 ObjectSortedSet<Object2DoubleMap.Entry<K>> object2DoubleEntrySet()
Object2DoubleSortedMapobject2DoubleEntrySet in interface Object2DoubleMap<K>object2DoubleEntrySet in interface Object2DoubleSortedMap<K>Object2DoubleSortedMap.entrySet()public ObjectSortedSet<K> 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 Object2DoubleMap<K>keySet in interface Object2DoubleSortedMap<K>keySet in interface Map<K,Double>keySet in interface SortedMap<K,Double>keySet in class AbstractObject2DoubleSortedMap<K>Map.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 Object2DoubleMap<K>values in interface Object2DoubleSortedMap<K>values in interface Map<K,Double>values in interface SortedMap<K,Double>values in class AbstractObject2DoubleSortedMap<K>Map.values()public Comparator<? super K> comparator()
Object2DoubleSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2DoubleSortedMap<K>comparator in interface SortedMap<K,Double>SortedMap.comparator()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>SortedMap.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>SortedMap.tailMap(Object)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>SortedMap.subMap(Object,Object)public Object2DoubleRBTreeMap<K> 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.