Linux and UNIX Man Pages

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::array< _Tp, _Nm >(3)				     Library Functions Manual					 std::array< _Tp, _Nm >(3)

NAME
std::array< _Tp, _Nm > - SYNOPSIS
Public Types typedef ::__array_traits< _Tp, _Nm > _AT_Type" typedef const value_type * const_iterator typedef const value_type * 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 value_type * 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) constexpr const_reference at (size_type __n) const reference back () constexpr const_reference back () const iterator begin () noexcept const_iterator begin () const noexcept const_iterator cbegin () const noexcept const_iterator cend () const noexcept const_reverse_iterator crbegin () const noexcept const_reverse_iterator crend () const noexcept pointer data () noexcept const_pointer data () const noexcept constexpr bool empty () const noexcept iterator end () noexcept const_iterator end () const noexcept void fill (const value_type &__u) reference front () constexpr const_reference front () const constexpr size_type max_size () const noexcept void noexcept (noexcept(swap(std::declval< _Tp & >(), std::declval< _Tp & >()))) reference operator[] (size_type __n) constexpr const_reference operator[] (size_type __n) const noexcept reverse_iterator rbegin () noexcept const_reverse_iterator rbegin () const noexcept reverse_iterator rend () noexcept const_reverse_iterator rend () const noexcept constexpr size_type size () const noexcept Public Attributes _AT_Type::_Type _M_elems 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. Template Parameters: Tp Type of element. Required to be a complete type. N Number of elements. Definition at line 81 of file array. Author Generated automatically by Doxygen for libstdc++ from the source code. libstdc++ Tue Jun 10 2014 std::array< _Tp, _Nm >(3)
Man Page