public class Float2ShortOpenHashMap extends AbstractFloat2ShortMap 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 FormAbstractFloat2ShortMap.BasicEntryHash.Strategy<K>Float2ShortMap.Entry, Float2ShortMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected Float2ShortMap.FastEntrySet |
entries
Cached set of entries.
|
protected float |
f
The acceptable load factor.
|
protected float[] |
key
The array of keys.
|
protected FloatSet |
keys
Cached set of keys.
|
protected int |
mask
The mask for wrapping a position counter.
|
protected int |
maxFill
Threshold after which we rehash.
|
protected int |
n
The current table size.
|
static long |
serialVersionUID |
protected int |
size
Number of entries in the set.
|
protected boolean[] |
used
The array telling whether a position is used.
|
protected short[] |
value
The array of values.
|
protected ShortCollection |
values
Cached collection of values.
|
defRetValueDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Float2ShortOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Float2ShortOpenHashMap(float[] k,
short[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Float2ShortOpenHashMap(float[] k,
short[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Float2ShortOpenHashMap(Float2ShortMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Float2ShortOpenHashMap(Float2ShortMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Float2ShortOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Float2ShortOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Float2ShortOpenHashMap(Map<? extends Float,? extends Short> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Float2ShortOpenHashMap(Map<? extends Float,? extends Short> m,
float f)
Creates a new hash map copying a given one.
|
| Modifier and Type | Method and Description |
|---|---|
short |
add(float k,
short incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2ShortOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(float k)
Checks whether the given value is contained in
AbstractFloat2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractFloat2ShortMap.values(). |
Float2ShortMap.FastEntrySet |
float2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
short |
get(float k)
Returns the value to which the given key is mapped.
|
Short |
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.
|
short |
put(float k,
short v)
Adds a pair to the map.
|
Short |
put(Float ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
boolean |
rehash()
Deprecated.
A no-op.
|
protected void |
rehash(int newN)
Resizes the map.
|
short |
remove(float k)
Removes the mapping with the given key.
|
Short |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
protected int |
shiftKeys(int pos)
Shifts left entries with the specified hash code, starting at the specified position,
and empties the resulting free entry.
|
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.
|
ShortCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getfinalize, getClass, notify, notifyAll, wait, wait, waitdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, getpublic static final long serialVersionUID
protected transient float[] key
protected transient short[] value
protected transient boolean[] used
protected final float f
protected transient int n
protected transient int maxFill
f.protected transient int mask
protected int size
protected transient volatile Float2ShortMap.FastEntrySet entries
protected transient volatile FloatSet keys
protected transient volatile ShortCollection values
public Float2ShortOpenHashMap(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 Float2ShortOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Float2ShortOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.public Float2ShortOpenHashMap(Map<? extends Float,? extends Short> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Float2ShortOpenHashMap(Map<? extends Float,? extends Short> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Float2ShortOpenHashMap(Float2ShortMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Float2ShortOpenHashMap(Float2ShortMap 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 Float2ShortOpenHashMap(float[] k,
short[] 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 Float2ShortOpenHashMap(float[] k,
short[] 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 short put(float k,
short v)
Float2ShortFunctionput in interface Float2ShortFunctionput in class AbstractFloat2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public Short put(Float ok, Short ov)
AbstractFloat2ShortFunctionnull 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 short add(float k,
short 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.protected final int shiftKeys(int pos)
pos - a starting position.public short remove(float k)
Float2ShortFunctionremove in interface Float2ShortFunctionremove in class AbstractFloat2ShortFunctionFunction.remove(Object)public Short remove(Object ok)
AbstractFloat2ShortFunctionnull 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 short get(float k)
Float2ShortFunctionget in interface Float2ShortFunctionk - the key.Function.get(Object)public boolean containsKey(float k)
AbstractFloat2ShortMapAbstractFloat2ShortMap.keySet().containsKey in interface Float2ShortFunctioncontainsKey in class AbstractFloat2ShortMapFunction.containsKey(Object)public boolean containsValue(short v)
AbstractFloat2ShortMapAbstractFloat2ShortMap.values().containsValue in interface Float2ShortMapcontainsValue in class AbstractFloat2ShortMapMap.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 Float2ShortMap.FastEntrySet float2ShortEntrySet()
Float2ShortMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Float2ShortMap.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).
float2ShortEntrySet in interface Float2ShortMapFloat2ShortMap.entrySet()public FloatSet keySet()
AbstractFloat2ShortMapThe view is backed by the set returned by AbstractFloat2ShortMap.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 Float2ShortMapkeySet in interface Map<Float,Short>keySet in class AbstractFloat2ShortMapMap.keySet()public ShortCollection values()
AbstractFloat2ShortMapThe view is backed by the set returned by AbstractFloat2ShortMap.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 Float2ShortMapvalues in interface Map<Float,Short>values in class AbstractFloat2ShortMapMap.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()protected void rehash(int newN)
This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
newN - the new sizepublic Float2ShortOpenHashMap 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.Copyright © 2013. All Rights Reserved.