public class Int2IntArrayMap extends AbstractInt2IntMap 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.
AbstractInt2IntMap.BasicEntryInt2IntMap.Entry, Int2IntMap.FastEntrySet| Constructor and Description |
|---|
Int2IntArrayMap()
Creates a new empty array map.
|
Int2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2IntArrayMap(int[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2IntArrayMap(int[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2IntArrayMap(Int2IntMap m)
Creates a new empty array map copying the entries of a given map.
|
Int2IntArrayMap(Map<? extends Integer,? extends Integer> 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).
|
Int2IntArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractInt2IntMap.values(). |
int |
get(int k)
Returns the value to which the given key is mapped.
|
Int2IntMap.FastEntrySet |
int2IntEntrySet()
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.
|
int |
put(int k,
int v)
Adds a pair to the map.
|
int |
remove(int 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.
|
IntCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Int2IntArrayMap(int[] key,
int[] 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 Int2IntArrayMap()
public Int2IntArrayMap(int capacity)
capacity - the initial capacity.public Int2IntArrayMap(Int2IntMap m)
m - a map.public Int2IntArrayMap(Map<? extends Integer,? extends Integer> m)
m - a map.public Int2IntArrayMap(int[] key,
int[] 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 Int2IntMap.FastEntrySet int2IntEntrySet()
Int2IntMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Int2IntMap.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).
int2IntEntrySet in interface Int2IntMapInt2IntMap.entrySet()public int get(int k)
Int2IntFunctionget in interface Int2IntFunctionk - 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(int k)
AbstractInt2IntMapAbstractInt2IntMap.keySet().containsKey in interface Int2IntFunctioncontainsKey in class AbstractInt2IntMapFunction.containsKey(Object)public boolean containsValue(int v)
AbstractInt2IntMapAbstractInt2IntMap.values().containsValue in interface Int2IntMapcontainsValue in class AbstractInt2IntMapMap.containsValue(Object)public boolean isEmpty()
public int put(int k,
int v)
Int2IntFunctionput in interface Int2IntFunctionput in class AbstractInt2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(int k)
Int2IntFunctionremove in interface Int2IntFunctionremove in class AbstractInt2IntFunctionk - the key.Function.remove(Object)public IntSet keySet()
AbstractInt2IntMapThe view is backed by the set returned by AbstractInt2IntMap.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 Int2IntMapkeySet in interface Map<Integer,Integer>keySet in class AbstractInt2IntMapMap.keySet()public IntCollection values()
AbstractInt2IntMapThe view is backed by the set returned by AbstractInt2IntMap.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 Int2IntMapvalues in interface Map<Integer,Integer>values in class AbstractInt2IntMapMap.values()public Int2IntArrayMap 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.