Provided by: libstdc++6-4.4-doc_4.4.7-8ubuntu1_all 
NAME
std::array< _Tp, _Nm > -
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
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
bool empty () const
iterator end ()
const_iterator end () const
void fill (const value_type &__u)
reference front ()
const_reference front () const
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
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 49 of file tr1_impl/array.
Author
Generated automatically by Doxygen for libstdc++ from the source code.