@flanksource/clicky-ui 0.3.55 → 0.3.56

package/dist/data/lint/grouping.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"grouping.cjs","names":["matchesFilterState","normalizeLintPath","severityOf","relPath","decorateLintFile","collapsedPathSegments","worstSeverity","linterErrorMessage","isLinterErrored","slugify"],"sources":["../../../src/data/lint/grouping.ts"],"sourcesContent":["// Turns raw linter results into the selectable tree for each grouping. Ported\n// from gavel's testrunner/ui utils.ts. Differences from the original:\n//   - a linter that failed to run is shown under every grouping (gavel only\n//     showed it in `summary`), so a broken linter never reads as a clean run;\n//   - single-child folder chains are really collapsed (\"pkg > sub > a.go\");\n//     gavel's collapser never fired because folder nodes always carry a\n//     passed/failed flag;\n//   - file-scoped rule leaves in `file-linter-rule` carry their work_dir, so\n//     ignore actions on them are not sent without one.\n\nimport { matchesFilterState } from \"../test-runner/filterState\";\nimport { slugify } from \"../test-runner/routePath\";\nimport { collapsedPathSegments, decorateLintFile, normalizeLintPath, relPath } from \"./paths\";\nimport { isLinterErrored, linterErrorMessage, severityOf, worstSeverity } from \"./stats\";\nimport type {\n  LintFilters,\n  LintGrouping,\n  LintNode,\n  LinterResult,\n  Violation,\n} from \"./types\";\n\ntype Draft = Omit<LintNode, \"route_path\" | \"children\"> & { children?: Draft[] };\n\ntype FlatViolation = {\n  linter: string;\n  result: LinterResult;\n  v: Violation;\n  file: string | undefined;\n  rawFile: string | undefined;\n  workDir: string | undefined;\n};\n\ntype FileBucket = { rawFile: string; workDir: string | undefined; violations: Violation[] };\n\ntype Trie<L> = {\n  name: string;\n  path: string | undefined;\n  rawPath: string;\n  folders: Map<string, Trie<L>>;\n  leaves: Map<string, L>;\n};\n\nconst NO_RULE = \"(no rule)\";\nconst SUMMARY_FILE_LIMIT = 5;\n\nfunction ruleKeyFor(v: Violation): string {\n  return v.rule?.method || NO_RULE;\n}\n\nfunction byLine(violations: readonly Violation[]): Violation[] {\n  return violations.slice().sort((a, b) => (a.line ?? 0) - (b.line ?? 0));\n}\n\nfunction firstLine(s: string): string {\n  const idx = s.indexOf(\"\\n\");\n  return idx === -1 ? s : s.slice(0, idx);\n}\n\nfunction groupBy<T, K>(items: readonly T[], key: (item: T) => K): Map<K, T[]> {\n  const out = new Map<K, T[]>();\n  for (const item of items) {\n    const list = out.get(key(item));\n    if (list) list.push(item);\n    else out.set(key(item), [item]);\n  }\n  return out;\n}\n\nfunction sortedKeys<V>(map: Map<string, V>): string[] {\n  return Array.from(map.keys()).sort();\n}\n\n// ---------------------------------------------------------------------------\n// Flattening\n\nfunction flattenLint(results: readonly LinterResult[], filters: LintFilters): FlatViolation[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const multiRoot = new Set(visible.flatMap((r) => (r.work_dir ? [normalizeLintPath(r.work_dir)] : []))).size > 1;\n  const out: FlatViolation[] = [];\n  for (const result of visible) {\n    for (const v of result.violations ?? []) {\n      if (!matchesFilterState(severityOf(v), filters.severity)) continue;\n      const rawFile = relPath(v.file, result.work_dir);\n      const file = decorateLintFile(rawFile, result.work_dir, multiRoot);\n      out.push({\n        linter: result.linter,\n        result,\n        v: { ...v, raw_file: rawFile, file },\n        file,\n        rawFile,\n        workDir: result.work_dir,\n      });\n    }\n  }\n  return out;\n}\n\nfunction linterMetaOf(results: readonly LinterResult[]): Map<string, LinterResult> {\n  const meta = new Map<string, LinterResult>();\n  for (const r of results) if (!meta.has(r.linter)) meta.set(r.linter, r);\n  return meta;\n}\n\n// ---------------------------------------------------------------------------\n// Path trie\n\nfunction newTrie<L>(): Trie<L> {\n  return { name: \"\", path: undefined, rawPath: \"\", folders: new Map(), leaves: new Map() };\n}\n\n/** The leaf for `file`, created through `create` on first sight; folders are made on the way. */\nfunction trieLeaf<L>(root: Trie<L>, file: string, rawFile: string, create: () => L): L {\n  const segments = collapsedPathSegments(file);\n  const rawSegments = collapsedPathSegments(rawFile);\n  if (segments.length === 0 || rawSegments.length === 0) {\n    throw new Error(`lint: cannot place violation, empty path (file=${JSON.stringify(file)}, raw=${JSON.stringify(rawFile)})`);\n  }\n  const folderSegments = segments.slice(0, -1);\n  const rawFolderSegments = rawSegments.slice(0, -1);\n  // The decorated path may carry extra leading segments (the work dir label)\n  // that the raw, work_dir-relative path does not.\n  const rawOffset = folderSegments.length - rawFolderSegments.length;\n  let current = root;\n  folderSegments.forEach((segment, i) => {\n    let child = current.folders.get(segment);\n    if (!child) {\n      const rawCount = Math.max(0, Math.min(rawFolderSegments.length, i + 1 - rawOffset));\n      child = {\n        name: segment,\n        path: current.path ? `${current.path}/${segment}` : segment,\n        rawPath: rawFolderSegments.slice(0, rawCount).join(\"/\"),\n        folders: new Map(),\n        leaves: new Map(),\n      };\n      current.folders.set(segment, child);\n    }\n    current = child;\n  });\n  const basename = segments[segments.length - 1]!;\n  let leaf = current.leaves.get(basename);\n  if (!leaf) {\n    leaf = create();\n    current.leaves.set(basename, leaf);\n  }\n  return leaf;\n}\n\n// ---------------------------------------------------------------------------\n// Node builders\n\nfunction container(name: string, kind: Draft[\"kind\"], children: Draft[]): Draft {\n  const failed = children.some((c) => c.failed);\n  return { name, kind, children, failed, passed: !failed, skipped: false };\n}\n\nfunction uniqueWorkDir(children: readonly Draft[]): string | undefined {\n  const dirs = new Set(children.flatMap((c) => (c.work_dir ? [c.work_dir] : [])));\n  return dirs.size === 1 ? Array.from(dirs)[0] : undefined;\n}\n\nfunction withNoFileViolations(node: Draft, noFile: readonly Violation[]): Draft {\n  if (noFile.length === 0) return node;\n  const failed = node.failed || worstSeverity(noFile) !== \"info\";\n  return { ...node, noFileViolations: byLine(noFile), failed, passed: !failed };\n}\n\nfunction violationLeaf(args: {\n  name: string;\n  kind: \"lint-file\" | \"lint-rule\";\n  file: string;\n  rawFile: string;\n  linterName: string;\n  violations: readonly Violation[];\n  workDir: string | undefined;\n}): Draft {\n  const failed = worstSeverity(args.violations) !== \"info\";\n  return {\n    name: args.name,\n    kind: args.kind,\n    file: args.file,\n    target_path: args.rawFile,\n    work_dir: args.workDir,\n    linterName: args.linterName,\n    violations: byLine(args.violations),\n    failed,\n    passed: !failed,\n    skipped: false,\n  };\n}\n\nfunction linterNode(\n  linterName: string,\n  result: LinterResult | undefined,\n  children: Draft[],\n  noFile: readonly Violation[] = [],\n): Draft {\n  return withNoFileViolations({ ...container(linterName, \"linter\", children), linter: result, linterName }, noFile);\n}\n\nfunction linterErrorNode(result: LinterResult): Draft {\n  const message = linterErrorMessage(result);\n  return {\n    name: firstLine(message),\n    kind: \"linter-error\",\n    linterName: result.linter,\n    linter: result,\n    work_dir: result.work_dir,\n    failed: true,\n    passed: false,\n    skipped: false,\n    message,\n  };\n}\n\nfunction fileNodes(trie: Trie<FileBucket>, linterName: string, ruleName?: string): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileNodes(folder, linterName, ruleName));\n    return {\n      ...node,\n      file: folder.path,\n      target_path: folder.rawPath,\n      linterName,\n      ...(ruleName ? { ruleName } : {}),\n      work_dir: uniqueWorkDir(node.children!),\n    };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const bucket = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const leaf = violationLeaf({\n      name: key,\n      kind: \"lint-file\",\n      file: fullPath,\n      rawFile: bucket.rawFile,\n      linterName,\n      violations: bucket.violations,\n      workDir: bucket.workDir,\n    });\n    return ruleName ? { ...leaf, ruleName } : leaf;\n  });\n  return [...folders, ...files];\n}\n\ntype FileLinters = Map<string, { workDir: string | undefined; rules: Map<string, Violation[]> }>;\n\nfunction fileLinterNodes(trie: Trie<FileLinters>, linterMeta: Map<string, LinterResult>): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileLinterNodes(folder, linterMeta));\n    return { ...node, file: folder.path, target_path: folder.rawPath, work_dir: uniqueWorkDir(node.children!) };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const linters = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const linterDrafts = sortedKeys(linters).map((linterName) => {\n      const { workDir, rules } = linters.get(linterName)!;\n      const ruleLeaves = sortedKeys(rules).map((rule) => {\n        const violations = rules.get(rule)!;\n        return {\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: fullPath,\n            rawFile: violations[0]?.raw_file ?? fullPath,\n            linterName,\n            violations,\n            workDir,\n          }),\n          ruleName: rule,\n        };\n      });\n      return {\n        ...linterNode(linterName, linterMeta.get(linterName), ruleLeaves),\n        file: fullPath,\n        target_path: ruleLeaves[0]?.target_path,\n        work_dir: workDir,\n      };\n    });\n    return {\n      ...container(key, \"lint-file\", linterDrafts),\n      file: fullPath,\n      target_path: linterDrafts[0]?.target_path,\n      work_dir: uniqueWorkDir(linterDrafts),\n    };\n  });\n  return [...folders, ...files];\n}\n\n// ---------------------------------------------------------------------------\n// Groupings\n\nfunction fileTrieFor(flat: readonly FlatViolation[]): Trie<FileBucket> {\n  const trie = newTrie<FileBucket>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    trieLeaf(trie, f.file, f.rawFile ?? f.file, () => ({\n      rawFile: f.rawFile ?? f.file!,\n      workDir: f.workDir,\n      violations: [],\n    })).violations.push(f.v);\n  }\n  return trie;\n}\n\nfunction groupByLinterRuleFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(byLinter.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const ruleNodes = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => {\n          const flats = byRule.get(rule)!;\n          const children = fileNodes(fileTrieFor(flats), linterName, rule);\n          const node = container(rule, \"lint-rule-group\", children);\n          return withNoFileViolations(\n            {\n              ...node,\n              linterName,\n              ruleName: rule,\n              work_dir: uniqueWorkDir(children) ?? meta.get(linterName)?.work_dir,\n            },\n            flats.filter((f) => !f.file).map((f) => f.v),\n          );\n        });\n      return linterNode(linterName, meta.get(linterName), ruleNodes);\n    });\n}\n\nfunction groupByLinterFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const flats = byLinter.get(linterName)!;\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        fileNodes(fileTrieFor(flats), linterName),\n        flats.filter((f) => !f.file).map((f) => f.v),\n      );\n    });\n}\n\nfunction groupByFileLinterRule(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flat = flattenLint(results, filters);\n  const trie = newTrie<FileLinters>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    const linters = trieLeaf(trie, f.file, f.rawFile ?? f.file, () => new Map());\n    let entry = linters.get(f.linter);\n    if (!entry) {\n      entry = { workDir: f.workDir, rules: new Map() };\n      linters.set(f.linter, entry);\n    }\n    const rule = ruleKeyFor(f.v);\n    entry.rules.set(rule, [...(entry.rules.get(rule) ?? []), f.v]);\n  }\n\n  const fileless = groupBy(flat.filter((f) => !f.file), (f) => f.linter);\n  const filelessNodes = Array.from(fileless.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(fileless.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const workDir = meta.get(linterName)?.work_dir;\n      const leaves = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => ({\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: \"\",\n            rawFile: \"\",\n            linterName,\n            violations: byRule.get(rule)!.map((f) => f.v),\n            workDir,\n          }),\n          ruleName: rule,\n          file: undefined,\n          target_path: undefined,\n        }));\n      return linterNode(linterName, meta.get(linterName), leaves);\n    });\n\n  return [...fileLinterNodes(trie, meta), ...filelessNodes];\n}\n\nfunction summaryFileLabel(file: string | undefined, violations: readonly Violation[]): string {\n  if (!file) return \"(no file)\";\n  if (violations.length > 1) return `${file} (${violations.length})`;\n  const v = violations[0];\n  if (v?.line) return v.column ? `${file}:${v.line}:${v.column}` : `${file}:${v.line}`;\n  return file;\n}\n\nfunction summaryRuleNode(rule: string, linterName: string, flats: readonly FlatViolation[]): Draft {\n  const byFile = groupBy(flats, (f) => f.file ?? \"\");\n  const keys = Array.from(byFile.keys());\n  const files: Draft[] = keys.slice(0, SUMMARY_FILE_LIMIT).map((key) => {\n    const group = byFile.get(key)!;\n    return {\n      ...violationLeaf({\n        name: summaryFileLabel(group[0]!.file, group.map((f) => f.v)),\n        kind: \"lint-file\",\n        file: group[0]!.file ?? \"\",\n        rawFile: group[0]!.rawFile ?? \"\",\n        linterName,\n        violations: group.map((f) => f.v),\n        workDir: group[0]!.workDir,\n      }),\n      file: group[0]!.file,\n      target_path: group[0]!.rawFile,\n      ruleName: rule,\n    };\n  });\n  const remaining = keys.length - files.length;\n  if (remaining > 0) {\n    files.push({\n      name: `… ${remaining} more file${remaining === 1 ? \"\" : \"s\"}`,\n      kind: \"lint-file\",\n      linterName,\n      ruleName: rule,\n      failed: false,\n      passed: true,\n      skipped: false,\n    });\n  }\n  const firstMessage = flats.find((f) => f.v.message)?.v.message;\n  const name = firstMessage ? `${rule} (${flats.length}) — ${firstMessage}` : `${rule} (${flats.length})`;\n  return { ...container(name, \"lint-rule-group\", files), linterName, ruleName: rule };\n}\n\nfunction groupBySummary(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flatByLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const skipped = new Map(visible.filter((r) => r.skipped).map((r) => [r.linter, r.error || \"skipped\"]));\n  // Like the CLI --summary: every linter that ran is listed, even a clean one.\n  return Array.from(new Set(visible.map((r) => r.linter)))\n    .sort()\n    .map((linterName) => {\n      const flats = flatByLinter.get(linterName) ?? [];\n      if (flats.length === 0 && skipped.has(linterName)) {\n        return {\n          name: linterName,\n          kind: \"linter\" as const,\n          linter: meta.get(linterName),\n          linterName,\n          skipped: true,\n          passed: false,\n          failed: false,\n          message: `skipped: ${skipped.get(linterName)}`,\n        };\n      }\n      const byRule = groupBy(flats, (f) => ruleKeyFor(f.v));\n      const ruleOrder = Array.from(byRule.keys()).sort(\n        (a, b) => byRule.get(b)!.length - byRule.get(a)!.length || a.localeCompare(b),\n      );\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        ruleOrder.map((rule) => summaryRuleNode(rule, linterName, byRule.get(rule)!)),\n      );\n    });\n}\n\n/** Linters that failed to run get an error leaf in every grouping, merged into an existing linter node. */\nfunction withLinterErrors(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const errors = groupBy(\n    results.filter((r) => isLinterErrored(r) && matchesFilterState(r.linter, filters.linter)),\n    (r) => r.linter,\n  );\n  if (errors.size === 0) return roots;\n  const linters = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  for (const [name, failed] of errors) {\n    const errorNodes = failed.map(linterErrorNode);\n    const existing = linters.get(name);\n    linters.set(\n      name,\n      existing\n        ? { ...existing, children: [...errorNodes, ...(existing.children ?? [])], failed: true, passed: false }\n        : linterNode(name, failed[0], errorNodes),\n    );\n  }\n  const others = roots.filter((n) => n.kind !== \"linter\");\n  return [...others, ...sortedKeys(linters).map((name) => linters.get(name)!)];\n}\n\n// ---------------------------------------------------------------------------\n// Collapsing, route paths, lookup\n\nfunction joinChainNames(parent: string, child: string): string {\n  const p = parent.trim();\n  const c = child.trim();\n  return p && c ? `${p} > ${c}` : p || c;\n}\n\n/** Folds a folder that has a single child into that child: `pkg > sub > a.go`. */\nfunction collapseFolderChains(nodes: Draft[]): Draft[] {\n  return nodes.map((node) => {\n    if (!node.children || node.children.length === 0) return node;\n    const children = collapseFolderChains(node.children);\n    if (children.length === 1 && node.kind === \"lint-folder\") {\n      const [child] = children;\n      return { ...child!, name: joinChainNames(node.name, child!.name) };\n    }\n    return { ...node, children };\n  });\n}\n\n/** Stable, unique route path per node: slug segments joined by `/`, siblings with equal slugs get `~N`. */\nfunction annotateRoutePaths(nodes: Draft[], parentSegments: string[] = []): LintNode[] {\n  const slugs = nodes.map((n) => slugify(n.name));\n  const totals = groupBy(slugs, (s) => s);\n  const seen = new Map<string, number>();\n  return nodes.map((node, i) => {\n    const slug = slugs[i]!;\n    const ordinal = (seen.get(slug) ?? 0) + 1;\n    seen.set(slug, ordinal);\n    const segment = totals.get(slug)!.length > 1 ? `${slug}~${ordinal}` : slug;\n    const segments = [...parentSegments, segment];\n    const { children, ...rest } = node;\n    return {\n      ...rest,\n      route_path: segments.join(\"/\"),\n      ...(children ? { children: annotateRoutePaths(children, segments) } : {}),\n    };\n  });\n}\n\nconst GROUPERS: Record<LintGrouping, (results: readonly LinterResult[], filters: LintFilters) => Draft[]> = {\n  \"linter-rule-file\": groupByLinterRuleFile,\n  \"linter-file\": groupByLinterFile,\n  \"file-linter-rule\": groupByFileLinterRule,\n  summary: groupBySummary,\n};\n\n/** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */\nexport function buildLintTree({\n  results,\n  grouping,\n  filters,\n}: {\n  results: readonly LinterResult[];\n  grouping: LintGrouping;\n  filters: LintFilters;\n}): LintNode[] {\n  const grouped = withLinterErrors(GROUPERS[grouping](results, filters), results, filters);\n  // Summary keeps its linter -> rule -> file branches as built.\n  return annotateRoutePaths(grouping === \"summary\" ? grouped : collapseFolderChains(grouped));\n}\n\n/** Depth-first lookup of the node whose route_path equals `path`, or null. */\nexport function findLintNode(nodes: readonly LintNode[], path: string): LintNode | null {\n  if (!path) return null;\n  for (const node of nodes) {\n    if (node.route_path === path) return node;\n    const found = node.children ? findLintNode(node.children, path) : null;\n    if (found) return found;\n  }\n  return null;\n}\n"],"mappings":";;;;;AA2CA,IAAM,UAAU;AAChB,IAAM,qBAAqB;AAE3B,SAAS,WAAW,GAAsB;CACxC,OAAO,EAAE,MAAM,UAAU;AAC3B;AAEA,SAAS,OAAO,YAA+C;CAC7D,OAAO,WAAW,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ,EAAE;AACxE;AAEA,SAAS,UAAU,GAAmB;CACpC,MAAM,MAAM,EAAE,QAAQ,IAAI;CAC1B,OAAO,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AACxC;AAEA,SAAS,QAAc,OAAqB,KAAkC;CAC5E,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC;EAC9B,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;CAChC;CACA,OAAO;AACT;AAEA,SAAS,WAAc,KAA+B;CACpD,OAAO,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK;AACrC;AAKA,SAAS,YAAY,SAAkC,SAAuC;CAC5F,MAAM,UAAU,QAAQ,QAAQ,MAAMA,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,YAAY,IAAI,IAAI,QAAQ,SAAS,MAAO,EAAE,WAAW,CAACC,cAAAA,kBAAkB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO;CAC9G,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,KAAK,OAAO,cAAc,CAAC,GAAG;EACvC,IAAI,CAACD,oBAAAA,mBAAmBE,cAAAA,WAAW,CAAC,GAAG,QAAQ,QAAQ,GAAG;EAC1D,MAAM,UAAUC,cAAAA,QAAQ,EAAE,MAAM,OAAO,QAAQ;EAC/C,MAAM,OAAOC,cAAAA,iBAAiB,SAAS,OAAO,UAAU,SAAS;EACjE,IAAI,KAAK;GACP,QAAQ,OAAO;GACf;GACA,GAAG;IAAE,GAAG;IAAG,UAAU;IAAS;GAAK;GACnC;GACA;GACA,SAAS,OAAO;EAClB,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6D;CACjF,MAAM,uBAAO,IAAI,IAA0B;CAC3C,KAAK,MAAM,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,EAAE,MAAM,GAAG,KAAK,IAAI,EAAE,QAAQ,CAAC;CACtE,OAAO;AACT;AAKA,SAAS,UAAsB;CAC7B,OAAO;EAAE,MAAM;EAAI,MAAM,KAAA;EAAW,SAAS;EAAI,yBAAS,IAAI,IAAI;EAAG,wBAAQ,IAAI,IAAI;CAAE;AACzF;;AAGA,SAAS,SAAY,MAAe,MAAc,SAAiB,QAAoB;CACrF,MAAM,WAAWC,cAAAA,sBAAsB,IAAI;CAC3C,MAAM,cAAcA,cAAAA,sBAAsB,OAAO;CACjD,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAClD,MAAM,IAAI,MAAM,kDAAkD,KAAK,UAAU,IAAI,EAAE,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE;CAE3H,MAAM,iBAAiB,SAAS,MAAM,GAAG,EAAE;CAC3C,MAAM,oBAAoB,YAAY,MAAM,GAAG,EAAE;CAGjD,MAAM,YAAY,eAAe,SAAS,kBAAkB;CAC5D,IAAI,UAAU;CACd,eAAe,SAAS,SAAS,MAAM;EACrC,IAAI,QAAQ,QAAQ,QAAQ,IAAI,OAAO;EACvC,IAAI,CAAC,OAAO;GACV,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,kBAAkB,QAAQ,IAAI,IAAI,SAAS,CAAC;GAClF,QAAQ;IACN,MAAM;IACN,MAAM,QAAQ,OAAO,GAAG,QAAQ,KAAK,GAAG,YAAY;IACpD,SAAS,kBAAkB,MAAM,GAAG,QAAQ,CAAC,CAAC,KAAK,GAAG;IACtD,yBAAS,IAAI,IAAI;IACjB,wBAAQ,IAAI,IAAI;GAClB;GACA,QAAQ,QAAQ,IAAI,SAAS,KAAK;EACpC;EACA,UAAU;CACZ,CAAC;CACD,MAAM,WAAW,SAAS,SAAS,SAAS;CAC5C,IAAI,OAAO,QAAQ,OAAO,IAAI,QAAQ;CACtC,IAAI,CAAC,MAAM;EACT,OAAO,OAAO;EACd,QAAQ,OAAO,IAAI,UAAU,IAAI;CACnC;CACA,OAAO;AACT;AAKA,SAAS,UAAU,MAAc,MAAqB,UAA0B;CAC9E,MAAM,SAAS,SAAS,MAAM,MAAM,EAAE,MAAM;CAC5C,OAAO;EAAE;EAAM;EAAM;EAAU;EAAQ,QAAQ,CAAC;EAAQ,SAAS;CAAM;AACzE;AAEA,SAAS,cAAc,UAAgD;CACrE,MAAM,OAAO,IAAI,IAAI,SAAS,SAAS,MAAO,EAAE,WAAW,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAE,CAAC;CAC9E,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,KAAA;AACjD;AAEA,SAAS,qBAAqB,MAAa,QAAqC;CAC9E,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,KAAK,UAAUC,cAAAA,cAAc,MAAM,MAAM;CACxD,OAAO;EAAE,GAAG;EAAM,kBAAkB,OAAO,MAAM;EAAG;EAAQ,QAAQ,CAAC;CAAO;AAC9E;AAEA,SAAS,cAAc,MAQb;CACR,MAAM,SAASA,cAAAA,cAAc,KAAK,UAAU,MAAM;CAClD,OAAO;EACL,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,YAAY,KAAK;EACjB,YAAY,OAAO,KAAK,UAAU;EAClC;EACA,QAAQ,CAAC;EACT,SAAS;CACX;AACF;AAEA,SAAS,WACP,YACA,QACA,UACA,SAA+B,CAAC,GACzB;CACP,OAAO,qBAAqB;EAAE,GAAG,UAAU,YAAY,UAAU,QAAQ;EAAG,QAAQ;EAAQ;CAAW,GAAG,MAAM;AAClH;AAEA,SAAS,gBAAgB,QAA6B;CACpD,MAAM,UAAUC,cAAAA,mBAAmB,MAAM;CACzC,OAAO;EACL,MAAM,UAAU,OAAO;EACvB,MAAM;EACN,YAAY,OAAO;EACnB,QAAQ;EACR,UAAU,OAAO;EACjB,QAAQ;EACR,QAAQ;EACR,SAAS;EACT;CACF;AACF;AAEA,SAAS,UAAU,MAAwB,YAAoB,UAA4B;CACzF,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,UAAU,QAAQ,YAAY,QAAQ,CAAC;EAC1F,OAAO;GACL,GAAG;GACH,MAAM,OAAO;GACb,aAAa,OAAO;GACpB;GACA,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAC/B,UAAU,cAAc,KAAK,QAAS;EACxC;CACF,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,SAAS,KAAK,OAAO,IAAI,GAAG;EAElC,MAAM,OAAO,cAAc;GACzB,MAAM;GACN,MAAM;GACN,MAJe,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;GAKnD,SAAS,OAAO;GAChB;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;EAClB,CAAC;EACD,OAAO,WAAW;GAAE,GAAG;GAAM;EAAS,IAAI;CAC5C,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAIA,SAAS,gBAAgB,MAAyB,YAAgD;CAChG,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,gBAAgB,QAAQ,UAAU,CAAC;EACtF,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO;GAAM,aAAa,OAAO;GAAS,UAAU,cAAc,KAAK,QAAS;EAAE;CAC5G,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,UAAU,KAAK,OAAO,IAAI,GAAG;EACnC,MAAM,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;EACrD,MAAM,eAAe,WAAW,OAAO,CAAC,CAAC,KAAK,eAAe;GAC3D,MAAM,EAAE,SAAS,UAAU,QAAQ,IAAI,UAAU;GACjD,MAAM,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,SAAS;IACjD,MAAM,aAAa,MAAM,IAAI,IAAI;IACjC,OAAO;KACL,GAAG,cAAc;MACf,MAAM;MACN,MAAM;MACN,MAAM;MACN,SAAS,WAAW,EAAE,EAAE,YAAY;MACpC;MACA;MACA;KACF,CAAC;KACD,UAAU;IACZ;GACF,CAAC;GACD,OAAO;IACL,GAAG,WAAW,YAAY,WAAW,IAAI,UAAU,GAAG,UAAU;IAChE,MAAM;IACN,aAAa,WAAW,EAAE,EAAE;IAC5B,UAAU;GACZ;EACF,CAAC;EACD,OAAO;GACL,GAAG,UAAU,KAAK,aAAa,YAAY;GAC3C,MAAM;GACN,aAAa,aAAa,EAAE,EAAE;GAC9B,UAAU,cAAc,YAAY;EACtC;CACF,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAKA,SAAS,YAAY,MAAkD;CACrE,MAAM,OAAO,QAAoB;CACjC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa;GACjD,SAAS,EAAE,WAAW,EAAE;GACxB,SAAS,EAAE;GACX,YAAY,CAAC;EACf,EAAE,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC;CACzB;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACxC,KAAK,CAAC,CACN,KAAK,SAAS;GACb,MAAM,QAAQ,OAAO,IAAI,IAAI;GAC7B,MAAM,WAAW,UAAU,YAAY,KAAK,GAAG,YAAY,IAAI;GAE/D,OAAO,qBACL;IACE,GAHS,UAAU,MAAM,mBAAmB,QAGzC;IACH;IACA,UAAU;IACV,UAAU,cAAc,QAAQ,KAAK,KAAK,IAAI,UAAU,CAAC,EAAE;GAC7D,GACA,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;EACF,CAAC;EACH,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,SAAS;CAC/D,CAAC;AACL;AAEA,SAAS,kBAAkB,SAAkC,SAA+B;CAC1F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,SAAS,IAAI,UAAU;EACrC,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,YAAY,KAAK,GAAG,UAAU,GACxC,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;CACF,CAAC;AACL;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,OAAO,YAAY,SAAS,OAAO;CACzC,MAAM,OAAO,QAAqB;CAClC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,MAAM,UAAU,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,4BAAY,IAAI,IAAI,CAAC;EAC3E,IAAI,QAAQ,QAAQ,IAAI,EAAE,MAAM;EAChC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,SAAS,EAAE;IAAS,uBAAO,IAAI,IAAI;GAAE;GAC/C,QAAQ,IAAI,EAAE,QAAQ,KAAK;EAC7B;EACA,MAAM,OAAO,WAAW,EAAE,CAAC;EAC3B,MAAM,MAAM,IAAI,MAAM,CAAC,GAAI,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC,CAAC;CAC/D;CAEA,MAAM,WAAW,QAAQ,KAAK,QAAQ,MAAM,CAAC,EAAE,IAAI,IAAI,MAAM,EAAE,MAAM;CACrE,MAAM,gBAAgB,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC9C,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,UAAU,KAAK,IAAI,UAAU,CAAC,EAAE;EACtC,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,UAAU;GACd,GAAG,cAAc;IACf,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT;IACA,YAAY,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,EAAE,CAAC;IAC5C;GACF,CAAC;GACD,UAAU;GACV,MAAM,KAAA;GACN,aAAa,KAAA;EACf,EAAE;EACJ,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,MAAM;CAC5D,CAAC;CAEH,OAAO,CAAC,GAAG,gBAAgB,MAAM,IAAI,GAAG,GAAG,aAAa;AAC1D;AAEA,SAAS,iBAAiB,MAA0B,YAA0C;CAC5F,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,WAAW,SAAS,GAAG,OAAO,GAAG,KAAK,IAAI,WAAW,OAAO;CAChE,MAAM,IAAI,WAAW;CACrB,IAAI,GAAG,MAAM,OAAO,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,WAAW,GAAG,KAAK,GAAG,EAAE;CAC9E,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,YAAoB,OAAwC;CACjG,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,QAAQ,EAAE;CACjD,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,CAAC;CACrC,MAAM,QAAiB,KAAK,MAAM,GAAG,kBAAkB,CAAC,CAAC,KAAK,QAAQ;EACpE,MAAM,QAAQ,OAAO,IAAI,GAAG;EAC5B,OAAO;GACL,GAAG,cAAc;IACf,MAAM,iBAAiB,MAAM,EAAE,CAAE,MAAM,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;IAC5D,MAAM;IACN,MAAM,MAAM,EAAE,CAAE,QAAQ;IACxB,SAAS,MAAM,EAAE,CAAE,WAAW;IAC9B;IACA,YAAY,MAAM,KAAK,MAAM,EAAE,CAAC;IAChC,SAAS,MAAM,EAAE,CAAE;GACrB,CAAC;GACD,MAAM,MAAM,EAAE,CAAE;GAChB,aAAa,MAAM,EAAE,CAAE;GACvB,UAAU;EACZ;CACF,CAAC;CACD,MAAM,YAAY,KAAK,SAAS,MAAM;CACtC,IAAI,YAAY,GACd,MAAM,KAAK;EACT,MAAM,KAAK,UAAU,YAAY,cAAc,IAAI,KAAK;EACxD,MAAM;EACN;EACA,UAAU;EACV,QAAQ;EACR,QAAQ;EACR,SAAS;CACX,CAAC;CAEH,MAAM,eAAe,MAAM,MAAM,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE;CAEvD,OAAO;EAAE,GAAG,UADC,eAAe,GAAG,KAAK,IAAI,MAAM,OAAO,MAAM,iBAAiB,GAAG,KAAK,IAAI,MAAM,OAAO,IACzE,mBAAmB,KAAK;EAAG;EAAY,UAAU;CAAK;AACpF;AAEA,SAAS,eAAe,SAAkC,SAA+B;CACvF,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,eAAe,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CAC3E,MAAM,UAAU,QAAQ,QAAQ,MAAMP,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,UAAU,IAAI,IAAI,QAAQ,QAAQ,MAAM,EAAE,OAAO,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,QAAQ,EAAE,SAAS,SAAS,CAAC,CAAC;CAErG,OAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CACrD,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,aAAa,IAAI,UAAU,KAAK,CAAC;EAC/C,IAAI,MAAM,WAAW,KAAK,QAAQ,IAAI,UAAU,GAC9C,OAAO;GACL,MAAM;GACN,MAAM;GACN,QAAQ,KAAK,IAAI,UAAU;GAC3B;GACA,SAAS;GACT,QAAQ;GACR,QAAQ;GACR,SAAS,YAAY,QAAQ,IAAI,UAAU;EAC7C;EAEF,MAAM,SAAS,QAAQ,QAAQ,MAAM,WAAW,EAAE,CAAC,CAAC;EACpD,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,MACzC,GAAG,MAAM,OAAO,IAAI,CAAC,CAAC,CAAE,SAAS,OAAO,IAAI,CAAC,CAAC,CAAE,UAAU,EAAE,cAAc,CAAC,CAC9E;EACA,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,KAAK,SAAS,gBAAgB,MAAM,YAAY,OAAO,IAAI,IAAI,CAAE,CAAC,CAC9E;CACF,CAAC;AACL;;AAGA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CACzG,MAAM,SAAS,QACb,QAAQ,QAAQ,MAAMQ,cAAAA,gBAAgB,CAAC,KAAKR,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC,IACvF,MAAM,EAAE,MACX;CACA,IAAI,OAAO,SAAS,GAAG,OAAO;CAC9B,MAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACxF,KAAK,MAAM,CAAC,MAAM,WAAW,QAAQ;EACnC,MAAM,aAAa,OAAO,IAAI,eAAe;EAC7C,MAAM,WAAW,QAAQ,IAAI,IAAI;EACjC,QAAQ,IACN,MACA,WACI;GAAE,GAAG;GAAU,UAAU,CAAC,GAAG,YAAY,GAAI,SAAS,YAAY,CAAC,CAAE;GAAG,QAAQ;GAAM,QAAQ;EAAM,IACpG,WAAW,MAAM,OAAO,IAAI,UAAU,CAC5C;CACF;CAEA,OAAO,CAAC,GADO,MAAM,QAAQ,MAAM,EAAE,SAAS,QACnC,GAAQ,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,SAAS,QAAQ,IAAI,IAAI,CAAE,CAAC;AAC7E;AAKA,SAAS,eAAe,QAAgB,OAAuB;CAC7D,MAAM,IAAI,OAAO,KAAK;CACtB,MAAM,IAAI,MAAM,KAAK;CACrB,OAAO,KAAK,IAAI,GAAG,EAAE,KAAK,MAAM,KAAK;AACvC;;AAGA,SAAS,qBAAqB,OAAyB;CACrD,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,GAAG,OAAO;EACzD,MAAM,WAAW,qBAAqB,KAAK,QAAQ;EACnD,IAAI,SAAS,WAAW,KAAK,KAAK,SAAS,eAAe;GACxD,MAAM,CAAC,SAAS;GAChB,OAAO;IAAE,GAAG;IAAQ,MAAM,eAAe,KAAK,MAAM,MAAO,IAAI;GAAE;EACnE;EACA,OAAO;GAAE,GAAG;GAAM;EAAS;CAC7B,CAAC;AACH;;AAGA,SAAS,mBAAmB,OAAgB,iBAA2B,CAAC,GAAe;CACrF,MAAM,QAAQ,MAAM,KAAK,MAAMS,kBAAAA,QAAQ,EAAE,IAAI,CAAC;CAC9C,MAAM,SAAS,QAAQ,QAAQ,MAAM,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAoB;CACrC,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,MAAM,OAAO,MAAM;EACnB,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK;EACxC,KAAK,IAAI,MAAM,OAAO;EACtB,MAAM,UAAU,OAAO,IAAI,IAAI,CAAC,CAAE,SAAS,IAAI,GAAG,KAAK,GAAG,YAAY;EACtE,MAAM,WAAW,CAAC,GAAG,gBAAgB,OAAO;EAC5C,MAAM,EAAE,UAAU,GAAG,SAAS;EAC9B,OAAO;GACL,GAAG;GACH,YAAY,SAAS,KAAK,GAAG;GAC7B,GAAI,WAAW,EAAE,UAAU,mBAAmB,UAAU,QAAQ,EAAE,IAAI,CAAC;EACzE;CACF,CAAC;AACH;AAEA,IAAM,WAAsG;CAC1G,oBAAoB;CACpB,eAAe;CACf,oBAAoB;CACpB,SAAS;AACX;;AAGA,SAAgB,cAAc,EAC5B,SACA,UACA,WAKa;CACb,MAAM,UAAU,iBAAiB,SAAS,SAAS,CAAC,SAAS,OAAO,GAAG,SAAS,OAAO;CAEvF,OAAO,mBAAmB,aAAa,YAAY,UAAU,qBAAqB,OAAO,CAAC;AAC5F;;AAGA,SAAgB,aAAa,OAA4B,MAA+B;CACtF,IAAI,CAAC,MAAM,OAAO;CAClB,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,eAAe,MAAM,OAAO;EACrC,MAAM,QAAQ,KAAK,WAAW,aAAa,KAAK,UAAU,IAAI,IAAI;EAClE,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT"}
+{"version":3,"file":"grouping.cjs","names":["matchesFilterState","normalizeLintPath","severityOf","relPath","decorateLintFile","collapsedPathSegments","worstSeverity","linterErrorMessage","isLinterErrored","isLinterInFlight","lintNodeCount","slugify"],"sources":["../../../src/data/lint/grouping.ts"],"sourcesContent":["// Turns raw linter results into the selectable tree for each grouping. Ported\n// from gavel's testrunner/ui utils.ts. Differences from the original:\n//   - a linter that failed to run is shown under every grouping (gavel only\n//     showed it in `summary`), so a broken linter never reads as a clean run;\n//   - single-child folder chains are really collapsed (\"pkg/sub/a.go\");\n//     gavel's collapser never fired because folder nodes always carry a\n//     passed/failed flag;\n//   - file-scoped rule leaves in `file-linter-rule` carry their work_dir, so\n//     ignore actions on them are not sent without one.\n\nimport { matchesFilterState } from \"../test-runner/filterState\";\nimport { slugify } from \"../test-runner/routePath\";\nimport { collapsedPathSegments, decorateLintFile, normalizeLintPath, relPath } from \"./paths\";\nimport {\n  isLinterErrored,\n  isLinterInFlight,\n  linterErrorMessage,\n  lintNodeCount,\n  severityOf,\n  worstSeverity,\n} from \"./stats\";\nimport type {\n  LintFilters,\n  LintGrouping,\n  LintNode,\n  LinterResult,\n  Violation,\n} from \"./types\";\n\ntype Draft = Omit<LintNode, \"route_path\" | \"children\"> & { children?: Draft[] };\n\n/** A violation with its linter and paths resolved, as every view lists it. */\nexport type FlatViolation = {\n  linter: string;\n  result: LinterResult;\n  v: Violation;\n  file: string | undefined;\n  rawFile: string | undefined;\n  workDir: string | undefined;\n};\n\ntype FileBucket = { rawFile: string; workDir: string | undefined; violations: Violation[] };\n\ntype Trie<L> = {\n  name: string;\n  path: string | undefined;\n  rawPath: string;\n  folders: Map<string, Trie<L>>;\n  leaves: Map<string, L>;\n};\n\nconst NO_RULE = \"(no rule)\";\nconst SUMMARY_FILE_LIMIT = 5;\n\nfunction ruleKeyFor(v: Violation): string {\n  return v.rule?.method || NO_RULE;\n}\n\nfunction byLine(violations: readonly Violation[]): Violation[] {\n  return violations.slice().sort((a, b) => (a.line ?? 0) - (b.line ?? 0));\n}\n\nfunction firstLine(s: string): string {\n  const idx = s.indexOf(\"\\n\");\n  return idx === -1 ? s : s.slice(0, idx);\n}\n\nfunction groupBy<T, K>(items: readonly T[], key: (item: T) => K): Map<K, T[]> {\n  const out = new Map<K, T[]>();\n  for (const item of items) {\n    const list = out.get(key(item));\n    if (list) list.push(item);\n    else out.set(key(item), [item]);\n  }\n  return out;\n}\n\nfunction sortedKeys<V>(map: Map<string, V>): string[] {\n  return Array.from(map.keys()).sort();\n}\n\n// ---------------------------------------------------------------------------\n// Flattening\n\n/** Every violation the filters keep, with work-dir-relative and display paths. */\nexport function flattenLint(results: readonly LinterResult[], filters: LintFilters): FlatViolation[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const multiRoot = new Set(visible.flatMap((r) => (r.work_dir ? [normalizeLintPath(r.work_dir)] : []))).size > 1;\n  const out: FlatViolation[] = [];\n  for (const result of visible) {\n    for (const v of result.violations ?? []) {\n      if (!matchesFilterState(severityOf(v), filters.severity)) continue;\n      const rawFile = relPath(v.file, result.work_dir);\n      const file = decorateLintFile(rawFile, result.work_dir, multiRoot);\n      out.push({\n        linter: result.linter,\n        result,\n        v: { ...v, raw_file: rawFile, file },\n        file,\n        rawFile,\n        workDir: result.work_dir,\n      });\n    }\n  }\n  return out;\n}\n\nfunction linterMetaOf(results: readonly LinterResult[]): Map<string, LinterResult> {\n  const meta = new Map<string, LinterResult>();\n  for (const r of results) if (!meta.has(r.linter)) meta.set(r.linter, r);\n  return meta;\n}\n\n// ---------------------------------------------------------------------------\n// Path trie\n\nfunction newTrie<L>(): Trie<L> {\n  return { name: \"\", path: undefined, rawPath: \"\", folders: new Map(), leaves: new Map() };\n}\n\n/** The leaf for `file`, created through `create` on first sight; folders are made on the way. */\nfunction trieLeaf<L>(root: Trie<L>, file: string, rawFile: string, create: () => L): L {\n  const segments = collapsedPathSegments(file);\n  const rawSegments = collapsedPathSegments(rawFile);\n  if (segments.length === 0 || rawSegments.length === 0) {\n    throw new Error(`lint: cannot place violation, empty path (file=${JSON.stringify(file)}, raw=${JSON.stringify(rawFile)})`);\n  }\n  const folderSegments = segments.slice(0, -1);\n  const rawFolderSegments = rawSegments.slice(0, -1);\n  // The decorated path may carry extra leading segments (the work dir label)\n  // that the raw, work_dir-relative path does not.\n  const rawOffset = folderSegments.length - rawFolderSegments.length;\n  let current = root;\n  folderSegments.forEach((segment, i) => {\n    let child = current.folders.get(segment);\n    if (!child) {\n      const rawCount = Math.max(0, Math.min(rawFolderSegments.length, i + 1 - rawOffset));\n      child = {\n        name: segment,\n        path: current.path ? `${current.path}/${segment}` : segment,\n        rawPath: rawFolderSegments.slice(0, rawCount).join(\"/\"),\n        folders: new Map(),\n        leaves: new Map(),\n      };\n      current.folders.set(segment, child);\n    }\n    current = child;\n  });\n  const basename = segments[segments.length - 1]!;\n  let leaf = current.leaves.get(basename);\n  if (!leaf) {\n    leaf = create();\n    current.leaves.set(basename, leaf);\n  }\n  return leaf;\n}\n\n// ---------------------------------------------------------------------------\n// Node builders\n\nfunction container(name: string, kind: Draft[\"kind\"], children: Draft[]): Draft {\n  const failed = children.some((c) => c.failed);\n  return { name, kind, children, failed, passed: !failed, skipped: false };\n}\n\nfunction uniqueWorkDir(children: readonly Draft[]): string | undefined {\n  const dirs = new Set(children.flatMap((c) => (c.work_dir ? [c.work_dir] : [])));\n  return dirs.size === 1 ? Array.from(dirs)[0] : undefined;\n}\n\nfunction withNoFileViolations(node: Draft, noFile: readonly Violation[]): Draft {\n  if (noFile.length === 0) return node;\n  const failed = node.failed || worstSeverity(noFile) !== \"info\";\n  return { ...node, noFileViolations: byLine(noFile), failed, passed: !failed };\n}\n\nfunction violationLeaf(args: {\n  name: string;\n  kind: \"lint-file\" | \"lint-rule\";\n  file: string;\n  rawFile: string;\n  linterName: string;\n  violations: readonly Violation[];\n  workDir: string | undefined;\n}): Draft {\n  const failed = worstSeverity(args.violations) !== \"info\";\n  return {\n    name: args.name,\n    kind: args.kind,\n    file: args.file,\n    target_path: args.rawFile,\n    work_dir: args.workDir,\n    linterName: args.linterName,\n    violations: byLine(args.violations),\n    failed,\n    passed: !failed,\n    skipped: false,\n  };\n}\n\nfunction linterNode(\n  linterName: string,\n  result: LinterResult | undefined,\n  children: Draft[],\n  noFile: readonly Violation[] = [],\n): Draft {\n  return withNoFileViolations({ ...container(linterName, \"linter\", children), linter: result, linterName }, noFile);\n}\n\nfunction linterErrorNode(result: LinterResult): Draft {\n  const message = linterErrorMessage(result);\n  return {\n    name: firstLine(message),\n    kind: \"linter-error\",\n    linterName: result.linter,\n    linter: result,\n    work_dir: result.work_dir,\n    failed: true,\n    passed: false,\n    skipped: false,\n    message,\n  };\n}\n\nfunction fileNodes(trie: Trie<FileBucket>, linterName: string, ruleName?: string): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileNodes(folder, linterName, ruleName));\n    return {\n      ...node,\n      file: folder.path,\n      target_path: folder.rawPath,\n      linterName,\n      ...(ruleName ? { ruleName } : {}),\n      work_dir: uniqueWorkDir(node.children!),\n    };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const bucket = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const leaf = violationLeaf({\n      name: key,\n      kind: \"lint-file\",\n      file: fullPath,\n      rawFile: bucket.rawFile,\n      linterName,\n      violations: bucket.violations,\n      workDir: bucket.workDir,\n    });\n    return ruleName ? { ...leaf, ruleName } : leaf;\n  });\n  return [...folders, ...files];\n}\n\ntype FileLinters = Map<string, { workDir: string | undefined; rules: Map<string, Violation[]> }>;\n\nfunction fileLinterNodes(trie: Trie<FileLinters>, linterMeta: Map<string, LinterResult>): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileLinterNodes(folder, linterMeta));\n    return { ...node, file: folder.path, target_path: folder.rawPath, work_dir: uniqueWorkDir(node.children!) };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const linters = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const linterDrafts = sortedKeys(linters).map((linterName) => {\n      const { workDir, rules } = linters.get(linterName)!;\n      const ruleLeaves = sortedKeys(rules).map((rule) => {\n        const violations = rules.get(rule)!;\n        return {\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: fullPath,\n            rawFile: violations[0]?.raw_file ?? fullPath,\n            linterName,\n            violations,\n            workDir,\n          }),\n          ruleName: rule,\n        };\n      });\n      return {\n        ...linterNode(linterName, linterMeta.get(linterName), ruleLeaves),\n        file: fullPath,\n        target_path: ruleLeaves[0]?.target_path,\n        work_dir: workDir,\n      };\n    });\n    return {\n      ...container(key, \"lint-file\", linterDrafts),\n      file: fullPath,\n      target_path: linterDrafts[0]?.target_path,\n      work_dir: uniqueWorkDir(linterDrafts),\n    };\n  });\n  return [...folders, ...files];\n}\n\n// ---------------------------------------------------------------------------\n// Groupings\n\nfunction fileTrieFor(flat: readonly FlatViolation[]): Trie<FileBucket> {\n  const trie = newTrie<FileBucket>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    trieLeaf(trie, f.file, f.rawFile ?? f.file, () => ({\n      rawFile: f.rawFile ?? f.file!,\n      workDir: f.workDir,\n      violations: [],\n    })).violations.push(f.v);\n  }\n  return trie;\n}\n\nfunction groupByLinterRuleFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(byLinter.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const ruleNodes = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => {\n          const flats = byRule.get(rule)!;\n          const children = fileNodes(fileTrieFor(flats), linterName, rule);\n          const node = container(rule, \"lint-rule-group\", children);\n          return withNoFileViolations(\n            {\n              ...node,\n              linterName,\n              ruleName: rule,\n              work_dir: uniqueWorkDir(children) ?? meta.get(linterName)?.work_dir,\n            },\n            flats.filter((f) => !f.file).map((f) => f.v),\n          );\n        });\n      return linterNode(linterName, meta.get(linterName), ruleNodes);\n    });\n}\n\nfunction groupByLinterFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const flats = byLinter.get(linterName)!;\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        fileNodes(fileTrieFor(flats), linterName),\n        flats.filter((f) => !f.file).map((f) => f.v),\n      );\n    });\n}\n\nfunction groupByFileLinterRule(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flat = flattenLint(results, filters);\n  const trie = newTrie<FileLinters>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    const linters = trieLeaf(trie, f.file, f.rawFile ?? f.file, () => new Map());\n    let entry = linters.get(f.linter);\n    if (!entry) {\n      entry = { workDir: f.workDir, rules: new Map() };\n      linters.set(f.linter, entry);\n    }\n    const rule = ruleKeyFor(f.v);\n    entry.rules.set(rule, [...(entry.rules.get(rule) ?? []), f.v]);\n  }\n\n  const fileless = groupBy(flat.filter((f) => !f.file), (f) => f.linter);\n  const filelessNodes = Array.from(fileless.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(fileless.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const workDir = meta.get(linterName)?.work_dir;\n      const leaves = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => ({\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: \"\",\n            rawFile: \"\",\n            linterName,\n            violations: byRule.get(rule)!.map((f) => f.v),\n            workDir,\n          }),\n          ruleName: rule,\n          file: undefined,\n          target_path: undefined,\n        }));\n      return linterNode(linterName, meta.get(linterName), leaves);\n    });\n\n  return [...fileLinterNodes(trie, meta), ...filelessNodes];\n}\n\nfunction summaryFileLabel(file: string | undefined, violations: readonly Violation[]): string {\n  if (!file) return \"(no file)\";\n  if (violations.length > 1) return `${file} (${violations.length})`;\n  const v = violations[0];\n  if (v?.line) return v.column ? `${file}:${v.line}:${v.column}` : `${file}:${v.line}`;\n  return file;\n}\n\nfunction summaryRuleNode(rule: string, linterName: string, flats: readonly FlatViolation[]): Draft {\n  const byFile = groupBy(flats, (f) => f.file ?? \"\");\n  const keys = Array.from(byFile.keys());\n  const files: Draft[] = keys.slice(0, SUMMARY_FILE_LIMIT).map((key) => {\n    const group = byFile.get(key)!;\n    return {\n      ...violationLeaf({\n        name: summaryFileLabel(group[0]!.file, group.map((f) => f.v)),\n        kind: \"lint-file\",\n        file: group[0]!.file ?? \"\",\n        rawFile: group[0]!.rawFile ?? \"\",\n        linterName,\n        violations: group.map((f) => f.v),\n        workDir: group[0]!.workDir,\n      }),\n      file: group[0]!.file,\n      target_path: group[0]!.rawFile,\n      ruleName: rule,\n    };\n  });\n  const remaining = keys.length - files.length;\n  if (remaining > 0) {\n    files.push({\n      name: `… ${remaining} more file${remaining === 1 ? \"\" : \"s\"}`,\n      kind: \"lint-file\",\n      linterName,\n      ruleName: rule,\n      failed: false,\n      passed: true,\n      skipped: false,\n    });\n  }\n  const firstMessage = flats.find((f) => f.v.message)?.v.message;\n  const name = firstMessage ? `${rule} (${flats.length}) — ${firstMessage}` : `${rule} (${flats.length})`;\n  return { ...container(name, \"lint-rule-group\", files), linterName, ruleName: rule };\n}\n\nfunction groupBySummary(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flatByLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const skipped = new Map(visible.filter((r) => r.skipped).map((r) => [r.linter, r.error || \"skipped\"]));\n  // Like the CLI --summary: every linter that ran is listed, even a clean one.\n  return Array.from(new Set(visible.map((r) => r.linter)))\n    .sort()\n    .map((linterName) => {\n      const flats = flatByLinter.get(linterName) ?? [];\n      if (flats.length === 0 && skipped.has(linterName)) {\n        return {\n          name: linterName,\n          kind: \"linter\" as const,\n          linter: meta.get(linterName),\n          linterName,\n          skipped: true,\n          passed: false,\n          failed: false,\n          message: `skipped: ${skipped.get(linterName)}`,\n        };\n      }\n      const byRule = groupBy(flats, (f) => ruleKeyFor(f.v));\n      const ruleOrder = Array.from(byRule.keys()).sort(\n        (a, b) => byRule.get(b)!.length - byRule.get(a)!.length || a.localeCompare(b),\n      );\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        ruleOrder.map((rule) => summaryRuleNode(rule, linterName, byRule.get(rule)!)),\n      );\n    });\n}\n\n/** Linters that failed to run get an error leaf in every grouping, merged into an existing linter node. */\nfunction withLinterErrors(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const errors = groupBy(\n    results.filter((r) => isLinterErrored(r) && matchesFilterState(r.linter, filters.linter)),\n    (r) => r.linter,\n  );\n  if (errors.size === 0) return roots;\n  const linters = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  for (const [name, failed] of errors) {\n    const errorNodes = failed.map(linterErrorNode);\n    const existing = linters.get(name);\n    linters.set(\n      name,\n      existing\n        ? { ...existing, children: [...errorNodes, ...(existing.children ?? [])], failed: true, passed: false }\n        : linterNode(name, failed[0], errorNodes),\n    );\n  }\n  const others = roots.filter((n) => n.kind !== \"linter\");\n  return [...others, ...sortedKeys(linters).map((name) => linters.get(name)!)];\n}\n\nfunction linterNamesIn(nodes: readonly Draft[], into = new Set<string>()): Set<string> {\n  for (const node of nodes) {\n    if (node.kind === \"linter\" && node.linterName) into.add(node.linterName);\n    linterNamesIn(node.children ?? [], into);\n  }\n  return into;\n}\n\n/**\n * Linters still queued or running appear in every grouping even before they\n * report a violation, and have no verdict (`passed` stays false) until they finish.\n */\nfunction withInFlightLinters(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const present = linterNamesIn(roots);\n  const missing = new Map<string, LinterResult>();\n  for (const r of results) {\n    if (isLinterInFlight(r) && matchesFilterState(r.linter, filters.linter) && !present.has(r.linter)) {\n      missing.set(r.linter, r);\n    }\n  }\n  const markPending = (nodes: Draft[]): Draft[] =>\n    nodes.map((node) => {\n      const children = node.children ? markPending(node.children) : undefined;\n      const inFlight = node.kind === \"linter\" && node.linter !== undefined && isLinterInFlight(node.linter);\n      return { ...node, ...(children ? { children } : {}), ...(inFlight ? { passed: false } : {}) };\n    });\n  if (missing.size === 0) return markPending(roots);\n  const added = Array.from(missing.values()).map((r) => linterNode(r.linter, r, []));\n  const linters = new Map([...roots.filter((n) => n.kind === \"linter\"), ...added].map((n) => [n.name, n]));\n  return markPending([...roots.filter((n) => n.kind !== \"linter\"), ...sortedKeys(linters).map((k) => linters.get(k)!)]);\n}\n\n// ---------------------------------------------------------------------------\n// Linter ordering and nesting (linter-first groupings)\n\nconst STATUS_BUCKETS = [\"running\", \"pending\", \"failed\", \"findings\", \"passed\"] as const;\ntype StatusBucket = (typeof STATUS_BUCKETS)[number];\n\n/** Where a linter node sorts: its own state, or a nested linter's if that is more urgent. */\nfunction statusBucket(node: Draft): number {\n  const own: StatusBucket =\n    node.linter?.status === \"running\"\n      ? \"running\"\n      : node.linter?.status === \"pending\"\n        ? \"pending\"\n        : node.children?.some((c) => c.kind === \"linter-error\")\n          ? \"failed\"\n          : lintNodeCount(node) > 0\n            ? \"findings\"\n            : \"passed\";\n  const nested = (node.children ?? []).filter((c) => c.kind === \"linter\").map(statusBucket);\n  return Math.min(STATUS_BUCKETS.indexOf(own), ...nested);\n}\n\n/** Running → pending → failed → with findings → passed; by name within a bucket (the sort is stable). */\nfunction sortLinterNodes(nodes: Draft[]): Draft[] {\n  return nodes\n    .map((node) => ({ node, bucket: statusBucket(node) }))\n    .sort((a, b) => a.bucket - b.bucket || (a.node.name < b.node.name ? -1 : a.node.name > b.node.name ? 1 : 0))\n    .map(({ node }) => node);\n}\n\n/**\n * Results named `<parent>/<child>` where a `<parent>` result exists (the linters\n * a prompt run's agent ran) become linter nodes beneath the parent's node,\n * shown by their child name. Without a visible parent they stay top-level.\n */\nfunction nestChildLinters(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const meta = linterMetaOf(visible);\n  const parentOf = (name: string): string | undefined => {\n    for (let i = name.lastIndexOf(\"/\"); i > 0; i = name.lastIndexOf(\"/\", i - 1)) {\n      if (meta.has(name.slice(0, i))) return name.slice(0, i);\n    }\n    return undefined;\n  };\n  const nodes = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  const childrenOf = groupBy(\n    Array.from(meta.keys()).filter((name) => parentOf(name) !== undefined),\n    (name) => parentOf(name)!,\n  );\n  if (childrenOf.size === 0) return roots;\n\n  const attach = (name: string, nestedUnder?: string): Draft => {\n    const node = nodes.get(name) ?? linterNode(name, meta.get(name), []);\n    const nested = (childrenOf.get(name) ?? []).map((child) => attach(child, name));\n    const label = nestedUnder ? { name: name.slice(nestedUnder.length + 1), nestedUnder } : {};\n    if (nested.length === 0) return { ...node, ...label };\n    const own = node.children ?? [];\n    const failed = node.failed || nested.some((n) => n.failed);\n    return {\n      ...node,\n      ...label,\n      children: [\n        ...own.filter((c) => c.kind === \"linter-error\"),\n        ...sortLinterNodes(nested),\n        ...own.filter((c) => c.kind !== \"linter-error\"),\n      ],\n      failed,\n      passed: node.passed && !failed && nested.every((n) => n.passed || n.skipped),\n    };\n  };\n\n  const topLevel = new Set([...nodes.keys(), ...childrenOf.keys()]);\n  return [\n    ...roots.filter((n) => n.kind !== \"linter\"),\n    ...Array.from(topLevel)\n      .filter((name) => parentOf(name) === undefined)\n      .map((name) => attach(name)),\n  ];\n}\n\n// ---------------------------------------------------------------------------\n// Collapsing, route paths, lookup\n\nfunction joinChainNames(parent: string, child: string): string {\n  const p = parent.trim();\n  const c = child.trim();\n  return p && c ? `${p.replace(/\\/+$/, \"\")}/${c.replace(/^\\/+/, \"\")}` : p || c;\n}\n\n/**\n * Folds a folder (a node of `folderKind`) that has a single child into that\n * child: `pkg/sub/a.go`. Generic so other path trees can reuse it.\n */\nexport function collapseFolderChains<N extends { name: string; kind: string; children?: N[] | undefined }>(\n  nodes: N[],\n  folderKind: N[\"kind\"],\n): N[] {\n  return nodes.map((node) => {\n    if (!node.children || node.children.length === 0) return node;\n    const children = collapseFolderChains(node.children, folderKind);\n    if (children.length === 1 && node.kind === folderKind) {\n      const [child] = children;\n      return { ...child!, name: joinChainNames(node.name, child!.name) };\n    }\n    return { ...node, children };\n  });\n}\n\n/** Stable, unique route path per node: slug segments joined by `/`, siblings with equal slugs get `~N`. */\nfunction annotateRoutePaths(nodes: Draft[], parentSegments: string[] = []): LintNode[] {\n  const slugs = nodes.map((n) => slugify(n.name));\n  const totals = groupBy(slugs, (s) => s);\n  const seen = new Map<string, number>();\n  return nodes.map((node, i) => {\n    const slug = slugs[i]!;\n    const ordinal = (seen.get(slug) ?? 0) + 1;\n    seen.set(slug, ordinal);\n    const segment = totals.get(slug)!.length > 1 ? `${slug}~${ordinal}` : slug;\n    const segments = [...parentSegments, segment];\n    const { children, ...rest } = node;\n    return {\n      ...rest,\n      route_path: segments.join(\"/\"),\n      ...(children ? { children: annotateRoutePaths(children, segments) } : {}),\n    };\n  });\n}\n\nconst GROUPERS: Record<LintGrouping, (results: readonly LinterResult[], filters: LintFilters) => Draft[]> = {\n  \"linter-rule-file\": groupByLinterRuleFile,\n  \"linter-file\": groupByLinterFile,\n  \"file-linter-rule\": groupByFileLinterRule,\n  summary: groupBySummary,\n};\n\n/** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */\nexport function buildLintTree({\n  results,\n  grouping,\n  filters,\n}: {\n  results: readonly LinterResult[];\n  grouping: LintGrouping;\n  filters: LintFilters;\n}): LintNode[] {\n  const grouped = withInFlightLinters(\n    withLinterErrors(GROUPERS[grouping](results, filters), results, filters),\n    results,\n    filters,\n  );\n  // The file-rooted grouping has no linter roots to order or nest.\n  const ordered = grouping === \"file-linter-rule\" ? grouped : sortLinterNodes(nestChildLinters(grouped, results, filters));\n  // Summary keeps its linter -> rule -> file branches as built.\n  return annotateRoutePaths(grouping === \"summary\" ? ordered : collapseFolderChains(ordered, \"lint-folder\"));\n}\n\n/** Depth-first lookup of the node whose route_path equals `path`, or null. */\nexport function findLintNode(nodes: readonly LintNode[], path: string): LintNode | null {\n  if (!path) return null;\n  for (const node of nodes) {\n    if (node.route_path === path) return node;\n    const found = node.children ? findLintNode(node.children, path) : null;\n    if (found) return found;\n  }\n  return null;\n}\n"],"mappings":";;;;;AAmDA,IAAM,UAAU;AAChB,IAAM,qBAAqB;AAE3B,SAAS,WAAW,GAAsB;CACxC,OAAO,EAAE,MAAM,UAAU;AAC3B;AAEA,SAAS,OAAO,YAA+C;CAC7D,OAAO,WAAW,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ,EAAE;AACxE;AAEA,SAAS,UAAU,GAAmB;CACpC,MAAM,MAAM,EAAE,QAAQ,IAAI;CAC1B,OAAO,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AACxC;AAEA,SAAS,QAAc,OAAqB,KAAkC;CAC5E,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC;EAC9B,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;CAChC;CACA,OAAO;AACT;AAEA,SAAS,WAAc,KAA+B;CACpD,OAAO,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK;AACrC;;AAMA,SAAgB,YAAY,SAAkC,SAAuC;CACnG,MAAM,UAAU,QAAQ,QAAQ,MAAMA,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,YAAY,IAAI,IAAI,QAAQ,SAAS,MAAO,EAAE,WAAW,CAACC,cAAAA,kBAAkB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO;CAC9G,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,KAAK,OAAO,cAAc,CAAC,GAAG;EACvC,IAAI,CAACD,oBAAAA,mBAAmBE,cAAAA,WAAW,CAAC,GAAG,QAAQ,QAAQ,GAAG;EAC1D,MAAM,UAAUC,cAAAA,QAAQ,EAAE,MAAM,OAAO,QAAQ;EAC/C,MAAM,OAAOC,cAAAA,iBAAiB,SAAS,OAAO,UAAU,SAAS;EACjE,IAAI,KAAK;GACP,QAAQ,OAAO;GACf;GACA,GAAG;IAAE,GAAG;IAAG,UAAU;IAAS;GAAK;GACnC;GACA;GACA,SAAS,OAAO;EAClB,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6D;CACjF,MAAM,uBAAO,IAAI,IAA0B;CAC3C,KAAK,MAAM,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,EAAE,MAAM,GAAG,KAAK,IAAI,EAAE,QAAQ,CAAC;CACtE,OAAO;AACT;AAKA,SAAS,UAAsB;CAC7B,OAAO;EAAE,MAAM;EAAI,MAAM,KAAA;EAAW,SAAS;EAAI,yBAAS,IAAI,IAAI;EAAG,wBAAQ,IAAI,IAAI;CAAE;AACzF;;AAGA,SAAS,SAAY,MAAe,MAAc,SAAiB,QAAoB;CACrF,MAAM,WAAWC,cAAAA,sBAAsB,IAAI;CAC3C,MAAM,cAAcA,cAAAA,sBAAsB,OAAO;CACjD,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAClD,MAAM,IAAI,MAAM,kDAAkD,KAAK,UAAU,IAAI,EAAE,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE;CAE3H,MAAM,iBAAiB,SAAS,MAAM,GAAG,EAAE;CAC3C,MAAM,oBAAoB,YAAY,MAAM,GAAG,EAAE;CAGjD,MAAM,YAAY,eAAe,SAAS,kBAAkB;CAC5D,IAAI,UAAU;CACd,eAAe,SAAS,SAAS,MAAM;EACrC,IAAI,QAAQ,QAAQ,QAAQ,IAAI,OAAO;EACvC,IAAI,CAAC,OAAO;GACV,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,kBAAkB,QAAQ,IAAI,IAAI,SAAS,CAAC;GAClF,QAAQ;IACN,MAAM;IACN,MAAM,QAAQ,OAAO,GAAG,QAAQ,KAAK,GAAG,YAAY;IACpD,SAAS,kBAAkB,MAAM,GAAG,QAAQ,CAAC,CAAC,KAAK,GAAG;IACtD,yBAAS,IAAI,IAAI;IACjB,wBAAQ,IAAI,IAAI;GAClB;GACA,QAAQ,QAAQ,IAAI,SAAS,KAAK;EACpC;EACA,UAAU;CACZ,CAAC;CACD,MAAM,WAAW,SAAS,SAAS,SAAS;CAC5C,IAAI,OAAO,QAAQ,OAAO,IAAI,QAAQ;CACtC,IAAI,CAAC,MAAM;EACT,OAAO,OAAO;EACd,QAAQ,OAAO,IAAI,UAAU,IAAI;CACnC;CACA,OAAO;AACT;AAKA,SAAS,UAAU,MAAc,MAAqB,UAA0B;CAC9E,MAAM,SAAS,SAAS,MAAM,MAAM,EAAE,MAAM;CAC5C,OAAO;EAAE;EAAM;EAAM;EAAU;EAAQ,QAAQ,CAAC;EAAQ,SAAS;CAAM;AACzE;AAEA,SAAS,cAAc,UAAgD;CACrE,MAAM,OAAO,IAAI,IAAI,SAAS,SAAS,MAAO,EAAE,WAAW,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAE,CAAC;CAC9E,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,KAAA;AACjD;AAEA,SAAS,qBAAqB,MAAa,QAAqC;CAC9E,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,KAAK,UAAUC,cAAAA,cAAc,MAAM,MAAM;CACxD,OAAO;EAAE,GAAG;EAAM,kBAAkB,OAAO,MAAM;EAAG;EAAQ,QAAQ,CAAC;CAAO;AAC9E;AAEA,SAAS,cAAc,MAQb;CACR,MAAM,SAASA,cAAAA,cAAc,KAAK,UAAU,MAAM;CAClD,OAAO;EACL,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,YAAY,KAAK;EACjB,YAAY,OAAO,KAAK,UAAU;EAClC;EACA,QAAQ,CAAC;EACT,SAAS;CACX;AACF;AAEA,SAAS,WACP,YACA,QACA,UACA,SAA+B,CAAC,GACzB;CACP,OAAO,qBAAqB;EAAE,GAAG,UAAU,YAAY,UAAU,QAAQ;EAAG,QAAQ;EAAQ;CAAW,GAAG,MAAM;AAClH;AAEA,SAAS,gBAAgB,QAA6B;CACpD,MAAM,UAAUC,cAAAA,mBAAmB,MAAM;CACzC,OAAO;EACL,MAAM,UAAU,OAAO;EACvB,MAAM;EACN,YAAY,OAAO;EACnB,QAAQ;EACR,UAAU,OAAO;EACjB,QAAQ;EACR,QAAQ;EACR,SAAS;EACT;CACF;AACF;AAEA,SAAS,UAAU,MAAwB,YAAoB,UAA4B;CACzF,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,UAAU,QAAQ,YAAY,QAAQ,CAAC;EAC1F,OAAO;GACL,GAAG;GACH,MAAM,OAAO;GACb,aAAa,OAAO;GACpB;GACA,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAC/B,UAAU,cAAc,KAAK,QAAS;EACxC;CACF,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,SAAS,KAAK,OAAO,IAAI,GAAG;EAElC,MAAM,OAAO,cAAc;GACzB,MAAM;GACN,MAAM;GACN,MAJe,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;GAKnD,SAAS,OAAO;GAChB;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;EAClB,CAAC;EACD,OAAO,WAAW;GAAE,GAAG;GAAM;EAAS,IAAI;CAC5C,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAIA,SAAS,gBAAgB,MAAyB,YAAgD;CAChG,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,gBAAgB,QAAQ,UAAU,CAAC;EACtF,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO;GAAM,aAAa,OAAO;GAAS,UAAU,cAAc,KAAK,QAAS;EAAE;CAC5G,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,UAAU,KAAK,OAAO,IAAI,GAAG;EACnC,MAAM,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;EACrD,MAAM,eAAe,WAAW,OAAO,CAAC,CAAC,KAAK,eAAe;GAC3D,MAAM,EAAE,SAAS,UAAU,QAAQ,IAAI,UAAU;GACjD,MAAM,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,SAAS;IACjD,MAAM,aAAa,MAAM,IAAI,IAAI;IACjC,OAAO;KACL,GAAG,cAAc;MACf,MAAM;MACN,MAAM;MACN,MAAM;MACN,SAAS,WAAW,EAAE,EAAE,YAAY;MACpC;MACA;MACA;KACF,CAAC;KACD,UAAU;IACZ;GACF,CAAC;GACD,OAAO;IACL,GAAG,WAAW,YAAY,WAAW,IAAI,UAAU,GAAG,UAAU;IAChE,MAAM;IACN,aAAa,WAAW,EAAE,EAAE;IAC5B,UAAU;GACZ;EACF,CAAC;EACD,OAAO;GACL,GAAG,UAAU,KAAK,aAAa,YAAY;GAC3C,MAAM;GACN,aAAa,aAAa,EAAE,EAAE;GAC9B,UAAU,cAAc,YAAY;EACtC;CACF,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAKA,SAAS,YAAY,MAAkD;CACrE,MAAM,OAAO,QAAoB;CACjC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa;GACjD,SAAS,EAAE,WAAW,EAAE;GACxB,SAAS,EAAE;GACX,YAAY,CAAC;EACf,EAAE,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC;CACzB;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACxC,KAAK,CAAC,CACN,KAAK,SAAS;GACb,MAAM,QAAQ,OAAO,IAAI,IAAI;GAC7B,MAAM,WAAW,UAAU,YAAY,KAAK,GAAG,YAAY,IAAI;GAE/D,OAAO,qBACL;IACE,GAHS,UAAU,MAAM,mBAAmB,QAGzC;IACH;IACA,UAAU;IACV,UAAU,cAAc,QAAQ,KAAK,KAAK,IAAI,UAAU,CAAC,EAAE;GAC7D,GACA,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;EACF,CAAC;EACH,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,SAAS;CAC/D,CAAC;AACL;AAEA,SAAS,kBAAkB,SAAkC,SAA+B;CAC1F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,SAAS,IAAI,UAAU;EACrC,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,YAAY,KAAK,GAAG,UAAU,GACxC,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;CACF,CAAC;AACL;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,OAAO,YAAY,SAAS,OAAO;CACzC,MAAM,OAAO,QAAqB;CAClC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,MAAM,UAAU,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,4BAAY,IAAI,IAAI,CAAC;EAC3E,IAAI,QAAQ,QAAQ,IAAI,EAAE,MAAM;EAChC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,SAAS,EAAE;IAAS,uBAAO,IAAI,IAAI;GAAE;GAC/C,QAAQ,IAAI,EAAE,QAAQ,KAAK;EAC7B;EACA,MAAM,OAAO,WAAW,EAAE,CAAC;EAC3B,MAAM,MAAM,IAAI,MAAM,CAAC,GAAI,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC,CAAC;CAC/D;CAEA,MAAM,WAAW,QAAQ,KAAK,QAAQ,MAAM,CAAC,EAAE,IAAI,IAAI,MAAM,EAAE,MAAM;CACrE,MAAM,gBAAgB,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC9C,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,UAAU,KAAK,IAAI,UAAU,CAAC,EAAE;EACtC,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,UAAU;GACd,GAAG,cAAc;IACf,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT;IACA,YAAY,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,EAAE,CAAC;IAC5C;GACF,CAAC;GACD,UAAU;GACV,MAAM,KAAA;GACN,aAAa,KAAA;EACf,EAAE;EACJ,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,MAAM;CAC5D,CAAC;CAEH,OAAO,CAAC,GAAG,gBAAgB,MAAM,IAAI,GAAG,GAAG,aAAa;AAC1D;AAEA,SAAS,iBAAiB,MAA0B,YAA0C;CAC5F,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,WAAW,SAAS,GAAG,OAAO,GAAG,KAAK,IAAI,WAAW,OAAO;CAChE,MAAM,IAAI,WAAW;CACrB,IAAI,GAAG,MAAM,OAAO,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,WAAW,GAAG,KAAK,GAAG,EAAE;CAC9E,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,YAAoB,OAAwC;CACjG,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,QAAQ,EAAE;CACjD,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,CAAC;CACrC,MAAM,QAAiB,KAAK,MAAM,GAAG,kBAAkB,CAAC,CAAC,KAAK,QAAQ;EACpE,MAAM,QAAQ,OAAO,IAAI,GAAG;EAC5B,OAAO;GACL,GAAG,cAAc;IACf,MAAM,iBAAiB,MAAM,EAAE,CAAE,MAAM,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;IAC5D,MAAM;IACN,MAAM,MAAM,EAAE,CAAE,QAAQ;IACxB,SAAS,MAAM,EAAE,CAAE,WAAW;IAC9B;IACA,YAAY,MAAM,KAAK,MAAM,EAAE,CAAC;IAChC,SAAS,MAAM,EAAE,CAAE;GACrB,CAAC;GACD,MAAM,MAAM,EAAE,CAAE;GAChB,aAAa,MAAM,EAAE,CAAE;GACvB,UAAU;EACZ;CACF,CAAC;CACD,MAAM,YAAY,KAAK,SAAS,MAAM;CACtC,IAAI,YAAY,GACd,MAAM,KAAK;EACT,MAAM,KAAK,UAAU,YAAY,cAAc,IAAI,KAAK;EACxD,MAAM;EACN;EACA,UAAU;EACV,QAAQ;EACR,QAAQ;EACR,SAAS;CACX,CAAC;CAEH,MAAM,eAAe,MAAM,MAAM,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE;CAEvD,OAAO;EAAE,GAAG,UADC,eAAe,GAAG,KAAK,IAAI,MAAM,OAAO,MAAM,iBAAiB,GAAG,KAAK,IAAI,MAAM,OAAO,IACzE,mBAAmB,KAAK;EAAG;EAAY,UAAU;CAAK;AACpF;AAEA,SAAS,eAAe,SAAkC,SAA+B;CACvF,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,eAAe,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CAC3E,MAAM,UAAU,QAAQ,QAAQ,MAAMP,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,UAAU,IAAI,IAAI,QAAQ,QAAQ,MAAM,EAAE,OAAO,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,QAAQ,EAAE,SAAS,SAAS,CAAC,CAAC;CAErG,OAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CACrD,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,aAAa,IAAI,UAAU,KAAK,CAAC;EAC/C,IAAI,MAAM,WAAW,KAAK,QAAQ,IAAI,UAAU,GAC9C,OAAO;GACL,MAAM;GACN,MAAM;GACN,QAAQ,KAAK,IAAI,UAAU;GAC3B;GACA,SAAS;GACT,QAAQ;GACR,QAAQ;GACR,SAAS,YAAY,QAAQ,IAAI,UAAU;EAC7C;EAEF,MAAM,SAAS,QAAQ,QAAQ,MAAM,WAAW,EAAE,CAAC,CAAC;EACpD,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,MACzC,GAAG,MAAM,OAAO,IAAI,CAAC,CAAC,CAAE,SAAS,OAAO,IAAI,CAAC,CAAC,CAAE,UAAU,EAAE,cAAc,CAAC,CAC9E;EACA,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,KAAK,SAAS,gBAAgB,MAAM,YAAY,OAAO,IAAI,IAAI,CAAE,CAAC,CAC9E;CACF,CAAC;AACL;;AAGA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CACzG,MAAM,SAAS,QACb,QAAQ,QAAQ,MAAMQ,cAAAA,gBAAgB,CAAC,KAAKR,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC,IACvF,MAAM,EAAE,MACX;CACA,IAAI,OAAO,SAAS,GAAG,OAAO;CAC9B,MAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACxF,KAAK,MAAM,CAAC,MAAM,WAAW,QAAQ;EACnC,MAAM,aAAa,OAAO,IAAI,eAAe;EAC7C,MAAM,WAAW,QAAQ,IAAI,IAAI;EACjC,QAAQ,IACN,MACA,WACI;GAAE,GAAG;GAAU,UAAU,CAAC,GAAG,YAAY,GAAI,SAAS,YAAY,CAAC,CAAE;GAAG,QAAQ;GAAM,QAAQ;EAAM,IACpG,WAAW,MAAM,OAAO,IAAI,UAAU,CAC5C;CACF;CAEA,OAAO,CAAC,GADO,MAAM,QAAQ,MAAM,EAAE,SAAS,QACnC,GAAQ,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,SAAS,QAAQ,IAAI,IAAI,CAAE,CAAC;AAC7E;AAEA,SAAS,cAAc,OAAyB,uBAAO,IAAI,IAAY,GAAgB;CACrF,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,YAAY,KAAK,YAAY,KAAK,IAAI,KAAK,UAAU;EACvE,cAAc,KAAK,YAAY,CAAC,GAAG,IAAI;CACzC;CACA,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAAgB,SAAkC,SAA+B;CAC5G,MAAM,UAAU,cAAc,KAAK;CACnC,MAAM,0BAAU,IAAI,IAA0B;CAC9C,KAAK,MAAM,KAAK,SACd,IAAIS,cAAAA,iBAAiB,CAAC,KAAKT,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,KAAK,CAAC,QAAQ,IAAI,EAAE,MAAM,GAC9F,QAAQ,IAAI,EAAE,QAAQ,CAAC;CAG3B,MAAM,eAAe,UACnB,MAAM,KAAK,SAAS;EAClB,MAAM,WAAW,KAAK,WAAW,YAAY,KAAK,QAAQ,IAAI,KAAA;EAC9D,MAAM,WAAW,KAAK,SAAS,YAAY,KAAK,WAAW,KAAA,KAAaS,cAAAA,iBAAiB,KAAK,MAAM;EACpG,OAAO;GAAE,GAAG;GAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAAI,GAAI,WAAW,EAAE,QAAQ,MAAM,IAAI,CAAC;EAAG;CAC9F,CAAC;CACH,IAAI,QAAQ,SAAS,GAAG,OAAO,YAAY,KAAK;CAChD,MAAM,QAAQ,MAAM,KAAK,QAAQ,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,WAAW,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,IAAI,CAAC,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACvG,OAAO,YAAY,CAAC,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAAG,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAE,CAAC,CAAC;AACtH;AAKA,IAAM,iBAAiB;CAAC;CAAW;CAAW;CAAU;CAAY;AAAQ;;AAI5E,SAAS,aAAa,MAAqB;CACzC,MAAM,MACJ,KAAK,QAAQ,WAAW,YACpB,YACA,KAAK,QAAQ,WAAW,YACtB,YACA,KAAK,UAAU,MAAM,MAAM,EAAE,SAAS,cAAc,IAClD,WACAC,cAAAA,cAAc,IAAI,IAAI,IACpB,aACA;CACZ,MAAM,UAAU,KAAK,YAAY,CAAC,EAAA,CAAG,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,IAAI,YAAY;CACxF,OAAO,KAAK,IAAI,eAAe,QAAQ,GAAG,GAAG,GAAG,MAAM;AACxD;;AAGA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,MACJ,KAAK,UAAU;EAAE;EAAM,QAAQ,aAAa,IAAI;CAAE,EAAE,CAAC,CACrD,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,KAAK,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,IAAI,EAAE,CAAC,CAC3G,KAAK,EAAE,WAAW,IAAI;AAC3B;;;;;;AAOA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CAEzG,MAAM,OAAO,aADG,QAAQ,QAAQ,MAAMV,oBAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CACvD,CAAO;CACjC,MAAM,YAAY,SAAqC;EACrD,KAAK,IAAI,IAAI,KAAK,YAAY,GAAG,GAAG,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK,IAAI,CAAC,GACxE,IAAI,KAAK,IAAI,KAAK,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,CAAC;CAG1D;CACA,MAAM,QAAQ,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACtF,MAAM,aAAa,QACjB,MAAM,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS,SAAS,IAAI,MAAM,KAAA,CAAS,IACpE,SAAS,SAAS,IAAI,CACzB;CACA,IAAI,WAAW,SAAS,GAAG,OAAO;CAElC,MAAM,UAAU,MAAc,gBAAgC;EAC5D,MAAM,OAAO,MAAM,IAAI,IAAI,KAAK,WAAW,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;EACnE,MAAM,UAAU,WAAW,IAAI,IAAI,KAAK,CAAC,EAAA,CAAG,KAAK,UAAU,OAAO,OAAO,IAAI,CAAC;EAC9E,MAAM,QAAQ,cAAc;GAAE,MAAM,KAAK,MAAM,YAAY,SAAS,CAAC;GAAG;EAAY,IAAI,CAAC;EACzF,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE,GAAG;GAAM,GAAG;EAAM;EACpD,MAAM,MAAM,KAAK,YAAY,CAAC;EAC9B,MAAM,SAAS,KAAK,UAAU,OAAO,MAAM,MAAM,EAAE,MAAM;EACzD,OAAO;GACL,GAAG;GACH,GAAG;GACH,UAAU;IACR,GAAG,IAAI,QAAQ,MAAM,EAAE,SAAS,cAAc;IAC9C,GAAG,gBAAgB,MAAM;IACzB,GAAG,IAAI,QAAQ,MAAM,EAAE,SAAS,cAAc;GAChD;GACA;GACA,QAAQ,KAAK,UAAU,CAAC,UAAU,OAAO,OAAO,MAAM,EAAE,UAAU,EAAE,OAAO;EAC7E;CACF;CAEA,MAAM,2BAAW,IAAI,IAAI,CAAC,GAAG,MAAM,KAAK,GAAG,GAAG,WAAW,KAAK,CAAC,CAAC;CAChE,OAAO,CACL,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAC1C,GAAG,MAAM,KAAK,QAAQ,CAAC,CACpB,QAAQ,SAAS,SAAS,IAAI,MAAM,KAAA,CAAS,CAAC,CAC9C,KAAK,SAAS,OAAO,IAAI,CAAC,CAC/B;AACF;AAKA,SAAS,eAAe,QAAgB,OAAuB;CAC7D,MAAM,IAAI,OAAO,KAAK;CACtB,MAAM,IAAI,MAAM,KAAK;CACrB,OAAO,KAAK,IAAI,GAAG,EAAE,QAAQ,QAAQ,EAAE,EAAE,GAAG,EAAE,QAAQ,QAAQ,EAAE,MAAM,KAAK;AAC7E;;;;;AAMA,SAAgB,qBACd,OACA,YACK;CACL,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,GAAG,OAAO;EACzD,MAAM,WAAW,qBAAqB,KAAK,UAAU,UAAU;EAC/D,IAAI,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY;GACrD,MAAM,CAAC,SAAS;GAChB,OAAO;IAAE,GAAG;IAAQ,MAAM,eAAe,KAAK,MAAM,MAAO,IAAI;GAAE;EACnE;EACA,OAAO;GAAE,GAAG;GAAM;EAAS;CAC7B,CAAC;AACH;;AAGA,SAAS,mBAAmB,OAAgB,iBAA2B,CAAC,GAAe;CACrF,MAAM,QAAQ,MAAM,KAAK,MAAMW,kBAAAA,QAAQ,EAAE,IAAI,CAAC;CAC9C,MAAM,SAAS,QAAQ,QAAQ,MAAM,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAoB;CACrC,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,MAAM,OAAO,MAAM;EACnB,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK;EACxC,KAAK,IAAI,MAAM,OAAO;EACtB,MAAM,UAAU,OAAO,IAAI,IAAI,CAAC,CAAE,SAAS,IAAI,GAAG,KAAK,GAAG,YAAY;EACtE,MAAM,WAAW,CAAC,GAAG,gBAAgB,OAAO;EAC5C,MAAM,EAAE,UAAU,GAAG,SAAS;EAC9B,OAAO;GACL,GAAG;GACH,YAAY,SAAS,KAAK,GAAG;GAC7B,GAAI,WAAW,EAAE,UAAU,mBAAmB,UAAU,QAAQ,EAAE,IAAI,CAAC;EACzE;CACF,CAAC;AACH;AAEA,IAAM,WAAsG;CAC1G,oBAAoB;CACpB,eAAe;CACf,oBAAoB;CACpB,SAAS;AACX;;AAGA,SAAgB,cAAc,EAC5B,SACA,UACA,WAKa;CACb,MAAM,UAAU,oBACd,iBAAiB,SAAS,SAAS,CAAC,SAAS,OAAO,GAAG,SAAS,OAAO,GACvE,SACA,OACF;CAEA,MAAM,UAAU,aAAa,qBAAqB,UAAU,gBAAgB,iBAAiB,SAAS,SAAS,OAAO,CAAC;CAEvH,OAAO,mBAAmB,aAAa,YAAY,UAAU,qBAAqB,SAAS,aAAa,CAAC;AAC3G;;AAGA,SAAgB,aAAa,OAA4B,MAA+B;CACtF,IAAI,CAAC,MAAM,OAAO;CAClB,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,eAAe,MAAM,OAAO;EACrC,MAAM,QAAQ,KAAK,WAAW,aAAa,KAAK,UAAU,IAAI,IAAI;EAClE,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT"}

