public class Short2ByteOpenHashMap extends AbstractShort2ByteMap implements Serializable, Cloneable, Hash
Instances of this class use a hash table to represent a map. The table is
enlarged as needed by doubling its size when new entries are created, but it is never made
smaller (even on a clear()). A family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
Warning: The implementation of this class has significantly
changed in fastutil 6.1.0. Please read the
comments about this issue in the section “Faster Hash Tables” of the overview.
Hash,
HashCommon,
Serialized FormAbstractShort2ByteMap.BasicEntryHash.Strategy<K>Short2ByteMap.Entry, Short2ByteMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Short2ByteOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Short2ByteOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Short2ByteOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Short2ByteOpenHashMap(Map<? extends Short,? extends Byte> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Short2ByteOpenHashMap(Map<? extends Short,? extends Byte> m,
float f)
Creates a new hash map copying a given one.
|
Short2ByteOpenHashMap(short[] k,
byte[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Short2ByteOpenHashMap(short[] k,
byte[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Short2ByteOpenHashMap(Short2ByteMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Short2ByteOpenHashMap(Short2ByteMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
| Modifier and Type | Method and Description |
|---|---|
byte |
add(short k,
byte incr)
Deprecated.
use
addTo() instead; having the same name of a Set method turned out to be a recipe for disaster. |
byte |
addTo(short k,
byte incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Short2ByteOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(short k)
Checks whether the given value is contained in
AbstractShort2ByteMap.keySet(). |
boolean |
containsValue(byte v)
Checks whether the given value is contained in
AbstractShort2ByteMap.values(). |
byte |
get(short k)
Returns the value to which the given key is mapped.
|
Byte |
get(Short 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.
|
boolean |
isEmpty() |
ShortSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
byte |
put(short k,
byte v)
Adds a pair to the map.
|
Byte |
put(Short ok,
Byte ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
boolean |
rehash()
Deprecated.
A no-op.
|
Byte |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
byte |
remove(short k)
Removes the mapping with the given key.
|
Short2ByteMap.FastEntrySet |
short2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
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.
|
ByteCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, getpublic Short2ByteOpenHashMap(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 Short2ByteOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Short2ByteOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.public Short2ByteOpenHashMap(Map<? extends Short,? extends Byte> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Short2ByteOpenHashMap(Map<? extends Short,? extends Byte> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Short2ByteOpenHashMap(Short2ByteMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Short2ByteOpenHashMap(Short2ByteMap 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 Short2ByteOpenHashMap(short[] k,
byte[] 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 Short2ByteOpenHashMap(short[] k,
byte[] 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 byte put(short k,
byte v)
Short2ByteFunctionput in interface Short2ByteFunctionput in class AbstractShort2ByteFunctionk - the key.v - the value.Function.put(Object,Object)public Byte put(Short ok, Byte ov)
AbstractShort2ByteFunctionnull 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.
@Deprecated public byte add(short k, byte incr)
addTo() instead; having the same name of a Set method turned out to be a recipe for disaster.k - the key.incr - the increment.public byte addTo(short k,
byte 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 byte remove(short k)
Short2ByteFunctionremove in interface Short2ByteFunctionremove in class AbstractShort2ByteFunctionFunction.remove(Object)public Byte remove(Object ok)
AbstractShort2ByteFunctionnull 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.
public byte get(short k)
Short2ByteFunctionget in interface Short2ByteFunctionk - the key.Function.get(Object)public boolean containsKey(short k)
AbstractShort2ByteMapAbstractShort2ByteMap.keySet().containsKey in interface Short2ByteFunctioncontainsKey in class AbstractShort2ByteMapFunction.containsKey(Object)public boolean containsValue(byte v)
AbstractShort2ByteMapAbstractShort2ByteMap.values().containsValue in interface Short2ByteMapcontainsValue in class AbstractShort2ByteMapMap.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 Short2ByteMap.FastEntrySet short2ByteEntrySet()
Short2ByteMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Short2ByteMap.entrySet()
so that it returns an ObjectSet
of objects of type Map.Entry (the latter makes it possible to
access keys and values with type-specific methods).
short2ByteEntrySet in interface Short2ByteMapShort2ByteMap.entrySet()public ShortSet keySet()
AbstractShort2ByteMapThe view is backed by the set returned by AbstractShort2ByteMap.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 Short2ByteMapkeySet in interface Map<Short,Byte>keySet in class AbstractShort2ByteMapMap.keySet()public ByteCollection values()
AbstractShort2ByteMapThe view is backed by the set returned by AbstractShort2ByteMap.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 Short2ByteMapvalues in interface Map<Short,Byte>values in class AbstractShort2ByteMapMap.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 Short2ByteOpenHashMap 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.