@inerrata-corporation/errata 2.0.2-dev.313 → 2.0.2-dev.332

package/errata.mjs

@@ -18609,22 +18609,26 @@ function priorsForFile(store, relPath) {
   if (!file2) return null;
   const openProblems = [];
   const constraints = [];
+  const resolvedProblems = [];
   const seenProblem = /* @__PURE__ */ new Set();
   const related = /* @__PURE__ */ new Map();
   for (const e of store.inEdges(file2.id, ["ANCHORED_AT"])) {
     const n = store.getNode(e.from);
     if (!n) continue;
     if (n.label === "Problem") {
-      if (!n.attrs["resolvedAt"] && !seenProblem.has(n.id)) {
-        seenProblem.add(n.id);
+      if (seenProblem.has(n.id)) continue;
+      seenProblem.add(n.id);
+      if (!n.attrs["resolvedAt"]) {
         (isConstraintProblem(n) ? constraints : openProblems).push(n);
+      } else if (n.attrs["resolvedAs"] == null && n.attrs["mergedInto"] === void 0 && e.attrs?.["anchorProvenance"] !== "legacy") {
+        resolvedProblems.push(n);
       }
     } else if (CITABLE_PRIOR_LABELS.has(n.label)) {
       related.set(n.id, n);
     }
   }
   const solutionsByProblem = /* @__PURE__ */ new Map();
-  for (const p of [...openProblems, ...constraints]) {
+  for (const p of [...openProblems, ...constraints, ...resolvedProblems]) {
     for (const e of store.outEdges(p.id, ["SOLVED_BY", "CAUSED_BY", "INSTANCE_OF"])) {
       const n = store.getNode(e.to);
       if (n && CITABLE_PRIOR_LABELS.has(n.label)) related.set(n.id, n);
@@ -18635,11 +18639,22 @@ function priorsForFile(store, relPath) {
       }
     }
   }
-  if (openProblems.length === 0 && constraints.length === 0 && related.size === 0) return null;
+  if (openProblems.length === 0 && constraints.length === 0 && resolvedProblems.length === 0 && related.size === 0)
+    return null;
   const recentFirst = (a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0);
   openProblems.sort(recentFirst);
   constraints.sort(recentFirst);
-  return { file: file2, openProblems, constraints, related: [...related.values()], solutionsByProblem };
+  resolvedProblems.sort(
+    (a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)
+  );
+  return {
+    file: file2,
+    openProblems,
+    constraints,
+    resolvedProblems,
+    related: [...related.values()],
+    solutionsByProblem
+  };
 }
 function anchorProblemToDiff(store, problemId, changedPaths, workspaceId2, t, opts = {}) {
   return anchorNodeToDiff(store, problemId, "Problem", changedPaths, workspaceId2, t, opts);
@@ -21268,9 +21283,10 @@ function sliceForFile(store, relPath) {
   const priors = fp ? {
     openProblems: fp.openProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.description })),
     constraints: fp.constraints.slice(0, 2).map((c) => ({ id: c.id, description: c.description })),
+    resolvedProblems: fp.resolvedProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.description })),
     related: fp.related.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.description })),
     solutionsByProblem: Object.fromEntries(
-      fp.openProblems.slice(0, 3).map((p) => [
+      [...fp.openProblems.slice(0, 3), ...fp.resolvedProblems.slice(0, 3)].map((p) => [
         p.id,
         (fp.solutionsByProblem.get(p.id) ?? []).slice(0, 4).map((s) => ({ id: s.id, description: s.description }))
       ])
@@ -21462,6 +21478,19 @@ function renderSnapshot(s) {
         lines.push(`  - ${c.description} \u2192 \`([${c.id}])\``);
       }
     }
+    if (w.priors?.resolvedProblems.length) {
+      lines.push(
+        "- **Already fixed here** \u2014 these are RESOLVED, not open work, so there is no `(fix:)` token. They are shown for the opposite reason: if one has come BACK, that is a contradiction of the solution below it, and the most valuable thing you can report. Say so with `[!recurred: \u2026]` naming the problem, and cite the solution that did not hold with `([id])`:"
+      );
+      for (const p of w.priors.resolvedProblems) {
+        lines.push(`  - \u2713 ${p.description} \u2192 \`([${p.id}])\``);
+        for (const s2 of w.priors.solutionsByProblem[p.id] ?? []) {
+          lines.push(
+            `    - fixed by: ${s2.description} \u2014 if that fix did NOT hold, contradict it: \`([${s2.id}])\``
+          );
+        }
+      }
+    }
     if (w.priors?.related.length) {
       lines.push("- **Related priors** (cite with `([id])` where you lean on one):");
       for (const n of w.priors.related) {
@@ -25885,7 +25914,7 @@ var init_scrub = __esm({
     EMAIL_RE = /\b[A-Za-z0-9._%+\-]+@[A-Za-z0-9.\-]+\.[A-Za-z]{2,}\b/g;
     IPV4_RE = /\b(?:\d{1,3}\.){3}\d{1,3}\b/g;
     IPV6_RE = /\b(?:[A-Fa-f0-9]{1,4}:){2,7}[A-Fa-f0-9:]{1,4}\b/g;
-    WIN_PATH_RE = /\b[A-Za-z]:[\\/](?:[^\\/\s"']+[\\/])*[^\\/\s"']*/g;
+    WIN_PATH_RE = /\b[A-Za-z]:[\\/](?![\\/])(?:[^\\/\s"']+[\\/])*[^\\/\s"']*/g;
     WIN_UNC_RE = /\\\\[A-Za-z0-9_\-]+\\[A-Za-z0-9_\-$]+(?:\\[^\\\s"']+)*/g;
     POSIX_USER_PATH_RE = /\/(?:Users|home)\/[A-Za-z0-9_\-\.]+(?:\/[^"'\s)]+)*/g;
     LONG_HASH_RE = /\b[a-fA-F0-9]{24,}\b/g;
@@ -53006,7 +53035,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.2-dev.313" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.2-dev.332" : "2.0.0-alpha.0";
 var IGNORED_PATH = /[\\/](?:\.git|node_modules|\.errata|\.claude|\.codex|\.cursor|\.turbo|\.next|dist|coverage|test-results|playwright-report|__pycache__)(?:[\\/]|$)/;
 var IGNORED_NOISE = /castalia\.db|eventlog\.sqlite|turn-cursors/;
 var GIT_OP_MUTE_MS = 4e3;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@inerrata-corporation/errata",
-  "version": "2.0.2-dev.313",
+  "version": "2.0.2-dev.332",
   "description": "errata - local-first observation engine for AI coding agents",
   "type": "module",
   "bin": {

package/pass-worker.mjs

@@ -25322,22 +25322,26 @@ function priorsForFile(store2, relPath) {
   if (!file2) return null;
   const openProblems = [];
   const constraints = [];
+  const resolvedProblems = [];
   const seenProblem = /* @__PURE__ */ new Set();
   const related = /* @__PURE__ */ new Map();
   for (const e of store2.inEdges(file2.id, ["ANCHORED_AT"])) {
     const n = store2.getNode(e.from);
     if (!n) continue;
     if (n.label === "Problem") {
-      if (!n.attrs["resolvedAt"] && !seenProblem.has(n.id)) {
-        seenProblem.add(n.id);
+      if (seenProblem.has(n.id)) continue;
+      seenProblem.add(n.id);
+      if (!n.attrs["resolvedAt"]) {
         (isConstraintProblem(n) ? constraints : openProblems).push(n);
+      } else if (n.attrs["resolvedAs"] == null && n.attrs["mergedInto"] === void 0 && e.attrs?.["anchorProvenance"] !== "legacy") {
+        resolvedProblems.push(n);
       }
     } else if (CITABLE_PRIOR_LABELS.has(n.label)) {
       related.set(n.id, n);
     }
   }
   const solutionsByProblem = /* @__PURE__ */ new Map();
-  for (const p of [...openProblems, ...constraints]) {
+  for (const p of [...openProblems, ...constraints, ...resolvedProblems]) {
     for (const e of store2.outEdges(p.id, ["SOLVED_BY", "CAUSED_BY", "INSTANCE_OF"])) {
       const n = store2.getNode(e.to);
       if (n && CITABLE_PRIOR_LABELS.has(n.label)) related.set(n.id, n);
@@ -25348,11 +25352,22 @@ function priorsForFile(store2, relPath) {
       }
     }
   }
-  if (openProblems.length === 0 && constraints.length === 0 && related.size === 0) return null;
+  if (openProblems.length === 0 && constraints.length === 0 && resolvedProblems.length === 0 && related.size === 0)
+    return null;
   const recentFirst = (a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0);
   openProblems.sort(recentFirst);
   constraints.sort(recentFirst);
-  return { file: file2, openProblems, constraints, related: [...related.values()], solutionsByProblem };
+  resolvedProblems.sort(
+    (a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)
+  );
+  return {
+    file: file2,
+    openProblems,
+    constraints,
+    resolvedProblems,
+    related: [...related.values()],
+    solutionsByProblem
+  };
 }
 function recordAnchorHint(store2, problemId, relPath, provenance, ts) {
   const p = store2.getNode(problemId);
@@ -26320,9 +26335,10 @@ function sliceForFile(store2, relPath) {
   const priors = fp ? {
     openProblems: fp.openProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.description })),
     constraints: fp.constraints.slice(0, 2).map((c) => ({ id: c.id, description: c.description })),
+    resolvedProblems: fp.resolvedProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.description })),
     related: fp.related.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.description })),
     solutionsByProblem: Object.fromEntries(
-      fp.openProblems.slice(0, 3).map((p) => [
+      [...fp.openProblems.slice(0, 3), ...fp.resolvedProblems.slice(0, 3)].map((p) => [
         p.id,
         (fp.solutionsByProblem.get(p.id) ?? []).slice(0, 4).map((s) => ({ id: s.id, description: s.description }))
       ])