@animalabs/context-manager 0.5.1 → 0.5.3

package/dist/test/chunker-tool-boundary.test.js

@@ -0,0 +1,89 @@
+/**
+ * Chunker invariant: a chunk must not close on a message containing a
+ * `tool_use` block, because the matching `tool_result` lives in the
+ * immediately-following user message and the Anthropic API rejects a
+ * compression request where a tool_use isn't followed by its result.
+ *
+ * Companion to `stripUnpairedToolBlocks` (the runtime safety net) — this
+ * verifies the upstream chunker behavior that avoids the situation in the
+ * first place.
+ */
+import { describe, it, before, after } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-chunker-tool-boundary';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+describe('Chunker: tool cycle boundary', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    it("defers chunk closure when the last message contains a tool_use", async () => {
+        cleanup();
+        const strategy = new AutobiographicalStrategy({
+            // Very small chunk threshold so we hit close-conditions quickly.
+            targetChunkTokens: 50,
+            // Disable head/recent windows so all messages are eligible for chunking.
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+        });
+        // Build a sequence where the message that would land at the chunk
+        // boundary contains a tool_use. The matching tool_result is the next
+        // message. The chunker should defer closing to include both.
+        //
+        // Messages (~30 tokens each so we cross 50 tokens after the 2nd):
+        //   0: user text
+        //   1: agent text
+        //   2: user text
+        //   3: agent text + tool_use(id=A)   <- would close here (4 msgs, >50 tok)
+        //   4: user tool_result(id=A)        <- chunk extended to include this
+        //   5: agent text
+        //   6: user text
+        //   ...
+        const filler = (n) => 'word '.repeat(n);
+        manager.addMessage('user', [{ type: 'text', text: filler(30) }]);
+        manager.addMessage('agent', [{ type: 'text', text: filler(30) }]);
+        manager.addMessage('user', [{ type: 'text', text: filler(30) }]);
+        manager.addMessage('agent', [
+            { type: 'text', text: filler(20) },
+            { type: 'tool_use', id: 'A', name: 'fn', input: {} },
+        ]);
+        manager.addMessage('user', [
+            { type: 'tool_result', toolUseId: 'A', content: 'res' },
+        ]);
+        // Add more messages to ensure a second chunk forms (so the first
+        // chunk's boundary is unambiguous, not just "end of store").
+        for (let i = 0; i < 6; i++) {
+            manager.addMessage(i % 2 === 0 ? 'agent' : 'user', [
+                { type: 'text', text: filler(30) },
+            ]);
+        }
+        // Force a chunker rebuild by reading state via the strategy.
+        // ContextManager runs rebuildChunks during compile() — easier to call
+        // the internal directly.
+        const s = strategy;
+        s.rebuildChunks(manager.messageStore);
+        assert.ok(s.chunks.length >= 1, 'should have produced at least one chunk');
+        // For every closed chunk, the last message must NOT contain a tool_use.
+        for (const chunk of s.chunks) {
+            const last = chunk.messages[chunk.messages.length - 1];
+            const hasToolUse = last.content.some((b) => b.type === 'tool_use');
+            assert.ok(!hasToolUse, `chunk ending on message ${last.id} contains a trailing tool_use — boundary not deferred`);
+        }
+        // Specifically: the first chunk should have included message 4 (the
+        // tool_result), not stopped at message 3.
+        const firstChunk = s.chunks[0];
+        const firstChunkLastContent = firstChunk.messages[firstChunk.messages.length - 1].content;
+        const lastBlockIsToolResult = firstChunkLastContent.some((b) => b.type === 'tool_result');
+        assert.ok(lastBlockIsToolResult || firstChunk.messages.length >= 5, 'first chunk should have been extended to include the tool_result');
+        await manager.close();
+    });
+});
+//# sourceMappingURL=chunker-tool-boundary.test.js.map

package/dist/test/chunker-tool-boundary.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunker-tool-boundary.test.js","sourceRoot":"","sources":["../../test/chunker-tool-boundary.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAG3E,MAAM,eAAe,GAAG,8BAA8B,CAAC;AAEvD,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,eAAe,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvB,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,OAAO,EAAE,CAAC;QACV,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iEAAiE;YACjE,iBAAiB,EAAE,EAAE;YACrB,yEAAyE;YACzE,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;SACtB,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QAEH,kEAAkE;QAClE,qEAAqE;QACrE,6DAA6D;QAC7D,EAAE;QACF,kEAAkE;QAClE,iBAAiB;QACjB,kBAAkB;QAClB,iBAAiB;QACjB,2EAA2E;QAC3E,uEAAuE;QACvE,kBAAkB;QAClB,iBAAiB;QACjB,QAAQ;QACR,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClE,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE;YAC1B,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE;YAClC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;SACnC,CAAC,CAAC;QACrB,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE;YACzB,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE;SACtC,CAAC,CAAC;QACrB,iEAAiE;QACjE,6DAA6D;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE;gBACjD,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE;aACnC,CAAC,CAAC;QACL,CAAC;QAED,6DAA6D;QAC7D,sEAAsE;QACtE,yBAAyB;QACzB,MAAM,CAAC,GAAG,QAGT,CAAC;QACF,CAAC,CAAC,aAAa,CAAE,OAAgD,CAAC,YAAY,CAAC,CAAC;QAEhF,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,yCAAyC,CAAC,CAAC;QAE3E,wEAAwE;QACxE,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvD,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YACnE,MAAM,CAAC,EAAE,CACP,CAAC,UAAU,EACX,2BAA2B,IAAI,CAAC,EAAE,uDAAuD,CAC1F,CAAC;QACJ,CAAC;QAED,oEAAoE;QACpE,0CAA0C;QAC1C,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,qBAAqB,GAAG,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;QAC1F,MAAM,qBAAqB,GAAG,qBAAqB,CAAC,IAAI,CACtD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAChC,CAAC;QACF,MAAM,CAAC,EAAE,CACP,qBAAqB,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,IAAI,CAAC,EACxD,kEAAkE,CACnE,CAAC;QAEF,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/compression-shape-invariants.test.d.ts

@@ -0,0 +1,22 @@
+/**
+ * End-to-end shape invariants for the compression pipeline.
+ *
+ * The whole compression-bug family (5/6/7/8/9) was about the *shape* of the
+ * request sent to the Anthropic API, not the content of summaries. This
+ * suite exercises the full pipeline (message store → chunker → L1 compress
+ * → L2/L3 merges) against a mock membrane that:
+ *
+ *   1. Validates every request against the API's structural rules
+ *      (tool_use/tool_result adjacency, placement in user vs. assistant
+ *      turns) and throws if any rule is violated.
+ *   2. Returns a deterministic summary text at a realistic ~5:1 compression
+ *      ratio so summary IDs and merge cascades behave predictably.
+ *
+ * If any of the patched call sites — `compressChunkHierarchical`,
+ * `executeMerge`, the chunker's tool-cycle-respecting close, or the
+ * runtime `splitMixedToolMessages` / `stripUnpairedToolBlocks` passes —
+ * regresses, the mock will throw with the same error shape the live API
+ * would return, and the test fails.
+ */
+export {};
+//# sourceMappingURL=compression-shape-invariants.test.d.ts.map

package/dist/test/compression-shape-invariants.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compression-shape-invariants.test.d.ts","sourceRoot":"","sources":["../../test/compression-shape-invariants.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG"}

package/dist/test/compression-shape-invariants.test.js

