vigiles 2.0.0

package/dist/evolve.js

@@ -0,0 +1,599 @@
+"use strict";
+/**
+ * vigiles — Evolution engine for self-evolving specifications.
+ *
+ * AI agents propose mutations. The engine applies them, runs the proof suite,
+ * and only accepts mutations that pass all proofs AND improve fitness.
+ *
+ * Pattern: "LLM proposes, deterministic algorithm disposes."
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EvolutionEngine = void 0;
+exports.applyMutation = applyMutation;
+exports.runProofSuite = runProofSuite;
+const proofs_js_1 = require("./proofs.js");
+const compile_js_1 = require("./compile.js");
+/**
+ * Shallow-clone a Rule. Rules are simple value types (primitive fields only),
+ * so a spread is sufficient to decouple engine state from the caller's
+ * mutation object — without this, later caller-side edits would silently
+ * alter accepted engine state without re-running proofs.
+ */
+function cloneRule(rule) {
+    return { ...rule };
+}
+/**
+ * Canonical string representation of a rules map for hashing.
+ *
+ * `JSON.stringify` preserves insertion order, so two logically identical
+ * rule maps built in a different order would hash to different values.
+ * That would make the Merkle head/specHash comparison in the constructor
+ * falsely reject a valid imported history just because the caller
+ * reconstructed rules in a different order.
+ *
+ * Sort by rule id, stringify each entry with its own stable key order,
+ * and join with a separator.
+ */
+function canonicalRulesJson(rules) {
+    const sortedIds = Object.keys(rules).sort();
+    const entries = sortedIds.map((id) => {
+        const rule = rules[id];
+        // Also sort the keys within each rule object so { _kind, text } and
+        // { text, _kind } produce the same output.
+        const ruleKeys = Object.keys(rule).sort();
+        const orderedRule = {};
+        for (const k of ruleKeys) {
+            orderedRule[k] = rule[k];
+        }
+        return [id, orderedRule];
+    });
+    return JSON.stringify(entries);
+}
+/**
+ * Apply a mutation to a spec's rules, producing a new rule map.
+ * Returns null + error if the mutation is invalid.
+ */
+function applyMutation(rules, mutation) {
+    const next = { ...rules };
+    switch (mutation.type) {
+        case "add": {
+            if (mutation.ruleId in next) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" already exists`,
+                    },
+                };
+            }
+            next[mutation.ruleId] = cloneRule(mutation.rule);
+            return { rules: next };
+        }
+        case "remove": {
+            if (!(mutation.ruleId in next)) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" not found`,
+                    },
+                };
+            }
+            const { [mutation.ruleId]: _removed, ...rest } = next;
+            void _removed;
+            return { rules: rest };
+        }
+        case "strengthen": {
+            const rule = next[mutation.ruleId];
+            if (!rule) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" not found`,
+                    },
+                };
+            }
+            if (rule._kind === "guidance") {
+                if (mutation.linterRule) {
+                    // guidance → enforce
+                    next[mutation.ruleId] = {
+                        _kind: "enforce",
+                        linterRule: mutation.linterRule,
+                        why: rule.text,
+                        verify: true,
+                    };
+                }
+                else {
+                    return {
+                        rules,
+                        error: {
+                            mutation,
+                            reason: "Strengthening guidance requires a linterRule to enforce against.",
+                        },
+                    };
+                }
+            }
+            else {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" is already at maximum strength (enforce)`,
+                    },
+                };
+            }
+            return { rules: next };
+        }
+        case "weaken": {
+            const rule = next[mutation.ruleId];
+            if (!rule) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" not found`,
+                    },
+                };
+            }
+            if (rule._kind === "enforce") {
+                next[mutation.ruleId] = {
+                    _kind: "guidance",
+                    text: rule.why,
+                };
+            }
+            else {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" is already at minimum strength (guidance)`,
+                    },
+                };
+            }
+            return { rules: next };
+        }
+        case "merge": {
+            const [idA, idB] = mutation.sourceIds;
+            if (idA === idB) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Merge requires two distinct source rules; got "${idA}" twice`,
+                    },
+                };
+            }
+            if (!(idA in next) || !(idB in next)) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `One or both source rules not found: "${idA}", "${idB}"`,
+                    },
+                };
+            }
+            // mergedId must not collide with an unrelated existing rule —
+            // otherwise the assignment would silently overwrite that rule and
+            // drop its constraints. Allowed only when mergedId is one of the
+            // sources being consumed (renaming-in-place).
+            if (mutation.mergedId in next &&
+                mutation.mergedId !== idA &&
+                mutation.mergedId !== idB) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Merge target "${mutation.mergedId}" collides with an existing unrelated rule; pick a new id or remove the existing rule first`,
+                    },
+                };
+            }
+            // Merge must not silently weaken enforcement. The merged rule's
+            // strength must be at least as strong as the strongest source —
+            // otherwise a caller could launder two enforced rules into a
+            // single guidance rule and bypass monotonicity (because the
+            // per-call allowWeaken for merge sources means removals don't
+            // trigger the violation).
+            const sourceStrengths = mutation.sourceIds.map((id) => (0, proofs_js_1.ruleStrength)(next[id]._kind));
+            const maxSourceStrength = Math.max(...sourceStrengths);
+            const mergedStrength = (0, proofs_js_1.ruleStrength)(mutation.mergedRule._kind);
+            if (mergedStrength < maxSourceStrength) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Merged rule "${mutation.mergedId}" (${mutation.mergedRule._kind}) is weaker than source rules (strongest was ${maxSourceStrength === 1 ? "enforce" : "guidance"}). Merges may not downgrade enforcement.`,
+                    },
+                };
+            }
+            const { [idA]: _a, [idB]: _b, ...rest } = next;
+            void _a;
+            void _b;
+            return {
+                rules: { ...rest, [mutation.mergedId]: cloneRule(mutation.mergedRule) },
+            };
+        }
+        case "reword": {
+            const rule = next[mutation.ruleId];
+            if (!rule) {
+                return {
+                    rules,
+                    error: {
+                        mutation,
+                        reason: `Rule "${mutation.ruleId}" not found`,
+                    },
+                };
+            }
+            if (rule._kind === "guidance") {
+                next[mutation.ruleId] = { ...rule, text: mutation.newText };
+            }
+            else if (rule._kind === "enforce") {
+                next[mutation.ruleId] = { ...rule, why: mutation.newText };
+            }
+            return { rules: next };
+        }
+    }
+}
+/**
+ * Run all proofs on a candidate spec mutation.
+ *
+ * Proofs:
+ * 1. Monotonicity — rules don't weaken (unless explicitly allowed)
+ * 2. NCD deduplication — no near-duplicate rules introduced
+ * 3. Bloom filter overlap — fast cross-check for token similarity
+ */
+function runProofSuite(before, after, options = {}) {
+    const receipts = [];
+    const ncdThreshold = options.ncdThreshold ?? 0.3;
+    // 1. Monotonicity
+    const mono = (0, proofs_js_1.checkMonotonicity)(before, after, {
+        allowWeaken: options.allowWeaken,
+    });
+    receipts.push({
+        name: "monotonicity",
+        passed: mono.valid,
+        detail: mono.valid
+            ? `${mono.strengthened.length} strengthened, ${mono.added.length} added`
+            : `${mono.violations.length} violations: ${mono.violations.map((v) => `${v.ruleId} (${v.from}→${v.to})`).join(", ")}`,
+    });
+    // 2. NCD deduplication. Only fail on pairs NEWLY INTRODUCED by the
+    // candidate change — a repo with historical duplication must not
+    // block every unrelated mutation. Compute similar pairs on `after`
+    // and `before`, then subtract.
+    //
+    // Wrapped in try/catch so an unknown rule kind (legacy data / JS
+    // caller) surfaces as a clean proof failure rather than crashing
+    // the whole audit pipeline.
+    try {
+        const beforePairs = new Set((0, proofs_js_1.findSimilarRules)(before, ncdThreshold).map((p) => [p.idA, p.idB].sort().join("|")));
+        const similar = (0, proofs_js_1.findSimilarRules)(after, ncdThreshold).filter((p) => !beforePairs.has([p.idA, p.idB].sort().join("|")));
+        const ncdPassed = similar.length === 0;
+        receipts.push({
+            name: "ncd-dedup",
+            passed: ncdPassed,
+            detail: ncdPassed
+                ? "No new near-duplicate rules"
+                : `${similar.length} new near-duplicate pairs: ${similar.map((p) => `${p.idA}↔${p.idB} (${p.distance.toFixed(3)})`).join(", ")}`,
+        });
+    }
+    catch (e) {
+        receipts.push({
+            name: "ncd-dedup",
+            passed: false,
+            detail: `Similarity check failed: ${e instanceof Error ? e.message : String(e)}`,
+        });
+    }
+    // 3. Bloom filter cross-check (fast sanity check for token overlap).
+    // Baseline is built from rules that still exist in `after` — any
+    // rule removed by the candidate mutation (e.g. the two sources of
+    // a merge) must be excluded, otherwise the newly introduced merge
+    // rule would collide against its own sources and the merge would
+    // be rejected for the very similarity it was meant to deduplicate.
+    //
+    // Wrapped for the same reason as NCD: ruleToBloomFilter → ruleToText
+    // throws on unknown rule kinds.
+    try {
+        let bloomPassed = true;
+        const newRuleIds = Object.keys(after).filter((id) => !(id in before));
+        const existingFilters = new Map();
+        for (const [id, rule] of Object.entries(before)) {
+            if (!(id in after))
+                continue; // removed — skip
+            existingFilters.set(id, (0, proofs_js_1.ruleToBloomFilter)(rule));
+        }
+        const bloomOverlaps = [];
+        for (const newId of newRuleIds) {
+            const newFilter = (0, proofs_js_1.ruleToBloomFilter)(after[newId]);
+            for (const [existingId, existingFilter] of existingFilters) {
+                if (existingId === newId)
+                    continue;
+                try {
+                    const similarity = proofs_js_1.BloomFilter.jaccardSimilarity(newFilter, existingFilter);
+                    if (similarity > 0.7) {
+                        bloomOverlaps.push(`${newId}↔${existingId} (jaccard=${similarity.toFixed(3)})`);
+                        bloomPassed = false;
+                    }
+                }
+                catch {
+                    // Different filter sizes — skip comparison
+                }
+            }
+        }
+        receipts.push({
+            name: "bloom-overlap",
+            passed: bloomPassed,
+            detail: bloomPassed
+                ? "No suspicious token overlap"
+                : `High overlap: ${bloomOverlaps.join(", ")}`,
+        });
+    }
+    catch (e) {
+        receipts.push({
+            name: "bloom-overlap",
+            passed: false,
+            detail: `Bloom filter check failed: ${e instanceof Error ? e.message : String(e)}`,
+        });
+    }
+    // Compute fitness of the new spec. Guard against bad runtime data: fitness
+    // recomputes similarity internally and would otherwise crash on unknown
+    // rule kinds (legacy `check`, JS caller), propagating the throw up through
+    // the engine. Fall back to a neutral fitness and mark the proof failed.
+    const specForFitness = { rules: after };
+    let fitnessResult;
+    try {
+        fitnessResult = (0, proofs_js_1.fitness)(specForFitness, {
+            maxTokens: options.maxTokens,
+            ncdThreshold,
+        });
+    }
+    catch (e) {
+        receipts.push({
+            name: "fitness",
+            passed: false,
+            detail: `Fitness computation failed: ${e instanceof Error ? e.message : String(e)}`,
+        });
+        fitnessResult = {
+            score: 0,
+            coverage: 0,
+            redundancy: 0,
+            budgetPressure: 0,
+        };
+    }
+    const allPassed = receipts.every((r) => r.passed);
+    return { passed: allPassed, receipts, fitness: fitnessResult };
+}
+/**
+ * The evolution engine: the core of the self-evolving spec system.
+ *
+ * Maintains a spec, a proof suite, and a Merkle history.
+ * Accepts mutations that pass all proofs and improve (or maintain) fitness.
+ */
+class EvolutionEngine {
+    rules;
+    history;
+    options;
+    constructor(initialRules, options = {}) {
+        this.rules = Object.fromEntries(Object.entries(initialRules).map(([id, rule]) => [id, cloneRule(rule)]));
+        // Snapshot the supplied history by serializing and rehydrating, so a
+        // caller that retains their reference to the original MerkleHistory
+        // can't append to the audit trail behind the engine's back. Without
+        // this, external code could bypass propose()'s proof + fitness gates
+        // and mutate provenance — defeating the whole tamper-evident point.
+        this.history = options.history
+            ? proofs_js_1.MerkleHistory.fromJSON(options.history.toJSON())
+            : new proofs_js_1.MerkleHistory();
+        this.options = {
+            // Clone the Set so a caller mutating their own reference after
+            // construction can't silently change acceptance policy (e.g. by
+            // adding a rule id to allow a weakening mutation that would
+            // otherwise be rejected).
+            allowWeaken: new Set(options.allowWeaken ?? []),
+            ncdThreshold: options.ncdThreshold ?? 0.3,
+            maxTokens: options.maxTokens ?? 2000,
+            acceptNeutral: options.acceptNeutral ?? false,
+        };
+        // If a history was supplied, verify its chain integrity and that its
+        // head corresponds to initialRules. A stale or mismatched history would
+        // produce misleading provenance for subsequent mutations.
+        if (options.history) {
+            const verification = this.history.verify();
+            if (!verification.valid) {
+                throw new Error(`Supplied Merkle history is invalid at node ${String(verification.invalidAt)}. Tamper detected or corrupted chain.`);
+            }
+            if (this.history.length > 0) {
+                const expectedHash = (0, compile_js_1.computeHash)(canonicalRulesJson(this.rules));
+                const head = this.history.head();
+                if (head && head.specHash !== expectedHash) {
+                    throw new Error(`Supplied Merkle history head does not match initialRules. ` +
+                        `History head specHash="${head.specHash}", expected="${expectedHash}". ` +
+                        `The history and rules are mismatched; refusing to record new mutations on the wrong chain.`);
+                }
+            }
+        }
+        // Record genesis state
+        if (this.history.length === 0) {
+            const specHash = (0, compile_js_1.computeHash)(canonicalRulesJson(this.rules));
+            this.history.append(specHash, {
+                type: "add",
+                ruleIds: Object.keys(this.rules),
+                description: "Genesis",
+            }, [{ name: "genesis", passed: true }]);
+        }
+    }
+    /**
+     * Get current rules as a deep defensive copy. Callers cannot mutate
+     * engine state through the returned map because every rule is cloned —
+     * otherwise a JS caller or a TS cast could silently alter accepted
+     * state without running proofs or appending to history.
+     */
+    getRules() {
+        return Object.fromEntries(Object.entries(this.rules).map(([id, rule]) => [id, cloneRule(rule)]));
+    }
+    /**
+     * Get a snapshot of the Merkle history.
+     *
+     * Returns a freshly deserialized copy so even a JS caller that casts
+     * to MerkleHistory and calls `.append()` cannot inject nodes into the
+     * engine's real chain. The snapshot is read-only at the TS level
+     * (ReadonlyMerkleHistory) and isolated at the runtime level (separate
+     * instance via toJSON/fromJSON).
+     */
+    getHistory() {
+        return proofs_js_1.MerkleHistory.fromJSON(this.history.toJSON());
+    }
+    /** Get current fitness. */
+    getFitness() {
+        return (0, proofs_js_1.fitness)({ rules: this.rules }, {
+            maxTokens: this.options.maxTokens,
+            ncdThreshold: this.options.ncdThreshold,
+        });
+    }
+    /**
+     * Propose a mutation. The engine applies it, runs proofs, and accepts or rejects.
+     *
+     * Returns a detailed result including proof receipts and fitness comparison.
+     */
+    propose(mutation) {
+        // Guard baseline fitness: if engine state contains a malformed rule
+        // (legacy _kind, JS caller, cast bypass), fitness() reaches ruleToText
+        // and throws BEFORE we enter runProofSuite's own try/catch. Return a
+        // clean rejection with a neutral fitness instead of crashing the flow.
+        let beforeFitness;
+        try {
+            beforeFitness = this.getFitness();
+        }
+        catch (e) {
+            const neutral = {
+                score: 0,
+                coverage: 0,
+                redundancy: 0,
+                budgetPressure: 0,
+            };
+            return {
+                accepted: false,
+                mutation,
+                proofs: {
+                    passed: false,
+                    receipts: [
+                        {
+                            name: "baseline-fitness",
+                            passed: false,
+                            detail: `Baseline fitness failed: ${e instanceof Error ? e.message : String(e)}`,
+                        },
+                    ],
+                    fitness: neutral,
+                },
+                beforeFitness: neutral,
+                afterFitness: neutral,
+                error: `Baseline fitness failed: ${e instanceof Error ? e.message : String(e)}`,
+            };
+        }
+        // Apply the mutation
+        const { rules: candidateRules, error } = applyMutation(this.rules, mutation);
+        if (error) {
+            return {
+                accepted: false,
+                mutation,
+                proofs: { passed: false, receipts: [], fitness: beforeFitness },
+                beforeFitness,
+                afterFitness: beforeFitness,
+                error: error.reason,
+            };
+        }
+        // For merge mutations, the source rule IDs are removed by design.
+        // Add them to a per-call allowWeaken set so checkMonotonicity doesn't
+        // reject the removal as a monotonicity violation — merging is the
+        // intended constraint-reducing operation, not silent deletion.
+        const perCallAllowWeaken = new Set(this.options.allowWeaken);
+        if (mutation.type === "merge") {
+            for (const id of mutation.sourceIds) {
+                perCallAllowWeaken.add(id);
+            }
+        }
+        // Run proof suite
+        const proofResult = runProofSuite(this.rules, candidateRules, {
+            allowWeaken: perCallAllowWeaken,
+            ncdThreshold: this.options.ncdThreshold,
+            maxTokens: this.options.maxTokens,
+        });
+        const afterFitness = proofResult.fitness;
+        // Decision: all proofs pass AND fitness doesn't decrease.
+        //
+        // `acceptNeutral` relaxes strict improvement (>) to ≥ — i.e. it accepts
+        // mutations that keep fitness the same. It must NOT accept regressions:
+        // a previous version short-circuited on acceptNeutral, which meant any
+        // proof-passing mutation was accepted regardless of score, silently
+        // driving spec quality downward over time.
+        const fitnessOk = this.options.acceptNeutral
+            ? afterFitness.score >= beforeFitness.score
+            : afterFitness.score > beforeFitness.score;
+        const accepted = proofResult.passed && fitnessOk;
+        let historyHash;
+        if (accepted) {
+            // Accept the mutation
+            this.rules = candidateRules;
+            // Record in Merkle history
+            const specHash = (0, compile_js_1.computeHash)(canonicalRulesJson(this.rules));
+            const historyMutation = {
+                type: mutation.type === "merge" ? "merge" : mutation.type,
+                ruleIds: mutation.type === "merge"
+                    ? [...mutation.sourceIds, mutation.mergedId]
+                    : ["ruleId" in mutation ? mutation.ruleId : "unknown"],
+                description: describeMutation(mutation),
+            };
+            // Defensive copy: the same proofResult is returned to the caller,
+            // so without this clone a caller mutating result.proofs.receipts
+            // would retroactively alter the stored history node.
+            historyHash = this.history.append(specHash, historyMutation, proofResult.receipts.map((r) => ({ ...r })));
+        }
+        return {
+            accepted,
+            mutation,
+            proofs: proofResult,
+            beforeFitness,
+            afterFitness,
+            historyHash,
+            error: !proofResult.passed
+                ? `Proofs failed: ${proofResult.receipts
+                    .filter((r) => !r.passed)
+                    .map((r) => r.name)
+                    .join(", ")}`
+                : !fitnessOk
+                    ? `Fitness decreased: ${beforeFitness.score.toFixed(3)} → ${afterFitness.score.toFixed(3)}`
+                    : undefined,
+        };
+    }
+    /**
+     * Propose multiple mutations in sequence.
+     * Stops at the first rejection unless `continueOnReject` is true.
+     */
+    proposeAll(mutations, options = {}) {
+        const results = [];
+        for (const mutation of mutations) {
+            const result = this.propose(mutation);
+            results.push(result);
+            if (!result.accepted && !options.continueOnReject)
+                break;
+        }
+        return results;
+    }
+}
+exports.EvolutionEngine = EvolutionEngine;
+/** Human-readable description of a mutation. */
+function describeMutation(mutation) {
+    switch (mutation.type) {
+        case "add":
+            return `Add rule "${mutation.ruleId}" (${mutation.rule._kind})`;
+        case "remove":
+            return `Remove rule "${mutation.ruleId}"`;
+        case "strengthen":
+            return `Strengthen rule "${mutation.ruleId}"${mutation.linterRule ? ` → enforce(${mutation.linterRule})` : ""}`;
+        case "weaken":
+            return `Weaken rule "${mutation.ruleId}": ${mutation.justification}`;
+        case "merge":
+            return `Merge "${mutation.sourceIds[0]}" + "${mutation.sourceIds[1]}" → "${mutation.mergedId}"`;
+        case "reword":
+            return `Reword rule "${mutation.ruleId}"`;
+    }
+}
+//# sourceMappingURL=evolve.js.map

package/dist/evolve.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"evolve.js","sourceRoot":"","sources":["../src/evolve.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAsHH,sCAiMC;AAoBD,sCA4IC;AApdD,2CAYqB;AACrB,6CAA2C;AA4D3C;;;;;GAKG;AACH,SAAS,SAAS,CAAC,IAAU;IAC3B,OAAO,EAAE,GAAG,IAAI,EAAE,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,kBAAkB,CAAC,KAA2B;IACrD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5C,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC;QACvB,oEAAoE;QACpE,2CAA2C;QAC3C,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,WAAW,GAA4B,EAAE,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,WAAW,CAAC,CAAC,CAAC,GAAI,IAA2C,CAAC,CAAC,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,SAAgB,aAAa,CAC3B,KAA2B,EAC3B,QAAsB;IAEtB,MAAM,IAAI,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;IAE1B,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,IAAI,QAAQ,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;gBAC5B,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,kBAAkB;qBACnD;iBACF,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACjD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;gBAC/B,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,aAAa;qBAC9C;iBACF,CAAC;YACJ,CAAC;YACD,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;YACtD,KAAK,QAAQ,CAAC;YACd,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;QAED,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,aAAa;qBAC9C;iBACF,CAAC;YACJ,CAAC;YAED,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC9B,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;oBACxB,qBAAqB;oBACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG;wBACtB,KAAK,EAAE,SAAS;wBAChB,UAAU,EAAE,QAAQ,CAAC,UAAU;wBAC/B,GAAG,EAAE,IAAI,CAAC,IAAI;wBACd,MAAM,EAAE,IAAI;qBACE,CAAC;gBACnB,CAAC;qBAAM,CAAC;oBACN,OAAO;wBACL,KAAK;wBACL,KAAK,EAAE;4BACL,QAAQ;4BACR,MAAM,EACJ,kEAAkE;yBACrE;qBACF,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,4CAA4C;qBAC7E;iBACF,CAAC;YACJ,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,aAAa;qBAC9C;iBACF,CAAC;YACJ,CAAC;YAED,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC7B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG;oBACtB,KAAK,EAAE,UAAU;oBACjB,IAAI,EAAE,IAAI,CAAC,GAAG;iBACC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,6CAA6C;qBAC9E;iBACF,CAAC;YACJ,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;QAED,KAAK,OAAO,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,SAAS,CAAC;YACtC,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAChB,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,kDAAkD,GAAG,SAAS;qBACvE;iBACF,CAAC;YACJ,CAAC;YACD,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,EAAE,CAAC;gBACrC,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,wCAAwC,GAAG,OAAO,GAAG,GAAG;qBACjE;iBACF,CAAC;YACJ,CAAC;YACD,8DAA8D;YAC9D,kEAAkE;YAClE,iEAAiE;YACjE,8CAA8C;YAC9C,IACE,QAAQ,CAAC,QAAQ,IAAI,IAAI;gBACzB,QAAQ,CAAC,QAAQ,KAAK,GAAG;gBACzB,QAAQ,CAAC,QAAQ,KAAK,GAAG,EACzB,CAAC;gBACD,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,iBAAiB,QAAQ,CAAC,QAAQ,6FAA6F;qBACxI;iBACF,CAAC;YACJ,CAAC;YACD,gEAAgE;YAChE,gEAAgE;YAChE,6DAA6D;YAC7D,4DAA4D;YAC5D,8DAA8D;YAC9D,0BAA0B;YAC1B,MAAM,eAAe,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACpD,IAAA,wBAAY,EAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAC7B,CAAC;YACF,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;YACvD,MAAM,cAAc,GAAG,IAAA,wBAAY,EAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC/D,IAAI,cAAc,GAAG,iBAAiB,EAAE,CAAC;gBACvC,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,gBAAgB,QAAQ,CAAC,QAAQ,MAAM,QAAQ,CAAC,UAAU,CAAC,KAAK,gDAAgD,iBAAiB,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,0CAA0C;qBACnN;iBACF,CAAC;YACJ,CAAC;YACD,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;YAC/C,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,CAAC;YACR,OAAO;gBACL,KAAK,EAAE,EAAE,GAAG,IAAI,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;aACxE,CAAC;QACJ,CAAC;QAED,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO;oBACL,KAAK;oBACL,KAAK,EAAE;wBACL,QAAQ;wBACR,MAAM,EAAE,SAAS,QAAQ,CAAC,MAAM,aAAa;qBAC9C;iBACF,CAAC;YACJ,CAAC;YAED,IAAI,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC9D,CAAC;iBAAM,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,OAAO,EAAE,CAAC;YAC7D,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;AACH,CAAC;AAYD;;;;;;;GAOG;AACH,SAAgB,aAAa,CAC3B,MAA4B,EAC5B,KAA2B,EAC3B,UAII,EAAE;IAEN,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,GAAG,CAAC;IAEjD,kBAAkB;IAClB,MAAM,IAAI,GAAG,IAAA,6BAAiB,EAAC,MAAM,EAAE,KAAK,EAAE;QAC5C,WAAW,EAAE,OAAO,CAAC,WAAW;KACjC,CAAC,CAAC;IACH,QAAQ,CAAC,IAAI,CAAC;QACZ,IAAI,EAAE,cAAc;QACpB,MAAM,EAAE,IAAI,CAAC,KAAK;QAClB,MAAM,EAAE,IAAI,CAAC,KAAK;YAChB,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,kBAAkB,IAAI,CAAC,KAAK,CAAC,MAAM,QAAQ;YACxE,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,gBAAgB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;KACxH,CAAC,CAAC;IAEH,mEAAmE;IACnE,iEAAiE;IACjE,mEAAmE;IACnE,+BAA+B;IAC/B,EAAE;IACF,iEAAiE;IACjE,iEAAiE;IACjE,4BAA4B;IAC5B,IAAI,CAAC;QACH,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,IAAA,4BAAgB,EAAC,MAAM,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC/C,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAChC,CACF,CAAC;QACF,MAAM,OAAO,GAAG,IAAA,4BAAgB,EAAC,KAAK,EAAE,YAAY,CAAC,CAAC,MAAM,CAC1D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CACzD,CAAC;QACF,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,WAAW;YACjB,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,SAAS;gBACf,CAAC,CAAC,6BAA6B;gBAC/B,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,8BAA8B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SACnI,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,WAAW;YACjB,MAAM,EAAE,KAAK;YACb,MAAM,EAAE,4BAA4B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;SACjF,CAAC,CAAC;IACL,CAAC;IAED,qEAAqE;IACrE,iEAAiE;IACjE,kEAAkE;IAClE,kEAAkE;IAClE,iEAAiE;IACjE,mEAAmE;IACnE,EAAE;IACF,qEAAqE;IACrE,gCAAgC;IAChC,IAAI,CAAC;QACH,IAAI,WAAW,GAAG,IAAI,CAAC;QACvB,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,CAAC,CAAC;QACtE,MAAM,eAAe,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEvD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,CAAC,EAAE,IAAI,KAAK,CAAC;gBAAE,SAAS,CAAC,iBAAiB;YAC/C,eAAe,CAAC,GAAG,CAAC,EAAE,EAAE,IAAA,6BAAiB,EAAC,IAAI,CAAC,CAAC,CAAC;QACnD,CAAC;QAED,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,MAAM,SAAS,GAAG,IAAA,6BAAiB,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAClD,KAAK,MAAM,CAAC,UAAU,EAAE,cAAc,CAAC,IAAI,eAAe,EAAE,CAAC;gBAC3D,IAAI,UAAU,KAAK,KAAK;oBAAE,SAAS;gBACnC,IAAI,CAAC;oBACH,MAAM,UAAU,GAAG,uBAAW,CAAC,iBAAiB,CAC9C,SAAS,EACT,cAAc,CACf,CAAC;oBACF,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;wBACrB,aAAa,CAAC,IAAI,CAChB,GAAG,KAAK,IAAI,UAAU,aAAa,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAC5D,CAAC;wBACF,WAAW,GAAG,KAAK,CAAC;oBACtB,CAAC;gBACH,CAAC;gBAAC,MAAM,CAAC;oBACP,2CAA2C;gBAC7C,CAAC;YACH,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,eAAe;YACrB,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,WAAW;gBACjB,CAAC,CAAC,6BAA6B;gBAC/B,CAAC,CAAC,iBAAiB,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;SAChD,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,eAAe;YACrB,MAAM,EAAE,KAAK;YACb,MAAM,EAAE,8BAA8B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;SACnF,CAAC,CAAC;IACL,CAAC;IAED,2EAA2E;IAC3E,wEAAwE;IACxE,2EAA2E;IAC3E,wEAAwE;IACxE,MAAM,cAAc,GAAG,EAAE,KAAK,EAAE,KAAK,EAAgB,CAAC;IACtD,IAAI,aAA4B,CAAC;IACjC,IAAI,CAAC;QACH,aAAa,GAAG,IAAA,mBAAO,EAAC,cAAc,EAAE;YACtC,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,YAAY;SACb,CAAC,CAAC;IACL,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,KAAK;YACb,MAAM,EAAE,+BAA+B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;SACpF,CAAC,CAAC;QACH,aAAa,GAAG;YACd,KAAK,EAAE,CAAC;YACR,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,CAAC;YACb,cAAc,EAAE,CAAC;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IAClD,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;AACjE,CAAC;AAgBD;;;;;GAKG;AACH,MAAa,eAAe;IAClB,KAAK,CAAuB;IACnB,OAAO,CAAgB;IACvB,OAAO,CAMtB;IAEF,YACE,YAAkC,EAClC,UAMI,EAAE;QAEN,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,WAAW,CAC7B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CACxE,CAAC;QACF,qEAAqE;QACrE,oEAAoE;QACpE,oEAAoE;QACpE,qEAAqE;QACrE,oEAAoE;QACpE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO;YAC5B,CAAC,CAAC,yBAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAClD,CAAC,CAAC,IAAI,yBAAa,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG;YACb,+DAA+D;YAC/D,gEAAgE;YAChE,4DAA4D;YAC5D,0BAA0B;YAC1B,WAAW,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;YAC/C,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,GAAG;YACzC,SAAS,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI;YACpC,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,KAAK;SAC9C,CAAC;QAEF,qEAAqE;QACrE,wEAAwE;QACxE,0DAA0D;QAC1D,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC3C,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM,IAAI,KAAK,CACb,8CAA8C,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,uCAAuC,CACpH,CAAC;YACJ,CAAC;YACD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,IAAA,wBAAW,EAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACjE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;gBACjC,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,YAAY,EAAE,CAAC;oBAC3C,MAAM,IAAI,KAAK,CACb,4DAA4D;wBAC1D,0BAA0B,IAAI,CAAC,QAAQ,gBAAgB,YAAY,KAAK;wBACxE,4FAA4F,CAC/F,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,IAAA,wBAAW,EAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,MAAM,CACjB,QAAQ,EACR;gBACE,IAAI,EAAE,KAAK;gBACX,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAChC,WAAW,EAAE,SAAS;aACvB,EACD,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CACpC,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,QAAQ;QACN,OAAO,MAAM,CAAC,WAAW,CACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CACtE,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,UAAU;QACR,OAAO,yBAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,2BAA2B;IAC3B,UAAU;QACR,OAAO,IAAA,mBAAO,EAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAgB,EAAE;YAClD,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;YACjC,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY;SACxC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,QAAsB;QAC5B,oEAAoE;QACpE,uEAAuE;QACvE,qEAAqE;QACrE,uEAAuE;QACvE,IAAI,aAA4B,CAAC;QACjC,IAAI,CAAC;YACH,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QACpC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,OAAO,GAAkB;gBAC7B,KAAK,EAAE,CAAC;gBACR,QAAQ,EAAE,CAAC;gBACX,UAAU,EAAE,CAAC;gBACb,cAAc,EAAE,CAAC;aAClB,CAAC;YACF,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,QAAQ;gBACR,MAAM,EAAE;oBACN,MAAM,EAAE,KAAK;oBACb,QAAQ,EAAE;wBACR;4BACE,IAAI,EAAE,kBAAkB;4BACxB,MAAM,EAAE,KAAK;4BACb,MAAM,EAAE,4BAA4B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;yBACjF;qBACF;oBACD,OAAO,EAAE,OAAO;iBACjB;gBACD,aAAa,EAAE,OAAO;gBACtB,YAAY,EAAE,OAAO;gBACrB,KAAK,EAAE,4BAA4B,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;aAChF,CAAC;QACJ,CAAC;QAED,qBAAqB;QACrB,MAAM,EAAE,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,GAAG,aAAa,CACpD,IAAI,CAAC,KAAK,EACV,QAAQ,CACT,CAAC;QACF,IAAI,KAAK,EAAE,CAAC;YACV,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,QAAQ;gBACR,MAAM,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE;gBAC/D,aAAa;gBACb,YAAY,EAAE,aAAa;gBAC3B,KAAK,EAAE,KAAK,CAAC,MAAM;aACpB,CAAC;QACJ,CAAC;QAED,kEAAkE;QAClE,sEAAsE;QACtE,kEAAkE;QAClE,+DAA+D;QAC/D,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC7D,IAAI,QAAQ,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC9B,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACpC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE;YAC5D,WAAW,EAAE,kBAAkB;YAC/B,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,YAAY;YACvC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,SAAS;SAClC,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,WAAW,CAAC,OAAO,CAAC;QAEzC,0DAA0D;QAC1D,EAAE;QACF,wEAAwE;QACxE,wEAAwE;QACxE,uEAAuE;QACvE,oEAAoE;QACpE,2CAA2C;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa;YAC1C,CAAC,CAAC,YAAY,CAAC,KAAK,IAAI,aAAa,CAAC,KAAK;YAC3C,CAAC,CAAC,YAAY,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC;QAC7C,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,IAAI,SAAS,CAAC;QAEjD,IAAI,WAA+B,CAAC;QAEpC,IAAI,QAAQ,EAAE,CAAC;YACb,sBAAsB;YACtB,IAAI,CAAC,KAAK,GAAG,cAAc,CAAC;YAE5B,2BAA2B;YAC3B,MAAM,QAAQ,GAAG,IAAA,wBAAW,EAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC7D,MAAM,eAAe,GAAa;gBAChC,IAAI,EAAE,QAAQ,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI;gBACzD,OAAO,EACL,QAAQ,CAAC,IAAI,KAAK,OAAO;oBACvB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,QAAQ,CAAC;oBAC5C,CAAC,CAAC,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC1D,WAAW,EAAE,gBAAgB,CAAC,QAAQ,CAAC;aACxC,CAAC;YACF,kEAAkE;YAClE,iEAAiE;YACjE,qDAAqD;YACrD,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAC/B,QAAQ,EACR,eAAe,EACf,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAC5C,CAAC;QACJ,CAAC;QAED,OAAO;YACL,QAAQ;YACR,QAAQ;YACR,MAAM,EAAE,WAAW;YACnB,aAAa;YACb,YAAY;YACZ,WAAW;YACX,KAAK,EAAE,CAAC,WAAW,CAAC,MAAM;gBACxB,CAAC,CAAC,kBAAkB,WAAW,CAAC,QAAQ;qBACnC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;qBACxB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;qBAClB,IAAI,CAAC,IAAI,CAAC,EAAE;gBACjB,CAAC,CAAC,CAAC,SAAS;oBACV,CAAC,CAAC,sBAAsB,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,YAAY,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oBAC3F,CAAC,CAAC,SAAS;SAChB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,UAAU,CACR,SAAyB,EACzB,UAA0C,EAAE;QAE5C,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YACtC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,gBAAgB;gBAAE,MAAM;QAC3D,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAtQD,0CAsQC;AAED,gDAAgD;AAChD,SAAS,gBAAgB,CAAC,QAAsB;IAC9C,QAAQ,QAAQ,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,KAAK;YACR,OAAO,aAAa,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;QAClE,KAAK,QAAQ;YACX,OAAO,gBAAgB,QAAQ,CAAC,MAAM,GAAG,CAAC;QAC5C,KAAK,YAAY;YACf,OAAO,oBAAoB,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QAClH,KAAK,QAAQ;YACX,OAAO,gBAAgB,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC,aAAa,EAAE,CAAC;QACvE,KAAK,OAAO;YACV,OAAO,UAAU,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,QAAQ,CAAC,QAAQ,GAAG,CAAC;QAClG,KAAK,QAAQ;YACX,OAAO,gBAAgB,QAAQ,CAAC,MAAM,GAAG,CAAC;IAC9C,CAAC;AACH,CAAC"}