@prestyj/cli 4.12.1 → 4.14.0

package/dist/tools/code-skeleton.test.js

@@ -0,0 +1,115 @@
+import { describe, it, expect } from "vitest";
+import ts from "typescript";
+import { extractSkeleton } from "./code-skeleton.js";
+/**
+ * Strong fidelity check: re-parse the skeleton and confirm `name` resolves to a
+ * real declaration (not a comment or substring). For callables we also assert
+ * the signature text carries a parameter list, so "name kept, signature lost"
+ * fails here instead of slipping through a regex.
+ */
+function skeletonDeclares(skeleton, name) {
+    const sf = ts.createSourceFile("skel.ts", skeleton, ts.ScriptTarget.Latest, true);
+    let found = false;
+    const walk = (node) => {
+        if (found)
+            return;
+        if ((ts.isFunctionDeclaration(node) ||
+            ts.isClassDeclaration(node) ||
+            ts.isInterfaceDeclaration(node) ||
+            ts.isTypeAliasDeclaration(node) ||
+            ts.isEnumDeclaration(node)) &&
+            node.name?.getText(sf) === name) {
+            found = true;
+        }
+        else if (ts.isVariableDeclaration(node) && node.name.getText(sf) === name) {
+            found = true;
+        }
+        else if (ts.isExportDeclaration(node)) {
+            if (node.exportClause && ts.isNamedExports(node.exportClause)) {
+                if (node.exportClause.elements.some((e) => e.name.text === name))
+                    found = true;
+            }
+        }
+        ts.forEachChild(node, walk);
+    };
+    walk(sf);
+    return found;
+}
+describe("extractSkeleton", () => {
+    it("keeps re-export barrels (export {} from / export *) — does NOT render them empty", () => {
+        const src = `
+      export { foo, bar } from "./other.js";
+      export * from "./barrel.js";
+    `;
+        const r = extractSkeleton(src);
+        expect(r.empty).toBe(false);
+        expect(r.skeleton).toContain('export { foo, bar } from "./other.js"');
+        expect(r.skeleton).toContain('export * from "./barrel.js"');
+        expect(skeletonDeclares(r.skeleton, "foo")).toBe(true);
+        expect(skeletonDeclares(r.skeleton, "bar")).toBe(true);
+    });
+    it("preserves the callable signature of an exported arrow const", () => {
+        const src = `export const handler = async (req: Request, opts: Opts): Promise<Response> => {
+      return new Response("hi");
+    };`;
+        const r = extractSkeleton(src);
+        expect(r.skeleton).toContain("req: Request");
+        expect(r.skeleton).toContain("opts: Opts");
+        expect(r.skeleton).toContain("Promise<Response>");
+        expect(r.skeleton).not.toContain('new Response("hi")'); // body gone
+        expect(r.skeleton).toContain("/* … */"); // stub marked
+    });
+    it("keeps function declarations' params/return and stubs the body", () => {
+        const src = `export function add(a: number, b: number): number {
+      const sum = a + b;
+      return sum;
+    }`;
+        const r = extractSkeleton(src);
+        expect(r.skeleton).toContain("add(a: number, b: number): number");
+        expect(r.skeleton).not.toContain("const sum");
+        expect(r.skeleton).toContain("/* … */");
+    });
+    it("keeps public class members but drops private ones", () => {
+        const src = `export class Svc extends Base {
+      private secret = 42;
+      async run(x: string): Promise<void> { await this.secret; }
+    }`;
+        const r = extractSkeleton(src);
+        expect(r.skeleton).toContain("class Svc extends Base");
+        expect(r.skeleton).toContain("run(x: string): Promise<void>");
+        expect(r.skeleton).not.toContain("secret");
+    });
+    it("keeps interfaces and type aliases whole (pure signal)", () => {
+        const src = `export interface User { id: string; name: string; }
+      export type ID = string | number;`;
+        const r = extractSkeleton(src);
+        expect(r.skeleton).toContain("id: string");
+        expect(r.skeleton).toContain("type ID = string | number");
+    });
+    it("omits internal (non-exported) consts and functions' bodies", () => {
+        const src = `const internal = computeThing();
+      export function api(): void { internal(); }`;
+        const r = extractSkeleton(src);
+        expect(r.skeleton).not.toContain("computeThing");
+        expect(r.skeleton).toContain("api(): void");
+    });
+    it("never fabricates: every line traces to source or is a marked stub", () => {
+        const src = `import { z } from "zod";
+      export function f(a: string): string { return a.trim(); }`;
+        const r = extractSkeleton(src);
+        const srcText = src;
+        for (const line of r.skeleton.split("\n")) {
+            const t = line.trim();
+            if (!t)
+                continue;
+            const isStub = t.includes("/* … */");
+            const tracesBack = srcText.includes(t.replace(/\s*\{ \/\* … \*\/ \}.*$/, "").trim());
+            expect(isStub || tracesBack).toBe(true);
+        }
+    });
+    it("reports empty for a file with no extractable API", () => {
+        const r = extractSkeleton(`const x = 1; console.log(x);`);
+        expect(r.empty).toBe(true);
+    });
+});
+//# sourceMappingURL=code-skeleton.test.js.map

