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
|
/**
* @module Map
*/
import { Ball } from "./Ball";
import { DELETE_FROM_BALLS, MAP_HEIGHT, MAP_WIDTH } from "./consts";
import { Graph } from "./pathfinder/Graph";
import { clearTd } from "./ui";
/** @internal */
export interface BallsArray<T> extends Array<T> {
clear: () => void;
}
/**
* Finds ball that should be deleted
* @param balls - array of {@linkcode Ball}
* @return Balls to remove
*/
export function findToRemove(balls: Ball[]): BallsArray<Ball> {
const out = new Set<Ball>()
for (const ball of balls) {
const xNeighbours = new Set<Ball>();
for (let x = ball.x; x < MAP_HEIGHT; x++) {
const b = balls.find(b => b.y === ball.y && b.x === x && b.color === ball.color);
if (!b) break;
xNeighbours.add(b)
}
for (let x = ball.x - 1; x >= 0; x--) {
const b = balls.find(b => b.y === ball.y && b.x === x && b.color === ball.color)
if (!b) break;
xNeighbours.add(b)
}
const yNeighbours = new Set<Ball>();
for (let y = ball.y; y < MAP_WIDTH; y++) {
const b = balls.find(b => b.x === ball.x && b.y === y && b.color === ball.color);
if (!b) break;
yNeighbours.add(b)
}
for (let y = ball.y - 1; y >= 0; y--) {
const b = balls.find(b => b.x === ball.x && b.y === y && b.color === ball.color)
if (!b) break;
yNeighbours.add(b)
}
// same(Sign)XYNeigbours
const sxyNeighbours = new Set<Ball>();
for (let x = ball.x, y = ball.y; x >= 0 && y >= 0; x--, y--) {
const b = balls.find(b => b.x === x && b.y === y && b.color === ball.color)
if (!b) break;
sxyNeighbours.add(b)
}
for (let x = ball.x + 1, y = ball.y + 1; x < MAP_HEIGHT && y < MAP_WIDTH; x--, y--) {
const b = balls.find(b => b.x === x && b.y === y && b.color === ball.color)
if (!b) break;
sxyNeighbours.add(b)
}
// diffrent(Sign)XYNeigbours
const dxyNeighbours = new Set<Ball>();
for (let x = ball.x, y = ball.y; x >= 0 && y < MAP_WIDTH; x--, y++) {
const b = balls.find(b => b.x === x && b.y === y && b.color === ball.color)
if (!b) break;
dxyNeighbours.add(b)
}
for (let x = ball.x + 1, y = ball.y - 1; x >= 0 && y >= 0; x++, y--) {
const b = balls.find(b => b.x === x && b.y === y && b.color === ball.color)
if (!b) break;
dxyNeighbours.add(b)
}
const sets = [xNeighbours, yNeighbours, sxyNeighbours, dxyNeighbours]
for (const s of sets) {
if (s.size >= DELETE_FROM_BALLS) s.forEach(b => out.add(b))
}
}
const rout = [...out] as BallsArray<Ball>;
rout.clear = function() {
this.forEach(b => clearTd(b.td))
}
return rout;
}
/** Array of array of balls */
export type Map = (Ball | null)[][];
/**
* Function that generates map (Array of Arrays) of balls from arrays of balls. Empty spots are null
* @param balls - array of {@linkcode Ball}
*/
export function genMap(balls: Array<Ball>): Map {
const map = <Map>[];
for (let i = 0; i < MAP_HEIGHT; i++) {
map.push([]);
for (let j = 0; j < MAP_WIDTH; j++) {
map[i].push(null);
}
}
for (const b of balls) {
map[b.x][b.y] = b
}
return map;
}
/**
* Object of coordinates
*/
export type Coord = { x: number; y: number };
/**
* Function that converts map to {@link Graph}
* @param map - map to be converted
* @param start - start of search
* @param goal - finsish of search
*/
export function genGraph(map: Map, start: Coord, goal: Coord): Graph {
const graph: Graph = [];
map.forEach((row, i) => {
row.forEach((b, j) => {
graph.push({
start: i === start.x && j === start.y,
goal: i === goal.x && j === goal.y,
walkable: b === null,
uuid: uuidv4(),
graph,
x: i,
y: j,
edges: [],
});
});
});
map.forEach((row, i) => {
row.forEach((_, j) => {
const vertex = graph.find(v => v.x === i && v.y === j);
if (!vertex) return;
const n1 = graph.find(v => v.x === i - 1 && v.y === j);
const n2 = graph.find(v => v.x === i + 1 && v.y === j);
const n3 = graph.find(v => v.x === i && v.y === j - 1);
const n4 = graph.find(v => v.x === i && v.y === j + 1);
for (const n of [n1, n2, n3, n4]) {
if (n) {
vertex.edges.push({
from: vertex,
to: n,
weight: 1,
});
}
}
});
});
return graph;
}
/** Generates UUID4 */
function uuidv4() {
// @ts-ignore
return ([1e7] + -1e3 + -4e3 + -8e3 + -1e11).replace(/[018]/g, c =>
(c ^ crypto.getRandomValues(new Uint8Array(1))[0] & 15 >> c / 4).toString(16)
);
}
|
