@animalabs/context-manager 0.4.0 → 0.5.1

package/dist/test/adaptive/harness.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Synthetic test harness for the adaptive-resolution picker.
+ *
+ * Builds a minimal in-memory chronicle simulator with:
+ *  - Chunks (PickerChunk shape) with deterministic token counts.
+ *  - A mocked LLM that produces deterministic "summaries" by hashing input.
+ *  - A summary tree that grows as the LLM is called.
+ *  - A function to run the picker against a built state.
+ *
+ * The mock LLM doesn't actually call any API — it constructs fake summary
+ * content so we can validate picker logic, fold semantics, and cache stickiness
+ * without external dependencies.
+ */
+import type { SummaryEntry } from '../../src/types/strategy.js';
+import type { PickerChunk } from '../../src/adaptive/picker.js';
+import type { ChunkId, SummaryId } from '../../src/adaptive/folding-strategy.js';
+/**
+ * Default tokens per recall pair, regardless of source level.
+ * The design specifies that L_k summaries target a constant size (~2K tokens
+ * by convention) so each level's recall pair has predictable footprint.
+ */
+export declare const DEFAULT_RECALL_PAIR_TOKENS = 200;
+/** Default group size: how many L_k items combine into one L_{k+1}. */
+export declare const DEFAULT_MERGE_THRESHOLD = 6;
+export interface MockChronicleOptions {
+    /** Tokens for each recall pair. */
+    recallPairTokens?: number;
+    /** L_k items per L_{k+1} parent. */
+    mergeThreshold?: number;
+}
+/**
+ * Mutable in-memory chronicle. Mirrors what the real strategy would manage
+ * but trimmed to just what the picker needs.
+ */
+export declare class MockChronicle {
+    readonly chunks: PickerChunk[];
+    readonly summaries: Map<string, SummaryEntry>;
+    readonly recallPairTokens: Map<string, number>;
+    private summaryCounter;
+    readonly mergeThreshold: number;
+    readonly defaultRecallPairTokens: number;
+    /** Mock LLM call count, for telemetry assertions. */
+    llmCalls: number;
+    constructor(opts?: MockChronicleOptions);
+    /**
+     * Add a chunk to the chronicle (e.g., a chat message or a doc shard).
+     *
+     * @returns the created PickerChunk
+     */
+    addChunk(opts: {
+        id: ChunkId;
+        rawTokens: number;
+        bodyGroupId?: string;
+        pinned?: boolean;
+        lockedByAgent?: boolean;
+    }): PickerChunk;
+    /**
+     * Produce an L1 summary for a range of chunks. Mocks the LLM call.
+     * Idempotent: the same chunk range produces the same summary id.
+     *
+     * @returns the produced SummaryEntry (or the existing one if already produced)
+     */
+    produceL1(chunkIds: ChunkId[]): SummaryEntry;
+    /**
+     * Produce an L_{k+1} summary from N L_k summaries.
+     */
+    produceUpper(level: number, sourceSummaryIds: SummaryId[]): SummaryEntry;
+    /**
+     * Speculative pre-producer: when N siblings exist sharing the same potential
+     * parent at level k+1, eagerly produce L_{k+1}. Bottom-up, idempotent.
+     * Mirrors the design's background pre-producer (§7 #2 settled decisions).
+     */
+    preProduceUpperLevels(): void;
+    /**
+     * Build a head/tail bookkeeping from chunk indices.
+     */
+    computeHeadTail(opts: {
+        headTokens: number;
+        tailTokens: number;
+    }): {
+        headTokens: number;
+        tailTokens: number;
+        headChunkIds: Set<ChunkId>;
+        tailChunkIds: Set<ChunkId>;
+    };
+    /**
+     * Apply a snapshot of resolutions back onto the chunks (used after running
+     * the picker to commit the new state for subsequent turns).
+     */
+    applyResolutions(resolutions: ReadonlyMap<ChunkId, number>): void;
+    private linkChunksToL1;
+    private allocSummaryId;
+    private firstChunkSeq;
+    private sumTokens;
+}
+/**
+ * Convenience: build N chunks with uniform token size, then auto-produce
+ * the full summary chain (L1, L2, …) bottom-up via the mergeThreshold rule.
+ *
+ * Returns the populated MockChronicle.
+ */
+export declare function buildChronicleWithChain(opts: {
+    chunkCount: number;
+    tokensPerChunk: number;
+    mergeThreshold?: number;
+    recallPairTokens?: number;
+    produceChain?: boolean;
+}): MockChronicle;
+//# sourceMappingURL=harness.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"harness.d.ts","sourceRoot":"","sources":["../../../test/adaptive/harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAC;AAEjF;;;;GAIG;AACH,eAAO,MAAM,0BAA0B,MAAM,CAAC;AAE9C,uEAAuE;AACvE,eAAO,MAAM,uBAAuB,IAAI,CAAC;AAEzC,MAAM,WAAW,oBAAoB;IACnC,mCAAmC;IACnC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,oCAAoC;IACpC,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,qBAAa,aAAa;IACxB,QAAQ,CAAC,MAAM,EAAE,WAAW,EAAE,CAAM;IACpC,QAAQ,CAAC,SAAS,4BAAsC;IACxD,QAAQ,CAAC,gBAAgB,sBAAgC;IACzD,OAAO,CAAC,cAAc,CAA6B;IAEnD,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,uBAAuB,EAAE,MAAM,CAAC;IAEzC,qDAAqD;IACrD,QAAQ,SAAK;gBAED,IAAI,GAAE,oBAAyB;IAK3C;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE;QACb,EAAE,EAAE,OAAO,CAAC;QACZ,SAAS,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,MAAM,CAAC,EAAE,OAAO,CAAC;QACjB,aAAa,CAAC,EAAE,OAAO,CAAC;KACzB,GAAG,WAAW;IAcf;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,YAAY;IA2B5C;;OAEG;IACH,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,gBAAgB,EAAE,SAAS,EAAE,GAAG,YAAY;IA2CxE;;;;OAIG;IACH,qBAAqB,IAAI,IAAI;IA8B7B;;OAEG;IACH,eAAe,CAAC,IAAI,EAAE;QACpB,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;KACpB,GAAG;QACF,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,YAAY,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QAC3B,YAAY,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;KAC5B;IA4BD;;;OAGG;IACH,gBAAgB,CAAC,WAAW,EAAE,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,IAAI;IASjE,OAAO,CAAC,cAAc;IAOtB,OAAO,CAAC,cAAc;IAMtB,OAAO,CAAC,aAAa;IAKrB,OAAO,CAAC,SAAS;CAKlB;AAMD;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE;IAC5C,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB,GAAG,aAAa,CAmBhB"}

