Class ByteDoubleScatterMap

java.lang.Object
com.carrotsearch.hppc.ByteDoubleHashMap
com.carrotsearch.hppc.ByteDoubleScatterMap
All Implemented Interfaces:
ByteDoubleAssociativeContainer, ByteDoubleMap, Preallocable, Cloneable, Iterable<ByteDoubleCursor>

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

    • ByteDoubleScatterMap

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

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

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

    • hashKey

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

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

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