Login Register

tf.FIFOQueue

class tf.FIFOQueue

A queue implementation that dequeues elements in first-in first-out order.

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

Links:

https://www.tensorflow.org/versions/master/api_docs/python/io_ops.html#FIFOQueue

doc_TensorFlow

2016-10-14 13:07:47

Comments

Leave a Comment

Please login to continue.

Popular Articles

tf.FIFOQueue.__init__() tf.FIFOQueue.__init__(capacity, dtypes, shapes=None, names=None, shared_name=None, name='fifo_queue') Creates a queue that dequeues elements in a fi

tf.add() tf.add(x, y, name=None) Returns x + y element-wise. NOTE: Add supports broadcasting. AddN does not. More about broadcasting here Args: x: A Tensor.

tf.sqrt() tf.sqrt(x, name=None) Computes square root of x element-wise. I.e., (y = \sqrt{x} = x^{1/2}). Args: x: A Tensor or SparseTensor. Must be one of the

tf.einsum() tf.einsum(axes, *inputs) A generalized contraction between tensors of arbitrary dimension. Like numpy.einsum.

tf.QueueBase class tf.QueueBase Base class for queue implementations. A queue is a TensorFlow data structure that stores tensors across multiple steps, and expos