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
|
package bjc.dicelang.dicev2;
import java.util.Random;
import java.util.function.IntSupplier;
public class ComputedDie extends Die {
public final IntSupplier numDice;
public final IntSupplier numSides;
public final boolean rerollSides;
public ComputedDie(IntSupplier numDice, IntSupplier numSides) {
this(numDice, numSides, false);
}
public ComputedDie(IntSupplier numDice, IntSupplier numSides, boolean rerollSides) {
super();
this.numDice = numDice;
this.numSides = numSides;
this.rerollSides = rerollSides;
}
public ComputedDie(Random rnd, IntSupplier numDice, IntSupplier numSides) {
this(rnd, numDice, numSides, false);
}
public ComputedDie(Random rnd, IntSupplier numDice, IntSupplier numSides, boolean rerollSides) {
super(rnd);
this.numDice = numDice;
this.numSides = numSides;
this.rerollSides = rerollSides;
}
public long[] roll() {
int target = numDice.getAsInt();
int sides = numSides.getAsInt();
long[] res = new long[target];
for(int i = 0; i < target; i++) {
res[i] = rng.nextInt(sides) + 1;
if(rerollSides) sides = numSides.getAsInt();
}
return res;
}
public long rollSingle() {
return rng.nextInt(numSides.getAsInt());
}
/*
* @NOTE
*
* :UnoptimizableDice
*
* Here, we assume that we can't optimize because we have no way
* of knowing that our suppliers will always return the same
* thing. As a matter of fact, they almost always will have that
* behavior, otherwise you wouldn't need ComputedDie.
*/
public boolean canOptimize() {
return false;
}
public long optimize() {
throw new UnsupportedOperationException("ComputedDie cannot be optimized");
}
}
|
