Class ShortIntScatterMap

java.lang.Object
com.carrotsearch.hppc.ShortIntHashMap
com.carrotsearch.hppc.ShortIntScatterMap
All Implemented Interfaces:
Preallocable, ShortIntAssociativeContainer, ShortIntMap, Cloneable, Iterable<ShortIntCursor>

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

    • ShortIntScatterMap

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

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

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

    • hashKey

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

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

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