public class Short2DoubleArrayMap extends AbstractShort2DoubleMap 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.
AbstractShort2DoubleMap.BasicEntry
Short2DoubleMap.Entry, Short2DoubleMap.FastEntrySet
Constructor and Description |
---|
Short2DoubleArrayMap()
Creates a new empty array map.
|
Short2DoubleArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2DoubleArrayMap(Map<? extends Short,? extends Double> m)
Creates a new empty array map copying the entries of a given map.
|
Short2DoubleArrayMap(short[] key,
double[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2DoubleArrayMap(short[] key,
double[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2DoubleArrayMap(Short2DoubleMap 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).
|
Short2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2DoubleMap.keySet() . |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractShort2DoubleMap.values() . |
double |
get(short k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ShortSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
double |
put(short k,
double v)
Adds a pair to the map.
|
double |
remove(short k)
Removes the mapping with the given key.
|
Short2DoubleMap.FastEntrySet |
short2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
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, toString
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
containsKey, get, put, remove
containsKey, get, put, remove
public Short2DoubleArrayMap(short[] 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 Short2DoubleArrayMap()
public Short2DoubleArrayMap(int capacity)
capacity
- the initial capacity.public Short2DoubleArrayMap(Short2DoubleMap m)
m
- a map.public Short2DoubleArrayMap(Map<? extends Short,? extends Double> m)
m
- a map.public Short2DoubleArrayMap(short[] 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 Short2DoubleMap.FastEntrySet short2DoubleEntrySet()
Short2DoubleMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2DoubleMap.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).
short2DoubleEntrySet
in interface Short2DoubleMap
Short2DoubleMap.entrySet()
public double get(short k)
Short2DoubleFunction
get
in interface Short2DoubleFunction
k
- the key.Function.get(Object)
public int size()
Function
Most 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()
Function
public boolean containsKey(short k)
AbstractShort2DoubleMap
AbstractShort2DoubleMap.keySet()
.containsKey
in interface Short2DoubleFunction
containsKey
in class AbstractShort2DoubleMap
Function.containsKey(Object)
public boolean containsValue(double v)
AbstractShort2DoubleMap
AbstractShort2DoubleMap.values()
.containsValue
in interface Short2DoubleMap
containsValue
in class AbstractShort2DoubleMap
Map.containsValue(Object)
public boolean isEmpty()
public double put(short k, double v)
Short2DoubleFunction
put
in interface Short2DoubleFunction
put
in class AbstractShort2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(short k)
Short2DoubleFunction
remove
in interface Short2DoubleFunction
remove
in class AbstractShort2DoubleFunction
Function.remove(Object)
public ShortSet keySet()
AbstractShort2DoubleMap
The view is backed by the set returned by AbstractShort2DoubleMap.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 Short2DoubleMap
keySet
in interface Map<Short,Double>
keySet
in class AbstractShort2DoubleMap
Map.keySet()
public DoubleCollection values()
AbstractShort2DoubleMap
The view is backed by the set returned by AbstractShort2DoubleMap.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 Short2DoubleMap
values
in interface Map<Short,Double>
values
in class AbstractShort2DoubleMap
Map.values()
public Short2DoubleArrayMap 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.