Class ObjectObjectScatterMap<KType,VType>

java.lang.Object
com.carrotsearch.hppc.ObjectObjectHashMap<KType,VType>
com.carrotsearch.hppc.ObjectObjectScatterMap<KType,VType>
All Implemented Interfaces:
ObjectObjectAssociativeContainer<KType,VType>, ObjectObjectMap<KType,VType>, Preallocable, Cloneable, Iterable<ObjectObjectCursor<KType,VType>>

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

    • ObjectObjectScatterMap

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

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

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

    • hashKey

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

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

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