|
@@ 289-302 (lines=14) @@
|
| 286 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
| 287 |
|
|
| 288 |
|
|
| 289 |
|
def test_XORTreeFalse(): |
| 290 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
| 291 |
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
| 292 |
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
| 293 |
|
|
| 294 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 295 |
|
graph.oval_graph.OvalNode(5, 'value', "true"), |
| 296 |
|
graph.oval_graph.OvalNode(6, 'value', "true"), |
| 297 |
|
graph.oval_graph.OvalNode(7, 'value', "true"), |
| 298 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 299 |
|
] |
| 300 |
|
) |
| 301 |
|
|
| 302 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 303 |
|
|
| 304 |
|
|
| 305 |
|
def test_XORTreeError(): |
|
@@ 273-286 (lines=14) @@
|
| 270 |
|
# XOR operator |
| 271 |
|
|
| 272 |
|
|
| 273 |
|
def test_XORTreeTrue(): |
| 274 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
| 275 |
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
| 276 |
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
| 277 |
|
|
| 278 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 279 |
|
graph.oval_graph.OvalNode(5, 'value', "false"), |
| 280 |
|
graph.oval_graph.OvalNode(6, 'value', "true"), |
| 281 |
|
graph.oval_graph.OvalNode(7, 'value', "true"), |
| 282 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 283 |
|
] |
| 284 |
|
) |
| 285 |
|
|
| 286 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
| 287 |
|
|
| 288 |
|
|
| 289 |
|
def test_XORTreeFalse(): |
|
@@ 188-201 (lines=14) @@
|
| 185 |
|
# OR operator |
| 186 |
|
|
| 187 |
|
|
| 188 |
|
def test_ORTreeTrue(): |
| 189 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
| 190 |
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
| 191 |
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
| 192 |
|
|
| 193 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 194 |
|
graph.oval_graph.OvalNode(5, 'value', "error"), |
| 195 |
|
graph.oval_graph.OvalNode(6, 'value', "unknown"), |
| 196 |
|
graph.oval_graph.OvalNode(7, 'value', "noteval"), |
| 197 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 198 |
|
] |
| 199 |
|
) |
| 200 |
|
|
| 201 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
| 202 |
|
|
| 203 |
|
|
| 204 |
|
def test_ORTreeFalse(): |
|
@@ 104-117 (lines=14) @@
|
| 101 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
| 102 |
|
|
| 103 |
|
|
| 104 |
|
def test_ONETreeFalse(): |
| 105 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
| 106 |
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
| 107 |
|
graph.oval_graph.OvalNode(3, 'value', "true"), |
| 108 |
|
|
| 109 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 110 |
|
graph.oval_graph.OvalNode(5, 'value', "error"), |
| 111 |
|
graph.oval_graph.OvalNode(6, 'value', "unknown"), |
| 112 |
|
graph.oval_graph.OvalNode(7, 'value', "noteval"), |
| 113 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 114 |
|
] |
| 115 |
|
) |
| 116 |
|
|
| 117 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 118 |
|
|
| 119 |
|
|
| 120 |
|
def test_ONETreeFalse1(): |
|
@@ 19-32 (lines=14) @@
|
| 16 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
| 17 |
|
|
| 18 |
|
|
| 19 |
|
def test_ANDTreeFalse(): |
| 20 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
| 21 |
|
graph.oval_graph.OvalNode(2, 'value', "false"), |
| 22 |
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
| 23 |
|
|
| 24 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 25 |
|
graph.oval_graph.OvalNode(5, 'value', "error"), |
| 26 |
|
graph.oval_graph.OvalNode(6, 'value', "unknown"), |
| 27 |
|
graph.oval_graph.OvalNode(7, 'value', "noteval"), |
| 28 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 29 |
|
] |
| 30 |
|
) |
| 31 |
|
|
| 32 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 33 |
|
|
| 34 |
|
|
| 35 |
|
def test_ANDTreeError(): |
|
@@ 335-347 (lines=13) @@
|
| 332 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 333 |
|
|
| 334 |
|
|
| 335 |
|
def test_XORTreeNoteval(): |
| 336 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
| 337 |
|
graph.oval_graph.OvalNode(2, 'value', "noteval"), |
| 338 |
|
graph.oval_graph.OvalNode(3, 'value', "noteval"), |
| 339 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 340 |
|
graph.oval_graph.OvalNode(5, 'value', "true"), |
| 341 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 342 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 343 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 344 |
|
] |
| 345 |
|
) |
| 346 |
|
|
| 347 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "noteval") |
| 348 |
|
|
| 349 |
|
|
| 350 |
|
def test_XORTreeNotappl(): |
|
@@ 320-332 (lines=13) @@
|
| 317 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 318 |
|
|
| 319 |
|
|
| 320 |
|
def test_xORTreeUnknown(): |
| 321 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
| 322 |
|
graph.oval_graph.OvalNode(2, 'value', "unknown"), |
| 323 |
|
graph.oval_graph.OvalNode(3, 'value', "unknown"), |
| 324 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 325 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 326 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 327 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 328 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 329 |
|
] |
| 330 |
|
) |
| 331 |
|
|
| 332 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 333 |
|
|
| 334 |
|
|
| 335 |
|
def test_XORTreeNoteval(): |
|
@@ 305-317 (lines=13) @@
|
| 302 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 303 |
|
|
| 304 |
|
|
| 305 |
|
def test_XORTreeError(): |
| 306 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
| 307 |
|
graph.oval_graph.OvalNode(2, 'value', "error"), |
| 308 |
|
graph.oval_graph.OvalNode(3, 'value', "error"), |
| 309 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 310 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 311 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 312 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 313 |
|
graph.oval_graph.OvalNode(8, 'value', "false") |
| 314 |
|
] |
| 315 |
|
) |
| 316 |
|
|
| 317 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 318 |
|
|
| 319 |
|
|
| 320 |
|
def test_xORTreeUnknown(): |
|
@@ 245-257 (lines=13) @@
|
| 242 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 243 |
|
|
| 244 |
|
|
| 245 |
|
def test_ORTreeNoteval(): |
| 246 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
| 247 |
|
graph.oval_graph.OvalNode(2, 'value', "noteval"), |
| 248 |
|
graph.oval_graph.OvalNode(3, 'value', "noteval"), |
| 249 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 250 |
|
graph.oval_graph.OvalNode(5, 'value', "false"), |
| 251 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 252 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 253 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 254 |
|
] |
| 255 |
|
) |
| 256 |
|
|
| 257 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "noteval") |
| 258 |
|
|
| 259 |
|
|
| 260 |
|
def test_ORTreeNotappl(): |
|
@@ 230-242 (lines=13) @@
|
| 227 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 228 |
|
|
| 229 |
|
|
| 230 |
|
def test_ORTreeUnknown(): |
| 231 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
| 232 |
|
graph.oval_graph.OvalNode(2, 'value', "unknown"), |
| 233 |
|
graph.oval_graph.OvalNode(3, 'value', "unknown"), |
| 234 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 235 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 236 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 237 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 238 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 239 |
|
] |
| 240 |
|
) |
| 241 |
|
|
| 242 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 243 |
|
|
| 244 |
|
|
| 245 |
|
def test_ORTreeNoteval(): |
|
@@ 215-227 (lines=13) @@
|
| 212 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 213 |
|
|
| 214 |
|
|
| 215 |
|
def test_ORTreeError(): |
| 216 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
| 217 |
|
graph.oval_graph.OvalNode(2, 'value', "error"), |
| 218 |
|
graph.oval_graph.OvalNode(3, 'value', "error"), |
| 219 |
|
graph.oval_graph.OvalNode(4, 'value', "false"), |
| 220 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 221 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 222 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 223 |
|
graph.oval_graph.OvalNode(8, 'value', "error") |
| 224 |
|
] |
| 225 |
|
) |
| 226 |
|
|
| 227 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 228 |
|
|
| 229 |
|
|
| 230 |
|
def test_ORTreeUnknown(): |
|
@@ 160-172 (lines=13) @@
|
| 157 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 158 |
|
|
| 159 |
|
|
| 160 |
|
def test_ONETreeNoteval(): |
| 161 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
| 162 |
|
graph.oval_graph.OvalNode(2, 'value', "noteval"), |
| 163 |
|
graph.oval_graph.OvalNode(3, 'value', "noteval"), |
| 164 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 165 |
|
graph.oval_graph.OvalNode(5, 'value', "false"), |
| 166 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 167 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 168 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 169 |
|
] |
| 170 |
|
) |
| 171 |
|
|
| 172 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "noteval") |
| 173 |
|
|
| 174 |
|
|
| 175 |
|
def test_ONETreeNotappl(): |
|
@@ 131-143 (lines=13) @@
|
| 128 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 129 |
|
|
| 130 |
|
|
| 131 |
|
def test_ONETreeError(): |
| 132 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
| 133 |
|
graph.oval_graph.OvalNode(2, 'value', "error"), |
| 134 |
|
graph.oval_graph.OvalNode(3, 'value', "error"), |
| 135 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 136 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 137 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 138 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 139 |
|
graph.oval_graph.OvalNode(8, 'value', "false") |
| 140 |
|
] |
| 141 |
|
) |
| 142 |
|
|
| 143 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 144 |
|
|
| 145 |
|
|
| 146 |
|
def test_ONETreeUnknown(): |
|
@@ 64-76 (lines=13) @@
|
| 61 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 62 |
|
|
| 63 |
|
|
| 64 |
|
def test_ANDTreeNoteval(): |
| 65 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
| 66 |
|
graph.oval_graph.OvalNode(2, 'value', "noteval"), |
| 67 |
|
graph.oval_graph.OvalNode(3, 'value', "noteval"), |
| 68 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 69 |
|
graph.oval_graph.OvalNode(5, 'value', "true"), |
| 70 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 71 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 72 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 73 |
|
] |
| 74 |
|
) |
| 75 |
|
|
| 76 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "noteval") |
| 77 |
|
|
| 78 |
|
|
| 79 |
|
def test_ANDTreeNotappl(): |
|
@@ 49-61 (lines=13) @@
|
| 46 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 47 |
|
|
| 48 |
|
|
| 49 |
|
def test_ANDTreeUnknown(): |
| 50 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
| 51 |
|
graph.oval_graph.OvalNode(2, 'value', "unknown"), |
| 52 |
|
graph.oval_graph.OvalNode(3, 'value', "unknown"), |
| 53 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 54 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 55 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 56 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 57 |
|
graph.oval_graph.OvalNode(8, 'value', "notappl") |
| 58 |
|
] |
| 59 |
|
) |
| 60 |
|
|
| 61 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 62 |
|
|
| 63 |
|
|
| 64 |
|
def test_ANDTreeNoteval(): |
|
@@ 146-157 (lines=12) @@
|
| 143 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 144 |
|
|
| 145 |
|
|
| 146 |
|
def test_ONETreeUnknown(): |
| 147 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
| 148 |
|
graph.oval_graph.OvalNode(2, 'value', "unknown"), |
| 149 |
|
graph.oval_graph.OvalNode(3, 'value', "unknown"), |
| 150 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 151 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 152 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 153 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 154 |
|
graph.oval_graph.OvalNode(8, 'value', "false") |
| 155 |
|
]) |
| 156 |
|
|
| 157 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "unknown") |
| 158 |
|
|
| 159 |
|
|
| 160 |
|
def test_ONETreeNoteval(): |
|
@@ 35-46 (lines=12) @@
|
| 32 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
| 33 |
|
|
| 34 |
|
|
| 35 |
|
def test_ANDTreeError(): |
| 36 |
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
| 37 |
|
graph.oval_graph.OvalNode(2, 'value', "error"), |
| 38 |
|
graph.oval_graph.OvalNode(3, 'value', "error"), |
| 39 |
|
graph.oval_graph.OvalNode(4, 'value', "true"), |
| 40 |
|
graph.oval_graph.OvalNode(5, 'value', "unknown"), |
| 41 |
|
graph.oval_graph.OvalNode(6, 'value', "noteval"), |
| 42 |
|
graph.oval_graph.OvalNode(7, 'value', "notappl"), |
| 43 |
|
graph.oval_graph.OvalNode(8, 'value', "error") |
| 44 |
|
]) |
| 45 |
|
|
| 46 |
|
tests.any_test_help.any_test_treeEvaluation(Tree, "error") |
| 47 |
|
|
| 48 |
|
|
| 49 |
|
def test_ANDTreeUnknown(): |
OpenSCAP /
oval-graph
