Lines Matching refs:__h

1223         iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1225         return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1233         iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1235         return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1269         iterator insert_or_assign(const_iterator __h, const key_type& __k, _Vp&& __v)
1277         return emplace_hint(__h, __k, _VSTD::forward<_Vp>(__v));
1282         iterator insert_or_assign(const_iterator __h, key_type&& __k, _Vp&& __v)
1290         return emplace_hint(__h, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1507     __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1508     __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
1509     __h.get_deleter().__first_constructed = true;
1510     __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().second));
1511     __h.get_deleter().__second_constructed = true;
1512     return _LIBCPP_EXPLICIT_MOVE(__h);  // explicitly moved for C++03
1524         __node_holder __h = __construct_node_with_key(__k);
1525         __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1526         __r = __h.release();