Logo Search packages:      
Sourcecode: maude version File versions  Download package

Classes | Public Types | Public Member Functions | Protected Member Functions | Static Protected Member Functions | Private Member Functions | Private Attributes | Friends

AU_Term Class Reference

Inheritance diagram for AU_Term:
Inheritance graph
Collaboration diagram for AU_Term:
Collaboration graph

List of all members.


struct  CP_Sequence
struct  Tuple

Public Types

enum  ReturnValues { GREATER = 1, LESS = -2, EQUAL = 0, UNKNOWN = -1 }

Public Member Functions

void analyseCollapses ()
void analyseCollapses2 ()
void analyseConstraintPropagation (NatSet &boundUniquely) const
RawArgumentIteratorarguments ()
 AU_Term (AU_Symbol *symbol, const Vector< Term * > &arguments)
const PointerSetcollapseSymbols () const
int compare (const Term *other) const
int compare (const DagNode *other) const
int compareArguments (const Term *other) const
int compareArguments (const DagNode *other) const
LhsAutomatoncompileLhs (bool matchAtTop, const VariableInfo &variableInfo, NatSet &boundUniquely, bool &subproblemLikely)
LhsAutomatoncompileLhs2 (bool matchAtTop, const VariableInfo &variableInfo, NatSet &boundUniquely, bool &subproblemLikely)
int compileRhs (RhsBuilder &rhsBuilder, VariableInfo &variableInfo, TermBag &availableTerms, bool eagerContext)
int compileRhs2 (RhsBuilder &rhsBuilder, VariableInfo &variableInfo, TermBag &availableTerms, bool eagerContext)
void compileTopRhs (RhsBuilder &rhsBuilder, VariableInfo &variableInfo, TermBag &availableTerms)
int computeSize ()
DagNodedagify ()
DagNodedagify2 ()
TermdeepCopy (SymbolMap *translation=0) const
TermdeepCopy2 (SymbolMap *translator) const
void deepSelfDestruct ()
void determineContextVariables ()
virtual bool earlyMatchFailOnInstanceOf (const Term *other) const
bool equal (const Term *other) const
bool equal (const DagNode *other) const
void findAvailableTerms (TermBag &availableTerms, bool eagerContext, bool atTop)
void findEagerVariables (bool atTop, NatSet &eagerVariables) const
ConnectedComponentgetComponent () const
unsigned int getHashValue () const
int getLineNumber () const
int getSaveIndex () const
SortgetSort () const
int getSortIndex () const
bool greedySafe (const VariableInfo &variableInfo, const NatSet &boundUniquely) const
bool ground () const
bool hasEagerContext () const
bool honorsGroundOutMatch () const
bool idPossible (int index) const
void indexVariables (VariableInfo &indicies)
void insertAbstractionVariables (VariableInfo &variableInfo)
Terminstantiate (const Vector< Term * > &varBindings, SymbolMap *translation)
virtual Terminstantiate2 (const Vector< Term * > &varBindings, SymbolMap *translator)
bool leq (const Sort *sort) const
void markEager (int nrVariables, const NatSet &eagerVariables, Vector< int > &problemVariables)
void markEagerArguments (int nrVariables, const NatSet &eagerVariables, Vector< int > &problemVariables)
bool matchIndependent (const Term *other) const
Termnormalize (bool full, bool &changed)
const NatSetoccursBelow () const
const NatSetoccursInContext () const
int partialCompare (const Substitution &partialSubstitution, DagNode *other) const
virtual int partialCompareArguments (const Substitution &partialSubstitution, DagNode *other) const
virtual int partialCompareUnstable (const Substitution &partialSubstitution, DagNode *other) const
void setHonorsGroundOutMatch (bool flag)
void setLineNumber (int lineNr)
void setSortInfo (ConnectedComponent *component, int index)
bool stable () const
virtual bool subsumes (const Term *other, bool sameVariableSet) const
AU_Symbolsymbol () const
DagNodeterm2Dag (bool setSortInfo=false)
bool willGroundOutMatch (const NatSet &boundUniquely) const

Protected Member Functions

void addCollapseSymbol (Symbol *symbol)
void addCollapseSymbols (const PointerSet &symbols)
void setHashValue (unsigned int value)
void setSaveIndex (int index)

Static Protected Member Functions

static void commonSymbols (Vector< Term * > &terms, PointerSet &common)
static unsigned int hash (unsigned int v1, unsigned int v2)
static unsigned int hash (unsigned int v1, unsigned int v2, unsigned int v3)

Private Member Functions

void addFixedLengthBlock (AU_LhsAutomaton *a, int blockStart, int blockEnd, const VariableInfo &variableInfo, const NatSet &boundUniquely, bool &subproblemLikely)
 AU_Term (const AU_Term &original, AU_Symbol *symbol, SymbolMap *translator)
void findConstraintPropagationSequence (const Vector< Bool > &currentSequence, const NatSet &boundUniquely, int leftPos, int rightPos, CP_Sequence &bestSequence) const
void findConstraintPropagationSequence (const NatSet &boundUniquely, CP_Sequence &bestSequence) const
bool unitVariable (VariableTerm *vt, int index) const

Private Attributes

Vector< TupleargArray
int uniqueCollapseSubtermIndex


class AU_ArgumentIterator

Detailed Description

Definition at line 32 of file AU_Term.hh.

The documentation for this class was generated from the following files:

Generated by  Doxygen 1.6.0   Back to index