summaryrefslogtreecommitdiff
path: root/dice-lang/src/bjc/dicelang/dice/SimpleDieList.java
diff options
context:
space:
mode:
authorbculkin2442 <bjculkin@mix.wvu.edu>2017-04-11 21:48:50 -0400
committerbculkin2442 <bjculkin@mix.wvu.edu>2017-04-11 21:48:50 -0400
commit57f9a3bfdad20bead5b35ee540e8790e80a6b9a4 (patch)
tree1e7184825eaa8d22077b505513df3e0d8502fb39 /dice-lang/src/bjc/dicelang/dice/SimpleDieList.java
parent675ae734dd7b7a47d93ee3527dd1eb7195be047b (diff)
Cleanup
Diffstat (limited to 'dice-lang/src/bjc/dicelang/dice/SimpleDieList.java')
-rw-r--r--dice-lang/src/bjc/dicelang/dice/SimpleDieList.java27
1 files changed, 13 insertions, 14 deletions
diff --git a/dice-lang/src/bjc/dicelang/dice/SimpleDieList.java b/dice-lang/src/bjc/dicelang/dice/SimpleDieList.java
index 7b1ac76..f382361 100644
--- a/dice-lang/src/bjc/dicelang/dice/SimpleDieList.java
+++ b/dice-lang/src/bjc/dicelang/dice/SimpleDieList.java
@@ -7,8 +7,8 @@ package bjc.dicelang.dice;
*
*/
public class SimpleDieList implements DieList {
- private Die numDice;
- private Die size;
+ private final Die numDice;
+ private final Die size;
/**
* Create a new list of dice.
@@ -19,27 +19,26 @@ public class SimpleDieList implements DieList {
* @param sze
* The size of dice in the list.
*/
- public SimpleDieList(Die nDice, Die sze) {
+ public SimpleDieList(final Die nDice, final Die sze) {
numDice = nDice;
size = sze;
}
@Override
public boolean canOptimize() {
- if(size.canOptimize() && size.optimize() <= 1)
- return numDice.canOptimize();
- else
- return false;
+ if (size.canOptimize() && size.optimize() <= 1) return numDice.canOptimize();
+
+ return false;
}
@Override
public long[] optimize() {
- int sze = (int) numDice.optimize();
- long res = size.optimize();
+ final int sze = (int) numDice.optimize();
+ final long res = size.optimize();
- long[] ret = new long[sze];
+ final long[] ret = new long[sze];
- for(int i = 0; i < sze; i++) {
+ for (int i = 0; i < sze; i++) {
ret[i] = res;
}
@@ -48,11 +47,11 @@ public class SimpleDieList implements DieList {
@Override
public long[] roll() {
- int num = (int) numDice.roll();
+ final int num = (int) numDice.roll();
- long[] ret = new long[num];
+ final long[] ret = new long[num];
- for(int i = 0; i < num; i++) {
+ for (int i = 0; i < num; i++) {
ret[i] = size.roll();
}