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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
|
package ch.asynk.tankontank.engine;
import java.util.Set;
import java.util.List;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedHashSet;
import com.badlogic.gdx.Gdx;
import com.badlogic.gdx.utils.Disposable;
import com.badlogic.gdx.graphics.Texture;
import com.badlogic.gdx.graphics.g2d.Batch;
import com.badlogic.gdx.graphics.glutils.ShapeRenderer;
import com.badlogic.gdx.utils.Pool;
import com.badlogic.gdx.math.Vector2;
import com.badlogic.gdx.math.Vector3;
import com.badlogic.gdx.math.GridPoint2;
import com.badlogic.gdx.math.Matrix4;
import ch.asynk.tankontank.engine.gfx.Image;
import ch.asynk.tankontank.engine.gfx.Animation;
import ch.asynk.tankontank.engine.gfx.animations.AnimationSequence;
import ch.asynk.tankontank.engine.gfx.animations.RunnableAnimation;
public abstract class Board implements Disposable
{
private final GridPoint2 neighbours[] = new GridPoint2[6];
protected List<ArrayList<SearchBoard.Node>> paths;
public interface TileBuilder
{
public Tile getNewTile(float cx, float cy);
}
public static class Config
{
public int cols;
public int rows;
public int x0; // bottom left x offset
public int y0; // bottom left y offset
public int w; // hex width
public int dw; // half hex : w/2
public int s; // hex side
public float dh; // hex top : s/2
public float h; // square height : s + dh
public float slope; // north-west side slope : (dh / (float) dw)
}
private final Pool<GridPoint2> gridPoint2Pool = new Pool<GridPoint2>() {
@Override
protected GridPoint2 newObject() {
return new GridPoint2();
}
};
private final Pool<Vector3> vector3Pool = new Pool<Vector3>() {
@Override
protected Vector3 newObject() {
return new Vector3();
}
};
private Config cfg;
private Tile[] tiles;
private SearchBoard searchBoard;
private Image image;
private boolean transform;
private Matrix4 prevTransform;
private Matrix4 nextTransform;
private int tileCount = 0;
private int pawnCount = 0;
private int animationCount = 0;
private final ArrayList<Animation> animations = new ArrayList<Animation>(2);
private final ArrayList<Animation> nextAnimations = new ArrayList<Animation>(2);
private final LinkedHashSet<Tile> tilesToDraw = new LinkedHashSet<Tile>();
private final LinkedHashSet<Pawn> pawnsToDraw = new LinkedHashSet<Pawn>();
protected Board(int cols, int rows)
{
for (int i = 0; i < 6; i++)
neighbours[i] = new GridPoint2(-1, -1);
searchBoard = new SearchBoard(this, cols, rows);
}
@Override
public void dispose()
{
image.dispose();
for (int i = 0; i < (cfg.cols * cfg.rows); i++)
tiles[i].dispose();
tilesToDraw.clear();
pawnsToDraw.clear();
for (int i = 0, n = nextAnimations.size(); i < n; i++)
nextAnimations.get(i).dispose();
animations.clear();
for (int i = 0, n = animations.size(); i < n; i++)
animations.get(i).dispose();
animations.clear();
}
public Board(TileBuilder tileBuilder, Config cfg, Texture texture)
{
image = new Image(texture);
this.cfg = cfg;
this.tiles = new Tile[cfg.cols * cfg.rows];
searchBoard = new SearchBoard(this, cfg.cols, cfg.rows);
int idx = 0;
boolean evenRow = true;
float y = cfg.y0 - cfg.dh + cfg.s;
for (int i = 0; i < cfg.rows; i++) {
float x = cfg.x0 + cfg.dw;
if (!evenRow) x += cfg.dw;
for ( int j = 0; j < cfg.cols; j ++) {
this.tiles[idx] = tileBuilder.getNewTile(x, y);
idx += 1;
x += cfg.w;
}
y += cfg.h;
evenRow = !evenRow;
}
for (int i = 0; i < 6; i++)
neighbours[i] = new GridPoint2(-1, -1);
}
public float getWidth()
{
return image.getWidth();
}
public float getHeight()
{
return image.getHeight();
}
public void setPosition(float x, float y)
{
image.setPosition(x, y);
if ((x != 0.0f) || (y != 0.0f)) {
transform = true;
prevTransform = new Matrix4();
nextTransform = new Matrix4();
nextTransform.translate(x, y, 0);
} else
transform = false;
}
public Tile getTile(GridPoint2 coords)
{
return getTile(coords.x, coords.y);
}
public Tile getTile(int col, int row)
{
int idx = ((col - ((row + 1) / 2))) + (row * cfg.cols);
// Gdx.app.debug("Board", " getTile: " + col + " ; " + row + " -> " + idx);
return tiles[idx];
}
public Tile getTileSafe(GridPoint2 coords)
{
return getTileSafe(coords.x, coords.y);
}
public Tile getTileSafe(int col, int row)
{
int colOffset = ((row + 1) / 2);
if ((col < colOffset) || (row < 0) || (row >= cfg.rows) || ((col - colOffset) >= cfg.cols))
return null;
return tiles[((col - colOffset)) + (row * cfg.cols)];
}
private void getAdjacentTiles(GridPoint2 coords, Tile tiles[])
{
tiles[0] = getTileSafe((coords.x - 1), coords.y);
tiles[1] = getTileSafe(coords.x, (coords.y + 1));
tiles[2] = getTileSafe((coords.x + 1), (coords.y + 1));
tiles[3] = getTileSafe((coords.x + 1), coords.y);
tiles[4] = getTileSafe(coords.x, (coords.y - 1));
tiles[5] = getTileSafe((coords.x - 1), (coords.y - 1));
}
private void buildNeighboursFor(GridPoint2 coords)
{
neighbours[0].set((coords.x - 1), coords.y);
neighbours[1].set(coords.x, (coords.y + 1));
neighbours[2].set((coords.x + 1), (coords.y + 1));
neighbours[3].set((coords.x + 1), coords.y);
neighbours[4].set(coords.x, (coords.y - 1));
neighbours[5].set((coords.x - 1), (coords.y - 1));
}
private void addPawnAnimation(Pawn pawn, AnimationSequence seq)
{
pawnsToDraw.add(pawn);
nextAnimations.add(seq);
}
private void stats()
{
boolean print = false;
if (tileCount != tilesToDraw.size()) {
tileCount = tilesToDraw.size();
print = true;
}
if (pawnCount != pawnsToDraw.size()) {
pawnCount = pawnsToDraw.size();
print = true;
}
if (animationCount != animations.size()) {
animationCount = animations.size();
print = true;
}
if (print)
Gdx.app.debug("Board", " tiles:" + tileCount + " pawns:" + pawnCount + " animations:" + animationCount);
}
public void animate(float delta)
{
Iterator<Animation> iter = animations.iterator();
while (iter.hasNext()) {
Animation a = iter.next();
Pawn p = a.getPawn();
if (a.animate(delta)) {
iter.remove();
pawnsToDraw.remove(p);
}
}
for (int i = 0, n = nextAnimations.size(); i < n; i++)
animations.add(nextAnimations.get(i));
nextAnimations.clear();
}
public void draw(Batch batch)
{
image.draw(batch);
if (transform) {
prevTransform.set(batch.getTransformMatrix());
batch.setTransformMatrix(nextTransform);
}
Iterator<Tile> tileIter = tilesToDraw.iterator();
while (tileIter.hasNext()) {
tileIter.next().draw(batch);
}
Iterator<Pawn> pawnIter = pawnsToDraw.iterator();
while (pawnIter.hasNext()) {
pawnIter.next().draw(batch);
}
if (transform)
batch.setTransformMatrix(prevTransform);
}
public void drawDebug(ShapeRenderer debugShapes)
{
stats();
if (transform) {
prevTransform.set(debugShapes.getTransformMatrix());
debugShapes.setTransformMatrix(nextTransform);
}
Iterator<Tile> iter = tilesToDraw.iterator();
while (iter.hasNext()) {
iter.next().drawDebug(debugShapes);
}
if (transform)
debugShapes.setTransformMatrix(prevTransform);
}
protected void clearPointVector(ArrayList<GridPoint2> points)
{
for (GridPoint2 point : points)
gridPoint2Pool.free(point);
points.clear();
}
private void nodesToPoints(List<SearchBoard.Node> nodes, ArrayList<GridPoint2> points)
{
int ns = nodes.size();
int ps = points.size();
if (ps > ns) {
for (int i = (ps - 1); i >= ns; i--)
gridPoint2Pool.free(points.remove(i));
} else
points.ensureCapacity(ns);
int i = 0;
for (SearchBoard.Node node : nodes) {
if (i < ps) {
points.get(i).set(node.col, node.row);
} else {
GridPoint2 point = gridPoint2Pool.obtain();
point.set(node.col, node.row);
points.add(point);
}
i += 1;
}
}
protected void buildPossibleMovesFrom(Pawn pawn, GridPoint2 coords, ArrayList<GridPoint2> moves)
{
List<SearchBoard.Node> nodes = searchBoard.possibleMovesFrom(pawn, coords.x, coords.y);
nodesToPoints(nodes, moves);
}
protected void buildPossibleTargetsFrom(Pawn pawn, GridPoint2 coords, ArrayList<GridPoint2> targets)
{
List<SearchBoard.Node> nodes = searchBoard.possibleTargetsFrom(pawn, coords.x, coords.y);
nodesToPoints(nodes, targets);
}
protected void buildMoveAssists(Pawn pawn, GridPoint2 coords, List<GridPoint2> assists)
{
assists.clear();
buildNeighboursFor(coords);
for (int i = 0; i < 6; i++) {
GridPoint2 neighbour = neighbours[i];
Tile t = getTileSafe(neighbour);
if (t != null) {
Pawn p = t.getTopPawn();
if ((p != null) && (!pawn.isEnemy(p)))
assists.add(neighbour);
}
}
}
protected void clearPointSet(Set<GridPoint2> points)
{
for (GridPoint2 point : points)
gridPoint2Pool.free(point);
points.clear();
}
private int nodesToSet(List<ArrayList<SearchBoard.Node>> nodes, Set<GridPoint2> points)
{
for (GridPoint2 point : points)
gridPoint2Pool.free(point);
points.clear();
for (ArrayList<SearchBoard.Node> path : nodes) {
for (int i = 1, n = (path.size() - 1); i < n; i++) {
SearchBoard.Node node = path.get(i);
GridPoint2 point = gridPoint2Pool.obtain();
point.set(node.col, node.row);
if (!points.add(point))
gridPoint2Pool.free(point);
}
}
return nodes.size();
}
protected int buildPossiblePaths(Pawn pawn, GridPoint2 from, GridPoint2 to, Set<GridPoint2> points)
{
paths = searchBoard.possiblePaths(pawn, from.x, from.y, to.x, to.y);
return nodesToSet(paths, points);
}
protected int possiblePathsFilterToggle(GridPoint2 coords, Set<GridPoint2> points)
{
paths = searchBoard.possiblePathsFilterToggle(coords.x, coords.y);
return nodesToSet(paths, points);
}
protected void clearCoordinateVector(ArrayList<Vector3> points)
{
for (Vector3 point : points)
vector3Pool.free(point);
points.clear();
}
protected int getCoordinatePath(Pawn pawn, int idx, ArrayList<Vector3> path, Orientation finalOrientation)
{
clearCoordinateVector(path);
Vector2 tmpCoords = new Vector2();
GridPoint2 tmpHex = gridPoint2Pool.obtain();
Vector3 p = pawn.getPosition();
Vector3 v = vector3Pool.obtain();
v.set(p.x, p.y, 0f);
Orientation prevOrientation = pawn.getOrientation();
ArrayList<SearchBoard.Node> nodes = paths.get(idx);
SearchBoard.Node prevNode = nodes.get(0);
// Gdx.app.debug("Board", "getCoordinatePath()");
// Gdx.app.debug("Board", " " + prevNode);
for (int i = 1, n = nodes.size(); i < n; i++) {
SearchBoard.Node node = nodes.get(i);
// Gdx.app.debug("Board", " " + node);
Orientation o = Orientation.fromMove(prevNode.col, prevNode.row, node.col, node.row);
if ((o != Orientation.KEEP) && (o != prevOrientation)) {
v.z = o.r();
path.add(v);
v = vector3Pool.obtain();
}
tmpHex.set(node.col, node.row);
getPawnPosAt(pawn, tmpHex, tmpCoords);
v.set(tmpCoords.x, tmpCoords.y, o.r());
path.add(v);
prevOrientation = o;
v = vector3Pool.obtain();
v.set(tmpCoords.x, tmpCoords.y, 0f);
prevNode = node;
}
if (finalOrientation != prevOrientation) {
v.z = finalOrientation.r();
path.add(v);
} else {
vector3Pool.free(v);
}
gridPoint2Pool.free(tmpHex);
// Gdx.app.debug("Board", " =>");
// for (Vector3 vector :path)
// Gdx.app.debug("Board", " " + vector);
return path.size();
}
protected boolean hasUnits(GridPoint2 coords)
{
return getTile(coords).hasUnits();
}
public boolean isOffMap(GridPoint2 coords)
{
return getTile(coords).isOffMap();
}
protected boolean isOverlayEnabledOn(GridPoint2 coords, int i)
{
return getTile(coords).isOverlayEnabled(i);
}
public void enableOverlayOn(GridPoint2 coords, int i, boolean enable)
{
Tile tile = getTile(coords);
if(tile.enableOverlay(i, enable))
tilesToDraw.add(tile);
else
tilesToDraw.remove(tile);
}
public Pawn getTopPawnAt(GridPoint2 coords)
{
return getTile(coords).getTopPawn();
}
private int pushPawnAt(Pawn pawn, GridPoint2 coords)
{
Tile tile = getTile(coords);
tilesToDraw.add(tile);
return tile.push(pawn);
}
private int removePawnFrom(Pawn pawn, GridPoint2 coords)
{
Tile tile = getTile(coords);
int n = tile.remove(pawn);
if (!tile.mustBeDrawn())
tilesToDraw.remove(tile);
return n;
}
protected Vector2 getPawnPosAt(Pawn pawn, GridPoint2 coords, Vector2 pos)
{
Vector2 center = getTile(coords).getCenter();
return pawn.getPosAt(center, pos);
}
public void setPawnAt(Pawn pawn, GridPoint2 coords, Orientation o)
{
Vector2 pos = getPawnPosAt(pawn, coords, null);
pawn.setPosition(pos.x, pos.y, o.r());
pushPawnAt(pawn, coords);
}
protected void movePawn(final Pawn pawn, ArrayList<Vector3> path, RunnableAnimation whenDone)
{
removePawnFrom(pawn, getHexAt(pawn.getCenter()));
AnimationSequence seq = pawn.getMoveAnimation(path);
seq.addAnimation(RunnableAnimation.get(pawn, new Runnable() {
@Override
public void run() {
pushPawnAt(pawn, getHexAt(pawn.getCenter()));
}
}));
seq.addAnimation(whenDone);
addPawnAnimation(pawn, seq);
}
protected void rotatePawn(final Pawn pawn, Orientation o, RunnableAnimation whenDone)
{
Vector3 p = pawn.getPosition();
Vector3 v = vector3Pool.obtain();
v.set(p.x, p.y, o.r());
AnimationSequence seq = pawn.getRotateAnimation(v);
seq.addAnimation(whenDone);
addPawnAnimation(pawn, seq);
vector3Pool.free(v);
}
public GridPoint2 getHexAt(Vector2 v)
{
if (v == null) return null;
return getHexAt(null, v.x, v.y);
}
public GridPoint2 getHexAt(Vector3 v)
{
if (v == null) return null;
return getHexAt(null, v.x, v.y);
}
public GridPoint2 getHexAt(GridPoint2 hex, float mx, float my)
{
if (hex == null) hex = new GridPoint2();
// compute row
float y = (my - cfg.y0);
int row = (int) (y / cfg.h);
boolean oddRow = ((row % 2) == 1);
if (y < 0.f) {
row = -1;
oddRow = true;
}
// compute col
float x = (mx - cfg.x0);
if (oddRow) x -= cfg.dw;
int col = (int) (x / cfg.w);
if (x < 0.f)
col = -1;
int colOffset = ((row +1) / 2);
// check upper boundaries
float dy = (y - (row * cfg.h));
if (dy > cfg.s) {
dy -= cfg.s;
float dx = (x - (col * cfg.w));
col += colOffset;
if (dx < cfg.dw) {
if ((dx * cfg.slope) < dy) {
// upper left corner
row += 1;
colOffset = ((row +1) / 2);
}
} else {
if (((cfg.w - dx) * cfg.slope) < dy) {
// upper right corner
row += 1;
col += 1;
colOffset = ((row +1) / 2);
}
}
} else
col += colOffset;
// validate hex
if ((col < colOffset) || (row < 0) || (row >= cfg.rows) || ((col - colOffset) >= cfg.cols))
hex.set(-1, -1);
else
hex.set(col, row);
// Gdx.app.debug("Board", " hex: " + hex.x + " ; " + hex.y);
return hex;
}
}
|