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

2025-01-10 15:47:30

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.igamma() tf.igamma(a, x, name=None) Compute the lower regularized incomplete Gamma function Q(a, x). The lower regularized incomplete Gamma function is defin

tf.log() tf.log(x, name=None) Computes natural logarithm of x element-wise. I.e., \(y = \log_e x\). Args: x: A Tensor. Must be one of the following types: h

tf.zeta() tf.zeta(x, q, name=None) Compute the Hurwitz zeta function \(\zeta(x, q)\). The Hurwitz zeta function is defined as: \zeta(x, q) = \sum_{n=0}^{\inft

tf.constant() tf.constant(value, dtype=None, shape=None, name='Const') Creates a constant tensor. The resulting tensor is populated with values of type dtype, as