PUBLIC

BinListC::BinListC(const IT &) BinListC::Insert(const IT &,const BT &) BinListC::ListBin(const IT &) BinListC::Empty(void) BinListC::operator[](const IT &) BinListC::Bin(const DIT &) BinListC::GetBin(const IT &) BinListC::Iter(void) BinListC::BinKey(const IT &) const BinListC::BinSize(void) const BinListC::BinCentre(const IT &) const BinListC::SetBinSize(const IT &)

BinListC<class IT,class DIT,class BT>
Binned table of lists.
include	"amma/BinList.hh"
User Level:	Default
Library:	SparHist
Example:	exBnd.cc
Section:	Statistics.Histograms
In Scope:	std

Comments:
SMALL OBJECT

BinTableC> Table;

BinListC(const IT & BinSize)

Constructor.

void Insert(const IT & Key,const BT & Data)

Insert into table.

DListC<BT> & ListBin(const IT & Key)

List items in same bin as key.

void Empty()

Empty all bins.

DListC<BT> & operator[](const IT & Key)

Array access to lists.

DListC<BT> & Bin(const DIT & Key)

Direct access to bin, use result of BinKey(...).

DListC<BT> * GetBin(const IT & Pnt)

See if bins present.

BinIterC<IT,DIT,DListC<BT>> Iter()

Create an iterator.

DIT BinKey(const IT & Oth) const

Descritise a point.

IT BinSize() const

Get size of bins.

IT BinCentre(const IT & at) const

Get centre of bin containing point at.

void SetBinSize(const IT & nBinSize)

Set the bin size.
NB. The table MUST be empty.