Code Duplication - OpenSCAP/oval-graph - Measure and Improve Code Quality continuously with Scrutinizer

Code Duplication Length = 12-14 lines in 17 locations

tests/test_graph.py 17 locations


    any_test_treeEvaluation(Tree, "true")


def test_XORTreeFalse():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
        graph.oval_graph.OvalNode(2, 'value', "true"),
        graph.oval_graph.OvalNode(3, 'value', "false"),

        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "true"),
        graph.oval_graph.OvalNode(6, 'value', "true"),
        graph.oval_graph.OvalNode(7, 'value', "true"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "false")


def test_XORTreeError():

# XOR operator


def test_XORTreeTrue():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
        graph.oval_graph.OvalNode(2, 'value', "true"),
        graph.oval_graph.OvalNode(3, 'value', "false"),

        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "false"),
        graph.oval_graph.OvalNode(6, 'value', "true"),
        graph.oval_graph.OvalNode(7, 'value', "true"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "true")


def test_XORTreeFalse():

# OR operator


def test_ORTreeTrue():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
        graph.oval_graph.OvalNode(2, 'value', "true"),
        graph.oval_graph.OvalNode(3, 'value', "false"),

        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "error"),
        graph.oval_graph.OvalNode(6, 'value', "unknown"),
        graph.oval_graph.OvalNode(7, 'value', "noteval"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "true")


def test_ORTreeFalse():

    any_test_treeEvaluation(Tree, "true")


def test_ONETreeFalse():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
        graph.oval_graph.OvalNode(2, 'value', "true"),
        graph.oval_graph.OvalNode(3, 'value', "true"),

        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "error"),
        graph.oval_graph.OvalNode(6, 'value', "unknown"),
        graph.oval_graph.OvalNode(7, 'value', "noteval"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "false")


def test_ONETreeFalse1():

    any_test_treeEvaluation(Tree, "true")


def test_ANDTreeFalse():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
        graph.oval_graph.OvalNode(2, 'value', "false"),
        graph.oval_graph.OvalNode(3, 'value', "false"),

        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "error"),
        graph.oval_graph.OvalNode(6, 'value', "unknown"),
        graph.oval_graph.OvalNode(7, 'value', "noteval"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "false")


def test_ANDTreeError():

    any_test_treeEvaluation(Tree, "unknown")


def test_XORTreeNoteval():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
        graph.oval_graph.OvalNode(2, 'value', "noteval"),
        graph.oval_graph.OvalNode(3, 'value', "noteval"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "true"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "noteval")


def test_XORTreeNotappl():

    any_test_treeEvaluation(Tree, "error")


def test_xORTreeUnknown():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
        graph.oval_graph.OvalNode(2, 'value', "unknown"),
        graph.oval_graph.OvalNode(3, 'value', "unknown"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "unknown")


def test_XORTreeNoteval():

    any_test_treeEvaluation(Tree, "false")


def test_XORTreeError():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
        graph.oval_graph.OvalNode(2, 'value', "error"),
        graph.oval_graph.OvalNode(3, 'value', "error"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "false")
    ]
    )

    any_test_treeEvaluation(Tree, "error")


def test_xORTreeUnknown():

    any_test_treeEvaluation(Tree, "unknown")


def test_ORTreeNoteval():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
        graph.oval_graph.OvalNode(2, 'value', "noteval"),
        graph.oval_graph.OvalNode(3, 'value', "noteval"),
        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "false"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "noteval")


def test_ORTreeNotappl():

    any_test_treeEvaluation(Tree, "error")


def test_ORTreeUnknown():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
        graph.oval_graph.OvalNode(2, 'value', "unknown"),
        graph.oval_graph.OvalNode(3, 'value', "unknown"),
        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "unknown")


def test_ORTreeNoteval():

    any_test_treeEvaluation(Tree, "false")


def test_ORTreeError():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
        graph.oval_graph.OvalNode(2, 'value', "error"),
        graph.oval_graph.OvalNode(3, 'value', "error"),
        graph.oval_graph.OvalNode(4, 'value', "false"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "error")
    ]
    )

    any_test_treeEvaluation(Tree, "error")


