Home
last modified time | relevance | path

Searched refs:node_set (Results 1 – 5 of 5) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_set_impl.h61 struct node_set { struct
65 node_set(Nodes&... ns) : nodes(ns...) {} in node_set() argument
68 node_set(const node_set<order::undefined, Nodes2...>& set) : nodes(set.nodes) {} in node_set() function
107 node_set<order::following, FirstPredecessor, Predecessors...>
118 node_set<order::following, Predecessors...>
119 follows(node_set<order::undefined, Predecessors...>& predecessors_set) {
128 node_set<order::preceding, FirstSuccessor, Successors...>
139 node_set<order::preceding, Successors...>
140 precedes(node_set<order::undefined, Successors...>& successors_set) {
145 return node_set<order::preceding, Successors...>(successors_set);
[all …]
H A D_flow_graph_nodes_deduction.h110 struct decide_on_set<node_set<order::following, Node, Nodes...>> {
115 struct decide_on_set<node_set<order::preceding, Node, Nodes...>> {
164 join_node(const node_set<order::following, Predecessors...>&, Policy)
169 join_node(const node_set<order::preceding, Successor, Successors...>&, Policy)
173 join_node(const node_set<order::following, Predecessors...>)
178 join_node(const node_set<order::preceding, Successor, Successors...>)
190 indexer_node(const node_set<order::following, Predecessors...>&)
200 split_node(const node_set<order::following, Predecessor, Predecessors...>&)
204 split_node(const node_set<order::preceding, Successors...>&)
/oneTBB/doc/main/reference/
H A Dmake_edges_function.rst40 // node_set is an exposition-only name for the type returned from make_node_set function
43 void make_edges(node_set<Node, Nodes...>& set, NodeType& node);
46 void make_edges(NodeType& node, node_set<Node, Nodes...>& set);
H A Dfollows_and_precedes_functions.rst49 // node_set is an exposition-only name for the type returned from make_node_set function
52 /*unspecified*/ follows( node_set<NodeType, NodeTypes...>& set );
58 /*unspecified*/ precedes( node_set<NodeType, NodeTypes...>& set );
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h152 template<typename Order, typename... Args> struct node_set;
565 input_node( const node_set<order::preceding, Successors...>& successors, Body body ) in __TBB_requires()
800 function_node( const node_set<Args...>& nodes, size_t concurrency, Body body, in __TBB_requires()
1014 continue_node( const node_set<Args...>& nodes, Body body, in __TBB_requires()
1047 continue_node( const node_set<Args...>& nodes, int number_of_predecessors, in __TBB_requires()
1055 continue_node( const node_set<Args...>& nodes, int number_of_predecessors, in __TBB_requires()
1611 sequencer_node( const node_set<Args...>& nodes, const Sequencer& s) in __TBB_requires()
2018 limiter_node(const node_set<Args...>& nodes, size_t threshold) in limiter_node()
2306 template<typename...> class node_set,
2311 __TBB_NOINLINE_SYM join_node(const node_set<Args...>& nodes, Bodies... bodies) in join_node()
[all …]