Home
last modified time | relevance | path

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

/oneTBB/test/tbb/
H A Dtest_priority_queue_node.cpp56 tbb::flow::priority_queue_node<T> &my_q;
68 tbb::flow::priority_queue_node<T> &my_q;
83 tbb::flow::priority_queue_node<T> &my_q;
111 tbb::flow::priority_queue_node<T> q(g); in test_reservation()
169 tbb::flow::priority_queue_node<T> q(g); in test_parallel()
170 tbb::flow::priority_queue_node<T> q2(g); in test_parallel()
249 tbb::flow::priority_queue_node<T> q(g); in test_serial()
358 priority_queue_node<int> pq0(g); in test_deduction_guides()
362 priority_queue_node pq1(follows(br)); in test_deduction_guides()
368 priority_queue_node pq3(precedes(br)); in test_deduction_guides()
[all …]
H A Dtest_profiling.cpp207 tbb::flow::priority_queue_node<int> node(g);
H A Dtest_tbb_header.cpp219 TestTypeDefinitionPresence( flow::priority_queue_node<int> ); in DefinitionPresence()
H A Dtest_flow_graph_whitebox.cpp764 TestBufferingNode< tbb::flow::priority_queue_node<int> >("priority_queue_node"); in __anon8a33875c0902()
H A Dtest_eh_flow_graph.cpp1250 typedef tbb::flow::priority_queue_node<BufferItemType,LessBodyType> PrqType; in run_priority_queue_node_test()
/oneTBB/test/conformance/
H A Dconformance_priority_queue_node.cpp32 conformance::test_forwarding_single_push<oneapi::tbb::flow::priority_queue_node<int>>();
38 conformance::test_buffering<oneapi::tbb::flow::priority_queue_node<int>, int>();
45 conformance::test_copy_ctor_for_buffering_nodes<oneapi::tbb::flow::priority_queue_node<int>>();
51 conformance::test_inheritance<oneapi::tbb::flow::priority_queue_node<int>, int, int>();
52 conformance::test_inheritance<oneapi::tbb::flow::priority_queue_node<void*>, void*, void*>();
60 oneapi::tbb::flow::priority_queue_node<int, std::greater<int>> testing_node(g);
H A Dconformance_graph.cpp175 test_buffering_nodes_rf_reset_protocol<priority_queue_node<int>>();
204 oneapi::tbb::flow::priority_queue_node<int> pq(g);
H A Dconformance_composite_node.cpp105 oneapi::tbb::flow::priority_queue_node<int> pq(g);
/oneTBB/doc/main/tbb_userguide/
H A Dbroadcast_or_send.rst14 - priority_queue_node
47 priority_queue_node< int > q(g);
60 their input. To make a priority_queue_node work properly with a
64 priority_queue_node.
67 In the above example, each message buffered by the priority_queue_node
72 priority_queue_node broadcasts to all successors. What if some, but not
78 priority_queue_node only contains "9" when a successor node, f1, accepts
92 creating one priority_queue_node for each function_node, and pushing
116 priority_queue_node< int > q1(g);
117 priority_queue_node< int > q2(g);
H A DPredefined_Node_Types.rst36 * - buffer_node, queue_node, priority_queue_node, and sequencer_node.
/oneTBB/doc/main/reference/
H A Dconstructors_for_nodes.rst74 // priority_queue_node
75 explicit priority_queue_node(follows(...), const Compare& comp = Compare());
76 explicit priority_queue_node(precedes(...), const Compare& compare = Compare());
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_nodes_deduction.h141 priority_queue_node(const NodeSet&, const Compare&)
142 ->priority_queue_node<decide_on_set_t<NodeSet>, Compare>;
145 priority_queue_node(const NodeSet&)
146 ->priority_queue_node<decide_on_set_t<NodeSet>, std::less<decide_on_set_t<NodeSet>>>;
/oneTBB/test/common/
H A Dtest_follows_and_precedes_api.h133 struct testing_method_precedes<tbb::flow::priority_queue_node<Args...>> : std::integral_constant<in…
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h1658 class priority_queue_node : public buffer_node<T> {
1663 typedef priority_queue_node class_type;
1668 __TBB_NOINLINE_SYM explicit priority_queue_node( graph &g, const Compare& comp = Compare() )
1677 priority_queue_node(const node_set<Args...>& nodes, const Compare& comp = Compare())
1678 : priority_queue_node(nodes.graph_reference(), comp) {
1684 __TBB_NOINLINE_SYM priority_queue_node( const priority_queue_node &src ) in priority_queue_node() function
3247 inline void set_name(const priority_queue_node<T, Compare>& node, const char *name) { in set_name()
3338 using detail::d1::priority_queue_node;