def call

bend-lint-rules@0.2.0.0 · performance/list_index_loop.bend:277

import Base
import bend-lint-api@0.2.0.0/linter/lint.bend as Lint
import bend-lint-api@0.2.0.0/shared/names.bend as Names

277def call(
278  recursive: Bool,
279  +loop: Loop,
280  path: List<&2, Lint.Above>,
281  node: Lint.Node
282) -> List<&2, Lint.Finding>:
283  match recursive loop node:
284    case False{} Loop{
285      walkers,
286      owner
287    } Lint.Node{
288      Lint.Application{},
289      n,
290      span,
291      Con{Lint.Node{Lint.Reference{t}, callee, rs, rk, rf}, args},
292      f
293    }:
294      judged(Names.lookup(Walker, t, walkers), args, callee, owner, path, span)
295    case _ _ _:
296      []