Function<K,java.lang.Byte>, Reference2ByteFunction<K>, Reference2ByteMap<K>, java.io.Serializable, java.lang.Cloneable, java.util.function.Function<K,java.lang.Byte>, java.util.function.ToIntFunction<K>, java.util.Map<K,java.lang.Byte>public class Reference2ByteArrayMap<K> extends AbstractReference2ByteMap<K> implements java.io.Serializable, java.lang.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>, AbstractReference2ByteMap.BasicEntrySet<K>Reference2ByteMap.Entry<K>, Reference2ByteMap.FastEntrySet<K>| Constructor | Description |
|---|---|
Reference2ByteArrayMap() |
Creates a new empty array map.
|
Reference2ByteArrayMap(int capacity) |
Creates a new empty array map of given capacity.
|
Reference2ByteArrayMap(Reference2ByteMap<K> m) |
Creates a new empty array map copying the entries of a given map.
|
Reference2ByteArrayMap(java.lang.Object[] key,
byte[] value) |
Creates a new empty array map with given key and value backing arrays.
|
Reference2ByteArrayMap(java.lang.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(java.util.Map<? extends K,? extends java.lang.Byte> m) |
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method | Description |
|---|---|---|
void |
clear() |
Removes all of the mappings from this map (optional operation).
|
Reference2ByteArrayMap<K> |
clone() |
Returns a deep copy of this map.
|
boolean |
containsKey(java.lang.Object 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 |
getByte(java.lang.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 (optional operation).
|
Reference2ByteMap.FastEntrySet<K> |
reference2ByteEntrySet() |
Returns a type-specific set view of the mappings contained in this map.
|
byte |
removeByte(java.lang.Object k) |
Removes the mapping with the given key (optional operation).
|
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.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringcompute, computeIfAbsent, computeIfPresent, forEach, replaceAllapplyAsIntcomputeByte, computeByteIfAbsent, computeByteIfAbsentPartial, computeByteIfPresent, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, mergeByte, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacepublic Reference2ByteArrayMap(java.lang.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(java.util.Map<? extends K,? extends java.lang.Byte> m)
m - a map.public Reference2ByteArrayMap(java.lang.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()
Reference2ByteMap
This 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).
reference2ByteEntrySet in interface Reference2ByteMap<K>Map.entrySet()public byte getByte(java.lang.Object k)
Reference2ByteFunctiongetByte in interface Reference2ByteFunction<K>k - the key.Function.get(Object)public int size()
Reference2ByteMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Reference2ByteMappublic boolean containsKey(java.lang.Object k)
Reference2ByteMapcontainsKey in interface Function<K,java.lang.Byte>containsKey in interface java.util.Map<K,java.lang.Byte>containsKey in interface Reference2ByteMap<K>containsKey in class AbstractReference2ByteMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(byte v)
Reference2ByteMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Reference2ByteMap<K>containsValue in class AbstractReference2ByteMap<K>Map.containsValue(Object)public boolean isEmpty()
isEmpty in interface java.util.Map<K,java.lang.Byte>isEmpty in class AbstractReference2ByteMap<K>public byte put(K k, byte v)
Reference2ByteFunctionput in interface Reference2ByteFunction<K>k - the key.v - the value.Function.put(Object,Object)public byte removeByte(java.lang.Object k)
Reference2ByteFunctionremoveByte in interface Reference2ByteFunction<K>k - the key.Function.remove(Object)public ReferenceSet<K> keySet()
AbstractReference2ByteMap
The 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 java.util.Map<K,java.lang.Byte>keySet in interface Reference2ByteMap<K>keySet in class AbstractReference2ByteMap<K>Map.keySet()public ByteCollection values()
AbstractReference2ByteMap
The 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 java.util.Map<K,java.lang.Byte>values in interface Reference2ByteMap<K>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.