org.apache.flink.runtime.state.heap

类 KeyGroupPartitionedPriorityQueue<T,PQ extends InternalPriorityQueue<T> & HeapPriorityQueueElement>

java.lang.Object

org.apache.flink.runtime.state.heap.KeyGroupPartitionedPriorityQueue<T,PQ>

类型参数:

T - the type of elements in the queue.

PQ - the type of sub-queue used for each key-group partition.

所有已实现的接口:

InternalPriorityQueue<T>, KeyGroupedInternalPriorityQueue<T>

public class KeyGroupPartitionedPriorityQueue<T,PQ extends InternalPriorityQueue<T> & HeapPriorityQueueElement>
extends Object
implements InternalPriorityQueue<T>, KeyGroupedInternalPriorityQueue<T>

This implementation of InternalPriorityQueue is internally partitioned into sub-queues per key-group and essentially works as a heap-of-heaps. Instances will have set semantics for elements if the sub-queues have set semantics.

嵌套类概要

嵌套类

限定符和类型	类和说明
static interface	KeyGroupPartitionedPriorityQueue.PartitionQueueSetFactory<T,PQS extends InternalPriorityQueue<T> & HeapPriorityQueueElement> Factory that produces the sub-queues that represent the partitions of a KeyGroupPartitionedPriorityQueue.

构造器概要

构造器

构造器和说明
KeyGroupPartitionedPriorityQueue(KeyExtractorFunction<T> keyExtractor, PriorityComparator<T> elementPriorityComparator, KeyGroupPartitionedPriorityQueue.PartitionQueueSetFactory<T,PQ> orderedCacheFactory, KeyGroupRange keyGroupRange, int totalKeyGroups)

方法概要

限定符和类型	方法和说明
boolean	add(T toAdd) Adds the given element to the set, if it is not already contained.
void	addAll(Collection<? extends T> toAdd) Adds all the given elements to the set.
Set<T>	getSubsetForKeyGroup(int keyGroupId) Returns the subset of elements in the priority queue that belongs to the given key-group, within the operator's key-group range.
boolean	isEmpty() Check if the set contains any elements.
org.apache.flink.util.CloseableIterator<T>	iterator() Iterator over all elements, no order guaranteed.
T	peek() Retrieves, but does not remove, the element (w.r.t. order) of this set, or returns null if this set is empty.
T	poll() Retrieves and removes the first element (w.r.t. the order) of this set, or returns null if this set is empty.
boolean	remove(T toRemove) Removes the given element from the set, if is contained in the set.
int	size() Returns the number of elements in this set.

从类继承的方法 java.lang.Object

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

构造器详细资料

KeyGroupPartitionedPriorityQueue

public KeyGroupPartitionedPriorityQueue(@Nonnull
                                        KeyExtractorFunction<T> keyExtractor,
                                        @Nonnull
                                        PriorityComparator<T> elementPriorityComparator,
                                        @Nonnull
                                        KeyGroupPartitionedPriorityQueue.PartitionQueueSetFactory<T,PQ> orderedCacheFactory,
                                        @Nonnull
                                        KeyGroupRange keyGroupRange,
                                        @Nonnegative
                                        int totalKeyGroups)

方法详细资料

poll

@Nullable
public T poll()

从接口复制的说明: InternalPriorityQueue

Retrieves and removes the first element (w.r.t. the order) of this set, or returns null if this set is empty.

NOTE: Correct key (i.e. the key of the polled element) must be set on KeyContext before calling this method.

指定者:

poll 在接口中 InternalPriorityQueue<T>

返回:

the first element of this ordered set, or null if this set is empty.

peek

@Nullable
public T peek()

从接口复制的说明: InternalPriorityQueue

Retrieves, but does not remove, the element (w.r.t. order) of this set, or returns null if this set is empty.

指定者:

peek 在接口中 InternalPriorityQueue<T>

返回:

the first element (w.r.t. order) of this ordered set, or null if this set is empty.

add

public boolean add(@Nonnull
                   T toAdd)

从接口复制的说明: InternalPriorityQueue

Adds the given element to the set, if it is not already contained.

指定者:

add 在接口中 InternalPriorityQueue<T>

参数:

toAdd - the element to add to the set.

返回:

true if the operation changed the head element or if it is unclear if the head element changed. Only returns false if the head element was not changed by this operation.

remove

public boolean remove(@Nonnull
                      T toRemove)

从接口复制的说明: InternalPriorityQueue

Removes the given element from the set, if is contained in the set.

NOTE: Correct key (i.e. the key of the polled element) must be set on KeyContext before calling this method.

指定者:

remove 在接口中 InternalPriorityQueue<T>

参数:

toRemove - the element to remove.

返回:

true if the operation changed the head element or if it is unclear if the head element changed. Only returns false if the head element was not changed by this operation.

isEmpty

public boolean isEmpty()

从接口复制的说明: InternalPriorityQueue

Check if the set contains any elements.

指定者:

isEmpty 在接口中 InternalPriorityQueue<T>

返回:

true if the set is empty, i.e. no element is contained.

size

public int size()

从接口复制的说明: InternalPriorityQueue

Returns the number of elements in this set.

指定者:

size 在接口中 InternalPriorityQueue<T>

返回:

the number of elements in this set.

addAll

public void addAll(@Nullable
                   Collection<? extends T> toAdd)

从接口复制的说明: InternalPriorityQueue

Adds all the given elements to the set.

指定者:

addAll 在接口中 InternalPriorityQueue<T>

iterator

@Nonnull
public org.apache.flink.util.CloseableIterator<T> iterator()

从接口复制的说明: InternalPriorityQueue

Iterator over all elements, no order guaranteed. Iterator must be closed after usage.

指定者:

iterator 在接口中 InternalPriorityQueue<T>

getSubsetForKeyGroup

@Nonnull
public Set<T> getSubsetForKeyGroup(int keyGroupId)

从接口复制的说明: KeyGroupedInternalPriorityQueue

Returns the subset of elements in the priority queue that belongs to the given key-group, within the operator's key-group range.

指定者:

getSubsetForKeyGroup 在接口中 KeyGroupedInternalPriorityQueue<T>