it.unimi.dsi.fastutil.doubles
Class Double2DoubleOpenHashMap

java.lang.Object
  extended by it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleFunction
      extended by it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap
          extended by it.unimi.dsi.fastutil.doubles.Double2DoubleOpenHashMap
All Implemented Interfaces:
Double2DoubleFunction, Double2DoubleMap, Function<Double,Double>, Hash, Serializable, Cloneable, Map<Double,Double>

public class Double2DoubleOpenHashMap
extends AbstractDouble2DoubleMap
implements Serializable, Cloneable, Hash

A type-specific hash map with a fast, small-footprint implementation.

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.

See Also:
Hash, HashCommon, Serialized Form

Nested Class Summary
 
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap
AbstractDouble2DoubleMap.BasicEntry
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
Hash.Strategy<K>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2DoubleMap
Double2DoubleMap.Entry, Double2DoubleMap.FastEntrySet
 
Field Summary
static long serialVersionUID
           
 
Fields inherited from interface it.unimi.dsi.fastutil.Hash
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR
 
Constructor Summary
Double2DoubleOpenHashMap()
          Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
Double2DoubleOpenHashMap(double[] k, double[] v)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
Double2DoubleOpenHashMap(double[] k, double[] v, float f)
          Creates a new hash map using the elements of two parallel arrays.
