@flanksource/clicky-ui 0.2.12 → 0.2.14

package/dist/data/test-runner/status.cjs

@@ -0,0 +1,234 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const filterState = require("./filterState.cjs");
+const UiHourglass = require("../../icons/components/UiHourglass.cjs");
+const UiLoader = require("../../icons/components/UiLoader.cjs");
+const UiPause = require("../../icons/components/UiPause.cjs");
+const UiError = require("../../icons/components/UiError.cjs");
+const UiWarningTriangle = require("../../icons/components/UiWarningTriangle.cjs");
+const UiPass = require("../../icons/components/UiPass.cjs");
+const UiClass = require("../../icons/components/UiClass.cjs");
+const emptyCounts = () => ({
+  total: 0,
+  passed: 0,
+  failed: 0,
+  warned: 0,
+  skipped: 0,
+  pending: 0,
+  running: 0,
+  timedout: 0
+});
+const addCounts = (r, s) => {
+  r.total += s.total;
+  r.passed += s.passed;
+  r.failed += s.failed;
+  r.warned += s.warned;
+  r.skipped += s.skipped;
+  r.pending += s.pending;
+  r.running += s.running;
+  r.timedout += s.timedout;
+};
+const countsFromSummary = (summary) => ({
+  total: summary.Total,
+  passed: summary.Passed,
+  failed: summary.Failed,
+  warned: summary.Warned || 0,
+  skipped: summary.Skipped,
+  pending: summary.Pending || 0,
+  running: summary.Running || 0,
+  timedout: 0
+});
+const countsFromLeaf = (t) => {
+  const isTimedOut = !!t.timed_out;
+  const counted = isTimedOut || t.passed || t.failed || t.warned || t.skipped || t.pending || t.running;
+  return {
+    total: counted ? 1 : 0,
+    passed: !isTimedOut && t.passed ? 1 : 0,
+    failed: !isTimedOut && t.failed ? 1 : 0,
+    warned: !isTimedOut && t.warned ? 1 : 0,
+    skipped: !isTimedOut && t.skipped ? 1 : 0,
+    pending: !isTimedOut && t.pending ? 1 : 0,
+    running: !isTimedOut && t.running ? 1 : 0,
+    timedout: isTimedOut ? 1 : 0
+  };
+};
+function sum(t) {
+  if (t.summary) return countsFromSummary(t.summary);
+  if (!t.children || t.children.length === 0) return countsFromLeaf(t);
+  const r = emptyCounts();
+  for (const c of t.children) addCounts(r, sum(c));
+  return r;
+}
+function sumNonTaskTests(t) {
+  if (t.framework === "task") {
+    const r2 = emptyCounts();
+    for (const c of t.children || []) addCounts(r2, sumNonTaskTests(c));
+    return r2;
+  }
+  if (t.summary) return countsFromSummary(t.summary);
+  if (!t.children || t.children.length === 0) return countsFromLeaf(t);
+  const r = emptyCounts();
+  for (const c of t.children) addCounts(r, sumNonTaskTests(c));
+  return r;
+}
+function hasFailed(t) {
+  if (t.failed) return true;
+  return (t.children || []).some(hasFailed);
+}
+function hasPending(t) {
+  if (t.pending) return true;
+  return (t.children || []).some(hasPending);
+}
+function hasTimedOutDescendant(t) {
+  if (t.timed_out) return true;
+  return (t.children || []).some(hasTimedOutDescendant);
+}
+function totalDuration(t) {
+  if (t.duration && t.duration > 0) return t.duration;
+  let d = 0;
+  for (const c of t.children || []) d += totalDuration(c);
+  return d;
+}
+function testStatus(t) {
+  if (t.timed_out) return "timedout";
+  if (t.running) return "running";
+  if (t.pending) return "pending";
+  if (t.failed) return "failed";
+  if (t.warned) return "warned";
+  if (t.skipped) return "skipped";
+  if (t.passed) return "passed";
+  return null;
+}
+function statusIconFor(t) {
+  if (t.timed_out) return UiHourglass.UiHourglass;
+  if (t.running) return UiLoader.UiLoader;
+  if (t.pending) return UiPause.UiPause;
+  if (t.failed) return UiError.UiError;
+  if (t.warned) return UiWarningTriangle.UiWarningTriangle;
+  if (t.skipped) return UiPause.UiPause;
+  if (t.passed) return UiPass.UiPass;
+  if (t.children && t.children.length > 0) {
+    const s = sum(t);
+    if (hasTimedOutDescendant(t)) return UiHourglass.UiHourglass;
+    if (s.failed > 0) return UiError.UiError;
+    if (s.warned > 0) return UiWarningTriangle.UiWarningTriangle;
+    if (s.running > 0) return UiLoader.UiLoader;
+    if (s.pending > 0) return UiPause.UiPause;
+    return UiPass.UiPass;
+  }
+  return UiClass.UiClass;
+}
+function statusToneFor(t) {
+  if (t.timed_out) return "warning";
+  if (t.running) return "info";
+  if (t.pending) return "neutral";
+  if (t.failed) return "danger";
+  if (t.warned) return "warning";
+  if (t.skipped) return "warning";
+  if (t.passed) return "success";
+  if (t.children && t.children.length > 0) {
+    const s = sum(t);
+    if (hasTimedOutDescendant(t)) return "warning";
+    if (s.failed > 0) return "danger";
+    if (s.warned > 0) return "warning";
+    if (s.running > 0) return "info";
+    if (s.pending > 0) return "neutral";
+    return "success";
+  }
+  return "neutral";
+}
+function formatTestDuration(ns) {
+  if (ns <= 0) return "";
+  const ms = ns / 1e6;
+  if (ms < 1e3) return `${ms.toFixed(0)}ms`;
+  return `${(ms / 1e3).toFixed(1)}s`;
+}
+function compactWithUnit(value, unit) {
+  const rounded = Math.abs(value) >= 10 ? Math.round(value).toString() : value.toFixed(1).replace(/\.0$/, "");
+  return `${rounded}${unit}`;
+}
+function formatCount(n) {
+  const abs = Math.abs(n);
+  if (abs < 1e3) return String(n);
+  if (abs < 1e6) return compactWithUnit(n / 1e3, "k");
+  return compactWithUnit(n / 1e6, "M");
+}
+function humanizeName(name, framework) {
+  if (!name) return "";
+  if (framework !== "go test") return name;
+  if (name.endsWith("/")) return name;
+  return name.split("/").map((p, i) => {
+    if (i === 0) {
+      return p.replace(/^Test/, "").replace(/([a-z0-9])([A-Z])/g, "$1 $2");
+    }
+    return p.replace(/_/g, " ");
+  }).join(" / ");
+}
+function collectFrameworks(tests) {
+  const set = /* @__PURE__ */ new Set();
+  const walk = (t) => {
+    if (t.framework && t.framework !== "task") set.add(t.framework);
+    (t.children || []).forEach(walk);
+  };
+  tests.forEach(walk);
+  return Array.from(set).sort();
+}
+function joinChainNames(parent, child) {
+  const p = (parent ?? "").trim();
+  const c = (child ?? "").trim();
+  if (!p) return c;
+  if (!c) return p;
+  return `${p} > ${c}`;
+}
+function isCollapsibleContainer(t) {
+  return !(t.passed || t.failed || t.skipped || t.pending);
+}
+function withoutSummary(t) {
+  const { summary: _summary, ...rest } = t;
+  return rest;
+}
+function collapseNode(t) {
+  const children = t.children ?? [];
+  if (children.length === 0) return t;
+  const collapsedChildren = children.map(collapseNode);
+  const onlyChild = collapsedChildren.length === 1 ? collapsedChildren[0] : void 0;
+  if (onlyChild && isCollapsibleContainer(t)) {
+    return { ...withoutSummary(onlyChild), name: joinChainNames(t.name, onlyChild.name) };
+  }
+  return { ...t, children: collapsedChildren };
+}
+function collapseSingleChildChains(tests) {
+  return tests.map(collapseNode);
+}
+function matchesLeaf(t, statusFilter, frameworkFilter) {
+  const s = testStatus(t);
+  if (s === null) return false;
+  return filterState.matchesFilterState(s, statusFilter) && filterState.matchesFilterState(t.framework, frameworkFilter);
+}
+function filterNode(t, statusFilter, frameworkFilter) {
+  if (t.children && t.children.length > 0) {
+    const filtered = t.children.map((c) => filterNode(c, statusFilter, frameworkFilter)).filter(Boolean);
+    if (filtered.length === 0) return null;
+    return { ...withoutSummary(t), children: filtered };
+  }
+  return matchesLeaf(t, statusFilter, frameworkFilter) ? t : null;
+}
+function filterTests(tests, statusFilter, frameworkFilter) {
+  if (statusFilter.size === 0 && frameworkFilter.size === 0) return tests;
+  return tests.map((t) => filterNode(t, statusFilter, frameworkFilter)).filter(Boolean);
+}
+exports.collapseSingleChildChains = collapseSingleChildChains;
+exports.collectFrameworks = collectFrameworks;
+exports.filterTests = filterTests;
+exports.formatCount = formatCount;
+exports.formatTestDuration = formatTestDuration;
+exports.hasFailed = hasFailed;
+exports.hasPending = hasPending;
+exports.humanizeName = humanizeName;
+exports.statusIconFor = statusIconFor;
+exports.statusToneFor = statusToneFor;
+exports.sum = sum;
+exports.sumNonTaskTests = sumNonTaskTests;
+exports.testStatus = testStatus;
+exports.totalDuration = totalDuration;
+//# sourceMappingURL=status.cjs.map

