PUBLIC

DataBunchIterC::DataBunchIterC(DataBunchC &,const VectorC &,int) DataBunchIterC::First(void) DataBunchIterC::IsElm(void) const DataBunchIterC::Next(void) DataBunchIterC::Data(void) DataBunchIterC::RawData(void) DataBunchIterC::VectorData(void) DataBunchIterC::QueueNextData(void) DataBunchIterC::Bubble(RealT,const DataT &) DataBunchIterC::AddBin(const VectorC &)

DataBunchIterC<class LabelT>
include	"amma/DataBunchIter.hh"
User Level:	Default
Library:	dataBunch
Example:	doNumClassComb.cc
Section:	default.Charles Galambos
In Scope:	std

Comments:
/////////////////////////////////////////////

typedef Tuple2C<VectorC,LabelT> DataT;

DataBunchC & data;

VectorC centre;

VectorC projCentre;

RealT maxDist;

Maximum distance we can trust.

RealT maxSearchDistance;

IntT dim;

RealT min[];

RealT max[];

IntT square_size;

int at;

int rat;

SArray1dC> results;

DataBunchIterC(DataBunchC<LabelT> & thedata,const VectorC & thepoint,int nPnts = 1)

Constructor.

void First()

Get ready to return closest point.

bool IsElm() const

Any points yet to be returned?

void Next()

This to make it look a genuine iterator.

LabelT Data()

Access label of current closest point.

DataT & RawData()

Access current closest point.

VectorC VectorData()

BooleanT QueueNextData()

Queue up next lot of data.

void Bubble(RealT dist,const DataT & dat)

Bubble.

void AddBin(const VectorC & bin)