|
1
|
|
|
import graph.oval_graph |
|
2
|
|
|
import tests.any_test_help |
|
3
|
|
|
|
|
4
|
|
|
|
|
5
|
|
|
# AND operator |
|
6
|
|
|
|
|
7
|
|
|
|
|
8
|
|
|
def test_ANDTreeTrue(): |
|
9
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
|
10
|
|
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
|
11
|
|
|
graph.oval_graph.OvalNode(3, 'value', "true"), |
|
12
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
13
|
|
|
] |
|
14
|
|
|
) |
|
15
|
|
|
|
|
16
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
|
17
|
|
|
|
|
18
|
|
|
|
|
19
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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(): |
|
80
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'and', [ |
|
81
|
|
|
graph.oval_graph.OvalNode(2, 'value', "notappl"), |
|
82
|
|
|
graph.oval_graph.OvalNode(3, 'value', "notappl"), |
|
83
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
84
|
|
|
] |
|
85
|
|
|
) |
|
86
|
|
|
|
|
87
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "notappl") |
|
88
|
|
|
|
|
89
|
|
|
# ONE operator |
|
90
|
|
|
|
|
91
|
|
|
|
|
92
|
|
|
def test_ONETreeTrue(): |
|
93
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
|
94
|
|
|
graph.oval_graph.OvalNode(2, 'value', "true"), |
|
95
|
|
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
|
96
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl"), |
|
97
|
|
|
graph.oval_graph.OvalNode(5, 'value', "false") |
|
98
|
|
|
] |
|
99
|
|
|
) |
|
100
|
|
|
|
|
101
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "true") |
|
102
|
|
|
|
|
103
|
|
|
|
|
104
|
|
View Code Duplication |
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(): |
|
121
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
|
122
|
|
|
graph.oval_graph.OvalNode(2, 'value', "false"), |
|
123
|
|
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
|
124
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
125
|
|
|
] |
|
126
|
|
|
) |
|
127
|
|
|
|
|
128
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
|
129
|
|
|
|
|
130
|
|
|
|
|
131
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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(): |
|
176
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'one', [ |
|
177
|
|
|
graph.oval_graph.OvalNode(2, 'value', "notappl"), |
|
178
|
|
|
graph.oval_graph.OvalNode(3, 'value', "notappl"), |
|
179
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
180
|
|
|
] |
|
181
|
|
|
) |
|
182
|
|
|
|
|
183
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "notappl") |
|
184
|
|
|
|
|
185
|
|
|
# OR operator |
|
186
|
|
|
|
|
187
|
|
|
|
|
188
|
|
View Code Duplication |
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(): |
|
205
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
|
206
|
|
|
graph.oval_graph.OvalNode(2, 'value', "false"), |
|
207
|
|
|
graph.oval_graph.OvalNode(3, 'value', "false"), |
|
208
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
209
|
|
|
] |
|
210
|
|
|
) |
|
211
|
|
|
|
|
212
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "false") |
|
213
|
|
|
|
|
214
|
|
|
|
|
215
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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(): |
|
261
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'or', [ |
|
262
|
|
|
graph.oval_graph.OvalNode(2, 'value', "notappl"), |
|
263
|
|
|
graph.oval_graph.OvalNode(3, 'value', "notappl"), |
|
264
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
265
|
|
|
] |
|
266
|
|
|
) |
|
267
|
|
|
|
|
268
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "notappl") |
|
269
|
|
|
|
|
270
|
|
|
# XOR operator |
|
271
|
|
|
|
|
272
|
|
|
|
|
273
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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
|
|
View Code Duplication |
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(): |
|
351
|
|
|
Tree = graph.oval_graph.OvalNode(1, 'operator', 'xor', [ |
|
352
|
|
|
graph.oval_graph.OvalNode(2, 'value', "notappl"), |
|
353
|
|
|
graph.oval_graph.OvalNode(3, 'value', "notappl"), |
|
354
|
|
|
graph.oval_graph.OvalNode(4, 'value', "notappl") |
|
355
|
|
|
] |
|
356
|
|
|
) |
|
357
|
|
|
|
|
358
|
|
|
tests.any_test_help.any_test_treeEvaluation(Tree, "notappl") |
|
359
|
|
|
|
|
360
|
|
|
results_counts = { |
|
361
|
|
|
'true_cnt': -1, |
|
362
|
|
|
'false_cnt': -1, |
|
363
|
|
|
'error_cnt': -1, |
|
364
|
|
|
'unknown_cnt': -1, |
|
365
|
|
|
'noteval_cnt': -1, |
|
366
|
|
|
'notappl_cnt': -1 |
|
367
|
|
|
} |
|
368
|
|
|
|
|
369
|
|
|
results_counts1 = { |
|
370
|
|
|
'true_cnt': 3, |
|
371
|
|
|
'false_cnt': 3, |
|
372
|
|
|
'error_cnt': 3, |
|
373
|
|
|
'unknown_cnt': 0, |
|
374
|
|
|
'noteval_cnt': -1, |
|
375
|
|
|
'notappl_cnt': 3 |
|
376
|
|
|
} |
|
377
|
|
|
|
|
378
|
|
|
def test_and_or_eq_zero(): |
|
379
|
|
|
assert graph.evaluate.and_or_eq_zero('and', results_counts) == False |
|
380
|
|
|
assert graph.evaluate.and_or_eq_zero('or', results_counts) == False |
|
381
|
|
|
assert graph.evaluate.and_or_eq_zero('xor', results_counts) is None |
|
382
|
|
|
|
|
383
|
|
|
def test_bad_results_counts_for_operator_and(): |
|
384
|
|
|
assert graph.evaluate.oval_operator_and(results_counts) is None |
|
385
|
|
|
|
|
386
|
|
|
|
|
387
|
|
|
def test_bad_results_counts_for_operator_one(): |
|
388
|
|
|
assert graph.evaluate.oval_operator_one(results_counts) is None |
|
389
|
|
|
|
|
390
|
|
|
|
|
391
|
|
|
def test_bad_results_counts_for_operator_or(): |
|
392
|
|
|
assert graph.evaluate.oval_operator_or(results_counts) is None |
|
393
|
|
|
|
|
394
|
|
|
|
|
395
|
|
|
def test_bad_results_counts_for_operator_xor(): |
|
396
|
|
|
assert graph.evaluate.oval_operator_xor(results_counts) is None |
|
397
|
|
|
|
|
398
|
|
|
|
|
399
|
|
|
def test_false_noteval_greater_zero(): |
|
400
|
|
|
assert graph.evaluate.greater_zero(results_counts, 'noteval_cnt') == False |
|
401
|
|
|
|
|
402
|
|
|
|
|
403
|
|
|
def test_false_smaller_then_two(): |
|
404
|
|
|
assert graph.evaluate.smaller_than_two( |
|
405
|
|
|
results_counts1, 'true_cnt') == False |
|
406
|
|
|
|
|
407
|
|
|
|
|
408
|
|
|
def test_false_eq_or_greater_zero_unknown_noteval_notappl(): |
|
409
|
|
|
assert graph.evaluate.eq_or_greater_zero_unknown_noteval_notappl( |
|
410
|
|
|
results_counts1) == False |
|
411
|
|
|
|
|
412
|
|
|
|
|
413
|
|
|
def test_false_error_unknown_eq_noteval_greater_zero(): |
|
414
|
|
|
assert graph.evaluate.error_unknown_eq_noteval_greater_zero( |
|
415
|
|
|
results_counts) == False |
|
416
|
|
|
|