Home
last modified time | relevance | path

Searched refs:__root (Results 1 – 2 of 2) sorted by relevance

/llvm-project-15.0.7/libcxx/include/
H A D__tree64 algorithms taking a parameter named __root should assume that __root
126 // __root == nullptr is a proper tree. Returns true is __root is a proper
279 // __x == __root or == a direct or indirect child of __root.
2539 __root = static_cast<__node_pointer>(__root->__left_);
2542 __root = static_cast<__node_pointer>(__root->__right_);
2559 __root = static_cast<__node_pointer>(__root->__left_);
2562 __root = static_cast<__node_pointer>(__root->__right_);
2579 __root = static_cast<__node_pointer>(__root->__left_);
2582 __root = static_cast<__node_pointer>(__root->__right_);
2599 __root = static_cast<__node_pointer>(__root->__left_);
[all …]
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dparallel_backend_tbb.h471 spawn_root_and_wait(__root_task<_Fn>& __root) in spawn_root_and_wait() argument
473 tbb::task::spawn_root_and_wait(*__root._M_task); in spawn_root_and_wait()
603 spawn_root_and_wait(__root_task<_Fn>& __root) in spawn_root_and_wait() argument
605 … tbb::detail::d1::execute_and_wait(*__root._M_func_task, __root._M_context, __root._M_wait_object, in spawn_root_and_wait()
606 __root._M_context); in spawn_root_and_wait()
829 _RandomAccessIterator2 __z_beg, bool __x_orig, bool __y_orig, bool __root) in __merge_func() argument
831 _M_comp(__comp), _M_leaf_merge(__leaf_merge), _M_nsort(__nsort), _root(__root), in __merge_func()
1108 bool __root, _Compare __comp, _LeafSort __leaf_sort, _SizeType __nsort, in __stable_sort_func() argument
1111 _M_leaf_sort(__leaf_sort), _M_root(__root), _M_nsort(__nsort) in __stable_sort_func()
1177 __task::spawn_root_and_wait(__root);
[all …]