public class Byte2DoubleArrayMap extends AbstractByte2DoubleMap 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.
AbstractByte2DoubleMap.BasicEntryByte2DoubleMap.Entry, Byte2DoubleMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Byte2DoubleArrayMap()
Creates a new empty array map.
|
Byte2DoubleArrayMap(byte[] key,
double[] value)
Creates a new empty array map with given key and value backing arrays.
|
Byte2DoubleArrayMap(byte[] key,
double[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Byte2DoubleArrayMap(Byte2DoubleMap m)
Creates a new empty array map copying the entries of a given map.
|
Byte2DoubleArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Byte2DoubleArrayMap(Map<? extends Byte,? extends Double> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Byte2DoubleMap.FastEntrySet |
byte2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractByte2DoubleMap.values(). |
double |
get(byte k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ByteSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
double |
put(byte k,
double v)
Adds a pair to the map.
|
double |
remove(byte 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.
|
DoubleCollection |
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 Byte2DoubleArrayMap(byte[] 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 Byte2DoubleArrayMap()
public Byte2DoubleArrayMap(int capacity)
capacity - the initial capacity.public Byte2DoubleArrayMap(Byte2DoubleMap m)
m - a map.public Byte2DoubleArrayMap(Map<? extends Byte,? extends Double> m)
m - a map.public Byte2DoubleArrayMap(byte[] 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 Byte2DoubleMap.FastEntrySet byte2DoubleEntrySet()
Byte2DoubleMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2DoubleMap.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).
byte2DoubleEntrySet in interface Byte2DoubleMapByte2DoubleMap.entrySet()public double get(byte k)
Byte2DoubleFunctionget in interface Byte2DoubleFunctionk - 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(byte k)
AbstractByte2DoubleMapAbstractByte2DoubleMap.keySet().containsKey in interface Byte2DoubleFunctioncontainsKey in class AbstractByte2DoubleMapFunction.containsKey(Object)public boolean containsValue(double v)
AbstractByte2DoubleMapAbstractByte2DoubleMap.values().containsValue in interface Byte2DoubleMapcontainsValue in class AbstractByte2DoubleMapMap.containsValue(Object)public boolean isEmpty()
public double put(byte k,
double v)
Byte2DoubleFunctionput in interface Byte2DoubleFunctionput in class AbstractByte2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(byte k)
Byte2DoubleFunctionremove in interface Byte2DoubleFunctionremove in class AbstractByte2DoubleFunctionFunction.remove(Object)public ByteSet keySet()
AbstractByte2DoubleMapThe view is backed by the set returned by AbstractByte2DoubleMap.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 Byte2DoubleMapkeySet in interface Map<Byte,Double>keySet in class AbstractByte2DoubleMapMap.keySet()public DoubleCollection values()
AbstractByte2DoubleMapThe view is backed by the set returned by AbstractByte2DoubleMap.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 Byte2DoubleMapvalues in interface Map<Byte,Double>values in class AbstractByte2DoubleMapMap.values()public Byte2DoubleArrayMap 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.