PUBLIC

HashInt1DIter::First(void) HashInt1DIter::HashInt1DIter(void) HashInt1DIter::HashInt1DIter(const HashInt1D &) HashInt1DIter::HashInt1DIter(const HashInt1DAR &) HashInt1DIter::HashInt1DIter(const HashInt1DIter &) HashInt1DIter::operator=(HashInt1D &) HashInt1DIter::operator=(HashInt1DAR &) HashInt1DIter::operator=(const HashInt1DIter &) HashInt1DIter::Next(void) HashInt1DIter::IsElm(void) const HashInt1DIter::Del(void) HashInt1DIter::Data(void) const HashInt1DIter::Key(void) const HashInt1DIter::GetTable(void) const

HashInt1DIter<class T>
HashInt1D list like iterator.
include	"amma/HashInt1DIter.hh"
User Level:	Default
Library:	Hash1d
Example:	exStack.cc
Section:	Containers.Hash Tables
In Scope:	std

Comments:
See HashIterC. Beware: Small object !

typedef unsigned int Index;

HashInt1D * Table;

HashInt1DElem * Place;

Index Bin;

BooleanT First(void)

Goto first element in hash table.

HashInt1DIter()

Default constructor.

HashInt1DIter(const HashInt1D<T> & Tab)

Construct from hash table.

HashInt1DIter(const HashInt1DAR<T> & Tab)

Construct from an auto-resizing hash table.

HashInt1DIter(const HashInt1DIter<T> & Other)

Construct from another iterator.

const HashInt1DIter<T> & operator=(HashInt1D<T> & Tab)

Assign from table

const HashInt1DIter<T> & operator=(HashInt1DAR<T> & Tab)

Assign from table

const HashInt1DIter<T> & operator=(const HashInt1DIter<T> & Tab)

Assign from table

BooleanT Next(void)

Goto next element (True=element valid).

BooleanT IsElm(void) const

Is current element valid ?

BooleanT Del(void)

Delete current element from table. Don't use with constant or Auto resizing tables !!

T & Data(void) const

Get data for item.

Index Key(void) const

Get key for item.

const HashInt1D<T> & GetTable(void) const

Get constant pointer to the table being iterated.