public class Double2IntArrayMap extends AbstractDouble2IntMap 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.
AbstractDouble2IntMap.BasicEntryDouble2IntMap.Entry, Double2IntMap.FastEntrySet| Constructor and Description |
|---|
Double2IntArrayMap()
Creates a new empty array map.
|
Double2IntArrayMap(double[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2IntArrayMap(double[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using
the given number of elements.
|
Double2IntArrayMap(Double2IntMap m)
Creates a new empty array map copying the entries of a given map.
|
Double2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2IntArrayMap(Map<? extends Double,? extends Integer> 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).
|
Double2IntArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractDouble2IntMap.values(). |
Double2IntMap.FastEntrySet |
double2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
int |
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.
|
int |
put(double k,
int v)
Adds a pair to the map.
|
int |
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.
|
IntCollection |
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 Double2IntArrayMap(double[] key,
int[] 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 Double2IntArrayMap()
public Double2IntArrayMap(int capacity)
capacity - the initial capacity.public Double2IntArrayMap(Double2IntMap m)
m - a map.public Double2IntArrayMap(Map<? extends Double,? extends Integer> m)
m - a map.public Double2IntArrayMap(double[] key,
int[] 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 Double2IntMap.FastEntrySet double2IntEntrySet()
Double2IntMap
This method is necessary because there is no inheritance along type
parameters: it is thus impossible to strengthen Double2IntMap.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).
double2IntEntrySet in interface Double2IntMapDouble2IntMap.entrySet()public int get(double k)
Double2IntFunctionget in interface Double2IntFunctionk - 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)
AbstractDouble2IntMapAbstractDouble2IntMap.keySet().containsKey in interface Double2IntFunctioncontainsKey in class AbstractDouble2IntMapFunction.containsKey(Object)public boolean containsValue(int v)
AbstractDouble2IntMapAbstractDouble2IntMap.values().containsValue in interface Double2IntMapcontainsValue in class AbstractDouble2IntMapMap.containsValue(Object)public boolean isEmpty()
public int put(double k,
int v)
Double2IntFunctionput in interface Double2IntFunctionput in class AbstractDouble2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(double k)
Double2IntFunctionremove in interface Double2IntFunctionremove in class AbstractDouble2IntFunctionk - the key.Function.remove(Object)public DoubleSet keySet()
AbstractDouble2IntMap
The view is backed by the set returned by AbstractDouble2IntMap.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 Double2IntMapkeySet in interface Map<Double,Integer>keySet in class AbstractDouble2IntMapMap.keySet()public IntCollection values()
AbstractDouble2IntMap
The view is backed by the set returned by AbstractDouble2IntMap.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 Double2IntMapvalues in interface Map<Double,Integer>values in class AbstractDouble2IntMapMap.values()public Double2IntArrayMap 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.