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 of the mappings from this map (optional operation).
|
Double2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(double v)
Returns
true if this map maps one or more keys to the specified
value. |
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()
Returns true if this map contains no key-value mappings.
|
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 (optional operation).
|
double |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
DoubleCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsDoubleandThen, compose, identityforEach, 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()
Double2DoubleMap
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).
double2DoubleEntrySet in interface Double2DoubleMapMap.entrySet()public double get(double k)
Double2DoubleFunctionget in interface Double2DoubleFunctionk - the key.Function.get(Object)public int size()
Double2DoubleMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Double2DoubleMapclear in interface Double2DoubleMapclear in interface Map<Double,Double>Map.clear()public boolean containsKey(double k)
Double2DoubleMapcontainsKey in interface Double2DoubleFunctioncontainsKey in interface Double2DoubleMapcontainsKey in class AbstractDouble2DoubleMapk - the key.key.Map.containsKey(Object)public boolean containsValue(double v)
Double2DoubleMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Double2DoubleMapcontainsValue in class AbstractDouble2DoubleMapMap.containsValue(Object)public boolean isEmpty()
java.util.Mappublic double put(double k,
double v)
Double2DoubleFunctionput in interface Double2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(double k)
Double2DoubleFunctionremove in interface Double2DoubleFunctionk - the key.Function.remove(Object)public DoubleSet keySet()
AbstractDouble2DoubleMap
The view is backed by the set returned by Map.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()
AbstractDouble2DoubleMap
The view is backed by the set returned by Map.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.