Class ShortShortScatterMap

java.lang.Object
com.carrotsearch.hppc.ShortShortHashMap
com.carrotsearch.hppc.ShortShortScatterMap
All Implemented Interfaces:
Preallocable, ShortShortAssociativeContainer, ShortShortMap, Cloneable, Iterable<ShortShortCursor>

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

    • ShortShortScatterMap

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

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

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

    • hashKey

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

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

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