Class LongShortScatterMap

java.lang.Object
com.carrotsearch.hppc.LongShortHashMap
com.carrotsearch.hppc.LongShortScatterMap
All Implemented Interfaces:
LongShortAssociativeContainer, LongShortMap, Preallocable, Cloneable, Iterable<LongShortCursor>

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

    • LongShortScatterMap

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

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

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

    • hashKey

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

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

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