@animalabs/context-manager 0.5.2 → 0.5.4

package/dist/src/adaptive/render-offsets.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Rendered-unit / offset accounting for the adaptive compiled context.
+ *
+ * `render.ts` reconstructs content byte-faithfully but exposes no token
+ * positions. The V2 best-fit KV term needs them: KV cost is governed by the
+ * EARLIEST position at which a new frontier diverges from the previous one —
+ * the provider caches the longest byte-identical prefix, so every token after
+ * the first divergence is recomputed (`docs/best-fit-frontier-resolution.md`
+ * §4, §4.1).
+ *
+ * `renderLayout` produces the ordered sequence of rendered units (head,
+ * per-chunk raw/recall in source order, tail) with cumulative token offsets,
+ * matching `MutableFoldingState.computeTokens` exactly:
+ *  - head/tail are fixed blocks;
+ *  - pinned chunks render raw (L0) regardless of resolution;
+ *  - a folded chunk emits its L_k ancestor's recall pair, once per distinct
+ *    ancestor (siblings share one recall pair);
+ *  - a resolution whose ancestor summary is missing falls back to raw.
+ *
+ * Pure and deterministic.
+ */
+import type { ChunkId } from './folding-strategy.js';
+import type { PickerInputs } from './picker.js';
+import type { SummaryTree } from './summary-tree.js';
+/** Resolution map: chunkId → display level (0 = raw). */
+export type Frontier = ReadonlyMap<ChunkId, number>;
+export interface RenderedUnit {
+    kind: 'head' | 'raw' | 'recall' | 'tail';
+    /**
+     * Stable identity for prefix comparison. Two units are byte-identical iff
+     * they share (kind, key): 'head'/'tail' for the fixed blocks, the chunk id
+     * for a raw shard, the summary id for a recall pair.
+     */
+    key: string;
+    tokens: number;
+    /** Cumulative tokens BEFORE this unit (its start offset in the prefix). */
+    offset: number;
+}
+export interface RenderLayout {
+    units: RenderedUnit[];
+    totalTokens: number;
+}
+/**
+ * Build the ordered rendered-unit layout for a frontier. `totalTokens` equals
+ * `MutableFoldingState.computeTokens` for the same resolutions.
+ */
+export declare function renderLayout(inputs: PickerInputs, tree: SummaryTree, frontier: Frontier): RenderLayout;
+/**
+ * Earliest index at which two unit sequences differ (by kind+key).
+ * Returns -1 when the sequences are identical; otherwise the first differing
+ * index (which may be `min(len)` when one is a strict prefix of the other).
+ */
+export declare function earliestDivergenceIndex(a: RenderedUnit[], b: RenderedUnit[]): number;
+/**
+ * KV cost of moving from `prev` to `next`: the number of tokens in `next` that
+ * must be recomputed — everything from the earliest divergence onward. 0 when
+ * `next`'s units are an exact prefix of (or identical to) `prev`'s, since the
+ * whole of `next` is then a cached prefix.
+ */
+export declare function kvCost(prev: RenderLayout, next: RenderLayout): number;
+//# sourceMappingURL=render-offsets.d.ts.map

package/dist/src/adaptive/render-offsets.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-offsets.d.ts","sourceRoot":"","sources":["../../../src/adaptive/render-offsets.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAa,MAAM,uBAAuB,CAAC;AAChE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErD,yDAAyD;AACzD,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AAEpD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,GAAG,KAAK,GAAG,QAAQ,GAAG,MAAM,CAAC;IACzC;;;;OAIG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,EAAE,MAAM,CAAC;IACf,2EAA2E;IAC3E,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,MAAM,EAAE,YAAY,EACpB,IAAI,EAAE,WAAW,EACjB,QAAQ,EAAE,QAAQ,GACjB,YAAY,CAkCd;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,CAAC,EAAE,YAAY,EAAE,GAAG,MAAM,CAMpF;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CAAC,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CAKrE"}

package/dist/src/adaptive/render-offsets.js

