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

◆ _M_range_append()

template<typename _Tp, typename _Alloc>
template<typename _InputIterator, typename _Sentinel>
void deque::_M_range_append ( _InputIterator __first,
_Sentinel __last,
size_type __n )
protected

Definition at line 611 of file deque.tcc.

614 {
616 __try
617 {
619 this->_M_impl._M_finish,
621 this->_M_impl._M_finish = __new_finish;
622 }
623 __catch(...)
624 {
625 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1,
626 __new_finish._M_node + 1);
628 }
629 }
#define _GLIBCXX_MOVE(__val)
Definition move.h:198
#define __catch(X)
::_Deque_iterator< _OTp, _OTp &, _OTp * > __uninitialized_copy_a(::_Deque_iterator< _ITp, _IRef, _IPtr > __first, ::_Deque_iterator< _ITp, _IRef, _IPtr > __last, ::_Deque_iterator< _OTp, _OTp &, _OTp * > __result, allocator< _Tp > &)
Definition deque.tcc:1558
_Deque_impl _M_impl
Definition stl_deque.h:616
_Tp_alloc_type & _M_get_Tp_allocator() noexcept
Definition stl_deque.h:571
void _M_destroy_nodes(_Map_pointer __nstart, _Map_pointer __nfinish) noexcept
Definition stl_deque.h:699
iterator _M_reserve_elements_at_back(size_type __n)
Memory-handling helpers for the previous internal insert functions.
Definition stl_deque.h:2284
_Base::iterator iterator
Definition stl_deque.h:822
A standard container using fixed-size memory allocation and constant-time manipulation of elements at...
Definition stl_deque.h:792

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

Referenced by _M_range_insert_aux().

Here is the call graph for this function:
Here is the caller graph for this function: