PUBLIC

SArray1dIterC::SArray1dIterC(void) SArray1dIterC::SArray1dIterC(const SArray1dC &) SArray1dIterC::SArray1dIterC(const SArray1dC &,UIntT) SArray1dIterC::operator =(SArray1dC &) SArray1dIterC::First(void) SArray1dIterC::Array(void) SArray1dIterC::Index(void) const SArray1dIterC::IsFirst(void) const BufferAccessIterC::operator =(const RangeBufferAccessC &) BufferAccessIterC::operator =(const SizeBufferAccessC &) BufferAccessIterC::First(const BufferAccessC &,const IndexRangeC &) BufferAccessIterC::First(const BufferAccessC &,UIntT) BufferAccessIterC::First(const RangeBufferAccessC &) BufferAccessIterC::First(const SizeBufferAccessC &) BufferAccessIterC::IsElm(void) const BufferAccessIterC::IsLast(void) const BufferAccessIterC::operator bool(void) const BufferAccessIterC::operator !(void) const BufferAccessIterC::Next(void) BufferAccessIterC::Next(int) BufferAccessIterC::operator ++(int) BufferAccessIterC::operator ++(void) BufferAccessIterC::operator *(void) BufferAccessIterC::operator *(void) const BufferAccessIterC::operator ->(void) BufferAccessIterC::operator ->(void) const BufferAccessIterC::Data(void) BufferAccessIterC::Data(void) const BufferAccessIterC::Data1(void) BufferAccessIterC::Data1(void) const BufferAccessIterC::Invalidate(void)

public BufferAccessIterC<DataT>

CollectionIterC
CollectionConstIterC

SArray1dC arr;

SArray1dIterC()

Default constructor.

SArray1dIterC(const SArray1dC<DataT> & arr)

Constructor.

SArray1dIterC(const SArray1dC<DataT> & arr,UIntT maxInd)

Constructor.
only iterate first maxInd items, maxInd must be withing the array bounds.

const SArray1dIterC<DataT> & operator =(SArray1dC<DataT> & arr)

Assignment to an array.

void First()

Goto first element in array.

SArray1dC<DataT> & Array()

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

BufferAccessIterC<DataT> & operator =(const RangeBufferAccessC<DataT> & buff)

Assignment to a buffer.

BufferAccessIterC<DataT> & operator =(const SizeBufferAccessC<DataT> & buff)

Assignment to a buffer.

bool First(const BufferAccessC<DataT> & buff,const IndexRangeC & rng)

Goto fist element.

bool First(const BufferAccessC<DataT> & buff,UIntT size)

Goto fist element.

bool First(const RangeBufferAccessC<DataT> & buff)

Goto fist element.

bool First(const SizeBufferAccessC<DataT> & buff)

Goto fist 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 ?

bool operator !() const

Not 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.

void operator ++()

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

DataT & operator *()

Access data.

const DataT & operator *() const

Access data.

DataT * operator ->()

Access data.

const DataT * operator ->() const

Access data.

DataT & Data()

Access data.

const DataT & Data() const

Access data.

DataT & Data1()

Access data.
Equivelent to .Data(), for compatability with other iterators.

const DataT & Data1() const

Const access data.
Equivelent to .Data(), for compatability with other iterators.

void Invalidate()

Make IsElm() return false.