Home
last modified time | relevance | path

Searched refs:__child (Results 1 – 3 of 3) sorted by relevance

/external/libcxx/include/
D__tree978 __node_base_pointer& __child,
1708 __node_base_pointer& __child,
1714 __child = __new_node;
1717 __tree_balance_after_insert(__end_node()->__left_, __child);
1743 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
1744 __node_pointer __r = static_cast<__node_pointer>(__child);
1746 if (__child == nullptr)
1748 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1762 __node_base_pointer& __child = __find_equal(__p, __parent, __h->__value_);
1763 __node_pointer __r = static_cast<__node_pointer>(__child);
[all …]
Dmap1371 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1372 __node_pointer __r = static_cast<__node_pointer>(__child);
1373 if (__child == nullptr)
1376 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1389 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1390 __node_pointer __r = static_cast<__node_pointer>(__child);
1391 if (__child == nullptr)
1394 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1407 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1409 if (__child == nullptr)
[all …]
/external/stlport/stlport/stl/
D_algo.c1971 for (_Distance __child = 1; __child < __n; ++__child) { in __is_heap() local
1972 if (__comp(__first[__parent], __first[__child])) { in __is_heap()
1973 …_STLP_VERBOSE_ASSERT(!__comp(__first[__child], __first[__parent]), _StlMsg_INVALID_STRICT_WEAK_PRE… in __is_heap()
1976 if ((__child & 1) == 0) in __is_heap()