public class Float2BooleanArrayMap extends AbstractFloat2BooleanMap 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.
AbstractFloat2BooleanMap.BasicEntry, AbstractFloat2BooleanMap.BasicEntrySetFloat2BooleanMap.Entry, Float2BooleanMap.FastEntrySet| Constructor and Description |
|---|
Float2BooleanArrayMap()
Creates a new empty array map.
|
Float2BooleanArrayMap(float[] key,
boolean[] value)
Creates a new empty array map with given key and value backing arrays.
|
Float2BooleanArrayMap(float[] key,
boolean[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Float2BooleanArrayMap(Float2BooleanMap m)
Creates a new empty array map copying the entries of a given map.
|
Float2BooleanArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Float2BooleanArrayMap(Map<? extends Float,? extends Boolean> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Float2BooleanArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(float k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(boolean v)
Returns
true if this map maps one or more keys to the specified value. |
Float2BooleanMap.FastEntrySet |
float2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
get(float k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
FloatSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
boolean |
put(float k,
boolean v)
Adds a pair to the map (optional operation).
|
boolean |
remove(float k)
Removes the mapping with the given key (optional operation).
|
int |
size()
Returns the number of key/value mappings in this map.
|
BooleanCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuecompute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentNullable, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replacetestand, negate, orforEach, replaceAllpublic Float2BooleanArrayMap(float[] 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 Float2BooleanArrayMap()
public Float2BooleanArrayMap(int capacity)
capacity - the initial capacity.public Float2BooleanArrayMap(Float2BooleanMap m)
m - a map.public Float2BooleanArrayMap(Map<? extends Float,? extends Boolean> m)
m - a map.public Float2BooleanArrayMap(float[] 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 Float2BooleanMap.FastEntrySet float2BooleanEntrySet()
Float2BooleanMapThis 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).
float2BooleanEntrySet in interface Float2BooleanMapMap.entrySet()public boolean get(float k)
Float2BooleanFunctionget in interface Float2BooleanFunctionk - the key.Function.get(Object)public int size()
Float2BooleanMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Float2BooleanMapclear in interface Float2BooleanMapclear in interface Map<Float,Boolean>Map.clear()public boolean containsKey(float k)
Float2BooleanMapcontainsKey in interface Float2BooleanFunctioncontainsKey in interface Float2BooleanMapcontainsKey in class AbstractFloat2BooleanMapk - the key.key.Map.containsKey(Object)public boolean containsValue(boolean v)
Float2BooleanMaptrue if this map maps one or more keys to the specified value.containsValue in interface Float2BooleanMapcontainsValue in class AbstractFloat2BooleanMapMap.containsValue(Object)public boolean isEmpty()
public boolean put(float k,
boolean v)
Float2BooleanFunctionput in interface Float2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public boolean remove(float k)
Float2BooleanFunctionremove in interface Float2BooleanFunctionk - the key.Function.remove(Object)public FloatSet keySet()
AbstractFloat2BooleanMapThe 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 Float2BooleanMapkeySet in interface Map<Float,Boolean>keySet in class AbstractFloat2BooleanMapMap.keySet()public BooleanCollection values()
AbstractFloat2BooleanMapThe 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 Float2BooleanMapvalues in interface Map<Float,Boolean>values in class AbstractFloat2BooleanMapMap.values()public Float2BooleanArrayMap 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.