Developer Documentation
Centre for Vision, Speech & Signal Processing
USER IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
VLTheory::VLTheory(void)
VLTheory::VLTheory(const VLTheory &)
VLTheory::AddRule(const VLRuleC &)
VLTheory::DelRule(const VLRuleC &)
VLTheory::Replace(const VLRuleC &,const VLRuleC &)
VLTheory::ListByAction(const VLSymbC &,VLRuleSetC &) const
VLTheory::ListByPost(const VLSymbC &,VLRuleSetC &) const
VLTheory::UListByPost(const VLSymbC &,VLListIndexC &) const
VLTheory::UListByPost(const VLSymbC &,VLListIndexC &,VLListIndexC &) const
VLTheory::ListByPost(const VLMinTermC &,VLRuleSetC &) const
VLTheory::Dump(void)
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
VLTheory
 
A Theory is a set of rules.
 
include "amma/Logic2/Theory.hh"
User Level:Default
Library:Logic2
Example:exIndex.cc
Section:Logic.Core
In Scope:std

Parent Classes:

Variables:
VLRuleSetC rules;
Set of rules in theory. VExprLst ExprTypeLst; // List of expression types.

VLListIndexC indAction;
Index of rules, by Action.

VLMinTermIndexC indPreCond;
Index by pre-conditions

VLMinTermIndexC indPostCond;
Index by post-conditions

Methods:
VLTheory()
Construct a new theory.

VLTheory(const VLTheory & Oth)
Copy constructor.

BooleanT AddRule(const VLRuleC & Rule)
Add new rule to theory.

BooleanT DelRule(const VLRuleC & Rule)
Remove rule from theory.

BooleanT Replace(const VLRuleC & Old,const VLRuleC & New)
Quick rule update. NB. The old rule may not be removed, it may only be updated to match the new one.

BooleanT ListByAction(const VLSymbC & Act,VLRuleSetC & Set) const
List rules by action, Ret:True if some found.

BooleanT ListByPost(const VLSymbC & Act,VLRuleSetC & Set) const
List rules by post, Ret:True if some found.

BooleanT UListByPost(const VLSymbC & postCond,VLListIndexC<VLRuleC> & set) const
List by postcondition, unifying version.

BooleanT UListByPost(const VLSymbC & PostCond,VLListIndexC<VLRuleC> & pSet,VLListIndexC<VLRuleC> & nSet) const
List by postcondition, unifying version.

BooleanT ListByPost(const VLMinTermC & PostCond,VLRuleSetC & set) const
List by postcondition, Ret:True if some found.

void Dump()
Dump theory to stdout.

#include "amma/BRefCntV.hh"
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.

#include "amma/BRefCnt.hh"
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.

#include "amma/RefCBase.hh"
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.


Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001