Lines Matching refs:h

19            graph h;
20            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"; } );
29            h.wait_for_all();
33            graph h;
34            function_node< int, int > m1( h, unlimited, []( int j ) -> int {
38            function_node< int, int > m2( h, unlimited, []( int j ) -> int {
42            function_node< int, int > m3( h, unlimited, []( int j ) -> int {
46            function_node< int, int > m4( h, unlimited, []( int j ) -> int {
55            h.wait_for_all();
75      graph h;
76        function_node< int, int > m1( h, unlimited, []( int j ) -> int {
80        function_node< int, int > m2( h, unlimited, []( int j ) -> int {
84        function_node< int, int > m3( h, unlimited, []( int j ) -> int {
88        function_node< int, int > m4( h, unlimited, []( int j ) -> int {
100            graph h;
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"; } );
110            h.wait_for_all();
115            h.wait_for_all(); // optional since h is not destroyed
125 It is only necessary to call ``h.wait_for_all()`` at the end of each
128 of ``b``, it was necessary to call ``h.wait_for_all`` at the end of each
131 return without waiting for ``h`` to become idle.