public class Long2ReferenceArrayMap<V> extends AbstractLong2ReferenceMap<V> 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.
AbstractLong2ReferenceMap.BasicEntry<V>Long2ReferenceMap.Entry<V>, Long2ReferenceMap.FastEntrySet<V>| Constructor and Description |
|---|
Long2ReferenceArrayMap()
Creates a new empty array map.
|
Long2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Long2ReferenceArrayMap(long[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Long2ReferenceArrayMap(long[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Long2ReferenceArrayMap(Long2ReferenceMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Long2ReferenceArrayMap(Map<? extends Long,? extends V> 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).
|
Long2ReferenceArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2ReferenceMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractLong2ReferenceMap.values(). |
V |
get(long k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
LongSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Long2ReferenceMap.FastEntrySet<V> |
long2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
put(long k,
V v)
Adds a pair to the map.
|
V |
remove(long 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.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
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 Long2ReferenceArrayMap(long[] key,
Object[] 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 Long2ReferenceArrayMap()
public Long2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Long2ReferenceArrayMap(Long2ReferenceMap<V> m)
m - a map.public Long2ReferenceArrayMap(Map<? extends Long,? extends V> m)
m - a map.public Long2ReferenceArrayMap(long[] key,
Object[] 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 Long2ReferenceMap.FastEntrySet<V> long2ReferenceEntrySet()
Long2ReferenceMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Long2ReferenceMap.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).
long2ReferenceEntrySet in interface Long2ReferenceMap<V>Long2ReferenceMap.entrySet()public V get(long k)
Long2ReferenceFunctionget in interface Long2ReferenceFunction<V>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(long k)
AbstractLong2ReferenceMapAbstractLong2ReferenceMap.keySet().containsKey in interface Long2ReferenceFunction<V>containsKey in class AbstractLong2ReferenceMap<V>Function.containsKey(Object)public boolean containsValue(Object v)
AbstractLong2ReferenceMapAbstractLong2ReferenceMap.values().containsValue in interface Map<Long,V>containsValue in class AbstractLong2ReferenceMap<V>public boolean isEmpty()
public V put(long k, V v)
Long2ReferenceFunctionput in interface Long2ReferenceFunction<V>put in class AbstractLong2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(long k)
Long2ReferenceFunctionremove in interface Long2ReferenceFunction<V>remove in class AbstractLong2ReferenceFunction<V>k - the key.Function.remove(Object)public LongSet keySet()
AbstractLong2ReferenceMapThe view is backed by the set returned by AbstractLong2ReferenceMap.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 Long2ReferenceMap<V>keySet in interface Map<Long,V>keySet in class AbstractLong2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> values()
AbstractLong2ReferenceMapThe view is backed by the set returned by AbstractLong2ReferenceMap.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 Long2ReferenceMap<V>values in interface Map<Long,V>values in class AbstractLong2ReferenceMap<V>Map.values()public Long2ReferenceArrayMap<V> 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.