LTL
2.0.x
|
Public Member Functions | |
Shape () | |
Shape (const Range &r1) | |
Shape (const Range &r1, const Range &r2) | |
Shape (const Range &r1, const Range &r2, const Range &r3) | |
Shape (const Range &r1, const Range &r2, const Range &r3, const Range &r4) | |
Shape (const Range &r1, const Range &r2, const Range &r3, const Range &r4, const Range &r5) | |
Shape (const Range &r1, const Range &r2, const Range &r3, const Range &r4, const Range &r5, const Range &r6) | |
Shape (const Range &r1, const Range &r2, const Range &r3, const Range &r4, const Range &r5, const Range &r6, const Range &r7) | |
Shape (const int r1) | |
Shape (const int r1, const int r2) | |
Shape (const int r1, const int r2, const int r3) | |
Shape (const int r1, const int r2, const int r3, const int r4) | |
Shape (const int r1, const int r2, const int r3, const int r4, const int r5) | |
Shape (const int r1, const int r2, const int r3, const int r4, const int r5, const int r6) | |
Shape (const int r1, const int r2, const int r3, const int r4, const int r5, const int r6, const int r7) | |
Shape (const Shape< N > &other) | |
Shape & | operator= (const Shape< N > &other) |
int | base (const int i) const |
int & | base (const int i) |
int | last (const int i) const |
int | length (const int i) const |
int & | length (const int i) |
int | stride (const int i) const |
int & | stride (const int i) |
int | zeroOffset () const |
int & | zeroOffset () |
bool | isStorageContiguous (void) const |
bool | isUnitStride (void) const |
bool | isConformable (const Shape &other) const |
int | nelements () const |
Shape< N-1 > | getShapeForContraction (const int dim) const |
Protected Member Functions | |
void | calcIsStorageContiguous () |
void | calcNelements () |
void | calcZeroOffset () |
void | copy (const Shape< N > &other) |
void | setupSelf (const int n) |
Protected Attributes | |
int | zeroOffset_ |
int | base_ [N] |
int | length_ [N] |
int | stride_ [N] |
bool | isContiguous_ |
int | nelements_ |
Friends | |
template<class T , int D> | |
class | MArray |
template<int D> | |
class | Shape |
std::istream & | operator>> (std::istream &is, Shape< N > &s) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Shape< N-1 > ltl::ltl::Shape< N >::getShapeForContraction | ( | const int | dim | ) | const |
|
inlineprotected |
The storage is contiguous if for every dimension i = 1..N-1 stride(i)*length(i) == stride(i+1) This assumes the dimensions are ordered! (c.f. blitz-version below which does not require this assumption)
|
inlineprotected |
|
inlineprotected |
|
protected |
|
inlineprotected |
|
friend |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |