Class IntIntScatterMap

java.lang.Object
com.carrotsearch.hppc.IntIntHashMap
com.carrotsearch.hppc.IntIntScatterMap
All Implemented Interfaces:
IntIntAssociativeContainer, IntIntMap, Preallocable, Cloneable, Iterable<IntIntCursor>

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

    • IntIntScatterMap

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

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

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

    • hashKey

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

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

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