Class ObjectByteScatterMap<KType>

java.lang.Object
com.carrotsearch.hppc.ObjectByteHashMap<KType>
com.carrotsearch.hppc.ObjectByteScatterMap<KType>
All Implemented Interfaces:
ObjectByteAssociativeContainer<KType>, ObjectByteMap<KType>, Preallocable, Cloneable, Iterable<ObjectByteCursor<KType>>

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

    • ObjectByteScatterMap

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

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

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

    • hashKey

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

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

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