Class ByteShortScatterMap

java.lang.Object
com.carrotsearch.hppc.ByteShortHashMap
com.carrotsearch.hppc.ByteShortScatterMap
All Implemented Interfaces:
ByteShortAssociativeContainer, ByteShortMap, Preallocable, Cloneable, Iterable<ByteShortCursor>

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

    • ByteShortScatterMap

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

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

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

    • hashKey

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

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

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