aboutsummaryrefslogtreecommitdiff
path: root/examples/life.zc
diff options
context:
space:
mode:
Diffstat (limited to 'examples/life.zc')
-rw-r--r--examples/life.zc25
1 files changed, 14 insertions, 11 deletions
diff --git a/examples/life.zc b/examples/life.zc
index 6ac34e0..fdfef2b 100644
--- a/examples/life.zc
+++ b/examples/life.zc
@@ -1,10 +1,13 @@
+namespace;
+include rt;
+
// conway's life on a 10 x 20 torus, with typed 2d arrays in a struct.
// a glider walks diagonally and wraps around the edges.
const H = 10, W = 20;
-struct board { [10][20]int c; };
+struct board { int[10][20] c; };
int get(board* b, int y, int x) { return b.c[(y + H) % H][(x + W) % W]; }
-fn step(board* from, board* to) {
+void step(board* from, board* to) {
for (int y = 0; y < H; y++)
for (int x = 0; x < W; x++) {
int n = 0;
@@ -13,15 +16,15 @@ fn step(board* from, board* to) {
if (dy || dx) n += get(from, y + dy, x + dx);
to.c[y][x] = n == 3 || (n == 2 && from.c[y][x]);
}
- return 0;
+ return;
}
-fn show(board* b, int gen) {
- put_s("generation "); put_n(gen); put_c(10);
- for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) put_c(b.c[y][x] ? '#' : '.'); put_c(10); }
- return 0;
+void show(board* b, int gen) {
+ rt.put_s("generation "); rt.put_n(gen); rt.put_c(10);
+ for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) rt.put_c(b.c[y][x] ? '#' : '.'); rt.put_c(10); }
+ return;
}
-fn main() {
- board* a = new(board), b = new(board);
+void main() {
+ board* a = rt.new(board), b = rt.new(board);
a.c[0][1] = 1; a.c[1][2] = 1; a.c[2][0] = 1; a.c[2][1] = 1; a.c[2][2] = 1;
// two generations a pass, a -> b -> a: owned boards can't be swapped
// through a temporary, since the analyzer can't follow that
@@ -30,6 +33,6 @@ fn main() {
step(a, b);
step(b, a);
}
- free(d*a); free(d*b);
- return 0;
+ rt.free(a); rt.free(b);
+ return;
}