Class IntDoubleScatterMap

java.lang.Object
com.carrotsearch.hppc.IntDoubleHashMap
com.carrotsearch.hppc.IntDoubleScatterMap
All Implemented Interfaces:
IntDoubleAssociativeContainer, IntDoubleMap, Preallocable, Cloneable, Iterable<IntDoubleCursor>

@Generated(date="2024-02-21T10:44:44+0000", value="KTypeVTypeScatterMap.java") public class IntDoubleScatterMap extends IntDoubleHashMap
Same as IntDoubleHashMap 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

    • IntDoubleScatterMap

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

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

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

    • hashKey

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

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

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