def test_ORTreeUnknown():

    any_test_treeEvaluation(Tree, "unknown")


def test_ONETreeNoteval():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
        graph.oval_graph.OvalNode(2, 'value', "noteval"),
        graph.oval_graph.OvalNode(3, 'value', "noteval"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "false"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "noteval")


def test_ONETreeNotappl():

    any_test_treeEvaluation(Tree, "false")


def test_ONETreeError():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
        graph.oval_graph.OvalNode(2, 'value', "error"),
        graph.oval_graph.OvalNode(3, 'value', "error"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "false")
    ]
    )

    any_test_treeEvaluation(Tree, "error")


def test_ONETreeUnknown():

    any_test_treeEvaluation(Tree, "unknown")


def test_ANDTreeNoteval():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
        graph.oval_graph.OvalNode(2, 'value', "noteval"),
        graph.oval_graph.OvalNode(3, 'value', "noteval"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "true"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "noteval")


def test_ANDTreeNotappl():

    any_test_treeEvaluation(Tree, "error")


def test_ANDTreeUnknown():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
        graph.oval_graph.OvalNode(2, 'value', "unknown"),
        graph.oval_graph.OvalNode(3, 'value', "unknown"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "notappl")
    ]
    )

    any_test_treeEvaluation(Tree, "unknown")


def test_ANDTreeNoteval():

    any_test_treeEvaluation(Tree, "error")


def test_ONETreeUnknown():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
        graph.oval_graph.OvalNode(2, 'value', "unknown"),
        graph.oval_graph.OvalNode(3, 'value', "unknown"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "false")
    ])

    any_test_treeEvaluation(Tree, "unknown")


def test_ONETreeNoteval():

    any_test_treeEvaluation(Tree, "false")


def test_ANDTreeError():
    Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
        graph.oval_graph.OvalNode(2, 'value', "error"),
        graph.oval_graph.OvalNode(3, 'value', "error"),
        graph.oval_graph.OvalNode(4, 'value', "true"),
        graph.oval_graph.OvalNode(5, 'value', "unknown"),
        graph.oval_graph.OvalNode(6, 'value', "noteval"),
        graph.oval_graph.OvalNode(7, 'value', "notappl"),
        graph.oval_graph.OvalNode(8, 'value', "error")
    ])

    any_test_treeEvaluation(Tree, "error")


def test_ANDTreeUnknown():

		@@ 398-411 (lines=14) @@
395		any_test_treeEvaluation(Tree, "true")
396
397
398		def test_XORTreeFalse():
399		Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
400		graph.oval_graph.OvalNode(2, 'value', "true"),
401		graph.oval_graph.OvalNode(3, 'value', "false"),
402
403		graph.oval_graph.OvalNode(4, 'value', "false"),
404		graph.oval_graph.OvalNode(5, 'value', "true"),
405		graph.oval_graph.OvalNode(6, 'value', "true"),
406		graph.oval_graph.OvalNode(7, 'value', "true"),
407		graph.oval_graph.OvalNode(8, 'value', "notappl")
408		]
409		)
410
411		any_test_treeEvaluation(Tree, "false")
412
413
414		def test_XORTreeError():
		@@ 382-395 (lines=14) @@
379		# XOR operator
380
381
382		def test_XORTreeTrue():
383		Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
384		graph.oval_graph.OvalNode(2, 'value', "true"),
385		graph.oval_graph.OvalNode(3, 'value', "false"),
386
387		graph.oval_graph.OvalNode(4, 'value', "false"),
388		graph.oval_graph.OvalNode(5, 'value', "false"),
389		graph.oval_graph.OvalNode(6, 'value', "true"),
390		graph.oval_graph.OvalNode(7, 'value', "true"),
391		graph.oval_graph.OvalNode(8, 'value', "notappl")
392		]
393		)
394
395		any_test_treeEvaluation(Tree, "true")
396
397
398		def test_XORTreeFalse():
		@@ 297-310 (lines=14) @@
