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

import Base
import bolt@1.27.0.0/src/syntax/tree.bend as Tree

# a plain name, then `=`, then the right side: the let
def bound.named(+hh: Tree.Node, +h2: Tree.Node, rhs: Tree.Node) -> Maybe<&2, Let>:
  bound.of(lone.name(hh), h2, rhs)

Uses (5):
  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/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.of
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/rules/suspicious/concat.bend&name=lone.name
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=Node