Class ByteObjectScatterMap<VType>

java.lang.Object
com.carrotsearch.hppc.ByteObjectHashMap<VType>
com.carrotsearch.hppc.ByteObjectScatterMap<VType>
All Implemented Interfaces:
ByteObjectAssociativeContainer<VType>, ByteObjectMap<VType>, Preallocable, Cloneable, Iterable<ByteObjectCursor<VType>>

@Generated(date="2023-10-26T04:33:09+0000", value="KTypeVTypeScatterMap.java") public class ByteObjectScatterMap<VType> extends ByteObjectHashMap<VType>
Same as ByteObjectHashMap 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

    • ByteObjectScatterMap

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

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

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

    • hashKey

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

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

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