-
Notifications
You must be signed in to change notification settings - Fork 3
/
life.cpp
232 lines (181 loc) · 5.77 KB
/
life.cpp
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
//Sample provided by Thiago Massari Guedes
//September 2017
//http://www.simplycpp.com
//
//Compile: g++ -std=c++17 -o life life.cpp
#include <iostream>
#include <vector>
#include <thread>
#include <chrono>
#include <algorithm>
#include <random>
//Please use random access iterator
template<typename Type, typename Storage=std::vector<Type>>
struct matrix {
using value_type = Type;
Storage data;
int cols, rows;
matrix(int cols, int rows) : data(cols*rows), cols(cols), rows(rows) { }
matrix(const matrix& o) = delete; //disable copy
matrix(matrix&& o) : data(std::move(o.data)), cols(o.cols), rows(o.rows) { }
matrix& operator=(const matrix& other) = delete; //disable copy
matrix& operator=(matrix&& other)
{
data = std::move(other.data);
cols = other.cols;
rows = other.rows;
return *this;
}
Type _get_pos(int x, int y) const {
return x + (y*cols);
}
Type& operator () (int x, int y) {
return data[_get_pos(x,y)];
}
const Type& operator() (int x, int y) const {
return data[_get_pos(x,y)];
}
bool valid(int x, int y) const {
return _get_pos(x,y) < data.size();
}
};
template<typename Type>
struct matrix_view {
matrix<Type> &_data;
const int _x, _y;
const int cols, rows;
matrix_view(matrix<Type> &data, int x, int y, int cols, int rows) :
_data(data), _x(x), _y(y), cols(cols), rows(rows) { }
Type _get_x(int x) const {
int rx = _x + x;
if( rx >= _data.cols ) { rx -= _data.cols; }
if( rx < 0 ) { rx += _data.cols; }
return rx;
}
Type _get_y(int y) const {
int ry = _y + y;
if( ry >= _data.rows ) { ry -= _data.rows; }
if( ry < 0 ) { ry += _data.rows; }
return ry;
}
Type& operator () (int x, int y) {
return _data(_get_x(x), _get_y(y));
}
};
//The life processor don't know cell types. It's the processor and counter dependent
template <typename Rule, typename Counter, typename CellType>
struct life_processor {
matrix<CellType> _nm;
Rule _rule;
Counter _counter;
life_processor(const matrix<CellType> &v) : _nm(v.cols, v.rows) {
}
matrix<CellType> step(matrix<CellType> &m) {
for(int y=0; y < m.rows; ++y) {
for(int x=0; x < m.cols; ++x) {
auto mv = get_surrounding(m, x, y);
int count = _counter(mv);
//Let's apply the rules
_nm(x, y) = _rule(mv, count);
}
}
std::swap(m, _nm);
return std::move(m);
}
};
//life_counter and life_rule are specific to int type.
struct life_counter {
int operator() (matrix_view<int> &mv) {
int total = 0;
for(int y=0; y < mv.rows; ++y) {
for(int x=0; x < mv.cols; ++x) {
//Let's not count itself
if(x == 1 && y == 1) {
continue;
}
if( mv(x, y) != 0 )
total += 1;
}
}
return total;
}
};
struct life_rule {
int increase_until(int val, int max) {
val += 1;
if( val > max ) return max;
return val;
}
int operator() (matrix_view<int> &view, int count) {
//Rules of the game - https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life
int cur_cell = view(1, 1);
//Any live cell with two or three live neighbours lives on to the next generation.
if( cur_cell != 0 && (count == 2 || count == 3) ) {
//To make it fun, let's increase generation
return increase_until(cur_cell, 10);
}
//Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.
if( cur_cell == 0 && count == 3 ) {
//Baby cell !
return 1;
}
//Any live cell with fewer than two live neighbours dies, as if caused by underpopulation.
//Any live cell with more than three live neighbours dies, as if by overpopulation.
return 0;
}
};
template<typename T>
matrix_view<T> get_surrounding(matrix<T> &data, int x, int y) {
matrix_view<T> mv(data, x-1, y-1, 3, 3);
return std::move(mv);
}
void fill_random(matrix<int> &m) {
std::random_device rd;
std::mt19937_64 generator(rd());
std::uniform_int_distribution<int> distribution(0,1);
auto dice_2_side = std::bind ( distribution, generator ); //2 side dice????
for(auto it = m.data.begin(); it != m.data.end(); ++it) {
*it = dice_2_side();
}
}
//Used for debugging
void fill_walker(matrix<int> &v) {
matrix_view<int> mv = get_surrounding(v, 2, 2);
mv(1, 0) = 1;
mv(2, 1) = 1;
mv(0, 2) = 1;
mv(1, 2) = 1;
mv(2, 2) = 1;
}
template<typename T>
void show_matrix(T &v) {
std::cout << "\x1B[2J\x1B[H";
for(int y=0; y < v.rows; ++y) {
for(int x=0; x < v.cols; ++x) {
char c = ' ';
if( v(x,y) > 9 ) c = '*';
else if( v(x,y) > 0 ) c = '0' + v(x,y);
std::cout << c;
}
std::cout << std::endl;
}
using namespace std::chrono_literals;
std::this_thread::sleep_for(150ms);
}
template<typename Type>
life_processor<life_rule, life_counter, Type> get_life(matrix<Type> &matrix) {
life_processor<life_rule, life_counter, Type> life(matrix);
return std::move(life);
}
int main(int argc, char **argv) {
int cols = 60;
int rows = 40;
matrix<int> v(cols, rows);
fill_random(v);
//fill_walker(v);
auto life = get_life(v);
while(true) {
show_matrix(v);
v = life.step(v);
}
}