Searched refs:m2 (Results 1 – 6 of 6) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | communicate_with_nodes.rst | 48 function_node< int, int > m2( g2, 1, [&](int i) -> int {
49 cout << "m2\n";
54 make_edge( m1, m2 );
62 // The following call returns after m1 & m2
71 runs its body and then sends a message to node m2. Next, node m2 runs
74 consider m2 to be a predecessor of n1 since no edge exists.
83 g2. The call to g2.wait_for_all returns after both m1 and m2 are done,
|
| H A D | use_nested_flow_graphs.rst | 38 function_node< int, int > m2( h, unlimited, []( int j ) -> int {
39 cout << "m2: " << j << "\n";
50 make_edge( m1, m2 );
52 make_edge( m2, m4 );
80 function_node< int, int > m2( h, unlimited, []( int j ) -> int {
81 cout << "m2: " << j << "\n";
92 make_edge( m1, m2 );
94 make_edge( m2, m4 );
|
| /oneTBB/examples/test_all/fibonacci/ |
| H A D | fibonacci.cpp | 294 Matrix2x2 m1, m2; in operator ()() local
298 while (!queue->try_pop(m2)) in operator ()()
300 m1 = m1 * m2; // process them in operator ()()
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_unordered_map.cpp | 144 TMap m2(v.begin(), v.end(), 4, degenerate_hash<int>()); in test_deduction_guides() local
145 static_assert(std::is_same<decltype(m2), TMap<int, std::string, degenerate_hash<int>>>::value); in test_deduction_guides()
|
| H A D | conformance_concurrent_hash_map.cpp | 1106 TMap m2(v.begin(), v.end(), compare); in TestDeductionGuides() local
1107 static_assert(std::is_same<decltype(m2), TMap<Key, Value, Compare>>::value); in TestDeductionGuides()
|
| /oneTBB/test/tbb/ |
| H A D | test_eh_algorithms.cpp | 1331 FilterSet( tbb::filter_mode m1, tbb::filter_mode m2, bool t1, bool t2 ) in FilterSet()
1332 : mode1(m1), mode2(m2), throw1(t1), throw2(t2) in FilterSet()
|