Class IntByteScatterMap

java.lang.Object
com.carrotsearch.hppc.IntByteHashMap
com.carrotsearch.hppc.IntByteScatterMap
All Implemented Interfaces:
IntByteAssociativeContainer, IntByteMap, Preallocable, Cloneable, Iterable<IntByteCursor>

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

    • IntByteScatterMap

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

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

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

    • hashKey

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

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

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