public class Byte2LongArrayMap extends AbstractByte2LongMap 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.
AbstractByte2LongMap.BasicEntryByte2LongMap.Entry, Byte2LongMap.FastEntrySet| Constructor and Description |
|---|
Byte2LongArrayMap()
Creates a new empty array map.
|
Byte2LongArrayMap(byte[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays.
|
Byte2LongArrayMap(byte[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Byte2LongArrayMap(Byte2LongMap m)
Creates a new empty array map copying the entries of a given map.
|
Byte2LongArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Byte2LongArrayMap(Map<? extends Byte,? extends Long> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Byte2LongMap.FastEntrySet |
byte2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2LongArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2LongMap.keySet(). |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractByte2LongMap.values(). |
long |
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.
|
long |
put(byte k,
long v)
Adds a pair to the map.
|
long |
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.
|
LongCollection |
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, removecompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Byte2LongArrayMap(byte[] key,
long[] 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 Byte2LongArrayMap()
public Byte2LongArrayMap(int capacity)
capacity - the initial capacity.public Byte2LongArrayMap(Byte2LongMap m)
m - a map.public Byte2LongArrayMap(Map<? extends Byte,? extends Long> m)
m - a map.public Byte2LongArrayMap(byte[] key,
long[] 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 Byte2LongMap.FastEntrySet byte2LongEntrySet()
Byte2LongMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Byte2LongMap.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).
byte2LongEntrySet in interface Byte2LongMapByte2LongMap.entrySet()public long get(byte k)
Byte2LongFunctionget in interface Byte2LongFunctionk - 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)
AbstractByte2LongMapAbstractByte2LongMap.keySet().containsKey in interface Byte2LongFunctioncontainsKey in class AbstractByte2LongMapFunction.containsKey(Object)public boolean containsValue(long v)
AbstractByte2LongMapAbstractByte2LongMap.values().containsValue in interface Byte2LongMapcontainsValue in class AbstractByte2LongMapMap.containsValue(Object)public boolean isEmpty()
public long put(byte k,
long v)
Byte2LongFunctionput in interface Byte2LongFunctionput in class AbstractByte2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(byte k)
Byte2LongFunctionremove in interface Byte2LongFunctionremove in class AbstractByte2LongFunctionk - the key.Function.remove(Object)public ByteSet keySet()
AbstractByte2LongMapThe view is backed by the set returned by AbstractByte2LongMap.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 Byte2LongMapkeySet in interface Map<Byte,Long>keySet in class AbstractByte2LongMapMap.keySet()public LongCollection values()
AbstractByte2LongMapThe view is backed by the set returned by AbstractByte2LongMap.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 Byte2LongMapvalues in interface Map<Byte,Long>values in class AbstractByte2LongMapMap.values()public Byte2LongArrayMap 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.