A queue implementation that dequeues elements in a random order.

Inherits From: QueueBase

See tf.queue.QueueBase for a description of the methods on this class.

capacity An integer. The upper bound on the number of elements that may be stored in this queue.
min_after_dequeue An integer (described above).
dtypes A list of DType objects. The length of dtypes must equal the number of tensors in each queue element.
shapes (Optional.) A list of fully-defined TensorShape objects with the same length as dtypes, or None.
names (Optional.) A list of string naming the components in the queue with the same length as dtypes, or None. If specified the dequeue methods return a dictionary with the names as keys.
seed A Python integer. Used to create a random seed. See tf.compat.v1.set_random_seed for behavior.
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.

dtypes The list of dtypes for each component of a queue element.
name The name of the underlying queue.
names The list of names for each component of a queue element.
queue_ref The underlying queue reference.
shapes The list of shapes for each component of a queue element.



View source

Closes this queue.

This operation signals that no more elements will be enqueued in the given queue. Subsequent enqueue and enqueue_many operations will fail. Subsequent dequeue and dequeue_many operations will continue to succeed if sufficient elements remain in the queue. Subsequently dequeue and dequeue_many operations that would otherwise block waiting for more elements (if close hadn't been called) will now fail immediately.

If cancel_pending_enqueues is