blob: 6b752f28d20db1dffb52a30f0d8e6384cf0b5946 (
plain)
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
|
package bjc.dicelang.dicev2;
import bjc.utils.funcutils.ListUtils;
import java.util.ArrayList;
import java.util.List;
import java.util.function.LongPredicate;
public class CompoundDieMod extends Die {
public final Die[] dice;
public final LongPredicate compound;
public final boolean penetrate;
public CompoundDieMod(LongPredicate compound, Die... dice) {
this(compound, false, dice);
}
public CompoundDieMod(LongPredicate compound, boolean penetrate, Die... dice) {
super();
this.dice = dice;
this.compound = compound;
this.penetrate = penetrate;
}
public long[] roll() {
List<Long> lst = new ArrayList<>(5);
for(Die die : dice) {
for(long val : die.roll()) {
long res = val;
long newVal = die.rollSingle();
while(compound.test(newVal)) {
if(penetrate) newVal -= 1;
res += newVal;
newVal = die.rollSingle();
}
lst.add(res);
}
}
return ListUtils.toPrimitive(lst);
}
public long rollSingle() {
Die die = dice[0];
long newVal = die.rollSingle();
long res = newVal;
while(compound.test(newVal)) {
newVal = die.rollSingle();
if(penetrate) newVal -= 1;
res += newVal;
}
return res;
}
/* :UnoptimizableDice */
public boolean canOptimize() {
return false;
}
public long optimize() {
throw new UnsupportedOperationException("Exploding dice can't be optimized");
}
}
|
