blitz Version 1.0.2
Loading...
Searching...
No Matches
blitz::Array< P_numtype, N_rank > Class Template Reference

Declaration of class Array, the "Swiss army knife" of Blitz expression template classes. More...

#include <array-impl.h>

Inheritance diagram for blitz::Array< P_numtype, N_rank >:
Inheritance graph
Collaboration diagram for blitz::Array< P_numtype, N_rank >:
Collaboration graph

Public Types

typedef P_numtype T_numtype
 
typedef TinyVector< int, N_rank > T_index
 
typedef Array< T_numtype, N_rank > T_array
 
typedef FastArrayIterator< T_numtype, N_rank > T_iterator
 
typedef ArrayIterator< T_numtype, N_rank > iterator
 
typedef ConstArrayIterator< T_numtype, N_rank > const_iterator
 
typedef GeneralArrayStorage< N_rank > T_default_storage
 Set default storage order.
 
- Public Types inherited from blitz::MemoryBlockReference< P_numtype >
typedef P_numtype T_type
 
typedef P_numtype T_type
 
- Public Types inherited from blitz::ETBase< Array< P_numtype, N_rank > >
typedef Array< P_numtype, N_rank > T_unwrapped
 

Public Member Functions

template<typename T_expr>
 Array (_bz_ArrayExpr< T_expr > expr)
 Construct an array from an expression.
 
 Array (GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, int length6, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, int length6, int length7, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, int length6, int length7, int length8, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, int length6, int length7, int length8, int length9, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (int length0, int length1, int length2, int length3, int length4, int length5, int length6, int length7, int length8, int length9, int length10, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (T_numtype *dataFirst, TinyVector< int, N_rank > shape, GeneralArrayStorage< N_rank > storage=T_default_storage(contiguousData))
 
 Array (T_numtype *dataFirst, TinyVector< int, N_rank > shape, TinyVector< diffType, N_rank > stride, GeneralArrayStorage< N_rank > storage=T_default_storage(contiguousData))
 Construct an array from an existing block of memory, with a given set of strides.
 
 Array (T_numtype *dataFirst, TinyVector< int, N_rank > shape, preexistingMemoryPolicy deletionPolicy, GeneralArrayStorage< N_rank > storage=T_default_storage(contiguousData))
 Construct an array from an existing block of memory.
 
 Array (T_numtype *dataFirst, TinyVector< int, N_rank > shape, TinyVector< diffType, N_rank > stride, preexistingMemoryPolicy deletionPolicy, GeneralArrayStorage< N_rank > storage=T_default_storage(contiguousData))
 Construct an array from an existing block of memory, with a given set of strides.
 
 Array (const TinyVector< int, N_rank > &extent, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (const TinyVector< int, N_rank > &lbounds, const TinyVector< int, N_rank > &extent, const GeneralArrayStorage< N_rank > &storage=T_default_storage())
 
 Array (Range r0, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10, GeneralArrayStorage< N_rank > storage=T_default_storage())
 
 Array (const Array< T_numtype, N_rank > &array)
 
 Array (const TinyVector< int, N_rank-1 > &shape, int lastExtent, const GeneralArrayStorage< N_rank > &storage)
 
 Array (Array< T_numtype, N_rank > &array, Range r0)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9)
 
 Array (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10)
 
 Array (Array< T_numtype, N_rank > &array, const RectDomain< N_rank > &subdomain)
 
 Array (Array< T_numtype, N_rank > &array, const StridedDomain< N_rank > &subdomain)
 
template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4, typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
 Array (Array< T_numtype, N_rank2 > &array, R0 r0, R1 r1, R2 r2, R3 r3, R4 r4, R5 r5, R6 r6, R7 r7, R8 r8, R9 r9, R10 r10)
 
const TinyVector< int, N_rank > & base () const
 
int base (int rank) const
 
iterator begin ()
 
const_iterator begin () const
 
T_iterator beginFast () const
 
template<typename P_numtype2>
Array< P_numtype2, N_rank > chopComponent (P_numtype2 a, int compNum, int numComponents) const
 
int cols () const
 
int columns () const
 
T_array copy () const
 
diffType dataOffset () const
 
const T_numtypedata () const
 
T_numtypedata ()
 
const T_numtypedataZero () const
 
T_numtypedataZero ()
 
diffType dataFirstOffset () const
 
const T_numtypedataFirst () const
 
T_numtypedataFirst ()
 
int depth () const
 
int dimensions () const
 
RectDomain< N_rank > domain () const
 
void dumpStructureInformation (ostream &os=cout) const
 
iterator end ()
 
const_iterator end () const
 
int extent (int rank) const
 
const TinyVector< int, N_rank > & extent () const
 
template<typename P_numtype2>
Array< P_numtype2, N_rank > extractComponent (P_numtype2, int compNum, int numComponents) const
 
void free ()
 
int isMajorRank (int rank) const
 
int isMinorRank (int rank) const
 
int isRankStoredAscending (int rank) const
 
int isStorageContiguous () const
 
int lbound (int rank) const
 
TinyVector< int, N_rank > lbound () const
 
int length (int rank) const
 
const TinyVector< int, N_rank > & length () const
 
void makeUnique ()
 
sizeType numElements () const
 
int ordering (int storageRankIndex) const
 
const TinyVector< int, N_rank > & ordering () const
 
void transposeSelf (int r0, int r1, int r2=0, int r3=0, int r4=0, int r5=0, int r6=0, int r7=0, int r8=0, int r9=0, int r10=0)
 
T_array transpose (int r0, int r1, int r2=0, int r3=0, int r4=0, int r5=0, int r6=0, int r7=0, int r8=0, int r9=0, int r10=0) const
 
void reference (const T_array &)
 
void weakReference (const T_array &)
 
T_array reindex (const TinyVector< int, N_rank > &)
 
void reindexSelf (const TinyVector< int, N_rank > &)
 
void resize (int extent)
 
void resize (int extent1, int extent2)
 
void resize (int extent1, int extent2, int extent3)
 
void resize (int extent1, int extent2, int extent3, int extent4)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9, int extent10)
 
void resize (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9, int extent10, int extent11)
 
void resize (Range r1)
 
void resize (Range r1, Range r2)
 
void resize (Range r1, Range r2, Range r3)
 
void resize (Range r1, Range r2, Range r3, Range r4)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10)
 
void resize (Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10, Range r11)
 
void resize (const TinyVector< int, N_rank > &)
 
void resizeAndPreserve (const TinyVector< int, N_rank > &)
 
void resizeAndPreserve (int extent)
 
void resizeAndPreserve (int extent1, int extent2)
 
void resizeAndPreserve (int extent1, int extent2, int extent3)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9, int extent10)
 
void resizeAndPreserve (int extent1, int extent2, int extent3, int extent4, int extent5, int extent6, int extent7, int extent8, int extent9, int extent10, int extent11)
 
T_array reverse (int rank)
 
void reverseSelf (int rank)
 
int rows () const
 
void setStorage (GeneralArrayStorage< N_rank >)
 
void slice (int rank, Range r)
 
const TinyVector< int, N_rank > & shape () const
 
sizeType size () const
 
sizeType storageSize () const
 Returns the length of the array storage.
 
const TinyVector< diffType, N_rank > & stride () const
 
diffType stride (int rank) const
 
int threadLocal (int disableLock=1) const
 
int ubound (int rank) const
 
TinyVector< int, N_rank > ubound () const
 
int zeroOffset () const
 
int isVectorAligned (diffType offset) const
 Returns true if the array is aligned on a simd vector width.
 
int isInRangeForDim (int i, int d) const
 
int isInRange (int i0) const
 
int isInRange (int i0, int i1) const
 
int isInRange (int i0, int i1, int i2) const
 
int isInRange (int i0, int i1, int i2, int i3) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5, int i6) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9) const
 
int isInRange (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9, int i10) const
 
int isInRange (const T_index &index) const
 
int assertInRange (const T_index &BZ_DEBUG_PARAM(index)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5), int BZ_DEBUG_PARAM(i6)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5), int BZ_DEBUG_PARAM(i6), int BZ_DEBUG_PARAM(i7)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5), int BZ_DEBUG_PARAM(i6), int BZ_DEBUG_PARAM(i7), int BZ_DEBUG_PARAM(i8)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5), int BZ_DEBUG_PARAM(i6), int BZ_DEBUG_PARAM(i7), int BZ_DEBUG_PARAM(i8), int BZ_DEBUG_PARAM(i9)) const
 
int assertInRange (int BZ_DEBUG_PARAM(i0), int BZ_DEBUG_PARAM(i1), int BZ_DEBUG_PARAM(i2), int BZ_DEBUG_PARAM(i3), int BZ_DEBUG_PARAM(i4), int BZ_DEBUG_PARAM(i5), int BZ_DEBUG_PARAM(i6), int BZ_DEBUG_PARAM(i7), int BZ_DEBUG_PARAM(i8), int BZ_DEBUG_PARAM(i9), int BZ_DEBUG_PARAM(i10)) const
 
template<int N_rank2>
const T_numtypeoperator() (const TinyVector< int, N_rank2 > &index) const
 
template<int N_rank2>
T_numtypeoperator() (const TinyVector< int, N_rank2 > &index)
 
const T_numtypeoperator() (TinyVector< int, 1 > index) const
 
T_numtypeoperator() (TinyVector< int, 1 > index)
 
const T_numtypeoperator() (TinyVector< int, 2 > index) const
 
T_numtypeoperator() (TinyVector< int, 2 > index)
 
const T_numtypeoperator() (TinyVector< int, 3 > index) const
 
T_numtypeoperator() (TinyVector< int, 3 > index)
 
const T_numtypeoperator() (const TinyVector< int, 4 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 4 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 5 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 5 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 6 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 6 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 7 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 7 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 8 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 8 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 9 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 9 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 10 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 10 > &index)
 
const T_numtypeoperator() (const TinyVector< int, 11 > &index) const
 
T_numtypeoperator() (const TinyVector< int, 11 > &index)
 
const T_numtypeoperator() (int i0) const
 
T_numtypeoperator() (int i0)
 
const T_numtypeoperator() (int i0, int i1) const
 
T_numtypeoperator() (int i0, int i1)
 
const T_numtypeoperator() (int i0, int i1, int i2) const
 
T_numtypeoperator() (int i0, int i1, int i2)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9)
 
const T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9, int i10) const
 
T_numtypeoperator() (int i0, int i1, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9, int i10)
 
T_arraynoConst () const
 
T_array operator() (const RectDomain< N_rank > &subdomain) const
 
T_array operator() (const StridedDomain< N_rank > &subdomain) const
 
T_array operator() (Range r0) const
 
T_array operator() (Range r0, Range r1) const
 
T_array operator() (Range r0, Range r1, Range r2) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9) const
 
T_array operator() (Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10) const
 
template<int N0>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0 > > operator() (IndexPlaceholder< N0 >) const
 
template<int N0, int N1>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >) const
 
template<int N0, int N1, int N2>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >) const
 
template<int N0, int N1, int N2, int N3>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >) const
 
template<int N0, int N1, int N2, int N3, int N4>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >, IndexPlaceholder< N6 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >, IndexPlaceholder< N6 >, IndexPlaceholder< N7 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >, IndexPlaceholder< N6 >, IndexPlaceholder< N7 >, IndexPlaceholder< N8 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8, int N9>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >, IndexPlaceholder< N6 >, IndexPlaceholder< N7 >, IndexPlaceholder< N8 >, IndexPlaceholder< N9 >) const
 
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8, int N9, int N10>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, N10 > > operator() (IndexPlaceholder< N0 >, IndexPlaceholder< N1 >, IndexPlaceholder< N2 >, IndexPlaceholder< N3 >, IndexPlaceholder< N4 >, IndexPlaceholder< N5 >, IndexPlaceholder< N6 >, IndexPlaceholder< N7 >, IndexPlaceholder< N8 >, IndexPlaceholder< N9 >, IndexPlaceholder< N10 >) const
 
Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > operator[] (const unsigned component)
 
const Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > operator[] (const unsigned component) const
 
Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > operator[] (const int component)
 
const Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > operator[] (const int component) const
 
template<typename T_indexContainer>
IndirectArray< T_array, T_indexContainer > operator[] (const T_indexContainer &index)
 
- Public Member Functions inherited from blitz::MemoryBlockReference< P_numtype >
 MemoryBlockReference ()
 
 MemoryBlockReference (MemoryBlockReference< T_type > &ref, sizeType offset=0)
 
 MemoryBlockReference (sizeType length, T_type *data, preexistingMemoryPolicy deletionPolicy)
 
 MemoryBlockReference (sizeType items)
 
 ~MemoryBlockReference ()
 
bool isVectorAligned (size_t offset) const
 Returns true if the offset from data_ is vector aligned.
 
sizeType blockLength () const
 Returns the allocated length of the memory block.
 
 MemoryBlockReference ()
 
 MemoryBlockReference (MemoryBlockReference< T_type > &ref, sizeType offset=0)
 
 MemoryBlockReference (sizeType length, T_type *data, preexistingMemoryPolicy deletionPolicy)
 
 MemoryBlockReference (sizeType items)
 
 ~MemoryBlockReference ()
 
bool isVectorAligned (size_t offset) const
 Returns true if the offset from data_ is vector aligned.
 
sizeType blockLength () const
 Returns the allocated length of the memory block.
 
- Public Member Functions inherited from blitz::ETBase< Array< P_numtype, N_rank > >
 ETBase ()
 
 ETBase (const ETBase< Array< P_numtype, N_rank > > &)
 
Array< P_numtype, N_rank > & unwrap ()
 
const Array< P_numtype, N_rank > & unwrap () const
 
ETBase< Array< P_numtype, N_rank > > & wrap ()
 
const ETBase< Array< P_numtype, N_rank > > & wrap () const
 

Static Public Member Functions

static int rank ()
 

Static Public Attributes

static const int rank_ = N_rank
 

Private Types

typedef MemoryBlockReference< P_numtype > T_base
 

Private Attributes

T_type *restrict data_
 

Assignment operators. \todo Index placeholder

operand.

Todo
Random operand.
GeneralArrayStorage< N_rank > storage_
 Scalar operand assignment.
 
TinyVector< int, N_rank > length_
 Scalar operand assignment.
 
TinyVector< diffType, N_rank > stride_
 Scalar operand assignment.
 
diffType zeroOffset_
 Scalar operand assignment.
 
ListInitializationSwitch< T_arrayoperator= (T_numtype x)
 Scalar operand assignment.
 
T_arrayinitialize (T_numtype)
 Scalar operand assignment.
 
T_arrayoperator= (const Array< T_numtype, N_rank > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
T_arrayoperator+= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator-= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator*= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator/= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator%= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator^= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator&= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator|= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator>>= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator<<= (const T_array &)
 Scalar operand assignment.
 
T_arrayoperator+= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator-= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator*= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator/= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator%= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator^= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator&= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator|= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator>>= (const T_numtype &)
 Scalar operand assignment.
 
T_arrayoperator<<= (const T_numtype &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator+= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator-= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator*= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator/= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator%= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator^= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator&= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator|= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator>>= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
template<typename T_expr>
T_arrayoperator<<= (const ETBase< T_expr > &)
 Scalar operand assignment.
 
T_numtypegetInitializationIterator ()
 Scalar operand assignment.
 
int canCollapse (int outerRank, int innerRank) const
 Scalar operand assignment.
 
void computeStrides ()
 Scalar operand assignment.
 
void setupStorage (int rank)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, const RectDomain< N_rank > &)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, const StridedDomain< N_rank > &)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9)
 Scalar operand assignment.
 
void constructSubarray (Array< T_numtype, N_rank > &array, Range r0, Range r1, Range r2, Range r3, Range r4, Range r5, Range r6, Range r7, Range r8, Range r9, Range r10)
 Scalar operand assignment.
 
void calculateZeroOffset ()
 Scalar operand assignment.
 
template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4, typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
void constructSlice (Array< T_numtype, N_rank2 > &array, R0 r0, R1 r1, R2 r2, R3 r3, R4 r4, R5 r5, R6 r6, R7 r7, R8 r8, R9 r9, R10 r10)
 Scalar operand assignment.
 
template<int N_rank2>
void slice (int &setRank, Range r, Array< T_numtype, N_rank2 > &array, TinyVector< int, N_rank2 > &rankMap, int sourceRank)
 Scalar operand assignment.
 
template<int N_rank2>
void slice (int &setRank, int i, Array< T_numtype, N_rank2 > &array, TinyVector< int, N_rank2 > &rankMap, int sourceRank)
 Scalar operand assignment.
 
template<int N_rank2>
void slice (int &, nilArraySection, Array< T_numtype, N_rank2 > &, TinyVector< int, N_rank2 > &, int)
 Scalar operand assignment.
 
void doTranspose (int destRank, int sourceRank, T_array &array)
 Scalar operand assignment.
 

Additional Inherited Members

- Protected Member Functions inherited from blitz::MemoryBlockReference< P_numtype >
int numReferences () const
 
bool lockReferenceCount (bool lockingPolicy) const
 
void changeToNullBlock ()
 
void changeBlock (MemoryBlockReference< T_type > &ref, sizeType offset=0)
 
void newBlock (sizeType items)
 
int numReferences () const
 
bool lockReferenceCount (bool lockingPolicy) const
 
void changeToNullBlock ()
 
void changeBlock (MemoryBlockReference< T_type > &ref, sizeType offset=0)
 
void newBlock (sizeType items)
 
- Protected Attributes inherited from blitz::MemoryBlockReference< P_numtype >
T_type *restrict data_
 
T_type *restrict data_
 

Detailed Description

template<typename P_numtype, int N_rank>
class blitz::Array< P_numtype, N_rank >

Declaration of class Array, the "Swiss army knife" of Blitz expression template classes.

This is an arbitrary (at compile time) rank, arbitrary size container.

Todo
Array should inherit protected from MemoryBlockReference. To make this work, need to expose MemoryBlockReference::numReferences() and make Array<P,N2> a friend of Array<P,N> for slicing. (Is this still relevant? Array DOES inherit from MemoryBlockReference.)

