Files
OpenFrontIO/src/core/execution/Util.ts
T
2025-02-01 12:05:11 -08:00

70 lines
2.0 KiB
TypeScript

import { Game, Cell, Tile } from "../game/Game";
export function getSpawnCells(gs: Game, cell: Cell): Cell[] {
let result: Cell[] = [];
for (let dx = -2; dx <= 2; dx++) {
for (let dy = -2; dy <= 2; dy++) {
let c = new Cell(cell.x + dx, cell.y + dy);
if (!gs.isOnMap(c)) {
continue;
}
if (Math.abs(dx) === 2 && Math.abs(dy) === 2) {
continue;
}
if (gs.tile(c).terrain().isWater()) {
continue;
}
if (gs.tile(c).hasOwner()) {
continue;
}
result.push(c);
}
}
return result;
}
export function closestTwoTiles(x: Iterable<Tile>, y: Iterable<Tile>): { x: Tile, y: Tile } {
const xSorted = Array.from(x).sort((a, b) => a.cell().x - b.cell().x);
const ySorted = Array.from(y).sort((a, b) => a.cell().x - b.cell().x);
if (xSorted.length == 0 || ySorted.length == 0) {
return null;
}
let i = 0;
let j = 0;
let minDistance = Infinity;
let result = { x: xSorted[0], y: ySorted[0] };
while (i < xSorted.length && j < ySorted.length) {
const currentX = xSorted[i];
const currentY = ySorted[j];
const distance =
Math.abs(currentX.cell().x - currentY.cell().x) +
Math.abs(currentX.cell().y - currentY.cell().y);
if (distance < minDistance) {
minDistance = distance;
result = { x: currentX, y: currentY };
}
// If we're at the end of X, must move Y forward
if (i === xSorted.length - 1) {
j++;
}
// If we're at the end of Y, must move X forward
else if (j === ySorted.length - 1) {
i++;
}
// Otherwise, move whichever pointer has smaller x value
else if (currentX.cell().x < currentY.cell().x) {
i++;
} else {
j++;
}
}
return result;
}