public class Short2LongArrayMap extends AbstractShort2LongMap 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.
AbstractShort2LongMap.BasicEntryShort2LongMap.Entry, Short2LongMap.FastEntrySet| Constructor and Description |
|---|
Short2LongArrayMap()
Creates a new empty array map.
|
Short2LongArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2LongArrayMap(Map<? extends Short,? extends Long> m)
Creates a new empty array map copying the entries of a given map.
|
Short2LongArrayMap(short[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2LongArrayMap(short[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2LongArrayMap(Short2LongMap 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).
|
Short2LongArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractShort2LongMap.values(). |
long |
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.
|
long |
put(short k,
long v)
Adds a pair to the map.
|
long |
remove(short k)
Removes the mapping with the given key.
|
Short2LongMap.FastEntrySet |
short2LongEntrySet()
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.
|
LongCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecontainsKey, get, put, removepublic Short2LongArrayMap(short[] key,
long[] 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 Short2LongArrayMap()
public Short2LongArrayMap(int capacity)
capacity - the initial capacity.public Short2LongArrayMap(Short2LongMap m)
m - a map.public Short2LongArrayMap(Map<? extends Short,? extends Long> m)
m - a map.public Short2LongArrayMap(short[] key,
long[] 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 Short2LongMap.FastEntrySet short2LongEntrySet()
Short2LongMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2LongMap.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).
short2LongEntrySet in interface Short2LongMapShort2LongMap.entrySet()public long get(short k)
Short2LongFunctionget in interface Short2LongFunctionk - 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)
AbstractShort2LongMapAbstractShort2LongMap.keySet().containsKey in interface Short2LongFunctioncontainsKey in class AbstractShort2LongMapFunction.containsKey(Object)public boolean containsValue(long v)
AbstractShort2LongMapAbstractShort2LongMap.values().containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMapMap.containsValue(Object)public boolean isEmpty()
public long put(short k,
long v)
Short2LongFunctionput in interface Short2LongFunctionput in class AbstractShort2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(short k)
Short2LongFunctionremove in interface Short2LongFunctionremove in class AbstractShort2LongFunctionFunction.remove(Object)public ShortSet keySet()
AbstractShort2LongMapThe view is backed by the set returned by AbstractShort2LongMap.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 Short2LongMapkeySet in interface Map<Short,Long>keySet in class AbstractShort2LongMapMap.keySet()public LongCollection values()
AbstractShort2LongMapThe view is backed by the set returned by AbstractShort2LongMap.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 Short2LongMapvalues in interface Map<Short,Long>values in class AbstractShort2LongMapMap.values()public Short2LongArrayMap 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.