~ubuntu-branches/ubuntu/intrepid/tcm/intrepid

<DT><h3>Public Methods</h3><DD><TR><TD VALIGN=top><A HREF="#DOC.110.1"> <IMG BORDER=0 SRC=icon1.gif></A> </TD><TD>DiagramChecks (<!1><A HREF="Diagram.html">Diagram</A> *d, <!1><A HREF="Graph.html">Graph</A> *g)

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.2"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckNodeCount (unsigned count, int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have count nodes of nodeType.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.3"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckNodeCount (unsigned min, unsigned max, int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have min <= count <= max nodes of nodeType.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.4"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckEdgeCount (unsigned count, int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have count edges of edgeType

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.5"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckEdgeCount (unsigned min, unsigned max, int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have min <= count <= max edges of edgeType.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.6"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckDoubleIndexes (<!1><A HREF="string.html">string</A> &chkbuf)

check that nodes unique indexes.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.7"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckNamelessNodes (int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have no nameless nodes of nodeType

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.8"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckNamelessEdges (int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have no nameless edges of edgeType

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.9"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckIllegalNodeNames (int nodeType, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have no nodes of nodeType named 'name'.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.10"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckIllegalEdgeNames (int edgeType, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have no edges of edgeType named 'name'.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.11"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckNamelessEdges ( int edgeType, int type1, int type2, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should have no nameless edges of edgeType between types.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.12"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckDoubleNamelessEdges (int edgeType, int type1, int type2, <!1><A HREF="string.html">string</A> &chkbuf)

diagram shouldn't have double nameless edges between these types.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.13"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckDoubleNodes (int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)

diagram should not have multiple nodes of nodeType with same name.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.14"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckConnected (int nodeType, bool index, <!1><A HREF="string.html">string</A> &chkbuf)

nodeType nodes should be connected (index: name or index in msg)

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.15"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckConnected (int nodeType, int toNode, int min, int max, bool index, <!1><A HREF="string.html">string</A> &chkbuf)

nodeType nodes should be connected (index: name or index in msg)

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.16"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckJunctionCoherence (int nodeType, int parenttype, int childtype, unsigned minChildren, <!1><A HREF="string.html">string</A> &chkbuf)

nodes of nodeType connected by 1 parent edge and minChildren edges.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.17"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckCountEdgesFrom (int nodeType, int edgeType, unsigned min, unsigned max, bool zeroAllowed, bool index, <!1><A HREF="string.html">string</A> &chkbuf)

nodes of nodeType should have min/max departing edges of edgeType.

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.18"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckReachability (int rootType, int nodeType, bool index, <!1><A HREF="string.html">string</A> &chkbuf)

nodes of nodeType are reachable from >= 1 nodes of rootType.

</TD></TR></TABLE><TABLE>

<DT><h3>Protected Methods</h3><DD><TR><TD VALIGN=top><A HREF="#DOC.110.19"> <IMG BORDER=0 SRC=icon1.gif></A> <!1><A HREF="Graph.html">Graph</A>* </TD><TD>GetGraph () const

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.20"> <IMG BORDER=0 SRC=icon1.gif></A> <!1><A HREF="Diagram.html">Diagram</A>* </TD><TD>GetDiagram () const

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.21"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckCount (unsigned min, unsigned max, int type, <!1><A HREF="string.html">string</A> &chkbuf, bool node)

</TD></TR><TR><TD VALIGN=top><A HREF="#DOC.110.22"> <IMG BORDER=0 SRC=icon1.gif></A> unsigned </TD><TD>CheckIllegalNames (int type, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf, bool node)

</TD></TR></TABLE></DL>

<hr>

<h2> Documentation </h2>

implements generic checks for soft constraints on diagrams.

</BLOCKQUOTE>

<DL>

<DT><IMG BORDER=0 SRC=icon2.gif><TT> DiagramChecks(<!1><A HREF="Diagram.html">Diagram</A> *d, <!1><A HREF="Graph.html">Graph</A> *g)</TT>

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckNodeCount(unsigned count, int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

<DD> diagram should have count nodes of nodeType.

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckNodeCount(unsigned min, unsigned max, int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

<DD> diagram should have min <= count <= max nodes of nodeType.

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckEdgeCount(unsigned count, int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

<DD> diagram should have count edges of edgeType

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckEdgeCount(unsigned min, unsigned max, int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

<DD> diagram should have min <= count <= max edges of edgeType.

100

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckDoubleIndexes(<!1><A HREF="string.html">string</A> &chkbuf)</TT>

101

<DD> check that nodes unique indexes.

102

103

104

105

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckNamelessNodes(int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

106

<DD> diagram should have no nameless nodes of nodeType

107

108

109

110

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckNamelessEdges(int edgeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

111

<DD> diagram should have no nameless edges of edgeType

112

113

114

115

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckIllegalNodeNames(int nodeType, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

116

<DD> diagram should have no nodes of nodeType named 'name'.

117

118

119

120

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckIllegalEdgeNames(int edgeType, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

121

<DD> diagram should have no edges of edgeType named 'name'.

122

123

124

125

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckNamelessEdges( int edgeType, int type1, int type2, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

126

<DD> diagram should have no nameless edges of edgeType between types.

127

128

129

130

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckDoubleNamelessEdges(int edgeType, int type1, int type2, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

131

<DD> diagram shouldn't have double nameless edges between these types.

132

133

134

135

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckDoubleNodes(int nodeType, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

136

<DD> diagram should not have multiple nodes of nodeType with same name.

137

138

139

140

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckConnected(int nodeType, bool index, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

141

<DD> nodeType nodes should be connected (index: name or index in msg)

142

143

144

145

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckConnected(int nodeType, int toNode, int min, int max, bool index, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

146

<DD> nodeType nodes should be connected (index: name or index in msg)

147

148

149

150

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckJunctionCoherence(int nodeType, int parenttype, int childtype, unsigned minChildren, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

151

<DD> nodes of nodeType connected by 1 parent edge and minChildren edges.

152

153

154

155

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckCountEdgesFrom(int nodeType, int edgeType, unsigned min, unsigned max, bool zeroAllowed, bool index, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

156

<DD> nodes of nodeType should have min/max departing edges of edgeType.

157

158

159

160

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckReachability(int rootType, int nodeType, bool index, <!1><A HREF="string.html">string</A> &chkbuf)</TT>

161

<DD> nodes of nodeType are reachable from >= 1 nodes of rootType.

162

163

164

165

<DT><IMG BORDER=0 SRC=icon2.gif><TT> <!1><A HREF="Graph.html">Graph</A>* GetGraph() const </TT>

166

167

168

169

<DT><IMG BORDER=0 SRC=icon2.gif><TT> <!1><A HREF="Diagram.html">Diagram</A>* GetDiagram() const </TT>

170

171

172

173

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckCount(unsigned min, unsigned max, int type, <!1><A HREF="string.html">string</A> &chkbuf, bool node)</TT>

174

175

176

177

<DT><IMG BORDER=0 SRC=icon2.gif><TT> unsigned CheckIllegalNames(int type, const <!1><A HREF="string.html">string</A> *name, <!1><A HREF="string.html">string</A> &chkbuf, bool node)</TT>

178

179

<hr>

180

<DL><DT>Direct child classes:

181

<DD><A HREF="STChecks.html"> STChecks </A>

182

<A HREF="SNChecks.html"> SNChecks </A>

183

<A HREF="PSChecks.html"> PSChecks </A>

184

<A HREF="ERChecks.html"> ERChecks </A>

185

<A HREF="DFChecks.html"> DFChecks </A>

186

<A HREF="ATChecks.html"> ATChecks </A>

187

</DL>

188

<DL></DL><A HREF="aindex.html"> alphabetic index</A> <A HREF="HIER.html"> hierarchy of classes</A><hr>

189

190

this page has been generated automatically by doc++

191

(c)opyright by <A HREF="http://www.zib.de/zoeckler/"> Malte Zöckler</A>, <A HREF="mailto:wunderling@zib.de"> Roland Wunderling </A> contact: <A HREF="mailto:doc++@zib.de"> doc++@zib.de</a>

192

</BODY>

Older »