Lines Matching full:__parent
1182 __find_equal_key(__node_base_pointer& __parent, const key_type& __k);
1184 __find_equal_key(__node_base_const_pointer& __parent, const key_type& __k) const;
1188 // Set __parent to parent of null leaf
1193 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_pointer& __parent,
1207 __parent = static_cast<__node_base_pointer>(__nd);
1208 return __parent->__left_;
1217 __parent = static_cast<__node_base_pointer>(__nd);
1218 return __parent->__right_;
1223 __parent = static_cast<__node_base_pointer>(__nd);
1224 return __parent;
1228 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1229 return __parent->__left_;
1233 // Set __parent to parent of null leaf and
1238 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_const_pointer& __parent,
1252 __parent = static_cast<__node_base_pointer>(__nd);
1253 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1262 __parent = static_cast<__node_base_pointer>(__nd);
1263 return const_cast<const __node_base_const_pointer&>(__parent->__right_);
1268 __parent = static_cast<__node_base_pointer>(__nd);
1269 return __parent;
1273 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1274 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1369 __node_base_pointer __parent;
1370 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1375 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1387 __node_base_pointer __parent;
1388 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1393 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1405 __node_base_pointer __parent;
1406 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1418 __node_base_const_pointer __parent;
1419 __node_base_const_pointer __child = __find_equal_key(__parent, __k);
