summaryrefslogtreecommitdiff
path: root/dice-lang/src/bjc/dicelang/v2/dice/ExplodingDice.java
blob: 40ff1e034b166c68c7d09fe3634386a70740e730 (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
package bjc.dicelang.v2.dice;

import java.util.LinkedList;
import java.util.List;
import java.util.function.Predicate;

public class ExplodingDice implements DieList {
	private Die             source;

	private Predicate<Long> explodeOn;
	private String          explodePattern;
	private boolean         explodePenetrates;

	public ExplodingDice(Die src, Predicate<Long> explode) {
		this(src, explode, null, false);
	}

	public ExplodingDice(Die src, Predicate<Long> explode, boolean penetrate) {
		this(src, explode, null, penetrate);
	}

	public ExplodingDice(Die src, Predicate<Long> explode, String patt,
			boolean penetrate) {
		source            = src;
		explodeOn         = explode;
		explodePattern    = patt;
		explodePenetrates = penetrate;
	}

	public boolean canOptimize() {
		return false;
	}

	public long[] optimize() {
		return new long[0];
	}

	public long[] roll() {
		long res = source.roll();
		long oldRes = res;

		List<Long> resList = new LinkedList<>();

		while(explodeOn.test(oldRes)) {
			oldRes = source.rollSingle();

			if(explodePenetrates) oldRes -= 1;
			resList.add(oldRes);
		}

		long[] newRes = new long[resList.size() + 1];
		newRes[0] = res;

		int i = 1;
		for(long rll : resList) {
			newRes[i] = rll;
			i         += 1;
		}

		return newRes;
	}

	public String toString() {
		if(explodePattern == null) {
			return source + (explodePenetrates ? "p" : "") + "!";
		} else {
			return source + (explodePenetrates ? "p" : "") + "!" + explodePattern;
		}
	}
}