Lines Matching refs:__parent
1358 void __insert_node_at(__parent_pointer __parent,
1424 __find_leaf_low(__parent_pointer& __parent, const key_type& __v);
1426 __find_leaf_high(__parent_pointer& __parent, const key_type& __v);
1429 __parent_pointer& __parent, const key_type& __v);
1434 __find_equal(__parent_pointer& __parent, const _Key& __v);
1437 __find_equal(__parent_pointer& __parent, const _Key& __v) const {
1438 return const_cast<__tree*>(this)->__find_equal(__parent, __v);
1442 __find_equal(const_iterator __hint, __parent_pointer& __parent,
1844 // Set __parent to parent of null leaf
1848 __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(__parent_pointer& __parent,
1862 __parent = static_cast<__parent_pointer>(__nd);
1872 __parent = static_cast<__parent_pointer>(__nd);
1873 return __parent->__left_;
1878 __parent = static_cast<__parent_pointer>(__end_node());
1879 return __parent->__left_;
1883 // Set __parent to parent of null leaf
1887 __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(__parent_pointer& __parent,
1901 __parent = static_cast<__parent_pointer>(__nd);
1902 return __parent->__left_;
1911 __parent = static_cast<__parent_pointer>(__nd);
1917 __parent = static_cast<__parent_pointer>(__end_node());
1918 return __parent->__left_;
1925 // Set __parent to parent of null leaf
1930 __parent_pointer& __parent,
1942 __parent = static_cast<__parent_pointer>(__hint.__ptr_);
1943 return __parent->__left_;
1947 __parent = static_cast<__parent_pointer>(__prior.__ptr_);
1952 return __find_leaf_high(__parent, __v);
1955 return __find_leaf_low(__parent, __v);
1959 // Set __parent to parent of null leaf
1965 __tree<_Tp, _Compare, _Allocator>::__find_equal(__parent_pointer& __parent,
1980 __parent = static_cast<__parent_pointer>(__nd);
1981 return __parent->__left_;
1990 __parent = static_cast<__parent_pointer>(__nd);
1996 __parent = static_cast<__parent_pointer>(__nd);
2001 __parent = static_cast<__parent_pointer>(__end_node());
2002 return __parent->__left_;
2009 // Set __parent to parent of null leaf
2016 __parent_pointer& __parent,
2029 __parent = static_cast<__parent_pointer>(__hint.__ptr_);
2030 return __parent->__left_;
2034 __parent = static_cast<__parent_pointer>(__prior.__ptr_);
2039 return __find_equal(__parent, __v);
2050 __parent = static_cast<__parent_pointer>(__hint.__ptr_);
2055 __parent = static_cast<__parent_pointer>(__next.__ptr_);
2056 return __parent->__left_;
2060 return __find_equal(__parent, __v);
2063 __parent = static_cast<__parent_pointer>(__hint.__ptr_);
2070 __parent_pointer __parent, __node_base_pointer& __child,
2075 __new_node->__parent_ = __parent;
2089 __parent_pointer __parent;
2090 __node_base_pointer& __child = __find_equal(__parent, __k);
2096 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2109 __parent_pointer __parent;
2111 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __k);
2117 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2145 __parent_pointer __parent;
2146 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
2151 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2164 __parent_pointer __parent;
2166 __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __h->__value_);
2170 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2182 __parent_pointer __parent;
2183 __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__h->__value_));
2184 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2195 __parent_pointer __parent;
2196 __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__h->__value_));
2197 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2205 __parent_pointer __parent;
2206 __node_base_pointer& __child = __find_equal(__parent, _NodeTypes::__get_key(__v));
2212 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2224 __parent_pointer __parent;
2225 … __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__nd->__value_));
2226 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2235 __parent_pointer __parent;
2236 … __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__nd->__value_));
2237 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__nd));
2267 __parent_pointer __parent;
2268 __node_base_pointer& __child = __find_equal(__parent,
2275 __insert_node_at(__parent, __child,
2292 __parent_pointer __parent;
2294 __node_base_pointer& __child = __find_equal(__hint, __parent, __dummy,
2299 __insert_node_at(__parent, __child,
2342 __parent_pointer __parent;
2344 __find_equal(__parent, _NodeTypes::__get_key(__src_ptr->__value_));
2349 __insert_node_at(__parent, __child,
2363 __parent_pointer __parent;
2365 __parent, _NodeTypes::__get_key(__ptr->__value_));
2366 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
2382 __parent_pointer __parent;
2383 __node_base_pointer& __child = __find_leaf(__hint, __parent,
2385 __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__ptr));
2402 __parent_pointer __parent;
2404 __parent, _NodeTypes::__get_key(__src_ptr->__value_));
2407 __insert_node_at(__parent, __child,