177 lines
4.4 KiB
C++
177 lines
4.4 KiB
C++
#include <iostream>
|
|
#include <fstream>
|
|
#include <climits>
|
|
#include <vector>
|
|
#include <map>
|
|
#include <algorithm>
|
|
|
|
#include "Timing.h"
|
|
|
|
#define LIVE_CELL 'x'
|
|
#define DEAD_CELL '.'
|
|
|
|
struct World {
|
|
World(int size_x, int size_y) : size_x(size_x), size_y(size_y) {
|
|
data = new char*[size_y];
|
|
|
|
for (int y = 0; y < size_y; y++) {
|
|
data[y] = new char[size_x];
|
|
}
|
|
}
|
|
|
|
~World() {
|
|
for (int y = 0; y < size_y; y++) {
|
|
delete data[y];
|
|
}
|
|
|
|
delete data;
|
|
}
|
|
|
|
char **data;
|
|
|
|
char get_value(int x, int y) {
|
|
// TODO: Way too much work to do all the time. Move this to special cases
|
|
if (x < 0) x += size_x;
|
|
if (y < 0) y += size_y;
|
|
if (x >= size_x) x -= size_x;
|
|
if (y >= size_y) y -= size_y;
|
|
return data[y][x];
|
|
}
|
|
|
|
void set_alive(int x, int y) {
|
|
data[y][x] = LIVE_CELL;
|
|
}
|
|
|
|
void set_dead(int x, int y) {
|
|
data[y][x] = DEAD_CELL;
|
|
}
|
|
|
|
void set(int x, int y, char val) {
|
|
data[y][x] = val;
|
|
}
|
|
|
|
int size_x;
|
|
int size_y;
|
|
};
|
|
|
|
void generation(World &world, int *neighbor_counts) {
|
|
int size_x = world.size_x;
|
|
|
|
// Set neighbor counts
|
|
for (int y = 0; y < world.size_y; y++) {
|
|
for (int x = 0; x < world.size_x; x++) {
|
|
// Get number of living neighbors
|
|
int neighbors = 0;
|
|
|
|
if (world.get_value(x - 1, y - 1) == LIVE_CELL) neighbors++;
|
|
if (world.get_value(x, y - 1) == LIVE_CELL) neighbors++;
|
|
if (world.get_value(x + 1, y - 1) == LIVE_CELL) neighbors++;
|
|
|
|
if (world.get_value(x - 1, y) == LIVE_CELL) neighbors++;
|
|
if (world.get_value(x + 1, y) == LIVE_CELL) neighbors++;
|
|
|
|
if (world.get_value(x - 1, y + 1) == LIVE_CELL) neighbors++;
|
|
if (world.get_value(x, y + 1) == LIVE_CELL) neighbors++;
|
|
if (world.get_value(x + 1, y + 1) == LIVE_CELL) neighbors++;
|
|
|
|
neighbor_counts[y * size_x + x] = neighbors;
|
|
}
|
|
}
|
|
|
|
// Update cells accordingly
|
|
for (int y = 0; y < world.size_y; y++) {
|
|
for (int x = 0; x < world.size_x; x++) {
|
|
char this_cell = world.get_value(x, y);
|
|
int neighbors = neighbor_counts[y * size_x + x];
|
|
|
|
if (this_cell == DEAD_CELL) {
|
|
if (neighbors == 3) {
|
|
// Any dead cell with exactly three living neighbors becomes a live cell.
|
|
world.set_alive(x, y);
|
|
}
|
|
} else {
|
|
if (neighbors < 2 || neighbors > 3) {
|
|
// Any live cell with two or three living neighbors lives.
|
|
// Any live cell with fewer than two living neighbors dies.
|
|
// Any live cell with more than three living neighbors dies.
|
|
world.set_dead(x, y);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
Timing *timing = Timing::getInstance();
|
|
|
|
// Setup.
|
|
timing->startSetup();
|
|
|
|
// Read in the start state
|
|
std::string file_begin = "random250";
|
|
|
|
std::ifstream world_file;
|
|
world_file.open(file_begin + "_in.gol");
|
|
|
|
// Get x and y size
|
|
std::string x_str, y_str;
|
|
getline(world_file, x_str, ',');
|
|
getline(world_file, y_str);
|
|
|
|
int size_x = std::stoi(x_str);
|
|
int size_y = std::stoi(y_str);
|
|
|
|
World world(size_x, size_y);
|
|
|
|
// Set the data
|
|
for (int y = 0; y < size_y; y++) {
|
|
std::string line;
|
|
getline(world_file, line);
|
|
|
|
for (int x = 0; x < size_x; x++) {
|
|
world.set(x, y, line[x]);
|
|
}
|
|
}
|
|
|
|
world_file.close();
|
|
|
|
timing->stopSetup();
|
|
timing->startComputation();
|
|
|
|
int *neighbor_counts = new int[world.size_y * world.size_x];
|
|
|
|
// Do some generations
|
|
for (int i = 0; i < 250; i++) {
|
|
generation(world, neighbor_counts);
|
|
}
|
|
|
|
timing->stopComputation();
|
|
timing->startFinalization();
|
|
|
|
// Write the result
|
|
std::ofstream result_file;
|
|
result_file.open(file_begin + "_out.gol");
|
|
|
|
result_file << size_x << "," << size_y << '\n';
|
|
|
|
for (int y = 0; y < size_y; y++) {
|
|
std::string line;
|
|
getline(world_file, line);
|
|
|
|
for (int x = 0; x < size_x; x++) {
|
|
line += world.get_value(x, y);
|
|
}
|
|
|
|
result_file << line << '\n';
|
|
}
|
|
|
|
result_file.close();
|
|
delete neighbor_counts;
|
|
|
|
timing->stopFinalization();
|
|
|
|
timing->print();
|
|
|
|
return 0;
|
|
}
|