public class Object2CharArrayMap<K> extends AbstractObject2CharMap<K> 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.
AbstractObject2CharMap.BasicEntry<K>Object2CharMap.Entry<K>, Object2CharMap.FastEntrySet<K>| Constructor and Description |
|---|
Object2CharArrayMap()
Creates a new empty array map.
|
Object2CharArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2CharArrayMap(Map<? extends K,? extends Character> m)
Creates a new empty array map copying the entries of a given map.
|
Object2CharArrayMap(Object[] key,
char[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2CharArrayMap(Object[] key,
char[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Object2CharArrayMap(Object2CharMap<K> 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).
|
Object2CharArrayMap<K> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractObject2CharMap.values(). |
char |
getChar(Object k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2CharMap.FastEntrySet<K> |
object2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
char |
put(K k,
char v)
Adds a pair to the map.
|
char |
removeChar(Object k)
Removes the mapping with the given key.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
CharCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfPresent, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Object2CharArrayMap(Object[] key, char[] 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 Object2CharArrayMap()
public Object2CharArrayMap(int capacity)
capacity - the initial capacity.public Object2CharArrayMap(Object2CharMap<K> m)
m - a map.public Object2CharArrayMap(Map<? extends K,? extends Character> m)
m - a map.public Object2CharArrayMap(Object[] key, char[] 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 Object2CharMap.FastEntrySet<K> object2CharEntrySet()
Object2CharMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Object2CharMap.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).
object2CharEntrySet in interface Object2CharMap<K>Object2CharMap.entrySet()public char getChar(Object k)
Object2CharFunctiongetChar in interface Object2CharFunction<K>k - the key.Function.get(Object)public int size()
FunctionMost 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()
Functionpublic boolean containsKey(Object k)
AbstractObject2CharMapAbstractObject2CharMap.keySet().containsKey in interface Function<K,Character>containsKey in interface Map<K,Character>containsKey in class AbstractObject2CharMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(char v)
AbstractObject2CharMapAbstractObject2CharMap.values().containsValue in interface Object2CharMap<K>containsValue in class AbstractObject2CharMap<K>Map.containsValue(Object)public boolean isEmpty()
public char put(K k, char v)
Object2CharFunctionput in interface Object2CharFunction<K>put in class AbstractObject2CharFunction<K>k - the key.v - the value.Function.put(Object,Object)public char removeChar(Object k)
Object2CharFunctionremoveChar in interface Object2CharFunction<K>removeChar in class AbstractObject2CharFunction<K>k - the key.Function.remove(Object)public ObjectSet<K> keySet()
AbstractObject2CharMapThe view is backed by the set returned by AbstractObject2CharMap.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 Object2CharMap<K>keySet in interface Map<K,Character>keySet in class AbstractObject2CharMap<K>Map.keySet()public CharCollection values()
AbstractObject2CharMapThe view is backed by the set returned by AbstractObject2CharMap.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 Object2CharMap<K>values in interface Map<K,Character>values in class AbstractObject2CharMap<K>Map.values()public Object2CharArrayMap<K> 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.