Function<K,java.lang.Integer>, Object2IntFunction<K>, Object2IntMap<K>, java.io.Serializable, java.lang.Cloneable, java.util.function.Function<K,java.lang.Integer>, java.util.function.ToIntFunction<K>, java.util.Map<K,java.lang.Integer>public class Object2IntArrayMap<K> extends AbstractObject2IntMap<K> 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.
AbstractObject2IntMap.BasicEntry<K>, AbstractObject2IntMap.BasicEntrySet<K>Object2IntMap.Entry<K>, Object2IntMap.FastEntrySet<K>| Constructor | Description |
|---|---|
Object2IntArrayMap() |
Creates a new empty array map.
|
Object2IntArrayMap(int capacity) |
Creates a new empty array map of given capacity.
|
Object2IntArrayMap(Object2IntMap<K> m) |
Creates a new empty array map copying the entries of a given map.
|
Object2IntArrayMap(java.lang.Object[] key,
int[] value) |
Creates a new empty array map with given key and value backing arrays.
|
Object2IntArrayMap(java.lang.Object[] key,
int[] value,
int size) |
Creates a new array map with given key and value backing arrays, using the
given number of elements.
|
Object2IntArrayMap(java.util.Map<? extends K,? extends java.lang.Integer> m) |
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
clear() |
Removes all of the mappings from this map (optional operation).
|
Object2IntArrayMap<K> |
clone() |
Returns a deep copy of this map.
|
boolean |
containsKey(java.lang.Object k) |
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(int v) |
Returns
true if this map maps one or more keys to the specified
value. |
int |
getInt(java.lang.Object k) |
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
|
ObjectSet<K> |
keySet() |
Returns a type-specific-set view of the keys of this map.
|
Object2IntMap.FastEntrySet<K> |
object2IntEntrySet() |
Returns a type-specific set view of the mappings contained in this map.
|
int |
put(K k,
int v) |
Adds a pair to the map (optional operation).
|
int |
removeInt(java.lang.Object k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
IntCollection |
values() |
Returns a type-specific-set view of the values of this map.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringcompute, computeIfAbsent, computeIfPresent, forEach, replaceAllapplyAsIntcomputeInt, computeIntIfAbsent, computeIntIfAbsentPartial, computeIntIfPresent, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, mergeInt, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacepublic Object2IntArrayMap(java.lang.Object[] 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 Object2IntArrayMap()
public Object2IntArrayMap(int capacity)
capacity - the initial capacity.public Object2IntArrayMap(Object2IntMap<K> m)
m - a map.public Object2IntArrayMap(java.util.Map<? extends K,? extends java.lang.Integer> m)
m - a map.public Object2IntArrayMap(java.lang.Object[] 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 Object2IntMap.FastEntrySet<K> object2IntEntrySet()
Object2IntMap
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).
object2IntEntrySet in interface Object2IntMap<K>Map.entrySet()public int getInt(java.lang.Object k)
Object2IntFunctiongetInt in interface Object2IntFunction<K>k - the key.Function.get(Object)public int size()
Object2IntMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Object2IntMappublic boolean containsKey(java.lang.Object k)
Object2IntMapcontainsKey in interface Function<K,java.lang.Integer>containsKey in interface java.util.Map<K,java.lang.Integer>containsKey in interface Object2IntMap<K>containsKey in class AbstractObject2IntMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(int v)
Object2IntMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Object2IntMap<K>containsValue in class AbstractObject2IntMap<K>Map.containsValue(Object)public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Integer>isEmpty in class AbstractObject2IntMap<K>public int put(K k, int v)
Object2IntFunctionput in interface Object2IntFunction<K>k - the key.v - the value.Function.put(Object,Object)public int removeInt(java.lang.Object k)
Object2IntFunctionremoveInt in interface Object2IntFunction<K>k - the key.Function.remove(Object)public ObjectSet<K> keySet()
AbstractObject2IntMap
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 java.util.Map<K,java.lang.Integer>keySet in interface Object2IntMap<K>keySet in class AbstractObject2IntMap<K>Map.keySet()public IntCollection values()
AbstractObject2IntMap
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 java.util.Map<K,java.lang.Integer>values in interface Object2IntMap<K>values in class AbstractObject2IntMap<K>Map.values()public Object2IntArrayMap<K> 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.