def Seq.tree

bend-lint-rules@0.2.0.0 · layout/format.bend:1566

import Base

1566def Seq.tree(+n: Tree, d: Doc, next: Maybe<&2, Tree>, raw: Bool, s: Seq) -> Seq:
1567  match s:
1568    case Seq{out, chain, None{}, levels, skip}:
1569      Seq.put(Seq{out, chain, Some{n}, levels, False{}}, d)
1570    case Seq{out, chain, Some{p}, levels, skip}:
1571      Seq.put(
1572        Seq.joint(
1573          Bool.not(
1574            raw
1575          )
1576            && is_leaf(n)
1577            && is_operator(Token.sym(first(n)))
1578            && Bool.not(is_glued_prefix(first(n), next)),
1579          p,
1580          n,
1581          Seq{out, chain, Some{n}, levels, False{}}
1582        ),
1583        d
1584      )