PrioritizedDeque (Flink : Runtime 1.17.1 API)

java.lang.Object
- org.apache.flink.runtime.io.network.partition.PrioritizedDeque<T>

类型参数:

T - the element type.

所有已实现的接口:

Iterable<T>
```
@Internal
public final class PrioritizedDeque<T>
extends Object
implements Iterable<T>
```
A deque-like data structure that supports prioritization of elements, such they will be polled before any non-priority elements.

Note that all element tests are performed by identity.

构造器概要

构造器
构造器和说明

PrioritizedDeque()

构造器
构造器和说明
`PrioritizedDeque()`

方法概要

所有方法实例方法具体方法
限定符和类型	方法和说明
`void`	`add(T element)` Adds a non-priority element to this deque, which will be polled last.
`void`	`add(T element, boolean priority, boolean prioritize)` Convenience method for adding an element with optional priority and prior removal.
`void`	`addPriorityElement(T element)` Adds a priority element to this deque, such that it will be polled after all existing priority elements but before any non-priority element.
`Collection<T>`	`asUnmodifiableCollection()` Returns an unmodifiable collection view.
`void`	`clear()` Removes all priority and non-priority elements.
`boolean`	`contains(T element)` Returns whether the given element is contained in this list.
`boolean`	`containsPriorityElement(T element)` Returns whether the given element is a known priority element.
`boolean`	`equals(Object o)`
`T`	`getAndRemove(java.util.function.Predicate<T> preCondition)` Find first element matching the `Predicate`, remove it from the `PrioritizedDeque` and return it.
`int`	`getNumPriorityElements()` Returns the current number of priority elements ([0; `size()`]).
`int`	`getNumUnprioritizedElements()` Returns the number of non-priority elements.
`int`	`hashCode()`
`boolean`	`isEmpty()` Returns true if there are no elements.
`Iterator<T>`	`iterator()`
`T`	`peek()` Returns the first priority element or non-priority element if the former does not exist.
`T`	`peekLast()` Returns the last non-priority element or priority element if the former does not exist.
`T`	`poll()` Polls the first priority element or non-priority element if the former does not exist.
`void`	`prioritize(T element)` Prioritizes an already existing element.
`int`	`size()` Returns the number of priority and non-priority elements.
`java.util.stream.Stream<T>`	`stream()`
`String`	`toString()`

从类继承的方法 java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

从接口继承的方法 java.lang.Iterable
forEach, spliterator

- 构造器详细资料
  - PrioritizedDeque
```
public PrioritizedDeque()
```
- 方法详细资料
  - addPriorityElement
```
public void addPriorityElement(T element)
```
    Adds a priority element to this deque, such that it will be polled after all existing priority elements but before any non-priority element.
    
    参数:
    
    element - the element to add
  - add
```
public void add(T element)
```
    Adds a non-priority element to this deque, which will be polled last.
    
    参数:
    
    element - the element to add
  - add
```
public void add(T element,
                boolean priority,
                boolean prioritize)
```
    Convenience method for adding an element with optional priority and prior removal.
    
    参数:
    
    element - the element to add
    
    priority - flag indicating if it's a priority or non-priority element
    
    prioritize - flag that hints that the element is already in this deque, potentially as non-priority element.
  - prioritize
```
public void prioritize(T element)
```
    Prioritizes an already existing element. Note that this method assumes identity.
    
    参数:
    
    element - the element to prioritize.
  - asUnmodifiableCollection
```
public Collection<T> asUnmodifiableCollection()
```
    Returns an unmodifiable collection view.
  - getAndRemove
```
public T getAndRemove(java.util.function.Predicate<T> preCondition)
```
    Find first element matching the Predicate, remove it from the PrioritizedDeque and return it.
    
    返回:
    
    removed element
  - poll
```
@Nullable
public T poll()
```
    Polls the first priority element or non-priority element if the former does not exist.
    
    返回:
    
    the first element or null.
  - peek
```
@Nullable
public T peek()
```
    Returns the first priority element or non-priority element if the former does not exist.
    
    返回:
    
    the first element or null.
  - getNumPriorityElements
```
public int getNumPriorityElements()
```
    Returns the current number of priority elements ([0; size()]).
  - containsPriorityElement
```
public boolean containsPriorityElement(T element)
```
    Returns whether the given element is a known priority element. Test is performed by identity.
  - size
```
public int size()
```
    Returns the number of priority and non-priority elements.
  - getNumUnprioritizedElements
```
public int getNumUnprioritizedElements()
```
    Returns the number of non-priority elements.
  - iterator
```
public Iterator<T> iterator()
```
    指定者:
    
    iterator 在接口中 Iterable<T>
    
    返回:
    
    read-only iterator
  - clear
```
public void clear()
```
    Removes all priority and non-priority elements.
  - isEmpty
```
public boolean isEmpty()
```
    Returns true if there are no elements.
  - contains
```
public boolean contains(T element)
```
    Returns whether the given element is contained in this list. Test is performed by identity.
  - equals
```
public boolean equals(Object o)
```
    覆盖:
    
    equals 在类中 Object
  - hashCode
```
public int hashCode()
```
    覆盖:
    
    hashCode 在类中 Object
  - toString
```
public String toString()
```
    覆盖:
    
    toString 在类中 Object
  - peekLast
```
@Nullable
public T peekLast()
```
    Returns the last non-priority element or priority element if the former does not exist.
    
    返回:
    
    the last element or null.
  - stream
```
public java.util.stream.Stream<T> stream()
```

类 PrioritizedDeque<T>

构造器概要

方法概要

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

从接口继承的方法 java.lang.Iterable

构造器详细资料

PrioritizedDeque

方法详细资料

addPriorityElement

add

add

prioritize

asUnmodifiableCollection

getAndRemove

poll

peek

getNumPriorityElements

containsPriorityElement

size

getNumUnprioritizedElements

iterator

clear

isEmpty

contains

equals

hashCode

toString

peekLast

stream