@inerrata-corporation/errata 2.0.2-dev.192 → 2.0.2-dev.201

package/package.json

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

package/pass-worker.mjs

@@ -25145,6 +25145,9 @@ function backfillProblemContext(store2, ts) {
 }
 
 // ../../packages/local-graph/src/design-problem.ts
+function isConstraintProblem(node) {
+  return node.attrs["kind"] === "constraint";
+}
 function buildNode(id, label, description, ts, attrs) {
   return {
     id,
@@ -25200,6 +25203,7 @@ function priorsForFile(store2, relPath) {
   }
   if (!file2) return null;
   const openProblems = [];
+  const constraints = [];
   const seenProblem = /* @__PURE__ */ new Set();
   const related = /* @__PURE__ */ new Map();
   for (const e of store2.inEdges(file2.id, ["ANCHORED_AT"])) {
@@ -25208,14 +25212,14 @@ function priorsForFile(store2, relPath) {
     if (n.label === "Problem") {
       if (!n.attrs["resolvedAt"] && !seenProblem.has(n.id)) {
         seenProblem.add(n.id);
-        openProblems.push(n);
+        (isConstraintProblem(n) ? constraints : openProblems).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) {
+  for (const p of [...openProblems, ...constraints]) {
     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);
@@ -25226,9 +25230,11 @@ function priorsForFile(store2, relPath) {
       }
     }
   }
-  if (openProblems.length === 0 && related.size === 0) return null;
-  openProblems.sort((a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0));
-  return { file: file2, openProblems, related: [...related.values()], solutionsByProblem };
+  if (openProblems.length === 0 && constraints.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 };
 }
 function recordAnchorHint(store2, problemId, relPath, provenance, ts) {
   const p = store2.getNode(problemId);
@@ -25245,6 +25251,7 @@ function resolveDesignProblems(store2, t) {
   for (const p of store2.findNodesByLabel("Problem")) {
     if (!p.id.startsWith("dprob_")) continue;
     if (p.attrs["resolvedAt"]) continue;
+    if (isConstraintProblem(p)) continue;
     let symName = "";
     let symRelPath;
     let edited = false;
@@ -25731,6 +25738,7 @@ function mergeDuplicateProblems(store2, opts) {
         if (consumed.has(b.id)) continue;
         const tb = tokens.get(b.id);
         if (Math.min(ta.size, tb.size) < minTokens) continue;
+        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
         if (overlap(ta, tb) >= minOverlap) {
           cluster.push(b);
           consumed.add(b.id);
@@ -26063,12 +26071,14 @@ var AGENTS_POINTER_BODY = [
 init_src2();
 function buildSnapshot(opts) {
   const problems = opts.store.findNodesByLabel("Problem").filter((p) => p.attrs["mergedInto"] === void 0);
-  const allProblems = problems.filter((p) => p.attrs["resolvedAt"] == null);
+  const stillOpen = problems.filter((p) => p.attrs["resolvedAt"] == null);
+  const allProblems = stillOpen.filter((p) => !isConstraintProblem(p));
   allProblems.sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt);
   const recent = allProblems.slice(0, 8).map((p) => ({
     node: p,
     anchors: opts.store.outEdges(p.id, ["MANIFESTED_IN", "EVIDENCED_BY"])
   }));
+  const recentConstraints = stillOpen.filter((p) => isConstraintProblem(p)).sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt).slice(0, 3);
   const recentResolved = problems.filter((p) => p.attrs["resolvedAt"] != null && p.attrs["resolvedAs"] == null).sort((a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)).slice(0, 4).map((p) => {
     const solEdge = opts.store.outEdges(p.id, ["SOLVED_BY"])[0];
     const solution = solEdge ? opts.store.getNode(solEdge.to) ?? void 0 : void 0;
@@ -26135,6 +26145,7 @@ function buildSnapshot(opts) {
     profileContext,
     recentProblems: recent,
     recentResolved,
+    recentConstraints,
     ...causalNudge ? { causalNudge } : {},
     ...domainNudge ? { domainNudge } : {},
     motifs,
@@ -26187,6 +26198,7 @@ function sliceForFile(store2, relPath) {
   const fp = priorsForFile(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 })),
     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) => [