_M_fill_insert()

template<typename _Tp, typename _Alloc>

void deque::_M_fill_insert ( iterator __pos, size_type __n, const value_type & __x )

protected

Definition at line 307 of file deque.tcc.

    {
      if (__pos._M_cur == this->_M_impl._M_start._M_cur)
      {
        iterator __new_start = _M_reserve_elements_at_front(__n);
        __try
          {
            std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start,
                                __x, _M_get_Tp_allocator());
            this->_M_impl._M_start = __new_start;
          }
        __catch(...)
          {
            _M_destroy_nodes(__new_start._M_node,
                         this->_M_impl._M_start._M_node);
            __throw_exception_again;
          }
      }
      else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)
      {
        iterator __new_finish = _M_reserve_elements_at_back(__n);
        __try
          {
            std::__uninitialized_fill_a(this->_M_impl._M_finish,
                                __new_finish, __x,
                                _M_get_Tp_allocator());
            this->_M_impl._M_finish = __new_finish;
          }
        __catch(...)
          {
            _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
                         __new_finish._M_node + 1);
            __throw_exception_again;
          }
      }
      else
      _M_insert_aux(__pos, __n, __x);
    }

References deque(), __catch, __throw_exception_again, __try, std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur, _M_destroy_nodes(), _M_get_Tp_allocator(), _M_impl, _M_insert_aux(), std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_node, _M_reserve_elements_at_back(), and _M_reserve_elements_at_front().

Here is the call graph for this function: