opencode-acp 1.14.8-dev.2 → 1.14.8-dev.3

package/README.md

@@ -492,6 +492,15 @@ For the complete list with root cause analysis, see the [bug tracker](https://gi
 
 ## Changelog
 
+### v1.14.8-dev.3 — Dev Prerelease (1 PR since v1.14.8-dev.2)
+
+Dev prerelease covering PR #248. Published to `dev` npm tag for early testing.
+
+**PRs included**:
+- **#248** — Fix: auto-extend compression ranges to prevent splitting tool_use/tool_result pairs. When the model selects a compression boundary that falls between a tool call and its result, the orphaned tool_result references a non-existent tool_use_id → API rejection. New `adjustBoundariesForToolPairs` in `compress/search.ts` scans forward/backward (up to 20 messages) to include the matching pair. Excludes `compress` tool (force-protected) and only extends message boundaries (never block boundaries) to avoid tier misclassification. 11 tests.
+
+**Install**: `opencode plugin opencode-acp@dev --global`
+
 ### v1.14.8-dev.2 — Dev Prerelease (2 PRs since v1.14.8-dev.1)
 
 Dev prerelease covering PRs #244–#245. Published to `dev` npm tag for early testing.

package/README.zh-CN.md

@@ -446,6 +446,15 @@ ACP 是 DCP 的直接替代品。迁移步骤：
 
 ## 更新日志
 
+### v1.14.8-dev.3 — Dev 预发布（v1.14.8-dev.2 以来 1 个 PR）
+
+Dev 预发布，涵盖 PR #248。发布到 `dev` npm tag 供早期测试。
+
+**包含的 PR**：
+- **#248** — 修复：自动扩展压缩范围以防止拆分 tool_use/tool_result 配对。当模型选择的压缩边界落在 tool 调用与其结果之间时，孤立的 tool_result 引用不存在的 tool_use_id → API 拒绝。新增 `adjustBoundariesForToolPairs`（`compress/search.ts`）向前/向后扫描（最多 20 条消息）以包含匹配的配对。排除 `compress` 工具（强制保护）并仅扩展消息边界（从不扩展 block 边界）以避免层级错误分类。11 个测试。
+
+**安装**：`opencode plugin opencode-acp@dev --global`
+
 ### v1.14.8-dev.2 — Dev 预发布（v1.14.8-dev.1 以来 2 个 PR）
 
 Dev 预发布，涵盖 PR #244–#245。发布到 `dev` npm tag 供早期测试。

package/dist/index.js

@@ -3040,8 +3040,79 @@ ${hint}` : body);
   if (startReference.rawIndex > endReference.rawIndex) {
     [startReference, endReference] = [endReference, startReference];
   }
+  const adjusted = adjustBoundariesForToolPairs(
+    context,
+    startReference.rawIndex,
+    endReference.rawIndex
+  );
+  if (adjusted.startIndex < startReference.rawIndex && startReference.kind === "message") {
+    const msg = context.rawMessages[adjusted.startIndex];
+    if (msg) {
+      startReference = {
+        kind: "message",
+        rawIndex: adjusted.startIndex,
+        messageId: msg.info.id
+      };
+    }
+  }
+  if (adjusted.endIndex > endReference.rawIndex && endReference.kind === "message") {
+    const msg = context.rawMessages[adjusted.endIndex];
+    if (msg) {
+      endReference = {
+        kind: "message",
+        rawIndex: adjusted.endIndex,
+        messageId: msg.info.id
+      };
+    }
+  }
   return { startReference, endReference };
 }
+function adjustBoundariesForToolPairs(context, startIdx, endIdx) {
+  const messages = context.rawMessages;
+  const callIdsInRange = /* @__PURE__ */ new Set();
+  for (let i = startIdx; i <= endIdx; i++) {
+    const msg = messages[i];
+    if (!msg) continue;
+    const parts = Array.isArray(msg.parts) ? msg.parts : [];
+    for (const part of parts) {
+      if (part.type !== "tool" || !part.callID) continue;
+      if (part.tool === "compress") continue;
+      callIdsInRange.add(part.callID);
+    }
+  }
+  if (callIdsInRange.size === 0) {
+    return { startIndex: startIdx, endIndex: endIdx };
+  }
+  let newEndIdx = endIdx;
+  for (let i = endIdx + 1; i < messages.length && i <= endIdx + 20; i++) {
+    const msg = messages[i];
+    if (!msg) break;
+    const parts = Array.isArray(msg.parts) ? msg.parts : [];
+    const hasMatch = parts.some(
+      (part) => part.type === "tool" && part.callID && callIdsInRange.has(part.callID)
+    );
+    if (hasMatch) {
+      newEndIdx = i;
+    } else if (newEndIdx > endIdx) {
+      break;
+    }
+  }
+  let newStartIdx = startIdx;
+  for (let i = startIdx - 1; i >= 0 && i >= startIdx - 20; i--) {
+    const msg = messages[i];
+    if (!msg) break;
+    const parts = Array.isArray(msg.parts) ? msg.parts : [];
+    const hasMatch = parts.some(
+      (part) => part.type === "tool" && part.callID && callIdsInRange.has(part.callID)
+    );
+    if (hasMatch) {
+      newStartIdx = i;
+    } else if (newStartIdx < startIdx) {
+      break;
+    }
+  }
+  return { startIndex: newStartIdx, endIndex: newEndIdx };
+}
 function buildBoundaryRecoveryHint(context, state) {
   const visibleRefs = [];
   for (const [messageRef, messageId] of state.messageIds.byRef) {
@@ -8821,7 +8892,7 @@ import { writeFile as writeFile2, mkdir as mkdir2 } from "fs/promises";
 import { join as join3 } from "path";
 import { existsSync as existsSync3 } from "fs";
 import { homedir as homedir3 } from "os";
-var LOG_VERSION = true ? "1.14.8-dev.2" : "dev";
+var LOG_VERSION = true ? "1.14.8-dev.3" : "dev";
 var Logger = class {
   logDir;
   enabled;