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

◆ _M_destroy_data_aux()

template<typename _Tp, typename _Alloc>
void deque::_M_destroy_data_aux ( iterator __first,
iterator __last )
protected

Definition at line 1036 of file deque.tcc.

1038 {
1039 for (_Map_pointer __node = __first._M_node + 1;
1040 __node < __last._M_node; ++__node)
1043
1044 if (__first._M_node != __last._M_node)
1045 {
1046 std::_Destroy(__first._M_cur, __first._M_last,
1048 std::_Destroy(__last._M_first, __last._M_cur,
1050 }
1051 else
1052 std::_Destroy(__first._M_cur, __last._M_cur,
1054 }
constexpr void _Destroy(_ForwardIterator __first, _ForwardIterator __last)
static size_t _S_buffer_size() noexcept
Definition stl_deque.h:831
_Tp_alloc_type & _M_get_Tp_allocator() noexcept
Definition stl_deque.h:571
_Base::_Map_pointer _Map_pointer
Definition stl_deque.h:814
A standard container using fixed-size memory allocation and constant-time manipulation of elements at...
Definition stl_deque.h:792

References deque(), std::_Destroy(), std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_cur, std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_first, _M_get_Tp_allocator(), std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_last, std::_Deque_iterator< _Tp, _Ref, _Ptr >::_M_node, and _S_buffer_size().

Here is the call graph for this function: