|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap
it.unimi.dsi.fastutil.bytes.Byte2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy is specified at creation time.
Instances of this class use a hash table to represent a map. The table is
enlarged as needed 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.
The enlargement speed is controlled by the growth factor, a
positive number. If the growth factor is p, then the table is
enlarged each time roughly by a factor 2p/16. By default, p is
Hash.DEFAULT_GROWTH_FACTOR, which means that the table is doubled at
each enlargement, but one can easily set more or less aggressive policies by
calling growthFactor(int) (note that the growth factor is not serialized:
deserialized tables gets the default growth factor).
Hash,
HashCommon,
Serialized Form| Nested Class Summary |
| Nested classes inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap |
AbstractByte2FloatMap.BasicEntry |
| Nested classes inherited from class it.unimi.dsi.fastutil.Hash |
Hash.Strategy |
| Nested classes inherited from class it.unimi.dsi.fastutil.bytes.Byte2FloatMap |
Byte2FloatMap.Entry |
| Field Summary | |
static long |
serialVersionUID
|
| Fields inherited from interface it.unimi.dsi.fastutil.Hash |
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED |
| Constructor Summary | |
Byte2FloatOpenHashMap()
Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Byte2FloatOpenHashMap(Byte2FloatMap m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
|
Byte2FloatOpenHashMap(Byte2FloatMap m,
float f)
Creates a new hash map copying a given type-specific one. |
|
Byte2FloatOpenHashMap(int n)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Byte2FloatOpenHashMap(int n,
float f)
Creates a new hash map. |
|
Byte2FloatOpenHashMap(Map m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
|
Byte2FloatOpenHashMap(Map m,
float f)
Creates a new hash map copying a given one. |
|
| Method Summary | |
void |
clear()
|
Object |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(byte k)
Checks whether the given value is contained in keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in values(). |
Set |
entrySet()
|
float |
get(byte k)
Returns the value to which the given key is mapped. |
Object |
get(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
growthFactor()
Gets the growth factor. |
void |
growthFactor(int growthFactor)
Sets the growth factor. |
int |
hashCode()
Returns a hash code for this map. |
boolean |
isEmpty()
|
Set |
keySet()
Returns a type-specific-set view of the keys of this map. |
float |
put(byte k,
float v)
Adds a pair to the map. |
Object |
put(Object ok,
Object ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
boolean |
rehash()
Rehashes this map without changing the table size. |
float |
remove(byte k)
Removes the mapping with the given key. |
Object |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
|
int |
size()
|
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. |
Collection |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2FloatMap |
containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, putAll, setDefRetValue, toString |
| Methods inherited from class java.lang.Object |
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.bytes.Byte2FloatMap |
defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue |
| Methods inherited from interface java.util.Map |
containsKey, containsValue, equals, putAll |
| Field Detail |
public static final long serialVersionUID
| Constructor Detail |
public Byte2FloatOpenHashMap(int n,
float f)
n/f.
n - the expected number of elements in the hash map.f - the load factor.Hash.PRIMESpublic Byte2FloatOpenHashMap(int n)
Hash.DEFAULT_LOAD_FACTOR as load factor.
n - the expected number of elements in the hash map.public Byte2FloatOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.
public Byte2FloatOpenHashMap(Map m,
float f)
m - a Map to be copied into the new hash map.f - the load factor.public Byte2FloatOpenHashMap(Map m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
m - a Map to be copied into the new hash map.
public Byte2FloatOpenHashMap(Byte2FloatMap m,
float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Byte2FloatOpenHashMap(Byte2FloatMap 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.| Method Detail |
public void growthFactor(int growthFactor)
growthFactor - the new growth factor; it must be positive.public int growthFactor()
growthFactor(int)
public float put(byte k,
float v)
Byte2FloatMap
put in interface Byte2FloatMapput in class AbstractByte2FloatMap
public Object put(Object ok,
Object ov)
AbstractByte2FloatMapnull 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 Mapput in class AbstractByte2FloatMappublic boolean containsValue(float v)
AbstractByte2FloatMapAbstractByte2FloatMap.values().
containsValue in interface Byte2FloatMapcontainsValue in class AbstractByte2FloatMappublic void clear()
clear in interface Mapclear in class AbstractByte2FloatMappublic boolean containsKey(byte k)
AbstractByte2FloatMapAbstractByte2FloatMap.keySet().
containsKey in interface Byte2FloatMapcontainsKey in class AbstractByte2FloatMappublic int size()
size in interface Mappublic boolean isEmpty()
isEmpty in interface MapisEmpty in class AbstractByte2FloatMappublic float get(byte k)
Byte2FloatMap
get in interface Byte2FloatMapk - the key.
Map.get(Object)public float remove(byte k)
Byte2FloatMap
remove in interface Byte2FloatMapremove in class AbstractByte2FloatMappublic Object get(Object ok)
AbstractByte2FloatMapnull 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.
get in interface Mapget in class AbstractByte2FloatMappublic Object remove(Object ok)
AbstractByte2FloatMapnull 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 Mapremove in class AbstractByte2FloatMappublic Set entrySet()
entrySet in interface Mappublic Set keySet()
AbstractByte2FloatMapThe 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 MapkeySet in class AbstractByte2FloatMappublic Collection values()
AbstractByte2FloatMapThe 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 Mapvalues in class AbstractByte2FloatMappublic boolean rehash()
This method should be called when the map underwent numerous deletions and insertions. In this case, free entries become rare, and unsuccessful searches require probing all entries. For reasonable load factors this method is linear in the number of entries. You will need as much additional free memory as that occupied by the table.
If you need to reduce the table siza to fit exactly
this map, you must use trim().
true if there was enough memory to rehash the map, false otherwise.trim()public boolean trim()
This method rehashes to the smallest size satisfying the load factor. It can be used when the map will not be changed anymore, so to optimise access speed (by collecting deleted entries) and size.
If the table size is already the minimum possible, this method
does nothing. If you want to guarantee rehashing, use rehash().
trim(int),
rehash()public boolean trim(int n)
Let N be the smallest table size that can hold
n entries, still satisfying the load factor. If the current
table size is smaller than or equal to N, or if the number of
elements of this map is larger than n, this method does
nothing. Otherwise, it rehashes this map in a table of size
N.
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(),
rehash()public Object 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.
hashCode in interface MaphashCode in class AbstractByte2FloatMap
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||