Linux & Unix Commands - Search Man Pages
std::array(3) [debian man page]
std::array< _Tp, _Nm >(3cxx) std::array< _Tp, _Nm >(3cxx)
NAME
std::array< _Tp, _Nm > -
SYNOPSIS
Public Types
typedef const value_type * const_iterator
typedef const _Tp * const_pointer
typedef const value_type & const_reference
typedef std::reverse_iterator
< const_iterator > const_reverse_iterator"
typedef std::ptrdiff_t difference_type
typedef value_type * iterator
typedef _Tp * pointer
typedef value_type & reference
typedef std::reverse_iterator
< iterator > reverse_iterator"
typedef std::size_t size_type
typedef _Tp value_type
Public Member Functions
reference at (size_type __n)
const_reference at (size_type __n) const
reference back ()
const_reference back () const
iterator begin ()
const_iterator begin () const
const_iterator cbegin () const
const_iterator cend () const
const_reverse_iterator crbegin () const
const_reverse_iterator crend () const
_Tp * data ()
const _Tp * data () const
constexpr bool empty () const
iterator end ()
const_iterator end () const
void fill (const value_type &__u)
reference front ()
const_reference front () const
constexpr size_type max_size () const
reference operator[] (size_type __n)
const_reference operator[] (size_type __n) const
reverse_iterator rbegin ()
const_reverse_iterator rbegin () const
reverse_iterator rend ()
const_reverse_iterator rend () const
constexpr size_type size () const
void swap (array &__other)
Public Attributes
value_type _M_instance [_Nm?_Nm:1]
Detailed Description
template<typename _Tp, std::size_t _Nm>struct std::array< _Tp, _Nm >
A standard container for storing a fixed size sequence of elements.
Meets the requirements of a container, a reversible container, and a sequence.
Sets support random access iterators.
Parameters:
Tp Type of element. Required to be a complete type.
N Number of elements.
Definition at line 60 of file array.
Author
Generated automatically by Doxygen for libstdc++ from the source code.
libstdc++ Tue Nov 27 2012 std::array< _Tp, _Nm >(3cxx)
Check Out this Related Man Page
std::__profile::deque< _Tp, _Allocator >(3cxx) std::__profile::deque< _Tp, _Allocator >(3cxx)
NAME
std::__profile::deque< _Tp, _Allocator > -
SYNOPSIS
Inherits deque< _Tp, _Allocator >.
Public Types
typedef _Allocator allocator_type
typedef _Base::const_iterator const_iterator
typedef _Base::const_pointer const_pointer
typedef _Base::const_reference const_reference
typedef
_Base::const_reverse_iterator const_reverse_iterator"
typedef _Base::difference_type difference_type
typedef _Base::iterator iterator
typedef _Base::pointer pointer
typedef _Base::reference reference
typedef _Base::reverse_iterator reverse_iterator
typedef _Base::size_type size_type
typedef _Tp value_type
Public Member Functions
deque (const _Allocator &__a=_Allocator())
deque (size_type __n)
deque (size_type __n, const _Tp &__value, const _Allocator &__a=_Allocator())
template<class _InputIterator > deque (_InputIterator __first, _InputIterator __last, const _Allocator &__a=_Allocator())
deque (const deque &__x)
deque (const _Base &__x)
deque (deque &&__x)
deque (initializer_list< value_type > __l, const allocator_type &__a=allocator_type())
_Base & _M_base ()
const _Base & _M_base () const
template<class _InputIterator > void assign (_InputIterator __first, _InputIterator __last)
void assign (size_type __n, const _Tp &__t)
void assign (initializer_list< value_type > __l)
reference back ()
const_reference back () const
iterator begin ()
const_iterator begin () const
const_iterator cbegin () const
const_iterator cend () const
void clear ()
const_reverse_iterator crbegin () const
const_reverse_iterator crend () const
template<typename... _Args> iterator emplace (iterator __position, _Args &&...__args)
template<typename... _Args> void emplace_back (_Args &&...__args)
template<typename... _Args> void emplace_front (_Args &&...__args)
iterator end ()
const_iterator end () const
iterator erase (iterator __position)
iterator erase (iterator __first, iterator __last)
reference front ()
const_reference front () const
iterator insert (iterator __position, const _Tp &__x)
iterator insert (iterator __position, _Tp &&__x)
void insert (iterator __p, initializer_list< value_type > __l)
void insert (iterator __position, size_type __n, const _Tp &__x)
template<class _InputIterator > void insert (iterator __position, _InputIterator __first, _InputIterator __last)
deque & operator= (const deque &__x)
deque & operator= (deque &&__x)
deque & operator= (initializer_list< value_type > __l)
reference operator[] (size_type __n)
const_reference operator[] (size_type __n) const
void pop_back ()
void pop_front ()
void push_back (const _Tp &__x)
void push_back (_Tp &&__x)
void push_front (const _Tp &__x)
void push_front (_Tp &&__x)
reverse_iterator rbegin ()
const_reverse_iterator rbegin () const
reverse_iterator rend ()
const_reverse_iterator rend () const
void resize (size_type __sz)
void resize (size_type __sz, const _Tp &__c)
void swap (deque &__x)
Detailed Description
template<typename _Tp, typename _Allocator = std::allocator<_Tp>>class std::__profile::deque< _Tp, _Allocator >
Class std::deque wrapper with performance instrumentation.
Definition at line 40 of file profile/deque.
Author
Generated automatically by Doxygen for libstdc++ from the source code.
libstdc++ Tue Nov 27 2012 std::__profile::deque< _Tp, _Allocator >(3cxx)
Man Page