Home | History | Annotate | Download | only in include

Lines Matching full:__parent

990     void __insert_node_at(__node_base_pointer __parent,
1056 __find_leaf_low(typename __node_base::pointer& __parent, const value_type& __v);
1058 __find_leaf_high(typename __node_base::pointer& __parent, const value_type& __v);
1061 typename __node_base::pointer& __parent, const value_type& __v);
1064 __find_equal(typename __node_base::pointer& __parent, const _Key& __v);
1067 __find_equal(const_iterator __hint, typename __node_base::pointer& __parent,
1481 // Set __parent to parent of null leaf
1485 __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(typename __node_base::pointer& __parent,
1499 __parent = static_cast<__node_base_pointer>(__nd);
1500 return __parent->__right_;
1509 __parent = static_cast<__node_base_pointer>(__nd);
1510 return __parent->__left_;
1515 __parent = static_cast<__node_base_pointer>(__end_node());
1516 return __parent->__left_;
1520 // Set __parent to parent of null leaf
1524 __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(typename __node_base::pointer& __parent,
1538 __parent = static_cast<__node_base_pointer>(__nd);
1539 return __parent->__left_;
1548 __parent = static_cast<__node_base_pointer>(__nd);
1549 return __parent->__right_;
1554 __parent = static_cast<__node_base_pointer>(__end_node());
1555 return __parent->__left_;
1562 // Set __parent to parent of null leaf
1567 typename __node_base::pointer& __parent,
1579 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1580 return __parent->__left_;
1584 __parent = static_cast<__node_base_pointer>(__prior.__ptr_);
1585 return __parent->__right_;
1589 return __find_leaf_high(__parent, __v);
1592 return __find_leaf_low(__parent, __v);
1596 // Set __parent to parent of null leaf
1602 __tree<_Tp, _Compare, _Allocator>::__find_equal(typename __node_base::pointer& __parent,
1616 __parent = static_cast<__node_base_pointer>(__nd);
1617 return __parent->__left_;
1626 __parent = static_cast<__node_base_pointer>(__nd);
1627 return __parent->__right_;
1632 __parent = static_cast<__node_base_pointer>(__nd);
1633 return __parent;
1637 __parent = static_cast<__node_base_pointer>(__end_node());
1638 return __parent->__left_;
1645 // Set __parent to parent of null leaf
1652 typename __node_base::pointer& __parent,
1664 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1665 return __parent->__left_;
1669 __parent = static_cast<__node_base_pointer>(__prior.__ptr_);
1670 return __parent->__right_;
1674 return __find_equal(__parent, __v);
1685 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1686 return __parent->__right_;
1690 __parent = static_cast<__node_base_pointer>(__next.__ptr_);
1691 return __parent->__left_;
1695 return __find_equal(__parent, __v);
1698 __parent = static_cast<__node_base_pointer>(__hint.__ptr_);
1699 return __parent;
1704 __tree<_Tp, _Compare, _Allocator>::__insert_node_at(__node_base_pointer __parent,
1710 __new_node->__parent_ = __parent;
1739 __node_base_pointer __parent;
1740 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
1745 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1758 __node_base_pointer __parent;
1759 __node_base_pointer& __child = __find_equal(__p, __parent, __h->__value_);
1763 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1775 __node_base_pointer __parent;
1776 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1777 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1788 __parent;
1789 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1790 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1826 __node_base_pointer __parent;
1827 __node_base_pointer& __child = __find_leaf_high(__parent, __h->__value_);
1828 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1838 __node_base_pointer __parent;
1839 __node_base_pointer& __child = __find_leaf(__p, __parent, __h->__value_);
1840 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1863 __node_base_pointer __parent;
1864 __node_base_pointer& __child = __find_equal(__parent, __v);
1870 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1881 __node_base_pointer __parent;
1882 __node_base_pointer& __child = __find_equal(__p, __parent, __v);
1887 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1897 __node_base_pointer __parent;
1898 __node_base_pointer& __child = __find_leaf_high(__parent, __v);
1900 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1908 __node_base_pointer __parent;
1909 __node_base_pointer& __child = __find_leaf(__p, __parent, __v);
1911 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1919 __node_base_pointer __parent;
1920 __node_base_pointer& __child = __find_equal(__parent, __nd->__value_);
1925 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1937 __node_base_pointer __parent;
1938 __node_base_pointer& __child = __find_equal(__p, __parent, __nd->__value_);
1942 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1952 __node_base_pointer __parent;
1953 __node_base_pointer& __child = __find_leaf_high(__parent, __nd->__value_);
1954 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
1963 __node_base_pointer __parent;
1964 __node_base_pointer& __child = __find_leaf(__p, __parent, __nd->__value_);
1965 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));