2018-12-01 19:37:18 +00:00
|
|
|
from enum import Enum
|
2019-02-15 18:33:15 +00:00
|
|
|
from operator import add
|
2018-12-01 19:37:18 +00:00
|
|
|
|
|
|
|
|
|
|
|
class EdgeRule(Enum):
|
|
|
|
IGNORE_MISSING_NEIGHBORS_OF_EDGE_CELLS = 0
|
|
|
|
IGNORE_EDGE_CELLS = 1
|
|
|
|
FIRST_AND_LAST_CELL_OF_DIMENSION_ARE_NEIGHBORS = 2
|
|
|
|
|
|
|
|
|
2018-12-02 16:45:08 +00:00
|
|
|
class Neighborhood:
|
2019-02-15 18:33:15 +00:00
|
|
|
def __init__(self, neighbours_relative: list, edge_rule: EdgeRule):
|
2018-12-08 21:33:13 +00:00
|
|
|
""" Defines a neighborhood for cells.
|
2019-02-15 18:33:15 +00:00
|
|
|
:param neighbours_relative: List of relative coordinates of cells neighbours.
|
|
|
|
:param edge_rule: EdgeRule to define, how cells on the edge of the grid will be handled.
|
2018-12-08 21:33:13 +00:00
|
|
|
"""
|
2019-02-15 18:33:15 +00:00
|
|
|
self._rel_neighbors = neighbours_relative
|
2018-12-01 19:37:18 +00:00
|
|
|
self.edge_rule = edge_rule
|
2018-12-08 21:33:13 +00:00
|
|
|
self.grid_dimensions = []
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2018-12-08 21:33:13 +00:00
|
|
|
def calculate_cell_neighbor_coordinates(self, cell_coordinate, grid_dimensions):
|
|
|
|
""" Get a list of coordinates for the cell neighbors. The EdgeRule can reduce the returned neighbor count.
|
|
|
|
:param cell_coordinate: The coordinate of the cell to get the neighbors
|
|
|
|
:param grid_dimensions: The dimensions of the grid, to apply edge the rule.
|
|
|
|
:return:
|
|
|
|
"""
|
|
|
|
self.grid_dimensions = grid_dimensions
|
2019-02-15 18:33:15 +00:00
|
|
|
return list(self._neighbours_generator(cell_coordinate))
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2019-02-15 18:33:15 +00:00
|
|
|
def _neighbours_generator(self, cell_coordinate):
|
|
|
|
if not self._does_ignore_edge_cell_rule_apply(cell_coordinate):
|
|
|
|
for rel_n in self._rel_neighbors:
|
|
|
|
yield from self._calculate_abs_neighbour_and_decide_validity(cell_coordinate, rel_n)
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2019-02-15 18:33:15 +00:00
|
|
|
def _calculate_abs_neighbour_and_decide_validity(self, cell_coordinate, rel_n):
|
|
|
|
n = list(map(add, rel_n, cell_coordinate))
|
|
|
|
n_folded = self._apply_edge_overflow(n)
|
|
|
|
if n == n_folded or self.edge_rule == EdgeRule.FIRST_AND_LAST_CELL_OF_DIMENSION_ARE_NEIGHBORS:
|
|
|
|
yield n_folded
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2019-02-15 18:33:15 +00:00
|
|
|
def _does_ignore_edge_cell_rule_apply(self, coordinate):
|
|
|
|
return self.edge_rule == EdgeRule.IGNORE_EDGE_CELLS and self._is_coordinate_on_an_edge(coordinate)
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2019-02-15 18:33:15 +00:00
|
|
|
def _is_coordinate_on_an_edge(self, coordinate):
|
|
|
|
return all(0 == ci or ci == di-1 for ci, di in zip(coordinate, self.grid_dimensions))
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2019-02-15 18:33:15 +00:00
|
|
|
def _apply_edge_overflow(self, n):
|
|
|
|
return list(map(lambda ni, di: (ni + di) % di, n, self.grid_dimensions))
|
2018-12-08 21:33:13 +00:00
|
|
|
|
2018-12-01 19:37:18 +00:00
|
|
|
|
2018-12-02 16:45:08 +00:00
|
|
|
class MooreNeighborhood(Neighborhood):
|
2019-02-15 18:33:15 +00:00
|
|
|
def __init__(self, edge_rule: EdgeRule = EdgeRule.IGNORE_EDGE_CELLS):
|
2018-12-01 19:37:18 +00:00
|
|
|
super().__init__([[-1, -1], [0, -1], [1, -1],
|
2018-12-02 16:45:08 +00:00
|
|
|
[-1, 0], [1, 0],
|
2018-12-01 19:37:18 +00:00
|
|
|
[-1, 1], [0, 1], [1, 1]],
|
|
|
|
edge_rule)
|