public class Object2FloatLinkedOpenCustomHashMap<K> extends AbstractObject2FloatSortedMap<K> 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.
Iterators generated by this map will enumerate pairs in the same order in which they have been added to the map (addition of pairs whose key is already present in the set does not change the iteration order). Note that this order has nothing in common with the natural order of the keys. The order is kept by means of a doubly linked list, represented via an array of longs parallel to the table.
This class implements the interface of a sorted map, so to allow easy
access of the iteration order: for instance, you can get the first key
in iteration order with firstKey() without having to create an
iterator; however, this class partially violates the SortedMap
contract because all submap methods throw an exception and comparator() returns always null.
Additional methods, such as getAndMoveToFirst(), make it easy
to use instances of this class as a cache (e.g., with LRU policy).
The iterators provided by the views of this class using are type-specific
list iterators, and can be started at any
element which is a key of the map, or
a NoSuchElementException exception will be thrown.
If, however, the provided element is not the first or last key in the
set, the first access to the list index will require linear time, as in the worst case
the entire key set must be scanned in iteration order to retrieve the positional
index of the starting key. If you use just the methods of a type-specific BidirectionalIterator,
however, all operations will be performed in constant time.
Hash,
HashCommon,
Serialized FormAbstractObject2FloatMap.BasicEntry<K>Hash.Strategy<K>Object2FloatSortedMap.FastSortedEntrySet<K>Object2FloatMap.Entry<K>, Object2FloatMap.FastEntrySet<K>DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Object2FloatLinkedOpenCustomHashMap(Hash.Strategy<K> strategy)
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
Object2FloatLinkedOpenCustomHashMap(int expected,
float f,
Hash.Strategy<K> strategy)
Creates a new hash map.
|
Object2FloatLinkedOpenCustomHashMap(int expected,
Hash.Strategy<K> strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Object2FloatLinkedOpenCustomHashMap(K[] k,
float[] v,
float f,
Hash.Strategy<K> strategy)
Creates a new hash map using the elements of two parallel arrays.
|
Object2FloatLinkedOpenCustomHashMap(K[] k,
float[] v,
Hash.Strategy<K> strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
Object2FloatLinkedOpenCustomHashMap(Map<? extends K,? extends Float> m,
float f,
Hash.Strategy<K> strategy)
Creates a new hash map copying a given one.
|
Object2FloatLinkedOpenCustomHashMap(Map<? extends K,? extends Float> m,
Hash.Strategy<K> strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
Object2FloatLinkedOpenCustomHashMap(Object2FloatMap<K> m,
float f,
Hash.Strategy<K> strategy)
Creates a new hash map copying a given type-specific one.
|
Object2FloatLinkedOpenCustomHashMap(Object2FloatMap<K> m,
Hash.Strategy<K> strategy)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
| Modifier and Type | Method and Description |
|---|---|
float |
add(K k,
float incr)
Deprecated.
use
addTo() instead; having the same name of a Set method turned out to be a recipe for disaster. |
float |
addTo(K k,
float incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Object2FloatLinkedOpenCustomHashMap<K> |
clone()
Returns a deep copy of this map.
|
Comparator<? super K> |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
|
boolean |
containsKey(Object k)
Checks whether the given value is contained in
AbstractObject2FloatMap.keySet(). |
boolean |
containsValue(float v)
Checks whether the given value is contained in
AbstractObject2FloatMap.values(). |
K |
firstKey()
Returns the first key of this map in iteration order.
|
float |
getAndMoveToFirst(K k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.
|
float |
getAndMoveToLast(K k)
Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.
|
float |
getFloat(Object k)
Returns the value to which the given key is mapped.
|
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.
|
Object2FloatSortedMap<K> |
headMap(K to)
Returns a view of the portion of this sorted map whose keys are strictly less than
toKey. |
boolean |
isEmpty() |
ObjectSortedSet<K> |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
K |
lastKey()
Returns the last key of this map in iteration order.
|
Object2FloatSortedMap.FastSortedEntrySet<K> |
object2FloatEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map.
|
float |
put(K k,
float v)
Adds a pair to the map.
|
Float |
put(K ok,
Float ov)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
putAndMoveToFirst(K k,
float v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.
|
float |
putAndMoveToLast(K k,
float v)
Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.
|
boolean |
rehash()
Deprecated.
A no-op.
|
Float |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning
null on a missing key. |
float |
removeFirstFloat()
Removes the mapping associated with the first key in iteration order.
|
float |
removeFloat(Object k)
Removes the mapping with the given key.
|
float |
removeLastFloat()
Removes the mapping associated with the last key in iteration order.
|
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists.
|
Hash.Strategy<K> |
strategy()
Returns the hashing strategy.
|
Object2FloatSortedMap<K> |
subMap(K from,
K to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Object2FloatSortedMap<K> |
tailMap(K from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to
fromKey. |
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.
|
FloatCollection |
values()
Returns a type-specific collection view of the values contained in this map.
|
entrySetcontainsValue, equals, putAll, toStringdefaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsValue, equals, get, putAllpublic Object2FloatLinkedOpenCustomHashMap(int expected,
float f,
Hash.Strategy<K> 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 set.f - the load factor.strategy - the strategy.public Object2FloatLinkedOpenCustomHashMap(int expected,
Hash.Strategy<K> strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash map.strategy - the strategy.public Object2FloatLinkedOpenCustomHashMap(Hash.Strategy<K> strategy)
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.strategy - the strategy.public Object2FloatLinkedOpenCustomHashMap(Map<? extends K,? extends Float> m, float f, Hash.Strategy<K> strategy)
m - a Map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Object2FloatLinkedOpenCustomHashMap(Map<? extends K,? extends Float> m, Hash.Strategy<K> 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 Object2FloatLinkedOpenCustomHashMap(Object2FloatMap<K> m, float f, Hash.Strategy<K> strategy)
m - a type-specific map to be copied into the new hash map.f - the load factor.strategy - the strategy.public Object2FloatLinkedOpenCustomHashMap(Object2FloatMap<K> m, Hash.Strategy<K> 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 Object2FloatLinkedOpenCustomHashMap(K[] k, float[] v, float f, Hash.Strategy<K> 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 Object2FloatLinkedOpenCustomHashMap(K[] k, float[] v, Hash.Strategy<K> 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 Hash.Strategy<K> strategy()
public float put(K k, float v)
Object2FloatFunctionput in interface Object2FloatFunction<K>put in class AbstractObject2FloatFunction<K>k - the key.v - the value.Function.put(Object,Object)public Float put(K ok, Float ov)
AbstractObject2FloatFunctionnull 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 float add(K k, float 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 float addTo(K k, float 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 float removeFloat(Object k)
Object2FloatFunctionremoveFloat in interface Object2FloatFunction<K>removeFloat in class AbstractObject2FloatFunction<K>Function.remove(Object)public Float remove(Object ok)
AbstractObject2FloatFunctionnull 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 float removeFirstFloat()
NoSuchElementException - is this map is empty.public float removeLastFloat()
NoSuchElementException - is this map is empty.public float getAndMoveToFirst(K k)
k - the key.public float getAndMoveToLast(K k)
k - the key.public float putAndMoveToFirst(K k, float v)
k - the key.v - the value.public float putAndMoveToLast(K k, float v)
k - the key.v - the value.public float getFloat(Object k)
Object2FloatFunctiongetFloat in interface Object2FloatFunction<K>k - the key.Function.get(Object)public boolean containsKey(Object k)
AbstractObject2FloatMapAbstractObject2FloatMap.keySet().containsKey in interface Function<K,Float>containsKey in interface Map<K,Float>containsKey in class AbstractObject2FloatMap<K>k - the key.key.Map.containsKey(Object)public boolean containsValue(float v)
AbstractObject2FloatMapAbstractObject2FloatMap.values().containsValue in interface Object2FloatMap<K>containsValue in class AbstractObject2FloatMap<K>Map.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 K firstKey()
public K lastKey()
public Comparator<? super K> comparator()
Object2FloatSortedMapNote that this specification strengthens the one given in SortedMap.comparator().
comparator in interface Object2FloatSortedMap<K>comparator in interface SortedMap<K,Float>SortedMap.comparator()public Object2FloatSortedMap<K> tailMap(K from)
Object2FloatSortedMapfromKey.
Note that this specification strengthens the one given in SortedMap.tailMap(Object).
tailMap in interface Object2FloatSortedMap<K>tailMap in interface SortedMap<K,Float>SortedMap.tailMap(Object)public Object2FloatSortedMap<K> headMap(K to)
Object2FloatSortedMaptoKey.
Note that this specification strengthens the one given in SortedMap.headMap(Object).
headMap in interface Object2FloatSortedMap<K>headMap in interface SortedMap<K,Float>SortedMap.headMap(Object)public Object2FloatSortedMap<K> subMap(K from, K to)
Object2FloatSortedMapfromKey, inclusive, to toKey, exclusive.
Note that this specification strengthens the one given in SortedMap.subMap(Object,Object).
subMap in interface Object2FloatSortedMap<K>subMap in interface SortedMap<K,Float>SortedMap.subMap(Object,Object)public Object2FloatSortedMap.FastSortedEntrySet<K> object2FloatEntrySet()
Object2FloatSortedMapobject2FloatEntrySet in interface Object2FloatMap<K>object2FloatEntrySet in interface Object2FloatSortedMap<K>Object2FloatSortedMap.entrySet()public ObjectSortedSet<K> keySet()
AbstractObject2FloatSortedMapThe view is backed by the sorted set returned by AbstractObject2FloatSortedMap.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 Object2FloatMap<K>keySet in interface Object2FloatSortedMap<K>keySet in interface Map<K,Float>keySet in interface SortedMap<K,Float>keySet in class AbstractObject2FloatSortedMap<K>Map.keySet()public FloatCollection values()
AbstractObject2FloatSortedMapThe view is backed by the sorted set returned by AbstractObject2FloatSortedMap.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 Object2FloatMap<K>values in interface Object2FloatSortedMap<K>values in interface Map<K,Float>values in interface SortedMap<K,Float>values in class AbstractObject2FloatSortedMap<K>Map.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 Object2FloatLinkedOpenCustomHashMap<K> 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.