@@ -0,0 +1,312 @@
+/**
+ * End-to-end shape invariants for the compression pipeline.
+ *
+ * The whole compression-bug family (5/6/7/8/9) was about the *shape* of the
+ * request sent to the Anthropic API, not the content of summaries. This
+ * suite exercises the full pipeline (message store → chunker → L1 compress
+ * → L2/L3 merges) against a mock membrane that:
+ *
+ *   1. Validates every request against the API's structural rules
+ *      (tool_use/tool_result adjacency, placement in user vs. assistant
+ *      turns) and throws if any rule is violated.
+ *   2. Returns a deterministic summary text at a realistic ~5:1 compression
+ *      ratio so summary IDs and merge cascades behave predictably.
+ *
+ * If any of the patched call sites — `compressChunkHierarchical`,
+ * `executeMerge`, the chunker's tool-cycle-respecting close, or the
+ * runtime `splitMixedToolMessages` / `stripUnpairedToolBlocks` passes —
+ * regresses, the mock will throw with the same error shape the live API
+ * would return, and the test fails.
+ */
+import { describe, it, before, after } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../src/index.js';
+const TEST_STORE_PATH = './test-compression-shape';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+// ---------------------------------------------------------------------------
+// API-shape validator: mirrors what the Anthropic API enforces.
+// ---------------------------------------------------------------------------
+function validateApiShape(messages) {
+    for (let i = 0; i < messages.length; i++) {
+        const msg = messages[i];
+        const isUser = msg.participant.toLowerCase() === 'user';
+        for (const block of msg.content) {
+            if (block.type === 'tool_result' && !isUser) {
+                throw new Error(`messages[${i}]: tool_result block in non-user turn (participant=${msg.participant})`);
+            }
+            if (block.type === 'tool_use') {
+                const id = block.id;
+                const next = messages[i + 1];
+                const matched = next?.content.some((b) => b.type === 'tool_result' &&
+                    b.toolUseId === id);
+                if (!matched) {
+                    throw new Error(`messages[${i}]: tool_use id=${id} was not followed by a matching tool_result in messages[${i + 1}]`);
+                }
+            }
+            if (block.type === 'tool_result') {
+                const tid = block.toolUseId;
+                const prev = messages[i - 1];
+                const matched = prev?.content.some((b) => b.type === 'tool_use' && b.id === tid);
+                if (!matched) {
+                    throw new Error(`messages[${i}]: tool_result toolUseId=${tid} was not preceded by a matching tool_use in messages[${i - 1}]`);
+                }
+            }
+        }
+    }
+}
+// ---------------------------------------------------------------------------
+// Mock membrane: validates shape, returns deterministic compressed text.
+// ---------------------------------------------------------------------------
+function createValidatingMembrane(compressionRatio = 5) {
+    const calls = [];
+    const membrane = {
+        complete: async (request) => {
+            validateApiShape(request.messages);
+            const inputChars = request.messages
+                .flatMap((m) => m.content)
+                .map((b) => b.text ?? '')
+                .join('').length;
+            const targetChars = Math.max(60, Math.floor(inputChars / compressionRatio));
+            const summary = `[mock summary inChars=${inputChars}] ` +
+                'x '.repeat(Math.max(0, Math.floor((targetChars - 30) / 2)));
+            calls.push({ messages: request.messages, outputChars: summary.length });
+            return {
+                content: [{ type: 'text', text: summary }],
+                usage: {
+                    input_tokens: Math.ceil(inputChars / 4),
+                    output_tokens: Math.ceil(summary.length / 4),
+                },
+            };
+        },
+    };
+    return { membrane, calls };
+}
+const t = (s) => ({ type: 'text', text: s });
+const u = (id) => ({ type: 'tool_use', id, name: 'fn', input: {} });
+const r = (id) => ({ type: 'tool_result', toolUseId: id, content: 'ok' });
+async function drain(manager) {
+    // Cap iterations so a regression that fails to converge can't hang CI.
+    for (let i = 0; i < 500; i++) {
+        if (manager.isReady())
+            return;
+        await manager.tick();
+    }
+    throw new Error('drain: queue did not converge within 500 ticks');
+}
+describe('Compression pipeline: API shape invariants', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    it('L1 compression: chunker close lands on a tool_use without fix — must not throw', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 80,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        // Force the chunker to want to close on a tool_use-bearing message:
+        //   - 3 small messages (length 3, tokens ~30)
+        //   - then a FAT agent message with a tool_use (length 4 → meets >=4,
+        //     fat enough to push currentTokens past targetChunkTokens=80)
+        //   - then the matching tool_result (would land in next chunk
+        //     without the chunker-defer fix → orphan tool_use at boundary)
+        // Repeat this pattern many times so multiple boundaries are exercised.
+        const small = (n) => 'word '.repeat(n);
+        const fat = (n) => 'thinking '.repeat(n);
+        for (let i = 0; i < 12; i++) {
+            manager.addMessage('user', [t(small(8))]);
+            manager.addMessage('agent', [t(small(8))]);
+            manager.addMessage('user', [t(small(8))]);
+            manager.addMessage('agent', [t(fat(60)), u(`A${i}`)]);
+            manager.addMessage('user', [r(`A${i}`)]);
+            manager.addMessage('agent', [t(small(10))]);
+        }
+        await drain(manager);
+        assert.ok(calls.length > 0, 'expected at least one L1 compression call');
+        await manager.close();
+    });
+    it('L2/L3 merge cascade preserves shape across hundreds of summaries', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 50,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+            mergeThreshold: 3, // L1→L2 every 3 L1s, L2→L3 every 9 L1s
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        const filler = (n) => 'word '.repeat(n);
+        for (let i = 0; i < 80; i++) {
+            if (i % 5 === 0 && i > 0) {
+                manager.addMessage('agent', [t(filler(10)), u(`B${i}`)]);
+                manager.addMessage('user', [r(`B${i}`)]);
+            }
+            else {
+                manager.addMessage(i % 2 === 0 ? 'agent' : 'user', [t(filler(15))]);
+            }
+        }
+        await drain(manager);
+        // We should have hit L1 + at least one L2 merge — easiest signal is the
+        // sheer call count plus the absence of validation throws.
+        const snap = strategy.getProgressSnapshot();
+        assert.ok(snap.summaryCounts.l1 > 0, 'expected L1 summaries');
+        assert.ok(snap.summaryCounts.l2 > 0, `expected at least one L2 merge (l1=${snap.summaryCounts.l1}, l2=${snap.summaryCounts.l2})`);
+        assert.ok(calls.length >= snap.summaryCounts.l1 + snap.summaryCounts.l2);
+        await manager.close();
+    });
+    it('Bug 10: raw middle dedup correctly handles L2+ summaries (no message leak)', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 40,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+            mergeThreshold: 3,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        // 100 messages → enough chunks to drive a multi-level merge cascade
+        // (L1s → L2s → L3) so executeMerge runs with L2s in its prior
+        // frontier. Each message has a distinctive marker (`RAW-N`) so we
+        // can count how many leak into requests as raw content.
+        const filler = (n) => 'word '.repeat(n);
+        for (let i = 0; i < 100; i++) {
+            manager.addMessage(i % 2 === 0 ? 'agent' : 'user', [
+                t(`RAW-${i} ${filler(8)}`),
+            ]);
+        }
+        await drain(manager);
+        const snap = strategy.getProgressSnapshot();
+        assert.ok(snap.summaryCounts.l2 >= 2, `expected >=2 L2 summaries to exercise the bug (got l2=${snap.summaryCounts.l2})`);
+        // Count raw conversation messages in each request. The expansion bug
+        // allowed ~all messages to leak in (the bug report saw 256 user +
+        // 262 agent for a 4234-msg conversation). With the fix, per-request
+        // raw-message count should be bounded by the merge target's leaf
+        // size — for mergeThreshold=3 with ~3-msg L1s, that's <= ~25.
+        const RAW_MSG_LIMIT = 40;
+        for (let i = 0; i < calls.length; i++) {
+            const call = calls[i];
+            let rawCount = 0;
+            for (const m of call.messages) {
+                for (const block of m.content) {
+                    const text = block.text ?? '';
+                    if (text.includes('RAW-'))
+                        rawCount++;
+                }
+            }
+            assert.ok(rawCount <= RAW_MSG_LIMIT, `call ${i}: ${rawCount} raw messages in request — raw middle is leaking already-summarized content (Bug 10)`);
+        }
+        await manager.close();
+    });
+    it('runtime splitMixedToolMessages handles bundled cycles in source data', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 60,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        // Pre-Bug-8 import shape: tool_use AND tool_result bundled into one
+        // assistant message. The runtime split has to unpack these before the
+        // request reaches the membrane.
+        for (let i = 0; i < 20; i++) {
+            manager.addMessage('user', [t('q'.repeat(60))]);
+            manager.addMessage('agent', [
+                t('a'.repeat(40)),
+                u(`C${i}`),
+                r(`C${i}`),
+                t('done'),
+            ]);
+        }
+        await drain(manager);
+        assert.ok(calls.length > 0);
+        await manager.close();
+    });
+    it('orphan tool_use at the very tail (no next message ever) does not crash', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 50,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        // Build a sequence that ends on a tool_use with no following tool_result.
+        // The chunker's defer rule can't help here (there's no next message);
+        // stripUnpairedToolBlocks is the safety net.
+        const filler = (n) => 'word '.repeat(n);
+        for (let i = 0; i < 12; i++) {
+            manager.addMessage(i % 2 === 0 ? 'agent' : 'user', [t(filler(20))]);
+        }
+        manager.addMessage('agent', [t(filler(10)), u('orphan')]);
+        await drain(manager);
+        assert.ok(calls.length > 0);
+        await manager.close();
+    });
+    it('adaptive resolution variant uses the same compression sites — same shape guarantees', async () => {
+        cleanup();
+        const { membrane, calls } = createValidatingMembrane();
+        const strategy = new AutobiographicalStrategy({
+            targetChunkTokens: 50,
+            headWindowTokens: 0,
+            recentWindowTokens: 0,
+            hierarchical: true,
+            adaptiveResolution: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        const filler = (n) => 'word '.repeat(n);
+        for (let i = 0; i < 30; i++) {
+            if (i % 4 === 0 && i > 0) {
+                manager.addMessage('agent', [t(filler(10)), u(`D${i}`)]);
+                manager.addMessage('user', [r(`D${i}`)]);
+            }
+            else {
+                manager.addMessage(i % 2 === 0 ? 'agent' : 'user', [t(filler(20))]);
+            }
+        }
+        // Adaptive path produces L1s lazily via the picker — trigger a compile
+        // (or two) so FoldOps run and enqueue compression work.
+        await manager.compile();
+        await drain(manager);
+        await manager.compile();
+        await drain(manager);
+        assert.ok(calls.length > 0, 'adaptive path produced no compression calls');
+        await manager.close();
+    });
+});
+//# sourceMappingURL=compression-shape-invariants.test.js.map

