@animalabs/context-manager 0.3.0 → 0.5.0

package/dist/test/adaptive/chunker.test.d.ts.map

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

package/dist/test/adaptive/chunker.test.js

@@ -0,0 +1,120 @@
+import { test } from 'node:test';
+import assert from 'node:assert/strict';
+import { chunkMessage, DEFAULT_CHUNKER_OPTIONS } from '../../src/adaptive/chunker.js';
+// Use small thresholds for tests so we don't have to generate huge inputs.
+const TINY = { chunkThreshold: 100, chunkSize: 40, charsPerToken: 1.0 };
+test('chunker: under threshold passes through as single shard', () => {
+    const body = 'Hello world. This is a short message.';
+    const result = chunkMessage(body, TINY);
+    assert.equal(result.wasSharded, false);
+    assert.equal(result.shards.length, 1);
+    assert.equal(result.shards[0].content, body);
+    assert.equal(result.shards[0].range.startByte, 0);
+    assert.equal(result.shards[0].range.endByte, Buffer.byteLength(body, 'utf8'));
+});
+test('chunker: over threshold produces multiple shards with byte-faithful reassembly', () => {
+    // 12 lines of ~20 chars each ≈ 240 chars total, target 40 chars/shard → ~6 shards
+    const lines = [];
+    for (let i = 0; i < 12; i++)
+        lines.push(`Line number ${i.toString().padStart(2, '0')} text`);
+    const body = lines.join('\n');
+    const result = chunkMessage(body, TINY);
+    assert.equal(result.wasSharded, true);
+    assert.ok(result.shards.length >= 3, `expected ≥3 shards, got ${result.shards.length}`);
+    // Byte-faithful reassembly
+    const reassembled = result.shards.map((s) => s.content).join('');
+    assert.equal(reassembled, body, 'reassembled content must equal original byte-for-byte');
+    // Indices sequential from 0
+    for (let i = 0; i < result.shards.length; i++) {
+        assert.equal(result.shards[i].index, i);
+    }
+    // Byte ranges contiguous and cover the entire body
+    const bodyBytes = Buffer.byteLength(body, 'utf8');
+    let prevEnd = 0;
+    for (const s of result.shards) {
+        assert.equal(s.range.startByte, prevEnd, `gap or overlap at shard ${s.index}`);
+        prevEnd = s.range.endByte;
+    }
+    assert.equal(prevEnd, bodyBytes, 'final endByte must equal body length');
+});
+test('chunker: deterministic — same input produces identical shards', () => {
+    const body = 'a'.repeat(200) + '\n' + 'b'.repeat(200);
+    const r1 = chunkMessage(body, TINY);
+    const r2 = chunkMessage(body, TINY);
+    assert.equal(r1.bodyGroupId, r2.bodyGroupId);
+    assert.equal(r1.shards.length, r2.shards.length);
+    for (let i = 0; i < r1.shards.length; i++) {
+        assert.equal(r1.shards[i].sourceHash, r2.shards[i].sourceHash);
+        assert.equal(r1.shards[i].content, r2.shards[i].content);
+        assert.equal(r1.shards[i].range.startByte, r2.shards[i].range.startByte);
+        assert.equal(r1.shards[i].range.endByte, r2.shards[i].range.endByte);
+    }
+});
+test('chunker: prefers structural splits at markdown headings', () => {
+    const body = [
+        '## Section A',
+        'Some text in section A. '.repeat(10),
+        '',
+        '## Section B',
+        'Some text in section B. '.repeat(10),
+        '',
+        '## Section C',
+        'Some text in section C. '.repeat(10),
+    ].join('\n');
+    // chunkSize chosen so ~one section fits per shard
+    const result = chunkMessage(body, { chunkThreshold: 50, chunkSize: 100, charsPerToken: 1.0 });
+    assert.equal(result.wasSharded, true);
+    // We expect splits at or near "## Section" boundaries. Verify at least one
+    // shard starts with "## Section".
+    const startsWithHeading = result.shards.filter((s, i) => i > 0 && s.content.startsWith('## Section'));
+    assert.ok(startsWithHeading.length >= 1, 'at least one mid-body shard should start at a heading');
+});
+test('chunker: handles long line without seams via hard split', () => {
+    // One very long line with no whitespace at all
+    const body = 'x'.repeat(500);
+    const result = chunkMessage(body, TINY);
+    assert.equal(result.wasSharded, true);
+    // Byte-faithful even with hard splits
+    assert.equal(result.shards.map((s) => s.content).join(''), body);
+});
+test('chunker: handles multi-byte UTF-8 (CJK) without corrupting characters', () => {
+    // Some Japanese text + emoji
+    const body = '日本語のテストです。' + '🌸'.repeat(50) + 'もう少しテキストを追加します。'.repeat(20);
+    const result = chunkMessage(body, { chunkThreshold: 30, chunkSize: 25, charsPerToken: 1.0 });
+    assert.equal(result.wasSharded, true);
+    // Reassembly must be byte-faithful
+    assert.equal(result.shards.map((s) => s.content).join(''), body);
+    // Each shard's content should round-trip through UTF-8 cleanly
+    for (const s of result.shards) {
+        const bytes = Buffer.from(s.content, 'utf8');
+        const decoded = bytes.toString('utf8');
+        assert.equal(decoded, s.content, `shard ${s.index} did not round-trip through UTF-8`);
+    }
+});
+test('chunker: sourceHash is stable across identical content in different runs', () => {
+    const fragment = 'This is some content that should hash identically.';
+    const r1 = chunkMessage(fragment + fragment + fragment + fragment + fragment, TINY);
+    const r2 = chunkMessage(fragment + fragment + fragment + fragment + fragment, TINY);
+    assert.equal(r1.shards[0].sourceHash, r2.shards[0].sourceHash);
+});
+test('chunker: bodyGroupId differs for different content', () => {
+    const r1 = chunkMessage('a'.repeat(500), TINY);
+    const r2 = chunkMessage('b'.repeat(500), TINY);
+    assert.notEqual(r1.bodyGroupId, r2.bodyGroupId);
+});
+test('chunker: large doc (synthetic 500K-token-equivalent) produces sensible shard count', () => {
+    // 500K tokens × 4 chars/token = 2M chars. Use a smaller synthetic stand-in to keep test fast.
+    // 50K chars at default chunkSize 4096 tokens × 4 chars = 16K chars/shard → ~3-4 shards.
+    // Use 200K chars to get ~12 shards.
+    const para = 'Paragraph of content. '.repeat(20); // ~440 chars per "paragraph"
+    const body = Array.from({ length: 500 }, () => para).join('\n\n'); // ~220K chars
+    const result = chunkMessage(body); // default options
+    assert.equal(result.wasSharded, true);
+    // Each shard should be ≤ chunkSize tokens (with some slack for seam-finding)
+    for (const s of result.shards) {
+        assert.ok(s.approxTokens <= DEFAULT_CHUNKER_OPTIONS.chunkSize * 1.3, `shard ${s.index} has ${s.approxTokens} tokens, exceeds chunkSize`);
+    }
+    // Byte-faithful
+    assert.equal(result.shards.map((s) => s.content).join(''), body);
+});
+//# sourceMappingURL=chunker.test.js.map

