public class Byte2ShortOpenHashMap extends AbstractByte2ShortMap 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 FormAbstractByte2ShortMap.BasicEntryHash.Strategy<K>Byte2ShortMap.Entry, Byte2ShortMap.FastEntrySet| Modifier and Type | Field and Description |
|---|---|
protected Byte2ShortMap.FastEntrySet |
entries
Cached set of entries.
|
protected float |
f
The acceptable load factor.
|
protected byte[] |
key
The array of keys.
|
protected ByteSet |
keys
Cached set of keys.
|
protected int |
mask
The mask for wrapping a position counter.
|
protected int |
maxFill
Threshold after which we rehash.
|
protected int |
n
The current table size.
|
static long |
serialVersionUID |
protected int |
size
Number of entries in the set.
|
protected boolean[] |
used
The array telling whether a position is used.
|
protected short[] |
value
The array of values.
|
protected ShortCollection |
values
Cached collection of values.
|
defRetValueDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Byte2ShortOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Byte2ShortOpenHashMap(byte[] k,
short[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Byte2ShortOpenHashMap(byte[] k,
short[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Byte2ShortOpenHashMap(Byte2ShortMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
Byte2ShortOpenHashMap(Byte2ShortMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Byte2ShortOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Byte2ShortOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Byte2ShortOpenHashMap(Map<? extends Byte,? extends Short> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Byte2ShortOpenHashMap(Map<? extends Byte,? extends Short> m,
float f)
Creates a new hash map copying a given one.
|
| Modifier and Type | Method and Description |
|---|---|
short |
add(byte k,
short incr)
Adds an increment to value currently associated with a key.
|
Byte2ShortMap.FastEntrySet |
byte2ShortEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Byte2ShortOpenHashMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(byte k)
Checks whether the given value is contained in
AbstractByte2ShortMap.keySet(). |
boolean |
containsValue(short v)
Checks whether the given value is contained in
AbstractByte2ShortMap.values(). |
short |
get(byte k)
Returns the value to which the given key is mapped.
|
Short |
get(Byte 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() |
ByteSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
short |
put(byte k,
short v)
Adds a pair to the map.
|
Short |
put(Byte ok,
Short ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
boolean |
rehash()
Deprecated.
A no-op.
|
protected void |
rehash(int newN)
Resizes the map.
|
short |
remove(byte k)
Removes the mapping with the given key.
|
Short |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
protected int |
shiftKeys(int pos)
Shifts left entries with the specified hash code, starting at the specified position,
and empties the resulting free entry.
|
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.
|
ShortCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, putAll, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getfinalize, getClass, notify, notifyAll, wait, wait, waitdefaultReturnValue, defaultReturnValuecontainsKey, getcontainsKey, getpublic static final long serialVersionUID
protected transient byte[] key
protected transient short[] value
protected transient boolean[] used
protected final float f
protected transient int n
protected transient int maxFill
f.protected transient int mask
protected int size
protected transient volatile Byte2ShortMap.FastEntrySet entries
protected transient volatile ByteSet keys
protected transient volatile ShortCollection values
public Byte2ShortOpenHashMap(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 Byte2ShortOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.public Byte2ShortOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.public Byte2ShortOpenHashMap(Map<? extends Byte,? extends Short> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Byte2ShortOpenHashMap(Map<? extends Byte,? extends Short> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.m - a Map to be copied into the new hash map.public Byte2ShortOpenHashMap(Byte2ShortMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Byte2ShortOpenHashMap(Byte2ShortMap 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 Byte2ShortOpenHashMap(byte[] k,
short[] 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 Byte2ShortOpenHashMap(byte[] k,
short[] 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 short put(byte k,
short v)
Byte2ShortFunctionput in interface Byte2ShortFunctionput in class AbstractByte2ShortFunctionk - the key.v - the value.Function.put(Object,Object)public Short put(Byte ok, Short ov)
AbstractByte2ShortFunctionnull 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 short add(byte 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.protected final int shiftKeys(int pos)
pos - a starting position.public short remove(byte k)
Byte2ShortFunctionremove in interface Byte2ShortFunctionremove in class AbstractByte2ShortFunctionFunction.remove(Object)public Short remove(Object ok)
AbstractByte2ShortFunctionnull 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 short get(byte k)
Byte2ShortFunctionget in interface Byte2ShortFunctionk - the key.Function.get(Object)public boolean containsKey(byte k)
AbstractByte2ShortMapAbstractByte2ShortMap.keySet().containsKey in interface Byte2ShortFunctioncontainsKey in class AbstractByte2ShortMapFunction.containsKey(Object)public boolean containsValue(short v)
AbstractByte2ShortMapAbstractByte2ShortMap.values().containsValue in interface Byte2ShortMapcontainsValue in class AbstractByte2ShortMapMap.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 Byte2ShortMap.FastEntrySet byte2ShortEntrySet()
Byte2ShortMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Byte2ShortMap.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).
byte2ShortEntrySet in interface Byte2ShortMapByte2ShortMap.entrySet()public ByteSet keySet()
AbstractByte2ShortMapThe view is backed by the set returned by AbstractByte2ShortMap.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 Byte2ShortMapkeySet in interface Map<Byte,Short>keySet in class AbstractByte2ShortMapMap.keySet()public ShortCollection values()
AbstractByte2ShortMapThe view is backed by the set returned by AbstractByte2ShortMap.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 Byte2ShortMapvalues in interface Map<Byte,Short>values in class AbstractByte2ShortMapMap.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()protected void rehash(int newN)
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.
newN - the new sizepublic Byte2ShortOpenHashMap 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.Copyright © 2013. All Rights Reserved.