ListIndexLoop.innermost: 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 157-165 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=157&end_line=165

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

# The innermost case above `path`, if any: a call of the loop must be in it to pass the list on in the same branch.
def innermost(path: List<&2, Lint.Above>, owner: Lint.Node) -> Lint.Node:
  match path:
    case Nil{}:
      owner
    case Con{Lint.Above{Lint.Node{Lint.Case{}, n, s, k, f}, at}, rest}:
      Lint.Node{Lint.Case{}, n, s, k, f}
    case Con{a, rest}:
      innermost(rest, owner)

Uses (4):
  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=Node
  https://jend.leeeet.dev/definition.txt?path=bend-lint-api@0.2.0.0/linter/lint.bend&name=Syntax