Class IntShortScatterMap

java.lang.Object
com.carrotsearch.hppc.IntShortHashMap
com.carrotsearch.hppc.IntShortScatterMap
All Implemented Interfaces:
IntShortAssociativeContainer, IntShortMap, Preallocable, Cloneable, Iterable<IntShortCursor>

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

    • IntShortScatterMap

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

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

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

    • hashKey

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

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

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