public class Double2DoubleArrayMap extends AbstractDouble2DoubleMap implements Serializable, Cloneable
The main purpose of this implementation is that of wrapping cleanly the brute-force approach to the storage of a very small number of pairs: just put them into two parallel arrays and scan linearly to find an item.
AbstractDouble2DoubleMap.BasicEntryDouble2DoubleMap.Entry, Double2DoubleMap.FastEntrySet| Constructor and Description |
|---|
Double2DoubleArrayMap()
Creates a new empty array map.
|
Double2DoubleArrayMap(double[] key,
double[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2DoubleArrayMap(double[] key,
double[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Double2DoubleArrayMap(Double2DoubleMap m)
Creates a new empty array map copying the entries of a given map.
|
Double2DoubleArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2DoubleArrayMap(Map<? extends Double,? extends Double> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Double2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractDouble2DoubleMap.values(). |
Double2DoubleMap.FastEntrySet |
double2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
double |
get(double k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
DoubleSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
double |
put(double k,
double v)
Adds a pair to the map.
|
double |
remove(double 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.
|
DoubleCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Double2DoubleArrayMap(double[] key,
double[] value)
It is responsibility of the caller that the elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).public Double2DoubleArrayMap()
public Double2DoubleArrayMap(int capacity)
capacity - the initial capacity.public Double2DoubleArrayMap(Double2DoubleMap m)
m - a map.public Double2DoubleArrayMap(Map<? extends Double,? extends Double> m)
m - a map.public Double2DoubleArrayMap(double[] key,
double[] value,
int size)
It is responsibility of the caller that the first size elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).size - the number of valid elements in key and value.public Double2DoubleMap.FastEntrySet double2DoubleEntrySet()
Double2DoubleMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Double2DoubleMap.entrySet() so that it returns an
ObjectSet of objects of type Map.Entry (the latter makes it possible to access keys and values with type-specific methods).
double2DoubleEntrySet in interface Double2DoubleMapDouble2DoubleMap.entrySet()public double get(double k)
Double2DoubleFunctionget in interface Double2DoubleFunctionk - the key.Function.get(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 void clear()
Functionpublic boolean containsKey(double k)
AbstractDouble2DoubleMapAbstractDouble2DoubleMap.keySet().containsKey in interface Double2DoubleFunctioncontainsKey in class AbstractDouble2DoubleMapFunction.containsKey(Object)public boolean containsValue(double v)
AbstractDouble2DoubleMapAbstractDouble2DoubleMap.values().containsValue in interface Double2DoubleMapcontainsValue in class AbstractDouble2DoubleMapMap.containsValue(Object)public boolean isEmpty()
public double put(double k,
double v)
Double2DoubleFunctionput in interface Double2DoubleFunctionput in class AbstractDouble2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(double k)
Double2DoubleFunctionremove in interface Double2DoubleFunctionremove in class AbstractDouble2DoubleFunctionk - the key.Function.remove(Object)public DoubleSet keySet()
AbstractDouble2DoubleMapThe view is backed by the set returned by AbstractDouble2DoubleMap.entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes that
lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient
ad-hoc implementations.
keySet in interface Double2DoubleMapkeySet in interface Map<Double,Double>keySet in class AbstractDouble2DoubleMapMap.keySet()public DoubleCollection values()
AbstractDouble2DoubleMapThe view is backed by the set returned by AbstractDouble2DoubleMap.entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes that
lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient
ad-hoc implementations.
values in interface Double2DoubleMapvalues in interface Map<Double,Double>values in class AbstractDouble2DoubleMapMap.values()public Double2DoubleArrayMap clone()
This method performs a deep copy of this hash map; the data stored in the map, however, is not cloned. Note that this makes a difference only for object keys.