Class Long2ReferenceOpenHashMap<V>

All Implemented Interfaces:
it.unimi.dsi.fastutil.Function<Long,V>, it.unimi.dsi.fastutil.Hash, it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>, Long2ReferenceMap<V>, Serializable, Cloneable, Function<Long,V>, LongFunction<V>, Map<Long,V>

public class Long2ReferenceOpenHashMap<V> extends AbstractLong2ReferenceMap<V> implements Serializable, Cloneable, it.unimi.dsi.fastutil.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 filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size; however, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create maps with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.

Note that clear() does not modify the hash table size. Rather, a family of trimming methods lets you control the size of the table; this is particularly useful if you reuse instances of this class.

Entries returned by the type-specific Long2ReferenceMap.entrySet() method implement the suitable type-specific Pair interface; only values are mutable.

See Also:
  • Nested Class Summary

    Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap

    AbstractLong2ReferenceMap.BasicEntry<V>, AbstractLong2ReferenceMap.BasicEntrySet<V>

    Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash

    it.unimi.dsi.fastutil.Hash.Strategy<K>

    Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceMap

    Long2ReferenceMap.Entry<V>, Long2ReferenceMap.FastEntrySet<V>
  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    protected boolean
    Whether this map contains the key zero.
    Cached set of entries.
    protected final float
    The acceptable load factor.
    protected long[]
    The array of keys.
    protected it.unimi.dsi.fastutil.longs.LongSet
    Cached set of keys.
    protected int
    The mask for wrapping a position counter.
    protected int
    Threshold after which we rehash.
    protected final int
    We never resize below this threshold, which is the construction-time {#n}.
    protected int
    The current table size.
    protected int
    Number of entries in the set (including the key zero, if present).
    protected V[]
    The array of values.
    protected it.unimi.dsi.fastutil.objects.ReferenceCollection<V>
    Cached collection of values.

    Fields inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceFunction

    defRetValue

    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

    Constructors
    Constructor
    Description
    Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
    Long2ReferenceOpenHashMap(int expected, float f)
    Creates a new hash map.
    Long2ReferenceOpenHashMap(long[] k, V[] v)
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
    Long2ReferenceOpenHashMap(long[] k, V[] v, float f)
    Creates a new hash map using the elements of two parallel arrays.
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
    Creates a new hash map copying a given type-specific one.
    Long2ReferenceOpenHashMap(Map<? extends Long,? extends V> m)
    Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
    Long2ReferenceOpenHashMap(Map<? extends Long,? extends V> m, float f)
    Creates a new hash map copying a given one.
  • Method Summary

    Modifier and Type
    Method
    Description
    void
    Removes all of the mappings from this map (optional operation).
    Returns a deep copy of this map.
    compute(long k, BiFunction<? super Long,? super V,? extends V> remappingFunction)
    Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).
    computeIfAbsent(long key, it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<? extends V> mappingFunction)
    If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map, unless the key is not present in the given mapping function.
    computeIfAbsent(long k, LongFunction<? extends V> mappingFunction)
    If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.
    computeIfPresent(long k, BiFunction<? super Long,? super V,? extends V> remappingFunction)
    If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.
    boolean
    containsKey(long k)
    Returns true if this function contains a mapping for the specified key.
    boolean
    void
    ensureCapacity(int capacity)
    Ensures that this map can hold a certain number of keys without rehashing.
    void
    forEach(it.unimi.dsi.fastutil.longs.LongObjectBiConsumer<? super V> consumer)
    Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.
    get(long k)
     
    getOrDefault(long k, V defaultValue)
    Returns the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.
    int
    Returns a hash code for this map.
    boolean
     
    it.unimi.dsi.fastutil.longs.LongSet
    Returns a type-specific-set view of the keys of this map.
    Returns a type-specific set view of the mappings contained in this map.
    merge(long k, V v, BiFunction<? super V,? super V,? extends V> remappingFunction)
    If the specified key is not already associated with a value, associates it with the given value.
    put(long k, V v)
     
    void
    putAll(Map<? extends Long,? extends V> m)
    putIfAbsent(long k, V v)
    If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.
    protected void
    rehash(int newN)
    Rehashes the map.
    remove(long k)
     
    boolean
    remove(long k, Object v)
    Removes the entry for the specified key only if it is currently mapped to the specified value.
    replace(long k, V v)
    Replaces the entry for the specified key only if it is currently mapped to some value.
    boolean
    replace(long k, V oldValue, V v)
    Replaces the entry for the specified key only if currently mapped to the specified value.
    protected final void
    shiftKeys(int pos)
    Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
    int
    Returns the number of key/value mappings in this map.
    boolean
    Rehashes the map, making the table as small as possible.
    boolean
    trim(int n)
    Rehashes this map if the table is too large.
    it.unimi.dsi.fastutil.objects.ReferenceCollection<V>
    Returns a type-specific-set view of the values of this map.

    Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceMap

    equals, toString

    Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLong2ReferenceFunction

    defaultReturnValue, defaultReturnValue

    Methods inherited from class java.lang.Object

    finalize, getClass, notify, notifyAll, wait, wait, wait

    Methods inherited from interface it.unimi.dsi.fastutil.Function

    apply

    Methods inherited from interface java.util.function.Function

    andThen

    Methods inherited from interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction

    andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort

    Methods inherited from interface java.util.Map

    compute, computeIfAbsent, computeIfPresent, merge, putIfAbsent, remove, replace, replace, replaceAll
  • Field Details

    • key

      protected transient long[] key
      The array of keys.
    • value

      protected transient V[] value
      The array of values.
    • mask

      protected transient int mask
      The mask for wrapping a position counter.
    • containsNullKey

      protected transient boolean containsNullKey
      Whether this map contains the key zero.
    • n

      protected transient int n
      The current table size.
    • maxFill

      protected transient int maxFill
      Threshold after which we rehash. It must be the table size times f.
    • minN

      protected final transient int minN
      We never resize below this threshold, which is the construction-time {#n}.
    • size

      protected int size
      Number of entries in the set (including the key zero, if present).
    • f

      protected final float f
      The acceptable load factor.
    • entries

      protected transient Long2ReferenceMap.FastEntrySet<V> entries
      Cached set of entries.
    • keys

      protected transient it.unimi.dsi.fastutil.longs.LongSet keys
      Cached set of keys.
    • values

      protected transient it.unimi.dsi.fastutil.objects.ReferenceCollection<V> values
      Cached collection of values.
  • Constructor Details

    • Long2ReferenceOpenHashMap

      public Long2ReferenceOpenHashMap(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 map.
      f - the load factor.
    • Long2ReferenceOpenHashMap

      public Long2ReferenceOpenHashMap(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.
    • Long2ReferenceOpenHashMap

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

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

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

      public Long2ReferenceOpenHashMap(Long2ReferenceMap<V> 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.
    • Long2ReferenceOpenHashMap

      public Long2ReferenceOpenHashMap(Long2ReferenceMap<V> 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.
    • Long2ReferenceOpenHashMap

      public Long2ReferenceOpenHashMap(long[] k, V[] 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.
    • Long2ReferenceOpenHashMap

      public Long2ReferenceOpenHashMap(long[] k, V[] 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 Details

    • ensureCapacity

      public void ensureCapacity(int capacity)
      Ensures that this map can hold a certain number of keys without rehashing.
      Parameters:
      capacity - a number of keys; there will be no rehashing unless the map size exceeds this number.
    • putAll

      public void putAll(Map<? extends Long,? extends V> m)
      Description copied from class: AbstractLong2ReferenceMap
      Specified by:
      putAll in interface Map<Long,V>
      Overrides:
      putAll in class AbstractLong2ReferenceMap<V>
    • put

      public V put(long k, V v)
      Specified by:
      put in interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>
    • shiftKeys

      protected final void shiftKeys(int pos)
      Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
      Parameters:
      pos - a starting position.
    • remove

      public V remove(long k)
      Specified by:
      remove in interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>
    • get

      public V get(long k)
      Specified by:
      get in interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>
    • containsKey

      public boolean containsKey(long k)
      Description copied from class: AbstractLong2ReferenceMap
      Returns true if this function contains a mapping for the specified key.
      Specified by:
      containsKey in interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>
      Specified by:
      containsKey in interface Long2ReferenceMap<V>
      Overrides:
      containsKey in class AbstractLong2ReferenceMap<V>
      Parameters:
      k - the key.
      Returns:
      true if this function associates a value to key.
      See Also:
    • containsValue

      public boolean containsValue(Object v)
      Description copied from class: AbstractLong2ReferenceMap
      Specified by:
      containsValue in interface Map<Long,V>
      Overrides:
      containsValue in class AbstractLong2ReferenceMap<V>
    • getOrDefault

      public V getOrDefault(long k, V defaultValue)
      Returns the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.
      Specified by:
      getOrDefault in interface it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<V>
      Specified by:
      getOrDefault in interface Long2ReferenceMap<V>
      Parameters:
      k - the key.
      defaultValue - the default mapping of the key.
      Returns:
      the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.
      See Also:
    • putIfAbsent

      public V putIfAbsent(long k, V v)
      If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.
      Specified by:
      putIfAbsent in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is to be associated.
      v - value to be associated with the specified key.
      Returns:
      the previous value associated with the specified key, or the default return value if there was no mapping for the key.
      See Also:
    • remove

      public boolean remove(long k, Object v)
      Removes the entry for the specified key only if it is currently mapped to the specified value.
      Specified by:
      remove in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is associated.
      v - value expected to be associated with the specified key.
      Returns:
      true if the value was removed.
      See Also:
    • replace

      public boolean replace(long k, V oldValue, V v)
      Replaces the entry for the specified key only if currently mapped to the specified value.
      Specified by:
      replace in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is associated.
      oldValue - value expected to be associated with the specified key.
      v - value to be associated with the specified key.
      Returns:
      true if the value was replaced.
      See Also:
    • replace

      public V replace(long k, V v)
      Replaces the entry for the specified key only if it is currently mapped to some value.
      Specified by:
      replace in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is associated.
      v - value to be associated with the specified key.
      Returns:
      the previous value associated with the specified key, or the default return value if there was no mapping for the key.
      See Also:
    • computeIfAbsent

      public V computeIfAbsent(long k, LongFunction<? extends V> mappingFunction)
      If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.

      Note that contrarily to the default computeIfAbsent(), it is not possible to not add a value for a given key, since the mappingFunction cannot return null. If such a behavior is needed, please use the corresponding nullable version.

      Specified by:
      computeIfAbsent in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is to be associated.
      mappingFunction - the function to compute a value.
      Returns:
      the current (existing or computed) value associated with the specified key.
      See Also:
    • computeIfAbsent

      public V computeIfAbsent(long key, it.unimi.dsi.fastutil.longs.Long2ReferenceFunction<? extends V> mappingFunction)
      If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map, unless the key is not present in the given mapping function.

      This version of computeIfAbsent() uses a type-specific version of fastutil's Function. Since Function has a containsKey() method, it is possible to avoid adding a key by having containsKey() return false for that key.

      Specified by:
      computeIfAbsent in interface Long2ReferenceMap<V>
      Parameters:
      key - key with which the specified value is to be associated.
      mappingFunction - the function to compute a value.
      Returns:
      the current (existing or computed) value associated with the specified key.
      See Also:
    • computeIfPresent

      public V computeIfPresent(long k, BiFunction<? super Long,? super V,? extends V> remappingFunction)
      If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.
      Specified by:
      computeIfPresent in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is to be associated.
      remappingFunction - the function to compute a value.
      Returns:
      the new value associated with the specified key, or the default return value if none.
      See Also:
    • compute

      public V compute(long k, BiFunction<? super Long,? super V,? extends V> remappingFunction)
      Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).

      If the function returns null, the mapping is removed (or remains absent if initially absent). If the function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.

      Specified by:
      compute in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the specified value is to be associated.
      remappingFunction - the function to compute a value.
      Returns:
      the new value associated with the specified key, or the default return value if none.
      See Also:
    • merge

      public V merge(long k, V v, BiFunction<? super V,? super V,? extends V> remappingFunction)
      If the specified key is not already associated with a value, associates it with the given value. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result is null.
      Specified by:
      merge in interface Long2ReferenceMap<V>
      Parameters:
      k - key with which the resulting value is to be associated.
      v - the value to be merged with the existing value associated with the key or, if no existing value is associated with the key, to be associated with the key.
      remappingFunction - the function to recompute a value if present.
      Returns:
      the new value associated with the specified key, or the default return value if no value is associated with the key.
      See Also:
    • clear

      public void clear()
      Description copied from interface: Long2ReferenceMap
      Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
      Specified by:
      clear in interface it.unimi.dsi.fastutil.Function<Long,V>
      Specified by:
      clear in interface Long2ReferenceMap<V>
      Specified by:
      clear in interface Map<Long,V>
    • size

      public int size()
      Description copied from interface: Long2ReferenceMap
      Returns the number of key/value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.
      Specified by:
      size in interface it.unimi.dsi.fastutil.Function<Long,V>
      Specified by:
      size in interface Long2ReferenceMap<V>
      Specified by:
      size in interface Map<Long,V>
      Returns:
      the number of key-value mappings in this map.
      See Also:
      • Size64
    • isEmpty

      public boolean isEmpty()
      Specified by:
      isEmpty in interface Map<Long,V>
      Overrides:
      isEmpty in class AbstractLong2ReferenceMap<V>
    • forEach

      public void forEach(it.unimi.dsi.fastutil.longs.LongObjectBiConsumer<? super V> consumer)
      Performs the given action for each entry in this map until all entries have been processed or the action throws an exception.

      This default implementation just delegates to forEach on the type-specific entry set, taking care of using fastForEach if available.

      Specified by:
      forEach in interface Long2ReferenceMap<V>
      See Also:
    • long2ReferenceEntrySet

      public Long2ReferenceMap.FastEntrySet<V> long2ReferenceEntrySet()
      Description copied from interface: Long2ReferenceMap
      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 Map.entrySet() so that it returns an ObjectSet of type-specific entries (the latter makes it possible to access keys and values with type-specific methods).

      Specified by:
      long2ReferenceEntrySet in interface Long2ReferenceMap<V>
      Returns:
      a type-specific set view of the mappings contained in this map.
      See Also:
    • keySet

      public it.unimi.dsi.fastutil.longs.LongSet keySet()
      Description copied from class: AbstractLong2ReferenceMap
      Returns a type-specific-set view of the keys of this map.

      The view is backed by the set returned by Map.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 Long2ReferenceMap<V>
      Specified by:
      keySet in interface Map<Long,V>
      Overrides:
      keySet in class AbstractLong2ReferenceMap<V>
      Returns:
      a set view of the keys of this map; it may be safely cast to a type-specific interface.
      See Also:
    • values

      public it.unimi.dsi.fastutil.objects.ReferenceCollection<V> values()
      Description copied from class: AbstractLong2ReferenceMap
      Returns a type-specific-set view of the values of this map.

      The view is backed by the set returned by Map.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 Long2ReferenceMap<V>
      Specified by:
      values in interface Map<Long,V>
      Overrides:
      values in class AbstractLong2ReferenceMap<V>
      Returns:
      a set view of the values of this map; it may be safely cast to a type-specific interface.
      See Also:
    • 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

      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:
    • rehash

      protected void rehash(int newN)
      Rehashes the map.

      This method implements the basic rehashing strategy, and may be overridden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.

      Parameters:
      newN - the new size
    • clone

      public Long2ReferenceOpenHashMap<V> 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,V>
      Overrides:
      hashCode in class AbstractLong2ReferenceMap<V>
      Returns:
      a hash code for this map.