Lines Matching full:__parent
977 void __insert_node_at(__node_base_pointer __parent,
1043 __find_leaf_low(typename __node_base::pointer& __parent, const value_type& __v);
1045 __find_leaf_high(typename __node_base::pointer& __parent, const value_type& __v);
1048 typename __node_base::pointer& __parent, const value_type& __v);
1051 __find_equal(typename __node_base::pointer& __parent, const _Key& __v);
1054 __find_equal(const_iterator __hint, typename __node_base::pointer& __parent,
1484 // Set __parent to parent of null leaf
1488 __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(typename __node_base::pointer& __parent,
1502 __parent = static_cast<__node_base_pointer>(__nd);
1503 return __parent->__right_;
1512 __parent = static_cast<__node_base_pointer>(__nd);
1513 return __parent->__left_;
1518 __parent = static_cast<__node_base_pointer>(__end_node());
1519 return __parent->__left_;
1523 // Set __parent to parent of null leaf
1527 __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(typename __node_base::pointer& __parent,
1541 __parent = static_cast<__node_base_pointer>(__nd);
1542 return __parent->__left_;
1551 __parent = static_cast<__node_base_pointer>(__nd);
1552 return __parent->__right_;
1557 __parent = static_cast<__node_base_pointer>(__end_node());
1558 return __parent->__left_;
1565 // Set __parent to parent of null leaf
1570 typename __node_base::pointer& __parent,
1582 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1583 return __parent->__left_;
1587 __parent = static_cast<__node_base_pointer>(__prior.__ptr_);
1588 return __parent->__right_;
1592 return __find_leaf_high(__parent, __v);
1595 return __find_leaf_low(__parent, __v);
1599 // Set __parent to parent of null leaf
1605 __tree<_Tp, _Compare, _Allocator>::__find_equal(typename __node_base::pointer& __parent,
1619 __parent = static_cast<__node_base_pointer>(__nd);
1620 return __parent->__left_;
1629 __parent = static_cast<__node_base_pointer>(__nd);
1630 return __parent->__right_;
1635 __parent = static_cast<__node_base_pointer>(__nd);
1636 return __parent;
1640 __parent = static_cast<__node_base_pointer>(__end_node());
1641 return __parent->__left_;
1648 // Set __parent to parent of null leaf
1655 typename __node_base::pointer& __parent,
1667 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1668 return __parent->__left_;
1672 __parent = static_cast<__node_base_pointer>(__prior.__ptr_);
1673 return __parent->__right_;
1677 return __find_equal(__parent, __v);
1688 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1689 return __parent->__right_;
1693 __parent = static_cast<__node_base_pointer>(__next.__ptr_);
1694 return __parent->__left_;
1698 return __find_equal(__parent, __v);
1701 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1702 return __parent;
1707 __tree<_Tp, _Compare, _Allocator>::__insert_node_at(__node_base_pointer __parent,
1713 __new_node->__parent_ = __parent;
1742 __node_base_pointer __parent;
1743 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
1748 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1761 __node_base_pointer __parent;
1762 __node_base_pointer& __child = __find_equal(__p, __parent, __h->__value_);
1766 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1778 __node_base_pointer __parent;
1779 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1780 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1791 __node_base_pointer __parent;
1792 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1793 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1829 __node_base_pointer __parent;
1830 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1831 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1841 __node_base_pointer __parent;
1842 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1843 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1866 __node_base_pointer __parent;
1867 __node_base_pointer& __child = __find_equal(__parent, __v);
1873 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1884 __node_base_pointer __parent;
1885 __node_base_pointer& __child = __find_equal(__p, __parent, __v);
1890 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1900 __node_base_pointer __parent;
1901 __node_base_pointer& __child = __find_leaf_high(__parent, __v);
1903 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1911 __node_base_pointer __parent;
1912 __node_base_pointer& __child = __find_leaf(__p, __parent, __v);
1914 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1922 __node_base_pointer __parent;
1923 __node_base_pointer& __child = __find_equal(__parent, __nd->__value_);
1928 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1940 __node_base_pointer __parent;
1941 __node_base_pointer& __child = __find_equal(__p, __parent, __nd->__value_);
1945 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1955 __node_base_pointer __parent;
1956 __node_base_pointer& __child = __find_leaf_high(__parent, __nd->__value_);
1957 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1966 __node_base_pointer __parent;
1967 __node_base_pointer& __child = __find_leaf(__p, __parent, __nd->__value_);
1968 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
