Class DoubleDoubleScatterMap

java.lang.Object
com.carrotsearch.hppc.DoubleDoubleHashMap
com.carrotsearch.hppc.DoubleDoubleScatterMap
All Implemented Interfaces:
DoubleDoubleAssociativeContainer, DoubleDoubleMap, Preallocable, Cloneable, Iterable<DoubleDoubleCursor>

@Generated(date="2023-10-26T04:33:09+0000", value="KTypeVTypeScatterMap.java") public class DoubleDoubleScatterMap extends DoubleDoubleHashMap
Same as DoubleDoubleHashMap but does not implement per-instance key mixing strategy and uses a simpler (faster) bit distribution function.

Note: read about important differences between hash and scatter sets.

  • Constructor Details

    • DoubleDoubleScatterMap

      public DoubleDoubleScatterMap()
      New instance with sane defaults.
    • DoubleDoubleScatterMap

      public DoubleDoubleScatterMap(int expectedElements)
      New instance with sane defaults.
    • DoubleDoubleScatterMap

      public DoubleDoubleScatterMap(int expectedElements, double loadFactor)
      New instance with sane defaults.
  • Method Details

    • hashKey

      protected int hashKey(double key)
      Description copied from class: DoubleDoubleHashMap
      Returns a hash code for the given key.

      The default implementation mixes the hash of the key with DoubleDoubleHashMap.keyMixer to differentiate hash order of keys between hash containers. Helps alleviate problems resulting from linear conflict resolution in open addressing.

      The output from this function should evenly distribute keys across the entire integer range.

      Overrides:
      hashKey in class DoubleDoubleHashMap
    • from

      public static DoubleDoubleScatterMap from(double[] keys, double[] values)
      Creates a hash map from two index-aligned arrays of key-value pairs.