Repository navigation
Expand file tree
/
Copy pathmap_operation.cpp
More file actions
384 lines (333 loc) · 6.8 KB
/
Copy pathmap_operation.cpp
File metadata and controls
384 lines (333 loc) · 6.8 KB
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
#include "map_operation.h"
#include "HiEasyX/HiFunc.h"
#include <stdio.h>
#include <io.h>
// 初始化红石地图
RsMap InitRsMap(int w, int h)
{
RsMap map;
map.w = w;
map.h = h;
map.map = new RsObj * [h];
for (int i = 0; i < h; i++)
{
map.map[i] = new RsObj[w];
}
return map;
}
// 删除地图
void DeleteRsMap(RsMap* map)
{
if (map->map != nullptr)
{
for (int i = 0; i < map->h; i++)
{
for (int j = 0; j < map->w; j++)
{
if (map->map[i][j].pPowerList)
{
delete[] map->map[i][j].pPowerList;
map->map[i][j].pPowerList = nullptr;
}
}
delete[] map->map[i];
}
delete[] map->map;
map->map = nullptr;
}
}
// 重设地图大小
void ResizeRsMap(RsMap* map, int w, int h)
{
RsMap newmap = InitRsMap(w, h);
int old_w = map->w;
int old_h = map->h;
if (old_w > w)
{
old_w = w;
}
if (old_h > h)
{
old_h = h;
}
for (int i = 0; i < old_w; i++)
{
for (int j = 0; j < old_h; j++)
{
newmap.map[j][i] = map->map[j][i];
// 此处创建了每个物体的副本,最后再将原地图删除
// 删除地图后,物体的供电表会变成野指针,所以此处直接置空
newmap.map[j][i].pPowerList = nullptr;
newmap.map[j][i].nPowerCount = 0;
}
}
DeleteRsMap(map);
*map = newmap;
}
// 放置物品到地图
void PutObjectToRsMap(RsMap* map, int x, int y, int object_id, int direction)
{
RsObj obj;
obj.nType = object_id;
switch (object_id)
{
case RS_TORCHE:
obj.bPowered = true;
break;
case RS_RELAY:
obj.nTowards = direction;
break;
}
map->map[y][x] = obj;
}
// 得到排序好且合法的坐标(针对两个坐标使用)
void GetSortingPoint(RsMap* map, int* x1, int* y1, int* x2, int* y2)
{
// 确保x1 <= x2, y1 <= y2
if (*x1 > *x2)
{
int temp = *x1;
*x1 = *x2;
*x2 = temp;
}
if (*y1 > *y2)
{
int temp = *y1;
*y1 = *y2;
*y2 = temp;
}
// 确保坐标合法
if (*x1 < 0)
*x1 = 0;
if (*x2 >= map->w)
*x2 = map->w - 1;
if (*y1 < 0)
*y1 = 0;
if (*y2 >= map->h)
*y2 = map->h - 1;
}
void ClearRsMap(RsMap* map, int x1, int y1, int x2, int y2)
{
// 整理坐标
GetSortingPoint(map, &x1, &y1, &x2, &y2);
for (int i = y1; i <= y2; i++)
{
for (int j = x1; j <= x2; j++)
{
PutObjectToRsMap(map, j, i, RS_NULL);
}
}
}
void CopyRsMap(RsMap* pDst, RsMap* pSrc)
{
ResizeRsMap(pDst, pSrc->w, pSrc->h);
for (int i = 0; i < pSrc->w; i++)
{
for (int j = 0; j < pSrc->h; j++)
{
pDst->map[j][i] = pSrc->map[j][i];
pDst->map[j][i].pPowerList = new Power[pSrc->map[j][i].nPowerCount];
memcpy(pDst->map[j][i].pPowerList, pSrc->map[j][i].pPowerList, pSrc->map[j][i].nPowerCount * sizeof(Power));
}
}
}
// 粗略判断两个物体在显示效果上是否相等(趋于不相等)
bool isEqualEffect(RsObj obj1, RsObj obj2)
{
return (obj1.nType == obj2.nType
&& obj1.nTowards == obj2.nTowards
&& obj1.bPowered == obj2.bPowered
&& obj1.bUprightPowered == obj2.bUprightPowered
&& obj1.bHorizonPowered == obj2.bHorizonPowered);
}
void CmpRsMapForRedraw(RsMap* pOld, RsMap* pNew, POINT* pChange, int* pCount)
{
int count = 0;
POINT neighborhood[4] = { {-1,0},{1,0},{0,-1},{0,1} };
for (int i = 0; i < pNew->w; i++)
{
for (int j = 0; j < pNew->h; j++)
{
if (!isEqualEffect(pOld->map[j][i], pNew->map[j][i]))
{
// 防重
bool repeat = false;
for (int n = 0; n < count; n++)
if (pChange[n].x == i && pChange[n].y == j)
{
repeat = true;
break;
}
if (repeat)
continue;
pChange[count] = { i,j };
count++;
// 异常情况
if (count > pNew->w * pNew->h)
{
DebugBreak();
return;
}
// 由于一个物体的改变可能影响到四周的红石,所以连带邻近的红石重绘
for (int k = 0; k < 4; k++)
{
int x = i + neighborhood[k].x;
int y = j + neighborhood[k].y;
if (isInRect(x, y, { 0,0,pNew->w - 1,pNew->h - 1 }))
{
if (pNew->map[y][x].nType == RS_POWDER)
{
// 若已存在此点则不再重复
bool repeat = false;
for (int n = 0; n < count; n++)
if (pChange[n].x == x && pChange[n].y == y)
{
repeat = true;
break;
}
if (!repeat)
{
pChange[count] = { x,y };
count++;
}
}
}
}
}
}
}
*pCount = count;
}
bool LineRsMap(RsMap* map, int x1, int y1, int x2, int y2, int object)
{
// 整理坐标
GetSortingPoint(map, &x1, &y1, &x2, &y2);
if (x1 == x2)
{
for (int i = y1; i <= y2; i++)
{
PutObjectToRsMap(map, x1, i, object);
}
}
else if (y1 == y2)
{
for (int i = x1; i <= x2; i++)
{
PutObjectToRsMap(map, i, y1, object);
}
}
else
{
return false;
}
return true;
}
void ImportProject(RsMap* out, RsMap in, int x, int y)
{
for (int jo = y, ji = 0; jo < out->h && ji < in.h; jo++, ji++)
{
for (int io = x, ii = 0; io < out->w && ii < in.w; io++, ii++)
{
if (jo >= 0 && io >= 0)
{
out->map[jo][io] = in.map[ji][ii];
}
}
}
}
// 判断字符是否为数字
bool isNum(char ch)
{
return (ch >= '0' && ch <= '9') || ch == '-';
}
// 判断是否为旧版地图
// 依据:开头是数字字符,紧接着一个空格(宽 高的结构)
bool isOldMap(void* pBuf, int len)
{
char* buf = (char*)pBuf;
int i = 0;
for (; i < len && isNum(buf[i]); i++);
if (i > 0 && buf[i] == ' ')
return true;
else
return false;
}
// 打开项目
RsMap OpenProject(const WCHAR* strFileName)
{
if (!lstrlen(strFileName))
{
return RsMap{};
}
FILE* fp = nullptr;
errno_t err = _wfopen_s(&fp, strFileName, L"r+");
if (err)
{
MessageBox(nullptr, L"打开文件失败", L"ERROR", MB_OK);
return RsMap{};
}
int len = _filelength(_fileno(fp));
int* pBuf = new int[len];
ZeroMemory(pBuf, len * sizeof(int));
fread(pBuf, len * sizeof(int), 1, fp);
fclose(fp);
if (isOldMap(pBuf, len))
{
MessageBox(nullptr, L"此地图为旧版地图,需要转换为新版地图才能正常打开。", L"ERROR", MB_OK);
return RsMap{};
}
// 地图宽高
int w = pBuf[0];
int h = pBuf[1];
RsMap map = InitRsMap(w, h);
for (int i = 0; i < w; i++)
{
for (int j = 0; j < h; j++)
{
int index = i + j * w; // 元素索引
int pos = 2 + index * 3; // 实际读取位置
RsObj rsobj;
rsobj.nType = pBuf[pos];
rsobj.nTowards = pBuf[pos + 1];
rsobj.bPowered = pBuf[pos + 2];
map.map[j][i] = rsobj;
}
}
return map;
}
// 保存项目
bool SaveProject(RsMap map, const WCHAR* strFileName)
{
if (!lstrlen(strFileName))
{
return false;
}
int len = 2 + (map.w * map.h) * 3;
int* pBuf = new int[len];
ZeroMemory(pBuf, len * sizeof(int));
// 地图宽高
pBuf[0] = map.w;
pBuf[1] = map.h;
for (int i = 0; i < map.w; i++)
{
for (int j = 0; j < map.h; j++)
{
int index = i + j * map.w; // 元素索引
int pos = 2 + index * 3; // 实际读取位置
RsObj rsobj = map.map[j][i];
pBuf[pos] = rsobj.nType;
pBuf[pos + 1] = rsobj.nTowards;
pBuf[pos + 2] = rsobj.bPowered;
}
}
FILE* fp = nullptr;
errno_t err = _wfopen_s(&fp, strFileName, L"wt+");
if (err)
{
MessageBox(nullptr, L"保存失败", L"ERROR", MB_OK);
return false;
}
fwrite(pBuf, len * sizeof(int), 1, fp);
fclose(fp);
return true;
}