public class Double2ObjectOpenHashMap<V> extends AbstractDouble2ObjectMap<V> 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 FormAbstractDouble2ObjectMap.BasicEntry<V>Hash.Strategy<K>Double2ObjectMap.Entry<V>, Double2ObjectMap.FastEntrySet<V>| Modifier and Type | Field and Description |
|---|---|
protected Double2ObjectMap.FastEntrySet<V> |
entries
Cached set of entries.
|
protected float |
f
The acceptable load factor.
|
protected double[] |
key
The array of keys.
|
protected DoubleSet |
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 V[] |
value
The array of values.
|
protected ObjectCollection<V> |
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 |
|---|
Double2ObjectOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Double2ObjectOpenHashMap(double[] k,
V[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Double2ObjectOpenHashMap(double[] k,
V[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Double2ObjectOpenHashMap(Double2ObjectMap<V> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Double2ObjectOpenHashMap(Double2ObjectMap<V> m,
float f)
Creates a new hash map copying a given type-specific one.
|
Double2ObjectOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Double2ObjectOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Double2ObjectOpenHashMap(Map<? extends Double,? extends V> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Double2ObjectOpenHashMap(Map<? extends Double,? extends V> 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).
|
Double2ObjectOpenHashMap<V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(double k)
Checks whether the given value is contained in
AbstractDouble2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in
AbstractDouble2ObjectMap.values(). |
Double2ObjectMap.FastEntrySet<V> |
double2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
get(double k)
Returns the value to which the given key is mapped.
|
V |
get(Double 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() |
DoubleSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(double k,
V v)
Adds a pair to the map.
|
V |
put(Double ok,
V 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.
|
V |
remove(double k)
Removes the mapping with the given key.
|
V |
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.
|
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
entrySet, equals, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getfinalize, getClass, notify, notifyAll, wait, wait, waitdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, getpublic static final long serialVersionUID
protected transient double[] key
protected transient V[] 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 Double2ObjectMap.FastEntrySet<V> entries
protected transient volatile DoubleSet keys
protected transient volatile ObjectCollection<V> values
public Double2ObjectOpenHashMap(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 Double2ObjectOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Double2ObjectOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.public Double2ObjectOpenHashMap(Map<? extends Double,? extends V> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Double2ObjectOpenHashMap(Map<? extends Double,? extends V> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Double2ObjectOpenHashMap(Double2ObjectMap<V> m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Double2ObjectOpenHashMap(Double2ObjectMap<V> 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 Double2ObjectOpenHashMap(double[] k,
V[] 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 Double2ObjectOpenHashMap(double[] k,
V[] 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 V put(double k, V v)
Double2ObjectFunctionput in interface Double2ObjectFunction<V>put in class AbstractDouble2ObjectFunction<V>k - the key.v - the value.Function.put(Object,Object)public V put(Double ok, V ov)
AbstractDouble2ObjectFunctionnull 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.
protected final int shiftKeys(int pos)
pos - a starting position.public V remove(double k)
Double2ObjectFunctionremove in interface Double2ObjectFunction<V>remove in class AbstractDouble2ObjectFunction<V>Function.remove(Object)public V remove(Object ok)
AbstractDouble2ObjectFunctionnull 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 V get(double k)
Double2ObjectFunctionget in interface Double2ObjectFunction<V>k - the key.Function.get(Object)public boolean containsKey(double k)
AbstractDouble2ObjectMapAbstractDouble2ObjectMap.keySet().containsKey in interface Double2ObjectFunction<V>containsKey in class AbstractDouble2ObjectMap<V>Function.containsKey(Object)public boolean containsValue(Object v)
AbstractDouble2ObjectMapAbstractDouble2ObjectMap.values().containsValue in interface Map<Double,V>containsValue in class AbstractDouble2ObjectMap<V>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 Double2ObjectMap.FastEntrySet<V> double2ObjectEntrySet()
Double2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2ObjectMap.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).
double2ObjectEntrySet in interface Double2ObjectMap<V>Double2ObjectMap.entrySet()public DoubleSet keySet()
AbstractDouble2ObjectMapThe view is backed by the set returned by AbstractDouble2ObjectMap.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 Double2ObjectMap<V>keySet in interface Map<Double,V>keySet in class AbstractDouble2ObjectMap<V>Map.keySet()public ObjectCollection<V> values()
AbstractDouble2ObjectMapThe view is backed by the set returned by AbstractDouble2ObjectMap.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 Double2ObjectMap<V>values in interface Map<Double,V>values in class AbstractDouble2ObjectMap<V>Map.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 Double2ObjectOpenHashMap<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.
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.