ListIndexLoop.call: def of bend-lint-rules@0.2.0.0
Import: import bend-lint-rules@0.2.0.0/performance/list_index_loop.bend as ListIndexLoop
Lines 277-296 of bend-lint-rules@0.2.0.0/performance/list_index_loop.bend: https://jend.leeeet.dev/read.txt?path=bend-lint-rules@0.2.0.0/performance/list_index_loop.bend&start_line=277&end_line=296

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

def call(
  recursive: Bool,
  +loop: Loop,
  path: List<&2, Lint.Above>,
  node: Lint.Node
) -> List<&2, Lint.Finding>:
  match recursive loop node:
    case False{} Loop{
      walkers,
      owner
    } Lint.Node{
      Lint.Application{},
      n,
      span,
      Con{Lint.Node{Lint.Reference{t}, callee, rs, rk, rf}, args},
      f
    }:
      judged(Names.lookup(Walker, t, walkers), args, callee, owner, path, span)
    case _ _ _:
      []

Uses (10):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/linter/lint.bend&name=Above
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/linter/lint.bend&name=Finding
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/linter/lint.bend&name=Node
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/linter/lint.bend&name=Syntax
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/shared/names.bend&name=lookup
  https://jend.leeeet.dev/definition.txt?path=bend-lint-rules@0.2.0.0/performance/list_index_loop.bend&name=Loop
  https://jend.leeeet.dev/definition.txt?path=bend-lint-rules@0.2.0.0/performance/list_index_loop.bend&name=Walker
  https://jend.leeeet.dev/definition.txt?path=bend-lint-rules@0.2.0.0/performance/list_index_loop.bend&name=judged