A queue implementation that dequeues elements in prioritized 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.
types A list of DType objects. The length of types must equal the number of tensors in each queue element, except the first priority element. The first tensor in each element is the priority, which must be type int64.
shapes (Optional.) A list of fully-defined TensorShape objects, with the same length as types, or None.
names (Optional.) A list of strings 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.
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.