public class Byte2DoubleArrayMap extends AbstractByte2DoubleMap implements java.io.Serializable, java.lang.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.BasicEntry, AbstractByte2DoubleMap.BasicEntrySet
Byte2DoubleMap.Entry, Byte2DoubleMap.FastEntrySet
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(java.util.Map<? extends java.lang.Byte,? extends java.lang.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 of the mappings from this map (optional operation).
|
Byte2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(double v)
Returns
true if this map maps one or more keys to the specified value. |
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 (optional operation).
|
double |
remove(byte k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
DoubleCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, mergeDouble, putAll, toString
defaultReturnValue, defaultReturnValue
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, forEach, get, getOrDefault, getOrDefault, merge, merge, mergeDouble, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsDouble, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public 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(java.util.Map<? extends java.lang.Byte,? extends java.lang.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()
Byte2DoubleMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.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).
byte2DoubleEntrySet
in interface Byte2DoubleMap
Map.entrySet()
public double get(byte k)
Byte2DoubleFunction
get
in interface Byte2DoubleFunction
k
- the key.Function.get(Object)
public int size()
Byte2DoubleMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.size
in interface Byte2DoubleMap
size
in interface java.util.Map<java.lang.Byte,java.lang.Double>
Size64
public void clear()
Byte2DoubleMap
clear
in interface Byte2DoubleMap
clear
in interface java.util.Map<java.lang.Byte,java.lang.Double>
Map.clear()
public boolean containsKey(byte k)
AbstractByte2DoubleMap
containsKey
in interface Byte2DoubleFunction
containsKey
in interface Byte2DoubleMap
containsKey
in class AbstractByte2DoubleMap
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(double v)
AbstractByte2DoubleMap
true
if this map maps one or more keys to the specified value.containsValue
in interface Byte2DoubleMap
containsValue
in class AbstractByte2DoubleMap
Map.containsValue(Object)
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Byte,java.lang.Double>
isEmpty
in class AbstractByte2DoubleMap
public double put(byte k, double v)
Byte2DoubleFunction
put
in interface Byte2DoubleFunction
k
- the key.v
- the value.Function.put(Object,Object)
public double remove(byte k)
Byte2DoubleFunction
remove
in interface Byte2DoubleFunction
k
- the key.Function.remove(Object)
public ByteSet keySet()
AbstractByte2DoubleMap
The view is backed by the set returned by Map.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 Byte2DoubleMap
keySet
in interface java.util.Map<java.lang.Byte,java.lang.Double>
keySet
in class AbstractByte2DoubleMap
Map.keySet()
public DoubleCollection values()
AbstractByte2DoubleMap
The view is backed by the set returned by Map.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 Byte2DoubleMap
values
in interface java.util.Map<java.lang.Byte,java.lang.Double>
values
in class AbstractByte2DoubleMap
Map.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.
clone
in class java.lang.Object