Skip to content

Commit

Permalink
Separate out tests from game_of_life.py
Browse files Browse the repository at this point in the history
  • Loading branch information
@naiquevin
naiquevin committed Mar 9, 2014
1 parent b73995c commit b4f5b29
Show file tree
Hide file tree
Showing 2 changed files with 102 additions and 98 deletions.
98 changes: 0 additions & 98 deletions game_of_life.py
View file
Expand Up @@ -89,43 +89,14 @@ def pad_cells(cells, size, padding=1):
return (matrix_to_list(matrix), (rows+2*padding, cols+2*padding))


def test_pad_cells():
c1 = range(16)
c1_p, (nr, nc) = pad_cells(c1, size=(4, 4))
assert nr == 6
assert nc == 6
assert len(c1_p) == 36
assert c1_p == [0, 0, 0, 0, 0, 0,
0, 0, 1, 2, 3, 0,
0, 4, 5, 6, 7, 0,
0, 8, 9, 10, 11, 0,
0, 12, 13, 14, 15, 0,
0, 0, 0, 0, 0, 0]


def list_to_matrix(items, size):
rows, cols = size
return [items[i:i+cols] for i in range(0, len(items), cols)]


def test_list_to_matrix():
c1 = range(4*4)
assert list_to_matrix(c1, (4, 4)) == [[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11],
[12, 13, 14, 15]]


def matrix_to_list(matrix):
return reduce(lambda x,y: x+y, matrix, [])

def test_matrix_to_list():
m1 = [[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11],
[12, 13, 14, 15]]
assert matrix_to_list(m1) == range(4*4)


def update_cells(grid, cells):
"""Produces a new grid from the original one with the cells updated
Expand All @@ -141,14 +112,6 @@ def update_cells(grid, cells):
cols=grid.cols)


def test_make_cells():
g1 = make_grid('test1', size=(2, 2), live_cells=[0, 3])
assert g1.cells == [1, 0, 0, 1]
assert g1.rows == 2
assert g1.cols == 2
assert g1.name == 'test1'


def tick(grid):
"""The callback function to be passed to the game loop
Expand Down Expand Up @@ -181,28 +144,6 @@ def inner(i):
return inner


def test_destiny():
cells = [
0, 0, 0, 0, 0, 0,
0, 0, 1, 1, 1, 0,
0, 1, 1, 1, 0, 0,
0, 0, 0, 0, 0, 0,
]
new_cells = [
0, 0, 0, 1, 0, 0,
0, 1, 0, 0, 1, 0,
0, 1, 0, 0, 1, 0,
0, 0, 1, 0, 0, 0,
]
grid = Grid(name='toad',
cells=cells,
rows=4,
cols=6)
dest = destiny(grid)
for i in range(grid.rows*grid.cols):
assert dest(i) == new_cells[i]


def print_grid(grid, init=False):
"""Prints the grid in the terminal and makes sure it's overwritten
Expand Down Expand Up @@ -252,23 +193,6 @@ def id_to_pos(cell_index, grid):
return (row, column)


def test_id_to_pos():
grid = Grid(name='test3', rows=5, cols=5, cells=None)
assert id_to_pos(0, grid) == (0, 0)
assert id_to_pos(24, grid) == (4, 4)
assert id_to_pos(10, grid) == (2, 0)
toad = Grid(name='toad',
cells=[
0, 0, 0, 0, 0, 0,
0, 0, 1, 1, 1, 0,
0, 1, 1, 1, 0, 0,
0, 0, 0, 0, 0, 0,
],
rows=4,
cols=6)
assert id_to_pos(7, toad) == (1, 1)


def pos_to_id(pos, grid):
"""Produces id of flat cells list from row,col position
Expand All @@ -291,15 +215,6 @@ def inner(pos):
return inner


def test_cell_status():
grid = make_grid('test2', size=(5, 5), live_cells=[0, 3, 12, 18, 21])
status = cell_status(grid)
assert status((0, 0)) == 1
assert status((0, 3)) == 1
assert status((2, 0)) == 0
assert status((3, 4)) == 0


