-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtests.py
More file actions
75 lines (65 loc) · 1.93 KB
/
tests.py
File metadata and controls
75 lines (65 loc) · 1.93 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
import unittest
from maze import Maze
class Tests(unittest.TestCase):
def test_maze_create_cells(self):
num_cols = 12
num_rows = 10
m1 = Maze(0, 0, num_rows, num_cols, 10, 10)
self.assertEqual(
len(m1._cells),
num_cols,
)
self.assertEqual(
len(m1._cells[0]),
num_rows,
)
def test_maze_cells_points(self):
maze_x = 0
maze_y = 0
num_cols = 2
num_rows = 2
cell_size_x = 10
cell_size_y = 10
m1 = Maze(0, 0, num_rows, num_cols, cell_size_x, cell_size_y)
# Top left cell
self.assertEqual(
((m1._cells[0][0])._x1, (m1._cells[0][0])._y1),
(maze_x, maze_y),
)
self.assertEqual(
((m1._cells[0][0])._x2, (m1._cells[0][0])._y2),
(cell_size_x, cell_size_y),
)
# Bottom right cell
self.assertEqual(
((m1._cells[1][1])._x1, (m1._cells[1][1])._y1),
(cell_size_x, cell_size_y),
)
self.assertEqual(
((m1._cells[1][1])._x2, (m1._cells[1][1])._y2),
(cell_size_x*2, cell_size_y*2),
)
def test_maze_break_entrance_and_exit(self):
num_cols = 12
num_rows = 10
m1 = Maze(0, 0, num_rows, num_cols, 10, 10)
self.assertEqual(
m1._cells[0][0].has_top_wall,
False,
)
self.assertEqual(
m1._cells[-1][-1].has_bottom_wall,
False,
)
def test_reset_cells_visited(self):
m1 = Maze(0, 0, 12, 10, 10, 10, win=None, seed=0)
self.assertEqual(
len(list(
filter(lambda col: len(list(col)) != 0,
map(lambda col: filter(lambda c: c.visited, col), m1._cells)
)
)),
0,
)
if __name__ == "__main__":
unittest.main()