Package org.agrona.collections
Class Long2LongHashMap
java.lang.Object
org.agrona.collections.Long2LongHashMap
An open-addressing with linear probing hash map specialised for primitive key and value pairs.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionfinal classIterator over entries which supports access to unboxed keys and values.final classSet of entries which supports optionally cached iterators to avoid allocation.final classIterator over keys which supports access to unboxed keys viaLong2LongHashMap.KeyIterator.nextValue().final classSet of keys which supports optional cached iterators to avoid allocation.final classCollection of values which supports optionally cached iterators to avoid allocation.final classIterator over values which supports access to unboxed values. -
Constructor Summary
ConstructorsConstructorDescriptionLong2LongHashMap(int initialCapacity, float loadFactor, long missingValue) Create a map instance that does not allocate iterators with specified parameters.Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue, boolean shouldAvoidAllocation) Create a map instance with specified parameters.Long2LongHashMap(long missingValue) Create a map instance that does not allocate iterators with a specifiedmissingValue.Long2LongHashMap(Long2LongHashMap mapToCopy) Copy construct a new map from an existing one. -
Method Summary
Modifier and TypeMethodDescriptionintcapacity()Get the total capacity for the map to which the load factor will be a fraction of.voidclear()voidcompact()Compact the backing arrays by rehashing with a capacity just larger than current size and giving consideration to the load factor.longcompute(long key, LongBinaryOperator remappingFunction) Primitive specialised version ofMap.compute(Object, BiFunction).longcomputeIfAbsent(long key, LongUnaryOperator mappingFunction) Primitive specialised version ofMap.computeIfAbsent(Object, Function).longcomputeIfPresent(long key, LongBinaryOperator remappingFunction) Primitive specialised version ofMap.computeIfPresent(Object, BiFunction).booleancontainsKey(long key) Long primitive specialised containsKey.booleancontainsKey(Object key) booleancontainsValue(long value) Does the map contain the value.booleancontainsValue(Object value) entrySet()booleanvoidforEach(BiConsumer<? super Long, ? super Long> action) voidforEachLong(LongLongConsumer consumer) Primitive specialised forEach implementation.longget(long key) Get a value using provided key avoiding boxing.longgetOrDefault(long key, long defaultValue) Returns the value to which the specified key is mapped, ordefaultValueif this map contains no mapping for the key.inthashCode()booleanisEmpty()keySet()floatGet the load factor applied for resize operations.voidlongForEach(LongLongConsumer consumer) Deprecated.longmaxValue()Get the maximum value stored in the map.longmerge(long key, long value, LongLongFunction remappingFunction) Primitive specialised version ofMap.merge(Object, Object, BiFunction).longminValue()Get the minimum value stored in the map.longThe value to be used as a null marker in the map.longput(long key, long value) Put a key value pair in the map.voidvoidputAll(Long2LongHashMap map) Put all values from the given map longo this map without allocation.longputIfAbsent(long key, long value) Primitive specialised version ofMap.putIfAbsent(Object, Object)method.putIfAbsent(Long key, Long value) longremove(long key) Remove value from the map using given key avoiding boxing.booleanremove(long key, long value) Primitive specialised version ofMap.remove(Object, Object).booleanlongreplace(long key, long value) Primitive specialised version ofMap.replace(Object, Object).booleanreplace(long key, long oldValue, long newValue) Primitive specialised version ofMap.replace(Object, Object, Object).booleanvoidreplaceAll(BiFunction<? super Long, ? super Long, ? extends Long> function) voidreplaceAllLong(LongLongFunction function) Primitive specialised version ofMap.replaceAll(BiFunction).intGet the actual threshold which when reached the map will resize.intsize()toString()values()Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, getOrDefault, merge
-
Constructor Details
-
Long2LongHashMap
public Long2LongHashMap(long missingValue) Create a map instance that does not allocate iterators with a specifiedmissingValue.- Parameters:
missingValue- for the map that represents null.
-
Long2LongHashMap
public Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue) Create a map instance that does not allocate iterators with specified parameters.- Parameters:
initialCapacity- for the map to overrideMIN_CAPACITYloadFactor- for the map to overrideHashing.DEFAULT_LOAD_FACTOR.missingValue- for the map that represents null.
-
Long2LongHashMap
public Long2LongHashMap(int initialCapacity, float loadFactor, long missingValue, boolean shouldAvoidAllocation) Create a map instance with specified parameters.- Parameters:
initialCapacity- for the map to overrideMIN_CAPACITYloadFactor- for the map to overrideHashing.DEFAULT_LOAD_FACTOR.missingValue- for the map that represents null.shouldAvoidAllocation- should allocation be avoided by caching iterators and map entries.
-
Long2LongHashMap
Copy construct a new map from an existing one.- Parameters:
mapToCopy- for construction.
-
-
Method Details
-
missingValue
public long missingValue()The value to be used as a null marker in the map.- Returns:
- value to be used as a null marker in the map.
-
loadFactor
public float loadFactor()Get the load factor applied for resize operations.- Returns:
- the load factor applied for resize operations.
-
capacity
public int capacity()Get the total capacity for the map to which the load factor will be a fraction of.- Returns:
- the total capacity for the map.
-
resizeThreshold
public int resizeThreshold()Get the actual threshold which when reached the map will resize. This is a function of the current capacity and load factor.- Returns:
- the threshold when the map will resize.
-
size
public int size() -
isEmpty
public boolean isEmpty() -
getOrDefault
public long getOrDefault(long key, long defaultValue) Returns the value to which the specified key is mapped, ordefaultValueif this map contains no mapping for the key.- Parameters:
key- whose associated value is to be returned.defaultValue- to be returned if there is no value in the map for a givenkey.- Returns:
- the value to which the specified key is mapped, or
defaultValueif this map contains no mapping for the key.
-
get
public long get(long key) Get a value using provided key avoiding boxing.- Parameters:
key- lookup key.- Returns:
- value associated with the key or
missingValue()if key is not found in the map.
-
put
public long put(long key, long value) Put a key value pair in the map.- Parameters:
key- lookup keyvalue- new value, must not bemissingValue()- Returns:
- previous value associated with the key, or
missingValue()if none found - Throws:
IllegalArgumentException- if value ismissingValue()
-
putIfAbsent
public long putIfAbsent(long key, long value) Primitive specialised version ofMap.putIfAbsent(Object, Object)method.- Parameters:
key- key with which the specified value is to be associatedvalue- value to be associated with the specified key- Returns:
- the previous value associated with the specified key, or
missingValue()if there was no mapping for the key. - Throws:
IllegalArgumentException- if value ismissingValue()
-
longForEach
Deprecated.UseforEachLong(LongLongConsumer)instead.UseforEachLong(LongLongConsumer)instead.- Parameters:
consumer- a callback called for each key/value pair in the map.- See Also:
-
forEachLong
Primitive specialised forEach implementation.NB: Renamed from forEach to avoid overloading on parameter types of lambda expression, which doesn't play well with type inference in lambda expressions.
- Parameters:
consumer- a callback called for each key/value pair in the map.
-
containsKey
public boolean containsKey(long key) Long primitive specialised containsKey.- Parameters:
key- the key to check.- Returns:
- true if the map contains key as a key, false otherwise.
-
containsValue
public boolean containsValue(long value) Does the map contain the value.- Parameters:
value- to be tested against contained values.- Returns:
- true if contained otherwise value.
-
clear
public void clear() -
compact
public void compact()Compact the backing arrays by rehashing with a capacity just larger than current size and giving consideration to the load factor. -
computeIfAbsent
Primitive specialised version ofMap.computeIfAbsent(Object, Function).- Parameters:
key- to search on.mappingFunction- to provide a value if the get returns null.- Returns:
- the value if found otherwise the missing value.
-
computeIfPresent
Primitive specialised version ofMap.computeIfPresent(Object, BiFunction).- Parameters:
key- to search on.remappingFunction- to compute a value if a mapping is found.- Returns:
- the updated value if a mapping was found, otherwise the missing value.
-
compute
Primitive specialised version ofMap.compute(Object, BiFunction).- Parameters:
key- to search on.remappingFunction- to compute a value.- Returns:
- the updated value.
-
get
-
put
-
forEach
-
containsKey
- Specified by:
containsKeyin interfaceMap<Long,Long>
-
containsValue
- Specified by:
containsValuein interfaceMap<Long,Long>
-
putAll
-
putAll
Put all values from the given map longo this map without allocation.- Parameters:
map- whose value are to be added.
-
putIfAbsent
- Specified by:
putIfAbsentin interfaceMap<Long,Long>
-
replace
-
replace
-
replaceAll
- Specified by:
replaceAllin interfaceMap<Long,Long>
-
keySet
-
values
-
entrySet
-
remove
-
remove
-
remove
public long remove(long key) Remove value from the map using given key avoiding boxing.- Parameters:
key- whose mapping is to be removed from the map.- Returns:
- removed value or
missingValue()if key was not found in the map.
-
remove
public boolean remove(long key, long value) Primitive specialised version ofMap.remove(Object, Object).- Parameters:
key- with which the specified value is associated.value- expected to be associated with the specified key.- Returns:
trueif the value was removed.
-
merge
Primitive specialised version ofMap.merge(Object, Object, BiFunction).- Parameters:
key- with which the resulting value is to be associated.value- to be merged with the existing value associated with the key or, if no existing value or a null value is associated with the key, to be associated with the key.remappingFunction- the function to recompute a value if present.- Returns:
- the new value associated with the specified key, or
missingValue()if no value is associated with the key as the result of this operation.
-
minValue
public long minValue()Get the minimum value stored in the map. If the map is empty then it will returnmissingValue().- Returns:
- the minimum value stored in the map.
-
maxValue
public long maxValue()Get the maximum value stored in the map. If the map is empty then it will returnmissingValue().- Returns:
- the maximum value stored in the map.
-
toString
-
replace
public long replace(long key, long value) Primitive specialised version ofMap.replace(Object, Object).- Parameters:
key- key with which the specified value is associated.value- value to be associated with the specified key.- Returns:
- the previous value associated with the specified key, or
missingValue()if there was no mapping for the key.
-
replace
public boolean replace(long key, long oldValue, long newValue) Primitive specialised version ofMap.replace(Object, Object, Object).- Parameters:
key- key with which the specified value is associated.oldValue- value expected to be associated with the specified key.newValue- value to be associated with the specified key.- Returns:
trueif the value was replaced.
-
replaceAllLong
Primitive specialised version ofMap.replaceAll(BiFunction).NB: Renamed from replaceAll to avoid overloading on parameter types of lambda expression, which doesn't play well with type inference in lambda expressions.
- Parameters:
function- to apply to each entry.
-
equals
-
hashCode
public int hashCode()
-
forEachLong(LongLongConsumer)instead.