Concat.bound.of: def of bolt@1.27.0.0
Import: import bolt@1.27.0.0/src/rules/suspicious/concat.bend as Concat
Lines 130-136 of bolt@1.27.0.0/src/rules/suspicious/concat.bend: https://jend.leeeet.dev/read.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&start_line=130&end_line=136

import Base
import bolt@1.27.0.0/src/syntax/lex.bend as Lex
import bolt@1.27.0.0/src/syntax/tree.bend as Tree
import bolt@1.27.0.0/src/rules/calls.bend as Calls
import bolt@1.27.0.0/src/lazy/lazy.bend as Lazy

# a name, then `=`, then the right side: the let
def bound.of(mm: Maybe<&2, Lex.Tok>, +h2: Tree.Node, rhs: Tree.Node) -> Maybe<&2, Let>:
  match mm:
    case None{}:
      None{}
    case Some{Lex.Tok{k, +t, l, c}}:
      Lazy.stop(Maybe<&2, Let>, Bool.not(Calls.kind.leaf(~bound.eq, h2)), None{}, _u => Some{Let{t, onto(rhs)}})

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool.not
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Maybe
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/lazy/lazy.bend&name=stop
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/calls.bend&name=kind.leaf
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&name=Let
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&name=bound.eq
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&name=onto
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/lex.bend&name=Tok
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=Node