Byte2ReferenceFunction<V>, Byte2ReferenceMap<V>, Function<java.lang.Byte,V>, java.io.Serializable, java.lang.Cloneable, java.util.function.Function<java.lang.Byte,V>, java.util.function.IntFunction<V>, java.util.Map<java.lang.Byte,V>public class Byte2ReferenceArrayMap<V> extends AbstractByte2ReferenceMap<V> 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.
AbstractByte2ReferenceMap.BasicEntry<V>, AbstractByte2ReferenceMap.BasicEntrySet<V>Byte2ReferenceMap.Entry<V>, Byte2ReferenceMap.FastEntrySet<V>| Constructor | Description |
|---|---|
Byte2ReferenceArrayMap() |
Creates a new empty array map.
|
Byte2ReferenceArrayMap(byte[] key,
java.lang.Object[] value) |
Creates a new empty array map with given key and value backing arrays.
|
Byte2ReferenceArrayMap(byte[] key,
java.lang.Object[] value,
int size) |
Creates a new array map with given key and value backing arrays, using the
given number of elements.
|
Byte2ReferenceArrayMap(int capacity) |
Creates a new empty array map of given capacity.
|
Byte2ReferenceArrayMap(Byte2ReferenceMap<V> m) |
Creates a new empty array map copying the entries of a given map.
|
Byte2ReferenceArrayMap(java.util.Map<? extends java.lang.Byte,? extends V> m) |
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method | Description |
|---|---|---|
Byte2ReferenceMap.FastEntrySet<V> |
byte2ReferenceEntrySet() |
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear() |
Removes all of the mappings from this map (optional operation).
|
Byte2ReferenceArrayMap<V> |
clone() |
Returns a deep copy of this map.
|
boolean |
containsKey(byte k) |
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(java.lang.Object v) |
|
V |
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.
|
V |
put(byte k,
V v) |
Adds a pair to the map (optional operation).
|
V |
remove(byte k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
ReferenceCollection<V> |
values() |
Returns a type-specific-set view of the values of this map.
|
defaultReturnValue, defaultReturnValueequals, hashCode, putAll, toStringapplycompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacepublic Byte2ReferenceArrayMap(byte[] key,
java.lang.Object[] 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 Byte2ReferenceArrayMap()
public Byte2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Byte2ReferenceArrayMap(Byte2ReferenceMap<V> m)
m - a map.public Byte2ReferenceArrayMap(java.util.Map<? extends java.lang.Byte,? extends V> m)
m - a map.public Byte2ReferenceArrayMap(byte[] key,
java.lang.Object[] 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 Byte2ReferenceMap.FastEntrySet<V> byte2ReferenceEntrySet()
Byte2ReferenceMap
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).
byte2ReferenceEntrySet in interface Byte2ReferenceMap<V>Map.entrySet()public V get(byte k)
Byte2ReferenceFunctionget in interface Byte2ReferenceFunction<V>k - the key.Function.get(Object)public int size()
Byte2ReferenceMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Byte2ReferenceMappublic boolean containsKey(byte k)
Byte2ReferenceMapcontainsKey in interface Byte2ReferenceFunction<V>containsKey in interface Byte2ReferenceMap<V>containsKey in class AbstractByte2ReferenceMap<V>k - the key.key.Map.containsKey(Object)public boolean containsValue(java.lang.Object v)
containsValue in interface java.util.Map<java.lang.Byte,V>containsValue in class AbstractByte2ReferenceMap<V>public boolean isEmpty()
isEmpty in interface java.util.Map<java.lang.Byte,V>isEmpty in class AbstractByte2ReferenceMap<V>public V put(byte k, V v)
Byte2ReferenceFunctionput in interface Byte2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(byte k)
Byte2ReferenceFunctionremove in interface Byte2ReferenceFunction<V>k - the key.Function.remove(Object)public ByteSet keySet()
AbstractByte2ReferenceMap
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 Byte2ReferenceMap<V>keySet in interface java.util.Map<java.lang.Byte,V>keySet in class AbstractByte2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> values()
AbstractByte2ReferenceMap
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 Byte2ReferenceMap<V>values in interface java.util.Map<java.lang.Byte,V>values in class AbstractByte2ReferenceMap<V>Map.values()public Byte2ReferenceArrayMap<V> 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.