public class Long2ObjectArrayMap<V> extends AbstractLong2ObjectMap<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.
AbstractLong2ObjectMap.BasicEntry<V>
Long2ObjectMap.Entry<V>, Long2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Long2ObjectArrayMap()
Creates a new empty array map.
|
Long2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Long2ObjectArrayMap(long[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Long2ObjectArrayMap(long[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Long2ObjectArrayMap(Long2ObjectMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Long2ObjectArrayMap(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).
|
Long2ObjectArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractLong2ObjectMap.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.
|
Long2ObjectMap.FastEntrySet<V> |
long2ObjectEntrySet()
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.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
entrySet, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
containsKey, get, put, remove
containsKey, get, put, remove
public Long2ObjectArrayMap(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 Long2ObjectArrayMap()
public Long2ObjectArrayMap(int capacity)
capacity
- the initial capacity.public Long2ObjectArrayMap(Long2ObjectMap<V> m)
m
- a map.public Long2ObjectArrayMap(Map<? extends Long,? extends V> m)
m
- a map.public Long2ObjectArrayMap(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 Long2ObjectMap.FastEntrySet<V> long2ObjectEntrySet()
Long2ObjectMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2ObjectMap.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).
long2ObjectEntrySet
in interface Long2ObjectMap<V>
Long2ObjectMap.entrySet()
public V get(long k)
Long2ObjectFunction
get
in interface Long2ObjectFunction<V>
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(long k)
AbstractLong2ObjectMap
AbstractLong2ObjectMap.keySet()
.containsKey
in interface Long2ObjectFunction<V>
containsKey
in class AbstractLong2ObjectMap<V>
Function.containsKey(Object)
public boolean containsValue(Object v)
AbstractLong2ObjectMap
AbstractLong2ObjectMap.values()
.containsValue
in interface Map<Long,V>
containsValue
in class AbstractLong2ObjectMap<V>
public boolean isEmpty()
public V put(long k, V v)
Long2ObjectFunction
put
in interface Long2ObjectFunction<V>
put
in class AbstractLong2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(long k)
Long2ObjectFunction
remove
in interface Long2ObjectFunction<V>
remove
in class AbstractLong2ObjectFunction<V>
Function.remove(Object)
public LongSet keySet()
AbstractLong2ObjectMap
The view is backed by the set returned by AbstractLong2ObjectMap.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 Long2ObjectMap<V>
keySet
in interface Map<Long,V>
keySet
in class AbstractLong2ObjectMap<V>
Map.keySet()
public ObjectCollection<V> values()
AbstractLong2ObjectMap
The view is backed by the set returned by AbstractLong2ObjectMap.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 Long2ObjectMap<V>
values
in interface Map<Long,V>
values
in class AbstractLong2ObjectMap<V>
Map.values()
public Long2ObjectArrayMap<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.