Uses of Interface
org.apache.flink.runtime.state.InternalPriorityQueue

Packages that use InternalPriorityQueue

Package	Description
org.apache.flink.runtime.state
org.apache.flink.runtime.state.heap	This package contains the classes for key/value state backends that store the state on the JVM heap as objects.

Uses of InternalPriorityQueue in org.apache.flink.runtime.state

Subinterfaces of InternalPriorityQueue in org.apache.flink.runtime.state

Modifier and Type	Interface	Description
interface	KeyGroupedInternalPriorityQueue<T>	This interface exists as (temporary) adapter between the new InternalPriorityQueue and the old way in which timers are written in a snapshot.

Uses of InternalPriorityQueue in org.apache.flink.runtime.state.heap

Classes in org.apache.flink.runtime.state.heap with type parameters of type InternalPriorityQueue

Modifier and Type	Class	Description
class	KeyGroupPartitionedPriorityQueue<T,PQ extends InternalPriorityQueue<T> & HeapPriorityQueueElement>	This implementation of InternalPriorityQueue is internally partitioned into sub-queues per key-group and essentially works as a heap-of-heaps.
static interface	KeyGroupPartitionedPriorityQueue.PartitionQueueSetFactory<T,PQS extends InternalPriorityQueue<T> & HeapPriorityQueueElement>	Factory that produces the sub-queues that represent the partitions of a KeyGroupPartitionedPriorityQueue.

Classes in org.apache.flink.runtime.state.heap that implement InternalPriorityQueue

Modifier and Type	Class	Description
class	AbstractHeapPriorityQueue<T extends HeapPriorityQueueElement>	Abstract base class for heap (object array) based implementations of priority queues, with support for fast deletes via HeapPriorityQueueElement.
class	HeapPriorityQueue<T extends HeapPriorityQueueElement>	Basic heap-based priority queue for HeapPriorityQueueElement objects.
class	HeapPriorityQueueSet<T extends HeapPriorityQueueElement>	A heap-based priority queue with set semantics, based on HeapPriorityQueue.
class	KeyGroupPartitionedPriorityQueue<T,PQ extends InternalPriorityQueue<T> & HeapPriorityQueueElement>	This implementation of InternalPriorityQueue is internally partitioned into sub-queues per key-group and essentially works as a heap-of-heaps.