PUBLIC

BLiteralIndexC::BLiteralIndexC(void) BLiteralIndexC::BLiteralIndexC(const BLiteralIndexC &,bool) BLiteralIndexC::BLiteralIndexC(const LiteralIndexC &) BLiteralIndexC::DeepCopy(void) const BLiteralIndexC::operator [](const LiteralC &) BLiteralIndexC::Lookup(const LiteralC &,DataT &) BLiteralIndexC::IsElm(const LiteralC &) BLiteralIndexC::Insert(const LiteralC &,const DataT &) BLiteralIndexC::IsEmpty(void) const BLiteralIndexC::Size(void) const BLiteralIndexC::UseIndex(const LiteralIndexC &) BLiteralIndexC::IdIndex(void) const BLiteralIndexC::BLiteralIndexC(const LiteralIndexC &,const BHashC &)

LiteralIndexC ids;

BHashC tab;

BLiteralIndexC()

Default constructor.
Creates a new table.

BLiteralIndexC(const BLiteralIndexC<DataT> & oth,bool 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 indexes with similar sets of keys.

BLiteralIndexC(const LiteralIndexC<IntC> & nids)

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

BLiteralIndexC<DataT> DeepCopy() const

Make a deep copy of the index.

const DataT & operator [](const LiteralC & cnd)

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

bool Lookup(const LiteralC & key,DataT & data)

Copy data associated with 'key' to data if it exists.
Returns true if data has been found.

bool IsElm(const LiteralC & key)

Is 'key' in index ?

void Insert(const LiteralC & cnd,const DataT & data)

Add a new item to the index.

bool IsEmpty() const

Is table empty ?

UIntT Size() const

How many entries ?

bool UseIndex(const LiteralIndexC<IntC> & nIds)

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

const LiteralIndexC<IntC> & IdIndex() const

Get ID index.

BLiteralIndexC(const LiteralIndexC<IntC> & nIds,const BHashC<IntT,DataT> & nTab)

Construct using an index and a table.