package/dist/test/adaptive/chunker.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunker.test.js","sourceRoot":"","sources":["../../../test/adaptive/chunker.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,MAAM,MAAM,oBAAoB,CAAC;AAExC,OAAO,EAAE,YAAY,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AAEtF,2EAA2E;AAC3E,MAAM,IAAI,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAW,CAAC;AAEjF,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;IACnE,MAAM,IAAI,GAAG,uCAAuC,CAAC;IACrD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC7C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,gFAAgF,EAAE,GAAG,EAAE;IAC1F,kFAAkF;IAClF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7F,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAExC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACtC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,2BAA2B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAExF,2BAA2B;IAC3B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjE,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,IAAI,EAAE,uDAAuD,CAAC,CAAC;IAEzF,4BAA4B;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,mDAAmD;IACnD,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAClD,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,EAAE,2BAA2B,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC/E,OAAO,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;IAC5B,CAAC;IACD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,EAAE,sCAAsC,CAAC,CAAC;AAC3E,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,+DAA+D,EAAE,GAAG,EAAE;IACzE,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACtD,MAAM,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC;IAC7C,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QAC/D,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACzE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACvE,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;IACnE,MAAM,IAAI,GAAG;QACX,cAAc;QACd,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,EAAE;QACF,cAAc;QACd,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;QACrC,EAAE;QACF,cAAc;QACd,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;KACtC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEb,kDAAkD;IAClD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9F,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAEtC,2EAA2E;IAC3E,kCAAkC;IAClC,MAAM,iBAAiB,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC;IACtG,MAAM,CAAC,EAAE,CAAC,iBAAiB,CAAC,MAAM,IAAI,CAAC,EAAE,uDAAuD,CAAC,CAAC;AACpG,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;IACnE,+CAA+C;IAC/C,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7B,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACtC,sCAAsC;IACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,uEAAuE,EAAE,GAAG,EAAE;IACjF,6BAA6B;IAC7B,MAAM,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;IAC3E,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;IAC7F,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAEtC,mCAAmC;IACnC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAEjE,+DAA+D;IAC/D,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC,KAAK,mCAAmC,CAAC,CAAC;IACxF,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,0EAA0E,EAAE,GAAG,EAAE;IACpF,MAAM,QAAQ,GAAG,oDAAoD,CAAC;IACtE,MAAM,EAAE,GAAG,YAAY,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,EAAE,IAAI,CAAC,CAAC;IACpF,MAAM,EAAE,GAAG,YAAY,CAAC,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,EAAE,IAAI,CAAC,CAAC;IACpF,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;AACjE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;IAC9D,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC;AAClD,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oFAAoF,EAAE,GAAG,EAAE;IAC9F,8FAA8F;IAC9F,wFAAwF;IACxF,oCAAoC;IACpC,MAAM,IAAI,GAAG,wBAAwB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,6BAA6B;IAC/E,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc;IACjF,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,kBAAkB;IACrD,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACtC,6EAA6E;IAC7E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,CAAC,EAAE,CACP,CAAC,CAAC,YAAY,IAAI,uBAAuB,CAAC,SAAS,GAAG,GAAG,EACzD,SAAS,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,YAAY,4BAA4B,CACnE,CAAC;IACJ,CAAC;IACD,gBAAgB;IAChB,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACnE,CAAC,CAAC,CAAC"}

package/dist/test/adaptive/deep-levels.test.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Tests that the bottom-up speculative pre-producer (config.speculativeProduction)
+ * builds the full L_n chain — not just L2/L3 like the legacy threshold path.
+ *
+ * Drives enough conversation to produce ≥ N^2 L1s, then verifies the chronicle
+ * ends up with L2, L3, L4, ... summaries via the same checkMergeThreshold
+ * mechanism (now recursive) that previously stopped at L3.
+ */
+export {};
+//# sourceMappingURL=deep-levels.test.d.ts.map

package/dist/test/adaptive/deep-levels.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep-levels.test.d.ts","sourceRoot":"","sources":["../../../test/adaptive/deep-levels.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/test/adaptive/deep-levels.test.js

@@ -0,0 +1,167 @@
+/**
+ * Tests that the bottom-up speculative pre-producer (config.speculativeProduction)
+ * builds the full L_n chain — not just L2/L3 like the legacy threshold path.
+ *
+ * Drives enough conversation to produce ≥ N^2 L1s, then verifies the chronicle
+ * ends up with L2, L3, L4, ... summaries via the same checkMergeThreshold
+ * mechanism (now recursive) that previously stopped at L3.
+ */
+import { describe, it, before, after, beforeEach } from 'node:test';
+import assert from 'node:assert/strict';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../../src/index.js';
+const TEST_STORE_PATH = './test-adaptive-deep-levels-store';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function makeMockMembrane() {
+    let callCount = 0;
+    return {
+        complete: async () => {
+            callCount++;
+            return {
+                content: [{ type: 'text', text: `[mock summary #${callCount}] short summary content here.` }],
+            };
+        },
+        get callCount() {
+            return callCount;
+        },
+    };
+}
+function summariesByLevel(strategy) {
+    const out = {};
+    for (const s of strategy.summaries) {
+        out[s.level] = (out[s.level] ?? 0) + 1;
+    }
+    return out;
+}
+describe('AutobiographicalStrategy — deep-level pre-production', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    beforeEach(() => cleanup());
+    it('speculativeProduction off: only L1/L2/L3 (legacy behavior)', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: false,
+            targetChunkTokens: 100,
+            mergeThreshold: 3, // small so we get to deep levels quickly
+            recentWindowTokens: 50,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        // Need enough chunks for L1 → L2 → L3 to fire under threshold=3.
+        for (let i = 0; i < 30; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `Turn ${i}. ` + 'word '.repeat(30) }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        const counts = summariesByLevel(strategy);
+        // Legacy path caps at L3 — even with many L3s, no L4 is built.
+        assert.ok(!counts[4], `legacy path should not produce L4; got counts: ${JSON.stringify(counts)}`);
+        manager.close();
+    });
+    it('speculativeProduction on: produces L4+ when source counts warrant it', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true, // turns on speculativeProduction
+            targetChunkTokens: 80,
+            mergeThreshold: 2, // smallest possible — forces the chain to climb fast
+            recentWindowTokens: 50,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        // With mergeThreshold=2, each level halves the count. So if we end up
+        // with N L1s after compression, we get:
+        //   ceil(N/2) L2s, ceil(N/4) L3s, ceil(N/8) L4s, ...
+        // Need N ≥ 16 for L4 (2 L3s required to merge → L4).
+        for (let i = 0; i < 120; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `T${i}. ` + 'word '.repeat(20) }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        const counts = summariesByLevel(strategy);
+        // Should see L1, L2, L3 — and L4 with threshold=2.
+        assert.ok(counts[1] > 0, `expected L1 summaries; got ${JSON.stringify(counts)}`);
+        assert.ok(counts[2] > 0, `expected L2 summaries; got ${JSON.stringify(counts)}`);
+        assert.ok(counts[3] > 0, `expected L3 summaries; got ${JSON.stringify(counts)}`);
+        assert.ok(counts[4] >= 1, `with mergeThreshold=2 and 120 chunks, expected at least one L4; got ${JSON.stringify(counts)}`);
+        manager.close();
+    });
+    it('parentId set correctly across deep levels', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true,
+            targetChunkTokens: 80,
+            mergeThreshold: 2,
+            recentWindowTokens: 50,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        for (let i = 0; i < 120; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `T${i}. ` + 'word '.repeat(20) }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        // Walk the summary tree. Every L_n summary (except the topmost) should
+        // have a parentId pointing to an L_{n+1} that exists.
+        const summaries = strategy.summaries;
+        const byId = new Map(summaries.map((s) => [s.id, s]));
+        let maxLevel = 0;
+        for (const s of summaries)
+            if (s.level > maxLevel)
+                maxLevel = s.level;
+        for (const s of summaries) {
+            const parentId = s.parentId ?? s.mergedInto;
+            if (s.level === maxLevel)
+                continue; // top level has no parent
+            if (!parentId)
+                continue; // legitimately may be the newest at its level, no parent yet
+            const parent = byId.get(parentId);
+            assert.ok(parent, `summary ${s.id} (L${s.level}) has parentId ${parentId} but parent not found`);
+            assert.equal(parent.level, s.level + 1, `parent of L${s.level} should be L${s.level + 1}`);
+        }
+        manager.close();
+    });
+    it('picker uses L4+ summaries when budget pressure requires it', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true,
+            targetChunkTokens: 80,
+            mergeThreshold: 2,
+            recentWindowTokens: 50,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        for (let i = 0; i < 120; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `T${i}. ` + 'word '.repeat(20) }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        // Aggressive compression to force the picker to reach L4+.
+        await manager.compile({ maxTokens: 600, reserveForResponse: 100 });
+        // Inspect strategy.resolutions for any value >= 3 (L3 or deeper).
+        const resolutions = strategy.resolutions;
+        const maxResolution = Math.max(0, ...Array.from(resolutions.values()));
+        assert.ok(maxResolution >= 3, `with tight budget and deep tree, picker should reach L3+; max resolution was L${maxResolution}`);
+        manager.close();
+    });
+});
+//# sourceMappingURL=deep-levels.test.js.map

