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
|
package bjc.dicelang.v1.ast;
import java.util.function.BinaryOperator;
import bjc.dicelang.v1.ast.nodes.IDiceASTNode;
import bjc.dicelang.v1.ast.nodes.OperatorDiceNode;
import bjc.utils.data.IPair;
import bjc.utils.data.ITree;
import bjc.utils.data.Pair;
import bjc.utils.funcdata.IList;
import bjc.utils.data.Tree;
/**
* Responsible for collapsing arithmetic operators
*
* @author ben
*
*/
final class ArithmeticCollapser implements IOperatorCollapser {
// The type of operator we're collapsing
private OperatorDiceNode type;
// The operator to use to collapse operators
private BinaryOperator<Integer> valueOp;
private int initialValue;
public ArithmeticCollapser(OperatorDiceNode type,
BinaryOperator<Integer> valueOp, int initVal) {
this.type = type;
this.valueOp = valueOp;
this.initialValue = initVal;
}
@Override
public IPair<IResult, ITree<IDiceASTNode>> apply(
IList<IPair<IResult, ITree<IDiceASTNode>>> nodes) {
IPair<IResult, ITree<IDiceASTNode>> initialState = new Pair<>(
new IntegerResult(initialValue), new Tree<>(type));
BinaryOperator<IPair<IResult, ITree<IDiceASTNode>>> reducer = (
currentState, accumulatedState) -> {
// Force evaluation of accumulated state to prevent
// certain bugs from occuring
// accumulatedState.merge((l, r) -> null);
return reduceStates(accumulatedState, currentState);
};
IPair<IResult, ITree<IDiceASTNode>> reducedState = nodes
.reduceAux(initialState, reducer, (state) -> state);
return reducedState;
}
private IList<IResult> combineArrayResults(IResult accumulatedValue,
IResult currentValue) {
IList<IResult> currentList = ((ArrayResult) currentValue)
.getValue();
IList<IResult> accumulatedList = ((ArrayResult) accumulatedValue)
.getValue();
if (currentList.getSize() != accumulatedList.getSize()) {
throw new UnsupportedOperationException(
"Can only apply operations to equal-length arrays");
}
IList<IResult> resultList = currentList.combineWith(
accumulatedList, (currentNode, accumulatedNode) -> {
boolean currentNotInt = currentNode
.getType() != ResultType.INTEGER;
boolean accumulatedNotInt = accumulatedNode
.getType() != ResultType.INTEGER;
if (currentNotInt || accumulatedNotInt) {
throw new UnsupportedOperationException(
"Nesting of array operations isn't allowed");
}
int accumulatedInt = ((IntegerResult) accumulatedNode)
.getValue();
int currentInt = ((IntegerResult) currentNode)
.getValue();
IResult combinedValue = new IntegerResult(
valueOp.apply(accumulatedInt, currentInt));
return combinedValue;
});
return resultList;
}
private IPair<IResult, ITree<IDiceASTNode>> doArithmeticCollapse(
IResult accumulatedValue, ITree<IDiceASTNode> accumulatedTree,
IResult currentValue) {
if (accumulatedValue.getType() == ResultType.DUMMY
|| currentValue.getType() == ResultType.DUMMY) {
DummyResult result = new DummyResult(
"Found dummy result with either accumulated dummy ("
+ ((DummyResult) accumulatedValue).getData()
+ ") or current dummy ("
+ ((DummyResult) currentValue).getData()
+ ").");
return new Pair<>(result, accumulatedTree);
}
boolean currentIsInt = currentValue
.getType() == ResultType.INTEGER;
boolean accumulatedIsInt = accumulatedValue
.getType() == ResultType.INTEGER;
if (!currentIsInt) {
if (!accumulatedIsInt) {
IList<IResult> resultList = combineArrayResults(
accumulatedValue, currentValue);
return new Pair<>(new ArrayResult(resultList),
accumulatedTree);
}
IList<IResult> resultList = halfCombineLists(
((ArrayResult) currentValue).getValue(),
accumulatedValue, true);
return new Pair<>(new ArrayResult(resultList),
accumulatedTree);
} else if (!accumulatedIsInt) {
IList<IResult> resultList = halfCombineLists(
((ArrayResult) accumulatedValue).getValue(),
currentValue, false);
return new Pair<>(new ArrayResult(resultList),
accumulatedTree);
}
int accumulatedInt = ((IntegerResult) accumulatedValue).getValue();
int currentInt = ((IntegerResult) currentValue).getValue();
int combinedValue = valueOp.apply(accumulatedInt, currentInt);
return new Pair<>(new IntegerResult(combinedValue),
accumulatedTree);
}
private IList<IResult> halfCombineLists(IList<IResult> list,
IResult scalar, boolean scalarLeft) {
if (scalar.getType() != ResultType.INTEGER) {
throw new UnsupportedOperationException(
"Nested array operations not supported");
}
int scalarInt = ((IntegerResult) scalar).getValue();
return list.map((element) -> {
if (element.getType() != ResultType.INTEGER) {
throw new UnsupportedOperationException(
"Nested array operations not supported");
}
int elementInt = ((IntegerResult) element).getValue();
IResult combinedValue;
if (scalarLeft) {
combinedValue = new IntegerResult(
valueOp.apply(scalarInt, elementInt));
} else {
combinedValue = new IntegerResult(
valueOp.apply(elementInt, scalarInt));
}
return combinedValue;
});
}
private IPair<IResult, ITree<IDiceASTNode>> reduceStates(
IPair<IResult, ITree<IDiceASTNode>> accumulatedState,
IPair<IResult, ITree<IDiceASTNode>> currentState) {
return accumulatedState
.bind((accumulatedValue, accumulatedTree) -> {
return currentState
.bind((currentValue, currentTree) -> {
accumulatedTree.addChild(currentTree);
return doArithmeticCollapse(
accumulatedValue, accumulatedTree,
currentValue);
});
});
}
}
|
