Class ObjectShortIdentityHashMap<KType>

    • Constructor Detail

      • ObjectShortIdentityHashMap

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

        public ObjectShortIdentityHashMap​(int expectedElements)
        New instance with sane defaults.
        Parameters:
        expectedElements - The expected number of elements guaranteed not to cause buffer expansion (inclusive).
      • ObjectShortIdentityHashMap

        public ObjectShortIdentityHashMap​(int expectedElements,
                                          double loadFactor)
        New instance with sane defaults.
        Parameters:
        expectedElements - The expected number of elements guaranteed not to cause buffer expansion (inclusive).
        loadFactor - The load factor for internal buffers. Insane load factors (zero, full capacity) are rejected by ObjectShortHashMap.verifyLoadFactor(double).
      • ObjectShortIdentityHashMap

        public ObjectShortIdentityHashMap​(int expectedElements,
                                          double loadFactor,
                                          HashOrderMixingStrategy orderMixer)
        New instance with the provided defaults.
        Parameters:
        expectedElements - The expected number of elements guaranteed not to cause a rehash (inclusive).
        loadFactor - The load factor for internal buffers. Insane load factors (zero, full capacity) are rejected by ObjectShortHashMap.verifyLoadFactor(double).
        orderMixer - Hash key order mixing strategy. See HashOrderMixing for predefined implementations. Use constant mixers only if you understand the potential consequences.
      • ObjectShortIdentityHashMap

        public ObjectShortIdentityHashMap​(ObjectShortAssociativeContainer<? extends KType> container)
        Create a hash map from all key-value pairs of another container.
    • Method Detail

      • hashKey

        public int hashKey​(KType key)
        Description copied from class: ObjectShortHashMap
        Returns a hash code for the given key.

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

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