PUBLIC

VLBNPListIndexC::VLBNPListIndexC(void) VLBNPListIndexC::VLBNPListIndexC(const VLBNPIndexC> &) VLBNPListIndexC::VLBNPListIndexC(const VLBNPListIndexC &) VLBNPListIndexC::DeepCopy(void) const VLBNPListIndexC::Insert(const VLSymbC &,const T &) VLBNPListIndexC::Insert(const VLMinTermC &,const T &) VLBNPIndexC::DeepCopy(void) const VLBNPIndexC::Add(BooleanT,const VLSymbC &,const T &) VLBNPIndexC::Add(const VLMinTermC &,const T &) VLBNPIndexC::Access(BooleanT,const VLSymbC &) VLBNPIndexC::IsEmpty(void) const VLBNPIndexC::IdIndex(void) const

VLBNPListIndexC<class T>
This is a specialisation of VLNPIndex.
include	"amma/Logic2/BNPListIndex.hh"
User Level:	Default
Library:	VLIndex
Example:	exIndex.cc
Section:	Logic.Index
In Scope:	std

Comments:
Used in the Non-linear planner, but put here in case it's usefull elsewhere.

public VLBNPIndexC<class T>

VLBNPListIndexC()

Default constructor.

VLBNPListIndexC(const VLBNPIndexC<BListC<T>> & oth)

Constructor.

VLBNPListIndexC(const VLBNPListIndexC<T> & oth)

Copy constructor.

VLBNPIndexC<BListC<T>> DeepCopy() const

Make a deep copy of this class.

BooleanT Insert(const VLSymbC & symb,const T & dat)

Insert data into all appropriate lists.

BooleanT Insert(const VLMinTermC & symb,const T & dat)

Insert data into all appropriate lists.

VLBNPIndexC<BListC<T>> DeepCopy() const

Make a deep copy of this class.

BooleanT Add(BooleanT negate,const VLSymbC & symb,const BListC<T> & data)

Add data.
Ret: TRUE = New item.

BooleanT Add(const VLMinTermC & mt,const BListC<T> & data)

Add data.
Ret: TRUE = New item.

BListC<T> & Access(BooleanT negate,const VLSymbC & symb)

Access data.

BooleanT IsEmpty() const

Is table empty ?

const VLIndexC<IntC> & IdIndex() const

Get ID index.