@Operator(group="io") public final class QueueDequeue extends PrimitiveOp implements Iterable<Operand<Object>>
This operation has k outputs, where k is the number of components in the tuples stored in the given queue, and output i is the ith component of the dequeued tuple.
N.B. If the queue is empty, this operation will block until an element has been dequeued (or 'timeout_ms' elapses, if specified).
Modifier and Type | Class and Description |
---|---|
static class |
QueueDequeue.Options
Optional attributes for
QueueDequeue |
operation
Modifier and Type | Method and Description |
---|---|
List<Output<?>> |
components()
One or more tensors that were dequeued as a tuple.
|
static QueueDequeue |
create(Scope scope,
Operand<?> handle,
List<Class<?>> componentTypes,
QueueDequeue.Options... options)
Factory method to create a class wrapping a new QueueDequeue operation.
|
Iterator<Operand<Object>> |
iterator() |
static QueueDequeue.Options |
timeoutMs(Long timeoutMs) |
equals, hashCode, op, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
forEach, spliterator
public static QueueDequeue create(Scope scope, Operand<?> handle, List<Class<?>> componentTypes, QueueDequeue.Options... options)
scope
- current scopehandle
- The handle to a queue.componentTypes
- The type of each component in a tuple.options
- carries optional attributes valuespublic static QueueDequeue.Options timeoutMs(Long timeoutMs)
timeoutMs
- If the queue is empty, this operation will block for up to
timeout_ms milliseconds.
Note: This option is not supported yet.Copyright © 2022. All rights reserved.