Class IntObjectScatterMap<VType>

java.lang.Object
com.carrotsearch.hppc.IntObjectHashMap<VType>
com.carrotsearch.hppc.IntObjectScatterMap<VType>
All Implemented Interfaces:
IntObjectAssociativeContainer<VType>, IntObjectMap<VType>, Preallocable, Cloneable, Iterable<IntObjectCursor<VType>>

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

    • IntObjectScatterMap

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

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

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

    • hashKey

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

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

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