Concat.bound: def of bolt@1.27.0.0
Import: import bolt@1.27.0.0/src/rules/suspicious/concat.bend as Concat
Lines 151-159 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=151&end_line=159

import Base
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

# the let a statement's own tokens make, when it binds one plain name with
# `=`, bare or `+`
def bound(kids: Tree.Node) -> Maybe<&2, Let>:
  match kids:
    case Tree.NCons{+h1, Tree.NCons{+h2, +rest}}:
      Lazy.either(Maybe<&2, Let>, Calls.kind.leaf(~Calls.kind.oper, h1), _u => bound.plus(h1, h2, rest),
        _v => bound.named(h1, h2, rest))
    case other:
      None{}

Uses (8):
  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=either
  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/calls.bend&name=kind.oper
  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.named
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&name=bound.plus
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=Node