public class Short2ReferenceArrayMap<V> extends AbstractShort2ReferenceMap<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.
AbstractShort2ReferenceMap.BasicEntry<V>, AbstractShort2ReferenceMap.BasicEntrySet<V>Short2ReferenceMap.Entry<V>, Short2ReferenceMap.FastEntrySet<V>defRetValue| Constructor and Description |
|---|
Short2ReferenceArrayMap()
Creates a new empty array map.
|
Short2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2ReferenceArrayMap(Map<? extends Short,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Short2ReferenceArrayMap(short[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2ReferenceArrayMap(short[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2ReferenceArrayMap(Short2ReferenceMap<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).
|
Short2ReferenceArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v) |
V |
get(short k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ShortSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(short k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(short k)
Removes the mapping with the given key (optional operation).
|
Short2ReferenceMap.FastEntrySet<V> |
short2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
int |
size()
Returns the number of key/value mappings in this map.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, 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 Short2ReferenceArrayMap(short[] 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 Short2ReferenceArrayMap()
public Short2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Short2ReferenceArrayMap(Short2ReferenceMap<V> m)
m - a map.public Short2ReferenceArrayMap(Map<? extends Short,? extends V> m)
m - a map.public Short2ReferenceArrayMap(short[] 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 Short2ReferenceMap.FastEntrySet<V> short2ReferenceEntrySet()
Short2ReferenceMapThis 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).
short2ReferenceEntrySet in interface Short2ReferenceMap<V>Map.entrySet()public V get(short k)
Short2ReferenceFunctionget in interface Short2ReferenceFunction<V>k - the key.Function.get(Object)public int size()
Short2ReferenceMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Short2ReferenceMapclear in interface Short2ReferenceMap<V>clear in interface Map<Short,V>Map.clear()public boolean containsKey(short k)
Short2ReferenceMapcontainsKey in interface Short2ReferenceFunction<V>containsKey in interface Short2ReferenceMap<V>containsKey in class AbstractShort2ReferenceMap<V>k - the key.key.Map.containsKey(Object)public boolean containsValue(Object v)
containsValue in interface Map<Short,V>containsValue in class AbstractShort2ReferenceMap<V>public boolean isEmpty()
public V put(short k, V v)
Short2ReferenceFunctionput in interface Short2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(short k)
Short2ReferenceFunctionremove in interface Short2ReferenceFunction<V>k - the key.Function.remove(Object)public ShortSet keySet()
AbstractShort2ReferenceMapThe 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 Short2ReferenceMap<V>keySet in interface Map<Short,V>keySet in class AbstractShort2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> values()
AbstractShort2ReferenceMapThe 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 Short2ReferenceMap<V>values in interface Map<Short,V>values in class AbstractShort2ReferenceMap<V>Map.values()public Short2ReferenceArrayMap<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.
Copyright © 2020. All rights reserved.