@stevenvo780/st-lang 4.7.0 → 4.9.0

package/dist/reasoning/probabilistic/inference.js

@@ -0,0 +1,579 @@
+"use strict";
+// ============================================================
+// Probabilistic Programming — Inference engines
+// ============================================================
+//
+// Cuatro backends:
+//
+//   1. `enumerate`         — enumeración exacta para programas con
+//                            soporte discreto finito. Recorre el
+//                            árbol de ramificaciones, multiplica
+//                            probabilidades y agrega por valor de
+//                            retorno. Exacto, costo O(|soporte|).
+//   2. `rejectionSample`   — muestreo simple del prior; descarta
+//                            trazas con `observe(false)`. Sesgo 0,
+//                            varianza alta si la aceptación es baja.
+//   3. `importanceSample`  — muestreo del prior con pesos
+//                            log-acumulados; usa `factor()` y el
+//                            log-pdf de las observes "soft" como
+//                            log-weight. Reporta ESS para diagnóstico.
+//   4. `metropolisHastings` — single-site MCMC: re-muestrea uno de
+//                            los sample sites por iteración y acepta
+//                            según ratio de pesos. Devuelve cadena
+//                            tras burn-in y thinning.
+//
+// Todos usan el mismo `PProgram<T>` y el mismo `Sampler` interface.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.enumerate = enumerate;
+exports.rejectionSample = rejectionSample;
+exports.importanceSample = importanceSample;
+exports.metropolisHastings = metropolisHastings;
+const distributions_1 = require("./distributions");
+// ── Helpers de resumen ───────────────────────────────────────
+/**
+ * Determina si todos los samples son numéricos (incluyendo booleanos,
+ * que se interpretan como 0/1). Solo entonces tiene sentido calcular
+ * media/std/quantiles continuos.
+ */
+function allNumericLike(samples) {
+    if (samples.length === 0)
+        return false;
+    for (const s of samples) {
+        if (typeof s !== 'number' && typeof s !== 'boolean')
+            return false;
+    }
+    return true;
+}
+function toNumber(v) {
+    if (typeof v === 'boolean')
+        return v ? 1 : 0;
+    return v;
+}
+/**
+ * Histograma por igualdad estructural. Para tipos primitivos usa
+ * `Map.set(value, count + 1)`. Para objetos/arrays usa JSON.stringify
+ * como clave canónica — suficiente para los casos típicos de tests.
+ */
+function buildHistogram(samples, weights) {
+    const hist = new Map();
+    // Para objetos, normalizamos via JSON; mantenemos un map de
+    // clave canónica → valor original para devolver el objeto real.
+    const canonicalToValue = new Map();
+    const isObjectLike = (v) => v !== null && (typeof v === 'object' || Array.isArray(v));
+    let totalW = 0;
+    for (let i = 0; i < samples.length; i++) {
+        const w = weights ? (weights[i] ?? 0) : 1;
+        totalW += w;
+    }
+    if (totalW <= 0)
+        return hist;
+    for (let i = 0; i < samples.length; i++) {
+        const s = samples[i];
+        const w = (weights ? (weights[i] ?? 0) : 1) / totalW;
+        if (isObjectLike(s)) {
+            const key = JSON.stringify(s);
+            if (!canonicalToValue.has(key))
+                canonicalToValue.set(key, s);
+            const canonical = canonicalToValue.get(key);
+            hist.set(canonical, (hist.get(canonical) ?? 0) + w);
+        }
+        else {
+            hist.set(s, (hist.get(s) ?? 0) + w);
+        }
+    }
+    return hist;
+}
+function computeQuantiles(sorted, qs) {
+    const out = {};
+    if (sorted.length === 0)
+        return out;
+    for (const q of qs) {
+        const idx = Math.min(sorted.length - 1, Math.max(0, Math.floor(q * (sorted.length - 1))));
+        out[q] = sorted[idx];
+    }
+    return out;
+}
+function summarize(samples, opts = {}) {
+    const histogram = buildHistogram(samples, opts.weights);
+    const summary = { samples, histogram };
+    if (opts.ess !== undefined)
+        summary.ess = opts.ess;
+    if (opts.accepted !== undefined) {
+        summary.numAccepted = opts.accepted;
+        if (opts.total !== undefined && opts.total > 0) {
+            summary.acceptanceRate = opts.accepted / opts.total;
+        }
+    }
+    if (opts.total !== undefined)
+        summary.totalAttempts = opts.total;
+    if (allNumericLike(samples)) {
+        const nums = samples.map(toNumber);
+        const weights = opts.weights;
+        let sumW = 0;
+        if (weights) {
+            for (let i = 0; i < nums.length; i++)
+                sumW += weights[i] ?? 0;
+        }
+        if (weights && sumW > 0) {
+            let mean = 0;
+            for (let i = 0; i < nums.length; i++) {
+                mean += (nums[i] ?? 0) * ((weights[i] ?? 0) / sumW);
+            }
+            let varSum = 0;
+            for (let i = 0; i < nums.length; i++) {
+                const d = (nums[i] ?? 0) - mean;
+                varSum += d * d * ((weights[i] ?? 0) / sumW);
+            }
+            summary.mean = mean;
+            summary.std = Math.sqrt(varSum);
+        }
+        else {
+            const mean = nums.reduce((s, x) => s + x, 0) / nums.length;
+            const variance = nums.reduce((s, x) => s + (x - mean) * (x - mean), 0) / Math.max(1, nums.length - 1);
+            summary.mean = mean;
+            summary.std = Math.sqrt(variance);
+        }
+        const sorted = nums.slice().sort((a, b) => a - b);
+        summary.quantiles = computeQuantiles(sorted, [0.025, 0.5, 0.975]);
+    }
+    return summary;
+}
+/**
+ * Enumera todas las trayectorias del programa, multiplicando la
+ * probabilidad de cada decisión discreta y descartando ramas con
+ * `observe(false)`. Soporta `factor(logW)` agregando exp(logW) al
+ * peso. No soporta distribuciones continuas (uniform, normal) ni
+ * `poisson` — lanza error si las encuentra.
+ *
+ * `maxStates` protege de explosión combinatoria: corta la
+ * enumeración cuando el número de ramas pendientes la supera.
+ */
+function enumerate(program, maxStates = 100_000) {
+    // Empezamos con una sola rama vacía (peso 1).
+    let frontier = [{ choices: [], weight: 1 }];
+    const completed = [];
+    let safetyCounter = 0;
+    while (frontier.length > 0) {
+        safetyCounter += frontier.length;
+        if (safetyCounter > maxStates) {
+            throw new Error(`enumerate: superado el límite de ${maxStates} estados; ` +
+                'usá rejection/importance/MH para soporte grande.');
+        }
+        const nextFrontier = [];
+        for (const path of frontier) {
+            const state = {
+                choices: path.choices,
+                weight: path.weight,
+                cursor: 0,
+            };
+            const result = runEnumPath(program, state, nextFrontier);
+            if (result !== undefined) {
+                completed.push({ value: result.value, weight: result.weight });
+            }
+        }
+        frontier = nextFrontier;
+    }
+    // Normalizar y montar samples + weights.
+    let total = 0;
+    for (const c of completed)
+        total += c.weight;
+    if (total <= 0) {
+        // Toda la masa fue descartada por observes.
+        return {
+            samples: [],
+            histogram: new Map(),
+        };
+    }
+    const samples = completed.map((c) => c.value);
+    const weights = completed.map((c) => c.weight / total);
+    return summarize(samples, { weights });
+}
+/**
+ * Ejecuta el programa siguiendo una ruta de decisiones pre-elegidas.
+ * Cuando el programa pide un `sample` y la ruta ya no tiene más
+ * decisiones, ramifica: empuja TODAS las posibles continuaciones
+ * al frontier y aborta la ejecución actual con `_BRANCH`.
+ *
+ * Devuelve `{value, weight}` si la ruta terminó exitosamente, o
+ * `undefined` si fue descartada (observe falso, factor -inf, o
+ * ramificó hacia el frontier).
+ */
+function runEnumPath(program, state, frontier) {
+    // Excepciones internas para señalizar (a) que la ruta debe
+    // ramificarse al frontier sin continuar la ejecución, y (b) que
+    // la traza es inconsistente (observe falso o factor -inf).
+    class BranchException extends Error {
+        constructor() {
+            super('branch');
+            this.name = 'BranchException';
+        }
+    }
+    class RejectException extends Error {
+        constructor() {
+            super('reject');
+            this.name = 'RejectException';
+        }
+    }
+    const sampler = {
+        sample(dist) {
+            if (state.cursor < state.choices.length) {
+                const v = state.choices[state.cursor];
+                state.cursor += 1;
+                return v;
+            }
+            // Ramificar: agregar todos los valores del soporte al frontier.
+            const support = (0, distributions_1.enumerateSupport)(dist);
+            for (const [value, p] of support) {
+                if (p <= 0)
+                    continue;
+                frontier.push({
+                    choices: [...state.choices, value],
+                    weight: state.weight * p,
+                });
+            }
+            throw new BranchException();
+        },
+        observe(condition) {
+            if (!condition)
+                throw new RejectException();
+        },
+        factor(logWeight) {
+            if (logWeight === -Infinity)
+                throw new RejectException();
+            state.weight *= Math.exp(logWeight);
+        },
+    };
+    try {
+        const value = program(sampler);
+        return { value, weight: state.weight };
+    }
+    catch (err) {
+        if (err instanceof BranchException)
+            return undefined;
+        if (err instanceof RejectException)
+            return undefined;
+        throw err;
+    }
+}
+// ── 2. Rejection sampling ────────────────────────────────────
+/**
+ * Muestrea N trazas del prior; cualquier traza con `observe(false)`
+ * o `factor(-Infinity)` se descarta y se reintenta.
+ *
+ * `factor(logW)` con `logW < 0` se trata como aceptación
+ * probabilística: con prob `exp(logW)` la traza se acepta, en
+ * caso contrario se descarta. `logW > 0` es legal pero raro;
+ * se acepta siempre (rejection no maneja pesos > 1).
+ */
+function rejectionSample(program, opts = {}) {
+    const numSamples = opts.numSamples ?? 1000;
+    const maxAttempts = opts.maxAttempts ?? numSamples * 100;
+    const rng = opts.rng ?? Math.random;
+    const samples = [];
+    let attempts = 0;
+    while (samples.length < numSamples) {
+        attempts += 1;
+        if (attempts > maxAttempts) {
+            throw new Error(`rejection: ${attempts} intentos para ${samples.length}/${numSamples} muestras; ` +
+                'el observe es demasiado restrictivo. Probá importance/MH.');
+        }
+        const result = runOneRejection(program, rng);
+        if (result !== undefined)
+            samples.push(result);
+    }
+    return summarize(samples, { total: attempts });
+}
+class RejectError extends Error {
+    constructor() {
+        super('reject');
+        this.name = 'RejectError';
+    }
+}
+function runOneRejection(program, rng) {
+    const sampler = {
+        sample(dist) {
+            return (0, distributions_1.sampleFrom)(dist, rng);
+        },
+        observe(condition) {
+            if (!condition)
+                throw new RejectError();
+        },
+        factor(logWeight) {
+            if (logWeight >= 0)
+                return;
+            if (logWeight === -Infinity || rng() >= Math.exp(logWeight)) {
+                throw new RejectError();
+            }
+        },
+    };
+    try {
+        return program(sampler);
+    }
+    catch (err) {
+        if (err instanceof RejectError)
+            return undefined;
+        throw err;
+    }
+}
+// ── 3. Importance sampling ───────────────────────────────────
+/**
+ * Muestrea trazas del prior y acumula log-pesos de `observe`
+ * (treated as -Infinity si false, 0 si true) y `factor`. Devuelve
+ * los samples + sus pesos normalizados; el histograma y mean/std
+ * reflejan estos pesos.
+ *
+ * Reporta ESS = (Σwᵢ)² / Σwᵢ² como diagnóstico de degeneración.
+ */
+function importanceSample(program, opts = {}) {
+    const numSamples = opts.numSamples ?? 1000;
+    const rng = opts.rng ?? Math.random;
+    const samples = [];
+    const logWeights = [];
+    for (let i = 0; i < numSamples; i++) {
+        const result = runOneImportance(program, rng);
+        if (result !== undefined) {
+            samples.push(result.value);
+            logWeights.push(result.logWeight);
+        }
+    }
+    if (samples.length === 0) {
+        throw new Error('importance: 0 samples válidos; revisá las observes.');
+    }
+    // Normalizar log-weights (estable numéricamente: restar el máximo).
+    const maxLW = Math.max(...logWeights);
+    let totalW = 0;
+    const expWeights = logWeights.map((lw) => {
+        const w = Math.exp(lw - maxLW);
+        totalW += w;
+        return w;
+    });
+    const weights = expWeights.map((w) => w / totalW);
+    // ESS = (Σwᵢ)² / Σwᵢ² con weights ya normalizados ⇒ 1 / Σwᵢ².
+    let sumSq = 0;
+    for (const w of weights)
+        sumSq += w * w;
+    const ess = sumSq > 0 ? 1 / sumSq : 0;
+    return summarize(samples, { weights, ess, total: numSamples });
+}
+function runOneImportance(program, rng) {
+    let logWeight = 0;
+    let rejected = false;
+    const sampler = {
+        sample(dist) {
+            return (0, distributions_1.sampleFrom)(dist, rng);
+        },
+        observe(condition) {
+            if (!condition) {
+                rejected = true;
+                logWeight = -Infinity;
+            }
+        },
+        factor(logW) {
+            logWeight += logW;
+        },
+    };
+    const value = program(sampler);
+    if (rejected || !Number.isFinite(logWeight))
+        return undefined;
+    return { value, logWeight };
+}
+/**
+ * MCMC Metropolis-Hastings sobre el espacio de trazas del programa.
+ *
+ * Convenciones:
+ *   - `burnIn` itera sin contar (default 1000).
+ *   - `thin` toma 1 de cada N (default 1).
+ *   - Single-site: en cada iteración, re-muestrea UN sample site
+ *     (elegido uniforme) y re-ejecuta. Si el número de sample sites
+ *     cambia entre trazas, igual funciona (re-ejecutamos forzando
+ *     el valor anterior en los sites que coinciden).
+ *   - Reporta `acceptanceRate` para diagnóstico.
+ */
+function metropolisHastings(program, opts = {}) {
+    const numSamples = opts.numSamples ?? 1000;
+    const burnIn = opts.burnIn ?? 1000;
+    const thin = opts.thin ?? 1;
+    const rng = opts.rng ?? Math.random;
+    // Trace inicial: ejecutamos hasta encontrar uno con peso finito.
+    let current = runFresh(program, rng);
+    let attempts = 0;
+    while (!Number.isFinite(current.logWeight) || current.rejected) {
+        attempts += 1;
+        if (attempts > 10_000) {
+            throw new Error('MH: no se encontró traza inicial con peso finito en 10k intentos; ' +
+                'el observe podría ser inalcanzable.');
+        }
+        current = runFresh(program, rng);
+    }
+    const totalIters = burnIn + numSamples * thin;
+    const samples = [];
+    let accepted = 0;
+    let totalProposals = 0;
+    for (let i = 0; i < totalIters; i++) {
+        if (current.sites.length === 0) {
+            // Programa sin samples: no hay nada que proponer. Solo
+            // re-evaluamos (debería ser determinista módulo factor).
+            const fresh = runFresh(program, rng);
+            if (Number.isFinite(fresh.logWeight) && !fresh.rejected)
+                current = fresh;
+        }
+        else {
+            totalProposals += 1;
+            const siteIdx = Math.floor(rng() * current.sites.length);
+            const site = current.sites[siteIdx];
+            if (!site)
+                continue;
+            // Proposal: re-muestrear desde la distribución del site.
+            const newValue = (0, distributions_1.sampleFrom)(site.dist, rng);
+            // Re-ejecutar el programa forzando: en `siteIdx` el valor
+            // nuevo, en los demás sites el valor anterior (si coincide
+            // la distribución). Si la estructura cambia (forks), seguimos
+            // muestreando de prior para los sites nuevos.
+            const proposal = runWithReplay(program, current, siteIdx, newValue, rng);
+            if (proposal.rejected || !Number.isFinite(proposal.logWeight)) {
+                // proposal con peso 0: rechazo automático.
+                continue;
+            }
+            // Acceptance ratio: π(x') q(x | x') / (π(x) q(x' | x)).
+            // Con single-site proposal del prior, q(x'|x) = p(site_new) y
+            // q(x|x') = p(site_old). Esos se cancelan con los priors de
+            // logWeight (que NO incluimos: usamos sólo observes+factors
+            // y los priors de los SITES NO MODIFICADOS se cancelan).
+            // Implementación pragmática: log-ratio = newLW - oldLW.
+            const logRatio = proposal.logWeight - current.logWeight;
+            const u = rng();
+            if (Math.log(u) < logRatio) {
+                current = proposal;
+                accepted += 1;
+            }
+        }
+        if (i >= burnIn && (i - burnIn) % thin === 0) {
+            samples.push(current.value);
+        }
+    }
+    return summarize(samples, {
+        accepted,
+        total: totalProposals,
+    });
+}
+/**
+ * Ejecuta el programa sampleando del prior (sin replay), grabando
+ * cada sample para construir una `Trace`.
+ */
+function runFresh(program, rng) {
+    const sites = [];
+    let logWeight = 0;
+    let rejected = false;
+    const sampler = {
+        sample(dist) {
+            const value = (0, distributions_1.sampleFrom)(dist, rng);
+            sites.push({ dist: dist, value });
+            // Incluimos log-prior en logWeight para que el ratio MH cierre.
+            logWeight += (0, distributions_1.logPdf)(dist, value);
+            return value;
+        },
+        observe(condition) {
+            if (!condition) {
+                rejected = true;
+                logWeight = -Infinity;
+            }
+        },
+        factor(logW) {
+            logWeight += logW;
+        },
+    };
+    const value = program(sampler);
+    return { sites, logWeight, value, rejected };
+}
+/**
+ * Re-ejecuta el programa "replayendo" la traza previa, pero
+ * forzando un nuevo valor en el sample site `replaceIdx`. Los
+ * sites posteriores se intentan replayear con su valor anterior;
+ * si el programa cambia su estructura (toma otra rama), los sites
+ * extra se muestrean del prior.
+ */
+function runWithReplay(program, previous, replaceIdx, newValue, rng) {
+    const sites = [];
+    let logWeight = 0;
+    let rejected = false;
+    let cursor = 0;
+    const sampler = {
+        sample(dist) {
+            const idx = cursor;
+            cursor += 1;
+            let value;
+            if (idx === replaceIdx) {
+                value = newValue;
+            }
+            else {
+                const prev = previous.sites[idx];
+                // Reusar si misma distribución (kind igual y parámetros iguales).
+                if (prev && distEquals(prev.dist, dist)) {
+                    value = prev.value;
+                }
+                else {
+                    value = (0, distributions_1.sampleFrom)(dist, rng);
+                }
+            }
+            sites.push({ dist: dist, value });
+            logWeight += (0, distributions_1.logPdf)(dist, value);
+            return value;
+        },
+        observe(condition) {
+            if (!condition) {
+                rejected = true;
+                logWeight = -Infinity;
+            }
+        },
+        factor(logW) {
+            logWeight += logW;
+        },
+    };
+    const value = program(sampler);
+    return { sites, logWeight, value, rejected };
+}
+/**
+ * Igualdad estructural de distribuciones (para replay): mismo kind
+ * y mismos parámetros. Para arrays/maps compara longitud + entradas.
+ */
+function distEquals(a, b) {
+    if (a.kind !== b.kind)
+        return false;
+    switch (a.kind) {
+        case 'bernoulli':
+            return a.p === b.p;
+        case 'uniform': {
+            const bb = b;
+            return a.low === bb.low && a.high === bb.high;
+        }
+        case 'normal': {
+            const bb = b;
+            return a.mean === bb.mean && a.std === bb.std;
+        }
+        case 'poisson':
+            return a.lambda === b.lambda;
+        case 'categorical': {
+            const bb = b;
+            if (a.values.length !== bb.values.length)
+                return false;
+            for (let i = 0; i < a.values.length; i++) {
+                if (a.values[i] !== bb.values[i])
+                    return false;
+                if (a.probs[i] !== bb.probs[i])
+                    return false;
+            }
+            return true;
+        }
+        case 'discrete': {
+            const bb = b;
+            if (a.pmf.size !== bb.pmf.size)
+                return false;
+            for (const [k, p] of a.pmf) {
+                if (bb.pmf.get(k) !== p)
+                    return false;
+            }
+            return true;
+        }
+    }
+}
+//# sourceMappingURL=inference.js.map

