|
_Tp ** | _M_allocate_map (size_t __n) |
|
_Tp * | _M_allocate_node () |
|
void | _M_create_nodes (_Tp **__nstart, _Tp **__nfinish) |
|
void | _M_deallocate_map (_Tp **__p, size_t __n) |
|
void | _M_deallocate_node (_Tp *__p) |
|
void | _M_destroy_nodes (_Tp **__nstart, _Tp **__nfinish) |
|
_Map_alloc_type | _M_get_map_allocator () const _GLIBCXX_NOEXCEPT |
|
_Tp_alloc_type & | _M_get_Tp_allocator () _GLIBCXX_NOEXCEPT |
|
const _Tp_alloc_type & | _M_get_Tp_allocator () const _GLIBCXX_NOEXCEPT |
|
void | _M_initialize_map (size_t) |
|
template<typename _Tp, typename _Alloc>
class std::_Deque_base< _Tp, _Alloc >
Deque base class. This class provides the unified face for deque's allocation. This class's constructor and destructor allocate and deallocate (but do not initialize) storage. This makes exception safety easier.
Nothing in this class ever constructs or destroys an actual Tp element. (Deque handles that itself.) Only/All memory management is performed here.
Definition at line 440 of file stl_deque.h.