public class Byte2ByteArrayMap extends AbstractByte2ByteMap 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.
AbstractByte2ByteMap.BasicEntryByte2ByteMap.Entry, Byte2ByteMap.FastEntrySet| Constructor and Description |
|---|
Byte2ByteArrayMap()
Creates a new empty array map.
|
Byte2ByteArrayMap(byte[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays.
|
Byte2ByteArrayMap(byte[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Byte2ByteArrayMap(Byte2ByteMap m)
Creates a new empty array map copying the entries of a given map.
|
Byte2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Byte2ByteArrayMap(Map<? extends Byte,? extends Byte> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Byte2ByteMap.FastEntrySet |
byte2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ByteArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractByte2ByteMap.values(). |
byte |
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.
|
byte |
put(byte k,
byte v)
Adds a pair to the map.
|
byte |
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.
|
ByteCollection |
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, removecontainsKey, get, put, removepublic Byte2ByteArrayMap(byte[] 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 Byte2ByteArrayMap()
public Byte2ByteArrayMap(int capacity)
capacity - the initial capacity.public Byte2ByteArrayMap(Byte2ByteMap m)
m - a map.public Byte2ByteArrayMap(Map<? extends Byte,? extends Byte> m)
m - a map.public Byte2ByteArrayMap(byte[] 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 Byte2ByteMap.FastEntrySet byte2ByteEntrySet()
Byte2ByteMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2ByteMap.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).
byte2ByteEntrySet in interface Byte2ByteMapByte2ByteMap.entrySet()public byte get(byte k)
Byte2ByteFunctionget in interface Byte2ByteFunctionk - 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)
AbstractByte2ByteMapAbstractByte2ByteMap.keySet().containsKey in interface Byte2ByteFunctioncontainsKey in class AbstractByte2ByteMapFunction.containsKey(Object)public boolean containsValue(byte v)
AbstractByte2ByteMapAbstractByte2ByteMap.values().containsValue in interface Byte2ByteMapcontainsValue in class AbstractByte2ByteMapMap.containsValue(Object)public boolean isEmpty()
public byte put(byte k,
byte v)
Byte2ByteFunctionput in interface Byte2ByteFunctionput in class AbstractByte2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public byte remove(byte k)
Byte2ByteFunctionremove in interface Byte2ByteFunctionremove in class AbstractByte2ByteFunctionFunction.remove(Object)public ByteSet keySet()
AbstractByte2ByteMapThe view is backed by the set returned by AbstractByte2ByteMap.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 Byte2ByteMapkeySet in interface Map<Byte,Byte>keySet in class AbstractByte2ByteMapMap.keySet()public ByteCollection values()
AbstractByte2ByteMapThe view is backed by the set returned by AbstractByte2ByteMap.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 Byte2ByteMapvalues in interface Map<Byte,Byte>values in class AbstractByte2ByteMapMap.values()public Byte2ByteArrayMap 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.