@ttsc/lint 0.10.2 → 0.11.0-dev.20260517

package/linthost/print_engine.go

@@ -0,0 +1,343 @@
+package linthost
+
+import "strings"
+
+// Printer engine: lay out a Doc tree under a column budget.
+//
+// The algorithm is the same fit-or-break decision Prettier and dprint
+// use, originally from Wadler's "A Prettier Printer" with Lindig's
+// strictness fix:
+//
+//  1. Walk a stack of (indent, mode, doc) frames.
+//  2. When a Group is popped in unknown mode, peek ahead to see whether
+//     its flat layout fits within the remaining columns on the current
+//     line. The peek uses a separate stack so the main walk is not
+//     disturbed.
+//  3. If it fits, the group renders flat: Lines collapse to single
+//     spaces, Softlines to nothing, IfBreak picks the flat side.
+//  4. If it does not fit, the group renders broken: Lines and Softlines
+//     emit newline+indent, IfBreak picks the break side, every nested
+//     Group is measured again under its own remaining-column budget
+//     (this is the strictness fix; a naive "broken propagates to all
+//     descendants" rule produces uglier output for nested structures).
+//  5. Hardline always emits a newline and forces its enclosing Group
+//     into broken mode irrespective of width.
+//  6. LineSuffix output is queued in a local buffer and flushed on the
+//     next newline emission, so trailing comments stick to their
+//     originating source line.
+//
+// The engine does not modify the input Doc tree, so the same tree can
+// be printed multiple times (e.g. for testing under several widths).
+
+// PrintOptions configures the layout pass.
+//
+// PrintWidth is the column budget per line (Prettier's `printWidth`).
+// TabWidth is the indentation increment in columns (Prettier's
+// `tabWidth`). UseTabs swaps space indentation for tab characters; when
+// it is true the printer emits one tab per `TabWidth` columns and falls
+// back to spaces for the remainder, matching dprint's "indent with
+// tabs, align with spaces" convention.
+//
+// EndOfLine is the line terminator: "lf" (default) or "crlf".
+//
+// StartingColumn is the column the first character of the printed
+// output will land in. When the printer is invoked to reflow an
+// interior node (e.g. an object literal that begins partway through
+// its enclosing source line), fit measurement must charge that
+// column against the remaining budget.
+//
+// BaseIndent is the column continuation lines indent to. It is
+// usually the indent of the line containing the printed node — not
+// the column of the node itself. The two differ for "right-hand-side"
+// reflows such as `const x = { … }`: the `{` may live at column 10
+// but its broken-form children should indent to column 2
+// (BaseIndent=0 + indentUnit=2), matching every JS formatter's
+// convention of indenting relative to the surrounding line's left
+// edge.
+//
+// Asymmetry on the first line: the engine never emits an indent for
+// the first character of the printed output. The first line uses
+// `StartingColumn` only — fit measurement charges it, but
+// `writeIndent` is not called. Every newline after that emits
+// `BaseIndent` plus any nested `Indent` contributions, which is what
+// makes the close brace of a reflowed list land at `BaseIndent`
+// while its children sit at `BaseIndent + indentUnit`.
+//
+// Defaults of 0 keep the engine usable for top-of-file reflow without
+// a wrapper.
+type PrintOptions struct {
+  PrintWidth     int
+  TabWidth       int
+  UseTabs        bool
+  EndOfLine      string
+  StartingColumn int
+  BaseIndent     int
+}
+
+// DefaultPrintOptions returns the Prettier defaults: 80-column lines,
+// 2-space indentation, LF line terminators.
+func DefaultPrintOptions() PrintOptions {
+  return PrintOptions{PrintWidth: 80, TabWidth: 2, UseTabs: false, EndOfLine: "lf"}
+}
+
+// printMode is the per-group choice made by the fit measurement.
+type printMode uint8
+
+const (
+  modeFlat  printMode = iota // group fits flat
+  modeBreak                  // group renders broken
+)
+
+// printFrame is one entry on the layout stack.
+type printFrame struct {
+  indent int
+  mode   printMode
+  doc    Doc
+}
+
+// Print renders the doc tree under the supplied options and returns the
+// resulting string. The output never contains a trailing line break the
+// doc tree did not request; trailing whitespace inside text fragments
+// is preserved verbatim.
+func Print(doc Doc, opts PrintOptions) string {
+  if opts.PrintWidth <= 0 {
+    opts.PrintWidth = 80
+  }
+  if opts.TabWidth <= 0 {
+    opts.TabWidth = 2
+  }
+  if opts.EndOfLine == "" {
+    opts.EndOfLine = "lf"
+  }
+  newline := "\n"
+  if opts.EndOfLine == "crlf" {
+    newline = "\r\n"
+  }
+
+  var out strings.Builder
+  col := opts.StartingColumn
+  var lineSuffix []Doc
+  stack := []printFrame{{indent: opts.BaseIndent, mode: modeBreak, doc: doc}}
+
+  flushLineSuffix := func() {
+    if len(lineSuffix) == 0 {
+      return
+    }
+    // LineSuffix children must land *before* the newline that
+    // triggered the flush. Render them synchronously into the
+    // output buffer. LineSuffix payloads are leaf-ish by contract
+    // (the canonical use is a trailing `// comment` Text), so a
+    // recursive Print is bounded and avoids the lifecycle hazard
+    // of pushing onto the main stack — which would queue the
+    // docs after the caller has already written the newline,
+    // inverting the source order.
+    pending := lineSuffix
+    lineSuffix = nil
+    for _, d := range pending {
+      s := Print(d, opts)
+      out.WriteString(s)
+      if idx := strings.LastIndex(s, "\n"); idx >= 0 {
+        col = len(s) - idx - 1
+      } else {
+        col += len(s)
+      }
+    }
+  }
+
+  writeIndent := func(indent int) int {
+    if opts.UseTabs {
+      tabs := indent / opts.TabWidth
+      spaces := indent - tabs*opts.TabWidth
+      for i := 0; i < tabs; i++ {
+        out.WriteByte('\t')
+      }
+      for i := 0; i < spaces; i++ {
+        out.WriteByte(' ')
+      }
+      return tabs*opts.TabWidth + spaces
+    }
+    for i := 0; i < indent; i++ {
+      out.WriteByte(' ')
+    }
+    return indent
+  }
+
+  for len(stack) > 0 {
+    top := stack[len(stack)-1]
+    stack = stack[:len(stack)-1]
+
+    switch top.doc.Kind {
+    case docNil:
+      // no-op
+    case docText:
+      out.WriteString(top.doc.Text)
+      // Update column. A text fragment may contain embedded
+      // newlines (verbatim slices). The column tracker counts
+      // from the last newline.
+      if idx := strings.LastIndex(top.doc.Text, "\n"); idx >= 0 {
+        col = len(top.doc.Text) - idx - 1
+      } else {
+        col += len(top.doc.Text)
+      }
+    case docConcat:
+      // Push children in reverse so they pop in source order.
+      for i := len(top.doc.Children) - 1; i >= 0; i-- {
+        stack = append(stack, printFrame{indent: top.indent, mode: top.mode, doc: top.doc.Children[i]})
+      }
+    case docIndent:
+      child := Concat(top.doc.Children...)
+      stack = append(stack, printFrame{indent: top.indent + top.doc.Width, mode: top.mode, doc: child})
+    case docAlign:
+      child := Concat(top.doc.Children...)
+      stack = append(stack, printFrame{indent: col, mode: top.mode, doc: child})
+    case docGroup:
+      // Try flat unless the group contains a hardline.
+      child := Concat(top.doc.Children...)
+      if fits(child, opts.PrintWidth-col, top.indent) {
+        stack = append(stack, printFrame{indent: top.indent, mode: modeFlat, doc: child})
+      } else {
+        stack = append(stack, printFrame{indent: top.indent, mode: modeBreak, doc: child})
+      }
+    case docIfBreak:
+      pick := top.doc.Children[1] // flat
+      if top.mode == modeBreak {
+        pick = top.doc.Children[0]
+      }
+      stack = append(stack, printFrame{indent: top.indent, mode: top.mode, doc: pick})
+    case docLineSuffix:
+      lineSuffix = append(lineSuffix, top.doc.Children...)
+    case docLine:
+      if top.mode == modeFlat {
+        out.WriteByte(' ')
+        col++
+      } else {
+        flushLineSuffix()
+        out.WriteString(newline)
+        col = writeIndent(top.indent)
+      }
+    case docSoftline:
+      if top.mode == modeFlat {
+        // renders to nothing
+      } else {
+        flushLineSuffix()
+        out.WriteString(newline)
+        col = writeIndent(top.indent)
+      }
+    case docHardline:
+      flushLineSuffix()
+      out.WriteString(newline)
+      col = writeIndent(top.indent)
+    case docLiteralline:
+      flushLineSuffix()
+      out.WriteString(newline)
+      col = 0
+    }
+  }
+
+  // Drain any line suffix that never met a break. They flow inline.
+  // Keep `col` in sync with what we emit so any future post-drain
+  // emission can rely on the invariant; today the drain is the last
+  // statement, but the bookkeeping discipline shouldn't depend on
+  // that.
+  for _, d := range lineSuffix {
+    s := Print(d, opts)
+    out.WriteString(s)
+    if idx := strings.LastIndex(s, "\n"); idx >= 0 {
+      col = len(s) - idx - 1
+    } else {
+      col += len(s)
+    }
+  }
+  _ = col
+
+  return out.String()
+}
+
+// fits reports whether `doc` renders flat within `remaining` columns,
+// where the current indent is `indent`. The peek is iterative and
+// stops at the first break-forcing event:
+//
+//   - a Hardline / Literalline: the doc cannot render flat.
+//   - a Text that overflows: the doc does not fit.
+//   - a Line / Softline encountered in *flat* mode: counts as space
+//     (Line) or empty (Softline) and the walk continues.
+//   - a Line / Softline encountered while the engine has already
+//     committed the enclosing group to break mode: the peek returns
+//     true immediately because the upstream caller will not place this
+//     doc on the current line at all (the newline absorbs the
+//     remaining budget).
+//
+// The implementation is a small interpreter that mirrors the main loop,
+// but it only tracks remaining columns and only handles the subset of
+// kinds that matter for measurement.
+func fits(doc Doc, remaining int, indent int) bool {
+  if remaining < 0 {
+    return false
+  }
+  type frame struct {
+    mode printMode
+    doc  Doc
+  }
+  stack := []frame{{mode: modeFlat, doc: doc}}
+  for len(stack) > 0 {
+    top := stack[len(stack)-1]
+    stack = stack[:len(stack)-1]
+    switch top.doc.Kind {
+    case docNil:
+    case docText:
+      remaining -= len(top.doc.Text)
+      if remaining < 0 {
+        return false
+      }
+      // A Text whose payload spans multiple lines cannot render
+      // flat — by definition its flat form is multi-line. Returning
+      // true here would let the surrounding group commit to a flat
+      // layout that already contains a newline, defeating the entire
+      // fit-or-break decision. Force the caller to broken mode.
+      if strings.Contains(top.doc.Text, "\n") {
+        return false
+      }
+    case docConcat:
+      for i := len(top.doc.Children) - 1; i >= 0; i-- {
+        stack = append(stack, frame{mode: top.mode, doc: top.doc.Children[i]})
+      }
+    case docIndent, docAlign:
+      for i := len(top.doc.Children) - 1; i >= 0; i-- {
+        stack = append(stack, frame{mode: top.mode, doc: top.doc.Children[i]})
+      }
+    case docGroup:
+      // Measure nested groups in flat mode too — that is the
+      // standard Wadler choice: the outer group's "does my
+      // flat form fit" question is answered by treating every
+      // inner group as flat.
+      for i := len(top.doc.Children) - 1; i >= 0; i-- {
+        stack = append(stack, frame{mode: modeFlat, doc: top.doc.Children[i]})
+      }
+    case docIfBreak:
+      pick := top.doc.Children[1]
+      if top.mode == modeBreak {
+        pick = top.doc.Children[0]
+      }
+      stack = append(stack, frame{mode: top.mode, doc: pick})
+    case docLineSuffix:
+      // Line suffix never contributes to flat width — it queues
+      // for a future break. Skip.
+    case docLine:
+      if top.mode == modeFlat {
+        remaining--
+        if remaining < 0 {
+          return false
+        }
+      } else {
+        return true
+      }
+    case docSoftline:
+      if top.mode == modeBreak {
+        return true
+      }
+    case docHardline, docLiteralline:
+      return false
+    }
+  }
+  return true
+}