294		# OR operator
295
296
297		def test_ORTreeTrue():
298		Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
299		graph.oval_graph.OvalNode(2, 'value', "true"),
300		graph.oval_graph.OvalNode(3, 'value', "false"),
301
302		graph.oval_graph.OvalNode(4, 'value', "true"),
303		graph.oval_graph.OvalNode(5, 'value', "error"),
304		graph.oval_graph.OvalNode(6, 'value', "unknown"),
305		graph.oval_graph.OvalNode(7, 'value', "noteval"),
306		graph.oval_graph.OvalNode(8, 'value', "notappl")
307		]
308		)
309
310		any_test_treeEvaluation(Tree, "true")
311
312
313		def test_ORTreeFalse():
		@@ 213-226 (lines=14) @@
210		any_test_treeEvaluation(Tree, "true")
211
212
213		def test_ONETreeFalse():
214		Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
215		graph.oval_graph.OvalNode(2, 'value', "true"),
216		graph.oval_graph.OvalNode(3, 'value', "true"),
217
218		graph.oval_graph.OvalNode(4, 'value', "false"),
219		graph.oval_graph.OvalNode(5, 'value', "error"),
220		graph.oval_graph.OvalNode(6, 'value', "unknown"),
221		graph.oval_graph.OvalNode(7, 'value', "noteval"),
222		graph.oval_graph.OvalNode(8, 'value', "notappl")
223		]
224		)
225
226		any_test_treeEvaluation(Tree, "false")
227
228
229		def test_ONETreeFalse1():
		@@ 128-141 (lines=14) @@
125		any_test_treeEvaluation(Tree, "true")
126
127
128		def test_ANDTreeFalse():
129		Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
130		graph.oval_graph.OvalNode(2, 'value', "false"),
131		graph.oval_graph.OvalNode(3, 'value', "false"),
132
133		graph.oval_graph.OvalNode(4, 'value', "true"),
134		graph.oval_graph.OvalNode(5, 'value', "error"),
135		graph.oval_graph.OvalNode(6, 'value', "unknown"),
136		graph.oval_graph.OvalNode(7, 'value', "noteval"),
137		graph.oval_graph.OvalNode(8, 'value', "notappl")
138		]
139		)
140
141		any_test_treeEvaluation(Tree, "false")
142
143
144		def test_ANDTreeError():
		@@ 444-456 (lines=13) @@
441		any_test_treeEvaluation(Tree, "unknown")
442
443
444		def test_XORTreeNoteval():
445		Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
446		graph.oval_graph.OvalNode(2, 'value', "noteval"),
447		graph.oval_graph.OvalNode(3, 'value', "noteval"),
448		graph.oval_graph.OvalNode(4, 'value', "true"),
449		graph.oval_graph.OvalNode(5, 'value', "true"),
450		graph.oval_graph.OvalNode(6, 'value', "noteval"),
451		graph.oval_graph.OvalNode(7, 'value', "notappl"),
452		graph.oval_graph.OvalNode(8, 'value', "notappl")
453		]
454		)
455
456		any_test_treeEvaluation(Tree, "noteval")
457
458
459		def test_XORTreeNotappl():
		@@ 429-441 (lines=13) @@
426		any_test_treeEvaluation(Tree, "error")
427
428
429		def test_xORTreeUnknown():
430		Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
431		graph.oval_graph.OvalNode(2, 'value', "unknown"),
432		graph.oval_graph.OvalNode(3, 'value', "unknown"),
433		graph.oval_graph.OvalNode(4, 'value', "true"),
434		graph.oval_graph.OvalNode(5, 'value', "unknown"),
435		graph.oval_graph.OvalNode(6, 'value', "noteval"),
436		graph.oval_graph.OvalNode(7, 'value', "notappl"),
437		graph.oval_graph.OvalNode(8, 'value', "notappl")
438		]
439		)
440
441		any_test_treeEvaluation(Tree, "unknown")
442
443
444		def test_XORTreeNoteval():
		@@ 414-426 (lines=13) @@
