Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

std::_deque_base(3) [debian man page]

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 typedef _Deque_iterator< _Tp, const _Tp &, const _Tp * > const_iterator" typedef _Deque_iterator< _Tp, _Tp &, _Tp * > iterator" Public Member Functions _Deque_base (size_t __num_elements) _Deque_base (const allocator_type &__a, size_t __num_elements) _Deque_base (const allocator_type &__a) _Deque_base (_Deque_base &&__x) allocator_type get_allocator () const Protected Types enum { _S_initial_map_size } typedef _Alloc::template rebind< _Tp * >::other _Map_alloc_type" typedef _Alloc::template rebind< _Tp >::other _Tp_alloc_type" Protected Member Functions _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 _Tp_alloc_type & _M_get_Tp_allocator () const _Tp_alloc_type & _M_get_Tp_allocator () const void _M_initialize_map (size_t) 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 438 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 574 of file stl_deque.h. References std::max(). Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Nov 27 2012 std::_Deque_base< _Tp, _Alloc >(3cxx)

Check Out this Related Man Page

std::valarray< _Tp >(3cxx)												std::valarray< _Tp >(3cxx)

NAME
std::valarray< _Tp > - SYNOPSIS
Public Types typedef _Tp value_type Public Member Functions valarray () valarray (size_t) valarray (const _Tp &, size_t) valarray (const _Tp *__restrict__, size_t) valarray (const valarray &) valarray (const slice_array< _Tp > &) valarray (const gslice_array< _Tp > &) valarray (const mask_array< _Tp > &) valarray (const indirect_array< _Tp > &) valarray (initializer_list< _Tp >) template<class _Dom > valarray (const _Expr< _Dom, _Tp > &__e) template<typename _Tp> valarray (const _Tp *__restrict__ __p, size_t __n) _Expr< _ValFunClos< _ValArray, _Tp >, _Tp > apply (_Tp func(_Tp)) const " _Expr< _RefFunClos< _ValArray, _Tp >, _Tp > apply (_Tp func(const _Tp &)) const " valarray< _Tp > cshift (int) const _Tp max () const _Tp min () const _UnaryOp< __logical_not >::_Rt operator! () const valarray< _Tp > & operator%= (const _Tp &) valarray< _Tp > & operator%= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator%= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator&= (const _Tp &) valarray< _Tp > & operator&= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator&= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator*= (const _Tp &) valarray< _Tp > & operator*= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator*= (const _Expr< _Dom, _Tp > &) _UnaryOp< __unary_plus >::_Rt operator+ () const valarray< _Tp > & operator+= (const _Tp &) valarray< _Tp > & operator+= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator+= (const _Expr< _Dom, _Tp > &) _UnaryOp< __negate >::_Rt operator- () const valarray< _Tp > & operator-= (const _Tp &) valarray< _Tp > & operator-= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator-= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator/= (const _Tp &) valarray< _Tp > & operator/= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator/= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator<<= (const _Tp &) valarray< _Tp > & operator<<= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator<<= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator= (const valarray< _Tp > &) valarray< _Tp > & operator= (const _Tp &) valarray< _Tp > & operator= (const slice_array< _Tp > &) valarray< _Tp > & operator= (const gslice_array< _Tp > &) valarray< _Tp > & operator= (const mask_array< _Tp > &) valarray< _Tp > & operator= (const indirect_array< _Tp > &) valarray & operator= (initializer_list< _Tp >) template<class _Dom > valarray< _Tp > & operator= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator>>= (const _Tp &) valarray< _Tp > & operator>>= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator>>= (const _Expr< _Dom, _Tp > &) _Tp & operator[] (size_t) const _Tp & operator[] (size_t) const _Expr< _SClos< _ValArray, _Tp > , _Tp > operator[] (slice) const " slice_array< _Tp > operator[] (slice) _Expr< _GClos< _ValArray, _Tp > , _Tp > operator[] (const gslice &) const " gslice_array< _Tp > operator[] (const gslice &) valarray< _Tp > operator[] (const valarray< bool > &) const mask_array< _Tp > operator[] (const valarray< bool > &) _Expr< _IClos< _ValArray, _Tp > , _Tp > operator[] (const valarray< size_t > &) const " indirect_array< _Tp > operator[] (const valarray< size_t > &) valarray< _Tp > & operator^= (const _Tp &) valarray< _Tp > & operator^= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator^= (const _Expr< _Dom, _Tp > &) valarray< _Tp > & operator|= (const _Tp &) valarray< _Tp > & operator|= (const valarray< _Tp > &) template<class _Dom > valarray< _Tp > & operator|= (const _Expr< _Dom, _Tp > &) _UnaryOp< __bitwise_not >::_Rt operator~ () const void resize (size_t __size, _Tp __c=_Tp()) valarray< _Tp > shift (int) const size_t size () const _Tp sum () const Friends class _Array< _Tp > Detailed Description template<class _Tp>class std::valarray< _Tp > Smart array designed to support numeric processing. A valarray is an array that provides constraints intended to allow for effective optimization of numeric array processing by reducing the aliasing that can result from pointer representations. It represents a one-dimensional array from which different multidimensional subsets can be accessed and modified. Parameters: Tp Type of object in the array. Definition at line 116 of file valarray. Constructor &; Destructor Documentation template<class _Tp> std::valarray< _Tp >::valarray (const _Tp *__restrict__, size_t) Construct an array initialized to the first n elements of t. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Nov 27 2012 std::valarray< _Tp >(3cxx)
Man Page