Class ConcurrentLongLongPairHashMap
java.lang.Object
org.apache.pulsar.common.util.collections.ConcurrentLongLongPairHashMap
Concurrent hash map where both keys and values are composed of pairs of longs.
(long,long) --> (long,long)
Provides similar methods as a ConcurrentMap<K,V> but since it's an open hash map with linear probing,
no node allocations are required to store the keys and values, and no boxing is required.
Keys MUST be >= 0.
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic interfaceA BiConsumer Long pair.static classBuilder of ConcurrentLongLongPairHashMap.static interfaceA Long pair function.static interfaceA Long pair predicate.static classA pair of long values. -
Method Summary
Modifier and TypeMethodDescriptionasMap()longcapacity()voidclear()booleancontainsKey(long key1, long key2) voidget(long key1, long key2) booleanisEmpty()keys()booleanput(long key1, long key2, long value1, long value2) booleanputIfAbsent(long key1, long key2, long value1, long value2) booleanremove(long key1, long key2) Remove an existing entry if found.booleanremove(long key1, long key2, long value1, long value2) longsize()values()
-
Method Details
-
newBuilder
-
size
public long size() -
capacity
public long capacity() -
isEmpty
public boolean isEmpty() -
get
- Parameters:
key1-key2-- Returns:
- the value or -1 if the key was not present.
-
containsKey
public boolean containsKey(long key1, long key2) -
put
public boolean put(long key1, long key2, long value1, long value2) -
putIfAbsent
public boolean putIfAbsent(long key1, long key2, long value1, long value2) -
remove
public boolean remove(long key1, long key2) Remove an existing entry if found.- Parameters:
key1-key2-- Returns:
- the value associated with the key or -1 if key was not present.
-
remove
public boolean remove(long key1, long key2, long value1, long value2) -
clear
public void clear() -
forEach
-
keys
- Returns:
- a new list of all keys (makes a copy).
-
values
-
asMap
-