public class Int2CharOpenHashMap extends AbstractInt2CharMap implements Serializable, Cloneable, Hash
Instances of this class use a hash table to represent a map. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size. However, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.
Note that clear() does not modify the hash table size. Rather, a family of trimming methods lets you control the size of the table; this is particularly useful if
you reuse instances of this class.
Hash,
HashCommon,
Serialized FormAbstractInt2CharMap.BasicEntryHash.Strategy<K>Int2CharMap.Entry, Int2CharMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Int2CharOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Int2CharOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Int2CharOpenHashMap(int[] k,
char[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Int2CharOpenHashMap(int[] k,
char[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Int2CharOpenHashMap(Int2CharMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Int2CharOpenHashMap(Int2CharMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Int2CharOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Int2CharOpenHashMap(Map<? extends Integer,? extends Character> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Int2CharOpenHashMap(Map<? extends Integer,? extends Character> m,
float f)
Creates a new hash map copying a given one.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Int2CharOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractInt2CharMap.values(). |
char |
get(int k)
Returns the value to which the given key is mapped.
|
Character |
get(Integer ok) |
int |
growthFactor()
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
void |
growthFactor(int growthFactor)
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
int |
hashCode()
Returns a hash code for this map.
|
Int2CharMap.FastEntrySet |
int2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
char |
put(int k,
char v)
Adds a pair to the map.
|
Character |
put(Integer ok,
Character ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
void |
putAll(Map<? extends Integer,? extends Character> m)
Puts all pairs in the given map.
|
boolean |
rehash()
Deprecated.
A no-op.
|
char |
remove(int k)
Removes the mapping with the given key.
|
Character |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
boolean |
trim()
Rehashes the map, making the table as small as possible.
|
boolean |
trim(int n)
Rehashes this map if the table is too large.
|
CharCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, forEach, get, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic Int2CharOpenHashMap(int expected,
float f)
The actual table size will be the least power of two greater than expected/f.
expected - the expected number of elements in the hash set.f - the load factor.public Int2CharOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Int2CharOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.public Int2CharOpenHashMap(Map<? extends Integer,? extends Character> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Int2CharOpenHashMap(Map<? extends Integer,? extends Character> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Int2CharOpenHashMap(Int2CharMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Int2CharOpenHashMap(Int2CharMap m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.m - a type-specific map to be copied into the new hash map.public Int2CharOpenHashMap(int[] k,
char[] v,
float f)
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.IllegalArgumentException - if k and v have different lengths.public Int2CharOpenHashMap(int[] k,
char[] v)
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.k - the array of keys of the new hash map.v - the array of corresponding values in the new hash map.IllegalArgumentException - if k and v have different lengths.public void putAll(Map<? extends Integer,? extends Character> m)
public char put(int k,
char v)
Int2CharFunctionput in interface Int2CharFunctionput in class AbstractInt2CharFunctionk - the key.v - the value.Function.put(Object,Object)public Character put(Integer ok, Character ov)
AbstractInt2CharFunctionnull 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.
put in interface Function<Integer,Character>put in interface Map<Integer,Character>put in class AbstractInt2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public char remove(int k)
Int2CharFunctionremove in interface Int2CharFunctionremove in class AbstractInt2CharFunctionk - the key.Function.remove(Object)public Character remove(Object ok)
AbstractInt2CharFunctionnull 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.
remove in interface Function<Integer,Character>remove in interface Map<Integer,Character>remove in class AbstractInt2CharFunctionok - the key.null if no value was present for the given key.Map.remove(Object)public char get(int k)
Int2CharFunctionget in interface Int2CharFunctionk - the key.Function.get(Object)public boolean containsKey(int k)
AbstractInt2CharMapAbstractInt2CharMap.keySet().containsKey in interface Int2CharFunctioncontainsKey in class AbstractInt2CharMapFunction.containsKey(Object)public boolean containsValue(char v)
AbstractInt2CharMapAbstractInt2CharMap.values().containsValue in interface Int2CharMapcontainsValue in class AbstractInt2CharMapMap.containsValue(Object)public void clear()
Functionpublic int size()
FunctionMost function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
public boolean isEmpty()
@Deprecated public void growthFactor(int growthFactor)
fastutil 6.1.0, hash tables are doubled when they are too full.growthFactor - unused.@Deprecated public int growthFactor()
fastutil 6.1.0, hash tables are doubled when they are too full.growthFactor(int)public Int2CharMap.FastEntrySet int2CharEntrySet()
Int2CharMapThis method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen Int2CharMap.entrySet() so that it returns an
ObjectSet of type-specific entries (the latter makes it possible to access keys and values with type-specific methods).
int2CharEntrySet in interface Int2CharMapInt2CharMap.entrySet()public IntSet keySet()
AbstractInt2CharMapThe view is backed by the set returned by AbstractInt2CharMap.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.
keySet in interface Int2CharMapkeySet in interface Map<Integer,Character>keySet in class AbstractInt2CharMapMap.keySet()public CharCollection values()
AbstractInt2CharMapThe view is backed by the set returned by AbstractInt2CharMap.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.
values in interface Int2CharMapvalues in interface Map<Integer,Character>values in class AbstractInt2CharMapMap.values()@Deprecated public boolean rehash()
If you need to reduce the table size to fit exactly this set, use trim().
trim()public boolean trim()
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.
trim(int)public boolean trim(int n)
Let N be the smallest table size that can hold max(n, 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.
size())
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.
n - the threshold for the trimming.trim()public Int2CharOpenHashMap clone()
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.
public int hashCode()
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.