@animalabs/context-manager 0.5.2 → 0.5.4

package/dist/src/adaptive/kv-control.js

@@ -0,0 +1,368 @@
+/**
+ * KV-stable context controller (see `docs/kv-stable-context-control.md`).
+ *
+ * A receding-horizon policy that replaces the `value − λ·KVcost` solve. One
+ * objective — minimize real billed recompute — under a constraint hierarchy with
+ * a single hard wall (the physical window W) and shaped soft constraints
+ * (flat zone, perturbation cap, pins/saliency, operating budget). State (the
+ * carried frontier + the persistent cache) makes it a controller, not a
+ * per-turn solve.
+ *
+ * This prototype uses a hysteresis band [LW, HW] as the controllable operating
+ * point on the cost↔continuity frontier:
+ *   - append every turn; if rendered tokens exceed HW, shed down to ≤ LW;
+ *     otherwise do nothing (pure append → zero perturbation, full cache hit);
+ *   - shed oldest-first, leveled (L1 groups, then L2, then L3), each chunk
+ *     capped by the saliency field (log-age + flat zone + pins) — base-k
+ *     grouping driven by budget, not a fixed clock;
+ *   - W is the only hard wall; if folding everything to its cap can't fit under
+ *     W, escalate (don't thrash).
+ *
+ * Pure and deterministic.
+ */
+import { SummaryTree } from './summary-tree.js';
+import { renderLayout } from './render-offsets.js';
+import { placeMarkers, CacheStore } from './kv-cache-sim.js';
+/** Provider price multipliers relative to base input tokens (Anthropic-ish). */
+export const PRICE = { miss: 1.0, cacheRead: 0.1, cacheWrite: 1.25 };
+/** Deepest fold level the saliency field will ever allow. */
+export const MAX_FOLD_LEVEL = 3;
+/**
+ * Per-chunk maximum fold depth from the saliency field: flat zone and pins are
+ * raw (0); otherwise log-age banded against the base-k geometry. The "finest
+ * requirement wins" — this is the cap the shedder may not exceed.
+ */
+export function foldDepthCap(chunk, now, flatZone, flatZoneChunks, mergeThreshold) {
+    if (chunk.pinned || flatZone.has(chunk.id))
+        return 0;
+    const age = Math.max(0, now - chunk.sequence);
+    const ratio = age / Math.max(1, flatZoneChunks);
+    if (ratio < 1)
+        return 0; // just outside the flat zone → still raw
+    const band = Math.floor(Math.log(ratio) / Math.log(Math.max(2, mergeThreshold))) + 1;
+    return Math.max(0, Math.min(MAX_FOLD_LEVEL, band));
+}
+/**
+ * Deepen `frontier` in place to bring rendered tokens ≤ `target`, leveled
+ * (L1 groups, then L2, then L3) and oldest-first *within the reach window*. A
+ * chunk is editable this turn only if the raw tokens newer than it are <
+ * `reachTokens` — this bounds the divergence depth (and thus the per-turn KV
+ * perturbation) to ≈ reach. Each chunk is bounded by its saliency cap;
+ * flat-zone/pinned chunks (cap 0) are never touched.
+ *
+ * `reachTokens` is the soft cap P; `windowTokens` is the hard wall W. If folding
+ * within reach can't fit under W, reach is lifted (emergency) and folding
+ * continues to caps — yielding P minimally to keep W. Returns final tokens.
+ */
+function shedToTarget(frontier, inputs, tree, ordered, caps, target, reachTokens, windowTokens) {
+    // Raw tokens strictly newer than each chunk (its distance from the live end).
+    const newerTokens = new Map();
+    let acc = 0;
+    for (let i = ordered.length - 1; i >= 0; i--) {
+        newerTokens.set(ordered[i].id, acc);
+        acc += ordered[i].rawTokens;
+    }
+    const foldWithinReach = (reach) => {
+        for (let level = 1; level <= MAX_FOLD_LEVEL; level++) {
+            for (const c of ordered) {
+                // oldest-first within reach
+                if ((newerTokens.get(c.id) ?? 0) >= reach)
+                    continue;
+                if ((frontier.get(c.id) ?? 0) >= level)
+                    continue;
+                const ancestor = tree.ancestorAt(c.id, level);
+                if (!ancestor)
+                    continue; // summary not produced yet → can't fold here
+                // Group-consistency + reach: fold the WHOLE group to `level` only if
+                // every covered leaf permits it (cap ≥ level) and is within reach. The
+                // picker raises whole groups, so a partially-eligible group would be an
+                // unreachable target (it oscillates). A uniform fold keeps the frontier
+                // group-consistent and the picker convergent.
+                let eligible = true;
+                for (const leafId of ancestor.leafChunkIds) {
+                    if ((caps.get(leafId) ?? 0) < level || (newerTokens.get(leafId) ?? 0) >= reach) {
+                        eligible = false;
+                        break;
+                    }
+                }
+                if (!eligible)
+                    continue;
+                for (const leafId of ancestor.leafChunkIds) {
+                    if ((frontier.get(leafId) ?? 0) < level)
+                        frontier.set(leafId, level);
+                }
+                if (renderLayout(inputs, tree, frontier).totalTokens <= target)
+                    return true;
+            }
+        }
+        return false;
+    };
+    foldWithinReach(reachTokens);
+    let tokens = renderLayout(inputs, tree, frontier).totalTokens;
+    // Hard wall: yield the reach cap (P) only as far as needed to keep under W.
+    if (tokens > windowTokens) {
+        foldWithinReach(Infinity);
+        tokens = renderLayout(inputs, tree, frontier).totalTokens;
+    }
+    return tokens;
+}
+/**
+ * Raise `frontier` resolution in place (UN-fold toward raw) to fill up to
+ * `target`, leveled (L3→L2, L2→L1, L1→raw) and **youngest-first within the reach
+ * window** — the mirror image of `shedToTarget`. Un-folding is a prefix
+ * perturbation too, so it obeys the same reach cap (bounded divergence) and only
+ * lowers whole groups (group-consistent → the picker reaches it via `lower`
+ * ops). Youngest-first spends the budget on the most recent foldable content
+ * (highest value, shallowest divergence). Stops before exceeding `target`.
+ * rawZone/frozen chunks are never touched. Returns final tokens.
+ */
+function expandToTarget(frontier, inputs, tree, ordered, target, reachTokens, rawZone, frozen) {
+    const newerTokens = new Map();
+    let acc = 0;
+    for (let i = ordered.length - 1; i >= 0; i--) {
+        newerTokens.set(ordered[i].id, acc);
+        acc += ordered[i].rawTokens;
+    }
+    let tokens = renderLayout(inputs, tree, frontier).totalTokens;
+    for (let level = MAX_FOLD_LEVEL; level >= 1 && tokens < target; level--) {
+        for (let oi = ordered.length - 1; oi >= 0; oi--) {
+            if (tokens >= target)
+                break;
+            const c = ordered[oi]; // youngest-first
+            if ((frontier.get(c.id) ?? 0) !== level)
+                continue;
+            if (rawZone.has(c.id) || frozen.has(c.id))
+                continue;
+            if ((newerTokens.get(c.id) ?? 0) >= reachTokens)
+                continue;
+            const node = tree.ancestorAt(c.id, level);
+            if (!node)
+                continue;
+            // Lower the WHOLE group to level-1 only if every covered leaf is at this
+            // level and within reach (group-consistent + reach-bounded).
+            let eligible = true;
+            for (const leafId of node.leafChunkIds) {
+                if ((frontier.get(leafId) ?? 0) !== level ||
+                    rawZone.has(leafId) || frozen.has(leafId) ||
+                    (newerTokens.get(leafId) ?? 0) >= reachTokens) {
+                    eligible = false;
+                    break;
+                }
+            }
+            if (!eligible)
+                continue;
+            for (const leafId of node.leafChunkIds)
+                frontier.set(leafId, level - 1);
+            const nt = renderLayout(inputs, tree, frontier).totalTokens;
+            if (nt <= target)
+                tokens = nt; // accept the un-fold
+            else
+                for (const leafId of node.leafChunkIds)
+                    frontier.set(leafId, level); // overshoot → revert
+        }
+    }
+    return tokens;
+}
+/** Earliest source sequence whose resolution changed `prev → next`. */
+function earliestChangedSequence(prev, next, ordered) {
+    for (const c of ordered) {
+        if ((prev.get(c.id) ?? 0) !== (next.get(c.id) ?? 0))
+            return c.sequence;
+    }
+    return Number.MAX_SAFE_INTEGER;
+}
+function unitsBeforeSequence(layout, tree, boundary) {
+    let count = 0;
+    for (const u of layout.units) {
+        const seq = u.kind === 'raw' ? tree.leaf(u.key)?.sequence ?? 0
+            : u.kind === 'recall' ? tree.summary(u.key)?.firstSequence ?? 0
+                : u.kind === 'head' ? -1
+                    : Number.MAX_SAFE_INTEGER;
+        if (seq < boundary)
+            count++;
+        else
+            break;
+    }
+    return count;
+}
+function rawTailSet(ordered, tailTokens) {
+    const s = new Set();
+    if (tailTokens <= 0)
+        return s;
+    let used = 0;
+    for (let i = ordered.length - 1; i >= 0; i--) {
+        s.add(ordered[i].id);
+        used += ordered[i].rawTokens;
+        if (used >= tailTokens)
+            break;
+    }
+    return s;
+}
+const EMPTY_SET = new Set();
+/**
+ * Plan one turn's frontier under the controller policy — shared by the replay
+ * harness (`replayControlled`) and `KvStableStrategy`. Carries F_prev forward,
+ * holds the raw zone raw and the frozen set fixed, then drives the rendered size
+ * toward `targetTokens` from EITHER side, both bounded by the `reachTokens`
+ * divergence cap (KV-continuity preserving in both directions):
+ *   - over `foldAtTokens`  → deepen, oldest-first, under the log-age saliency
+ *     caps, yielding the reach cap only as needed to stay under the hard wall W;
+ *   - under `expandAtTokens` → un-fold, youngest-first, to use budget headroom.
+ * The [expandAt, foldAt] dead band leaves F_prev untouched (zero perturbation)
+ * when already in range. Pure and deterministic.
+ */
+export function planControlledFrontier(inputs, tree, p) {
+    const ordered = [...inputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    const frozen = p.frozen ?? EMPTY_SET;
+    const mergeThreshold = p.mergeThreshold ?? 6;
+    const reach = p.reachTokens ?? p.windowTokens;
+    const expandAt = p.expandAtTokens ?? p.targetTokens;
+    const F = new Map();
+    for (const c of ordered) {
+        if (p.rawZone.has(c.id))
+            F.set(c.id, 0);
+        else if (frozen.has(c.id))
+            F.set(c.id, p.previous.get(c.id) ?? c.currentResolution);
+        else
+            F.set(c.id, p.previous.get(c.id) ?? 0);
+    }
+    let tokens = renderLayout(inputs, tree, F).totalTokens;
+    const before = tokens;
+    let folded = false;
+    let expanded = false;
+    let escalated = false;
+    if (tokens > p.foldAtTokens) {
+        const flatZoneChunks = p.rawZone.size;
+        const caps = new Map();
+        for (const c of ordered) {
+            caps.set(c.id, p.rawZone.has(c.id) || frozen.has(c.id)
+                ? 0
+                : foldDepthCap(c, p.now, p.rawZone, flatZoneChunks, mergeThreshold));
+        }
+        tokens = shedToTarget(F, inputs, tree, ordered, caps, p.targetTokens, reach, p.windowTokens);
+        folded = tokens !== before; // a real fold only if it actually changed the render
+        if (tokens > p.windowTokens)
+            escalated = true;
+    }
+    else if (tokens < expandAt) {
+        tokens = expandToTarget(F, inputs, tree, ordered, p.targetTokens, reach, p.rawZone, frozen);
+        expanded = tokens !== before; // a real un-fold only if it actually changed
+    }
+    return { resolutions: F, tokens, folded, expanded, escalated };
+}
+/**
+ * Run the controller over a session (the exported PickerInputs snapshot) as
+ * growing history, measuring billed recompute and KV perturbation per turn.
+ */
+export function replayControlled(fullInputs, opts) {
+    const mergeThreshold = opts.mergeThreshold ?? 6;
+    const markerCount = opts.markerCount ?? 4;
+    const targetSteps = Math.max(1, opts.targetSteps ?? 120);
+    const HW = opts.highWatermark ?? opts.budgetTokens;
+    const LW = opts.lowWatermark ?? Math.round(0.8 * opts.budgetTokens);
+    const reachTokens = opts.reachTokens ?? opts.budgetTokens;
+    const fullTree = new SummaryTree(fullInputs);
+    const availableAt = new Map();
+    for (const s of fullTree.allSummaries())
+        availableAt.set(s.id, s.lastSequence);
+    const allChunks = [...fullInputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    const seqValues = allChunks.map((c) => c.sequence);
+    const stride = Math.max(1, Math.ceil(seqValues.length / targetSteps));
+    const stepSeqs = [];
+    for (let i = 0; i < seqValues.length; i += stride)
+        stepSeqs.push(seqValues[i]);
+    const last = seqValues[seqValues.length - 1];
+    if (stepSeqs[stepSeqs.length - 1] !== last)
+        stepSeqs.push(last);
+    const steps = [];
+    let fprev = new Map();
+    const cache = new CacheStore({ ttlSteps: opts.cacheTtlSteps });
+    let prevNow = -1;
+    let totalRecomputed = 0;
+    let totalBilled = 0;
+    let totalCached = 0;
+    let totalRendered = 0;
+    let sumSqPerturb = 0;
+    let maxPerturbation = 0;
+    let foldEvents = 0;
+    let escalations = 0;
+    for (const now of stepSeqs) {
+        const visible = allChunks.filter((c) => c.sequence <= now);
+        const summaries = new Map();
+        const recallPairTokens = new Map();
+        for (const [id, s] of fullInputs.summaries) {
+            const lastSeq = availableAt.get(id);
+            if (lastSeq !== undefined && lastSeq >= 0 && lastSeq <= now) {
+                summaries.set(id, s);
+                const rp = fullInputs.recallPairTokens?.get(id);
+                if (rp !== undefined)
+                    recallPairTokens.set(id, rp);
+            }
+        }
+        const inputs = {
+            chunks: visible, summaries, recallPairTokens,
+            headTokens: 0, tailTokens: 0, headChunkIds: new Set(), tailChunkIds: new Set(),
+        };
+        const tree = new SummaryTree(inputs);
+        const flatZone = rawTailSet(visible, opts.attendedWindowTokens);
+        // Plan this turn's frontier via the shared controller policy (the same code
+        // KvStableStrategy runs): carry F_prev, hold the flat zone raw, fold to LW
+        // when over HW, and un-fold to LW when under it — both reach-bounded, with
+        // [LW, HW] a no-op dead band; never past the hard wall W.
+        const plan = planControlledFrontier(inputs, tree, {
+            previous: fprev, foldAtTokens: HW, expandAtTokens: LW, targetTokens: LW,
+            windowTokens: opts.windowTokens, reachTokens, rawZone: flatZone, now, mergeThreshold,
+        });
+        const F = plan.resolutions;
+        const folded = plan.folded || plan.expanded; // any active prefix change this turn
+        const escalated = plan.escalated;
+        const layout = renderLayout(inputs, tree, F);
+        const hit = cache.read(layout);
+        const recomputed = layout.totalTokens - hit.cachedTokens;
+        // Perturbation = recompute beyond genuinely new content (prefix churn).
+        let newContent = 0;
+        for (const c of visible)
+            if (c.sequence > prevNow)
+                newContent += c.rawTokens;
+        const perturbation = Math.max(0, recomputed - newContent);
+        const billed = PRICE.miss * recomputed + PRICE.cacheRead * hit.cachedTokens;
+        // Write breakpoints for future turns, hinting at the change boundary.
+        const boundarySeq = earliestChangedSequence(fprev, F, visible);
+        const boundaryUnitIndex = unitsBeforeSequence(layout, tree, boundarySeq);
+        cache.write(layout, placeMarkers(layout, markerCount, { boundaryUnitIndex }));
+        cache.tick();
+        let deepestLevel = 0;
+        for (const lvl of F.values())
+            if (lvl > deepestLevel)
+                deepestLevel = lvl;
+        steps.push({
+            now, numChunks: visible.length, renderedTokens: layout.totalTokens,
+            cachedTokens: hit.cachedTokens, recomputedTokens: recomputed, billed,
+            perturbation, folded, escalated, deepestLevel,
+        });
+        totalRecomputed += recomputed;
+        totalBilled += billed;
+        totalCached += hit.cachedTokens;
+        totalRendered += layout.totalTokens;
+        sumSqPerturb += perturbation * perturbation;
+        if (perturbation > maxPerturbation)
+            maxPerturbation = perturbation;
+        if (folded)
+            foldEvents++;
+        if (escalated)
+            escalations++;
+        fprev = F;
+        prevNow = now;
+    }
+    return {
+        steps,
+        totalRecomputed,
+        totalBilled,
+        overallHitRate: totalRendered > 0 ? totalCached / totalRendered : 0,
+        maxPerturbation,
+        rmsPerturbation: Math.sqrt(sumSqPerturb / Math.max(1, steps.length)),
+        foldEvents,
+        escalations,
+    };
+}
+//# sourceMappingURL=kv-control.js.map

package/dist/src/adaptive/kv-control.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-control.js","sourceRoot":"","sources":["../../../src/adaptive/kv-control.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAKH,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,YAAY,EAAoC,MAAM,qBAAqB,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAE7D,gFAAgF;AAChF,MAAM,CAAC,MAAM,KAAK,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,EAAW,CAAC;AAE9E,6DAA6D;AAC7D,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,CAAC;AAgEhC;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAkB,EAClB,GAAW,EACX,QAA8B,EAC9B,cAAsB,EACtB,cAAsB;IAEtB,IAAI,KAAK,CAAC,MAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAAE,OAAO,CAAC,CAAC;IACrD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;IAChD,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,yCAAyC;IAClE,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;AACrD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,YAAY,CACnB,QAA8B,EAC9B,MAAoB,EACpB,IAAiB,EACjB,OAAsB,EACtB,IAA0B,EAC1B,MAAc,EACd,WAAmB,EACnB,YAAoB;IAEpB,8EAA8E;IAC9E,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9B,CAAC;IAED,MAAM,eAAe,GAAG,CAAC,KAAa,EAAW,EAAE;QACjD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,cAAc,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,4BAA4B;gBAC5B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK;oBAAE,SAAS;gBACpD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK;oBAAE,SAAS;gBACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBAC9C,IAAI,CAAC,QAAQ;oBAAE,SAAS,CAAC,6CAA6C;gBACtE,qEAAqE;gBACrE,uEAAuE;gBACvE,wEAAwE;gBACxE,wEAAwE;gBACxE,8CAA8C;gBAC9C,IAAI,QAAQ,GAAG,IAAI,CAAC;gBACpB,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;oBAC3C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;wBAC/E,QAAQ,GAAG,KAAK,CAAC;wBACjB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBACxB,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;oBAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK;wBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACvE,CAAC;gBACD,IAAI,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,WAAW,IAAI,MAAM;oBAAE,OAAO,IAAI,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,eAAe,CAAC,WAAW,CAAC,CAAC;IAC7B,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,WAAW,CAAC;IAC9D,4EAA4E;IAC5E,IAAI,MAAM,GAAG,YAAY,EAAE,CAAC;QAC1B,eAAe,CAAC,QAAQ,CAAC,CAAC;QAC1B,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,WAAW,CAAC;IAC5D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,cAAc,CACrB,QAA8B,EAC9B,MAAoB,EACpB,IAAiB,EACjB,OAAsB,EACtB,MAAc,EACd,WAAmB,EACnB,OAA6B,EAC7B,MAA4B;IAE5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC/C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACpC,GAAG,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9B,CAAC;IAED,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,WAAW,CAAC;IAC9D,KAAK,IAAI,KAAK,GAAG,cAAc,EAAE,KAAK,IAAI,CAAC,IAAI,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QACxE,KAAK,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,IAAI,MAAM;gBAAE,MAAM;YAC5B,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,iBAAiB;YACxC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK;gBAAE,SAAS;YAClD,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YACpD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,WAAW;gBAAE,SAAS;YAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC1C,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,yEAAyE;YACzE,6DAA6D;YAC7D,IAAI,QAAQ,GAAG,IAAI,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;gBACvC,IACE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK;oBACrC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC;oBACzC,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,WAAW,EAC7C,CAAC;oBACD,QAAQ,GAAG,KAAK,CAAC;oBACjB,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YACxB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,YAAY;gBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACxE,MAAM,EAAE,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,WAAW,CAAC;YAC5D,IAAI,EAAE,IAAI,MAAM;gBAAE,MAAM,GAAG,EAAE,CAAC,CAAC,qBAAqB;;gBAC/C,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,YAAY;oBAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,qBAAqB;QACjG,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,uEAAuE;AACvE,SAAS,uBAAuB,CAC9B,IAAc,EACd,IAAkC,EAClC,OAAsB;IAEtB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,QAAQ,CAAC;IACzE,CAAC;IACD,OAAO,MAAM,CAAC,gBAAgB,CAAC;AACjC,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAoB,EAAE,IAAiB,EAAE,QAAgB;IACpF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,GAAG,GACP,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,CAAC;YAClD,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,aAAa,IAAI,CAAC;gBAC/D,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxB,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC;QAC5B,IAAI,GAAG,GAAG,QAAQ;YAAE,KAAK,EAAE,CAAC;;YACvB,MAAM;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,UAAU,CAAC,OAAsB,EAAE,UAAkB;IAC5D,MAAM,CAAC,GAAG,IAAI,GAAG,EAAW,CAAC;IAC7B,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrB,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7B,IAAI,IAAI,IAAI,UAAU;YAAE,MAAM;IAChC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,SAAS,GAAyB,IAAI,GAAG,EAAE,CAAC;AAuClD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAoB,EACpB,IAAiB,EACjB,CAAoB;IAEpB,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,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,SAAS,CAAC;IACrC,MAAM,cAAc,GAAG,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,YAAY,CAAC;IAC9C,MAAM,QAAQ,GAAG,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,YAAY,CAAC;IAEpD,MAAM,CAAC,GAAG,IAAI,GAAG,EAAmB,CAAC;IACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACnC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,iBAAiB,CAAC,CAAC;;YAC/E,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,IAAI,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC;IACvD,MAAM,MAAM,GAAG,MAAM,CAAC;IACtB,IAAI,MAAM,GAAG,KAAK,CAAC;IACnB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,SAAS,GAAG,KAAK,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC;QAC5B,MAAM,cAAc,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC;QACtC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAmB,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,CACN,CAAC,CAAC,EAAE,EACJ,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,cAAc,EAAE,cAAc,CAAC,CACtE,CAAC;QACJ,CAAC;QACD,MAAM,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;QAC7F,MAAM,GAAG,MAAM,KAAK,MAAM,CAAC,CAAC,qDAAqD;QACjF,IAAI,MAAM,GAAG,CAAC,CAAC,YAAY;YAAE,SAAS,GAAG,IAAI,CAAC;IAChD,CAAC;SAAM,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;QAC7B,MAAM,GAAG,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,YAAY,EAAE,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC5F,QAAQ,GAAG,MAAM,KAAK,MAAM,CAAC,CAAC,6CAA6C;IAC7E,CAAC;IACD,OAAO,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;AACjE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAAwB,EAAE,IAAoB;IAC7E,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,CAAC,CAAC;IAChD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,GAAG,CAAC,CAAC;IACzD,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,YAAY,CAAC;IACnD,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACpE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,YAAY,CAAC;IAE1D,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,YAAY,EAAE;QAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;IAE/E,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM;QAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEhE,MAAM,KAAK,GAAkB,EAAE,CAAC;IAChC,IAAI,KAAK,GAAa,IAAI,GAAG,EAAmB,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IAC/D,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IACjB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;QAClD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC5D,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,GAAG,UAAU,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAChD,IAAI,EAAE,KAAK,SAAS;oBAAE,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,MAAM,MAAM,GAAiB;YAC3B,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,gBAAgB;YAC5C,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,YAAY,EAAE,IAAI,GAAG,EAAE;SAC/E,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAChE,4EAA4E;QAC5E,2EAA2E;QAC3E,2EAA2E;QAC3E,0DAA0D;QAC1D,MAAM,IAAI,GAAG,sBAAsB,CAAC,MAAM,EAAE,IAAI,EAAE;YAChD,QAAQ,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE;YACvE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,cAAc;SACrF,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,qCAAqC;QAClF,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAEjC,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,GAAG,GAAG,CAAC,YAAY,CAAC;QAEzD,wEAAwE;QACxE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,IAAI,CAAC,CAAC,QAAQ,GAAG,OAAO;gBAAE,UAAU,IAAI,CAAC,CAAC,SAAS,CAAC;QAC7E,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC,CAAC;QAE1D,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,GAAG,UAAU,GAAG,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,YAAY,CAAC;QAE5E,sEAAsE;QACtE,MAAM,WAAW,GAAG,uBAAuB,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAC/D,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QACzE,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC9E,KAAK,CAAC,IAAI,EAAE,CAAC;QAEb,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM,EAAE;YAAE,IAAI,GAAG,GAAG,YAAY;gBAAE,YAAY,GAAG,GAAG,CAAC;QAEzE,KAAK,CAAC,IAAI,CAAC;YACT,GAAG,EAAE,SAAS,EAAE,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,MAAM,CAAC,WAAW;YAClE,YAAY,EAAE,GAAG,CAAC,YAAY,EAAE,gBAAgB,EAAE,UAAU,EAAE,MAAM;YACpE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY;SAC9C,CAAC,CAAC;QACH,eAAe,IAAI,UAAU,CAAC;QAC9B,WAAW,IAAI,MAAM,CAAC;QACtB,WAAW,IAAI,GAAG,CAAC,YAAY,CAAC;QAChC,aAAa,IAAI,MAAM,CAAC,WAAW,CAAC;QACpC,YAAY,IAAI,YAAY,GAAG,YAAY,CAAC;QAC5C,IAAI,YAAY,GAAG,eAAe;YAAE,eAAe,GAAG,YAAY,CAAC;QACnE,IAAI,MAAM;YAAE,UAAU,EAAE,CAAC;QACzB,IAAI,SAAS;YAAE,WAAW,EAAE,CAAC;QAE7B,KAAK,GAAG,CAAC,CAAC;QACV,OAAO,GAAG,GAAG,CAAC;IAChB,CAAC;IAED,OAAO;QACL,KAAK;QACL,eAAe;QACf,WAAW;QACX,cAAc,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACnE,eAAe;QACf,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACpE,UAAU;QACV,WAAW;KACZ,CAAC;AACJ,CAAC"}

package/dist/src/adaptive/kv-replay.d.ts

@@ -0,0 +1,76 @@
+/**
+ * Session replay for measuring REAL KV-cache stability.
+ *
+ * `replaySession` is the BASELINE: the production-default `FlatProfileStrategy`
+ * (level-equalizing) run through the real `Picker`, replayed over a growing
+ * session. Compare it against `replayControlled` (the KV-stable controller) to
+ * see what minimizing prefix churn actually buys. (Prior to the half-life/λ
+ * solver's removal this line ran `solveStableFrontier`; the λ value model was
+ * retired — see docs/kv-stable-context-control.md.)
+ *
+ * At each step it:
+ *   1. exposes only the chunks/summaries that existed by that point
+ *      (a summary is available once its youngest covered message has happened —
+ *      `SummaryNode.lastSequence <= now`; compression is bottom-up over time);
+ *   2. folds the middle to a FIXED token cap, carrying F_prev forward, with the
+ *      newest `rawTailTokens` pinned raw (the flat zone);
+ *   3. READS a PERSISTENT provider cache (`CacheStore`, Anthropic ≤4
+ *      breakpoints) for the longest live stored prefix still byte-identical to
+ *      this render — entries written ANY prior turn — then WRITES this render's
+ *      breakpoints back. A prefix frozen many turns ago is still a hit today.
+ *
+ * Pure and deterministic.
+ */
+import type { PickerInputs } from './picker.js';
+export interface ReplayOptions {
+    /** Fixed context-window cap each step folds against (tokens). */
+    budgetTokens: number;
+    /** Cache breakpoints to place per step (1…4). Default 4. */
+    markerCount?: number;
+    /** Newest-N tokens kept raw (the protected flat zone). */
+    rawTailTokens?: number;
+    /** Approximate number of replay steps (history is down-sampled to this).
+     *  Default 120. */
+    targetSteps?: number;
+    /** Cache entries older than this many steps are evicted (provider TTL).
+     *  Default Infinity (keep all — the faithful upper bound on reuse). */
+    cacheTtlSteps?: number;
+}
+export interface ReplayStep {
+    /** Newest visible source sequence at this step. */
+    now: number;
+    /** Visible chunk count. */
+    numChunks: number;
+    /** Rendered tokens of this step's frontier. */
+    renderedTokens: number;
+    /** Tokens served from the simulated provider cache this step. */
+    cachedTokens: number;
+    /** Tokens recomputed this step (cache miss). */
+    recomputedTokens: number;
+    /** cachedTokens / renderedTokens, in [0, 1]. */
+    hitRate: number;
+    /** Source sequence at/after which the frontier was re-optimized. */
+    boundarySequence: number;
+    /** Solver could not fit under the cap this step. */
+    overBudget: boolean;
+    /** Deepest fold level present in the rendered frontier (0 = all raw). */
+    deepestLevel: number;
+    /** Age (in steps) of the cache entry that served this step's hit — evidence
+     *  the hit came from an older write, not just the previous turn. −1 = miss. */
+    cacheAgeSteps: number;
+}
+export interface ReplayResult {
+    steps: ReplayStep[];
+    /** Σ renderedTokens over all steps. */
+    totalRendered: number;
+    /** Σ recomputedTokens over all steps (the cache-miss bill). */
+    totalRecomputed: number;
+    /** (totalRendered − totalRecomputed) / totalRendered, in [0, 1]. */
+    overallHitRate: number;
+}
+/**
+ * Replay a full session (the exported PickerInputs snapshot) as growing
+ * history, measuring per-step provider-cache hit under a fixed budget.
+ */
+export declare function replaySession(fullInputs: PickerInputs, opts: ReplayOptions): ReplayResult;
+//# sourceMappingURL=kv-replay.d.ts.map

package/dist/src/adaptive/kv-replay.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-replay.d.ts","sourceRoot":"","sources":["../../../src/adaptive/kv-replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAe,MAAM,aAAa,CAAC;AAQ7D,MAAM,WAAW,aAAa;IAC5B,iEAAiE;IACjE,YAAY,EAAE,MAAM,CAAC;IACrB,4DAA4D;IAC5D,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,0DAA0D;IAC1D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;uBACmB;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;2EACuE;IACvE,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,UAAU;IACzB,mDAAmD;IACnD,GAAG,EAAE,MAAM,CAAC;IACZ,2BAA2B;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,+CAA+C;IAC/C,cAAc,EAAE,MAAM,CAAC;IACvB,iEAAiE;IACjE,YAAY,EAAE,MAAM,CAAC;IACrB,gDAAgD;IAChD,gBAAgB,EAAE,MAAM,CAAC;IACzB,gDAAgD;IAChD,OAAO,EAAE,MAAM,CAAC;IAChB,oEAAoE;IACpE,gBAAgB,EAAE,MAAM,CAAC;IACzB,oDAAoD;IACpD,UAAU,EAAE,OAAO,CAAC;IACpB,yEAAyE;IACzE,YAAY,EAAE,MAAM,CAAC;IACrB;mFAC+E;IAC/E,aAAa,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,uCAAuC;IACvC,aAAa,EAAE,MAAM,CAAC;IACtB,+DAA+D;IAC/D,eAAe,EAAE,MAAM,CAAC;IACxB,oEAAoE;IACpE,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,EAAE,aAAa,GAAG,YAAY,CAsGzF"}

package/dist/src/adaptive/kv-replay.js

@@ -0,0 +1,175 @@
+/**
+ * Session replay for measuring REAL KV-cache stability.
+ *
+ * `replaySession` is the BASELINE: the production-default `FlatProfileStrategy`
+ * (level-equalizing) run through the real `Picker`, replayed over a growing
+ * session. Compare it against `replayControlled` (the KV-stable controller) to
+ * see what minimizing prefix churn actually buys. (Prior to the half-life/λ
+ * solver's removal this line ran `solveStableFrontier`; the λ value model was
+ * retired — see docs/kv-stable-context-control.md.)
+ *
+ * At each step it:
+ *   1. exposes only the chunks/summaries that existed by that point
+ *      (a summary is available once its youngest covered message has happened —
+ *      `SummaryNode.lastSequence <= now`; compression is bottom-up over time);
+ *   2. folds the middle to a FIXED token cap, carrying F_prev forward, with the
+ *      newest `rawTailTokens` pinned raw (the flat zone);
+ *   3. READS a PERSISTENT provider cache (`CacheStore`, Anthropic ≤4
+ *      breakpoints) for the longest live stored prefix still byte-identical to
+ *      this render — entries written ANY prior turn — then WRITES this render's
+ *      breakpoints back. A prefix frozen many turns ago is still a hit today.
+ *
+ * Pure and deterministic.
+ */
+import { SummaryTree } from './summary-tree.js';
+import { Picker } from './picker.js';
+import { FlatProfileStrategy } from './strategies/flat-profile.js';
+import { renderLayout } from './render-offsets.js';
+import { placeMarkers, CacheStore } from './kv-cache-sim.js';
+/**
+ * Replay a full session (the exported PickerInputs snapshot) as growing
+ * history, measuring per-step provider-cache hit under a fixed budget.
+ */
+export function replaySession(fullInputs, opts) {
+    const markerCount = opts.markerCount ?? 4;
+    const targetSteps = Math.max(1, opts.targetSteps ?? 120);
+    // Availability threshold per summary: youngest covered leaf sequence.
+    // Built once over the full tree; a summary is usable at `now` iff <= now.
+    const fullTree = new SummaryTree(fullInputs);
+    const availableAt = new Map();
+    for (const s of fullTree.allSummaries())
+        availableAt.set(s.id, s.lastSequence);
+    const allChunks = [...fullInputs.chunks].sort((a, b) => a.sequence - b.sequence);
+    const seqValues = allChunks.map((c) => c.sequence);
+    // Down-sample to ~targetSteps growth points (always include the final state).
+    const stride = Math.max(1, Math.ceil(seqValues.length / targetSteps));
+    const stepSeqs = [];
+    for (let i = 0; i < seqValues.length; i += stride)
+        stepSeqs.push(seqValues[i]);
+    const last = seqValues[seqValues.length - 1];
+    if (stepSeqs[stepSeqs.length - 1] !== last)
+        stepSeqs.push(last);
+    const steps = [];
+    let fprev = new Map();
+    const cache = new CacheStore({ ttlSteps: opts.cacheTtlSteps });
+    let totalRendered = 0;
+    let totalRecomputed = 0;
+    for (const now of stepSeqs) {
+        const visiblePlain = allChunks.filter((c) => c.sequence <= now);
+        const tailIds = rawTailSet(visiblePlain, opts.rawTailTokens ?? 0);
+        // Pin the flat zone so flat-profile won't fold it AND it renders as
+        // individual raw units — not collapsed into one fixed-key 'tail' unit,
+        // which would falsely match across turns in the cache.
+        const visible = visiblePlain.map((c) => (tailIds.has(c.id) ? { ...c, pinned: true } : c));
+        const summaries = new Map();
+        const recallPairTokens = new Map();
+        for (const [id, s] of fullInputs.summaries) {
+            const lastSeq = availableAt.get(id);
+            if (lastSeq !== undefined && lastSeq >= 0 && lastSeq <= now) {
+                summaries.set(id, s);
+                const rp = fullInputs.recallPairTokens?.get(id);
+                if (rp !== undefined)
+                    recallPairTokens.set(id, rp);
+            }
+        }
+        const inputs = {
+            chunks: visible,
+            summaries,
+            recallPairTokens,
+            headTokens: 0,
+            tailTokens: 0,
+            headChunkIds: new Set(),
+            tailChunkIds: new Set(),
+        };
+        const tree = new SummaryTree(inputs);
+        // Baseline policy: the production default, FlatProfileStrategy, via the real
+        // Picker — folds the middle to the budget, leaving the pinned flat zone raw.
+        const result = new Picker(new FlatProfileStrategy()).run(inputs, {
+            totalBudget: opts.budgetTokens,
+            targetBudget: opts.budgetTokens,
+            slack: 0,
+        });
+        const resolutions = result.finalResolutions;
+        const layout = renderLayout(inputs, tree, resolutions);
+        // READ the persistent cache: longest live stored prefix that still matches.
+        const hit = cache.read(layout);
+        const recomputedTokens = layout.totalTokens - hit.cachedTokens;
+        // WRITE this render's breakpoints back (hinting at the earliest change vs
+        // F_prev), then advance the turn clock so future reads see this write.
+        const boundarySeq = earliestChangedSequence(fprev, resolutions, visible);
+        const boundaryUnitIndex = unitsBeforeSequence(layout, tree, boundarySeq);
+        cache.write(layout, placeMarkers(layout, markerCount, { boundaryUnitIndex }));
+        cache.tick();
+        let deepestLevel = 0;
+        for (const lvl of resolutions.values())
+            if (lvl > deepestLevel)
+                deepestLevel = lvl;
+        steps.push({
+            now,
+            numChunks: visible.length,
+            renderedTokens: layout.totalTokens,
+            cachedTokens: hit.cachedTokens,
+            recomputedTokens,
+            hitRate: layout.totalTokens > 0 ? hit.cachedTokens / layout.totalTokens : 0,
+            boundarySequence: boundarySeq,
+            overBudget: result.finalTokens > opts.budgetTokens,
+            deepestLevel,
+            cacheAgeSteps: hit.ageSteps,
+        });
+        totalRendered += layout.totalTokens;
+        totalRecomputed += recomputedTokens;
+        fprev = resolutions;
+    }
+    return {
+        steps,
+        totalRendered,
+        totalRecomputed,
+        overallHitRate: totalRendered > 0 ? (totalRendered - totalRecomputed) / totalRendered : 0,
+    };
+}
+// ---------------------------------------------------------------------------
+/** Earliest source sequence whose resolution changed `prev → next` (the marker
+ *  hint / churn boundary). MAX_SAFE_INTEGER when nothing changed. */
+function earliestChangedSequence(prev, next, ordered) {
+    for (const c of ordered) {
+        if ((prev.get(c.id) ?? 0) !== (next.get(c.id) ?? 0))
+            return c.sequence;
+    }
+    return Number.MAX_SAFE_INTEGER;
+}
+/** Chunk ids within the newest `tailTokens` of raw content (kept non-foldable). */
+function rawTailSet(orderedChunks, tailTokens) {
+    const s = new Set();
+    if (tailTokens <= 0)
+        return s;
+    let used = 0;
+    for (let i = orderedChunks.length - 1; i >= 0; i--) {
+        s.add(orderedChunks[i].id);
+        used += orderedChunks[i].rawTokens;
+        if (used >= tailTokens)
+            break;
+    }
+    return s;
+}
+/** Number of leading rendered units whose start sequence is < `boundary` (the
+ *  frozen-prefix length → a natural cache breakpoint). */
+function unitsBeforeSequence(layout, tree, boundary) {
+    let count = 0;
+    for (const u of layout.units) {
+        if (unitStartSeq(u, tree) < boundary)
+            count++;
+        else
+            break;
+    }
+    return count;
+}
+function unitStartSeq(u, tree) {
+    if (u.kind === 'raw')
+        return tree.leaf(u.key)?.sequence ?? 0;
+    if (u.kind === 'recall')
+        return tree.summary(u.key)?.firstSequence ?? 0;
+    if (u.kind === 'head')
+        return -1;
+    return Number.MAX_SAFE_INTEGER; // tail
+}
+//# sourceMappingURL=kv-replay.js.map

package/dist/src/adaptive/kv-replay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-replay.js","sourceRoot":"","sources":["../../../src/adaptive/kv-replay.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAKH,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,YAAY,EAAoC,MAAM,qBAAqB,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAmD7D;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,UAAwB,EAAE,IAAmB;IACzE,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,GAAG,CAAC,CAAC;IAEzD,sEAAsE;IACtE,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,YAAY,EAAE;QAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;IAE/E,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAEnD,8EAA8E;IAC9E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC;IACtE,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,IAAI,MAAM;QAAE,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,IAAI,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7C,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI;QAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAEhE,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,KAAK,GAAa,IAAI,GAAG,EAAmB,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC;IAC/D,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,GAAG,CAAC,CAAC;QAChE,MAAM,OAAO,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC;QAClE,oEAAoE;QACpE,uEAAuE;QACvE,uDAAuD;QACvD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;QAClD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;YAC3C,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpC,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI,GAAG,EAAE,CAAC;gBAC5D,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACrB,MAAM,EAAE,GAAG,UAAU,CAAC,gBAAgB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;gBAChD,IAAI,EAAE,KAAK,SAAS;oBAAE,gBAAgB,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAiB;YAC3B,MAAM,EAAE,OAAO;YACf,SAAS;YACT,gBAAgB;YAChB,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,CAAC;YACb,YAAY,EAAE,IAAI,GAAG,EAAE;YACvB,YAAY,EAAE,IAAI,GAAG,EAAE;SACxB,CAAC;QACF,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;QAErC,6EAA6E;QAC7E,6EAA6E;QAC7E,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,mBAAmB,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE;YAC/D,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,KAAK,EAAE,CAAC;SACT,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAE5C,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QACvD,4EAA4E;QAC5E,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,gBAAgB,GAAG,MAAM,CAAC,WAAW,GAAG,GAAG,CAAC,YAAY,CAAC;QAC/D,0EAA0E;QAC1E,uEAAuE;QACvE,MAAM,WAAW,GAAG,uBAAuB,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;QACzE,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;QACzE,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC9E,KAAK,CAAC,IAAI,EAAE,CAAC;QAEb,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,MAAM,EAAE;YAAE,IAAI,GAAG,GAAG,YAAY;gBAAE,YAAY,GAAG,GAAG,CAAC;QAEnF,KAAK,CAAC,IAAI,CAAC;YACT,GAAG;YACH,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,cAAc,EAAE,MAAM,CAAC,WAAW;YAClC,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,gBAAgB;YAChB,OAAO,EAAE,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3E,gBAAgB,EAAE,WAAW;YAC7B,UAAU,EAAE,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY;YAClD,YAAY;YACZ,aAAa,EAAE,GAAG,CAAC,QAAQ;SAC5B,CAAC,CAAC;QACH,aAAa,IAAI,MAAM,CAAC,WAAW,CAAC;QACpC,eAAe,IAAI,gBAAgB,CAAC;QAEpC,KAAK,GAAG,WAAW,CAAC;IACtB,CAAC;IAED,OAAO;QACL,KAAK;QACL,aAAa;QACb,eAAe;QACf,cAAc,EAAE,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;KAC1F,CAAC;AACJ,CAAC;AAED,8EAA8E;AAE9E;qEACqE;AACrE,SAAS,uBAAuB,CAC9B,IAAc,EACd,IAAkC,EAClC,OAAsB;IAEtB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,QAAQ,CAAC;IACzE,CAAC;IACD,OAAO,MAAM,CAAC,gBAAgB,CAAC;AACjC,CAAC;AAED,mFAAmF;AACnF,SAAS,UAAU,CAAC,aAA4B,EAAE,UAAkB;IAClE,MAAM,CAAC,GAAG,IAAI,GAAG,EAAW,CAAC;IAC7B,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnD,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3B,IAAI,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACnC,IAAI,IAAI,IAAI,UAAU;YAAE,MAAM;IAChC,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED;0DAC0D;AAC1D,SAAS,mBAAmB,CAAC,MAAoB,EAAE,IAAiB,EAAE,QAAgB;IACpF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,YAAY,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,QAAQ;YAAE,KAAK,EAAE,CAAC;;YACzC,MAAM;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CACnB,CAAgC,EAChC,IAAiB;IAEjB,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;IAC7D,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,aAAa,IAAI,CAAC,CAAC;IACxE,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,CAAC,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC,gBAAgB,CAAC,CAAC,OAAO;AACzC,CAAC"}