Class DoubleByteScatterMap

java.lang.Object
com.carrotsearch.hppc.DoubleByteHashMap
com.carrotsearch.hppc.DoubleByteScatterMap
All Implemented Interfaces:
DoubleByteAssociativeContainer, DoubleByteMap, Preallocable, Cloneable, Iterable<DoubleByteCursor>

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

    • DoubleByteScatterMap

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

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

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

    • hashKey

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

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

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