blob: 497f9b2e922dd1cfcf1159a6f87c1494d0460926 (
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
81
82
83
84
85
86
87
88
89
90
|
package bjc.dicelang;
/**
* Implements a "compound dice"
*
* To explain, a compound dice is something like a d100 composed from two
* d10s instead of a hundred sided die.
*
* @author ben
*
*/
public class CompoundDice implements IDiceExpression {
/*
* The left die of the expression
*/
private IDiceExpression left;
/*
* The right die of the expression
*/
private IDiceExpression right;
/**
* Create a new compound dice using the specified dice
*
* @param lft
* The die to use on the left
* @param rght
* The die to use on the right
*/
public CompoundDice(IDiceExpression lft, IDiceExpression rght) {
this.left = lft;
this.right = rght;
}
/**
* Create a new compound dice from two dice strings
*
* @param lft
* The left side dice as a string
* @param rght
* The right side dice as a string
*/
public CompoundDice(String lft, String rght) {
this(ComplexDice.fromString(lft),
ComplexDice.fromString(rght));
}
/**
* Create a new compound dice from an array of dice strings
*
* @param exps
* An array of two dice strings
*/
public CompoundDice(String[] exps) {
this(exps[0], exps[1]);
}
@Override
public boolean canOptimize() {
return left.canOptimize() && right.canOptimize();
}
@Override
public int optimize() {
if (!canOptimize()) {
throw new UnsupportedOperationException(
"Cannot optimize this compound dice. "
+ "Both component dice must be optimizable"
+ " to optimize a compound dice");
}
return Integer
.parseInt(left.optimize() + "" + right.optimize());
}
@Override
public int roll() {
/*
* Make the combination of the two dice
*/
return Integer.parseInt(left.roll() + "" + right.roll());
}
@Override
public String toString() {
return "compound[l=" + left.toString() + ", r="
+ right.toString() + "]";
}
}
|