package/dist/data/lint/grouping.d.ts

@@ -1,4 +1,24 @@
-import { LintFilters, LintGrouping, LintNode, LinterResult } from './types.js';
+import { LintFilters, LintGrouping, LintNode, LinterResult, Violation } from './types.js';
+/** A violation with its linter and paths resolved, as every view lists it. */
+export type FlatViolation = {
+    linter: string;
+    result: LinterResult;
+    v: Violation;
+    file: string | undefined;
+    rawFile: string | undefined;
+    workDir: string | undefined;
+};
+/** Every violation the filters keep, with work-dir-relative and display paths. */
+export declare function flattenLint(results: readonly LinterResult[], filters: LintFilters): FlatViolation[];
+/**
+ * Folds a folder (a node of `folderKind`) that has a single child into that
+ * child: `pkg/sub/a.go`. Generic so other path trees can reuse it.
+ */
+export declare function collapseFolderChains<N extends {
+    name: string;
+    kind: string;
+    children?: N[] | undefined;
+}>(nodes: N[], folderKind: N["kind"]): N[];
 /** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */
 export declare function buildLintTree({ results, grouping, filters, }: {
     results: readonly LinterResult[];

package/dist/data/lint/grouping.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"grouping.d.ts","sourceRoot":"","sources":["../../../src/data/lint/grouping.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EACV,WAAW,EACX,YAAY,EACZ,QAAQ,EACR,YAAY,EAEb,MAAM,SAAS,CAAC;AA2gBjB,wFAAwF;AACxF,wBAAgB,aAAa,CAAC,EAC5B,OAAO,EACP,QAAQ,EACR,OAAO,GACR,EAAE;IACD,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IACjC,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,WAAW,CAAC;CACtB,GAAG,QAAQ,EAAE,CAIb;AAED,8EAA8E;AAC9E,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CAQtF"}
+{"version":3,"file":"grouping.d.ts","sourceRoot":"","sources":["../../../src/data/lint/grouping.ts"],"names":[],"mappings":"AAqBA,OAAO,KAAK,EACV,WAAW,EACX,YAAY,EACZ,QAAQ,EACR,YAAY,EACZ,SAAS,EACV,MAAM,SAAS,CAAC;AAIjB,8EAA8E;AAC9E,MAAM,MAAM,aAAa,GAAG;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,YAAY,CAAC;IACrB,CAAC,EAAE,SAAS,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzB,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5B,OAAO,EAAE,MAAM,GAAG,SAAS,CAAC;CAC7B,CAAC;AA6CF,kFAAkF;AAClF,wBAAgB,WAAW,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,EAAE,OAAO,EAAE,WAAW,GAAG,aAAa,EAAE,CAoBnG;AAugBD;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,SAAS;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,SAAS,CAAA;CAAE,EACvG,KAAK,EAAE,CAAC,EAAE,EACV,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,GACpB,CAAC,EAAE,CAUL;AA6BD,wFAAwF;AACxF,wBAAgB,aAAa,CAAC,EAC5B,OAAO,EACP,QAAQ,EACR,OAAO,GACR,EAAE;IACD,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IACjC,QAAQ,EAAE,YAAY,CAAC;IACvB,OAAO,EAAE,WAAW,CAAC;CACtB,GAAG,QAAQ,EAAE,CAUb;AAED,8EAA8E;AAC9E,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI,CAQtF"}

package/dist/data/lint/grouping.js

@@ -1,7 +1,7 @@
 import { matchesFilterState } from "../test-runner/filterState.js";
-import { slugify } from "../test-runner/routePath.js";
 import { collapsedPathSegments, decorateLintFile, normalizeLintPath, relPath } from "./paths.js";
-import { isLinterErrored, linterErrorMessage, severityOf, worstSeverity } from "./stats.js";
+import { slugify } from "../test-runner/routePath.js";
+import { isLinterErrored, isLinterInFlight, lintNodeCount, linterErrorMessage, severityOf, worstSeverity } from "./stats.js";
 // src/data/lint/grouping.ts
 var NO_RULE = "(no rule)";
 var SUMMARY_FILE_LIMIT = 5;
@@ -27,6 +27,7 @@ function groupBy(items, key) {
 function sortedKeys(map) {
 	return Array.from(map.keys()).sort();
 }
+/** Every violation the filters keep, with work-dir-relative and display paths. */
 function flattenLint(results, filters) {
 	const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));
 	const multiRoot = new Set(visible.flatMap((r) => r.work_dir ? [normalizeLintPath(r.work_dir)] : [])).size > 1;
@@ -396,17 +397,110 @@ function withLinterErrors(roots, results, filters) {
 	}
 	return [...roots.filter((n) => n.kind !== "linter"), ...sortedKeys(linters).map((name) => linters.get(name))];
 }
+function linterNamesIn(nodes, into = /* @__PURE__ */ new Set()) {
+	for (const node of nodes) {
+		if (node.kind === "linter" && node.linterName) into.add(node.linterName);
+		linterNamesIn(node.children ?? [], into);
+	}
+	return into;
+}
+/**
+* Linters still queued or running appear in every grouping even before they
+* report a violation, and have no verdict (`passed` stays false) until they finish.
+*/
+function withInFlightLinters(roots, results, filters) {
+	const present = linterNamesIn(roots);
+	const missing = /* @__PURE__ */ new Map();
+	for (const r of results) if (isLinterInFlight(r) && matchesFilterState(r.linter, filters.linter) && !present.has(r.linter)) missing.set(r.linter, r);
+	const markPending = (nodes) => nodes.map((node) => {
+		const children = node.children ? markPending(node.children) : void 0;
+		const inFlight = node.kind === "linter" && node.linter !== void 0 && isLinterInFlight(node.linter);
+		return {
+			...node,
+			...children ? { children } : {},
+			...inFlight ? { passed: false } : {}
+		};
+	});
+	if (missing.size === 0) return markPending(roots);
+	const added = Array.from(missing.values()).map((r) => linterNode(r.linter, r, []));
+	const linters = new Map([...roots.filter((n) => n.kind === "linter"), ...added].map((n) => [n.name, n]));
+	return markPending([...roots.filter((n) => n.kind !== "linter"), ...sortedKeys(linters).map((k) => linters.get(k))]);
+}
+var STATUS_BUCKETS = [
+	"running",
+	"pending",
+	"failed",
+	"findings",
+	"passed"
+];
+/** Where a linter node sorts: its own state, or a nested linter's if that is more urgent. */
+function statusBucket(node) {
+	const own = node.linter?.status === "running" ? "running" : node.linter?.status === "pending" ? "pending" : node.children?.some((c) => c.kind === "linter-error") ? "failed" : lintNodeCount(node) > 0 ? "findings" : "passed";
+	const nested = (node.children ?? []).filter((c) => c.kind === "linter").map(statusBucket);
+	return Math.min(STATUS_BUCKETS.indexOf(own), ...nested);
+}
+/** Running → pending → failed → with findings → passed; by name within a bucket (the sort is stable). */
+function sortLinterNodes(nodes) {
+	return nodes.map((node) => ({
+		node,
+		bucket: statusBucket(node)
+	})).sort((a, b) => a.bucket - b.bucket || (a.node.name < b.node.name ? -1 : a.node.name > b.node.name ? 1 : 0)).map(({ node }) => node);
+}
+/**
+* Results named `<parent>/<child>` where a `<parent>` result exists (the linters
+* a prompt run's agent ran) become linter nodes beneath the parent's node,
+* shown by their child name. Without a visible parent they stay top-level.
+*/
+function nestChildLinters(roots, results, filters) {
+	const meta = linterMetaOf(results.filter((r) => matchesFilterState(r.linter, filters.linter)));
+	const parentOf = (name) => {
+		for (let i = name.lastIndexOf("/"); i > 0; i = name.lastIndexOf("/", i - 1)) if (meta.has(name.slice(0, i))) return name.slice(0, i);
+	};
+	const nodes = new Map(roots.filter((n) => n.kind === "linter").map((n) => [n.name, n]));
+	const childrenOf = groupBy(Array.from(meta.keys()).filter((name) => parentOf(name) !== void 0), (name) => parentOf(name));
+	if (childrenOf.size === 0) return roots;
+	const attach = (name, nestedUnder) => {
+		const node = nodes.get(name) ?? linterNode(name, meta.get(name), []);
+		const nested = (childrenOf.get(name) ?? []).map((child) => attach(child, name));
+		const label = nestedUnder ? {
+			name: name.slice(nestedUnder.length + 1),
+			nestedUnder
+		} : {};
+		if (nested.length === 0) return {
+			...node,
+			...label
+		};
+		const own = node.children ?? [];
+		const failed = node.failed || nested.some((n) => n.failed);
+		return {
+			...node,
+			...label,
+			children: [
+				...own.filter((c) => c.kind === "linter-error"),
+				...sortLinterNodes(nested),
+				...own.filter((c) => c.kind !== "linter-error")
+			],
+			failed,
+			passed: node.passed && !failed && nested.every((n) => n.passed || n.skipped)
+		};
+	};
+	const topLevel = /* @__PURE__ */ new Set([...nodes.keys(), ...childrenOf.keys()]);
+	return [...roots.filter((n) => n.kind !== "linter"), ...Array.from(topLevel).filter((name) => parentOf(name) === void 0).map((name) => attach(name))];
+}
 function joinChainNames(parent, child) {
 	const p = parent.trim();
 	const c = child.trim();
-	return p && c ? `${p} > ${c}` : p || c;
+	return p && c ? `${p.replace(/\/+$/, "")}/${c.replace(/^\/+/, "")}` : p || c;
 }
-/** Folds a folder that has a single child into that child: `pkg > sub > a.go`. */
-function collapseFolderChains(nodes) {
+/**
+* Folds a folder (a node of `folderKind`) that has a single child into that
+* child: `pkg/sub/a.go`. Generic so other path trees can reuse it.
+*/
+function collapseFolderChains(nodes, folderKind) {
 	return nodes.map((node) => {
 		if (!node.children || node.children.length === 0) return node;
-		const children = collapseFolderChains(node.children);
-		if (children.length === 1 && node.kind === "lint-folder") {
+		const children = collapseFolderChains(node.children, folderKind);
+		if (children.length === 1 && node.kind === folderKind) {
 			const [child] = children;
 			return {
 				...child,
@@ -446,8 +540,9 @@ var GROUPERS = {
 };
 /** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */
 function buildLintTree({ results, grouping, filters }) {
-	const grouped = withLinterErrors(GROUPERS[grouping](results, filters), results, filters);
-	return annotateRoutePaths(grouping === "summary" ? grouped : collapseFolderChains(grouped));
+	const grouped = withInFlightLinters(withLinterErrors(GROUPERS[grouping](results, filters), results, filters), results, filters);
+	const ordered = grouping === "file-linter-rule" ? grouped : sortLinterNodes(nestChildLinters(grouped, results, filters));
+	return annotateRoutePaths(grouping === "summary" ? ordered : collapseFolderChains(ordered, "lint-folder"));
 }
 /** Depth-first lookup of the node whose route_path equals `path`, or null. */
 function findLintNode(nodes, path) {
@@ -459,6 +554,6 @@ function findLintNode(nodes, path) {
 	}
 	return null;
 }
-export { buildLintTree, findLintNode };
+export { buildLintTree, collapseFolderChains, findLintNode, flattenLint };
 
 //# sourceMappingURL=grouping.js.map

package/dist/data/lint/grouping.js.map

@@ -1 +1 @@
-{"version":3,"file":"grouping.js","names":[],"sources":["../../../src/data/lint/grouping.ts"],"sourcesContent":["// Turns raw linter results into the selectable tree for each grouping. Ported\n// from gavel's testrunner/ui utils.ts. Differences from the original:\n//   - a linter that failed to run is shown under every grouping (gavel only\n//     showed it in `summary`), so a broken linter never reads as a clean run;\n//   - single-child folder chains are really collapsed (\"pkg > sub > a.go\");\n//     gavel's collapser never fired because folder nodes always carry a\n//     passed/failed flag;\n//   - file-scoped rule leaves in `file-linter-rule` carry their work_dir, so\n//     ignore actions on them are not sent without one.\n\nimport { matchesFilterState } from \"../test-runner/filterState\";\nimport { slugify } from \"../test-runner/routePath\";\nimport { collapsedPathSegments, decorateLintFile, normalizeLintPath, relPath } from \"./paths\";\nimport { isLinterErrored, linterErrorMessage, severityOf, worstSeverity } from \"./stats\";\nimport type {\n  LintFilters,\n  LintGrouping,\n  LintNode,\n  LinterResult,\n  Violation,\n} from \"./types\";\n\ntype Draft = Omit<LintNode, \"route_path\" | \"children\"> & { children?: Draft[] };\n\ntype FlatViolation = {\n  linter: string;\n  result: LinterResult;\n  v: Violation;\n  file: string | undefined;\n  rawFile: string | undefined;\n  workDir: string | undefined;\n};\n\ntype FileBucket = { rawFile: string; workDir: string | undefined; violations: Violation[] };\n\ntype Trie<L> = {\n  name: string;\n  path: string | undefined;\n  rawPath: string;\n  folders: Map<string, Trie<L>>;\n  leaves: Map<string, L>;\n};\n\nconst NO_RULE = \"(no rule)\";\nconst SUMMARY_FILE_LIMIT = 5;\n\nfunction ruleKeyFor(v: Violation): string {\n  return v.rule?.method || NO_RULE;\n}\n\nfunction byLine(violations: readonly Violation[]): Violation[] {\n  return violations.slice().sort((a, b) => (a.line ?? 0) - (b.line ?? 0));\n}\n\nfunction firstLine(s: string): string {\n  const idx = s.indexOf(\"\\n\");\n  return idx === -1 ? s : s.slice(0, idx);\n}\n\nfunction groupBy<T, K>(items: readonly T[], key: (item: T) => K): Map<K, T[]> {\n  const out = new Map<K, T[]>();\n  for (const item of items) {\n    const list = out.get(key(item));\n    if (list) list.push(item);\n    else out.set(key(item), [item]);\n  }\n  return out;\n}\n\nfunction sortedKeys<V>(map: Map<string, V>): string[] {\n  return Array.from(map.keys()).sort();\n}\n\n// ---------------------------------------------------------------------------\n// Flattening\n\nfunction flattenLint(results: readonly LinterResult[], filters: LintFilters): FlatViolation[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const multiRoot = new Set(visible.flatMap((r) => (r.work_dir ? [normalizeLintPath(r.work_dir)] : []))).size > 1;\n  const out: FlatViolation[] = [];\n  for (const result of visible) {\n    for (const v of result.violations ?? []) {\n      if (!matchesFilterState(severityOf(v), filters.severity)) continue;\n      const rawFile = relPath(v.file, result.work_dir);\n      const file = decorateLintFile(rawFile, result.work_dir, multiRoot);\n      out.push({\n        linter: result.linter,\n        result,\n        v: { ...v, raw_file: rawFile, file },\n        file,\n        rawFile,\n        workDir: result.work_dir,\n      });\n    }\n  }\n  return out;\n}\n\nfunction linterMetaOf(results: readonly LinterResult[]): Map<string, LinterResult> {\n  const meta = new Map<string, LinterResult>();\n  for (const r of results) if (!meta.has(r.linter)) meta.set(r.linter, r);\n  return meta;\n}\n\n// ---------------------------------------------------------------------------\n// Path trie\n\nfunction newTrie<L>(): Trie<L> {\n  return { name: \"\", path: undefined, rawPath: \"\", folders: new Map(), leaves: new Map() };\n}\n\n/** The leaf for `file`, created through `create` on first sight; folders are made on the way. */\nfunction trieLeaf<L>(root: Trie<L>, file: string, rawFile: string, create: () => L): L {\n  const segments = collapsedPathSegments(file);\n  const rawSegments = collapsedPathSegments(rawFile);\n  if (segments.length === 0 || rawSegments.length === 0) {\n    throw new Error(`lint: cannot place violation, empty path (file=${JSON.stringify(file)}, raw=${JSON.stringify(rawFile)})`);\n  }\n  const folderSegments = segments.slice(0, -1);\n  const rawFolderSegments = rawSegments.slice(0, -1);\n  // The decorated path may carry extra leading segments (the work dir label)\n  // that the raw, work_dir-relative path does not.\n  const rawOffset = folderSegments.length - rawFolderSegments.length;\n  let current = root;\n  folderSegments.forEach((segment, i) => {\n    let child = current.folders.get(segment);\n    if (!child) {\n      const rawCount = Math.max(0, Math.min(rawFolderSegments.length, i + 1 - rawOffset));\n      child = {\n        name: segment,\n        path: current.path ? `${current.path}/${segment}` : segment,\n        rawPath: rawFolderSegments.slice(0, rawCount).join(\"/\"),\n        folders: new Map(),\n        leaves: new Map(),\n      };\n      current.folders.set(segment, child);\n    }\n    current = child;\n  });\n  const basename = segments[segments.length - 1]!;\n  let leaf = current.leaves.get(basename);\n  if (!leaf) {\n    leaf = create();\n    current.leaves.set(basename, leaf);\n  }\n  return leaf;\n}\n\n// ---------------------------------------------------------------------------\n// Node builders\n\nfunction container(name: string, kind: Draft[\"kind\"], children: Draft[]): Draft {\n  const failed = children.some((c) => c.failed);\n  return { name, kind, children, failed, passed: !failed, skipped: false };\n}\n\nfunction uniqueWorkDir(children: readonly Draft[]): string | undefined {\n  const dirs = new Set(children.flatMap((c) => (c.work_dir ? [c.work_dir] : [])));\n  return dirs.size === 1 ? Array.from(dirs)[0] : undefined;\n}\n\nfunction withNoFileViolations(node: Draft, noFile: readonly Violation[]): Draft {\n  if (noFile.length === 0) return node;\n  const failed = node.failed || worstSeverity(noFile) !== \"info\";\n  return { ...node, noFileViolations: byLine(noFile), failed, passed: !failed };\n}\n\nfunction violationLeaf(args: {\n  name: string;\n  kind: \"lint-file\" | \"lint-rule\";\n  file: string;\n  rawFile: string;\n  linterName: string;\n  violations: readonly Violation[];\n  workDir: string | undefined;\n}): Draft {\n  const failed = worstSeverity(args.violations) !== \"info\";\n  return {\n    name: args.name,\n    kind: args.kind,\n    file: args.file,\n    target_path: args.rawFile,\n    work_dir: args.workDir,\n    linterName: args.linterName,\n    violations: byLine(args.violations),\n    failed,\n    passed: !failed,\n    skipped: false,\n  };\n}\n\nfunction linterNode(\n  linterName: string,\n  result: LinterResult | undefined,\n  children: Draft[],\n  noFile: readonly Violation[] = [],\n): Draft {\n  return withNoFileViolations({ ...container(linterName, \"linter\", children), linter: result, linterName }, noFile);\n}\n\nfunction linterErrorNode(result: LinterResult): Draft {\n  const message = linterErrorMessage(result);\n  return {\n    name: firstLine(message),\n    kind: \"linter-error\",\n    linterName: result.linter,\n    linter: result,\n    work_dir: result.work_dir,\n    failed: true,\n    passed: false,\n    skipped: false,\n    message,\n  };\n}\n\nfunction fileNodes(trie: Trie<FileBucket>, linterName: string, ruleName?: string): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileNodes(folder, linterName, ruleName));\n    return {\n      ...node,\n      file: folder.path,\n      target_path: folder.rawPath,\n      linterName,\n      ...(ruleName ? { ruleName } : {}),\n      work_dir: uniqueWorkDir(node.children!),\n    };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const bucket = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const leaf = violationLeaf({\n      name: key,\n      kind: \"lint-file\",\n      file: fullPath,\n      rawFile: bucket.rawFile,\n      linterName,\n      violations: bucket.violations,\n      workDir: bucket.workDir,\n    });\n    return ruleName ? { ...leaf, ruleName } : leaf;\n  });\n  return [...folders, ...files];\n}\n\ntype FileLinters = Map<string, { workDir: string | undefined; rules: Map<string, Violation[]> }>;\n\nfunction fileLinterNodes(trie: Trie<FileLinters>, linterMeta: Map<string, LinterResult>): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileLinterNodes(folder, linterMeta));\n    return { ...node, file: folder.path, target_path: folder.rawPath, work_dir: uniqueWorkDir(node.children!) };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const linters = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const linterDrafts = sortedKeys(linters).map((linterName) => {\n      const { workDir, rules } = linters.get(linterName)!;\n      const ruleLeaves = sortedKeys(rules).map((rule) => {\n        const violations = rules.get(rule)!;\n        return {\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: fullPath,\n            rawFile: violations[0]?.raw_file ?? fullPath,\n            linterName,\n            violations,\n            workDir,\n          }),\n          ruleName: rule,\n        };\n      });\n      return {\n        ...linterNode(linterName, linterMeta.get(linterName), ruleLeaves),\n        file: fullPath,\n        target_path: ruleLeaves[0]?.target_path,\n        work_dir: workDir,\n      };\n    });\n    return {\n      ...container(key, \"lint-file\", linterDrafts),\n      file: fullPath,\n      target_path: linterDrafts[0]?.target_path,\n      work_dir: uniqueWorkDir(linterDrafts),\n    };\n  });\n  return [...folders, ...files];\n}\n\n// ---------------------------------------------------------------------------\n// Groupings\n\nfunction fileTrieFor(flat: readonly FlatViolation[]): Trie<FileBucket> {\n  const trie = newTrie<FileBucket>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    trieLeaf(trie, f.file, f.rawFile ?? f.file, () => ({\n      rawFile: f.rawFile ?? f.file!,\n      workDir: f.workDir,\n      violations: [],\n    })).violations.push(f.v);\n  }\n  return trie;\n}\n\nfunction groupByLinterRuleFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(byLinter.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const ruleNodes = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => {\n          const flats = byRule.get(rule)!;\n          const children = fileNodes(fileTrieFor(flats), linterName, rule);\n          const node = container(rule, \"lint-rule-group\", children);\n          return withNoFileViolations(\n            {\n              ...node,\n              linterName,\n              ruleName: rule,\n              work_dir: uniqueWorkDir(children) ?? meta.get(linterName)?.work_dir,\n            },\n            flats.filter((f) => !f.file).map((f) => f.v),\n          );\n        });\n      return linterNode(linterName, meta.get(linterName), ruleNodes);\n    });\n}\n\nfunction groupByLinterFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const flats = byLinter.get(linterName)!;\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        fileNodes(fileTrieFor(flats), linterName),\n        flats.filter((f) => !f.file).map((f) => f.v),\n      );\n    });\n}\n\nfunction groupByFileLinterRule(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flat = flattenLint(results, filters);\n  const trie = newTrie<FileLinters>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    const linters = trieLeaf(trie, f.file, f.rawFile ?? f.file, () => new Map());\n    let entry = linters.get(f.linter);\n    if (!entry) {\n      entry = { workDir: f.workDir, rules: new Map() };\n      linters.set(f.linter, entry);\n    }\n    const rule = ruleKeyFor(f.v);\n    entry.rules.set(rule, [...(entry.rules.get(rule) ?? []), f.v]);\n  }\n\n  const fileless = groupBy(flat.filter((f) => !f.file), (f) => f.linter);\n  const filelessNodes = Array.from(fileless.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(fileless.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const workDir = meta.get(linterName)?.work_dir;\n      const leaves = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => ({\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: \"\",\n            rawFile: \"\",\n            linterName,\n            violations: byRule.get(rule)!.map((f) => f.v),\n            workDir,\n          }),\n          ruleName: rule,\n          file: undefined,\n          target_path: undefined,\n        }));\n      return linterNode(linterName, meta.get(linterName), leaves);\n    });\n\n  return [...fileLinterNodes(trie, meta), ...filelessNodes];\n}\n\nfunction summaryFileLabel(file: string | undefined, violations: readonly Violation[]): string {\n  if (!file) return \"(no file)\";\n  if (violations.length > 1) return `${file} (${violations.length})`;\n  const v = violations[0];\n  if (v?.line) return v.column ? `${file}:${v.line}:${v.column}` : `${file}:${v.line}`;\n  return file;\n}\n\nfunction summaryRuleNode(rule: string, linterName: string, flats: readonly FlatViolation[]): Draft {\n  const byFile = groupBy(flats, (f) => f.file ?? \"\");\n  const keys = Array.from(byFile.keys());\n  const files: Draft[] = keys.slice(0, SUMMARY_FILE_LIMIT).map((key) => {\n    const group = byFile.get(key)!;\n    return {\n      ...violationLeaf({\n        name: summaryFileLabel(group[0]!.file, group.map((f) => f.v)),\n        kind: \"lint-file\",\n        file: group[0]!.file ?? \"\",\n        rawFile: group[0]!.rawFile ?? \"\",\n        linterName,\n        violations: group.map((f) => f.v),\n        workDir: group[0]!.workDir,\n      }),\n      file: group[0]!.file,\n      target_path: group[0]!.rawFile,\n      ruleName: rule,\n    };\n  });\n  const remaining = keys.length - files.length;\n  if (remaining > 0) {\n    files.push({\n      name: `… ${remaining} more file${remaining === 1 ? \"\" : \"s\"}`,\n      kind: \"lint-file\",\n      linterName,\n      ruleName: rule,\n      failed: false,\n      passed: true,\n      skipped: false,\n    });\n  }\n  const firstMessage = flats.find((f) => f.v.message)?.v.message;\n  const name = firstMessage ? `${rule} (${flats.length}) — ${firstMessage}` : `${rule} (${flats.length})`;\n  return { ...container(name, \"lint-rule-group\", files), linterName, ruleName: rule };\n}\n\nfunction groupBySummary(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flatByLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const skipped = new Map(visible.filter((r) => r.skipped).map((r) => [r.linter, r.error || \"skipped\"]));\n  // Like the CLI --summary: every linter that ran is listed, even a clean one.\n  return Array.from(new Set(visible.map((r) => r.linter)))\n    .sort()\n    .map((linterName) => {\n      const flats = flatByLinter.get(linterName) ?? [];\n      if (flats.length === 0 && skipped.has(linterName)) {\n        return {\n          name: linterName,\n          kind: \"linter\" as const,\n          linter: meta.get(linterName),\n          linterName,\n          skipped: true,\n          passed: false,\n          failed: false,\n          message: `skipped: ${skipped.get(linterName)}`,\n        };\n      }\n      const byRule = groupBy(flats, (f) => ruleKeyFor(f.v));\n      const ruleOrder = Array.from(byRule.keys()).sort(\n        (a, b) => byRule.get(b)!.length - byRule.get(a)!.length || a.localeCompare(b),\n      );\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        ruleOrder.map((rule) => summaryRuleNode(rule, linterName, byRule.get(rule)!)),\n      );\n    });\n}\n\n/** Linters that failed to run get an error leaf in every grouping, merged into an existing linter node. */\nfunction withLinterErrors(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const errors = groupBy(\n    results.filter((r) => isLinterErrored(r) && matchesFilterState(r.linter, filters.linter)),\n    (r) => r.linter,\n  );\n  if (errors.size === 0) return roots;\n  const linters = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  for (const [name, failed] of errors) {\n    const errorNodes = failed.map(linterErrorNode);\n    const existing = linters.get(name);\n    linters.set(\n      name,\n      existing\n        ? { ...existing, children: [...errorNodes, ...(existing.children ?? [])], failed: true, passed: false }\n        : linterNode(name, failed[0], errorNodes),\n    );\n  }\n  const others = roots.filter((n) => n.kind !== \"linter\");\n  return [...others, ...sortedKeys(linters).map((name) => linters.get(name)!)];\n}\n\n// ---------------------------------------------------------------------------\n// Collapsing, route paths, lookup\n\nfunction joinChainNames(parent: string, child: string): string {\n  const p = parent.trim();\n  const c = child.trim();\n  return p && c ? `${p} > ${c}` : p || c;\n}\n\n/** Folds a folder that has a single child into that child: `pkg > sub > a.go`. */\nfunction collapseFolderChains(nodes: Draft[]): Draft[] {\n  return nodes.map((node) => {\n    if (!node.children || node.children.length === 0) return node;\n    const children = collapseFolderChains(node.children);\n    if (children.length === 1 && node.kind === \"lint-folder\") {\n      const [child] = children;\n      return { ...child!, name: joinChainNames(node.name, child!.name) };\n    }\n    return { ...node, children };\n  });\n}\n\n/** Stable, unique route path per node: slug segments joined by `/`, siblings with equal slugs get `~N`. */\nfunction annotateRoutePaths(nodes: Draft[], parentSegments: string[] = []): LintNode[] {\n  const slugs = nodes.map((n) => slugify(n.name));\n  const totals = groupBy(slugs, (s) => s);\n  const seen = new Map<string, number>();\n  return nodes.map((node, i) => {\n    const slug = slugs[i]!;\n    const ordinal = (seen.get(slug) ?? 0) + 1;\n    seen.set(slug, ordinal);\n    const segment = totals.get(slug)!.length > 1 ? `${slug}~${ordinal}` : slug;\n    const segments = [...parentSegments, segment];\n    const { children, ...rest } = node;\n    return {\n      ...rest,\n      route_path: segments.join(\"/\"),\n      ...(children ? { children: annotateRoutePaths(children, segments) } : {}),\n    };\n  });\n}\n\nconst GROUPERS: Record<LintGrouping, (results: readonly LinterResult[], filters: LintFilters) => Draft[]> = {\n  \"linter-rule-file\": groupByLinterRuleFile,\n  \"linter-file\": groupByLinterFile,\n  \"file-linter-rule\": groupByFileLinterRule,\n  summary: groupBySummary,\n};\n\n/** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */\nexport function buildLintTree({\n  results,\n  grouping,\n  filters,\n}: {\n  results: readonly LinterResult[];\n  grouping: LintGrouping;\n  filters: LintFilters;\n}): LintNode[] {\n  const grouped = withLinterErrors(GROUPERS[grouping](results, filters), results, filters);\n  // Summary keeps its linter -> rule -> file branches as built.\n  return annotateRoutePaths(grouping === \"summary\" ? grouped : collapseFolderChains(grouped));\n}\n\n/** Depth-first lookup of the node whose route_path equals `path`, or null. */\nexport function findLintNode(nodes: readonly LintNode[], path: string): LintNode | null {\n  if (!path) return null;\n  for (const node of nodes) {\n    if (node.route_path === path) return node;\n    const found = node.children ? findLintNode(node.children, path) : null;\n    if (found) return found;\n  }\n  return null;\n}\n"],"mappings":";;;;;AA2CA,IAAM,UAAU;AAChB,IAAM,qBAAqB;AAE3B,SAAS,WAAW,GAAsB;CACxC,OAAO,EAAE,MAAM,UAAU;AAC3B;AAEA,SAAS,OAAO,YAA+C;CAC7D,OAAO,WAAW,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ,EAAE;AACxE;AAEA,SAAS,UAAU,GAAmB;CACpC,MAAM,MAAM,EAAE,QAAQ,IAAI;CAC1B,OAAO,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AACxC;AAEA,SAAS,QAAc,OAAqB,KAAkC;CAC5E,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC;EAC9B,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;CAChC;CACA,OAAO;AACT;AAEA,SAAS,WAAc,KAA+B;CACpD,OAAO,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK;AACrC;AAKA,SAAS,YAAY,SAAkC,SAAuC;CAC5F,MAAM,UAAU,QAAQ,QAAQ,MAAM,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,YAAY,IAAI,IAAI,QAAQ,SAAS,MAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO;CAC9G,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,KAAK,OAAO,cAAc,CAAC,GAAG;EACvC,IAAI,CAAC,mBAAmB,WAAW,CAAC,GAAG,QAAQ,QAAQ,GAAG;EAC1D,MAAM,UAAU,QAAQ,EAAE,MAAM,OAAO,QAAQ;EAC/C,MAAM,OAAO,iBAAiB,SAAS,OAAO,UAAU,SAAS;EACjE,IAAI,KAAK;GACP,QAAQ,OAAO;GACf;GACA,GAAG;IAAE,GAAG;IAAG,UAAU;IAAS;GAAK;GACnC;GACA;GACA,SAAS,OAAO;EAClB,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6D;CACjF,MAAM,uBAAO,IAAI,IAA0B;CAC3C,KAAK,MAAM,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,EAAE,MAAM,GAAG,KAAK,IAAI,EAAE,QAAQ,CAAC;CACtE,OAAO;AACT;AAKA,SAAS,UAAsB;CAC7B,OAAO;EAAE,MAAM;EAAI,MAAM,KAAA;EAAW,SAAS;EAAI,yBAAS,IAAI,IAAI;EAAG,wBAAQ,IAAI,IAAI;CAAE;AACzF;;AAGA,SAAS,SAAY,MAAe,MAAc,SAAiB,QAAoB;CACrF,MAAM,WAAW,sBAAsB,IAAI;CAC3C,MAAM,cAAc,sBAAsB,OAAO;CACjD,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAClD,MAAM,IAAI,MAAM,kDAAkD,KAAK,UAAU,IAAI,EAAE,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE;CAE3H,MAAM,iBAAiB,SAAS,MAAM,GAAG,EAAE;CAC3C,MAAM,oBAAoB,YAAY,MAAM,GAAG,EAAE;CAGjD,MAAM,YAAY,eAAe,SAAS,kBAAkB;CAC5D,IAAI,UAAU;CACd,eAAe,SAAS,SAAS,MAAM;EACrC,IAAI,QAAQ,QAAQ,QAAQ,IAAI,OAAO;EACvC,IAAI,CAAC,OAAO;GACV,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,kBAAkB,QAAQ,IAAI,IAAI,SAAS,CAAC;GAClF,QAAQ;IACN,MAAM;IACN,MAAM,QAAQ,OAAO,GAAG,QAAQ,KAAK,GAAG,YAAY;IACpD,SAAS,kBAAkB,MAAM,GAAG,QAAQ,CAAC,CAAC,KAAK,GAAG;IACtD,yBAAS,IAAI,IAAI;IACjB,wBAAQ,IAAI,IAAI;GAClB;GACA,QAAQ,QAAQ,IAAI,SAAS,KAAK;EACpC;EACA,UAAU;CACZ,CAAC;CACD,MAAM,WAAW,SAAS,SAAS,SAAS;CAC5C,IAAI,OAAO,QAAQ,OAAO,IAAI,QAAQ;CACtC,IAAI,CAAC,MAAM;EACT,OAAO,OAAO;EACd,QAAQ,OAAO,IAAI,UAAU,IAAI;CACnC;CACA,OAAO;AACT;AAKA,SAAS,UAAU,MAAc,MAAqB,UAA0B;CAC9E,MAAM,SAAS,SAAS,MAAM,MAAM,EAAE,MAAM;CAC5C,OAAO;EAAE;EAAM;EAAM;EAAU;EAAQ,QAAQ,CAAC;EAAQ,SAAS;CAAM;AACzE;AAEA,SAAS,cAAc,UAAgD;CACrE,MAAM,OAAO,IAAI,IAAI,SAAS,SAAS,MAAO,EAAE,WAAW,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAE,CAAC;CAC9E,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,KAAA;AACjD;AAEA,SAAS,qBAAqB,MAAa,QAAqC;CAC9E,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,KAAK,UAAU,cAAc,MAAM,MAAM;CACxD,OAAO;EAAE,GAAG;EAAM,kBAAkB,OAAO,MAAM;EAAG;EAAQ,QAAQ,CAAC;CAAO;AAC9E;AAEA,SAAS,cAAc,MAQb;CACR,MAAM,SAAS,cAAc,KAAK,UAAU,MAAM;CAClD,OAAO;EACL,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,YAAY,KAAK;EACjB,YAAY,OAAO,KAAK,UAAU;EAClC;EACA,QAAQ,CAAC;EACT,SAAS;CACX;AACF;AAEA,SAAS,WACP,YACA,QACA,UACA,SAA+B,CAAC,GACzB;CACP,OAAO,qBAAqB;EAAE,GAAG,UAAU,YAAY,UAAU,QAAQ;EAAG,QAAQ;EAAQ;CAAW,GAAG,MAAM;AAClH;AAEA,SAAS,gBAAgB,QAA6B;CACpD,MAAM,UAAU,mBAAmB,MAAM;CACzC,OAAO;EACL,MAAM,UAAU,OAAO;EACvB,MAAM;EACN,YAAY,OAAO;EACnB,QAAQ;EACR,UAAU,OAAO;EACjB,QAAQ;EACR,QAAQ;EACR,SAAS;EACT;CACF;AACF;AAEA,SAAS,UAAU,MAAwB,YAAoB,UAA4B;CACzF,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,UAAU,QAAQ,YAAY,QAAQ,CAAC;EAC1F,OAAO;GACL,GAAG;GACH,MAAM,OAAO;GACb,aAAa,OAAO;GACpB;GACA,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAC/B,UAAU,cAAc,KAAK,QAAS;EACxC;CACF,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,SAAS,KAAK,OAAO,IAAI,GAAG;EAElC,MAAM,OAAO,cAAc;GACzB,MAAM;GACN,MAAM;GACN,MAJe,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;GAKnD,SAAS,OAAO;GAChB;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;EAClB,CAAC;EACD,OAAO,WAAW;GAAE,GAAG;GAAM;EAAS,IAAI;CAC5C,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAIA,SAAS,gBAAgB,MAAyB,YAAgD;CAChG,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,gBAAgB,QAAQ,UAAU,CAAC;EACtF,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO;GAAM,aAAa,OAAO;GAAS,UAAU,cAAc,KAAK,QAAS;EAAE;CAC5G,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,UAAU,KAAK,OAAO,IAAI,GAAG;EACnC,MAAM,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;EACrD,MAAM,eAAe,WAAW,OAAO,CAAC,CAAC,KAAK,eAAe;GAC3D,MAAM,EAAE,SAAS,UAAU,QAAQ,IAAI,UAAU;GACjD,MAAM,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,SAAS;IACjD,MAAM,aAAa,MAAM,IAAI,IAAI;IACjC,OAAO;KACL,GAAG,cAAc;MACf,MAAM;MACN,MAAM;MACN,MAAM;MACN,SAAS,WAAW,EAAE,EAAE,YAAY;MACpC;MACA;MACA;KACF,CAAC;KACD,UAAU;IACZ;GACF,CAAC;GACD,OAAO;IACL,GAAG,WAAW,YAAY,WAAW,IAAI,UAAU,GAAG,UAAU;IAChE,MAAM;IACN,aAAa,WAAW,EAAE,EAAE;IAC5B,UAAU;GACZ;EACF,CAAC;EACD,OAAO;GACL,GAAG,UAAU,KAAK,aAAa,YAAY;GAC3C,MAAM;GACN,aAAa,aAAa,EAAE,EAAE;GAC9B,UAAU,cAAc,YAAY;EACtC;CACF,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAKA,SAAS,YAAY,MAAkD;CACrE,MAAM,OAAO,QAAoB;CACjC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa;GACjD,SAAS,EAAE,WAAW,EAAE;GACxB,SAAS,EAAE;GACX,YAAY,CAAC;EACf,EAAE,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC;CACzB;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACxC,KAAK,CAAC,CACN,KAAK,SAAS;GACb,MAAM,QAAQ,OAAO,IAAI,IAAI;GAC7B,MAAM,WAAW,UAAU,YAAY,KAAK,GAAG,YAAY,IAAI;GAE/D,OAAO,qBACL;IACE,GAHS,UAAU,MAAM,mBAAmB,QAGzC;IACH;IACA,UAAU;IACV,UAAU,cAAc,QAAQ,KAAK,KAAK,IAAI,UAAU,CAAC,EAAE;GAC7D,GACA,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;EACF,CAAC;EACH,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,SAAS;CAC/D,CAAC;AACL;AAEA,SAAS,kBAAkB,SAAkC,SAA+B;CAC1F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,SAAS,IAAI,UAAU;EACrC,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,YAAY,KAAK,GAAG,UAAU,GACxC,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;CACF,CAAC;AACL;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,OAAO,YAAY,SAAS,OAAO;CACzC,MAAM,OAAO,QAAqB;CAClC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,MAAM,UAAU,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,4BAAY,IAAI,IAAI,CAAC;EAC3E,IAAI,QAAQ,QAAQ,IAAI,EAAE,MAAM;EAChC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,SAAS,EAAE;IAAS,uBAAO,IAAI,IAAI;GAAE;GAC/C,QAAQ,IAAI,EAAE,QAAQ,KAAK;EAC7B;EACA,MAAM,OAAO,WAAW,EAAE,CAAC;EAC3B,MAAM,MAAM,IAAI,MAAM,CAAC,GAAI,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC,CAAC;CAC/D;CAEA,MAAM,WAAW,QAAQ,KAAK,QAAQ,MAAM,CAAC,EAAE,IAAI,IAAI,MAAM,EAAE,MAAM;CACrE,MAAM,gBAAgB,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC9C,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,UAAU,KAAK,IAAI,UAAU,CAAC,EAAE;EACtC,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,UAAU;GACd,GAAG,cAAc;IACf,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT;IACA,YAAY,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,EAAE,CAAC;IAC5C;GACF,CAAC;GACD,UAAU;GACV,MAAM,KAAA;GACN,aAAa,KAAA;EACf,EAAE;EACJ,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,MAAM;CAC5D,CAAC;CAEH,OAAO,CAAC,GAAG,gBAAgB,MAAM,IAAI,GAAG,GAAG,aAAa;AAC1D;AAEA,SAAS,iBAAiB,MAA0B,YAA0C;CAC5F,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,WAAW,SAAS,GAAG,OAAO,GAAG,KAAK,IAAI,WAAW,OAAO;CAChE,MAAM,IAAI,WAAW;CACrB,IAAI,GAAG,MAAM,OAAO,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,WAAW,GAAG,KAAK,GAAG,EAAE;CAC9E,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,YAAoB,OAAwC;CACjG,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,QAAQ,EAAE;CACjD,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,CAAC;CACrC,MAAM,QAAiB,KAAK,MAAM,GAAG,kBAAkB,CAAC,CAAC,KAAK,QAAQ;EACpE,MAAM,QAAQ,OAAO,IAAI,GAAG;EAC5B,OAAO;GACL,GAAG,cAAc;IACf,MAAM,iBAAiB,MAAM,EAAE,CAAE,MAAM,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;IAC5D,MAAM;IACN,MAAM,MAAM,EAAE,CAAE,QAAQ;IACxB,SAAS,MAAM,EAAE,CAAE,WAAW;IAC9B;IACA,YAAY,MAAM,KAAK,MAAM,EAAE,CAAC;IAChC,SAAS,MAAM,EAAE,CAAE;GACrB,CAAC;GACD,MAAM,MAAM,EAAE,CAAE;GAChB,aAAa,MAAM,EAAE,CAAE;GACvB,UAAU;EACZ;CACF,CAAC;CACD,MAAM,YAAY,KAAK,SAAS,MAAM;CACtC,IAAI,YAAY,GACd,MAAM,KAAK;EACT,MAAM,KAAK,UAAU,YAAY,cAAc,IAAI,KAAK;EACxD,MAAM;EACN;EACA,UAAU;EACV,QAAQ;EACR,QAAQ;EACR,SAAS;CACX,CAAC;CAEH,MAAM,eAAe,MAAM,MAAM,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE;CAEvD,OAAO;EAAE,GAAG,UADC,eAAe,GAAG,KAAK,IAAI,MAAM,OAAO,MAAM,iBAAiB,GAAG,KAAK,IAAI,MAAM,OAAO,IACzE,mBAAmB,KAAK;EAAG;EAAY,UAAU;CAAK;AACpF;AAEA,SAAS,eAAe,SAAkC,SAA+B;CACvF,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,eAAe,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CAC3E,MAAM,UAAU,QAAQ,QAAQ,MAAM,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,UAAU,IAAI,IAAI,QAAQ,QAAQ,MAAM,EAAE,OAAO,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,QAAQ,EAAE,SAAS,SAAS,CAAC,CAAC;CAErG,OAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CACrD,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,aAAa,IAAI,UAAU,KAAK,CAAC;EAC/C,IAAI,MAAM,WAAW,KAAK,QAAQ,IAAI,UAAU,GAC9C,OAAO;GACL,MAAM;GACN,MAAM;GACN,QAAQ,KAAK,IAAI,UAAU;GAC3B;GACA,SAAS;GACT,QAAQ;GACR,QAAQ;GACR,SAAS,YAAY,QAAQ,IAAI,UAAU;EAC7C;EAEF,MAAM,SAAS,QAAQ,QAAQ,MAAM,WAAW,EAAE,CAAC,CAAC;EACpD,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,MACzC,GAAG,MAAM,OAAO,IAAI,CAAC,CAAC,CAAE,SAAS,OAAO,IAAI,CAAC,CAAC,CAAE,UAAU,EAAE,cAAc,CAAC,CAC9E;EACA,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,KAAK,SAAS,gBAAgB,MAAM,YAAY,OAAO,IAAI,IAAI,CAAE,CAAC,CAC9E;CACF,CAAC;AACL;;AAGA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CACzG,MAAM,SAAS,QACb,QAAQ,QAAQ,MAAM,gBAAgB,CAAC,KAAK,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC,IACvF,MAAM,EAAE,MACX;CACA,IAAI,OAAO,SAAS,GAAG,OAAO;CAC9B,MAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACxF,KAAK,MAAM,CAAC,MAAM,WAAW,QAAQ;EACnC,MAAM,aAAa,OAAO,IAAI,eAAe;EAC7C,MAAM,WAAW,QAAQ,IAAI,IAAI;EACjC,QAAQ,IACN,MACA,WACI;GAAE,GAAG;GAAU,UAAU,CAAC,GAAG,YAAY,GAAI,SAAS,YAAY,CAAC,CAAE;GAAG,QAAQ;GAAM,QAAQ;EAAM,IACpG,WAAW,MAAM,OAAO,IAAI,UAAU,CAC5C;CACF;CAEA,OAAO,CAAC,GADO,MAAM,QAAQ,MAAM,EAAE,SAAS,QACnC,GAAQ,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,SAAS,QAAQ,IAAI,IAAI,CAAE,CAAC;AAC7E;AAKA,SAAS,eAAe,QAAgB,OAAuB;CAC7D,MAAM,IAAI,OAAO,KAAK;CACtB,MAAM,IAAI,MAAM,KAAK;CACrB,OAAO,KAAK,IAAI,GAAG,EAAE,KAAK,MAAM,KAAK;AACvC;;AAGA,SAAS,qBAAqB,OAAyB;CACrD,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,GAAG,OAAO;EACzD,MAAM,WAAW,qBAAqB,KAAK,QAAQ;EACnD,IAAI,SAAS,WAAW,KAAK,KAAK,SAAS,eAAe;GACxD,MAAM,CAAC,SAAS;GAChB,OAAO;IAAE,GAAG;IAAQ,MAAM,eAAe,KAAK,MAAM,MAAO,IAAI;GAAE;EACnE;EACA,OAAO;GAAE,GAAG;GAAM;EAAS;CAC7B,CAAC;AACH;;AAGA,SAAS,mBAAmB,OAAgB,iBAA2B,CAAC,GAAe;CACrF,MAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ,EAAE,IAAI,CAAC;CAC9C,MAAM,SAAS,QAAQ,QAAQ,MAAM,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAoB;CACrC,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,MAAM,OAAO,MAAM;EACnB,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK;EACxC,KAAK,IAAI,MAAM,OAAO;EACtB,MAAM,UAAU,OAAO,IAAI,IAAI,CAAC,CAAE,SAAS,IAAI,GAAG,KAAK,GAAG,YAAY;EACtE,MAAM,WAAW,CAAC,GAAG,gBAAgB,OAAO;EAC5C,MAAM,EAAE,UAAU,GAAG,SAAS;EAC9B,OAAO;GACL,GAAG;GACH,YAAY,SAAS,KAAK,GAAG;GAC7B,GAAI,WAAW,EAAE,UAAU,mBAAmB,UAAU,QAAQ,EAAE,IAAI,CAAC;EACzE;CACF,CAAC;AACH;AAEA,IAAM,WAAsG;CAC1G,oBAAoB;CACpB,eAAe;CACf,oBAAoB;CACpB,SAAS;AACX;;AAGA,SAAgB,cAAc,EAC5B,SACA,UACA,WAKa;CACb,MAAM,UAAU,iBAAiB,SAAS,SAAS,CAAC,SAAS,OAAO,GAAG,SAAS,OAAO;CAEvF,OAAO,mBAAmB,aAAa,YAAY,UAAU,qBAAqB,OAAO,CAAC;AAC5F;;AAGA,SAAgB,aAAa,OAA4B,MAA+B;CACtF,IAAI,CAAC,MAAM,OAAO;CAClB,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,eAAe,MAAM,OAAO;EACrC,MAAM,QAAQ,KAAK,WAAW,aAAa,KAAK,UAAU,IAAI,IAAI;EAClE,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT"}
+{"version":3,"file":"grouping.js","names":[],"sources":["../../../src/data/lint/grouping.ts"],"sourcesContent":["// Turns raw linter results into the selectable tree for each grouping. Ported\n// from gavel's testrunner/ui utils.ts. Differences from the original:\n//   - a linter that failed to run is shown under every grouping (gavel only\n//     showed it in `summary`), so a broken linter never reads as a clean run;\n//   - single-child folder chains are really collapsed (\"pkg/sub/a.go\");\n//     gavel's collapser never fired because folder nodes always carry a\n//     passed/failed flag;\n//   - file-scoped rule leaves in `file-linter-rule` carry their work_dir, so\n//     ignore actions on them are not sent without one.\n\nimport { matchesFilterState } from \"../test-runner/filterState\";\nimport { slugify } from \"../test-runner/routePath\";\nimport { collapsedPathSegments, decorateLintFile, normalizeLintPath, relPath } from \"./paths\";\nimport {\n  isLinterErrored,\n  isLinterInFlight,\n  linterErrorMessage,\n  lintNodeCount,\n  severityOf,\n  worstSeverity,\n} from \"./stats\";\nimport type {\n  LintFilters,\n  LintGrouping,\n  LintNode,\n  LinterResult,\n  Violation,\n} from \"./types\";\n\ntype Draft = Omit<LintNode, \"route_path\" | \"children\"> & { children?: Draft[] };\n\n/** A violation with its linter and paths resolved, as every view lists it. */\nexport type FlatViolation = {\n  linter: string;\n  result: LinterResult;\n  v: Violation;\n  file: string | undefined;\n  rawFile: string | undefined;\n  workDir: string | undefined;\n};\n\ntype FileBucket = { rawFile: string; workDir: string | undefined; violations: Violation[] };\n\ntype Trie<L> = {\n  name: string;\n  path: string | undefined;\n  rawPath: string;\n  folders: Map<string, Trie<L>>;\n  leaves: Map<string, L>;\n};\n\nconst NO_RULE = \"(no rule)\";\nconst SUMMARY_FILE_LIMIT = 5;\n\nfunction ruleKeyFor(v: Violation): string {\n  return v.rule?.method || NO_RULE;\n}\n\nfunction byLine(violations: readonly Violation[]): Violation[] {\n  return violations.slice().sort((a, b) => (a.line ?? 0) - (b.line ?? 0));\n}\n\nfunction firstLine(s: string): string {\n  const idx = s.indexOf(\"\\n\");\n  return idx === -1 ? s : s.slice(0, idx);\n}\n\nfunction groupBy<T, K>(items: readonly T[], key: (item: T) => K): Map<K, T[]> {\n  const out = new Map<K, T[]>();\n  for (const item of items) {\n    const list = out.get(key(item));\n    if (list) list.push(item);\n    else out.set(key(item), [item]);\n  }\n  return out;\n}\n\nfunction sortedKeys<V>(map: Map<string, V>): string[] {\n  return Array.from(map.keys()).sort();\n}\n\n// ---------------------------------------------------------------------------\n// Flattening\n\n/** Every violation the filters keep, with work-dir-relative and display paths. */\nexport function flattenLint(results: readonly LinterResult[], filters: LintFilters): FlatViolation[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const multiRoot = new Set(visible.flatMap((r) => (r.work_dir ? [normalizeLintPath(r.work_dir)] : []))).size > 1;\n  const out: FlatViolation[] = [];\n  for (const result of visible) {\n    for (const v of result.violations ?? []) {\n      if (!matchesFilterState(severityOf(v), filters.severity)) continue;\n      const rawFile = relPath(v.file, result.work_dir);\n      const file = decorateLintFile(rawFile, result.work_dir, multiRoot);\n      out.push({\n        linter: result.linter,\n        result,\n        v: { ...v, raw_file: rawFile, file },\n        file,\n        rawFile,\n        workDir: result.work_dir,\n      });\n    }\n  }\n  return out;\n}\n\nfunction linterMetaOf(results: readonly LinterResult[]): Map<string, LinterResult> {\n  const meta = new Map<string, LinterResult>();\n  for (const r of results) if (!meta.has(r.linter)) meta.set(r.linter, r);\n  return meta;\n}\n\n// ---------------------------------------------------------------------------\n// Path trie\n\nfunction newTrie<L>(): Trie<L> {\n  return { name: \"\", path: undefined, rawPath: \"\", folders: new Map(), leaves: new Map() };\n}\n\n/** The leaf for `file`, created through `create` on first sight; folders are made on the way. */\nfunction trieLeaf<L>(root: Trie<L>, file: string, rawFile: string, create: () => L): L {\n  const segments = collapsedPathSegments(file);\n  const rawSegments = collapsedPathSegments(rawFile);\n  if (segments.length === 0 || rawSegments.length === 0) {\n    throw new Error(`lint: cannot place violation, empty path (file=${JSON.stringify(file)}, raw=${JSON.stringify(rawFile)})`);\n  }\n  const folderSegments = segments.slice(0, -1);\n  const rawFolderSegments = rawSegments.slice(0, -1);\n  // The decorated path may carry extra leading segments (the work dir label)\n  // that the raw, work_dir-relative path does not.\n  const rawOffset = folderSegments.length - rawFolderSegments.length;\n  let current = root;\n  folderSegments.forEach((segment, i) => {\n    let child = current.folders.get(segment);\n    if (!child) {\n      const rawCount = Math.max(0, Math.min(rawFolderSegments.length, i + 1 - rawOffset));\n      child = {\n        name: segment,\n        path: current.path ? `${current.path}/${segment}` : segment,\n        rawPath: rawFolderSegments.slice(0, rawCount).join(\"/\"),\n        folders: new Map(),\n        leaves: new Map(),\n      };\n      current.folders.set(segment, child);\n    }\n    current = child;\n  });\n  const basename = segments[segments.length - 1]!;\n  let leaf = current.leaves.get(basename);\n  if (!leaf) {\n    leaf = create();\n    current.leaves.set(basename, leaf);\n  }\n  return leaf;\n}\n\n// ---------------------------------------------------------------------------\n// Node builders\n\nfunction container(name: string, kind: Draft[\"kind\"], children: Draft[]): Draft {\n  const failed = children.some((c) => c.failed);\n  return { name, kind, children, failed, passed: !failed, skipped: false };\n}\n\nfunction uniqueWorkDir(children: readonly Draft[]): string | undefined {\n  const dirs = new Set(children.flatMap((c) => (c.work_dir ? [c.work_dir] : [])));\n  return dirs.size === 1 ? Array.from(dirs)[0] : undefined;\n}\n\nfunction withNoFileViolations(node: Draft, noFile: readonly Violation[]): Draft {\n  if (noFile.length === 0) return node;\n  const failed = node.failed || worstSeverity(noFile) !== \"info\";\n  return { ...node, noFileViolations: byLine(noFile), failed, passed: !failed };\n}\n\nfunction violationLeaf(args: {\n  name: string;\n  kind: \"lint-file\" | \"lint-rule\";\n  file: string;\n  rawFile: string;\n  linterName: string;\n  violations: readonly Violation[];\n  workDir: string | undefined;\n}): Draft {\n  const failed = worstSeverity(args.violations) !== \"info\";\n  return {\n    name: args.name,\n    kind: args.kind,\n    file: args.file,\n    target_path: args.rawFile,\n    work_dir: args.workDir,\n    linterName: args.linterName,\n    violations: byLine(args.violations),\n    failed,\n    passed: !failed,\n    skipped: false,\n  };\n}\n\nfunction linterNode(\n  linterName: string,\n  result: LinterResult | undefined,\n  children: Draft[],\n  noFile: readonly Violation[] = [],\n): Draft {\n  return withNoFileViolations({ ...container(linterName, \"linter\", children), linter: result, linterName }, noFile);\n}\n\nfunction linterErrorNode(result: LinterResult): Draft {\n  const message = linterErrorMessage(result);\n  return {\n    name: firstLine(message),\n    kind: \"linter-error\",\n    linterName: result.linter,\n    linter: result,\n    work_dir: result.work_dir,\n    failed: true,\n    passed: false,\n    skipped: false,\n    message,\n  };\n}\n\nfunction fileNodes(trie: Trie<FileBucket>, linterName: string, ruleName?: string): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileNodes(folder, linterName, ruleName));\n    return {\n      ...node,\n      file: folder.path,\n      target_path: folder.rawPath,\n      linterName,\n      ...(ruleName ? { ruleName } : {}),\n      work_dir: uniqueWorkDir(node.children!),\n    };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const bucket = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const leaf = violationLeaf({\n      name: key,\n      kind: \"lint-file\",\n      file: fullPath,\n      rawFile: bucket.rawFile,\n      linterName,\n      violations: bucket.violations,\n      workDir: bucket.workDir,\n    });\n    return ruleName ? { ...leaf, ruleName } : leaf;\n  });\n  return [...folders, ...files];\n}\n\ntype FileLinters = Map<string, { workDir: string | undefined; rules: Map<string, Violation[]> }>;\n\nfunction fileLinterNodes(trie: Trie<FileLinters>, linterMeta: Map<string, LinterResult>): Draft[] {\n  const folders = sortedKeys(trie.folders).map((key) => {\n    const folder = trie.folders.get(key)!;\n    const node = container(folder.name, \"lint-folder\", fileLinterNodes(folder, linterMeta));\n    return { ...node, file: folder.path, target_path: folder.rawPath, work_dir: uniqueWorkDir(node.children!) };\n  });\n  const files = sortedKeys(trie.leaves).map((key) => {\n    const linters = trie.leaves.get(key)!;\n    const fullPath = trie.path ? `${trie.path}/${key}` : key;\n    const linterDrafts = sortedKeys(linters).map((linterName) => {\n      const { workDir, rules } = linters.get(linterName)!;\n      const ruleLeaves = sortedKeys(rules).map((rule) => {\n        const violations = rules.get(rule)!;\n        return {\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: fullPath,\n            rawFile: violations[0]?.raw_file ?? fullPath,\n            linterName,\n            violations,\n            workDir,\n          }),\n          ruleName: rule,\n        };\n      });\n      return {\n        ...linterNode(linterName, linterMeta.get(linterName), ruleLeaves),\n        file: fullPath,\n        target_path: ruleLeaves[0]?.target_path,\n        work_dir: workDir,\n      };\n    });\n    return {\n      ...container(key, \"lint-file\", linterDrafts),\n      file: fullPath,\n      target_path: linterDrafts[0]?.target_path,\n      work_dir: uniqueWorkDir(linterDrafts),\n    };\n  });\n  return [...folders, ...files];\n}\n\n// ---------------------------------------------------------------------------\n// Groupings\n\nfunction fileTrieFor(flat: readonly FlatViolation[]): Trie<FileBucket> {\n  const trie = newTrie<FileBucket>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    trieLeaf(trie, f.file, f.rawFile ?? f.file, () => ({\n      rawFile: f.rawFile ?? f.file!,\n      workDir: f.workDir,\n      violations: [],\n    })).violations.push(f.v);\n  }\n  return trie;\n}\n\nfunction groupByLinterRuleFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(byLinter.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const ruleNodes = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => {\n          const flats = byRule.get(rule)!;\n          const children = fileNodes(fileTrieFor(flats), linterName, rule);\n          const node = container(rule, \"lint-rule-group\", children);\n          return withNoFileViolations(\n            {\n              ...node,\n              linterName,\n              ruleName: rule,\n              work_dir: uniqueWorkDir(children) ?? meta.get(linterName)?.work_dir,\n            },\n            flats.filter((f) => !f.file).map((f) => f.v),\n          );\n        });\n      return linterNode(linterName, meta.get(linterName), ruleNodes);\n    });\n}\n\nfunction groupByLinterFile(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  return Array.from(byLinter.keys())\n    .sort()\n    .map((linterName) => {\n      const flats = byLinter.get(linterName)!;\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        fileNodes(fileTrieFor(flats), linterName),\n        flats.filter((f) => !f.file).map((f) => f.v),\n      );\n    });\n}\n\nfunction groupByFileLinterRule(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flat = flattenLint(results, filters);\n  const trie = newTrie<FileLinters>();\n  for (const f of flat) {\n    if (!f.file) continue;\n    const linters = trieLeaf(trie, f.file, f.rawFile ?? f.file, () => new Map());\n    let entry = linters.get(f.linter);\n    if (!entry) {\n      entry = { workDir: f.workDir, rules: new Map() };\n      linters.set(f.linter, entry);\n    }\n    const rule = ruleKeyFor(f.v);\n    entry.rules.set(rule, [...(entry.rules.get(rule) ?? []), f.v]);\n  }\n\n  const fileless = groupBy(flat.filter((f) => !f.file), (f) => f.linter);\n  const filelessNodes = Array.from(fileless.keys())\n    .sort()\n    .map((linterName) => {\n      const byRule = groupBy(fileless.get(linterName)!, (f) => ruleKeyFor(f.v));\n      const workDir = meta.get(linterName)?.work_dir;\n      const leaves = Array.from(byRule.keys())\n        .sort()\n        .map((rule) => ({\n          ...violationLeaf({\n            name: rule,\n            kind: \"lint-rule\",\n            file: \"\",\n            rawFile: \"\",\n            linterName,\n            violations: byRule.get(rule)!.map((f) => f.v),\n            workDir,\n          }),\n          ruleName: rule,\n          file: undefined,\n          target_path: undefined,\n        }));\n      return linterNode(linterName, meta.get(linterName), leaves);\n    });\n\n  return [...fileLinterNodes(trie, meta), ...filelessNodes];\n}\n\nfunction summaryFileLabel(file: string | undefined, violations: readonly Violation[]): string {\n  if (!file) return \"(no file)\";\n  if (violations.length > 1) return `${file} (${violations.length})`;\n  const v = violations[0];\n  if (v?.line) return v.column ? `${file}:${v.line}:${v.column}` : `${file}:${v.line}`;\n  return file;\n}\n\nfunction summaryRuleNode(rule: string, linterName: string, flats: readonly FlatViolation[]): Draft {\n  const byFile = groupBy(flats, (f) => f.file ?? \"\");\n  const keys = Array.from(byFile.keys());\n  const files: Draft[] = keys.slice(0, SUMMARY_FILE_LIMIT).map((key) => {\n    const group = byFile.get(key)!;\n    return {\n      ...violationLeaf({\n        name: summaryFileLabel(group[0]!.file, group.map((f) => f.v)),\n        kind: \"lint-file\",\n        file: group[0]!.file ?? \"\",\n        rawFile: group[0]!.rawFile ?? \"\",\n        linterName,\n        violations: group.map((f) => f.v),\n        workDir: group[0]!.workDir,\n      }),\n      file: group[0]!.file,\n      target_path: group[0]!.rawFile,\n      ruleName: rule,\n    };\n  });\n  const remaining = keys.length - files.length;\n  if (remaining > 0) {\n    files.push({\n      name: `… ${remaining} more file${remaining === 1 ? \"\" : \"s\"}`,\n      kind: \"lint-file\",\n      linterName,\n      ruleName: rule,\n      failed: false,\n      passed: true,\n      skipped: false,\n    });\n  }\n  const firstMessage = flats.find((f) => f.v.message)?.v.message;\n  const name = firstMessage ? `${rule} (${flats.length}) — ${firstMessage}` : `${rule} (${flats.length})`;\n  return { ...container(name, \"lint-rule-group\", files), linterName, ruleName: rule };\n}\n\nfunction groupBySummary(results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const meta = linterMetaOf(results);\n  const flatByLinter = groupBy(flattenLint(results, filters), (f) => f.linter);\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const skipped = new Map(visible.filter((r) => r.skipped).map((r) => [r.linter, r.error || \"skipped\"]));\n  // Like the CLI --summary: every linter that ran is listed, even a clean one.\n  return Array.from(new Set(visible.map((r) => r.linter)))\n    .sort()\n    .map((linterName) => {\n      const flats = flatByLinter.get(linterName) ?? [];\n      if (flats.length === 0 && skipped.has(linterName)) {\n        return {\n          name: linterName,\n          kind: \"linter\" as const,\n          linter: meta.get(linterName),\n          linterName,\n          skipped: true,\n          passed: false,\n          failed: false,\n          message: `skipped: ${skipped.get(linterName)}`,\n        };\n      }\n      const byRule = groupBy(flats, (f) => ruleKeyFor(f.v));\n      const ruleOrder = Array.from(byRule.keys()).sort(\n        (a, b) => byRule.get(b)!.length - byRule.get(a)!.length || a.localeCompare(b),\n      );\n      return linterNode(\n        linterName,\n        meta.get(linterName),\n        ruleOrder.map((rule) => summaryRuleNode(rule, linterName, byRule.get(rule)!)),\n      );\n    });\n}\n\n/** Linters that failed to run get an error leaf in every grouping, merged into an existing linter node. */\nfunction withLinterErrors(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const errors = groupBy(\n    results.filter((r) => isLinterErrored(r) && matchesFilterState(r.linter, filters.linter)),\n    (r) => r.linter,\n  );\n  if (errors.size === 0) return roots;\n  const linters = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  for (const [name, failed] of errors) {\n    const errorNodes = failed.map(linterErrorNode);\n    const existing = linters.get(name);\n    linters.set(\n      name,\n      existing\n        ? { ...existing, children: [...errorNodes, ...(existing.children ?? [])], failed: true, passed: false }\n        : linterNode(name, failed[0], errorNodes),\n    );\n  }\n  const others = roots.filter((n) => n.kind !== \"linter\");\n  return [...others, ...sortedKeys(linters).map((name) => linters.get(name)!)];\n}\n\nfunction linterNamesIn(nodes: readonly Draft[], into = new Set<string>()): Set<string> {\n  for (const node of nodes) {\n    if (node.kind === \"linter\" && node.linterName) into.add(node.linterName);\n    linterNamesIn(node.children ?? [], into);\n  }\n  return into;\n}\n\n/**\n * Linters still queued or running appear in every grouping even before they\n * report a violation, and have no verdict (`passed` stays false) until they finish.\n */\nfunction withInFlightLinters(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const present = linterNamesIn(roots);\n  const missing = new Map<string, LinterResult>();\n  for (const r of results) {\n    if (isLinterInFlight(r) && matchesFilterState(r.linter, filters.linter) && !present.has(r.linter)) {\n      missing.set(r.linter, r);\n    }\n  }\n  const markPending = (nodes: Draft[]): Draft[] =>\n    nodes.map((node) => {\n      const children = node.children ? markPending(node.children) : undefined;\n      const inFlight = node.kind === \"linter\" && node.linter !== undefined && isLinterInFlight(node.linter);\n      return { ...node, ...(children ? { children } : {}), ...(inFlight ? { passed: false } : {}) };\n    });\n  if (missing.size === 0) return markPending(roots);\n  const added = Array.from(missing.values()).map((r) => linterNode(r.linter, r, []));\n  const linters = new Map([...roots.filter((n) => n.kind === \"linter\"), ...added].map((n) => [n.name, n]));\n  return markPending([...roots.filter((n) => n.kind !== \"linter\"), ...sortedKeys(linters).map((k) => linters.get(k)!)]);\n}\n\n// ---------------------------------------------------------------------------\n// Linter ordering and nesting (linter-first groupings)\n\nconst STATUS_BUCKETS = [\"running\", \"pending\", \"failed\", \"findings\", \"passed\"] as const;\ntype StatusBucket = (typeof STATUS_BUCKETS)[number];\n\n/** Where a linter node sorts: its own state, or a nested linter's if that is more urgent. */\nfunction statusBucket(node: Draft): number {\n  const own: StatusBucket =\n    node.linter?.status === \"running\"\n      ? \"running\"\n      : node.linter?.status === \"pending\"\n        ? \"pending\"\n        : node.children?.some((c) => c.kind === \"linter-error\")\n          ? \"failed\"\n          : lintNodeCount(node) > 0\n            ? \"findings\"\n            : \"passed\";\n  const nested = (node.children ?? []).filter((c) => c.kind === \"linter\").map(statusBucket);\n  return Math.min(STATUS_BUCKETS.indexOf(own), ...nested);\n}\n\n/** Running → pending → failed → with findings → passed; by name within a bucket (the sort is stable). */\nfunction sortLinterNodes(nodes: Draft[]): Draft[] {\n  return nodes\n    .map((node) => ({ node, bucket: statusBucket(node) }))\n    .sort((a, b) => a.bucket - b.bucket || (a.node.name < b.node.name ? -1 : a.node.name > b.node.name ? 1 : 0))\n    .map(({ node }) => node);\n}\n\n/**\n * Results named `<parent>/<child>` where a `<parent>` result exists (the linters\n * a prompt run's agent ran) become linter nodes beneath the parent's node,\n * shown by their child name. Without a visible parent they stay top-level.\n */\nfunction nestChildLinters(roots: Draft[], results: readonly LinterResult[], filters: LintFilters): Draft[] {\n  const visible = results.filter((r) => matchesFilterState(r.linter, filters.linter));\n  const meta = linterMetaOf(visible);\n  const parentOf = (name: string): string | undefined => {\n    for (let i = name.lastIndexOf(\"/\"); i > 0; i = name.lastIndexOf(\"/\", i - 1)) {\n      if (meta.has(name.slice(0, i))) return name.slice(0, i);\n    }\n    return undefined;\n  };\n  const nodes = new Map(roots.filter((n) => n.kind === \"linter\").map((n) => [n.name, n]));\n  const childrenOf = groupBy(\n    Array.from(meta.keys()).filter((name) => parentOf(name) !== undefined),\n    (name) => parentOf(name)!,\n  );\n  if (childrenOf.size === 0) return roots;\n\n  const attach = (name: string, nestedUnder?: string): Draft => {\n    const node = nodes.get(name) ?? linterNode(name, meta.get(name), []);\n    const nested = (childrenOf.get(name) ?? []).map((child) => attach(child, name));\n    const label = nestedUnder ? { name: name.slice(nestedUnder.length + 1), nestedUnder } : {};\n    if (nested.length === 0) return { ...node, ...label };\n    const own = node.children ?? [];\n    const failed = node.failed || nested.some((n) => n.failed);\n    return {\n      ...node,\n      ...label,\n      children: [\n        ...own.filter((c) => c.kind === \"linter-error\"),\n        ...sortLinterNodes(nested),\n        ...own.filter((c) => c.kind !== \"linter-error\"),\n      ],\n      failed,\n      passed: node.passed && !failed && nested.every((n) => n.passed || n.skipped),\n    };\n  };\n\n  const topLevel = new Set([...nodes.keys(), ...childrenOf.keys()]);\n  return [\n    ...roots.filter((n) => n.kind !== \"linter\"),\n    ...Array.from(topLevel)\n      .filter((name) => parentOf(name) === undefined)\n      .map((name) => attach(name)),\n  ];\n}\n\n// ---------------------------------------------------------------------------\n// Collapsing, route paths, lookup\n\nfunction joinChainNames(parent: string, child: string): string {\n  const p = parent.trim();\n  const c = child.trim();\n  return p && c ? `${p.replace(/\\/+$/, \"\")}/${c.replace(/^\\/+/, \"\")}` : p || c;\n}\n\n/**\n * Folds a folder (a node of `folderKind`) that has a single child into that\n * child: `pkg/sub/a.go`. Generic so other path trees can reuse it.\n */\nexport function collapseFolderChains<N extends { name: string; kind: string; children?: N[] | undefined }>(\n  nodes: N[],\n  folderKind: N[\"kind\"],\n): N[] {\n  return nodes.map((node) => {\n    if (!node.children || node.children.length === 0) return node;\n    const children = collapseFolderChains(node.children, folderKind);\n    if (children.length === 1 && node.kind === folderKind) {\n      const [child] = children;\n      return { ...child!, name: joinChainNames(node.name, child!.name) };\n    }\n    return { ...node, children };\n  });\n}\n\n/** Stable, unique route path per node: slug segments joined by `/`, siblings with equal slugs get `~N`. */\nfunction annotateRoutePaths(nodes: Draft[], parentSegments: string[] = []): LintNode[] {\n  const slugs = nodes.map((n) => slugify(n.name));\n  const totals = groupBy(slugs, (s) => s);\n  const seen = new Map<string, number>();\n  return nodes.map((node, i) => {\n    const slug = slugs[i]!;\n    const ordinal = (seen.get(slug) ?? 0) + 1;\n    seen.set(slug, ordinal);\n    const segment = totals.get(slug)!.length > 1 ? `${slug}~${ordinal}` : slug;\n    const segments = [...parentSegments, segment];\n    const { children, ...rest } = node;\n    return {\n      ...rest,\n      route_path: segments.join(\"/\"),\n      ...(children ? { children: annotateRoutePaths(children, segments) } : {}),\n    };\n  });\n}\n\nconst GROUPERS: Record<LintGrouping, (results: readonly LinterResult[], filters: LintFilters) => Draft[]> = {\n  \"linter-rule-file\": groupByLinterRuleFile,\n  \"linter-file\": groupByLinterFile,\n  \"file-linter-rule\": groupByFileLinterRule,\n  summary: groupBySummary,\n};\n\n/** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */\nexport function buildLintTree({\n  results,\n  grouping,\n  filters,\n}: {\n  results: readonly LinterResult[];\n  grouping: LintGrouping;\n  filters: LintFilters;\n}): LintNode[] {\n  const grouped = withInFlightLinters(\n    withLinterErrors(GROUPERS[grouping](results, filters), results, filters),\n    results,\n    filters,\n  );\n  // The file-rooted grouping has no linter roots to order or nest.\n  const ordered = grouping === \"file-linter-rule\" ? grouped : sortLinterNodes(nestChildLinters(grouped, results, filters));\n  // Summary keeps its linter -> rule -> file branches as built.\n  return annotateRoutePaths(grouping === \"summary\" ? ordered : collapseFolderChains(ordered, \"lint-folder\"));\n}\n\n/** Depth-first lookup of the node whose route_path equals `path`, or null. */\nexport function findLintNode(nodes: readonly LintNode[], path: string): LintNode | null {\n  if (!path) return null;\n  for (const node of nodes) {\n    if (node.route_path === path) return node;\n    const found = node.children ? findLintNode(node.children, path) : null;\n    if (found) return found;\n  }\n  return null;\n}\n"],"mappings":";;;;;AAmDA,IAAM,UAAU;AAChB,IAAM,qBAAqB;AAE3B,SAAS,WAAW,GAAsB;CACxC,OAAO,EAAE,MAAM,UAAU;AAC3B;AAEA,SAAS,OAAO,YAA+C;CAC7D,OAAO,WAAW,MAAM,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ,EAAE;AACxE;AAEA,SAAS,UAAU,GAAmB;CACpC,MAAM,MAAM,EAAE,QAAQ,IAAI;CAC1B,OAAO,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AACxC;AAEA,SAAS,QAAc,OAAqB,KAAkC;CAC5E,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC;EAC9B,IAAI,MAAM,KAAK,KAAK,IAAI;OACnB,IAAI,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;CAChC;CACA,OAAO;AACT;AAEA,SAAS,WAAc,KAA+B;CACpD,OAAO,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK;AACrC;;AAMA,SAAgB,YAAY,SAAkC,SAAuC;CACnG,MAAM,UAAU,QAAQ,QAAQ,MAAM,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,YAAY,IAAI,IAAI,QAAQ,SAAS,MAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO;CAC9G,MAAM,MAAuB,CAAC;CAC9B,KAAK,MAAM,UAAU,SACnB,KAAK,MAAM,KAAK,OAAO,cAAc,CAAC,GAAG;EACvC,IAAI,CAAC,mBAAmB,WAAW,CAAC,GAAG,QAAQ,QAAQ,GAAG;EAC1D,MAAM,UAAU,QAAQ,EAAE,MAAM,OAAO,QAAQ;EAC/C,MAAM,OAAO,iBAAiB,SAAS,OAAO,UAAU,SAAS;EACjE,IAAI,KAAK;GACP,QAAQ,OAAO;GACf;GACA,GAAG;IAAE,GAAG;IAAG,UAAU;IAAS;GAAK;GACnC;GACA;GACA,SAAS,OAAO;EAClB,CAAC;CACH;CAEF,OAAO;AACT;AAEA,SAAS,aAAa,SAA6D;CACjF,MAAM,uBAAO,IAAI,IAA0B;CAC3C,KAAK,MAAM,KAAK,SAAS,IAAI,CAAC,KAAK,IAAI,EAAE,MAAM,GAAG,KAAK,IAAI,EAAE,QAAQ,CAAC;CACtE,OAAO;AACT;AAKA,SAAS,UAAsB;CAC7B,OAAO;EAAE,MAAM;EAAI,MAAM,KAAA;EAAW,SAAS;EAAI,yBAAS,IAAI,IAAI;EAAG,wBAAQ,IAAI,IAAI;CAAE;AACzF;;AAGA,SAAS,SAAY,MAAe,MAAc,SAAiB,QAAoB;CACrF,MAAM,WAAW,sBAAsB,IAAI;CAC3C,MAAM,cAAc,sBAAsB,OAAO;CACjD,IAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAClD,MAAM,IAAI,MAAM,kDAAkD,KAAK,UAAU,IAAI,EAAE,QAAQ,KAAK,UAAU,OAAO,EAAE,EAAE;CAE3H,MAAM,iBAAiB,SAAS,MAAM,GAAG,EAAE;CAC3C,MAAM,oBAAoB,YAAY,MAAM,GAAG,EAAE;CAGjD,MAAM,YAAY,eAAe,SAAS,kBAAkB;CAC5D,IAAI,UAAU;CACd,eAAe,SAAS,SAAS,MAAM;EACrC,IAAI,QAAQ,QAAQ,QAAQ,IAAI,OAAO;EACvC,IAAI,CAAC,OAAO;GACV,MAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,kBAAkB,QAAQ,IAAI,IAAI,SAAS,CAAC;GAClF,QAAQ;IACN,MAAM;IACN,MAAM,QAAQ,OAAO,GAAG,QAAQ,KAAK,GAAG,YAAY;IACpD,SAAS,kBAAkB,MAAM,GAAG,QAAQ,CAAC,CAAC,KAAK,GAAG;IACtD,yBAAS,IAAI,IAAI;IACjB,wBAAQ,IAAI,IAAI;GAClB;GACA,QAAQ,QAAQ,IAAI,SAAS,KAAK;EACpC;EACA,UAAU;CACZ,CAAC;CACD,MAAM,WAAW,SAAS,SAAS,SAAS;CAC5C,IAAI,OAAO,QAAQ,OAAO,IAAI,QAAQ;CACtC,IAAI,CAAC,MAAM;EACT,OAAO,OAAO;EACd,QAAQ,OAAO,IAAI,UAAU,IAAI;CACnC;CACA,OAAO;AACT;AAKA,SAAS,UAAU,MAAc,MAAqB,UAA0B;CAC9E,MAAM,SAAS,SAAS,MAAM,MAAM,EAAE,MAAM;CAC5C,OAAO;EAAE;EAAM;EAAM;EAAU;EAAQ,QAAQ,CAAC;EAAQ,SAAS;CAAM;AACzE;AAEA,SAAS,cAAc,UAAgD;CACrE,MAAM,OAAO,IAAI,IAAI,SAAS,SAAS,MAAO,EAAE,WAAW,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAE,CAAC;CAC9E,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,KAAA;AACjD;AAEA,SAAS,qBAAqB,MAAa,QAAqC;CAC9E,IAAI,OAAO,WAAW,GAAG,OAAO;CAChC,MAAM,SAAS,KAAK,UAAU,cAAc,MAAM,MAAM;CACxD,OAAO;EAAE,GAAG;EAAM,kBAAkB,OAAO,MAAM;EAAG;EAAQ,QAAQ,CAAC;CAAO;AAC9E;AAEA,SAAS,cAAc,MAQb;CACR,MAAM,SAAS,cAAc,KAAK,UAAU,MAAM;CAClD,OAAO;EACL,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,aAAa,KAAK;EAClB,UAAU,KAAK;EACf,YAAY,KAAK;EACjB,YAAY,OAAO,KAAK,UAAU;EAClC;EACA,QAAQ,CAAC;EACT,SAAS;CACX;AACF;AAEA,SAAS,WACP,YACA,QACA,UACA,SAA+B,CAAC,GACzB;CACP,OAAO,qBAAqB;EAAE,GAAG,UAAU,YAAY,UAAU,QAAQ;EAAG,QAAQ;EAAQ;CAAW,GAAG,MAAM;AAClH;AAEA,SAAS,gBAAgB,QAA6B;CACpD,MAAM,UAAU,mBAAmB,MAAM;CACzC,OAAO;EACL,MAAM,UAAU,OAAO;EACvB,MAAM;EACN,YAAY,OAAO;EACnB,QAAQ;EACR,UAAU,OAAO;EACjB,QAAQ;EACR,QAAQ;EACR,SAAS;EACT;CACF;AACF;AAEA,SAAS,UAAU,MAAwB,YAAoB,UAA4B;CACzF,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,UAAU,QAAQ,YAAY,QAAQ,CAAC;EAC1F,OAAO;GACL,GAAG;GACH,MAAM,OAAO;GACb,aAAa,OAAO;GACpB;GACA,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAC/B,UAAU,cAAc,KAAK,QAAS;EACxC;CACF,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,SAAS,KAAK,OAAO,IAAI,GAAG;EAElC,MAAM,OAAO,cAAc;GACzB,MAAM;GACN,MAAM;GACN,MAJe,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;GAKnD,SAAS,OAAO;GAChB;GACA,YAAY,OAAO;GACnB,SAAS,OAAO;EAClB,CAAC;EACD,OAAO,WAAW;GAAE,GAAG;GAAM;EAAS,IAAI;CAC5C,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAIA,SAAS,gBAAgB,MAAyB,YAAgD;CAChG,MAAM,UAAU,WAAW,KAAK,OAAO,CAAC,CAAC,KAAK,QAAQ;EACpD,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;EACnC,MAAM,OAAO,UAAU,OAAO,MAAM,eAAe,gBAAgB,QAAQ,UAAU,CAAC;EACtF,OAAO;GAAE,GAAG;GAAM,MAAM,OAAO;GAAM,aAAa,OAAO;GAAS,UAAU,cAAc,KAAK,QAAS;EAAE;CAC5G,CAAC;CACD,MAAM,QAAQ,WAAW,KAAK,MAAM,CAAC,CAAC,KAAK,QAAQ;EACjD,MAAM,UAAU,KAAK,OAAO,IAAI,GAAG;EACnC,MAAM,WAAW,KAAK,OAAO,GAAG,KAAK,KAAK,GAAG,QAAQ;EACrD,MAAM,eAAe,WAAW,OAAO,CAAC,CAAC,KAAK,eAAe;GAC3D,MAAM,EAAE,SAAS,UAAU,QAAQ,IAAI,UAAU;GACjD,MAAM,aAAa,WAAW,KAAK,CAAC,CAAC,KAAK,SAAS;IACjD,MAAM,aAAa,MAAM,IAAI,IAAI;IACjC,OAAO;KACL,GAAG,cAAc;MACf,MAAM;MACN,MAAM;MACN,MAAM;MACN,SAAS,WAAW,EAAE,EAAE,YAAY;MACpC;MACA;MACA;KACF,CAAC;KACD,UAAU;IACZ;GACF,CAAC;GACD,OAAO;IACL,GAAG,WAAW,YAAY,WAAW,IAAI,UAAU,GAAG,UAAU;IAChE,MAAM;IACN,aAAa,WAAW,EAAE,EAAE;IAC5B,UAAU;GACZ;EACF,CAAC;EACD,OAAO;GACL,GAAG,UAAU,KAAK,aAAa,YAAY;GAC3C,MAAM;GACN,aAAa,aAAa,EAAE,EAAE;GAC9B,UAAU,cAAc,YAAY;EACtC;CACF,CAAC;CACD,OAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAKA,SAAS,YAAY,MAAkD;CACrE,MAAM,OAAO,QAAoB;CACjC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa;GACjD,SAAS,EAAE,WAAW,EAAE;GACxB,SAAS,EAAE;GACX,YAAY,CAAC;EACf,EAAE,CAAC,CAAC,WAAW,KAAK,EAAE,CAAC;CACzB;CACA,OAAO;AACT;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACxC,KAAK,CAAC,CACN,KAAK,SAAS;GACb,MAAM,QAAQ,OAAO,IAAI,IAAI;GAC7B,MAAM,WAAW,UAAU,YAAY,KAAK,GAAG,YAAY,IAAI;GAE/D,OAAO,qBACL;IACE,GAHS,UAAU,MAAM,mBAAmB,QAGzC;IACH;IACA,UAAU;IACV,UAAU,cAAc,QAAQ,KAAK,KAAK,IAAI,UAAU,CAAC,EAAE;GAC7D,GACA,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;EACF,CAAC;EACH,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,SAAS;CAC/D,CAAC;AACL;AAEA,SAAS,kBAAkB,SAAkC,SAA+B;CAC1F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CACvE,OAAO,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC/B,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,SAAS,IAAI,UAAU;EACrC,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,YAAY,KAAK,GAAG,UAAU,GACxC,MAAM,QAAQ,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,EAAE,CAAC,CAC7C;CACF,CAAC;AACL;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;CAC9F,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,OAAO,YAAY,SAAS,OAAO;CACzC,MAAM,OAAO,QAAqB;CAClC,KAAK,MAAM,KAAK,MAAM;EACpB,IAAI,CAAC,EAAE,MAAM;EACb,MAAM,UAAU,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,4BAAY,IAAI,IAAI,CAAC;EAC3E,IAAI,QAAQ,QAAQ,IAAI,EAAE,MAAM;EAChC,IAAI,CAAC,OAAO;GACV,QAAQ;IAAE,SAAS,EAAE;IAAS,uBAAO,IAAI,IAAI;GAAE;GAC/C,QAAQ,IAAI,EAAE,QAAQ,KAAK;EAC7B;EACA,MAAM,OAAO,WAAW,EAAE,CAAC;EAC3B,MAAM,MAAM,IAAI,MAAM,CAAC,GAAI,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC,GAAI,EAAE,CAAC,CAAC;CAC/D;CAEA,MAAM,WAAW,QAAQ,KAAK,QAAQ,MAAM,CAAC,EAAE,IAAI,IAAI,MAAM,EAAE,MAAM;CACrE,MAAM,gBAAgB,MAAM,KAAK,SAAS,KAAK,CAAC,CAAC,CAC9C,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,IAAK,MAAM,WAAW,EAAE,CAAC,CAAC;EACxE,MAAM,UAAU,KAAK,IAAI,UAAU,CAAC,EAAE;EACtC,MAAM,SAAS,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CACrC,KAAK,CAAC,CACN,KAAK,UAAU;GACd,GAAG,cAAc;IACf,MAAM;IACN,MAAM;IACN,MAAM;IACN,SAAS;IACT;IACA,YAAY,OAAO,IAAI,IAAI,CAAC,CAAE,KAAK,MAAM,EAAE,CAAC;IAC5C;GACF,CAAC;GACD,UAAU;GACV,MAAM,KAAA;GACN,aAAa,KAAA;EACf,EAAE;EACJ,OAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,MAAM;CAC5D,CAAC;CAEH,OAAO,CAAC,GAAG,gBAAgB,MAAM,IAAI,GAAG,GAAG,aAAa;AAC1D;AAEA,SAAS,iBAAiB,MAA0B,YAA0C;CAC5F,IAAI,CAAC,MAAM,OAAO;CAClB,IAAI,WAAW,SAAS,GAAG,OAAO,GAAG,KAAK,IAAI,WAAW,OAAO;CAChE,MAAM,IAAI,WAAW;CACrB,IAAI,GAAG,MAAM,OAAO,EAAE,SAAS,GAAG,KAAK,GAAG,EAAE,KAAK,GAAG,EAAE,WAAW,GAAG,KAAK,GAAG,EAAE;CAC9E,OAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,YAAoB,OAAwC;CACjG,MAAM,SAAS,QAAQ,QAAQ,MAAM,EAAE,QAAQ,EAAE;CACjD,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,CAAC;CACrC,MAAM,QAAiB,KAAK,MAAM,GAAG,kBAAkB,CAAC,CAAC,KAAK,QAAQ;EACpE,MAAM,QAAQ,OAAO,IAAI,GAAG;EAC5B,OAAO;GACL,GAAG,cAAc;IACf,MAAM,iBAAiB,MAAM,EAAE,CAAE,MAAM,MAAM,KAAK,MAAM,EAAE,CAAC,CAAC;IAC5D,MAAM;IACN,MAAM,MAAM,EAAE,CAAE,QAAQ;IACxB,SAAS,MAAM,EAAE,CAAE,WAAW;IAC9B;IACA,YAAY,MAAM,KAAK,MAAM,EAAE,CAAC;IAChC,SAAS,MAAM,EAAE,CAAE;GACrB,CAAC;GACD,MAAM,MAAM,EAAE,CAAE;GAChB,aAAa,MAAM,EAAE,CAAE;GACvB,UAAU;EACZ;CACF,CAAC;CACD,MAAM,YAAY,KAAK,SAAS,MAAM;CACtC,IAAI,YAAY,GACd,MAAM,KAAK;EACT,MAAM,KAAK,UAAU,YAAY,cAAc,IAAI,KAAK;EACxD,MAAM;EACN;EACA,UAAU;EACV,QAAQ;EACR,QAAQ;EACR,SAAS;CACX,CAAC;CAEH,MAAM,eAAe,MAAM,MAAM,MAAM,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE;CAEvD,OAAO;EAAE,GAAG,UADC,eAAe,GAAG,KAAK,IAAI,MAAM,OAAO,MAAM,iBAAiB,GAAG,KAAK,IAAI,MAAM,OAAO,IACzE,mBAAmB,KAAK;EAAG;EAAY,UAAU;CAAK;AACpF;AAEA,SAAS,eAAe,SAAkC,SAA+B;CACvF,MAAM,OAAO,aAAa,OAAO;CACjC,MAAM,eAAe,QAAQ,YAAY,SAAS,OAAO,IAAI,MAAM,EAAE,MAAM;CAC3E,MAAM,UAAU,QAAQ,QAAQ,MAAM,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;CAClF,MAAM,UAAU,IAAI,IAAI,QAAQ,QAAQ,MAAM,EAAE,OAAO,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,QAAQ,EAAE,SAAS,SAAS,CAAC,CAAC;CAErG,OAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CACrD,KAAK,CAAC,CACN,KAAK,eAAe;EACnB,MAAM,QAAQ,aAAa,IAAI,UAAU,KAAK,CAAC;EAC/C,IAAI,MAAM,WAAW,KAAK,QAAQ,IAAI,UAAU,GAC9C,OAAO;GACL,MAAM;GACN,MAAM;GACN,QAAQ,KAAK,IAAI,UAAU;GAC3B;GACA,SAAS;GACT,QAAQ;GACR,QAAQ;GACR,SAAS,YAAY,QAAQ,IAAI,UAAU;EAC7C;EAEF,MAAM,SAAS,QAAQ,QAAQ,MAAM,WAAW,EAAE,CAAC,CAAC;EACpD,MAAM,YAAY,MAAM,KAAK,OAAO,KAAK,CAAC,CAAC,CAAC,MACzC,GAAG,MAAM,OAAO,IAAI,CAAC,CAAC,CAAE,SAAS,OAAO,IAAI,CAAC,CAAC,CAAE,UAAU,EAAE,cAAc,CAAC,CAC9E;EACA,OAAO,WACL,YACA,KAAK,IAAI,UAAU,GACnB,UAAU,KAAK,SAAS,gBAAgB,MAAM,YAAY,OAAO,IAAI,IAAI,CAAE,CAAC,CAC9E;CACF,CAAC;AACL;;AAGA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CACzG,MAAM,SAAS,QACb,QAAQ,QAAQ,MAAM,gBAAgB,CAAC,KAAK,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC,IACvF,MAAM,EAAE,MACX;CACA,IAAI,OAAO,SAAS,GAAG,OAAO;CAC9B,MAAM,UAAU,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACxF,KAAK,MAAM,CAAC,MAAM,WAAW,QAAQ;EACnC,MAAM,aAAa,OAAO,IAAI,eAAe;EAC7C,MAAM,WAAW,QAAQ,IAAI,IAAI;EACjC,QAAQ,IACN,MACA,WACI;GAAE,GAAG;GAAU,UAAU,CAAC,GAAG,YAAY,GAAI,SAAS,YAAY,CAAC,CAAE;GAAG,QAAQ;GAAM,QAAQ;EAAM,IACpG,WAAW,MAAM,OAAO,IAAI,UAAU,CAC5C;CACF;CAEA,OAAO,CAAC,GADO,MAAM,QAAQ,MAAM,EAAE,SAAS,QACnC,GAAQ,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,SAAS,QAAQ,IAAI,IAAI,CAAE,CAAC;AAC7E;AAEA,SAAS,cAAc,OAAyB,uBAAO,IAAI,IAAY,GAAgB;CACrF,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,SAAS,YAAY,KAAK,YAAY,KAAK,IAAI,KAAK,UAAU;EACvE,cAAc,KAAK,YAAY,CAAC,GAAG,IAAI;CACzC;CACA,OAAO;AACT;;;;;AAMA,SAAS,oBAAoB,OAAgB,SAAkC,SAA+B;CAC5G,MAAM,UAAU,cAAc,KAAK;CACnC,MAAM,0BAAU,IAAI,IAA0B;CAC9C,KAAK,MAAM,KAAK,SACd,IAAI,iBAAiB,CAAC,KAAK,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,KAAK,CAAC,QAAQ,IAAI,EAAE,MAAM,GAC9F,QAAQ,IAAI,EAAE,QAAQ,CAAC;CAG3B,MAAM,eAAe,UACnB,MAAM,KAAK,SAAS;EAClB,MAAM,WAAW,KAAK,WAAW,YAAY,KAAK,QAAQ,IAAI,KAAA;EAC9D,MAAM,WAAW,KAAK,SAAS,YAAY,KAAK,WAAW,KAAA,KAAa,iBAAiB,KAAK,MAAM;EACpG,OAAO;GAAE,GAAG;GAAM,GAAI,WAAW,EAAE,SAAS,IAAI,CAAC;GAAI,GAAI,WAAW,EAAE,QAAQ,MAAM,IAAI,CAAC;EAAG;CAC9F,CAAC;CACH,IAAI,QAAQ,SAAS,GAAG,OAAO,YAAY,KAAK;CAChD,MAAM,QAAQ,MAAM,KAAK,QAAQ,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM,WAAW,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;CACjF,MAAM,UAAU,IAAI,IAAI,CAAC,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACvG,OAAO,YAAY,CAAC,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAAG,GAAG,WAAW,OAAO,CAAC,CAAC,KAAK,MAAM,QAAQ,IAAI,CAAC,CAAE,CAAC,CAAC;AACtH;AAKA,IAAM,iBAAiB;CAAC;CAAW;CAAW;CAAU;CAAY;AAAQ;;AAI5E,SAAS,aAAa,MAAqB;CACzC,MAAM,MACJ,KAAK,QAAQ,WAAW,YACpB,YACA,KAAK,QAAQ,WAAW,YACtB,YACA,KAAK,UAAU,MAAM,MAAM,EAAE,SAAS,cAAc,IAClD,WACA,cAAc,IAAI,IAAI,IACpB,aACA;CACZ,MAAM,UAAU,KAAK,YAAY,CAAC,EAAA,CAAG,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,IAAI,YAAY;CACxF,OAAO,KAAK,IAAI,eAAe,QAAQ,GAAG,GAAG,GAAG,MAAM;AACxD;;AAGA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,MACJ,KAAK,UAAU;EAAE;EAAM,QAAQ,aAAa,IAAI;CAAE,EAAE,CAAC,CACrD,MAAM,GAAG,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,KAAK,EAAE,KAAK,OAAO,EAAE,KAAK,OAAO,IAAI,EAAE,CAAC,CAC3G,KAAK,EAAE,WAAW,IAAI;AAC3B;;;;;;AAOA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;CAEzG,MAAM,OAAO,aADG,QAAQ,QAAQ,MAAM,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CACvD,CAAO;CACjC,MAAM,YAAY,SAAqC;EACrD,KAAK,IAAI,IAAI,KAAK,YAAY,GAAG,GAAG,IAAI,GAAG,IAAI,KAAK,YAAY,KAAK,IAAI,CAAC,GACxE,IAAI,KAAK,IAAI,KAAK,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,KAAK,MAAM,GAAG,CAAC;CAG1D;CACA,MAAM,QAAQ,IAAI,IAAI,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,CAAC,CAAC,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;CACtF,MAAM,aAAa,QACjB,MAAM,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,SAAS,SAAS,IAAI,MAAM,KAAA,CAAS,IACpE,SAAS,SAAS,IAAI,CACzB;CACA,IAAI,WAAW,SAAS,GAAG,OAAO;CAElC,MAAM,UAAU,MAAc,gBAAgC;EAC5D,MAAM,OAAO,MAAM,IAAI,IAAI,KAAK,WAAW,MAAM,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;EACnE,MAAM,UAAU,WAAW,IAAI,IAAI,KAAK,CAAC,EAAA,CAAG,KAAK,UAAU,OAAO,OAAO,IAAI,CAAC;EAC9E,MAAM,QAAQ,cAAc;GAAE,MAAM,KAAK,MAAM,YAAY,SAAS,CAAC;GAAG;EAAY,IAAI,CAAC;EACzF,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE,GAAG;GAAM,GAAG;EAAM;EACpD,MAAM,MAAM,KAAK,YAAY,CAAC;EAC9B,MAAM,SAAS,KAAK,UAAU,OAAO,MAAM,MAAM,EAAE,MAAM;EACzD,OAAO;GACL,GAAG;GACH,GAAG;GACH,UAAU;IACR,GAAG,IAAI,QAAQ,MAAM,EAAE,SAAS,cAAc;IAC9C,GAAG,gBAAgB,MAAM;IACzB,GAAG,IAAI,QAAQ,MAAM,EAAE,SAAS,cAAc;GAChD;GACA;GACA,QAAQ,KAAK,UAAU,CAAC,UAAU,OAAO,OAAO,MAAM,EAAE,UAAU,EAAE,OAAO;EAC7E;CACF;CAEA,MAAM,2BAAW,IAAI,IAAI,CAAC,GAAG,MAAM,KAAK,GAAG,GAAG,WAAW,KAAK,CAAC,CAAC;CAChE,OAAO,CACL,GAAG,MAAM,QAAQ,MAAM,EAAE,SAAS,QAAQ,GAC1C,GAAG,MAAM,KAAK,QAAQ,CAAC,CACpB,QAAQ,SAAS,SAAS,IAAI,MAAM,KAAA,CAAS,CAAC,CAC9C,KAAK,SAAS,OAAO,IAAI,CAAC,CAC/B;AACF;AAKA,SAAS,eAAe,QAAgB,OAAuB;CAC7D,MAAM,IAAI,OAAO,KAAK;CACtB,MAAM,IAAI,MAAM,KAAK;CACrB,OAAO,KAAK,IAAI,GAAG,EAAE,QAAQ,QAAQ,EAAE,EAAE,GAAG,EAAE,QAAQ,QAAQ,EAAE,MAAM,KAAK;AAC7E;;;;;AAMA,SAAgB,qBACd,OACA,YACK;CACL,OAAO,MAAM,KAAK,SAAS;EACzB,IAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,GAAG,OAAO;EACzD,MAAM,WAAW,qBAAqB,KAAK,UAAU,UAAU;EAC/D,IAAI,SAAS,WAAW,KAAK,KAAK,SAAS,YAAY;GACrD,MAAM,CAAC,SAAS;GAChB,OAAO;IAAE,GAAG;IAAQ,MAAM,eAAe,KAAK,MAAM,MAAO,IAAI;GAAE;EACnE;EACA,OAAO;GAAE,GAAG;GAAM;EAAS;CAC7B,CAAC;AACH;;AAGA,SAAS,mBAAmB,OAAgB,iBAA2B,CAAC,GAAe;CACrF,MAAM,QAAQ,MAAM,KAAK,MAAM,QAAQ,EAAE,IAAI,CAAC;CAC9C,MAAM,SAAS,QAAQ,QAAQ,MAAM,CAAC;CACtC,MAAM,uBAAO,IAAI,IAAoB;CACrC,OAAO,MAAM,KAAK,MAAM,MAAM;EAC5B,MAAM,OAAO,MAAM;EACnB,MAAM,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK;EACxC,KAAK,IAAI,MAAM,OAAO;EACtB,MAAM,UAAU,OAAO,IAAI,IAAI,CAAC,CAAE,SAAS,IAAI,GAAG,KAAK,GAAG,YAAY;EACtE,MAAM,WAAW,CAAC,GAAG,gBAAgB,OAAO;EAC5C,MAAM,EAAE,UAAU,GAAG,SAAS;EAC9B,OAAO;GACL,GAAG;GACH,YAAY,SAAS,KAAK,GAAG;GAC7B,GAAI,WAAW,EAAE,UAAU,mBAAmB,UAAU,QAAQ,EAAE,IAAI,CAAC;EACzE;CACF,CAAC;AACH;AAEA,IAAM,WAAsG;CAC1G,oBAAoB;CACpB,eAAe;CACf,oBAAoB;CACpB,SAAS;AACX;;AAGA,SAAgB,cAAc,EAC5B,SACA,UACA,WAKa;CACb,MAAM,UAAU,oBACd,iBAAiB,SAAS,SAAS,CAAC,SAAS,OAAO,GAAG,SAAS,OAAO,GACvE,SACA,OACF;CAEA,MAAM,UAAU,aAAa,qBAAqB,UAAU,gBAAgB,iBAAiB,SAAS,SAAS,OAAO,CAAC;CAEvH,OAAO,mBAAmB,aAAa,YAAY,UAAU,qBAAqB,SAAS,aAAa,CAAC;AAC3G;;AAGA,SAAgB,aAAa,OAA4B,MAA+B;CACtF,IAAI,CAAC,MAAM,OAAO;CAClB,KAAK,MAAM,QAAQ,OAAO;EACxB,IAAI,KAAK,eAAe,MAAM,OAAO;EACrC,MAAM,QAAQ,KAAK,WAAW,aAAa,KAAK,UAAU,IAAI,IAAI;EAClE,IAAI,OAAO,OAAO;CACpB;CACA,OAAO;AACT"}

package/dist/data/lint/ignore-menu-items.cjs

@@ -0,0 +1,18 @@
+const require_UiEyeClosed = require("../../icons/components/UiEyeClosed.cjs");
+// src/data/lint/ignore-menu-items.ts
+function isIgnoreActionDisabled(action, busy) {
+	return busy || Boolean(action.disabledWithoutWorkDir) && !action.req.work_dir;
+}
+function ignoreMenuItems(actions, onIgnore, busy) {
+	return actions.map((action) => ({
+		label: action.label,
+		icon: require_UiEyeClosed.UiEyeClosed,
+		title: action.title,
+		disabled: isIgnoreActionDisabled(action, busy),
+		onSelect: () => void onIgnore(action)
+	}));
+}
+exports.ignoreMenuItems = ignoreMenuItems;
+exports.isIgnoreActionDisabled = isIgnoreActionDisabled;
+
+//# sourceMappingURL=ignore-menu-items.cjs.map

package/dist/data/lint/ignore-menu-items.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"ignore-menu-items.cjs","names":["UiEyeClosed"],"sources":["../../../src/data/lint/ignore-menu-items.ts"],"sourcesContent":["import type { DropdownMenuItem } from \"../../overlay/DropdownMenu\";\nimport { UiEyeClosed } from \"../../icons\";\nimport type { LintAction } from \"./types\";\n\nexport type IgnoreHandler = (action: LintAction) => void | Promise<void>;\n\nexport function isIgnoreActionDisabled(action: LintAction, busy: boolean): boolean {\n  return busy || (Boolean(action.disabledWithoutWorkDir) && !action.req.work_dir);\n}\n\nexport function ignoreMenuItems(actions: readonly LintAction[], onIgnore: IgnoreHandler, busy: boolean): DropdownMenuItem[] {\n  return actions.map((action) => ({\n    label: action.label,\n    icon: UiEyeClosed,\n    title: action.title,\n    disabled: isIgnoreActionDisabled(action, busy),\n    onSelect: () => void onIgnore(action),\n  }));\n}\n"],"mappings":";;AAMA,SAAgB,uBAAuB,QAAoB,MAAwB;CACjF,OAAO,QAAS,QAAQ,OAAO,sBAAsB,KAAK,CAAC,OAAO,IAAI;AACxE;AAEA,SAAgB,gBAAgB,SAAgC,UAAyB,MAAmC;CAC1H,OAAO,QAAQ,KAAK,YAAY;EAC9B,OAAO,OAAO;EACd,MAAMA,oBAAAA;EACN,OAAO,OAAO;EACd,UAAU,uBAAuB,QAAQ,IAAI;EAC7C,gBAAgB,KAAK,SAAS,MAAM;CACtC,EAAE;AACJ"}

package/dist/data/lint/ignore-menu-items.d.ts

@@ -0,0 +1,6 @@
+import { DropdownMenuItem } from '../../overlay/DropdownMenu.js';
+import { LintAction } from './types.js';
+export type IgnoreHandler = (action: LintAction) => void | Promise<void>;
+export declare function isIgnoreActionDisabled(action: LintAction, busy: boolean): boolean;
+export declare function ignoreMenuItems(actions: readonly LintAction[], onIgnore: IgnoreHandler, busy: boolean): DropdownMenuItem[];
+//# sourceMappingURL=ignore-menu-items.d.ts.map

package/dist/data/lint/ignore-menu-items.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ignore-menu-items.d.ts","sourceRoot":"","sources":["../../../src/data/lint/ignore-menu-items.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE1C,MAAM,MAAM,aAAa,GAAG,CAAC,MAAM,EAAE,UAAU,KAAK,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAEzE,wBAAgB,sBAAsB,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAEjF;AAED,wBAAgB,eAAe,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,EAAE,QAAQ,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,GAAG,gBAAgB,EAAE,CAQ1H"}

package/dist/data/lint/ignore-menu-items.js

@@ -0,0 +1,17 @@
+import { UiEyeClosed } from "../../icons/components/UiEyeClosed.js";
+// src/data/lint/ignore-menu-items.ts
+function isIgnoreActionDisabled(action, busy) {
+	return busy || Boolean(action.disabledWithoutWorkDir) && !action.req.work_dir;
+}
+function ignoreMenuItems(actions, onIgnore, busy) {
+	return actions.map((action) => ({
+		label: action.label,
+		icon: UiEyeClosed,
+		title: action.title,
+		disabled: isIgnoreActionDisabled(action, busy),
+		onSelect: () => void onIgnore(action)
+	}));
+}
+export { ignoreMenuItems, isIgnoreActionDisabled };
+
+//# sourceMappingURL=ignore-menu-items.js.map

package/dist/data/lint/ignore-menu-items.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ignore-menu-items.js","names":[],"sources":["../../../src/data/lint/ignore-menu-items.ts"],"sourcesContent":["import type { DropdownMenuItem } from \"../../overlay/DropdownMenu\";\nimport { UiEyeClosed } from \"../../icons\";\nimport type { LintAction } from \"./types\";\n\nexport type IgnoreHandler = (action: LintAction) => void | Promise<void>;\n\nexport function isIgnoreActionDisabled(action: LintAction, busy: boolean): boolean {\n  return busy || (Boolean(action.disabledWithoutWorkDir) && !action.req.work_dir);\n}\n\nexport function ignoreMenuItems(actions: readonly LintAction[], onIgnore: IgnoreHandler, busy: boolean): DropdownMenuItem[] {\n  return actions.map((action) => ({\n    label: action.label,\n    icon: UiEyeClosed,\n    title: action.title,\n    disabled: isIgnoreActionDisabled(action, busy),\n    onSelect: () => void onIgnore(action),\n  }));\n}\n"],"mappings":";;AAMA,SAAgB,uBAAuB,QAAoB,MAAwB;CACjF,OAAO,QAAS,QAAQ,OAAO,sBAAsB,KAAK,CAAC,OAAO,IAAI;AACxE;AAEA,SAAgB,gBAAgB,SAAgC,UAAyB,MAAmC;CAC1H,OAAO,QAAQ,KAAK,YAAY;EAC9B,OAAO,OAAO;EACd,MAAM;EACN,OAAO,OAAO;EACd,UAAU,uBAAuB,QAAQ,IAAI;EAC7C,gBAAgB,KAAK,SAAS,MAAM;CACtC,EAAE;AACJ"}