PUBLIC

SArray1dIter2C::SArray1dIter2C(void) SArray1dIter2C::SArray1dIter2C(const SArray1dC &,const SArray1dC &) SArray1dIter2C::First(void) SArray1dIter2C::Array1(void) SArray1dIter2C::Array2(void) SArray1dIter2C::Index(void) const SArray1dIter2C::IsFirst(void) const BufferAccessIter2C::First(const RangeBufferAccessC &,const RangeBufferAccessC &) BufferAccessIter2C::First(const RangeBufferAccessC &,const RangeBufferAccessC &,const IndexRangeC &) BufferAccessIter2C::First(const SizeBufferAccessC &,const SizeBufferAccessC &) BufferAccessIter2C::First(const SizeBufferAccessC &,const SizeBufferAccessC &,UIntT,UIntT) BufferAccessIter2C::First(const RangeBufferAccessC &,const RangeBufferAccessC &,UIntT,UIntT) BufferAccessIter2C::First(const BufferAccessC &,const BufferAccessC &,SizeT) BufferAccessIter2C::First(const BufferAccessC &,const IndexRangeC &,const BufferAccessC &,const IndexRangeC &) BufferAccessIter2C::IsElm(void) const BufferAccessIter2C::IsLast(void) const BufferAccessIter2C::operator bool(void) BufferAccessIter2C::Next(void) BufferAccessIter2C::Next(int) BufferAccessIter2C::operator ++(int) BufferAccessIter2C::Data1(void) BufferAccessIter2C::Data1(void) const BufferAccessIter2C::Data2(void) BufferAccessIter2C::Data2(void) const BufferAccessIter2C::Invalidate(void)

public BufferAccessIter2C<Data1T,Data2T>

SArray1dC arr1;

SArray1dC arr2;

SArray1dIter2C()

Default constructor.

SArray1dIter2C(const SArray1dC<Data1T> & arr1,const SArray1dC<Data2T> & arr2)

Constructor.

void First()

Goto first element in arrays.

SArray1dC<Data1T> & Array1()

Access array.

SArray1dC<Data2T> & Array2()

Access array.

IndexC Index() const

Get current index.
This is a little slow.

bool IsFirst() const

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

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

Goto first elements.

bool First(const RangeBufferAccessC<Data1T> & buff,const RangeBufferAccessC<Data2T> & buff2,const IndexRangeC & rng)

Goto first elements.

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

Goto first elements.

bool First(const SizeBufferAccessC<Data1T> & buff,const SizeBufferAccessC<Data2T> & buff2,UIntT off1,UIntT off2)

Goto first elements.

bool First(const RangeBufferAccessC<Data1T> & buff,const RangeBufferAccessC<Data2T> & buff2,UIntT off1,UIntT off2 = 0)

Goto first elements.

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

Goto first elements.

bool First(const BufferAccessC<Data1T> & buff,const IndexRangeC & rng1,const BufferAccessC<Data2T> & buff2,const IndexRangeC & rng2)

Goto first elements.

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()

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 ++(int)

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

Data1T & Data1()

Access data.

const Data1T & Data1() const

Access data.

Data2T & Data2()

Access data.

const Data2T & Data2() const

Access data.

void Invalidate()

Make IsElm() return false.