public class Long2LongArrayMap extends AbstractLong2LongMap 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.
AbstractLong2LongMap.BasicEntry, AbstractLong2LongMap.BasicEntrySetLong2LongMap.Entry, Long2LongMap.FastEntrySet| Constructor and Description |
|---|
Long2LongArrayMap()
Creates a new empty array map.
|
Long2LongArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Long2LongArrayMap(long[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays.
|
Long2LongArrayMap(long[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Long2LongArrayMap(Long2LongMap m)
Creates a new empty array map copying the entries of a given map.
|
Long2LongArrayMap(Map<? extends Long,? extends Long> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Long2LongArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(long k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(long v)
Returns
true if this map maps one or more keys to the specified value. |
long |
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.
|
Long2LongMap.FastEntrySet |
long2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
long |
put(long k,
long v)
Adds a pair to the map (optional operation).
|
long |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
LongCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyAsLongandThen, compose, identityforEach, replaceAllpublic Long2LongArrayMap(long[] 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 Long2LongArrayMap()
public Long2LongArrayMap(int capacity)
capacity - the initial capacity.public Long2LongArrayMap(Long2LongMap m)
m - a map.public Long2LongArrayMap(Map<? extends Long,? extends Long> m)
m - a map.public Long2LongArrayMap(long[] 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 Long2LongMap.FastEntrySet long2LongEntrySet()
Long2LongMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.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).
long2LongEntrySet in interface Long2LongMapMap.entrySet()public long get(long k)
Long2LongFunctionget in interface Long2LongFunctionk - the key.Function.get(Object)public int size()
Long2LongMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Long2LongMapclear in interface Long2LongMapclear in interface Map<Long,Long>Map.clear()public boolean containsKey(long k)
Long2LongMapcontainsKey in interface Long2LongFunctioncontainsKey in interface Long2LongMapcontainsKey in class AbstractLong2LongMapk - the key.key.Map.containsKey(Object)public boolean containsValue(long v)
Long2LongMaptrue if this map maps one or more keys to the specified value.containsValue in interface Long2LongMapcontainsValue in class AbstractLong2LongMapMap.containsValue(Object)public boolean isEmpty()
public long put(long k,
long v)
Long2LongFunctionput in interface Long2LongFunctionk - the key.v - the value.Function.put(Object,Object)public long remove(long k)
Long2LongFunctionremove in interface Long2LongFunctionk - the key.Function.remove(Object)public LongSet keySet()
AbstractLong2LongMapThe view is backed by the set returned by Map.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 Long2LongMapkeySet in interface Map<Long,Long>keySet in class AbstractLong2LongMapMap.keySet()public LongCollection values()
AbstractLong2LongMapThe view is backed by the set returned by Map.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 Long2LongMapvalues in interface Map<Long,Long>values in class AbstractLong2LongMapMap.values()public Long2LongArrayMap 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.