PUBLIC

RealBinTable1dIterC::RealBinTable1dIterC(RealBinTable1dC &) RealBinTable1dIterC::BinSize(void) const RealBinTable1dIterC::BinCentre(void) const 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)

RealBinTable1dIterC<class DataT>
Sparse 1d histogram iterator.
include	"amma/RealBinTable1d.hh"
User Level:	Default
Library:	SparHist
Example:	exBnd.cc
Section:	Statistics.Histograms Containers.Hash Tables
In Scope:	std

Comments:
This is really only a simplified inferface to BinIter. SMALL OBJECT.

public HashIterC<class K,class T>

RealSparseHist1dIterC

const RealT binSize;

Scaling factor for bins.

RCHashARC tab;

RealBinTable1dIterC(RealBinTable1dC<DataT> & hist)

Constructor.

const RealT & BinSize() const

Get size of bins.

RealT BinCentre() const

Get centre of current bin;

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

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

const DataT & Data(void) const

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

DataT & Data(void)

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

DataT & operator*()

Access data.

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

Assign to another table.

HashIterC<DiscRealC,DataT> & operator=(const HashIterC<DiscRealC,DataT> & Oth)

Assign to another iterator.

const HashC<DiscRealC,DataT> & GetTable() const

Which table ?

BooleanT CheckValid(void)