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

◆ _M_range_insert_aux() [1/2]

template<typename _Tp, typename _Alloc>
template<typename _ForwardIterator>
void deque::_M_range_insert_aux ( iterator __pos,
_ForwardIterator __first,
_ForwardIterator __last,
std::forward_iterator_tag  )
protected

Definition at line 643 of file deque.tcc.

647 {
649 if (__builtin_expect(__n == 0, 0))
650 return;
651
652 if (__pos._M_cur == this->_M_impl._M_start._M_cur)
654 else if (__pos._M_cur == this->_M_impl._M_finish._M_cur)
656 else
658 }
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
_Elt_pointer _M_cur
Definition stl_deque.h:145
_Deque_impl _M_impl
Definition stl_deque.h:616
void _M_range_append(_InputIterator __first, _Sentinel __last, size_type __n)
Definition deque.tcc:612
size_t size_type
Definition stl_deque.h:826
void _M_range_prepend(_InputIterator __first, _Sentinel __last, size_type __n)
Definition deque.tcc:590
iterator _M_insert_aux(iterator __pos, const value_type &__x)
Definition stl_deque.h:2196
A standard container using fixed-size memory allocation and constant-time manipulation of elements at...
Definition stl_deque.h:792

References deque(), std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur, _M_insert_aux(), _M_range_append(), _M_range_prepend(), and std::distance().

Here is the call graph for this function: