public class Double2LongArrayMap extends AbstractDouble2LongMap 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.
AbstractDouble2LongMap.BasicEntryDouble2LongMap.Entry, Double2LongMap.FastEntrySet| Constructor and Description |
|---|
Double2LongArrayMap()
Creates a new empty array map.
|
Double2LongArrayMap(double[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2LongArrayMap(double[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Double2LongArrayMap(Double2LongMap m)
Creates a new empty array map copying the entries of a given map.
|
Double2LongArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2LongArrayMap(Map<? extends Double,? extends Long> 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).
|
Double2LongArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractDouble2LongMap.values(). |
Double2LongMap.FastEntrySet |
double2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
long |
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.
|
long |
put(double k,
long v)
Adds a pair to the map.
|
long |
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.
|
LongCollection |
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, removecontainsKey, get, put, removepublic Double2LongArrayMap(double[] key,
long[] 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 Double2LongArrayMap()
public Double2LongArrayMap(int capacity)
capacity - the initial capacity.public Double2LongArrayMap(Double2LongMap m)
m - a map.public Double2LongArrayMap(Map<? extends Double,? extends Long> m)
m - a map.public Double2LongArrayMap(double[] key,
long[] 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 Double2LongMap.FastEntrySet double2LongEntrySet()
Double2LongMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2LongMap.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).
double2LongEntrySet in interface Double2LongMapDouble2LongMap.entrySet()public long get(double k)
Double2LongFunctionget in interface Double2LongFunctionk - 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)
AbstractDouble2LongMapAbstractDouble2LongMap.keySet().containsKey in interface Double2LongFunctioncontainsKey in class AbstractDouble2LongMapFunction.containsKey(Object)public boolean containsValue(long v)
AbstractDouble2LongMapAbstractDouble2LongMap.values().containsValue in interface Double2LongMapcontainsValue in class AbstractDouble2LongMapMap.containsValue(Object)public boolean isEmpty()
public long put(double k,
long v)
Double2LongFunctionput in interface Double2LongFunctionput in class AbstractDouble2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(double k)
Double2LongFunctionremove in interface Double2LongFunctionremove in class AbstractDouble2LongFunctionFunction.remove(Object)public DoubleSet keySet()
AbstractDouble2LongMapThe view is backed by the set returned by AbstractDouble2LongMap.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 Double2LongMapkeySet in interface Map<Double,Long>keySet in class AbstractDouble2LongMapMap.keySet()public LongCollection values()
AbstractDouble2LongMapThe view is backed by the set returned by AbstractDouble2LongMap.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 Double2LongMapvalues in interface Map<Double,Long>values in class AbstractDouble2LongMapMap.values()public Double2LongArrayMap 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.