|
template<class F > |
std::ostream & | concepts::operator<< (std::ostream &os, std::unique_ptr< F > &a) |
|
template<class F > |
std::ostream & | concepts::operator<< (std::ostream &os, const Array< F > &o) |
|
template<class F > |
bool | concepts::operator== (const Array< F > &x, const Array< F > &y) |
|
template<class F > |
bool | concepts::operator== (const Array< F > &x, F &y) |
|
template<class F > |
bool | concepts::operator== (F &y, const Array< F > &x) |
|
template<class F , class G > |
concepts::Array< typename Combtype< F, G >::type > | concepts::operator* (const concepts::Array< F > &array, const G &val) |
|
template<class F , class G > |
Array< typename Combtype< F, G >::type > | concepts::operator* (const G &val, const Array< F > &array) |
|
template<class F > |
void | concepts::pointerOutput (std::ostream &os, const Array< F > &array) |
|
Array which does enlarge on request, zero out and more. In a sense a very minimalistic implementation of STLs vector. It's mainly intended to be an exception safe way to have an array of something. Especially suitable for vectors and matrices.
Definition in file array.hh.