PUBLIC

HSetIterC::HSetIterC(void) HSetIterC::HSetIterC(const HSetIterC &) HSetIterC::HSetIterC(const HSetC &) HSetIterC::IsElm(void) const HSetIterC::operator bool(void) const HSetIterC::First(void) HSetIterC::Next(void) HSetIterC::operator ++(int) HSetIterC::Data(void) const HSetIterC::operator *(void) const HSetIterC::operator ->(void) const HSetIterC::IsInSet(const HSetC &) const

This creates a reference to the set, so the set will not be deleted while an iterator references it.

You should NOT modify the set while using an iterator on it. The actions of such a code are unpredictable.

RCHashC set;

Make a handle to set.

HashIterC iter;

HSetIterC()

Default constructor.

HSetIterC(const HSetIterC<T> & oth)

Copy Constructor.

HSetIterC(const HSetC<T> & oth)

Constructor.

bool IsElm() const

At valid element ?

operator bool() const

At valid element ?

bool First()

Goto first element.

bool Next()

Goto next element.

bool operator ++(int)

Goto next element.

const T & Data() const

Access data element.

const T & operator *() const

Access data element.

const T * operator ->() const

Access data element.

bool IsInSet(const HSetC<T> & oth) const

Is iterator going through set 'oth' ?