public class Short2ByteArrayMap extends AbstractShort2ByteMap 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.
AbstractShort2ByteMap.BasicEntry, AbstractShort2ByteMap.BasicEntrySetShort2ByteMap.Entry, Short2ByteMap.FastEntrySetdefRetValue| Constructor and Description |
|---|
Short2ByteArrayMap()
Creates a new empty array map.
|
Short2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2ByteArrayMap(Map<? extends Short,? extends Byte> m)
Creates a new empty array map copying the entries of a given map.
|
Short2ByteArrayMap(short[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2ByteArrayMap(short[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2ByteArrayMap(Short2ByteMap 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).
|
Short2ByteArrayMap |
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(byte v)
Returns
true if this map maps one or more keys to the specified value. |
byte |
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.
|
byte |
put(short k,
byte v)
Adds a pair to the map (optional operation).
|
byte |
remove(short k)
Removes the mapping with the given key (optional operation).
|
Short2ByteMap.FastEntrySet |
short2ByteEntrySet()
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.
|
ByteCollection |
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, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsIntandThen, compose, identityforEach, replaceAllpublic Short2ByteArrayMap(short[] key,
byte[] 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 Short2ByteArrayMap()
public Short2ByteArrayMap(int capacity)
capacity - the initial capacity.public Short2ByteArrayMap(Short2ByteMap m)
m - a map.public Short2ByteArrayMap(Map<? extends Short,? extends Byte> m)
m - a map.public Short2ByteArrayMap(short[] key,
byte[] 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 Short2ByteMap.FastEntrySet short2ByteEntrySet()
Short2ByteMapThis 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).
short2ByteEntrySet in interface Short2ByteMapMap.entrySet()public byte get(short k)
Short2ByteFunctionget in interface Short2ByteFunctionk - the key.Function.get(Object)public int size()
Short2ByteMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Short2ByteMapclear in interface Short2ByteMapclear in interface Map<Short,Byte>Map.clear()public boolean containsKey(short k)
Short2ByteMapcontainsKey in interface Short2ByteFunctioncontainsKey in interface Short2ByteMapcontainsKey in class AbstractShort2ByteMapk - the key.key.Map.containsKey(Object)public boolean containsValue(byte v)
Short2ByteMaptrue if this map maps one or more keys to the specified value.containsValue in interface Short2ByteMapcontainsValue in class AbstractShort2ByteMapMap.containsValue(Object)public boolean isEmpty()
public byte put(short k,
byte v)
Short2ByteFunctionput in interface Short2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(short k)
Short2ByteFunctionremove in interface Short2ByteFunctionk - the key.Function.remove(Object)public ShortSet keySet()
AbstractShort2ByteMapThe 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 Short2ByteMapkeySet in interface Map<Short,Byte>keySet in class AbstractShort2ByteMapMap.keySet()public ByteCollection values()
AbstractShort2ByteMapThe 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 Short2ByteMapvalues in interface Map<Short,Byte>values in class AbstractShort2ByteMapMap.values()public Short2ByteArrayMap 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.