 class  ATChecks : public DiagramChecks
  class  ATChecks : public DiagramChecks implements generic checks for soft constraints on AT diagrams.
|   | ATChecks (Diagram *d, Graph *g) | 
|  unsigned | CheckUnreachableStates (string &chkbuf) | 
|  unsigned | CheckEmptyEvents (string &) | 
|  unsigned | CheckEmptyActions (string &) | 
|  unsigned | CheckNoActions (string &) | 
|  unsigned | CheckDoubleEvents (string &) | 
 unsigned  CheckNodeCount(unsigned count, int nodeType, string &chkbuf)
 unsigned  CheckNodeCount(unsigned count, int nodeType, string &chkbuf)
 unsigned  CheckNodeCount(unsigned min, unsigned max, int nodeType, string &chkbuf)
 unsigned  CheckNodeCount(unsigned min, unsigned max, int nodeType, string &chkbuf)
 unsigned  CheckEdgeCount(unsigned count, int edgeType, string &chkbuf)
 unsigned  CheckEdgeCount(unsigned count, int edgeType, string &chkbuf)
 unsigned  CheckEdgeCount(unsigned min, unsigned max, int edgeType, string &chkbuf)
 unsigned  CheckEdgeCount(unsigned min, unsigned max, int edgeType, string &chkbuf)
 unsigned  CheckDoubleIndexes(string &chkbuf)
 unsigned  CheckDoubleIndexes(string &chkbuf)
 unsigned  CheckNamelessNodes(int nodeType, string &chkbuf)
 unsigned  CheckNamelessNodes(int nodeType, string &chkbuf)
 unsigned  CheckNamelessEdges(int edgeType, string &chkbuf)
 unsigned  CheckNamelessEdges(int edgeType, string &chkbuf)
 unsigned  CheckIllegalNodeNames(int nodeType, const string *name, string &chkbuf)
 unsigned  CheckIllegalNodeNames(int nodeType, const string *name, string &chkbuf)
 unsigned  CheckIllegalEdgeNames(int edgeType, const string *name, string &chkbuf)
 unsigned  CheckIllegalEdgeNames(int edgeType, const string *name, string &chkbuf)
 unsigned  CheckNamelessEdges( int edgeType, int type1, int type2, string &chkbuf)
 unsigned  CheckNamelessEdges( int edgeType, int type1, int type2, string &chkbuf)
 unsigned  CheckDoubleNamelessEdges(int edgeType, int type1, int type2, string &chkbuf)
 unsigned  CheckDoubleNamelessEdges(int edgeType, int type1, int type2, string &chkbuf)
 unsigned  CheckDoubleNodes(int nodeType, string &chkbuf)
 unsigned  CheckDoubleNodes(int nodeType, string &chkbuf)
 unsigned  CheckConnected(int nodeType, bool index, string &chkbuf)
 unsigned  CheckConnected(int nodeType, bool index, string &chkbuf)
 unsigned  CheckConnected(int nodeType, int toNode, int min, int max, bool index, string &chkbuf)
 unsigned  CheckConnected(int nodeType, int toNode, int min, int max, bool index, string &chkbuf)
 unsigned  CheckJunctionCoherence(int nodeType, int parenttype, int childtype, unsigned minChildren, string &chkbuf)
 unsigned  CheckJunctionCoherence(int nodeType, int parenttype, int childtype, unsigned minChildren, string &chkbuf)
 unsigned  CheckCountEdgesFrom(int nodeType, int edgeType, unsigned min, unsigned max, bool zeroAllowed, bool index, string &chkbuf)
 unsigned  CheckCountEdgesFrom(int nodeType, int edgeType, unsigned min, unsigned max, bool zeroAllowed, bool index, string &chkbuf)
 unsigned  CheckReachability(int rootType, int nodeType, bool index, string &chkbuf)
 unsigned  CheckReachability(int rootType, int nodeType, bool index, string &chkbuf)
 Graph*  GetGraph() const
 Graph*  GetGraph() const 
 Diagram*  GetDiagram() const
 Diagram*  GetDiagram() const 
 unsigned  CheckCount(unsigned min, unsigned max, int type, string &chkbuf, bool node)
 unsigned  CheckCount(unsigned min, unsigned max, int type, string &chkbuf, bool node)
 unsigned  CheckIllegalNames(int type, const string *name, string &chkbuf, bool node)
 unsigned  CheckIllegalNames(int type, const string *name, string &chkbuf, bool node)
implements generic checks for soft constraints on AT diagrams.
 ATChecks(Diagram *d, Graph *g)
  ATChecks(Diagram *d, Graph *g)
 
 
 unsigned  CheckUnreachableStates(string &chkbuf)
 unsigned  CheckUnreachableStates(string &chkbuf)
 unsigned  CheckEmptyEvents(string &)
 unsigned  CheckEmptyEvents(string &)
 unsigned  CheckEmptyActions(string &)
 unsigned  CheckEmptyActions(string &)
alphabetic index hierarchy of classes
 
this page has been generated automatically by doc++
(c)opyright by  Malte  Zöckler,  Roland Wunderling 
contact:  doc++@zib.de