public class Int2DoubleArrayMap extends AbstractInt2DoubleMap 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.
AbstractInt2DoubleMap.BasicEntry, AbstractInt2DoubleMap.BasicEntrySetInt2DoubleMap.Entry, Int2DoubleMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Int2DoubleArrayMap()
Creates a new empty array map.
|
Int2DoubleArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2DoubleArrayMap(int[] key,
double[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2DoubleArrayMap(int[] key,
double[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2DoubleArrayMap(Int2DoubleMap m)
Creates a new empty array map copying the entries of a given map.
|
Int2DoubleArrayMap(Map<? extends Integer,? extends Double> 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).
|
Int2DoubleArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int 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(int k)
Returns the value to which the given key is mapped.
|
Int2DoubleMap.FastEntrySet |
int2DoubleEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
double |
put(int k,
double v)
Adds a pair to the map (optional operation).
|
double |
remove(int 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, 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, replaceapplyAsDoubleforEach, replaceAllpublic Int2DoubleArrayMap(int[] 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 Int2DoubleArrayMap()
public Int2DoubleArrayMap(int capacity)
capacity - the initial capacity.public Int2DoubleArrayMap(Int2DoubleMap m)
m - a map.public Int2DoubleArrayMap(Map<? extends Integer,? extends Double> m)
m - a map.public Int2DoubleArrayMap(int[] 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 Int2DoubleMap.FastEntrySet int2DoubleEntrySet()
Int2DoubleMapThis 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).
int2DoubleEntrySet in interface Int2DoubleMapMap.entrySet()public double get(int k)
Int2DoubleFunctionget in interface Int2DoubleFunctionk - the key.Function.get(Object)public int size()
Int2DoubleMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Int2DoubleMapclear in interface Int2DoubleMapclear in interface Map<Integer,Double>Map.clear()public boolean containsKey(int k)
Int2DoubleMapcontainsKey in interface Int2DoubleFunctioncontainsKey in interface Int2DoubleMapcontainsKey in class AbstractInt2DoubleMapk - the key.key.Map.containsKey(Object)public boolean containsValue(double v)
Int2DoubleMaptrue if this map maps one or more keys to the specified value.containsValue in interface Int2DoubleMapcontainsValue in class AbstractInt2DoubleMapMap.containsValue(Object)public boolean isEmpty()
public double put(int k,
double v)
Int2DoubleFunctionput in interface Int2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)public double remove(int k)
Int2DoubleFunctionremove in interface Int2DoubleFunctionk - the key.Function.remove(Object)public IntSet keySet()
AbstractInt2DoubleMapThe 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 Int2DoubleMapkeySet in interface Map<Integer,Double>keySet in class AbstractInt2DoubleMapMap.keySet()public DoubleCollection values()
AbstractInt2DoubleMapThe 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 Int2DoubleMapvalues in interface Map<Integer,Double>values in class AbstractInt2DoubleMapMap.values()public Int2DoubleArrayMap 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.