1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
|
// -*- Mode: C++; tab-width: 2; -*-
// vi: set ts=2:
//
#include <BALL/CONCEPT/classTest.h>
#include <BALLTestConfig.h>
///////////////////////////
#include <BALL/KERNEL/expression.h>
/////////////////
using namespace BALL;
///////////////////////////
START_TEST(Expression)
/////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////
// tests for class ExpressionTree::
ExpressionTree* et_ptr;
CHECK(ExpressionTree() throw())
et_ptr = new ExpressionTree;
TEST_NOT_EQUAL(et_ptr, 0)
TEST_EQUAL(et_ptr->getType(), ExpressionTree::INVALID)
TEST_EQUAL(et_ptr->getNegate(), false)
TEST_EQUAL(et_ptr->getPredicate(), 0)
list<const ExpressionTree*> test_list;
bool test = (et_ptr->getChildren() == test_list);
TEST_EQUAL(test, true)
RESULT
CHECK(~ExpressionTree() throw())
delete et_ptr;
RESULT
CHECK(ExpressionTree(const ExpressionTree& tree) throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree* child = new ExpressionTree;
et1.setType(ExpressionTree::LEAF);
et1.setNegate(true);
et1.setPredicate(ep);
et1.appendChild(child);
ExpressionTree et2;
bool test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
ExpressionTree et3(et1);
test = (et1 == et3);
TEST_EQUAL(test, true)
RESULT
CHECK(ExpressionTree(ExpressionPredicate* predicate, bool negate = false) throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree et2(ep, true);
bool test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et1.setNegate(true);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et1.setPredicate(new ExpressionPredicate);
test = (et1 == et2);
TEST_EQUAL(test, true)
RESULT
CHECK(ExpressionTree(Type type, list<const ExpressionTree*> children, bool negate = false) throw())
ExpressionTree* child1 = new ExpressionTree;
ExpressionTree* child2 = new ExpressionTree;
ExpressionTree* child3 = new ExpressionTree;
std::list<const ExpressionTree*> children;
children.push_back(child1);
children.push_back(child2);
children.push_back(child3);
ExpressionTree et1;
ExpressionTree et2(ExpressionTree::LEAF, children, true);
bool test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et1.setType(ExpressionTree::LEAF);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et1.setNegate(true);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
RESULT
CHECK(bool operator () (const Atom& atom) const throw())
ExpressionTree et;
RESULT
CHECK(bool operator == (const ExpressionTree& tree) const throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree* child = new ExpressionTree;
et1.setType(ExpressionTree::LEAF);
et1.setNegate(true);
et1.setPredicate(ep);
et1.appendChild(child);
ExpressionTree et2;
bool test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et2.setType(ExpressionTree::LEAF);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et2.setNegate(true);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et2.setPredicate(new ExpressionPredicate);
test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et2.appendChild(new ExpressionTree);
test = (et1 == et2);
TEST_EQUAL(test, true)
RESULT
CHECK(bool operator != (const ExpressionTree& tree) const throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree* child = new ExpressionTree;
et1.setType(ExpressionTree::LEAF);
et1.setNegate(true);
et1.setPredicate(ep);
et1.appendChild(child);
ExpressionTree et2;
TEST_EQUAL(et2 != et1, true)
et2.setType(ExpressionTree::LEAF);
TEST_EQUAL(et2 != et1, true)
et2.setNegate(true);
TEST_EQUAL(et2 != et1, true)
et2.setPredicate(new ExpressionPredicate);
TEST_EQUAL(et2 != et1, true)
et2.appendChild(new ExpressionTree);
TEST_EQUAL(et2 != et1, false)
RESULT
CHECK(void setType(Type type) throw())
ExpressionTree et;
TEST_NOT_EQUAL(et.getType(), ExpressionTree::LEAF)
et.setType(ExpressionTree::LEAF);
TEST_EQUAL(et.getType(), ExpressionTree::LEAF)
RESULT
CHECK(Type getType() const throw())
ExpressionTree et;
TEST_NOT_EQUAL(et.getType(), ExpressionTree::OR)
et.setType(ExpressionTree::OR);
TEST_EQUAL(et.getType(), ExpressionTree::OR)
RESULT
CHECK(void setNegate(bool negate) throw())
ExpressionTree et;
TEST_NOT_EQUAL(et.getNegate(), true)
et.setNegate(true);
TEST_EQUAL(et.getNegate(), true)
RESULT
CHECK(bool getNegate() const throw())
ExpressionTree et;
TEST_NOT_EQUAL(et.getNegate(), true)
et.setNegate(true);
TEST_EQUAL(et.getNegate(), true)
RESULT
CHECK(void setPredicate(ExpressionPredicate* predicate) throw())
ExpressionTree et;
ExpressionPredicate* ep = new ExpressionPredicate;
TEST_NOT_EQUAL(et.getPredicate(), ep)
et.setPredicate(ep);
TEST_EQUAL(et.getPredicate(), ep)
RESULT
CHECK(ExpressionPredicate* getPredicate() const throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
TEST_NOT_EQUAL(et1.getPredicate(), ep)
ExpressionTree et2(ep, false);
TEST_EQUAL(et2.getPredicate(), ep)
RESULT
CHECK(void appendChild(const ExpressionTree* child) throw())
ExpressionTree* child1 = new ExpressionTree;
ExpressionTree* child2 = new ExpressionTree;
ExpressionTree* child3 = new ExpressionTree;
std::list<const ExpressionTree*> children;
children.push_back(child1);
children.push_back(child2);
children.push_back(child3);
ExpressionTree et(ExpressionTree::OR, children);
bool test = (et.getChildren() == children);
TEST_EQUAL(test, true)
et.appendChild(new ExpressionTree);
test = (et.getChildren() == children);
TEST_EQUAL(test, false)
RESULT
CHECK(const list<const ExpressionTree*>& getChildren() const throw())
ExpressionTree et2;
TEST_EQUAL(et2.getChildren().size(), 0)
RESULT
CHECK(ExpressionTree& operator = (const ExpressionTree& tree) throw())
ExpressionTree et1(new ExpressionPredicate, true);
ExpressionTree et2;
bool test = (et1 == et2);
TEST_NOT_EQUAL(test, true)
et2 = et1;
test = (et1 == et2);
TEST_EQUAL(test, true)
RESULT
CHECK(void clear() throw())
ExpressionTree et1(new ExpressionPredicate, true);
ExpressionTree empty, nonempty;
nonempty.setType(ExpressionTree::LEAF);
bool test = (empty == nonempty);
TEST_NOT_EQUAL(test, true)
nonempty.clear();
test = (empty == nonempty);
TEST_EQUAL(test, true)
RESULT
CHECK(BALL_CREATE(ExpressionTree))
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree* child = new ExpressionTree;
et1.setType(ExpressionTree::LEAF);
et1.setNegate(true);
et1.setPredicate(ep);
et1.appendChild(child);
ExpressionTree empty;
ExpressionTree* test = (ExpressionTree*) et1.create(false, true);
TEST_EQUAL(*test == empty, true)
delete test;
test = (ExpressionTree*) et1.create(true, false);
TEST_EQUAL(*test == et1, true)
delete test;
RESULT
CHECK(void dump(std::ostream& is = std::cout, Size depth = 0) const throw())
ExpressionPredicate* ep = new ExpressionPredicate;
ExpressionTree et1;
ExpressionTree* child = new ExpressionTree;
et1.setType(ExpressionTree::LEAF);
et1.setNegate(true);
et1.setPredicate(ep);
et1.appendChild(child);
String filename;
NEW_TMP_FILE(filename);
std::ofstream outfile(filename.c_str(), std::ios::out);
et1.dump(outfile);
outfile.close();
TEST_FILE_REGEXP(filename.c_str(), BALL_TEST_DATA_PATH(ExpressionTree_test.txt))
RESULT
////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////
END_TEST
|
