Class LongDoubleScatterMap

java.lang.Object
com.carrotsearch.hppc.LongDoubleHashMap
com.carrotsearch.hppc.LongDoubleScatterMap
All Implemented Interfaces:
LongDoubleAssociativeContainer, LongDoubleMap, Preallocable, Cloneable, Iterable<LongDoubleCursor>

@Generated(date="2023-10-26T04:33:10+0000", value="KTypeVTypeScatterMap.java") public class LongDoubleScatterMap extends LongDoubleHashMap
Same as LongDoubleHashMap 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

    • LongDoubleScatterMap

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

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

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

    • hashKey

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

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

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