|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction<V>
it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap<V>
it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap<V>
it.unimi.dsi.fastutil.doubles.Double2ReferenceLinkedOpenHashMap<V>
public class Double2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
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 AbstractDouble2ReferenceSortedMap.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 FormNested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap |
---|
AbstractDouble2ReferenceSortedMap.KeySetIterator<V>, AbstractDouble2ReferenceSortedMap.ValuesCollection, AbstractDouble2ReferenceSortedMap.ValuesIterator<V> |
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap |
---|
AbstractDouble2ReferenceMap.BasicEntry<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash |
---|
Hash.Strategy<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceSortedMap |
---|
Double2ReferenceSortedMap.FastSortedEntrySet<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap |
---|
Double2ReferenceMap.Entry<V>, Double2ReferenceMap.FastEntrySet<V> |
Field Summary | |
---|---|
protected Double2ReferenceSortedMap.FastSortedEntrySet<V> |
entries
Cached set of entries. |
protected float |
f
The acceptable load factor. |
protected int |
first
The index of the first entry in iteration order. |
protected double[] |
key
The array of keys. |
protected DoubleSortedSet |
keys
Cached set of keys. |
protected int |
last
The index of the last entry in iteration order. |
protected long[] |
link
For each entry, the next and the previous entry in iteration order, stored as ((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL) . |
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 V[] |
value
The array of values. |
protected ReferenceCollection<V> |
values
Cached collection of values. |
Fields inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction |
---|
defRetValue |
Fields inherited from interface it.unimi.dsi.fastutil.Hash |
---|
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR |
Constructor Summary | |
---|---|
Double2ReferenceLinkedOpenHashMap()
Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Double2ReferenceLinkedOpenHashMap(double[] k,
V[] v)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
|
Double2ReferenceLinkedOpenHashMap(double[] k,
V[] v,
float f)
Creates a new hash map using the elements of two parallel arrays. |
|
Double2ReferenceLinkedOpenHashMap(Double2ReferenceMap<V> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
|
Double2ReferenceLinkedOpenHashMap(Double2ReferenceMap<V> m,
float f)
Creates a new hash map copying a given type-specific one. |
|
Double2ReferenceLinkedOpenHashMap(int expected)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Double2ReferenceLinkedOpenHashMap(int expected,
float f)
Creates a new hash map. |
|
Double2ReferenceLinkedOpenHashMap(Map<? extends Double,? extends V> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
|
Double2ReferenceLinkedOpenHashMap(Map<? extends Double,? extends V> m,
float f)
Creates a new hash map copying a given one. |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Double2ReferenceLinkedOpenHashMap<V> |
clone()
Returns a deep copy of this map. |
DoubleComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(double k)
Checks whether the given value is contained in AbstractDouble2ReferenceMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractDouble2ReferenceMap.values() . |
Double2ReferenceSortedMap.FastSortedEntrySet<V> |
double2ReferenceEntrySet()
Returns a type-specific sorted-set view of the mappings contained in this map. |
double |
firstDoubleKey()
Returns the first key of this map in iteration order. |
protected void |
fixPointers(int i)
Modifies the link vector so that the given entry is removed. |
protected void |
fixPointers(int s,
int d)
Modifies the link vector for a shift from s to d. |
V |
get(double k)
Returns the value to which the given key is mapped. |
V |
get(Double ok)
|
V |
getAndMoveToFirst(double 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. |
V |
getAndMoveToLast(double 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. |
Double2ReferenceSortedMap<V> |
headMap(double to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
boolean |
isEmpty()
|
DoubleSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map. |
double |
lastDoubleKey()
Returns the last key of this map in iteration order. |
V |
put(double k,
V v)
Adds a pair to the map. |
V |
put(Double ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
V |
putAndMoveToFirst(double k,
V v)
Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order. |
V |
putAndMoveToLast(double k,
V 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. |
protected void |
rehash(int newN)
Resizes the map. |
V |
remove(double k)
Removes the mapping with the given key. |
V |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
V |
removeFirst()
Removes the mapping associated with the first key in iteration order. |
V |
removeLast()
Removes the mapping associated with the last key in iteration order. |
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. |
Double2ReferenceSortedMap<V> |
subMap(double from,
double to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Double2ReferenceSortedMap<V> |
tailMap(double 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. |
ReferenceCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap |
---|
equals, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, equals, get, putAll |
Field Detail |
---|
public static final long serialVersionUID
protected transient double[] key
protected transient V[] 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 Double2ReferenceSortedMap.FastSortedEntrySet<V> entries
protected transient volatile DoubleSortedSet keys
protected transient volatile ReferenceCollection<V> values
protected transient int first
size
is nonzero; otherwise, it contains -1.
protected transient int last
size
is nonzero; otherwise, it contains -1.
protected transient long[] link
((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL)
.
The first entry contains predecessor -1, and the last entry
contains successor -1.
Constructor Detail |
---|
public Double2ReferenceLinkedOpenHashMap(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 Double2ReferenceLinkedOpenHashMap(int expected)
Hash.DEFAULT_LOAD_FACTOR
as load factor.
expected
- the expected number of elements in the hash map.public Double2ReferenceLinkedOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE
entries
and Hash.DEFAULT_LOAD_FACTOR
as load factor.
public Double2ReferenceLinkedOpenHashMap(Map<? extends Double,? extends V> m, float f)
m
- a Map
to be copied into the new hash map.f
- the load factor.public Double2ReferenceLinkedOpenHashMap(Map<? extends Double,? extends V> m)
Hash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.
m
- a Map
to be copied into the new hash map.public Double2ReferenceLinkedOpenHashMap(Double2ReferenceMap<V> m, float f)
m
- a type-specific map to be copied into the new hash map.f
- the load factor.public Double2ReferenceLinkedOpenHashMap(Double2ReferenceMap<V> 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 Double2ReferenceLinkedOpenHashMap(double[] k, V[] 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 Double2ReferenceLinkedOpenHashMap(double[] k, V[] 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.Method Detail |
---|
public V put(double k, V v)
Double2ReferenceFunction
put
in interface Double2ReferenceFunction<V>
put
in class AbstractDouble2ReferenceFunction<V>
k
- the key.v
- the value.
Function.put(Object,Object)
public V put(Double ok, V ov)
AbstractDouble2ReferenceFunction
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<Double,V>
put
in interface Map<Double,V>
put
in class AbstractDouble2ReferenceFunction<V>
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
protected final int shiftKeys(int pos)
pos
- a starting position.
public V remove(double k)
Double2ReferenceFunction
remove
in interface Double2ReferenceFunction<V>
remove
in class AbstractDouble2ReferenceFunction<V>
Function.remove(Object)
public V remove(Object ok)
AbstractDouble2ReferenceFunction
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.
remove
in interface Function<Double,V>
remove
in interface Map<Double,V>
remove
in class AbstractDouble2ReferenceFunction<V>
null
if no value was present for the given key.Map.remove(Object)
public V removeFirst()
NoSuchElementException
- is this map is empty.public V removeLast()
NoSuchElementException
- is this map is empty.public V getAndMoveToFirst(double k)
k
- the key.
public V getAndMoveToLast(double k)
k
- the key.
public V putAndMoveToFirst(double k, V v)
k
- the key.v
- the value.
public V putAndMoveToLast(double k, V v)
k
- the key.v
- the value.
public V get(Double ok)
public V get(double k)
Double2ReferenceFunction
get
in interface Double2ReferenceFunction<V>
k
- the key.
Function.get(Object)
public boolean containsKey(double k)
AbstractDouble2ReferenceMap
AbstractDouble2ReferenceMap.keySet()
.
containsKey
in interface Double2ReferenceFunction<V>
containsKey
in class AbstractDouble2ReferenceMap<V>
Function.containsKey(Object)
public boolean containsValue(Object v)
AbstractDouble2ReferenceMap
AbstractDouble2ReferenceMap.values()
.
containsValue
in interface Map<Double,V>
containsValue
in class AbstractDouble2ReferenceMap<V>
public void clear()
Function
clear
in interface Function<Double,V>
clear
in interface Map<Double,V>
clear
in class AbstractDouble2ReferenceFunction<V>
Map.clear()
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
size
in interface Function<Double,V>
size
in interface Map<Double,V>
public boolean isEmpty()
isEmpty
in interface Map<Double,V>
isEmpty
in class AbstractDouble2ReferenceMap<V>
@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)
protected void fixPointers(int i)
link
vector so that the given entry is removed.
If the given entry is the first or the last one, this method will complete in constant time; otherwise, it will have to search for the given entry.
i
- the index of an entry.protected void fixPointers(int s, int d)
link
vector for a shift from s to d.
If the given entry is the first or the last one, this method will complete in constant time; otherwise, it will have to search for the given entry.
s
- the source position.d
- the destination position.public double firstDoubleKey()
firstDoubleKey
in interface Double2ReferenceSortedMap<V>
SortedMap.firstKey()
public double lastDoubleKey()
lastDoubleKey
in interface Double2ReferenceSortedMap<V>
SortedMap.lastKey()
public DoubleComparator comparator()
Double2ReferenceSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Double2ReferenceSortedMap<V>
comparator
in interface SortedMap<Double,V>
SortedMap.comparator()
public Double2ReferenceSortedMap<V> tailMap(double from)
Double2ReferenceSortedMap
fromKey
.
tailMap
in interface Double2ReferenceSortedMap<V>
SortedMap.tailMap(Object)
public Double2ReferenceSortedMap<V> headMap(double to)
Double2ReferenceSortedMap
toKey
.
headMap
in interface Double2ReferenceSortedMap<V>
SortedMap.headMap(Object)
public Double2ReferenceSortedMap<V> subMap(double from, double to)
Double2ReferenceSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Double2ReferenceSortedMap<V>
SortedMap.subMap(Object,Object)
public Double2ReferenceSortedMap.FastSortedEntrySet<V> double2ReferenceEntrySet()
Double2ReferenceSortedMap
double2ReferenceEntrySet
in interface Double2ReferenceMap<V>
double2ReferenceEntrySet
in interface Double2ReferenceSortedMap<V>
Double2ReferenceSortedMap.entrySet()
public DoubleSortedSet keySet()
AbstractDouble2ReferenceSortedMap
The view is backed by the sorted set returned by AbstractDouble2ReferenceSortedMap.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 Double2ReferenceMap<V>
keySet
in interface Double2ReferenceSortedMap<V>
keySet
in interface Map<Double,V>
keySet
in interface SortedMap<Double,V>
keySet
in class AbstractDouble2ReferenceSortedMap<V>
Map.keySet()
public ReferenceCollection<V> values()
AbstractDouble2ReferenceSortedMap
The view is backed by the sorted set returned by AbstractDouble2ReferenceSortedMap.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 Double2ReferenceMap<V>
values
in interface Double2ReferenceSortedMap<V>
values
in interface Map<Double,V>
values
in interface SortedMap<Double,V>
values
in class AbstractDouble2ReferenceSortedMap<V>
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()
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 Double2ReferenceLinkedOpenHashMap<V> 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.
clone
in class Object
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 Map<Double,V>
hashCode
in class AbstractDouble2ReferenceMap<V>
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |