blob: 30bda51ebb785d1055b9024b5b48d103d88ebdbe (
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
|
package jrummikub.model;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Set;
import jrummikub.util.Pair;
/**
* Mock class for {@link Hand}
*/
public class MockHand implements IHand {
/** */
public List<Pair<Stone, Position>> stones = new ArrayList<Pair<Stone, Position>>();
/** */
public Set<Stone> pickups = new HashSet<Stone>();
/** */
public Iterable<Pair<Stone, Position>> iterable;
@Override
public void drop(Stone object, Position position) {
stones.add(new Pair<Stone, Position>(object, position));
}
@Override
public Position getPosition(Stone object) {
// TODO Auto-generated method stub
return null;
}
@Override
public boolean pickUp(Stone object) {
List<Pair<Stone, Position>> itList = new ArrayList<Pair<Stone, Position>>(
stones);
for (Pair<Stone, Position> entry : itList) {
if (entry.getFirst() == object) {
stones.remove(entry);
pickups.add(object);
return true;
}
}
return false;
}
@Override
public int getSize() {
return stones.size();
}
@Override
public Iterator<Pair<Stone, Position>> iterator() {
if (iterable != null) {
return iterable.iterator();
} else {
return stones.iterator();
}
}
public MockHand clone() {
try {
return (MockHand) super.clone();
} catch (CloneNotSupportedException e) {
return null;
}
}
@Override
public int getRowCount() {
return 0;
}
@Override
public int getFreeRowSpace(int row) {
// TODO Auto-generated method stub
return 0;
}
}
|
