public class Float2BooleanOpenHashMap extends AbstractFloat2BooleanMap implements Serializable, Cloneable, Hash
Instances of this class use a hash table to represent a map. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size. However, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.
Note that clear() does not modify the hash table size. Rather, a family of trimming methods lets you control the size of the table; this is particularly useful if
you reuse instances of this class.
Hash,
HashCommon,
Serialized FormAbstractFloat2BooleanMap.BasicEntryHash.Strategy<K>Float2BooleanMap.Entry, Float2BooleanMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Float2BooleanOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Float2BooleanOpenHashMap(float[] k,
boolean[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Float2BooleanOpenHashMap(float[] k,
boolean[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Float2BooleanOpenHashMap(Float2BooleanMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Float2BooleanOpenHashMap(Float2BooleanMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Float2BooleanOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Float2BooleanOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Float2BooleanOpenHashMap(Map<? extends Float,? extends Boolean> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Float2BooleanOpenHashMap(Map<? extends Float,? extends Boolean> m,
float f)
Creates a new hash map copying a given one.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2BooleanOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(float k)
Checks whether the given value is contained in
AbstractFloat2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractFloat2BooleanMap.values(). |
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 |
get(Float ok) |
int |
growthFactor()
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
void |
growthFactor(int growthFactor)
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
int |
hashCode()
Returns a hash code for this map.
|
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.
|
Boolean |
put(Float ok,
Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
void |
putAll(Map<? extends Float,? extends Boolean> m)
Puts all pairs in the given map.
|
boolean |
rehash()
Deprecated.
A no-op.
|
boolean |
remove(float k)
Removes the mapping with the given key.
|
Boolean |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
boolean |
trim()
Rehashes the map, making the table as small as possible.
|
boolean |
trim(int n)
Rehashes this map if the table is too large.
|
BooleanCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic Float2BooleanOpenHashMap(int expected,
float f)
The actual table size will be the least power of two greater than expected/f.
expected - the expected number of elements in the hash set.f - the load factor.public Float2BooleanOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Float2BooleanOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.public Float2BooleanOpenHashMap(Map<? extends Float,? extends Boolean> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Float2BooleanOpenHashMap(Map<? extends Float,? extends Boolean> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Float2BooleanOpenHashMap(Float2BooleanMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Float2BooleanOpenHashMap(Float2BooleanMap m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.m - a type-specific map to be copied into the new hash map.public Float2BooleanOpenHashMap(float[] k,
boolean[] v,
float f)
k - the array of keys of the new hash map.v - the array of corresponding values in the new hash map.f - the load factor.IllegalArgumentException - if k and v have different lengths.public Float2BooleanOpenHashMap(float[] k,
boolean[] v)
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.k - the array of keys of the new hash map.v - the array of corresponding values in the new hash map.IllegalArgumentException - if k and v have different lengths.public void putAll(Map<? extends Float,? extends Boolean> m)
public boolean put(float k,
boolean v)
Float2BooleanFunctionput in interface Float2BooleanFunctionput in class AbstractFloat2BooleanFunctionk - the key.v - the value.Function.put(Object,Object)public Boolean put(Float ok, Boolean ov)
AbstractFloat2BooleanFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
put in interface Function<Float,Boolean>put in interface Map<Float,Boolean>put in class AbstractFloat2BooleanFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public boolean remove(float k)
Float2BooleanFunctionremove in interface Float2BooleanFunctionremove in class AbstractFloat2BooleanFunctionk - the key.Function.remove(Object)public Boolean remove(Object ok)
AbstractFloat2BooleanFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a
more efficient method.
public boolean get(float k)
Float2BooleanFunctionget in interface Float2BooleanFunctionk - the key.Function.get(Object)public boolean containsKey(float k)
AbstractFloat2BooleanMapAbstractFloat2BooleanMap.keySet().containsKey in interface Float2BooleanFunctioncontainsKey in class AbstractFloat2BooleanMapFunction.containsKey(Object)public boolean containsValue(boolean v)
AbstractFloat2BooleanMapAbstractFloat2BooleanMap.values().containsValue in interface Float2BooleanMapcontainsValue in class AbstractFloat2BooleanMapMap.containsValue(Object)public void clear()
Functionpublic 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 boolean isEmpty()
@Deprecated public void growthFactor(int growthFactor)
fastutil 6.1.0, hash tables are doubled when they are too full.growthFactor - unused.@Deprecated public int growthFactor()
fastutil 6.1.0, hash tables are doubled when they are too full.growthFactor(int)public Float2BooleanMap.FastEntrySet float2BooleanEntrySet()
Float2BooleanMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Float2BooleanMap.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).
float2BooleanEntrySet in interface Float2BooleanMapFloat2BooleanMap.entrySet()public FloatSet keySet()
AbstractFloat2BooleanMapThe view is backed by the set returned by AbstractFloat2BooleanMap.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 AbstractFloat2BooleanMap.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()@Deprecated public boolean rehash()
If you need to reduce the table size to fit exactly this set, use trim().
trim()public boolean trim()
This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.
If the table size is already the minimum possible, this method does nothing.
trim(int)public boolean trim(int n)
Let N be the smallest table size that can hold max(n, entries, still satisfying the load factor. If the current table size is smaller than or equal to
N, this method does nothing. Otherwise, it rehashes this map in a table of size N.
size())
This method is useful when reusing maps. Clearing a map leaves the table size untouched. If you are reusing a map many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient maps.
n - the threshold for the trimming.trim()public Float2BooleanOpenHashMap 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.
public int hashCode()
equals() is not overriden, it is important that the value returned by this method is the same value as
the one returned by the overriden method.