Package org.codelibs.jhighlight.fastutil.chars

Class Char2ObjectOpenHashMap<V>

    • Field Detail

      • key

        protected transient char[] key
        The array of keys.

      • value

        protected transient V[] value
        The array of values.

      • used

        protected transient boolean[] used
        The array telling whether a position is used.

      • f

        protected final float f
        The acceptable load factor.

      • n

        protected transient int n
        The current table size.

      • maxFill

        protected transient int maxFill
        Threshold after which we rehash. It must be the table size times f.

      • mask

        protected transient int mask
        The mask for wrapping a position counter.

      • size

        protected int size
        Number of entries in the set.

      • keys

        protected transient volatile CharSet keys
        Cached set of keys.

      • values

        protected transient volatile ObjectCollection<V> values
        Cached collection of values.

    • Constructor Detail

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(int expected,
                              float f)
        Creates a new hash map.

        The actual table size will be the least power of two greater than expected/f.

        Parameters:
        expected - the expected number of elements in the hash set.
        f - the load factor.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(int expected)
        Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
        Parameters:
        expected - the expected number of elements in the hash map.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(Map<? extends Character,​? extends V> m,
                              float f)
        Creates a new hash map copying a given one.
        Parameters:
        m - a Map to be copied into the new hash map.
        f - the load factor.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(Map<? extends Character,​? extends V> m)
        Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
        Parameters:
        m - a Map to be copied into the new hash map.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(Char2ObjectMap<V> m,
                              float f)
        Creates a new hash map copying a given type-specific one.
        Parameters:
        m - a type-specific map to be copied into the new hash map.
        f - the load factor.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(Char2ObjectMap<V> m)
        Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
        Parameters:
        m - a type-specific map to be copied into the new hash map.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(char[] k,
                              V[] v,
                              float f)
        Creates a new hash map using the elements of two parallel arrays.
        Parameters:
        k - the array of keys of the new hash map.
        v - the array of corresponding values in the new hash map.
        f - the load factor.
        Throws:
        IllegalArgumentException - if k and v have different lengths.

      • Char2ObjectOpenHashMap

        public Char2ObjectOpenHashMap​(char[] k,
                              V[] v)
        Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
        Parameters:
        k - the array of keys of the new hash map.
        v - the array of corresponding values in the new hash map.
        Throws:
        IllegalArgumentException - if k and v have different lengths.

    • Method Detail

      • put

        public V put​(Character ok,
             V ov)
        Description copied from class: AbstractChar2ObjectFunction
        Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

        This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

        Specified by:
        put in interface Function<Character,​V>
        Specified by:
        put in interface Map<Character,​V>
        Overrides:
        put in class AbstractChar2ObjectFunction<V>
        Parameters:
        ok - the key.
        ov - the value.
        Returns:
        the old value, or null if no value was present for the given key.
        See Also:
        Map.put(Object,Object)

      • shiftKeys

        protected final int shiftKeys​(int pos)
        Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.
        Parameters:
        pos - a starting position.
        Returns:
        the position cleared by the shifting process.

      • remove

        public V remove​(Object ok)
        Description copied from class: AbstractChar2ObjectFunction
        Delegates to the corresponding type-specific method, taking care of returning null on a missing key.

        This method must check whether the provided key is in the map using containsKey(). Thus, it probes the map twice. Implementors of subclasses should override it with a more efficient method.

        Specified by:
        remove in interface Function<Character,​V>
        Specified by:
        remove in interface Map<Character,​V>
        Overrides:
        remove in class AbstractChar2ObjectFunction<V>
        Returns:
        the old value, or null if no value was present for the given key.
        See Also:
        Map.remove(Object)

      • size

        public int size()
        Description copied from interface: Function
        Returns the intended number of keys in this function, or -1 if no such number exists.

        Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.

        Specified by:
        size in interface Function<Character,​V>
        Specified by:
        size in interface Map<Character,​V>
        Returns:
        the intended number of keys in this function, or -1 if that number is not available.

      • growthFactor

        @Deprecated