Member Typedef Documentation

◆ const_iterator

template<typename P_numtype, int N_rank>
typedef ConstArrayIterator<T_numtype,N_rank> blitz::Array< P_numtype, N_rank >::const_iterator

◆ iterator

template<typename P_numtype, int N_rank>
typedef ArrayIterator<T_numtype,N_rank> blitz::Array< P_numtype, N_rank >::iterator

◆ T_array

template<typename P_numtype, int N_rank>
typedef Array<T_numtype, N_rank> blitz::Array< P_numtype, N_rank >::T_array

◆ T_base

template<typename P_numtype, int N_rank>
typedef MemoryBlockReference<P_numtype> blitz::Array< P_numtype, N_rank >::T_base
private

◆ T_default_storage

template<typename P_numtype, int N_rank>
typedef GeneralArrayStorage<N_rank> blitz::Array< P_numtype, N_rank >::T_default_storage

Set default storage order.

This is configurable via #defines as it is can be beneficial to set a specific storage for an entire project/file.

First check for the Fortan flag and then the column major flag, since Fortran arrays are column major.

◆ T_index

template<typename P_numtype, int N_rank>
typedef TinyVector<int, N_rank> blitz::Array< P_numtype, N_rank >::T_index

◆ T_iterator

template<typename P_numtype, int N_rank>
typedef FastArrayIterator<T_numtype, N_rank> blitz::Array< P_numtype, N_rank >::T_iterator

◆ T_numtype

template<typename P_numtype, int N_rank>
typedef P_numtype blitz::Array< P_numtype, N_rank >::T_numtype

Constructor & Destructor Documentation

◆ Array() [1/46]

template<typename P_numtype, int N_rank>
template<typename T_expr>
blitz::Array< P_numtype, N_rank >::Array ( _bz_ArrayExpr< T_expr > expr)

Construct an array from an expression.

Because this entails a memory allocation, it is explicit so this fact is obvious to the user. (There may also be ambiguities in making it implicit?)