package/dist/test/adaptive/deep-levels.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deep-levels.test.js","sourceRoot":"","sources":["../../../test/adaptive/deep-levels.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC;AAE9E,MAAM,eAAe,GAAG,mCAAmC,CAAC;AAE5D,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,SAAS,gBAAgB;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO;QACL,QAAQ,EAAE,KAAK,IAAI,EAAE;YACnB,SAAS,EAAE,CAAC;YACZ,OAAO;gBACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,kBAAkB,SAAS,+BAA+B,EAAE,CAAC;aAC9F,CAAC;QACJ,CAAC;QACD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAa;IACrC,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,SAAqC,EAAE,CAAC;QAC/D,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,QAAQ,CAAC,sDAAsD,EAAE,GAAG,EAAE;IACpE,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACvB,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAE5B,EAAE,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,KAAK;YACzB,iBAAiB,EAAE,GAAG;YACtB,cAAc,EAAE,CAAC,EAAE,yCAAyC;YAC5D,kBAAkB,EAAE,EAAE;SACvB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QACH,iEAAiE;QACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3F,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QACD,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC1C,+DAA+D;QAC/D,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,kDAAkD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAClG,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;QACpF,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI,EAAE,iCAAiC;YAC3D,iBAAiB,EAAE,EAAE;YACrB,cAAc,EAAE,CAAC,EAAE,qDAAqD;YACxE,kBAAkB,EAAE,EAAE;SACvB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QAEH,sEAAsE;QACtE,wCAAwC;QACxC,qDAAqD;QACrD,qDAAqD;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAC1C,mDAAmD;QACnD,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,8BAA8B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjF,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,8BAA8B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjF,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,8BAA8B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACjF,MAAM,CAAC,EAAE,CACP,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,uEAAuE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAChG,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QACzD,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI;YACxB,iBAAiB,EAAE,EAAE;YACrB,cAAc,EAAE,CAAC;YACjB,kBAAkB,EAAE,EAAE;SACvB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QAED,uEAAuE;QACvE,sDAAsD;QACtD,MAAM,SAAS,GAAI,QAAgB,CAAC,SAKlC,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ;gBAAE,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC;QAEtE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,UAAU,CAAC;YAC5C,IAAI,CAAC,CAAC,KAAK,KAAK,QAAQ;gBAAE,SAAS,CAAC,0BAA0B;YAC9D,IAAI,CAAC,QAAQ;gBAAE,SAAS,CAAC,6DAA6D;YACtF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,KAAK,kBAAkB,QAAQ,uBAAuB,CAAC,CAAC;YACjG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,KAAK,eAAe,CAAC,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7F,CAAC;QACD,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI;YACxB,iBAAiB,EAAE,EAAE;YACrB,cAAc,EAAE,CAAC;YACjB,kBAAkB,EAAE,EAAE;SACvB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QAED,2DAA2D;QAC3D,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,CAAC;QAEnE,kEAAkE;QAClE,MAAM,WAAW,GAAI,QAAgB,CAAC,WAAkC,CAAC;QACzE,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACvE,MAAM,CAAC,EAAE,CACP,aAAa,IAAI,CAAC,EAClB,iFAAiF,aAAa,EAAE,CACjG,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/adaptive/doc-plus-chat.test.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Realistic Lena-migration scenario: a chronicle that starts with a large doc,
+ * then has many turns of chat about/with that doc.
+ *
+ * Verifies the doc gets sharded at ingestion, the chat turns coexist with
+ * the doc shards, the picker handles both correctly, and the compiled
+ * output structure makes sense throughout.
+ */
+export {};
+//# sourceMappingURL=doc-plus-chat.test.d.ts.map

package/dist/test/adaptive/doc-plus-chat.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"doc-plus-chat.test.d.ts","sourceRoot":"","sources":["../../../test/adaptive/doc-plus-chat.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/test/adaptive/doc-plus-chat.test.js

@@ -0,0 +1,194 @@
+/**
+ * Realistic Lena-migration scenario: a chronicle that starts with a large doc,
+ * then has many turns of chat about/with that doc.
+ *
+ * Verifies the doc gets sharded at ingestion, the chat turns coexist with
+ * the doc shards, the picker handles both correctly, and the compiled
+ * output structure makes sense throughout.
+ */
+import { describe, it, before, after, beforeEach } from 'node:test';
+import assert from 'node:assert/strict';
+import { rmSync, existsSync } from 'node:fs';
+import { ContextManager, AutobiographicalStrategy } from '../../src/index.js';
+const TEST_STORE_PATH = './test-adaptive-doc-plus-chat-store';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function makeMockMembrane() {
+    let callCount = 0;
+    return {
+        complete: async () => {
+            callCount++;
+            return {
+                content: [{ type: 'text', text: `[mock summary #${callCount}] short content.` }],
+            };
+        },
+        get callCount() {
+            return callCount;
+        },
+    };
+}
+function compiledTokens(compiled) {
+    let total = 0;
+    for (const m of compiled.messages) {
+        for (const block of m.content) {
+            if (block.type === 'text')
+                total += Math.ceil(block.text.length / 4);
+        }
+    }
+    return total;
+}
+describe('AutobiographicalStrategy — doc + chat workload (Lena-like)', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    beforeEach(() => cleanup());
+    it('500K-equivalent doc + 50 chat turns: budget honored throughout', async () => {
+        const mock = makeMockMembrane();
+        const BUDGET = 30000;
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true,
+            targetChunkTokens: 1000, // ~4K chars per shard
+            recentWindowTokens: 2000,
+            mergeThreshold: 6,
+            compressionSlackRatio: 0.1,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        // Synthetic ~500K-equivalent doc. Use 50K chars ≈ 12.5K tokens for test
+        // speed; chunker treats ~1K tokens per shard. ~12 shards.
+        const sections = [];
+        for (let s = 0; s < 12; s++) {
+            sections.push(`# Section ${s}\n\n` + 'paragraph content with some words. '.repeat(40));
+        }
+        const doc = sections.join('\n\n');
+        manager.addMessage('User', [{ type: 'text', text: doc }]);
+        // Verify sharding happened at ingestion
+        const allMessages = manager.getAllMessages();
+        assert.ok(allMessages.length > 1, `expected doc to shard; got ${allMessages.length} messages`);
+        const shardCount = allMessages.length;
+        const groupId = allMessages[0].bodyGroupId;
+        assert.ok(groupId, 'first shard should have bodyGroupId');
+        for (const m of allMessages) {
+            assert.equal(m.bodyGroupId, groupId, 'all shards share bodyGroupId');
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        // First compile after doc — verify budget honored
+        const compiledAfterDoc = await manager.compile({ maxTokens: BUDGET, reserveForResponse: 1000 });
+        assert.ok(compiledTokens(compiledAfterDoc) <= BUDGET - 1000, `after-doc tokens exceed budget: ${compiledTokens(compiledAfterDoc)}`);
+        // Now 50 chat turns about the doc
+        for (let i = 0; i < 50; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `Question ${i} about section ${i % 12}: ` + 'word '.repeat(20) }]);
+            manager.addMessage('Claude', [{ type: 'text', text: `Answer ${i}: ` + 'word '.repeat(25) }]);
+            while (!manager.isReady()) {
+                await manager.tick();
+            }
+            const compiled = await manager.compile({ maxTokens: BUDGET, reserveForResponse: 1000 });
+            const tokens = compiledTokens(compiled);
+            assert.ok(tokens <= BUDGET - 1000, `turn ${i}: ${tokens} tokens exceeds budget ${BUDGET - 1000}`);
+        }
+        // The compiled output should still reflect the doc somewhere
+        const finalCompile = await manager.compile({ maxTokens: BUDGET, reserveForResponse: 1000 });
+        const finalText = finalCompile.messages
+            .flatMap((m) => m.content)
+            .filter((b) => b.type === 'text')
+            .map((b) => b.text)
+            .join('\n');
+        // Either the doc is still raw-rendered, OR a summary referring to it appears
+        assert.ok(finalText.includes('Section') || finalText.includes('summary'), 'final compile should reference doc content via either raw or summary');
+        manager.close();
+    });
+    it('agent can lock a critical doc section and it survives folding pressure', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true,
+            targetChunkTokens: 500,
+            recentWindowTokens: 500,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        // Doc with distinct sections — big enough to shard at targetChunkTokens=500
+        // (chunker threshold = 2x targetChunkTokens = 1000 tokens; we need ~10 sections
+        // × 200 tokens = 2000+ tokens to trigger sharding).
+        const sections = Array.from({ length: 10 }, (_, i) => `# Section ${i}\n\nCRITICAL-MARKER-${i} ` + 'distinctive word here. '.repeat(40));
+        manager.addMessage('User', [{ type: 'text', text: sections.join('\n\n') }]);
+        const shards = manager.getAllMessages();
+        assert.ok(shards.length > 1, `doc should shard; got ${shards.length} messages`);
+        // Lock shard 3 specifically
+        const criticalShard = shards[3];
+        strategy.lockChunk(criticalShard.id);
+        // Add chat to push pressure
+        for (let i = 0; i < 30; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `T${i}` }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        // Tight compile
+        const compiled = await manager.compile({ maxTokens: 3500, reserveForResponse: 500 });
+        // The locked shard's resolution should remain 0 in strategy.resolutions
+        const resolutions = strategy.resolutions;
+        const lockedRes = resolutions.get(criticalShard.id) ?? 0;
+        assert.equal(lockedRes, 0, `locked shard should remain L0, got L${lockedRes}`);
+        // The compiled output should contain the locked shard's content verbatim
+        // (or at least the CRITICAL-MARKER-3 substring from its raw text).
+        const allText = compiled.messages
+            .flatMap((m) => m.content)
+            .filter((b) => b.type === 'text')
+            .map((b) => b.text)
+            .join('\n');
+        assert.ok(allText.includes('CRITICAL-MARKER-3'), 'compiled output should contain the locked shard\'s content verbatim');
+        manager.close();
+    });
+    it('doc + many turns: shards in different regions render correctly', async () => {
+        const mock = makeMockMembrane();
+        const strategy = new AutobiographicalStrategy({
+            adaptiveResolution: true,
+            targetChunkTokens: 400,
+            recentWindowTokens: 800,
+            mergeThreshold: 3,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: mock,
+        });
+        // Doc → some shards in middle, some in tail
+        const doc = Array.from({ length: 15 }, (_, i) => `Section ${i}: ` + 'word '.repeat(60)).join('\n\n');
+        manager.addMessage('User', [{ type: 'text', text: doc }]);
+        // Trailing chat so the doc isn't all-tail
+        for (let i = 0; i < 8; i++) {
+            manager.addMessage('User', [{ type: 'text', text: `Followup ${i}` }]);
+        }
+        while (!manager.isReady()) {
+            await manager.tick();
+        }
+        const compiled = await manager.compile({ maxTokens: 5000, reserveForResponse: 500 });
+        // The compile should have produced output containing both doc content
+        // (some sections) and chat content (followups). The doc should be a
+        // combined entry (or entries) representing its shards.
+        const userMessages = compiled.messages.filter((m) => m.participant.toLowerCase() === 'user');
+        assert.ok(userMessages.length >= 2, 'should have multiple user messages (doc + chat)');
+        // Find a user message containing "Section" (from the doc)
+        const docEntry = userMessages.find((m) => m.content
+            .filter((b) => b.type === 'text')
+            .some((b) => b.text.includes('Section ')));
+        assert.ok(docEntry, 'should have a user entry with doc section content');
+        // Find a user message containing "Followup" (from chat)
+        const chatEntry = userMessages.find((m) => m.content
+            .filter((b) => b.type === 'text')
+            .some((b) => b.text.includes('Followup')));
+        assert.ok(chatEntry, 'should have a user entry with chat followup content');
+        manager.close();
+    });
+});
+//# sourceMappingURL=doc-plus-chat.test.js.map

