Home
last modified time | relevance | path

Searched refs:f2 (Results 1 – 15 of 15) sorted by relevance

/oneTBB/doc/main/tbb_userguide/
H A Dbroadcast_or_send.rst40 function_node< int, int, rejecting > f2( g, 1, []( int i ) -> int {
42 cout << "f2 consuming " << i << "\n";
51 make_edge( q, f2 );
62 buffer policy set to rejecting. So, f1 and f2 do not internally buffer
68 is sent to either f1 or f2, but not both.
79 "9" but another successor node, f2, rejects it. Later a value "100"
80 arrives and f2 is available to accept messages. Should f2 receive "9"
87 order, by either f1 or f2.
90 But what if you really do want both f1 and f2 to receive all of the
111 cout << "f2 consuming " << i << "\n";
[all …]
H A Dcancel_a_graph.rst23 function_node< int, int > f2( g, 1,
35 make_edge( f1, f2 );
36 make_edge( f2, f3 );
46 execute will not start. So in the example above, f2 will print both the
64 function_node< int, int > f2( g, 1,
77 make_edge( f1, f2 );
78 make_edge( f2, f3 );
H A Dcatching_exceptions.rst23 function_node< int, int > f2( g, 1,
33 make_edge( f1, f2 );
34 make_edge( f2, f3 );
40 In the code above, the second function_node, f2, throws an exception
51 function_node< int, int > f2( g, 1,
79 reaches either f2 or f3.
H A DFlow_Graph_Single_Vs_Broadcast.rst49 function_node<continue_msg> f2(g,serial,fn_body1(b2));
57 make_edge(buf1,f2);
65 remove_edge(buf1,f2);
73 make_edge(bn,f2);
H A Duse_nested_algorithms.rst23 ``read_next_matrix``, ``f1``, ``f2``, ``consume_f1`` and ``consume_f2`` are not provided
50 b[i] = f2(a[i]);
H A DWorking_on_the_Assembly_Line_pipeline.rst177 oneapi::tbb::filter<TextSlice*,TextSlice*> f2(oneapi::tbb::filter_mode::parallel,
181 oneapi::tbb::filter<void,void> f = f1 & f2 & f3;
/oneTBB/include/oneapi/tbb/
H A Dparallel_invoke.h79 …invoke_subroot_task(const F1& f1, const F2& f2, const F3& f3, wait_context& wait_ctx, task_group_c… in invoke_subroot_task()
83 f2_invoker(f2, *this), in invoke_subroot_task()
146 …_separation(wait_context& root_wait_ctx, task_group_context& context, const F1& f1, const F2& f2) { in invoke_recursive_separation() argument
150 function_invoker<F2, invoke_root_task> invoker2(f2, root); in invoke_recursive_separation()
157 …it_context& root_wait_ctx, task_group_context& context, const F1& f1, const F2& f2, const F3& f3) { in invoke_recursive_separation() argument
161 function_invoker<F2, invoke_root_task> invoker2(f2, root); in invoke_recursive_separation()
172 const F1& f1, const F2& f2, const F3& f3, const Fs&... fs) { in invoke_recursive_separation() argument
174 …auto sub_root = alloc.new_object<invoke_subroot_task<F1, F2, F3>>(f1, f2, f3, root_wait_ctx, conte… in invoke_recursive_separation()
/oneTBB/test/conformance/
H A Dconformance_function_node.cpp45 function_node f2(g, unlimited, body, rejecting()); in test_deduction_guides_common() local
46 static_assert(std::is_same_v<decltype(f2), function_node<int, int, rejecting>>); in test_deduction_guides_common()
55 function_node f5(follows(f2), unlimited, body); in test_deduction_guides_common()
90 function_node<OutputType1, OutputType2> f2(g, unlimited, body2); in test_fn_invoke_basic() local
93 make_edge(f1, f2); in test_fn_invoke_basic()
94 make_edge(f2, buf); in test_fn_invoke_basic()
H A Dconformance_join_node.cpp126 f2( g, oneapi::tbb::flow::unlimited, [](const float &f) { return f; } ); in __anon798ebb9d0302() variable
146 oneapi::tbb::flow::make_edge(f2, oneapi::tbb::flow::input_port<1>(testing_node));
156 f2.try_put(1.5f);
161 f2.try_put(2.5f);
166 f2.try_put(3.5f);
183 f2.try_put(1);
279 function_node<std::size_t, test_invoke::SmartID<std::size_t>> f2(g, unlimited, generator); in test_invoke_basic() local
290 make_edge(f2, input_port<1>(j)); in test_invoke_basic()
296 f2.try_put(objects_count - i - 1); in test_invoke_basic()
H A Dconformance_indexer_node.cpp95 oneapi::tbb::flow::function_node<float, float> f2( g, oneapi::tbb::flow::unlimited, variable
119 oneapi::tbb::flow::make_edge(f2, oneapi::tbb::flow::input_port<1>(testing_node));
124 f2.try_put(3);
/oneTBB/test/tbb/
H A Dtest_composite_node.cpp94 tbb::flow::function_node< int, int > f2; member
98 …en = false) : base_type(g), f1(g, tbb::flow::unlimited, passthru_body() ), f2(g, tbb::flow::unlimi… in tiny_node()
99 tbb::flow::make_edge(f1, f2); in tiny_node()
102 std::tuple<tbb::flow::function_node< int, int >& > output_tuple(f2); in tiny_node()
106 base_type::add_nodes(f1, f2); in tiny_node()
108 base_type::add_visible_nodes(f1, f2); in tiny_node()
118 …CHECK_MESSAGE( (&tbb::flow::output_port<0>(t) == &t.f2), "f2 not bound to output port 0 in composi… in test_tiny()
122 …CHECK_MESSAGE( (&std::get<0>(t1.output_ports()) == &t1.f2), "f2 not bound to output port 0 in comp… in test_tiny()
129 …CHECK_MESSAGE( (&tbb::flow::output_port<0>(t2) == &t2.f2), "f2 not bound to output port 0 in compo… in test_tiny()
H A Dtest_split_node.cpp304 auto f2(f1); in test_follows_and_precedes_api() local
314 split_node<msg_t> following_node(follows(f1, f2, f3)); in test_follows_and_precedes_api()
321 make_edge(f2, preceding_node); in test_follows_and_precedes_api()
326 f2.try_put(msg); in test_follows_and_precedes_api()
H A Dtest_flow_graph_whitebox.cpp958 function_node<int, int> f2(g, unlimited, body2);
962 make_edge(f1, f2);
963 make_edge(f2, b);
H A Dtest_task_arena.cpp1320 Functor<void> f2; in Test() local
1321 arena().execute(f2); in Test()
1327 tbb::this_task_arena::isolate(f2); in Test()
/oneTBB/examples/test_all/fibonacci/
H A Dfibonacci.cpp231 NumbersTable::const_accessor f1, f2; // same as iterators in operator ()() local
232 if (!Fib.find(f1, i - 1) || !Fib.find(f2, i - 2)) { in operator ()()
237 value sum = f1->second + f2->second; in operator ()()