public class Int2ObjectArrayMap<V> extends AbstractInt2ObjectMap<V> 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.
AbstractInt2ObjectMap.BasicEntry<V>, AbstractInt2ObjectMap.BasicEntrySet<V>Int2ObjectMap.Entry<V>, Int2ObjectMap.FastEntrySet<V>| Constructor and Description |
|---|
Int2ObjectArrayMap()
Creates a new empty array map.
|
Int2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2ObjectArrayMap(int[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2ObjectArrayMap(int[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2ObjectArrayMap(Int2ObjectMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Int2ObjectArrayMap(Map<? extends Integer,? extends V> 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).
|
Int2ObjectArrayMap<V> |
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(Object v) |
V |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ObjectMap.FastEntrySet<V> |
int2ObjectEntrySet()
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.
|
V |
put(int k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(int k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyforEach, replaceAllpublic Int2ObjectArrayMap(int[] key,
Object[] 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 Int2ObjectArrayMap()
public Int2ObjectArrayMap(int capacity)
capacity - the initial capacity.public Int2ObjectArrayMap(Int2ObjectMap<V> m)
m - a map.public Int2ObjectArrayMap(Map<? extends Integer,? extends V> m)
m - a map.public Int2ObjectArrayMap(int[] key,
Object[] 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 Int2ObjectMap.FastEntrySet<V> int2ObjectEntrySet()
Int2ObjectMapThis 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).
int2ObjectEntrySet in interface Int2ObjectMap<V>Map.entrySet()public V get(int k)
Int2ObjectFunctionget in interface Int2ObjectFunction<V>k - the key.Function.get(Object)public int size()
Int2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Int2ObjectMapclear in interface Int2ObjectMap<V>clear in interface Map<Integer,V>Map.clear()public boolean containsKey(int k)
Int2ObjectMapcontainsKey in interface Int2ObjectFunction<V>containsKey in interface Int2ObjectMap<V>containsKey in class AbstractInt2ObjectMap<V>k - the key.key.Map.containsKey(Object)public boolean containsValue(Object v)
containsValue in interface Map<Integer,V>containsValue in class AbstractInt2ObjectMap<V>public boolean isEmpty()
public V put(int k, V v)
Int2ObjectFunctionput in interface Int2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(int k)
Int2ObjectFunctionremove in interface Int2ObjectFunction<V>k - the key.Function.remove(Object)public IntSet keySet()
AbstractInt2ObjectMapThe 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 Int2ObjectMap<V>keySet in interface Map<Integer,V>keySet in class AbstractInt2ObjectMap<V>Map.keySet()public ObjectCollection<V> values()
AbstractInt2ObjectMapThe 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 Int2ObjectMap<V>values in interface Map<Integer,V>values in class AbstractInt2ObjectMap<V>Map.values()public Int2ObjectArrayMap<V> 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.