public class Short2CharArrayMap extends AbstractShort2CharMap 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.
AbstractShort2CharMap.BasicEntryShort2CharMap.Entry, Short2CharMap.FastEntrySet| Constructor and Description |
|---|
Short2CharArrayMap()
Creates a new empty array map.
|
Short2CharArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2CharArrayMap(Map<? extends Short,? extends Character> m)
Creates a new empty array map copying the entries of a given map.
|
Short2CharArrayMap(short[] key,
char[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2CharArrayMap(short[] key,
char[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2CharArrayMap(Short2CharMap 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).
|
Short2CharArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractShort2CharMap.values(). |
char |
get(short k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
ShortSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
char |
put(short k,
char v)
Adds a pair to the map.
|
char |
remove(short k)
Removes the mapping with the given key.
|
Short2CharMap.FastEntrySet |
short2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
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, toStringcontainsKey, defaultReturnValue, defaultReturnValue, get, put, removedefaultReturnValue, defaultReturnValuecontainsKey, get, put, removecompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAllpublic Short2CharArrayMap(short[] 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 Short2CharArrayMap()
public Short2CharArrayMap(int capacity)
capacity - the initial capacity.public Short2CharArrayMap(Short2CharMap m)
m - a map.public Short2CharArrayMap(Map<? extends Short,? extends Character> m)
m - a map.public Short2CharArrayMap(short[] 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 Short2CharMap.FastEntrySet short2CharEntrySet()
Short2CharMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Short2CharMap.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).
short2CharEntrySet in interface Short2CharMapShort2CharMap.entrySet()public char get(short k)
Short2CharFunctionget in interface Short2CharFunctionk - 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(short k)
AbstractShort2CharMapAbstractShort2CharMap.keySet().containsKey in interface Short2CharFunctioncontainsKey in class AbstractShort2CharMapFunction.containsKey(Object)public boolean containsValue(char v)
AbstractShort2CharMapAbstractShort2CharMap.values().containsValue in interface Short2CharMapcontainsValue in class AbstractShort2CharMapMap.containsValue(Object)public boolean isEmpty()
public char put(short k,
char v)
Short2CharFunctionput in interface Short2CharFunctionput in class AbstractShort2CharFunctionk - the key.v - the value.Function.put(Object,Object)public char remove(short k)
Short2CharFunctionremove in interface Short2CharFunctionremove in class AbstractShort2CharFunctionk - the key.Function.remove(Object)public ShortSet keySet()
AbstractShort2CharMapThe view is backed by the set returned by AbstractShort2CharMap.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 Short2CharMapkeySet in interface Map<Short,Character>keySet in class AbstractShort2CharMapMap.keySet()public CharCollection values()
AbstractShort2CharMapThe view is backed by the set returned by AbstractShort2CharMap.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 Short2CharMapvalues in interface Map<Short,Character>values in class AbstractShort2CharMapMap.values()public Short2CharArrayMap 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.