public class Long2IntArrayMap extends AbstractLong2IntMap 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.
AbstractLong2IntMap.BasicEntryLong2IntMap.Entry, Long2IntMap.FastEntrySet| Constructor and Description |
|---|
Long2IntArrayMap()
Creates a new empty array map.
|
Long2IntArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Long2IntArrayMap(long[] key,
int[] value)
Creates a new empty array map with given key and value backing arrays.
|
Long2IntArrayMap(long[] key,
int[] value,
int size)
Creates a new array map with given key and value backing arrays, using
the given number of elements.
|
Long2IntArrayMap(Long2IntMap m)
Creates a new empty array map copying the entries of a given map.
|
Long2IntArrayMap(Map<? extends Long,? extends Integer> 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).
|
Long2IntArrayMap |
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(int v)
Returns
true if this map maps one or more keys to the specified
value. |
int |
get(long k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
LongSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Long2IntMap.FastEntrySet |
long2IntEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
int |
put(long k,
int v)
Adds a pair to the map (optional operation).
|
int |
remove(long k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
IntCollection |
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, replaceapplyAsIntforEach, replaceAllpublic Long2IntArrayMap(long[] 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 Long2IntArrayMap()
public Long2IntArrayMap(int capacity)
capacity - the initial capacity.public Long2IntArrayMap(Long2IntMap m)
m - a map.public Long2IntArrayMap(Map<? extends Long,? extends Integer> m)
m - a map.public Long2IntArrayMap(long[] 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 Long2IntMap.FastEntrySet long2IntEntrySet()
Long2IntMap
This 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).
long2IntEntrySet in interface Long2IntMapMap.entrySet()public int get(long k)
Long2IntFunctionget in interface Long2IntFunctionk - the key.Function.get(Object)public int size()
Long2IntMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Long2IntMapclear in interface Long2IntMapclear in interface Map<Long,Integer>Map.clear()public boolean containsKey(long k)
Long2IntMapcontainsKey in interface Long2IntFunctioncontainsKey in interface Long2IntMapcontainsKey in class AbstractLong2IntMapk - the key.key.Map.containsKey(Object)public boolean containsValue(int v)
Long2IntMaptrue if this map maps one or more keys to the specified
value.containsValue in interface Long2IntMapcontainsValue in class AbstractLong2IntMapMap.containsValue(Object)public boolean isEmpty()
java.util.Mappublic int put(long k,
int v)
Long2IntFunctionput in interface Long2IntFunctionk - the key.v - the value.Function.put(Object,Object)public int remove(long k)
Long2IntFunctionremove in interface Long2IntFunctionk - the key.Function.remove(Object)public LongSet keySet()
AbstractLong2IntMap
The 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 Long2IntMapkeySet in interface Map<Long,Integer>keySet in class AbstractLong2IntMapMap.keySet()public IntCollection values()
AbstractLong2IntMap
The 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 Long2IntMapvalues in interface Map<Long,Integer>values in class AbstractLong2IntMapMap.values()public Long2IntArrayMap 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.