public void growthFactor​(int growthFactor)
        Deprecated.
        Since fastutil 6.1.0, hash tables are doubled when they are too full.
        A no-op for backward compatibility.
        Parameters:
        growthFactor - unused.

      • growthFactor

        @Deprecated
public int growthFactor()
        Deprecated.
        Since fastutil 6.1.0, hash tables are doubled when they are too full.
        Gets the growth factor (2).
        Returns:
        the growth factor of this set, which is fixed (2).
        See Also:
        growthFactor(int)

      • keySet

        public CharSet keySet()
        Description copied from class: AbstractChar2ObjectMap
        Returns a type-specific-set view of the keys of this map.

        The view is backed by the set returned by AbstractChar2ObjectMap.entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.

        Specified by:
        keySet in interface Char2ObjectMap<V>
        Specified by:
        keySet in interface Map<Character,​V>
        Overrides:
        keySet in class AbstractChar2ObjectMap<V>
        Returns:
        a set view of the keys of this map; it may be safely cast to a type-specific interface.
        See Also:
        Map.keySet()

      • values

        public ObjectCollection<V> values()
        Description copied from class: AbstractChar2ObjectMap
        Returns a type-specific-set view of the values of this map.

        The view is backed by the set returned by AbstractChar2ObjectMap.entrySet(). Note that no attempt is made at caching the result of this method, as this would require adding some attributes that lightweight implementations would not need. Subclasses may easily override this policy by calling this method and caching the result, but implementors are encouraged to write more efficient ad-hoc implementations.

        Specified by:
        values in interface Char2ObjectMap<V>
        Specified by:
        values in interface Map<Character,​V>
        Overrides:
        values in class AbstractChar2ObjectMap<V>
        Returns:
        a set view of the values of this map; it may be safely cast to a type-specific interface.
        See Also:
        Map.values()

      • rehash

        @Deprecated
public boolean rehash()
        Deprecated.
        A no-op.
        A no-op for backward compatibility. The kind of tables implemented by this class never need rehashing.

        If you need to reduce the table size to fit exactly this set, use trim().

        Returns:
        true.
        See Also:
        trim()

      • trim

        public boolean trim()
        Rehashes the map, making the table as small as possible.

        This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.

        If the table size is already the minimum possible, this method does nothing.

        Returns:
        true if there was enough memory to trim the map.
        See Also:
        trim(int)

      • trim

        public boolean trim​(int n)
        Rehashes this map if the table is too large.

        Let N be the smallest table size that can hold max(n,size()) entries, still satisfying the load factor. If the current table size is smaller than or equal to N, this method does nothing. Otherwise, it rehashes this map in a table of size N.

        This method is useful when reusing maps. Clearing a map leaves the table size untouched. If you are reusing a map many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient maps.

        Parameters:
        n - the threshold for the trimming.
        Returns:
        true if there was enough memory to trim the map.
        See Also:
        trim()

      • rehash

        protected void rehash​(int newN)
        Rehashes the map.

        This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.

        Parameters:
        newN - the new size

      • clone

        public Char2ObjectOpenHashMap<V> clone()
        Returns a deep copy of this map.

        This method performs a deep copy of this hash map; the data stored in the map, however, is not cloned. Note that this makes a difference only for object keys.

        Overrides:
        clone in class Object
        Returns:
        a deep copy of this map.

      • hashCode

        public int hashCode()
        Returns a hash code for this map. This method overrides the generic method provided by the superclass. Since equals() is not overriden, it is important that the value returned by this method is the same value as the one returned by the overriden method.
        Specified by:
        hashCode in interface Map<Character,​V>
        Overrides:
        hashCode in class AbstractChar2ObjectMap<V>
        Returns:
        a hash code for this map.