public class Object2ByteArrayMap<K> extends AbstractObject2ByteMap<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.
AbstractObject2ByteMap.BasicEntry<K>Object2ByteMap.Entry<K>, Object2ByteMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2ByteArrayMap()
Creates a new empty array map.
|
Object2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2ByteArrayMap(Map<? extends K,? extends Byte> m)
Creates a new empty array map copying the entries of a given map.
|
Object2ByteArrayMap(Object[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2ByteArrayMap(Object[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Object2ByteArrayMap(Object2ByteMap<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).
|
Object2ByteArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractObject2ByteMap.values(). |
byte |
getByte(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2ByteMap.FastEntrySet<K> |
object2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
byte |
put(K k,
byte v)
Adds a pair to the 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, defaultReturnValuepublic Object2ByteArrayMap(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 Object2ByteArrayMap()
public Object2ByteArrayMap(int capacity)
capacity - the initial capacity.public Object2ByteArrayMap(Object2ByteMap<K> m)
m - a map.public Object2ByteArrayMap(Map<? extends K,? extends Byte> m)
m - a map.public Object2ByteArrayMap(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 Object2ByteMap.FastEntrySet<K> object2ByteEntrySet()
Object2ByteMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2ByteMap.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).
object2ByteEntrySet in interface Object2ByteMap<K>Object2ByteMap.entrySet()public byte getByte(Object k)
Object2ByteFunctiongetByte in interface Object2ByteFunction<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)
AbstractObject2ByteMapAbstractObject2ByteMap.keySet().containsKey in interface Function<K,Byte>containsKey in interface Map<K,Byte>containsKey in class AbstractObject2ByteMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(byte v)
AbstractObject2ByteMapAbstractObject2ByteMap.values().containsValue in interface Object2ByteMap<K>containsValue in class AbstractObject2ByteMap<K>Map.containsValue(Object)public boolean isEmpty()
public byte put(K k, byte v)
Object2ByteFunctionput in interface Object2ByteFunction<K>put in class AbstractObject2ByteFunction<K>k - the key.v - the value.Function.put(Object,Object)public byte removeByte(Object k)
Object2ByteFunctionremoveByte in interface Object2ByteFunction<K>removeByte in class AbstractObject2ByteFunction<K>Function.remove(Object)public ObjectSet<K> keySet()
AbstractObject2ByteMapThe view is backed by the set returned by AbstractObject2ByteMap.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 Object2ByteMap<K>keySet in interface Map<K,Byte>keySet in class AbstractObject2ByteMap<K>Map.keySet()public ByteCollection values()
AbstractObject2ByteMapThe view is backed by the set returned by AbstractObject2ByteMap.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 Object2ByteMap<K>values in interface Map<K,Byte>values in class AbstractObject2ByteMap<K>Map.values()public Object2ByteArrayMap<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.