PUBLIC

BiHashIterC::BiHashIterC(const BiHashARC &) BiHashIterC::Data1(void) BiHashIterC::Data2(void) 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::CheckValid(void)

BiHashIterC<class D1T,class D2T>
Bi-directional hash table iterator
include	"amma/BiHash.hh"
User Level:	Default
Library:	Hash1d
Example:	exBiHash.cc
Section:	Containers.Hash Tables
In Scope:	std

Parent Classes:

public HashIterC<class K,class T>

BiHashIterC(const BiHashARC<D1T,D2T> & bihash)

D1T & Data1()

Access data1.

D2T & Data2()

Access data1.

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 D1T & Key(void) const

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

const D2T & Data(void) const

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

D2T & Data(void)

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

D2T & operator*()

Access data.

const D2T & 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<D1T,D2T> & operator=(const HashC<D1T,D2T> & Oth)

Assign to another table.

HashIterC<D1T,D2T> & operator=(const HashIterC<D1T,D2T> & Oth)

Assign to another iterator.

const HashC<D1T,D2T> & GetTable() const

Which table ?

BooleanT CheckValid(void)