public class Short2BooleanArrayMap extends AbstractShort2BooleanMap 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.
AbstractShort2BooleanMap.BasicEntryShort2BooleanMap.Entry, Short2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Short2BooleanArrayMap()
Creates a new empty array map.
|
Short2BooleanArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Short2BooleanArrayMap(Map<? extends Short,? extends Boolean> m)
Creates a new empty array map copying the entries of a given map.
|
Short2BooleanArrayMap(short[] key,
boolean[] value)
Creates a new empty array map with given key and value backing arrays.
|
Short2BooleanArrayMap(short[] key,
boolean[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Short2BooleanArrayMap(Short2BooleanMap 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).
|
Short2BooleanArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractShort2BooleanMap.values(). |
boolean |
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.
|
boolean |
put(short k,
boolean v)
Adds a pair to the map.
|
boolean |
remove(short k)
Removes the mapping with the given key.
|
Short2BooleanMap.FastEntrySet |
short2BooleanEntrySet()
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.
|
BooleanCollection |
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 Short2BooleanArrayMap(short[] key,
boolean[] 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 Short2BooleanArrayMap()
public Short2BooleanArrayMap(int capacity)
capacity - the initial capacity.public Short2BooleanArrayMap(Short2BooleanMap m)
m - a map.public Short2BooleanArrayMap(Map<? extends Short,? extends Boolean> m)
m - a map.public Short2BooleanArrayMap(short[] key,
boolean[] 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 Short2BooleanMap.FastEntrySet short2BooleanEntrySet()
Short2BooleanMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Short2BooleanMap.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).
short2BooleanEntrySet in interface Short2BooleanMapShort2BooleanMap.entrySet()public boolean get(short k)
Short2BooleanFunctionget in interface Short2BooleanFunctionk - 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)
AbstractShort2BooleanMapAbstractShort2BooleanMap.keySet().containsKey in interface Short2BooleanFunctioncontainsKey in class AbstractShort2BooleanMapFunction.containsKey(Object)public boolean containsValue(boolean v)
AbstractShort2BooleanMapAbstractShort2BooleanMap.values().containsValue in interface Short2BooleanMapcontainsValue in class AbstractShort2BooleanMapMap.containsValue(Object)public boolean isEmpty()
public boolean put(short k,
boolean v)
Short2BooleanFunctionput in interface Short2BooleanFunctionput in class AbstractShort2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(short k)
Short2BooleanFunctionremove in interface Short2BooleanFunctionremove in class AbstractShort2BooleanFunctionk - the key.Function.remove(Object)public ShortSet keySet()
AbstractShort2BooleanMapThe view is backed by the set returned by AbstractShort2BooleanMap.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 Short2BooleanMapkeySet in interface Map<Short,Boolean>keySet in class AbstractShort2BooleanMapMap.keySet()public BooleanCollection values()
AbstractShort2BooleanMapThe view is backed by the set returned by AbstractShort2BooleanMap.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 Short2BooleanMapvalues in interface Map<Short,Boolean>values in class AbstractShort2BooleanMapMap.values()public Short2BooleanArrayMap 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.