Lines Matching refs:be

9 are available in the graph and a message will not be allowed to enter
10 the graph until it can be paired with an available token. When a message
11 is retired from the graph, its token is released, and can be paired with
12 a new message that will then be allowed to enter.
17 ``join_node``s can be used to create an analogous system. A ``join_node`` has
29 The buffer policy can be one of the following:
32 -  ``queueing``. This type of policy causes inputs to be matched
44 A token-based system can be created by using reserving join_nodes.
49 ``token_t`` can be anything, for example it could be ``typedef int token_t;``.
111 to be recycled and paired with another input from the ``input_node``. So
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
120 dummy type; it could for example be a buffer or other object that is
129 example, an ``input_node`` could be attached to the input of the
131 ``function_node`` could be replaced by a ``multifunction_node`` that can
139 the token to be of any type and to inject or remove tokens from the