|
IN101 project on Conway's Game of Life
|
Test executable source code for a linked list implementation of Conway's game of life universe simulator. More...

Functions | |
| void | test_list_countneighbors () |
Test of the list_count_neighbors function. More... | |
| bool | compare_linked_lists (linked_list a, linked_list b) |
| Determine whether two linked lists are identical, comparing all cells. More... | |
| void | test_list_step () |
Test of the list_step function. More... | |
| int | main (void) |
Variables | |
| char * | filename = "data/glider.txt" |
Test executable source code for a linked list implementation of Conway's game of life universe simulator.
| bool compare_linked_lists | ( | linked_list | a, |
| linked_list | b | ||
| ) |
Determine whether two linked lists are identical, comparing all cells.
| a | first linked list |
| b | second linked list |
| void test_list_countneighbors | ( | ) |
Test of the list_count_neighbors function.
This tests uses the data/glider.txt source file and checks several neighbor counts.
| void test_list_step | ( | ) |
Test of the list_step function.
This test uses the data/archive-test directory that contains 512 source files and their next step solution.
It will load each universe from each file, use the list_step function and compare the return's cell table with the given exact solution.
1.8.13