1 |
|
|
2 |
|
|
3 |
|
|
4 |
|
|
5 |
|
|
6 |
|
|
7 |
|
|
8 |
|
|
9 |
|
|
10 |
|
|
11 |
|
|
12 |
|
|
13 |
|
|
14 |
|
|
15 |
|
|
16 |
|
package org.qedeq.kernel.se.visitor; |
17 |
|
|
18 |
|
import java.io.ByteArrayOutputStream; |
19 |
|
import java.io.IOException; |
20 |
|
import java.lang.reflect.InvocationTargetException; |
21 |
|
import java.lang.reflect.Method; |
22 |
|
import java.util.List; |
23 |
|
import java.util.Stack; |
24 |
|
|
25 |
|
import org.qedeq.base.io.TextOutput; |
26 |
|
import org.qedeq.base.test.QedeqTestCase; |
27 |
|
import org.qedeq.base.trace.Trace; |
28 |
|
import org.qedeq.kernel.se.base.list.Atom; |
29 |
|
import org.qedeq.kernel.se.base.list.Element; |
30 |
|
import org.qedeq.kernel.se.base.list.ElementList; |
31 |
|
import org.qedeq.kernel.se.base.module.Add; |
32 |
|
import org.qedeq.kernel.se.base.module.Author; |
33 |
|
import org.qedeq.kernel.se.base.module.AuthorList; |
34 |
|
import org.qedeq.kernel.se.base.module.Axiom; |
35 |
|
import org.qedeq.kernel.se.base.module.ChangedRule; |
36 |
|
import org.qedeq.kernel.se.base.module.ChangedRuleList; |
37 |
|
import org.qedeq.kernel.se.base.module.Chapter; |
38 |
|
import org.qedeq.kernel.se.base.module.ChapterList; |
39 |
|
import org.qedeq.kernel.se.base.module.Conclusion; |
40 |
|
import org.qedeq.kernel.se.base.module.ConditionalProof; |
41 |
|
import org.qedeq.kernel.se.base.module.Existential; |
42 |
|
import org.qedeq.kernel.se.base.module.FormalProof; |
43 |
|
import org.qedeq.kernel.se.base.module.FormalProofLine; |
44 |
|
import org.qedeq.kernel.se.base.module.FormalProofLineList; |
45 |
|
import org.qedeq.kernel.se.base.module.FormalProofList; |
46 |
|
import org.qedeq.kernel.se.base.module.Formula; |
47 |
|
import org.qedeq.kernel.se.base.module.FunctionDefinition; |
48 |
|
import org.qedeq.kernel.se.base.module.Header; |
49 |
|
import org.qedeq.kernel.se.base.module.Hypothesis; |
50 |
|
import org.qedeq.kernel.se.base.module.Import; |
51 |
|
import org.qedeq.kernel.se.base.module.ImportList; |
52 |
|
import org.qedeq.kernel.se.base.module.InitialFunctionDefinition; |
53 |
|
import org.qedeq.kernel.se.base.module.InitialPredicateDefinition; |
54 |
|
import org.qedeq.kernel.se.base.module.Latex; |
55 |
|
import org.qedeq.kernel.se.base.module.LatexList; |
56 |
|
import org.qedeq.kernel.se.base.module.LinkList; |
57 |
|
import org.qedeq.kernel.se.base.module.LiteratureItem; |
58 |
|
import org.qedeq.kernel.se.base.module.LiteratureItemList; |
59 |
|
import org.qedeq.kernel.se.base.module.Location; |
60 |
|
import org.qedeq.kernel.se.base.module.LocationList; |
61 |
|
import org.qedeq.kernel.se.base.module.ModusPonens; |
62 |
|
import org.qedeq.kernel.se.base.module.Node; |
63 |
|
import org.qedeq.kernel.se.base.module.PredicateDefinition; |
64 |
|
import org.qedeq.kernel.se.base.module.Proof; |
65 |
|
import org.qedeq.kernel.se.base.module.ProofList; |
66 |
|
import org.qedeq.kernel.se.base.module.Proposition; |
67 |
|
import org.qedeq.kernel.se.base.module.Qedeq; |
68 |
|
import org.qedeq.kernel.se.base.module.Reason; |
69 |
|
import org.qedeq.kernel.se.base.module.Rename; |
70 |
|
import org.qedeq.kernel.se.base.module.Rule; |
71 |
|
import org.qedeq.kernel.se.base.module.Section; |
72 |
|
import org.qedeq.kernel.se.base.module.SectionList; |
73 |
|
import org.qedeq.kernel.se.base.module.Specification; |
74 |
|
import org.qedeq.kernel.se.base.module.Subsection; |
75 |
|
import org.qedeq.kernel.se.base.module.SubsectionList; |
76 |
|
import org.qedeq.kernel.se.base.module.SubsectionType; |
77 |
|
import org.qedeq.kernel.se.base.module.SubstFree; |
78 |
|
import org.qedeq.kernel.se.base.module.SubstFunc; |
79 |
|
import org.qedeq.kernel.se.base.module.SubstPred; |
80 |
|
import org.qedeq.kernel.se.base.module.Term; |
81 |
|
import org.qedeq.kernel.se.base.module.Universal; |
82 |
|
import org.qedeq.kernel.se.base.module.UsedByList; |
83 |
|
import org.qedeq.kernel.se.common.DefaultModuleAddress; |
84 |
|
import org.qedeq.kernel.se.common.ModuleAddress; |
85 |
|
import org.qedeq.kernel.se.common.ModuleDataException; |
86 |
|
import org.qedeq.kernel.se.dto.list.DefaultAtom; |
87 |
|
import org.qedeq.kernel.se.dto.list.DefaultElementList; |
88 |
|
import org.qedeq.kernel.se.test.QedeqVoCreator; |
89 |
|
|
90 |
|
|
91 |
|
@link |
92 |
|
|
93 |
|
@link |
94 |
|
|
95 |
|
|
96 |
|
@author |
97 |
|
|
|
|
| 22.7% |
Uncovered Elements: 340 (440) |
Complexity: 142 |
Complexity Density: 0.49 |
|
98 |
|
public class QedeqNotNullTraverserTest extends QedeqTestCase { |
99 |
|
|
100 |
|
|
101 |
|
private static final Class CLASS = QedeqNotNullTraverserTest.class; |
102 |
|
|
103 |
|
private final ByteArrayOutputStream out = new ByteArrayOutputStream(); |
104 |
|
|
105 |
|
private final TextOutput text = new TextOutput("local", out, "UTF-8"); |
106 |
|
|
107 |
|
|
108 |
|
|
109 |
|
private final Stack stack = new Stack(); |
110 |
|
|
111 |
|
private static ModuleAddress address; |
112 |
|
|
|
|
| 66.7% |
Uncovered Elements: 1 (3) |
Complexity: 2 |
Complexity Density: 0.67 |
|
113 |
2
|
static {... |
114 |
2
|
try { |
115 |
2
|
address = new DefaultModuleAddress("http://memory.org/sample.xml"); |
116 |
|
} catch (IOException e) { |
117 |
0
|
e.printStackTrace(); |
118 |
|
} |
119 |
|
} |
120 |
|
|
121 |
|
private final QedeqVisitor visitor = new AbstractModuleVisitor() { |
122 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
123 |
19
|
public void visitEnter(Atom atom) {... |
124 |
19
|
handleComma(); |
125 |
19
|
text.print("\""); |
126 |
19
|
text.print(atom.getString()); |
127 |
|
} |
128 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
129 |
19
|
public void visitLeave(Atom atom) {... |
130 |
19
|
text.print("\""); |
131 |
|
} |
132 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
133 |
21
|
public void visitEnter(ElementList list) {... |
134 |
21
|
handleComma(); |
135 |
21
|
text.print(list.getOperator() + "("); |
136 |
21
|
stack.push(Boolean.FALSE); |
137 |
|
} |
138 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
139 |
21
|
public void visitLeave(ElementList list) {... |
140 |
21
|
text.print(")"); |
141 |
21
|
stack.pop(); |
142 |
|
} |
143 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 4 |
Complexity Density: 0.8 |
|
144 |
40
|
private void handleComma() {... |
145 |
40
|
if (!stack.isEmpty() && ((Boolean) stack.peek()).booleanValue()) { |
146 |
17
|
text.print(", "); |
147 |
|
} else { |
148 |
23
|
if (!stack.isEmpty()) { |
149 |
21
|
stack.pop(); |
150 |
21
|
stack.push(Boolean.TRUE); |
151 |
|
} |
152 |
|
} |
153 |
|
} |
154 |
|
|
155 |
|
}; |
156 |
|
|
157 |
|
private final QedeqNotNullTraverser trans = new QedeqNotNullTraverser(address, |
158 |
|
visitor); |
159 |
|
|
160 |
|
|
161 |
|
|
162 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1
PASS
|
|
163 |
1
|
public void testVisit() throws Exception {... |
164 |
1
|
Element el = new DefaultElementList("myOperator", new Element[] { |
165 |
|
new DefaultAtom("Hello"), |
166 |
|
new DefaultAtom("Again"), |
167 |
|
new DefaultElementList("again", new Element[] { |
168 |
|
new DefaultAtom("one"), |
169 |
|
new DefaultAtom("two"), |
170 |
|
new DefaultAtom("three") |
171 |
|
}) |
172 |
|
}); |
173 |
|
|
174 |
1
|
trans.accept(el); |
175 |
1
|
Trace.trace(CLASS, this, "testVisit", out.toString("ISO-8859-1")); |
176 |
1
|
assertEquals("myOperator(\"Hello\", \"Again\", again(\"one\", \"two\", \"three\"))", |
177 |
|
out.toString("ISO-8859-1")); |
178 |
|
} |
179 |
|
|
180 |
|
|
181 |
|
|
182 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1
PASS
|
|
183 |
1
|
public void testGeneration() throws Exception {... |
184 |
1
|
Element el = new DefaultElementList("EQUI", new Element[] { |
185 |
|
new DefaultElementList("PREDCON", new Element[] { |
186 |
|
new DefaultAtom("equal"), |
187 |
|
new DefaultElementList("VAR", new Element[] { |
188 |
|
new DefaultAtom("y"), |
189 |
|
}), |
190 |
|
new DefaultElementList("CLASS", new Element[] { |
191 |
|
new DefaultElementList("VAR", new Element[] { |
192 |
|
new DefaultAtom("x"), |
193 |
|
}), |
194 |
|
new DefaultElementList("PREDVAR", new Element[] { |
195 |
|
new DefaultAtom("\\phi"), |
196 |
|
new DefaultElementList("VAR", new Element[] { |
197 |
|
new DefaultAtom("x"), |
198 |
|
}) |
199 |
|
}) |
200 |
|
}) |
201 |
|
}), |
202 |
|
new DefaultElementList("FORALL", new Element[] { |
203 |
|
new DefaultElementList("VAR", new Element[] { |
204 |
|
new DefaultAtom("z"), |
205 |
|
}), |
206 |
|
new DefaultElementList("EQUI", new Element[] { |
207 |
|
new DefaultElementList("PREDCON", new Element[] { |
208 |
|
new DefaultAtom("in"), |
209 |
|
new DefaultElementList("VAR", new Element[] { |
210 |
|
new DefaultAtom("z"), |
211 |
|
}), |
212 |
|
new DefaultElementList("VAR", new Element[] { |
213 |
|
new DefaultAtom("y"), |
214 |
|
}) |
215 |
|
}), |
216 |
|
new DefaultElementList("PREDCON", new Element[] { |
217 |
|
new DefaultAtom("in"), |
218 |
|
new DefaultElementList("VAR", new Element[] { |
219 |
|
new DefaultAtom("z"), |
220 |
|
}), |
221 |
|
new DefaultElementList("CLASS", new Element[] { |
222 |
|
new DefaultElementList("VAR", new Element[] { |
223 |
|
new DefaultAtom("x"), |
224 |
|
}), |
225 |
|
new DefaultElementList("PREDVAR", new Element[] { |
226 |
|
new DefaultAtom("\\phi"), |
227 |
|
new DefaultElementList("VAR", new Element[] { |
228 |
|
new DefaultAtom("x"), |
229 |
|
}) |
230 |
|
}) |
231 |
|
}) |
232 |
|
}) |
233 |
|
}) |
234 |
|
}) |
235 |
|
}); |
236 |
1
|
trans.accept(el); |
237 |
1
|
Trace.trace(CLASS, this, "testGeneration", out.toString("ISO-8859-1")); |
238 |
1
|
assertEquals("EQUI(PREDCON(\"equal\", VAR(\"y\"), CLASS(VAR(\"x\"), PREDVAR(\"\\phi\"," |
239 |
|
+ " VAR(\"x\")))), FORALL(VAR(\"z\"), EQUI(PREDCON(\"in\", VAR(\"z\"), VAR(\"y\"))," |
240 |
|
+ " PREDCON(\"in\", VAR(\"z\"), CLASS(VAR(\"x\"), PREDVAR(\"\\phi\", VAR(\"x\")))))))", |
241 |
|
out.toString("ISO-8859-1")); |
242 |
1
|
Trace.trace(CLASS, this, "testGeneration", el.toString()); |
243 |
|
} |
244 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
245 |
6
|
protected void setUp() throws Exception {... |
246 |
6
|
super.setUp(); |
247 |
6
|
out.reset(); |
248 |
|
} |
249 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
250 |
6
|
protected void tearDown() throws Exception {... |
251 |
6
|
super.tearDown(); |
252 |
|
} |
253 |
|
|
254 |
|
private final QedeqVisitor visitor2 = new QedeqVisitor() { |
255 |
|
|
|
|
| 0% |
Uncovered Elements: 3 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
256 |
0
|
public void visitEnter(Atom atom) {... |
257 |
0
|
handleComma(); |
258 |
0
|
text.print("\""); |
259 |
0
|
text.print(atom.getString()); |
260 |
|
} |
261 |
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
262 |
0
|
public void visitLeave(Atom atom) {... |
263 |
0
|
text.print("\""); |
264 |
|
} |
265 |
|
|
|
|
| 0% |
Uncovered Elements: 3 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
266 |
0
|
public void visitEnter(ElementList list) {... |
267 |
0
|
handleComma(); |
268 |
0
|
text.print(list.getOperator() + "("); |
269 |
0
|
stack.push(Boolean.FALSE); |
270 |
|
} |
271 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
272 |
0
|
public void visitLeave(ElementList list) {... |
273 |
0
|
text.print(")"); |
274 |
0
|
stack.pop(); |
275 |
|
} |
276 |
|
|
|
|
| 0% |
Uncovered Elements: 9 (9) |
Complexity: 4 |
Complexity Density: 0.8 |
|
277 |
0
|
private void handleComma() {... |
278 |
0
|
if (!stack.isEmpty() && ((Boolean) stack.peek()).booleanValue()) { |
279 |
0
|
text.print(", "); |
280 |
|
} else { |
281 |
0
|
if (!stack.isEmpty()) { |
282 |
0
|
stack.pop(); |
283 |
0
|
stack.push(Boolean.TRUE); |
284 |
|
} |
285 |
|
} |
286 |
|
} |
287 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
288 |
0
|
public void visitEnter(Author author) {... |
289 |
0
|
text.println("<author email=\"" + author.getEmail() + "\">"); |
290 |
0
|
text.pushLevel(); |
291 |
|
} |
292 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
293 |
0
|
public void visitEnter(AuthorList authorList) {... |
294 |
0
|
text.println("<authorlist>"); |
295 |
0
|
text.pushLevel(); |
296 |
|
} |
297 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
298 |
0
|
public void visitEnter(Axiom axiom) {... |
299 |
0
|
text.println("<axiom>"); |
300 |
0
|
text.pushLevel(); |
301 |
|
} |
302 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
303 |
0
|
public void visitEnter(Chapter chapter) {... |
304 |
0
|
text.println("<chapter>"); |
305 |
0
|
text.pushLevel(); |
306 |
|
} |
307 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
308 |
0
|
public void visitEnter(ChapterList chapterList) {... |
309 |
0
|
text.println("<chapterlist>"); |
310 |
0
|
text.pushLevel(); |
311 |
|
} |
312 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
313 |
0
|
public void visitEnter(Formula formula) {... |
314 |
0
|
text.println("<formula>"); |
315 |
0
|
text.pushLevel(); |
316 |
|
} |
317 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
318 |
0
|
public void visitEnter(InitialFunctionDefinition functionDefinition) {... |
319 |
0
|
text.println("<initialfunctiondefinition>"); |
320 |
0
|
text.pushLevel(); |
321 |
|
} |
322 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
323 |
0
|
public void visitEnter(FunctionDefinition functionDefinition) {... |
324 |
0
|
text.println("<functiondefinition>"); |
325 |
0
|
text.pushLevel(); |
326 |
|
} |
327 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
328 |
0
|
public void visitEnter(Header header) {... |
329 |
0
|
text.println("<header>"); |
330 |
0
|
text.pushLevel(); |
331 |
|
} |
332 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
333 |
0
|
public void visitEnter(Import imp) {... |
334 |
0
|
text.println("<import>"); |
335 |
0
|
text.pushLevel(); |
336 |
|
} |
337 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
338 |
0
|
public void visitEnter(ImportList importList) {... |
339 |
0
|
text.println("<importlist>"); |
340 |
0
|
text.pushLevel(); |
341 |
|
} |
342 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
343 |
0
|
public void visitEnter(Latex latex) {... |
344 |
0
|
text.println("<latex>"); |
345 |
0
|
text.pushLevel(); |
346 |
|
} |
347 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
348 |
0
|
public void visitEnter(LatexList latexList) {... |
349 |
0
|
text.println("<latexlist>"); |
350 |
0
|
text.pushLevel(); |
351 |
|
} |
352 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
353 |
0
|
public void visitEnter(LinkList linkList) {... |
354 |
0
|
text.println("<linklist>"); |
355 |
0
|
text.pushLevel(); |
356 |
|
} |
357 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
358 |
0
|
public void visitEnter(LiteratureItem literatureItem) {... |
359 |
0
|
text.println("<literatureitem>"); |
360 |
0
|
text.pushLevel(); |
361 |
|
} |
362 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
363 |
0
|
public void visitEnter(LiteratureItemList literatureItemList) {... |
364 |
0
|
text.println("<literatureitemlist>"); |
365 |
0
|
text.pushLevel(); |
366 |
|
} |
367 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
368 |
0
|
public void visitEnter(Location location) {... |
369 |
0
|
text.println("<location>"); |
370 |
0
|
text.pushLevel(); |
371 |
|
} |
372 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
373 |
0
|
public void visitEnter(LocationList locationList) {... |
374 |
0
|
text.println("<locationlist>"); |
375 |
0
|
text.pushLevel(); |
376 |
|
} |
377 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
378 |
0
|
public void visitEnter(Node node) {... |
379 |
0
|
text.println("<node>"); |
380 |
0
|
text.pushLevel(); |
381 |
|
} |
382 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
383 |
0
|
public void visitEnter(InitialPredicateDefinition predicateDefinition) {... |
384 |
0
|
text.println("<initialpredicatedefinition>"); |
385 |
0
|
text.pushLevel(); |
386 |
|
} |
387 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
388 |
0
|
public void visitEnter(PredicateDefinition predicateDefinition) {... |
389 |
0
|
text.println("<predicatedefinition>"); |
390 |
0
|
text.pushLevel(); |
391 |
|
} |
392 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
393 |
0
|
public void visitEnter(FormalProof proof) {... |
394 |
0
|
text.println("<formalproof>"); |
395 |
0
|
text.pushLevel(); |
396 |
|
} |
397 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
398 |
0
|
public void visitEnter(FormalProofList proofList) {... |
399 |
0
|
text.println("<formalprooflist>"); |
400 |
0
|
text.pushLevel(); |
401 |
|
} |
402 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
403 |
0
|
public void visitEnter(FormalProofLine proofLine) {... |
404 |
0
|
text.println("<formalproofline>"); |
405 |
0
|
text.pushLevel(); |
406 |
|
} |
407 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
408 |
0
|
public void visitEnter(Reason reason) {... |
409 |
0
|
text.println("<reason>"); |
410 |
0
|
text.pushLevel(); |
411 |
|
} |
412 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
413 |
0
|
public void visitEnter(ModusPonens reason) {... |
414 |
0
|
text.println("<modusponens>"); |
415 |
0
|
text.pushLevel(); |
416 |
|
} |
417 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
418 |
0
|
public void visitEnter(Add reason) {... |
419 |
0
|
text.println("<add>"); |
420 |
0
|
text.pushLevel(); |
421 |
|
} |
422 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
423 |
0
|
public void visitEnter(Rename reason) {... |
424 |
0
|
text.println("<rename>"); |
425 |
0
|
text.pushLevel(); |
426 |
|
} |
427 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
428 |
0
|
public void visitEnter(SubstFree reason) {... |
429 |
0
|
text.println("<substfree>"); |
430 |
0
|
text.pushLevel(); |
431 |
|
} |
432 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
433 |
0
|
public void visitEnter(SubstFunc reason) {... |
434 |
0
|
text.println("<substfunc>"); |
435 |
0
|
text.pushLevel(); |
436 |
|
} |
437 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
438 |
0
|
public void visitEnter(SubstPred reason) {... |
439 |
0
|
text.println("<substpred>"); |
440 |
0
|
text.pushLevel(); |
441 |
|
} |
442 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
443 |
0
|
public void visitEnter(Existential reason) {... |
444 |
0
|
text.println("<existential>"); |
445 |
0
|
text.pushLevel(); |
446 |
|
} |
447 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
448 |
0
|
public void visitEnter(Universal reason) {... |
449 |
0
|
text.println("<universal>"); |
450 |
0
|
text.pushLevel(); |
451 |
|
} |
452 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
453 |
0
|
public void visitEnter(ConditionalProof reason) {... |
454 |
0
|
text.println("<conditionalproof>"); |
455 |
0
|
text.pushLevel(); |
456 |
|
} |
457 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
458 |
0
|
public void visitEnter(Hypothesis hypothesis) {... |
459 |
0
|
text.println("<hypothesis>"); |
460 |
0
|
text.pushLevel(); |
461 |
|
} |
462 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
463 |
0
|
public void visitEnter(Conclusion conclusion) {... |
464 |
0
|
text.println("<conclusion>"); |
465 |
0
|
text.pushLevel(); |
466 |
|
} |
467 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
468 |
0
|
public void visitEnter(FormalProofLineList proofLineList) {... |
469 |
0
|
text.println("<formalprooflinelist>"); |
470 |
0
|
text.pushLevel(); |
471 |
|
} |
472 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
473 |
0
|
public void visitEnter(Proof proof) {... |
474 |
0
|
text.println("<proof>"); |
475 |
0
|
text.pushLevel(); |
476 |
|
} |
477 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
478 |
0
|
public void visitEnter(ProofList proofList) {... |
479 |
0
|
text.println("<prooflist>"); |
480 |
0
|
text.pushLevel(); |
481 |
|
} |
482 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
483 |
0
|
public void visitEnter(Proposition proposition) {... |
484 |
0
|
text.println("<proposition>"); |
485 |
0
|
text.pushLevel(); |
486 |
|
} |
487 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
488 |
0
|
public void visitEnter(Qedeq qedeq) {... |
489 |
0
|
text.println("<qedeq>"); |
490 |
0
|
text.pushLevel(); |
491 |
|
} |
492 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
493 |
0
|
public void visitEnter(Rule rule) {... |
494 |
0
|
text.println("<rule>"); |
495 |
0
|
text.pushLevel(); |
496 |
|
} |
497 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
498 |
0
|
public void visitEnter(ChangedRuleList list) {... |
499 |
0
|
text.println("<changedrulelist>"); |
500 |
0
|
text.pushLevel(); |
501 |
|
} |
502 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
503 |
0
|
public void visitEnter(ChangedRule rule) {... |
504 |
0
|
text.println("<changedrule>"); |
505 |
0
|
text.pushLevel(); |
506 |
|
} |
507 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
508 |
0
|
public void visitEnter(Section section) {... |
509 |
0
|
text.println("<section>"); |
510 |
0
|
text.pushLevel(); |
511 |
|
} |
512 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
513 |
0
|
public void visitEnter(SectionList sectionList) {... |
514 |
0
|
text.println("<sectionlist>"); |
515 |
0
|
text.pushLevel(); |
516 |
|
} |
517 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
518 |
0
|
public void visitEnter(Specification specification) {... |
519 |
0
|
text.println("<specification>"); |
520 |
0
|
text.pushLevel(); |
521 |
|
} |
522 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
523 |
0
|
public void visitEnter(Subsection subsection) {... |
524 |
0
|
text.println("<subsection>"); |
525 |
0
|
text.pushLevel(); |
526 |
|
} |
527 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
528 |
0
|
public void visitEnter(SubsectionList subsectionList) {... |
529 |
0
|
text.println("<subsectionlist>"); |
530 |
0
|
text.pushLevel(); |
531 |
|
} |
532 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
533 |
0
|
public void visitEnter(SubsectionType subsectionType) {... |
534 |
0
|
text.println("<subsectiontype>"); |
535 |
0
|
text.pushLevel(); |
536 |
|
} |
537 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
538 |
0
|
public void visitEnter(Term term) {... |
539 |
0
|
text.println("<term>"); |
540 |
0
|
text.pushLevel(); |
541 |
|
} |
542 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
543 |
0
|
public void visitEnter(UsedByList usedByList) {... |
544 |
0
|
text.println("<usedbylist>"); |
545 |
0
|
text.pushLevel(); |
546 |
|
} |
547 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
548 |
0
|
public void visitLeave(Author author) throws ModuleDataException {... |
549 |
0
|
text.popLevel(); |
550 |
0
|
text.println("</author>"); |
551 |
|
} |
552 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
553 |
0
|
public void visitLeave(AuthorList authorList) {... |
554 |
0
|
text.popLevel(); |
555 |
0
|
text.println("</authorlist>"); |
556 |
|
} |
557 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
558 |
0
|
public void visitLeave(Axiom axiom) {... |
559 |
0
|
text.popLevel(); |
560 |
0
|
text.println("</axiom>"); |
561 |
|
} |
562 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
563 |
0
|
public void visitLeave(Chapter chapter) {... |
564 |
0
|
text.popLevel(); |
565 |
0
|
text.println("</chapter>"); |
566 |
|
} |
567 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
568 |
0
|
public void visitLeave(ChapterList chapterList) {... |
569 |
0
|
text.popLevel(); |
570 |
0
|
text.println("</chapterlist>"); |
571 |
|
} |
572 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
573 |
0
|
public void visitLeave(Formula formula) {... |
574 |
0
|
text.popLevel(); |
575 |
0
|
text.println("</formula>"); |
576 |
|
} |
577 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
578 |
0
|
public void visitLeave(InitialFunctionDefinition functionDefinition) {... |
579 |
0
|
text.popLevel(); |
580 |
0
|
text.println("</initialfunctiondefinition>"); |
581 |
|
} |
582 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
583 |
0
|
public void visitLeave(FunctionDefinition functionDefinition) {... |
584 |
0
|
text.popLevel(); |
585 |
0
|
text.println("</functiondefinition>"); |
586 |
|
} |
587 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
588 |
0
|
public void visitLeave(Header header) {... |
589 |
0
|
text.popLevel(); |
590 |
0
|
text.println("</header>"); |
591 |
|
} |
592 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
593 |
0
|
public void visitLeave(Import imp) {... |
594 |
0
|
text.popLevel(); |
595 |
0
|
text.println("</import>"); |
596 |
|
} |
597 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
598 |
0
|
public void visitLeave(ImportList importList) {... |
599 |
0
|
text.popLevel(); |
600 |
0
|
text.println("</importlist>"); |
601 |
|
} |
602 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
603 |
0
|
public void visitLeave(Latex latex) {... |
604 |
0
|
text.popLevel(); |
605 |
0
|
text.println("</latex>"); |
606 |
|
} |
607 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
608 |
0
|
public void visitLeave(LatexList latexList) {... |
609 |
0
|
text.popLevel(); |
610 |
0
|
text.println("</latexlist>"); |
611 |
|
} |
612 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
613 |
0
|
public void visitLeave(LinkList linkList) {... |
614 |
0
|
text.popLevel(); |
615 |
0
|
text.println("</linklist>"); |
616 |
|
} |
617 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
618 |
0
|
public void visitLeave(LiteratureItem literatureItem) {... |
619 |
0
|
text.popLevel(); |
620 |
0
|
text.println("</literatureitem>"); |
621 |
|
} |
622 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
623 |
0
|
public void visitLeave(LiteratureItemList literatureItemList) {... |
624 |
0
|
text.popLevel(); |
625 |
0
|
text.println("</literatureitemlist>"); |
626 |
|
} |
627 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
628 |
0
|
public void visitLeave(Location location) {... |
629 |
0
|
text.popLevel(); |
630 |
0
|
text.println("</location>"); |
631 |
|
} |
632 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
633 |
0
|
public void visitLeave(LocationList locationList) {... |
634 |
0
|
text.popLevel(); |
635 |
0
|
text.println("</locationlist>"); |
636 |
|
} |
637 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
638 |
0
|
public void visitLeave(Node node) {... |
639 |
0
|
text.popLevel(); |
640 |
0
|
text.println("</node>"); |
641 |
|
} |
642 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
643 |
0
|
public void visitLeave(InitialPredicateDefinition predicateDefinition) {... |
644 |
0
|
text.popLevel(); |
645 |
0
|
text.println("</initialpredicatedefinition>"); |
646 |
|
} |
647 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
648 |
0
|
public void visitLeave(PredicateDefinition predicateDefinition) {... |
649 |
0
|
text.popLevel(); |
650 |
0
|
text.println("</predicatedefinition>"); |
651 |
|
} |
652 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
653 |
0
|
public void visitLeave(FormalProofList proofList) {... |
654 |
0
|
text.popLevel(); |
655 |
0
|
text.println("</formalproofList>"); |
656 |
|
} |
657 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
658 |
0
|
public void visitLeave(FormalProof proof) {... |
659 |
0
|
text.popLevel(); |
660 |
0
|
text.println("</proof>"); |
661 |
|
} |
662 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
663 |
0
|
public void visitLeave(FormalProofLine proofLine) {... |
664 |
0
|
text.popLevel(); |
665 |
0
|
text.println("</formalproofline>"); |
666 |
|
} |
667 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
668 |
0
|
public void visitLeave(Reason reason) {... |
669 |
0
|
text.popLevel(); |
670 |
0
|
text.println("</reason>"); |
671 |
|
} |
672 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
673 |
0
|
public void visitLeave(FormalProofLineList proofLineList) {... |
674 |
0
|
text.popLevel(); |
675 |
0
|
text.println("</formalprooflinelist>"); |
676 |
|
} |
677 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
678 |
0
|
public void visitLeave(ModusPonens reason) {... |
679 |
0
|
text.popLevel(); |
680 |
0
|
text.println("</modulsponens>"); |
681 |
|
} |
682 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
683 |
0
|
public void visitLeave(Add reason) {... |
684 |
0
|
text.popLevel(); |
685 |
0
|
text.println("</add>"); |
686 |
|
} |
687 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
688 |
0
|
public void visitLeave(Rename reason) {... |
689 |
0
|
text.popLevel(); |
690 |
0
|
text.println("</rename>"); |
691 |
|
} |
692 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
693 |
0
|
public void visitLeave(SubstFree reason) {... |
694 |
0
|
text.popLevel(); |
695 |
0
|
text.println("</substfree>"); |
696 |
|
} |
697 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
698 |
0
|
public void visitLeave(SubstFunc reason) {... |
699 |
0
|
text.popLevel(); |
700 |
0
|
text.println("</substfunc>"); |
701 |
|
} |
702 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
703 |
0
|
public void visitLeave(SubstPred reason) {... |
704 |
0
|
text.popLevel(); |
705 |
0
|
text.println("</substpred>"); |
706 |
|
} |
707 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
708 |
0
|
public void visitLeave(Existential reason) {... |
709 |
0
|
text.popLevel(); |
710 |
0
|
text.println("</existential>"); |
711 |
|
} |
712 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
713 |
0
|
public void visitLeave(Universal reason) {... |
714 |
0
|
text.popLevel(); |
715 |
0
|
text.println("</universal>"); |
716 |
|
} |
717 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
718 |
0
|
public void visitLeave(ConditionalProof reason) {... |
719 |
0
|
text.popLevel(); |
720 |
0
|
text.println("</conditionalproof>"); |
721 |
|
} |
722 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
723 |
0
|
public void visitLeave(Hypothesis hypothesis) {... |
724 |
0
|
text.popLevel(); |
725 |
0
|
text.println("</hypothesis>"); |
726 |
|
} |
727 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
728 |
0
|
public void visitLeave(Conclusion conclusion) {... |
729 |
0
|
text.popLevel(); |
730 |
0
|
text.println("</conclusion>"); |
731 |
|
} |
732 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
733 |
0
|
public void visitLeave(Proof proof) {... |
734 |
0
|
text.popLevel(); |
735 |
0
|
text.println("</proof>"); |
736 |
|
} |
737 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
738 |
0
|
public void visitLeave(ProofList proofList) {... |
739 |
0
|
text.popLevel(); |
740 |
0
|
text.println("</prooflist>"); |
741 |
|
} |
742 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
743 |
0
|
public void visitLeave(Proposition proposition) {... |
744 |
0
|
text.popLevel(); |
745 |
0
|
text.println("</proposition>"); |
746 |
|
} |
747 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
748 |
0
|
public void visitLeave(Qedeq qedeq) {... |
749 |
0
|
text.popLevel(); |
750 |
0
|
text.println("</qedeq>"); |
751 |
|
} |
752 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
753 |
0
|
public void visitLeave(Rule rule) {... |
754 |
0
|
text.popLevel(); |
755 |
0
|
text.println("</rule>"); |
756 |
|
} |
757 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
758 |
0
|
public void visitLeave(ChangedRuleList list) {... |
759 |
0
|
text.popLevel(); |
760 |
0
|
text.println("</changedrulelist>"); |
761 |
|
} |
762 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
763 |
0
|
public void visitLeave(ChangedRule rule) {... |
764 |
0
|
text.popLevel(); |
765 |
0
|
text.println("</changedrule>"); |
766 |
|
} |
767 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
768 |
0
|
public void visitLeave(Section section) {... |
769 |
0
|
text.popLevel(); |
770 |
0
|
text.println("</section>"); |
771 |
|
} |
772 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
773 |
0
|
public void visitLeave(SectionList sectionList) {... |
774 |
0
|
text.popLevel(); |
775 |
0
|
text.println("</sectionlist>"); |
776 |
|
} |
777 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
778 |
0
|
public void visitLeave(Specification specification) {... |
779 |
0
|
text.popLevel(); |
780 |
0
|
text.println("</specification>"); |
781 |
|
} |
782 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
783 |
0
|
public void visitLeave(Subsection subsection) {... |
784 |
0
|
text.popLevel(); |
785 |
0
|
text.println("</subsection>"); |
786 |
|
} |
787 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
788 |
0
|
public void visitLeave(SubsectionList subsectionList) {... |
789 |
0
|
text.popLevel(); |
790 |
0
|
text.println("</subsectionlist>"); |
791 |
|
} |
792 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
793 |
0
|
public void visitLeave(SubsectionType subsectionType) {... |
794 |
0
|
text.popLevel(); |
795 |
0
|
text.println("</subsectiontype>"); |
796 |
|
} |
797 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
798 |
0
|
public void visitLeave(Term term) {... |
799 |
0
|
text.popLevel(); |
800 |
0
|
text.println("</term>"); |
801 |
|
} |
802 |
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
803 |
0
|
public void visitLeave(UsedByList usedByList) {... |
804 |
0
|
text.popLevel(); |
805 |
0
|
text.println("</usedbylist>"); |
806 |
|
} |
807 |
|
|
808 |
|
}; |
809 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (10) |
Complexity: 2 |
Complexity Density: 0.25 |
1
PASS
|
|
810 |
1
|
public void testQedeq() throws Exception {... |
811 |
|
|
812 |
|
|
813 |
1
|
final QedeqNotNullTraverser trans2 = new QedeqNotNullTraverser(address); |
814 |
1
|
; |
815 |
1
|
final QedeqVisitorTester testVisitor = new QedeqVisitorTester(trans2) { |
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
816 |
1429
|
public void checkEnter() {... |
817 |
|
|
818 |
|
|
819 |
|
|
820 |
1429
|
assertEquals(trans2.getCurrentContext().getLocationWithinModule(), getContext()); |
821 |
|
} |
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
822 |
1429
|
public void checkLeave() {... |
823 |
|
|
824 |
|
|
825 |
1429
|
assertEquals(trans2.getCurrentContext().getLocationWithinModule(), getContext()); |
826 |
|
} |
827 |
|
}; |
828 |
1
|
trans2.setVisitor(testVisitor); |
829 |
1
|
final List list = new QedeqVoCreator().create(); |
830 |
153
|
for (int i = 0; i < list.size(); i++) { |
831 |
|
|
832 |
|
|
833 |
|
|
834 |
152
|
trans2.accept((Qedeq) list.get(i)); |
835 |
152
|
assertEquals(0, testVisitor.getLevel()); |
836 |
|
} |
837 |
|
} |
838 |
|
|
839 |
|
|
|
|
| 75% |
Uncovered Elements: 1 (4) |
Complexity: 2 |
Complexity Density: 0.5 |
1
PASS
|
|
840 |
1
|
public void testQedeq2() throws Exception {... |
841 |
1
|
QedeqNotNullTraverser trans2 = new QedeqNotNullTraverser(address, |
842 |
|
visitor2); |
843 |
1
|
try { |
844 |
1
|
trans2.accept((Qedeq) null); |
845 |
0
|
fail("Execption expected"); |
846 |
|
} catch (Exception e) { |
847 |
|
|
848 |
|
} |
849 |
|
} |
850 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (16) |
Complexity: 4 |
Complexity Density: 0.4 |
1
PASS
|
|
851 |
1
|
public void testAcceptors1() throws Exception {... |
852 |
1
|
QedeqNotNullTraverser trans2 = new QedeqNotNullTraverser(address, |
853 |
|
visitor2); |
854 |
1
|
final Method[] methods = trans2.getClass().getMethods(); |
855 |
74
|
for (int i = 0; i < methods.length; i++) { |
856 |
73
|
final Method method = methods[i]; |
857 |
73
|
if (!"accept".equals(method.getName())) { |
858 |
19
|
continue; |
859 |
|
} |
860 |
54
|
assertEquals(1, method.getParameterTypes().length); |
861 |
54
|
if (Qedeq.class == method.getParameterTypes()[0]) { |
862 |
1
|
continue; |
863 |
|
} |
864 |
53
|
method.invoke(trans2, new Object[] {null }); |
865 |
|
} |
866 |
|
} |
867 |
|
|
|
|
| 87.5% |
Uncovered Elements: 3 (24) |
Complexity: 6 |
Complexity Density: 0.38 |
1
PASS
|
|
868 |
1
|
public void testAcceptors2() throws Throwable {... |
869 |
1
|
QedeqNotNullTraverser trans2 = new QedeqNotNullTraverser(address, |
870 |
|
visitor2); |
871 |
1
|
final Method[] methods = trans2.getClass().getMethods(); |
872 |
74
|
for (int i = 0; i < methods.length; i++) { |
873 |
73
|
final Method method = methods[i]; |
874 |
73
|
if (!"accept".equals(method.getName())) { |
875 |
19
|
continue; |
876 |
|
} |
877 |
54
|
assertEquals(1, method.getParameterTypes().length); |
878 |
54
|
if (Qedeq.class == method.getParameterTypes()[0]) { |
879 |
1
|
continue; |
880 |
|
} |
881 |
53
|
Thread.currentThread().interrupt(); |
882 |
53
|
try { |
883 |
53
|
method.invoke(trans2, new Object[] {null }); |
884 |
0
|
fail("Exception expected"); |
885 |
|
} catch (InvocationTargetException e) { |
886 |
53
|
if (e.getCause() instanceof InterruptException) { |
887 |
|
|
888 |
|
} else { |
889 |
0
|
throw e.getCause(); |
890 |
|
} |
891 |
|
} |
892 |
53
|
assertFalse(Thread.interrupted()); |
893 |
|
} |
894 |
|
} |
895 |
|
} |