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

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

# a leaf that is a lowercase name: its token. The rule matches a leaf's kind
# here and in bound.is_eq only; the rest reads kinds through these
def lone.name(nn: Tree.Node) -> Maybe<&2, Lex.Tok>:
  match nn:
    case Tree.Leaf{Lex.Tok{Lex.TName{}, t, l, c}}:
      Some{Lex.Tok{Lex.TName{}, t, l, c}}
    case other:
      None{}

Uses (4):
  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/syntax/lex.bend&name=Tok
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/lex.bend&name=TokKind
  https://jend.leeeet.dev/definition.txt?path=bolt@1.27.0.0/src/syntax/tree.bend&name=Node