tf.FIFOQueue.__init__(capacity, dtypes, shapes=None, names=None, shared_name=None, name='fifo_queue')
Creates a queue that dequeues elements in a first-in first-out order.
A FIFOQueue
has bounded capacity; supports multiple concurrent producers and consumers; and provides exactly-once delivery.
A FIFOQueue
holds a list of up to capacity
elements. Each element is a fixed-length tuple of tensors whose dtypes are described by dtypes
, and whose shapes are optionally described by the shapes
argument.
If the shapes
argument is specified, each component of a queue element must have the respective fixed shape. If it is unspecified, different queue elements may have different shapes, but the use of dequeue_many
is disallowed.
Args:
-
capacity
: An integer. The upper bound on the number of elements that may be stored in this queue. -
dtypes
: A list ofDType
objects. The length ofdtypes
must equal the number of tensors in each queue element. -
shapes
: (Optional.) A list of fully-definedTensorShape
objects with the same length asdtypes
, orNone
. -
names
: (Optional.) A list of string naming the components in the queue with the same length asdtypes
, orNone
. If specified the dequeue methods return a dictionary with the names as keys. -
shared_name
: (Optional.) If non-empty, this queue will be shared under the given name across multiple sessions. -
name
: Optional name for the queue operation.
Please login to continue.