public class Byte2ShortArrayMap extends AbstractByte2ShortMap 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.
AbstractByte2ShortMap.BasicEntryByte2ShortMap.Entry, Byte2ShortMap.FastEntrySet| Constructor and Description |
|---|
Byte2ShortArrayMap()
Creates a new empty array map.
|
Byte2ShortArrayMap(byte[] key,
short[] value)
Creates a new empty array map with given key and value backing arrays.
|
Byte2ShortArrayMap(byte[] key,
short[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Byte2ShortArrayMap(Byte2ShortMap m)
Creates a new empty array map copying the entries of a given map.
|
Byte2ShortArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Byte2ShortArrayMap(Map<? extends Byte,? extends Short> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Byte2ShortMap.FastEntrySet |
byte2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ShortArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractByte2ShortMap.values(). |
short |
get(byte k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ByteSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
short |
put(byte k,
short v)
Adds a pair to the map.
|
short |
remove(byte 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, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Byte2ShortArrayMap(byte[] 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 Byte2ShortArrayMap()
public Byte2ShortArrayMap(int capacity)
capacity - the initial capacity.public Byte2ShortArrayMap(Byte2ShortMap m)
m - a map.public Byte2ShortArrayMap(Map<? extends Byte,? extends Short> m)
m - a map.public Byte2ShortArrayMap(byte[] 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 Byte2ShortMap.FastEntrySet byte2ShortEntrySet()
Byte2ShortMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Byte2ShortMap.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).
byte2ShortEntrySet in interface Byte2ShortMapByte2ShortMap.entrySet()public short get(byte k)
Byte2ShortFunctionget in interface Byte2ShortFunctionk - 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(byte k)
AbstractByte2ShortMapAbstractByte2ShortMap.keySet().containsKey in interface Byte2ShortFunctioncontainsKey in class AbstractByte2ShortMapFunction.containsKey(Object)public boolean containsValue(short v)
AbstractByte2ShortMapAbstractByte2ShortMap.values().containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMapMap.containsValue(Object)public boolean isEmpty()
public short put(byte k,
short v)
Byte2ShortFunctionput in interface Byte2ShortFunctionput in class AbstractByte2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(byte k)
Byte2ShortFunctionremove in interface Byte2ShortFunctionremove in class AbstractByte2ShortFunctionk - the key.Function.remove(Object)public ByteSet keySet()
AbstractByte2ShortMapThe view is backed by the set returned by AbstractByte2ShortMap.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 Byte2ShortMapkeySet in interface Map<Byte,Short>keySet in class AbstractByte2ShortMapMap.keySet()public ShortCollection values()
AbstractByte2ShortMapThe view is backed by the set returned by AbstractByte2ShortMap.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 Byte2ShortMapvalues in interface Map<Byte,Short>values in class AbstractByte2ShortMapMap.values()public Byte2ShortArrayMap 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.