Twice.walk: def of bolt@1.27.0.0
Import: import bolt@1.27.0.0/src/rules/correctness/twice.bend as Twice
Lines 57-67 of bolt@1.27.0.0/src/rules/correctness/twice.bend: https://jend.leeeet.dev/read.txt?path=bolt@1.27.0.0/src/rules/correctness/twice.bend&start_line=57&end_line=67

import Base
import bolt@1.27.0.0/src/finding.bend as F
import bolt@1.27.0.0/src/syntax/tree.bend as Tree
import bolt@1.27.0.0/src/rules/tokens.bend as T

# every case statement under a recursive def, at any depth
def walk(nn: Tree.Node, +path: String) -> List<&2, F.Finding>:
  match nn:
    case Tree.NCons{Tree.Stmt{Tree.SCase{}, kids, body}, rest}:
      List.concat(&2, F.Finding, [arm(T.pattern(kids), path), walk(body, path), walk(rest, path)])
    case Tree.NCons{Tree.Stmt{kind, kids, body}, rest}:
      List.append(&2, F.Finding, walk(body, path), walk(rest, path))
    case Tree.NCons{h, rest}:
      walk(rest, path)
    case other:
      Nil{}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.append
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.concat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=String
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/finding.bend&name=Finding
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/correctness/twice.bend&name=arm
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/tokens.bend&name=pattern
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=Node
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=StmtKind