it.unimi.dsi.fastutil.longs
Class Long2DoubleLinkedOpenHashMap

java.lang.Object
  extended by it.unimi.dsi.fastutil.longs.AbstractLong2DoubleFunction
      extended by it.unimi.dsi.fastutil.longs.AbstractLong2DoubleMap
          extended by it.unimi.dsi.fastutil.longs.AbstractLong2DoubleSortedMap
              extended by it.unimi.dsi.fastutil.longs.Long2DoubleLinkedOpenHashMap
All Implemented Interfaces:
Function<Long,Double>, Hash, Long2DoubleFunction, Long2DoubleMap, Long2DoubleSortedMap, Serializable, Cloneable, Map<Long,Double>, SortedMap<Long,Double>

public class Long2DoubleLinkedOpenHashMap
extends AbstractLong2DoubleSortedMap
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 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 AbstractLong2DoubleSortedMap.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.longs.AbstractLong2DoubleMap
AbstractLong2DoubleMap.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.longs.Long2DoubleSortedMap
Long2DoubleSortedMap.FastSortedEntrySet
 
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2DoubleMap
Long2DoubleMap.Entry, Long2DoubleMap.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
Long2DoubleLinkedOpenHashMap()
          Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
Long2DoubleLinkedOpenHashMap(int expected)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
Long2DoubleLinkedOpenHashMap(int expected, float f)
          Creates a new hash map.
Long2DoubleLinkedOpenHashMap(long[] k, double[] v)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
Long2DoubleLinkedOpenHashMap(long[] k, double[] v, float f)
          Creates a new hash map using the elements of two parallel arrays.