package/dist/tools/code-skeleton.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"code-skeleton.test.js","sourceRoot":"","sources":["../../src/tools/code-skeleton.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,QAAgB,EAAE,IAAY;IACtD,MAAM,EAAE,GAAG,EAAE,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAClF,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,MAAM,IAAI,GAAG,CAAC,IAAa,EAAE,EAAE;QAC7B,IAAI,KAAK;YAAE,OAAO;QAClB,IACE,CAAC,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC;YAC3B,EAAE,CAAC,sBAAsB,CAAC,IAAI,CAAC;YAC/B,EAAE,CAAC,sBAAsB,CAAC,IAAI,CAAC;YAC/B,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAC/B,CAAC;YACD,KAAK,GAAG,IAAI,CAAC;QACf,CAAC;aAAM,IAAI,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;YAC5E,KAAK,GAAG,IAAI,CAAC;QACf,CAAC;aAAM,IAAI,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC9D,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;oBAAE,KAAK,GAAG,IAAI,CAAC;YACjF,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC;IACF,IAAI,CAAC,EAAE,CAAC,CAAC;IACT,OAAO,KAAK,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC1F,MAAM,GAAG,GAAG;;;KAGX,CAAC;QACF,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,uCAAuC,CAAC,CAAC;QACtE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,6BAA6B,CAAC,CAAC;QAC5D,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,GAAG,GAAG;;OAET,CAAC;QACJ,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAC7C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;QAClD,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,oBAAoB,CAAC,CAAC,CAAC,YAAY;QACpE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,GAAG,GAAG;;;MAGV,CAAC;QACH,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,mCAAmC,CAAC,CAAC;QAClE,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC9C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,GAAG,GAAG;;;MAGV,CAAC;QACH,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,+BAA+B,CAAC,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,GAAG,GAAG;wCACwB,CAAC;QACrC,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,2BAA2B,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,GAAG,GAAG;kDACkC,CAAC;QAC/C,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACjD,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,MAAM,GAAG,GAAG;gEACgD,CAAC;QAC7D,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,OAAO,GAAG,GAAG,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC;gBAAE,SAAS;YACjB,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YACrC,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACrF,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,GAAG,eAAe,CAAC,8BAA8B,CAAC,CAAC;QAC1D,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tools/compress-integration.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=compress-integration.test.d.ts.map

package/dist/tools/compress-integration.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress-integration.test.d.ts","sourceRoot":"","sources":["../../src/tools/compress-integration.test.ts"],"names":[],"mappings":""}

package/dist/tools/compress-integration.test.js

@@ -0,0 +1,59 @@
+import { describe, it, expect } from "vitest";
+import { compressToolOutput } from "./compress.js";
+import { truncateTail, MAX_LINES } from "./truncate.js";
+/**
+ * Integration-level guarantees for the live tool path (bash / task_output).
+ * The contract: compression only fires on output that was ALREADY going to be
+ * truncated, and on that branch it must keep more signal than a blind tail
+ * slice — never less — while staying reversible (caller keeps the overflow file).
+ */
+describe("compressToolOutput (live tool-output seam)", () => {
+    it("keeps a FATAL line that blind tail-truncation would drop", () => {
+        const lines = [];
+        for (let i = 0; i < 5000; i++) {
+            if (i === 1200)
+                lines.push("ERROR FATAL: segfault in worker pool");
+            else
+                lines.push(`INFO step ${i} ok`);
+        }
+        const raw = lines.join("\n");
+        // Today's behaviour: tail slice keeps only the last MAX_LINES — the FATAL at
+        // line 1200 is in the discarded head.
+        const tail = truncateTail(raw);
+        expect(tail.content).not.toContain("FATAL: segfault");
+        // Compression keeps it.
+        const c = compressToolOutput(raw);
+        expect(c.content).toContain("FATAL: segfault in worker pool");
+        expect(c.notice).toMatch(/fewer tokens/);
+    });
+    it("preserves the very end of the output (tail semantics)", () => {
+        const lines = Array.from({ length: 6000 }, (_, i) => `line ${i}`);
+        const c = compressToolOutput(lines.join("\n"));
+        expect(c.content).toContain("line 5999");
+        expect(c.content).toContain("line 5998");
+    });
+    it("collapses repeated spam into a count", () => {
+        const lines = ["boot"];
+        for (let i = 0; i < 3000; i++)
+            lines.push("WARN socket hang up");
+        lines.push("ERROR aborted");
+        const c = compressToolOutput(lines.join("\n"));
+        expect(c.content).toMatch(/×\d+/);
+        expect(c.content).toContain("ERROR aborted");
+    });
+    it("produces fewer tokens than the original on large output", () => {
+        const lines = Array.from({ length: 8000 }, (_, i) => `compiled module ${i} ok in ${i}ms`);
+        const raw = lines.join("\n");
+        const c = compressToolOutput(raw);
+        expect(c.content.length).toBeLessThan(raw.length / 2);
+    });
+    it("only the over-limit branch is affected — small output is never compressed here", () => {
+        // The tools call compressToolOutput ONLY when truncateTail reports truncated.
+        // A small output stays below MAX_LINES, so the branch never runs. Assert the
+        // gate, not the compressor: small output is not truncated.
+        const small = Array.from({ length: 10 }, (_, i) => `line ${i}`).join("\n");
+        expect(truncateTail(small).truncated).toBe(false);
+        expect(MAX_LINES).toBeGreaterThan(10);
+    });
+});
+//# sourceMappingURL=compress-integration.test.js.map

package/dist/tools/compress-integration.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress-integration.test.js","sourceRoot":"","sources":["../../src/tools/compress-integration.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAExD;;;;;GAKG;AACH,QAAQ,CAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;;gBAC9D,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE7B,6EAA6E;QAC7E,sCAAsC;QACtC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;QAEtD,wBAAwB;QACxB,MAAM,CAAC,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,gCAAgC,CAAC,CAAC;QAC9D,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QACjE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1F,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gFAAgF,EAAE,GAAG,EAAE;QACxF,8EAA8E;QAC9E,6EAA6E;QAC7E,2DAA2D;QAC3D,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3E,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tools/compress.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Content-aware tool-output compression.
+ *
+ * Today's tool path shrinks oversized output with blunt head/tail line cuts
+ * (`truncate.ts`). That throws away whichever half the model didn't get — a
+ * stack trace buried in the middle of a 10k-line log, the one failing assertion
+ * between thousands of passing ones, the shape of a giant JSON array.
+ *
+ * `compressOutput` keeps the *signal* instead of a positional slice:
+ *  - logs: collapse repeated runs, keep every error/warn line + local context,
+ *    keep head and tail, drop only the boring middle.
+ *  - JSON: keep array shape + a sample, replace the long tail with a count.
+ *  - text: middle-out (head + tail) so the command/context AND the result survive.
+ *
+ * It is lossy by design but information-preserving: the goal is fewer tokens
+ * with the same understanding. Pair with an overflow file for full reversibility.
+ */
+export interface CompressResult {
+    content: string;
+    /** Which strategy fired — for telemetry / benchmarking. */
+    strategy: "json" | "log" | "text" | "none";
+    originalTokens: number;
+    compressedTokens: number;
+}
+export interface CompressOptions {
+    /** Don't compress below this token count — small output isn't worth touching. */
+    minTokens?: number;
+    /** Lines of context to keep on each side of an important log line. */
+    contextLines?: number;
+    /** Head/tail lines always retained. */
+    headLines?: number;
+    tailLines?: number;
+    /** Max elements kept per JSON array before summarising the rest. */
+    jsonArraySample?: number;
+}
+/**
+ * Compress a tool output string, auto-detecting its content type.
+ */
+export declare function compressOutput(raw: string, opts?: CompressOptions): CompressResult;
+export interface ToolOutputCompression {
+    content: string;
+    /** Human/agent-facing summary of what was kept, for the truncation notice. */
+    notice: string;
+    strategy: CompressResult["strategy"];
+}
+/**
+ * Compress output that a tool was ALREADY going to truncate.
+ *
+ * This is the only sanctioned live integration point. It is invoked solely on
+ * the over-limit branch of a tool (bash / task_output) — where today's
+ * alternative is a blind tail slice that discards the head and any mid-stream
+ * error. It keeps generous head/tail (tool output is tail-oriented) plus every
+ * error line and collapses repeats. The caller still writes the full original
+ * to an overflow file, so this stays fully reversible.
+ */
+export declare function compressToolOutput(raw: string): ToolOutputCompression;
+//# sourceMappingURL=compress.d.ts.map

package/dist/tools/compress.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.d.ts","sourceRoot":"","sources":["../../src/tools/compress.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;;;;;;;GAgBG;AAEH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAChB,2DAA2D;IAC3D,QAAQ,EAAE,MAAM,GAAG,KAAK,GAAG,MAAM,GAAG,MAAM,CAAC;IAC3C,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,eAAe;IAC9B,iFAAiF;IACjF,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sEAAsE;IACtE,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,uCAAuC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,oEAAoE;IACpE,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AA+BD;;GAEG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,GAAE,eAAoB,GAAG,cAAc,CAkBtF;AA2HD,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,MAAM,CAAC;IAChB,8EAA8E;IAC9E,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;CACtC;AAED;;;;;;;;;GASG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,MAAM,GAAG,qBAAqB,CAQrE"}

package/dist/tools/compress.js

@@ -0,0 +1,181 @@
+import { estimateTokens } from "../core/compaction/token-estimator.js";
+const DEFAULTS = {
+    minTokens: 400,
+    contextLines: 2,
+    headLines: 8,
+    tailLines: 8,
+    jsonArraySample: 5,
+};
+/** Lines that must never be dropped from a log. */
+const IMPORTANT = /\b(error|fatal|panic|exception|traceback|fail(?:ed|ure)?|warn(?:ing)?|assert|fault|denied|refused|timeout|unhandled|rejected|✗|✖|❌)\b|^\s*at\s+|Error:|Caused by:/i;
+function tokens(text) {
+    return estimateTokens(text);
+}
+function result(content, strategy, original) {
+    return {
+        content,
+        strategy,
+        originalTokens: tokens(original),
+        compressedTokens: tokens(content),
+    };
+}
+/**
+ * Compress a tool output string, auto-detecting its content type.
+ */
+export function compressOutput(raw, opts = {}) {
+    const o = { ...DEFAULTS, ...opts };
+    if (tokens(raw) < o.minTokens)
+        return result(raw, "none", raw);
+    const trimmed = raw.trim();
+    if (trimmed.length > 1 && (trimmed[0] === "{" || trimmed[0] === "[")) {
+        const json = tryCompressJson(trimmed, o);
+        if (json !== null)
+            return result(json, "json", raw);
+    }
+    const lines = raw.split("\n");
+    const importantCount = lines.reduce((n, l) => (IMPORTANT.test(l) ? n + 1 : n), 0);
+    // Treat as a log when it's many lines OR carries error signal worth isolating.
+    if (lines.length > o.headLines + o.tailLines + 10 && (importantCount > 0 || lines.length > 200)) {
+        return result(compressLog(lines, o), "log", raw);
+    }
+    return result(compressText(lines, o), "text", raw);
+}
+/* ----------------------------------------------------------------------- */
+/* Log: keep error lines + context, collapse repeats, drop the boring middle */
+/* ----------------------------------------------------------------------- */
+function compressLog(lines, o) {
+    // 1. Collapse consecutive identical / near-identical runs into one entry.
+    //    `exact` tracks whether every line in the run was byte-identical, so the
+    //    emitted marker can be honest: "(×N)" only when truly identical, otherwise
+    //    "(×N similar)" so the model never assumes the shown text (e.g. a single
+    //    timestamp) was repeated verbatim across the whole run.
+    const collapsed = [];
+    for (let i = 0; i < lines.length; i++) {
+        const prev = collapsed[collapsed.length - 1];
+        if (prev && normalize(prev.text) === normalize(lines[i])) {
+            prev.count++;
+            if (lines[i] !== prev.text)
+                prev.exact = false;
+        }
+        else {
+            collapsed.push({ text: lines[i], count: 1, idx: i, exact: true });
+        }
+    }
+    // 2. Mark which collapsed entries to keep: head, tail, important + context.
+    const keep = new Set();
+    for (let i = 0; i < Math.min(o.headLines, collapsed.length); i++)
+        keep.add(i);
+    for (let i = Math.max(0, collapsed.length - o.tailLines); i < collapsed.length; i++)
+        keep.add(i);
+    for (let i = 0; i < collapsed.length; i++) {
+        if (IMPORTANT.test(collapsed[i].text)) {
+            for (let j = i - o.contextLines; j <= i + o.contextLines; j++) {
+                if (j >= 0 && j < collapsed.length)
+                    keep.add(j);
+            }
+        }
+    }
+    // 3. Emit, replacing dropped gaps with a single omission marker.
+    const out = [];
+    let droppedLines = 0;
+    let gapStart = -1;
+    const flushGap = () => {
+        if (droppedLines > 0) {
+            out.push(`… ${droppedLines} line${droppedLines === 1 ? "" : "s"} omitted …`);
+            droppedLines = 0;
+            gapStart = -1;
+        }
+    };
+    for (let i = 0; i < collapsed.length; i++) {
+        if (keep.has(i)) {
+            flushGap();
+            const e = collapsed[i];
+            if (e.count > 1)
+                out.push(`${e.text}  (×${e.count}${e.exact ? "" : " similar"})`);
+            else
+                out.push(e.text);
+        }
+        else {
+            if (gapStart === -1)
+                gapStart = i;
+            droppedLines += collapsed[i].count;
+        }
+    }
+    flushGap();
+    return out.join("\n");
+}
+/**
+ * Strip only *volatile noise* (timestamps, hex addresses) so lines that differ
+ * solely by a leading timestamp collapse as repeats. Deliberately does NOT nuke
+ * arbitrary integers: when the number IS the content (`line 5998` vs `line 5999`,
+ * a port, an id), the lines must stay distinct so the tail isn't flattened into
+ * a single "(×N)" and genuinely different output isn't reported as repetition.
+ */
+function normalize(line) {
+    return line
+        .replace(/\d{4}-\d{2}-\d{2}[T ]\d{2}:\d{2}:\d{2}(?:\.\d+)?Z?/g, "<ts>")
+        .replace(/\b\d{2}:\d{2}:\d{2}(?:\.\d+)?\b/g, "<ts>")
+        .replace(/0x[0-9a-f]+/gi, "<addr>")
+        .trim();
+}
+/* ----------------------------------------------------------------------- */
+/* JSON: keep shape + a sample of long arrays, summarise the rest            */
+/* ----------------------------------------------------------------------- */
+function tryCompressJson(text, o) {
+    let parsed;
+    try {
+        parsed = JSON.parse(text);
+    }
+    catch {
+        return null;
+    }
+    const shrunk = shrinkJson(parsed, o);
+    return JSON.stringify(shrunk, null, 2);
+}
+function shrinkJson(value, o) {
+    if (Array.isArray(value)) {
+        if (value.length <= o.jsonArraySample)
+            return value.map((v) => shrinkJson(v, o));
+        const sample = value.slice(0, o.jsonArraySample).map((v) => shrinkJson(v, o));
+        sample.push(`… ${value.length - o.jsonArraySample} more of ${value.length} items omitted …`);
+        return sample;
+    }
+    if (value && typeof value === "object") {
+        const out = {};
+        for (const [k, v] of Object.entries(value))
+            out[k] = shrinkJson(v, o);
+        return out;
+    }
+    return value;
+}
+/* ----------------------------------------------------------------------- */
+/* Text: middle-out so both the command/context and the result survive       */
+/* ----------------------------------------------------------------------- */
+function compressText(lines, o) {
+    const budget = o.headLines + o.tailLines;
+    if (lines.length <= budget)
+        return lines.join("\n");
+    const head = lines.slice(0, o.headLines);
+    const tail = lines.slice(lines.length - o.tailLines);
+    const dropped = lines.length - budget;
+    return [...head, `… ${dropped} lines omitted …`, ...tail].join("\n");
+}
+/**
+ * Compress output that a tool was ALREADY going to truncate.
+ *
+ * This is the only sanctioned live integration point. It is invoked solely on
+ * the over-limit branch of a tool (bash / task_output) — where today's
+ * alternative is a blind tail slice that discards the head and any mid-stream
+ * error. It keeps generous head/tail (tool output is tail-oriented) plus every
+ * error line and collapses repeats. The caller still writes the full original
+ * to an overflow file, so this stays fully reversible.
+ */
+export function compressToolOutput(raw) {
+    const r = compressOutput(raw, { headLines: 12, tailLines: 30, minTokens: 0 });
+    const saved = r.originalTokens - r.compressedTokens;
+    const notice = r.strategy === "none"
+        ? ""
+        : `Compressed (${r.strategy}): kept errors + head/tail, collapsed repeats — ~${saved} fewer tokens.`;
+    return { content: r.content, notice, strategy: r.strategy };
+}
+//# sourceMappingURL=compress.js.map

package/dist/tools/compress.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.js","sourceRoot":"","sources":["../../src/tools/compress.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,uCAAuC,CAAC;AAwCvE,MAAM,QAAQ,GAAG;IACf,SAAS,EAAE,GAAG;IACd,YAAY,EAAE,CAAC;IACf,SAAS,EAAE,CAAC;IACZ,SAAS,EAAE,CAAC;IACZ,eAAe,EAAE,CAAC;CACiB,CAAC;AAEtC,mDAAmD;AACnD,MAAM,SAAS,GACb,oKAAoK,CAAC;AAEvK,SAAS,MAAM,CAAC,IAAY;IAC1B,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,MAAM,CACb,OAAe,EACf,QAAoC,EACpC,QAAgB;IAEhB,OAAO;QACL,OAAO;QACP,QAAQ;QACR,cAAc,EAAE,MAAM,CAAC,QAAQ,CAAC;QAChC,gBAAgB,EAAE,MAAM,CAAC,OAAO,CAAC;KAClC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,GAAW,EAAE,OAAwB,EAAE;IACpE,MAAM,CAAC,GAAG,EAAE,GAAG,QAAQ,EAAE,GAAG,IAAI,EAAE,CAAC;IACnC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS;QAAE,OAAO,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;QACrE,MAAM,IAAI,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClF,+EAA+E;IAC/E,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,GAAG,EAAE,IAAI,CAAC,cAAc,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,EAAE,CAAC;QAChG,OAAO,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,OAAO,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;AACrD,CAAC;AAED,6EAA6E;AAC7E,+EAA+E;AAC/E,6EAA6E;AAE7E,SAAS,WAAW,CAAC,KAAe,EAAE,CAA4B;IAChE,0EAA0E;IAC1E,6EAA6E;IAC7E,+EAA+E;IAC/E,6EAA6E;IAC7E,4DAA4D;IAC5D,MAAM,SAAS,GAAmE,EAAE,CAAC;IACrF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7C,IAAI,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC9E,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM;oBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,MAAM,QAAQ,GAAG,GAAG,EAAE;QACpB,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,KAAK,YAAY,QAAQ,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;YAC7E,YAAY,GAAG,CAAC,CAAC;YACjB,QAAQ,GAAG,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,QAAQ,EAAE,CAAC;YACX,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC;;gBAC7E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,IAAI,QAAQ,KAAK,CAAC,CAAC;gBAAE,QAAQ,GAAG,CAAC,CAAC;YAClC,YAAY,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACrC,CAAC;IACH,CAAC;IACD,QAAQ,EAAE,CAAC;IACX,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,IAAI;SACR,OAAO,CAAC,qDAAqD,EAAE,MAAM,CAAC;SACtE,OAAO,CAAC,kCAAkC,EAAE,MAAM,CAAC;SACnD,OAAO,CAAC,eAAe,EAAE,QAAQ,CAAC;SAClC,IAAI,EAAE,CAAC;AACZ,CAAC;AAED,6EAA6E;AAC7E,+EAA+E;AAC/E,6EAA6E;AAE7E,SAAS,eAAe,CAAC,IAAY,EAAE,CAA4B;IACjE,IAAI,MAAe,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,SAAS,UAAU,CAAC,KAAc,EAAE,CAA4B;IAC9D,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,eAAe;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjF,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,eAAe,YAAY,KAAK,CAAC,MAAM,kBAAkB,CAAC,CAAC;QAC7F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACvC,MAAM,GAAG,GAA4B,EAAE,CAAC;QACxC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtE,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,6EAA6E;AAC7E,+EAA+E;AAC/E,6EAA6E;AAE7E,SAAS,YAAY,CAAC,KAAe,EAAE,CAA4B;IACjE,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;IACzC,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;IACtC,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,OAAO,kBAAkB,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvE,CAAC;AAaD;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAW;IAC5C,MAAM,CAAC,GAAG,cAAc,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9E,MAAM,KAAK,GAAG,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,gBAAgB,CAAC;IACpD,MAAM,MAAM,GACV,CAAC,CAAC,QAAQ,KAAK,MAAM;QACnB,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,eAAe,CAAC,CAAC,QAAQ,oDAAoD,KAAK,gBAAgB,CAAC;IACzG,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAC9D,CAAC"}

package/dist/tools/compress.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=compress.test.d.ts.map

package/dist/tools/compress.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.test.d.ts","sourceRoot":"","sources":["../../src/tools/compress.test.ts"],"names":[],"mappings":""}

package/dist/tools/compress.test.js

@@ -0,0 +1,60 @@
+import { describe, it, expect } from "vitest";
+import { compressOutput } from "./compress.js";
+describe("compressOutput", () => {
+    it("leaves small output untouched", () => {
+        const small = "line one\nline two\nline three";
+        const r = compressOutput(small);
+        expect(r.strategy).toBe("none");
+        expect(r.content).toBe(small);
+    });
+    it("keeps a FATAL line buried in the middle of a huge log", () => {
+        const lines = [];
+        for (let i = 0; i < 5000; i++) {
+            if (i === 2600)
+                lines.push("ERROR FATAL: heap allocation failed at chunk 8821");
+            else
+                lines.push(`INFO compiled module ${i} ok`);
+        }
+        const r = compressOutput(lines.join("\n"));
+        expect(r.strategy).toBe("log");
+        expect(r.content).toContain("FATAL: heap allocation failed at chunk 8821");
+        expect(r.compressedTokens).toBeLessThan(r.originalTokens * 0.2);
+    });
+    it("collapses repeated runs into a count", () => {
+        const lines = ["start"];
+        for (let i = 0; i < 200; i++)
+            lines.push("WARN retry: Connection refused: postgres:5432");
+        lines.push("ERROR giving up after 200 attempts");
+        const r = compressOutput(lines.join("\n"));
+        expect(r.content).toContain("Connection refused: postgres:5432");
+        expect(r.content).toContain("giving up after 200 attempts");
+        expect(r.content).toMatch(/×\d+/);
+    });
+    it("summarises a long JSON array but keeps shape and early matches", () => {
+        const matches = [];
+        for (let i = 0; i < 412; i++) {
+            matches.push({ path: i === 3 ? "src/core/auth.ts" : `src/gen/file-${i}.ts`, line: i });
+        }
+        const r = compressOutput(JSON.stringify({ total: 412, matches }, null, 2));
+        expect(r.strategy).toBe("json");
+        expect(r.content).toContain('"total": 412');
+        expect(r.content).toContain("src/core/auth.ts");
+        expect(r.content).toMatch(/more of 412 items omitted/);
+        expect(r.compressedTokens).toBeLessThan(r.originalTokens * 0.5);
+    });
+    it("preserves the failing assertion among thousands of passes", () => {
+        const lines = [];
+        for (let i = 0; i < 2000; i++) {
+            if (i === 1450) {
+                lines.push("✗ user-auth › rejects expired token");
+                lines.push("  AssertionError: Expected 401 but received 200");
+            }
+            else
+                lines.push(`✓ case ${i}`);
+        }
+        const r = compressOutput(lines.join("\n"));
+        expect(r.content).toContain("rejects expired token");
+        expect(r.content).toContain("Expected 401 but received 200");
+    });
+});
+//# sourceMappingURL=compress.test.js.map

package/dist/tools/compress.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compress.test.js","sourceRoot":"","sources":["../../src/tools/compress.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAE/C,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,gCAAgC,CAAC;QAC/C,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC;;gBAC3E,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC;QACD,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,6CAA6C,CAAC,CAAC;QAC3E,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QAC1F,KAAK,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;QACjD,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,mCAAmC,CAAC,CAAC;QACjE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC;QAC5D,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,OAAO,GAAG,EAAE,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,CAAC,GAAG,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QAC5C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC;QAChD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,2BAA2B,CAAC,CAAC;QACvD,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,qCAAqC,CAAC,CAAC;gBAClD,KAAK,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;YAChE,CAAC;;gBAAM,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,uBAAuB,CAAC,CAAC;QACrD,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,+BAA+B,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tools/edit-diff.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"edit-diff.d.ts","sourceRoot":"","sources":["../../src/tools/edit-diff.ts"],"names":[],"mappings":"AAsEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,6BAA6B,CAC3C,OAAO,EAAE,MAAM,EACf,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,IAAI,CAgDf;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAuDzF;AAcD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAYjE;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAYlE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAM3D;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CAgC5E;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAkCzE;AASD;;;;;;;;GAQG;AACH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAIhB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,YAAY,SAAI,EAChB,UAAU,SAAI,GACb,cAAc,GAAG,IAAI,CAuCvB;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EACZ,GAAG,SAAI,GACN;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EAAE,CA6BrC;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAa7F"}
+{"version":3,"file":"edit-diff.d.ts","sourceRoot":"","sources":["../../src/tools/edit-diff.ts"],"names":[],"mappings":"AAsEA;;;;;;;;;;;;;GAaG;AACH,wBAAgB,6BAA6B,CAC3C,OAAO,EAAE,MAAM,EACf,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,GACX,MAAM,GAAG,IAAI,CAgDf;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAuDzF;AAcD;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAYjE;AAED;;;;;GAKG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAYlE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAM3D;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,GACd;IAAE,KAAK,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,WAAW,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CA4C5E;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAqCzE;AASD;;;;;;;;GAQG;AACH,MAAM,WAAW,cAAc;IAC7B,OAAO,EAAE,MAAM,CAAC;IAIhB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,kBAAkB,CAChC,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,YAAY,SAAI,EAChB,UAAU,SAAI,GACb,cAAc,GAAG,IAAI,CAuCvB;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EACf,IAAI,EAAE,MAAM,EACZ,GAAG,SAAI,GACN;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EAAE,CA6BrC;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAa7F"}

