public class Double2FloatArrayMap extends AbstractDouble2FloatMap 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.
AbstractDouble2FloatMap.BasicEntry, AbstractDouble2FloatMap.BasicEntrySetDouble2FloatMap.Entry, Double2FloatMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Double2FloatArrayMap()
Creates a new empty array map.
|
Double2FloatArrayMap(double[] key,
float[] value)
Creates a new empty array map with given key and value backing arrays.
|
Double2FloatArrayMap(double[] key,
float[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Double2FloatArrayMap(Double2FloatMap m)
Creates a new empty array map copying the entries of a given map.
|
Double2FloatArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Double2FloatArrayMap(Map<? extends Double,? extends Float> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Double2FloatArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(float v)
Returns
true if this map maps one or more keys to the specified value. |
Double2FloatMap.FastEntrySet |
double2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
float |
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.
|
float |
put(double k,
float v)
Adds a pair to the map (optional operation).
|
float |
remove(double k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
FloatCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsDoubleandThen, compose, identityforEach, replaceAllpublic Double2FloatArrayMap(double[] key,
float[] 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 Double2FloatArrayMap()
public Double2FloatArrayMap(int capacity)
capacity - the initial capacity.public Double2FloatArrayMap(Double2FloatMap m)
m - a map.public Double2FloatArrayMap(Map<? extends Double,? extends Float> m)
m - a map.public Double2FloatArrayMap(double[] key,
float[] 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 Double2FloatMap.FastEntrySet double2FloatEntrySet()
Double2FloatMapThis 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).
double2FloatEntrySet in interface Double2FloatMapMap.entrySet()public float get(double k)
Double2FloatFunctionget in interface Double2FloatFunctionk - the key.Function.get(Object)public int size()
Double2FloatMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Double2FloatMapclear in interface Double2FloatMapclear in interface Map<Double,Float>Map.clear()public boolean containsKey(double k)
Double2FloatMapcontainsKey in interface Double2FloatFunctioncontainsKey in interface Double2FloatMapcontainsKey in class AbstractDouble2FloatMapk - the key.key.Map.containsKey(Object)public boolean containsValue(float v)
Double2FloatMaptrue if this map maps one or more keys to the specified value.containsValue in interface Double2FloatMapcontainsValue in class AbstractDouble2FloatMapMap.containsValue(Object)public boolean isEmpty()
public float put(double k,
float v)
Double2FloatFunctionput in interface Double2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public float remove(double k)
Double2FloatFunctionremove in interface Double2FloatFunctionk - the key.Function.remove(Object)public DoubleSet keySet()
AbstractDouble2FloatMapThe 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 Double2FloatMapkeySet in interface Map<Double,Float>keySet in class AbstractDouble2FloatMapMap.keySet()public FloatCollection values()
AbstractDouble2FloatMapThe 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 Double2FloatMapvalues in interface Map<Double,Float>values in class AbstractDouble2FloatMapMap.values()public Double2FloatArrayMap 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 © 2020. All rights reserved.