public class Int2FloatOpenCustomHashMap extends AbstractInt2FloatMap implements Serializable, Cloneable, Hash
Instances of this class use a hash table to represent a map. The table is
enlarged as needed by doubling its size when new entries are created, but it is never made
smaller (even on a clear()). A family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
Warning: The implementation of this class has significantly
changed in fastutil 6.1.0. Please read the
comments about this issue in the section “Faster Hash Tables” of the overview.
Hash,
HashCommon,
Serialized FormAbstractInt2FloatMap.BasicEntryHash.Strategy<K>Int2FloatMap.Entry, Int2FloatMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Int2FloatOpenCustomHashMap(int[] k,
float[] v,
float f,
IntHash.Strategy strategy)
Creates a new hash map using the elements of two parallel arrays.
|
Int2FloatOpenCustomHashMap(int[] k,
float[] v,
IntHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Int2FloatOpenCustomHashMap(Int2FloatMap m,
float f,
IntHash.Strategy strategy)
Creates a new hash map copying a given type-specific one.
|
Int2FloatOpenCustomHashMap(Int2FloatMap m,
IntHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Int2FloatOpenCustomHashMap(int expected,
float f,
IntHash.Strategy strategy)
Creates a new hash map.
|
Int2FloatOpenCustomHashMap(IntHash.Strategy strategy)
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Int2FloatOpenCustomHashMap(int expected,
IntHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Int2FloatOpenCustomHashMap(Map<? extends Integer,? extends Float> m,
float f,
IntHash.Strategy strategy)
Creates a new hash map copying a given one.
|
Int2FloatOpenCustomHashMap(Map<? extends Integer,? extends Float> m,
IntHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
| Modifier and Type | Method and Description |
|---|---|
float |
add(int k,
float incr)
Deprecated.
use
addTo() instead; having the same name of a Set method turned out to be a recipe for disaster. |
float |
addTo(int k,
float incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Int2FloatOpenCustomHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractInt2FloatMap.values(). |
float |
get(int k)
Returns the value to which the given key is mapped.
|
Float |
get(Integer 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.
|
Int2FloatMap.FastEntrySet |
int2FloatEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Float |
put(Integer ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
put(int k,
float v)
Adds a pair to the map.
|
boolean |
rehash()
Deprecated.
A no-op.
|
float |
remove(int k)
Removes the mapping with the given key.
|
Float |
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.
|
IntHash.Strategy |
strategy()
Returns the hashing strategy.
|
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.
|
FloatCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, getpublic Int2FloatOpenCustomHashMap(int expected,
float f,
IntHash.Strategy strategy)
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.strategy - the strategy.public Int2FloatOpenCustomHashMap(int expected,
IntHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.strategy - the strategy.public Int2FloatOpenCustomHashMap(IntHash.Strategy strategy)
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.strategy - the strategy.public Int2FloatOpenCustomHashMap(Map<? extends Integer,? extends Float> m, float f, IntHash.Strategy strategy)
m - a Map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Int2FloatOpenCustomHashMap(Map<? extends Integer,? extends Float> m, IntHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.strategy - the strategy.public Int2FloatOpenCustomHashMap(Int2FloatMap m, float f, IntHash.Strategy strategy)
m - a type-specific map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Int2FloatOpenCustomHashMap(Int2FloatMap m, IntHash.Strategy strategy)
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.strategy - the strategy.public Int2FloatOpenCustomHashMap(int[] k,
float[] v,
float f,
IntHash.Strategy strategy)
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.strategy - the strategy.IllegalArgumentException - if k and v have different lengths.public Int2FloatOpenCustomHashMap(int[] k,
float[] v,
IntHash.Strategy strategy)
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.strategy - the strategy.IllegalArgumentException - if k and v have different lengths.public IntHash.Strategy strategy()
public float put(int k,
float v)
Int2FloatFunctionput in interface Int2FloatFunctionput in class AbstractInt2FloatFunctionk - the key.v - the value.Function.put(Object,Object)public Float put(Integer ok, Float ov)
AbstractInt2FloatFunctionnull 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.
@Deprecated public float add(int k, float incr)
addTo() instead; having the same name of a Set method turned out to be a recipe for disaster.k - the key.incr - the increment.public float addTo(int k,
float incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public float remove(int k)
Int2FloatFunctionremove in interface Int2FloatFunctionremove in class AbstractInt2FloatFunctionFunction.remove(Object)public Float remove(Object ok)
AbstractInt2FloatFunctionnull 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 float get(int k)
Int2FloatFunctionget in interface Int2FloatFunctionk - the key.Function.get(Object)public boolean containsKey(int k)
AbstractInt2FloatMapAbstractInt2FloatMap.keySet().containsKey in interface Int2FloatFunctioncontainsKey in class AbstractInt2FloatMapFunction.containsKey(Object)public boolean containsValue(float v)
AbstractInt2FloatMapAbstractInt2FloatMap.values().containsValue in interface Int2FloatMapcontainsValue in class AbstractInt2FloatMapMap.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 Int2FloatMap.FastEntrySet int2FloatEntrySet()
Int2FloatMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2FloatMap.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).
int2FloatEntrySet in interface Int2FloatMapInt2FloatMap.entrySet()public IntSet keySet()
AbstractInt2FloatMapThe view is backed by the set returned by AbstractInt2FloatMap.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 Int2FloatMapkeySet in interface Map<Integer,Float>keySet in class AbstractInt2FloatMapMap.keySet()public FloatCollection values()
AbstractInt2FloatMapThe view is backed by the set returned by AbstractInt2FloatMap.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 Int2FloatMapvalues in interface Map<Integer,Float>values in class AbstractInt2FloatMapMap.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 Int2FloatOpenCustomHashMap 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.