Class CharDoubleScatterMap

java.lang.Object
com.carrotsearch.hppc.CharDoubleHashMap
com.carrotsearch.hppc.CharDoubleScatterMap
All Implemented Interfaces:
CharDoubleAssociativeContainer, CharDoubleMap, Preallocable, Cloneable, Iterable<CharDoubleCursor>

@Generated(date="2023-09-14T00:00:00+0000", value="KTypeVTypeScatterMap.java") public class CharDoubleScatterMap extends CharDoubleHashMap
Same as CharDoubleHashMap 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

    • CharDoubleScatterMap

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

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

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

    • hashKey

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

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

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