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
|
package ch.asynk.rustanddust.engine;
import java.util.Iterator;
import com.badlogic.gdx.utils.Pool;
import com.badlogic.gdx.math.Vector3;
public class Move extends Path implements Iterable<Vector3>
{
public class TileIterator implements Iterator<Tile>
{
private int i;
private Tile tile;
private Move move;
public TileIterator(Move move)
{
this.i = -1;
this.tile = null;
this.move = move;
}
@Override
public boolean hasNext()
{
if (tile == move.to)
return false;
return true;
}
@Override
public Tile next()
{
if (tile == move.to)
throw new java.util.NoSuchElementException();
if (tile != null) {
i += 1;
if (i < move.tiles.size())
tile = move.tiles.get(i);
else
tile = move.to;
} else
tile = move.from;
return tile;
}
@Override
public void remove()
{
throw new UnsupportedOperationException();
}
}
public enum MoveType
{
REGULAR,
SET,
ENTER,
EXIT;
}
private static final Pool<Move> movePool = new Pool<Move>()
{
@Override
protected Move newObject() {
return new Move();
}
};
public static Move get(Pawn pawn, Tile from, Tile to, Orientation orientation, Path path)
{
Move m = movePool.obtain();
m.pawn = pawn;
m.from = from;
m.to = to;
m.orientation = orientation;
if (path != null) {
m.init(path.tiles.size());
m.cost = path.cost;
m.roadMarch = path.roadMarch;
for (Tile tile : path.tiles)
m.tiles.add(tile);
} else {
m.init(0);
}
return m;
}
public static void clearPool()
{
movePool.clear();
}
public static Move getEnter(Pawn pawn, Tile to, Orientation orientation)
{
Move m = get(pawn, null, to, orientation, null);
m.type = MoveType.ENTER;
m.cost = to.costFrom(pawn, orientation);
return m;
}
public static Move getSet(Pawn pawn, Tile to, Orientation orientation)
{
Move m = get(pawn, null, to, orientation, null);
m.type = MoveType.SET;
m.cost = 0;
return m;
}
public Pawn pawn;
public Tile from;
public Tile to;
public Orientation orientation;
public MoveType type;
public Move()
{
super();
this.pawn = null;
this.from = null;
this.to = null;
this.orientation = Orientation.KEEP;
this.type = MoveType.REGULAR;
}
@Override
public void reset()
{
pawn = null;
from = null;
to = null;
orientation = Orientation.KEEP;
type = MoveType.REGULAR;
super.reset();
}
@Override
public void dispose()
{
tiles.clear();
movePool.free(this);
}
public boolean isSet()
{
return (type == MoveType.SET);
}
public boolean isEnter()
{
return (type == MoveType.ENTER);
}
public boolean isRegular()
{
return (type == MoveType.REGULAR);
}
public boolean isFinal()
{
return (type != MoveType.ENTER);
}
public int steps()
{
int steps = 0;
Tile tile = from;
Orientation o = pawn.getOrientation();
for (Tile next : tiles) {
Orientation nextO = Orientation.fromMove(tile.col, tile.row, next.col, next.row);
if (nextO != o) {
steps += 2;
o = nextO;
} else
steps += 1;
tile = next;
}
if (orientation != Orientation.fromMove(tile.col, tile.row, to.col, to.row))
steps += 2;
else
steps +=1;
return steps;
}
public Iterator<Tile> tileIterator()
{
return new TileIterator(this);
}
@Override
public String toString()
{
if (from == null)
return String.format("%s %s c:%d", to.toShort(), orientation, cost);
else
return String.format("%s->%s %s c:%d", from.toShort(), to.toShort(), orientation, cost);
}
@Override
public Iterator<Vector3> iterator()
{
return new PathIterator(pawn, from, to, orientation, tiles);
}
}
|
