blob: 6cbcef11f8e851a84267fd014eb587725c8938f7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
op {
graph_op_name: "PriorityQueue"
visibility: SKIP
out_arg {
name: "handle"
description: <<END
The handle to the queue.
END
}
attr {
name: "component_types"
description: <<END
The type of each component in a value.
END
}
attr {
name: "shapes"
description: <<END
The shape of each component in a value. The length of this attr must
be either 0 or the same as the length of component_types. If the length of
this attr is 0, the shapes of queue elements are not constrained, and
only one element may be dequeued at a time.
END
}
attr {
name: "capacity"
description: <<END
The upper bound on the number of elements in this queue.
Negative numbers mean no limit.
END
}
attr {
name: "container"
description: <<END
If non-empty, this queue is placed in the given container.
Otherwise, a default container is used.
END
}
attr {
name: "shared_name"
description: <<END
If non-empty, this queue will be shared under the given name
across multiple sessions.
END
}
summary: "A queue that produces elements sorted by the first component value."
description: <<END
Note that the PriorityQueue requires the first component of any element
to be a scalar int64, in addition to the other elements declared by
component_types. Therefore calls to Enqueue and EnqueueMany (resp. Dequeue
and DequeueMany) on a PriorityQueue will all require (resp. output) one extra
entry in their input (resp. output) lists.
END
}
|
