Package org.apache.pulsar.common.util.collections

Class ConcurrentLongLongPairHashMap

java.lang.Object

org.apache.pulsar.common.util.collections.ConcurrentLongLongPairHashMap

public class ConcurrentLongLongPairHashMap
extends java.lang.Object

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 Classes

Modifier and Type	Class	Description
static interface	ConcurrentLongLongPairHashMap.BiConsumerLongPair	A BiConsumer Long pair.
static class	ConcurrentLongLongPairHashMap.Builder	Builder of ConcurrentLongLongPairHashMap.
static interface	ConcurrentLongLongPairHashMap.LongLongPairFunction	A Long pair function.
static interface	ConcurrentLongLongPairHashMap.LongLongPairPredicate	A Long pair predicate.
static class	ConcurrentLongLongPairHashMap.LongPair	A pair of long values.

Method Summary

Modifier and Type	Method	Description
java.util.Map<ConcurrentLongLongPairHashMap.LongPair,ConcurrentLongLongPairHashMap.LongPair>	asMap()
long	capacity()
void	clear()
boolean	containsKey(long key1, long key2)
void	forEach(ConcurrentLongLongPairHashMap.BiConsumerLongPair processor)
ConcurrentLongLongPairHashMap.LongPair	get(long key1, long key2)
boolean	isEmpty()
java.util.List<ConcurrentLongLongPairHashMap.LongPair>	keys()
static ConcurrentLongLongPairHashMap.Builder	newBuilder()
boolean	put(long key1, long key2, long value1, long value2)
boolean	putIfAbsent(long key1, long key2, long value1, long value2)
boolean	remove(long key1, long key2)	Remove an existing entry if found.
boolean	remove(long key1, long key2, long value1, long value2)
long	size()
java.util.List<ConcurrentLongLongPairHashMap.LongPair>	values()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

newBuilder

public static ConcurrentLongLongPairHashMap.Builder newBuilder()

size

public long size()

capacity

public long capacity()

isEmpty

public boolean isEmpty()

get

public ConcurrentLongLongPairHashMap.LongPair get(long key1,
                                                  long key2)

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

public void forEach(ConcurrentLongLongPairHashMap.BiConsumerLongPair processor)

keys

public java.util.List<ConcurrentLongLongPairHashMap.LongPair> keys()

Returns:

a new list of all keys (makes a copy).

values

public java.util.List<ConcurrentLongLongPairHashMap.LongPair> values()

asMap

public java.util.Map<ConcurrentLongLongPairHashMap.LongPair,ConcurrentLongLongPairHashMap.LongPair> asMap()