Long2DoubleLinkedOpenHashMap(Long2DoubleMap m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
Long2DoubleLinkedOpenHashMap(Long2DoubleMap m, float f)
          Creates a new hash map copying a given type-specific one.
Long2DoubleLinkedOpenHashMap(Map<? extends Long,? extends Double> m)
          Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
Long2DoubleLinkedOpenHashMap(Map<? extends Long,? extends Double> m, float f)
          Creates a new hash map copying a given one.
 
Method Summary
 double add(long k, double incr)
          Adds an increment to value currently associated with a key.
 void clear()
          Removes all associations from this function (optional operation).
 Long2DoubleLinkedOpenHashMap clone()
          Returns a deep copy of this map.
 LongComparator comparator()
          Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
 boolean containsKey(long k)
          Checks whether the given value is contained in AbstractLong2DoubleMap.keySet().
 boolean containsValue(double v)
          Checks whether the given value is contained in AbstractLong2DoubleMap.values().
 long firstLongKey()
          Returns the first key of this map in iteration order.
 double get(long k)
          Returns the value to which the given key is mapped.
 Double get(Long ok)
           
 double getAndMoveToFirst(long 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(long 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.
 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.
 Long2DoubleSortedMap headMap(long to)
          Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
 boolean isEmpty()
           
 LongSortedSet keySet()
          Returns a type-specific-sorted-set view of the keys of this map.
 long lastLongKey()
          Returns the last key of this map in iteration order.
 Long2DoubleSortedMap.FastSortedEntrySet long2DoubleEntrySet()
          Returns a type-specific sorted-set view of the mappings contained in this map.
 double put(long k, double v)
          Adds a pair to the map.
 Double put(Long ok, Double ov)
          Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
 double putAndMoveToFirst(long 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(long 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.
 double remove(long 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.
 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.
 Long2DoubleSortedMap subMap(long from, long to)
          Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
 Long2DoubleSortedMap tailMap(long 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.longs.AbstractLong2DoubleSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMap
 
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2DoubleMap
containsValue, equals, putAll, toString
 
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2DoubleFunction
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.longs.Long2DoubleFunction
defaultReturnValue, defaultReturnValue
 
Methods inherited from interface it.unimi.dsi.fastutil.Function
containsKey, get
 
Methods inherited from interface java.util.Map
containsKey, containsValue, equals, get, putAll
 

Field Detail

serialVersionUID

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

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(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.

Long2DoubleLinkedOpenHashMap

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


Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(Map<? extends Long,? 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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(Map<? extends Long,? 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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(Long2DoubleMap 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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(Long2DoubleMap 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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(long[] 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.

Long2DoubleLinkedOpenHashMap

public Long2DoubleLinkedOpenHashMap(long[] 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(long k,
                  double v)
Description copied from interface: Long2DoubleFunction
Adds a pair to the map.

Specified by:
put in interface Long2DoubleFunction
Overrides:
put in class AbstractLong2DoubleFunction
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(Long ok,
                  Double ov)
Description copied from class: AbstractLong2DoubleFunction
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<Long,Double>
Specified by:
put in interface Map<Long,Double>
Overrides:
put in class AbstractLong2DoubleFunction
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(long 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(long k)
Description copied from interface: Long2DoubleFunction
Removes the mapping with the given key.

Specified by:
remove in interface Long2DoubleFunction
Overrides:
remove in class AbstractLong2DoubleFunction
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: AbstractLong2DoubleFunction
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<Long,Double>
Specified by:
remove in interface Map<Long,Double>
Overrides:
remove in class AbstractLong2DoubleFunction
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:
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:
NoSuchElementException - is this map is empty.

getAndMoveToFirst

public double getAndMoveToFirst(long 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(long 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(long 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(long 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.

get

public Double get(Long ok)

get

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

Specified by:
get in interface Long2DoubleFunction
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(long k)
Description copied from class: AbstractLong2DoubleMap
Checks whether the given value is contained in AbstractLong2DoubleMap.keySet().

Specified by:
containsKey in interface Long2DoubleFunction
Overrides:
containsKey in class AbstractLong2DoubleMap
See Also:
Function.containsKey(Object)

containsValue

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

Specified by:
containsValue in interface Long2DoubleMap
Overrides:
containsValue in class AbstractLong2DoubleMap
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<Long,Double>
Specified by:
clear in interface Map<Long,Double>
Overrides:
clear in class AbstractLong2DoubleFunction
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<Long,Double>
Specified by:
size in interface Map<Long,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<Long,Double>
Overrides:
isEmpty in class AbstractLong2DoubleMap

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)

firstLongKey

public long firstLongKey()
Returns the first key of this map in iteration order.

Specified by:
firstLongKey in interface Long2DoubleSortedMap
Returns:
the first key in iteration order.
See Also:
SortedMap.firstKey()

lastLongKey

public long lastLongKey()
Returns the last key of this map in iteration order.

Specified by:
lastLongKey in interface Long2DoubleSortedMap
Returns:
the last key in iteration order.
See Also:
SortedMap.lastKey()

comparator

public LongComparator comparator()
Description copied from interface: Long2DoubleSortedMap
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 Long2DoubleSortedMap
Specified by:
comparator in interface SortedMap<Long,Double>
See Also:
SortedMap.comparator()

tailMap

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

Specified by:
tailMap in interface Long2DoubleSortedMap
See Also:
SortedMap.tailMap(Object)

headMap

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

Specified by:
headMap in interface Long2DoubleSortedMap
See Also:
SortedMap.headMap(Object)

subMap

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

Specified by:
subMap in interface Long2DoubleSortedMap
See Also:
SortedMap.subMap(Object,Object)

long2DoubleEntrySet

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

keySet

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

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

The view is backed by the sorted set returned by AbstractLong2DoubleSortedMap.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 Long2DoubleMap
Specified by:
values in interface Long2DoubleSortedMap
Specified by:
values in interface Map<Long,Double>
Specified by:
values in interface SortedMap<Long,Double>
Overrides:
values in class AbstractLong2DoubleSortedMap
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 Long2DoubleLinkedOpenHashMap 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<Long,Double>
Overrides:
hashCode in class AbstractLong2DoubleMap
Returns:
a hash code for this map.