package/dist/test/compression-shape-invariants.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compression-shape-invariants.test.js","sourceRoot":"","sources":["../../test/compression-shape-invariants.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AACxD,OAAO,MAAM,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,iBAAiB,CAAC;AAG3E,MAAM,eAAe,GAAG,0BAA0B,CAAC;AAEnD,SAAS,OAAO;IACd,IAAI,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,eAAe,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC;AAID,8EAA8E;AAC9E,gEAAgE;AAChE,8EAA8E;AAE9E,SAAS,gBAAgB,CAAC,QAA+B;IACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,MAAM,GAAG,GAAG,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC;QAExD,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,OAAO,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC5C,MAAM,IAAI,KAAK,CACb,YAAY,CAAC,sDAAsD,GAAG,CAAC,WAAW,GAAG,CACtF,CAAC;YACJ,CAAC;YAED,IAAI,KAAK,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBAC9B,MAAM,EAAE,GAAI,KAAwB,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,aAAa;oBACvB,CAA2B,CAAC,SAAS,KAAK,EAAE,CAChD,CAAC;gBACF,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,MAAM,IAAI,KAAK,CACb,YAAY,CAAC,kBAAkB,EAAE,2DAA2D,CAAC,GAAG,CAAC,GAAG,CACrG,CAAC;gBACJ,CAAC;YACH,CAAC;YAED,IAAI,KAAK,CAAC,IAAI,KAAK,aAAa,EAAE,CAAC;gBACjC,MAAM,GAAG,GAAI,KAA+B,CAAC,SAAS,CAAC;gBACvD,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,EAAE,OAAO,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAK,CAAoB,CAAC,EAAE,KAAK,GAAG,CACjE,CAAC;gBACF,IAAI,CAAC,OAAO,EAAE,CAAC;oBACb,MAAM,IAAI,KAAK,CACb,YAAY,CAAC,4BAA4B,GAAG,wDAAwD,CAAC,GAAG,CAAC,GAAG,CAC7G,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,yEAAyE;AACzE,8EAA8E;AAE9E,SAAS,wBAAwB,CAAC,gBAAgB,GAAG,CAAC;IACpD,MAAM,KAAK,GAA2D,EAAE,CAAC;IACzE,MAAM,QAAQ,GAAG;QACf,QAAQ,EAAE,KAAK,EAAE,OAGhB,EAAE,EAAE;YACH,gBAAgB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ;iBAChC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;iBACzB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAuB,CAAC,IAAI,IAAI,EAAE,CAAC;iBAC/C,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;YACnB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC,CAAC;YAC5E,MAAM,OAAO,GACX,yBAAyB,UAAU,IAAI;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/D,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YACxE,OAAO;gBACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;gBAC1C,KAAK,EAAE;oBACL,YAAY,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;oBACvC,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;iBAC7C;aACF,CAAC;QACJ,CAAC;KACF,CAAC;IACF,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED,MAAM,CAAC,GAAG,CAAC,CAAS,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AACnE,MAAM,CAAC,GAAG,CAAC,EAAU,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;AAC1F,MAAM,CAAC,GAAG,CAAC,EAAU,EAAgB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,SAAS,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;AAEhG,KAAK,UAAU,KAAK,CAAC,OAAuB;IAC1C,uEAAuE;IACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,IAAI,OAAO,CAAC,OAAO,EAAE;YAAE,OAAO;QAC9B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;IACvB,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC,CAAC;AACpE,CAAC;AAED,QAAQ,CAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvB,EAAE,CAAC,gFAAgF,EAAE,KAAK,IAAI,EAAE;QAC9F,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,oEAAoE;QACpE,8CAA8C;QAC9C,sEAAsE;QACtE,kEAAkE;QAClE,8DAA8D;QAC9D,mEAAmE;QACnE,uEAAuE;QACvE,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,2CAA2C,CAAC,CAAC;QACzE,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;QAChF,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;YAClB,cAAc,EAAE,CAAC,EAAE,uCAAuC;SAC3D,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QAErB,wEAAwE;QACxE,0DAA0D;QAC1D,MAAM,IAAI,GAAG,QAAQ,CAAC,mBAAmB,EAAE,CAAC;QAC5C,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE,uBAAuB,CAAC,CAAC;QAC9D,MAAM,CAAC,EAAE,CACP,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EACzB,sCAAsC,IAAI,CAAC,aAAa,CAAC,EAAE,QAAQ,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAC5F,CAAC;QACF,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACzE,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4EAA4E,EAAE,KAAK,IAAI,EAAE;QAC1F,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;YAClB,cAAc,EAAE,CAAC;SAClB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,oEAAoE;QACpE,8DAA8D;QAC9D,kEAAkE;QAClE,wDAAwD;QACxD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE;gBACjD,CAAC,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;aAC3B,CAAC,CAAC;QACL,CAAC;QAED,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,IAAI,GAAG,QAAQ,CAAC,mBAAmB,EAAE,CAAC;QAC5C,MAAM,CAAC,EAAE,CACP,IAAI,CAAC,aAAa,CAAC,EAAE,IAAI,CAAC,EAC1B,yDAAyD,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAClF,CAAC;QAEF,qEAAqE;QACrE,kEAAkE;QAClE,oEAAoE;QACpE,iEAAiE;QACjE,8DAA8D;QAC9D,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;oBAC9B,MAAM,IAAI,GAAI,KAA2B,CAAC,IAAI,IAAI,EAAE,CAAC;oBACrD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;wBAAE,QAAQ,EAAE,CAAC;gBACxC,CAAC;YACH,CAAC;YACD,MAAM,CAAC,EAAE,CACP,QAAQ,IAAI,aAAa,EACzB,QAAQ,CAAC,KAAK,QAAQ,sFAAsF,CAC7G,CAAC;QACJ,CAAC;QACD,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;QACpF,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,oEAAoE;QACpE,sEAAsE;QACtE,gCAAgC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE;gBAC1B,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACjB,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBACV,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBACV,CAAC,CAAC,MAAM,CAAC;aACV,CAAC,CAAC;QACL,CAAC;QAED,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;QACtF,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,0EAA0E;QAC1E,sEAAsE;QACtE,6CAA6C;QAC7C,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE1D,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5B,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qFAAqF,EAAE,KAAK,IAAI,EAAE;QACnG,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,wBAAwB,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,iBAAiB,EAAE,EAAE;YACrB,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,IAAI;YAClB,kBAAkB,EAAE,IAAI;SACzB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,QAAe;SAC1B,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,uEAAuE;QACvE,wDAAwD;QACxD,MAAM,OAAO,CAAC,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QACrB,MAAM,OAAO,CAAC,OAAO,EAAE,CAAC;QACxB,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;QAErB,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,6CAA6C,CAAC,CAAC;QAC3E,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/normalize-tool-messages.test.d.ts

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

