Lines Matching refs:__h

1299         iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1301         return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1309         iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1311         return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1344     _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1348           __h.__i_, __k, __k, _VSTD::forward<_Vp>(__v));
1357     _LIBCPP_INLINE_VISIBILITY iterator insert_or_assign(const_iterator __h,
1361           __h.__i_, __k, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1621     __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1622     __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
1623     __h.get_deleter().__first_constructed = true;
1624     __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().second));
1625     __h.get_deleter().__second_constructed = true;
1626     return __h;
1638         __node_holder __h = __construct_node_with_key(__k);
1639         __tree_.__insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
1640         __r = __h.release();