public class Char2ReferenceArrayMap<V> extends AbstractChar2ReferenceMap<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.
AbstractChar2ReferenceMap.BasicEntry<V>, AbstractChar2ReferenceMap.BasicEntrySet<V>Char2ReferenceMap.Entry<V>, Char2ReferenceMap.FastEntrySet<V>| Constructor and Description |
|---|
Char2ReferenceArrayMap()
Creates a new empty array map.
|
Char2ReferenceArrayMap(char[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Char2ReferenceArrayMap(char[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Char2ReferenceArrayMap(Char2ReferenceMap<V> m)
Creates a new empty array map copying the entries of a given map.
|
Char2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Char2ReferenceArrayMap(Map<? extends Character,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Char2ReferenceMap.FastEntrySet<V> |
char2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Char2ReferenceArrayMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(char k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(Object v) |
V |
get(char k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
CharSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(char k,
V v)
Adds a pair to the map (optional operation).
|
V |
remove(char 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, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replaceapplyforEach, replaceAllpublic Char2ReferenceArrayMap(char[] 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 Char2ReferenceArrayMap()
public Char2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Char2ReferenceArrayMap(Char2ReferenceMap<V> m)
m - a map.public Char2ReferenceArrayMap(Map<? extends Character,? extends V> m)
m - a map.public Char2ReferenceArrayMap(char[] 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 Char2ReferenceMap.FastEntrySet<V> char2ReferenceEntrySet()
Char2ReferenceMapThis 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).
char2ReferenceEntrySet in interface Char2ReferenceMap<V>Map.entrySet()public V get(char k)
Char2ReferenceFunctionget in interface Char2ReferenceFunction<V>k - the key.Function.get(Object)public int size()
Char2ReferenceMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Char2ReferenceMapclear in interface Char2ReferenceMap<V>clear in interface Map<Character,V>Map.clear()public boolean containsKey(char k)
Char2ReferenceMapcontainsKey in interface Char2ReferenceFunction<V>containsKey in interface Char2ReferenceMap<V>containsKey in class AbstractChar2ReferenceMap<V>k - the key.key.Map.containsKey(Object)public boolean containsValue(Object v)
containsValue in interface Map<Character,V>containsValue in class AbstractChar2ReferenceMap<V>public boolean isEmpty()
public V put(char k, V v)
Char2ReferenceFunctionput in interface Char2ReferenceFunction<V>k - the key.v - the value.Function.put(Object,Object)public V remove(char k)
Char2ReferenceFunctionremove in interface Char2ReferenceFunction<V>k - the key.Function.remove(Object)public CharSet keySet()
AbstractChar2ReferenceMapThe 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 Char2ReferenceMap<V>keySet in interface Map<Character,V>keySet in class AbstractChar2ReferenceMap<V>Map.keySet()public ReferenceCollection<V> values()
AbstractChar2ReferenceMapThe 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 Char2ReferenceMap<V>values in interface Map<Character,V>values in class AbstractChar2ReferenceMap<V>Map.values()public Char2ReferenceArrayMap<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.