◆ Array() [2/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( GeneralArrayStorage< N_rank > storage = T_default_storage())
inline

◆ Array() [3/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [4/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [5/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [6/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [7/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [8/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [9/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
int length6,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [10/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
int length6,
int length7,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [11/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
int length6,
int length7,
int length8,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [12/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
int length6,
int length7,
int length8,
int length9,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [13/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( int length0,
int length1,
int length2,
int length3,
int length4,
int length5,
int length6,
int length7,
int length8,
int length9,
int length10,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [14/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( T_numtype * dataFirst,
TinyVector< int, N_rank > shape,
GeneralArrayStorage< N_rank > storage = T_default_storage(contiguousData) )
inline

◆ Array() [15/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( T_numtype * dataFirst,
TinyVector< int, N_rank > shape,
TinyVector< diffType, N_rank > stride,
GeneralArrayStorage< N_rank > storage = T_default_storage(contiguousData) )
inline

Construct an array from an existing block of memory, with a given set of strides.

Ownership is not acquired (i.e. the memory block will not be freed by Blitz++). This constructor is used by extractComponent to make a component view of a multicomponent array, which is by design noncontiguous. This creates an incorrect length in the MemoryBlockReference (though that may be of no consequence since we're not freeing the memory).

◆ Array() [16/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( T_numtype * dataFirst,
TinyVector< int, N_rank > shape,
preexistingMemoryPolicy deletionPolicy,
GeneralArrayStorage< N_rank > storage = T_default_storage(contiguousData) )
inline

Construct an array from an existing block of memory.

If the storage represents a padded array, the length of the memory block will be incorrect, which would lead to a crash if "deleteDataWhenDone" is used. For this reason, we check that the resulting array is contiguous.

◆ Array() [17/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( T_numtype * dataFirst,
TinyVector< int, N_rank > shape,
TinyVector< diffType, N_rank > stride,
preexistingMemoryPolicy deletionPolicy,
GeneralArrayStorage< N_rank > storage = T_default_storage(contiguousData) )
inline

Construct an array from an existing block of memory, with a given set of strides.

If the strides represent a noncontiguous array, the calculated length of the memory block will be wrong, which will lead to a crash if "deleteDataWhenDone" is specified. For this reason, we check that the resulting array is contiguous.

◆ Array() [18/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( const TinyVector< int, N_rank > & extent,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [19/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( const TinyVector< int, N_rank > & lbounds,
const TinyVector< int, N_rank > & extent,
const GeneralArrayStorage< N_rank > & storage = T_default_storage() )

◆ Array() [20/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [21/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [22/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [23/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [24/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [25/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [26/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [27/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [28/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [29/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [30/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10,
GeneralArrayStorage< N_rank > storage = T_default_storage() )
inline

◆ Array() [31/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( const Array< T_numtype, N_rank > & array)
inline

◆ Array() [32/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( const TinyVector< int, N_rank-1 > & shape,
int lastExtent,
const GeneralArrayStorage< N_rank > & storage )

◆ Array() [33/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0 )
inline

◆ Array() [34/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1 )
inline

◆ Array() [35/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2 )
inline

◆ Array() [36/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3 )
inline

◆ Array() [37/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4 )
inline

◆ Array() [38/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5 )
inline

◆ Array() [39/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6 )
inline

◆ Array() [40/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7 )
inline

◆ Array() [41/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8 )
inline

◆ Array() [42/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9 )
inline

◆ Array() [43/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10 )
inline

◆ Array() [44/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
const RectDomain< N_rank > & subdomain )
inline

◆ Array() [45/46]

template<typename P_numtype, int N_rank>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank > & array,
const StridedDomain< N_rank > & subdomain )
inline

◆ Array() [46/46]

template<typename P_numtype, int N_rank>
template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4, typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
blitz::Array< P_numtype, N_rank >::Array ( Array< T_numtype, N_rank2 > & array,
R0 r0,
R1 r1,
R2 r2,
R3 r3,
R4 r4,
R5 r5,
R6 r6,
R7 r7,
R8 r8,
R9 r9,
R10 r10 )
inline

Member Function Documentation

◆ assertInRange() [1/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( const T_index & BZ_DEBUG_PARAMindex) const
inline

Referenced by blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), blitz::Array< T_numtype, N_rank >::operator()(), and blitz::Array< T_numtype, N_rank >::operator()().

◆ assertInRange() [2/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0) const
inline

◆ assertInRange() [3/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1 ) const
inline

◆ assertInRange() [4/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2 ) const
inline

◆ assertInRange() [5/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3 ) const
inline

◆ assertInRange() [6/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4 ) const
inline

◆ assertInRange() [7/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5 ) const
inline

◆ assertInRange() [8/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5,
int BZ_DEBUG_PARAMi6 ) const
inline

◆ assertInRange() [9/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5,
int BZ_DEBUG_PARAMi6,
int BZ_DEBUG_PARAMi7 ) const
inline

◆ assertInRange() [10/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5,
int BZ_DEBUG_PARAMi6,
int BZ_DEBUG_PARAMi7,
int BZ_DEBUG_PARAMi8 ) const
inline

◆ assertInRange() [11/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5,
int BZ_DEBUG_PARAMi6,
int BZ_DEBUG_PARAMi7,
int BZ_DEBUG_PARAMi8,
int BZ_DEBUG_PARAMi9 ) const
inline

◆ assertInRange() [12/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::assertInRange ( int BZ_DEBUG_PARAMi0,
int BZ_DEBUG_PARAMi1,
int BZ_DEBUG_PARAMi2,
int BZ_DEBUG_PARAMi3,
int BZ_DEBUG_PARAMi4,
int BZ_DEBUG_PARAMi5,
int BZ_DEBUG_PARAMi6,
int BZ_DEBUG_PARAMi7,
int BZ_DEBUG_PARAMi8,
int BZ_DEBUG_PARAMi9,
int BZ_DEBUG_PARAMi10 ) const
inline

◆ base() [1/2]

◆ base() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::base ( int rank) const
inline

◆ begin() [1/2]

template<typename P_numtype, int N_rank>
iterator blitz::Array< P_numtype, N_rank >::begin ( )
inline

Referenced by blitz::find().

◆ begin() [2/2]

template<typename P_numtype, int N_rank>
const_iterator blitz::Array< P_numtype, N_rank >::begin ( ) const
inline

◆ beginFast()

template<typename P_numtype, int N_rank>
T_iterator blitz::Array< P_numtype, N_rank >::beginFast ( ) const
inline

◆ calculateZeroOffset()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::calculateZeroOffset ( )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

Referenced by blitz::Array< T_numtype, N_rank >::Array(), and blitz::Array< T_numtype, N_rank >::Array().

◆ canCollapse()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::canCollapse ( int outerRank,
int innerRank ) const
inline

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ chopComponent()

template<typename P_numtype, int N_rank>
template<typename P_numtype2>
Array< P_numtype2, N_rank > blitz::Array< P_numtype, N_rank >::chopComponent ( P_numtype2 a,
int compNum,
int numComponents ) const
inline

◆ cols()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::cols ( ) const
inline

◆ columns()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::columns ( ) const
inline

◆ computeStrides()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::computeStrides ( )
inlineprotected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

Referenced by blitz::Array< T_numtype, N_rank >::Array(), and blitz::Array< T_numtype, N_rank >::Array().

◆ constructSlice()

template<typename P_numtype, int N_rank>
template<int N_rank2, typename R0, typename R1, typename R2, typename R3, typename R4, typename R5, typename R6, typename R7, typename R8, typename R9, typename R10>
void blitz::Array< P_numtype, N_rank >::constructSlice ( Array< T_numtype, N_rank2 > & array,
R0 r0,
R1 r1,
R2 r2,
R3 r3,
R4 r4,
R5 r5,
R6 r6,
R7 r7,
R8 r8,
R9 r9,
R10 r10 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

Referenced by blitz::Array< T_numtype, N_rank >::Array().

◆ constructSubarray() [1/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
const RectDomain< N_rank > &  )
protected

◆ constructSubarray() [2/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
const StridedDomain< N_rank > &  )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [3/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [4/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [5/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [6/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [7/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [8/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [9/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [10/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [11/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [12/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ constructSubarray() [13/13]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::constructSubarray ( Array< T_numtype, N_rank > & array,
Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10 )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ copy()

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::copy ( ) const

◆ data() [1/2]

template<typename P_numtype, int N_rank>
T_numtype * blitz::Array< P_numtype, N_rank >::data ( )
inline

◆ data() [2/2]

template<typename P_numtype, int N_rank>
const T_numtype * blitz::Array< P_numtype, N_rank >::data ( ) const
inline

◆ dataFirst() [1/2]

template<typename P_numtype, int N_rank>
T_numtype * blitz::Array< P_numtype, N_rank >::dataFirst ( )
inline

◆ dataFirst() [2/2]

template<typename P_numtype, int N_rank>
const T_numtype * blitz::Array< P_numtype, N_rank >::dataFirst ( ) const
inline

◆ dataFirstOffset()

template<typename P_numtype, int N_rank>
diffType blitz::Array< P_numtype, N_rank >::dataFirstOffset ( ) const
inline

◆ dataOffset()

template<typename P_numtype, int N_rank>
diffType blitz::Array< P_numtype, N_rank >::dataOffset ( ) const
inline

◆ dataZero() [1/2]

template<typename P_numtype, int N_rank>
T_numtype * blitz::Array< P_numtype, N_rank >::dataZero ( )
inline

◆ dataZero() [2/2]

template<typename P_numtype, int N_rank>
const T_numtype * blitz::Array< P_numtype, N_rank >::dataZero ( ) const
inline

◆ depth()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::depth ( ) const
inline

◆ dimensions()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::dimensions ( ) const
inline

◆ domain()

template<typename P_numtype, int N_rank>
RectDomain< N_rank > blitz::Array< P_numtype, N_rank >::domain ( ) const
inline

◆ doTranspose()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::doTranspose ( int destRank,
int sourceRank,
T_array & array )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ dumpStructureInformation()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::dumpStructureInformation ( ostream & os = cout) const

◆ end() [1/2]

template<typename P_numtype, int N_rank>
iterator blitz::Array< P_numtype, N_rank >::end ( )
inline

Referenced by blitz::find().

◆ end() [2/2]

template<typename P_numtype, int N_rank>
const_iterator blitz::Array< P_numtype, N_rank >::end ( ) const
inline

◆ extent() [1/2]

template<typename P_numtype, int N_rank>
const TinyVector< int, N_rank > & blitz::Array< P_numtype, N_rank >::extent ( ) const
inline

◆ extent() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::extent ( int rank) const
inline

◆ extractComponent()

template<typename P_numtype, int N_rank>
template<typename P_numtype2>
Array< P_numtype2, N_rank > blitz::Array< P_numtype, N_rank >::extractComponent ( P_numtype2 ,
int compNum,
int numComponents ) const

◆ free()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::free ( )
inline

◆ getInitializationIterator()

template<typename P_numtype, int N_rank>
T_numtype * blitz::Array< P_numtype, N_rank >::getInitializationIterator ( )
inline

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ initialize()

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::initialize ( T_numtype )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ isInRange() [1/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( const T_index & index) const
inline

◆ isInRange() [2/12]

◆ isInRange() [3/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1 ) const
inline

◆ isInRange() [4/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2 ) const
inline

◆ isInRange() [5/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3 ) const
inline

◆ isInRange() [6/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4 ) const
inline

◆ isInRange() [7/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5 ) const
inline

◆ isInRange() [8/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6 ) const
inline

◆ isInRange() [9/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7 ) const
inline

◆ isInRange() [10/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8 ) const
inline

◆ isInRange() [11/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9 ) const
inline

◆ isInRange() [12/12]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRange ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9,
int i10 ) const
inline

◆ isInRangeForDim()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isInRangeForDim ( int i,
int d ) const
inline

◆ isMajorRank()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isMajorRank ( int rank) const
inline

◆ isMinorRank()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isMinorRank ( int rank) const
inline

◆ isRankStoredAscending()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isRankStoredAscending ( int rank) const
inline

◆ isStorageContiguous()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isStorageContiguous ( ) const

◆ isVectorAligned()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::isVectorAligned ( diffType offset) const
inline

Returns true if the array is aligned on a simd vector width.

◆ lbound() [1/2]

template<typename P_numtype, int N_rank>
TinyVector< int, N_rank > blitz::Array< P_numtype, N_rank >::lbound ( ) const
inline

◆ lbound() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::lbound ( int rank) const
inline

◆ length() [1/2]

template<typename P_numtype, int N_rank>
const TinyVector< int, N_rank > & blitz::Array< P_numtype, N_rank >::length ( ) const
inline

◆ length() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::length ( int rank) const
inline

◆ makeUnique()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::makeUnique ( )

◆ noConst()

◆ numElements()

template<typename P_numtype, int N_rank>
sizeType blitz::Array< P_numtype, N_rank >::numElements ( ) const
inline

◆ operator%=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator%= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator%=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator%= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator%=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator%= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator&=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator&= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator&=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator&= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator&=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator&= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator()() [1/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( const RectDomain< N_rank > & subdomain) const
inline

◆ operator()() [2/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( const StridedDomain< N_rank > & subdomain) const
inline

◆ operator()() [3/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 10 > & index)
inline

◆ operator()() [4/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 10 > & index) const
inline

◆ operator()() [5/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 11 > & index)
inline

◆ operator()() [6/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 11 > & index) const
inline

◆ operator()() [7/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 4 > & index)
inline

◆ operator()() [8/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 4 > & index) const
inline

◆ operator()() [9/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 5 > & index)
inline

◆ operator()() [10/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 5 > & index) const
inline

◆ operator()() [11/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 6 > & index)
inline

◆ operator()() [12/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 6 > & index) const
inline

◆ operator()() [13/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 7 > & index)
inline

◆ operator()() [14/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 7 > & index) const
inline

◆ operator()() [15/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 8 > & index)
inline

◆ operator()() [16/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 8 > & index) const
inline

◆ operator()() [17/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 9 > & index)
inline

◆ operator()() [18/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, 9 > & index) const
inline

◆ operator()() [19/70]

template<typename P_numtype, int N_rank>
template<int N_rank2>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, N_rank2 > & index)
inline

◆ operator()() [20/70]

template<typename P_numtype, int N_rank>
template<int N_rank2>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( const TinyVector< int, N_rank2 > & index) const
inline

◆ operator()() [21/70]

template<typename P_numtype, int N_rank>
template<int N0>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ) const
inline

◆ operator()() [22/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 >  ) const
inline

◆ operator()() [23/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 >  ) const
inline

◆ operator()() [24/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 >  ) const
inline

◆ operator()() [25/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 >  ) const
inline

◆ operator()() [26/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 >  ) const
inline

◆ operator()() [27/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 > ,
IndexPlaceholder< N6 >  ) const
inline

◆ operator()() [28/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 > ,
IndexPlaceholder< N6 > ,
IndexPlaceholder< N7 >  ) const
inline

◆ operator()() [29/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 > ,
IndexPlaceholder< N6 > ,
IndexPlaceholder< N7 > ,
IndexPlaceholder< N8 >  ) const
inline

◆ operator()() [30/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8, int N9>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 > ,
IndexPlaceholder< N6 > ,
IndexPlaceholder< N7 > ,
IndexPlaceholder< N8 > ,
IndexPlaceholder< N9 >  ) const
inline

◆ operator()() [31/70]

template<typename P_numtype, int N_rank>
template<int N0, int N1, int N2, int N3, int N4, int N5, int N6, int N7, int N8, int N9, int N10>
_bz_ArrayExpr< ArrayIndexMapping< typename asExpr< T_array >::T_expr, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, N10 > > blitz::Array< P_numtype, N_rank >::operator() ( IndexPlaceholder< N0 > ,
IndexPlaceholder< N1 > ,
IndexPlaceholder< N2 > ,
IndexPlaceholder< N3 > ,
IndexPlaceholder< N4 > ,
IndexPlaceholder< N5 > ,
IndexPlaceholder< N6 > ,
IndexPlaceholder< N7 > ,
IndexPlaceholder< N8 > ,
IndexPlaceholder< N9 > ,
IndexPlaceholder< N10 >  ) const
inline

◆ operator()() [32/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0)
inline

◆ operator()() [33/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0) const
inline

◆ operator()() [34/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1 )
inline

◆ operator()() [35/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1 ) const
inline

◆ operator()() [36/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2 )
inline

◆ operator()() [37/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2 ) const
inline

◆ operator()() [38/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3 )
inline

◆ operator()() [39/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3 ) const
inline

◆ operator()() [40/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4 )
inline

◆ operator()() [41/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4 ) const
inline

◆ operator()() [42/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5 )
inline

◆ operator()() [43/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5 ) const
inline

◆ operator()() [44/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6 )
inline

◆ operator()() [45/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6 ) const
inline

◆ operator()() [46/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7 )
inline

◆ operator()() [47/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7 ) const
inline

◆ operator()() [48/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8 )
inline

◆ operator()() [49/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8 ) const
inline

◆ operator()() [50/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9 )
inline

◆ operator()() [51/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9 ) const
inline

◆ operator()() [52/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9,
int i10 )
inline

◆ operator()() [53/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( int i0,
int i1,
int i2,
int i3,
int i4,
int i5,
int i6,
int i7,
int i8,
int i9,
int i10 ) const
inline

◆ operator()() [54/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0) const
inline

◆ operator()() [55/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1 ) const
inline

◆ operator()() [56/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2 ) const
inline

◆ operator()() [57/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3 ) const
inline

◆ operator()() [58/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4 ) const
inline

◆ operator()() [59/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5 ) const
inline

◆ operator()() [60/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6 ) const
inline

◆ operator()() [61/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7 ) const
inline

◆ operator()() [62/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8 ) const
inline

◆ operator()() [63/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9 ) const
inline

◆ operator()() [64/70]

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::operator() ( Range r0,
Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10 ) const
inline

◆ operator()() [65/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 1 > index)
inline

◆ operator()() [66/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 1 > index) const
inline

◆ operator()() [67/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 2 > index)
inline

◆ operator()() [68/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 2 > index) const
inline

◆ operator()() [69/70]

template<typename P_numtype, int N_rank>
T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 3 > index)
inline

◆ operator()() [70/70]

template<typename P_numtype, int N_rank>
const T_numtype & blitz::Array< P_numtype, N_rank >::operator() ( TinyVector< int, 3 > index) const
inline

◆ operator*=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator*= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator*=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator*= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator*=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator*= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator+=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator+= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator+=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator+= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator+=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator+= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator-=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator-= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator-=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator-= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator-=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator-= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator/=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator/= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator/=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator/= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator/=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator/= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator<<=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator<<= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator<<=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator<<= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator<<=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator<<= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator=() [1/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator= ( const Array< T_numtype, N_rank > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator=() [2/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator=() [3/3]

template<typename P_numtype, int N_rank>
ListInitializationSwitch< T_array > blitz::Array< P_numtype, N_rank >::operator= ( T_numtype x)
inline

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator>>=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator>>= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator>>=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator>>= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator>>=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator>>= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator[]() [1/5]

template<typename P_numtype, int N_rank>
Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > blitz::Array< P_numtype, N_rank >::operator[] ( const int component)
inline

◆ operator[]() [2/5]

template<typename P_numtype, int N_rank>
const Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > blitz::Array< P_numtype, N_rank >::operator[] ( const int component) const
inline

◆ operator[]() [3/5]

template<typename P_numtype, int N_rank>
template<typename T_indexContainer>
IndirectArray< T_array, T_indexContainer > blitz::Array< P_numtype, N_rank >::operator[] ( const T_indexContainer & index)
inline

◆ operator[]() [4/5]

template<typename P_numtype, int N_rank>
Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > blitz::Array< P_numtype, N_rank >::operator[] ( const unsigned component)
inline

◆ operator[]() [5/5]

template<typename P_numtype, int N_rank>
const Array< typename multicomponent_traits< T_numtype >::T_element, N_rank > blitz::Array< P_numtype, N_rank >::operator[] ( const unsigned component) const
inline

◆ operator^=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator^= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator^=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator^= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator^=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator^= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator|=() [1/3]

template<typename P_numtype, int N_rank>
template<typename T_expr>
T_array & blitz::Array< P_numtype, N_rank >::operator|= ( const ETBase< T_expr > & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator|=() [2/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator|= ( const T_array & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ operator|=() [3/3]

template<typename P_numtype, int N_rank>
T_array & blitz::Array< P_numtype, N_rank >::operator|= ( const T_numtype & )

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ ordering() [1/2]

template<typename P_numtype, int N_rank>
const TinyVector< int, N_rank > & blitz::Array< P_numtype, N_rank >::ordering ( ) const
inline

◆ ordering() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::ordering ( int storageRankIndex) const
inline

◆ rank()

template<typename P_numtype, int N_rank>
static int blitz::Array< P_numtype, N_rank >::rank ( )
inlinestatic

◆ reference()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::reference ( const T_array & )

◆ reindex()

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::reindex ( const TinyVector< int, N_rank > & )

◆ reindexSelf()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::reindexSelf ( const TinyVector< int, N_rank > & )

◆ resize() [1/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( const TinyVector< int, N_rank > & )

◆ resize() [2/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent)

◆ resize() [3/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2 )

◆ resize() [4/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3 )

◆ resize() [5/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4 )

◆ resize() [6/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5 )

◆ resize() [7/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6 )

◆ resize() [8/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7 )

◆ resize() [9/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8 )

◆ resize() [10/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9 )

◆ resize() [11/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9,
int extent10 )

◆ resize() [12/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9,
int extent10,
int extent11 )

◆ resize() [13/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1)

◆ resize() [14/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2 )

◆ resize() [15/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3 )

◆ resize() [16/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4 )

◆ resize() [17/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5 )

◆ resize() [18/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6 )

◆ resize() [19/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7 )

◆ resize() [20/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8 )

◆ resize() [21/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9 )

◆ resize() [22/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10 )

◆ resize() [23/23]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resize ( Range r1,
Range r2,
Range r3,
Range r4,
Range r5,
Range r6,
Range r7,
Range r8,
Range r9,
Range r10,
Range r11 )

◆ resizeAndPreserve() [1/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( const TinyVector< int, N_rank > & )

◆ resizeAndPreserve() [2/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent)

◆ resizeAndPreserve() [3/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2 )

◆ resizeAndPreserve() [4/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3 )

◆ resizeAndPreserve() [5/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4 )

◆ resizeAndPreserve() [6/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5 )

◆ resizeAndPreserve() [7/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6 )

◆ resizeAndPreserve() [8/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7 )

◆ resizeAndPreserve() [9/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8 )

◆ resizeAndPreserve() [10/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9 )

◆ resizeAndPreserve() [11/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9,
int extent10 )

◆ resizeAndPreserve() [12/12]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::resizeAndPreserve ( int extent1,
int extent2,
int extent3,
int extent4,
int extent5,
int extent6,
int extent7,
int extent8,
int extent9,
int extent10,
int extent11 )

◆ reverse()

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::reverse ( int rank)

◆ reverseSelf()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::reverseSelf ( int rank)

◆ rows()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::rows ( ) const
inline

◆ setStorage()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::setStorage ( GeneralArrayStorage< N_rank > )

◆ setupStorage()

◆ shape()

template<typename P_numtype, int N_rank>
const TinyVector< int, N_rank > & blitz::Array< P_numtype, N_rank >::shape ( ) const
inline

◆ size()

template<typename P_numtype, int N_rank>
sizeType blitz::Array< P_numtype, N_rank >::size ( ) const
inline

Referenced by blitz::find().

◆ slice() [1/4]

template<typename P_numtype, int N_rank>
template<int N_rank2>
void blitz::Array< P_numtype, N_rank >::slice ( int & ,
nilArraySection ,
Array< T_numtype, N_rank2 > & ,
TinyVector< int, N_rank2 > & ,
int  )
inlineprotected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ slice() [2/4]

template<typename P_numtype, int N_rank>
template<int N_rank2>
void blitz::Array< P_numtype, N_rank >::slice ( int & setRank,
int i,
Array< T_numtype, N_rank2 > & array,
TinyVector< int, N_rank2 > & rankMap,
int sourceRank )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ slice() [3/4]

template<typename P_numtype, int N_rank>
template<int N_rank2>
void blitz::Array< P_numtype, N_rank >::slice ( int & setRank,
Range r,
Array< T_numtype, N_rank2 > & array,
TinyVector< int, N_rank2 > & rankMap,
int sourceRank )
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ slice() [4/4]

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::slice ( int rank,
Range r )

◆ storageSize()

template<typename P_numtype, int N_rank>
sizeType blitz::Array< P_numtype, N_rank >::storageSize ( ) const
inline

Returns the length of the array storage.

This can be larger than the number of elements due to padding to meet alignment requirements. If you want to extract the array data to, for example, write it to disk, this is the size of the block needed.

Todo
Is this safe if there is no block?

◆ stride() [1/2]

template<typename P_numtype, int N_rank>
const TinyVector< diffType, N_rank > & blitz::Array< P_numtype, N_rank >::stride ( ) const
inline

◆ stride() [2/2]

template<typename P_numtype, int N_rank>
diffType blitz::Array< P_numtype, N_rank >::stride ( int rank) const
inline

◆ threadLocal()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::threadLocal ( int disableLock = 1) const
inline

◆ transpose()

template<typename P_numtype, int N_rank>
T_array blitz::Array< P_numtype, N_rank >::transpose ( int r0,
int r1,
int r2 = 0,
int r3 = 0,
int r4 = 0,
int r5 = 0,
int r6 = 0,
int r7 = 0,
int r8 = 0,
int r9 = 0,
int r10 = 0 ) const

◆ transposeSelf()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::transposeSelf ( int r0,
int r1,
int r2 = 0,
int r3 = 0,
int r4 = 0,
int r5 = 0,
int r6 = 0,
int r7 = 0,
int r8 = 0,
int r9 = 0,
int r10 = 0 )

◆ ubound() [1/2]

template<typename P_numtype, int N_rank>
TinyVector< int, N_rank > blitz::Array< P_numtype, N_rank >::ubound ( ) const
inline

◆ ubound() [2/2]

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::ubound ( int rank) const
inline

◆ weakReference()

template<typename P_numtype, int N_rank>
void blitz::Array< P_numtype, N_rank >::weakReference ( const T_array & )

◆ zeroOffset()

template<typename P_numtype, int N_rank>
int blitz::Array< P_numtype, N_rank >::zeroOffset ( ) const
inline

Member Data Documentation

◆ data_

template<typename P_numtype, int N_rank>
T_type* restrict blitz::MemoryBlockReference< P_numtype >::data_
private

◆ length_

template<typename P_numtype, int N_rank>
TinyVector<int, N_rank> blitz::Array< P_numtype, N_rank >::length_
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

Referenced by blitz::Array< T_numtype, N_rank >::ubound().

◆ rank_

template<typename P_numtype, int N_rank>
const int blitz::Array< P_numtype, N_rank >::rank_ = N_rank
static

◆ storage_

template<typename P_numtype, int N_rank>
GeneralArrayStorage<N_rank> blitz::Array< P_numtype, N_rank >::storage_
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

◆ stride_

template<typename P_numtype, int N_rank>
TinyVector<diffType, N_rank> blitz::Array< P_numtype, N_rank >::stride_
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.

Referenced by blitz::Array< T_numtype, N_rank >::dataFirstOffset().

◆ zeroOffset_

template<typename P_numtype, int N_rank>
diffType blitz::Array< P_numtype, N_rank >::zeroOffset_
protected

Scalar operand assignment.

Todo

Need a precondition check on isStorageContiguous when operator, is used.

We should do bounds checking, right now we will buffer overrun if the number of initializers in the list is larger than numElements.


The documentation for this class was generated from the following files: