public class Byte2IntArrayMap extends AbstractByte2IntMap 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.
AbstractByte2IntMap.BasicEntry
Byte2IntMap.Entry, Byte2IntMap.FastEntrySet
Constructor and Description |
---|
Byte2IntArrayMap()
Creates a new empty array map.
|
Byte2IntArrayMap(byte[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Byte2IntArrayMap(byte[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Byte2IntArrayMap(Byte2IntMap m)
Creates a new empty array map copying the entries of a given map.
|
Byte2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Byte2IntArrayMap(Map<? extends Byte,? extends Integer> m)
Creates a new empty array map copying the entries of a given map.
|
Modifier and Type | Method and Description |
---|---|
Byte2IntMap.FastEntrySet |
byte2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2IntArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2IntMap.keySet() . |
boolean |
containsValue(int v)
Checks whether the given value is contained in
AbstractByte2IntMap.values() . |
int |
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.
|
int |
put(byte k,
int v)
Adds a pair to the map.
|
int |
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.
|
IntCollection |
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 Byte2IntArrayMap(byte[] key, int[] 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 Byte2IntArrayMap()
public Byte2IntArrayMap(int capacity)
capacity
- the initial capacity.public Byte2IntArrayMap(Byte2IntMap m)
m
- a map.public Byte2IntArrayMap(Map<? extends Byte,? extends Integer> m)
m
- a map.public Byte2IntArrayMap(byte[] key, int[] 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 Byte2IntMap.FastEntrySet byte2IntEntrySet()
Byte2IntMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2IntMap.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).
byte2IntEntrySet
in interface Byte2IntMap
Byte2IntMap.entrySet()
public int get(byte k)
Byte2IntFunction
get
in interface Byte2IntFunction
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(byte k)
AbstractByte2IntMap
AbstractByte2IntMap.keySet()
.containsKey
in interface Byte2IntFunction
containsKey
in class AbstractByte2IntMap
Function.containsKey(Object)
public boolean containsValue(int v)
AbstractByte2IntMap
AbstractByte2IntMap.values()
.containsValue
in interface Byte2IntMap
containsValue
in class AbstractByte2IntMap
Map.containsValue(Object)
public boolean isEmpty()
public int put(byte k, int v)
Byte2IntFunction
put
in interface Byte2IntFunction
put
in class AbstractByte2IntFunction
k
- the key.v
- the value.Function.put(Object,Object)
public int remove(byte k)
Byte2IntFunction
remove
in interface Byte2IntFunction
remove
in class AbstractByte2IntFunction
Function.remove(Object)
public ByteSet keySet()
AbstractByte2IntMap
The view is backed by the set returned by AbstractByte2IntMap.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 Byte2IntMap
keySet
in interface Map<Byte,Integer>
keySet
in class AbstractByte2IntMap
Map.keySet()
public IntCollection values()
AbstractByte2IntMap
The view is backed by the set returned by AbstractByte2IntMap.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 Byte2IntMap
values
in interface Map<Byte,Integer>
values
in class AbstractByte2IntMap
Map.values()
public Byte2IntArrayMap 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.