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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
package jrummikub.model;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import sun.reflect.generics.reflectiveObjects.NotImplementedException;
import jrummikub.util.Pair;
import static jrummikub.model.StoneSet.Type.*;
/** Class managing {@link Stone}s joined together to form sets */
public class StoneSet implements Iterable<Stone>, Sizeable {
static final float VERTICAL_BORDER = 0.5f;
static final float HORIZONTAL_BORDER = 0.125f;
private List<Stone> stones;
public StoneSet(Stone stone) {
stones = Collections.singletonList(stone);
}
public StoneSet(List<Stone> stones) {
this.stones = new ArrayList<Stone>(stones);
}
public enum Type {
GROUP, RUN, INVALID
}
/**
* Test for rule conflict within the StoneSet
*
* @return true when the set is valid according to the rules
*/
public boolean isValid() {
return classify() != INVALID;
}
/**
* Test for rule conflict within the StoneSet and determine whether the set is
* a group or a run
*
* @return GROUP or RUN for valid sets, INVALID otherwise
*/
public Type classify() {
// TODO: extend this for score calculation (release 2...)
if (stones.size() < 3) {
return INVALID;
}
int nonJoker1 = -1, nonJoker2 = -1;
for (int i = 0; i < stones.size(); i++) {
if (stones.get(i).isJoker()) {
continue;
}
nonJoker2 = nonJoker1;
nonJoker1 = i;
}
if (nonJoker2 == -1) {
return GROUP;
}
// is run
if (stones.get(nonJoker1).getColor() == stones.get(nonJoker2).getColor()) {
return isValidRun(nonJoker1) ? RUN : INVALID;
}
// is group
else {
return isValidGroup() ? GROUP : INVALID;
}
}
/**
* Test for rule conflict within the StoneSet, assuming we have a run
*
* @param referencePosition
* position of stone used as reference (any non-joker stone)
*/
private boolean isValidRun(int referencePosition) {
StoneColor runColor = stones.get(referencePosition).getColor();
int startValue = stones.get(referencePosition).getValue()
- referencePosition;
int endValue = startValue + stones.size() - 1;
if (startValue < 1 || endValue > 13) {
return false;
}
for (int i = 0; i < stones.size(); i++) {
if (stones.get(i).isJoker()) {
continue;
}
if (stones.get(i).getColor() != runColor) {
// warum macht er das nicht?
return false;
}
if (stones.get(i).getValue() != i + startValue) {
return false;
}
}
return true;
}
/**
* Test for rule conflict within the StoneSet, assuming we have a group
*/
private boolean isValidGroup() {
if (stones.size() > 4) {
return false;
}
Set<StoneColor> seenColors = new HashSet<StoneColor>();
for (Stone i : stones) {
if (i.isJoker()) {
continue;
}
if (seenColors.contains(i.getColor())) {
return false;
} else {
seenColors.add(i.getColor());
}
}
return true;
}
/**
* Splits the StoneSet at a specified {@link Position} and returns two new
* Stone Sets
*
* @param position
* Splitting {@link Position}
* @return A pair of StoneSets, one for each split part
*/
public Pair<StoneSet, StoneSet> splitAt(int position) {
if (position == 0) {
return new Pair<StoneSet, StoneSet>(null, this);
} else if (position == stones.size()) {
return new Pair<StoneSet, StoneSet>(this, null);
}
StoneSet firstSet = new StoneSet(stones.subList(0, position));
StoneSet secondSet = new StoneSet(stones.subList(position, stones.size()));
return new Pair<StoneSet, StoneSet>(firstSet, secondSet);
}
/**
* Joins StoneSet to another StoneSet and returns the resulting new StoneSet
*
* @param other
* StoneSet to be joined to active StoneSet
* @return the combined StoneSet
*/
public StoneSet join(StoneSet other) {
List<Stone> joinedList = new ArrayList<Stone>();
joinedList.addAll(stones);
joinedList.addAll(other.stones);
return new StoneSet(joinedList);
}
/**
* Returns the number of stones in the set.
*
* @return number of stones
*/
public int size() {
return stones.size();
}
/**
* Returns the i-th stone of the set (starting with 0)
*
* @param i
* number of the stone to return
* @return the i-th stone
*/
public Stone get(int i) {
return stones.get(i);
}
@Override
public Iterator<Stone> iterator() {
final Iterator<Stone> it = stones.iterator();
return new Iterator<Stone>() {
@Override
public boolean hasNext() {
return it.hasNext();
}
@Override
public Stone next() {
return it.next();
}
@Override
public void remove() {
// removing stones is impossible
throw new NotImplementedException();
}
};
}
@Override
public float getWidth() {
return stones.size() + 2 * VERTICAL_BORDER;
}
@Override
public float getHeight() {
return 1 + 2 * HORIZONTAL_BORDER;
}
@Override
public String toString() {
String ret = "StoneSet[";
boolean first = true;
for (Stone stone : stones) {
if (!first)
ret += ",";
ret += stone.toString();
first = false;
}
return ret + "]";
}
}
|