Double2DoubleOpenHashMap(Double2DoubleMap m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
Double2DoubleOpenHashMap(Double2DoubleMap m, float f)
          Creates a new hash map copying a given type-specific one.
Double2DoubleOpenHashMap(int expected)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
Double2DoubleOpenHashMap(int expected, float f)
          Creates a new hash map.
Double2DoubleOpenHashMap(Map<? extends Double,? extends Double> m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
Double2DoubleOpenHashMap(Map<? extends Double,? extends Double> m, float f)
          Creates a new hash map copying a given one.
 
Method Summary
 double add(double k, double incr)
          Adds an increment to value currently associated with a key.
 void clear()
          Removes all associations from this function (optional operation).
 Double2DoubleOpenHashMap clone()
          Returns a deep copy of this map.
 boolean containsKey(double k)
          Checks whether the given value is contained in AbstractDouble2DoubleMap.keySet().
 boolean containsValue(double v)
          Checks whether the given value is contained in AbstractDouble2DoubleMap.values().
 Double2DoubleMap.FastEntrySet double2DoubleEntrySet()
          Returns a type-specific set view of the mappings contained in this map.
 double get(double k)
          Returns the value to which the given key is mapped.
 Double 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.
 double put(double k, double v)
          Adds a pair to the map.
 Double put(Double ok, Double ov)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 boolean rehash()
          Deprecated. A no-op.
 double remove(double k)
          Removes the mapping with the given key.
 Double 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.
 DoubleCollection values()
          Returns a type-specific-set view of the values of this map.
 
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleMap
containsValue, entrySet, equals, putAll, toString
 
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2DoubleFunction
containsKey, defaultReturnValue, defaultReturnValue, get
 
Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait
 
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2DoubleFunction
defaultReturnValue, defaultReturnValue
 
Methods inherited from interface it.unimi.dsi.fastutil.Function
containsKey, get
 
Methods inherited from interface java.util.Map
containsKey, get
 

Field Detail

serialVersionUID

public static final long serialVersionUID
See Also:
Constant Field Values
Constructor Detail

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(int expected,
                                float f)
Creates a new hash map.

The actual table size will be the least power of two greater than expected/f.

Parameters:
expected - the expected number of elements in the hash set.
f - the load factor.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(int expected)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.

Parameters:
expected - the expected number of elements in the hash map.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap()
Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.


Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(Map<? extends Double,? extends Double> m,
                                float f)
Creates a new hash map copying a given one.

Parameters:
m - a Map to be copied into the new hash map.
f - the load factor.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(Map<? extends Double,? extends Double> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.

Parameters:
m - a Map to be copied into the new hash map.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(Double2DoubleMap m,
                                float f)
Creates a new hash map copying a given type-specific one.

Parameters:
m - a type-specific map to be copied into the new hash map.
f - the load factor.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(Double2DoubleMap m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.

Parameters:
m - a type-specific map to be copied into the new hash map.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(double[] k,
                                double[] v,
                                float f)
Creates a new hash map using the elements of two parallel arrays.

Parameters:
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.
Throws:
IllegalArgumentException - if k and v have different lengths.

Double2DoubleOpenHashMap

public Double2DoubleOpenHashMap(double[] k,
                                double[] v)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.

Parameters:
k - the array of keys of the new hash map.
v - the array of corresponding values in the new hash map.
Throws:
IllegalArgumentException - if k and v have different lengths.
Method Detail

put

public double put(double k,
                  double v)
Description copied from interface: Double2DoubleFunction
Adds a pair to the map.

Specified by:
put in interface Double2DoubleFunction
Overrides:
put in class AbstractDouble2DoubleFunction
Parameters:
k - the key.
v - the value.
Returns:
the old value, or the default return value if no value was present for the given key.
See Also:
Function.put(Object,Object)

put

public Double put(Double ok,
                  Double ov)
Description copied from class: AbstractDouble2DoubleFunction
Delegates to the corresponding type-specific method, taking care of returning null 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.

Specified by:
put in interface Function<Double,Double>
Specified by:
put in interface Map<Double,Double>
Overrides:
put in class AbstractDouble2DoubleFunction
Parameters:
ok - the key.
ov - the value.
Returns:
the old value, or null if no value was present for the given key.
See Also:
Map.put(Object,Object)

add

public double add(double k,
                  double incr)
Adds an increment to value currently associated with a key.

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.

Parameters:
k - the key.
incr - the increment.
Returns:
the old value, or the default return value if no value was present for the given key.

remove

public double remove(double k)
Description copied from interface: Double2DoubleFunction
Removes the mapping with the given key.

Specified by:
remove in interface Double2DoubleFunction
Overrides:
remove in class AbstractDouble2DoubleFunction
Returns:
the old value, or the default return value if no value was present for the given key.
See Also:
Function.remove(Object)

remove

public Double remove(Object ok)
Description copied from class: AbstractDouble2DoubleFunction
Delegates to the corresponding type-specific method, taking care of returning null 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.

Specified by:
remove in interface Function<Double,Double>
Specified by:
remove in interface Map<Double,Double>
Overrides:
remove in class AbstractDouble2DoubleFunction
Returns:
the old value, or null if no value was present for the given key.
See Also:
Map.remove(Object)

get

public Double get(Double ok)

get

public double get(double k)
Description copied from interface: Double2DoubleFunction
Returns the value to which the given key is mapped.

Specified by:
get in interface Double2DoubleFunction
Parameters:
k - the key.
Returns:
the corresponding value, or the default return value if no value was present for the given key.
See Also:
Function.get(Object)

containsKey

public boolean containsKey(double k)
Description copied from class: AbstractDouble2DoubleMap
Checks whether the given value is contained in AbstractDouble2DoubleMap.keySet().

Specified by:
containsKey in interface Double2DoubleFunction
Overrides:
containsKey in class AbstractDouble2DoubleMap
See Also:
Function.containsKey(Object)

containsValue

public boolean containsValue(double v)
Description copied from class: AbstractDouble2DoubleMap
Checks whether the given value is contained in AbstractDouble2DoubleMap.values().

Specified by:
containsValue in interface Double2DoubleMap
Overrides:
containsValue in class AbstractDouble2DoubleMap
See Also:
Map.containsValue(Object)

clear

public void clear()
Description copied from interface: Function
Removes all associations from this function (optional operation).

Specified by:
clear in interface Function<Double,Double>
Specified by:
clear in interface Map<Double,Double>
Overrides:
clear in class AbstractDouble2DoubleFunction
See Also:
Map.clear()

size

public int size()
Description copied from interface: Function
Returns the intended number of keys in this function, or -1 if no such number exists.

Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.

Specified by:
size in interface Function<Double,Double>
Specified by:
size in interface Map<Double,Double>
Returns:
the intended number of keys in this function, or -1 if that number is not available.

isEmpty

public boolean isEmpty()
Specified by:
isEmpty in interface Map<Double,Double>
Overrides:
isEmpty in class AbstractDouble2DoubleMap

growthFactor

@Deprecated
public void growthFactor(int growthFactor)
Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.

A no-op for backward compatibility.

Parameters:
growthFactor - unused.

growthFactor

@Deprecated
public int growthFactor()
Deprecated. Since fastutil 6.1.0, hash tables are doubled when they are too full.

Gets the growth factor (2).

Returns:
the growth factor of this set, which is fixed (2).
See Also:
growthFactor(int)

double2DoubleEntrySet

public Double2DoubleMap.FastEntrySet double2DoubleEntrySet()
Description copied from interface: Double2DoubleMap
Returns a type-specific set view of the mappings contained in this map.

This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Double2DoubleMap.entrySet() so that it returns an ObjectSet of objects of type Double2DoubleMap.Entry (the latter makes it possible to access keys and values with type-specific methods).

Specified by:
double2DoubleEntrySet in interface Double2DoubleMap
Returns:
a type-specific set view of the mappings contained in this map.
See Also:
Double2DoubleMap.entrySet()

keySet

public DoubleSet keySet()
Description copied from class: AbstractDouble2DoubleMap
Returns a type-specific-set view of the keys of this map.

The view is backed by the set returned by AbstractDouble2DoubleMap.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.

Specified by:
keySet in interface Double2DoubleMap
Specified by:
keySet in interface Map<Double,Double>
Overrides:
keySet in class AbstractDouble2DoubleMap
Returns:
a set view of the keys of this map; it may be safely cast to a type-specific interface.
See Also:
Map.keySet()

values

public DoubleCollection values()
Description copied from class: AbstractDouble2DoubleMap
Returns a type-specific-set view of the values of this map.

The view is backed by the set returned by AbstractDouble2DoubleMap.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.

Specified by:
values in interface Double2DoubleMap
Specified by:
values in interface Map<Double,Double>
Overrides:
values in class AbstractDouble2DoubleMap
Returns:
a set view of the values of this map; it may be safely cast to a type-specific interface.
See Also:
Map.values()

rehash

@Deprecated
public boolean rehash()
Deprecated. A no-op.

A no-op for backward compatibility. The kind of tables implemented by this class never need rehashing.

If you need to reduce the table size to fit exactly this set, use trim().

Returns:
true.
See Also:
trim()

trim

public boolean trim()
Rehashes the map, making the table as small as possible.

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.

Returns:
true if there was enough memory to trim the map.
See Also:
trim(int)

trim

public boolean trim(int n)
Rehashes this map if the table is too large.

Let N be the smallest table size that can hold max(n,size()) 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.

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.

Parameters:
n - the threshold for the trimming.
Returns:
true if there was enough memory to trim the map.
See Also:
trim()

clone

public Double2DoubleOpenHashMap clone()
Returns a deep copy of this map.

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.

Overrides:
clone in class Object
Returns:
a deep copy of this map.

hashCode

public int hashCode()
Returns a hash code for this map. This method overrides the generic method provided by the superclass. Since 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.

Specified by:
hashCode in interface Map<Double,Double>
Overrides:
hashCode in class AbstractDouble2DoubleMap
Returns:
a hash code for this map.