public class Double2ObjectArrayMap<V> extends AbstractDouble2ObjectMap<V> 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.
AbstractDouble2ObjectMap.BasicEntry<V>Double2ObjectMap.Entry<V>, Double2ObjectMap.FastEntrySet<V>| Constructor and Description |
|---|
Double2ObjectArrayMap()
Creates a new empty array map.
|
Double2ObjectArrayMap(double[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2ObjectArrayMap(double[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Double2ObjectArrayMap(Double2ObjectMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Double2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2ObjectArrayMap(Map<? extends Double,? extends V> 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).
|
Double2ObjectArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractDouble2ObjectMap.values(). |
Double2ObjectMap.FastEntrySet<V> |
double2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
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.
|
V |
put(double k,
V v)
Adds a pair to the map.
|
V |
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.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecontainsKey, get, put, removepublic Double2ObjectArrayMap(double[] key,
Object[] 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 Double2ObjectArrayMap()
public Double2ObjectArrayMap(int capacity)
capacity - the initial capacity.public Double2ObjectArrayMap(Double2ObjectMap<V> m)
m - a map.public Double2ObjectArrayMap(Map<? extends Double,? extends V> m)
m - a map.public Double2ObjectArrayMap(double[] key,
Object[] 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 Double2ObjectMap.FastEntrySet<V> double2ObjectEntrySet()
Double2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2ObjectMap.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).
double2ObjectEntrySet in interface Double2ObjectMap<V>Double2ObjectMap.entrySet()public V get(double k)
Double2ObjectFunctionget in interface Double2ObjectFunction<V>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(double k)
AbstractDouble2ObjectMapAbstractDouble2ObjectMap.keySet().containsKey in interface Double2ObjectFunction<V>containsKey in class AbstractDouble2ObjectMap<V>Function.containsKey(Object)public boolean containsValue(Object v)
AbstractDouble2ObjectMapAbstractDouble2ObjectMap.values().containsValue in interface Map<Double,V>containsValue in class AbstractDouble2ObjectMap<V>public boolean isEmpty()
public V put(double k, V v)
Double2ObjectFunctionput in interface Double2ObjectFunction<V>put in class AbstractDouble2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(double k)
Double2ObjectFunctionremove in interface Double2ObjectFunction<V>remove in class AbstractDouble2ObjectFunction<V>Function.remove(Object)public DoubleSet keySet()
AbstractDouble2ObjectMapThe view is backed by the set returned by AbstractDouble2ObjectMap.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 Double2ObjectMap<V>keySet in interface Map<Double,V>keySet in class AbstractDouble2ObjectMap<V>Map.keySet()public ObjectCollection<V> values()
AbstractDouble2ObjectMapThe view is backed by the set returned by AbstractDouble2ObjectMap.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 Double2ObjectMap<V>values in interface Map<Double,V>values in class AbstractDouble2ObjectMap<V>Map.values()public Double2ObjectArrayMap<V> 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.