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

  PUBLIC
VLExprFragmentSetBodyC::VLExprFragmentSetBodyC(const VLMinTermC &,BooleanT)
VLExprFragmentSetBodyC::VLExprFragmentSetBodyC(const VLExprC &)
VLExprFragmentSetBodyC::AddFragmentsOf(const VLExprC &)
VLExprFragmentSetBodyC::AddFragmentsOf(const VLMinTermC &,BooleanT)
VLExprFragmentSetBodyC::AddFragmentsOf(const VLSymbC &)
VLExprSet::CopySet(void) const
VLExprSet::operator=(const VLExprSet &)
VLExprSet::Add(const VLSymbC &)
VLExprSet::Add(const VLExprC &)
VLExprSet::Add(const VLSymbC &,VLBindLst &)
VLExprSet::Remove(const VLSymbC &)
VLExprSet::IsMember(const VLSymbC &) const
VLExprSet::IsMember(const VLSymbC &,VLBindLst &) const
VLExprSet::IsEmpty(void) const
VLExprSet::Normal(const VLSymbC &)
VLExprSet::Union(const VLExprSet &)
VLExprSet::Size(void) const
VLExprSet::Empty(void)
VLExprSet::Dump(void) const
VLExprSet::CopySpace(void) const
VLExprSet::IsInSpace(const VLSymbC &,VLBindLst &) const
VLExprSet::IsInSpace(const VLSymbC &) const
VLExprSet::Solutions(const VLExprC &,VLBindLst &) const
VLExprSet::Solutions(const VLMinTermC &,VLBindLst &) const
VLExprSet::ListAsserted(void) const
VLExprSet::AssertSpace(const VLSymbC &)
VLExprSet::RetractSpace(const VLSymbC &)
VLSpace::CopySpace(void) const
VLSpace::IsInSpace(const VLSymbC &,VLBindLst &) const
VLSpace::IsInSpace(const VLSymbC &) const
VLSpace::Solutions(const VLSymbC &,VLBindLst &) const
VLSpace::Solutions(const VLExprC &,VLBindLst &) const
VLSpace::Solutions(const VLMinTermC &,VLBindLst &) const
VLSpace::ListAsserted(void) const
VLSpace::AssertSpace(const VLSymbC &)
VLSpace::RetractSpace(const VLSymbC &)
VLSpace::Differences(const VLSpaceC &) const
VLSpace::Random(void) const
VLSpace::SpaceSize(void) const
VLSpace::Dump(ostream &) const
VLSpace::operator+=(const VLMinTermC &)
VLSpace::operator-=(const VLMinTermC &)
VLSpace::Hash(void) const
VLSpace::operator==(const VLSpaceC &) 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
VLExprFragmentSetBodyC
 
Generate the set of all possible fragments of an expression/minterm.
 
include "amma/Logic2/ExprFragSet.hh"
User Level:Default
Library:VLLearn
Example:exIndex.cc
Section:default.Charles Galambos
In Scope:std

Parent Classes:

Methods:
VLExprFragmentSetBodyC(const VLMinTermC & mt,BooleanT addTerms = true)
Minterm constructor.
indIndex of types of intererest.

VLExprFragmentSetBodyC(const VLExprC & ex)
Minterm constructor.
indIndex of types of intererest.

void AddFragmentsOf(const VLExprC & ex)
Add all fragments of 'ex' to set.
indIndex of types of intererest.
NB. This does NOT add 'ex' itself.

void AddFragmentsOf(const VLMinTermC & mt,BooleanT addTerms = true)
Add all fragments of 'mt' to set.
indIndex of types of intererest.
NB. This does NOT add 'mt' itself.

void AddFragmentsOf(const VLSymbC & s)
Add all fragments of 's' to set.
indIndex of types of intererest.
NB. This does NOT add 's' itself.

#include "amma/Logic2/LExprSet.hh"
VLExprSetC CopySet() const
Make a copy of the set.
This is shallow, as set members shouldn't change.