package/linthost/print_nodes_array.go

@@ -0,0 +1,46 @@
+package linthost
+
+import (
+  shimast "github.com/microsoft/typescript-go/shim/ast"
+)
+
+// printArrayLiteral renders an ArrayLiteralExpression with width-aware
+// fit-or-break. Like the object printer, elements are emitted verbatim
+// — only the outer brackets and the inter-element commas participate
+// in reflow.
+//
+// Flat:    `[1, 2, 3]`
+// Broken:  `[
+//
+//     1,
+//     2,
+//     3,
+//  ]`
+//
+// Array literals do NOT carry a leading/trailing space inside the
+// brackets in flat mode (`[a, b]`, not `[ a, b ]`), matching every
+// JavaScript formatter. Empty arrays collapse to `[]`.
+func printArrayLiteral(ctx *PrintContext, node *shimast.Node) Doc {
+  if node == nil {
+    return Doc{}
+  }
+  arr := node.AsArrayLiteralExpression()
+  if arr == nil || arr.Elements == nil {
+    return verbatim(ctx, node)
+  }
+  items := make([]Doc, 0, len(arr.Elements.Nodes))
+  for _, elem := range arr.Elements.Nodes {
+    if elem == nil {
+      return verbatim(ctx, node)
+    }
+    doc, _ := PrintNode(ctx, elem)
+    items = append(items, doc)
+  }
+  return printList(ctx, listShape{
+    OpenTok:  "[",
+    CloseTok: "]",
+    Items:    items,
+    Space:    false,
+    AddComma: true,
+  })
+}

