Lines Matching refs:__child

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);
2187     if (__child == nullptr)
2194         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2225     __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
2226     __node_pointer __r = static_cast<__node_pointer>(__child);
2228     if (__child == nullptr)
2230         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2245     __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __h->__value_);
2246     __node_pointer __r = static_cast<__node_pointer>(__child);
2247     if (__child == nullptr)
2249         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2262     __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__h->__value_));
2263     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2275     __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__h->__value_));
2276     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2302     __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__v));
2304     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2313     __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__v));
2315     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2325     __node_base_pointer& __child = __find_equal(__parent, __nd->__value_);
2326     __node_pointer __r = static_cast<__node_pointer>(__child);
2328     if (__child == nullptr)
2330         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2344     __node_base_pointer& __child = __find_equal(__p, __parent, __nd->__value_);
2345     __node_pointer __r = static_cast<__node_pointer>(__child);
2346     if (__child == nullptr)
2348         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2359 …  __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__nd->__value_));
2360     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2370 …  __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__nd->__value_));
2371     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2402     __node_base_pointer& __child = __find_equal(__parent,
2404     if (__child != nullptr)
2406             iterator(static_cast<__node_pointer>(__child)),
2409     __insert_node_at(__parent, __child,
2428     __node_base_pointer& __child = __find_equal(__hint, __parent, __dummy,
2430     __node_pointer __r = static_cast<__node_pointer>(__child);
2431     if (__child == nullptr)
2433         __insert_node_at(__parent, __child,
2477         __node_base_pointer& __child =
2480         if (__child != nullptr)
2483         __insert_node_at(__parent, __child,
2498     __node_base_pointer& __child = __find_leaf_high(
2500     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
2517     __node_base_pointer& __child = __find_leaf(__hint, __parent,
2519     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
2537         __node_base_pointer& __child = __find_leaf_high(
2541         __insert_node_at(__parent, __child,