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

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

AU_DagNode Class Reference

Inheritance diagram for AU_DagNode:
Inheritance graph
Collaboration diagram for AU_DagNode:
Collaboration graph

List of all members.

Public Types

enum  NormalizationStatus { FRESH = 0, ASSIGNMENT = 1, DEQUE = 2 }

Public Member Functions

RawDagArgumentIteratorarguments ()
 AU_DagNode (AU_Symbol *symbol, int size)
bool checkSort (const Sort *boundSort, Subproblem *&returnedSubproblem)
bool checkSort (const Sort *boundSort, RewritingContext &context)
void clearCopyPointers ()
int compare (const DagNode *other) const
int compareArguments (const DagNode *other) const
virtual ReturnResult computeBaseSortForGroundSubterms ()
void computeGeneralizedSort (const SortBdds &sortBdds, const Vector< int > &realToBdd, Vector< Bdd > &generalizedSort)
bool computeSolvedForm (DagNode *rhs, UnificationContext &solution, PendingUnificationStack &pending)
virtual bool computeSolvedForm2 (DagNode *rhs, UnificationContext &solution, PendingUnificationStack &pending)
void computeTrueSort (RewritingContext &context)
DagNodecopyAndReduce (RewritingContext &context)
DagNodecopyEagerUptoReduced ()
DagNodecopyReducible ()
void copySetRewritingFlags (const DagNode *other)
void copySortIndex (const DagNode *other)
DagNodecopyWithReplacement (Vector< RedexPosition > &redexStack, int first, int last)
DagNodecopyWithReplacement (int argIndex, DagNode *replacement)
bool equal (const DagNode *other) const
size_t getHashValue ()
MemoryCellgetMemoryCell ()
const MemoryCellgetMemoryCell () const
NormalizationStatus getNormalizationStatus () const
SortgetSort () const
int getSortIndex () const
Byte getTheoryByte () const
bool indexVariables (NarrowingVariableInfo &indices, int baseIndex)
bool indexVariables2 (NarrowingVariableInfo &indices, int baseIndex)
bool inErrorSort ()
void insertVariables (NatSet &occurs)
virtual void insertVariables2 (NatSet &occurs)
DagNodeinstantiate (const Substitution &substitution)
DagNodeinstantiate2 (const Substitution &substitution)
DagNodeinstantiateWithReplacement (const Substitution &substitution, int argIndex, DagNode *newDag)
bool isDeque () const
bool isFresh () const
bool isGround () const
bool isProducedByAssignment () const
bool isReduced () const
bool isUnrewritable () const
bool isUnstackable () const
bool leq (const Sort *sort) const
DagNodemakeClone ()
ExtensionInfomakeExtensionInfo ()
void mark ()
bool matchVariable (int index, const Sort *sort, bool copyToAvoidOverwriting, Substitution &solution, Subproblem *&returnedSubproblem, ExtensionInfo *extensionInfo)
bool matchVariableWithExtension (int index, const Sort *sort, Substitution &solution, Subproblem *&returnedSubproblem, ExtensionInfo *extensionInfo)
void * operator new (size_t size)
void * operator new (size_t size, DagNode *old)
void overwriteWithClone (DagNode *old)
DagNodepartialConstruct (DagNode *replacement, ExtensionInfo *extensionInfo)
void partialReplace (DagNode *replacement, ExtensionInfo *extensionInfo)
void reduce (RewritingContext &context)
void replaceSymbol (Symbol *newSymbol)
void repudiateSortInfo ()
void setCallDtor ()
void setGround ()
void setNormalizationStatus (NormalizationStatus status)
void setProducedByAssignment ()
void setReduced ()
void setSortIndex (int index)
void setTheoryByte (Byte value)
void setUnrewritable ()
void setUnstackable ()
void stackArguments (Vector< RedexPosition > &stack, int parentIndex, bool respectFrozen)
AU_Symbolsymbol () const
void upgradeSortIndex (const DagNode *other)

Protected Types

enum  Sizes { nrWords = 3 }

Protected Member Functions

bool isHashValid () const
void setHashValid ()

Static Protected Member Functions

static size_t hash (size_t v1, size_t v2)
static size_t hash (size_t v1, size_t v2, size_t v3)

Private Types

enum  NormalizationResult { COLLAPSED, DEQUED, NORMAL, FLATTENED }

Private Member Functions

void clearCopyPointers2 ()
DagNodecopyEagerUptoReduced2 ()
bool disappear (AU_Symbol *s, ArgVec< DagNode * >::const_iterator i)
bool eliminateBackward (DagNode *target, int &pos, int limit) const
bool eliminateForward (DagNode *target, int &pos, int limit) const
DagNodemakeFragment (int start, int nrSubterms, bool extraId) const
DagNodemarkArguments ()
NormalizationResult normalizeAtTop (bool dumb=false)

Private Attributes

ArgVec< DagNode * > argArray


class AU_DequeDagNode
class AU_ExtensionInfo
class AU_Layer
class AU_LhsAutomaton
class AU_RhsAutomaton
class AU_Subproblem
class AU_Symbol
class AU_Term

Detailed Description

Definition at line 31 of file AU_DagNode.hh.

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

Generated by  Doxygen 1.6.0   Back to index