Home
last modified time | relevance | path

Searched refs:split_node (Results 1 – 14 of 14) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_split_node.cpp314 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()
368 typedef tbb::flow::split_node<TupleType> split_node_type;
381 split_node<tuple_type> s0(g); in test_deduction_guides()
383 split_node s1(s0); in test_deduction_guides()
384 static_assert(std::is_same_v<decltype(s1), split_node<tuple_type>>); in test_deduction_guides()
390 split_node s2(follows(b1, b2)); in test_deduction_guides()
391 static_assert(std::is_same_v<decltype(s2), split_node<tuple_type>>); in test_deduction_guides()
393 split_node s3(precedes(b3, b4)); in test_deduction_guides()
394 static_assert(std::is_same_v<decltype(s3), split_node<tuple_type>>); in test_deduction_guides()
H A Dtest_profiling.cpp235 tbb::flow::split_node<std::tuple<int>> node(g);
H A Dtest_tbb_header.cpp212 TestTypeDefinitionPresence( flow::split_node<intpair> ); in DefinitionPresence()
H A Dtest_flow_graph.cpp236 tbb::flow::split_node< std::tuple< int, int > > sp_n(my_graph); in operator ()()
H A Dtest_composite_node.cpp347 tbb::flow::split_node< my_tuple_t > s;
H A Dtest_flow_graph_whitebox.cpp60 typedef tbb::flow::split_node<std::tuple<int> > snode_type; in TestSplitNode()
H A Dtest_eh_flow_graph.cpp1750 typedef typename tbb::flow::split_node<InputTuple> TestSplitType; in run_split_node_test()
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst94 // split_node
95 explicit split_node(follows(...));
96 explicit split_node(precedes(...));
/oneTBB/test/conformance/
H A Dconformance_split_node.cpp28 using my_split_type = oneapi::tbb::flow::split_node<my_input_tuple>;
99 oneapi::tbb::flow::split_node<std::tuple<int>> node1(g);
106 oneapi::tbb::flow::split_node<std::tuple<int>> node_copy(node1);
H A Dconformance_composite_node.cpp95 oneapi::tbb::flow::split_node< std::tuple<int, int> > s(g);
162 split_node<std::tuple<int, int, int, int>> s(g);
H A Dconformance_graph.cpp195 oneapi::tbb::flow::split_node< std::tuple<int> > s(g);
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_nodes_deduction.h200 split_node(const node_set<order::following, Predecessor, Predecessors...>&)
201 ->split_node<typename Predecessor::output_type>;
204 split_node(const node_set<order::preceding, Successors...>&)
205 ->split_node<std::tuple<typename Successors::input_type...>>;
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h923 class split_node : public graph_node, public receiver<TupleType> {
934 __TBB_NOINLINE_SYM explicit split_node(graph &g) in split_node() function
944 …__TBB_NOINLINE_SYM split_node(const node_set<Args...>& nodes) : split_node(nodes.graph_reference()… in split_node() function
949 __TBB_NOINLINE_SYM split_node(const split_node& other) in split_node() function
3282 inline void set_name(const split_node<TupleType>& node, const char *name) { in set_name()
3325 using detail::d1::split_node;
/oneTBB/doc/main/tbb_userguide/
H A DPredefined_Node_Types.rst40 * - split_node