blob: b3c5fbe996f0f9fbff55fb2fa59388ddef65b6bb (
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
91
92
93
94
95
96
97
98
99
100
101
102
|
package jrummikub.model;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.Random;
/**
* StoneHeap creates all {@link Stone}s for a game, manages them and allows
* players to draw one or more random Stones.
*/
public class StoneHeap {
List<Stone> heap;
private Random generator = new Random();
/**
* Creates 106 Stones according to standard rules
*
* @param gameSettings
* (for number of sets/jokers, colors etc.)
* */
public StoneHeap(GameSettings gameSettings) {
heap = new ArrayList<Stone>();
for (int i = 1; i <= gameSettings.getHighestValue(); i++) {
for (int j = 0; j < gameSettings.getStoneSetNumber(); j++) {
for (StoneColor c : gameSettings.getStoneColors()) {
heap.add(new Stone(i, c));
}
}
}
// Joker
ArrayList<StoneColor> jokerColors = new ArrayList<StoneColor>(
Arrays.asList(StoneColor.values()));
jokerColors.retainAll(gameSettings.getStoneColors());
if (jokerColors.size() >= 4) {
StoneColor temp = jokerColors.get(1);
jokerColors.set(1, jokerColors.get(3));
jokerColors.set(3, temp);
}
int jokersLeft = gameSettings.getJokerNumber();
done: while (true) {
for (StoneColor c : jokerColors) {
if (jokersLeft == 0)
break done;
heap.add(new Stone(c));
jokersLeft--;
}
}
}
/**
* Removes random {@link Stone} from the heap and returns it
*
* @return the drawn stone
*/
public Stone drawStone() {
if (heap.isEmpty()) {
return null;
}
return heap.remove(generator.nextInt(heap.size()));
}
/**
* Removes several {@link Stone}s from the heap and returns them
*
* @param number
* number of requested Stones
* @return list of drawn stones
*/
public List<Stone> drawStones(int number) {
List<Stone> drawnStones = new ArrayList<Stone>();
number = Math.min(number, heap.size());
for (int i = 0; i < number; i++) {
drawnStones.add(drawStone());
}
return drawnStones;
}
/**
* Get the number of stones left
*
* @return number of stones on the heap
*/
public int getSize() {
return heap.size();
}
/**
* Put stones back on the heap
*
* @param stones
* collection of stones to put back
*/
public void putBack(Collection<Stone> stones) {
heap.addAll(stones);
}
}
|
