public class Long2CharOpenHashMap extends AbstractLong2CharMap implements java.io.Serializable, java.lang.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 FormAbstractLong2CharMap.BasicEntryHash.Strategy<K>Long2CharMap.Entry, Long2CharMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Long2CharOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Long2CharOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Long2CharOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Long2CharOpenHashMap(long[] k,
char[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Long2CharOpenHashMap(long[] k,
char[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Long2CharOpenHashMap(Long2CharMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Long2CharOpenHashMap(Long2CharMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Long2CharOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Long2CharOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.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).
|
Long2CharOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2CharMap.keySet(). |
boolean |
containsValue(char v)
Checks whether the given value is contained in
AbstractLong2CharMap.values(). |
char |
get(long k)
Returns the value to which the given key is mapped.
|
java.lang.Character |
get(java.lang.Long ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
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.
|
boolean |
isEmpty() |
LongSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Long2CharMap.FastEntrySet |
long2CharEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
char |
put(long k,
char v)
Adds a pair to the map.
|
java.lang.Character |
put(java.lang.Long ok,
java.lang.Character ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
void |
putAll(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> m)
Puts all pairs in the given map.
|
boolean |
rehash()
Deprecated.
A no-op.
|
char |
remove(long k)
Removes the mapping with the given key.
|
java.lang.Character |
remove(java.lang.Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
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, getpublic Long2CharOpenHashMap(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 Long2CharOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Long2CharOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.public Long2CharOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> m,
float f)
m - a Map to be copied into the new hash map.f - the load factor.public Long2CharOpenHashMap(java.util.Map<? extends java.lang.Long,? extends java.lang.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 Long2CharOpenHashMap(Long2CharMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Long2CharOpenHashMap(Long2CharMap 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 Long2CharOpenHashMap(long[] 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.java.lang.IllegalArgumentException - if k and v have different lengths.public Long2CharOpenHashMap(long[] 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.java.lang.IllegalArgumentException - if k and v have different lengths.public void putAll(java.util.Map<? extends java.lang.Long,? extends java.lang.Character> m)
putAll in interface java.util.Map<java.lang.Long,java.lang.Character>putAll in class AbstractLong2CharMapm - a map.public char put(long k,
char v)
Long2CharFunctionput in interface Long2CharFunctionput in class AbstractLong2CharFunctionk - the key.v - the value.Function.put(Object,Object)@Deprecated
public java.lang.Character put(java.lang.Long ok,
java.lang.Character ov)
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.
put in interface Function<java.lang.Long,java.lang.Character>put in interface java.util.Map<java.lang.Long,java.lang.Character>put in class AbstractLong2CharFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public char remove(long k)
Long2CharFunctionremove in interface Long2CharFunctionremove in class AbstractLong2CharFunctionk - the key.Function.remove(Object)@Deprecated public java.lang.Character remove(java.lang.Object ok)
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.
remove in interface Function<java.lang.Long,java.lang.Character>remove in interface java.util.Map<java.lang.Long,java.lang.Character>remove in class AbstractLong2CharFunctionok - the key.null if no value was present for the given key.Map.remove(Object)@Deprecated public java.lang.Character get(java.lang.Long ok)
public char get(long k)
Long2CharFunctionget in interface Long2CharFunctionk - the key.Function.get(Object)public boolean containsKey(long k)
AbstractLong2CharMapAbstractLong2CharMap.keySet().containsKey in interface Long2CharFunctioncontainsKey in class AbstractLong2CharMapFunction.containsKey(Object)public boolean containsValue(char v)
AbstractLong2CharMapAbstractLong2CharMap.values().containsValue in interface Long2CharMapcontainsValue in class AbstractLong2CharMapMap.containsValue(Object)public void clear()
Functionclear in interface Function<java.lang.Long,java.lang.Character>clear in interface java.util.Map<java.lang.Long,java.lang.Character>clear in class AbstractLong2CharFunctionMap.clear()public 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()
isEmpty in interface java.util.Map<java.lang.Long,java.lang.Character>isEmpty in class AbstractLong2CharMap@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 Long2CharMap.FastEntrySet long2CharEntrySet()
Long2CharMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2CharMap.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).
long2CharEntrySet in interface Long2CharMapLong2CharMap.entrySet()public LongSet keySet()
AbstractLong2CharMapThe view is backed by the set returned by AbstractLong2CharMap.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 Long2CharMapkeySet in interface java.util.Map<java.lang.Long,java.lang.Character>keySet in class AbstractLong2CharMapMap.keySet()public CharCollection values()
AbstractLong2CharMapThe view is backed by the set returned by AbstractLong2CharMap.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 Long2CharMapvalues in interface java.util.Map<java.lang.Long,java.lang.Character>values in class AbstractLong2CharMapMap.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 Long2CharOpenHashMap 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.
clone in class java.lang.Objectpublic 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.hashCode in interface java.util.Map<java.lang.Long,java.lang.Character>hashCode in class AbstractLong2CharMap