User Documentation
Centre for Vision, Speech & Signal Processing
DEVELOP IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
HSetIterC::HSetIterC(void)
HSetIterC::HSetIterC(const HSetIterC &)
HSetIterC::HSetIterC(const HSetC &)
HSetIterC::IsElm(void) const
HSetIterC::operator BooleanT(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
HSetIterC<class T>
 
Set Iterator.
 
include "amma/HSet.hh"
User Level:Default
Library:Hash1d
Example:WordFreq.cc
Section:Containers.Sets
In Scope:std

Comments:
SMALL OBJECT

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

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

Derived Classes: Variables:
Methods:
HSetIterC()
Default constructor.

HSetIterC(const HSetIterC<T> & oth)
Copy Constructor.

HSetIterC(const HSetC<T> & oth)
Constructor.

BooleanT IsElm() const
At valid element ?

operator BooleanT() const
At valid element ?

BooleanT First()
Goto first element.

BooleanT Next()
Goto next element.

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

BooleanT IsInSet(const HSetC<T> & oth) const
Is iterator going through set 'oth' ?


Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:48:08 2001