PUBLIC

VLModelDLBodyC::VLModelDLBodyC(void) VLModelDLBodyC::VLModelDLBodyC(const VLModelDLBodyC &) VLModelDLBodyC::Predict(const VLSymbC &,const VLSpaceC &) const VLModelDLBodyC::Invert(const VLMinTermC &) const VLModelDLBodyC::Invert(const VLSpaceC &,const VLMinTermC &) VLModelDLBodyC::AddExample(const VLSpaceC &,const VLSymbC &,const VLMinTermC &) VLModelDLBodyC::BuildStep(const VLMinTermC &,const VLSymbC &,const VLModelDLActionC &,BooleanT) const DPModelBodyC::Predict(const ActionT &,const StateT &) const DPModelBodyC::Invert(const DeltaT &) const DPModelBodyC::Invert(const StateT &,const DeltaT &) DPEntityBodyC::Save(ostream &) const DPEntityBodyC::Copy(void) const BodyRefCounterVC::Copy(void) const BodyRefCounterVC::operator==(const BodyRefCounterVC &) const BodyRefCounterVC::operator!=(const BodyRefCounterVC &) const BodyRefCounterVC::Save(ostream &) const BodyRefCounterC::AddReference(void) BodyRefCounterC::RemoveReference(void) BodyRefCounterC::SetConst(void) const BodyRefCounterC::SetConst(void) BodyRefCounterC::IsConst(void) const BodyRefCounterC::IsNotConst(void) const BodyRefCounterC::ToBeDeleted(void) const BodyRefCounterC::ToBeDeletedRemoveIgnoreNoRemove(void) BodyRefCounterC::ToBeDeletedRemove(void) BodyRefCounterC::BodyMightBeDeleted(void) const BodyRefCounterC::IsCountZero(void) const BodyRefCounterC::BRCPtrCanDeleteObject(void) const BodyRefCounterC::Count(void) const BodyRefCounterC::operator=(const BodyRefCounterC &) BodyRefCounterC::IsValidObject(void) const BodyRefCounterC::UserBitTest(IntT) const BodyRefCounterC::UserBitSet(IntT,BooleanT) BodyRefCounterC::UserBitZero(IntT) BodyRefCounterC::ReportBRCError(char *) BodyRefCounterC::Hash(void) const BodyRefCounterC::SetUndeletable(void) BodyRefCounterC::ReportInvalidObject(char *) const RefCounterBaseC::Label(void) const

VLModelDLBodyC
Decision List Model Body.
include	"amma/Logic2/DLModel.hh"
User Level:	Default
Library:	VLModel
Example:	exIndex.cc
Section:	Logic.Model
In Scope:	std

Comments:
This models each action seperatly with a decision list. Its is best used for determinstic, transparent, and synchronus enviroments.

public DPModelBodyC<class ActionT,class StateT,class DeltaT,class PrecondT>

HashARC indByAct;

ind	Index of types of intererest.

Index by action type.

VLIndexC indByActSymb;

ind	Index of types of intererest.

Index by act symb.

VLMinTermIndexC indByDeci;

ind	Index of types of intererest.

Index by decision.

VLModelDLBodyC()

Default constructor.

ind	Index of types of intererest.

VLModelDLBodyC(const VLModelDLBodyC & oth)

Copy constructor.

ind	Index of types of intererest.

VLMinTermC Predict(const VLSymbC & act,const VLSpaceC & in) const

Find the change in state is action is applied to in.

ind	Index of types of intererest.

DListC<DPModelStepC<VLSymbC,VLMinTermC,VLMinTermC>> Invert(const VLMinTermC & delta) const

Find a list of possible actions that will lead to a change.

ind	Index of types of intererest.

Returns a list of actions associated with a confidence. 0=No chance. 1=Definitly will.

DListC<DPModelStepC<VLSymbC,VLMinTermC,VLMinTermC>> Invert(const VLSpaceC & at,const VLMinTermC & delta)

Find a list of possible actions that will lead to a change in given state.

ind	Index of types of intererest.

Returns a list of actions associated with a confidence. 0=No chance. 1=Definitly will.

BooleanT AddExample(const VLSpaceC & init,const VLSymbC & act,const VLMinTermC & delta)

Add an example.

