PUBLIC

HashIterC::HashIterC(void) HashIterC::HashIterC(const HashC &) HashIterC::HashIterC(const HashIterC &) HashIterC::First(void) HashIterC::Next(void) HashIterC::operator++(int) HashIterC::IsElm(void) const HashIterC::operator BooleanT(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::GetTable(void) const

HashIterC<class K,class T>
Hash table iterator.
include	"amma/HashIter.hh"
User Level:	Default
Library:	Hash1d
Example:	exStack.cc
Section:	Containers.Hash Tables
In Scope:	std

Comments:
This iterator works with both HashC and HashARC.

Small object !

public HashBaseC

BiHashIterC
BinIterC
RealBinTable1dIterC

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.

BooleanT First(void)

Goto first item in table.

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

BooleanT IsElm() const

Pointing to valid element ?

operator BooleanT() 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<K,T> & GetTable() const

Which table ?