public class Object2LongArrayMap<K> extends AbstractObject2LongMap<K> 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.
AbstractObject2LongMap.BasicEntry<K>
Object2LongMap.Entry<K>, Object2LongMap.FastEntrySet<K>
Constructor and Description |
---|
Object2LongArrayMap()
Creates a new empty array map.
|
Object2LongArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2LongArrayMap(Map<? extends K,? extends Long> m)
Creates a new empty array map copying the entries of a given map.
|
Object2LongArrayMap(Object[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2LongArrayMap(Object[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Object2LongArrayMap(Object2LongMap<K> 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).
|
Object2LongArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in
AbstractObject2LongMap.values() . |
long |
getLong(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2LongMap.FastEntrySet<K> |
object2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
long |
put(K k,
long v)
Adds a pair to the map.
|
long |
removeLong(Object 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, toString
defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
compute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAll
public Object2LongArrayMap(Object[] 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 Object2LongArrayMap()
public Object2LongArrayMap(int capacity)
capacity
- the initial capacity.public Object2LongArrayMap(Object2LongMap<K> m)
m
- a map.public Object2LongArrayMap(Map<? extends K,? extends Long> m)
m
- a map.public Object2LongArrayMap(Object[] 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 Object2LongMap.FastEntrySet<K> object2LongEntrySet()
Object2LongMap
This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Object2LongMap.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).
object2LongEntrySet
in interface Object2LongMap<K>
Object2LongMap.entrySet()
public long getLong(Object k)
Object2LongFunction
getLong
in interface Object2LongFunction<K>
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(Object k)
AbstractObject2LongMap
AbstractObject2LongMap.keySet()
.containsKey
in interface Function<K,Long>
containsKey
in interface Map<K,Long>
containsKey
in class AbstractObject2LongMap<K>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(long v)
AbstractObject2LongMap
AbstractObject2LongMap.values()
.containsValue
in interface Object2LongMap<K>
containsValue
in class AbstractObject2LongMap<K>
Map.containsValue(Object)
public boolean isEmpty()
public long put(K k, long v)
Object2LongFunction
put
in interface Object2LongFunction<K>
put
in class AbstractObject2LongFunction<K>
k
- the key.v
- the value.Function.put(Object,Object)
public long removeLong(Object k)
Object2LongFunction
removeLong
in interface Object2LongFunction<K>
removeLong
in class AbstractObject2LongFunction<K>
k
- the key.Function.remove(Object)
public ObjectSet<K> keySet()
AbstractObject2LongMap
The view is backed by the set returned by AbstractObject2LongMap.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 Object2LongMap<K>
keySet
in interface Map<K,Long>
keySet
in class AbstractObject2LongMap<K>
Map.keySet()
public LongCollection values()
AbstractObject2LongMap
The view is backed by the set returned by AbstractObject2LongMap.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 Object2LongMap<K>
values
in interface Map<K,Long>
values
in class AbstractObject2LongMap<K>
Map.values()
public Object2LongArrayMap<K> 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.