public class Double2ShortArrayMap extends AbstractDouble2ShortMap 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.
AbstractDouble2ShortMap.BasicEntryDouble2ShortMap.Entry, Double2ShortMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Double2ShortArrayMap()
Creates a new empty array map.
|
Double2ShortArrayMap(double[] key,
short[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2ShortArrayMap(double[] key,
short[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Double2ShortArrayMap(Double2ShortMap m)
Creates a new empty array map copying the entries of a given map.
|
Double2ShortArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2ShortArrayMap(Map<? extends Double,? extends Short> 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).
|
Double2ShortArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractDouble2ShortMap.values(). |
Double2ShortMap.FastEntrySet |
double2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
short |
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.
|
short |
put(double k,
short v)
Adds a pair to the map.
|
short |
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.
|
ShortCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removefinalize, getClass, notify, notifyAll, wait, wait, waitdefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecontainsKey, get, put, removepublic Double2ShortArrayMap(double[] key,
short[] 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 Double2ShortArrayMap()
public Double2ShortArrayMap(int capacity)
capacity - the initial capacity.public Double2ShortArrayMap(Double2ShortMap m)
m - a map.public Double2ShortArrayMap(Map<? extends Double,? extends Short> m)
m - a map.public Double2ShortArrayMap(double[] key,
short[] 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 Double2ShortMap.FastEntrySet double2ShortEntrySet()
Double2ShortMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2ShortMap.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).
double2ShortEntrySet in interface Double2ShortMapDouble2ShortMap.entrySet()public short get(double k)
Double2ShortFunctionget in interface Double2ShortFunctionk - 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)
AbstractDouble2ShortMapAbstractDouble2ShortMap.keySet().containsKey in interface Double2ShortFunctioncontainsKey in class AbstractDouble2ShortMapFunction.containsKey(Object)public boolean containsValue(short v)
AbstractDouble2ShortMapAbstractDouble2ShortMap.values().containsValue in interface Double2ShortMapcontainsValue in class AbstractDouble2ShortMapMap.containsValue(Object)public boolean isEmpty()
public short put(double k,
short v)
Double2ShortFunctionput in interface Double2ShortFunctionput in class AbstractDouble2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(double k)
Double2ShortFunctionremove in interface Double2ShortFunctionremove in class AbstractDouble2ShortFunctionFunction.remove(Object)public DoubleSet keySet()
AbstractDouble2ShortMapThe view is backed by the set returned by AbstractDouble2ShortMap.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 Double2ShortMapkeySet in interface Map<Double,Short>keySet in class AbstractDouble2ShortMapMap.keySet()public ShortCollection values()
AbstractDouble2ShortMapThe view is backed by the set returned by AbstractDouble2ShortMap.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 Double2ShortMapvalues in interface Map<Double,Short>values in class AbstractDouble2ShortMapMap.values()public Double2ShortArrayMap 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.
Copyright © 2013. All Rights Reserved.