public class Reference2IntArrayMap<K> extends AbstractReference2IntMap<K> 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.
AbstractReference2IntMap.BasicEntry<K>Reference2IntMap.Entry<K>, Reference2IntMap.FastEntrySet<K>| Constructor and Description |
|---|
Reference2IntArrayMap()
Creates a new empty array map.
|
Reference2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2IntArrayMap(Map<? extends K,? extends Integer> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2IntArrayMap(Object[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2IntArrayMap(Object[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2IntArrayMap(Reference2IntMap<K> 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).
|
Reference2IntArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractReference2IntMap.keySet(). |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractReference2IntMap.values(). |
int |
getInt(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
int |
put(K k,
int v)
Adds a pair to the map.
|
Reference2IntMap.FastEntrySet<K> |
reference2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
int |
removeInt(Object 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, toStringdefaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Reference2IntArrayMap(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 Reference2IntArrayMap()
public Reference2IntArrayMap(int capacity)
capacity - the initial capacity.public Reference2IntArrayMap(Reference2IntMap<K> m)
m - a map.public Reference2IntArrayMap(Map<? extends K,? extends Integer> m)
m - a map.public Reference2IntArrayMap(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 Reference2IntMap.FastEntrySet<K> reference2IntEntrySet()
Reference2IntMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Reference2IntMap.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).
reference2IntEntrySet in interface Reference2IntMap<K>Reference2IntMap.entrySet()public int getInt(Object k)
Reference2IntFunctiongetInt in interface Reference2IntFunction<K>k - 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(Object k)
AbstractReference2IntMapAbstractReference2IntMap.keySet().containsKey in interface Function<K,Integer>containsKey in interface Map<K,Integer>containsKey in class AbstractReference2IntMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(int v)
AbstractReference2IntMapAbstractReference2IntMap.values().containsValue in interface Reference2IntMap<K>containsValue in class AbstractReference2IntMap<K>Map.containsValue(Object)public boolean isEmpty()
public int put(K k, int v)
Reference2IntFunctionput in interface Reference2IntFunction<K>put in class AbstractReference2IntFunction<K>k - the key.v - the value.Function.put(Object,Object)public int removeInt(Object k)
Reference2IntFunctionremoveInt in interface Reference2IntFunction<K>removeInt in class AbstractReference2IntFunction<K>k - the key.Function.remove(Object)public ReferenceSet<K> keySet()
AbstractReference2IntMapThe view is backed by the set returned by AbstractReference2IntMap.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 Reference2IntMap<K>keySet in interface Map<K,Integer>keySet in class AbstractReference2IntMap<K>Map.keySet()public IntCollection values()
AbstractReference2IntMapThe view is backed by the set returned by AbstractReference2IntMap.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 Reference2IntMap<K>values in interface Map<K,Integer>values in class AbstractReference2IntMap<K>Map.values()public Reference2IntArrayMap<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.