_M_range_initialize() [2/2]

template<typename _Tp, typename _Alloc>

template<typename _InputIterator>

void deque::_M_range_initialize ( _InputIterator __first, _InputIterator __last, std::input_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 419 of file deque.tcc.

      {
      this->_M_initialize_map(0);
      __try
        {
          for (; __first != __last; ++__first)
#if __cplusplus >= 201103L
            emplace_back(*__first);
#else
            push_back(*__first);
#endif
        }
      __catch(...)
        {
          clear();
          __throw_exception_again;
        }
      }

References deque(), __catch, __throw_exception_again, __try, _M_initialize_map(), clear(), emplace_back(), and push_back().

Here is the call graph for this function: