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
|
/*
* SPDX-FileCopyrightText: 2021-2023 The Refinery Authors <https://refinery.tools/>
*
* SPDX-License-Identifier: EPL-2.0
*/
package tools.refinery.language.semantics.internal;
import org.junit.jupiter.api.Test;
import tools.refinery.logic.term.truthvalue.TruthValue;
import tools.refinery.store.tuple.Tuple;
import java.util.LinkedHashMap;
import java.util.Map;
import static org.hamcrest.MatcherAssert.assertThat;
import static org.hamcrest.Matchers.*;
import static org.junit.jupiter.api.Assertions.assertThrows;
class DecisionTreeTests {
@Test
void initialValueTest() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.UNKNOWN));
}
@Test
void mergeValueTest() {
var sut = new DecisionTree(3, TruthValue.FALSE);
sut.mergeValue(Tuple.of(3, 4, 5), TruthValue.TRUE);
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(TruthValue.FALSE));
}
@Test
void mergeUnknownValueTest() {
var sut = new DecisionTree(3, TruthValue.FALSE);
sut.mergeValue(Tuple.of(3, 4, 5), TruthValue.UNKNOWN);
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.FALSE));
}
@Test
void mergeWildcardTest() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(3, -1, 5), TruthValue.TRUE);
sut.mergeValue(Tuple.of(-1, 4, 5), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(2, 4, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 6, 5)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(TruthValue.UNKNOWN));
}
@Test
void mergeWildcardTest2() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(-1, 4, -1), TruthValue.FALSE);
sut.mergeValue(Tuple.of(3, -1, 5), TruthValue.TRUE);
assertThat(sut.get(Tuple.of(2, 4, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 6, 5)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 5, 6)), is(TruthValue.UNKNOWN));
}
@Test
void mergeWildcardTest3() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(-1, 4, -1), TruthValue.FALSE);
sut.mergeValue(Tuple.of(3, -1, 5), TruthValue.TRUE);
sut.mergeValue(Tuple.of(-1, -1, -1), TruthValue.ERROR);
assertThat(sut.get(Tuple.of(2, 4, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 6, 5)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(TruthValue.ERROR));
assertThat(sut.get(Tuple.of(3, 5, 6)), is(TruthValue.ERROR));
}
@Test
void mergeOverUnsetTest() {
var sut = new DecisionTree(3, null);
sut.mergeValue(Tuple.of(-1, 4, 5), TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(3, -1, 5), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(2, 4, 5)), is(TruthValue.UNKNOWN));
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 6, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(nullValue()));
}
@Test
void emptyIterationTest() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
var map = iterateAll(sut, TruthValue.UNKNOWN, 2);
assertThat(map.keySet(), hasSize(0));
}
@Test
void completeIterationTest() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
var map = iterateAll(sut, TruthValue.FALSE, 2);
assertThat(map.keySet(), hasSize(8));
assertThat(map, hasEntry(Tuple.of(0, 0, 0), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(0, 0, 1), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(0, 1, 0), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(0, 1, 1), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(1, 0, 0), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(1, 0, 1), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(1, 1, 0), TruthValue.UNKNOWN));
assertThat(map, hasEntry(Tuple.of(1, 1, 1), TruthValue.UNKNOWN));
}
@Test
void mergedIterationTest() {
var sut = new DecisionTree(2, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(1, -1), TruthValue.TRUE);
sut.mergeValue(Tuple.of(-1, 2), TruthValue.FALSE);
var map = iterateAll(sut, TruthValue.UNKNOWN, 3);
assertThat(map.keySet(), hasSize(5));
assertThat(map, hasEntry(Tuple.of(0, 2), TruthValue.FALSE));
assertThat(map, hasEntry(Tuple.of(1, 0), TruthValue.TRUE));
assertThat(map, hasEntry(Tuple.of(1, 1), TruthValue.TRUE));
assertThat(map, hasEntry(Tuple.of(1, 2), TruthValue.ERROR));
assertThat(map, hasEntry(Tuple.of(2, 2), TruthValue.FALSE));
}
@Test
void sparseIterationTest() {
var sut = new DecisionTree(2, null);
sut.mergeValue(Tuple.of(0, 0), TruthValue.TRUE);
sut.mergeValue(Tuple.of(1, 1), TruthValue.FALSE);
var map = iterateAll(sut, null, 10);
assertThat(map.keySet(), hasSize(2));
assertThat(map, hasEntry(Tuple.of(0, 0), TruthValue.TRUE));
assertThat(map, hasEntry(Tuple.of(1, 1), TruthValue.FALSE));
}
@Test
void overwriteIterationTest() {
var sut = new DecisionTree(1, TruthValue.TRUE);
var overwrite = new DecisionTree(1, null);
overwrite.mergeValue(Tuple.of(0), TruthValue.UNKNOWN);
sut.overwriteValues(overwrite);
var map = iterateAll(sut, TruthValue.UNKNOWN, 2);
assertThat(map.keySet(), hasSize(1));
assertThat(map, hasEntry(Tuple.of(1), TruthValue.TRUE));
}
@Test
void overwriteNothingTest() {
var sut = new DecisionTree(2, TruthValue.UNKNOWN);
var values = new DecisionTree(2, null);
sut.overwriteValues(values);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.UNKNOWN));
}
@Test
void overwriteEverythingTest() {
var sut = new DecisionTree(2, TruthValue.FALSE);
sut.mergeValue(Tuple.of(0, 0), TruthValue.ERROR);
var values = new DecisionTree(2, TruthValue.TRUE);
sut.overwriteValues(values);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(0, 1)), is(TruthValue.TRUE));
}
@Test
void overwriteWildcardTest() {
var sut = new DecisionTree(3, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(1, 1, 1), TruthValue.FALSE);
sut.mergeValue(Tuple.of(-1, 4, 5), TruthValue.FALSE);
sut.mergeValue(Tuple.of(3, -1, 5), TruthValue.TRUE);
var values = new DecisionTree(3, null);
values.mergeValue(Tuple.of(2, 2, 2), TruthValue.TRUE);
values.mergeValue(Tuple.of(-1, 4, 5), TruthValue.UNKNOWN);
values.mergeValue(Tuple.of(3, -1, 5), TruthValue.FALSE);
sut.overwriteValues(values);
assertThat(sut.get(Tuple.of(1, 1, 1)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(2, 2, 2)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(2, 4, 5)), is(TruthValue.UNKNOWN));
assertThat(sut.get(Tuple.of(3, 4, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 6, 5)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 4, 6)), is(TruthValue.UNKNOWN));
}
@Test
void reducedValueEmptyTest() {
var sut = new DecisionTree(2, TruthValue.TRUE);
assertThat(sut.getReducedValue(), is(TruthValue.TRUE));
}
@Test
void reducedValueUnsetTest() {
var sut = new DecisionTree(2);
assertThat(sut.getReducedValue(), is(nullValue()));
}
@Test
void reducedValueNonEmptyTest() {
var sut = new DecisionTree(2, TruthValue.UNKNOWN);
sut.mergeValue(Tuple.of(1, 2), TruthValue.TRUE);
assertThat(sut.getReducedValue(), is(nullValue()));
}
@Test
void removeIntermediateChildTest() {
var sut = new DecisionTree(3, TruthValue.TRUE);
var values = new DecisionTree(3, null);
values.mergeValue(Tuple.of(1, 1, 1), TruthValue.UNKNOWN);
sut.overwriteValues(values);
sut.mergeValue(Tuple.of(1, 1, 1), TruthValue.TRUE);
assertThat(sut.get(Tuple.of(1, 1, 1)), is(TruthValue.TRUE));
assertThat(sut.getReducedValue(), is(TruthValue.TRUE));
}
@Test
void setMissingValueTest() {
var sut = new DecisionTree(2);
sut.setIfMissing(Tuple.of(0, 0), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.FALSE));
}
@Test
void setNotMissingValueTest() {
var sut = new DecisionTree(2);
sut.mergeValue(Tuple.of(0, 0), TruthValue.TRUE);
sut.setIfMissing(Tuple.of(0, 0), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.TRUE));
}
@Test
void setNotMissingDefaultValueTest() {
var sut = new DecisionTree(2, TruthValue.TRUE);
sut.setIfMissing(Tuple.of(0, 0), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.TRUE));
}
@Test
void setMissingValueWildcardTest() {
var sut = new DecisionTree(2);
sut.mergeValue(Tuple.of(-1, 0), TruthValue.TRUE);
sut.mergeValue(Tuple.of(1, -1), TruthValue.TRUE);
sut.setIfMissing(Tuple.of(0, 0), TruthValue.FALSE);
sut.setIfMissing(Tuple.of(1, 1), TruthValue.FALSE);
sut.setIfMissing(Tuple.of(2, 2), TruthValue.FALSE);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(1, 1)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(2, 2)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(2, 3)), is(nullValue()));
}
@Test
void setMissingValueInvalidTupleTest() {
var sut = new DecisionTree(2);
var tuple = Tuple.of(-1, -1);
assertThrows(IllegalArgumentException.class, () -> sut.setIfMissing(tuple, TruthValue.TRUE));
}
@Test
void setAllMissingTest() {
var sut = new DecisionTree(2);
sut.mergeValue(Tuple.of(-1, 0), TruthValue.TRUE);
sut.mergeValue(Tuple.of(1, -1), TruthValue.TRUE);
sut.mergeValue(Tuple.of(2, 2), TruthValue.TRUE);
sut.setAllMissing(TruthValue.FALSE);
assertThat(sut.get(Tuple.of(0, 0)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(2, 0)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(1, 1)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(1, 2)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(2, 2)), is(TruthValue.TRUE));
assertThat(sut.get(Tuple.of(2, 3)), is(TruthValue.FALSE));
assertThat(sut.get(Tuple.of(3, 2)), is(TruthValue.FALSE));
}
@Test
void setAllMissingEmptyTest() {
var sut = new DecisionTree(2);
sut.setAllMissing(TruthValue.TRUE);
assertThat(sut.getReducedValue(), is(TruthValue.TRUE));
}
@Test
void overwriteWildcardAllTest() {
var first = new DecisionTree(2, TruthValue.UNKNOWN);
first.mergeValue(Tuple.of(-1, -1), TruthValue.FALSE);
var second = new DecisionTree(2, null);
second.mergeValue(Tuple.of(1, -1), TruthValue.TRUE);
first.overwriteValues(second);
assertThat(first.majorityValue(), is(TruthValue.FALSE));
}
private Map<Tuple, TruthValue> iterateAll(DecisionTree sut, TruthValue defaultValue, int nodeCount) {
var cursor = sut.getCursor(defaultValue, nodeCount);
var map = new LinkedHashMap<Tuple, TruthValue>();
while (cursor.move()) {
map.put(cursor.getKey(), cursor.getValue());
}
assertThat(cursor.isDirty(), is(false));
assertThat(cursor.isTerminated(), is(true));
return map;
}
}
|
