2 from plomrogue.errors import ArgError
6 class YX(collections.namedtuple('YX', ('y', 'x'))):
8 def __add__(self, other):
9 return YX(self.y + other.y, self.x + other.x)
11 def __sub__(self, other):
12 return YX(self.y - other.y, self.x - other.x)
15 return 'Y:%s,X:%s' % (self.y, self.x)
21 def __init__(self, size):
24 self.directions = self.get_directions()
26 def get_directions(self):
29 for name in dir(self):
30 if name[:len(prefix)] == prefix:
31 directions += [name[len(prefix):]]
34 def get_neighbors_yxyx(self, yxyx):
36 for direction in self.directions:
37 neighbors[direction] = self.move_yxyx(yxyx, direction)
40 def get_neighbors_yx(self, pos):
42 for direction in self.directions:
43 neighbors[direction] = self.move_yx(pos, direction)
46 def get_neighbors_i(self, i):
47 if i in self.neighbors_i:
48 return self.neighbors_i[i]
49 pos = YX(i // self.size.x, i % self.size.x)
50 neighbors_pos = self.get_neighbors_yx(pos)
52 for direction in neighbors_pos:
53 pos = neighbors_pos[direction]
55 neighbors_i[direction] = None
57 neighbors_i[direction] = pos.y * self.size.x + pos.x
58 self.neighbors_i[i] = neighbors_i
59 return self.neighbors_i[i]
61 def move_yx(self, start_yx, direction, check=True):
62 mover = getattr(self, 'move__' + direction)
63 target = mover(start_yx)
64 # TODO refactor with SourcedMap.inside?
65 if target.y < 0 or target.x < 0 or \
66 target.y >= self.size.y or target.x >= self.size.x:
70 def move_yxyx(self, start_yxyx, direction):
71 mover = getattr(self, 'move__' + direction)
72 start_yx = self.undouble_yxyx(*start_yxyx)
73 target_yx = mover(start_yx)
74 return self.double_yx(target_yx)
76 def double_yx(self, absolute_yx):
77 big_y = absolute_yx.y // self.size.y
78 little_y = absolute_yx.y % self.size.y
79 big_x = absolute_yx.x // self.size.x
80 little_x = absolute_yx.x % self.size.x
81 return YX(big_y, big_x), YX(little_y, little_x)
83 def undouble_yxyx(self, big_yx, little_yx):
84 y = big_yx.y * self.size.y + little_yx.y
85 x = big_yx.x * self.size.x + little_yx.x
88 def basic_circle_out_move(self, position, direction):
89 mover = getattr(self, 'move__' + direction)
90 return mover(position)
94 class MapGeometryWithLeftRightMoves(MapGeometry):
96 def move__LEFT(self, start_pos):
97 return YX(start_pos.y, start_pos.x - 1)
99 def move__RIGHT(self, start_pos):
100 return YX(start_pos.y, start_pos.x + 1)
104 class MapGeometrySquare(MapGeometryWithLeftRightMoves):
105 circle_out_directions = (('DOWN', 'LEFT'), ('LEFT', 'UP'),
106 ('UP', 'RIGHT'), ('RIGHT', 'DOWN'))
108 def circle_out_move(self, yx, direction):
109 yx = self.basic_circle_out_move(yx, direction[0])
110 return self.basic_circle_out_move(yx, direction[1])
112 def define_segment(self, source_center, radius):
113 source_center = self.undouble_yxyx(*source_center)
114 size = YX(2 * radius + 1, 2 * radius + 1)
115 offset = YX(source_center.y - radius, source_center.x - radius)
116 center = YX(radius, radius)
117 return size, offset, center
119 def move__UP(self, start_pos):
120 return YX(start_pos.y - 1, start_pos.x)
122 def move__DOWN(self, start_pos):
123 return YX(start_pos.y + 1, start_pos.x)
126 class MapGeometryHex(MapGeometryWithLeftRightMoves):
127 circle_out_directions = ('DOWNLEFT', 'LEFT', 'UPLEFT',
128 'UPRIGHT', 'RIGHT', 'DOWNRIGHT')
130 def circle_out_move(self, yx, direction):
131 return self.basic_circle_out_move(yx, direction)
133 def define_segment(self, source_center, radius):
134 source_center = self.undouble_yxyx(*source_center)
135 indent = 1 if (source_center.y % 2) else 0
136 size = YX(2 * radius + 1 + indent, 2 * radius + 1)
137 offset = YX(source_center.y - radius - indent, source_center.x - radius)
138 center = YX(radius + indent, radius)
139 return size, offset, center
141 def move__UPLEFT(self, start_pos):
142 start_indented = start_pos.y % 2
144 return YX(start_pos.y - 1, start_pos.x)
146 return YX(start_pos.y - 1, start_pos.x - 1)
148 def move__UPRIGHT(self, start_pos):
149 start_indented = start_pos.y % 2
151 return YX(start_pos.y - 1, start_pos.x + 1)
153 return YX(start_pos.y - 1, start_pos.x)
155 def move__DOWNLEFT(self, start_pos):
156 start_indented = start_pos.y % 2
158 return YX(start_pos.y + 1, start_pos.x)
160 return YX(start_pos.y + 1, start_pos.x - 1)
162 def move__DOWNRIGHT(self, start_pos):
163 start_indented = start_pos.y % 2
165 return YX(start_pos.y + 1, start_pos.x + 1)
167 return YX(start_pos.y + 1, start_pos.x)
173 def __init__(self, map_geometry):
174 self.geometry = map_geometry
175 self.terrain = '.' * self.size_i # TODO: use Game.get_flatland()?
177 def __getitem__(self, yx):
178 return self.terrain[self.get_position_index(yx)]
180 def __setitem__(self, yx, c):
181 pos_i = self.get_position_index(yx)
183 self.terrain = self.terrain[:pos_i] + c + self.terrain[pos_i + 1:]
185 self.terrain[pos_i] = c
188 """Iterate over YX position coordinates."""
189 for y in range(self.geometry.size.y):
190 for x in range(self.geometry.size.x):
195 return self.geometry.size.y * self.geometry.size.x
197 def set_line(self, y, line):
198 height_map = self.geometry.size.y
199 width_map = self.geometry.size.x
201 raise ArgError('too large row number %s' % y)
202 width_line = len(line)
203 if width_line != width_map:
204 raise ArgError('map line width %s unequal map width %s' % (width_line, width_map))
205 self.terrain = self.terrain[:y * width_map] + line +\
206 self.terrain[(y + 1) * width_map:]
208 def get_position_index(self, yx):
209 return yx.y * self.geometry.size.x + yx.x
212 width = self.geometry.size.x
213 for y in range(self.geometry.size.y):
214 yield (y, self.terrain[y * width:(y + 1) * width])
218 class SourcedMap(Map):
220 def __init__(self, block_chars, obstacle_positions, source_maps,
221 source_center, radius, get_map):
222 self.block_chars = block_chars
224 example_map = get_map(YX(0, 0))
225 self.source_geometry = example_map.geometry
226 size, self.offset, self.center = \
227 self.source_geometry.define_segment(source_center, radius)
228 self.geometry = self.source_geometry.__class__(size)
229 self.source_map_segment = ''
231 big_yx, little_yx = self.source_yxyx(yx)
233 if (big_yx, little_yx) in obstacle_positions:
234 self.source_map_segment += self.block_chars[0]
236 self.source_map_segment += source_maps[big_yx][little_yx]
238 def source_yxyx(self, yx):
239 absolute_yx = yx + self.offset
240 big_yx, little_yx = self.source_geometry.double_yx(absolute_yx)
241 return big_yx, little_yx
243 def target_yx(self, big_yx, little_yx, check=False):
244 target_yx = self.source_geometry.undouble_yxyx(big_yx, little_yx) - self.offset
245 if check and not self.inside(target_yx):
249 def inside(self, yx):
250 if yx.y < 0 or yx.x < 0 or \
251 yx.y >= self.geometry.size.y or yx.x >= self.geometry.size.x:
257 class DijkstraMap(SourcedMap):
259 def __init__(self, *args, **kwargs):
260 # TODO: check potential optimizations:
261 # - somehow ignore tiles that have the lowest possible value (we can
262 # compare with a precalculated map for given starting position)
263 # - check if Python offers more efficient data structures to use here
264 # - shorten radius to nearest possible target
265 super().__init__(*args, **kwargs)
266 self.terrain = [255] * self.size_i
267 self[self.center] = 0
269 def work_tile(position_i):
271 if self.source_map_segment[position_i] in self.block_chars:
273 neighbors = self.geometry.get_neighbors_i(position_i)
274 for direction in [d for d in neighbors if neighbors[d]]:
275 j = neighbors[direction]
276 if self.terrain[j] < self.terrain[position_i] - 1:
277 self.terrain[position_i] = self.terrain[j] + 1
281 # TODO: refactor with FovMap.circle_out()
287 while distance <= self.radius:
288 yx = self.geometry.basic_circle_out_move(yx, 'RIGHT')
289 for dir_i in range(len(self.geometry.circle_out_directions)):
290 for dir_progress in range(distance):
291 direction = self.geometry.circle_out_directions[dir_i]
292 yx = self.geometry.circle_out_move(yx, direction)
293 position_i = self.get_position_index(yx)
294 shrunk = True if work_tile(position_i) else shrunk
296 # print('DEBUG Dijkstra')
299 # for n in self.terrain:
300 # line_to_print += ['%3s' % n]
302 # if x >= self.geometry.size.x:
304 # print(' '.join(line_to_print))
309 class FovMap(SourcedMap):
310 # TODO: player visibility asymmetrical (A can see B when B can't see A):
311 # does this make sense, or not?
313 def __init__(self, *args, **kwargs):
314 super().__init__(*args, **kwargs)
315 self.terrain = '?' * self.size_i
316 self[self.center] = '.'
317 self.shadow_cones = []
318 #self.circle_out(self.center, self.shadow_process)
320 def init_terrain(self):
321 # we outsource this to allow multiprocessing some stab at it,
322 # and return it since multiprocessing does not modify its
324 self.circle_out(self.center, self.shadow_process)
327 def throws_shadow(self, yx):
328 return self.source_map_segment[self.get_position_index(yx)]\
331 def shadow_process(self, yx, distance_to_center, dir_i, dir_progress):
332 # Possible optimization: If no shadow_cones yet and self[yx] == '.',
334 CIRCLE = 360 # Since we'll float anyways, number is actually arbitrary.
336 def correct_arm(arm):
341 def in_shadow_cone(new_cone):
342 for old_cone in self.shadow_cones:
343 if old_cone[0] <= new_cone[0] and \
344 new_cone[1] <= old_cone[1]:
346 # We might want to also shade tiles whose middle arm is inside a
347 # shadow cone for a darker FOV. Note that we then could not for
348 # optimization purposes rely anymore on the assumption that a
349 # shaded tile cannot add growth to existing shadow cones.
352 def merge_cone(new_cone):
354 for old_cone in self.shadow_cones:
355 if new_cone[0] < old_cone[0] and \
356 (new_cone[1] > old_cone[0] or
357 math.isclose(new_cone[1], old_cone[0])):
358 old_cone[0] = new_cone[0]
360 if new_cone[1] > old_cone[1] and \
361 (new_cone[0] < old_cone[1] or
362 math.isclose(new_cone[0], old_cone[1])):
363 old_cone[1] = new_cone[1]
368 if in_shadow_cone(cone):
371 if self.throws_shadow(yx):
373 while merge_cone(cone):
376 self.shadow_cones += [cone]
378 step_size = (CIRCLE / len(self.geometry.circle_out_directions))\
380 number_steps = dir_i * distance_to_center + dir_progress
381 left_arm = correct_arm(step_size / 2 + step_size * number_steps)
382 right_arm = correct_arm(left_arm + step_size)
384 # Optimization potential: left cone could be derived from previous
385 # right cone. Better even: Precalculate all cones.
386 if right_arm < left_arm:
387 eval_cone([left_arm, CIRCLE])
388 eval_cone([0, right_arm])
390 eval_cone([left_arm, right_arm])
392 def circle_out(self, yx, f):
393 # Optimization potential: Precalculate movement positions.
394 # Optimization potential: Precalculate what tiles are shaded by what tile
395 # and skip evaluation of already shaded tile. (This only works if tiles
396 # shading implies they completely lie in existing shades; otherwise we
397 # would lose shade growth through tiles at shade borders.)
400 while distance <= self.radius:
401 yx = self.geometry.basic_circle_out_move(yx, 'RIGHT')
402 for dir_i in range(len(self.geometry.circle_out_directions)):
403 for dir_progress in range(distance):
404 direction = self.geometry.circle_out_directions[dir_i]
405 yx = self.geometry.circle_out_move(yx, direction)
406 f(yx, distance, dir_i, dir_progress)