Searched refs:__child (Results 1 – 7 of 7) sorted by relevance
| /external/libcxx/include/ |
| D | __tree | 1381 __node_base_pointer& __child,
2124 __parent_pointer __parent, __node_base_pointer& __child,
2131 __child = __new_node;
2134 __tree_balance_after_insert(__end_node()->__left_, __child);
2151 __node_base_pointer& __child = __find_equal(__parent, __k);
2152 __node_pointer __r = static_cast<__node_pointer>(__child);
2154 if (__child == nullptr)
2161 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2185 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k);
2186 __node_pointer __r = static_cast<__node_pointer>(__child);
[all …]
|
| D | map | 1520 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1521 __node_pointer __r = static_cast<__node_pointer>(__child);
1522 if (__child == nullptr)
1525 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1538 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1540 if (__child == nullptr)
1543 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
1551 __node_base_pointer __child = __tree_.__find_equal(__parent, __k);
1553 if (__child == nullptr)
1556 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
|
| D | algorithm | 4831 difference_type __child = __start - __first;
4833 if (__len < 2 || (__len - 2) / 2 < __child)
4836 __child = 2 * __child + 1;
4837 _RandomAccessIterator __child_i = __first + __child;
4839 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4842 ++__child;
4857 if ((__len - 2) / 2 < __child)
4861 __child = 2 * __child + 1;
4862 __child_i = __first + __child;
4864 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
[all …]
|
| /external/llvm-project/libcxx/include/ |
| D | __tree | 1360 __node_base_pointer& __child,
2071 __parent_pointer __parent, __node_base_pointer& __child,
2078 __child = __new_node;
2081 __tree_balance_after_insert(__end_node()->__left_, __child);
2091 __node_base_pointer& __child = __find_equal(__parent, __k);
2092 __node_pointer __r = static_cast<__node_pointer>(__child);
2094 if (__child == nullptr)
2097 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2112 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k);
2113 __node_pointer __r = static_cast<__node_pointer>(__child);
[all …]
|
| D | map | 1557 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1558 __node_pointer __r = static_cast<__node_pointer>(__child);
1559 if (__child == nullptr)
1562 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1575 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1576 if (__child == nullptr)
1578 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
1586 __node_base_pointer __child = __tree_.__find_equal(__parent, __k);
1587 if (__child == nullptr)
1589 return static_cast<__node_pointer>(__child)->__value_.__get_value().second;
|
| D | algorithm | 4935 difference_type __child = __start - __first;
4937 if (__len < 2 || (__len - 2) / 2 < __child)
4940 __child = 2 * __child + 1;
4941 _RandomAccessIterator __child_i = __first + __child;
4943 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
4946 ++__child;
4961 if ((__len - 2) / 2 < __child)
4965 __child = 2 * __child + 1;
4966 __child_i = __first + __child;
4968 if ((__child + 1) < __len && __comp(*__child_i, *(__child_i + 1))) {
[all …]
|
| /external/libabigail/src/ |
| D | abg-viz-dot.cc | 101 dot::add_edge(const node_base& __parent, const node_base& __child) in add_edge() argument
107 _M_sstream << "Node" << __child._M_count; in add_edge()
|