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 of the mappings from this map (optional operation).
|
Reference2ReferenceArrayMap<K,V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v)
Returns true if this map maps one or more keys to the
specified value.
|
V |
get(Object k)
Returns the value to which the specified key is mapped,
or
null if this map contains no mapping for the key. |
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(K k,
V v)
Adds a pair to the map (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 the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuedefaultReturnValue, defaultReturnValue, entrySetcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic 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 Map.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).
reference2ReferenceEntrySet in interface Reference2ReferenceMap<K,V>Map.entrySet()public V get(Object k)
java.util.Mapnull if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key
k to a value v such that (key==null ? k==null :
key.equals(k)), then this method returns v; otherwise
it returns null. (There can be at most one such mapping.)
If this map permits null values, then a return value of
null does not necessarily indicate that the map
contains no mapping for the key; it's also possible that the map
explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.
get in interface Reference2ReferenceFunction<K,V>get in interface Map<K,V>k - the key whose associated value is to be returnednull if this map contains no mapping for the keyFunction.get(Object)public int size()
Reference2ReferenceMapInteger.MAX_VALUE elements, returns
Integer.MAX_VALUE.public void clear()
Reference2ReferenceMapclear in interface Reference2ReferenceMap<K,V>clear in interface Map<K,V>Map.clear()public boolean containsKey(Object k)
Reference2ReferenceMapcontainsKey in interface Reference2ReferenceMap<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)
java.util.MapcontainsValue in interface Map<K,V>containsValue in class AbstractReference2ReferenceMap<K,V>v - value whose presence in this map is to be testedpublic boolean isEmpty()
java.util.Mappublic V put(K k, V v)
Reference2ReferenceMapThis default implementation just delegates to the corresponding function method.
put in interface Reference2ReferenceFunction<K,V>put in interface Reference2ReferenceMap<K,V>put in interface Map<K,V>k - the key.v - the value.Function.put(Object,Object)public V remove(Object k)
Reference2ReferenceMapThis default implementation just delegates to the corresponding type-specific–function method.
remove in interface Reference2ReferenceFunction<K,V>remove in interface Reference2ReferenceMap<K,V>remove in interface Map<K,V>k - the key.Function.remove(Object)public ReferenceSet<K> keySet()
AbstractReference2ReferenceMap
The view is backed by the set returned by Map.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 Map.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.