Class ConcurrentLongLongPairHashMap

java.lang.Object
org.apache.pulsar.common.util.collections.ConcurrentLongLongPairHashMap

public class ConcurrentLongLongPairHashMap extends 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.
WARN: method forEach do not guarantee thread safety, nor do the keys, values and asMap method.
The forEach method is specifically designed for single-threaded usage. When iterating over a map with concurrent writes, it becomes possible for new values to be either observed or not observed. There is no guarantee that if we write value1 and value2, and are able to see value2, then we will also see value1. In some cases, it is even possible to encounter two mappings with the same key, leading the keys method to return a List containing two identical keys.
It is crucial to understand that the results obtained from aggregate status methods such as keys, values, and asMap are typically reliable only when the map is not undergoing concurrent updates from other threads. When concurrent updates are involved, the results of these methods reflect transient states that may be suitable for monitoring or estimation purposes, but not for program control.

  • Method Details

    • 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)
      Iterate over all the entries in the map and apply the processor function to each of them.

      Warning: Do Not Guarantee Thread-Safety.

      Parameters:
      processor - the processor to process the elements.
    • keys

      Returns:
      a new list of all keys (makes a copy).
    • values

    • asMap