PUBLIC

BMinTermIndexC::BMinTermIndexC(void) BMinTermIndexC::BMinTermIndexC(const LiteralIndexC &) BMinTermIndexC::DeepCopy(void) const BMinTermIndexC::Insert(bool,const LiteralC &,const DataT &) BMinTermIndexC::Insert(const MinTermC &,const DataT &) BMinTermIndexC::Access(bool,const LiteralC &) BMinTermIndexC::Lookup(bool,const LiteralC &,DataT &) BMinTermIndexC::Insert(bool,const LiteralC &,DataT &) BMinTermIndexC::IsEmpty(void) const BMinTermIndexC::IdIndex(void) const BMinTermIndexC::BMinTermIndexC(const BLiteralIndexC &,const BLiteralIndexC &)

BMinTermListIndexC

BLiteralIndexC pos;

Index for positive terms.

BLiteralIndexC neg;

Index for negative terms.

BMinTermIndexC()

Default constructor.

BMinTermIndexC(const LiteralIndexC<IntC> & ids)

Construct using a given id Index.
Otherwise creates a new index.

BMinTermIndexC<DataT> DeepCopy() const

Make a deep copy of this class.

void Insert(bool negate,const LiteralC & lit,const DataT & data)

Add data indexed on a single literal.

bool Insert(const MinTermC & mt,const DataT & data)

Add data indexed on a minterm.
Returns true if 'mt' is a new key.

const DataT & Access(bool negate,const LiteralC & lit)

Access data.
Lookup associated with 'lit'. If 'lit' does not exist within the index it is added. The returned value is created with the default constructor.

bool Lookup(bool negate,const LiteralC & lit,DataT & data)

Access data.
Lookup associated with 'lit'. If 'lit' does not exist it returns false.

void Insert(bool negate,const LiteralC & lit,DataT & data)

Lookup data associated with key.

bool IsEmpty() const

Is table empty ?

const LiteralIndexC<IntC> & IdIndex() const

Get ID index.

BMinTermIndexC(const BLiteralIndexC<DataT> & npos,const BLiteralIndexC<DataT> & nneg)

Make a new NPIndex from two other indexs.