A template class holding a C - array of constant size. More...
#include "Array.hpp"
Inheritance diagram for Array< T, N >:Public Member Functions | |
| Array (std::initializer_list< T > init) | |
assignment with type conversion | |
| Array & | operator= (const Array &)=default |
| template<typename T2 > | |
| Array & | operator= (const Array< T2, N > &that) |
| template<typename T2 > | |
| Array & | operator= (const T2(&that)[N]) |
| template<typename T2 > | |
| Array & | operator= (const std::array< T2, N > &that) |
| template<typename T2 > | |
| Array & | operator= (std::initializer_list< T2 > that) |
Related Functions | |
(Note that these are not member functions.) | |
| template<class T , std::size_t N> | |
| bool | operator== (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| bool | operator< (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| bool | operator!= (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| bool | operator> (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| bool | operator<= (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| bool | operator>= (const Array< T, N > &l, const Array< T, N > &r) |
| template<class T , std::size_t N> | |
| void | swap (Array< T, N > &l, Array< T, N > &r) |
A template class holding a C - array of constant size.
| T | the element type |
| N | the constant size, must be >= 1 |
Array may be initialized with a static initializer list: opals::Array<double,3> arr = { 1., 2., 3. }; Array fulfills almost all the requirements of an STL reversible container. The complete implementation is exposed and hence, opals users may instantiate Array<T,N> with arbitrary template arguments. The class inherits most of its functionality from std::array.