Class IntFloatScatterMap

java.lang.Object
com.carrotsearch.hppc.IntFloatHashMap
com.carrotsearch.hppc.IntFloatScatterMap
All Implemented Interfaces:
IntFloatAssociativeContainer, IntFloatMap, Preallocable, Cloneable, Iterable<IntFloatCursor>

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

    • IntFloatScatterMap

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

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

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

    • hashKey

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

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

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