public class Reference2ReferenceArrayMap<K,V> extends AbstractReference2ReferenceMap<K,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.
AbstractReference2ReferenceMap.BasicEntry<K,V>
Reference2ReferenceMap.Entry<K,V>, Reference2ReferenceMap.FastEntrySet<K,V>
Constructor and Description |
---|
Reference2ReferenceArrayMap()
Creates a new empty array map.
|
Reference2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2ReferenceArrayMap(Map<? extends K,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2ReferenceArrayMap(Object[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2ReferenceArrayMap(Object[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2ReferenceArrayMap(Reference2ReferenceMap<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).
|
Reference2ReferenceArrayMap<K,V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractReference2ReferenceMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractReference2ReferenceMap.values() . |
V |
get(Object k)
Returns the value associated by this function to the specified key.
|
boolean |
isEmpty() |
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(K k,
V v)
Associates the specified value with the specified key in this function (optional operation).
|
Reference2ReferenceMap.FastEntrySet<K,V> |
reference2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
remove(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 Reference2ReferenceArrayMap(Object[] 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 Reference2ReferenceArrayMap()
public Reference2ReferenceArrayMap(int capacity)
capacity
- the initial capacity.public Reference2ReferenceArrayMap(Reference2ReferenceMap<K,V> m)
m
- a map.public Reference2ReferenceArrayMap(Map<? extends K,? extends V> m)
m
- a map.public Reference2ReferenceArrayMap(Object[] 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 Reference2ReferenceMap.FastEntrySet<K,V> reference2ReferenceEntrySet()
Reference2ReferenceMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Reference2ReferenceMap.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).
reference2ReferenceEntrySet
in interface Reference2ReferenceMap<K,V>
Reference2ReferenceMap.entrySet()
public V get(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(Object k)
AbstractReference2ReferenceMap
AbstractReference2ReferenceMap.keySet()
.containsKey
in interface Function<K,V>
containsKey
in interface Map<K,V>
containsKey
in class AbstractReference2ReferenceMap<K,V>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(Object v)
AbstractReference2ReferenceMap
AbstractReference2ReferenceMap.values()
.containsValue
in interface Map<K,V>
containsValue
in class AbstractReference2ReferenceMap<K,V>
public boolean isEmpty()
public V put(K k, V v)
Function
public V remove(Object k)
Function
public ReferenceSet<K> keySet()
AbstractReference2ReferenceMap
The view is backed by the set returned by AbstractReference2ReferenceMap.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 Reference2ReferenceMap<K,V>
keySet
in interface Map<K,V>
keySet
in class AbstractReference2ReferenceMap<K,V>
Map.keySet()
public ReferenceCollection<V> values()
AbstractReference2ReferenceMap
The view is backed by the set returned by AbstractReference2ReferenceMap.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 Reference2ReferenceMap<K,V>
values
in interface Map<K,V>
values
in class AbstractReference2ReferenceMap<K,V>
Map.values()
public Reference2ReferenceArrayMap<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.