const VLExprSet & operator=(const VLExprSet & Oth)
Assigment.

BooleanT Add(const VLSymbC & Obj)
Add member to set.
Return True == added new value.

BooleanT Add(const VLExprC & Obj)
Add member to set.
Return True == added new value.

BooleanT Add(const VLSymbC & Obj,VLBindLst & bnds)
Add Expr with Bnds substituted.

BooleanT Remove(const VLSymbC & Obj)
Remove member from set.

BooleanT IsMember(const VLSymbC & Obj) const
Test membership.

BooleanT IsMember(const VLSymbC & Obj,VLBindLst & Bnds) const
Test membership.

BooleanT IsEmpty(void) const
Is set empty ?

const VLSymbC & Normal(const VLSymbC & Obj)
Normalise Expr wrt ExprSet.

void Union(const VLExprSet & Oth)
Add another set to this one.

int Size(void) const
Returns number of elements in this set.

void Empty(void)
Empty set of all its contents.

void Dump(void) const
Dump set to stdout.

VLSpaceC CopySpace() const
Copy logical space.

BooleanT IsInSpace(const VLSymbC & symb,VLBindLst & bnds) const
Is symbol in space ?

BooleanT IsInSpace(const VLSymbC & symb) const
Is symbol in space ?

VLSymbIterC Solutions(const VLExprC & expr,VLBindLst & bnds) const
Get solution iterator.
Return == NULL, None.

VLSymbIterC Solutions(const VLMinTermC & mt,VLBindLst & bnds) const
Get solution iterator.
Return == NULL, None.

VLSymbIterC ListAsserted() const
List all asserted symbols.

BooleanT AssertSpace(const VLSymbC & symb)
Assert symbol in space.
Return FALSE=Assert failed.

BooleanT RetractSpace(const VLSymbC & symb)
Retract symbol from space.
Return FALSE=Retract failed.

#include "amma/Logic2/LSpace.hh"
VLSpaceC CopySpace() const
Copy logical space.

BooleanT IsInSpace(const VLSymbC & symb,VLBindLst & bnds) const
Is symbol in space ?
Should be equivelent to IsMember(...), but is named differently to avoid a virtual function overhead where it is not needed.

BooleanT IsInSpace(const VLSymbC & symb) const
Is symbol in space ?
Should be equivelent to IsMember(...), but is named differently to avoid a virtual function overhead where it is not needed.

VLSymbIterC Solutions(const VLSymbC & expr,VLBindLst & bnds) const
Get solution iterator.
Return == NULL, None.

VLSymbIterC Solutions(const VLExprC & expr,VLBindLst & bnds) const
Get solution iterator.
Return == NULL, None.

VLSymbIterC Solutions(const VLMinTermC & mt,VLBindLst & bnds) const
Get solution iterator.
Return == NULL, None.

VLSymbIterC ListAsserted() const
List all asserted symbols.
If return NULL, not supported.

BooleanT AssertSpace(const VLSymbC & symb)
Assert symbol in space.
Return FALSE=Assert failed.

BooleanT RetractSpace(const VLSymbC & symb)
Retract symbol from space.
Return FALSE=Retract failed.

VLMinTermC Differences(const VLSpaceC & other) const
List all differences between this space and another.
Positive differences are symbols in this space but not 'other'

Netagive differences are symbols in the 'other' space but not this one

This provides a default implementation which involves iterating through all symbols in both spaces. If there is a better way for the types of space involved this method should be overiden.


VLSymbC Random() const
Select random member of the space.

IntT SpaceSize() const
How many symbols are there in the space ?
return: -1 = Unknown.

void Dump(ostream & out) const
Dump to stream in human readable format.

BooleanT operator+=(const VLMinTermC & s)
Short hand for assert/retract

BooleanT operator-=(const VLMinTermC & s)
Not supported!

unsigned int Hash() const
Hash function.

BooleanT operator==(const VLSpaceC & oth) const
Comparison.

#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