package/linthost/print_nodes_call.go

@@ -0,0 +1,180 @@
+package linthost
+
+import (
+  shimast "github.com/microsoft/typescript-go/shim/ast"
+)
+
+// printCallExpression renders a CallExpression with width-aware
+// argument reflow. The callee, optional question token (`?.`) and
+// optional type-argument list are emitted verbatim — only the
+// argument list participates in reflow.
+//
+// Flat:    `foo(a, b, c)`
+// Broken:  `foo(
+//
+//     a,
+//     b,
+//     c,
+//  )`
+//
+// Type arguments (`foo<A, B>(x)`) are preserved verbatim. Trailing
+// commas on type arguments are intentionally avoided — Prettier omits
+// them too (see prettier#10353).
+func printCallExpression(ctx *PrintContext, node *shimast.Node) Doc {
+  if node == nil {
+    return Doc{}
+  }
+  call := node.AsCallExpression()
+  if call == nil {
+    return verbatim(ctx, node)
+  }
+  parts := []Doc{}
+  if call.Expression != nil {
+    parts = append(parts, verbatim(ctx, call.Expression))
+  }
+  // Question-dot for optional call: `foo?.(x)`. The token byte range
+  // lives between Expression.End() and the open paren; copy
+  // verbatim if present.
+  if call.QuestionDotToken != nil {
+    parts = append(parts, verbatim(ctx, call.QuestionDotToken))
+  }
+  if call.TypeArguments != nil {
+    // Verbatim range covering `<A, B>` punctuation and members.
+    parts = append(parts, verbatimRange(ctx.Source, callTypeArgsStart(ctx, call), callTypeArgsEnd(ctx, call)))
+  }
+  if hasNilEntry(call.Arguments) {
+    return verbatim(ctx, node)
+  }
+  parts = append(parts, printArgList(ctx, call.Arguments))
+  return Concat(parts...)
+}
+
+// printNewExpression renders a NewExpression. It mirrors the call
+// expression printer; the only difference is the leading `new ` keyword
+// and the optional argument list (NewExpression may omit args entirely,
+// e.g. `new Foo`).
+func printNewExpression(ctx *PrintContext, node *shimast.Node) Doc {
+  if node == nil {
+    return Doc{}
+  }
+  ne := node.AsNewExpression()
+  if ne == nil {
+    return verbatim(ctx, node)
+  }
+  parts := []Doc{Text("new ")}
+  if ne.Expression != nil {
+    parts = append(parts, verbatim(ctx, ne.Expression))
+  }
+  if ne.TypeArguments != nil {
+    parts = append(parts, verbatimRange(ctx.Source, newTypeArgsStart(ctx, ne), newTypeArgsEnd(ctx, ne)))
+  }
+  if ne.Arguments != nil {
+    if hasNilEntry(ne.Arguments) {
+      return verbatim(ctx, node)
+    }
+    parts = append(parts, printArgList(ctx, ne.Arguments))
+  }
+  return Concat(parts...)
+}
+
+// hasNilEntry reports whether any entry of `list` is a nil pointer.
+// Per-node printers consult this before delegating to printArgList /
+// printList — a nil child would render as an empty Doc and produce
+// `(a, , b)` in the output. Bailing to verbatim is byte-safe.
+func hasNilEntry(list *shimast.NodeList) bool {
+  if list == nil {
+    return false
+  }
+  for _, n := range list.Nodes {
+    if n == nil {
+      return true
+    }
+  }
+  return false
+}
+
+// printArgList renders an argument node list. The shared printList
+// handles the open-comma-close shape; this helper just gathers the
+// per-argument docs.
+func printArgList(ctx *PrintContext, list *shimast.NodeList) Doc {
+  if list == nil {
+    return Text("()")
+  }
+  items := make([]Doc, 0, len(list.Nodes))
+  for _, arg := range list.Nodes {
+    doc, _ := PrintNode(ctx, arg)
+    items = append(items, doc)
+  }
+  return printList(ctx, listShape{
+    OpenTok:  "(",
+    CloseTok: ")",
+    Items:    items,
+    Space:    false,
+    AddComma: true,
+  })
+}
+
+// Type-argument byte-range helpers. The shim's NodeList.End() points
+// past the last argument; the surrounding `<` and `>` are not part of
+// the list's range, so we have to scan around it.
+func callTypeArgsStart(ctx *PrintContext, call *shimast.CallExpression) int {
+  if call.TypeArguments == nil || len(call.TypeArguments.Nodes) == 0 {
+    return -1
+  }
+  first := call.TypeArguments.Nodes[0]
+  if first == nil {
+    return -1
+  }
+  // `<` is the byte immediately before the first type argument
+  // (modulo whitespace).
+  pos := first.Pos()
+  for i := pos - 1; i >= 0; i-- {
+    if ctx.Source[i] == '<' {
+      return i
+    }
+  }
+  return -1
+}
+
+func callTypeArgsEnd(ctx *PrintContext, call *shimast.CallExpression) int {
+  if call.TypeArguments == nil {
+    return -1
+  }
+  end := call.TypeArguments.End()
+  for i := end; i < len(ctx.Source); i++ {
+    if ctx.Source[i] == '>' {
+      return i + 1
+    }
+  }
+  return end
+}
+
+func newTypeArgsStart(ctx *PrintContext, ne *shimast.NewExpression) int {
+  if ne.TypeArguments == nil || len(ne.TypeArguments.Nodes) == 0 {
+    return -1
+  }
+  first := ne.TypeArguments.Nodes[0]
+  if first == nil {
+    return -1
+  }
+  pos := first.Pos()
+  for i := pos - 1; i >= 0; i-- {
+    if ctx.Source[i] == '<' {
+      return i
+    }
+  }
+  return -1
+}
+
+func newTypeArgsEnd(ctx *PrintContext, ne *shimast.NewExpression) int {
+  if ne.TypeArguments == nil {
+    return -1
+  }
+  end := ne.TypeArguments.End()
+  for i := end; i < len(ctx.Source); i++ {
+    if ctx.Source[i] == '>' {
+      return i + 1
+    }
+  }
+  return end
+}