Class DoubleIntScatterMap

java.lang.Object
com.carrotsearch.hppc.DoubleIntHashMap
com.carrotsearch.hppc.DoubleIntScatterMap
All Implemented Interfaces:
DoubleIntAssociativeContainer, DoubleIntMap, Preallocable, Cloneable, Iterable<DoubleIntCursor>

@Generated(date="2023-09-14T00:00:00+0000", value="KTypeVTypeScatterMap.java") public class DoubleIntScatterMap extends DoubleIntHashMap
Same as DoubleIntHashMap 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

    • DoubleIntScatterMap

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

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

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

    • hashKey

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

      The default implementation mixes the hash of the key with DoubleIntHashMap.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 DoubleIntHashMap
    • from

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