public class Short2ObjectArrayMap<V> extends AbstractShort2ObjectMap<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.
AbstractShort2ObjectMap.BasicEntry<V>Short2ObjectMap.Entry<V>, Short2ObjectMap.FastEntrySet<V>| Constructor and Description |
|---|
Short2ObjectArrayMap()
Creates a new empty array map.
|
Short2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2ObjectArrayMap(Map<? extends Short,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Short2ObjectArrayMap(short[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2ObjectArrayMap(short[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2ObjectArrayMap(Short2ObjectMap<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 associations from this function (optional operation).
|
Short2ObjectArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractShort2ObjectMap.values(). |
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.
|
V |
remove(short k)
Removes the mapping with the given key.
|
Short2ObjectMap.FastEntrySet<V> |
short2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecontainsKey, get, put, removepublic Short2ObjectArrayMap(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 Short2ObjectArrayMap()
public Short2ObjectArrayMap(int capacity)
capacity - the initial capacity.public Short2ObjectArrayMap(Short2ObjectMap<V> m)
m - a map.public Short2ObjectArrayMap(Map<? extends Short,? extends V> m)
m - a map.public Short2ObjectArrayMap(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 Short2ObjectMap.FastEntrySet<V> short2ObjectEntrySet()
Short2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2ObjectMap.entrySet()
so that it returns an ObjectSet
of objects of type Map.Entry (the latter makes it possible to
access keys and values with type-specific methods).
short2ObjectEntrySet in interface Short2ObjectMap<V>Short2ObjectMap.entrySet()public V get(short k)
Short2ObjectFunctionget in interface Short2ObjectFunction<V>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(short k)
AbstractShort2ObjectMapAbstractShort2ObjectMap.keySet().containsKey in interface Short2ObjectFunction<V>containsKey in class AbstractShort2ObjectMap<V>Function.containsKey(Object)public boolean containsValue(Object v)
AbstractShort2ObjectMapAbstractShort2ObjectMap.values().containsValue in interface Map<Short,V>containsValue in class AbstractShort2ObjectMap<V>public boolean isEmpty()
public V put(short k, V v)
Short2ObjectFunctionput in interface Short2ObjectFunction<V>put in class AbstractShort2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(short k)
Short2ObjectFunctionremove in interface Short2ObjectFunction<V>remove in class AbstractShort2ObjectFunction<V>Function.remove(Object)public ShortSet keySet()
AbstractShort2ObjectMapThe view is backed by the set returned by AbstractShort2ObjectMap.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 Short2ObjectMap<V>keySet in interface Map<Short,V>keySet in class AbstractShort2ObjectMap<V>Map.keySet()public ObjectCollection<V> values()
AbstractShort2ObjectMapThe view is backed by the set returned by AbstractShort2ObjectMap.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 Short2ObjectMap<V>values in interface Map<Short,V>values in class AbstractShort2ObjectMap<V>Map.values()public Short2ObjectArrayMap<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.