PUBLIC

Array1dIter3C::Array1dIter3C(void) Array1dIter3C::Array1dIter3C(const Array1dC &,const Array1dC &,const Array1dC &,bool) Array1dIter3C::Array1dIter3C(const Array1dC &,const Array1dC &,const Array1dC &,const IndexRangeC &) Array1dIter3C::First(void) Array1dIter3C::IsFirst(void) const BufferAccessIter3C::First(const BufferAccessC &,const IndexRangeC &,const BufferAccessC &,const IndexRangeC &,const BufferAccessC &,const IndexRangeC &) BufferAccessIter3C::First(const BufferAccessC &,const BufferAccessC &,const BufferAccessC &,SizeT) BufferAccessIter3C::First(const RangeBufferAccessC &,const RangeBufferAccessC &,const RangeBufferAccessC &) BufferAccessIter3C::First(const SizeBufferAccessC &,const SizeBufferAccessC &,const SizeBufferAccessC &) BufferAccessIter3C::IsElm(void) const BufferAccessIter3C::IsLast(void) const BufferAccessIter3C::operator bool(void) const BufferAccessIter3C::Next(void) BufferAccessIter3C::Next(int) BufferAccessIter3C::operator ++(void) BufferAccessIter3C::operator ++(int) BufferAccessIter3C::Data1(void) BufferAccessIter3C::Data1(void) const BufferAccessIter3C::Data2(void) BufferAccessIter3C::Data2(void) const BufferAccessIter3C::Data3(void) BufferAccessIter3C::Data3(void) const BufferAccessIter3C::Invalidate(void)

public BufferAccessIter3C<Data1T,Data2T,Data3T>

Array1dC dat1;

Array1dC dat2;

Array1dC dat3;

Array1dIter3C()

Default constructor.

Array1dIter3C(const Array1dC<Data1T> & arr1,const Array1dC<Data2T> & arr2,const Array1dC<Data3T> & arr3,bool matching = true)

Constructor.
If you don't intend to iterator over the same range for each array set the 'matching' paramiter to false. This will disable the check.

Array1dIter3C(const Array1dC<Data1T> & arr1,const Array1dC<Data2T> & arr2,const Array1dC<Data3T> & arr3,const IndexRangeC & rng)

Constructor.

void First()

Goto first element in the array.

bool IsFirst() const

Test if this is the first element in the range.
Note,this is slower than IsElm().

bool First(const BufferAccessC<Data1T> & buff1,const IndexRangeC & rng1,const BufferAccessC<Data2T> & buff2,const IndexRangeC & rng2,const BufferAccessC<Data3T> & buff3,const IndexRangeC & rng3)

Goto first element.
returns true if there is a first element.

bool First(const BufferAccessC<Data1T> & buff,const BufferAccessC<Data2T> & buff2,const BufferAccessC<Data3T> & buff3,SizeT size)

Goto first element.
returns true if there is a first element.

bool First(const RangeBufferAccessC<Data1T> & buff,const RangeBufferAccessC<Data2T> & buff2,const RangeBufferAccessC<Data3T> & buff3)

Goto first element.
returns true if there is a first element.

bool First(const SizeBufferAccessC<Data1T> & buff,const SizeBufferAccessC<Data2T> & buff2,const SizeBufferAccessC<Data3T> & buff3)

Goto first element.
returns true if there is a first element.

bool IsElm() const

At valid element ?

bool IsLast() const

Test if we're at the last valid element in the range.
Note: This is slightly slower than IsElm().

operator bool() const

At valid element ?

void Next()

Goto next element.
Call ONLY if IsElm() is valid.

void Next(int skip)

Advance 'skip' elements.
Call ONLY if you know this will not go past the end of the array.

void operator ++()

Goto next elment.

void operator ++(int)

Goto next elment.

Data1T & Data1()

Access data.

const Data1T & Data1() const

Access data.

Data2T & Data2()

Access data.

const Data2T & Data2() const

Access data.

Data3T & Data3()

Access data.

const Data3T & Data3() const

Access data.

void Invalidate()

Make IsElm() return false.