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

java.lang.Object
  extended by it.unimi.dsi.fastutil.objects.AbstractReference2DoubleFunction<K>
      extended by it.unimi.dsi.fastutil.objects.AbstractReference2DoubleMap<K>
          extended by it.unimi.dsi.fastutil.objects.AbstractReference2DoubleSortedMap<K>
              extended by it.unimi.dsi.fastutil.objects.Reference2DoubleLinkedOpenHashMap<K>
All Implemented Interfaces:
Function<K,Double>, Hash, Reference2DoubleFunction<K>, Reference2DoubleMap<K>, Reference2DoubleSortedMap<K>, Serializable, Cloneable, Map<K,Double>, SortedMap<K,Double>

public class Reference2DoubleLinkedOpenHashMap<K>
extends AbstractReference2DoubleSortedMap<K>
implements Serializable, 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 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.

The enlargement speed is controlled by the growth factor, a positive number. If the growth factor is p, then the table is enlarged each time roughly by a factor 2p/16. By default, p is Hash.DEFAULT_GROWTH_FACTOR, which means that the table is doubled at each enlargement, but one can easily set more or less aggressive policies by calling growthFactor(int) (note that the growth factor is not serialized: deserialized tables gets the default growth factor).

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.

The iterators provided by the views of this class using are type-specific list iterators. However, creation of an iterator using a starting point is going to be very expensive, as the chosen starting point must be linearly searched for, unless it is lastKey(), in which case the iterator is created in constant time.

Note that deletions in a linked table require scanning the list until the element to be removed is found. The only exceptions are the first element, the last element, and deletions performed using an iterator.

See Also:
Hash, HashCommon, Serialized Form

Nested Class Summary
 
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2DoubleMap
AbstractReference2DoubleMap.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.Reference2DoubleSortedMap
Reference2DoubleSortedMap.FastSortedEntrySet<K>
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2DoubleMap
Reference2DoubleMap.Entry<K>, Reference2DoubleMap.FastEntrySet<K>
 
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
Reference2DoubleLinkedOpenHashMap()
          Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
Reference2DoubleLinkedOpenHashMap(int n)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
Reference2DoubleLinkedOpenHashMap(int n, float f)
          Creates a new hash map.
Reference2DoubleLinkedOpenHashMap(K[] k, double[] v)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
Reference2DoubleLinkedOpenHashMap(K[] k, double[] v, float f)
          Creates a new hash map using the elements of two parallel arrays.
Reference2DoubleLinkedOpenHashMap(Map<? extends K,? extends Double> m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
Reference2DoubleLinkedOpenHashMap(Map<? extends K,? extends Double> m, float f)
          Creates a new hash map copying a given one.
Reference2DoubleLinkedOpenHashMap(Reference2DoubleMap<K> m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
Reference2DoubleLinkedOpenHashMap(Reference2DoubleMap<K> m, float f)
          Creates a new hash map copying a given type-specific one.
 
Method Summary
 void clear()
          Removes all associations from this function (optional operation).
 Object clone()
          Returns a deep copy of this map.
 Comparator<? super K> comparator()
          Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
 boolean containsKey(Object k)
          Checks whether the given value is contained in AbstractReference2DoubleMap.keySet().
 boolean containsValue(double v)
          Checks whether the given value is contained in AbstractReference2DoubleMap.values().
 K firstKey()
          Returns the first key of this map in iteration order.
 double getDouble(Object k)
          Returns the value to which the given key is mapped.
 int growthFactor()
          Gets the growth factor.
 void growthFactor(int growthFactor)
          Sets the growth factor.
 int hashCode()
          Returns a hash code for this map.
 Reference2DoubleSortedMap<K> headMap(K to)
          Delegates to the corresponding type-specific method.
 boolean isEmpty()
           
 ReferenceSortedSet<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.
 double put(K k, double v)
          Adds a pair to the map.
 Double put(K ok, Double ov)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 Reference2DoubleSortedMap.FastSortedEntrySet<K> reference2DoubleEntrySet()
          Returns a type-specific sorted-set view of the mappings contained in this map.
 boolean rehash()
          Rehashes this map without changing the table size.
 Double remove(Object ok)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 double removeDouble(Object k)
          Removes the mapping with the given key.
 int size()
          Returns the intended number of keys in this function, or -1 if no such number exists.
 Reference2DoubleSortedMap<K> subMap(K from, K to)
          Delegates to the corresponding type-specific method.
 Reference2DoubleSortedMap<K> tailMap(K from)
          Delegates to the corresponding type-specific method.
 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.AbstractReference2DoubleSortedMap
entrySet
 
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2DoubleMap
containsValue, equals, putAll, toString
 
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2DoubleFunction
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.Reference2DoubleFunction
defaultReturnValue, defaultReturnValue
 
Methods inherited from interface it.unimi.dsi.fastutil.Function
get
 
Methods inherited from interface java.util.Map
containsValue, equals, get, putAll
 

Field Detail

serialVersionUID

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

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(int n,
                                         float f)
Creates a new hash map. The actual table size is the least available prime greater than n/f.

Parameters:
n - the expected number of elements in the hash map.
f - the load factor.
See Also:
Hash.PRIMES

Reference2DoubleLinkedOpenHashMap

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

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

Reference2DoubleLinkedOpenHashMap

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


Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(Map<? extends K,? 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.

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(Map<? extends K,? 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.

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(Reference2DoubleMap<K> 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.

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(Reference2DoubleMap<K> 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.

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(K[] 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.

Reference2DoubleLinkedOpenHashMap

public Reference2DoubleLinkedOpenHashMap(K[] 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

growthFactor

public void growthFactor(int growthFactor)
Sets the growth factor. Subsequent enlargements will increase the table size roughly by a multiplicative factor of 2p/16.

Parameters:
growthFactor - the new growth factor; it must be positive.

growthFactor

public int growthFactor()
Gets the growth factor.

Returns:
the growth factor of this set.
See Also:
growthFactor(int)

put

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

Specified by:
put in interface Reference2DoubleFunction<K>
Overrides:
put in class AbstractReference2DoubleFunction<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 Double put(K ok,
                  Double ov)
Description copied from class: AbstractReference2DoubleFunction
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,Double>
Specified by:
put in interface Map<K,Double>
Overrides:
put in class AbstractReference2DoubleFunction<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)

containsValue

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

Specified by:
containsValue in interface Reference2DoubleMap<K>
Overrides:
containsValue in class AbstractReference2DoubleMap<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,Double>
Specified by:
clear in interface Map<K,Double>
Overrides:
clear in class AbstractReference2DoubleFunction<K>
See Also:
Map.clear()

firstKey

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

Specified by:
firstKey in interface SortedMap<K,Double>
Overrides:
firstKey in class AbstractReference2DoubleSortedMap<K>
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 SortedMap<K,Double>
Overrides:
lastKey in class AbstractReference2DoubleSortedMap<K>
Returns:
the last key in iteration order.

comparator

public Comparator<? super K> comparator()
Description copied from interface: Reference2DoubleSortedMap
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 Reference2DoubleSortedMap<K>
Specified by:
comparator in interface SortedMap<K,Double>
See Also:
SortedMap.comparator()

tailMap

public Reference2DoubleSortedMap<K> tailMap(K from)
Description copied from class: AbstractReference2DoubleSortedMap
Delegates to the corresponding type-specific method.

Specified by:
tailMap in interface Reference2DoubleSortedMap<K>
Specified by:
tailMap in interface SortedMap<K,Double>
Overrides:
tailMap in class AbstractReference2DoubleSortedMap<K>
See Also:
SortedMap.tailMap(Object)

headMap

public Reference2DoubleSortedMap<K> headMap(K to)
Description copied from class: AbstractReference2DoubleSortedMap
Delegates to the corresponding type-specific method.

Specified by:
headMap in interface Reference2DoubleSortedMap<K>
Specified by:
headMap in interface SortedMap<K,Double>
Overrides:
headMap in class AbstractReference2DoubleSortedMap<K>
See Also:
SortedMap.headMap(Object)

subMap

public Reference2DoubleSortedMap<K> subMap(K from,
                                           K to)
Description copied from class: AbstractReference2DoubleSortedMap
Delegates to the corresponding type-specific method.

Specified by:
subMap in interface Reference2DoubleSortedMap<K>
Specified by:
subMap in interface SortedMap<K,Double>
Overrides:
subMap in class AbstractReference2DoubleSortedMap<K>
See Also:
SortedMap.subMap(Object,Object)

containsKey

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

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

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,Double>
Specified by:
size in interface Map<K,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<K,Double>
Overrides:
isEmpty in class AbstractReference2DoubleMap<K>

getDouble

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

Specified by:
getDouble in interface Reference2DoubleFunction<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)

removeDouble

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

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

reference2DoubleEntrySet

public Reference2DoubleSortedMap.FastSortedEntrySet<K> reference2DoubleEntrySet()
Description copied from interface: Reference2DoubleSortedMap
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:
reference2DoubleEntrySet in interface Reference2DoubleMap<K>
Specified by:
reference2DoubleEntrySet in interface Reference2DoubleSortedMap<K>
Returns:
a type-specific sorted-set view of the mappings contained in this map.
See Also:
Reference2DoubleSortedMap.entrySet()

keySet

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

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

The view is backed by the sorted set returned by AbstractReference2DoubleSortedMap.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 Reference2DoubleMap<K>
Specified by:
values in interface Reference2DoubleSortedMap<K>
Specified by:
values in interface Map<K,Double>
Specified by:
values in interface SortedMap<K,Double>
Overrides:
values in class AbstractReference2DoubleSortedMap<K>
Returns:
a type-specific collection view of the values contained in this map.
See Also:
Map.values()

rehash

public boolean rehash()
Rehashes this map without changing the table size.

This method should be called when the map underwent numerous deletions and insertions. In this case, free entries become rare, and unsuccessful searches require probing all entries. For reasonable load factors this method is linear in the number of entries. You will need as much additional free memory as that occupied by the table.

If you need to reduce the table siza to fit exactly this map, you must use trim().

Returns:
true if there was enough memory to rehash the map, false otherwise.
See Also:
trim()

trim

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

This method rehashes to the smallest size satisfying the load factor. It can be used when the map will not be changed anymore, so to optimize access speed (by collecting deleted entries) and size.

If the table size is already the minimum possible, this method does nothing. If you want to guarantee rehashing, use rehash().

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

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(), rehash()

clone

public Object 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<K,Double>
Overrides:
hashCode in class AbstractReference2DoubleMap<K>
Returns:
a hash code for this map.