public class Object2DoubleArrayMap<K> extends AbstractObject2DoubleMap<K> 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.
AbstractObject2DoubleMap.BasicEntry<K>Object2DoubleMap.Entry<K>, Object2DoubleMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2DoubleArrayMap()
Creates a new empty array map.
|
Object2DoubleArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2DoubleArrayMap(Map<? extends K,? extends Double> m)
Creates a new empty array map copying the entries of a given map.
|
Object2DoubleArrayMap(Object[] key,
double[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2DoubleArrayMap(Object[] key,
double[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Object2DoubleArrayMap(Object2DoubleMap<K> 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).
|
Object2DoubleArrayMap<K> |
clone()
Returns a deep copy of this map.
|
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(). |
double |
getDouble(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2DoubleMap.FastEntrySet<K> |
object2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
double |
put(K k,
double v)
Adds a pair to the map.
|
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.
|
DoubleCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Object2DoubleArrayMap(Object[] 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 Object2DoubleArrayMap()
public Object2DoubleArrayMap(int capacity)
capacity - the initial capacity.public Object2DoubleArrayMap(Object2DoubleMap<K> m)
m - a map.public Object2DoubleArrayMap(Map<? extends K,? extends Double> m)
m - a map.public Object2DoubleArrayMap(Object[] 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 Object2DoubleMap.FastEntrySet<K> object2DoubleEntrySet()
Object2DoubleMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Object2DoubleMap.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).
object2DoubleEntrySet in interface Object2DoubleMap<K>Object2DoubleMap.entrySet()public double getDouble(Object k)
Object2DoubleFunctiongetDouble in interface Object2DoubleFunction<K>k - 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(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 boolean containsValue(double v)
AbstractObject2DoubleMapAbstractObject2DoubleMap.values().containsValue in interface Object2DoubleMap<K>containsValue in class AbstractObject2DoubleMap<K>Map.containsValue(Object)public boolean isEmpty()
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 ObjectSet<K> keySet()
AbstractObject2DoubleMapThe view is backed by the set returned by AbstractObject2DoubleMap.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 Object2DoubleMap<K>keySet in interface Map<K,Double>keySet in class AbstractObject2DoubleMap<K>Map.keySet()public DoubleCollection values()
AbstractObject2DoubleMapThe view is backed by the set returned by AbstractObject2DoubleMap.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 Object2DoubleMap<K>values in interface Map<K,Double>values in class AbstractObject2DoubleMap<K>Map.values()public Object2DoubleArrayMap<K> 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.