public class Long2ShortOpenCustomHashMap extends AbstractLong2ShortMap 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, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create maps with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, 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 FormAbstractLong2ShortMap.BasicEntry, AbstractLong2ShortMap.BasicEntrySetHash.Strategy<K>Long2ShortMap.Entry, Long2ShortMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Long2ShortOpenCustomHashMap(int expected,
float f,
LongHash.Strategy strategy)
Creates a new hash map.
|
Long2ShortOpenCustomHashMap(int expected,
LongHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Long2ShortOpenCustomHashMap(long[] k,
short[] v,
float f,
LongHash.Strategy strategy)
Creates a new hash map using the elements of two parallel arrays.
|
Long2ShortOpenCustomHashMap(long[] k,
short[] v,
LongHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Long2ShortOpenCustomHashMap(Long2ShortMap m,
float f,
LongHash.Strategy strategy)
Creates a new hash map copying a given type-specific one.
|
Long2ShortOpenCustomHashMap(Long2ShortMap m,
LongHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Long2ShortOpenCustomHashMap(LongHash.Strategy strategy)
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Long2ShortOpenCustomHashMap(Map<? extends Long,? extends Short> m,
float f,
LongHash.Strategy strategy)
Creates a new hash map copying a given one.
|
Long2ShortOpenCustomHashMap(Map<? extends Long,? extends Short> m,
LongHash.Strategy strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
| Modifier and Type | Method and Description |
|---|---|
short |
addTo(long k,
short incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Long2ShortOpenCustomHashMap |
clone()
Returns a deep copy of this map.
|
short |
compute(long k,
BiFunction<? super Long,? super Short,? extends Short> remappingFunction)
Attempts to compute a mapping for the specified key and its current mapped value (or
null if there is no current mapping). |
short |
computeIfAbsent(long k,
LongToIntFunction mappingFunction)
If the specified key is not already associated with a value, attempts to compute its value
using the given mapping function and enters it into this map.
|
short |
computeIfAbsentNullable(long k,
LongFunction<? extends Short> mappingFunction)
If the specified key is not already associated with a value, attempts to compute its value
using the given mapping function and enters it into this map unless it is
null. |
short |
computeIfPresent(long k,
BiFunction<? super Long,? super Short,? extends Short> remappingFunction)
If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.
|
boolean |
containsKey(long k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(short v)
Returns
true if this map maps one or more keys to the specified value. |
short |
get(long k)
Returns the value to which the given key is mapped.
|
short |
getOrDefault(long k,
short defaultValue)
Returns the value to which the specified key is mapped, or the
defaultValue if this
map contains no mapping for the key. |
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.
|
Long2ShortMap.FastEntrySet |
long2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
short |
merge(long k,
short v,
BiFunction<? super Short,? super Short,? extends Short> remappingFunction)
If the specified key is not already associated with a value, associates it with the given
value. |
short |
put(long k,
short v)
Adds a pair to the map (optional operation).
|
void |
putAll(Map<? extends Long,? extends Short> m) |
short |
putIfAbsent(long k,
short v)
If the specified key is not already associated with a value, associates it with the given
value and returns the default return value, else returns
the current value.
|
short |
remove(long k)
Removes the mapping with the given key (optional operation).
|
boolean |
remove(long k,
short v)
Removes the entry for the specified key only if it is currently mapped to the specified value.
|
short |
replace(long k,
short v)
Replaces the entry for the specified key only if it is currently mapped to some value.
|
boolean |
replace(long k,
short oldValue,
short v)
Replaces the entry for the specified key only if currently mapped to the specified value.
|
int |
size()
Returns the number of key/value mappings in this map.
|
LongHash.Strategy |
strategy()
Returns the hashing strategy.
|
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.
|
ShortCollection |
values()
Returns a type-specific-set view of the values of this map.
|
equals, toStringdefaultReturnValue, defaultReturnValuecompute, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, entrySet, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replaceapplyAsIntforEach, replaceAllpublic Long2ShortOpenCustomHashMap(int expected,
float f,
LongHash.Strategy strategy)
The actual table size will be the least power of two greater than expected/f.
expected - the expected number of elements in the hash map.f - the load factor.strategy - the strategy.public Long2ShortOpenCustomHashMap(int expected,
LongHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.strategy - the strategy.public Long2ShortOpenCustomHashMap(LongHash.Strategy strategy)
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.strategy - the strategy.public Long2ShortOpenCustomHashMap(Map<? extends Long,? extends Short> m, float f, LongHash.Strategy strategy)
m - a Map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Long2ShortOpenCustomHashMap(Map<? extends Long,? extends Short> m, LongHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.strategy - the strategy.public Long2ShortOpenCustomHashMap(Long2ShortMap m, float f, LongHash.Strategy strategy)
m - a type-specific map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Long2ShortOpenCustomHashMap(Long2ShortMap m, LongHash.Strategy strategy)
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.strategy - the strategy.public Long2ShortOpenCustomHashMap(long[] k,
short[] v,
float f,
LongHash.Strategy strategy)
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.strategy - the strategy.IllegalArgumentException - if k and v have different lengths.public Long2ShortOpenCustomHashMap(long[] k,
short[] v,
LongHash.Strategy strategy)
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.strategy - the strategy.IllegalArgumentException - if k and v have different lengths.public LongHash.Strategy strategy()
public void putAll(Map<? extends Long,? extends Short> m)
AbstractLong2ShortMappublic short put(long k,
short v)
Long2ShortFunctionput in interface Long2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public short addTo(long k,
short incr)
Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
k - the key.incr - the increment.public short remove(long k)
Long2ShortFunctionremove in interface Long2ShortFunctionk - the key.Function.remove(Object)public short get(long k)
Long2ShortFunctionget in interface Long2ShortFunctionk - the key.Function.get(Object)public boolean containsKey(long k)
Long2ShortMapcontainsKey in interface Long2ShortFunctioncontainsKey in interface Long2ShortMapcontainsKey in class AbstractLong2ShortMapk - the key.key.Map.containsKey(Object)public boolean containsValue(short v)
Long2ShortMaptrue if this map maps one or more keys to the specified value.containsValue in interface Long2ShortMapcontainsValue in class AbstractLong2ShortMapMap.containsValue(Object)public short getOrDefault(long k,
short defaultValue)
defaultValue if this
map contains no mapping for the key.getOrDefault in interface Long2ShortMapk - the key.defaultValue - the default mapping of the key.defaultValue if this map contains no mapping for the key.Map.getOrDefault(Object, Object)public short putIfAbsent(long k,
short v)
putIfAbsent in interface Long2ShortMapk - key with which the specified value is to be associated.v - value to be associated with the specified key.Map.putIfAbsent(Object, Object)public boolean remove(long k,
short v)
remove in interface Long2ShortMapk - key with which the specified value is associated.v - value expected to be associated with the specified key.true if the value was removed.Map.remove(Object, Object)public boolean replace(long k,
short oldValue,
short v)
replace in interface Long2ShortMapk - key with which the specified value is associated.oldValue - value expected to be associated with the specified key.v - value to be associated with the specified key.true if the value was replaced.Map.replace(Object, Object, Object)public short replace(long k,
short v)
replace in interface Long2ShortMapk - key with which the specified value is associated.v - value to be associated with the specified key.Map.replace(Object, Object)public short computeIfAbsent(long k,
LongToIntFunction mappingFunction)
Note that contrarily to the default computeIfAbsent(),
it is not possible to not add a value for a given key, since the mappingFunction cannot
return null. If such a behavior is needed, please use the corresponding nullable version.
computeIfAbsent in interface Long2ShortMapk - key with which the specified value is to be associated.mappingFunction - the function to compute a value.Map.computeIfAbsent(Object, java.util.function.Function)public short computeIfAbsentNullable(long k,
LongFunction<? extends Short> mappingFunction)
null.
Note that this version of computeIfAbsent()
should be used only if you plan to return null in the mapping function.
computeIfAbsentNullable in interface Long2ShortMapk - key with which the specified value is to be associated.mappingFunction - the function to compute a value.null.Map.computeIfAbsent(Object, java.util.function.Function)public short computeIfPresent(long k,
BiFunction<? super Long,? super Short,? extends Short> remappingFunction)
computeIfPresent in interface Long2ShortMapk - key with which the specified value is to be associated.remappingFunction - the function to compute a value.Map.computeIfPresent(Object, java.util.function.BiFunction)public short compute(long k,
BiFunction<? super Long,? super Short,? extends Short> remappingFunction)
null if there is no current mapping).
If the function returns null, the mapping is removed (or remains absent if initially absent).
If the function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.
compute in interface Long2ShortMapk - key with which the specified value is to be associated.remappingFunction - the function to compute a value.Map.compute(Object, java.util.function.BiFunction)public short merge(long k,
short v,
BiFunction<? super Short,? super Short,? extends Short> remappingFunction)
value.
Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result is null.merge in interface Long2ShortMapk - key with which the resulting value is to be associated.v - the value to be merged with the existing value associated with the key or, if no existing value is associated with the key, to be associated with the key.remappingFunction - the function to recompute a value if present.Map.merge(Object, Object, java.util.function.BiFunction)public void clear()
Long2ShortMapclear in interface Long2ShortMapclear in interface Map<Long,Short>Map.clear()public int size()
Long2ShortMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public boolean isEmpty()
public Long2ShortMap.FastEntrySet long2ShortEntrySet()
Long2ShortMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.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).
long2ShortEntrySet in interface Long2ShortMapMap.entrySet()public LongSet keySet()
AbstractLong2ShortMapThe view is backed by the set returned by Map.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 Long2ShortMapkeySet in interface Map<Long,Short>keySet in class AbstractLong2ShortMapMap.keySet()public ShortCollection values()
AbstractLong2ShortMapThe view is backed by the set returned by Map.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 Long2ShortMapvalues in interface Map<Long,Short>values in class AbstractLong2ShortMapMap.values()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 Long2ShortOpenCustomHashMap 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.