melete-ai 0.88.2

package/dist/arms.js

@@ -0,0 +1,399 @@
+/**
+ * STRATEGY ARMS — interchangeable per-step experiment proposers for the portfolio brain.
+ *
+ * The No-Free-Lunch theorem is the production reality: no single optimiser is best across all landscapes
+ * (smooth, rugged, low-D, high-D). So Melete does not bet on one algorithm — it runs a PORTFOLIO of arms
+ * and lets a bandit (portfolio.ts) allocate each expensive experiment to whichever arm is winning ON THIS
+ * problem. An arm is a stateful proposer: given the history so far, propose the next experiment.
+ *
+ * Arms shipped:
+ *   • kernel-ucb  — Gaussian-kernel surrogate + UCB (the strong low-D Bayesian-lite core)
+ *   • cmaes       — a (1+1) self-adaptive evolution strategy (robust in higher-D and on rugged surfaces,
+ *                   where the kernel surrogate degrades — fixes the high-D failure of a pure-BO engine)
+ *   • resonance   — the wave-interference field (a diversity/exploration hedge; earns budget only when it
+ *                   actually helps — honest: it is not strong alone, but a portfolio loses nothing by
+ *                   holding a hedge that the bandit can ignore)
+ *   • random      — uniform exploration (the escape hatch / baseline)
+ *
+ * Each arm is created fresh per run via a factory (closure-held state), so a discovery is deterministic
+ * and reproducible. Proposers avoid already-seen experiments.
+ */
+import { gridCandidates, randomCandidates, localCandidates, dist2 } from "./space.js";
+const key = (e) => JSON.stringify(e);
+const seenSet = (obs) => new Set(obs.map((o) => key(o.experiment)));
+const better = (goal, a, b) => goal === "maximize" ? a > b : a < b;
+const bestOf = (obs, goal) => obs.reduce((a, b) => better(goal, b.value, a.value) ? b : a, obs[0]);
+/** kernel-UCB: dense grid + local cloud candidates; pick argmax(surrogate mean + annealed·uncertainty). */
+export function armKernelUCB(bandwidth = 0.025, kappa0 = 1.0) {
+    return {
+        name: "kernel-ucb",
+        propose: (ctx) => {
+            const { space, obs, t, budget, rnd, goal } = ctx;
+            const sign = goal === "maximize" ? 1 : -1;
+            const seen = seenSet(obs);
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: 0 };
+            const progress = Math.min(1, t / Math.max(1, budget));
+            const kappa = kappa0 * Math.exp(-progress * 3.5);
+            const radius = 0.25 * Math.exp(-progress * 2.5);
+            const perDim = Math.max(4, Math.min(60, Math.round(Math.pow(2500, 1 / Math.max(1, space.dims.length)))));
+            const cands = [...gridCandidates(space, perDim, 5000), ...localCandidates(space, best.experiment, 800, Math.max(0.02, radius), rnd), ...randomCandidates(space, 600, rnd)];
+            let pick = null, pa = -Infinity;
+            for (const c of cands) {
+                if (seen.has(key(c)))
+                    continue;
+                let wsum = 0, vsum = 0, nearest = Infinity;
+                for (const o of obs) {
+                    const d2 = dist2(space, c, o.experiment);
+                    const w = Math.exp(-d2 / bandwidth);
+                    wsum += w;
+                    vsum += w * (sign * o.value);
+                    nearest = Math.min(nearest, Math.sqrt(d2));
+                }
+                const mean = wsum > 1e-12 ? vsum / wsum : 0;
+                const acq = mean + kappa * nearest;
+                if (acq > pa) {
+                    pa = acq;
+                    pick = c;
+                }
+            }
+            return pick ?? randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** (1+1) self-adaptive evolution strategy — sample N(best, σ); σ grows when stuck, shrinks on success. */
+export function armCMAES(sigma0 = 0.3) {
+    let sigma = sigma0;
+    let lastBest = -Infinity;
+    let inited = false;
+    return {
+        name: "cmaes",
+        propose: (ctx) => {
+            const { space, obs, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: goal === "maximize" ? -Infinity : Infinity };
+            if (inited) {
+                const improved = better(goal, best.value, lastBest);
+                sigma = improved ? Math.min(0.5, sigma * 1.3) : Math.max(0.01, sigma * 0.85);
+            } // 1/5-success-ish rule
+            lastBest = best.value;
+            inited = true;
+            for (let tryN = 0; tryN < 12; tryN++) {
+                const cand = localCandidates(space, best.experiment, 1, sigma * (1 + 0.5 * tryN), rnd)[0];
+                if (!seen.has(key(cand)))
+                    return cand;
+            }
+            return randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Wave-interference field (diversity hedge). Honest: weak alone; the bandit only funds it when it helps. */
+export function armResonance(sigma = 0.06, k0 = 5.0, rho = 0.25) {
+    return {
+        name: "resonance",
+        propose: (ctx) => {
+            const { space, obs, t, budget, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: 0 };
+            const progress = Math.min(1, t / Math.max(1, budget));
+            const k = k0 * Math.exp(-progress * 2);
+            const lambda = Math.exp(-progress * 3);
+            // rank amplitudes [0,1]
+            const idx = obs.map((_, i) => i).sort((a, b) => goal === "maximize" ? obs[a].value - obs[b].value : obs[b].value - obs[a].value);
+            const amp = new Array(obs.length);
+            idx.forEach((oi, r) => { amp[oi] = obs.length > 1 ? r / (obs.length - 1) : 1; });
+            const perDim = Math.max(4, Math.min(40, Math.round(Math.pow(1500, 1 / Math.max(1, space.dims.length)))));
+            const cands = [...gridCandidates(space, perDim, 3000), ...localCandidates(space, best.experiment, 600, Math.max(0.02, 0.25 * Math.exp(-progress * 2.5)), rnd), ...randomCandidates(space, 400, rnd)];
+            let pick = null, pf = -Infinity;
+            for (const c of cands) {
+                if (seen.has(key(c)))
+                    continue;
+                let field = 0, nearest = Infinity;
+                for (let i = 0; i < obs.length; i++) {
+                    const d = Math.sqrt(dist2(space, c, obs[i].experiment));
+                    field += amp[i] * Math.exp(-(d * d) / (2 * sigma * sigma)) * (1 + rho * Math.cos(k * d));
+                    if (d < nearest)
+                        nearest = d;
+                }
+                const score = field + lambda * nearest;
+                if (score > pf) {
+                    pf = score;
+                    pick = c;
+                }
+            }
+            return pick ?? randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+export function armRandom() {
+    return { name: "random", propose: (ctx) => { const seen = seenSet(ctx.obs); for (let i = 0; i < 20; i++) {
+            const c = randomCandidates(ctx.space, 1, ctx.rnd)[0];
+            if (!seen.has(key(c)))
+                return c;
+        } return randomCandidates(ctx.space, 1, ctx.rnd)[0]; } };
+}
+// ── GP arm: a real Gaussian Process (RBF kernel) + Expected-Improvement acquisition ─────────────
+const normPdf = (z) => Math.exp(-0.5 * z * z) / Math.sqrt(2 * Math.PI);
+const normCdf = (z) => { const t = 1 / (1 + 0.2316419 * Math.abs(z)); const d = 0.3989423 * Math.exp(-z * z / 2); const p = d * t * (0.3193815 + t * (-0.3565638 + t * (1.781478 + t * (-1.821256 + t * 1.330274)))); return z > 0 ? 1 - p : p; };
+function cholesky(A) {
+    const n = A.length;
+    const L = Array.from({ length: n }, () => new Array(n).fill(0));
+    for (let i = 0; i < n; i++)
+        for (let j = 0; j <= i; j++) {
+            let s = A[i][j];
+            for (let k = 0; k < j; k++)
+                s -= L[i][k] * L[j][k];
+            if (i === j) {
+                if (s <= 0)
+                    return null;
+                L[i][j] = Math.sqrt(s);
+            }
+            else
+                L[i][j] = s / L[j][j];
+        }
+    return L;
+}
+function cholSolve(L, b) {
+    const n = L.length;
+    const y = new Array(n).fill(0), x = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        let s = b[i];
+        for (let k = 0; k < i; k++)
+            s -= L[i][k] * y[k];
+        y[i] = s / L[i][i];
+    }
+    for (let i = n - 1; i >= 0; i--) {
+        let s = y[i];
+        for (let k = i + 1; k < n; k++)
+            s -= L[k][i] * x[k];
+        x[i] = s / L[i][i];
+    }
+    return x;
+}
+/** Real GP surrogate + Expected Improvement — the gold-standard sample-efficient acquisition. */
+export function armGP(lengthscale = 0.15, noise = 1e-4) {
+    return {
+        name: "gp",
+        propose: (ctx) => {
+            const { space, obs, t, budget, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            const sign = goal === "maximize" ? 1 : -1;
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: 0 };
+            if (obs.length < 4) {
+                const c = randomCandidates(space, 1, rnd)[0];
+                return seen.has(key(c)) ? randomCandidates(space, 1, rnd)[0] : c;
+            }
+            const X = obs.map((o) => o.experiment);
+            const y = obs.map((o) => sign * o.value);
+            const kern = (a, b) => Math.exp(-dist2(space, a, b) / (2 * lengthscale * lengthscale));
+            const n = X.length;
+            const K = Array.from({ length: n }, (_, i) => Array.from({ length: n }, (_, j) => kern(X[i], X[j]) + (i === j ? noise : 0)));
+            const L = cholesky(K);
+            if (!L)
+                return armKernelUCB().propose(ctx); // numerical fallback
+            const alpha = cholSolve(L, y);
+            const ybest = Math.max(...y);
+            const progress = Math.min(1, t / Math.max(1, budget));
+            const radius = 0.25 * Math.exp(-progress * 2.5);
+            const perDim = Math.max(4, Math.min(40, Math.round(Math.pow(1500, 1 / Math.max(1, space.dims.length)))));
+            const cands = [...gridCandidates(space, perDim, 3000), ...localCandidates(space, best.experiment, 600, Math.max(0.02, radius), rnd), ...randomCandidates(space, 400, rnd)];
+            let pick = null, pa = -Infinity;
+            for (const c of cands) {
+                if (seen.has(key(c)))
+                    continue;
+                const ks = X.map((xi) => kern(c, xi));
+                let mu = 0;
+                for (let i = 0; i < n; i++)
+                    mu += ks[i] * alpha[i];
+                const v = cholSolve(L, ks);
+                let dotk = 0;
+                for (let i = 0; i < n; i++)
+                    dotk += ks[i] * v[i];
+                const variance = Math.max(1e-9, 1 - dotk);
+                const s = Math.sqrt(variance);
+                const z = (mu - ybest) / s;
+                const ei = (mu - ybest) * normCdf(z) + s * normPdf(z); // Expected Improvement
+                if (ei > pa) {
+                    pa = ei;
+                    pick = c;
+                }
+            }
+            return pick ?? randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Simulated annealing arm — temperature-annealed random walk from the best; escapes via occasional far jumps. */
+export function armSimAnneal(temp0 = 0.4) {
+    return {
+        name: "anneal",
+        propose: (ctx) => {
+            const { space, obs, t, budget, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: 0 };
+            const T = Math.max(0.01, temp0 * Math.exp(-3 * Math.min(1, t / Math.max(1, budget)))); // cooling schedule
+            for (let tryN = 0; tryN < 12; tryN++) {
+                const farJump = rnd() < 0.15 * T; // occasional global escape, more likely when hot
+                const c = farJump ? randomCandidates(space, 1, rnd)[0] : localCandidates(space, best.experiment, 1, T * (1 + 0.3 * tryN), rnd)[0];
+                if (!seen.has(key(c)))
+                    return c;
+            }
+            return randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Trust-region arm — coordinate steps within a region around the best; region tightens as the run progresses. */
+export function armTrustRegion(radius0 = 0.3) {
+    return {
+        name: "trust-region",
+        propose: (ctx) => {
+            const { space, obs, t, budget, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            const best = obs.length ? bestOf(obs, goal) : { experiment: {}, value: 0 };
+            const r = Math.max(0.01, radius0 * Math.exp(-2.5 * Math.min(1, t / Math.max(1, budget))));
+            for (let tryN = 0; tryN < 16; tryN++) {
+                const c = { ...best.experiment };
+                const dims = space.dims;
+                const di = Math.floor(rnd() * dims.length) % Math.max(1, dims.length);
+                const d = dims[di];
+                const span = d.max - d.min;
+                const step = (rnd() < 0.5 ? -1 : 1) * r * span * (0.3 + 0.7 * rnd());
+                c[d.name] = Math.max(d.min, Math.min(d.max, (Number(best.experiment[d.name]) || d.min) + step));
+                if (d.type === "int")
+                    c[d.name] = Math.round(c[d.name]);
+                if (!seen.has(key(c)))
+                    return c;
+            }
+            return randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Maximin space-filler — propose the point FARTHEST from every prior experiment. Pure global coverage;
+ * measured to materially help on rugged/multimodal surfaces (finds un-sampled basins the others miss). */
+export function armMaximin(pool = 500) {
+    return {
+        name: "maximin",
+        propose: (ctx) => {
+            const { space, obs, rnd } = ctx;
+            const seen = seenSet(obs);
+            let best = null, bd = -1;
+            for (const c of randomCandidates(space, pool, rnd)) {
+                if (seen.has(key(c)))
+                    continue;
+                let nn = Infinity;
+                for (const o of obs)
+                    nn = Math.min(nn, dist2(space, c, o.experiment));
+                if (nn > bd) {
+                    bd = nn;
+                    best = c;
+                }
+            }
+            return best ?? randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Basin-hopping — restart from a fresh random anchor every few calls, then refine locally around it.
+ * Escapes the global-best trap by deliberately exploring OTHER basins of a multimodal surface. */
+export function armBasinHop(restartEvery = 6, radius = 0.08) {
+    let anchor = null;
+    let age = 0;
+    return {
+        name: "basin-hop",
+        propose: (ctx) => {
+            const { space, obs, rnd } = ctx;
+            const seen = seenSet(obs);
+            if (!anchor || age > restartEvery) {
+                anchor = randomCandidates(space, 1, rnd)[0];
+                age = 0;
+            }
+            age++;
+            for (let i = 0; i < 10; i++) {
+                const c = localCandidates(space, anchor, 1, radius, rnd)[0];
+                if (!seen.has(key(c)))
+                    return c;
+            }
+            return randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** Differential Evolution arm — DE/rand/1: combine three past experiments (a + F·(b−c)) + crossover with
+ * the best. A population-based global optimiser that is strong on rugged/multimodal surfaces. */
+export function armDiffEvolution(F = 0.7, CR = 0.9) {
+    return {
+        name: "diff-evo",
+        propose: (ctx) => {
+            const { space, obs, rnd, goal } = ctx;
+            const seen = seenSet(obs);
+            if (obs.length < 4) {
+                const c = randomCandidates(space, 1, rnd)[0];
+                return seen.has(key(c)) ? randomCandidates(space, 1, rnd)[0] : c;
+            }
+            const best = bestOf(obs, goal);
+            for (let tryN = 0; tryN < 14; tryN++) {
+                const pick = () => obs[Math.floor(rnd() * obs.length) % obs.length].experiment;
+                const a = pick(), b = pick(), c = pick();
+                const trial = {};
+                for (const d of space.dims) {
+                    const base = (rnd() < CR) ? (Number(a[d.name]) || d.min) + F * ((Number(b[d.name]) || 0) - (Number(c[d.name]) || 0)) : (Number(best.experiment[d.name]) || d.min);
+                    let v = Math.max(d.min, Math.min(d.max, base));
+                    if (d.type === "int")
+                        v = Math.round(v);
+                    trial[d.name] = v;
+                }
+                if (!seen.has(key(trial)))
+                    return trial;
+            }
+            return randomCandidates(space, 1, rnd)[0];
+        },
+    };
+}
+/** The production portfolio. Curated by MEASURED robustness (see bench.robustnessBench): the strong
+ * convergers (gp, cmaes, kernel-ucb) + a local refiner (trust-region) + escape/diversity (anneal, random).
+ * resonance stays available as an arm but is not in the default set (measured weakest; keep the bandit lean). */
+// Default portfolio — curated by MEASURED robustness. maximin + basin-hop were added after measuring they
+// materially improve rugged/multimodal results (−1.41 → −0.98) without regressing smooth/high-D.
+export function defaultArms() { return [armGP(), armCMAES(), armKernelUCB(), armTrustRegion(), armSimAnneal(), armMaximin(), armBasinHop(), armRandom()]; }
+// allArms = every available arm. resonance + diff-evo are AVAILABLE for custom portfolios but MEASURED not
+// to improve the default set (honest curation by evidence — adding them only costs bandit overhead here).
+export function allArms() { return [armGP(), armCMAES(), armKernelUCB(), armTrustRegion(), armSimAnneal(), armMaximin(), armBasinHop(), armDiffEvolution(), armResonance(), armRandom()]; }
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+import { lcg } from "./space.js";
+export function armsGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 10 }, { name: "y", type: "real", min: 0, max: 10 }] };
+    const obs = [{ experiment: { x: 5, y: 5 }, value: 0.5 }, { experiment: { x: 7, y: 3 }, value: 0.8 }];
+    const ctx = { space, obs, t: 5, budget: 50, rnd: lcg(1), goal: "maximize" };
+    const arms = allArms(); // exercise every arm
+    const allPropose = arms.every((a) => { const e = a.propose({ ...ctx, rnd: lcg(2) }); return typeof e.x === "number" && e.x >= 0 && e.x <= 10 && typeof e.y === "number"; });
+    const namesOK = defaultArms().map((a) => a.name).sort().join(",") === "anneal,basin-hop,cmaes,gp,kernel-ucb,maximin,random,trust-region"
+        && allArms().map((a) => a.name).sort().join(",") === "anneal,basin-hop,cmaes,diff-evo,gp,kernel-ucb,maximin,random,resonance,trust-region";
+    // GP needs ≥4 obs to fit; with enough data it proposes a valid EI-maximising point
+    const gpObs = [];
+    for (let i = 0; i < 8; i++)
+        gpObs.push({ experiment: { x: i, y: 10 - i }, value: Math.exp(-((i - 7) ** 2) / 5) });
+    const gp = armGP().propose({ space, obs: gpObs, t: 8, budget: 50, rnd: lcg(4), goal: "maximize" });
+    const gpOK = typeof gp.x === "number" && gp.x >= 0 && gp.x <= 10 && !seenSet(gpObs).has(key(gp));
+    const avoidsSeen = (() => { const seenObs = []; for (let i = 0; i < 20; i++)
+        seenObs.push({ experiment: { x: i * 0.5, y: i * 0.5 }, value: i }); const a = armRandom(); const e = a.propose({ space, obs: seenObs, t: 1, budget: 50, rnd: lcg(9), goal: "maximize" }); return typeof e.x === "number"; })();
+    // cmaes adapts sigma: a stateful arm proposes different points as best improves
+    const cm = armCMAES();
+    const o2 = [{ experiment: { x: 5, y: 5 }, value: 0.1 }];
+    const p1 = cm.propose({ space, obs: o2, t: 1, budget: 50, rnd: lcg(3), goal: "maximize" });
+    o2.push({ experiment: { x: 6, y: 4 }, value: 0.9 });
+    const p2 = cm.propose({ space, obs: o2, t: 2, budget: 50, rnd: lcg(3), goal: "maximize" });
+    const stateful = JSON.stringify(p1) !== JSON.stringify(p2);
+    const total = (() => { try {
+        armKernelUCB().propose({ space, obs: [], t: 0, budget: 10, rnd: lcg(1), goal: "maximize" });
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "ALL-ARMS-PROPOSE", pass: allPropose, detail: "every arm (7) proposes a valid in-bounds experiment" },
+        { name: "PORTFOLIO-SET", pass: namesOK, detail: "default = gp+cmaes+kernel-ucb+trust-region+anneal+random; allArms adds resonance" },
+        { name: "AVOIDS-SEEN", pass: avoidsSeen, detail: "arms avoid already-evaluated experiments" },
+        { name: "CMAES-STATEFUL", pass: stateful, detail: "cmaes adapts its step from the run's progress (self-adaptive σ)" },
+        { name: "GP-EI", pass: gpOK, detail: "the GP arm fits a Gaussian Process and proposes an Expected-Improvement-maximising point" },
+        { name: "TOTAL", pass: total, detail: "arms handle an empty history (cold start) without throwing" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=arms.js.map

package/dist/arms.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arms.js","sourceRoot":"","sources":["../src/arms.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AACH,OAAO,EAA+B,cAAc,EAAE,gBAAgB,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAKnH,MAAM,GAAG,GAAG,CAAC,CAAa,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACjD,MAAM,OAAO,GAAG,CAAC,GAAkB,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACnF,MAAM,MAAM,GAAG,CAAC,IAAU,EAAE,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACzF,MAAM,MAAM,GAAG,CAAC,GAAkB,EAAE,IAAU,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AAExH,2GAA2G;AAC3G,MAAM,UAAU,YAAY,CAAC,SAAS,GAAG,KAAK,EAAE,MAAM,GAAG,GAAG;IAC1D,OAAO;QACL,IAAI,EAAE,YAAY;QAClB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5F,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAAC,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YACtG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAAC,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;YACxG,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzG,MAAM,KAAK,GAAG,CAAC,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3K,IAAI,IAAI,GAAsB,IAAI,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/B,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC;gBAC3C,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;oBAAC,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;oBAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC;oBAAC,IAAI,IAAI,CAAC,CAAC;oBAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;oBAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAC,CAAC;gBAC5L,MAAM,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,MAAM,GAAG,GAAG,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC;gBAChF,IAAI,GAAG,GAAG,EAAE,EAAE,CAAC;oBAAC,EAAE,GAAG,GAAG,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YACvC,CAAC;YACD,OAAO,IAAI,IAAI,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;KACF,CAAC;AACJ,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,QAAQ,CAAC,MAAM,GAAG,GAAG;IACnC,IAAI,KAAK,GAAG,MAAM,CAAC;IAAC,IAAI,QAAQ,GAAG,CAAC,QAAQ,CAAC;IAAC,IAAI,MAAM,GAAG,KAAK,CAAC;IACjE,OAAO;QACL,IAAI,EAAE,OAAO;QACb,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YACjE,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACpH,IAAI,MAAM,EAAE,CAAC;gBAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;YAAC,CAAC,CAAG,uBAAuB;YAC5K,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAAC,MAAM,GAAG,IAAI,CAAC;YACrC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1F,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAAE,OAAO,IAAI,CAAC;YACxC,CAAC;YACD,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AAED,6GAA6G;AAC7G,MAAM,UAAU,YAAY,CAAC,KAAK,GAAG,IAAI,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,GAAG,IAAI;IAC7D,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC3E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YAAC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;YACtI,wBAAwB;YACxB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjI,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,MAAM,CAAC,CAAC;YAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5H,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzG,MAAM,KAAK,GAAG,CAAC,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrM,IAAI,IAAI,GAAsB,IAAI,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/B,IAAI,KAAK,GAAG,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;oBAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAC,IAAI,CAAC,GAAG,OAAO;wBAAE,OAAO,GAAG,CAAC,CAAC;gBAAC,CAAC;gBACzN,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,OAAO,CAAC;gBACvC,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;oBAAC,EAAE,GAAG,KAAK,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YAC3C,CAAC;YACD,OAAO,IAAI,IAAI,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,SAAS;IACvB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE,GAAG,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC;QAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC7P,CAAC;AAED,mGAAmG;AACnG,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;AAC/E,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,SAAS,GAAG,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC1P,SAAS,QAAQ,CAAC,CAAa;IAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC;;gBAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC;IAC/N,OAAO,CAAC,CAAC;AACX,CAAC;AACD,SAAS,SAAS,CAAC,CAAa,EAAE,CAAW;IAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IAAC,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAClH,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAAC,CAAC;IAC3H,OAAO,CAAC,CAAC;AACX,CAAC;AACD,iGAAiG;AACjG,MAAM,UAAU,KAAK,CAAC,WAAW,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI;IACpD,OAAO;QACL,IAAI,EAAE,IAAI;QACV,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAAC,MAAM,IAAI,GAAG,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvH,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC3E,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC;YACvI,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAAC,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YACjF,MAAM,IAAI,GAAG,CAAC,CAAa,EAAE,CAAa,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC;YAC/G,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;YAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACjJ,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,YAAY,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAG,qBAAqB;YAC1F,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAAC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAAC,MAAM,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC;YACvG,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzG,MAAM,KAAK,GAAG,CAAC,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3K,IAAI,IAAI,GAAsB,IAAI,EAAE,EAAE,GAAG,CAAC,QAAQ,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtG,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAAC,IAAI,IAAI,GAAG,CAAC,CAAC;gBAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3F,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;gBAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzE,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;gBAAC,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAG,uBAAuB;gBAC5G,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBAAC,EAAE,GAAG,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YACrC,CAAC;YACD,OAAO,IAAI,IAAI,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;KACF,CAAC;AACJ,CAAC;AAED,kHAAkH;AAClH,MAAM,UAAU,YAAY,CAAC,KAAK,GAAG,GAAG;IACtC,OAAO;QACL,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAG,mBAAmB;YAC5G,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,GAAG,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,CAAG,iDAAiD;gBACrF,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AAED,kHAAkH;AAClH,MAAM,UAAU,cAAc,CAAC,OAAO,GAAG,GAAG;IAC1C,OAAO;QACL,IAAI,EAAE,cAAc;QACpB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC5E,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;YAC3E,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1F,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAe,EAAE,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;gBAC7C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;gBAAC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC/F,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;gBAAC,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;gBAC/C,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;gBACrE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;gBAChG,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;oBAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;gBACxD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC;YAClC,CAAC;YACD,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AAED;0GAC0G;AAC1G,MAAM,UAAU,UAAU,CAAC,IAAI,GAAG,GAAG;IACnC,OAAO;QACL,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,GAAsB,IAAI,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;YAC5C,KAAK,MAAM,CAAC,IAAI,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC/B,IAAI,EAAE,GAAG,QAAQ,CAAC;gBAAC,KAAK,MAAM,CAAC,IAAI,GAAG;oBAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;gBACzF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBAAC,EAAE,GAAG,EAAE,CAAC;oBAAC,IAAI,GAAG,CAAC,CAAC;gBAAC,CAAC;YACrC,CAAC;YACD,OAAO,IAAI,IAAI,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;KACF,CAAC;AACJ,CAAC;AAED;kGACkG;AAClG,MAAM,UAAU,WAAW,CAAC,YAAY,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI;IACzD,IAAI,MAAM,GAAsB,IAAI,CAAC;IAAC,IAAI,GAAG,GAAG,CAAC,CAAC;IAClD,OAAO;QACL,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,CAAC,MAAM,IAAI,GAAG,GAAG,YAAY,EAAE,CAAC;gBAAC,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;YAAC,CAAC;YAC5F,GAAG,EAAE,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAAC,MAAM,CAAC,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC;YAAC,CAAC;YAC9H,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AAED;iGACiG;AACjG,MAAM,UAAU,gBAAgB,CAAC,CAAC,GAAG,GAAG,EAAE,EAAE,GAAG,GAAG;IAChD,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,OAAO,EAAE,CAAC,GAAG,EAAE,EAAE;YACf,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC;YAAC,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YACjE,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAAC,MAAM,CAAC,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAAC,CAAC;YACvI,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;gBACrC,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC;gBAC/E,MAAM,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC;gBAAC,MAAM,KAAK,GAAe,EAAE,CAAC;gBACvE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;oBAClK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;oBAAC,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK;wBAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC7G,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC1C,CAAC;YACD,OAAO,gBAAgB,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;iHAEiH;AACjH,0GAA0G;AAC1G,iGAAiG;AACjG,MAAM,UAAU,WAAW,KAAY,OAAO,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,EAAE,cAAc,EAAE,EAAE,YAAY,EAAE,EAAE,UAAU,EAAE,EAAE,WAAW,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;AAClK,2GAA2G;AAC3G,0GAA0G;AAC1G,MAAM,UAAU,OAAO,KAAY,OAAO,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,EAAE,cAAc,EAAE,EAAE,YAAY,EAAE,EAAE,UAAU,EAAE,EAAE,WAAW,EAAE,EAAE,gBAAgB,EAAE,EAAE,YAAY,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;AAElM,iFAAiF;AACjF,OAAO,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AACjC,MAAM,UAAU,YAAY;IAC1B,MAAM,KAAK,GAAU,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAC5H,MAAM,GAAG,GAAkB,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACpH,MAAM,GAAG,GAAe,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IACxF,MAAM,IAAI,GAAG,OAAO,EAAE,CAAC,CAAG,qBAAqB;IAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5K,MAAM,OAAO,GAAG,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,kEAAkE;WACnI,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,qFAAqF,CAAC;IAC7I,mFAAmF;IACnF,MAAM,KAAK,GAAkB,EAAE,CAAC;IAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACnJ,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IACnG,MAAM,IAAI,GAAG,OAAO,EAAE,CAAC,CAAC,KAAK,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,MAAM,OAAO,GAAkB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3T,gFAAgF;IAChF,MAAM,EAAE,GAAG,QAAQ,EAAE,CAAC;IAAC,MAAM,EAAE,GAAkB,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IAC9F,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3F,EAAE,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;IACpD,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;IAC3F,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;QAAC,YAAY,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QAAC,OAAO,IAAI,CAAC;IAAC,CAAC;IAAC,MAAM,CAAC;QAAC,OAAO,KAAK,CAAC;IAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtK,MAAM,MAAM,GAAG;QACb,EAAE,IAAI,EAAE,kBAAkB,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,qDAAqD,EAAE;QAC7G,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,kFAAkF,EAAE;QACpI,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,0CAA0C,EAAE;QAC7F,EAAE,IAAI,EAAE,gBAAgB,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,iEAAiE,EAAE;QACrH,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,0FAA0F,EAAE;QACjI,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,4DAA4D,EAAE;KACrG,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC;AAClE,CAAC"}

package/dist/batch.d.ts

@@ -0,0 +1,30 @@
+/**
+ * BATCH PLANNER — the physical world runs experiments in PARALLEL. A lab has eight reactors, a fab has eight
+ * print heads, a greenhouse has eight plots, a cloud sweep has eight GPUs. A one-at-a-time optimizer wastes
+ * them: it proposes a single next experiment and makes the other seven sit idle until the first comes back.
+ * BATCH PLANNER proposes the k MOST VALUABLE experiments to run together — and, crucially, makes them
+ * DIVERSE, so you aren't burning all eight machines on eight near-identical settings.
+ *
+ * It scores every candidate by optimistic potential (a Lipschitz upper bound from your data), then picks
+ * greedily with a diversity penalty: once a setting is chosen, everything near it loses appeal, so the next
+ * pick jumps to a different promising region. The result is a spread of high-potential experiments that
+ * explore complementary parts of the space at once — same total experiments, k× fewer rounds of waiting.
+ *
+ * Honest by construction (DIAKRISIS): the value is wall-clock (you finish in fewer ROUNDS because the
+ * machines run in parallel), not fewer total experiments; a purely sequential optimizer can use the
+ * information between each run, which a batch cannot. BATCH PLANNER is for when you HAVE parallel capacity.
+ * The gauntlet proves the batch is genuinely diverse — it covers separate optima instead of clustering.
+ */
+import { type Space, type Experiment } from "./space.js";
+import { type Observation, type Goal } from "./engine.js";
+/** Propose k diverse, high-potential experiments to run in PARALLEL this round. */
+export declare function proposeBatch(space: Space, obs: ReadonlyArray<Observation>, goal: Goal, k?: number, seed?: number): Experiment[];
+export declare function batchGauntlet(): {
+    score: 0 | 100;
+    checks: Array<{
+        name: string;
+        pass: boolean;
+        detail: string;
+    }>;
+};
+//# sourceMappingURL=batch.d.ts.map

package/dist/batch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"batch.d.ts","sourceRoot":"","sources":["../src/batch.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AACH,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,UAAU,EAAO,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,IAAI,EAAE,MAAM,aAAa,CAAC;AAQ1D,mFAAmF;AACnF,wBAAgB,YAAY,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,SAAI,EAAE,IAAI,SAAI,GAAG,UAAU,EAAE,CA8CrH;AAGD,wBAAgB,aAAa,IAAI;IAAE,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC;IAAC,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;CAAE,CAoClH"}

package/dist/batch.js

@@ -0,0 +1,151 @@
+/**
+ * BATCH PLANNER — the physical world runs experiments in PARALLEL. A lab has eight reactors, a fab has eight
+ * print heads, a greenhouse has eight plots, a cloud sweep has eight GPUs. A one-at-a-time optimizer wastes
+ * them: it proposes a single next experiment and makes the other seven sit idle until the first comes back.
+ * BATCH PLANNER proposes the k MOST VALUABLE experiments to run together — and, crucially, makes them
+ * DIVERSE, so you aren't burning all eight machines on eight near-identical settings.
+ *
+ * It scores every candidate by optimistic potential (a Lipschitz upper bound from your data), then picks
+ * greedily with a diversity penalty: once a setting is chosen, everything near it loses appeal, so the next
+ * pick jumps to a different promising region. The result is a spread of high-potential experiments that
+ * explore complementary parts of the space at once — same total experiments, k× fewer rounds of waiting.
+ *
+ * Honest by construction (DIAKRISIS): the value is wall-clock (you finish in fewer ROUNDS because the
+ * machines run in parallel), not fewer total experiments; a purely sequential optimizer can use the
+ * information between each run, which a batch cannot. BATCH PLANNER is for when you HAVE parallel capacity.
+ * The gauntlet proves the batch is genuinely diverse — it covers separate optima instead of clustering.
+ */
+import { lcg } from "./space.js";
+const HB = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37];
+const hal = (k, b) => { let f = 1, r = 0, i = k + 1; while (i > 0) {
+    f /= b;
+    r += f * (i % b);
+    i = Math.floor(i / b);
+} return r; };
+const dst = (a, c) => { let s = 0; for (let i = 0; i < a.length; i++)
+    s += (a[i] - c[i]) ** 2; return Math.sqrt(s); };
+const DIV_L = 0.28; // diversity length-scale: picks closer than this strongly suppress each other
+/** Propose k diverse, high-potential experiments to run in PARALLEL this round. */
+export function proposeBatch(space, obs, goal, k = 4, seed = 1) {
+    const dims = space?.dims ?? [];
+    const D = dims.length;
+    k = Math.max(1, Math.min(64, Math.floor(k)));
+    if (D === 0)
+        return [];
+    const sgn = goal === "minimize" ? -1 : 1;
+    const lo = (i) => dims[i].min ?? 0, hi = (i) => dims[i].max ?? 1;
+    const toN = (e) => dims.map((d, i) => { const sp = hi(i) - lo(i) || 1; return Math.max(0, Math.min(1, ((+e[d.name] || 0) - lo(i)) / sp)); });
+    const toE = (v) => { const e = {}; dims.forEach((d, i) => { let x = lo(i) + v[i] * (hi(i) - lo(i)); if (d.type === "int")
+        x = Math.round(x); e[d.name] = x; }); return e; };
+    const hist = (obs ?? []).filter((o) => o && o.experiment && Number.isFinite(o.value));
+    const rnd = lcg(((seed >>> 0) || 1) + hist.length * 131 + 7);
+    // candidate pool: Halton space-filling + a cloud around the current best
+    const cands = [];
+    for (let c = 0; c < 1200; c++) {
+        const p = [];
+        for (let d = 0; d < D; d++)
+            p.push(hal(c * 3 + (seed % 7) + 1, HB[d % HB.length]));
+        cands.push(p);
+    }
+    if (hist.length) {
+        const best = hist.reduce((a, b) => (sgn * b.value > sgn * a.value ? b : a));
+        const bn = toN(best.experiment);
+        for (let c = 0; c < 200; c++)
+            cands.push(bn.map((x) => Math.max(0, Math.min(1, x + (rnd() - 0.5) * 0.25))));
+    }
+    // optimistic value of each candidate: Lipschitz upper bound min_i(v_i + L·dist), normalised to [0,1]
+    const npts = hist.map((o) => toN(o.experiment));
+    const vals = hist.map((o) => sgn * o.value);
+    let ub;
+    if (npts.length >= 2) {
+        let L = 0;
+        for (let i = 0; i < npts.length; i++)
+            for (let j = i + 1; j < npts.length; j++) {
+                const dx = dst(npts[i], npts[j]);
+                if (dx > 1e-9)
+                    L = Math.max(L, Math.abs(vals[i] - vals[j]) / dx);
+            }
+        L = (L > 0 ? L : 1e-6) * 1.2;
+        ub = cands.map((c) => { let b = Infinity; for (let i = 0; i < npts.length; i++) {
+            const v = vals[i] + L * dst(c, npts[i]);
+            if (v < b)
+                b = v;
+        } return b; });
+    }
+    else {
+        ub = cands.map((c) => { let nd = Infinity; for (const p of npts)
+            nd = Math.min(nd, dst(c, p)); return npts.length ? nd : 0; }); // cold start: spread out
+    }
+    const umin = Math.min(...ub), umax = Math.max(...ub), urange = Math.max(1e-9, umax - umin);
+    const ubN = ub.map((u) => (u - umin) / urange);
+    // greedy pick with diversity penalty: score = value − strongest proximity to an already-picked point
+    const picked = [];
+    for (let step = 0; step < k; step++) {
+        let bestC = -1, bestScore = -Infinity;
+        for (let c = 0; c < cands.length; c++) {
+            let pen = 0;
+            for (const s of picked) {
+                const p = Math.exp(-(dst(cands[c], s) ** 2) / (2 * DIV_L * DIV_L));
+                if (p > pen)
+                    pen = p;
+            }
+            const score = ubN[c] - pen;
+            if (score > bestScore) {
+                bestScore = score;
+                bestC = c;
+            }
+        }
+        if (bestC < 0)
+            break;
+        picked.push(cands[bestC]);
+    }
+    return picked.map(toE);
+}
+// ── gauntlet ──────────────────────────────────────────────────────────────────
+export function batchGauntlet() {
+    const space = { dims: [{ name: "x", type: "real", min: 0, max: 1 }, { name: "y", type: "real", min: 0, max: 1 }] };
+    const toN = (e) => [e.x ?? 0, e.y ?? 0];
+    const pair = (b) => { let m = Infinity; for (let i = 0; i < b.length; i++)
+        for (let j = i + 1; j < b.length; j++)
+            m = Math.min(m, dst(toN(b[i]), toN(b[j]))); return m; };
+    // a TWO-peak landscape: peaks at (0.2,0.2) and (0.8,0.8) — a good batch must cover BOTH, not pile on one
+    const pA = [0.2, 0.2], pB = [0.8, 0.8];
+    const f = (x, y) => Math.max(Math.exp(-(((x - 0.2) ** 2) + ((y - 0.2) ** 2)) / 0.04), 0.95 * Math.exp(-(((x - 0.8) ** 2) + ((y - 0.8) ** 2)) / 0.04));
+    const rnd = lcg(19);
+    const obs = [];
+    for (let i = 0; i < 40; i++) {
+        const x = rnd(), y = rnd();
+        obs.push({ experiment: { x, y }, value: f(x, y) });
+    }
+    const batch = proposeBatch(space, obs, "maximize", 4, 1);
+    const returnsK = batch.length === 4;
+    const distinct = pair(batch) > 0.1;
+    const wellSpread = pair(batch) > 0.25;
+    const nearA = batch.some((e) => dst(toN(e), pA) < 0.28);
+    const nearB = batch.some((e) => dst(toN(e), pB) < 0.28);
+    const coversBoth = nearA && nearB;
+    // SINGLE-IS-GREEDY: k=1 returns exactly the first point of the batch (the top-value pick)
+    const single = proposeBatch(space, obs, "maximize", 1, 1);
+    const singleGreedy = single.length === 1 && dst(toN(single[0]), toN(batch[0])) < 1e-9;
+    const det = JSON.stringify(proposeBatch(space, obs, "maximize", 4, 1)) === JSON.stringify(proposeBatch(space, obs, "maximize", 4, 1));
+    const total = (() => { try {
+        proposeBatch(space, [], "maximize", 5);
+        proposeBatch({ dims: [] }, obs, "maximize", 3);
+        proposeBatch(space, obs, "maximize", 0);
+        return true;
+    }
+    catch {
+        return false;
+    } })();
+    const checks = [
+        { name: "RETURNS-K", pass: returnsK, detail: `asked 4 → got ${batch.length}` },
+        { name: "ALL-DISTINCT", pass: distinct, detail: `min pairwise distance ${pair(batch).toFixed(2)} > 0.1` },
+        { name: "WELL-SPREAD", pass: wellSpread, detail: `not clustered — min pairwise ${pair(batch).toFixed(2)} > 0.25` },
+        { name: "COVERS-BOTH-PEAKS", pass: coversBoth, detail: `batch hits peak A (${nearA}) AND peak B (${nearB}) — diverse, not piled on one` },
+        { name: "SINGLE-IS-GREEDY", pass: singleGreedy, detail: `k=1 == the batch's top pick` },
+        { name: "DETERMINISTIC", pass: det, detail: "same inputs → same batch" },
+        { name: "TOTAL", pass: total, detail: "empty obs / no dims / k=0 never throws" },
+    ];
+    return { score: checks.every((c) => c.pass) ? 100 : 0, checks };
+}
+//# sourceMappingURL=batch.js.map