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.BasicEntry, AbstractShort2LongMap.BasicEntrySetShort2LongMap.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 of the mappings from this map (optional operation).
|
Short2LongArrayMap |
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(long v)
Returns
true if this map maps one or more keys to the specified value. |
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 (optional operation).
|
long |
remove(short k)
Removes the mapping with the given key (optional operation).
|
Short2LongMap.FastEntrySet |
short2LongEntrySet()
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.
|
LongCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsLongforEach, replaceAllpublic 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 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).
short2LongEntrySet in interface Short2LongMapMap.entrySet()public long get(short k)
Short2LongFunctionget in interface Short2LongFunctionk - the key.Function.get(Object)public int size()
Short2LongMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Short2LongMapclear in interface Short2LongMapclear in interface Map<Short,Long>Map.clear()public boolean containsKey(short k)
Short2LongMapcontainsKey in interface Short2LongFunctioncontainsKey in interface Short2LongMapcontainsKey in class AbstractShort2LongMapk - the key.key.Map.containsKey(Object)public boolean containsValue(long v)
Short2LongMaptrue if this map maps one or more keys to the specified value.containsValue in interface Short2LongMapcontainsValue in class AbstractShort2LongMapMap.containsValue(Object)public boolean isEmpty()
public long put(short k,
long v)
Short2LongFunctionput in interface Short2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(short k)
Short2LongFunctionremove in interface Short2LongFunctionk - the key.Function.remove(Object)public ShortSet keySet()
AbstractShort2LongMapThe 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 Short2LongMapkeySet in interface Map<Short,Long>keySet in class AbstractShort2LongMapMap.keySet()public LongCollection values()
AbstractShort2LongMapThe 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 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.