package/dist/test/adaptive/doc-plus-chat.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"doc-plus-chat.test.js","sourceRoot":"","sources":["../../../test/adaptive/doc-plus-chat.test.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,OAAO,MAAM,MAAM,oBAAoB,CAAC;AACxC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAE7C,OAAO,EAAE,cAAc,EAAE,wBAAwB,EAAE,MAAM,oBAAoB,CAAC;AAE9E,MAAM,eAAe,GAAG,qCAAqC,CAAC;AAE9D,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,SAAS,gBAAgB;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO;QACL,QAAQ,EAAE,KAAK,IAAI,EAAE;YACnB,SAAS,EAAE,CAAC;YACZ,OAAO;gBACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,kBAAkB,SAAS,kBAAkB,EAAE,CAAC;aACjF,CAAC;QACJ,CAAC;QACD,IAAI,SAAS;YACX,OAAO,SAAS,CAAC;QACnB,CAAC;KACF,CAAC;AACJ,CAAC;AAED,SAAS,cAAc,CAAC,QAAiD;IACvE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;gBAAE,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACvE,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,4DAA4D,EAAE,GAAG,EAAE;IAC1E,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACvB,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAE5B,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,KAAK,CAAC;QACrB,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI;YACxB,iBAAiB,EAAE,IAAI,EAAE,sBAAsB;YAC/C,kBAAkB,EAAE,IAAI;YACxB,cAAc,EAAE,CAAC;YACjB,qBAAqB,EAAE,GAAG;SAC3B,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QAEH,wEAAwE;QACxE,0DAA0D;QAC1D,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,qCAAqC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAE1D,wCAAwC;QACxC,MAAM,WAAW,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC7C,MAAM,CAAC,EAAE,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,8BAA8B,WAAW,CAAC,MAAM,WAAW,CAAC,CAAC;QAC/F,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC;QACtC,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;QAC3C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,qCAAqC,CAAC,CAAC;QAC1D,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,OAAO,EAAE,8BAA8B,CAAC,CAAC;QACvE,CAAC;QAED,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QACD,kDAAkD;QAClD,MAAM,gBAAgB,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;QAChG,MAAM,CAAC,EAAE,CACP,cAAc,CAAC,gBAAgB,CAAC,IAAI,MAAM,GAAG,IAAI,EACjD,mCAAmC,cAAc,CAAC,gBAAgB,CAAC,EAAE,CACtE,CAAC;QAEF,kCAAkC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,CAAC,kBAAkB,CAAC,GAAG,EAAE,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACrH,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7F,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;YACvB,CAAC;YACD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;YACxF,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ,CAAC,CAAC;YACxC,MAAM,CAAC,EAAE,CACP,MAAM,IAAI,MAAM,GAAG,IAAI,EACvB,QAAQ,CAAC,KAAK,MAAM,0BAA0B,MAAM,GAAG,IAAI,EAAE,CAC9D,CAAC;QACJ,CAAC;QAED,6DAA6D;QAC7D,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5F,MAAM,SAAS,GAAG,YAAY,CAAC,QAAQ;aACpC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;aACzB,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;aACrC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;aACvB,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,6EAA6E;QAC7E,MAAM,CAAC,EAAE,CACP,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,EAC9D,sEAAsE,CACvE,CAAC;QAEF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;QACtF,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI;YACxB,iBAAiB,EAAE,GAAG;YACtB,kBAAkB,EAAE,GAAG;SACxB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QAEH,4EAA4E;QAC5E,gFAAgF;QAChF,oDAAoD;QACpD,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACnD,aAAa,CAAC,uBAAuB,CAAC,GAAG,GAAG,yBAAyB,CAAC,MAAM,CAAC,EAAE,CAAC,CACjF,CAAC;QACF,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,MAAM,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACxC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,yBAAyB,MAAM,CAAC,MAAM,WAAW,CAAC,CAAC;QAEhF,4BAA4B;QAC5B,MAAM,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,QAAQ,CAAC,SAAS,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAErC,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QACD,gBAAgB;QAChB,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,CAAC;QAErF,wEAAwE;QACxE,MAAM,WAAW,GAAI,QAAgB,CAAC,WAAkC,CAAC;QACzE,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzD,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,uCAAuC,SAAS,EAAE,CAAC,CAAC;QAE/E,yEAAyE;QACzE,mEAAmE;QACnE,MAAM,OAAO,GAAG,QAAQ,CAAC,QAAQ;aAC9B,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;aACzB,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;aACrC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;aACvB,IAAI,CAAC,IAAI,CAAC,CAAC;QACd,MAAM,CAAC,EAAE,CACP,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAC,EACrC,qEAAqE,CACtE,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAC9E,MAAM,IAAI,GAAG,gBAAgB,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC;YAC5C,kBAAkB,EAAE,IAAI;YACxB,iBAAiB,EAAE,GAAG;YACtB,kBAAkB,EAAE,GAAG;YACvB,cAAc,EAAE,CAAC;SAClB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,IAAW;SACtB,CAAC,CAAC;QACH,4CAA4C;QAC5C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC9C,WAAW,CAAC,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CACtC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACf,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1D,0CAA0C;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1B,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;QACvB,CAAC;QACD,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,OAAO,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,EAAE,CAAC,CAAC;QAErF,sEAAsE;QACtE,oEAAoE;QACpE,uDAAuD;QACvD,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,CAAC;QAC7F,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,IAAI,CAAC,EAAE,iDAAiD,CAAC,CAAC;QAEvF,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACvC,CAAC,CAAC,OAAO;aACN,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;aACrC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CACjD,CAAC;QACF,MAAM,CAAC,EAAE,CAAC,QAAQ,EAAE,mDAAmD,CAAC,CAAC;QAEzE,wDAAwD;QACxD,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CACxC,CAAC,CAAC,OAAO;aACN,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;aACrC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CACjD,CAAC;QACF,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,qDAAqD,CAAC,CAAC;QAE5E,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/adaptive/hard-fail.test.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Tests that selectAdaptive throws OverBudgetError when the picker has
+ * folded everything it can but the result still exceeds the hard budget.
+ *
+ * The strategy's philosophy: surface the overage rather than silently
+ * dropping entries. The host decides how to recover.
+ */
+export {};
+//# sourceMappingURL=hard-fail.test.d.ts.map

package/dist/test/adaptive/hard-fail.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hard-fail.test.d.ts","sourceRoot":"","sources":["../../../test/adaptive/hard-fail.test.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}