411		any_test_treeEvaluation(Tree, "false")
412
413
414		def test_XORTreeError():
415		Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [
416		graph.oval_graph.OvalNode(2, 'value', "error"),
417		graph.oval_graph.OvalNode(3, 'value', "error"),
418		graph.oval_graph.OvalNode(4, 'value', "true"),
419		graph.oval_graph.OvalNode(5, 'value', "unknown"),
420		graph.oval_graph.OvalNode(6, 'value', "noteval"),
421		graph.oval_graph.OvalNode(7, 'value', "notappl"),
422		graph.oval_graph.OvalNode(8, 'value', "false")
423		]
424		)
425
426		any_test_treeEvaluation(Tree, "error")
427
428
429		def test_xORTreeUnknown():
		@@ 354-366 (lines=13) @@
351		any_test_treeEvaluation(Tree, "unknown")
352
353
354		def test_ORTreeNoteval():
355		Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
356		graph.oval_graph.OvalNode(2, 'value', "noteval"),
357		graph.oval_graph.OvalNode(3, 'value', "noteval"),
358		graph.oval_graph.OvalNode(4, 'value', "false"),
359		graph.oval_graph.OvalNode(5, 'value', "false"),
360		graph.oval_graph.OvalNode(6, 'value', "noteval"),
361		graph.oval_graph.OvalNode(7, 'value', "notappl"),
362		graph.oval_graph.OvalNode(8, 'value', "notappl")
363		]
364		)
365
366		any_test_treeEvaluation(Tree, "noteval")
367
368
369		def test_ORTreeNotappl():
		@@ 339-351 (lines=13) @@
336		any_test_treeEvaluation(Tree, "error")
337
338
339		def test_ORTreeUnknown():
340		Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
341		graph.oval_graph.OvalNode(2, 'value', "unknown"),
342		graph.oval_graph.OvalNode(3, 'value', "unknown"),
343		graph.oval_graph.OvalNode(4, 'value', "false"),
344		graph.oval_graph.OvalNode(5, 'value', "unknown"),
345		graph.oval_graph.OvalNode(6, 'value', "noteval"),
346		graph.oval_graph.OvalNode(7, 'value', "notappl"),
347		graph.oval_graph.OvalNode(8, 'value', "notappl")
348		]
349		)
350
351		any_test_treeEvaluation(Tree, "unknown")
352
353
354		def test_ORTreeNoteval():
		@@ 324-336 (lines=13) @@
321		any_test_treeEvaluation(Tree, "false")
322
323
324		def test_ORTreeError():
325		Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [
326		graph.oval_graph.OvalNode(2, 'value', "error"),
327		graph.oval_graph.OvalNode(3, 'value', "error"),
328		graph.oval_graph.OvalNode(4, 'value', "false"),
329		graph.oval_graph.OvalNode(5, 'value', "unknown"),
330		graph.oval_graph.OvalNode(6, 'value', "noteval"),
331		graph.oval_graph.OvalNode(7, 'value', "notappl"),
332		graph.oval_graph.OvalNode(8, 'value', "error")
333		]
334		)
335
336		any_test_treeEvaluation(Tree, "error")
337
338
339		def test_ORTreeUnknown():
		@@ 269-281 (lines=13) @@
266		any_test_treeEvaluation(Tree, "unknown")
267
268
269		def test_ONETreeNoteval():
270		Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
271		graph.oval_graph.OvalNode(2, 'value', "noteval"),
272		graph.oval_graph.OvalNode(3, 'value', "noteval"),
273		graph.oval_graph.OvalNode(4, 'value', "true"),
274		graph.oval_graph.OvalNode(5, 'value', "false"),
275		graph.oval_graph.OvalNode(6, 'value', "noteval"),
276		graph.oval_graph.OvalNode(7, 'value', "notappl"),
277		graph.oval_graph.OvalNode(8, 'value', "notappl")
278		]
279		)
280
281		any_test_treeEvaluation(Tree, "noteval")
282
283
284		def test_ONETreeNotappl():
		@@ 240-252 (lines=13) @@
