libstdc++
GNU C++ library
Loading...
Searching...
No Matches

◆ _M_emplace_hint_unique()

template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>
template<typename... _Args>
auto std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_M_emplace_hint_unique ( const_iterator __pos,
_Args &&... __args ) -> iterator

Definition at line 3250 of file stl_tree.h.

3253 {
3255 auto __res = _M_get_insert_hint_unique_pos(__pos, __z._M_key());
3256 if (__res.second)
3257 return __z._M_insert(__res);
3258 return iterator(__res.first);
3259 }
_Node_traits::_Iterator iterator
Definition stl_tree.h:1446
pair< _Base_ptr, _Base_ptr > _M_get_insert_hint_unique_pos(const_iterator __pos, const key_type &__k)
Definition stl_tree.h:2953

References _Rb_tree(), _M_get_insert_hint_unique_pos(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Auto_node::_M_insert(), std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::_Auto_node::_M_key(), and std::forward().

Here is the call graph for this function: