def walk

bolt@1.27.0.0 · src/rules/suspicious/prefix.bend:276

import Base
import bolt@1.27.0.0/src/finding.bend as F
import bolt@1.27.0.0/src/syntax/lex.bend as Lex

276# every run of either shape among the tokens, in order
277def walk(toks: List<&2, Lex.Tok>, +path: String) -> List<&2, F.Finding>:
278  match toks:
279    case Nil{}:
280      Nil{}
281    case Con{Lex.Tok{+k, +t, +l, +c}, +rest}:
282      hit(at(k, t, rest), path, l, c, walk(rest, path))