package/dist/data/test-runner/status.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"status.cjs","sources":["../../../src/data/test-runner/status.ts"],"sourcesContent":["// Pure status/roll-up helpers for the test runner — ported from Gavel's\n// utils.ts (Tests-only subset). No JSX here. The two status mappers\n// (statusIconFor / statusToneFor) replace Gavel's raw-Tailwind statusIcon /\n// statusColor with clicky's icon set and semantic Badge tones.\n\nimport type { StaticIconComponent } from \"../Icon\";\nimport type { BadgeTone } from \"../Badge\";\nimport {\n  UiClass,\n  UiError,\n  UiHourglass,\n  UiLoader,\n  UiPass,\n  UiPause,\n  UiWarningTriangle,\n} from \"../../icons\";\nimport type { Test, TestSummary } from \"./types\";\nimport { matchesFilterState, type FilterState } from \"./filterState\";\n\n// --- roll-up counts ------------------------------------------------------\n\n/**\n * Tallied verdict breakdown a `Test` subtree rolls up to. `warned` is amber and\n * orthogonal to a real failure — a warned-only leaf counts in total + warned,\n * never in failed.\n */\nexport type StatusCounts = {\n  total: number;\n  passed: number;\n  failed: number;\n  warned: number;\n  skipped: number;\n  pending: number;\n  running: number;\n  timedout: number;\n};\n\nconst emptyCounts = (): StatusCounts => ({\n  total: 0,\n  passed: 0,\n  failed: 0,\n  warned: 0,\n  skipped: 0,\n  pending: 0,\n  running: 0,\n  timedout: 0,\n});\n\nconst addCounts = (r: StatusCounts, s: StatusCounts) => {\n  r.total += s.total;\n  r.passed += s.passed;\n  r.failed += s.failed;\n  r.warned += s.warned;\n  r.skipped += s.skipped;\n  r.pending += s.pending;\n  r.running += s.running;\n  r.timedout += s.timedout;\n};\n\nconst countsFromSummary = (summary: TestSummary): StatusCounts => ({\n  total: summary.Total,\n  passed: summary.Passed,\n  failed: summary.Failed,\n  warned: summary.Warned || 0,\n  skipped: summary.Skipped,\n  pending: summary.Pending || 0,\n  running: summary.Running || 0,\n  timedout: 0,\n});\n\nconst countsFromLeaf = (t: Test): StatusCounts => {\n  const isTimedOut = !!t.timed_out;\n  const counted =\n    isTimedOut || t.passed || t.failed || t.warned || t.skipped || t.pending || t.running;\n  return {\n    total: counted ? 1 : 0,\n    passed: !isTimedOut && t.passed ? 1 : 0,\n    failed: !isTimedOut && t.failed ? 1 : 0,\n    warned: !isTimedOut && t.warned ? 1 : 0,\n    skipped: !isTimedOut && t.skipped ? 1 : 0,\n    pending: !isTimedOut && t.pending ? 1 : 0,\n    running: !isTimedOut && t.running ? 1 : 0,\n    timedout: isTimedOut ? 1 : 0,\n  };\n};\n\nexport function sum(t: Test): StatusCounts {\n  if (t.summary) return countsFromSummary(t.summary);\n  if (!t.children || t.children.length === 0) return countsFromLeaf(t);\n  const r = emptyCounts();\n  for (const c of t.children) addCounts(r, sum(c));\n  return r;\n}\n\n/** Like {@link sum} but excludes `task`-framework pseudo-nodes from the tally. */\nexport function sumNonTaskTests(t: Test): StatusCounts {\n  if (t.framework === \"task\") {\n    const r = emptyCounts();\n    for (const c of t.children || []) addCounts(r, sumNonTaskTests(c));\n    return r;\n  }\n  if (t.summary) return countsFromSummary(t.summary);\n  if (!t.children || t.children.length === 0) return countsFromLeaf(t);\n  const r = emptyCounts();\n  for (const c of t.children) addCounts(r, sumNonTaskTests(c));\n  return r;\n}\n\nexport function hasFailed(t: Test): boolean {\n  if (t.failed) return true;\n  return (t.children || []).some(hasFailed);\n}\n\nexport function hasPending(t: Test): boolean {\n  if (t.pending) return true;\n  return (t.children || []).some(hasPending);\n}\n\nfunction hasTimedOutDescendant(t: Test): boolean {\n  if (t.timed_out) return true;\n  return (t.children || []).some(hasTimedOutDescendant);\n}\n\nexport function totalDuration(t: Test): number {\n  if (t.duration && t.duration > 0) return t.duration;\n  let d = 0;\n  for (const c of t.children || []) d += totalDuration(c);\n  return d;\n}\n\n// --- status classification ----------------------------------------------\n\nexport type TestStatus =\n  | \"passed\"\n  | \"failed\"\n  | \"warned\"\n  | \"skipped\"\n  | \"pending\"\n  | \"running\"\n  | \"timedout\";\n\n/** Resolve a leaf node's single status, or null for a status-less container. */\nexport function testStatus(t: Test): TestStatus | null {\n  if (t.timed_out) return \"timedout\";\n  if (t.running) return \"running\";\n  if (t.pending) return \"pending\";\n  if (t.failed) return \"failed\";\n  if (t.warned) return \"warned\";\n  if (t.skipped) return \"skipped\";\n  if (t.passed) return \"passed\";\n  return null;\n}\n\n/** Pick the clicky icon for a node, rolling up container state. */\nexport function statusIconFor(t: Test): StaticIconComponent {\n  if (t.timed_out) return UiHourglass;\n  if (t.running) return UiLoader;\n  if (t.pending) return UiPause;\n  if (t.failed) return UiError;\n  if (t.warned) return UiWarningTriangle;\n  if (t.skipped) return UiPause;\n  if (t.passed) return UiPass;\n  if (t.children && t.children.length > 0) {\n    const s = sum(t);\n    if (hasTimedOutDescendant(t)) return UiHourglass;\n    if (s.failed > 0) return UiError;\n    if (s.warned > 0) return UiWarningTriangle;\n    if (s.running > 0) return UiLoader;\n    if (s.pending > 0) return UiPause;\n    return UiPass;\n  }\n  return UiClass;\n}\n\n/** Map a node's status to a semantic Badge tone, rolling up container state. */\nexport function statusToneFor(t: Test): BadgeTone {\n  if (t.timed_out) return \"warning\";\n  if (t.running) return \"info\";\n  if (t.pending) return \"neutral\";\n  if (t.failed) return \"danger\";\n  if (t.warned) return \"warning\";\n  if (t.skipped) return \"warning\";\n  if (t.passed) return \"success\";\n  if (t.children && t.children.length > 0) {\n    const s = sum(t);\n    if (hasTimedOutDescendant(t)) return \"warning\";\n    if (s.failed > 0) return \"danger\";\n    if (s.warned > 0) return \"warning\";\n    if (s.running > 0) return \"info\";\n    if (s.pending > 0) return \"neutral\";\n    return \"success\";\n  }\n  return \"neutral\";\n}\n\n// --- formatting ----------------------------------------------------------\n\n/**\n * Format a nanosecond duration as \"123ms\" or \"1.2s\". Empty for non-positive.\n * Named distinctly from clicky's ms/s `formatDuration` (lib/format) since the\n * test-runner wire format is nanoseconds.\n */\nexport function formatTestDuration(ns: number): string {\n  if (ns <= 0) return \"\";\n  const ms = ns / 1e6;\n  if (ms < 1000) return `${ms.toFixed(0)}ms`;\n  return `${(ms / 1000).toFixed(1)}s`;\n}\n\nfunction compactWithUnit(value: number, unit: string): string {\n  const rounded =\n    Math.abs(value) >= 10 ? Math.round(value).toString() : value.toFixed(1).replace(/\\.0$/, \"\");\n  return `${rounded}${unit}`;\n}\n\n/** Compact integer counts: <1000 raw, then \"k\", then \"M\". */\nexport function formatCount(n: number): string {\n  const abs = Math.abs(n);\n  if (abs < 1000) return String(n);\n  if (abs < 1_000_000) return compactWithUnit(n / 1000, \"k\");\n  return compactWithUnit(n / 1_000_000, \"M\");\n}\n\n/** Strip Go's `Test` prefix and split CamelCase / subtest names into words. */\nexport function humanizeName(name: string, framework?: string): string {\n  if (!name) return \"\";\n  if (framework !== \"go test\") return name;\n  if (name.endsWith(\"/\")) return name;\n  return name\n    .split(\"/\")\n    .map((p, i) => {\n      if (i === 0) {\n        return p.replace(/^Test/, \"\").replace(/([a-z0-9])([A-Z])/g, \"$1 $2\");\n      }\n      return p.replace(/_/g, \" \");\n    })\n    .join(\" / \");\n}\n\n// --- tree transforms -----------------------------------------------------\n\n/** Unique non-task frameworks present in the forest, sorted. */\nexport function collectFrameworks(tests: Test[]): string[] {\n  const set = new Set<string>();\n  const walk = (t: Test) => {\n    if (t.framework && t.framework !== \"task\") set.add(t.framework);\n    (t.children || []).forEach(walk);\n  };\n  tests.forEach(walk);\n  return Array.from(set).sort();\n}\n\nfunction joinChainNames(parent: string | undefined, child: string | undefined): string {\n  const p = (parent ?? \"\").trim();\n  const c = (child ?? \"\").trim();\n  if (!p) return c;\n  if (!c) return p;\n  return `${p} > ${c}`;\n}\n\nfunction isCollapsibleContainer(t: Test): boolean {\n  return !(t.passed || t.failed || t.skipped || t.pending);\n}\n\n// Re-deriving a collapsed/filtered node invalidates any cached summary; drop it\n// so callers re-roll-up from the surviving children.\nfunction withoutSummary(t: Test): Omit<Test, \"summary\"> & { summary?: never } {\n  const { summary: _summary, ...rest } = t;\n  return rest;\n}\n\nfunction collapseNode(t: Test): Test {\n  const children = t.children ?? [];\n  if (children.length === 0) return t;\n\n  const collapsedChildren = children.map(collapseNode);\n\n  const onlyChild = collapsedChildren.length === 1 ? collapsedChildren[0] : undefined;\n  if (onlyChild && isCollapsibleContainer(t)) {\n    return { ...withoutSummary(onlyChild), name: joinChainNames(t.name, onlyChild.name) };\n  }\n\n  return { ...t, children: collapsedChildren };\n}\n\n/**\n * Compress any status-less container with exactly one child into that child,\n * joining names with \" > \". Recursive, so chains collapse into a single row.\n */\nexport function collapseSingleChildChains(tests: Test[]): Test[] {\n  return tests.map(collapseNode);\n}\n\nfunction matchesLeaf(\n  t: Test,\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): boolean {\n  const s = testStatus(t);\n  if (s === null) return false;\n  return matchesFilterState(s, statusFilter) && matchesFilterState(t.framework, frameworkFilter);\n}\n\nfunction filterNode(\n  t: Test,\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): Test | null {\n  if (t.children && t.children.length > 0) {\n    const filtered = t.children\n      .map((c) => filterNode(c, statusFilter, frameworkFilter))\n      .filter(Boolean) as Test[];\n    if (filtered.length === 0) return null;\n    return { ...withoutSummary(t), children: filtered };\n  }\n  return matchesLeaf(t, statusFilter, frameworkFilter) ? t : null;\n}\n\n/** Prune leaves not matching the status/framework filters; drop empty branches. */\nexport function filterTests(\n  tests: Test[],\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): Test[] {\n  if (statusFilter.size === 0 && frameworkFilter.size === 0) return tests;\n  return tests\n    .map((t) => filterNode(t, statusFilter, frameworkFilter))\n    .filter(Boolean) as Test[];\n}\n"],"names":["r","UiHourglass","UiLoader","UiPause","UiError","UiWarningTriangle","UiPass","UiClass","matchesFilterState"],"mappings":";;;;;;;;;;AAqCA,MAAM,cAAc,OAAqB;AAAA,EACvC,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AAEA,MAAM,YAAY,CAAC,GAAiB,MAAoB;AACtD,IAAE,SAAS,EAAE;AACb,IAAE,UAAU,EAAE;AACd,IAAE,UAAU,EAAE;AACd,IAAE,UAAU,EAAE;AACd,IAAE,WAAW,EAAE;AACf,IAAE,WAAW,EAAE;AACf,IAAE,WAAW,EAAE;AACf,IAAE,YAAY,EAAE;AAClB;AAEA,MAAM,oBAAoB,CAAC,aAAwC;AAAA,EACjE,OAAO,QAAQ;AAAA,EACf,QAAQ,QAAQ;AAAA,EAChB,QAAQ,QAAQ;AAAA,EAChB,QAAQ,QAAQ,UAAU;AAAA,EAC1B,SAAS,QAAQ;AAAA,EACjB,SAAS,QAAQ,WAAW;AAAA,EAC5B,SAAS,QAAQ,WAAW;AAAA,EAC5B,UAAU;AACZ;AAEA,MAAM,iBAAiB,CAAC,MAA0B;AAChD,QAAM,aAAa,CAAC,CAAC,EAAE;AACvB,QAAM,UACJ,cAAc,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,UAAU,IAAI;AAAA,IACrB,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,UAAU,aAAa,IAAI;AAAA,EAAA;AAE/B;AAEO,SAAS,IAAI,GAAuB;AACzC,MAAI,EAAE,QAAS,QAAO,kBAAkB,EAAE,OAAO;AACjD,MAAI,CAAC,EAAE,YAAY,EAAE,SAAS,WAAW,EAAG,QAAO,eAAe,CAAC;AACnE,QAAM,IAAI,YAAA;AACV,aAAW,KAAK,EAAE,oBAAoB,GAAG,IAAI,CAAC,CAAC;AAC/C,SAAO;AACT;AAGO,SAAS,gBAAgB,GAAuB;AACrD,MAAI,EAAE,cAAc,QAAQ;AAC1B,UAAMA,KAAI,YAAA;AACV,eAAW,KAAK,EAAE,YAAY,CAAA,EAAI,WAAUA,IAAG,gBAAgB,CAAC,CAAC;AACjE,WAAOA;AAAAA,EACT;AACA,MAAI,EAAE,QAAS,QAAO,kBAAkB,EAAE,OAAO;AACjD,MAAI,CAAC,EAAE,YAAY,EAAE,SAAS,WAAW,EAAG,QAAO,eAAe,CAAC;AACnE,QAAM,IAAI,YAAA;AACV,aAAW,KAAK,EAAE,oBAAoB,GAAG,gBAAgB,CAAC,CAAC;AAC3D,SAAO;AACT;AAEO,SAAS,UAAU,GAAkB;AAC1C,MAAI,EAAE,OAAQ,QAAO;AACrB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,SAAS;AAC1C;AAEO,SAAS,WAAW,GAAkB;AAC3C,MAAI,EAAE,QAAS,QAAO;AACtB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,UAAU;AAC3C;AAEA,SAAS,sBAAsB,GAAkB;AAC/C,MAAI,EAAE,UAAW,QAAO;AACxB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,qBAAqB;AACtD;AAEO,SAAS,cAAc,GAAiB;AAC7C,MAAI,EAAE,YAAY,EAAE,WAAW,UAAU,EAAE;AAC3C,MAAI,IAAI;AACR,aAAW,KAAK,EAAE,YAAY,CAAA,EAAI,MAAK,cAAc,CAAC;AACtD,SAAO;AACT;AAcO,SAAS,WAAW,GAA4B;AACrD,MAAI,EAAE,UAAW,QAAO;AACxB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,SAAO;AACT;AAGO,SAAS,cAAc,GAA8B;AAC1D,MAAI,EAAE,UAAW,QAAOC,YAAAA;AACxB,MAAI,EAAE,QAAS,QAAOC,SAAAA;AACtB,MAAI,EAAE,QAAS,QAAOC,QAAAA;AACtB,MAAI,EAAE,OAAQ,QAAOC,QAAAA;AACrB,MAAI,EAAE,OAAQ,QAAOC,kBAAAA;AACrB,MAAI,EAAE,QAAS,QAAOF,QAAAA;AACtB,MAAI,EAAE,OAAQ,QAAOG,OAAAA;AACrB,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,sBAAsB,CAAC,EAAG,QAAOL,YAAAA;AACrC,QAAI,EAAE,SAAS,EAAG,QAAOG,QAAAA;AACzB,QAAI,EAAE,SAAS,EAAG,QAAOC,kBAAAA;AACzB,QAAI,EAAE,UAAU,EAAG,QAAOH,SAAAA;AAC1B,QAAI,EAAE,UAAU,EAAG,QAAOC,QAAAA;AAC1B,WAAOG,OAAAA;AAAAA,EACT;AACA,SAAOC,QAAAA;AACT;AAGO,SAAS,cAAc,GAAoB;AAChD,MAAI,EAAE,UAAW,QAAO;AACxB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,sBAAsB,CAAC,EAAG,QAAO;AACrC,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AASO,SAAS,mBAAmB,IAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK,IAAM,QAAO,GAAG,GAAG,QAAQ,CAAC,CAAC;AACtC,SAAO,IAAI,KAAK,KAAM,QAAQ,CAAC,CAAC;AAClC;AAEA,SAAS,gBAAgB,OAAe,MAAsB;AAC5D,QAAM,UACJ,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,SAAA,IAAa,MAAM,QAAQ,CAAC,EAAE,QAAQ,QAAQ,EAAE;AAC5F,SAAO,GAAG,OAAO,GAAG,IAAI;AAC1B;AAGO,SAAS,YAAY,GAAmB;AAC7C,QAAM,MAAM,KAAK,IAAI,CAAC;AACtB,MAAI,MAAM,IAAM,QAAO,OAAO,CAAC;AAC/B,MAAI,MAAM,IAAW,QAAO,gBAAgB,IAAI,KAAM,GAAG;AACzD,SAAO,gBAAgB,IAAI,KAAW,GAAG;AAC3C;AAGO,SAAS,aAAa,MAAc,WAA4B;AACrE,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,cAAc,UAAW,QAAO;AACpC,MAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,SAAO,KACJ,MAAM,GAAG,EACT,IAAI,CAAC,GAAG,MAAM;AACb,QAAI,MAAM,GAAG;AACX,aAAO,EAAE,QAAQ,SAAS,EAAE,EAAE,QAAQ,sBAAsB,OAAO;AAAA,IACrE;AACA,WAAO,EAAE,QAAQ,MAAM,GAAG;AAAA,EAC5B,CAAC,EACA,KAAK,KAAK;AACf;AAKO,SAAS,kBAAkB,OAAyB;AACzD,QAAM,0BAAU,IAAA;AAChB,QAAM,OAAO,CAAC,MAAY;AACxB,QAAI,EAAE,aAAa,EAAE,cAAc,OAAQ,KAAI,IAAI,EAAE,SAAS;AAC9D,KAAC,EAAE,YAAY,IAAI,QAAQ,IAAI;AAAA,EACjC;AACA,QAAM,QAAQ,IAAI;AAClB,SAAO,MAAM,KAAK,GAAG,EAAE,KAAA;AACzB;AAEA,SAAS,eAAe,QAA4B,OAAmC;AACrF,QAAM,KAAK,UAAU,IAAI,KAAA;AACzB,QAAM,KAAK,SAAS,IAAI,KAAA;AACxB,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,GAAG,CAAC,MAAM,CAAC;AACpB;AAEA,SAAS,uBAAuB,GAAkB;AAChD,SAAO,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE;AAClD;AAIA,SAAS,eAAe,GAAsD;AAC5E,QAAM,EAAE,SAAS,UAAU,GAAG,SAAS;AACvC,SAAO;AACT;AAEA,SAAS,aAAa,GAAe;AACnC,QAAM,WAAW,EAAE,YAAY,CAAA;AAC/B,MAAI,SAAS,WAAW,EAAG,QAAO;AAElC,QAAM,oBAAoB,SAAS,IAAI,YAAY;AAEnD,QAAM,YAAY,kBAAkB,WAAW,IAAI,kBAAkB,CAAC,IAAI;AAC1E,MAAI,aAAa,uBAAuB,CAAC,GAAG;AAC1C,WAAO,EAAE,GAAG,eAAe,SAAS,GAAG,MAAM,eAAe,EAAE,MAAM,UAAU,IAAI,EAAA;AAAA,EACpF;AAEA,SAAO,EAAE,GAAG,GAAG,UAAU,kBAAA;AAC3B;AAMO,SAAS,0BAA0B,OAAuB;AAC/D,SAAO,MAAM,IAAI,YAAY;AAC/B;AAEA,SAAS,YACP,GACA,cACA,iBACS;AACT,QAAM,IAAI,WAAW,CAAC;AACtB,MAAI,MAAM,KAAM,QAAO;AACvB,SAAOC,YAAAA,mBAAmB,GAAG,YAAY,KAAKA,YAAAA,mBAAmB,EAAE,WAAW,eAAe;AAC/F;AAEA,SAAS,WACP,GACA,cACA,iBACa;AACb,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,WAAW,EAAE,SAChB,IAAI,CAAC,MAAM,WAAW,GAAG,cAAc,eAAe,CAAC,EACvD,OAAO,OAAO;AACjB,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,WAAO,EAAE,GAAG,eAAe,CAAC,GAAG,UAAU,SAAA;AAAA,EAC3C;AACA,SAAO,YAAY,GAAG,cAAc,eAAe,IAAI,IAAI;AAC7D;AAGO,SAAS,YACd,OACA,cACA,iBACQ;AACR,MAAI,aAAa,SAAS,KAAK,gBAAgB,SAAS,EAAG,QAAO;AAClE,SAAO,MACJ,IAAI,CAAC,MAAM,WAAW,GAAG,cAAc,eAAe,CAAC,EACvD,OAAO,OAAO;AACnB;;;;;;;;;;;;;;;"}

package/dist/data/test-runner/status.d.ts

@@ -0,0 +1,52 @@
+import { StaticIconComponent } from '../Icon';
+import { BadgeTone } from '../Badge';
+import { Test } from './types';
+import { FilterState } from './filterState';
+/**
+ * Tallied verdict breakdown a `Test` subtree rolls up to. `warned` is amber and
+ * orthogonal to a real failure — a warned-only leaf counts in total + warned,
+ * never in failed.
+ */
+export type StatusCounts = {
+    total: number;
+    passed: number;
+    failed: number;
+    warned: number;
+    skipped: number;
+    pending: number;
+    running: number;
+    timedout: number;
+};
+export declare function sum(t: Test): StatusCounts;
+/** Like {@link sum} but excludes `task`-framework pseudo-nodes from the tally. */
+export declare function sumNonTaskTests(t: Test): StatusCounts;
+export declare function hasFailed(t: Test): boolean;
+export declare function hasPending(t: Test): boolean;
+export declare function totalDuration(t: Test): number;
+export type TestStatus = "passed" | "failed" | "warned" | "skipped" | "pending" | "running" | "timedout";
+/** Resolve a leaf node's single status, or null for a status-less container. */
+export declare function testStatus(t: Test): TestStatus | null;
+/** Pick the clicky icon for a node, rolling up container state. */
+export declare function statusIconFor(t: Test): StaticIconComponent;
+/** Map a node's status to a semantic Badge tone, rolling up container state. */
+export declare function statusToneFor(t: Test): BadgeTone;
+/**
+ * Format a nanosecond duration as "123ms" or "1.2s". Empty for non-positive.
+ * Named distinctly from clicky's ms/s `formatDuration` (lib/format) since the
+ * test-runner wire format is nanoseconds.
+ */
+export declare function formatTestDuration(ns: number): string;
+/** Compact integer counts: <1000 raw, then "k", then "M". */
+export declare function formatCount(n: number): string;
+/** Strip Go's `Test` prefix and split CamelCase / subtest names into words. */
+export declare function humanizeName(name: string, framework?: string): string;
+/** Unique non-task frameworks present in the forest, sorted. */
+export declare function collectFrameworks(tests: Test[]): string[];
+/**
+ * Compress any status-less container with exactly one child into that child,
+ * joining names with " > ". Recursive, so chains collapse into a single row.
+ */
+export declare function collapseSingleChildChains(tests: Test[]): Test[];
+/** Prune leaves not matching the status/framework filters; drop empty branches. */
+export declare function filterTests(tests: Test[], statusFilter: FilterState<string>, frameworkFilter: FilterState<string>): Test[];
+//# sourceMappingURL=status.d.ts.map

package/dist/data/test-runner/status.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"status.d.ts","sourceRoot":"","sources":["../../../src/data/test-runner/status.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,SAAS,CAAC;AACnD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAU1C,OAAO,KAAK,EAAE,IAAI,EAAe,MAAM,SAAS,CAAC;AACjD,OAAO,EAAsB,KAAK,WAAW,EAAE,MAAM,eAAe,CAAC;AAIrE;;;;GAIG;AACH,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC;CAClB,CAAC;AAmDF,wBAAgB,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,YAAY,CAMzC;AAED,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,YAAY,CAWrD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAG1C;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO,CAG3C;AAOD,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAK7C;AAID,MAAM,MAAM,UAAU,GAClB,QAAQ,GACR,QAAQ,GACR,QAAQ,GACR,SAAS,GACT,SAAS,GACT,SAAS,GACT,UAAU,CAAC;AAEf,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,GAAG,UAAU,GAAG,IAAI,CASrD;AAED,mEAAmE;AACnE,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,mBAAmB,CAkB1D;AAED,gFAAgF;AAChF,wBAAgB,aAAa,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,CAkBhD;AAID;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAKrD;AAQD,6DAA6D;AAC7D,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAK7C;AAED,+EAA+E;AAC/E,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM,CAarE;AAID,gEAAgE;AAChE,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAQzD;AAmCD;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAE/D;AA2BD,mFAAmF;AACnF,wBAAgB,WAAW,CACzB,KAAK,EAAE,IAAI,EAAE,EACb,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,EACjC,eAAe,EAAE,WAAW,CAAC,MAAM,CAAC,GACnC,IAAI,EAAE,CAKR"}

package/dist/data/test-runner/status.js

@@ -0,0 +1,234 @@
+import { matchesFilterState } from "./filterState.js";
+import { UiHourglass } from "../../icons/components/UiHourglass.js";
+import { UiLoader } from "../../icons/components/UiLoader.js";
+import { UiPause } from "../../icons/components/UiPause.js";
+import { UiError } from "../../icons/components/UiError.js";
+import { UiWarningTriangle } from "../../icons/components/UiWarningTriangle.js";
+import { UiPass } from "../../icons/components/UiPass.js";
+import { UiClass } from "../../icons/components/UiClass.js";
+const emptyCounts = () => ({
+  total: 0,
+  passed: 0,
+  failed: 0,
+  warned: 0,
+  skipped: 0,
+  pending: 0,
+  running: 0,
+  timedout: 0
+});
+const addCounts = (r, s) => {
+  r.total += s.total;
+  r.passed += s.passed;
+  r.failed += s.failed;
+  r.warned += s.warned;
+  r.skipped += s.skipped;
+  r.pending += s.pending;
+  r.running += s.running;
+  r.timedout += s.timedout;
+};
+const countsFromSummary = (summary) => ({
+  total: summary.Total,
+  passed: summary.Passed,
+  failed: summary.Failed,
+  warned: summary.Warned || 0,
+  skipped: summary.Skipped,
+  pending: summary.Pending || 0,
+  running: summary.Running || 0,
+  timedout: 0
+});
+const countsFromLeaf = (t) => {
+  const isTimedOut = !!t.timed_out;
+  const counted = isTimedOut || t.passed || t.failed || t.warned || t.skipped || t.pending || t.running;
+  return {
+    total: counted ? 1 : 0,
+    passed: !isTimedOut && t.passed ? 1 : 0,
+    failed: !isTimedOut && t.failed ? 1 : 0,
+    warned: !isTimedOut && t.warned ? 1 : 0,
+    skipped: !isTimedOut && t.skipped ? 1 : 0,
+    pending: !isTimedOut && t.pending ? 1 : 0,
+    running: !isTimedOut && t.running ? 1 : 0,
+    timedout: isTimedOut ? 1 : 0
+  };
+};
+function sum(t) {
+  if (t.summary) return countsFromSummary(t.summary);
+  if (!t.children || t.children.length === 0) return countsFromLeaf(t);
+  const r = emptyCounts();
+  for (const c of t.children) addCounts(r, sum(c));
+  return r;
+}
+function sumNonTaskTests(t) {
+  if (t.framework === "task") {
+    const r2 = emptyCounts();
+    for (const c of t.children || []) addCounts(r2, sumNonTaskTests(c));
+    return r2;
+  }
+  if (t.summary) return countsFromSummary(t.summary);
+  if (!t.children || t.children.length === 0) return countsFromLeaf(t);
+  const r = emptyCounts();
+  for (const c of t.children) addCounts(r, sumNonTaskTests(c));
+  return r;
+}
+function hasFailed(t) {
+  if (t.failed) return true;
+  return (t.children || []).some(hasFailed);
+}
+function hasPending(t) {
+  if (t.pending) return true;
+  return (t.children || []).some(hasPending);
+}
+function hasTimedOutDescendant(t) {
+  if (t.timed_out) return true;
+  return (t.children || []).some(hasTimedOutDescendant);
+}
+function totalDuration(t) {
+  if (t.duration && t.duration > 0) return t.duration;
+  let d = 0;
+  for (const c of t.children || []) d += totalDuration(c);
+  return d;
+}
+function testStatus(t) {
+  if (t.timed_out) return "timedout";
+  if (t.running) return "running";
+  if (t.pending) return "pending";
+  if (t.failed) return "failed";
+  if (t.warned) return "warned";
+  if (t.skipped) return "skipped";
+  if (t.passed) return "passed";
+  return null;
+}
+function statusIconFor(t) {
+  if (t.timed_out) return UiHourglass;
+  if (t.running) return UiLoader;
+  if (t.pending) return UiPause;
+  if (t.failed) return UiError;
+  if (t.warned) return UiWarningTriangle;
+  if (t.skipped) return UiPause;
+  if (t.passed) return UiPass;
+  if (t.children && t.children.length > 0) {
+    const s = sum(t);
+    if (hasTimedOutDescendant(t)) return UiHourglass;
+    if (s.failed > 0) return UiError;
+    if (s.warned > 0) return UiWarningTriangle;
+    if (s.running > 0) return UiLoader;
+    if (s.pending > 0) return UiPause;
+    return UiPass;
+  }
+  return UiClass;
+}
+function statusToneFor(t) {
+  if (t.timed_out) return "warning";
+  if (t.running) return "info";
+  if (t.pending) return "neutral";
+  if (t.failed) return "danger";
+  if (t.warned) return "warning";
+  if (t.skipped) return "warning";
+  if (t.passed) return "success";
+  if (t.children && t.children.length > 0) {
+    const s = sum(t);
+    if (hasTimedOutDescendant(t)) return "warning";
+    if (s.failed > 0) return "danger";
+    if (s.warned > 0) return "warning";
+    if (s.running > 0) return "info";
+    if (s.pending > 0) return "neutral";
+    return "success";
+  }
+  return "neutral";
+}
+function formatTestDuration(ns) {
+  if (ns <= 0) return "";
+  const ms = ns / 1e6;
+  if (ms < 1e3) return `${ms.toFixed(0)}ms`;
+  return `${(ms / 1e3).toFixed(1)}s`;
+}
+function compactWithUnit(value, unit) {
+  const rounded = Math.abs(value) >= 10 ? Math.round(value).toString() : value.toFixed(1).replace(/\.0$/, "");
+  return `${rounded}${unit}`;
+}
+function formatCount(n) {
+  const abs = Math.abs(n);
+  if (abs < 1e3) return String(n);
+  if (abs < 1e6) return compactWithUnit(n / 1e3, "k");
+  return compactWithUnit(n / 1e6, "M");
+}
+function humanizeName(name, framework) {
+  if (!name) return "";
+  if (framework !== "go test") return name;
+  if (name.endsWith("/")) return name;
+  return name.split("/").map((p, i) => {
+    if (i === 0) {
+      return p.replace(/^Test/, "").replace(/([a-z0-9])([A-Z])/g, "$1 $2");
+    }
+    return p.replace(/_/g, " ");
+  }).join(" / ");
+}
+function collectFrameworks(tests) {
+  const set = /* @__PURE__ */ new Set();
+  const walk = (t) => {
+    if (t.framework && t.framework !== "task") set.add(t.framework);
+    (t.children || []).forEach(walk);
+  };
+  tests.forEach(walk);
+  return Array.from(set).sort();
+}
+function joinChainNames(parent, child) {
+  const p = (parent ?? "").trim();
+  const c = (child ?? "").trim();
+  if (!p) return c;
+  if (!c) return p;
+  return `${p} > ${c}`;
+}
+function isCollapsibleContainer(t) {
+  return !(t.passed || t.failed || t.skipped || t.pending);
+}
+function withoutSummary(t) {
+  const { summary: _summary, ...rest } = t;
+  return rest;
+}
+function collapseNode(t) {
+  const children = t.children ?? [];
+  if (children.length === 0) return t;
+  const collapsedChildren = children.map(collapseNode);
+  const onlyChild = collapsedChildren.length === 1 ? collapsedChildren[0] : void 0;
+  if (onlyChild && isCollapsibleContainer(t)) {
+    return { ...withoutSummary(onlyChild), name: joinChainNames(t.name, onlyChild.name) };
+  }
+  return { ...t, children: collapsedChildren };
+}
+function collapseSingleChildChains(tests) {
+  return tests.map(collapseNode);
+}
+function matchesLeaf(t, statusFilter, frameworkFilter) {
+  const s = testStatus(t);
+  if (s === null) return false;
+  return matchesFilterState(s, statusFilter) && matchesFilterState(t.framework, frameworkFilter);
+}
+function filterNode(t, statusFilter, frameworkFilter) {
+  if (t.children && t.children.length > 0) {
+    const filtered = t.children.map((c) => filterNode(c, statusFilter, frameworkFilter)).filter(Boolean);
+    if (filtered.length === 0) return null;
+    return { ...withoutSummary(t), children: filtered };
+  }
+  return matchesLeaf(t, statusFilter, frameworkFilter) ? t : null;
+}
+function filterTests(tests, statusFilter, frameworkFilter) {
+  if (statusFilter.size === 0 && frameworkFilter.size === 0) return tests;
+  return tests.map((t) => filterNode(t, statusFilter, frameworkFilter)).filter(Boolean);
+}
+export {
+  collapseSingleChildChains,
+  collectFrameworks,
+  filterTests,
+  formatCount,
+  formatTestDuration,
+  hasFailed,
+  hasPending,
+  humanizeName,
+  statusIconFor,
+  statusToneFor,
+  sum,
+  sumNonTaskTests,
+  testStatus,
+  totalDuration
+};
+//# sourceMappingURL=status.js.map

