baro-ai 0.117.1 → 0.117.3

package/dist/cli.mjs

@@ -60108,7 +60108,12 @@ var CollectiveBoard = class extends SerializedObserver {
       baseGraphVersion: this.runtimeReplans.graphVersion,
       reason: `autonomous remediation for ${invariantIds.join(", ")}: ` + remediation.reason,
       mutation: {
-        addedStories: [remediation.story],
+        addedStories: [
+          this.withRemediationPrerequisites(
+            remediation.story,
+            invariantIds
+          )
+        ],
         removedStoryIds: [],
         modifiedDeps: {}
       }
@@ -60162,6 +60167,23 @@ var CollectiveBoard = class extends SerializedObserver {
       else this.scheduleNextWave();
     }
   }
+  /**
+   * A remediation waits for every queued, not-yet-integrated story already
+   * working the same invariants — e.g. the chain a surgeon split out of the
+   * previous remediation. Running beside that chain, it re-attempts work
+   * whose prerequisite has not landed and the review rejects it every turn
+   * (#199). Leased stories are left out: the story that raised the challenge
+   * is one, and a remediation must not wait on its own source.
+   */
+  withRemediationPrerequisites(story, invariantIds) {
+    const targets = new Set(invariantIds);
+    const prerequisites = (this.prd?.userStories ?? []).filter((candidate) => candidate.id !== story.id && !candidate.passes && !this.completed.includes(candidate.id) && !this.failed.has(candidate.id) && !this.leases.has(candidate.id) && (candidate.goalInvariantIds ?? []).some((id) => targets.has(id))).map(({ id }) => id);
+    if (prerequisites.length === 0) return story;
+    return {
+      ...story,
+      dependsOn: [.../* @__PURE__ */ new Set([...story.dependsOn, ...prerequisites])].sort()
+    };
+  }
   emitGoalRemediationAdmitted(remediation, graphVersion, disposition) {
     this.emit(
       GoalInvariantRemediationAdmitted.create({
@@ -61243,7 +61265,8 @@ function addUnique(values, value) {
   if (!values.includes(value)) values.push(value);
 }
 function sameRemediationStory(current, expected) {
-  return current.id === expected.id && current.priority === expected.priority && current.title === expected.title && current.description === expected.description && sameStrings(current.dependsOn, expected.dependsOn) && current.retries === (expected.retries ?? 2) && sameStrings(current.acceptance, expected.acceptance ?? []) && sameStrings(current.tests, expected.tests ?? []) && sameStrings(
+  return current.id === expected.id && current.priority === expected.priority && current.title === expected.title && current.description === expected.description && // Admission may add same-invariant prerequisites to the proposal.
+  expected.dependsOn.every((id) => current.dependsOn.includes(id)) && sameStrings(current.acceptance, expected.acceptance ?? []) && sameStrings(current.tests, expected.tests ?? []) && sameStrings(
     current.goalInvariantIds ?? [],
     expected.goalInvariantIds ?? []
   ) && current.model === expected.model;
@@ -62016,6 +62039,7 @@ function boundedChallengeReason(reason) {
   const cut = sentenceEnd > MAX_CRITERION_REASON_CHARS / 2 ? window2.slice(0, sentenceEnd + 1) : window2.slice(0, Math.max(window2.lastIndexOf(" "), 1));
   return `${cut} \u2026 [truncated; the full reasoning is in the story description]`;
 }
+var REMEDIATION_STORY_RETRIES = 0;
 function legacyRemediationStory(storyId, { challenge, invariant }) {
   return {
     id: storyId,
@@ -62025,7 +62049,7 @@ function legacyRemediationStory(storyId, { challenge, invariant }) {
 Observed risk: ${challenge.reason}
 Implement the smallest correct fix and focused regression evidence; preserve every other GoalContract invariant.`,
     dependsOn: [],
-    retries: 2,
+    retries: REMEDIATION_STORY_RETRIES,
     acceptance: [
       `[${invariant.id}] ${invariant.text}`,
       `Challenge ${challenge.challengeId} is addressed: ${boundedChallengeReason(challenge.reason)}`,
@@ -62047,7 +62071,7 @@ function groupedRemediationStory(storyId, targets) {
 ` + targets.map(({ challenge, invariant }) => `[${invariant.id}] ${invariant.text}
 Observed risk: ${challenge.reason}`).join("\n") + "\nImplement the smallest correct fix and focused regression evidence; preserve every other GoalContract invariant.",
     dependsOn: [],
-    retries: 2,
+    retries: REMEDIATION_STORY_RETRIES,
     acceptance: [
       ...targets.map(({ invariant }) => `[${invariant.id}] ${invariant.text}`),
       ...targets.map(({ challenge }) => `Challenge ${challenge.challengeId} is addressed: ${boundedChallengeReason(challenge.reason)}`),
@@ -63932,7 +63956,13 @@ async function assertNoSymlinkParents(cwd, absolute) {
   let current = resolve10(cwd);
   for (const part of parts.slice(0, -1)) {
     current = resolve10(current, part);
-    const stat2 = await lstat2(current);
+    let stat2;
+    try {
+      stat2 = await lstat2(current);
+    } catch (error) {
+      if (errorCode(error) === "ENOENT") return;
+      throw error;
+    }
     if (stat2.isSymbolicLink() || !stat2.isDirectory()) {
       throw new Error(
         "fingerprint path has a symlink or non-directory parent"