_M_range_initialize() [1/2]

template<typename _Tp, typename _Alloc>

template<typename _ForwardIterator>

void deque::_M_range_initialize ( _ForwardIterator __first, _ForwardIterator __last, std::forward_iterator_tag  )

protected

Fills the deque with whatever is in [first,last).

Parameters

__first	An input iterator.
__last	An input iterator.

Returns

Nothing.

If the iterators are actually forward iterators (or better), then the memory layout can be done all at once. Else we move forward using push_back on each value from the iterator.

Definition at line 443 of file deque.tcc.

      {
      const size_type __n = std::distance(__first, __last);
      this->_M_initialize_map(_S_check_init_len(__n, _M_get_Tp_allocator()));
 
      _Map_pointer __cur_node;
      __try
        {
          for (__cur_node = this->_M_impl._M_start._M_node;
             __cur_node < this->_M_impl._M_finish._M_node;
             ++__cur_node)
            {
            if (__n < _S_buffer_size())
              __builtin_unreachable(); // See PR 100516
 
            _ForwardIterator __mid = __first;
            std::advance(__mid, _S_buffer_size());
            std::__uninitialized_copy_a(__first, __mid, *__cur_node,
                                  _M_get_Tp_allocator());
            __first = __mid;
            }
          std::__uninitialized_copy_a(__first, __last,
                              this->_M_impl._M_finish._M_first,
                              _M_get_Tp_allocator());
        }
      __catch(...)
        {
          std::_Destroy(this->_M_impl._M_start,
                    iterator(*__cur_node, __cur_node),
                    _M_get_Tp_allocator());
          __throw_exception_again;
        }
      }

References deque(), __catch, __throw_exception_again, __try, std::__uninitialized_copy_a(), std::_Destroy(), _M_get_Tp_allocator(), _M_impl, _M_initialize_map(), _S_buffer_size(), _S_check_init_len(), std::advance(), and std::distance().

Here is the call graph for this function: