public class Int2ObjectArrayMap<V> extends AbstractInt2ObjectMap<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.
AbstractInt2ObjectMap.BasicEntry<V>
Int2ObjectMap.Entry<V>, Int2ObjectMap.FastEntrySet<V>
Constructor and Description |
---|
Int2ObjectArrayMap()
Creates a new empty array map.
|
Int2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2ObjectArrayMap(int[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2ObjectArrayMap(int[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2ObjectArrayMap(Int2ObjectMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Int2ObjectArrayMap(Map<? extends Integer,? 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).
|
Int2ObjectArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractInt2ObjectMap.values() . |
V |
get(int k)
Returns the value to which the given key is mapped.
|
Int2ObjectMap.FastEntrySet<V> |
int2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(int k,
V v)
Adds a pair to the map.
|
V |
remove(int 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 Int2ObjectArrayMap(int[] 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 Int2ObjectArrayMap()
public Int2ObjectArrayMap(int capacity)
capacity
- the initial capacity.public Int2ObjectArrayMap(Int2ObjectMap<V> m)
m
- a map.public Int2ObjectArrayMap(Map<? extends Integer,? extends V> m)
m
- a map.public Int2ObjectArrayMap(int[] 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 Int2ObjectMap.FastEntrySet<V> int2ObjectEntrySet()
Int2ObjectMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2ObjectMap.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).
int2ObjectEntrySet
in interface Int2ObjectMap<V>
Int2ObjectMap.entrySet()
public V get(int k)
Int2ObjectFunction
get
in interface Int2ObjectFunction<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(int k)
AbstractInt2ObjectMap
AbstractInt2ObjectMap.keySet()
.containsKey
in interface Int2ObjectFunction<V>
containsKey
in class AbstractInt2ObjectMap<V>
Function.containsKey(Object)
public boolean containsValue(Object v)
AbstractInt2ObjectMap
AbstractInt2ObjectMap.values()
.containsValue
in interface Map<Integer,V>
containsValue
in class AbstractInt2ObjectMap<V>
public boolean isEmpty()
public V put(int k, V v)
Int2ObjectFunction
put
in interface Int2ObjectFunction<V>
put
in class AbstractInt2ObjectFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(int k)
Int2ObjectFunction
remove
in interface Int2ObjectFunction<V>
remove
in class AbstractInt2ObjectFunction<V>
k
- the key.Function.remove(Object)
public IntSet keySet()
AbstractInt2ObjectMap
The view is backed by the set returned by AbstractInt2ObjectMap.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 Int2ObjectMap<V>
keySet
in interface Map<Integer,V>
keySet
in class AbstractInt2ObjectMap<V>
Map.keySet()
public ObjectCollection<V> values()
AbstractInt2ObjectMap
The view is backed by the set returned by AbstractInt2ObjectMap.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 Int2ObjectMap<V>
values
in interface Map<Integer,V>
values
in class AbstractInt2ObjectMap<V>
Map.values()
public Int2ObjectArrayMap<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.