Class DoubleShortScatterMap

java.lang.Object
com.carrotsearch.hppc.DoubleShortHashMap
com.carrotsearch.hppc.DoubleShortScatterMap
All Implemented Interfaces:
DoubleShortAssociativeContainer, DoubleShortMap, Preallocable, Cloneable, Iterable<DoubleShortCursor>

@Generated(date="2024-02-21T10:44:44+0000", value="KTypeVTypeScatterMap.java") public class DoubleShortScatterMap extends DoubleShortHashMap
Same as DoubleShortHashMap 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

    • DoubleShortScatterMap

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

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

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

    • hashKey

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

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

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