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
|
/*
* SPDX-FileCopyrightText: 2021-2023 The Refinery Authors <https://refinery.tools/>
*
* SPDX-License-Identifier: EPL-2.0
*/
package tools.refinery.language.semantics.model.internal;
import org.eclipse.collections.api.factory.primitive.IntObjectMaps;
import tools.refinery.store.map.Cursor;
import tools.refinery.store.tuple.Tuple;
import tools.refinery.store.representation.TruthValue;
public class DecisionTree {
private final int levels;
private final DecisionTreeNode root;
public DecisionTree(int levels, TruthValue initialValue) {
this.levels = levels;
DecisionTreeNode node = new TerminalNode(IntObjectMaps.mutable.empty(),
DecisionTreeValue.fromTruthValue(initialValue));
for (int level = 1; level < levels; level++) {
node = new IntermediateNode(IntObjectMaps.mutable.empty(), node);
}
root = node;
}
public DecisionTree(int levels) {
this(levels, null);
}
public TruthValue get(Tuple tuple) {
return root.getValue(levels - 1, tuple).getTruthValue();
}
public void mergeValue(Tuple tuple, TruthValue truthValue) {
if (truthValue != null) {
root.mergeValue(levels - 1, tuple, truthValue);
}
}
public void setIfMissing(Tuple tuple, TruthValue truthValue) {
if (truthValue != null) {
root.setIfMissing(levels - 1, tuple, truthValue);
}
}
public void setAllMissing(TruthValue truthValue) {
if (truthValue != null) {
root.setAllMissing(truthValue);
}
}
public void overwriteValues(DecisionTree values) {
root.overwriteValues(values.root);
}
public TruthValue getReducedValue() {
var reducedValue = root.getReducedValue();
return reducedValue == null ? null : reducedValue.getTruthValue();
}
public Cursor<Tuple, TruthValue> getCursor(TruthValue defaultValue, int nodeCount) {
return new DecisionTreeCursor(levels, defaultValue, nodeCount, root);
}
}
|