public class Reference2ByteArrayMap<K> extends AbstractReference2ByteMap<K> 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.
AbstractReference2ByteMap.BasicEntry<K>Reference2ByteMap.Entry<K>, Reference2ByteMap.FastEntrySet<K>| Constructor and Description |
|---|
Reference2ByteArrayMap()
Creates a new empty array map.
|
Reference2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2ByteArrayMap(Map<? extends K,? extends Byte> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2ByteArrayMap(Object[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2ByteArrayMap(Object[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2ByteArrayMap(Reference2ByteMap<K> 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).
|
Reference2ByteArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractReference2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractReference2ByteMap.values(). |
byte |
getByte(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
byte |
put(K k,
byte v)
Adds a pair to the map.
|
Reference2ByteMap.FastEntrySet<K> |
reference2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
byte |
removeByte(Object 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.
|
ByteCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Reference2ByteArrayMap(Object[] 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 Reference2ByteArrayMap()
public Reference2ByteArrayMap(int capacity)
capacity - the initial capacity.public Reference2ByteArrayMap(Reference2ByteMap<K> m)
m - a map.public Reference2ByteArrayMap(Map<? extends K,? extends Byte> m)
m - a map.public Reference2ByteArrayMap(Object[] 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 Reference2ByteMap.FastEntrySet<K> reference2ByteEntrySet()
Reference2ByteMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Reference2ByteMap.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).
reference2ByteEntrySet in interface Reference2ByteMap<K>Reference2ByteMap.entrySet()public byte getByte(Object k)
Reference2ByteFunctiongetByte in interface Reference2ByteFunction<K>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(Object k)
AbstractReference2ByteMapAbstractReference2ByteMap.keySet().containsKey in interface Function<K,Byte>containsKey in interface Map<K,Byte>containsKey in class AbstractReference2ByteMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(byte v)
AbstractReference2ByteMapAbstractReference2ByteMap.values().containsValue in interface Reference2ByteMap<K>containsValue in class AbstractReference2ByteMap<K>Map.containsValue(Object)public boolean isEmpty()
public byte put(K k, byte v)
Reference2ByteFunctionput in interface Reference2ByteFunction<K>put in class AbstractReference2ByteFunction<K>k - the key.v - the value.Function.put(Object,Object)public byte removeByte(Object k)
Reference2ByteFunctionremoveByte in interface Reference2ByteFunction<K>removeByte in class AbstractReference2ByteFunction<K>k - the key.Function.remove(Object)public ReferenceSet<K> keySet()
AbstractReference2ByteMapThe view is backed by the set returned by AbstractReference2ByteMap.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 Reference2ByteMap<K>keySet in interface Map<K,Byte>keySet in class AbstractReference2ByteMap<K>Map.keySet()public ByteCollection values()
AbstractReference2ByteMapThe view is backed by the set returned by AbstractReference2ByteMap.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 Reference2ByteMap<K>values in interface Map<K,Byte>values in class AbstractReference2ByteMap<K>Map.values()public Reference2ByteArrayMap<K> 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.