public class Reference2ReferenceArrayMap<K,V> extends AbstractReference2ReferenceMap<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.
AbstractReference2ReferenceMap.BasicEntry<K,V>, AbstractReference2ReferenceMap.BasicEntrySet<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(java.util.Map<? extends K,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2ReferenceArrayMap(java.lang.Object[] key,
java.lang.Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2ReferenceArrayMap(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.
|
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(java.lang.Object k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(java.lang.Object v) |
V |
get(java.lang.Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
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(java.lang.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, toString
defaultReturnValue, defaultReturnValue
compute, computeIfAbsent, computeIfPresent, computeReferenceIfAbsentPartial, defaultReturnValue, defaultReturnValue, entrySet, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
public Reference2ReferenceArrayMap(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 Reference2ReferenceArrayMap()
public Reference2ReferenceArrayMap(int capacity)
capacity
- the initial capacity.public Reference2ReferenceArrayMap(Reference2ReferenceMap<K,V> m)
m
- a map.public Reference2ReferenceArrayMap(java.util.Map<? extends K,? extends V> m)
m
- a map.public Reference2ReferenceArrayMap(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 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(java.lang.Object k)
Reference2ReferenceFunction
get
in interface Reference2ReferenceFunction<K,V>
get
in interface java.util.Map<K,V>
k
- the key.Function.get(Object)
public int size()
Reference2ReferenceMap
Integer.MAX_VALUE
elements, returns Integer.MAX_VALUE
.public void clear()
Reference2ReferenceMap
public boolean containsKey(java.lang.Object k)
AbstractReference2ReferenceMap
containsKey
in interface Reference2ReferenceMap<K,V>
containsKey
in interface java.util.Map<K,V>
containsKey
in class AbstractReference2ReferenceMap<K,V>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(java.lang.Object v)
AbstractReference2ReferenceMap
containsValue
in interface java.util.Map<K,V>
containsValue
in class AbstractReference2ReferenceMap<K,V>
public boolean isEmpty()
public V put(K k, V v)
Reference2ReferenceMap
This default implementation just delegates to the corresponding function method.
put
in interface Reference2ReferenceFunction<K,V>
put
in interface Reference2ReferenceMap<K,V>
put
in interface java.util.Map<K,V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(java.lang.Object k)
Reference2ReferenceMap
This 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 java.util.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 java.util.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 java.util.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.
clone
in class java.lang.Object