package/dist/test/normalize-tool-messages.test.d.ts.map

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

package/dist/test/normalize-tool-messages.test.js

@@ -0,0 +1,168 @@
+/**
+ * Tests for splitMixedToolMessages — the API-shape normalizer applied
+ * in three call sites:
+ *   - ContextManager.compile() (live session path)
+ *   - AutobiographicalStrategy.compressChunkHierarchical (L1 compression)
+ *   - AutobiographicalStrategy.executeMerge (L_n merges)
+ *
+ * The Anthropic API requires tool_result blocks in user turns immediately
+ * following their tool_use; claude.ai-exported sessions bundle the entire
+ * cycle into one assistant message, which the importer splits at ingest
+ * time but already-imported sessions still carry. This helper does the
+ * runtime fixup.
+ */
+import { describe, it } from 'node:test';
+import assert from 'node:assert';
+import { splitMixedToolMessages, stripUnpairedToolBlocks } from '../src/index.js';
+function mkBlocks(spec) {
+    // shorthand: 't' = text, 'u' = tool_use, 'r' = tool_result
+    return spec.split('').map((c, i) => {
+        if (c === 't')
+            return { type: 'text', text: `t${i}` };
+        if (c === 'u')
+            return { type: 'tool_use', id: `u${i}`, name: 'fn', input: {} };
+        if (c === 'r')
+            return { type: 'tool_result', toolUseId: `u${i}`, content: 'res' };
+        throw new Error(`bad char: ${c}`);
+    });
+}
+describe('splitMixedToolMessages', () => {
+    it('passes through user messages with tool_result unchanged', () => {
+        const input = [{ participant: 'user', content: mkBlocks('r') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 1);
+        assert.equal(out[0].participant, 'user');
+        assert.equal(out[0].content.length, 1);
+    });
+    it('passes through assistant messages with no tool_result unchanged', () => {
+        const input = [{ participant: 'agent', content: mkBlocks('tut') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 1);
+        assert.equal(out[0].participant, 'agent');
+        assert.deepEqual(out[0].content.map((b) => b.type), ['text', 'tool_use', 'text']);
+    });
+    it('splits a bundled tool cycle into three messages', () => {
+        const input = [{ participant: 'agent', content: mkBlocks('turt') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 3);
+        assert.equal(out[0].participant, 'agent');
+        assert.deepEqual(out[0].content.map((b) => b.type), ['text', 'tool_use']);
+        assert.equal(out[1].participant, 'user');
+        assert.deepEqual(out[1].content.map((b) => b.type), ['tool_result']);
+        assert.equal(out[2].participant, 'agent');
+        assert.deepEqual(out[2].content.map((b) => b.type), ['text']);
+    });
+    it('merges adjacent tool_results into one user message', () => {
+        const input = [{ participant: 'agent', content: mkBlocks('uurr') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 2);
+        assert.equal(out[0].participant, 'agent');
+        assert.deepEqual(out[0].content.map((b) => b.type), ['tool_use', 'tool_use']);
+        assert.equal(out[1].participant, 'user');
+        assert.deepEqual(out[1].content.map((b) => b.type), ['tool_result', 'tool_result']);
+    });
+    it('handles alternating tool cycles in one message', () => {
+        const input = [{ participant: 'agent', content: mkBlocks('urur') }];
+        const out = splitMixedToolMessages(input);
+        assert.deepEqual(out.map((m) => m.participant), ['agent', 'user', 'agent', 'user']);
+        assert.deepEqual(out.flatMap((m) => m.content.map((b) => b.type)), [
+            'tool_use', 'tool_result', 'tool_use', 'tool_result',
+        ]);
+    });
+    it('handles tool_result at the start of an assistant message', () => {
+        const input = [{ participant: 'agent', content: mkBlocks('rt') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 2);
+        assert.equal(out[0].participant, 'user');
+        assert.deepEqual(out[0].content.map((b) => b.type), ['tool_result']);
+        assert.equal(out[1].participant, 'agent');
+        assert.deepEqual(out[1].content.map((b) => b.type), ['text']);
+    });
+    it('preserves custom agent participant names', () => {
+        const input = [{ participant: 'commander', content: mkBlocks('tur') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out[0].participant, 'commander');
+        assert.equal(out[1].participant, 'user');
+    });
+    it('case-insensitive user check (User, USER all pass through)', () => {
+        const input = [{ participant: 'User', content: mkBlocks('r') }];
+        const out = splitMixedToolMessages(input);
+        assert.equal(out.length, 1);
+        assert.equal(out[0].participant, 'User');
+    });
+    it('walks across multiple input messages', () => {
+        const input = [
+            { participant: 'user', content: mkBlocks('t') },
+            { participant: 'agent', content: mkBlocks('tur') },
+            { participant: 'user', content: mkBlocks('t') },
+        ];
+        const out = splitMixedToolMessages(input);
+        // user-text, agent-text+tool_use, user-tool_result, user-text
+        assert.equal(out.length, 4);
+        assert.deepEqual(out.map((m) => m.participant), ['user', 'agent', 'user', 'user']);
+    });
+    it('returns an empty array for empty input', () => {
+        assert.deepEqual(splitMixedToolMessages([]), []);
+    });
+});
+describe('stripUnpairedToolBlocks', () => {
+    const u = (id) => ({ type: 'tool_use', id, name: 'fn', input: {} });
+    const r = (id) => ({ type: 'tool_result', toolUseId: id, content: 'res' });
+    const t = (text) => ({ type: 'text', text });
+    it('passes through paired tool_use/tool_result unchanged', () => {
+        const input = [
+            { participant: 'agent', content: [t('hi'), u('A')] },
+            { participant: 'user', content: [r('A')] },
+        ];
+        const out = stripUnpairedToolBlocks(input);
+        assert.deepEqual(out.map((m) => m.content.map((b) => b.type)), [
+            ['text', 'tool_use'],
+            ['tool_result'],
+        ]);
+    });
+    it('strips a tool_use whose tool_result is absent (chunk-boundary tail)', () => {
+        const input = [
+            { participant: 'agent', content: [t('preamble'), u('A')] },
+        ];
+        const out = stripUnpairedToolBlocks(input);
+        assert.equal(out.length, 1);
+        assert.deepEqual(out[0].content.map((b) => b.type), ['text']);
+    });
+    it('strips a tool_result whose tool_use is absent (chunk-boundary head)', () => {
+        const input = [
+            { participant: 'user', content: [r('A')] },
+            { participant: 'agent', content: [t('reply')] },
+        ];
+        const out = stripUnpairedToolBlocks(input);
+        assert.equal(out.length, 2);
+        assert.deepEqual(out[0].content.map((b) => b.type), ['text']);
+        assert.equal(out[0].content[0].text, '[tool call omitted]');
+        assert.deepEqual(out[1].content.map((b) => b.type), ['text']);
+    });
+    it('keeps paired blocks and strips only the unpaired ones in a mixed message', () => {
+        const input = [
+            { participant: 'agent', content: [u('A'), u('B'), u('C')] },
+            { participant: 'user', content: [r('B'), r('C')] },
+        ];
+        const out = stripUnpairedToolBlocks(input);
+        assert.deepEqual(out[0].content.map((b) => b.id ?? b.type), ['B', 'C']);
+        assert.deepEqual(out[1].content.map((b) => b.toolUseId ?? b.type), ['B', 'C']);
+    });
+    it('replaces empty content with a placeholder text block', () => {
+        const input = [{ participant: 'agent', content: [u('A')] }];
+        const out = stripUnpairedToolBlocks(input);
+        assert.equal(out.length, 1);
+        assert.equal(out[0].content.length, 1);
+        assert.equal(out[0].content[0].type, 'text');
+        assert.match(out[0].content[0].text, /tool call omitted/);
+    });
+    it('returns an empty array for empty input', () => {
+        assert.deepEqual(stripUnpairedToolBlocks([]), []);
+    });
+    it('preserves reference identity for unchanged messages', () => {
+        const msg = { participant: 'user', content: [t('hello')] };
+        const out = stripUnpairedToolBlocks([msg]);
+        assert.strictEqual(out[0].content, msg.content);
+    });
+});
+//# sourceMappingURL=normalize-tool-messages.test.js.map