it.unimi.dsi.fastutil.objects
Class Object2DoubleLinkedOpenCustomHashMap<K>

java.lang.Object
  extended by it.unimi.dsi.fastutil.objects.AbstractObject2DoubleFunction<K>
      extended by it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap<K>
          extended by it.unimi.dsi.fastutil.objects.AbstractObject2DoubleSortedMap<K>
              extended by it.unimi.dsi.fastutil.objects.Object2DoubleLinkedOpenCustomHashMap<K>
All Implemented Interfaces:
Function<K,java.lang.Double>, Hash, Object2DoubleFunction<K>, Object2DoubleMap<K>, Object2DoubleSortedMap<K>, java.io.Serializable, java.lang.Cloneable, java.util.Map<K,java.lang.Double>, java.util.SortedMap<K,java.lang.Double>

public class Object2DoubleLinkedOpenCustomHashMap<K>
extends AbstractObject2DoubleSortedMap<K>
implements java.io.Serializable, java.lang.Cloneable, Hash

A type-specific linked hash map with 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.

Iterators generated by this map will enumerate pairs in the same order in which they have been added to the map (addition of pairs whose key is already present in the set does not change the iteration order). Note that this order has nothing in common with the natural order of the keys. The order is kept by means of a doubly linked list, represented via an array of longs parallel to the table.

This class implements the interface of a sorted map, so to allow easy access of the iteration order: for instance, you can get the first key in iteration order with firstKey() without having to create an iterator; however, this class partially violates the SortedMap contract because all submap methods throw an exception and comparator() returns always null.

Additional methods, such as getAndMoveToFirst(), make it easy to use instances of this class as a cache (e.g., with LRU policy).

The iterators provided by the views of this class using are type-specific list iterators, and can be started at any element which is a key of the map, or a NoSuchElementException exception will be thrown. If, however, the provided element is not the first or last key in the set, the first access to the list index will require linear time, as in the worst case the entire key set must be scanned in iteration order to retrieve the positional index of the starting key. If you use just the methods of a type-specific BidirectionalIterator, however, all operations will be performed in constant time.

See Also:
Hash, HashCommon, Serialized Form

Nested Class Summary
 
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap
AbstractObject2DoubleMap.BasicEntry<K>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
Hash.Strategy<K>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleSortedMap
Object2DoubleSortedMap.FastSortedEntrySet<K>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleMap
Object2DoubleMap.Entry<K>, Object2DoubleMap.FastEntrySet<K>
 
Field Summary
 
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
Object2DoubleLinkedOpenCustomHashMap(Hash.Strategy<K> strategy)
          Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
Object2DoubleLinkedOpenCustomHashMap(int expected, float f, Hash.Strategy<K> strategy)
          Creates a new hash map.
Object2DoubleLinkedOpenCustomHashMap(int expected, Hash.Strategy<K> strategy)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
Object2DoubleLinkedOpenCustomHashMap(K[] k, double[] v, float f, Hash.Strategy<K> strategy)
          Creates a new hash map using the elements of two parallel arrays.
Object2DoubleLinkedOpenCustomHashMap(K[] k, double[] v, Hash.Strategy<K> strategy)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends K,? extends java.lang.Double> m, float f, Hash.Strategy<K> strategy)
          Creates a new hash map copying a given one.
Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends K,? extends java.lang.Double> m, Hash.Strategy<K> strategy)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<K> m, float f, Hash.Strategy<K> strategy)
          Creates a new hash map copying a given type-specific one.
Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<K> m, Hash.Strategy<K> strategy)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
 
Method Summary
 double add(K k, double incr)
          Deprecated. use addTo() instead; having the same name of a Set method turned out to be a recipe for disaster.
 double addTo(K k, double incr)
          Adds an increment to value currently associated with a key.
 void clear()
          Removes all associations from this function (optional operation).
 Object2DoubleLinkedOpenCustomHashMap<K> clone()
          Returns a deep copy of this map.
 java.util.Comparator<? super K> comparator()
          Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
 boolean containsKey(java.lang.Object k)
          Checks whether the given value is contained in AbstractObject2DoubleMap.keySet().
 boolean containsValue(double v)
          Checks whether the given value is contained in AbstractObject2DoubleMap.values().
 K firstKey()
          Returns the first key of this map in iteration order.
 double getAndMoveToFirst(K k)
          Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.
 double getAndMoveToLast(K k)
          Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.
 double getDouble(java.lang.Object k)
          Returns the value to which the given key is mapped.
 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.
 Object2DoubleSortedMap<K> headMap(K to)
          Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
 boolean isEmpty()
           
 ObjectSortedSet<K> keySet()
          Returns a type-specific-sorted-set view of the keys of this map.
 K lastKey()
          Returns the last key of this map in iteration order.
 Object2DoubleSortedMap.FastSortedEntrySet<K> object2DoubleEntrySet()
          Returns a type-specific sorted-set view of the mappings contained in this map.
 double put(K k, double v)
          Adds a pair to the map.
 java.lang.Double put(K ok, java.lang.Double ov)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 double putAndMoveToFirst(K k, double v)
          Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.
 double putAndMoveToLast(K k, double v)
          Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.
 boolean rehash()
          Deprecated. A no-op.
 java.lang.Double remove(java.lang.Object ok)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 double removeDouble(java.lang.Object k)
          Removes the mapping with the given key.
 double removeFirstDouble()
          Removes the mapping associated with the first key in iteration order.
 double removeLastDouble()
          Removes the mapping associated with the last key in iteration order.
 int size()
          Returns the intended number of keys in this function, or -1 if no such number exists.
 Hash.Strategy<K> strategy()
          Returns the hashing strategy.
 Object2DoubleSortedMap<K> subMap(K from, K to)
          Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
 Object2DoubleSortedMap<K> tailMap(K from)
          Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.
 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 collection view of the values contained in this map.
 
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleSortedMap
entrySet
 
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleMap
containsValue, equals, putAll, toString
 
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2DoubleFunction
defaultReturnValue, defaultReturnValue, get
 
