@flanksource/clicky-ui 0.3.49 → 0.3.50

package/dist/data/lint/grouping.cjs

@@ -0,0 +1,450 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const filterState = require("../test-runner/filterState.cjs");
+const routePath = require("../test-runner/routePath.cjs");
+const paths = require("./paths.cjs");
+const stats = require("./stats.cjs");
+const NO_RULE = "(no rule)";
+const SUMMARY_FILE_LIMIT = 5;
+function ruleKeyFor(v) {
+  var _a;
+  return ((_a = v.rule) == null ? void 0 : _a.method) || NO_RULE;
+}
+function byLine(violations) {
+  return violations.slice().sort((a, b) => (a.line ?? 0) - (b.line ?? 0));
+}
+function firstLine(s) {
+  const idx = s.indexOf("\n");
+  return idx === -1 ? s : s.slice(0, idx);
+}
+function groupBy(items, key) {
+  const out = /* @__PURE__ */ new Map();
+  for (const item of items) {
+    const list = out.get(key(item));
+    if (list) list.push(item);
+    else out.set(key(item), [item]);
+  }
+  return out;
+}
+function sortedKeys(map) {
+  return Array.from(map.keys()).sort();
+}
+function flattenLint(results, filters) {
+  const visible = results.filter((r) => filterState.matchesFilterState(r.linter, filters.linter));
+  const multiRoot = new Set(visible.flatMap((r) => r.work_dir ? [paths.normalizeLintPath(r.work_dir)] : [])).size > 1;
+  const out = [];
+  for (const result of visible) {
+    for (const v of result.violations ?? []) {
+      if (!filterState.matchesFilterState(stats.severityOf(v), filters.severity)) continue;
+      const rawFile = paths.relPath(v.file, result.work_dir);
+      const file = paths.decorateLintFile(rawFile, result.work_dir, multiRoot);
+      out.push({
+        linter: result.linter,
+        result,
+        v: { ...v, raw_file: rawFile, file },
+        file,
+        rawFile,
+        workDir: result.work_dir
+      });
+    }
+  }
+  return out;
+}
+function linterMetaOf(results) {
+  const meta = /* @__PURE__ */ new Map();
+  for (const r of results) if (!meta.has(r.linter)) meta.set(r.linter, r);
+  return meta;
+}
+function newTrie() {
+  return { name: "", path: void 0, rawPath: "", folders: /* @__PURE__ */ new Map(), leaves: /* @__PURE__ */ new Map() };
+}
+function trieLeaf(root, file, rawFile, create) {
+  const segments = paths.collapsedPathSegments(file);
+  const rawSegments = paths.collapsedPathSegments(rawFile);
+  if (segments.length === 0 || rawSegments.length === 0) {
+    throw new Error(`lint: cannot place violation, empty path (file=${JSON.stringify(file)}, raw=${JSON.stringify(rawFile)})`);
+  }
+  const folderSegments = segments.slice(0, -1);
+  const rawFolderSegments = rawSegments.slice(0, -1);
+  const rawOffset = folderSegments.length - rawFolderSegments.length;
+  let current = root;
+  folderSegments.forEach((segment, i) => {
+    let child = current.folders.get(segment);
+    if (!child) {
+      const rawCount = Math.max(0, Math.min(rawFolderSegments.length, i + 1 - rawOffset));
+      child = {
+        name: segment,
+        path: current.path ? `${current.path}/${segment}` : segment,
+        rawPath: rawFolderSegments.slice(0, rawCount).join("/"),
+        folders: /* @__PURE__ */ new Map(),
+        leaves: /* @__PURE__ */ new Map()
+      };
+      current.folders.set(segment, child);
+    }
+    current = child;
+  });
+  const basename = segments[segments.length - 1];
+  let leaf = current.leaves.get(basename);
+  if (!leaf) {
+    leaf = create();
+    current.leaves.set(basename, leaf);
+  }
+  return leaf;
+}
+function container(name, kind, children) {
+  const failed = children.some((c) => c.failed);
+  return { name, kind, children, failed, passed: !failed, skipped: false };
+}
+function uniqueWorkDir(children) {
+  const dirs = new Set(children.flatMap((c) => c.work_dir ? [c.work_dir] : []));
+  return dirs.size === 1 ? Array.from(dirs)[0] : void 0;
+}
+function withNoFileViolations(node, noFile) {
+  if (noFile.length === 0) return node;
+  const failed = node.failed || stats.worstSeverity(noFile) !== "info";
+  return { ...node, noFileViolations: byLine(noFile), failed, passed: !failed };
+}
+function violationLeaf(args) {
+  const failed = stats.worstSeverity(args.violations) !== "info";
+  return {
+    name: args.name,
+    kind: args.kind,
+    file: args.file,
+    target_path: args.rawFile,
+    work_dir: args.workDir,
+    linterName: args.linterName,
+    violations: byLine(args.violations),
+    failed,
+    passed: !failed,
+    skipped: false
+  };
+}
+function linterNode(linterName, result, children, noFile = []) {
+  return withNoFileViolations({ ...container(linterName, "linter", children), linter: result, linterName }, noFile);
+}
+function linterErrorNode(result) {
+  const message = stats.linterErrorMessage(result);
+  return {
+    name: firstLine(message),
+    kind: "linter-error",
+    linterName: result.linter,
+    linter: result,
+    work_dir: result.work_dir,
+    failed: true,
+    passed: false,
+    skipped: false,
+    message
+  };
+}
+function fileNodes(trie, linterName, ruleName) {
+  const folders = sortedKeys(trie.folders).map((key) => {
+    const folder = trie.folders.get(key);
+    const node = container(folder.name, "lint-folder", fileNodes(folder, linterName, ruleName));
+    return {
+      ...node,
+      file: folder.path,
+      target_path: folder.rawPath,
+      linterName,
+      ...ruleName ? { ruleName } : {},
+      work_dir: uniqueWorkDir(node.children)
+    };
+  });
+  const files = sortedKeys(trie.leaves).map((key) => {
+    const bucket = trie.leaves.get(key);
+    const fullPath = trie.path ? `${trie.path}/${key}` : key;
+    const leaf = violationLeaf({
+      name: key,
+      kind: "lint-file",
+      file: fullPath,
+      rawFile: bucket.rawFile,
+      linterName,
+      violations: bucket.violations,
+      workDir: bucket.workDir
+    });
+    return ruleName ? { ...leaf, ruleName } : leaf;
+  });
+  return [...folders, ...files];
+}
+function fileLinterNodes(trie, linterMeta) {
+  const folders = sortedKeys(trie.folders).map((key) => {
+    const folder = trie.folders.get(key);
+    const node = container(folder.name, "lint-folder", fileLinterNodes(folder, linterMeta));
+    return { ...node, file: folder.path, target_path: folder.rawPath, work_dir: uniqueWorkDir(node.children) };
+  });
+  const files = sortedKeys(trie.leaves).map((key) => {
+    var _a;
+    const linters = trie.leaves.get(key);
+    const fullPath = trie.path ? `${trie.path}/${key}` : key;
+    const linterDrafts = sortedKeys(linters).map((linterName) => {
+      var _a2;
+      const { workDir, rules } = linters.get(linterName);
+      const ruleLeaves = sortedKeys(rules).map((rule) => {
+        var _a3;
+        const violations = rules.get(rule);
+        return {
+          ...violationLeaf({
+            name: rule,
+            kind: "lint-rule",
+            file: fullPath,
+            rawFile: ((_a3 = violations[0]) == null ? void 0 : _a3.raw_file) ?? fullPath,
+            linterName,
+            violations,
+            workDir
+          }),
+          ruleName: rule
+        };
+      });
+      return {
+        ...linterNode(linterName, linterMeta.get(linterName), ruleLeaves),
+        file: fullPath,
+        target_path: (_a2 = ruleLeaves[0]) == null ? void 0 : _a2.target_path,
+        work_dir: workDir
+      };
+    });
+    return {
+      ...container(key, "lint-file", linterDrafts),
+      file: fullPath,
+      target_path: (_a = linterDrafts[0]) == null ? void 0 : _a.target_path,
+      work_dir: uniqueWorkDir(linterDrafts)
+    };
+  });
+  return [...folders, ...files];
+}
+function fileTrieFor(flat) {
+  const trie = newTrie();
+  for (const f of flat) {
+    if (!f.file) continue;
+    trieLeaf(trie, f.file, f.rawFile ?? f.file, () => ({
+      rawFile: f.rawFile ?? f.file,
+      workDir: f.workDir,
+      violations: []
+    })).violations.push(f.v);
+  }
+  return trie;
+}
+function groupByLinterRuleFile(results, filters) {
+  const meta = linterMetaOf(results);
+  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);
+  return Array.from(byLinter.keys()).sort().map((linterName) => {
+    const byRule = groupBy(byLinter.get(linterName), (f) => ruleKeyFor(f.v));
+    const ruleNodes = Array.from(byRule.keys()).sort().map((rule) => {
+      var _a;
+      const flats = byRule.get(rule);
+      const children = fileNodes(fileTrieFor(flats), linterName, rule);
+      const node = container(rule, "lint-rule-group", children);
+      return withNoFileViolations(
+        {
+          ...node,
+          linterName,
+          ruleName: rule,
+          work_dir: uniqueWorkDir(children) ?? ((_a = meta.get(linterName)) == null ? void 0 : _a.work_dir)
+        },
+        flats.filter((f) => !f.file).map((f) => f.v)
+      );
+    });
+    return linterNode(linterName, meta.get(linterName), ruleNodes);
+  });
+}
+function groupByLinterFile(results, filters) {
+  const meta = linterMetaOf(results);
+  const byLinter = groupBy(flattenLint(results, filters), (f) => f.linter);
+  return Array.from(byLinter.keys()).sort().map((linterName) => {
+    const flats = byLinter.get(linterName);
+    return linterNode(
+      linterName,
+      meta.get(linterName),
+      fileNodes(fileTrieFor(flats), linterName),
+      flats.filter((f) => !f.file).map((f) => f.v)
+    );
+  });
+}
+function groupByFileLinterRule(results, filters) {
+  const meta = linterMetaOf(results);
+  const flat = flattenLint(results, filters);
+  const trie = newTrie();
+  for (const f of flat) {
+    if (!f.file) continue;
+    const linters = trieLeaf(trie, f.file, f.rawFile ?? f.file, () => /* @__PURE__ */ new Map());
+    let entry = linters.get(f.linter);
+    if (!entry) {
+      entry = { workDir: f.workDir, rules: /* @__PURE__ */ new Map() };
+      linters.set(f.linter, entry);
+    }
+    const rule = ruleKeyFor(f.v);
+    entry.rules.set(rule, [...entry.rules.get(rule) ?? [], f.v]);
+  }
+  const fileless = groupBy(flat.filter((f) => !f.file), (f) => f.linter);
+  const filelessNodes = Array.from(fileless.keys()).sort().map((linterName) => {
+    var _a;
+    const byRule = groupBy(fileless.get(linterName), (f) => ruleKeyFor(f.v));
+    const workDir = (_a = meta.get(linterName)) == null ? void 0 : _a.work_dir;
+    const leaves = Array.from(byRule.keys()).sort().map((rule) => ({
+      ...violationLeaf({
+        name: rule,
+        kind: "lint-rule",
+        file: "",
+        rawFile: "",
+        linterName,
+        violations: byRule.get(rule).map((f) => f.v),
+        workDir
+      }),
+      ruleName: rule,
+      file: void 0,
+      target_path: void 0
+    }));
+    return linterNode(linterName, meta.get(linterName), leaves);
+  });
+  return [...fileLinterNodes(trie, meta), ...filelessNodes];
+}
+function summaryFileLabel(file, violations) {
+  if (!file) return "(no file)";
+  if (violations.length > 1) return `${file} (${violations.length})`;
+  const v = violations[0];
+  if (v == null ? void 0 : v.line) return v.column ? `${file}:${v.line}:${v.column}` : `${file}:${v.line}`;
+  return file;
+}
+function summaryRuleNode(rule, linterName, flats) {
+  var _a;
+  const byFile = groupBy(flats, (f) => f.file ?? "");
+  const keys = Array.from(byFile.keys());
+  const files = keys.slice(0, SUMMARY_FILE_LIMIT).map((key) => {
+    const group = byFile.get(key);
+    return {
+      ...violationLeaf({
+        name: summaryFileLabel(group[0].file, group.map((f) => f.v)),
+        kind: "lint-file",
+        file: group[0].file ?? "",
+        rawFile: group[0].rawFile ?? "",
+        linterName,
+        violations: group.map((f) => f.v),
+        workDir: group[0].workDir
+      }),
+      file: group[0].file,
+      target_path: group[0].rawFile,
+      ruleName: rule
+    };
+  });
+  const remaining = keys.length - files.length;
+  if (remaining > 0) {
+    files.push({
+      name: `… ${remaining} more file${remaining === 1 ? "" : "s"}`,
+      kind: "lint-file",
+      linterName,
+      ruleName: rule,
+      failed: false,
+      passed: true,
+      skipped: false
+    });
+  }
+  const firstMessage = (_a = flats.find((f) => f.v.message)) == null ? void 0 : _a.v.message;
+  const name = firstMessage ? `${rule} (${flats.length}) — ${firstMessage}` : `${rule} (${flats.length})`;
+  return { ...container(name, "lint-rule-group", files), linterName, ruleName: rule };
+}
+function groupBySummary(results, filters) {
+  const meta = linterMetaOf(results);
+  const flatByLinter = groupBy(flattenLint(results, filters), (f) => f.linter);
+  const visible = results.filter((r) => filterState.matchesFilterState(r.linter, filters.linter));
+  const skipped = new Map(visible.filter((r) => r.skipped).map((r) => [r.linter, r.error || "skipped"]));
+  return Array.from(new Set(visible.map((r) => r.linter))).sort().map((linterName) => {
+    const flats = flatByLinter.get(linterName) ?? [];
+    if (flats.length === 0 && skipped.has(linterName)) {
+      return {
+        name: linterName,
+        kind: "linter",
+        linter: meta.get(linterName),
+        linterName,
+        skipped: true,
+        passed: false,
+        failed: false,
+        message: `skipped: ${skipped.get(linterName)}`
+      };
+    }
+    const byRule = groupBy(flats, (f) => ruleKeyFor(f.v));
+    const ruleOrder = Array.from(byRule.keys()).sort(
+      (a, b) => byRule.get(b).length - byRule.get(a).length || a.localeCompare(b)
+    );
+    return linterNode(
+      linterName,
+      meta.get(linterName),
+      ruleOrder.map((rule) => summaryRuleNode(rule, linterName, byRule.get(rule)))
+    );
+  });
+}
+function withLinterErrors(roots, results, filters) {
+  const errors = groupBy(
+    results.filter((r) => stats.isLinterErrored(r) && filterState.matchesFilterState(r.linter, filters.linter)),
+    (r) => r.linter
+  );
+  if (errors.size === 0) return roots;
+  const linters = new Map(roots.filter((n) => n.kind === "linter").map((n) => [n.name, n]));
+  for (const [name, failed] of errors) {
+    const errorNodes = failed.map(linterErrorNode);
+    const existing = linters.get(name);
+    linters.set(
+      name,
+      existing ? { ...existing, children: [...errorNodes, ...existing.children ?? []], failed: true, passed: false } : linterNode(name, failed[0], errorNodes)
+    );
+  }
+  const others = roots.filter((n) => n.kind !== "linter");
+  return [...others, ...sortedKeys(linters).map((name) => linters.get(name))];
+}
+function joinChainNames(parent, child) {
+  const p = parent.trim();
+  const c = child.trim();
+  return p && c ? `${p} > ${c}` : p || c;
+}
+function collapseFolderChains(nodes) {
+  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 [child] = children;
+      return { ...child, name: joinChainNames(node.name, child.name) };
+    }
+    return { ...node, children };
+  });
+}
+function annotateRoutePaths(nodes, parentSegments = []) {
+  const slugs = nodes.map((n) => routePath.slugify(n.name));
+  const totals = groupBy(slugs, (s) => s);
+  const seen = /* @__PURE__ */ new Map();
+  return nodes.map((node, i) => {
+    const slug = slugs[i];
+    const ordinal = (seen.get(slug) ?? 0) + 1;
+    seen.set(slug, ordinal);
+    const segment = totals.get(slug).length > 1 ? `${slug}~${ordinal}` : slug;
+    const segments = [...parentSegments, segment];
+    const { children, ...rest } = node;
+    return {
+      ...rest,
+      route_path: segments.join("/"),
+      ...children ? { children: annotateRoutePaths(children, segments) } : {}
+    };
+  });
+}
+const GROUPERS = {
+  "linter-rule-file": groupByLinterRuleFile,
+  "linter-file": groupByLinterFile,
+  "file-linter-rule": groupByFileLinterRule,
+  summary: groupBySummary
+};
+function buildLintTree({
+  results,
+  grouping,
+  filters
+}) {
+  const grouped = withLinterErrors(GROUPERS[grouping](results, filters), results, filters);
+  return annotateRoutePaths(grouping === "summary" ? grouped : collapseFolderChains(grouped));
+}
+function findLintNode(nodes, path) {
+  if (!path) return null;
+  for (const node of nodes) {
+    if (node.route_path === path) return node;
+    const found = node.children ? findLintNode(node.children, path) : null;
+    if (found) return found;
+  }
+  return null;
+}
+exports.buildLintTree = buildLintTree;
+exports.findLintNode = findLintNode;
+//# sourceMappingURL=grouping.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"grouping.cjs","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"],"names":["matchesFilterState","normalizeLintPath","severityOf","relPath","decorateLintFile","collapsedPathSegments","worstSeverity","linterErrorMessage","_a","isLinterErrored","slugify"],"mappings":";;;;;;AA2CA,MAAM,UAAU;AAChB,MAAM,qBAAqB;AAE3B,SAAS,WAAW,GAAsB;;AACxC,WAAO,OAAE,SAAF,mBAAQ,WAAU;AAC3B;AAEA,SAAS,OAAO,YAA+C;AAC7D,SAAO,WAAW,MAAA,EAAQ,KAAK,CAAC,GAAG,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ,EAAE;AACxE;AAEA,SAAS,UAAU,GAAmB;AACpC,QAAM,MAAM,EAAE,QAAQ,IAAI;AAC1B,SAAO,QAAQ,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AACxC;AAEA,SAAS,QAAc,OAAqB,KAAkC;AAC5E,QAAM,0BAAU,IAAA;AAChB,aAAW,QAAQ,OAAO;AACxB,UAAM,OAAO,IAAI,IAAI,IAAI,IAAI,CAAC;AAC9B,QAAI,KAAM,MAAK,KAAK,IAAI;AAAA,aACf,IAAI,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;AAAA,EAChC;AACA,SAAO;AACT;AAEA,SAAS,WAAc,KAA+B;AACpD,SAAO,MAAM,KAAK,IAAI,KAAA,CAAM,EAAE,KAAA;AAChC;AAKA,SAAS,YAAY,SAAkC,SAAuC;AAC5F,QAAM,UAAU,QAAQ,OAAO,CAAC,MAAMA,+BAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;AAClF,QAAM,YAAY,IAAI,IAAI,QAAQ,QAAQ,CAAC,MAAO,EAAE,WAAW,CAACC,MAAAA,kBAAkB,EAAE,QAAQ,CAAC,IAAI,CAAA,CAAG,CAAC,EAAE,OAAO;AAC9G,QAAM,MAAuB,CAAA;AAC7B,aAAW,UAAU,SAAS;AAC5B,eAAW,KAAK,OAAO,cAAc,CAAA,GAAI;AACvC,UAAI,CAACD,YAAAA,mBAAmBE,MAAAA,WAAW,CAAC,GAAG,QAAQ,QAAQ,EAAG;AAC1D,YAAM,UAAUC,MAAAA,QAAQ,EAAE,MAAM,OAAO,QAAQ;AAC/C,YAAM,OAAOC,MAAAA,iBAAiB,SAAS,OAAO,UAAU,SAAS;AACjE,UAAI,KAAK;AAAA,QACP,QAAQ,OAAO;AAAA,QACf;AAAA,QACA,GAAG,EAAE,GAAG,GAAG,UAAU,SAAS,KAAA;AAAA,QAC9B;AAAA,QACA;AAAA,QACA,SAAS,OAAO;AAAA,MAAA,CACjB;AAAA,IACH;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,aAAa,SAA6D;AACjF,QAAM,2BAAW,IAAA;AACjB,aAAW,KAAK,QAAS,KAAI,CAAC,KAAK,IAAI,EAAE,MAAM,EAAG,MAAK,IAAI,EAAE,QAAQ,CAAC;AACtE,SAAO;AACT;AAKA,SAAS,UAAsB;AAC7B,SAAO,EAAE,MAAM,IAAI,MAAM,QAAW,SAAS,IAAI,SAAS,oBAAI,IAAA,GAAO,QAAQ,oBAAI,MAAI;AACvF;AAGA,SAAS,SAAY,MAAe,MAAc,SAAiB,QAAoB;AACrF,QAAM,WAAWC,MAAAA,sBAAsB,IAAI;AAC3C,QAAM,cAAcA,MAAAA,sBAAsB,OAAO;AACjD,MAAI,SAAS,WAAW,KAAK,YAAY,WAAW,GAAG;AACrD,UAAM,IAAI,MAAM,kDAAkD,KAAK,UAAU,IAAI,CAAC,SAAS,KAAK,UAAU,OAAO,CAAC,GAAG;AAAA,EAC3H;AACA,QAAM,iBAAiB,SAAS,MAAM,GAAG,EAAE;AAC3C,QAAM,oBAAoB,YAAY,MAAM,GAAG,EAAE;AAGjD,QAAM,YAAY,eAAe,SAAS,kBAAkB;AAC5D,MAAI,UAAU;AACd,iBAAe,QAAQ,CAAC,SAAS,MAAM;AACrC,QAAI,QAAQ,QAAQ,QAAQ,IAAI,OAAO;AACvC,QAAI,CAAC,OAAO;AACV,YAAM,WAAW,KAAK,IAAI,GAAG,KAAK,IAAI,kBAAkB,QAAQ,IAAI,IAAI,SAAS,CAAC;AAClF,cAAQ;AAAA,QACN,MAAM;AAAA,QACN,MAAM,QAAQ,OAAO,GAAG,QAAQ,IAAI,IAAI,OAAO,KAAK;AAAA,QACpD,SAAS,kBAAkB,MAAM,GAAG,QAAQ,EAAE,KAAK,GAAG;AAAA,QACtD,6BAAa,IAAA;AAAA,QACb,4BAAY,IAAA;AAAA,MAAI;AAElB,cAAQ,QAAQ,IAAI,SAAS,KAAK;AAAA,IACpC;AACA,cAAU;AAAA,EACZ,CAAC;AACD,QAAM,WAAW,SAAS,SAAS,SAAS,CAAC;AAC7C,MAAI,OAAO,QAAQ,OAAO,IAAI,QAAQ;AACtC,MAAI,CAAC,MAAM;AACT,WAAO,OAAA;AACP,YAAQ,OAAO,IAAI,UAAU,IAAI;AAAA,EACnC;AACA,SAAO;AACT;AAKA,SAAS,UAAU,MAAc,MAAqB,UAA0B;AAC9E,QAAM,SAAS,SAAS,KAAK,CAAC,MAAM,EAAE,MAAM;AAC5C,SAAO,EAAE,MAAM,MAAM,UAAU,QAAQ,QAAQ,CAAC,QAAQ,SAAS,MAAA;AACnE;AAEA,SAAS,cAAc,UAAgD;AACrE,QAAM,OAAO,IAAI,IAAI,SAAS,QAAQ,CAAC,MAAO,EAAE,WAAW,CAAC,EAAE,QAAQ,IAAI,CAAA,CAAG,CAAC;AAC9E,SAAO,KAAK,SAAS,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC,IAAI;AACjD;AAEA,SAAS,qBAAqB,MAAa,QAAqC;AAC9E,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,SAAS,KAAK,UAAUC,MAAAA,cAAc,MAAM,MAAM;AACxD,SAAO,EAAE,GAAG,MAAM,kBAAkB,OAAO,MAAM,GAAG,QAAQ,QAAQ,CAAC,OAAA;AACvE;AAEA,SAAS,cAAc,MAQb;AACR,QAAM,SAASA,MAAAA,cAAc,KAAK,UAAU,MAAM;AAClD,SAAO;AAAA,IACL,MAAM,KAAK;AAAA,IACX,MAAM,KAAK;AAAA,IACX,MAAM,KAAK;AAAA,IACX,aAAa,KAAK;AAAA,IAClB,UAAU,KAAK;AAAA,IACf,YAAY,KAAK;AAAA,IACjB,YAAY,OAAO,KAAK,UAAU;AAAA,IAClC;AAAA,IACA,QAAQ,CAAC;AAAA,IACT,SAAS;AAAA,EAAA;AAEb;AAEA,SAAS,WACP,YACA,QACA,UACA,SAA+B,CAAA,GACxB;AACP,SAAO,qBAAqB,EAAE,GAAG,UAAU,YAAY,UAAU,QAAQ,GAAG,QAAQ,QAAQ,WAAA,GAAc,MAAM;AAClH;AAEA,SAAS,gBAAgB,QAA6B;AACpD,QAAM,UAAUC,MAAAA,mBAAmB,MAAM;AACzC,SAAO;AAAA,IACL,MAAM,UAAU,OAAO;AAAA,IACvB,MAAM;AAAA,IACN,YAAY,OAAO;AAAA,IACnB,QAAQ;AAAA,IACR,UAAU,OAAO;AAAA,IACjB,QAAQ;AAAA,IACR,QAAQ;AAAA,IACR,SAAS;AAAA,IACT;AAAA,EAAA;AAEJ;AAEA,SAAS,UAAU,MAAwB,YAAoB,UAA4B;AACzF,QAAM,UAAU,WAAW,KAAK,OAAO,EAAE,IAAI,CAAC,QAAQ;AACpD,UAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;AACnC,UAAM,OAAO,UAAU,OAAO,MAAM,eAAe,UAAU,QAAQ,YAAY,QAAQ,CAAC;AAC1F,WAAO;AAAA,MACL,GAAG;AAAA,MACH,MAAM,OAAO;AAAA,MACb,aAAa,OAAO;AAAA,MACpB;AAAA,MACA,GAAI,WAAW,EAAE,SAAA,IAAa,CAAA;AAAA,MAC9B,UAAU,cAAc,KAAK,QAAS;AAAA,IAAA;AAAA,EAE1C,CAAC;AACD,QAAM,QAAQ,WAAW,KAAK,MAAM,EAAE,IAAI,CAAC,QAAQ;AACjD,UAAM,SAAS,KAAK,OAAO,IAAI,GAAG;AAClC,UAAM,WAAW,KAAK,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK;AACrD,UAAM,OAAO,cAAc;AAAA,MACzB,MAAM;AAAA,MACN,MAAM;AAAA,MACN,MAAM;AAAA,MACN,SAAS,OAAO;AAAA,MAChB;AAAA,MACA,YAAY,OAAO;AAAA,MACnB,SAAS,OAAO;AAAA,IAAA,CACjB;AACD,WAAO,WAAW,EAAE,GAAG,MAAM,aAAa;AAAA,EAC5C,CAAC;AACD,SAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAIA,SAAS,gBAAgB,MAAyB,YAAgD;AAChG,QAAM,UAAU,WAAW,KAAK,OAAO,EAAE,IAAI,CAAC,QAAQ;AACpD,UAAM,SAAS,KAAK,QAAQ,IAAI,GAAG;AACnC,UAAM,OAAO,UAAU,OAAO,MAAM,eAAe,gBAAgB,QAAQ,UAAU,CAAC;AACtF,WAAO,EAAE,GAAG,MAAM,MAAM,OAAO,MAAM,aAAa,OAAO,SAAS,UAAU,cAAc,KAAK,QAAS,EAAA;AAAA,EAC1G,CAAC;AACD,QAAM,QAAQ,WAAW,KAAK,MAAM,EAAE,IAAI,CAAC,QAAQ;;AACjD,UAAM,UAAU,KAAK,OAAO,IAAI,GAAG;AACnC,UAAM,WAAW,KAAK,OAAO,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK;AACrD,UAAM,eAAe,WAAW,OAAO,EAAE,IAAI,CAAC,eAAe;;AAC3D,YAAM,EAAE,SAAS,MAAA,IAAU,QAAQ,IAAI,UAAU;AACjD,YAAM,aAAa,WAAW,KAAK,EAAE,IAAI,CAAC,SAAS;;AACjD,cAAM,aAAa,MAAM,IAAI,IAAI;AACjC,eAAO;AAAA,UACL,GAAG,cAAc;AAAA,YACf,MAAM;AAAA,YACN,MAAM;AAAA,YACN,MAAM;AAAA,YACN,WAASC,MAAA,WAAW,CAAC,MAAZ,gBAAAA,IAAe,aAAY;AAAA,YACpC;AAAA,YACA;AAAA,YACA;AAAA,UAAA,CACD;AAAA,UACD,UAAU;AAAA,QAAA;AAAA,MAEd,CAAC;AACD,aAAO;AAAA,QACL,GAAG,WAAW,YAAY,WAAW,IAAI,UAAU,GAAG,UAAU;AAAA,QAChE,MAAM;AAAA,QACN,cAAaA,MAAA,WAAW,CAAC,MAAZ,gBAAAA,IAAe;AAAA,QAC5B,UAAU;AAAA,MAAA;AAAA,IAEd,CAAC;AACD,WAAO;AAAA,MACL,GAAG,UAAU,KAAK,aAAa,YAAY;AAAA,MAC3C,MAAM;AAAA,MACN,cAAa,kBAAa,CAAC,MAAd,mBAAiB;AAAA,MAC9B,UAAU,cAAc,YAAY;AAAA,IAAA;AAAA,EAExC,CAAC;AACD,SAAO,CAAC,GAAG,SAAS,GAAG,KAAK;AAC9B;AAKA,SAAS,YAAY,MAAkD;AACrE,QAAM,OAAO,QAAA;AACb,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,EAAE,KAAM;AACb,aAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,OAAO;AAAA,MACjD,SAAS,EAAE,WAAW,EAAE;AAAA,MACxB,SAAS,EAAE;AAAA,MACX,YAAY,CAAA;AAAA,IAAC,EACb,EAAE,WAAW,KAAK,EAAE,CAAC;AAAA,EACzB;AACA,SAAO;AACT;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;AAC9F,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM;AACvE,SAAO,MAAM,KAAK,SAAS,KAAA,CAAM,EAC9B,KAAA,EACA,IAAI,CAAC,eAAe;AACnB,UAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,GAAI,CAAC,MAAM,WAAW,EAAE,CAAC,CAAC;AACxE,UAAM,YAAY,MAAM,KAAK,OAAO,MAAM,EACvC,KAAA,EACA,IAAI,CAAC,SAAS;;AACb,YAAM,QAAQ,OAAO,IAAI,IAAI;AAC7B,YAAM,WAAW,UAAU,YAAY,KAAK,GAAG,YAAY,IAAI;AAC/D,YAAM,OAAO,UAAU,MAAM,mBAAmB,QAAQ;AACxD,aAAO;AAAA,QACL;AAAA,UACE,GAAG;AAAA,UACH;AAAA,UACA,UAAU;AAAA,UACV,UAAU,cAAc,QAAQ,OAAK,UAAK,IAAI,UAAU,MAAnB,mBAAsB;AAAA,QAAA;AAAA,QAE7D,MAAM,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;AAAA,MAAA;AAAA,IAE/C,CAAC;AACH,WAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,SAAS;AAAA,EAC/D,CAAC;AACL;AAEA,SAAS,kBAAkB,SAAkC,SAA+B;AAC1F,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,WAAW,QAAQ,YAAY,SAAS,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM;AACvE,SAAO,MAAM,KAAK,SAAS,KAAA,CAAM,EAC9B,KAAA,EACA,IAAI,CAAC,eAAe;AACnB,UAAM,QAAQ,SAAS,IAAI,UAAU;AACrC,WAAO;AAAA,MACL;AAAA,MACA,KAAK,IAAI,UAAU;AAAA,MACnB,UAAU,YAAY,KAAK,GAAG,UAAU;AAAA,MACxC,MAAM,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;AAAA,IAAA;AAAA,EAE/C,CAAC;AACL;AAEA,SAAS,sBAAsB,SAAkC,SAA+B;AAC9F,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,OAAO,YAAY,SAAS,OAAO;AACzC,QAAM,OAAO,QAAA;AACb,aAAW,KAAK,MAAM;AACpB,QAAI,CAAC,EAAE,KAAM;AACb,UAAM,UAAU,SAAS,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,MAAM,oBAAI,IAAA,CAAK;AAC3E,QAAI,QAAQ,QAAQ,IAAI,EAAE,MAAM;AAChC,QAAI,CAAC,OAAO;AACV,cAAQ,EAAE,SAAS,EAAE,SAAS,OAAO,oBAAI,MAAI;AAC7C,cAAQ,IAAI,EAAE,QAAQ,KAAK;AAAA,IAC7B;AACA,UAAM,OAAO,WAAW,EAAE,CAAC;AAC3B,UAAM,MAAM,IAAI,MAAM,CAAC,GAAI,MAAM,MAAM,IAAI,IAAI,KAAK,CAAA,GAAK,EAAE,CAAC,CAAC;AAAA,EAC/D;AAEA,QAAM,WAAW,QAAQ,KAAK,OAAO,CAAC,MAAM,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM;AACrE,QAAM,gBAAgB,MAAM,KAAK,SAAS,MAAM,EAC7C,KAAA,EACA,IAAI,CAAC,eAAe;;AACnB,UAAM,SAAS,QAAQ,SAAS,IAAI,UAAU,GAAI,CAAC,MAAM,WAAW,EAAE,CAAC,CAAC;AACxE,UAAM,WAAU,UAAK,IAAI,UAAU,MAAnB,mBAAsB;AACtC,UAAM,SAAS,MAAM,KAAK,OAAO,MAAM,EACpC,KAAA,EACA,IAAI,CAAC,UAAU;AAAA,MACd,GAAG,cAAc;AAAA,QACf,MAAM;AAAA,QACN,MAAM;AAAA,QACN,MAAM;AAAA,QACN,SAAS;AAAA,QACT;AAAA,QACA,YAAY,OAAO,IAAI,IAAI,EAAG,IAAI,CAAC,MAAM,EAAE,CAAC;AAAA,QAC5C;AAAA,MAAA,CACD;AAAA,MACD,UAAU;AAAA,MACV,MAAM;AAAA,MACN,aAAa;AAAA,IAAA,EACb;AACJ,WAAO,WAAW,YAAY,KAAK,IAAI,UAAU,GAAG,MAAM;AAAA,EAC5D,CAAC;AAEH,SAAO,CAAC,GAAG,gBAAgB,MAAM,IAAI,GAAG,GAAG,aAAa;AAC1D;AAEA,SAAS,iBAAiB,MAA0B,YAA0C;AAC5F,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,WAAW,SAAS,EAAG,QAAO,GAAG,IAAI,KAAK,WAAW,MAAM;AAC/D,QAAM,IAAI,WAAW,CAAC;AACtB,MAAI,uBAAG,KAAM,QAAO,EAAE,SAAS,GAAG,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,IAAI;AAClF,SAAO;AACT;AAEA,SAAS,gBAAgB,MAAc,YAAoB,OAAwC;;AACjG,QAAM,SAAS,QAAQ,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE;AACjD,QAAM,OAAO,MAAM,KAAK,OAAO,MAAM;AACrC,QAAM,QAAiB,KAAK,MAAM,GAAG,kBAAkB,EAAE,IAAI,CAAC,QAAQ;AACpE,UAAM,QAAQ,OAAO,IAAI,GAAG;AAC5B,WAAO;AAAA,MACL,GAAG,cAAc;AAAA,QACf,MAAM,iBAAiB,MAAM,CAAC,EAAG,MAAM,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;AAAA,QAC5D,MAAM;AAAA,QACN,MAAM,MAAM,CAAC,EAAG,QAAQ;AAAA,QACxB,SAAS,MAAM,CAAC,EAAG,WAAW;AAAA,QAC9B;AAAA,QACA,YAAY,MAAM,IAAI,CAAC,MAAM,EAAE,CAAC;AAAA,QAChC,SAAS,MAAM,CAAC,EAAG;AAAA,MAAA,CACpB;AAAA,MACD,MAAM,MAAM,CAAC,EAAG;AAAA,MAChB,aAAa,MAAM,CAAC,EAAG;AAAA,MACvB,UAAU;AAAA,IAAA;AAAA,EAEd,CAAC;AACD,QAAM,YAAY,KAAK,SAAS,MAAM;AACtC,MAAI,YAAY,GAAG;AACjB,UAAM,KAAK;AAAA,MACT,MAAM,KAAK,SAAS,aAAa,cAAc,IAAI,KAAK,GAAG;AAAA,MAC3D,MAAM;AAAA,MACN;AAAA,MACA,UAAU;AAAA,MACV,QAAQ;AAAA,MACR,QAAQ;AAAA,MACR,SAAS;AAAA,IAAA,CACV;AAAA,EACH;AACA,QAAM,gBAAe,WAAM,KAAK,CAAC,MAAM,EAAE,EAAE,OAAO,MAA7B,mBAAgC,EAAE;AACvD,QAAM,OAAO,eAAe,GAAG,IAAI,KAAK,MAAM,MAAM,OAAO,YAAY,KAAK,GAAG,IAAI,KAAK,MAAM,MAAM;AACpG,SAAO,EAAE,GAAG,UAAU,MAAM,mBAAmB,KAAK,GAAG,YAAY,UAAU,KAAA;AAC/E;AAEA,SAAS,eAAe,SAAkC,SAA+B;AACvF,QAAM,OAAO,aAAa,OAAO;AACjC,QAAM,eAAe,QAAQ,YAAY,SAAS,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM;AAC3E,QAAM,UAAU,QAAQ,OAAO,CAAC,MAAMR,+BAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;AAClF,QAAM,UAAU,IAAI,IAAI,QAAQ,OAAO,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,SAAS,SAAS,CAAC,CAAC;AAErG,SAAO,MAAM,KAAK,IAAI,IAAI,QAAQ,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EACpD,OACA,IAAI,CAAC,eAAe;AACnB,UAAM,QAAQ,aAAa,IAAI,UAAU,KAAK,CAAA;AAC9C,QAAI,MAAM,WAAW,KAAK,QAAQ,IAAI,UAAU,GAAG;AACjD,aAAO;AAAA,QACL,MAAM;AAAA,QACN,MAAM;AAAA,QACN,QAAQ,KAAK,IAAI,UAAU;AAAA,QAC3B;AAAA,QACA,SAAS;AAAA,QACT,QAAQ;AAAA,QACR,QAAQ;AAAA,QACR,SAAS,YAAY,QAAQ,IAAI,UAAU,CAAC;AAAA,MAAA;AAAA,IAEhD;AACA,UAAM,SAAS,QAAQ,OAAO,CAAC,MAAM,WAAW,EAAE,CAAC,CAAC;AACpD,UAAM,YAAY,MAAM,KAAK,OAAO,KAAA,CAAM,EAAE;AAAA,MAC1C,CAAC,GAAG,MAAM,OAAO,IAAI,CAAC,EAAG,SAAS,OAAO,IAAI,CAAC,EAAG,UAAU,EAAE,cAAc,CAAC;AAAA,IAAA;AAE9E,WAAO;AAAA,MACL;AAAA,MACA,KAAK,IAAI,UAAU;AAAA,MACnB,UAAU,IAAI,CAAC,SAAS,gBAAgB,MAAM,YAAY,OAAO,IAAI,IAAI,CAAE,CAAC;AAAA,IAAA;AAAA,EAEhF,CAAC;AACL;AAGA,SAAS,iBAAiB,OAAgB,SAAkC,SAA+B;AACzG,QAAM,SAAS;AAAA,IACb,QAAQ,OAAO,CAAC,MAAMS,MAAAA,gBAAgB,CAAC,KAAKT,YAAAA,mBAAmB,EAAE,QAAQ,QAAQ,MAAM,CAAC;AAAA,IACxF,CAAC,MAAM,EAAE;AAAA,EAAA;AAEX,MAAI,OAAO,SAAS,EAAG,QAAO;AAC9B,QAAM,UAAU,IAAI,IAAI,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AACxF,aAAW,CAAC,MAAM,MAAM,KAAK,QAAQ;AACnC,UAAM,aAAa,OAAO,IAAI,eAAe;AAC7C,UAAM,WAAW,QAAQ,IAAI,IAAI;AACjC,YAAQ;AAAA,MACN;AAAA,MACA,WACI,EAAE,GAAG,UAAU,UAAU,CAAC,GAAG,YAAY,GAAI,SAAS,YAAY,CAAA,CAAG,GAAG,QAAQ,MAAM,QAAQ,MAAA,IAC9F,WAAW,MAAM,OAAO,CAAC,GAAG,UAAU;AAAA,IAAA;AAAA,EAE9C;AACA,QAAM,SAAS,MAAM,OAAO,CAAC,MAAM,EAAE,SAAS,QAAQ;AACtD,SAAO,CAAC,GAAG,QAAQ,GAAG,WAAW,OAAO,EAAE,IAAI,CAAC,SAAS,QAAQ,IAAI,IAAI,CAAE,CAAC;AAC7E;AAKA,SAAS,eAAe,QAAgB,OAAuB;AAC7D,QAAM,IAAI,OAAO,KAAA;AACjB,QAAM,IAAI,MAAM,KAAA;AAChB,SAAO,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK;AACvC;AAGA,SAAS,qBAAqB,OAAyB;AACrD,SAAO,MAAM,IAAI,CAAC,SAAS;AACzB,QAAI,CAAC,KAAK,YAAY,KAAK,SAAS,WAAW,EAAG,QAAO;AACzD,UAAM,WAAW,qBAAqB,KAAK,QAAQ;AACnD,QAAI,SAAS,WAAW,KAAK,KAAK,SAAS,eAAe;AACxD,YAAM,CAAC,KAAK,IAAI;AAChB,aAAO,EAAE,GAAG,OAAQ,MAAM,eAAe,KAAK,MAAM,MAAO,IAAI,EAAA;AAAA,IACjE;AACA,WAAO,EAAE,GAAG,MAAM,SAAA;AAAA,EACpB,CAAC;AACH;AAGA,SAAS,mBAAmB,OAAgB,iBAA2B,IAAgB;AACrF,QAAM,QAAQ,MAAM,IAAI,CAAC,MAAMU,kBAAQ,EAAE,IAAI,CAAC;AAC9C,QAAM,SAAS,QAAQ,OAAO,CAAC,MAAM,CAAC;AACtC,QAAM,2BAAW,IAAA;AACjB,SAAO,MAAM,IAAI,CAAC,MAAM,MAAM;AAC5B,UAAM,OAAO,MAAM,CAAC;AACpB,UAAM,WAAW,KAAK,IAAI,IAAI,KAAK,KAAK;AACxC,SAAK,IAAI,MAAM,OAAO;AACtB,UAAM,UAAU,OAAO,IAAI,IAAI,EAAG,SAAS,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK;AACtE,UAAM,WAAW,CAAC,GAAG,gBAAgB,OAAO;AAC5C,UAAM,EAAE,UAAU,GAAG,KAAA,IAAS;AAC9B,WAAO;AAAA,MACL,GAAG;AAAA,MACH,YAAY,SAAS,KAAK,GAAG;AAAA,MAC7B,GAAI,WAAW,EAAE,UAAU,mBAAmB,UAAU,QAAQ,MAAM,CAAA;AAAA,IAAC;AAAA,EAE3E,CAAC;AACH;AAEA,MAAM,WAAsG;AAAA,EAC1G,oBAAoB;AAAA,EACpB,eAAe;AAAA,EACf,oBAAoB;AAAA,EACpB,SAAS;AACX;AAGO,SAAS,cAAc;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AACF,GAIe;AACb,QAAM,UAAU,iBAAiB,SAAS,QAAQ,EAAE,SAAS,OAAO,GAAG,SAAS,OAAO;AAEvF,SAAO,mBAAmB,aAAa,YAAY,UAAU,qBAAqB,OAAO,CAAC;AAC5F;AAGO,SAAS,aAAa,OAA4B,MAA+B;AACtF,MAAI,CAAC,KAAM,QAAO;AAClB,aAAW,QAAQ,OAAO;AACxB,QAAI,KAAK,eAAe,KAAM,QAAO;AACrC,UAAM,QAAQ,KAAK,WAAW,aAAa,KAAK,UAAU,IAAI,IAAI;AAClE,QAAI,MAAO,QAAO;AAAA,EACpB;AACA,SAAO;AACT;;;"}

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

@@ -0,0 +1,10 @@
+import { LintFilters, LintGrouping, LintNode, LinterResult } from './types.js';
+/** The tree for one grouping: filtered, with failed linters shown, ready for `Tree`. */
+export declare function buildLintTree({ results, grouping, filters, }: {
+    results: readonly LinterResult[];
+    grouping: LintGrouping;
+    filters: LintFilters;
+}): LintNode[];
+/** Depth-first lookup of the node whose route_path equals `path`, or null. */
+export declare function findLintNode(nodes: readonly LintNode[], path: string): LintNode | null;
+//# sourceMappingURL=grouping.d.ts.map

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

@@ -0,0 +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"}