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
|
package bjc.dicelang.dice;
import java.util.LinkedList;
import java.util.List;
import java.util.function.Predicate;
/**
* An exploding die.
*
* Represents a die list that keeps getting another added die as long as a
* condition is met.
*
* @author Ben Culkin
*/
public class ExplodingDice implements DieList {
/*
* The source die to use.
*/
private final Die source;
/*
* The conditions for exploding.
*/
private final Predicate<Long> explodeOn;
private final String explodePattern;
private final boolean explodePenetrates;
/**
* Create a new exploding die.
*
* @param src
* The source die for exploding.
* @param explode
* The condition to explode on.
*/
public ExplodingDice(final Die src, final Predicate<Long> explode) {
this(src, explode, null, false);
}
/**
* Create a new exploding die that may penetrate.
*
* @param src
* The source die for exploding.
* @param explode
* The condition to explode on.
* @param penetrate
* Whether or not for explosions to penetrate (-1 to
* exploded die).
*/
public ExplodingDice(final Die src, final Predicate<Long> explode, final boolean penetrate) {
this(src, explode, null, penetrate);
}
/**
* Create a new exploding die that may penetrate.
*
* @param src
* The source die for exploding.
* @param explode
* The condition to explode on.
* @param penetrate
* Whether or not for explosions to penetrate (-1 to
* exploded die).
* @param patt
* The string the condition came from, for printing.
*/
public ExplodingDice(final Die src, final Predicate<Long> explode, final String patt, final boolean penetrate) {
source = src;
explodeOn = explode;
explodePattern = patt;
explodePenetrates = penetrate;
}
@Override
public boolean canOptimize() {
return false;
}
@Override
public long[] optimize() {
return new long[0];
}
@Override
public long[] roll() {
final long res = source.roll();
long oldRes = res;
final List<Long> resList = new LinkedList<>();
while (explodeOn.test(oldRes)) {
oldRes = source.rollSingle();
if (explodePenetrates) {
oldRes -= 1;
}
resList.add(oldRes);
}
final long[] newRes = new long[resList.size() + 1];
newRes[0] = res;
int i = 1;
for (final long rll : resList) {
newRes[i] = rll;
i += 1;
}
return newRes;
}
@Override
public String toString() {
if (explodePattern == null) return source + (explodePenetrates ? "p" : "") + "!";
return source + (explodePenetrates ? "p" : "") + "!" + explodePattern;
}
}
|