package/dist/data/test-runner/status.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"status.js","sources":["../../../src/data/test-runner/status.ts"],"sourcesContent":["// Pure status/roll-up helpers for the test runner — ported from Gavel's\n// utils.ts (Tests-only subset). No JSX here. The two status mappers\n// (statusIconFor / statusToneFor) replace Gavel's raw-Tailwind statusIcon /\n// statusColor with clicky's icon set and semantic Badge tones.\n\nimport type { StaticIconComponent } from \"../Icon\";\nimport type { BadgeTone } from \"../Badge\";\nimport {\n  UiClass,\n  UiError,\n  UiHourglass,\n  UiLoader,\n  UiPass,\n  UiPause,\n  UiWarningTriangle,\n} from \"../../icons\";\nimport type { Test, TestSummary } from \"./types\";\nimport { matchesFilterState, type FilterState } from \"./filterState\";\n\n// --- roll-up counts ------------------------------------------------------\n\n/**\n * Tallied verdict breakdown a `Test` subtree rolls up to. `warned` is amber and\n * orthogonal to a real failure — a warned-only leaf counts in total + warned,\n * never in failed.\n */\nexport type StatusCounts = {\n  total: number;\n  passed: number;\n  failed: number;\n  warned: number;\n  skipped: number;\n  pending: number;\n  running: number;\n  timedout: number;\n};\n\nconst emptyCounts = (): StatusCounts => ({\n  total: 0,\n  passed: 0,\n  failed: 0,\n  warned: 0,\n  skipped: 0,\n  pending: 0,\n  running: 0,\n  timedout: 0,\n});\n\nconst addCounts = (r: StatusCounts, s: StatusCounts) => {\n  r.total += s.total;\n  r.passed += s.passed;\n  r.failed += s.failed;\n  r.warned += s.warned;\n  r.skipped += s.skipped;\n  r.pending += s.pending;\n  r.running += s.running;\n  r.timedout += s.timedout;\n};\n\nconst countsFromSummary = (summary: TestSummary): StatusCounts => ({\n  total: summary.Total,\n  passed: summary.Passed,\n  failed: summary.Failed,\n  warned: summary.Warned || 0,\n  skipped: summary.Skipped,\n  pending: summary.Pending || 0,\n  running: summary.Running || 0,\n  timedout: 0,\n});\n\nconst countsFromLeaf = (t: Test): StatusCounts => {\n  const isTimedOut = !!t.timed_out;\n  const counted =\n    isTimedOut || t.passed || t.failed || t.warned || t.skipped || t.pending || t.running;\n  return {\n    total: counted ? 1 : 0,\n    passed: !isTimedOut && t.passed ? 1 : 0,\n    failed: !isTimedOut && t.failed ? 1 : 0,\n    warned: !isTimedOut && t.warned ? 1 : 0,\n    skipped: !isTimedOut && t.skipped ? 1 : 0,\n    pending: !isTimedOut && t.pending ? 1 : 0,\n    running: !isTimedOut && t.running ? 1 : 0,\n    timedout: isTimedOut ? 1 : 0,\n  };\n};\n\nexport function sum(t: Test): StatusCounts {\n  if (t.summary) return countsFromSummary(t.summary);\n  if (!t.children || t.children.length === 0) return countsFromLeaf(t);\n  const r = emptyCounts();\n  for (const c of t.children) addCounts(r, sum(c));\n  return r;\n}\n\n/** Like {@link sum} but excludes `task`-framework pseudo-nodes from the tally. */\nexport function sumNonTaskTests(t: Test): StatusCounts {\n  if (t.framework === \"task\") {\n    const r = emptyCounts();\n    for (const c of t.children || []) addCounts(r, sumNonTaskTests(c));\n    return r;\n  }\n  if (t.summary) return countsFromSummary(t.summary);\n  if (!t.children || t.children.length === 0) return countsFromLeaf(t);\n  const r = emptyCounts();\n  for (const c of t.children) addCounts(r, sumNonTaskTests(c));\n  return r;\n}\n\nexport function hasFailed(t: Test): boolean {\n  if (t.failed) return true;\n  return (t.children || []).some(hasFailed);\n}\n\nexport function hasPending(t: Test): boolean {\n  if (t.pending) return true;\n  return (t.children || []).some(hasPending);\n}\n\nfunction hasTimedOutDescendant(t: Test): boolean {\n  if (t.timed_out) return true;\n  return (t.children || []).some(hasTimedOutDescendant);\n}\n\nexport function totalDuration(t: Test): number {\n  if (t.duration && t.duration > 0) return t.duration;\n  let d = 0;\n  for (const c of t.children || []) d += totalDuration(c);\n  return d;\n}\n\n// --- status classification ----------------------------------------------\n\nexport type TestStatus =\n  | \"passed\"\n  | \"failed\"\n  | \"warned\"\n  | \"skipped\"\n  | \"pending\"\n  | \"running\"\n  | \"timedout\";\n\n/** Resolve a leaf node's single status, or null for a status-less container. */\nexport function testStatus(t: Test): TestStatus | null {\n  if (t.timed_out) return \"timedout\";\n  if (t.running) return \"running\";\n  if (t.pending) return \"pending\";\n  if (t.failed) return \"failed\";\n  if (t.warned) return \"warned\";\n  if (t.skipped) return \"skipped\";\n  if (t.passed) return \"passed\";\n  return null;\n}\n\n/** Pick the clicky icon for a node, rolling up container state. */\nexport function statusIconFor(t: Test): StaticIconComponent {\n  if (t.timed_out) return UiHourglass;\n  if (t.running) return UiLoader;\n  if (t.pending) return UiPause;\n  if (t.failed) return UiError;\n  if (t.warned) return UiWarningTriangle;\n  if (t.skipped) return UiPause;\n  if (t.passed) return UiPass;\n  if (t.children && t.children.length > 0) {\n    const s = sum(t);\n    if (hasTimedOutDescendant(t)) return UiHourglass;\n    if (s.failed > 0) return UiError;\n    if (s.warned > 0) return UiWarningTriangle;\n    if (s.running > 0) return UiLoader;\n    if (s.pending > 0) return UiPause;\n    return UiPass;\n  }\n  return UiClass;\n}\n\n/** Map a node's status to a semantic Badge tone, rolling up container state. */\nexport function statusToneFor(t: Test): BadgeTone {\n  if (t.timed_out) return \"warning\";\n  if (t.running) return \"info\";\n  if (t.pending) return \"neutral\";\n  if (t.failed) return \"danger\";\n  if (t.warned) return \"warning\";\n  if (t.skipped) return \"warning\";\n  if (t.passed) return \"success\";\n  if (t.children && t.children.length > 0) {\n    const s = sum(t);\n    if (hasTimedOutDescendant(t)) return \"warning\";\n    if (s.failed > 0) return \"danger\";\n    if (s.warned > 0) return \"warning\";\n    if (s.running > 0) return \"info\";\n    if (s.pending > 0) return \"neutral\";\n    return \"success\";\n  }\n  return \"neutral\";\n}\n\n// --- formatting ----------------------------------------------------------\n\n/**\n * Format a nanosecond duration as \"123ms\" or \"1.2s\". Empty for non-positive.\n * Named distinctly from clicky's ms/s `formatDuration` (lib/format) since the\n * test-runner wire format is nanoseconds.\n */\nexport function formatTestDuration(ns: number): string {\n  if (ns <= 0) return \"\";\n  const ms = ns / 1e6;\n  if (ms < 1000) return `${ms.toFixed(0)}ms`;\n  return `${(ms / 1000).toFixed(1)}s`;\n}\n\nfunction compactWithUnit(value: number, unit: string): string {\n  const rounded =\n    Math.abs(value) >= 10 ? Math.round(value).toString() : value.toFixed(1).replace(/\\.0$/, \"\");\n  return `${rounded}${unit}`;\n}\n\n/** Compact integer counts: <1000 raw, then \"k\", then \"M\". */\nexport function formatCount(n: number): string {\n  const abs = Math.abs(n);\n  if (abs < 1000) return String(n);\n  if (abs < 1_000_000) return compactWithUnit(n / 1000, \"k\");\n  return compactWithUnit(n / 1_000_000, \"M\");\n}\n\n/** Strip Go's `Test` prefix and split CamelCase / subtest names into words. */\nexport function humanizeName(name: string, framework?: string): string {\n  if (!name) return \"\";\n  if (framework !== \"go test\") return name;\n  if (name.endsWith(\"/\")) return name;\n  return name\n    .split(\"/\")\n    .map((p, i) => {\n      if (i === 0) {\n        return p.replace(/^Test/, \"\").replace(/([a-z0-9])([A-Z])/g, \"$1 $2\");\n      }\n      return p.replace(/_/g, \" \");\n    })\n    .join(\" / \");\n}\n\n// --- tree transforms -----------------------------------------------------\n\n/** Unique non-task frameworks present in the forest, sorted. */\nexport function collectFrameworks(tests: Test[]): string[] {\n  const set = new Set<string>();\n  const walk = (t: Test) => {\n    if (t.framework && t.framework !== \"task\") set.add(t.framework);\n    (t.children || []).forEach(walk);\n  };\n  tests.forEach(walk);\n  return Array.from(set).sort();\n}\n\nfunction joinChainNames(parent: string | undefined, child: string | undefined): string {\n  const p = (parent ?? \"\").trim();\n  const c = (child ?? \"\").trim();\n  if (!p) return c;\n  if (!c) return p;\n  return `${p} > ${c}`;\n}\n\nfunction isCollapsibleContainer(t: Test): boolean {\n  return !(t.passed || t.failed || t.skipped || t.pending);\n}\n\n// Re-deriving a collapsed/filtered node invalidates any cached summary; drop it\n// so callers re-roll-up from the surviving children.\nfunction withoutSummary(t: Test): Omit<Test, \"summary\"> & { summary?: never } {\n  const { summary: _summary, ...rest } = t;\n  return rest;\n}\n\nfunction collapseNode(t: Test): Test {\n  const children = t.children ?? [];\n  if (children.length === 0) return t;\n\n  const collapsedChildren = children.map(collapseNode);\n\n  const onlyChild = collapsedChildren.length === 1 ? collapsedChildren[0] : undefined;\n  if (onlyChild && isCollapsibleContainer(t)) {\n    return { ...withoutSummary(onlyChild), name: joinChainNames(t.name, onlyChild.name) };\n  }\n\n  return { ...t, children: collapsedChildren };\n}\n\n/**\n * Compress any status-less container with exactly one child into that child,\n * joining names with \" > \". Recursive, so chains collapse into a single row.\n */\nexport function collapseSingleChildChains(tests: Test[]): Test[] {\n  return tests.map(collapseNode);\n}\n\nfunction matchesLeaf(\n  t: Test,\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): boolean {\n  const s = testStatus(t);\n  if (s === null) return false;\n  return matchesFilterState(s, statusFilter) && matchesFilterState(t.framework, frameworkFilter);\n}\n\nfunction filterNode(\n  t: Test,\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): Test | null {\n  if (t.children && t.children.length > 0) {\n    const filtered = t.children\n      .map((c) => filterNode(c, statusFilter, frameworkFilter))\n      .filter(Boolean) as Test[];\n    if (filtered.length === 0) return null;\n    return { ...withoutSummary(t), children: filtered };\n  }\n  return matchesLeaf(t, statusFilter, frameworkFilter) ? t : null;\n}\n\n/** Prune leaves not matching the status/framework filters; drop empty branches. */\nexport function filterTests(\n  tests: Test[],\n  statusFilter: FilterState<string>,\n  frameworkFilter: FilterState<string>,\n): Test[] {\n  if (statusFilter.size === 0 && frameworkFilter.size === 0) return tests;\n  return tests\n    .map((t) => filterNode(t, statusFilter, frameworkFilter))\n    .filter(Boolean) as Test[];\n}\n"],"names":["r"],"mappings":";;;;;;;;AAqCA,MAAM,cAAc,OAAqB;AAAA,EACvC,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,QAAQ;AAAA,EACR,SAAS;AAAA,EACT,SAAS;AAAA,EACT,SAAS;AAAA,EACT,UAAU;AACZ;AAEA,MAAM,YAAY,CAAC,GAAiB,MAAoB;AACtD,IAAE,SAAS,EAAE;AACb,IAAE,UAAU,EAAE;AACd,IAAE,UAAU,EAAE;AACd,IAAE,UAAU,EAAE;AACd,IAAE,WAAW,EAAE;AACf,IAAE,WAAW,EAAE;AACf,IAAE,WAAW,EAAE;AACf,IAAE,YAAY,EAAE;AAClB;AAEA,MAAM,oBAAoB,CAAC,aAAwC;AAAA,EACjE,OAAO,QAAQ;AAAA,EACf,QAAQ,QAAQ;AAAA,EAChB,QAAQ,QAAQ;AAAA,EAChB,QAAQ,QAAQ,UAAU;AAAA,EAC1B,SAAS,QAAQ;AAAA,EACjB,SAAS,QAAQ,WAAW;AAAA,EAC5B,SAAS,QAAQ,WAAW;AAAA,EAC5B,UAAU;AACZ;AAEA,MAAM,iBAAiB,CAAC,MAA0B;AAChD,QAAM,aAAa,CAAC,CAAC,EAAE;AACvB,QAAM,UACJ,cAAc,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE;AAChF,SAAO;AAAA,IACL,OAAO,UAAU,IAAI;AAAA,IACrB,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,QAAQ,CAAC,cAAc,EAAE,SAAS,IAAI;AAAA,IACtC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,SAAS,CAAC,cAAc,EAAE,UAAU,IAAI;AAAA,IACxC,UAAU,aAAa,IAAI;AAAA,EAAA;AAE/B;AAEO,SAAS,IAAI,GAAuB;AACzC,MAAI,EAAE,QAAS,QAAO,kBAAkB,EAAE,OAAO;AACjD,MAAI,CAAC,EAAE,YAAY,EAAE,SAAS,WAAW,EAAG,QAAO,eAAe,CAAC;AACnE,QAAM,IAAI,YAAA;AACV,aAAW,KAAK,EAAE,oBAAoB,GAAG,IAAI,CAAC,CAAC;AAC/C,SAAO;AACT;AAGO,SAAS,gBAAgB,GAAuB;AACrD,MAAI,EAAE,cAAc,QAAQ;AAC1B,UAAMA,KAAI,YAAA;AACV,eAAW,KAAK,EAAE,YAAY,CAAA,EAAI,WAAUA,IAAG,gBAAgB,CAAC,CAAC;AACjE,WAAOA;AAAAA,EACT;AACA,MAAI,EAAE,QAAS,QAAO,kBAAkB,EAAE,OAAO;AACjD,MAAI,CAAC,EAAE,YAAY,EAAE,SAAS,WAAW,EAAG,QAAO,eAAe,CAAC;AACnE,QAAM,IAAI,YAAA;AACV,aAAW,KAAK,EAAE,oBAAoB,GAAG,gBAAgB,CAAC,CAAC;AAC3D,SAAO;AACT;AAEO,SAAS,UAAU,GAAkB;AAC1C,MAAI,EAAE,OAAQ,QAAO;AACrB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,SAAS;AAC1C;AAEO,SAAS,WAAW,GAAkB;AAC3C,MAAI,EAAE,QAAS,QAAO;AACtB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,UAAU;AAC3C;AAEA,SAAS,sBAAsB,GAAkB;AAC/C,MAAI,EAAE,UAAW,QAAO;AACxB,UAAQ,EAAE,YAAY,CAAA,GAAI,KAAK,qBAAqB;AACtD;AAEO,SAAS,cAAc,GAAiB;AAC7C,MAAI,EAAE,YAAY,EAAE,WAAW,UAAU,EAAE;AAC3C,MAAI,IAAI;AACR,aAAW,KAAK,EAAE,YAAY,CAAA,EAAI,MAAK,cAAc,CAAC;AACtD,SAAO;AACT;AAcO,SAAS,WAAW,GAA4B;AACrD,MAAI,EAAE,UAAW,QAAO;AACxB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,SAAO;AACT;AAGO,SAAS,cAAc,GAA8B;AAC1D,MAAI,EAAE,UAAW,QAAO;AACxB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,sBAAsB,CAAC,EAAG,QAAO;AACrC,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAGO,SAAS,cAAc,GAAoB;AAChD,MAAI,EAAE,UAAW,QAAO;AACxB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,QAAS,QAAO;AACtB,MAAI,EAAE,OAAQ,QAAO;AACrB,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,IAAI,IAAI,CAAC;AACf,QAAI,sBAAsB,CAAC,EAAG,QAAO;AACrC,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,SAAS,EAAG,QAAO;AACzB,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,QAAI,EAAE,UAAU,EAAG,QAAO;AAC1B,WAAO;AAAA,EACT;AACA,SAAO;AACT;AASO,SAAS,mBAAmB,IAAoB;AACrD,MAAI,MAAM,EAAG,QAAO;AACpB,QAAM,KAAK,KAAK;AAChB,MAAI,KAAK,IAAM,QAAO,GAAG,GAAG,QAAQ,CAAC,CAAC;AACtC,SAAO,IAAI,KAAK,KAAM,QAAQ,CAAC,CAAC;AAClC;AAEA,SAAS,gBAAgB,OAAe,MAAsB;AAC5D,QAAM,UACJ,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,EAAE,SAAA,IAAa,MAAM,QAAQ,CAAC,EAAE,QAAQ,QAAQ,EAAE;AAC5F,SAAO,GAAG,OAAO,GAAG,IAAI;AAC1B;AAGO,SAAS,YAAY,GAAmB;AAC7C,QAAM,MAAM,KAAK,IAAI,CAAC;AACtB,MAAI,MAAM,IAAM,QAAO,OAAO,CAAC;AAC/B,MAAI,MAAM,IAAW,QAAO,gBAAgB,IAAI,KAAM,GAAG;AACzD,SAAO,gBAAgB,IAAI,KAAW,GAAG;AAC3C;AAGO,SAAS,aAAa,MAAc,WAA4B;AACrE,MAAI,CAAC,KAAM,QAAO;AAClB,MAAI,cAAc,UAAW,QAAO;AACpC,MAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,SAAO,KACJ,MAAM,GAAG,EACT,IAAI,CAAC,GAAG,MAAM;AACb,QAAI,MAAM,GAAG;AACX,aAAO,EAAE,QAAQ,SAAS,EAAE,EAAE,QAAQ,sBAAsB,OAAO;AAAA,IACrE;AACA,WAAO,EAAE,QAAQ,MAAM,GAAG;AAAA,EAC5B,CAAC,EACA,KAAK,KAAK;AACf;AAKO,SAAS,kBAAkB,OAAyB;AACzD,QAAM,0BAAU,IAAA;AAChB,QAAM,OAAO,CAAC,MAAY;AACxB,QAAI,EAAE,aAAa,EAAE,cAAc,OAAQ,KAAI,IAAI,EAAE,SAAS;AAC9D,KAAC,EAAE,YAAY,IAAI,QAAQ,IAAI;AAAA,EACjC;AACA,QAAM,QAAQ,IAAI;AAClB,SAAO,MAAM,KAAK,GAAG,EAAE,KAAA;AACzB;AAEA,SAAS,eAAe,QAA4B,OAAmC;AACrF,QAAM,KAAK,UAAU,IAAI,KAAA;AACzB,QAAM,KAAK,SAAS,IAAI,KAAA;AACxB,MAAI,CAAC,EAAG,QAAO;AACf,MAAI,CAAC,EAAG,QAAO;AACf,SAAO,GAAG,CAAC,MAAM,CAAC;AACpB;AAEA,SAAS,uBAAuB,GAAkB;AAChD,SAAO,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE;AAClD;AAIA,SAAS,eAAe,GAAsD;AAC5E,QAAM,EAAE,SAAS,UAAU,GAAG,SAAS;AACvC,SAAO;AACT;AAEA,SAAS,aAAa,GAAe;AACnC,QAAM,WAAW,EAAE,YAAY,CAAA;AAC/B,MAAI,SAAS,WAAW,EAAG,QAAO;AAElC,QAAM,oBAAoB,SAAS,IAAI,YAAY;AAEnD,QAAM,YAAY,kBAAkB,WAAW,IAAI,kBAAkB,CAAC,IAAI;AAC1E,MAAI,aAAa,uBAAuB,CAAC,GAAG;AAC1C,WAAO,EAAE,GAAG,eAAe,SAAS,GAAG,MAAM,eAAe,EAAE,MAAM,UAAU,IAAI,EAAA;AAAA,EACpF;AAEA,SAAO,EAAE,GAAG,GAAG,UAAU,kBAAA;AAC3B;AAMO,SAAS,0BAA0B,OAAuB;AAC/D,SAAO,MAAM,IAAI,YAAY;AAC/B;AAEA,SAAS,YACP,GACA,cACA,iBACS;AACT,QAAM,IAAI,WAAW,CAAC;AACtB,MAAI,MAAM,KAAM,QAAO;AACvB,SAAO,mBAAmB,GAAG,YAAY,KAAK,mBAAmB,EAAE,WAAW,eAAe;AAC/F;AAEA,SAAS,WACP,GACA,cACA,iBACa;AACb,MAAI,EAAE,YAAY,EAAE,SAAS,SAAS,GAAG;AACvC,UAAM,WAAW,EAAE,SAChB,IAAI,CAAC,MAAM,WAAW,GAAG,cAAc,eAAe,CAAC,EACvD,OAAO,OAAO;AACjB,QAAI,SAAS,WAAW,EAAG,QAAO;AAClC,WAAO,EAAE,GAAG,eAAe,CAAC,GAAG,UAAU,SAAA;AAAA,EAC3C;AACA,SAAO,YAAY,GAAG,cAAc,eAAe,IAAI,IAAI;AAC7D;AAGO,SAAS,YACd,OACA,cACA,iBACQ;AACR,MAAI,aAAa,SAAS,KAAK,gBAAgB,SAAS,EAAG,QAAO;AAClE,SAAO,MACJ,IAAI,CAAC,MAAM,WAAW,GAAG,cAAc,eAAe,CAAC,EACvD,OAAO,OAAO;AACnB;"}