Home
last modified time | relevance | path

Searched refs:node_t (Results 1 – 3 of 3) sorted by relevance

/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.rst84 typedef continue_node< continue_msg > node_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(); } );
/oneTBB/test/tbb/
H A Dtest_async_node.cpp718 using node_t = async_node<input_t, output_t>; in test_follows() typedef
722 AsyncActivity<node_t> async_activity(3); in test_follows()
732 …node_t node(follows(preds[0], preds[1], preds[2]), unlimited, [&](int input, node_t::gateway_type&… in test_follows()
756 using node_t = async_node<input_t, output_t>; in test_precedes() typedef
760 AsyncActivity<node_t> async_activity(1); in test_precedes()
766 node_t node(precedes(successors[0]), unlimited, [&](int input, node_t::gateway_type& gtw) { in test_precedes()