Documentation of 'com.carrotsearch.hppc.ObjectObjectIdentityHashMap' Java class
ObjectObjectIdentityHashMap
com.carrotsearch.hppc

Class ObjectObjectIdentityHashMap<KType,VType>

    • Constructor Detail

      • ObjectObjectIdentityHashMap

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

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

        public ObjectObjectIdentityHashMap(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 ObjectObjectHashMap.verifyLoadFactor(double).
      • ObjectObjectIdentityHashMap

        public ObjectObjectIdentityHashMap(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 ObjectObjectHashMap.verifyLoadFactor(double).
        orderMixer - Hash key order mixing strategy. See HashOrderMixing for predefined implementations. Use constant mixers only if you understand the potential consequences.
    • Method Detail

      • hashKey

        public 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.

      • equals

        public boolean equals(java.lang.Object v1,
                              java.lang.Object v2)
      • from

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

DataMelt 3.0 © DataMelt by jWork.ORG

Ads help maintain this website.