Class ObjectDoubleWormMap<KType>
- java.lang.Object
-
- com.carrotsearch.hppc.ObjectDoubleWormMap<KType>
-
- All Implemented Interfaces:
Accountable
,ObjectDoubleAssociativeContainer<KType>
,ObjectDoubleMap<KType>
,Preallocable
,java.lang.Cloneable
,java.lang.Iterable<ObjectDoubleCursor<KType>>
@Generated(date="2020-09-07T17:20:15+0200", value="KTypeVTypeWormMap.java") public class ObjectDoubleWormMap<KType> extends java.lang.Object implements ObjectDoubleMap<KType>, Preallocable, java.lang.Cloneable, Accountable
A hash map ofObject
todouble
, implemented using Worm Hashing strategy.This strategy is appropriate for a medium sized map (less than 2M entries). It takes more time to put entries in the map because it maintains chains of entries having the same hash. Then the lookup speed is fast even if the map is heavy loaded or hashes are clustered. On average it takes slightly less memory than
ObjectDoubleHashMap
: slightly heavier but the load factor is higher (it varies around 80%) so it enlarges later.- See Also:
- HPPC interfaces diagram
-
-
Field Summary
Fields Modifier and Type Field Description protected int
iterationSeed
Seed used to ensure the hash iteration order is different from an iteration to another.java.lang.Object[]
keys
The array holding keys.byte[]
next
abs(next[i])=offset
to next chained entry index.protected int
size
Map size (number of entries).double[]
values
The array holding values.
-
Constructor Summary
Constructors Constructor Description ObjectDoubleWormMap()
New instance with sane defaults.ObjectDoubleWormMap(int expectedElements)
New instance with the provided defaults.ObjectDoubleWormMap(ObjectDoubleAssociativeContainer<? extends KType> container)
Creates a new instance from all key-value pairs of another container.
-
Method Summary
All Methods Static Methods Instance Methods Concrete Methods Modifier and Type Method Description double
addTo(KType key, double additionValue)
An equivalent of callingvoid
clear()
Clear all keys and values in the container.ObjectDoubleWormMap<KType>
clone()
Clones this map.boolean
containsKey(KType key)
Returnstrue
if this container has an association to a value for the given key.void
ensureCapacity(int expectedElements)
Ensure this container can hold at least the given number of elements without resizing its buffers.boolean
equals(java.lang.Object o)
Compares the specified object with this set for equality.protected boolean
equals(java.lang.Object v1, java.lang.Object v2)
<T extends ObjectDoubleProcedure<? super KType>>
TforEach(T procedure)
Applies a given procedure to all keys-value pairs in this container.static <KType> ObjectDoubleWormMap<KType>
from(KType[] keys, double[] values)
Creates a new instance from two index-aligned arrays of key-value pairs.double
get(KType key)
double
getOrDefault(KType key, double defaultValue)
int
hashCode()
protected int
hashKey(KType key)
Returns a hash code for the given key.boolean
indexExists(int index)
double
indexGet(int index)
Returns the value associated with an existing key.void
indexInsert(int index, KType key, double value)
Inserts a key-value pair for a key that is not present in the map.int
indexOf(KType key)
Returns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic).double
indexReplace(int index, double newValue)
Replaces the value associated with an existing key and returns any previous value stored for that key.boolean
isEmpty()
java.util.Iterator<ObjectDoubleCursor<KType>>
iterator()
Returns a cursor over the entries (key-value pairs) in this map.com.carrotsearch.hppc.ObjectDoubleWormMap.KeysContainer
keys()
Returns a collection of keys of this container.protected int
nextIterationSeed()
Provides the next iteration seed used to build the iteration starting slot and offset increment.double
noValue()
The value returned when there is no value associated to a key in this map.double
put(KType key, double value)
Place a given key and value in the container.int
putAll(ObjectDoubleAssociativeContainer<? extends KType> container)
Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.int
putAll(java.lang.Iterable<? extends ObjectDoubleCursor<? extends KType>> iterable)
Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.boolean
putIfAbsent(KType key, double value)
double
putOrAdd(KType key, double putValue, double incrementValue)
Ifkey
exists,putValue
is inserted into the map, otherwise any existing value is incremented byadditionValue
.long
ramBytesAllocated()
Allocated memory estimationlong
ramBytesUsed()
Bytes that is actually been usedvoid
release()
Removes all elements from the collection and additionally releases any internal buffers.double
remove(KType key)
Remove all values at the given key.int
removeAll(ObjectContainer<? super KType> other)
Removes all keys (and associated values) present in a given container.int
removeAll(ObjectDoublePredicate<? super KType> predicate)
Removes all keys (and associated values) for which the predicate returnstrue
.int
removeAll(ObjectPredicate<? super KType> predicate)
Removes all keys (and associated values) for which the predicate returnstrue
.int
size()
java.lang.String
toString()
DoubleCollection
values()
Returns a container view of all values present in this container.java.lang.String
visualizeKeyDistribution(int characters)
Visually depict the distribution of keys.
-
-
-
Field Detail
-
keys
public java.lang.Object[] keys
The array holding keys.
-
values
public double[] values
The array holding values.
-
next
public byte[] next
abs(next[i])=offset
to next chained entry index.next[i]=0
for free bucket.The offset is always forward, and the array is considered circular, meaning that an entry at the end of the array may point to an entry at the beginning with a positive offset.
The offset is always forward, but the sign of the offset encodes head/tail of chain.
next
[i] > 0 for the first head-of-chain entry (within [1,WormUtil.maxOffset(int)
]),next
[i] < 0 for the subsequent tail-of-chain entries (within [-WormUtil.maxOffset(int)
,-1]. For the last entry in the chain,abs(next[i])=
WormUtil.END_OF_CHAIN
.
-
size
protected int size
Map size (number of entries).
-
iterationSeed
protected int iterationSeed
Seed used to ensure the hash iteration order is different from an iteration to another.
-
-
Constructor Detail
-
ObjectDoubleWormMap
public ObjectDoubleWormMap()
New instance with sane defaults.
-
ObjectDoubleWormMap
public ObjectDoubleWormMap(int expectedElements)
New instance with the provided defaults.There is no load factor parameter as this map enlarges automatically. In practice the load factor varies around 80% (between 75% and 90%). The load factor is 100% for tiny maps.
- Parameters:
expectedElements
- The expected number of elements. The capacity of the map is calculated based on it.
-
ObjectDoubleWormMap
public ObjectDoubleWormMap(ObjectDoubleAssociativeContainer<? extends KType> container)
Creates a new instance from all key-value pairs of another container.
-
-
Method Detail
-
from
public static <KType> ObjectDoubleWormMap<KType> from(KType[] keys, double[] values)
Creates a new instance from two index-aligned arrays of key-value pairs.
-
clone
public ObjectDoubleWormMap<KType> clone()
Clones this map. The cloning operation is efficient because it copies directly the internal arrays, without having to put entries in the cloned map. The cloned map has the same entries and the same capacity as this map.- Overrides:
clone
in classjava.lang.Object
- Returns:
- A shallow copy of this map.
-
noValue
public double noValue()
The value returned when there is no value associated to a key in this map. This method can be extended to change it.
-
size
public int size()
- Specified by:
size
in interfaceObjectDoubleAssociativeContainer<KType>
- Returns:
- Returns the current size (number of assigned keys) in the container.
-
isEmpty
public boolean isEmpty()
- Specified by:
isEmpty
in interfaceObjectDoubleAssociativeContainer<KType>
- Returns:
- Return
true
if this hash map contains no assigned keys.
-
get
public double get(KType key)
- Specified by:
get
in interfaceObjectDoubleMap<KType>
- Returns:
- Returns the value associated with the given key or the default
value for the value type, if the key is not associated with any
value. For numeric value types, this default value is 0, for
object types it is
null
.
-
getOrDefault
public double getOrDefault(KType key, double defaultValue)
- Specified by:
getOrDefault
in interfaceObjectDoubleMap<KType>
- Returns:
- Returns the value associated with the given key or the provided default value if the key is not associated with any value.
-
put
public double put(KType key, double value)
Description copied from interface:ObjectDoubleMap
Place a given key and value in the container.- Specified by:
put
in interfaceObjectDoubleMap<KType>
- Returns:
- The value previously stored under the given key in the map is returned.
-
putAll
public int putAll(ObjectDoubleAssociativeContainer<? extends KType> container)
Description copied from interface:ObjectDoubleMap
Puts all keys from another container to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAll
in interfaceObjectDoubleMap<KType>
- Returns:
- Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
-
putAll
public int putAll(java.lang.Iterable<? extends ObjectDoubleCursor<? extends KType>> iterable)
Description copied from interface:ObjectDoubleMap
Puts all keys from an iterable cursor to this map, replacing the values of existing keys, if such keys are present.- Specified by:
putAll
in interfaceObjectDoubleMap<KType>
- Returns:
- Returns the number of keys added to the map as a result of this call (not previously present in the map). Values of existing keys are overwritten.
-
putOrAdd
public double putOrAdd(KType key, double putValue, double incrementValue)
Description copied from interface:ObjectDoubleMap
Ifkey
exists,putValue
is inserted into the map, otherwise any existing value is incremented byadditionValue
.- Specified by:
putOrAdd
in interfaceObjectDoubleMap<KType>
- Parameters:
key
- The key of the value to adjust.putValue
- The value to put ifkey
does not exist.incrementValue
- The value to add to the existing value ifkey
exists.- Returns:
- Returns the current value associated with
key
(after changes).
-
addTo
public double addTo(KType key, double additionValue)
Description copied from interface:ObjectDoubleMap
An equivalent of callingputOrAdd(key, additionValue, additionValue);
- Specified by:
addTo
in interfaceObjectDoubleMap<KType>
- Parameters:
key
- The key of the value to adjust.additionValue
- The value to put or add to the existing value ifkey
exists.- Returns:
- Returns the current value associated with
key
(after changes).
-
putIfAbsent
public boolean putIfAbsent(KType key, double value)
- Parameters:
key
- The key of the value to check.value
- The value to put ifkey
does not exist.- Returns:
true
ifkey
did not exist andvalue
was placed in the map.
-
remove
public double remove(KType key)
Description copied from interface:ObjectDoubleMap
Remove all values at the given key. The default value for the key type is returned if the value does not exist in the map.- Specified by:
remove
in interfaceObjectDoubleMap<KType>
-
removeAll
public int removeAll(ObjectContainer<? super KType> other)
Description copied from interface:ObjectDoubleAssociativeContainer
Removes all keys (and associated values) present in a given container. An alias to:keys().removeAll(container)
but with no additional overhead.- Specified by:
removeAll
in interfaceObjectDoubleAssociativeContainer<KType>
- Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
public int removeAll(ObjectPredicate<? super KType> predicate)
Description copied from interface:ObjectDoubleAssociativeContainer
Removes all keys (and associated values) for which the predicate returnstrue
.- Specified by:
removeAll
in interfaceObjectDoubleAssociativeContainer<KType>
- Returns:
- Returns the number of elements actually removed as a result of this call.
-
removeAll
public int removeAll(ObjectDoublePredicate<? super KType> predicate)
Description copied from interface:ObjectDoubleAssociativeContainer
Removes all keys (and associated values) for which the predicate returnstrue
.- Specified by:
removeAll
in interfaceObjectDoubleAssociativeContainer<KType>
- Returns:
- Returns the number of elements actually removed as a result of this call.
-
forEach
public <T extends ObjectDoubleProcedure<? super KType>> T forEach(T procedure)
Description copied from interface:ObjectDoubleAssociativeContainer
Applies a given procedure to all keys-value pairs in this container. Returns the argument (any subclass ofObjectDoubleProcedure
. This lets the caller to call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values, for example.- Specified by:
forEach
in interfaceObjectDoubleAssociativeContainer<KType>
-
forEach
public <T extends ObjectDoublePredicate<? super KType>> T forEach(T predicate)
Description copied from interface:ObjectDoubleAssociativeContainer
Applies a given predicate to all keys-value pairs in this container. Returns the argument (any subclass ofObjectDoublePredicate
. This lets the caller to call methods of the argument by chaining the call (even if the argument is an anonymous type) to retrieve computed values, for example. The iteration is continued as long as the predicate returnstrue
.- Specified by:
forEach
in interfaceObjectDoubleAssociativeContainer<KType>
-
keys
public com.carrotsearch.hppc.ObjectDoubleWormMap.KeysContainer keys()
Description copied from interface:ObjectDoubleAssociativeContainer
Returns a collection of keys of this container. The returned collection is a view over the key set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.- Specified by:
keys
in interfaceObjectDoubleAssociativeContainer<KType>
-
values
public DoubleCollection values()
Description copied from interface:ObjectDoubleAssociativeContainer
Returns a container view of all values present in this container. The returned collection is a view over the key set and any modifications (if allowed) introduced to the collection will propagate to the associative container immediately.- Specified by:
values
in interfaceObjectDoubleAssociativeContainer<KType>
-
iterator
public java.util.Iterator<ObjectDoubleCursor<KType>> iterator()
Description copied from interface:ObjectDoubleAssociativeContainer
Returns a cursor over the entries (key-value pairs) in this map. The iterator is implemented as a cursor and it returns the same cursor instance on every call toIterator.next()
. To read the current key and value use the cursor's public fields. An example is shown below.for (IntShortCursor c : intShortMap) { System.out.println("index=" + c.index + " key=" + c.key + " value=" + c.value); }
The
index
field inside the cursor gives the internal index inside the container's implementation. The interpretation of this index depends on to the container.- Specified by:
iterator
in interfacejava.lang.Iterable<KType>
- Specified by:
iterator
in interfaceObjectDoubleAssociativeContainer<KType>
-
containsKey
public boolean containsKey(KType key)
Description copied from interface:ObjectDoubleAssociativeContainer
Returnstrue
if this container has an association to a value for the given key.- Specified by:
containsKey
in interfaceObjectDoubleAssociativeContainer<KType>
-
clear
public void clear()
Description copied from interface:ObjectDoubleMap
Clear all keys and values in the container.- Specified by:
clear
in interfaceObjectDoubleMap<KType>
- See Also:
ObjectDoubleMap.release()
-
release
public void release()
Description copied from interface:ObjectDoubleMap
Removes all elements from the collection and additionally releases any internal buffers. Typically, if the object is to be reused, a simpleObjectDoubleMap.clear()
should be a better alternative since it'll avoid reallocation.- Specified by:
release
in interfaceObjectDoubleMap<KType>
- See Also:
ObjectDoubleMap.clear()
-
equals
public boolean equals(java.lang.Object o)
Description copied from interface:ObjectDoubleMap
Compares the specified object with this set for equality. Returnstrue
if and only if the specified object is also aObjectDoubleMap
and both objects contains exactly the same key-value pairs.- Specified by:
equals
in interfaceObjectDoubleMap<KType>
- Overrides:
equals
in classjava.lang.Object
-
equals
protected boolean equals(java.lang.Object v1, java.lang.Object v2)
-
hashCode
public int hashCode()
- Specified by:
hashCode
in interfaceObjectDoubleMap<KType>
- Overrides:
hashCode
in classjava.lang.Object
- Returns:
- A hash code of elements stored in the map. The hash code is defined as a sum of hash codes of keys and values stored within the set). Because sum is commutative, this ensures that different order of elements in a set does not affect the hash code.
-
hashKey
protected int hashKey(KType key)
Returns a hash code for the given key.
-
indexOf
public int indexOf(KType key)
Description copied from interface:ObjectDoubleMap
Returns a logical "index" of a given key that can be used to speed up follow-up value setters or getters in certain scenarios (conditional logic). The semantics of "indexes" are not strictly defined. Indexes may (and typically won't be) contiguous. The index is valid only between map modifications (it will not be affected by read-only operations like iteration or value retrievals).- Specified by:
indexOf
in interfaceObjectDoubleMap<KType>
- Parameters:
key
- The key to locate in the map.- Returns:
- A non-negative value of the logical "index" of the key in the map or a negative value if the key did not exist.
- See Also:
ObjectDoubleMap.indexExists(int)
,ObjectDoubleMap.indexGet(int)
,ObjectDoubleMap.indexInsert(int, KType, double)
,ObjectDoubleMap.indexReplace(int, double)
-
indexExists
public boolean indexExists(int index)
- Specified by:
indexExists
in interfaceObjectDoubleMap<KType>
- Parameters:
index
- The index of a given key, as returned fromObjectDoubleMap.indexOf(KType)
.- Returns:
- Returns
true
if the index corresponds to an existing key or false otherwise. This is equivalent to checking whether the index is a positive value (existing keys) or a negative value (non-existing keys). - See Also:
ObjectDoubleMap.indexOf(KType)
-
indexGet
public double indexGet(int index)
Description copied from interface:ObjectDoubleMap
Returns the value associated with an existing key.- Specified by:
indexGet
in interfaceObjectDoubleMap<KType>
- Parameters:
index
- The index of an existing key.- Returns:
- Returns the value currently associated with the key.
- See Also:
ObjectDoubleMap.indexOf(KType)
-
indexReplace
public double indexReplace(int index, double newValue)
Description copied from interface:ObjectDoubleMap
Replaces the value associated with an existing key and returns any previous value stored for that key.- Specified by:
indexReplace
in interfaceObjectDoubleMap<KType>
- Parameters:
index
- The index of an existing key.- Returns:
- Returns the previous value associated with the key.
- See Also:
ObjectDoubleMap.indexOf(KType)
-
indexInsert
public void indexInsert(int index, KType key, double value)
Description copied from interface:ObjectDoubleMap
Inserts a key-value pair for a key that is not present in the map. This method may help in avoiding double recalculation of the key's hash.- Specified by:
indexInsert
in interfaceObjectDoubleMap<KType>
- Parameters:
index
- The index of a previously non-existing key, as returned fromObjectDoubleMap.indexOf(KType)
.- See Also:
ObjectDoubleMap.indexOf(KType)
-
toString
public java.lang.String toString()
- Overrides:
toString
in classjava.lang.Object
-
ensureCapacity
public void ensureCapacity(int expectedElements)
Description copied from interface:Preallocable
Ensure this container can hold at least the given number of elements without resizing its buffers.- Specified by:
ensureCapacity
in interfacePreallocable
- Parameters:
expectedElements
- The total number of elements, inclusive.
-
visualizeKeyDistribution
public java.lang.String visualizeKeyDistribution(int characters)
Description copied from interface:ObjectDoubleMap
Visually depict the distribution of keys.- Specified by:
visualizeKeyDistribution
in interfaceObjectDoubleMap<KType>
- Parameters:
characters
- The number of characters to "squeeze" the entire buffer into.- Returns:
- Returns a sequence of characters where '.' depicts an empty fragment of the internal buffer and 'X' depicts full or nearly full capacity within the buffer's range and anything between 1 and 9 is between.
-
ramBytesAllocated
public long ramBytesAllocated()
Description copied from interface:Accountable
Allocated memory estimation- Specified by:
ramBytesAllocated
in interfaceAccountable
- Returns:
- Ram allocated in bytes
-
ramBytesUsed
public long ramBytesUsed()
Description copied from interface:Accountable
Bytes that is actually been used- Specified by:
ramBytesUsed
in interfaceAccountable
- Returns:
- Ram used in bytes
-
nextIterationSeed
protected int nextIterationSeed()
Provides the next iteration seed used to build the iteration starting slot and offset increment. This method does not need to be synchronized, what matters is that each thread gets a sequence of varying seeds.
-
-