Lines Matching full:__parent
1346 __find_equal_key(__node_base_pointer& __parent, const key_type& __k);
1348 __find_equal_key(__node_base_const_pointer& __parent, const key_type& __k) const;
1352 // Set __parent to parent of null leaf
1357 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_pointer& __parent,
1371 __parent = static_cast<__node_base_pointer>(__nd);
1372 return __parent->__left_;
1381 __parent = static_cast<__node_base_pointer>(__nd);
1382 return __parent->__right_;
1387 __parent = static_cast<__node_base_pointer>(__nd);
1388 return __parent;
1392 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1393 return __parent->__left_;
1397 // Set __parent to parent of null leaf and
1402 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_const_pointer& __parent,
1416 __parent = static_cast<__node_base_pointer>(__nd);
1417 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1426 __parent = static_cast<__node_base_pointer>(__nd);
1427 return const_cast<const __node_base_const_pointer&>(__parent->__right_);
1432 __parent = static_cast<__node_base_pointer>(__nd);
1433 return __parent;
1437 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1438 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1533 __node_base_pointer __parent;
1534 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1539 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1551 __node_base_pointer __parent;
1552 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1557 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1569 __node_base_pointer __parent;
1570 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1582 __node_base_const_pointer __parent;
1583 __node_base_const_pointer __child = __find_equal_key(__parent, __k);
