public class Object2ReferenceArrayMap<K,V> extends AbstractObject2ReferenceMap<K,V> implements java.io.Serializable, java.lang.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.
AbstractObject2ReferenceMap.BasicEntry<K,V>
Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.FastEntrySet<K,V>
Constructor and Description |
---|
Object2ReferenceArrayMap()
Creates a new empty array map.
|
Object2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2ReferenceArrayMap(java.util.Map<? extends K,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Object2ReferenceArrayMap(java.lang.Object[] key,
java.lang.Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2ReferenceArrayMap(java.lang.Object[] key,
java.lang.Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Object2ReferenceArrayMap(Object2ReferenceMap<K,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).
|
Object2ReferenceArrayMap<K,V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(java.lang.Object k)
Checks whether the given value is contained in
AbstractObject2ReferenceMap.keySet() . |
boolean |
containsValue(java.lang.Object v)
Checks whether the given value is contained in
AbstractObject2ReferenceMap.values() . |
V |
get(java.lang.Object k)
Returns the value associated by this function to the specified key.
|
boolean |
isEmpty() |
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2ReferenceMap.FastEntrySet<K,V> |
object2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
put(K k,
V v)
Associates the specified value with the specified key in this function (optional operation).
|
V |
remove(java.lang.Object k)
Removes this key and the associated value from this function if it is present (optional operation).
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
entrySet, equals, hashCode, putAll, toString
defaultReturnValue, defaultReturnValue
defaultReturnValue, defaultReturnValue
public Object2ReferenceArrayMap(java.lang.Object[] key, java.lang.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 Object2ReferenceArrayMap()
public Object2ReferenceArrayMap(int capacity)
capacity
- the initial capacity.public Object2ReferenceArrayMap(Object2ReferenceMap<K,V> m)
m
- a map.public Object2ReferenceArrayMap(java.util.Map<? extends K,? extends V> m)
m
- a map.public Object2ReferenceArrayMap(java.lang.Object[] key, java.lang.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 Object2ReferenceMap.FastEntrySet<K,V> object2ReferenceEntrySet()
Object2ReferenceMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2ReferenceMap.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).
object2ReferenceEntrySet
in interface Object2ReferenceMap<K,V>
Object2ReferenceMap.entrySet()
public V get(java.lang.Object k)
Function
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(java.lang.Object k)
AbstractObject2ReferenceMap
AbstractObject2ReferenceMap.keySet()
.containsKey
in interface Function<K,V>
containsKey
in interface java.util.Map<K,V>
containsKey
in class AbstractObject2ReferenceMap<K,V>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(java.lang.Object v)
AbstractObject2ReferenceMap
AbstractObject2ReferenceMap.values()
.containsValue
in interface java.util.Map<K,V>
containsValue
in class AbstractObject2ReferenceMap<K,V>
public boolean isEmpty()
public V put(K k, V v)
Function
put
in interface Function<K,V>
put
in interface java.util.Map<K,V>
put
in class AbstractObject2ReferenceFunction<K,V>
k
- the key.v
- the value.null
if no value was present for the given key.Map.put(Object,Object)
public V remove(java.lang.Object k)
Function
public ObjectSet<K> keySet()
AbstractObject2ReferenceMap
The view is backed by the set returned by AbstractObject2ReferenceMap.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 Object2ReferenceMap<K,V>
keySet
in interface java.util.Map<K,V>
keySet
in class AbstractObject2ReferenceMap<K,V>
Map.keySet()
public ReferenceCollection<V> values()
AbstractObject2ReferenceMap
The view is backed by the set returned by AbstractObject2ReferenceMap.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 Object2ReferenceMap<K,V>
values
in interface java.util.Map<K,V>
values
in class AbstractObject2ReferenceMap<K,V>
Map.values()
public Object2ReferenceArrayMap<K,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.
clone
in class java.lang.Object