Class DoubleLongScatterMap

java.lang.Object
com.carrotsearch.hppc.DoubleLongHashMap
com.carrotsearch.hppc.DoubleLongScatterMap
All Implemented Interfaces:
DoubleLongAssociativeContainer, DoubleLongMap, Preallocable, Cloneable, Iterable<DoubleLongCursor>

@Generated(date="2024-05-16T08:18:11+0000", value="KTypeVTypeScatterMap.java") public class DoubleLongScatterMap extends DoubleLongHashMap
Same as DoubleLongHashMap 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

    • DoubleLongScatterMap

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

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

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

    • hashKey

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

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

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