operator=() [2/2]

template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>

_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > & std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::operator=

(

const _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc > &

__x

)

Definition at line 2468 of file stl_tree.h.

    {
      if (this != std::__addressof(__x))
      {
        // Note that _Key may be a constant type.
#if __cplusplus >= 201103L
        if (_Node_alloc_traits::_S_propagate_on_copy_assign())
          {
            auto& __this_alloc = this->_M_get_Node_allocator();
            auto& __that_alloc = __x._M_get_Node_allocator();
            if (!_Node_alloc_traits::_S_always_equal()
              && __this_alloc != __that_alloc)
            {
              // Replacement allocator cannot free existing storage, we need
              // to erase nodes first.
              clear();
              std::__alloc_on_copy(__this_alloc, __that_alloc);
            }
          }
#endif
 
        _Reuse_or_alloc_node __roan(*this);
        _M_impl._M_reset();
        _M_impl._M_key_compare = __x._M_impl._M_key_compare;
        if (__x._M_root())
          _M_root() = _M_copy<__as_lvalue>(__x, __roan);
      }
 
      return *this;
    }

References _Rb_tree(), std::__addressof(), _M_copy(), _M_get_Node_allocator(), _M_impl, std::_Rb_tree_key_compare< _Key_compare >::_M_key_compare, _M_root(), __gnu_cxx::__alloc_traits< _Node_allocator >::_S_always_equal(), __gnu_cxx::__alloc_traits< _Node_allocator >::_S_propagate_on_copy_assign(), and clear().

Here is the call graph for this function: