awkrs 0.4.10

Awk implementation in Rust with broad CLI compatibility, parallel records, and experimental Cranelift JIT
Documentation 
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

# Conway's Game of Life — fixed-grid evolution for N generations.
# Input first line:  "GEN <n> WIDTH <w> HEIGHT <h>"
# Lines 2..h+1:      grid rows (use '#' for live, '.' for dead; any width).
# Output: generation 0 (initial), then each subsequent generation through
# generation N, separated by blank lines, each labelled "-- gen <k> --".

function get(r, c) {
  if (r < 1 || r > H || c < 1 || c > W) return 0
  return (cell[r, c] == 1) ? 1 : 0
}

function neighbors(r, c) {
  return get(r-1,c-1)+get(r-1,c)+get(r-1,c+1)+ \
         get(r,c-1)+              get(r,c+1)+ \
         get(r+1,c-1)+get(r+1,c)+get(r+1,c+1)
}

function step() {
  delete nxt
  for (r = 1; r <= H; r++) {
    for (c = 1; c <= W; c++) {
      n = neighbors(r, c)
      alive = (cell[r, c] == 1)
      if (alive && (n == 2 || n == 3)) nxt[r, c] = 1
      else if (!alive && n == 3)       nxt[r, c] = 1
      else                             delete nxt[r, c]
    }
  }
  delete cell
  for (k in nxt) cell[k] = nxt[k]
}

function show(label,   r, c, line) {
  printf "-- %s --\n", label
  for (r = 1; r <= H; r++) {
    line = ""
    for (c = 1; c <= W; c++) line = line ((cell[r, c] == 1) ? "#" : ".")
    print line
  }
}

NR == 1 && $1 == "GEN" { N = $2 + 0; W = $4 + 0; H = $6 + 0; row = 0; next }
{
  row++
  for (c = 1; c <= length($0) && c <= W; c++) {
    if (substr($0, c, 1) == "#") cell[row, c] = 1
  }
}

END {
  show("gen 0")
  for (g = 1; g <= N; g++) {
    step()
    print ""
    show("gen " g)
  }
}