Dan Anglin
d1c3ca6658
Main feature: - Added functionality to randomly generate a maze before the solver solves it. Fixes: - Add a public method in the Cell class called wall_exists() that returns true if a given cell wall exists (false otherwise). Refactors: - Added an enum type called CellWallLabel for labelling the four cell walls. - Added a draw() function in the CellWall class to reduce repeated code. - Move the custom exceptions to errors.py Tests: - Add tests for the custom exceptions. CI: - Added a workflow for Forgejo Actions.
106 lines
3 KiB
Python
106 lines
3 KiB
Python
import unittest
|
|
from cell import Cell, CellWallLabel
|
|
from maze import Maze
|
|
import errors
|
|
|
|
|
|
class Tests(unittest.TestCase):
|
|
def test_maze_create_cell_grid(self):
|
|
"""
|
|
test_maze_create_cell_grid tests that the maze is constructed properly.
|
|
"""
|
|
cases = [
|
|
{
|
|
"number_of_cell_rows": 12,
|
|
"number_of_cells_per_row": 10,
|
|
},
|
|
{
|
|
"number_of_cell_rows": 50,
|
|
"number_of_cells_per_row": 120,
|
|
},
|
|
{
|
|
"number_of_cell_rows": 4,
|
|
"number_of_cells_per_row": 4,
|
|
},
|
|
]
|
|
|
|
for case in cases:
|
|
maze = Maze(
|
|
0,
|
|
0,
|
|
case["number_of_cell_rows"],
|
|
case["number_of_cells_per_row"],
|
|
2,
|
|
2,
|
|
)
|
|
self.assertEqual(
|
|
len(maze._cells),
|
|
case["number_of_cell_rows"],
|
|
)
|
|
self.assertEqual(
|
|
len(maze._cells[0]),
|
|
case["number_of_cells_per_row"],
|
|
)
|
|
|
|
def test_break_entrance_and_exit(self):
|
|
"""
|
|
test_break_entrance_and_exit tests to ensure that the Maze's entry and
|
|
exit Cells are open.
|
|
"""
|
|
number_of_cell_rows = 5
|
|
number_of_cells_per_row = 20
|
|
maze = Maze(
|
|
0,
|
|
0,
|
|
number_of_cell_rows,
|
|
number_of_cells_per_row,
|
|
2,
|
|
2,
|
|
)
|
|
self.assertFalse(maze._cells[0][0].wall_exists(CellWallLabel.TOP))
|
|
self.assertFalse(
|
|
maze._cells[number_of_cell_rows - 1]
|
|
[number_of_cells_per_row - 1].wall_exists(CellWallLabel.BOTTOM)
|
|
)
|
|
|
|
def test_invalid_cell_exception(self):
|
|
"""
|
|
test_invalid_cell_exception tests the exception for when an attempt
|
|
is made to create an invalid Cell.
|
|
"""
|
|
cases = [
|
|
{"x1": 30, "y1": 50, "x2": 20, "y2": 100},
|
|
{"x1": 30, "y1": 50, "x2": 40, "y2": 25},
|
|
]
|
|
|
|
for case in cases:
|
|
with self.assertRaises(errors.CellInvalidError):
|
|
_ = Cell(
|
|
x1=case["x1"],
|
|
y1=case["y1"],
|
|
x2=case["x2"],
|
|
y2=case["y2"]
|
|
)
|
|
|
|
def test_cell_too_small_exception(self):
|
|
"""
|
|
test_cell_too_small_exception tests the excpetion for when an attempt
|
|
is made to create a Cell that's too small.
|
|
"""
|
|
cases = [
|
|
{"x1": 1, "y1": 50, "x2": 2, "y2": 100},
|
|
{"x1": 30, "y1": 25, "x2": 40, "y2": 25},
|
|
]
|
|
|
|
for case in cases:
|
|
with self.assertRaises(errors.CellTooSmallError):
|
|
_ = Cell(
|
|
x1=case["x1"],
|
|
y1=case["y1"],
|
|
x2=case["x2"],
|
|
y2=case["y2"]
|
|
)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
unittest.main()
|