def visit
import bend-lint-api@0.2.0.0/linter/lint.bend as Lintimport Base
333# `f(c, path, node)` for each node of `nodes` and under them, parents first, in order: `path` holds the nodes above the
334# node, innermost first.
335def visit(
336 ~C: Data,
337 ~A: Data,
338 ~f: @+c: C -> @+path: List<&2, Above> -> @+node: Node -> List<&2, A>,
339 c: C,
340 nodes: List<&2, Node>
341) -> List<&2, A>:
342 List.reverse(&2, A, visit.go(~C, ~A, ~f, nodes, c, [], None{}, 0, []))