std::_Deque_base< _Tp, _Alloc >(3cxx) | std::_Deque_base< _Tp, _Alloc >(3cxx) |
NAME¶
std::_Deque_base< _Tp, _Alloc > -SYNOPSIS¶
Inherited by std::deque< _Tp, _Alloc > [protected].Public Types¶
typedef _Alloc allocator_type
Public Member Functions¶
_Deque_base (size_t __num_elements)
Protected Types¶
enum { _S_initial_map_size }
Protected Member Functions¶
_Tp ** _M_allocate_map (size_t __n)
Protected Attributes¶
_Deque_impl _M_impl
Detailed Description¶
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.Member Function Documentation¶
template<typename _Tp , typename _Alloc > void std::_Deque_base< _Tp, _Alloc >::_M_initialize_map (size_t__num_elements) [protected]¶
Layout storage. Parameters:__num_elements The count of T's for
which to allocate space at first.
Returns:
Nothing.
The initial underlying memory layout is a bit complicated...
Definition at line 583 of file stl_deque.h.
References std::max().
Author¶
Generated automatically by Doxygen for libstdc++ from the source code.Sun Jan 6 2013 | libstdc++ |