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

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

FreeDagNode Class Reference

Inheritance diagram for FreeDagNode:
Inheritance graph
[legend]
Collaboration diagram for FreeDagNode:
Collaboration graph
[legend]

List of all members.

Classes

union  Word

Public Types

enum  ReturnResult { GROUND, NONGROUND, UNIMPLEMENTED }

Public Member Functions

RawDagArgumentIteratorarguments ()
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
ReturnResult computeBaseSortForGroundSubterms ()
void computeGeneralizedSort (const SortBdds &sortBdds, const Vector< int > &realToBdd, Vector< Bdd > &generalizedSort)
bool computeSolvedForm (DagNode *rhs, UnificationContext &solution, PendingUnificationStack &pending)
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 (int argIndex, DagNode *replacement)
DagNodecopyWithReplacement (Vector< RedexPosition > &redexStack, int first, int last)
bool equal (const DagNode *other) const
 FreeDagNode (Symbol *symbol)
DagNodegetArgument (int i) const
size_t getHashValue ()
const MemoryCellgetMemoryCell () const
MemoryCellgetMemoryCell ()
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)
void insertVariables2 (NatSet &occurs)
DagNodeinstantiate (const Substitution &substitution)
DagNodeinstantiate2 (const Substitution &substitution)
DagNodeinstantiateWithReplacement (const Substitution &substitution, int argIndex, DagNode *newDag)
bool isGround () const
bool isReduced () const
bool isUnrewritable () const
bool isUnstackable () const
bool leq (const Sort *sort) const
DagNodemakeClone ()
virtual ExtensionInfomakeExtensionInfo ()
void mark ()
bool matchVariable (int index, const Sort *sort, bool copyToAvoidOverwriting, Substitution &solution, Subproblem *&returnedSubproblem, ExtensionInfo *extensionInfo)
virtual 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)
virtual DagNodepartialConstruct (DagNode *replacement, ExtensionInfo *extensionInfo)
virtual void partialReplace (DagNode *replacement, ExtensionInfo *extensionInfo)
void reduce (RewritingContext &context)
void replaceSymbol (Symbol *newSymbol)
void repudiateSortInfo ()
void setCallDtor ()
void setGround ()
void setReduced ()
void setSortIndex (int index)
void setTheoryByte (Byte value)
void setUnrewritable ()
void setUnstackable ()
void stackArguments (Vector< RedexPosition > &stack, int parentIndex, bool respectFrozen)
FreeSymbolsymbol () 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  PurificationStatus { OCCURS_CHECK_FAIL, PURE_AS_IS, PURIFIED }

Private Member Functions

DagNode ** argArray () const
void clearCopyPointers2 ()
DagNodecopyEagerUptoReduced2 ()
DagNodemarkArguments ()
PurificationStatus purifyAndOccurCheck (DagNode *repVar, UnificationContext &solution, PendingUnificationStack &pending, FreeDagNode *&purified)

Private Attributes

union {
   DagNode **   external
   Word   hashCache [nrWords]
   DagNode *   internal [nrWords]
}; 

Friends

class FreeBinarySymbol
class FreeLhsAutomaton
class FreeNet
class FreeRhsAutomaton
class FreeSymbol
class FreeTerm
class FreeTernarySymbol
class FreeUnarySymbol

Detailed Description

Definition at line 31 of file freeDagNode.hh.


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

Generated by  Doxygen 1.6.0   Back to index