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
|
/*
* SPDX-FileCopyrightText: 2021-2023 The Refinery Authors <https://refinery.tools/>
*
* SPDX-License-Identifier: EPL-2.0
*/
package tools.refinery.language.semantics.internal;
import org.eclipse.collections.api.LazyIntIterable;
import org.eclipse.collections.api.factory.primitive.IntObjectMaps;
import org.eclipse.collections.api.map.primitive.MutableIntObjectMap;
import org.eclipse.collections.api.tuple.primitive.IntObjectPair;
import tools.refinery.store.tuple.Tuple;
import tools.refinery.logic.term.truthvalue.TruthValue;
class TerminalNode extends DecisionTreeNode {
private MutableIntObjectMap<TruthValue> children;
private DecisionTreeValue otherwise;
TerminalNode(MutableIntObjectMap<TruthValue> children, DecisionTreeValue otherwise) {
this.children = children;
this.otherwise = otherwise;
}
private DecisionTreeValue getChild(int index) {
var child = children.get(index);
return child == null ? otherwise : DecisionTreeValue.fromTruthValue(child);
}
@Override
public DecisionTreeValue getValue(int level, Tuple tuple) {
assertLevel(level);
return getChild(tuple.get(level));
}
@Override
public DecisionTreeNode deepCopy() {
return new TerminalNode(IntObjectMaps.mutable.ofAll(children), otherwise);
}
@Override
public void mergeValue(int level, Tuple tuple, TruthValue value) {
assertLevel(level);
super.mergeValue(level, tuple, value);
}
@Override
protected void mergeAllValues(int nextLevel, Tuple tuple, TruthValue value) {
otherwise = DecisionTreeValue.fromTruthValue(otherwise.merge(value));
children = IntObjectMaps.mutable.from(children.keyValuesView(), IntObjectPair::getOne,
pair -> pair.getTwo().merge(value));
reduceChildren();
}
@Override
protected void mergeSingleValue(int key, int nextLevel, Tuple tuple, TruthValue value) {
var newChild = getChild(key).merge(value);
if (otherwise.getTruthValue() == newChild) {
children.remove(key);
} else {
children.put(key, newChild);
}
}
@Override
public void setIfMissing(int level, Tuple tuple, TruthValue value) {
assertLevel(level);
super.setIfMissing(level, tuple, value);
}
@Override
protected void doSetIfMissing(int key, int nextLevel, Tuple tuple, TruthValue value) {
if (otherwise == DecisionTreeValue.UNSET) {
children.getIfAbsentPut(key, value);
}
}
@Override
public void setAllMissing(TruthValue value) {
if (otherwise == DecisionTreeValue.UNSET) {
otherwise = DecisionTreeValue.fromTruthValue(value);
reduceChildren();
}
}
@Override
public void overwriteValues(DecisionTreeNode values) {
if (!(values instanceof TerminalNode terminalValues)) {
throw new IllegalArgumentException("Level mismatch");
}
otherwise = otherwise.overwrite(terminalValues.otherwise);
children = IntObjectMaps.mutable.from(children.keyValuesView(), IntObjectPair::getOne,
pair -> terminalValues.getChild(pair.getOne()).getTruthValueOrElse(pair.getTwo()));
for (var pair : terminalValues.children.keyValuesView()) {
children.getIfAbsentPut(pair.getOne(), pair.getTwo());
}
reduceChildren();
}
private void reduceChildren() {
var iterator = children.iterator();
while (iterator.hasNext()) {
var child = iterator.next();
if (otherwise.getTruthValue() == child) {
iterator.remove();
}
}
}
@Override
public boolean moveNext(int level, DecisionTreeCursor cursor) {
assertLevel(level);
return super.moveNext(level, cursor);
}
@Override
protected DecisionTreeValue getOtherwiseReducedValue() {
return getMajorityValue();
}
@Override
protected LazyIntIterable getChildKeys() {
return children.keysView();
}
@Override
public DecisionTreeValue getMajorityValue() {
return otherwise;
}
@Override
protected boolean moveNextSparse(int level, DecisionTreeCursor cursor, int startIndex, int[] sortedChildren) {
if (startIndex >= sortedChildren.length) {
return false;
}
var key = sortedChildren[startIndex];
cursor.iterationState[level] = startIndex;
cursor.rawTuple[level] = key;
cursor.value = getChild(key);
return true;
}
@Override
protected boolean moveNextDense(int level, DecisionTreeCursor cursor, int startIndex) {
if (startIndex >= cursor.nodeCount) {
return false;
}
cursor.iterationState[level] = startIndex;
cursor.rawTuple[level] = startIndex;
cursor.value = getChild(startIndex);
return true;
}
private static void assertLevel(int level) {
if (level != 0) {
throw new IllegalArgumentException("Invalid decision tree level: " + level);
}
}
}
|
