Lines Matching full:__parent
1183 __find_equal_key(__node_base_pointer& __parent, const key_type& __k);
1185 __find_equal_key(__node_base_const_pointer& __parent, const key_type& __k) const;
1189 // Set __parent to parent of null leaf
1194 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_pointer& __parent,
1208 __parent = static_cast<__node_base_pointer>(__nd);
1209 return __parent->__left_;
1218 __parent = static_cast<__node_base_pointer>(__nd);
1219 return __parent->__right_;
1224 __parent = static_cast<__node_base_pointer>(__nd);
1225 return __parent;
1229 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1230 return __parent->__left_;
1234 // Set __parent to parent of null leaf and
1239 map<_Key, _Tp, _Compare, _Allocator>::__find_equal_key(__node_base_const_pointer& __parent,
1253 __parent = static_cast<__node_base_pointer>(__nd);
1254 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1263 __parent = static_cast<__node_base_pointer>(__nd);
1264 return const_cast<const __node_base_const_pointer&>(__parent->__right_);
1269 __parent = static_cast<__node_base_pointer>(__nd);
1270 return __parent;
1274 __parent = static_cast<__node_base_pointer>(__tree_.__end_node());
1275 return const_cast<const __node_base_const_pointer&>(__parent->__left_);
1370 __node_base_pointer __parent;
1371 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1376 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1388 __node_base_pointer __parent;
1389 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1394 __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1406 __node_base_pointer __parent;
1407 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1419 __node_base_const_pointer __parent;
1420 __node_base_const_pointer __child = __find_equal_key(__parent, __k);
