implements generic checks for soft constraints on diagrams.
![]() | DiagramChecks (Diagram *d, Graph *g) |
![]() | CheckNodeCount (unsigned count, int nodeType, string &chkbuf) diagram should have count nodes of nodeType. |
![]() | CheckNodeCount (unsigned min, unsigned max, int nodeType, string &chkbuf) diagram should have min <= count <= max nodes of nodeType. |
![]() | CheckEdgeCount (unsigned count, int edgeType, string &chkbuf) diagram should have count edges of edgeType |
![]() | CheckEdgeCount (unsigned min, unsigned max, int edgeType, string &chkbuf) diagram should have min <= count <= max edges of edgeType. |
![]() | CheckDoubleIndexes (string &chkbuf) check that nodes unique indexes. |
![]() | CheckNamelessNodes (int nodeType, string &chkbuf) diagram should have no nameless nodes of nodeType |
![]() | CheckNamelessEdges (int edgeType, string &chkbuf) diagram should have no nameless edges of edgeType |
![]() | CheckIllegalNodeNames (int nodeType, const string *name, string &chkbuf) diagram should have no nodes of nodeType named 'name'. |
![]() | CheckIllegalEdgeNames (int edgeType, const string *name, string &chkbuf) diagram should have no edges of edgeType named 'name'. |
![]() | CheckNamelessEdges ( int edgeType, int type1, int type2, string &chkbuf) diagram should have no nameless edges of edgeType between types. |
![]() | CheckDoubleNamelessEdges (int edgeType, int type1, int type2, string &chkbuf) diagram shouldn't have double nameless edges between these types. |
![]() | CheckDoubleNodes (int nodeType, string &chkbuf) diagram should not have multiple nodes of nodeType with same name. |
![]() | CheckConnected (int nodeType, bool index, string &chkbuf) nodeType nodes should be connected (index: name or index in msg) |
![]() | CheckConnected (int nodeType, int toNode, int min, int max, bool index, string &chkbuf) nodeType nodes should be connected (index: name or index in msg) |
![]() | CheckJunctionCoherence (int nodeType, int parenttype, int childtype, unsigned minChildren, string &chkbuf) nodes of nodeType connected by 1 parent edge and minChildren edges. |
![]() | CheckCountEdgesFrom (int nodeType, int edgeType, unsigned min, unsigned max, bool zeroAllowed, bool index, string &chkbuf) nodes of nodeType should have min/max departing edges of edgeType. |
![]() | CheckReachability (int rootType, int nodeType, bool index, string &chkbuf) nodes of nodeType are reachable from >= 1 nodes of rootType. |
![]() | GetGraph () const |
![]() | GetDiagram () const |
![]() | CheckCount (unsigned min, unsigned max, int type, string &chkbuf, bool node) |
![]() | CheckIllegalNames (int type, const string *name, string &chkbuf, bool node) |
implements generic checks for soft constraints on diagrams.
unsigned CheckNodeCount(unsigned count, 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 min, unsigned max, int edgeType, string &chkbuf)
unsigned CheckDoubleIndexes(string &chkbuf)
unsigned CheckNamelessNodes(int nodeType, string &chkbuf)
unsigned CheckNamelessEdges(int edgeType, string &chkbuf)
unsigned CheckIllegalNodeNames(int nodeType, 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 CheckDoubleNamelessEdges(int edgeType, int type1, int type2, string &chkbuf)
unsigned CheckDoubleNodes(int nodeType, 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 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 CheckReachability(int rootType, int nodeType, bool index, string &chkbuf)
Graph* GetGraph() const
Diagram* GetDiagram() const
unsigned CheckCount(unsigned min, unsigned max, int type, string &chkbuf, bool node)
unsigned CheckIllegalNames(int type, const string *name, string &chkbuf, bool node)
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