Lines Matching refs:in

7 A more flexible solution to limit the number of messages in a flow graph
9 are available in the graph and a message will not be allowed to enter
33    first-in-first-out; that is, the inputs are joined together to form a
34    tuple in the order they are received.
110 back to the ``buffer_node``. This cycle in the flow graph allows the token
112 like in the previous sections, there will be at most four big objects in
113 the graph. There could be three big objects in the ``function_node`` and one
114 buffered in the ``input_node``, awaiting a token to be paired with.
119 Therefore, unlike in the example above, the ``token_t`` doesn't need to be a
127 Also, in our example above, the ``buffer_node`` was prefilled by a fixed
135 concurrency in the graph.
141 concurrency in the system. Since you can pair the token with an input at