@animalabs/context-manager 0.5.4 → 0.5.9

package/dist/test/speculation-cap.test.js

@@ -7,9 +7,15 @@
  * speculatively-built L1s before there was any real budget pressure.
  *
  * Post-fix:
- *  - `maxSpeculativeL1s` caps the count of (unmerged L1s + queued chunks).
- *    When at cap, `onNewMessage` defers auto-tick — chunks still queue,
- *    but compression doesn't fire until an explicit tick() / compile().
+ *  - `maxSpeculativeL1s` caps the count of *produced, unmerged* L1 summaries.
+ *    When at cap, `onNewMessage` defers auto-tick L1 production — chunks still
+ *    queue, but compression doesn't fire until merges bring the unmerged count
+ *    back under the cap (or an explicit tick() / compile()).
+ *  - The cap does NOT count the pending compression backlog and does NOT gate
+ *    merges: merges consolidate L1s into L_{k+1} and REDUCE the unmerged count,
+ *    so gating them would deadlock (too many unmerged L1s blocks the merges that
+ *    would relieve the cap, and a large backlog blocks the compression that
+ *    would drain it). See the "does not deadlock" regression suite below.
  *  - `shouldCompressPreflight()` is overridable so subclasses can add
  *    custom predictive scheduling.
  */
@@ -83,6 +89,7 @@ describe('AutobiographicalStrategy — speculation cap (gap #8)', () => {
             recentWindowTokens: 5,
             targetChunkTokens: 20,
             autoTickOnNewMessage: true,
+            l1HoldbackChunks: 0, // this suite tests cap/preflight gating at chunk close
         });
         const manager = await setupWithQueuedChunk(strategy);
         assert.ok(strategy.hasQueuedChunk(), 'sanity: chunk should have formed in compressible region');