package/dist/test/adaptive/harness.js

@@ -0,0 +1,263 @@
+/**
+ * Synthetic test harness for the adaptive-resolution picker.
+ *
+ * Builds a minimal in-memory chronicle simulator with:
+ *  - Chunks (PickerChunk shape) with deterministic token counts.
+ *  - A mocked LLM that produces deterministic "summaries" by hashing input.
+ *  - A summary tree that grows as the LLM is called.
+ *  - A function to run the picker against a built state.
+ *
+ * The mock LLM doesn't actually call any API — it constructs fake summary
+ * content so we can validate picker logic, fold semantics, and cache stickiness
+ * without external dependencies.
+ */
+/**
+ * Default tokens per recall pair, regardless of source level.
+ * The design specifies that L_k summaries target a constant size (~2K tokens
+ * by convention) so each level's recall pair has predictable footprint.
+ */
+export const DEFAULT_RECALL_PAIR_TOKENS = 200;
+/** Default group size: how many L_k items combine into one L_{k+1}. */
+export const DEFAULT_MERGE_THRESHOLD = 6;
+/**
+ * Mutable in-memory chronicle. Mirrors what the real strategy would manage
+ * but trimmed to just what the picker needs.
+ */
+export class MockChronicle {
+    chunks = [];
+    summaries = new Map();
+    recallPairTokens = new Map();
+    summaryCounter = new Map(); // level -> next id
+    mergeThreshold;
+    defaultRecallPairTokens;
+    /** Mock LLM call count, for telemetry assertions. */
+    llmCalls = 0;
+    constructor(opts = {}) {
+        this.mergeThreshold = opts.mergeThreshold ?? DEFAULT_MERGE_THRESHOLD;
+        this.defaultRecallPairTokens = opts.recallPairTokens ?? DEFAULT_RECALL_PAIR_TOKENS;
+    }
+    /**
+     * Add a chunk to the chronicle (e.g., a chat message or a doc shard).
+     *
+     * @returns the created PickerChunk
+     */
+    addChunk(opts) {
+        const chunk = {
+            id: opts.id,
+            sequence: this.chunks.length,
+            rawTokens: opts.rawTokens,
+            currentResolution: 0,
+            lockedByAgent: opts.lockedByAgent ?? false,
+            bodyGroupId: opts.bodyGroupId,
+            pinned: opts.pinned ?? false,
+        };
+        this.chunks.push(chunk);
+        return chunk;
+    }
+    /**
+     * Produce an L1 summary for a range of chunks. Mocks the LLM call.
+     * Idempotent: the same chunk range produces the same summary id.
+     *
+     * @returns the produced SummaryEntry (or the existing one if already produced)
+     */
+    produceL1(chunkIds) {
+        const sortedIds = [...chunkIds].sort();
+        const sourceKey = `L1:${sortedIds.join(',')}`;
+        // Idempotency check
+        for (const existing of this.summaries.values()) {
+            if (existing.level === 1 && summaryKey(existing) === sourceKey) {
+                return existing;
+            }
+        }
+        const id = this.allocSummaryId(1);
+        const entry = {
+            id,
+            level: 1,
+            content: `[mock L1 summary covering ${chunkIds.length} chunks: ${chunkIds.join(', ')}]`,
+            tokens: this.defaultRecallPairTokens,
+            sourceLevel: 0,
+            sourceIds: [...chunkIds],
+            sourceRange: { first: chunkIds[0], last: chunkIds[chunkIds.length - 1] },
+            created: Date.now(),
+        };
+        this.summaries.set(id, entry);
+        this.recallPairTokens.set(id, this.defaultRecallPairTokens);
+        this.linkChunksToL1(chunkIds, id);
+        this.llmCalls++;
+        return entry;
+    }
+    /**
+     * Produce an L_{k+1} summary from N L_k summaries.
+     */
+    produceUpper(level, sourceSummaryIds) {
+        if (level < 2) {
+            throw new Error('produceUpper requires level >= 2; use produceL1 for level 1');
+        }
+        const sortedIds = [...sourceSummaryIds].sort();
+        const sourceKey = `L${level}:${sortedIds.join(',')}`;
+        for (const existing of this.summaries.values()) {
+            if (existing.level === level && summaryKey(existing) === sourceKey) {
+                return existing;
+            }
+        }
+        const sources = sourceSummaryIds.map((sid) => {
+            const s = this.summaries.get(sid);
+            if (!s)
+                throw new Error(`produceUpper: unknown source summary ${sid}`);
+            if (s.level !== level - 1) {
+                throw new Error(`produceUpper: source ${sid} is level ${s.level}, expected ${level - 1}`);
+            }
+            return s;
+        });
+        const id = this.allocSummaryId(level);
+        const entry = {
+            id,
+            level,
+            content: `[mock L${level} summary merging ${sourceSummaryIds.length} L${level - 1}s]`,
+            tokens: this.defaultRecallPairTokens,
+            sourceLevel: level - 1,
+            sourceIds: [...sourceSummaryIds],
+            sourceRange: {
+                first: sources[0].sourceRange.first,
+                last: sources[sources.length - 1].sourceRange.last,
+            },
+            created: Date.now(),
+        };
+        this.summaries.set(id, entry);
+        this.recallPairTokens.set(id, this.defaultRecallPairTokens);
+        for (const sid of sourceSummaryIds) {
+            const s = this.summaries.get(sid);
+            s.parentId = id;
+        }
+        this.llmCalls++;
+        return entry;
+    }
+    /**
+     * Speculative pre-producer: when N siblings exist sharing the same potential
+     * parent at level k+1, eagerly produce L_{k+1}. Bottom-up, idempotent.
+     * Mirrors the design's background pre-producer (§7 #2 settled decisions).
+     */
+    preProduceUpperLevels() {
+        let changed = true;
+        while (changed) {
+            changed = false;
+            // Find the deepest existing level
+            let maxLevel = 0;
+            for (const s of this.summaries.values())
+                maxLevel = Math.max(maxLevel, s.level);
+            for (let level = 1; level <= maxLevel; level++) {
+                // Group orphaned (parentId === undefined) summaries at this level
+                // by their position in source order. Take consecutive groups of
+                // mergeThreshold and produce the L_{k+1} parent.
+                const orphans = [];
+                for (const s of this.summaries.values()) {
+                    if (s.level === level && !s.parentId)
+                        orphans.push(s);
+                }
+                // Sort by sequence of the first chunk in their source range.
+                orphans.sort((a, b) => this.firstChunkSeq(a) - this.firstChunkSeq(b));
+                while (orphans.length >= this.mergeThreshold) {
+                    const group = orphans.splice(0, this.mergeThreshold);
+                    this.produceUpper(level + 1, group.map((s) => s.id));
+                    changed = true;
+                }
+            }
+        }
+    }
+    /**
+     * Build a head/tail bookkeeping from chunk indices.
+     */
+    computeHeadTail(opts) {
+        const headIds = new Set();
+        const tailIds = new Set();
+        let used = 0;
+        for (let i = 0; i < this.chunks.length; i++) {
+            const c = this.chunks[i];
+            if (used + c.rawTokens > opts.headTokens)
+                break;
+            headIds.add(c.id);
+            used += c.rawTokens;
+        }
+        used = 0;
+        for (let i = this.chunks.length - 1; i >= 0; i--) {
+            const c = this.chunks[i];
+            if (used + c.rawTokens > opts.tailTokens && tailIds.size > 0)
+                break;
+            tailIds.add(c.id);
+            used += c.rawTokens;
+            if (used >= opts.tailTokens)
+                break;
+        }
+        return {
+            headTokens: this.sumTokens(headIds),
+            tailTokens: this.sumTokens(tailIds),
+            headChunkIds: headIds,
+            tailChunkIds: tailIds,
+        };
+    }
+    /**
+     * Apply a snapshot of resolutions back onto the chunks (used after running
+     * the picker to commit the new state for subsequent turns).
+     */
+    applyResolutions(resolutions) {
+        for (const c of this.chunks) {
+            const r = resolutions.get(c.id);
+            if (r !== undefined && r !== c.currentResolution) {
+                c.currentResolution = r;
+            }
+        }
+    }
+    linkChunksToL1(chunkIds, l1Id) {
+        const idSet = new Set(chunkIds);
+        for (const c of this.chunks) {
+            if (idSet.has(c.id))
+                c.l1Id = l1Id;
+        }
+    }
+    allocSummaryId(level) {
+        const n = (this.summaryCounter.get(level) ?? 0);
+        this.summaryCounter.set(level, n + 1);
+        return `L${level}-${n}`;
+    }
+    firstChunkSeq(s) {
+        const c = this.chunks.find((ch) => ch.id === s.sourceRange.first);
+        return c?.sequence ?? 0;
+    }
+    sumTokens(ids) {
+        let t = 0;
+        for (const c of this.chunks)
+            if (ids.has(c.id))
+                t += c.rawTokens;
+        return t;
+    }
+}
+function summaryKey(s) {
+    return `L${s.level}:${[...s.sourceIds].sort().join(',')}`;
+}
+/**
+ * Convenience: build N chunks with uniform token size, then auto-produce
+ * the full summary chain (L1, L2, …) bottom-up via the mergeThreshold rule.
+ *
+ * Returns the populated MockChronicle.
+ */
+export function buildChronicleWithChain(opts) {
+    const chronicle = new MockChronicle({
+        mergeThreshold: opts.mergeThreshold,
+        recallPairTokens: opts.recallPairTokens,
+    });
+    for (let i = 0; i < opts.chunkCount; i++) {
+        chronicle.addChunk({ id: `c-${i.toString().padStart(4, '0')}`, rawTokens: opts.tokensPerChunk });
+    }
+    if (opts.produceChain ?? true) {
+        // Produce L1s in batches of mergeThreshold (one L1 per batch).
+        const threshold = chronicle.mergeThreshold;
+        for (let i = 0; i < chronicle.chunks.length; i += threshold) {
+            const group = chronicle.chunks.slice(i, i + threshold).map((c) => c.id);
+            chronicle.produceL1(group);
+        }
+        // Bottom-up pre-produce L2, L3, …
+        chronicle.preProduceUpperLevels();
+    }
+    return chronicle;
+}
+//# sourceMappingURL=harness.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"harness.js","sourceRoot":"","sources":["../../../test/adaptive/harness.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAMH;;;;GAIG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAE9C,uEAAuE;AACvE,MAAM,CAAC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AASzC;;;GAGG;AACH,MAAM,OAAO,aAAa;IACf,MAAM,GAAkB,EAAE,CAAC;IAC3B,SAAS,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC/C,gBAAgB,GAAG,IAAI,GAAG,EAAqB,CAAC;IACjD,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,mBAAmB;IAE9D,cAAc,CAAS;IACvB,uBAAuB,CAAS;IAEzC,qDAAqD;IACrD,QAAQ,GAAG,CAAC,CAAC;IAEb,YAAY,OAA6B,EAAE;QACzC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,uBAAuB,CAAC;QACrE,IAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,gBAAgB,IAAI,0BAA0B,CAAC;IACrF,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,IAMR;QACC,MAAM,KAAK,GAAgB;YACzB,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM;YAC5B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,iBAAiB,EAAE,CAAC;YACpB,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,KAAK;YAC1C,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,KAAK;SAC7B,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,QAAmB;QAC3B,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC9C,oBAAoB;QACpB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,QAAQ,CAAC,KAAK,KAAK,CAAC,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;gBAC/D,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,KAAK,GAAiB;YAC1B,EAAE;YACF,KAAK,EAAE,CAAC;YACR,OAAO,EAAE,6BAA6B,QAAQ,CAAC,MAAM,YAAY,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YACvF,MAAM,EAAE,IAAI,CAAC,uBAAuB;YACpC,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,CAAC,GAAG,QAAQ,CAAC;YACxB,WAAW,EAAE,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE;YACxE,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAC5D,IAAI,CAAC,cAAc,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,KAAa,EAAE,gBAA6B;QACvD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;QACjF,CAAC;QACD,MAAM,SAAS,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/C,MAAM,SAAS,GAAG,IAAI,KAAK,IAAI,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,QAAQ,CAAC,KAAK,KAAK,KAAK,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,CAAC;gBACnE,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,GAAG,EAAE,CAAC,CAAC;YACvE,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,aAAa,CAAC,CAAC,KAAK,cAAc,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5F,CAAC;YACD,OAAO,CAAC,CAAC;QACX,CAAC,CAAC,CAAC;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,KAAK,GAAiB;YAC1B,EAAE;YACF,KAAK;YACL,OAAO,EAAE,UAAU,KAAK,oBAAoB,gBAAgB,CAAC,MAAM,KAAK,KAAK,GAAG,CAAC,IAAI;YACrF,MAAM,EAAE,IAAI,CAAC,uBAAuB;YACpC,WAAW,EAAE,KAAK,GAAG,CAAC;YACtB,SAAS,EAAE,CAAC,GAAG,gBAAgB,CAAC;YAChC,WAAW,EAAE;gBACX,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK;gBACnC,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI;aACnD;YACD,OAAO,EAAE,IAAI,CAAC,GAAG,EAAE;SACpB,CAAC;QACF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAC5D,KAAK,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACnC,CAAC,CAAC,QAAQ,GAAG,EAAE,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,qBAAqB;QACnB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,OAAO,OAAO,EAAE,CAAC;YACf,OAAO,GAAG,KAAK,CAAC;YAChB,kCAAkC;YAClC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;gBAAE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YAEhF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC;gBAC/C,kEAAkE;gBAClE,gEAAgE;gBAChE,iDAAiD;gBACjD,MAAM,OAAO,GAAmB,EAAE,CAAC;gBACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;oBACxC,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,QAAQ;wBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACxD,CAAC;gBACD,6DAA6D;gBAC7D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtE,OAAO,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;oBAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBACrD,IAAI,CAAC,YAAY,CACf,KAAK,GAAG,CAAC,EACT,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACvB,CAAC;oBACF,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,IAGf;QAMC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QAEnC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU;gBAAE,MAAM;YAChD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC;QACtB,CAAC;QACD,IAAI,GAAG,CAAC,CAAC;QACT,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,GAAG,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC;gBAAE,MAAM;YACpE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,IAAI,IAAI,CAAC,CAAC,SAAS,CAAC;YACpB,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU;gBAAE,MAAM;QACrC,CAAC;QAED,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YACnC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;YACnC,YAAY,EAAE,OAAO;YACrB,YAAY,EAAE,OAAO;SACtB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,WAAyC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACjD,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,cAAc,CAAC,QAAmB,EAAE,IAAe;QACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QACrC,CAAC;IACH,CAAC;IAEO,cAAc,CAAC,KAAa;QAClC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,OAAO,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;IAC1B,CAAC;IAEO,aAAa,CAAC,CAAe;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClE,OAAO,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;IAC1B,CAAC;IAEO,SAAS,CAAC,GAAyB;QACzC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC;QACjE,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED,SAAS,UAAU,CAAC,CAAe;IACjC,OAAO,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AAC5D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CAAC,IAMvC;IACC,MAAM,SAAS,GAAG,IAAI,aAAa,CAAC;QAClC,cAAc,EAAE,IAAI,CAAC,cAAc;QACnC,gBAAgB,EAAE,IAAI,CAAC,gBAAgB;KACxC,CAAC,CAAC;IACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC;IACnG,CAAC;IACD,IAAI,IAAI,CAAC,YAAY,IAAI,IAAI,EAAE,CAAC;QAC9B,+DAA+D;QAC/D,MAAM,SAAS,GAAG,SAAS,CAAC,cAAc,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YAC5D,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACxE,SAAS,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,kCAAkC;QAClC,SAAS,CAAC,qBAAqB,EAAE,CAAC;IACpC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/test/adaptive/ingestion.test.d.ts

@@ -0,0 +1,13 @@
+/**
+ * End-to-end test of ingestion-time chunking + adaptive picker.
+ *
+ * Verifies that:
+ *   - A large message is automatically chunked into shards at ingestion
+ *   - Shards are stored with shared bodyGroupId
+ *   - The picker folds shards under budget pressure
+ *   - The render path produces ONE combined entry for the whole doc, with
+ *     inline summary text replacing folded shards
+ *   - Byte-faithful reassembly when no folding has happened
+ */
+export {};
+//# sourceMappingURL=ingestion.test.d.ts.map

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

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