def search.bound

bolt@1.27.0.0 · src/rules/correctness/pick.bend:318

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
import bolt@1.27.0.0/src/syntax/tree.bend as Tree

318# a let's own tokens past any `+`: the leaf of the bound name
319def search.bound(nn: Tree.Node, rest: Tree.Node, +name: String, +path: String) -> List<&2, F.Finding>:
320  match nn:
321    case Tree.NCons{Tree.Leaf{Lex.Tok{kx, +x, _lx, _cx}}, r1}:
322      search.eq(kx, x, r1, rest, name, path)
323    case _other:
324      []