blob: a9fc644a5093a2b246c43baf878f2d41c1b0eb63 (
plain) (
blame)
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
|
/*
* SPDX-FileCopyrightText: 2021-2023 The Refinery Authors <https://refinery.tools/>
*
* SPDX-License-Identifier: EPL-2.0
*/
package tools.refinery.language.semantics.model.internal;
import tools.refinery.store.map.Cursor;
import tools.refinery.store.representation.TruthValue;
import tools.refinery.store.tuple.Tuple;
import java.util.ArrayDeque;
import java.util.Deque;
class DecisionTreeCursor implements Cursor<Tuple, TruthValue> {
static final int STATE_FINISH = Integer.MAX_VALUE;
private final int levels;
final DecisionTreeValue defaultValue;
final int nodeCount;
private final DecisionTreeNode root;
final int[][] sortedChildren;
final int[] iterationState;
final int[] rawTuple;
final Deque<DecisionTreeNode> path = new ArrayDeque<>();
private Tuple key;
DecisionTreeValue value = DecisionTreeValue.UNSET;
private boolean terminated;
public DecisionTreeCursor(int levels, TruthValue defaultValue, int nodeCount, DecisionTreeNode root) {
this.levels = levels;
this.defaultValue = DecisionTreeValue.fromTruthValue(defaultValue);
this.nodeCount = nodeCount;
this.root = root;
sortedChildren = new int[levels][];
iterationState = new int[levels];
for (int i = 0; i < levels; i++) {
iterationState[i] = STATE_FINISH;
}
rawTuple = new int[levels];
}
@Override
public Tuple getKey() {
return key;
}
@Override
public TruthValue getValue() {
return value.getTruthValue();
}
@Override
public boolean isTerminated() {
return terminated;
}
@Override
public boolean move() {
while (moveOne()) {
if (!value.equals(defaultValue)) {
return true;
}
}
return false;
}
private boolean moveOne() {
boolean found = false;
if (path.isEmpty() && !terminated) {
found = root.moveNext(levels - 1, this);
}
while (!found && !path.isEmpty()) {
int level = levels - path.size();
found = path.peek().moveNext(level, this);
}
if (!found) {
key = null;
value = DecisionTreeValue.UNSET;
terminated = true;
return false;
}
key = Tuple.of(rawTuple);
return true;
}
}
|