Methods inherited from class java.lang.Object
getClass, notify, notifyAll, wait, wait, wait
 
Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2DoubleFunction
defaultReturnValue, defaultReturnValue
 
Methods inherited from interface it.unimi.dsi.fastutil.Function
get
 
Methods inherited from interface java.util.Map
containsValue, equals, get, putAll
 

Constructor Detail

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(int expected,
                                            float f,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(int expected,
                                            Hash.Strategy<K> strategy)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.

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

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(Hash.Strategy<K> strategy)
Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.

Parameters:
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends K,? extends java.lang.Double> m,
                                            float f,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(java.util.Map<? extends K,? extends java.lang.Double> m,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<K> m,
                                            float f,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(Object2DoubleMap<K> m,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(K[] k,
                                            double[] v,
                                            float f,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.
Throws:
java.lang.IllegalArgumentException - if k and v have different lengths.

Object2DoubleLinkedOpenCustomHashMap

public Object2DoubleLinkedOpenCustomHashMap(K[] k,
                                            double[] v,
                                            Hash.Strategy<K> strategy)
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.
strategy - the strategy.
Throws:
java.lang.IllegalArgumentException - if k and v have different lengths.
Method Detail

strategy

public Hash.Strategy<K> strategy()
Returns the hashing strategy.

Returns:
the hashing strategy of this custom hash map.

put

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

Specified by:
put in interface Object2DoubleFunction<K>
Overrides:
put in class AbstractObject2DoubleFunction<K>
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 java.lang.Double put(K ok,
                            java.lang.Double ov)
Description copied from class: AbstractObject2DoubleFunction
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<K,java.lang.Double>
Specified by:
put in interface java.util.Map<K,java.lang.Double>
Overrides:
put in class AbstractObject2DoubleFunction<K>
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

@Deprecated
public double add(K k,
                             double incr)
Deprecated. use addTo() instead; having the same name of a Set method turned out to be a recipe for disaster.

Adds an increment to value currently associated with a key.

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.

addTo

public double addTo(K 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.

removeDouble

public double removeDouble(java.lang.Object k)
Description copied from interface: Object2DoubleFunction
Removes the mapping with the given key.

Specified by:
removeDouble in interface Object2DoubleFunction<K>
Overrides:
removeDouble in class AbstractObject2DoubleFunction<K>
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 java.lang.Double remove(java.lang.Object ok)
Description copied from class: AbstractObject2DoubleFunction
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<K,java.lang.Double>
Specified by:
remove in interface java.util.Map<K,java.lang.Double>
Overrides:
remove in class AbstractObject2DoubleFunction<K>
Returns:
the old value, or null if no value was present for the given key.
See Also:
Map.remove(Object)

removeFirstDouble

public double removeFirstDouble()
Removes the mapping associated with the first key in iteration order.

Returns:
the value previously associated with the first key in iteration order.
Throws:
java.util.NoSuchElementException - is this map is empty.

removeLastDouble

public double removeLastDouble()
Removes the mapping associated with the last key in iteration order.

Returns:
the value previously associated with the last key in iteration order.
Throws:
java.util.NoSuchElementException - is this map is empty.

getAndMoveToFirst

public double getAndMoveToFirst(K k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.

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

getAndMoveToLast

public double getAndMoveToLast(K k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.

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

putAndMoveToFirst

public double putAndMoveToFirst(K k,
                                double v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.

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.

putAndMoveToLast

public double putAndMoveToLast(K k,
                               double v)
Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.

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.

getDouble

public double getDouble(java.lang.Object k)
Description copied from interface: Object2DoubleFunction
Returns the value to which the given key is mapped.

Specified by:
getDouble in interface Object2DoubleFunction<K>
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(java.lang.Object k)
Description copied from class: AbstractObject2DoubleMap
Checks whether the given value is contained in AbstractObject2DoubleMap.keySet().

Specified by:
containsKey in interface Function<K,java.lang.Double>
Specified by:
containsKey in interface java.util.Map<K,java.lang.Double>
Overrides:
containsKey in class AbstractObject2DoubleMap<K>
Parameters:
k - the key.
Returns:
true if this function associates a value to key.
See Also:
Map.containsKey(Object)

containsValue

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

Specified by:
containsValue in interface Object2DoubleMap<K>
Overrides:
containsValue in class AbstractObject2DoubleMap<K>
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<K,java.lang.Double>
Specified by:
clear in interface java.util.Map<K,java.lang.Double>
Overrides:
clear in class AbstractObject2DoubleFunction<K>
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<K,java.lang.Double>
Specified by:
size in interface java.util.Map<K,java.lang.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 java.util.Map<K,java.lang.Double>
Overrides:
isEmpty in class AbstractObject2DoubleMap<K>

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)

firstKey

public K firstKey()
Returns the first key of this map in iteration order.

Specified by:
firstKey in interface java.util.SortedMap<K,java.lang.Double>
Returns:
the first key in iteration order.

lastKey

public K lastKey()
Returns the last key of this map in iteration order.

Specified by:
lastKey in interface java.util.SortedMap<K,java.lang.Double>
Returns:
the last key in iteration order.

comparator

public java.util.Comparator<? super K> comparator()
Description copied from interface: Object2DoubleSortedMap
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.

Note that this specification strengthens the one given in SortedMap.comparator().

Specified by:
comparator in interface Object2DoubleSortedMap<K>
Specified by:
comparator in interface java.util.SortedMap<K,java.lang.Double>
See Also:
SortedMap.comparator()

tailMap

public Object2DoubleSortedMap<K> tailMap(K from)
Description copied from interface: Object2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.

Note that this specification strengthens the one given in SortedMap.tailMap(Object).

Specified by:
tailMap in interface Object2DoubleSortedMap<K>
Specified by:
tailMap in interface java.util.SortedMap<K,java.lang.Double>
See Also:
SortedMap.tailMap(Object)

headMap

public Object2DoubleSortedMap<K> headMap(K to)
Description copied from interface: Object2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys are strictly less than toKey.

Note that this specification strengthens the one given in SortedMap.headMap(Object).

Specified by:
headMap in interface Object2DoubleSortedMap<K>
Specified by:
headMap in interface java.util.SortedMap<K,java.lang.Double>
See Also:
SortedMap.headMap(Object)

subMap

public Object2DoubleSortedMap<K> subMap(K from,
                                        K to)
Description copied from interface: Object2DoubleSortedMap
Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.

Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).

Specified by:
subMap in interface Object2DoubleSortedMap<K>
Specified by:
subMap in interface java.util.SortedMap<K,java.lang.Double>
See Also:
SortedMap.subMap(Object,Object)

object2DoubleEntrySet

public Object2DoubleSortedMap.FastSortedEntrySet<K> object2DoubleEntrySet()
Description copied from interface: Object2DoubleSortedMap
Returns a type-specific sorted-set view of the mappings contained in this map. Note that this specification strengthens the one given in the corresponding type-specific unsorted map.

Specified by:
object2DoubleEntrySet in interface Object2DoubleMap<K>
Specified by:
object2DoubleEntrySet in interface Object2DoubleSortedMap<K>
Returns:
a type-specific sorted-set view of the mappings contained in this map.
See Also:
Object2DoubleSortedMap.entrySet()

keySet

public ObjectSortedSet<K> keySet()
Description copied from class: AbstractObject2DoubleSortedMap
Returns a type-specific-sorted-set view of the keys of this map.

The view is backed by the sorted set returned by AbstractObject2DoubleSortedMap.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 Object2DoubleMap<K>
Specified by:
keySet in interface Object2DoubleSortedMap<K>
Specified by:
keySet in interface java.util.Map<K,java.lang.Double>
Specified by:
keySet in interface java.util.SortedMap<K,java.lang.Double>
Overrides:
keySet in class AbstractObject2DoubleSortedMap<K>
Returns:
a sorted 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: AbstractObject2DoubleSortedMap
Returns a type-specific collection view of the values contained in this map.

The view is backed by the sorted set returned by AbstractObject2DoubleSortedMap.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 Object2DoubleMap<K>
Specified by:
values in interface Object2DoubleSortedMap<K>
Specified by:
values in interface java.util.Map<K,java.lang.Double>
Specified by:
values in interface java.util.SortedMap<K,java.lang.Double>
Overrides:
values in class AbstractObject2DoubleSortedMap<K>
Returns:
a type-specific collection view of the values contained in this map.
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 Object2DoubleLinkedOpenCustomHashMap<K> 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 java.lang.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 java.util.Map<K,java.lang.Double>
Overrides:
hashCode in class AbstractObject2DoubleMap<K>
Returns:
a hash code for this map.