-
Notifications
You must be signed in to change notification settings - Fork 0
/
globals.c
270 lines (235 loc) · 6.07 KB
/
globals.c
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
#include <assert.h>
#include <math.h>
#include <time.h>
#include <unistd.h>
#include <stdlib.h>
#include "globals.h"
long int now() {
return clock() / (CLOCKS_PER_SEC / 1000);
}
point normalize(point p) {
while (p.row < rows) p.row += rows;
p.row %= rows;
while (p.col < cols) p.col += cols;
p.col %= cols;
return p;
}
point add_points(point p1, point p2) {
p1.row += p2.row;
p1.col += p2.col;
return normalize(p1);
}
int points_equal(point p1, point p2) {
return ((p1.row == p2.row) && (p1.col == p2.col));
}
int point_is_origin(point p) {
return ((p.row == 0) && (p.col == 0));
}
void foreach_point(void (*f)(point)) {
point p;
for (p.row = 0; p.row < rows; p.row++) {
for (p.col = 0; p.col < cols; p.col++) {
f(p);
}
}
}
void foreach_point_within_manhattan_distance(point p, int distance, void (*f)(point)) {
point d;
int rows_scanned, cols_scanned;
for (d.row = -distance, rows_scanned = 0; d.row <= distance && rows_scanned < rows; d.row++, rows_scanned++) {
for (d.col = -distance, cols_scanned = 0; d.col <= distance && cols_scanned < cols; d.col++, cols_scanned++) {
f(add_points(p, d));
}
}
}
void foreach_point_within_radius2(point p, int radius2, void (*f)(point)) {
int radius = ceil(sqrt(radius2));
point d, p2;
for (d.row = -radius; d.row <= radius; d.row++) {
for (d.col = -radius; d.col <= radius; d.col++) {
p2 = add_points(p, d);
if (distance2(p, p2) <= radius2) {
f(p2);
}
}
}
}
void foreach_neighbor(point p, void (*f)(point, int, point)) {
int dir;
for (dir = 1; dir <= STAY; dir *= 2) {
f(p, dir, neighbor(p, dir));
}
}
char *point_callback_to_string(char (*f)(point)) {
static char buffer[MAX_ROWS * (MAX_COLS + 1)];
char *output = buffer;
point p;
for (p.row = 0; p.row < rows; p.row++) {
for (p.col = 0; p.col < cols; p.col++) {
*output++ = f(p);
}
*output++ = '\n';
}
*--output = '\0';
return buffer;
}
int abs(int x) {
return (x >= 0) ? x : -x;
}
// int distance2(int row1, int col1, int row2, int col2) {
// int dr, dc;
// int abs1, abs2;
//
// abs1 = abs(row1 - row2);
// abs2 = rows - abs(row1 - row2);
//
// dr = (abs1 < abs2) ? abs1 : abs2;
//
// abs1 = abs(col1 - col2);
// abs2 = cols - abs(col1 - col2);
//
// dc = (abs1 < abs2) ? abs1 : abs2;
//
// return dr * dr + dc * dc;
// }
int distance2(point p1, point p2) {
int dr, dc;
int abs1, abs2;
abs1 = abs(p1.row - p2.row);
abs2 = rows - abs(p1.row - p2.row);
dr = (abs1 < abs2) ? abs1 : abs2;
abs1 = abs(p1.col - p2.col);
abs2 = cols - abs(p1.col - p2.col);
dc = (abs1 < abs2) ? abs1 : abs2;
return dr * dr + dc * dc;
}
point neighbor(point p, char dir) {
switch (dir) {
case NORTH:
p.row -= 1;
return normalize(p);
case SOUTH:
p.row += 1;
return normalize(p);
case EAST:
p.col += 1;
return normalize(p);
case WEST:
p.col -= 1;
return normalize(p);
case STAY:
return p;
}
assert(0);
}
int left(int dir) {
switch (dir) {
case NORTH:
return WEST;
case SOUTH:
return EAST;
case EAST:
return NORTH;
case WEST:
return SOUTH;
}
assert(0);
}
int right(int dir) {
switch (dir) {
case NORTH:
return EAST;
case SOUTH:
return WEST;
case EAST:
return SOUTH;
case WEST:
return NORTH;
}
assert(0);
}
int backward(int dir) {
switch (dir) {
case NORTH:
return SOUTH;
case SOUTH:
return NORTH;
case EAST:
return WEST;
case WEST:
return EAST;
case STAY:
return STAY;
}
assert(0);
}
char dir2char(int dir) {
switch (dir) {
case NORTH:
return 'N';
case SOUTH:
return 'S';
case EAST:
return 'E';
case WEST:
return 'W';
case STAY:
return 'X';
}
return '?';
}
// int normalize_row(int row) {
// while (row < rows) row += rows;
// return row % rows;
// }
//
// int normalize_col(int col) {
// while (col < cols) col += cols;
// return col % cols;
// }
void init_log() {
#ifdef DEBUG
time_t rawtime = time(0);
struct tm *timeinfo = localtime(&rawtime);
char filename[256], timestamp[256];
strftime(timestamp, 256, "%Y-%m-%d_%H:%M:%S", timeinfo);
sprintf(filename, "logs/game.%s.%i.log", timestamp, getpid());
logfile = fopen(filename, "w");
char *write_buffer = malloc(10 * 1024 * 1024);
setbuffer(logfile, write_buffer, sizeof(write_buffer));
#endif
}
void logs(char *s) {
#ifdef DEBUG
fprintf(logfile, "%s\n", s);
#endif
}
#ifdef UNIT_TESTS
int main(int argc, char *argv[]) {
rows = 10;
cols = 10;
assert(normalize((point){0, -2}).col == 8);
assert(normalize((point){0, -1}).col == 9);
assert(normalize((point){0, 0}).col == 0);
assert(normalize((point){0, 1}).col == 1);
assert(normalize((point){0, 9}).col == 9);
assert(normalize((point){0, 11}).col == 1);
assert(distance2((point){0, 0}, (point){-1, -1}) == 2);
assert(distance2((point){0, 0}, (point){ 0, 0}) == 0);
assert(distance2((point){0, 0}, (point){ 0, 1}) == 1);
assert(distance2((point){0, 0}, (point){ 0, 2}) == 4);
assert(distance2((point){0, 0}, (point){ 2, 2}) == 8);
assert(distance2((point){0, 0}, (point){ 9, 9}) == 2);
point p;
p = neighbor((point){0, 0}, NORTH);
assert(p.row == 9 && p.col == 0);
p = neighbor((point){0, 0}, EAST);
assert(p.row == 0 && p.col == 1);
p = neighbor((point){0, 0}, SOUTH);
assert(p.row == 1 && p.col == 0);
p = neighbor((point){0, 0}, WEST);
assert(p.row == 0 && p.col == 9);
puts("ok");
return 0;
}
#endif