Home
last modified time | relevance | path

Searched refs:msg_t (Results 1 – 11 of 11) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_join_node_preview.cpp33 using JoinOutputType = std::tuple<msg_t, msg_t, msg_t>; in jn_follows_and_precedes()
35 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in jn_follows_and_precedes()
36 std::vector<msg_t> messages_for_precedes = {msg_t(), msg_t(), msg_t()}; in jn_follows_and_precedes()
39 …<msg_t, tbb::flow::join_node<JoinOutputType>, tbb::flow::buffer_node<msg_t>>(messages_for_follows); in jn_follows_and_precedes()
44 auto b = [](msg_t) { return msg_t(); }; in jn_follows_and_precedes() argument
48 bool equal(msg_t, msg_t) const { return true; } in jn_follows_and_precedes() argument
51 …<msg_t, tbb::flow::join_node<JoinOutputType, tbb::flow::key_matching<msg_t, hash_compare>>, tbb::f… in jn_follows_and_precedes()
61 <msg_t, tbb::flow::join_node<JoinOutputType, tbb::flow::key_matching<msg_t, hash_compare>>> in jn_follows_and_precedes()
67 using JoinOutputType = std::tuple<msg_t, msg_t, msg_t>; in jn_msg_key_matching_follows_and_precedes()
69 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in jn_msg_key_matching_follows_and_precedes()
[all …]
H A Dtest_overwrite_node.cpp155 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
157 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
158 std::vector<msg_t> messages_for_precedes = {msg_t()}; in test_follows_and_precedes_api()
160 …follows_and_precedes_testing::test_follows<msg_t, tbb::flow::overwrite_node<msg_t>>(messages_for_f… in test_follows_and_precedes_api()
161 …follows_and_precedes_testing::test_precedes<msg_t, tbb::flow::overwrite_node<msg_t>>(messages_for_… in test_follows_and_precedes_api()
H A Dtest_write_once_node.cpp179 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
181 std::array<msg_t, 3> messages_for_follows= {msg_t(), msg_t(), msg_t()}; in test_follows_and_precedes_api()
182 std::vector<msg_t> messages_for_precedes = {msg_t()}; in test_follows_and_precedes_api()
184 …follows_and_precedes_testing::test_follows<msg_t, tbb::flow::write_once_node<msg_t>>(messages_for_… in test_follows_and_precedes_api()
185 …follows_and_precedes_testing::test_precedes<msg_t, tbb::flow::write_once_node<msg_t>>(messages_for… in test_follows_and_precedes_api()
H A Dtest_broadcast_node.cpp211 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
213 std::array<msg_t, 3> messages_for_follows= { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
214 std::vector<msg_t> messages_for_precedes = {msg_t()}; in test_follows_and_precedes_api()
216 …follows_and_precedes_testing::test_follows <msg_t, tbb::flow::broadcast_node<msg_t>>(messages_for_… in test_follows_and_precedes_api()
217 …follows_and_precedes_testing::test_precedes <msg_t, tbb::flow::broadcast_node<msg_t>>(messages_for… in test_follows_and_precedes_api()
H A Dtest_buffer_node.cpp427 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
429 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
430 std::vector<msg_t> messages_for_precedes = {msg_t(), msg_t(), msg_t()}; in test_follows_and_precedes_api()
432 …follows_and_precedes_testing::test_follows<msg_t, tbb::flow::buffer_node<msg_t>>(messages_for_foll… in test_follows_and_precedes_api()
433 …follows_and_precedes_testing::test_precedes<msg_t, tbb::flow::buffer_node<msg_t>>(messages_for_pre… in test_follows_and_precedes_api()
H A Dtest_continue_node.cpp299 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
301 std::array<msg_t, 3> messages_for_follows = { { msg_t(), msg_t(), msg_t() } }; in test_follows_and_precedes_api()
302 std::vector<msg_t> messages_for_precedes = { msg_t() }; in test_follows_and_precedes_api()
304 auto pass_through = [](const msg_t& msg) { return msg; }; in test_follows_and_precedes_api()
307 <msg_t, tbb::flow::continue_node<msg_t>> in test_follows_and_precedes_api()
311 <msg_t, tbb::flow::continue_node<msg_t>> in test_follows_and_precedes_api()
H A Dtest_limiter_node.cpp475 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
477 std::array<msg_t, 3> messages_for_follows= { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
478 std::vector<msg_t> messages_for_precedes = {msg_t()}; in test_follows_and_precedes_api()
481 <msg_t, tbb::flow::limiter_node<msg_t, msg_t>>(messages_for_follows, 1000); in test_follows_and_precedes_api()
483 <msg_t, tbb::flow::limiter_node<msg_t, msg_t>>(messages_for_precedes, 1000); in test_follows_and_precedes_api()
H A Dtest_function_node.cpp456 using msg_t = tbb::flow::continue_msg; in test_follows_and_precedes_api() typedef
458 std::array<msg_t, 3> messages_for_follows = { {msg_t(), msg_t(), msg_t()} }; in test_follows_and_precedes_api()
459 std::vector<msg_t> messages_for_precedes = { msg_t() }; in test_follows_and_precedes_api()
461 pass_through<msg_t> pass_msg; in test_follows_and_precedes_api()
464 <msg_t, tbb::flow::function_node<msg_t, msg_t>> in test_follows_and_precedes_api()
467 <msg_t, tbb::flow::function_node<msg_t, msg_t>> in test_follows_and_precedes_api()
H A Dtest_split_node.cpp299 using msg_t = std::tuple<int, float, double>; in test_follows_and_precedes_api() typedef
303 function_node<msg_t, msg_t> f1(g, unlimited, [](msg_t msg) { return msg; } ); in test_follows_and_precedes_api()
314 split_node<msg_t> following_node(follows(f1, f2, f3)); in test_follows_and_precedes_api()
319 split_node<msg_t> preceding_node(precedes(f4, f5, f6)); in test_follows_and_precedes_api()
324 msg_t msg(1, 2.2f, 3.3); in test_follows_and_precedes_api()
/oneTBB/doc/main/tbb_userguide/
H A Duse_nested_flow_graphs.rst20 node_t n1( h, [=]( msg_t ) { cout << "n1: " << i << "\n"; } );
21 node_t n2( h, [=]( msg_t ) { cout << "n2: " << i << "\n"; } );
22 node_t n3( h, [=]( msg_t ) { cout << "n3: " << i << "\n"; } );
23 node_t n4( h, [=]( msg_t ) { cout << "n4: " << i << "\n"; } );
101 node_t n1( h, [=]( msg_t ) { cout << "n1: " << i << "\n"; } );
102 node_t n2( h, [=]( msg_t ) { cout << "n2: " << i << "\n"; } );
103 node_t n3( h, [=]( msg_t ) { cout << "n3: " << i << "\n"; } );
104 node_t n4( h, [=]( msg_t ) { cout << "n4: " << i << "\n"; } );
H A DDependence_Graph.rst85 typedef const continue_msg & msg_t;
90 node_t A(g, [](msg_t){ a(); } );
91 node_t B(g, [](msg_t){ b(); } );
92 node_t C(g, [](msg_t){ c(); } );
93 node_t D(g, [](msg_t){ d(); } );
94 node_t E(g, [](msg_t){ e(); } );
95 node_t F(g, [](msg_t){ f(); } );