PUBLIC

Slice1dIterC::Slice1dIterC(void) Slice1dIterC::Slice1dIterC(const Slice1dC &) Slice1dIterC::First(void) Slice1dIterC::operator bool(void) const Slice1dIterC::IsElm(void) const Slice1dIterC::IsLast(void) const Slice1dIterC::IsFirst(void) const Slice1dIterC::Next(void) Slice1dIterC::operator ++(int) Slice1dIterC::Data(void) Slice1dIterC::Data(void) const Slice1dIterC::operator *(void) Slice1dIterC::operator *(void) const Slice1dIterC::operator ->(void) Slice1dIterC::operator ->(void) const Slice1dIterC::Index(void) const

DataT * place;

DataT * end;

Slice1dC vec;

Slice1dIterC()

Creates an invalid iterator.

Slice1dIterC(const Slice1dC<DataT> & nvec)

Creates an iterator of 'nvec'

void First()

Goto first element.

operator bool() const

Test if we're at a valid element.

bool IsElm() const

Test if we're at a valid element.

bool IsLast() const

Test if we're at the last valid element in the slice.
This is slower than IsElm().

bool IsFirst() const

Test if we're at the first element in the slice.
This is slower than IsElm().

void Next()

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

void operator ++(int)

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

DataT & Data()

Access data at current element.

const DataT & Data() const

Access data at current element.

DataT & operator *()

Access data.

const DataT & operator *() const

Access data.

DataT * operator ->()

Access data.

const DataT * operator ->() const

Access data.

IntT Index() const

Calculate current index.