implements checks for soft constraints on DFDs.
![]() | DFChecks (Diagram *d, Graph *g) |
![]() | CheckDataProcessCoherence (string &chkbuf) each data process should have an input and an output flow. |
![]() | CheckSplitMergeNodeCoherence (string &chkbuf) Check if splitmerge nodes are properly connected. |
![]() | CheckNamelessSplitMergeEdges (string &chkbuf) empty names are not allowed except for identical split/merge. |
![]() | CheckNamelessFlows (int edgetype, int nodetype1, int nodetype2, string &chkbuf) Check that flows have a name. |
![]() | CheckMinispecs (string &chkbuf) Check that each data process has a minispec. |
![]() | WriteCheckProcess (DFProcess *d, string &chkbuf) |
implements checks for soft constraints on DFDs.
unsigned CheckDataProcessCoherence(string &chkbuf)
unsigned CheckSplitMergeNodeCoherence(string &chkbuf)
unsigned CheckNamelessSplitMergeEdges(string &chkbuf)
unsigned CheckNamelessFlows(int edgetype, int nodetype1, int nodetype2, string &chkbuf)
unsigned CheckMinispecs(string &chkbuf)
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