@@ -95,6 +102,7 @@ describe('AutobiographicalStrategy — speculation cap (gap #8)', () => {
             recentWindowTokens: 5,
             targetChunkTokens: 20,
             autoTickOnNewMessage: true,
+            l1HoldbackChunks: 0, // this suite tests cap/preflight gating at chunk close
             maxSpeculativeL1s: 2,
         });
         const manager = await ContextManager.open({
@@ -121,6 +129,7 @@ describe('AutobiographicalStrategy — speculation cap (gap #8)', () => {
             recentWindowTokens: 5,
             targetChunkTokens: 20,
             autoTickOnNewMessage: true,
+            l1HoldbackChunks: 0, // this suite tests cap/preflight gating at chunk close
             maxSpeculativeL1s: 5,
         });
         const manager = await ContextManager.open({
@@ -147,6 +156,7 @@ describe('AutobiographicalStrategy — speculation cap (gap #8)', () => {
             recentWindowTokens: 5,
             targetChunkTokens: 20,
             autoTickOnNewMessage: true,
+            l1HoldbackChunks: 0, // this suite tests cap/preflight gating at chunk close
         });
         const manager = await setupWithQueuedChunk(strategy);
         assert.ok(strategy.hasQueuedChunk(), 'sanity: chunk formed');
@@ -154,4 +164,170 @@ describe('AutobiographicalStrategy — speculation cap (gap #8)', () => {
         manager.close();
     });
 });
+/**
+ * Regression: the speculation cap must throttle L1 *production* without
+ * deadlocking. Before this fix, `isAtSpeculativeCap()` counted
+ * `unmergedL1s + compressionQueue.length` and gated the *entire* drain. A store
+ * that accumulated more unmerged L1s than the cap (e.g. a manual backfill) could
+ * never recover: the cap blocked the merges that would reduce the count, and the
+ * backlog blocked the compression that would drain it. (Observed live: an agent
+ * with 79 unmerged L1s, cap 36, and 13 queued merges sat frozen indefinitely.)
+ */
+describe('AutobiographicalStrategy — speculation cap does not deadlock (regression)', () => {
+    before(cleanup);
+    after(cleanup);
+    beforeEach(cleanup);
+    class DrainStrategy extends AutobiographicalStrategy {
+        mergeRuns = 0;
+        seedL1(content) {
+            const entry = {
+                id: `L1-${this.nextSummaryIdCounter()}`,
+                level: 1,
+                content,
+                tokens: Math.ceil(content.length / 4),
+                sourceLevel: 0,
+                sourceIds: ['x'],
+                sourceRange: { first: 'x', last: 'x' },
+                created: Date.now(),
+            };
+            this.pushSummary(entry);
+            return entry;
+        }
+        queueMerge(ids) {
+            this.enqueueMerge({ level: 2, sourceIds: ids });
+        }
+        atCap() { return this.isAtSpeculativeCap(); }
+        unmergedL1() {
+            return this.summaries.filter((s) => s.level === 1 && !s.mergedInto).length;
+        }
+        get mergeQ() { return this.mergeQueue; }
+        get compQ() { return this.compressionQueue; }
+        // Isolate the drain/cap gating from executeMerge's message-store coupling:
+        // simulate a successful merge by marking the sources merged.
+        async executeMerge(_level, sourceIds) {
+            this.mergeRuns++;
+            for (const id of sourceIds) {
+                const s = this.summaries.find((x) => x.id === id);
+                if (s)
+                    s.mergedInto = 'L2-test';
+            }
+        }
+    }
+    it('cap counts produced unmerged L1s only — a compression backlog must not trip it', async () => {
+        const strategy = new DrainStrategy({
+            headWindowTokens: 0,
+            recentWindowTokens: 5,
+            maxSpeculativeL1s: 5,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({ path: TEST_STORE_PATH, strategy });
+        strategy.seedL1('only one'); // 1 produced unmerged L1
+        for (let i = 0; i < 100; i++)
+            strategy.compQ.push(i); // huge pending backlog
+        assert.equal(strategy.atCap(), false, 'a 100-deep compression backlog with 1 produced L1 must NOT trip a cap of 5 (pre-fix deadlock)');
+        for (let i = 0; i < 5; i++)
+            strategy.seedL1(`x${i}`); // now 6 produced unmerged > 5
+        assert.equal(strategy.atCap(), true, 'six produced unmerged L1s exceed the cap of 5');
+        manager.close();
+    });
+    it('over-cap with queued merges still drains merges, then the cap clears', async () => {
+        const membrane = { complete: async () => ({ content: [{ type: 'text', text: '[mock]' }] }) };
+        const strategy = new DrainStrategy({
+            headWindowTokens: 0,
+            recentWindowTokens: 5,
+            maxSpeculativeL1s: 3,
+            hierarchical: true,
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: membrane,
+        });
+        const ids = [];
+        for (let i = 0; i < 8; i++)
+            ids.push(strategy.seedL1(`s${i}`).id); // 8 unmerged > cap 3
+        strategy.queueMerge(ids.slice(0, 6)); // one L2 merge over 6 of them
+        assert.equal(strategy.atCap(), true, 'precondition: over the cap');
+        assert.equal(strategy.mergeQ.length, 1, 'precondition: a merge is queued');
+        await manager.tick(); // pre-fix: bailed at the cap → permanent deadlock
+        assert.equal(strategy.mergeRuns, 1, 'merge must run even while over the speculative cap');
+        assert.equal(strategy.mergeQ.length, 0, 'merge dequeued after success');
+        assert.equal(strategy.unmergedL1(), 2, '6 of 8 L1s consolidated');
+        assert.equal(strategy.atCap(), false, 'cap cleared → L1 compression can resume');
+        manager.close();
+    });
+});
+/**
+ * Regression: `driveSpeculativeDrain` must keep recursing as long as ticks do
+ * real work — using a monotonic work counter, NOT a queue-length delta. A
+ * productive tick can ALSO enqueue a follow-on item (e.g. a merge that schedules
+ * the next-level merge), leaving the queue length unchanged. The old
+ * length-delta check read that as "no progress" and halted the drain with the
+ * backlog only partly cleared — observed live: a single trigger drained ~4 of
+ * Lena's 13 queued merges, then stalled until the next message.
+ */
+describe('AutobiographicalStrategy — drain progresses past flat-length ticks (regression)', () => {
+    before(cleanup);
+    after(cleanup);
+    beforeEach(cleanup);
+    class FlatQueueStrategy extends AutobiographicalStrategy {
+        mergeRuns = 0;
+        refills = 4;
+        used = new Set();
+        seedL1(content) {
+            const entry = {
+                id: `L1-${this.nextSummaryIdCounter()}`,
+                level: 1, content, tokens: Math.ceil(content.length / 4),
+                sourceLevel: 0, sourceIds: ['x'], sourceRange: { first: 'x', last: 'x' },
+                created: Date.now(),
+            };
+            this.pushSummary(entry);
+            return entry;
+        }
+        qMerge(ids) { this.enqueueMerge({ level: 2, sourceIds: ids }); }
+        get mergeQ() { return this.mergeQueue; }
+        // Each merge consolidates its sources AND (for the first few) enqueues a
+        // follow-on merge — so the queue length nets out unchanged that tick.
+        async executeMerge(_level, sourceIds) {
+            this.mergeRuns++;
+            for (const id of sourceIds) {
+                const s = this.summaries.find((x) => x.id === id);
+                if (s)
+                    s.mergedInto = 'L2-x';
+                this.used.add(id);
+            }
+            if (this.refills-- > 0) {
+                const fresh = this.summaries
+                    .filter((s) => s.level === 1 && !s.mergedInto && !this.used.has(s.id))
+                    .slice(0, 6).map((s) => s.id);
+                if (fresh.length >= 2)
+                    this.qMerge(fresh);
+            }
+        }
+    }
+    it('a single trigger drains all merges even when each enqueues a follow-on (flat length)', async () => {
+        const strategy = new FlatQueueStrategy({
+            headWindowTokens: 0, recentWindowTokens: 5, hierarchical: true, // no cap → merges always allowed
+        });
+        const manager = await ContextManager.open({
+            path: TEST_STORE_PATH,
+            strategy,
+            membrane: { complete: async () => ({ content: [{ type: 'text', text: 'x' }] }) },
+        });
+        const ids = [];
+        for (let i = 0; i < 60; i++)
+            ids.push(strategy.seedL1(`s${i}`).id);
+        strategy.qMerge(ids.slice(0, 6)); // 1 queued; 4 refills → 5 merges total expected
+        // One trigger, as a single onNewMessage would do.
+        strategy.driveSpeculativeDrain(manager.createStrategyContext());
+        // Let the microtask recursion + async ticks settle.
+        for (let i = 0; i < 100 && strategy.mergeQ.length > 0; i++) {
+            await new Promise(r => setTimeout(r, 10));
+        }
+        await new Promise(r => setTimeout(r, 50));
+        assert.ok(strategy.mergeRuns >= 5, `drain must process all merges incl. follow-ons (ran ${strategy.mergeRuns}); pre-fix it halts at 1`);
+        assert.equal(strategy.mergeQ.length, 0, 'merge queue fully drained from a single trigger');
+        manager.close();
+    });
+});
 //# sourceMappingURL=speculation-cap.test.js.map

package/dist/test/speculation-cap.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"speculation-cap.test.js","sourceRoot":"","sources":["../../test/speculation-cap.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,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;AAI3E,MAAM,eAAe,GAAG,wBAAwB,CAAC;AAEjD,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;AACD,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,oBAAqB,SAAQ,wBAAwB;IAClD,SAAS,GAAG,CAAC,CAAC;IAEZ,KAAK,CAAC,IAAI,CAAC,GAAoB;QACtC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,kEAAkE;QAClE,kEAAkE;IACpE,CAAC;IAED,MAAM,CAAC,OAAe;QACpB,MAAM,KAAK,GAAiB;YAC1B,EAAE,EAAE,MAAM,IAAI,CAAC,oBAAoB,EAAE,EAAE;YACvC,KAAK,EAAE,CAAC;YACR,OAAO;YACP,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACrC,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC,GAAG,CAAC;YAChB,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;YACtC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,cAAc;QACZ,OAAQ,IAAY,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;IACnD,CAAC;CACF;AAED;;;;GAIG;AACH,KAAK,UAAU,oBAAoB,CAAC,QAA8B;IAChE,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;QACxC,IAAI,EAAE,eAAe;QACrB,QAAQ;KACT,CAAC,CAAC;IACH,8EAA8E;IAC9E,gFAAgF;IAChF,qEAAqE;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE,+CAA+C;IAC/C,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;SAC3B,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,yDAAyD,CAAC,CAAC;QAChG,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,EAAE,wCAAwC,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;QAClG,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,iBAAiB,EAAE,CAAC;SACrB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QACH,0DAA0D;QAC1D,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7B,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7B,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7B,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CACV,QAAQ,CAAC,SAAS,EAClB,WAAW,EACX,4EAA4E,CAC7E,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;QAClE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,iBAAiB,EAAE,CAAC;SACrB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QACH,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7B,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,GAAG,WAAW,EAAE,sCAAsC,CAAC,CAAC;QACpF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC9D,MAAM,WAAY,SAAQ,oBAAoB;YACzB,uBAAuB,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;SACxE;QACD,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC;YAC/B,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;SAC3B,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,sCAAsC,CAAC,CAAC;QAC5E,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
+{"version":3,"file":"speculation-cap.test.js","sourceRoot":"","sources":["../../test/speculation-cap.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AACpE,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;AAI3E,MAAM,eAAe,GAAG,wBAAwB,CAAC;AAEjD,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;AACD,SAAS,SAAS,CAAC,IAAY;IAC7B,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,oBAAqB,SAAQ,wBAAwB;IAClD,SAAS,GAAG,CAAC,CAAC;IAEZ,KAAK,CAAC,IAAI,CAAC,GAAoB;QACtC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,kEAAkE;QAClE,kEAAkE;IACpE,CAAC;IAED,MAAM,CAAC,OAAe;QACpB,MAAM,KAAK,GAAiB;YAC1B,EAAE,EAAE,MAAM,IAAI,CAAC,oBAAoB,EAAE,EAAE;YACvC,KAAK,EAAE,CAAC;YACR,OAAO;YACP,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YACrC,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC,GAAG,CAAC;YAChB,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;YACtC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qEAAqE;IACrE,cAAc;QACZ,OAAQ,IAAY,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;IACnD,CAAC;CACF;AAED;;;;GAIG;AACH,KAAK,UAAU,oBAAoB,CAAC,QAA8B;IAChE,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;QACxC,IAAI,EAAE,eAAe;QACrB,QAAQ;KACT,CAAC,CAAC;IACH,8EAA8E;IAC9E,gFAAgF;IAChF,qEAAqE;IACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE,+CAA+C;IAC/C,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;IACnE,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,EAAE,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,gBAAgB,EAAE,CAAC,EAAE,uDAAuD;SAC7E,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,yDAAyD,CAAC,CAAC;QAChG,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,IAAI,CAAC,EAAE,wCAAwC,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;QAClG,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QACzE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,gBAAgB,EAAE,CAAC,EAAE,uDAAuD;YAC5E,iBAAiB,EAAE,CAAC;SACrB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QACH,0DAA0D;QAC1D,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7B,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAC7B,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7B,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CACV,QAAQ,CAAC,SAAS,EAClB,WAAW,EACX,4EAA4E,CAC7E,CAAC;QACF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;QAClE,MAAM,QAAQ,GAAG,IAAI,oBAAoB,CAAC;YACxC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,gBAAgB,EAAE,CAAC,EAAE,uDAAuD;YAC5E,iBAAiB,EAAE,CAAC;SACrB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;SACT,CAAC,CAAC;QACH,QAAQ,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAE7B,MAAM,WAAW,GAAG,QAAQ,CAAC,SAAS,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,aAAa,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1C,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,GAAG,WAAW,EAAE,sCAAsC,CAAC,CAAC;QACpF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,KAAK,IAAI,EAAE;QAC9D,MAAM,WAAY,SAAQ,oBAAoB;YACzB,uBAAuB,KAAc,OAAO,KAAK,CAAC,CAAC,CAAC;SACxE;QACD,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC;YAC/B,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,EAAE;YACrB,oBAAoB,EAAE,IAAI;YAC1B,gBAAgB,EAAE,CAAC,EAAE,uDAAuD;SAC7E,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAErD,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,cAAc,EAAE,EAAE,sBAAsB,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,sCAAsC,CAAC,CAAC;QAC5E,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,QAAQ,CAAC,2EAA2E,EAAE,GAAG,EAAE;IACzF,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,MAAM,aAAc,SAAQ,wBAAwB;QAC3C,SAAS,GAAG,CAAC,CAAC;QAErB,MAAM,CAAC,OAAe;YACpB,MAAM,KAAK,GAAiB;gBAC1B,EAAE,EAAE,MAAM,IAAI,CAAC,oBAAoB,EAAE,EAAE;gBACvC,KAAK,EAAE,CAAC;gBACR,OAAO;gBACP,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBACrC,WAAW,EAAE,CAAC;gBACd,SAAS,EAAE,CAAC,GAAG,CAAC;gBAChB,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;gBACtC,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;aACpB,CAAC;YACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,UAAU,CAAC,GAAa;YACrB,IAAY,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,CAAC;QACD,KAAK,KAAc,OAAQ,IAAY,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC/D,UAAU;YACR,OAAQ,IAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;QACpG,CAAC;QACD,IAAI,MAAM,KAAgB,OAAQ,IAAY,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5D,IAAI,KAAK,KAAe,OAAQ,IAAY,CAAC,gBAAgB,CAAC,CAAC,CAAC;QAEhE,2EAA2E;QAC3E,6DAA6D;QAC1C,KAAK,CAAC,YAAY,CAAC,MAAW,EAAE,SAAmB;YACpE,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAI,IAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBACzE,IAAI,CAAC;oBAAG,CAAS,CAAC,UAAU,GAAG,SAAS,CAAC;YAC3C,CAAC;QACH,CAAC;KACF;IAED,EAAE,CAAC,gFAAgF,EAAE,KAAK,IAAI,EAAE;QAC9F,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC;YACjC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,CAAC;YACpB,YAAY,EAAE,IAAI;SACnB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC;QAE/E,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,yBAAyB;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;QAE7E,MAAM,CAAC,KAAK,CACV,QAAQ,CAAC,KAAK,EAAE,EAChB,KAAK,EACL,+FAA+F,CAChG,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,8BAA8B;QACpF,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,+CAA+C,CAAC,CAAC;QAEtF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;QACpF,MAAM,QAAQ,GAAG,EAAE,QAAQ,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;QAC7F,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC;YACjC,gBAAgB,EAAE,CAAC;YACnB,kBAAkB,EAAE,CAAC;YACrB,iBAAiB,EAAE,CAAC;YACpB,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,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,qBAAqB;QACxF,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,8BAA8B;QAEpE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,4BAA4B,CAAC,CAAC;QACnE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,iCAAiC,CAAC,CAAC;QAE3E,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,kDAAkD;QAExE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC,EAAE,oDAAoD,CAAC,CAAC;QAC1F,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;QACxE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,yBAAyB,CAAC,CAAC;QAClE,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,yCAAyC,CAAC,CAAC;QAEjF,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH;;;;;;;;GAQG;AACH,QAAQ,CAAC,iFAAiF,EAAE,GAAG,EAAE;IAC/F,MAAM,CAAC,OAAO,CAAC,CAAC;IAChB,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,UAAU,CAAC,OAAO,CAAC,CAAC;IAEpB,MAAM,iBAAkB,SAAQ,wBAAwB;QAC/C,SAAS,GAAG,CAAC,CAAC;QACb,OAAO,GAAG,CAAC,CAAC;QACZ,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAEjC,MAAM,CAAC,OAAe;YACpB,MAAM,KAAK,GAAiB;gBAC1B,EAAE,EAAE,MAAM,IAAI,CAAC,oBAAoB,EAAE,EAAE;gBACvC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxD,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;gBACxE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;aACpB,CAAC;YACF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,GAAa,IAAW,IAAY,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACzF,IAAI,MAAM,KAAgB,OAAQ,IAAY,CAAC,UAAU,CAAC,CAAC,CAAC;QAE5D,yEAAyE;QACzE,sEAAsE;QACnD,KAAK,CAAC,YAAY,CAAC,MAAW,EAAE,SAAmB;YACpE,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAI,IAAY,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;gBACzE,IAAI,CAAC;oBAAG,CAAS,CAAC,UAAU,GAAG,MAAM,CAAC;gBACtC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpB,CAAC;YACD,IAAI,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAI,IAAY,CAAC,SAAS;qBAClC,MAAM,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;qBACnF,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;oBAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;KACF;IAED,EAAE,CAAC,sFAAsF,EAAE,KAAK,IAAI,EAAE;QACpG,MAAM,QAAQ,GAAG,IAAI,iBAAiB,CAAC;YACrC,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,iCAAiC;SAClG,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC;YACxC,IAAI,EAAE,eAAe;YACrB,QAAQ;YACR,QAAQ,EAAE,EAAE,QAAQ,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAS;SACxF,CAAC,CAAC;QACH,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,gDAAgD;QAElF,kDAAkD;QACjD,QAAgB,CAAC,qBAAqB,CAAE,OAAe,CAAC,qBAAqB,EAAE,CAAC,CAAC;QAElF,oDAAoD;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3D,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAE1C,MAAM,CAAC,EAAE,CACP,QAAQ,CAAC,SAAS,IAAI,CAAC,EACvB,uDAAuD,QAAQ,CAAC,SAAS,0BAA0B,CACpG,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,iDAAiD,CAAC,CAAC;QAC3F,OAAO,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/summary-log-consistency.test.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Regression tests for the setMergedInto index-desync clobber
+ * (Lena chronicle, 2026-07: 4 summaries silently overwritten).
+ *
+ * `loadPersistedState` filters empty-content summaries out of the
+ * in-memory array while they remain in the persisted log. The old
+ * `setMergedInto` edited the log by IN-MEMORY index, so with any empty
+ * entry in the log every merge-update landed one slot early —
+ * overwriting a neighboring summary and leaving the intended entry as
+ * a duplicate-id pair with diverging mergedInto.
+ *
+ * Invariants pinned here:
+ *   1. setMergedInto edits the log slot with the matching ID, never a
+ *      neighbor, even when in-memory indices are shifted.
+ *   2. Load dedupes duplicate-id copies, preferring the merged one.
+ */
+export {};
+//# sourceMappingURL=summary-log-consistency.test.d.ts.map

package/dist/test/summary-log-consistency.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summary-log-consistency.test.d.ts","sourceRoot":"","sources":["../../test/summary-log-consistency.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG"}

package/dist/test/summary-log-consistency.test.js

@@ -0,0 +1,97 @@
+/**
+ * Regression tests for the setMergedInto index-desync clobber
+ * (Lena chronicle, 2026-07: 4 summaries silently overwritten).
+ *
+ * `loadPersistedState` filters empty-content summaries out of the
+ * in-memory array while they remain in the persisted log. The old
+ * `setMergedInto` edited the log by IN-MEMORY index, so with any empty
+ * entry in the log every merge-update landed one slot early —
+ * overwriting a neighboring summary and leaving the intended entry as
+ * a duplicate-id pair with diverging mergedInto.
+ *
+ * Invariants pinned here:
+ *   1. setMergedInto edits the log slot with the matching ID, never a
+ *      neighbor, even when in-memory indices are shifted.
+ *   2. Load dedupes duplicate-id copies, preferring the merged one.
+ */
+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-summary-log-consistency';
+const SLOT = 'default/autobio:summaries';
+function cleanup() {
+    if (existsSync(TEST_STORE_PATH)) {
+        rmSync(TEST_STORE_PATH, { recursive: true, force: true });
+    }
+}
+function entry(id, content, extra = {}) {
+    return {
+        id,
+        level: 1,
+        content,
+        tokens: Math.max(1, Math.ceil(content.length / 4)),
+        sourceLevel: 0,
+        sourceIds: ['1', '2'],
+        sourceRange: { first: '1', last: '2' },
+        created: 1750000000000,
+        ...extra,
+    };
+}
+describe('Summary log consistency (clobber regression)', () => {
+    before(() => cleanup());
+    after(() => cleanup());
+    it('setMergedInto edits the matching-ID slot, not a shifted neighbor', async () => {
+        cleanup();
+        // Seed a log whose in-memory view will be SHIFTED: an empty-content
+        // entry (filtered on load) sits before two valid entries.
+        {
+            const strategy = new AutobiographicalStrategy({ recentWindowTokens: 1000 });
+            const manager = await ContextManager.open({ path: TEST_STORE_PATH, strategy });
+            const store = manager.getStore();
+            store.appendToStateJson(SLOT, entry('L1-0', '')); // empty → filtered on load
+            store.appendToStateJson(SLOT, entry('L1-1', 'first real memory'));
+            store.appendToStateJson(SLOT, entry('L1-2', 'second real memory'));
+            manager.sync();
+            await manager.close();
+        }
+        // Reopen: in-memory summaries = [L1-1, L1-2]; log = [L1-0, L1-1, L1-2].
+        const strategy = new AutobiographicalStrategy({ recentWindowTokens: 1000 });
+        const manager = await ContextManager.open({ path: TEST_STORE_PATH, strategy });
+        const s = strategy;
+        assert.strictEqual(s.summaries.length, 2, 'empty entry filtered on load');
+        const target = s.summaries.find((x) => x.id === 'L1-1');
+        s.setMergedInto(target, 'L2-99');
+        const stored = manager.getStore().getStateJson(SLOT);
+        const byId = new Map(stored.map((x) => [x.id, x]));
+        assert.strictEqual(stored.length, 3, 'no entries added or lost');
+        assert.strictEqual(byId.get('L1-0')?.content, '', 'empty neighbor NOT clobbered');
+        assert.strictEqual(byId.get('L1-1')?.mergedInto, 'L2-99', 'merge update landed on the right entry');
+        assert.strictEqual(byId.get('L1-2')?.mergedInto, undefined, 'other neighbor untouched');
+        await manager.close();
+    });
+    it('load dedupes duplicate-id copies, preferring the merged one', async () => {
+        cleanup();
+        {
+            const strategy = new AutobiographicalStrategy({ recentWindowTokens: 1000 });
+            const manager = await ContextManager.open({ path: TEST_STORE_PATH, strategy });
+            const store = manager.getStore();
+            // Simulate a clobber-era store: same id twice, merged copy first
+            // (the observed shape from the incident), plain copy second.
+            store.appendToStateJson(SLOT, entry('L1-5', 'the memory', { mergedInto: 'L2-7' }));
+            store.appendToStateJson(SLOT, entry('L1-5', 'the memory'));
+            store.appendToStateJson(SLOT, entry('L1-6', 'another memory'));
+            manager.sync();
+            await manager.close();
+        }
+        const strategy = new AutobiographicalStrategy({ recentWindowTokens: 1000 });
+        const manager = await ContextManager.open({ path: TEST_STORE_PATH, strategy });
+        const s = strategy;
+        const copies = s.summaries.filter((x) => x.id === 'L1-5');
+        assert.strictEqual(copies.length, 1, 'duplicate id deduped on load');
+        assert.strictEqual(copies[0].mergedInto, 'L2-7', 'merged copy preferred — plain dupe must not resurrect on the unmerged frontier');
+        assert.strictEqual(s.summaries.length, 2);
+        await manager.close();
+    });
+});
+//# sourceMappingURL=summary-log-consistency.test.js.map

package/dist/test/summary-log-consistency.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"summary-log-consistency.test.js","sourceRoot":"","sources":["../../test/summary-log-consistency.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;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;AAE3E,MAAM,eAAe,GAAG,gCAAgC,CAAC;AACzD,MAAM,IAAI,GAAG,2BAA2B,CAAC;AAEzC,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,KAAK,CAAC,EAAU,EAAE,OAAe,EAAE,QAAiC,EAAE;IAC7E,OAAO;QACL,EAAE;QACF,KAAK,EAAE,CAAC;QACR,OAAO;QACP,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,WAAW,EAAE,CAAC;QACd,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;QACrB,WAAW,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;QACtC,OAAO,EAAE,aAAa;QACtB,GAAG,KAAK;KACT,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IACxB,KAAK,CAAC,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;IAEvB,EAAE,CAAC,kEAAkE,EAAE,KAAK,IAAI,EAAE;QAChF,OAAO,EAAE,CAAC;QACV,oEAAoE;QACpE,0DAA0D;QAC1D,CAAC;YACC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC/E,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,CAAY,2BAA2B;YACxF,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,mBAAmB,CAAC,CAAC,CAAC;YAClE,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,oBAAoB,CAAC,CAAC,CAAC;YACnE,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAED,wEAAwE;QACxE,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,QAAe,CAAC;QAC1B,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;QAE1E,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAC7D,CAAC,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAEjC,MAAM,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,IAAI,CAAU,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,0BAA0B,CAAC,CAAC;QACjE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,8BAA8B,CAAC,CAAC;QAClF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE,wCAAwC,CAAC,CAAC;QACpG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,0BAA0B,CAAC,CAAC;QACxF,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC3E,OAAO,EAAE,CAAC;QACV,CAAC;YACC,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC/E,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC;YACjC,iEAAiE;YACjE,6DAA6D;YAC7D,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACnF,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;YAC3D,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC,CAAC;YAC/D,OAAO,CAAC,IAAI,EAAE,CAAC;YACf,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,wBAAwB,CAAC,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5E,MAAM,OAAO,GAAG,MAAM,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,QAAe,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,CAAC;QAC/D,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC;QACrE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,EAAE,gFAAgF,CAAC,CAAC;QACnI,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/test/tool-pairing-invariant.test.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Bug 6.7: context-manager had no full post-selection tool-pair validation —
+ * only trailing (`trimOrphanedToolUse`) and leading orphan trims. Mid-list
+ * orphans (a budget break cutting a raw pin pair; the uncompressed-chunk
+ * fallback emitting a raw tool_result whose tool_use chunk already
+ * compressed) sailed through to the wire layer.
+ *
+ * `enforceToolPairing` is the final structural pass in selectHierarchical:
+ * every tool_use must be answered by a matching tool_result in the
+ * immediately-following entry, and every tool_result must answer a tool_use
+ * in the immediately-preceding entry. Repair prefers preserving pairs
+ * (stub tool_result) over dropping content.
+ */
+export {};
+//# sourceMappingURL=tool-pairing-invariant.test.d.ts.map

package/dist/test/tool-pairing-invariant.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tool-pairing-invariant.test.d.ts","sourceRoot":"","sources":["../../test/tool-pairing-invariant.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG"}

package/dist/test/tool-pairing-invariant.test.js

@@ -0,0 +1,225 @@
+/**
+ * Bug 6.7: context-manager had no full post-selection tool-pair validation —
+ * only trailing (`trimOrphanedToolUse`) and leading orphan trims. Mid-list
+ * orphans (a budget break cutting a raw pin pair; the uncompressed-chunk
+ * fallback emitting a raw tool_result whose tool_use chunk already
+ * compressed) sailed through to the wire layer.
+ *
+ * `enforceToolPairing` is the final structural pass in selectHierarchical:
+ * every tool_use must be answered by a matching tool_result in the
+ * immediately-following entry, and every tool_result must answer a tool_use
+ * in the immediately-preceding entry. Repair prefers preserving pairs
+ * (stub tool_result) over dropping content.
+ */
+import { describe, it, before, after } from 'node:test';
+import assert from 'node:assert';
+import { rmSync, existsSync } from 'node:fs';
+import { AutobiographicalStrategy, ContextManager } from '../src/index.js';
+// ---------------------------------------------------------------------------
+// Invariant checker (mirrors the Anthropic API's structural rules)
+// ---------------------------------------------------------------------------
+function assertPaired(entries) {
+    for (let i = 0; i < entries.length; i++) {
+        for (const block of entries[i].content) {
+            if (block.type === 'tool_use') {
+                const id = block.id;
+                const next = entries[i + 1];
+                assert.ok(next?.content.some((b) => b.type === 'tool_result' && b.toolUseId === id), `entries[${i}]: tool_use ${id} not answered in entries[${i + 1}]`);
+            }
+            if (block.type === 'tool_result') {
+                const tid = block.toolUseId;
+                const prev = entries[i - 1];
+                assert.ok(prev?.content.some((b) => b.type === 'tool_use' && b.id === tid), `entries[${i}]: tool_result ${tid} has no tool_use in entries[${i - 1}]`);
+            }
+        }
+    }
+}
+function entry(participant, content) {
+    return { index: 0, participant, content };
+}
+function text(t) {
+    return { type: 'text', text: t };
+}
+function use(id) {
+    return { type: 'tool_use', id, name: 'fn', input: {} };
+}
+function result(id, body = 'ok') {
+    return { type: 'tool_result', toolUseId: id, content: body };
+}
+function runEnforce(entries) {
+    const strategy = new AutobiographicalStrategy({});
+    strategy
+        .enforceToolPairing(entries);
+    return entries;
+}
+describe('enforceToolPairing — post-selection pairing validator', () => {
+    it('leaves already-valid output untouched', () => {
+        const entries = [
+            entry('User', [text('hello')]),
+            entry('Claude', [text('working'), use('A')]),
+            entry('User', [result('A')]),
+            entry('Claude', [text('done')]),
+        ];
+        entries.forEach((e, i) => { e.index = i; });
+        const snapshot = JSON.stringify(entries);
+        runEnforce(entries);
+        assert.strictEqual(JSON.stringify(entries), snapshot, 'valid input must pass through unchanged');
+        assertPaired(entries);
+    });
+    it('drops a mid-list orphan tool_result (its tool_use was compressed away)', () => {
+        const entries = [
+            entry('Claude', [text('summary of earlier work')]),
+            // Raw tool_result whose tool_use chunk already compressed — the
+            // uncompressed-chunk fallback shape.
+            entry('User', [result('GONE', 'orphaned payload')]),
+            entry('Claude', [text('later message')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        // Entry preserved as a placeholder, not silently deleted.
+        assert.strictEqual(entries.length, 3);
+        assert.ok(entries[1].content.every((b) => b.type !== 'tool_result'), 'orphan tool_result block must be removed');
+    });
+    it('stubs a mid-list tool_use whose result entry was dropped by a budget break', () => {
+        const entries = [
+            entry('Claude', [text('let me check'), use('A')]),
+            // The tool_result entry got cut by a budget break; next entry is
+            // ordinary conversation.
+            entry('User', [text('unrelated next message')]),
+            entry('Claude', [text('reply')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        // The tool_use is preserved (not dropped) and answered by a stub.
+        assert.ok(entries[0].content.some((b) => b.type === 'tool_use'), 'tool_use must be preserved');
+        const stub = entries[1];
+        assert.ok(stub.content.some((b) => b.type === 'tool_result' && b.toolUseId === 'A'), 'a stub tool_result entry must be inserted immediately after the tool_use');
+    });
+    it('adds stubs for partially-answered parallel tool_use blocks', () => {
+        const entries = [
+            entry('Claude', [use('A'), use('B'), use('C')]),
+            entry('User', [result('B')]),
+            entry('Claude', [text('continues')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        const ids = entries[1].content
+            .filter((b) => b.type === 'tool_result')
+            .map((b) => b.toolUseId)
+            .sort();
+        assert.deepStrictEqual(ids, ['A', 'B', 'C'], 'missing results must be stubbed alongside the real one');
+    });
+    it('repairs a recall pair interleaved between a tool_use and its (now non-adjacent) result', () => {
+        const entries = [
+            entry('Claude', [use('A')]),
+            // A recall pair landed between the pair members.
+            entry('Context Manager', [text('[CM] Recall memory L1-3.')]),
+            entry('Claude', [text('I remember researching X.')]),
+            entry('User', [result('A', 'the real result, now orphaned')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        // Look-ahead relocation: the REAL result payload must be preserved, not
+        // dropped in favour of a stub (roast finding #2).
+        const preserved = entries.some((e) => e.content.some((b) => b.type === 'tool_result' &&
+            b.toolUseId === 'A' &&
+            b.content === 'the real result, now orphaned'));
+        assert.ok(preserved, 'the genuine tool result must be relocated, not replaced by a stub');
+    });
+    it('handles consecutive tool_use entries (double budget cut)', () => {
+        const entries = [
+            entry('Claude', [use('A')]),
+            entry('Claude', [use('B')]),
+            entry('User', [result('B')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+    });
+    it('appends a stub entry for a trailing unanswered tool_use', () => {
+        const entries = [
+            entry('User', [text('hi')]),
+            entry('Claude', [text('checking'), use('C')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        assert.strictEqual(entries.length, 3, 'a stub results entry must be appended');
+        assert.ok(entries[2].content.some((b) => b.type === 'tool_result' && b.toolUseId === 'C'));
+    });
+    it('dedupes duplicate tool_results for the same id', () => {
+        const entries = [
+            entry('Claude', [use('A')]),
+            entry('User', [result('A', 'first'), result('A', 'second')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        const count = entries[1].content.filter((b) => b.type === 'tool_result').length;
+        assert.strictEqual(count, 1, 'duplicate tool_result for the same id must be dropped');
+    });
+    it('reindexes entries after inserting stub entries', () => {
+        const entries = [
+            entry('Claude', [use('A')]),
+            entry('User', [text('not a result')]),
+        ];
+        runEnforce(entries);
+        assertPaired(entries);
+        for (let i = 0; i < entries.length; i++) {
+            assert.strictEqual(entries[i].index, i, `entry ${i} has stale index ${entries[i].index}`);
+        }
+    });
+});
+// ---------------------------------------------------------------------------
+// Regression: the guard must run on the ADAPTIVE render path too. FKM defaults
+// autobiographical strategies onto `selectAdaptive` (adaptiveResolution=true),
+// which has the same mid-list orphan producers as the hierarchical path but
+// only received `trimOrphanedToolUse` before this fix. See roast finding #1.
+// ---------------------------------------------------------------------------
+describe('enforceToolPairing — wired into the adaptive render path (FKM default)', () => {
+    const STORE = './test-tool-pairing-adaptive';
+    const clean = () => { if (existsSync(STORE))
+        rmSync(STORE, { recursive: true, force: true }); };
+    before(clean);
+    after(clean);
+    it('repairs a mid-list orphan produced on the adaptive path', async () => {
+        clean();
+        // Inject a mid-list orphan tool_use into the merged entries at the exact
+        // point `selectAdaptive` hands off to the final structural passes — the
+        // shape a budget break or recall-pair interleave produces. It is spliced
+        // NOT at the tail, so `trimOrphanedToolUse` (trailing-only) cannot remove
+        // it; only `enforceToolPairing` can. If the guard is not wired into
+        // `selectAdaptive`, the orphan survives and `assertPaired` fails.
+        class InjectingStrategy extends AutobiographicalStrategy {
+            mergeAdjacentBodyGroupRaw(entries, store) {
+                const merged = super.mergeAdjacentBodyGroupRaw(entries, store);
+                if (merged.length >= 2) {
+                    merged.splice(1, 0, {
+                        index: 1,
+                        participant: 'Claude',
+                        content: [use('MIDLIST_ORPHAN')],
+                    });
+                    merged.forEach((e, i) => { e.index = i; });
+                }
+                return merged;
+            }
+        }
+        const strategy = new InjectingStrategy({ adaptiveResolution: true });
+        const manager = await ContextManager.open({
+            path: STORE,
+            strategy,
+            membrane: { complete: async () => ({ content: [{ type: 'text', text: 's' }] }) },
+        });
+        for (let i = 0; i < 5; i++) {
+            manager.addMessage(i % 2 === 0 ? 'User' : 'Claude', [
+                { type: 'text', text: `message number ${i}` },
+            ]);
+        }
+        const internals = manager;
+        const entries = strategy.select(internals.messageStore.createView(), internals.contextLog.createView(), { maxTokens: 100000, reserveForResponse: 4000 });
+        // Sanity: the override ran and the injected use was not trimmed as a tail.
+        const orphanPreserved = entries.some(e => e.content.some(b => b.type === 'tool_use' && b.id === 'MIDLIST_ORPHAN'));
+        assert.ok(orphanPreserved, 'setup: injected mid-list tool_use should survive to the pairing pass');
+        // The guard must have stubbed the orphan — output is API-valid.
+        assertPaired(entries);
+        await manager.close();
+    });
+});
+//# sourceMappingURL=tool-pairing-invariant.test.js.map