Float2ReferenceFunction<V>
, Float2ReferenceMap<V>
, Function<java.lang.Float,V>
, java.io.Serializable
, java.lang.Cloneable
, java.util.function.DoubleFunction<V>
, java.util.function.Function<java.lang.Float,V>
, java.util.Map<java.lang.Float,V>
public class Float2ReferenceArrayMap<V> extends AbstractFloat2ReferenceMap<V> implements java.io.Serializable, java.lang.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.
AbstractFloat2ReferenceMap.BasicEntry<V>, AbstractFloat2ReferenceMap.BasicEntrySet<V>
Float2ReferenceMap.Entry<V>, Float2ReferenceMap.FastEntrySet<V>
Constructor | Description |
---|---|
Float2ReferenceArrayMap() |
Creates a new empty array map.
|
Float2ReferenceArrayMap(float[] key,
java.lang.Object[] value) |
Creates a new empty array map with given key and value backing arrays.
|
Float2ReferenceArrayMap(float[] key,
java.lang.Object[] value,
int size) |
Creates a new array map with given key and value backing arrays, using the
given number of elements.
|
Float2ReferenceArrayMap(int capacity) |
Creates a new empty array map of given capacity.
|
Float2ReferenceArrayMap(Float2ReferenceMap<V> m) |
Creates a new empty array map copying the entries of a given map.
|
Float2ReferenceArrayMap(java.util.Map<? extends java.lang.Float,? extends V> m) |
Creates a new empty array map copying the entries of a given map.
|
Modifier and Type | Method | Description |
---|---|---|
void |
clear() |
Removes all of the mappings from this map (optional operation).
|
Float2ReferenceArrayMap<V> |
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(java.lang.Object v) |
|
Float2ReferenceMap.FastEntrySet<V> |
float2ReferenceEntrySet() |
Returns a type-specific set view of the mappings contained in this map.
|
V |
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.
|
V |
put(float k,
V v) |
Adds a pair to the map (optional operation).
|
V |
remove(float k) |
Removes the mapping with the given key (optional operation).
|
int |
size() |
Returns the number of key/value mappings in this map.
|
ReferenceCollection<V> |
values() |
Returns a type-specific-set view of the values of this map.
|
defaultReturnValue, defaultReturnValue
equals, hashCode, putAll, toString
apply
compute, compute, computeIfAbsent, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, computeIfPresent, containsKey, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, getOrDefault, merge, merge, put, putIfAbsent, putIfAbsent, remove, remove, remove, replace, replace, replace, replace
public Float2ReferenceArrayMap(float[] key, java.lang.Object[] 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 Float2ReferenceArrayMap()
public Float2ReferenceArrayMap(int capacity)
capacity
- the initial capacity.public Float2ReferenceArrayMap(Float2ReferenceMap<V> m)
m
- a map.public Float2ReferenceArrayMap(java.util.Map<? extends java.lang.Float,? extends V> m)
m
- a map.public Float2ReferenceArrayMap(float[] key, java.lang.Object[] 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 Float2ReferenceMap.FastEntrySet<V> float2ReferenceEntrySet()
Float2ReferenceMap
This 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).
float2ReferenceEntrySet
in interface Float2ReferenceMap<V>
Map.entrySet()
public V get(float k)
Float2ReferenceFunction
get
in interface Float2ReferenceFunction<V>
k
- the key.Function.get(Object)
public int size()
Float2ReferenceMap
Integer.MAX_VALUE
elements, returns
Integer.MAX_VALUE
.public void clear()
Float2ReferenceMap
public boolean containsKey(float k)
Float2ReferenceMap
containsKey
in interface Float2ReferenceFunction<V>
containsKey
in interface Float2ReferenceMap<V>
containsKey
in class AbstractFloat2ReferenceMap<V>
k
- the key.key
.Map.containsKey(Object)
public boolean containsValue(java.lang.Object v)
containsValue
in interface java.util.Map<java.lang.Float,V>
containsValue
in class AbstractFloat2ReferenceMap<V>
public boolean isEmpty()
isEmpty
in interface java.util.Map<java.lang.Float,V>
isEmpty
in class AbstractFloat2ReferenceMap<V>
public V put(float k, V v)
Float2ReferenceFunction
put
in interface Float2ReferenceFunction<V>
k
- the key.v
- the value.Function.put(Object,Object)
public V remove(float k)
Float2ReferenceFunction
remove
in interface Float2ReferenceFunction<V>
k
- the key.Function.remove(Object)
public FloatSet keySet()
AbstractFloat2ReferenceMap
The 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 Float2ReferenceMap<V>
keySet
in interface java.util.Map<java.lang.Float,V>
keySet
in class AbstractFloat2ReferenceMap<V>
Map.keySet()
public ReferenceCollection<V> values()
AbstractFloat2ReferenceMap
The 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 Float2ReferenceMap<V>
values
in interface java.util.Map<java.lang.Float,V>
values
in class AbstractFloat2ReferenceMap<V>
Map.values()
public Float2ReferenceArrayMap<V> 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.