LongPairSet (Pulsar Common 2.10.0-rc-202203222205 API)

All Known Implementing Classes:

ConcurrentLongPairSet, ConcurrentSortedLongPairSet
```
public interface LongPairSet
```
Hash set where values are composed of pairs of longs.

Nested Class Summary

Nested Classes
Modifier and Type	Interface and Description
`static interface`	`LongPairSet.LongPairFunction<T>` Represents a function that accepts two long arguments and produces a result.
`static interface`	`LongPairSet.LongPairPredicate` Predicate to checks for a key-value pair where both of them have long types.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method and Description
`boolean`	`add(long item1, long item2)` Adds composite value of item1 and item2 to set.
`void`	`clear()` Removes all items from set.
`boolean`	`contains(long item1, long item2)` Checks if given (item1,item2) composite value exists into set.
`void`	`forEach(ConcurrentLongPairSet.LongPairConsumer processor)` Execute `ConcurrentLongPairSet.LongPairConsumer` processor for each entry in the set.
`boolean`	`isEmpty()` Check if set is empty.
`Set<ConcurrentLongPairSet.LongPair>`	`items()`
`Set<ConcurrentLongPairSet.LongPair>`	`items(int numberOfItems)`
`<T> Set<T>`	`items(int numberOfItems, LongPairSet.LongPairFunction<T> longPairConverter)`
`boolean`	`remove(long item1, long item2)` Removes composite value of item1 and item2 from set.
`int`	`removeIf(LongPairSet.LongPairPredicate filter)` Removes composite value of item1 and item2 from set if provided predicate `LongPairSet.LongPairPredicate` matches.
`long`	`size()` Returns size of the set.

- Method Detail
  - add
```
boolean add(long item1,
            long item2)
```
    Adds composite value of item1 and item2 to set.
    
    Parameters:
    
    item1 -
    
    item2 -
    
    Returns:
  - remove
```
boolean remove(long item1,
               long item2)
```
    Removes composite value of item1 and item2 from set.
    
    Parameters:
    
    item1 -
    
    item2 -
    
    Returns:
  - removeIf
```
int removeIf(LongPairSet.LongPairPredicate filter)
```
    Removes composite value of item1 and item2 from set if provided predicate LongPairSet.LongPairPredicate matches.
    
    Parameters:
    
    filter -
    
    Returns:
  - forEach
```
void forEach(ConcurrentLongPairSet.LongPairConsumer processor)
```
    Execute ConcurrentLongPairSet.LongPairConsumer processor for each entry in the set.
    
    Parameters:
    
    processor -
  - items
```
Set<ConcurrentLongPairSet.LongPair> items()
```
    Returns:
    
    a new list of all keys (makes a copy)
  - items
```
Set<ConcurrentLongPairSet.LongPair> items(int numberOfItems)
```
    Returns:
    
    a new list of keys with max provided numberOfItems (makes a copy)
  - items
```
<T> Set<T> items(int numberOfItems,
                 LongPairSet.LongPairFunction<T> longPairConverter)
```
    Parameters:
    
    numberOfItems -
    
    longPairConverter - converts (long,long) pair to object
    
    Returns:
    
    a new list of keys with max provided numberOfItems
  - isEmpty
```
boolean isEmpty()
```
    Check if set is empty.
    
    Returns:
  - clear
```
void clear()
```
    Removes all items from set.
  - size
```
long size()
```
    Returns size of the set.
    
    Returns:
  - contains
```
boolean contains(long item1,
                 long item2)
```
    Checks if given (item1,item2) composite value exists into set.
    
    Parameters:
    
    item1 -
    
    item2 -
    
    Returns:

Interface LongPairSet

Nested Class Summary

Method Summary

Method Detail

add

remove

removeIf

forEach

items

items

items

isEmpty

clear

size

contains