LevelS C++ support library
3.83
|
#include <arr.h>
Public Member Functions | |
arr2 () | |
arr2 (tsize sz1, tsize sz2) | |
arr2 (T *p, tsize sz1, tsize sz2) | |
arr2 (tsize sz1, tsize sz2, const T &inival) | |
Public Member Functions inherited from arr2T< T, normalAlloc__< T > > | |
arr2T () | |
arr2T (tsize sz1, tsize sz2) | |
arr2T (T *p, tsize sz1, tsize sz2) | |
arr2T (const arr2T &orig) | |
~arr2T () | |
tsize | size1 () const |
tsize | size2 () const |
tsize | size () const |
void | alloc (tsize sz1, tsize sz2) |
void | allocAndFill (tsize sz1, tsize sz2, const T &inival) |
void | fast_alloc (tsize sz1, tsize sz2) |
void | dealloc () |
void | fill (const T &val) |
void | scale (const T &val) |
arr2T & | operator= (const arr2T &orig) |
T * | operator[] (T2 n) |
const T * | operator[] (T2 n) const |
T & | operator() (T2 n1, T3 n2) |
const T & | operator() (T2 n1, T3 n2) const |
void | minmax (T &minv, T &maxv) const |
void | swap (arr2T &other) |
bool | conformable (const arr2T< T2, T3 > &other) const |
Two-dimensional array type. The storage ordering is the same as in C. An entry is located by address arithmetic, not by double dereferencing. The indices start at zero.