PUBLIC

Slice1dIter2C::Slice1dIter2C(void) Slice1dIter2C::Slice1dIter2C(const Slice1dC &,const Slice1dC &) Slice1dIter2C::First(void) Slice1dIter2C::operator bool(void) const Slice1dIter2C::IsElm(void) const Slice1dIter2C::IsLast(void) const Slice1dIter2C::IsFirst(void) const Slice1dIter2C::Next(void) Slice1dIter2C::operator ++(int) Slice1dIter2C::Data1(void) Slice1dIter2C::Data1(void) const Slice1dIter2C::Data2(void) Slice1dIter2C::Data2(void) const Slice1dIter2C::Index(void) const

Slice1dIter2C()

Creates an invalid iterator.

Slice1dIter2C(const Slice1dC<Data1T> & nvec1,const Slice1dC<Data2T> & nvec2)

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.

Data1T & Data1()

Access data at current element.

const Data1T & Data1() const

Access data at current element.

Data2T & Data2()

Access data at current element.

const Data2T & Data2() const

Access data at current element.

IntT Index() const

Calculate current index.