Searched refs:__child (Results 1 – 3 of 3) sorted by relevance
| /freebsd-13-stable/contrib/llvm-project/libcxx/include/__algorithm/ |
| HD | sift_down.h | 39 difference_type __child = __start - __first; in __sift_down() local 41 if (__len < 2 || (__len - 2) / 2 < __child) in __sift_down() 44 __child = 2 * __child + 1; in __sift_down() 45 _RandomAccessIterator __child_i = __first + __child; in __sift_down() 47 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down() 50 ++__child; in __sift_down() 64 if ((__len - 2) / 2 < __child) in __sift_down() 68 __child = 2 * __child + 1; in __sift_down() 69 __child_i = __first + __child; in __sift_down() 71 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + difference_type(1)))) { in __sift_down() [all …]
|
| /freebsd-13-stable/contrib/llvm-project/libcxx/include/ |
| HD | __tree | 1178 …__insert_node_at(__parent_pointer __parent, __node_base_pointer& __child, __node_base_pointer __ne… 1758 …__parent_pointer __parent, __node_base_pointer& __child, __node_base_pointer __new_node) _NOEXCEPT… 1763 __child = __new_node; 1766 std::__tree_balance_after_insert(__end_node()->__left_, __child); 1775 __node_base_pointer& __child = __find_equal(__parent, __k); 1776 __node_pointer __r = static_cast<__node_pointer>(__child); 1778 if (__child == nullptr) { 1780 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 1794 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k); 1795 __node_pointer __r = static_cast<__node_pointer>(__child); [all …]
|
| HD | map | 1547 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1548 __node_pointer __r = static_cast<__node_pointer>(__child); 1549 if (__child == nullptr) { 1551 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get())); 1562 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k); 1563 if (__child == nullptr) 1565 return static_cast<__node_pointer>(__child)->__value_.__get_value().second; 1571 __node_base_pointer __child = __tree_.__find_equal(__parent, __k); 1572 if (__child == nullptr) 1574 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
|