public class Float2DoubleLinkedOpenHashMap extends AbstractFloat2DoubleSortedMap 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, 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.
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 FormAbstractFloat2DoubleMap.BasicEntryHash.Strategy<K>Float2DoubleSortedMap.FastSortedEntrySetFloat2DoubleMap.Entry, Float2DoubleMap.FastEntrySetDEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
Float2DoubleLinkedOpenHashMap()
Creates a new hash map with initial expected
Hash.DEFAULT_INITIAL_SIZE entries and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
Float2DoubleLinkedOpenHashMap(float[] k,
double[] v)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load
factor using the elements of two parallel arrays. |
Float2DoubleLinkedOpenHashMap(float[] k,
double[] v,
float f)
Creates a new hash map using the elements of two parallel arrays.
|
Float2DoubleLinkedOpenHashMap(Float2DoubleMap m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given type-specific one. |
Float2DoubleLinkedOpenHashMap(Float2DoubleMap m,
float f)
Creates a new hash map copying a given type-specific one.
|
Float2DoubleLinkedOpenHashMap(int expected)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load
factor. |
Float2DoubleLinkedOpenHashMap(int expected,
float f)
Creates a new hash map.
|
Float2DoubleLinkedOpenHashMap(Map<? extends Float,? extends Double> m)
Creates a new hash map with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given one. |
Float2DoubleLinkedOpenHashMap(Map<? extends Float,? extends Double> m,
float f)
Creates a new hash map copying a given one.
|
| Modifier and Type | Method and Description |
|---|---|
double |
addTo(float k,
double incr)
Adds an increment to value currently associated with a key.
|
void |
clear()
Removes all associations from this function (optional operation).
|
Float2DoubleLinkedOpenHashMap |
clone()
Returns a deep copy of this map.
|
FloatComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it
uses its keys' natural ordering.
|
boolean |
containsKey(float k)
Checks whether the given value is contained in
AbstractFloat2DoubleMap.keySet(). |
boolean |
containsValue(double v)
Checks whether the given value is contained in
AbstractFloat2DoubleMap.values(). |
float |
firstFloatKey()
Returns the first key of this map in iteration order.
|
Float2DoubleSortedMap.FastSortedEntrySet |
float2DoubleEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this
map.
|
double |
get(float k)
Returns the value to which the given key is mapped.
|
Double |
get(Float ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
getAndMoveToFirst(float 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.
|
double |
getAndMoveToLast(float 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.
|
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.
|
Float2DoubleSortedMap |
headMap(float to)
Returns a view of the portion of this sorted map whose keys are strictly
less than
toKey. |
boolean |
isEmpty() |
FloatSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map.
|
float |
lastFloatKey()
Returns the last key of this map in iteration order.
|
double |
put(float k,
double v)
Adds a pair to the map.
|
Double |
put(Float ok,
Double ov)
Deprecated.
Please use the corresponding type-specific method instead.
|
void |
putAll(Map<? extends Float,? extends Double> m)
Puts all pairs in the given map.
|
double |
putAndMoveToFirst(float k,
double v)
Adds a pair to the map; if the key is already present, it is moved to the
first position of the iteration order.
|
double |
putAndMoveToLast(float k,
double 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.
|
double |
remove(float k)
Removes the mapping with the given key.
|
Double |
remove(Object ok)
Deprecated.
Please use the corresponding type-specific method instead.
|
double |
removeFirstDouble()
Removes the mapping associated with the first key in iteration order.
|
double |
removeLastDouble()
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.
|
Float2DoubleSortedMap |
subMap(float from,
float to)
Returns a view of the portion of this sorted map whose keys range from
fromKey, inclusive, to toKey, exclusive. |
Float2DoubleSortedMap |
tailMap(float 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.
|
DoubleCollection |
values()
Returns a type-specific collection view of the values contained in this
map.
|
entrySet, firstKey, headMap, lastKey, subMap, tailMapcontainsValue, equals, toStringcontainsKey, defaultReturnValue, defaultReturnValue, getdefaultReturnValue, defaultReturnValuecontainsKey, getcompute, computeIfAbsent, computeIfPresent, containsKey, containsValue, equals, forEach, get, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic Float2DoubleLinkedOpenHashMap(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 Float2DoubleLinkedOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR as load
factor.expected - the expected number of elements in the hash map.public Float2DoubleLinkedOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries and
Hash.DEFAULT_LOAD_FACTOR as load factor.public Float2DoubleLinkedOpenHashMap(Map<? extends Float,? extends Double> m, float f)
m - a Map to be copied into the new hash map.f - the load factor.public Float2DoubleLinkedOpenHashMap(Map<? extends Float,? extends Double> m)
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given one.m - a Map to be copied into the new hash map.public Float2DoubleLinkedOpenHashMap(Float2DoubleMap m, float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Float2DoubleLinkedOpenHashMap(Float2DoubleMap 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 Float2DoubleLinkedOpenHashMap(float[] k,
double[] 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 Float2DoubleLinkedOpenHashMap(float[] k,
double[] 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 void putAll(Map<? extends Float,? extends Double> m)
public double put(float k,
double v)
Float2DoubleFunctionput in interface Float2DoubleFunctionput in class AbstractFloat2DoubleFunctionk - the key.v - the value.Function.put(Object,Object)@Deprecated public Double put(Float ok, Double ov)
null 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 Function<Float,Double>put in interface Map<Float,Double>put in class AbstractFloat2DoubleFunctionok - the key.ov - the value.null if no value was present for the given key.Map.put(Object,Object)public double addTo(float k,
double 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 double remove(float k)
Float2DoubleFunctionremove in interface Float2DoubleFunctionremove in class AbstractFloat2DoubleFunctionk - the key.Function.remove(Object)@Deprecated public Double remove(Object ok)
null 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 double removeFirstDouble()
NoSuchElementException - is this map is empty.public double removeLastDouble()
NoSuchElementException - is this map is empty.public double getAndMoveToFirst(float k)
k - the key.public double getAndMoveToLast(float k)
k - the key.public double putAndMoveToFirst(float k,
double v)
k - the key.v - the value.public double putAndMoveToLast(float k,
double v)
k - the key.v - the value.@Deprecated public Double get(Float ok)
public double get(float k)
Float2DoubleFunctionget in interface Float2DoubleFunctionk - the key.Function.get(Object)public boolean containsKey(float k)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.keySet().containsKey in interface Float2DoubleFunctioncontainsKey in class AbstractFloat2DoubleMapFunction.containsKey(Object)public boolean containsValue(double v)
AbstractFloat2DoubleMapAbstractFloat2DoubleMap.values().containsValue in interface Float2DoubleMapcontainsValue in class AbstractFloat2DoubleMapMap.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 float firstFloatKey()
firstFloatKey in interface Float2DoubleSortedMapSortedMap.firstKey()public float lastFloatKey()
lastFloatKey in interface Float2DoubleSortedMapSortedMap.lastKey()public FloatComparator comparator()
Float2DoubleSortedMap
Note that this specification strengthens the one given in
SortedMap.comparator().
comparator in interface Float2DoubleSortedMapcomparator in interface SortedMap<Float,Double>SortedMap.comparator()public Float2DoubleSortedMap tailMap(float from)
Float2DoubleSortedMapfromKey.tailMap in interface Float2DoubleSortedMapSortedMap.tailMap(Object)public Float2DoubleSortedMap headMap(float to)
Float2DoubleSortedMaptoKey.headMap in interface Float2DoubleSortedMapSortedMap.headMap(Object)public Float2DoubleSortedMap subMap(float from, float to)
Float2DoubleSortedMapfromKey, inclusive, to toKey, exclusive.subMap in interface Float2DoubleSortedMapSortedMap.subMap(Object,Object)public Float2DoubleSortedMap.FastSortedEntrySet float2DoubleEntrySet()
Float2DoubleSortedMapfloat2DoubleEntrySet in interface Float2DoubleMapfloat2DoubleEntrySet in interface Float2DoubleSortedMapFloat2DoubleSortedMap.entrySet()public FloatSortedSet keySet()
AbstractFloat2DoubleSortedMap
The view is backed by the sorted set returned by AbstractFloat2DoubleSortedMap.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 Float2DoubleMapkeySet in interface Float2DoubleSortedMapkeySet in interface Map<Float,Double>keySet in interface SortedMap<Float,Double>keySet in class AbstractFloat2DoubleSortedMapMap.keySet()public DoubleCollection values()
AbstractFloat2DoubleSortedMap
The view is backed by the sorted set returned by AbstractFloat2DoubleSortedMap.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 Float2DoubleMapvalues in interface Float2DoubleSortedMapvalues in interface Map<Float,Double>values in interface SortedMap<Float,Double>values in class AbstractFloat2DoubleSortedMapMap.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 Float2DoubleLinkedOpenHashMap 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.