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

Class GrowablePriorityLongPairQueue

java.lang.Object

org.apache.pulsar.common.util.collections.GrowablePriorityLongPairQueue

public class GrowablePriorityLongPairQueue
extends Object

An unbounded priority queue based on a min heap where values are composed of pairs of longs.

When the capacity is reached, data will be moved to a bigger array. It also act as a set and doesn't store duplicate values if #allowedDuplicate flag is passed false

(long,long)

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	GrowablePriorityLongPairQueue.LongPair	Class representing two long values.
static interface	GrowablePriorityLongPairQueue.LongPairConsumer	Represents a function that accepts two long arguments.
static interface	GrowablePriorityLongPairQueue.LongPairPredicate	Predicate to checks for a key-value pair where both of them have long types.

Constructor Summary

Constructors

Constructor	Description
GrowablePriorityLongPairQueue()
GrowablePriorityLongPairQueue(int initialCapacity)

Method Summary

Modifier and Type	Method	Description
void	add(long item1, long item2)
int	capacity()
void	clear()
boolean	exists(long item1, long item2)
void	forEach(GrowablePriorityLongPairQueue.LongPairConsumer processor)
boolean	isEmpty()
Set<GrowablePriorityLongPairQueue.LongPair>	items()
Set<GrowablePriorityLongPairQueue.LongPair>	items(int numberOfItems)
GrowablePriorityLongPairQueue.LongPair	peek()
GrowablePriorityLongPairQueue.LongPair	remove()	Removes min element from the heap.
boolean	remove(long item1, long item2)	It removes all occurrence of given pair from the queue.
int	removeIf(GrowablePriorityLongPairQueue.LongPairPredicate filter)	Removes all of the elements of this collection that satisfy the given predicate.
int	size()

Methods inherited from class java.lang.Object

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

Constructor Details

GrowablePriorityLongPairQueue

public GrowablePriorityLongPairQueue()

GrowablePriorityLongPairQueue

public GrowablePriorityLongPairQueue(int initialCapacity)

Method Details

add

public void add(long item1,
 long item2)

forEach

public void forEach(GrowablePriorityLongPairQueue.LongPairConsumer processor)

items

public Set<GrowablePriorityLongPairQueue.LongPair> items()

Returns:

a new list of all keys (makes a copy)

items

public Set<GrowablePriorityLongPairQueue.LongPair> items(int numberOfItems)

Returns:

a new list of keys with max provided numberOfItems (makes a copy)

removeIf

public int removeIf(GrowablePriorityLongPairQueue.LongPairPredicate filter)

Removes all of the elements of this collection that satisfy the given predicate.

Parameters:

filter - a predicate which returns true for elements to be removed

Returns:

number of removed values

remove

public boolean remove(long item1,
 long item2)

It removes all occurrence of given pair from the queue.

Parameters:

item1 -

item2 -

Returns:

remove

public GrowablePriorityLongPairQueue.LongPair remove()

Removes min element from the heap.

Returns:

peek

public GrowablePriorityLongPairQueue.LongPair peek()

isEmpty

public boolean isEmpty()

capacity

public int capacity()

clear

public void clear()

size

public int size()

exists

public boolean exists(long item1,
 long item2)