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():

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

OpenSCAP / oval-graph

Code Duplication Length = 12-14 lines in 17 locations

tests/test_graph.py 17 locations