ind	Index of types of intererest.

init = Inital state. act = Action taken. delta = Change in state. Returns TRUE if model changed.

DListC<DPModelStepC<VLSymbC,VLMinTermC,VLMinTermC>> BuildStep(const VLMinTermC & delta,const VLSymbC & deci,const VLModelDLActionC & x,BooleanT inv) const

Build list of possible steps.

ind	Index of types of intererest.

VLMinTermC Predict(const VLSymbC & act,const VLSpaceC & in) const

Find the change in state is action is applied to in.

ind	Index of types of intererest.

DListC<DPModelStepC<VLSymbC,VLMinTermC,VLMinTermC>> Invert(const VLMinTermC & delta) const

Find a list of possible actions that will lead to a change.

ind	Index of types of intererest.

Returns a list of actions associated with a confidence. 0=No chance. 1=Definitly will.

DListC<DPModelStepC<VLSymbC,VLMinTermC,VLMinTermC>> Invert(const VLSpaceC & at,const VLMinTermC & delta)

Find a list of possible actions that will lead to a change in given state.

ind	Index of types of intererest.

Returns a list of actions associated with a confidence. 0=No chance. 1=Definitly will.

BooleanT Save(ostream & out) const

Save to ostream.

BodyRefCounterVC & Copy() const

Creat a copy of this object.

BodyRefCounterVC & Copy() const

Creat a copy of this object.

BooleanT operator==(const BodyRefCounterVC & oth) const

Compair identitys.

BooleanT operator!=(const BodyRefCounterVC & oth) const

Compair identitys.

BooleanT Save(ostream & out) const

Save to ostream.

void AddReference()

Another reference to the object has been created.

void RemoveReference()

One reference to the object was deleted.
Locking scheme -------------- The object is possible to lock (to make constant). The scheme assumes that the object is created, it can be locked, after that it can only be destroyed. The locked object cannot be unlocked. This locking scheme is very useful during debugging, using assert() function, when it is necassary to check that object is treated as constant and the constancy is not violated by any casting or passing through the copy constructor of shared objects.

void SetConst(void) const

This locks the object.
Often objects you wish to lock are already const.

void SetConst(void)

This locks the object.

BooleanT IsConst(void) const

Returns TRUE if the object is locked, ie. it is assumed to be constant.

BooleanT IsNotConst(void) const

Returns TRUE if the object is unlocked.
ie. there is no special information if the object is constant or not. Counter state information -------------------------

BooleanT ToBeDeleted() const

Returns TRUE if there is only one reference to the object and the whole object or its reference counting part can be deleted.

BooleanT ToBeDeletedRemoveIgnoreNoRemove()

Decrement refrence by 1 return true if this leaves no refrences to the object.

BooleanT ToBeDeletedRemove()

Decrement refrence by 1 return true if this leaves no refrences to the object. This also checks the NoRemove flag.

BooleanT BodyMightBeDeleted() const

Returns TRUE if the reference counted part of the object can be deleted, ie. flag NOREMOVE is false .

BooleanT IsCountZero() const

Are there any refrences left ?

BooleanT BRCPtrCanDeleteObject() const

Used by BRRCPtrC to establish if an object has ZERO refrences and can be deleted.

IntT Count() const

Returns the current state of the counter, ie. how many references to this object exist.

const BodyRefCounterC & operator=(const BodyRefCounterC & b)

It has not meaning to assign object 'b' to this object because it would destroy a history of the object which is counted. So this is a dummy function.

BooleanT IsValidObject() const

Test if object is valid.
When amma check is disabled this always returns true.

BooleanT UserBitTest(IntT x) const

Test user flag.

void UserBitSet(IntT x,BooleanT setit = TRUE)

Test user flag.

void UserBitZero(IntT x)

Set bit to zero.

void ReportBRCError(char * Msg)

Report error, used in BRCPtrC.

UIntT Hash() const

Hash on address of object.

void SetUndeletable()

Make object undeletable.
Usefull to prevent recursive deleting in graph structures. Only hackers need this function.

void ReportInvalidObject(char * Msg = 0) const

Tell user about validation failure.

LabelT Label() const

Returns the label of this reference counter.
The member function is useful mainly to recognize objects during debugging. The value of the label is uniquely defined pointer.