PUBLIC

VLBIndexC::VLBIndexC(void) VLBIndexC::VLBIndexC(const VLBIndexC &,BooleanT) VLBIndexC::VLBIndexC(const VLIndexC &) VLBIndexC::DeepCopy(void) const VLBIndexC::Add(const VLSymbC &,const T &) VLBIndexC::operator[](const VLSymbC &) VLBIndexC::IsEmpty(void) const VLBIndexC::Size(void) const VLBIndexC::UseIndex(const VLIndexC &) VLBIndexC::IdIndex(void) const VLBIndexC::VLBIndexC(const VLIndexC &,const BHashIntC &)

VLBIndexC<class T>
Branching index.
include	"amma/Logic2/BIndex.hh"
User Level:	Default
Library:	VLIndex
Example:	exIndex.cc
Section:	Logic.Index
In Scope:	std

Comments:
SMALL OBJECT

VLIndexC ids;

BHashIntC tab;

VLBIndexC()

Default constructor.
Creates a new table.

VLBIndexC(const VLBIndexC<T> & oth,BooleanT ShareIDOnly = FALSE)

Copy constructor.
If ShareIDOnly is TRUE then a new index is created, which shares the ID index of the old table but not its contents. Usefull if you wish to make several indexs with similar sets of keys.

VLBIndexC(const VLIndexC<IntC> & ids)

Construct using a given id Index.
Otherwise creates a new index, another way of doing share only. see above.

VLBIndexC<T> DeepCopy() const

Make a deep copy of the index.

BooleanT Add(const VLSymbC & Cnd,const T & Data)

Add a new item to the index.
Ret:False = Not new item.

T & operator[](const VLSymbC & cnd)

Lookup an entry.
Creates a new entry if one doesn't exist.

BooleanT IsEmpty() const

Is table empty ?

UIntT Size() const

How many entries ?

BooleanT UseIndex(const VLIndexC<IntC> & ids)

Use another index, you can only use this
function if there are no entries in the table.

const VLIndexC<IntC> & IdIndex() const

Get ID index.

VLBIndexC(const VLIndexC<IntC> & ids,const BHashIntC<T> & ntab)

Construct using an index and a table.