public class Int2ByteArrayMap extends AbstractInt2ByteMap 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.
AbstractInt2ByteMap.BasicEntry
Int2ByteMap.Entry, Int2ByteMap.FastEntrySet
Constructor and Description |
---|
Int2ByteArrayMap()
Creates a new empty array map.
|
Int2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2ByteArrayMap(int[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2ByteArrayMap(int[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2ByteArrayMap(Int2ByteMap m)
Creates a new empty array map copying the entries of a given map.
|
Int2ByteArrayMap(Map<? extends Integer,? extends Byte> 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).
|
Int2ByteArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractInt2ByteMap.values() . |
byte |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ByteMap.FastEntrySet |
int2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
byte |
put(int k,
byte v)
Adds a pair to the map.
|
byte |
remove(int 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, toString
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
containsKey, get, put, remove
containsKey, get, put, remove
public Int2ByteArrayMap(int[] 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 Int2ByteArrayMap()
public Int2ByteArrayMap(int capacity)
capacity
- the initial capacity.public Int2ByteArrayMap(Int2ByteMap m)
m
- a map.public Int2ByteArrayMap(Map<? extends Integer,? extends Byte> m)
m
- a map.public Int2ByteArrayMap(int[] 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 Int2ByteMap.FastEntrySet int2ByteEntrySet()
Int2ByteMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2ByteMap.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).
int2ByteEntrySet
in interface Int2ByteMap
Int2ByteMap.entrySet()
public byte get(int k)
Int2ByteFunction
get
in interface Int2ByteFunction
k
- the key.Function.get(Object)
public int size()
Function
Most 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()
Function
public boolean containsKey(int k)
AbstractInt2ByteMap
AbstractInt2ByteMap.keySet()
.containsKey
in interface Int2ByteFunction
containsKey
in class AbstractInt2ByteMap
Function.containsKey(Object)
public boolean containsValue(byte v)
AbstractInt2ByteMap
AbstractInt2ByteMap.values()
.containsValue
in interface Int2ByteMap
containsValue
in class AbstractInt2ByteMap
Map.containsValue(Object)
public boolean isEmpty()
public byte put(int k, byte v)
Int2ByteFunction
put
in interface Int2ByteFunction
put
in class AbstractInt2ByteFunction
k
- the key.v
- the value.Function.put(Object,Object)
public byte remove(int k)
Int2ByteFunction
remove
in interface Int2ByteFunction
remove
in class AbstractInt2ByteFunction
k
- the key.Function.remove(Object)
public IntSet keySet()
AbstractInt2ByteMap
The view is backed by the set returned by AbstractInt2ByteMap.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 Int2ByteMap
keySet
in interface Map<Integer,Byte>
keySet
in class AbstractInt2ByteMap
Map.keySet()
public ByteCollection values()
AbstractInt2ByteMap
The view is backed by the set returned by AbstractInt2ByteMap.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 Int2ByteMap
values
in interface Map<Integer,Byte>
values
in class AbstractInt2ByteMap
Map.values()
public Int2ByteArrayMap 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.