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
58
59
60
61
62
63
64

# Tarjan's strongly connected components.
# Input: each line "<u> <v>" is a directed edge u -> v.
# Output: each SCC on its own line as "{ a b c }" with members lex-sorted;
# components emitted in lex order of their smallest member, then "COUNT: <k>".
#
# Iterative DFS would obscure the algorithm — use recursion with explicit
# stack[], onstack[], index[], lowlink[] state.

function add_edge(u, v,   k) {
  if (!(u in seen)) seen[u] = 1
  if (!(v in seen)) seen[v] = 1
  k = ++outdeg[u]
  adj[u, k] = v
}

function strongconnect(v,   k, w, smallest, members, sorted, line, n, arr, i, m) {
  idx[v] = idx_counter
  low[v] = idx_counter
  idx_counter++
  stack[++sp] = v
  onstack[v] = 1

  for (k = 1; k <= (outdeg[v] + 0); k++) {
    w = adj[v, k]
    if (!(w in idx)) {
      strongconnect(w)
      if (low[w] < low[v]) low[v] = low[w]
    } else if (w in onstack) {
      if (idx[w] < low[v]) low[v] = idx[w]
    }
  }

  if (low[v] == idx[v]) {
    # Pop SCC.
    delete members
    smallest = ""
    while (1) {
      w = stack[sp]; delete stack[sp]; sp--
      delete onstack[w]
      members[w] = 1
      if (smallest == "" || w < smallest) smallest = w
      if (w == v) break
    }
    # Lex-sort members for deterministic output.
    delete arr; n = 0
    for (m in members) { n++; arr[n] = m }
    n = asort(arr, sorted)
    line = "{"
    for (i = 1; i <= n; i++) line = line " " sorted[i]
    line = line " }"
    scc_keys[smallest] = line
  }
}

NF == 2 { add_edge($1, $2) }

END {
  idx_counter = 0
  sp = 0
  PROCINFO["sorted_in"] = "@ind_str_asc"
  for (v in seen) if (!(v in idx)) strongconnect(v)
  for (k in scc_keys) { print scc_keys[k]; count++ }
  printf "COUNT: %d\n", count
}