237		any_test_treeEvaluation(Tree, "false")
238
239
240		def test_ONETreeError():
241		Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
242		graph.oval_graph.OvalNode(2, 'value', "error"),
243		graph.oval_graph.OvalNode(3, 'value', "error"),
244		graph.oval_graph.OvalNode(4, 'value', "true"),
245		graph.oval_graph.OvalNode(5, 'value', "unknown"),
246		graph.oval_graph.OvalNode(6, 'value', "noteval"),
247		graph.oval_graph.OvalNode(7, 'value', "notappl"),
248		graph.oval_graph.OvalNode(8, 'value', "false")
249		]
250		)
251
252		any_test_treeEvaluation(Tree, "error")
253
254
255		def test_ONETreeUnknown():
		@@ 173-185 (lines=13) @@
170		any_test_treeEvaluation(Tree, "unknown")
171
172
173		def test_ANDTreeNoteval():
174		Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
175		graph.oval_graph.OvalNode(2, 'value', "noteval"),
176		graph.oval_graph.OvalNode(3, 'value', "noteval"),
177		graph.oval_graph.OvalNode(4, 'value', "true"),
178		graph.oval_graph.OvalNode(5, 'value', "true"),
179		graph.oval_graph.OvalNode(6, 'value', "noteval"),
180		graph.oval_graph.OvalNode(7, 'value', "notappl"),
181		graph.oval_graph.OvalNode(8, 'value', "notappl")
182		]
183		)
184
185		any_test_treeEvaluation(Tree, "noteval")
186
187
188		def test_ANDTreeNotappl():
		@@ 158-170 (lines=13) @@
155		any_test_treeEvaluation(Tree, "error")
156
157
158		def test_ANDTreeUnknown():
159		Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
160		graph.oval_graph.OvalNode(2, 'value', "unknown"),
161		graph.oval_graph.OvalNode(3, 'value', "unknown"),
162		graph.oval_graph.OvalNode(4, 'value', "true"),
163		graph.oval_graph.OvalNode(5, 'value', "unknown"),
164		graph.oval_graph.OvalNode(6, 'value', "noteval"),
165		graph.oval_graph.OvalNode(7, 'value', "notappl"),
166		graph.oval_graph.OvalNode(8, 'value', "notappl")
167		]
168		)
169
170		any_test_treeEvaluation(Tree, "unknown")
171
172
173		def test_ANDTreeNoteval():
		@@ 255-266 (lines=12) @@
252		any_test_treeEvaluation(Tree, "error")
253
254
255		def test_ONETreeUnknown():
256		Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [
257		graph.oval_graph.OvalNode(2, 'value', "unknown"),
258		graph.oval_graph.OvalNode(3, 'value', "unknown"),
259		graph.oval_graph.OvalNode(4, 'value', "true"),
260		graph.oval_graph.OvalNode(5, 'value', "unknown"),
261		graph.oval_graph.OvalNode(6, 'value', "noteval"),
262		graph.oval_graph.OvalNode(7, 'value', "notappl"),
263		graph.oval_graph.OvalNode(8, 'value', "false")
264		])
265
266		any_test_treeEvaluation(Tree, "unknown")
267
268
269		def test_ONETreeNoteval():
		@@ 144-155 (lines=12) @@
141		any_test_treeEvaluation(Tree, "false")
142
143
144		def test_ANDTreeError():
145		Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [
146		graph.oval_graph.OvalNode(2, 'value', "error"),
147		graph.oval_graph.OvalNode(3, 'value', "error"),
148		graph.oval_graph.OvalNode(4, 'value', "true"),
149		graph.oval_graph.OvalNode(5, 'value', "unknown"),
150		graph.oval_graph.OvalNode(6, 'value', "noteval"),
151		graph.oval_graph.OvalNode(7, 'value', "notappl"),
152		graph.oval_graph.OvalNode(8, 'value', "error")
153		])
154
155		any_test_treeEvaluation(Tree, "error")
156
157
158		def test_ANDTreeUnknown():

OpenSCAP / oval-graph

Code Duplication Length = 12-14 lines in 17 locations

tests/test_graph.py 17 locations