std::array(3)

NAME
std::array - A standard container for storing a fixed size sequence of elements.

SYNOPSIS

  Public Types
typedef const value_type * const_iterator
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 & reference
typedef std::reverse_iterator< iterator > reverse_iterator
typedef std::size_t size_type
typedef _Tp value_type

  Public Member Functions
const_reference at (size_type __n) const
reference at (size_type __n)
const_reference back () const
reference back ()
const_iterator begin () const
iterator begin ()
const_iterator cbegin () const
const_iterator cend () const
const_reverse_iterator crbegin () const
const_reverse_iterator crend () const
const _Tp * data () const
_Tp * data ()
bool empty () const
const_iterator end () const
iterator end ()
void fill (const value_type &__u)
const_reference front () const
reference front ()
size_type max_size () const
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 ()
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 54 of file tr1_impl/array.

Author

Generated automatically by Doxygen for libstdc++ from the source code.