package/dist/tools/edit-diff.js

@@ -286,18 +286,31 @@ export function fuzzyFindText(content, oldText) {
     }
     // Fuzzy match line-by-line so stripped trailing whitespace in earlier lines
     // cannot shift offsets and make us replace the wrong byte range.
+    //
+    // Performance: use a lazy normalization cache — each content line is
+    // normalized on first access and cached, so lines before the match are
+    // normalized exactly once (not once per window), and lines after the
+    // match are never touched.  This gives O(n+m) worst-case (no match)
+    // while avoiding wasted work when the match is found early.
     const oldLines = oldText.split("\n");
     const contentLines = content.split("\n");
-    const normalizedOldLines = oldLines.map(normalizeForFuzzyMatch);
+    const normalizedOldJoined = oldLines.map(normalizeForFuzzyMatch).join("\n");
+    const normalizedCache = new Array(contentLines.length);
     for (let startLine = 0; startLine + oldLines.length <= contentLines.length; startLine++) {
-        const candidateLines = contentLines.slice(startLine, startLine + oldLines.length);
-        const normalizedCandidate = candidateLines.map(normalizeForFuzzyMatch);
-        if (normalizedCandidate.join("\n") !== normalizedOldLines.join("\n"))
+        // Build the normalized candidate window using the lazy cache
+        let normalizedCandidate = "";
+        for (let j = startLine; j < startLine + oldLines.length; j++) {
+            normalizedCandidate += normalizedCache[j] ??= normalizeForFuzzyMatch(contentLines[j]);
+            if (j < startLine + oldLines.length - 1)
+                normalizedCandidate += "\n";
+        }
+        if (normalizedCandidate !== normalizedOldJoined)
             continue;
         let actualIndex = 0;
         for (let i = 0; i < startLine; i++) {
             actualIndex += contentLines[i].length + 1; // +1 for \n
         }
+        const candidateLines = contentLines.slice(startLine, startLine + oldLines.length);
         return {
             found: true,
             index: actualIndex,
@@ -335,11 +348,15 @@ export function countOccurrences(content, oldText) {
     }
     const oldLines = oldText.split("\n");
     const contentLines = content.split("\n");
+    // Lazy normalization cache (same optimization as fuzzyFindText).
+    const normalizedCache = new Array(contentLines.length);
     for (let startLine = 0; startLine + oldLines.length <= contentLines.length; startLine++) {
-        const normalizedCandidate = contentLines
-            .slice(startLine, startLine + oldLines.length)
-            .map(normalizeForFuzzyMatch)
-            .join("\n");
+        let normalizedCandidate = "";
+        for (let j = startLine; j < startLine + oldLines.length; j++) {
+            normalizedCandidate += normalizedCache[j] ??= normalizeForFuzzyMatch(contentLines[j]);
+            if (j < startLine + oldLines.length - 1)
+                normalizedCandidate += "\n";
+        }
         if (normalizedCandidate === normalizedOld)
             count++;
     }