@@ -0,0 +1,88 @@
+/**
+ * Rendered-unit / offset accounting for the adaptive compiled context.
+ *
+ * `render.ts` reconstructs content byte-faithfully but exposes no token
+ * positions. The V2 best-fit KV term needs them: KV cost is governed by the
+ * EARLIEST position at which a new frontier diverges from the previous one —
+ * the provider caches the longest byte-identical prefix, so every token after
+ * the first divergence is recomputed (`docs/best-fit-frontier-resolution.md`
+ * §4, §4.1).
+ *
+ * `renderLayout` produces the ordered sequence of rendered units (head,
+ * per-chunk raw/recall in source order, tail) with cumulative token offsets,
+ * matching `MutableFoldingState.computeTokens` exactly:
+ *  - head/tail are fixed blocks;
+ *  - pinned chunks render raw (L0) regardless of resolution;
+ *  - a folded chunk emits its L_k ancestor's recall pair, once per distinct
+ *    ancestor (siblings share one recall pair);
+ *  - a resolution whose ancestor summary is missing falls back to raw.
+ *
+ * Pure and deterministic.
+ */
+/**
+ * Build the ordered rendered-unit layout for a frontier. `totalTokens` equals
+ * `MutableFoldingState.computeTokens` for the same resolutions.
+ */
+export function renderLayout(inputs, tree, frontier) {
+    const units = [];
+    let offset = 0;
+    const push = (kind, key, tokens) => {
+        units.push({ kind, key, tokens, offset });
+        offset += tokens;
+    };
+    if (inputs.headTokens > 0)
+        push('head', 'head', inputs.headTokens);
+    const ordered = [...inputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    const renderedSummaries = new Set();
+    for (const c of ordered) {
+        if (inputs.headChunkIds.has(c.id) || inputs.tailChunkIds.has(c.id))
+            continue;
+        const effective = c.pinned ? 0 : frontier.get(c.id) ?? 0;
+        if (effective === 0) {
+            push('raw', c.id, c.rawTokens);
+            continue;
+        }
+        const ancestor = tree.ancestorAt(c.id, effective);
+        if (!ancestor) {
+            // Resolution set but summary missing — render raw (renderer makes the
+            // same call). Matches computeTokens' fallback.
+            push('raw', c.id, c.rawTokens);
+            continue;
+        }
+        if (renderedSummaries.has(ancestor.id))
+            continue; // sibling shares the pair
+        renderedSummaries.add(ancestor.id);
+        push('recall', ancestor.id, ancestor.recallTokens);
+    }
+    if (inputs.tailTokens > 0)
+        push('tail', 'tail', inputs.tailTokens);
+    return { units, totalTokens: offset };
+}
+/**
+ * Earliest index at which two unit sequences differ (by kind+key).
+ * Returns -1 when the sequences are identical; otherwise the first differing
+ * index (which may be `min(len)` when one is a strict prefix of the other).
+ */
+export function earliestDivergenceIndex(a, b) {
+    const n = Math.min(a.length, b.length);
+    for (let i = 0; i < n; i++) {
+        if (a[i].kind !== b[i].kind || a[i].key !== b[i].key)
+            return i;
+    }
+    return a.length === b.length ? -1 : n;
+}
+/**
+ * KV cost of moving from `prev` to `next`: the number of tokens in `next` that
+ * must be recomputed — everything from the earliest divergence onward. 0 when
+ * `next`'s units are an exact prefix of (or identical to) `prev`'s, since the
+ * whole of `next` is then a cached prefix.
+ */
+export function kvCost(prev, next) {
+    const d = earliestDivergenceIndex(prev.units, next.units);
+    if (d === -1)
+        return 0; // identical
+    if (d >= next.units.length)
+        return 0; // next is a prefix of prev → fully cached
+    return next.totalTokens - next.units[d].offset;
+}
+//# sourceMappingURL=render-offsets.js.map

package/dist/src/adaptive/render-offsets.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"render-offsets.js","sourceRoot":"","sources":["../../../src/adaptive/render-offsets.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AA2BH;;;GAGG;AACH,MAAM,UAAU,YAAY,CAC1B,MAAoB,EACpB,IAAiB,EACjB,QAAkB;IAElB,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,IAAI,GAAG,CAAC,IAA0B,EAAE,GAAW,EAAE,MAAc,EAAQ,EAAE;QAC7E,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAC1C,MAAM,IAAI,MAAM,CAAC;IACnB,CAAC,CAAC;IAEF,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC;QAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAEnE,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3E,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAa,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7E,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,sEAAsE;YACtE,+CAA+C;YAC/C,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;YAC/B,SAAS;QACX,CAAC;QACD,IAAI,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAAE,SAAS,CAAC,0BAA0B;QAC5E,iBAAiB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC;QAAE,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAEnE,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,CAAC;AACxC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,CAAiB,EAAE,CAAiB;IAC1E,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;YAAE,OAAO,CAAC,CAAC;IACjE,CAAC;IACD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAC,IAAkB,EAAE,IAAkB;IAC3D,MAAM,CAAC,GAAG,uBAAuB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,IAAI,CAAC,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,YAAY;IACpC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC,0CAA0C;IAChF,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACjD,CAAC"}

package/dist/src/adaptive/strategies/kv-stable.d.ts

@@ -0,0 +1,48 @@
+/**
+ * KvStableStrategy — the KV-stable context controller plugged into the existing
+ * picker (see `docs/kv-stable-context-control.md`).
+ *
+ * Same "solve-once-then-walk" bridge as `BestFitStrategy`: on the first
+ * `selectNextFold` it computes a target frontier with `planControlledFrontier`
+ * (the *same* policy the replay harness measures), memoizes it, then emits one
+ * `raise`/`lower` op per call to walk the live state toward it, returning `null`
+ * once reached. The picker already applies raise/lower — no picker change.
+ *
+ * Unlike `BestFitStrategy` (which maximizes value − λ·KVcost over a half-life
+ * recency model), this minimizes real prefix churn directly: it holds the flat
+ * zone (head/tail/pinned) raw, never folds locked chunks, and sheds the foldable
+ * middle oldest-first/leveled under a per-turn divergence **reach cap** (the
+ * perturbation cap P), bounded by per-chunk log-age saliency caps, yielding the
+ * reach cap only as far as needed to stay under the hard wall (`totalBudget`).
+ * No λ, no recency half-life.
+ *
+ * Like `BestFitStrategy`, it does not emit `produce` ops — deeper folding than
+ * has been produced is the speculative pre-producer's job; the controller only
+ * targets levels whose summaries already exist. Deterministic.
+ */
+import type { FoldingStrategy, FoldingState, FoldingBudget, FoldOp, ChunkId } from '../folding-strategy.js';
+import type { PickerInputs } from '../picker.js';
+export interface KvStableOptions {
+    /** Per-turn divergence reach — the structural perturbation cap P, in tokens.
+     *  Smaller = gentler per-turn KV churn (shallow divergence) but less efficient
+     *  compression. Exceeded only to stay under the hard wall. Default: the hard
+     *  budget (effectively unbounded within the window). */
+    reachTokens?: number;
+    /** Base-k summary grouping (matches the strategy's mergeThreshold). Default 6. */
+    mergeThreshold?: number;
+}
+export declare class KvStableStrategy implements FoldingStrategy {
+    readonly name = "kv-stable";
+    private readonly inputs;
+    private readonly opts;
+    private readonly fPrev;
+    private target;
+    constructor(inputs: PickerInputs, opts?: KvStableOptions);
+    selectNextFold(state: FoldingState, budget: FoldingBudget): FoldOp | null;
+    /** Target frontier this run is walking toward (null before the first call). */
+    targetFrontier(): ReadonlyMap<ChunkId, number> | null;
+    private solve;
+    /** Emit one op moving the live state toward the target frontier. */
+    private nextOp;
+}
+//# sourceMappingURL=kv-stable.d.ts.map

package/dist/src/adaptive/strategies/kv-stable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-stable.d.ts","sourceRoot":"","sources":["../../../../src/adaptive/strategies/kv-stable.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,EACV,eAAe,EACf,YAAY,EACZ,aAAa,EACb,MAAM,EACN,OAAO,EACR,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAIjD,MAAM,WAAW,eAAe;IAC9B;;;4DAGwD;IACxD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,kFAAkF;IAClF,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,qBAAa,gBAAiB,YAAW,eAAe;IACtD,QAAQ,CAAC,IAAI,eAAe;IAE5B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAkB;IACvC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAuB;IAC7C,OAAO,CAAC,MAAM,CAAqC;gBAEvC,MAAM,EAAE,YAAY,EAAE,IAAI,GAAE,eAAoB;IAM5D,cAAc,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,GAAG,MAAM,GAAG,IAAI;IAKzE,+EAA+E;IAC/E,cAAc,IAAI,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,IAAI;IAIrD,OAAO,CAAC,KAAK;IAkCb,oEAAoE;IACpE,OAAO,CAAC,MAAM;CAmBf"}

package/dist/src/adaptive/strategies/kv-stable.js

@@ -0,0 +1,102 @@
+/**
+ * KvStableStrategy — the KV-stable context controller plugged into the existing
+ * picker (see `docs/kv-stable-context-control.md`).
+ *
+ * Same "solve-once-then-walk" bridge as `BestFitStrategy`: on the first
+ * `selectNextFold` it computes a target frontier with `planControlledFrontier`
+ * (the *same* policy the replay harness measures), memoizes it, then emits one
+ * `raise`/`lower` op per call to walk the live state toward it, returning `null`
+ * once reached. The picker already applies raise/lower — no picker change.
+ *
+ * Unlike `BestFitStrategy` (which maximizes value − λ·KVcost over a half-life
+ * recency model), this minimizes real prefix churn directly: it holds the flat
+ * zone (head/tail/pinned) raw, never folds locked chunks, and sheds the foldable
+ * middle oldest-first/leveled under a per-turn divergence **reach cap** (the
+ * perturbation cap P), bounded by per-chunk log-age saliency caps, yielding the
+ * reach cap only as far as needed to stay under the hard wall (`totalBudget`).
+ * No λ, no recency half-life.
+ *
+ * Like `BestFitStrategy`, it does not emit `produce` ops — deeper folding than
+ * has been produced is the speculative pre-producer's job; the controller only
+ * targets levels whose summaries already exist. Deterministic.
+ */
+import { SummaryTree } from '../summary-tree.js';
+import { planControlledFrontier } from '../kv-control.js';
+export class KvStableStrategy {
+    name = 'kv-stable';
+    inputs;
+    opts;
+    fPrev;
+    target = null;
+    constructor(inputs, opts = {}) {
+        this.inputs = inputs;
+        this.opts = opts;
+        this.fPrev = new Map(inputs.chunks.map((c) => [c.id, c.currentResolution]));
+    }
+    selectNextFold(state, budget) {
+        if (!this.target)
+            this.target = this.solve(budget);
+        return this.nextOp(state);
+    }
+    /** Target frontier this run is walking toward (null before the first call). */
+    targetFrontier() {
+        return this.target;
+    }
+    solve(budget) {
+        const tree = new SummaryTree(this.inputs);
+        // Flat zone (forced raw, never folded): head, tail, pinned. Frozen (kept at
+        // their carried resolution, never folded): locked.
+        const rawZone = new Set();
+        const frozen = new Set();
+        let now = 0;
+        for (const c of this.inputs.chunks) {
+            if (c.sequence > now)
+                now = c.sequence;
+            if (this.inputs.headChunkIds.has(c.id) || this.inputs.tailChunkIds.has(c.id) || c.pinned) {
+                rawZone.add(c.id);
+            }
+            else if (c.lockedByAgent) {
+                frozen.add(c.id);
+            }
+        }
+        return planControlledFrontier(this.inputs, tree, {
+            previous: this.fPrev,
+            // Bidirectional within the slack band: fold when over the hard budget,
+            // un-fold to use headroom when under the soft target. Both reach-bounded;
+            // [targetBudget, totalBudget] is the quiet dead band.
+            foldAtTokens: budget.totalBudget,
+            expandAtTokens: budget.targetBudget,
+            targetTokens: budget.targetBudget,
+            windowTokens: budget.totalBudget,
+            reachTokens: this.opts.reachTokens,
+            rawZone,
+            frozen,
+            now,
+            mergeThreshold: this.opts.mergeThreshold,
+        }).resolutions;
+    }
+    /** Emit one op moving the live state toward the target frontier. */
+    nextOp(state) {
+        const target = this.target;
+        for (const c of state.chunks()) {
+            if (c.inHead || c.inTail || c.pinned || c.lockedByAgent)
+                continue;
+            const cur = c.currentResolution;
+            const tgt = target.get(c.id) ?? 0;
+            if (cur === tgt)
+                continue;
+            if (cur < tgt) {
+                const summary = c.ancestorAt(tgt);
+                if (!summary)
+                    continue; // unrealizable target (summary not produced) — skip
+                return { kind: 'raise', groupRoot: summary.id };
+            }
+            const summary = c.ancestorAt(cur);
+            if (!summary)
+                continue;
+            return { kind: 'lower', groupRoot: summary.id };
+        }
+        return null;
+    }
+}
+//# sourceMappingURL=kv-stable.js.map

package/dist/src/adaptive/strategies/kv-stable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-stable.js","sourceRoot":"","sources":["../../../../src/adaptive/strategies/kv-stable.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAUH,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,sBAAsB,EAAE,MAAM,kBAAkB,CAAC;AAY1D,MAAM,OAAO,gBAAgB;IAClB,IAAI,GAAG,WAAW,CAAC;IAEX,MAAM,CAAe;IACrB,IAAI,CAAkB;IACtB,KAAK,CAAuB;IACrC,MAAM,GAAgC,IAAI,CAAC;IAEnD,YAAY,MAAoB,EAAE,OAAwB,EAAE;QAC1D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,cAAc,CAAC,KAAmB,EAAE,MAAqB;QACvD,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,+EAA+E;IAC/E,cAAc;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAEO,KAAK,CAAC,MAAqB;QACjC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAE1C,4EAA4E;QAC5E,mDAAmD;QACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAW,CAAC;QAClC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,QAAQ,GAAG,GAAG;gBAAE,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,CAAC;gBACzF,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE;YAC/C,QAAQ,EAAE,IAAI,CAAC,KAAK;YACpB,uEAAuE;YACvE,0EAA0E;YAC1E,sDAAsD;YACtD,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,cAAc,EAAE,MAAM,CAAC,YAAY;YACnC,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,YAAY,EAAE,MAAM,CAAC,WAAW;YAChC,WAAW,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW;YAClC,OAAO;YACP,MAAM;YACN,GAAG;YACH,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc;SACzC,CAAC,CAAC,WAAW,CAAC;IACjB,CAAC;IAED,oEAAoE;IAC5D,MAAM,CAAC,KAAmB;QAChC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAO,CAAC;QAC5B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/B,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,aAAa;gBAAE,SAAS;YAClE,MAAM,GAAG,GAAG,CAAC,CAAC,iBAAiB,CAAC;YAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,GAAG,KAAK,GAAG;gBAAE,SAAS;YAE1B,IAAI,GAAG,GAAG,GAAG,EAAE,CAAC;gBACd,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,CAAC,OAAO;oBAAE,SAAS,CAAC,oDAAoD;gBAC5E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC;YAClD,CAAC;YACD,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;YAClC,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC;QAClD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/src/adaptive/summary-tree.d.ts

@@ -0,0 +1,98 @@
+/**
+ * SummaryTree — a typed, structural view over the adaptive summary forest.
+ *
+ * Built from PickerInputs (chunks + summaries + per-summary recall-pair token
+ * counts). Provides the navigation a frontier solver needs — ancestor chains,
+ * recall-pair token costs, leaf coverage, root/children traversal — with NO
+ * rendering or resolution state. Pure and deterministic.
+ *
+ * Structure mirrors the model the picker already uses:
+ *  - `chunk.l1Id` + the `SummaryEntry.parentId` chain define the upward path.
+ *  - `SummaryEntry.sourceLevel === 0` means `sourceIds` are leaf (message) ids;
+ *    otherwise they are child summary ids.
+ *  - A folded node's token cost is its recall-pair size
+ *    (`recallPairTokens` ?? `SummaryEntry.tokens`) — matching
+ *    `MutableFoldingState.computeTokens`.
+ *
+ * This is the substrate for the V2 best-fit tree-knapsack DP. See
+ * `docs/best-fit-frontier-resolution.md` §3, §6, §11.
+ */
+import type { ChunkId, SummaryId } from './folding-strategy.js';
+import type { PickerInputs } from './picker.js';
+/** A raw chunk (resolution 0) — a leaf of the summary forest. */
+export interface LeafNode {
+    kind: 'leaf';
+    chunkId: ChunkId;
+    /** Position in source order (lower = older). */
+    sequence: number;
+    rawTokens: number;
+    /** L1 summary covering this leaf, if any. */
+    l1Id?: SummaryId;
+}
+/** An L_k summary node covering a contiguous range of leaves. */
+export interface SummaryNode {
+    kind: 'summary';
+    id: SummaryId;
+    level: number;
+    /** Rendered tokens of this node's recall pair (the cost of folding to it). */
+    recallTokens: number;
+    /** Immediate children: leaf chunk ids (when childrenAreLeaves) or summary ids. */
+    childIds: string[];
+    /** True when childIds are leaf chunk ids (sourceLevel === 0). */
+    childrenAreLeaves: boolean;
+    /** All covered leaf chunk ids, recursively, in source order. */
+    leafChunkIds: ChunkId[];
+    /** Min/max source sequence of covered leaves (−1 if none resolve). */
+    firstSequence: number;
+    lastSequence: number;
+    sourceRange: {
+        first: string;
+        last: string;
+    };
+    /** Parent summary id, if a higher level has been produced. */
+    parentId?: SummaryId;
+}
+export type TreeNode = LeafNode | SummaryNode;
+/** Token cost of rendering a node collapsed: raw for a leaf, recall for a summary. */
+export declare function nodeTokens(node: TreeNode): number;
+export declare class SummaryTree {
+    private readonly leaves;
+    private readonly nodes;
+    private readonly summaries;
+    private readonly recallPairTokens;
+    private readonly leafSeq;
+    private rootCache;
+    constructor(inputs: PickerInputs);
+    /** All leaf nodes in source order (oldest first). */
+    orderedLeaves(): LeafNode[];
+    /** All summary nodes (unordered). */
+    allSummaries(): SummaryNode[];
+    leaf(chunkId: ChunkId): LeafNode | null;
+    summary(id: SummaryId): SummaryNode | null;
+    /** Recall-pair tokens for a summary, or null if unknown. */
+    recallTokens(id: SummaryId): number | null;
+    /** Immediate children of a summary node (leaves or sub-summaries). */
+    children(node: SummaryNode): TreeNode[];
+    /** All leaf chunk ids under a summary, in source order. */
+    leavesUnder(id: SummaryId): ChunkId[];
+    /**
+     * The L_level ancestor summary of a chunk, or null if not present. Matches
+     * `MutableFoldingState.ancestorAt` (walks the parentId chain from l1Id).
+     */
+    ancestorAt(chunkId: ChunkId, level: number): SummaryNode | null;
+    /** Highest level k for which a summary covering this chunk exists (0 = none). */
+    maxLevel(chunkId: ChunkId): number;
+    /**
+     * Forest roots over all chunks: top-level summaries (no parent present in the
+     * map) plus any leaf not covered by an L1. Each leaf belongs to exactly one
+     * root's subtree. Deterministically ordered by source sequence.
+     */
+    roots(): TreeNode[];
+    private buildNode;
+    /** Walk down to leaf chunk ids; sourceLevel 0 => sourceIds are leaves.
+     *  Deduplicates leaves and guards against revisiting a summary, so a chunk
+     *  reachable via multiple branches is counted once (real chronicles can have
+     *  such overlap; double-counting breaks range/contiguity and value math). */
+    private collectLeafIds;
+}
+//# sourceMappingURL=summary-tree.d.ts.map

package/dist/src/adaptive/summary-tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"summary-tree.d.ts","sourceRoot":"","sources":["../../../src/adaptive/summary-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAIhD,iEAAiE;AACjE,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,OAAO,CAAC;IACjB,gDAAgD;IAChD,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,6CAA6C;IAC7C,IAAI,CAAC,EAAE,SAAS,CAAC;CAClB;AAED,iEAAiE;AACjE,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,SAAS,CAAC;IAChB,EAAE,EAAE,SAAS,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,YAAY,EAAE,MAAM,CAAC;IACrB,kFAAkF;IAClF,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,iEAAiE;IACjE,iBAAiB,EAAE,OAAO,CAAC;IAC3B,gEAAgE;IAChE,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB,sEAAsE;IACtE,aAAa,EAAE,MAAM,CAAC;IACtB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAC7C,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,SAAS,CAAC;CACtB;AAED,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,WAAW,CAAC;AAE9C,sFAAsF;AACtF,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAED,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAgC;IACvD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAqC;IAC3D,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAuC;IACjE,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAiC;IAClE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAA8B;IACtD,OAAO,CAAC,SAAS,CAA2B;gBAEhC,MAAM,EAAE,YAAY;IAqBhC,qDAAqD;IACrD,aAAa,IAAI,QAAQ,EAAE;IAI3B,qCAAqC;IACrC,YAAY,IAAI,WAAW,EAAE;IAI7B,IAAI,CAAC,OAAO,EAAE,OAAO,GAAG,QAAQ,GAAG,IAAI;IAIvC,OAAO,CAAC,EAAE,EAAE,SAAS,GAAG,WAAW,GAAG,IAAI;IAI1C,4DAA4D;IAC5D,YAAY,CAAC,EAAE,EAAE,SAAS,GAAG,MAAM,GAAG,IAAI;IAI1C,sEAAsE;IACtE,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,QAAQ,EAAE;IAgBvC,2DAA2D;IAC3D,WAAW,CAAC,EAAE,EAAE,SAAS,GAAG,OAAO,EAAE;IAIrC;;;OAGG;IACH,UAAU,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI;IAY/D,iFAAiF;IACjF,QAAQ,CAAC,OAAO,EAAE,OAAO,GAAG,MAAM;IAalC;;;;OAIG;IACH,KAAK,IAAI,QAAQ,EAAE;IAoBnB,OAAO,CAAC,SAAS;IAyBjB;;;iFAG6E;IAC7E,OAAO,CAAC,cAAc;CAyBvB"}

package/dist/src/adaptive/summary-tree.js

@@ -0,0 +1,214 @@
+/**
+ * SummaryTree — a typed, structural view over the adaptive summary forest.
+ *
+ * Built from PickerInputs (chunks + summaries + per-summary recall-pair token
+ * counts). Provides the navigation a frontier solver needs — ancestor chains,
+ * recall-pair token costs, leaf coverage, root/children traversal — with NO
+ * rendering or resolution state. Pure and deterministic.
+ *
+ * Structure mirrors the model the picker already uses:
+ *  - `chunk.l1Id` + the `SummaryEntry.parentId` chain define the upward path.
+ *  - `SummaryEntry.sourceLevel === 0` means `sourceIds` are leaf (message) ids;
+ *    otherwise they are child summary ids.
+ *  - A folded node's token cost is its recall-pair size
+ *    (`recallPairTokens` ?? `SummaryEntry.tokens`) — matching
+ *    `MutableFoldingState.computeTokens`.
+ *
+ * This is the substrate for the V2 best-fit tree-knapsack DP. See
+ * `docs/best-fit-frontier-resolution.md` §3, §6, §11.
+ */
+import { getSummaryParentId } from '../types/strategy.js';
+/** Token cost of rendering a node collapsed: raw for a leaf, recall for a summary. */
+export function nodeTokens(node) {
+    return node.kind === 'leaf' ? node.rawTokens : node.recallTokens;
+}
+export class SummaryTree {
+    leaves = new Map();
+    nodes = new Map();
+    summaries;
+    recallPairTokens;
+    leafSeq = new Map();
+    rootCache = null;
+    constructor(inputs) {
+        this.summaries = inputs.summaries;
+        this.recallPairTokens = inputs.recallPairTokens ?? new Map();
+        for (const c of inputs.chunks) {
+            this.leafSeq.set(c.id, c.sequence);
+            this.leaves.set(c.id, {
+                kind: 'leaf',
+                chunkId: c.id,
+                sequence: c.sequence,
+                rawTokens: c.rawTokens,
+                l1Id: c.l1Id,
+            });
+        }
+        for (const [, s] of this.summaries) {
+            this.nodes.set(s.id, this.buildNode(s));
+        }
+    }
+    // ---- node access ----
+    /** All leaf nodes in source order (oldest first). */
+    orderedLeaves() {
+        return [...this.leaves.values()].sort((a, b) => a.sequence - b.sequence);
+    }
+    /** All summary nodes (unordered). */
+    allSummaries() {
+        return [...this.nodes.values()];
+    }
+    leaf(chunkId) {
+        return this.leaves.get(chunkId) ?? null;
+    }
+    summary(id) {
+        return this.nodes.get(id) ?? null;
+    }
+    /** Recall-pair tokens for a summary, or null if unknown. */
+    recallTokens(id) {
+        return this.nodes.get(id)?.recallTokens ?? null;
+    }
+    /** Immediate children of a summary node (leaves or sub-summaries). */
+    children(node) {
+        const out = [];
+        if (node.childrenAreLeaves) {
+            for (const cid of node.childIds) {
+                const leaf = this.leaves.get(cid);
+                if (leaf)
+                    out.push(leaf);
+            }
+        }
+        else {
+            for (const sid of node.childIds) {
+                const sub = this.nodes.get(sid);
+                if (sub)
+                    out.push(sub);
+            }
+        }
+        return out;
+    }
+    /** All leaf chunk ids under a summary, in source order. */
+    leavesUnder(id) {
+        return this.nodes.get(id)?.leafChunkIds ?? [];
+    }
+    /**
+     * The L_level ancestor summary of a chunk, or null if not present. Matches
+     * `MutableFoldingState.ancestorAt` (walks the parentId chain from l1Id).
+     */
+    ancestorAt(chunkId, level) {
+        if (level <= 0)
+            return null;
+        const leaf = this.leaves.get(chunkId);
+        if (!leaf || !leaf.l1Id)
+            return null;
+        let cur = this.nodes.get(leaf.l1Id);
+        while (cur && cur.level < level) {
+            if (!cur.parentId)
+                return null;
+            cur = this.nodes.get(cur.parentId);
+        }
+        return cur && cur.level === level ? cur : null;
+    }
+    /** Highest level k for which a summary covering this chunk exists (0 = none). */
+    maxLevel(chunkId) {
+        const leaf = this.leaves.get(chunkId);
+        if (!leaf || !leaf.l1Id)
+            return 0;
+        let cur = this.nodes.get(leaf.l1Id);
+        let max = 0;
+        while (cur) {
+            max = cur.level;
+            if (!cur.parentId)
+                break;
+            cur = this.nodes.get(cur.parentId);
+        }
+        return max;
+    }
+    /**
+     * Forest roots over all chunks: top-level summaries (no parent present in the
+     * map) plus any leaf not covered by an L1. Each leaf belongs to exactly one
+     * root's subtree. Deterministically ordered by source sequence.
+     */
+    roots() {
+        if (this.rootCache)
+            return this.rootCache;
+        const out = [];
+        const covered = new Set();
+        for (const node of this.nodes.values()) {
+            const parent = node.parentId ? this.nodes.get(node.parentId) : undefined;
+            if (parent)
+                continue; // has a real parent → not a root
+            out.push(node);
+            for (const lid of node.leafChunkIds)
+                covered.add(lid);
+        }
+        for (const leaf of this.leaves.values()) {
+            if (!covered.has(leaf.chunkId))
+                out.push(leaf);
+        }
+        out.sort((a, b) => sequenceOf(a) - sequenceOf(b));
+        this.rootCache = out;
+        return out;
+    }
+    // ---- internals ----
+    buildNode(s) {
+        const leafChunkIds = this.collectLeafIds(s);
+        let firstSequence = Infinity;
+        let lastSequence = -Infinity;
+        for (const id of leafChunkIds) {
+            const seq = this.leafSeq.get(id);
+            if (seq === undefined)
+                continue;
+            if (seq < firstSequence)
+                firstSequence = seq;
+            if (seq > lastSequence)
+                lastSequence = seq;
+        }
+        return {
+            kind: 'summary',
+            id: s.id,
+            level: s.level,
+            recallTokens: this.recallPairTokens.get(s.id) ?? s.tokens,
+            childIds: [...s.sourceIds],
+            childrenAreLeaves: s.sourceLevel === 0,
+            leafChunkIds,
+            firstSequence: firstSequence === Infinity ? -1 : firstSequence,
+            lastSequence: lastSequence === -Infinity ? -1 : lastSequence,
+            sourceRange: s.sourceRange,
+            parentId: getSummaryParentId(s),
+        };
+    }
+    /** Walk down to leaf chunk ids; sourceLevel 0 => sourceIds are leaves.
+     *  Deduplicates leaves and guards against revisiting a summary, so a chunk
+     *  reachable via multiple branches is counted once (real chronicles can have
+     *  such overlap; double-counting breaks range/contiguity and value math). */
+    collectLeafIds(summary) {
+        const out = [];
+        const seenLeaves = new Set();
+        const seenSummaries = new Set();
+        const visit = (s) => {
+            if (seenSummaries.has(s.id))
+                return;
+            seenSummaries.add(s.id);
+            if (s.sourceLevel === 0) {
+                for (const mid of s.sourceIds) {
+                    if (!seenLeaves.has(mid)) {
+                        seenLeaves.add(mid);
+                        out.push(mid);
+                    }
+                }
+            }
+            else {
+                for (const sid of s.sourceIds) {
+                    const child = this.summaries.get(sid);
+                    if (child)
+                        visit(child);
+                }
+            }
+        };
+        visit(summary);
+        out.sort((a, b) => (this.leafSeq.get(a) ?? 0) - (this.leafSeq.get(b) ?? 0));
+        return out;
+    }
+}
+function sequenceOf(n) {
+    return n.kind === 'leaf' ? n.sequence : n.firstSequence;
+}
+//# sourceMappingURL=summary-tree.js.map

package/dist/src/adaptive/summary-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"summary-tree.js","sourceRoot":"","sources":["../../../src/adaptive/summary-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAKH,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAoC1D,sFAAsF;AACtF,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;AACnE,CAAC;AAED,MAAM,OAAO,WAAW;IACL,MAAM,GAAG,IAAI,GAAG,EAAqB,CAAC;IACtC,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC1C,SAAS,CAAuC;IAChD,gBAAgB,CAAiC;IACjD,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC9C,SAAS,GAAsB,IAAI,CAAC;IAE5C,YAAY,MAAoB;QAC9B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,gBAAgB,GAAG,MAAM,CAAC,gBAAgB,IAAI,IAAI,GAAG,EAAE,CAAC;QAE7D,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;YACnC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACpB,IAAI,EAAE,MAAM;gBACZ,OAAO,EAAE,CAAC,CAAC,EAAE;gBACb,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,IAAI,EAAE,CAAC,CAAC,IAAI;aACb,CAAC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,wBAAwB;IAExB,qDAAqD;IACrD,aAAa;QACX,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC3E,CAAC;IAED,qCAAqC;IACrC,YAAY;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,CAAC,OAAgB;QACnB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IAC1C,CAAC;IAED,OAAO,CAAC,EAAa;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC;IACpC,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,EAAa;QACxB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,YAAY,IAAI,IAAI,CAAC;IAClD,CAAC;IAED,sEAAsE;IACtE,QAAQ,CAAC,IAAiB;QACxB,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,IAAI;oBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAChC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChC,IAAI,GAAG;oBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,2DAA2D;IAC3D,WAAW,CAAC,EAAa;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,YAAY,IAAI,EAAE,CAAC;IAChD,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,OAAgB,EAAE,KAAa;QACxC,IAAI,KAAK,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACrC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAC;YAC/B,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,CAAC;IAED,iFAAiF;IACjF,QAAQ,CAAC,OAAgB;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,GAAG,EAAE,CAAC;YACX,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC;YAChB,IAAI,CAAC,GAAG,CAAC,QAAQ;gBAAE,MAAM;YACzB,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC,SAAS,CAAC;QAC1C,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACzE,IAAI,MAAM;gBAAE,SAAS,CAAC,iCAAiC;YACvD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,YAAY;gBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;QACrB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,sBAAsB;IAEd,SAAS,CAAC,CAAe;QAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,aAAa,GAAG,QAAQ,CAAC;QAC7B,IAAI,YAAY,GAAG,CAAC,QAAQ,CAAC;QAC7B,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,IAAI,GAAG,GAAG,aAAa;gBAAE,aAAa,GAAG,GAAG,CAAC;YAC7C,IAAI,GAAG,GAAG,YAAY;gBAAE,YAAY,GAAG,GAAG,CAAC;QAC7C,CAAC;QACD,OAAO;YACL,IAAI,EAAE,SAAS;YACf,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,YAAY,EAAE,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM;YACzD,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC;YAC1B,iBAAiB,EAAE,CAAC,CAAC,WAAW,KAAK,CAAC;YACtC,YAAY;YACZ,aAAa,EAAE,aAAa,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;YAC9D,YAAY,EAAE,YAAY,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY;YAC5D,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC;SAChC,CAAC;IACJ,CAAC;IAED;;;iFAG6E;IACrE,cAAc,CAAC,OAAqB;QAC1C,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAW,CAAC;QACtC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAa,CAAC;QAC3C,MAAM,KAAK,GAAG,CAAC,CAAe,EAAQ,EAAE;YACtC,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,OAAO;YACpC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACxB,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;gBACxB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;wBACzB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACpB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACtC,IAAI,KAAK;wBAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QACF,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5E,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED,SAAS,UAAU,CAAC,CAAW;IAC7B,OAAO,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;AAC1D,CAAC"}