def neighbours(grid):
"""A function that takes a grid and returns a curried function to
compute neighbours of a position in the grid which are returned as
Expand All @@ -324,19 +239,6 @@ def inner(pos):
return inner


def test_neighbors():
grid = make_grid('test2', size=(5, 5), live_cells=[0, 3, 12, 18, 21])
get_neighbours = neighbours(grid)
p1 = id_to_pos(0, grid)
assert get_neighbours(p1) == [(0, 1), (1, 0), (1, 1)]
p2 = id_to_pos(18, grid)
assert get_neighbours(p2) == [(2, 2), (2, 3), (2, 4),
(3, 2), (3, 4),
(4, 2), (4, 3), (4, 4)]
p3 = id_to_pos(24, grid)
assert get_neighbours(p3) == [(3, 3), (3, 4), (4, 3)]


def live_neighbours(pos, grid):
"""Produces alive neighbours of a cell in the grid at position 'pos'
Expand Down
102 changes: 102 additions & 0 deletions tests.py
View file
@@ -0,0 +1,102 @@
from game_of_life import (pad_cells, list_to_matrix, matrix_to_list,
make_grid, Grid, destiny, id_to_pos,
cell_status, neighbours)


def test_pad_cells():
c1 = range(16)
c1_p, (nr, nc) = pad_cells(c1, size=(4, 4))
assert nr == 6
assert nc == 6
assert len(c1_p) == 36
assert c1_p == [0, 0, 0, 0, 0, 0,
0, 0, 1, 2, 3, 0,
0, 4, 5, 6, 7, 0,
0, 8, 9, 10, 11, 0,
0, 12, 13, 14, 15, 0,
0, 0, 0, 0, 0, 0]


def test_list_to_matrix():
c1 = range(4*4)
assert list_to_matrix(c1, (4, 4)) == [[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11],
[12, 13, 14, 15]]


def test_matrix_to_list():
m1 = [[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11],
[12, 13, 14, 15]]
assert matrix_to_list(m1) == range(4*4)


def test_make_cells():
g1 = make_grid('test1', size=(2, 2), live_cells=[0, 3])
assert g1.cells == [1, 0, 0, 1]
assert g1.rows == 2
assert g1.cols == 2
assert g1.name == 'test1'


def test_destiny():
cells = [
0, 0, 0, 0, 0, 0,
0, 0, 1, 1, 1, 0,
0, 1, 1, 1, 0, 0,
0, 0, 0, 0, 0, 0,
]
new_cells = [
0, 0, 0, 1, 0, 0,
0, 1, 0, 0, 1, 0,
0, 1, 0, 0, 1, 0,
0, 0, 1, 0, 0, 0,
]
grid = Grid(name='toad',
cells=cells,
rows=4,
cols=6)
dest = destiny(grid)
for i in range(grid.rows*grid.cols):
assert dest(i) == new_cells[i]


def test_id_to_pos():
grid = Grid(name='test3', rows=5, cols=5, cells=None)
assert id_to_pos(0, grid) == (0, 0)
assert id_to_pos(24, grid) == (4, 4)
assert id_to_pos(10, grid) == (2, 0)
toad = Grid(name='toad',
cells=[
0, 0, 0, 0, 0, 0,
0, 0, 1, 1, 1, 0,
0, 1, 1, 1, 0, 0,
0, 0, 0, 0, 0, 0,
],
rows=4,
cols=6)
assert id_to_pos(7, toad) == (1, 1)


def test_cell_status():
grid = make_grid('test2', size=(5, 5), live_cells=[0, 3, 12, 18, 21])
status = cell_status(grid)
assert status((0, 0)) == 1
assert status((0, 3)) == 1
assert status((2, 0)) == 0
assert status((3, 4)) == 0


def test_neighbors():
grid = make_grid('test2', size=(5, 5), live_cells=[0, 3, 12, 18, 21])
get_neighbours = neighbours(grid)
p1 = id_to_pos(0, grid)
assert get_neighbours(p1) == [(0, 1), (1, 0), (1, 1)]
p2 = id_to_pos(18, grid)
assert get_neighbours(p2) == [(2, 2), (2, 3), (2, 4),
(3, 2), (3, 4),
(4, 2), (4, 3), (4, 4)]
p3 = id_to_pos(24, grid)
assert get_neighbours(p3) == [(3, 3), (3, 4), (4, 3)]

0 comments on commit b4f5b29

Please sign in to comment.