public class Reference2ShortArrayMap<K> extends AbstractReference2ShortMap<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.
AbstractReference2ShortMap.BasicEntry<K>Reference2ShortMap.Entry<K>, Reference2ShortMap.FastEntrySet<K>| Constructor and Description |
|---|
Reference2ShortArrayMap()
Creates a new empty array map.
|
Reference2ShortArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2ShortArrayMap(Map<? extends K,? extends Short> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2ShortArrayMap(Object[] key,
short[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2ShortArrayMap(Object[] key,
short[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2ShortArrayMap(Reference2ShortMap<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).
|
Reference2ShortArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractReference2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractReference2ShortMap.values(). |
short |
getShort(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.
|
short |
put(K k,
short v)
Adds a pair to the map.
|
Reference2ShortMap.FastEntrySet<K> |
reference2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
short |
removeShort(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.
|
ShortCollection |
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 Reference2ShortArrayMap(Object[] key, short[] 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 Reference2ShortArrayMap()
public Reference2ShortArrayMap(int capacity)
capacity - the initial capacity.public Reference2ShortArrayMap(Reference2ShortMap<K> m)
m - a map.public Reference2ShortArrayMap(Map<? extends K,? extends Short> m)
m - a map.public Reference2ShortArrayMap(Object[] key, short[] 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 Reference2ShortMap.FastEntrySet<K> reference2ShortEntrySet()
Reference2ShortMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Reference2ShortMap.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).
reference2ShortEntrySet in interface Reference2ShortMap<K>Reference2ShortMap.entrySet()public short getShort(Object k)
Reference2ShortFunctiongetShort in interface Reference2ShortFunction<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)
AbstractReference2ShortMapAbstractReference2ShortMap.keySet().containsKey in interface Function<K,Short>containsKey in interface Map<K,Short>containsKey in class AbstractReference2ShortMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(short v)
AbstractReference2ShortMapAbstractReference2ShortMap.values().containsValue in interface Reference2ShortMap<K>containsValue in class AbstractReference2ShortMap<K>Map.containsValue(Object)public boolean isEmpty()
public short put(K k, short v)
Reference2ShortFunctionput in interface Reference2ShortFunction<K>put in class AbstractReference2ShortFunction<K>k - the key.v - the value.Function.put(Object,Object)public short removeShort(Object k)
Reference2ShortFunctionremoveShort in interface Reference2ShortFunction<K>removeShort in class AbstractReference2ShortFunction<K>k - the key.Function.remove(Object)public ReferenceSet<K> keySet()
AbstractReference2ShortMapThe view is backed by the set returned by AbstractReference2ShortMap.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 Reference2ShortMap<K>keySet in interface Map<K,Short>keySet in class AbstractReference2ShortMap<K>Map.keySet()public ShortCollection values()
AbstractReference2ShortMapThe view is backed by the set returned by AbstractReference2ShortMap.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 Reference2ShortMap<K>values in interface Map<K,Short>values in class AbstractReference2ShortMap<K>Map.values()public Reference2ShortArrayMap<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.