Searched refs:m_right (Results 1 – 2 of 2) sorted by relevance
| /oneTBB/test/tbb/ |
| H A D | test_partitioner.h | 279 TreeNode *m_left, *m_right; member
284 m_left(left), m_right(right) { } in TreeNode()
359 push_subnode(root_node->m_right, node); in push_subnode()
364 if (is_subnode(root_node->m_right, node)) { in push_subnode()
365 push_subnode(root_node->m_right, node); in push_subnode()
396 if (node->m_right) in remove_node_recursively()
397 remove_node_recursively(node->m_right); in remove_node_recursively()
413 if (node->m_right)
414 visualize_node(node->m_right, indent + 1);
421 && compare_nodes(node1->m_right, node2->m_right); in compare_nodes()
[all …]
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | parallel_scan.h | 180 sum_node *m_right; member
192 m_right(nullptr), in sum_node()
251 …task* right_child = this->create_child(Range(m_range,split()), *m_left_sum, m_right, m_left_sum, m… in execute()
295 …load() == static_cast<unsigned int>((m_result.m_left!=nullptr)+(m_result.m_right!=nullptr)), nullp… in execute()
302 if( right_zombie || m_result.m_right ) { in execute()
307 if( right_zombie && !m_sum_slot && !m_result.m_right ) { in execute()
487 …auto& right_child = *alloc.new_object<start_scan>(/*m_return_slot=*/result->m_right, *this, alloc); in execute()
|