public class Char2ShortArrayMap extends AbstractChar2ShortMap 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.
AbstractChar2ShortMap.BasicEntryChar2ShortMap.Entry, Char2ShortMap.FastEntrySet| Constructor and Description |
|---|
Char2ShortArrayMap()
Creates a new empty array map.
|
Char2ShortArrayMap(char[] key,
short[] value)
Creates a new empty array map with given key and value backing arrays.
|
Char2ShortArrayMap(char[] key,
short[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Char2ShortArrayMap(Char2ShortMap m)
Creates a new empty array map copying the entries of a given map.
|
Char2ShortArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Char2ShortArrayMap(Map<? extends Character,? extends Short> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
Char2ShortMap.FastEntrySet |
char2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Char2ShortArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(char k)
Checks whether the given value is contained in
AbstractChar2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractChar2ShortMap.values(). |
short |
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.
|
short |
put(char k,
short v)
Adds a pair to the map.
|
short |
remove(char 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.
|
ShortCollection |
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 Char2ShortArrayMap(char[] key,
short[] 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 Char2ShortArrayMap()
public Char2ShortArrayMap(int capacity)
capacity - the initial capacity.public Char2ShortArrayMap(Char2ShortMap m)
m - a map.public Char2ShortArrayMap(Map<? extends Character,? extends Short> m)
m - a map.public Char2ShortArrayMap(char[] key,
short[] 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 Char2ShortMap.FastEntrySet char2ShortEntrySet()
Char2ShortMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Char2ShortMap.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).
char2ShortEntrySet in interface Char2ShortMapChar2ShortMap.entrySet()public short get(char k)
Char2ShortFunctionget in interface Char2ShortFunctionk - 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(char k)
AbstractChar2ShortMapAbstractChar2ShortMap.keySet().containsKey in interface Char2ShortFunctioncontainsKey in class AbstractChar2ShortMapFunction.containsKey(Object)public boolean containsValue(short v)
AbstractChar2ShortMapAbstractChar2ShortMap.values().containsValue in interface Char2ShortMapcontainsValue in class AbstractChar2ShortMapMap.containsValue(Object)public boolean isEmpty()
public short put(char k,
short v)
Char2ShortFunctionput in interface Char2ShortFunctionput in class AbstractChar2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short remove(char k)
Char2ShortFunctionremove in interface Char2ShortFunctionremove in class AbstractChar2ShortFunctionk - the key.Function.remove(Object)public CharSet keySet()
AbstractChar2ShortMapThe view is backed by the set returned by AbstractChar2ShortMap.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 Char2ShortMapkeySet in interface Map<Character,Short>keySet in class AbstractChar2ShortMapMap.keySet()public ShortCollection values()
AbstractChar2ShortMapThe view is backed by the set returned by AbstractChar2ShortMap.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 Char2ShortMapvalues in interface Map<Character,Short>values in class AbstractChar2ShortMapMap.values()public Char2ShortArrayMap 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.