PUBLIC

HashIterC::HashIterC(void) HashIterC::HashIterC(const HashC &) HashIterC::HashIterC(const HashIterC &) HashIterC::First(void) HashIterC::Next(void) HashIterC::operator ++(int) HashIterC::operator ++(void) HashIterC::IsElm(void) const HashIterC::operator bool(void) const HashIterC::Key(void) const HashIterC::Data(void) const HashIterC::Data(void) HashIterC::operator *(void) HashIterC::operator *(void) const HashIterC::Del(void) HashIterC::operator =(const HashC &) HashIterC::operator =(const HashIterC &) HashIterC::CheckValid(void)

Small object !

BinIterC
HashTreeIterC
BiHashIterC

IntrDLIterC> lIt;

List iterator.

SArray1dIterC>> bIt;

Current bin.

HashIterC()

Don't use this if you can help it.

HashIterC(const HashC<K,T> & nTab)

Normal constructor.

HashIterC(const HashIterC<K,T> & Oth)

Copy constructor.

bool First(void)

Goto first item in table.

bool Next(void)

Goto next iterm in table. Once this returns false (or IsElm() is false) this should not be called again.

void operator ++(int)

Goto next element.

void operator ++()

Goto next element.

bool IsElm() const

Pointing to valid element ?

operator bool() const

At a valid element ?

const K & Key(void) const

Key for current item. IsElm() Must be true.

const T & Data(void) const

Data for current item.IsElm() Must be true.

T & Data(void)

Data for current item.IsElm() Must be true.

T & operator *()

Access data.

const T & operator *() const

Access data.

void Del(void)

Delete current item from table, move to next. -> this breaks HashAR, if required I'll make a new non-constant iterator which can do this.

HashIterC<K,T> & operator =(const HashC<K,T> & oth)

Assign to another table.

HashIterC<K,T> & operator =(const HashIterC<K,T> & oth)

Assign to another iterator. const HashC &GetTable() const { return hashTab; } Which table ?

bool CheckValid(void)