package/dist/reasoning/probabilistic/inference.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference.js","sourceRoot":"","sources":["../../../src/reasoning/probabilistic/inference.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,EAAE;AACF,mBAAmB;AACnB,EAAE;AACF,mEAAmE;AACnE,iEAAiE;AACjE,iEAAiE;AACjE,kEAAkE;AAClE,kEAAkE;AAClE,iEAAiE;AACjE,mEAAmE;AACnE,qEAAqE;AACrE,0DAA0D;AAC1D,iEAAiE;AACjE,iEAAiE;AACjE,uEAAuE;AACvE,mEAAmE;AACnE,qEAAqE;AACrE,mEAAmE;AACnE,sDAAsD;AACtD,EAAE;AACF,oEAAoE;;AA2IpE,8BAiDC;AA+ED,0CAuBC;AA0CD,4CAqCC;AA2DD,gDAwEC;AAlfD,mDAAuE;AAGvE,gEAAgE;AAEhE;;;;GAIG;AACH,SAAS,cAAc,CAAI,OAAY;IACrC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;IACpE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ,CAAC,CAAU;IAC1B,IAAI,OAAO,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO,CAAW,CAAC;AACrB,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAI,OAAY,EAAE,OAAkB;IACzD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAa,CAAC;IAClC,4DAA4D;IAC5D,gEAAgE;IAChE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAa,CAAC;IAC9C,MAAM,YAAY,GAAG,CAAC,CAAU,EAAW,EAAE,CAC3C,CAAC,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,IAAI,CAAC,CAAC;IACd,CAAC;IACD,IAAI,MAAM,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;QACrD,IAAI,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC9B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAM,CAAC;YACjD,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,MAAgB,EAAE,EAAY;IACtD,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACpC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAChB,OAAY,EACZ,OAAgF,EAAE;IAElF,MAAM,SAAS,GAAG,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,OAAO,GAAwB,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAC5D,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS;QAAE,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QAChC,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC;QACpC,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YAC/C,OAAO,CAAC,cAAc,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;QACtD,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;QAAE,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC;IACjE,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,OAAO,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YACtD,CAAC;YACD,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;gBAChC,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;YAC/C,CAAC;YACD,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YACpB,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3D,MAAM,QAAQ,GACZ,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvF,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YACpB,OAAO,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,OAAO,CAAC,SAAS,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAiBD;;;;;;;;;GASG;AACH,SAAgB,SAAS,CAAI,OAAoB,EAAE,SAAS,GAAG,OAAO;IAQpE,8CAA8C;IAC9C,IAAI,QAAQ,GAAW,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IACpD,MAAM,SAAS,GAAmC,EAAE,CAAC;IACrD,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,aAAa,IAAI,QAAQ,CAAC,MAAM,CAAC;QACjC,IAAI,aAAa,GAAG,SAAS,EAAE,CAAC;YAC9B,MAAM,IAAI,KAAK,CACb,oCAAoC,SAAS,YAAY;gBACvD,kDAAkD,CACrD,CAAC;QACJ,CAAC;QACD,MAAM,YAAY,GAAW,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAc;gBACvB,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,MAAM,EAAE,CAAC;aACV,CAAC;YACF,MAAM,MAAM,GAAG,WAAW,CAAI,OAAO,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YAC5D,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,SAAS,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,YAAY,CAAC;IAC1B,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,KAAK,IAAI,CAAC,CAAC,MAAM,CAAC;IAC7C,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACf,4CAA4C;QAC5C,OAAO;YACL,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,IAAI,GAAG,EAAE;SACrB,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC9C,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IACvD,OAAO,SAAS,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,WAAW,CAClB,OAAoB,EACpB,KAAgB,EAChB,QAAkD;IAElD,2DAA2D;IAC3D,gEAAgE;IAChE,2DAA2D;IAC3D,MAAM,eAAgB,SAAQ,KAAK;QACjC;YACE,KAAK,CAAC,QAAQ,CAAC,CAAC;YAChB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAChC,CAAC;KACF;IACD,MAAM,eAAgB,SAAQ,KAAK;QACjC;YACE,KAAK,CAAC,QAAQ,CAAC,CAAC;YAChB,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAChC,CAAC;KACF;IACD,MAAM,OAAO,GAAY;QACvB,MAAM,CAAI,IAAqB;YAC7B,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACtC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;gBAClB,OAAO,CAAM,CAAC;YAChB,CAAC;YACD,gEAAgE;YAChE,MAAM,OAAO,GAAG,IAAA,gCAAgB,EAAC,IAAI,CAAC,CAAC;YACvC,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,OAAO,EAAE,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACrB,QAAQ,CAAC,IAAI,CAAC;oBACZ,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC;oBAClC,MAAM,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;iBACzB,CAAC,CAAC;YACL,CAAC;YACD,MAAM,IAAI,eAAe,EAAE,CAAC;QAC9B,CAAC;QACD,OAAO,CAAC,SAAkB;YACxB,IAAI,CAAC,SAAS;gBAAE,MAAM,IAAI,eAAe,EAAE,CAAC;QAC9C,CAAC;QACD,MAAM,CAAC,SAAiB;YACtB,IAAI,SAAS,KAAK,CAAC,QAAQ;gBAAE,MAAM,IAAI,eAAe,EAAE,CAAC;YACzD,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;KACF,CAAC;IACF,IAAI,CAAC;QACH,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/B,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;IACzC,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,eAAe;YAAE,OAAO,SAAS,CAAC;QACrD,IAAI,GAAG,YAAY,eAAe;YAAE,OAAO,SAAS,CAAC;QACrD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;;;;;;;GAQG;AACH,SAAgB,eAAe,CAC7B,OAAoB,EACpB,OAAyB,EAAE;IAE3B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC3C,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,IAAI,UAAU,GAAG,GAAG,CAAC;IACzD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;IACpC,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,OAAO,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC;QACnC,QAAQ,IAAI,CAAC,CAAC;QACd,IAAI,QAAQ,GAAG,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CACb,cAAc,QAAQ,kBAAkB,OAAO,CAAC,MAAM,IAAI,UAAU,aAAa;gBAC/E,2DAA2D,CAC9D,CAAC;QACJ,CAAC;QACD,MAAM,MAAM,GAAG,eAAe,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,SAAS,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;AACjD,CAAC;AAED,MAAM,WAAY,SAAQ,KAAK;IAC7B;QACE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;IAC5B,CAAC;CACF;AAED,SAAS,eAAe,CAAI,OAAoB,EAAE,GAAiB;IACjE,MAAM,OAAO,GAAY;QACvB,MAAM,CAAI,IAAqB;YAC7B,OAAO,IAAA,0BAAU,EAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,CAAC,SAAkB;YACxB,IAAI,CAAC,SAAS;gBAAE,MAAM,IAAI,WAAW,EAAE,CAAC;QAC1C,CAAC;QACD,MAAM,CAAC,SAAiB;YACtB,IAAI,SAAS,IAAI,CAAC;gBAAE,OAAO;YAC3B,IAAI,SAAS,KAAK,CAAC,QAAQ,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,WAAW,EAAE,CAAC;YAC1B,CAAC;QACH,CAAC;KACF,CAAC;IACF,IAAI,CAAC;QACH,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,GAAG,YAAY,WAAW;YAAE,OAAO,SAAS,CAAC;QACjD,MAAM,GAAG,CAAC;IACZ,CAAC;AACH,CAAC;AAED,gEAAgE;AAEhE;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAC9B,OAAoB,EACpB,OAAyB,EAAE;IAE3B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;IACpC,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC3B,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IACzE,CAAC;IAED,oEAAoE;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;IACtC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC;QAC/B,MAAM,IAAI,CAAC,CAAC;QACZ,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAElD,8DAA8D;IAC9D,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAEtC,OAAO,SAAS,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;AACjE,CAAC;AAED,SAAS,gBAAgB,CACvB,OAAoB,EACpB,GAAiB;IAEjB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,OAAO,GAAY;QACvB,MAAM,CAAI,IAAqB;YAC7B,OAAO,IAAA,0BAAU,EAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,CAAC,SAAkB;YACxB,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC;gBAChB,SAAS,GAAG,CAAC,QAAQ,CAAC;YACxB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAY;YACjB,SAAS,IAAI,IAAI,CAAC;QACpB,CAAC;KACF,CAAC;IACF,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9D,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAC9B,CAAC;AAsBD;;;;;;;;;;;GAWG;AACH,SAAgB,kBAAkB,CAChC,OAAoB,EACpB,OAAyB,EAAE;IAE3B,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC;IAEpC,iEAAiE;IACjE,IAAI,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACrC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC/D,QAAQ,IAAI,CAAC,CAAC;QACd,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CACb,oEAAoE;gBAClE,qCAAqC,CACxC,CAAC;QACJ,CAAC;QACD,OAAO,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC;IAC9C,MAAM,OAAO,GAAQ,EAAE,CAAC;IACxB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,OAAO,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,uDAAuD;YACvD,yDAAyD;YACzD,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACrC,IAAI,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ;gBAAE,OAAO,GAAG,KAAK,CAAC;QAC3E,CAAC;aAAM,CAAC;YACN,cAAc,IAAI,CAAC,CAAC;YACpB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACzD,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,yDAAyD;YACzD,MAAM,QAAQ,GAAG,IAAA,0BAAU,EAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC5C,0DAA0D;YAC1D,2DAA2D;YAC3D,8DAA8D;YAC9D,8CAA8C;YAC9C,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzE,IAAI,QAAQ,CAAC,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9D,2CAA2C;gBAC3C,SAAS;YACX,CAAC;YACD,wDAAwD;YACxD,8DAA8D;YAC9D,4DAA4D;YAC5D,4DAA4D;YAC5D,yDAAyD;YACzD,wDAAwD;YACxD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACxD,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE,CAAC;gBAC3B,OAAO,GAAG,QAAQ,CAAC;gBACnB,QAAQ,IAAI,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;YAC7C,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC,OAAO,EAAE;QACxB,QAAQ;QACR,KAAK,EAAE,cAAc;KACtB,CAAC,CAAC;AACL,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAI,OAAoB,EAAE,GAAiB;IAC1D,MAAM,KAAK,GAAsD,EAAE,CAAC;IACpE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,MAAM,OAAO,GAAY;QACvB,MAAM,CAAI,IAAqB;YAC7B,MAAM,KAAK,GAAG,IAAA,0BAAU,EAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAA6B,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,gEAAgE;YAChE,SAAS,IAAI,IAAA,sBAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,CAAC,SAAkB;YACxB,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC;gBAChB,SAAS,GAAG,CAAC,QAAQ,CAAC;YACxB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAY;YACjB,SAAS,IAAI,IAAI,CAAC;QACpB,CAAC;KACF,CAAC;IACF,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CACpB,OAAoB,EACpB,QAAkB,EAClB,UAAkB,EAClB,QAAiB,EACjB,GAAiB;IAEjB,MAAM,KAAK,GAAsD,EAAE,CAAC;IACpE,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,OAAO,GAAY;QACvB,MAAM,CAAI,IAAqB;YAC7B,MAAM,GAAG,GAAG,MAAM,CAAC;YACnB,MAAM,IAAI,CAAC,CAAC;YACZ,IAAI,KAAQ,CAAC;YACb,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;gBACvB,KAAK,GAAG,QAAa,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACjC,kEAAkE;gBAClE,IAAI,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAA6B,CAAC,EAAE,CAAC;oBACjE,KAAK,GAAG,IAAI,CAAC,KAAU,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,KAAK,GAAG,IAAA,0BAAU,EAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAA6B,EAAE,KAAK,EAAE,CAAC,CAAC;YAC3D,SAAS,IAAI,IAAA,sBAAM,EAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,CAAC,SAAkB;YACxB,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,QAAQ,GAAG,IAAI,CAAC;gBAChB,SAAS,GAAG,CAAC,QAAQ,CAAC;YACxB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAY;YACjB,SAAS,IAAI,IAAI,CAAC;QACpB,CAAC;KACF,CAAC;IACF,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAC/B,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC/C,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAwB,EAAE,CAAwB;IACpE,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IACpC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,WAAW;YACd,OAAO,CAAC,CAAC,CAAC,KAAM,CAAc,CAAC,CAAC,CAAC;QACnC,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,CAAC;QAChD,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,OAAO,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC;QAChD,CAAC;QACD,KAAK,SAAS;YACZ,OAAO,CAAC,CAAC,MAAM,KAAM,CAAc,CAAC,MAAM,CAAC;QAC7C,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,EAAE,CAAC,MAAM,CAAC,MAAM;gBAAE,OAAO,KAAK,CAAC;YACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC/C,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC/C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,EAAE,GAAG,CAAa,CAAC;YACzB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC7C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;gBAC3B,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,OAAO,KAAK,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC"}