mycontext-cli 4.2.17 → 4.2.18

package/dist/agents/implementations/SolverAgent.js

@@ -0,0 +1,543 @@
+"use strict";
+/**
+ * SolverAgent
+ *
+ * Research sub-agent that implements Phase 2–4 of the "Structured Reasoning
+ * Systems" research plan:
+ *
+ *   NL → LLM → ConstraintSpec (JSON Brain) → Solver → SolveResult + metrics
+ *
+ * The solver operates in pure TypeScript with no external dependencies so the
+ * pipeline can run immediately. Swap the `_nativeSolve` call for a Z3 /
+ * OR-Tools binding once you want to scale to harder instances.
+ *
+ * Key design choices:
+ *  - Expression evaluation uses a recursive-descent parser (NO eval()).
+ *  - Three interchangeable strategies: brute-force, constraint-propagation,
+ *    llm-guided (LLM trims the domain before search).
+ *  - Every run produces a SolveTrace with operations count, search-space size,
+ *    pruning ratio — the numbers for Phase 4 / 5 measurement tables.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SolverAgent = void 0;
+exports.createFactorizationSpec = createFactorizationSpec;
+const hybridAIClient_1 = require("../../utils/hybridAIClient");
+const subAgentPersonalities_1 = require("../../constants/subAgentPersonalities");
+function tokenize(expr) {
+    const tokens = [];
+    let i = 0;
+    while (i < expr.length) {
+        const c = expr.charAt(i); // charAt always returns string, never undefined
+        if (/\s/.test(c)) {
+            i++;
+            continue;
+        }
+        if (/[0-9]/.test(c) || (c === "." && /[0-9]/.test(expr.charAt(i + 1)))) {
+            let s = "";
+            while (i < expr.length && /[0-9.]/.test(expr.charAt(i)))
+                s += expr.charAt(i++);
+            tokens.push({ kind: "num", value: parseFloat(s) });
+            continue;
+        }
+        if (/[a-zA-Z_]/.test(c)) {
+            let s = "";
+            while (i < expr.length && /[a-zA-Z0-9_]/.test(expr.charAt(i)))
+                s += expr.charAt(i++);
+            tokens.push({ kind: "ident", value: s });
+            continue;
+        }
+        // Two-char operators first
+        const two = expr.slice(i, i + 2);
+        if (["<=", ">=", "!=", "=="].includes(two)) {
+            tokens.push({ kind: "op", value: two });
+            i += 2;
+            continue;
+        }
+        tokens.push({ kind: "op", value: c });
+        i++;
+    }
+    return tokens;
+}
+function peek(s) {
+    return s.tokens[s.pos];
+}
+function consume(s) {
+    // Callers always guard with peek() before calling consume(), so this is safe
+    return s.tokens[s.pos++];
+}
+function parseAtom(s) {
+    const t = peek(s);
+    if (!t)
+        throw new Error("Unexpected end of expression");
+    if (t.kind === "num") {
+        consume(s);
+        return t.value;
+    }
+    if (t.kind === "ident") {
+        consume(s);
+        // Built-in functions
+        const next = peek(s);
+        if (next && next.kind === "op" && next.value === "(") {
+            consume(s); // consume '('
+            const arg = parseExpr(s);
+            const close = consume(s); // consume ')'
+            if (close.value !== ")")
+                throw new Error("Expected ')'");
+            switch (t.value) {
+                case "sqrt": return Math.sqrt(arg);
+                case "abs": return Math.abs(arg);
+                case "floor": return Math.floor(arg);
+                case "ceil": return Math.ceil(arg);
+                default: throw new Error(`Unknown function: ${t.value}`);
+            }
+        }
+        // Variable lookup
+        if (t.value in s.vars)
+            return s.vars[t.value];
+        throw new Error(`Unknown variable: ${t.value}`);
+    }
+    if (t.kind === "op" && t.value === "(") {
+        consume(s);
+        const val = parseExpr(s);
+        const close = consume(s);
+        if (close.value !== ")")
+            throw new Error("Expected ')'");
+        return val;
+    }
+    throw new Error(`Unexpected token: ${JSON.stringify(t)}`);
+}
+function parseUnary(s) {
+    const t = peek(s);
+    if (t && t.kind === "op" && t.value === "-") {
+        consume(s);
+        return -parseAtom(s);
+    }
+    return parseAtom(s);
+}
+function parseMulDiv(s) {
+    let left = parseUnary(s);
+    while (true) {
+        const t = peek(s);
+        if (!t || t.kind !== "op" || !["*", "/", "%"].includes(t.value))
+            break;
+        consume(s);
+        const right = parseUnary(s);
+        if (t.value === "*")
+            left *= right;
+        else if (t.value === "/")
+            left /= right;
+        else
+            left = left % right;
+    }
+    return left;
+}
+function parseExpr(s) {
+    let left = parseMulDiv(s);
+    while (true) {
+        const t = peek(s);
+        if (!t || t.kind !== "op" || !["+", "-"].includes(t.value))
+            break;
+        consume(s);
+        const right = parseMulDiv(s);
+        left = t.value === "+" ? left + right : left - right;
+    }
+    return left;
+}
+/**
+ * Evaluate a constraint expression string against a variable assignment.
+ * Expressions that contain a comparison operator return a boolean.
+ * Pure arithmetic expressions return true iff the result is non-zero.
+ */
+function evaluateConstraint(expr, vars) {
+    const COMP_OPS = ["<=", ">=", "!=", "==", "=", "<", ">"];
+    // Find the leftmost comparison operator that isn't inside parentheses
+    let depth = 0;
+    for (let i = 0; i < expr.length; i++) {
+        if (expr[i] === "(") {
+            depth++;
+            continue;
+        }
+        if (expr[i] === ")") {
+            depth--;
+            continue;
+        }
+        if (depth > 0)
+            continue;
+        for (const op of COMP_OPS) {
+            if (expr.slice(i, i + op.length) === op) {
+                // Make sure we're not inside a multi-char op preceded by < / > / !
+                const prev = expr[i - 1];
+                if (op.length === 1 && prev && ["<", ">", "!", "="].includes(prev))
+                    continue;
+                const lhsStr = expr.slice(0, i).trim();
+                const rhsStr = expr.slice(i + op.length).trim();
+                if (!lhsStr || !rhsStr)
+                    continue;
+                const lhs = evalArith(lhsStr, vars);
+                const rhs = evalArith(rhsStr, vars);
+                const EPS = 1e-9;
+                switch (op) {
+                    case "=":
+                    case "==": return Math.abs(lhs - rhs) <= EPS;
+                    case "<=": return lhs <= rhs + EPS;
+                    case ">=": return lhs >= rhs - EPS;
+                    case "!=": return Math.abs(lhs - rhs) > EPS;
+                    case "<": return lhs < rhs - EPS;
+                    case ">": return lhs > rhs + EPS;
+                }
+            }
+        }
+    }
+    // No comparison found — treat numeric result as truthy
+    return evalArith(expr, vars) !== 0;
+}
+function evalArith(expr, vars) {
+    const state = { tokens: tokenize(expr), pos: 0, vars };
+    const result = parseExpr(state);
+    if (state.pos < state.tokens.length) {
+        throw new Error(`Unexpected token at position ${state.pos}: ${JSON.stringify(state.tokens[state.pos])}`);
+    }
+    return result;
+}
+// ---------------------------------------------------------------------------
+// Domain generation
+// ---------------------------------------------------------------------------
+function generateDomain(v) {
+    if (v.type === "boolean") {
+        return v.domain?.values ? v.domain.values : [false, true];
+    }
+    if (v.domain?.values)
+        return v.domain.values;
+    const min = v.domain?.min ?? 0;
+    const max = v.domain?.max ?? 1000;
+    if (max - min > 1000000) {
+        throw new Error(`Variable "${v.name}" has domain size ${max - min + 1}. ` +
+            "Cap the domain with searchBounds.maxIterations or reduce the range.");
+    }
+    const values = [];
+    for (let x = min; x <= max; x++)
+        values.push(x);
+    return values;
+}
+// ---------------------------------------------------------------------------
+// Constraint propagation — reduce variable domains before brute-force pass
+// ---------------------------------------------------------------------------
+/**
+ * Very lightweight propagation: for each variable, eliminate values that
+ * violate a unary constraint (one with only that variable).
+ * Full arc-consistency (AC-3) would be more powerful; this handles the
+ * common Phase 3 cases like `a >= 2` and `b <= sqrt(N)`.
+ */
+function propagateDomains(spec, domains) {
+    let prunedCount = 0;
+    for (const v of spec.variables) {
+        const dom = domains.get(v.name);
+        if (!dom)
+            continue;
+        const filtered = dom.filter((val) => {
+            const assignment = {};
+            for (const [k, existing] of domains.entries()) {
+                if (k === v.name)
+                    assignment[k] = val;
+                else
+                    assignment[k] = existing[0]; // placeholder
+            }
+            for (const ce of spec.constraints) {
+                // Only apply constraints that reference solely this variable
+                const usedVars = getVariableNames(ce.expr);
+                if (usedVars.size === 1 && usedVars.has(v.name)) {
+                    try {
+                        if (!evaluateConstraint(ce.expr, assignment))
+                            return false;
+                    }
+                    catch {
+                        // If evaluation fails (other var not bound), skip
+                    }
+                }
+            }
+            return true;
+        });
+        prunedCount += dom.length - filtered.length;
+        domains.set(v.name, filtered);
+    }
+    return { prunedCount };
+}
+function getVariableNames(expr) {
+    const names = new Set();
+    const tokens = tokenize(expr);
+    const builtins = new Set(["sqrt", "abs", "floor", "ceil"]);
+    for (let i = 0; i < tokens.length; i++) {
+        const t = tokens[i]; // safe: i is within bounds
+        if (t.kind === "ident" && !builtins.has(t.value)) {
+            // Skip if followed by '(' (function call, not variable)
+            const next = i + 1 < tokens.length ? tokens[i + 1] : undefined;
+            if (!next || next.kind !== "op" || next.value !== "(") {
+                names.add(t.value);
+            }
+        }
+    }
+    return names;
+}
+function* cartesianProduct(variables, domains) {
+    if (variables.length === 0) {
+        yield {};
+        return;
+    }
+    const [head, ...tail] = variables;
+    if (head === undefined)
+        return;
+    const headDomain = domains.get(head) ?? [];
+    for (const val of headDomain) {
+        for (const rest of cartesianProduct(tail, domains)) {
+            yield { [head]: val, ...rest };
+        }
+    }
+}
+function nativeSolve(spec, opts) {
+    const startMs = Date.now();
+    const solutions = [];
+    const steps = [];
+    // Build initial domains
+    const domains = new Map();
+    for (const v of spec.variables) {
+        domains.set(v.name, generateDomain(v));
+    }
+    let prunedByPropagation = 0;
+    // Constraint propagation pass (reduces domains before iteration)
+    if (opts.method === "constraint-propagation" || opts.method === "llm-guided") {
+        const pr = propagateDomains(spec, domains);
+        prunedByPropagation = pr.prunedCount;
+    }
+    // For llm-guided, swap in the LLM-narrowed domains
+    if (opts.method === "llm-guided" && opts.llmGuidedDomains) {
+        for (const [k, v] of opts.llmGuidedDomains.entries()) {
+            domains.set(k, v);
+        }
+    }
+    const searchSpaceSize = [...domains.values()].reduce((acc, d) => acc * d.length, 1);
+    const varNames = spec.variables.map((v) => v.name);
+    let iteration = 0;
+    let prunedDuringSearch = prunedByPropagation;
+    const MAX_TRACE_STEPS = 200; // cap trace verbosity
+    for (const assignment of cartesianProduct(varNames, domains)) {
+        if (iteration >= opts.maxIterations)
+            break;
+        if (Date.now() - startMs > opts.timeoutMs)
+            break;
+        let allPassed = true;
+        let violatedConstraint;
+        for (const ce of spec.constraints) {
+            try {
+                if (!evaluateConstraint(ce.expr, assignment)) {
+                    allPassed = false;
+                    violatedConstraint = ce.expr;
+                    prunedDuringSearch++;
+                    break;
+                }
+            }
+            catch (_err) {
+                // Evaluation error — treat as constraint failure
+                allPassed = false;
+                violatedConstraint = ce.expr + " [eval error]";
+                break;
+            }
+        }
+        if (steps.length < MAX_TRACE_STEPS) {
+            steps.push({ iteration, candidate: assignment, violatedConstraint, passed: allPassed });
+        }
+        if (allPassed) {
+            solutions.push(assignment);
+            if (!opts.findAll)
+                break;
+        }
+        iteration++;
+    }
+    const runtimeMs = Date.now() - startMs;
+    const exploredCount = iteration;
+    const reductionRatio = searchSpaceSize > 0 ? exploredCount / searchSpaceSize : 1;
+    const trace = {
+        method: opts.method,
+        searchSpaceSize,
+        exploredCount,
+        prunedCount: prunedDuringSearch,
+        reductionRatio,
+        runtimeMs,
+        steps,
+    };
+    const pct = (reductionRatio * 100).toFixed(2);
+    const summary = solutions.length > 0
+        ? `Found ${solutions.length} solution(s). Explored ${exploredCount.toLocaleString()} / ${searchSpaceSize.toLocaleString()} candidates (${pct}% of search space) in ${runtimeMs}ms.`
+        : `No solution found. Explored ${exploredCount.toLocaleString()} / ${searchSpaceSize.toLocaleString()} candidates in ${runtimeMs}ms.`;
+    return { satisfiable: solutions.length > 0, solutions, trace, summary };
+}
+// ---------------------------------------------------------------------------
+// LLM translation: natural language → ConstraintSpec
+// ---------------------------------------------------------------------------
+const NL_TO_SPEC_SCHEMA = `{
+  "problem": {
+    "id": "string (unique, use a short slug)",
+    "type": "factorization | sat | csp | custom",
+    "description": "string",
+    "input": { "...": "raw numeric/string inputs" },
+    "createdAt": "ISO timestamp"
+  },
+  "variables": [
+    {
+      "name": "string",
+      "type": "integer | boolean | real",
+      "domain": { "min": number, "max": number }
+    }
+  ],
+  "constraints": [
+    { "expr": "arithmetic equality or inequality string", "description": "string" }
+  ],
+  "objective": { "type": "satisfy" },
+  "searchBounds": { "maxIterations": 50000, "timeoutMs": 10000 }
+}`;
+// ---------------------------------------------------------------------------
+// SolverAgent implementation
+// ---------------------------------------------------------------------------
+class SolverAgent {
+    constructor() {
+        this.name = "SolverAgent";
+        this.description = "Translates natural-language problems to ConstraintSpec JSON and solves them with instrumented search — research tooling for the Structured Reasoning project";
+        const p = (0, subAgentPersonalities_1.getSubAgentPersonality)(this.name);
+        if (!p)
+            throw new Error(`Personality not found for ${this.name}`);
+        this.personality = p.systemPrompt;
+        this.llmProvider = p.llmProvider;
+        this.expertise = p.expertise;
+        this.ai = new hybridAIClient_1.HybridAIClient();
+    }
+    async validate(input) {
+        return !!(input.naturalLanguage || input.spec);
+    }
+    async run(input) {
+        let spec;
+        let translatedFromNL = false;
+        if (input.spec) {
+            spec = input.spec;
+        }
+        else if (input.naturalLanguage) {
+            spec = await this._translateNL(input.naturalLanguage);
+            translatedFromNL = true;
+        }
+        else {
+            throw new Error("SolverAgent requires either naturalLanguage or spec input");
+        }
+        const method = input.method ?? "constraint-propagation";
+        const findAll = input.findAll ?? false;
+        const maxIterations = spec.searchBounds?.maxIterations ?? 100000;
+        const timeoutMs = spec.searchBounds?.timeoutMs ?? 15000;
+        let llmGuidedDomains;
+        if (method === "llm-guided") {
+            llmGuidedDomains = await this._llmNarrowDomains(spec);
+        }
+        const result = nativeSolve(spec, {
+            method,
+            findAll,
+            maxIterations,
+            timeoutMs,
+            llmGuidedDomains,
+        });
+        return { spec, result, translatedFromNL };
+    }
+    // -------------------------------------------------------------------------
+    // LLM: natural language → ConstraintSpec
+    // -------------------------------------------------------------------------
+    async _translateNL(nl) {
+        const prompt = `You are a constraint programming expert. Convert the following natural-language problem into a structured JSON constraint specification.
+
+PROBLEM:
+${nl}
+
+Return ONLY valid JSON that conforms exactly to this schema:
+${NL_TO_SPEC_SCHEMA}
+
+Rules:
+- Use integer domains unless the problem explicitly needs reals.
+- For factorization of N: variables a, b with domain [2, sqrt(N)], constraints ["a * b = N", "a <= b"].
+- For SAT: boolean variables, constraints expressed as "var1 = true", etc.
+- Keep domain sizes reasonable (under 100,000 total combinations).
+- Set createdAt to the current ISO timestamp.
+- The id should be a short descriptive slug like "factor-589".
+
+Return ONLY the JSON object, no explanation:`;
+        const { text } = await this.ai.generateText(prompt);
+        const jsonMatch = text.match(/\{[\s\S]*\}/);
+        if (!jsonMatch)
+            throw new Error("LLM did not return valid JSON for constraint spec");
+        const parsed = JSON.parse(jsonMatch[0]);
+        // Ensure required fields exist
+        if (!parsed.problem || !parsed.variables || !parsed.constraints) {
+            throw new Error("LLM-generated spec is missing required fields (problem/variables/constraints)");
+        }
+        return parsed;
+    }
+    // -------------------------------------------------------------------------
+    // LLM: narrow domains before search (llm-guided strategy)
+    // -------------------------------------------------------------------------
+    async _llmNarrowDomains(spec) {
+        const prompt = `You are a mathematical reasoning assistant. Given this constraint problem, suggest a NARROWED domain for each variable that is very likely to contain the solution while being much smaller than the original domain.
+
+PROBLEM SPEC:
+${JSON.stringify(spec, null, 2)}
+
+Return ONLY a JSON object mapping variable names to arrays of up to 50 candidate values, e.g.:
+{ "a": [17, 19, 23, 29, 31], "b": [19, 23, 29, 31, 37] }
+
+Think step by step about what values are likely to satisfy all constraints, then return the JSON:`;
+        try {
+            const { text } = await this.ai.generateText(prompt);
+            const jsonMatch = text.match(/\{[\s\S]*\}/);
+            if (!jsonMatch)
+                throw new Error("No JSON in LLM domain response");
+            const parsed = JSON.parse(jsonMatch[0]);
+            const result = new Map();
+            for (const [k, v] of Object.entries(parsed)) {
+                if (Array.isArray(v))
+                    result.set(k, v);
+            }
+            return result;
+        }
+        catch {
+            // Fall back to full domains — solver still works, just without LLM pruning
+            return new Map();
+        }
+    }
+    async getStatus() {
+        return {
+            name: this.name,
+            status: "idle",
+            errorCount: 0,
+            successCount: 0,
+        };
+    }
+}
+exports.SolverAgent = SolverAgent;
+// ---------------------------------------------------------------------------
+// Convenience factory for direct use outside the orchestrator
+// ---------------------------------------------------------------------------
+function createFactorizationSpec(N) {
+    const sqrtN = Math.floor(Math.sqrt(N));
+    return {
+        problem: {
+            id: `factor-${N}`,
+            type: "factorization",
+            description: `Find two integers a and b such that a * b = ${N}`,
+            input: { N },
+            createdAt: new Date().toISOString(),
+        },
+        variables: [
+            { name: "a", type: "integer", domain: { min: 2, max: sqrtN } },
+            { name: "b", type: "integer", domain: { min: 2, max: N } },
+        ],
+        constraints: [
+            { expr: `a * b = ${N}`, description: "Product must equal N" },
+            { expr: "a <= b", description: "Canonical order (avoid duplicate pairs)" },
+        ],
+        objective: { type: "satisfy" },
+        searchBounds: { maxIterations: 200000, timeoutMs: 30000 },
+    };
+}
+//# sourceMappingURL=SolverAgent.js.map

package/dist/agents/implementations/SolverAgent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SolverAgent.js","sourceRoot":"","sources":["../../../src/agents/implementations/SolverAgent.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;GAkBG;;;AAulBH,0DAqBC;AA1mBD,+DAA4D;AAE5D,iFAA+E;AAuB/E,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,gDAAgD;QAC1E,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAAC,CAAC,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAEpC,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnD,SAAS;QACX,CAAC;QAED,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YACrF,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACzC,SAAS;QACX,CAAC;QAED,2BAA2B;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACxC,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC,EAAE,CAAC;IACN,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAgBD,SAAS,IAAI,CAAC,CAAa;IACzB,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,OAAO,CAAC,CAAa;IAC5B,6EAA6E;IAC7E,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAE,CAAC;AAC5B,CAAC;AAED,SAAS,SAAS,CAAC,CAAa;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;IAExD,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAAC,OAAO,CAAC,CAAC,KAAK,CAAC;IAAC,CAAC;IAErD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QACvB,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,qBAAqB;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;YACrD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;YAC1B,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc;YACxC,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;YACzD,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC;gBAChB,KAAK,MAAM,CAAC,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnC,KAAK,KAAK,CAAC,CAAE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAClC,KAAK,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACrC,KAAK,MAAM,CAAC,CAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACpC,OAAO,CAAC,CAAC,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;QACD,kBAAkB;QAClB,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAW,CAAC;QACxD,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QACvC,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,KAAK,CAAC,KAAK,KAAK,GAAG;YAAE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;QACzD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,qBAAqB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED,SAAS,UAAU,CAAC,CAAa;IAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QAC5C,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;AACtB,CAAC;AAED,SAAS,WAAW,CAAC,CAAa;IAChC,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,MAAM;QACvE,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG;YAAE,IAAI,IAAI,KAAK,CAAC;aAC9B,IAAI,CAAC,CAAC,KAAK,KAAK,GAAG;YAAE,IAAI,IAAI,KAAK,CAAC;;YACnC,IAAI,GAAG,IAAI,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,CAAa;IAC9B,IAAI,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IAC1B,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,MAAM;QAClE,OAAO,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,GAAG,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,SAAS,kBAAkB,CAAC,IAAY,EAAE,IAAgB;IACxD,MAAM,QAAQ,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAEzD,sEAAsE;IACtE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAAC,KAAK,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAC3C,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YAAC,KAAK,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC;YAAE,SAAS;QAExB,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;gBACxC,mEAAmE;gBACnE,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACzB,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAE7E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;oBAAE,SAAS;gBAEjC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACpC,MAAM,GAAG,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACpC,MAAM,GAAG,GAAG,IAAI,CAAC;gBACjB,QAAQ,EAAE,EAAE,CAAC;oBACX,KAAK,GAAG,CAAC;oBAAC,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC;oBACvD,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;oBACnC,KAAK,IAAI,CAAC,CAAC,OAAO,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;oBACnC,KAAK,IAAI,CAAC,CAAC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;oBAC5C,KAAK,GAAG,CAAC,CAAE,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;oBAClC,KAAK,GAAG,CAAC,CAAE,OAAO,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,OAAO,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;AACrC,CAAC;AAED,SAAS,SAAS,CAAC,IAAY,EAAE,IAAgB;IAC/C,MAAM,KAAK,GAAe,EAAE,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC;IACnE,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAChC,IAAI,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,IAAI,KAAK,CAAC,gCAAgC,KAAK,CAAC,GAAG,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3G,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E,SAAS,cAAc,CAAC,CAAqB;IAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,MAAM,CAAC,MAAoB,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3E,CAAC;IAED,IAAI,CAAC,CAAC,MAAM,EAAE,MAAM;QAAE,OAAO,CAAC,CAAC,MAAM,CAAC,MAAkB,CAAC;IAEzD,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC;IAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC;IAElC,IAAI,GAAG,GAAG,GAAG,GAAG,OAAS,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CACb,aAAa,CAAC,CAAC,IAAI,qBAAqB,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI;YACvD,qEAAqE,CACxE,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,2EAA2E;AAC3E,8EAA8E;AAE9E;;;;;GAKG;AACH,SAAS,gBAAgB,CACvB,IAAoB,EACpB,OAA0C;IAE1C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG;YAAE,SAAS;QAEnB,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;YAClC,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;gBAC9C,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI;oBAAE,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;;oBACjC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAqB,CAAC,CAAC,cAAc;YACtE,CAAC;YAED,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAClC,6DAA6D;gBAC7D,MAAM,QAAQ,GAAG,gBAAgB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBAC3C,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChD,IAAI,CAAC;wBACH,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC;4BAAE,OAAO,KAAK,CAAC;oBAC7D,CAAC;oBAAC,MAAM,CAAC;wBACP,kDAAkD;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,WAAW,IAAI,GAAG,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC5C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,CAAC;AACzB,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY;IACpC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC;IAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,2BAA2B;QACjD,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACjD,wDAAwD;YACxD,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,SAAS,CAAC;YAChE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;gBACtD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAcD,QAAQ,CAAC,CAAC,gBAAgB,CACxB,SAAmB,EACnB,OAA0C;IAE1C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAAC,MAAM,EAAE,CAAC;QAAC,OAAO;IAAC,CAAC;IAEjD,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC;IAClC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO;IAC/B,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAE3C,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACnD,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;QACjC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,IAAoB,EAAE,IAAmB;IAC5D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAiB,EAAE,CAAC;IACnC,MAAM,KAAK,GAAgB,EAAE,CAAC;IAE9B,wBAAwB;IACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAE5B,iEAAiE;IACjE,IAAI,IAAI,CAAC,MAAM,KAAK,wBAAwB,IAAI,IAAI,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;QAC7E,MAAM,EAAE,GAAG,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC3C,mBAAmB,GAAG,EAAE,CAAC,WAAW,CAAC;IACvC,CAAC;IAED,mDAAmD;IACnD,IAAI,IAAI,CAAC,MAAM,KAAK,YAAY,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC1D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,MAAM,eAAe,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAClD,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAC1B,CAAC,CACF,CAAC;IAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,kBAAkB,GAAG,mBAAmB,CAAC;IAC7C,MAAM,eAAe,GAAG,GAAG,CAAC,CAAC,sBAAsB;IAEnD,KAAK,MAAM,UAAU,IAAI,gBAAgB,CAAC,QAAQ,EAAE,OAAO,CAAC,EAAE,CAAC;QAC7D,IAAI,SAAS,IAAI,IAAI,CAAC,aAAa;YAAE,MAAM;QAC3C,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,GAAG,IAAI,CAAC,SAAS;YAAE,MAAM;QAEjD,IAAI,SAAS,GAAG,IAAI,CAAC;QACrB,IAAI,kBAAsC,CAAC;QAE3C,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC;oBAC7C,SAAS,GAAG,KAAK,CAAC;oBAClB,kBAAkB,GAAG,EAAE,CAAC,IAAI,CAAC;oBAC7B,kBAAkB,EAAE,CAAC;oBACrB,MAAM;gBACR,CAAC;YACH,CAAC;YAAC,OAAO,IAAI,EAAE,CAAC;gBACd,iDAAiD;gBACjD,SAAS,GAAG,KAAK,CAAC;gBAClB,kBAAkB,GAAG,EAAE,CAAC,IAAI,GAAG,eAAe,CAAC;gBAC/C,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC;YACnC,KAAK,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QAC1F,CAAC;QAED,IAAI,SAAS,EAAE,CAAC;YACd,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,MAAM;QAC3B,CAAC;QAED,SAAS,EAAE,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC;IACvC,MAAM,aAAa,GAAG,SAAS,CAAC;IAChC,MAAM,cAAc,GAAG,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjF,MAAM,KAAK,GAAe;QACxB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,eAAe;QACf,aAAa;QACb,WAAW,EAAE,kBAAkB;QAC/B,cAAc;QACd,SAAS;QACT,KAAK;KACN,CAAC;IAEF,MAAM,GAAG,GAAG,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC9C,MAAM,OAAO,GACX,SAAS,CAAC,MAAM,GAAG,CAAC;QAClB,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,0BAA0B,aAAa,CAAC,cAAc,EAAE,MAAM,eAAe,CAAC,cAAc,EAAE,gBAAgB,GAAG,yBAAyB,SAAS,KAAK;QACnL,CAAC,CAAC,+BAA+B,aAAa,CAAC,cAAc,EAAE,MAAM,eAAe,CAAC,cAAc,EAAE,kBAAkB,SAAS,KAAK,CAAC;IAE1I,OAAO,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAC1E,CAAC;AAED,8EAA8E;AAC9E,qDAAqD;AACrD,8EAA8E;AAE9E,MAAM,iBAAiB,GAAG;;;;;;;;;;;;;;;;;;;;EAoBxB,CAAC;AAEH,8EAA8E;AAC9E,6BAA6B;AAC7B,8EAA8E;AAE9E,MAAa,WAAW;IAUtB;QATA,SAAI,GAAG,aAAa,CAAC;QACrB,gBAAW,GACT,8JAA8J,CAAC;QAQ/J,MAAM,CAAC,GAAG,IAAA,8CAAsB,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,6BAA6B,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAClE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,YAAY,CAAC;QAClC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;QAC7B,IAAI,CAAC,EAAE,GAAG,IAAI,+BAAc,EAAE,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,KAAkB;QAC/B,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,eAAe,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,KAAkB;QAC1B,IAAI,IAAoB,CAAC;QACzB,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAE7B,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;YACf,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACpB,CAAC;aAAM,IAAI,KAAK,CAAC,eAAe,EAAE,CAAC;YACjC,IAAI,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YACtD,gBAAgB,GAAG,IAAI,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAC/E,CAAC;QAED,MAAM,MAAM,GAAiB,KAAK,CAAC,MAAM,IAAI,wBAAwB,CAAC;QACtE,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC;QACvC,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,EAAE,aAAa,IAAI,MAAO,CAAC;QAClE,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,EAAE,SAAS,IAAI,KAAM,CAAC;QAEzD,IAAI,gBAA+D,CAAC;QAEpE,IAAI,MAAM,KAAK,YAAY,EAAE,CAAC;YAC5B,gBAAgB,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,EAAE;YAC/B,MAAM;YACN,OAAO;YACP,aAAa;YACb,SAAS;YACT,gBAAgB;SACjB,CAAC,CAAC;QAEH,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC5C,CAAC;IAED,4EAA4E;IAC5E,yCAAyC;IACzC,4EAA4E;IAEpE,KAAK,CAAC,YAAY,CAAC,EAAU;QACnC,MAAM,MAAM,GAAG;;;EAGjB,EAAE;;;EAGF,iBAAiB;;;;;;;;;;6CAU0B,CAAC;QAE1C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC5C,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAErF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAmB,CAAC;QAE1D,+BAA+B;QAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAChE,MAAM,IAAI,KAAK,CAAC,+EAA+E,CAAC,CAAC;QACnG,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,4EAA4E;IAC5E,0DAA0D;IAC1D,4EAA4E;IAEpE,KAAK,CAAC,iBAAiB,CAC7B,IAAoB;QAEpB,MAAM,MAAM,GAAG;;;EAGjB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;;;;;kGAKmE,CAAC;QAE/F,IAAI,CAAC;YACH,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAC5C,IAAI,CAAC,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;YAElE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAyC,CAAC;YAChF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgC,CAAC;YACvD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACzC,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAAC,MAAM,CAAC;YACP,2EAA2E;YAC3E,OAAO,IAAI,GAAG,EAAE,CAAC;QACnB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS;QACb,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,MAAe;YACvB,UAAU,EAAE,CAAC;YACb,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;CACF;AAzID,kCAyIC;AAED,8EAA8E;AAC9E,8DAA8D;AAC9D,8EAA8E;AAE9E,SAAgB,uBAAuB,CAAC,CAAS;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO;QACL,OAAO,EAAE;YACP,EAAE,EAAE,UAAU,CAAC,EAAE;YACjB,IAAI,EAAE,eAA8B;YACpC,WAAW,EAAE,+CAA+C,CAAC,EAAE;YAC/D,KAAK,EAAE,EAAE,CAAC,EAAE;YACZ,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC;QACD,SAAS,EAAE;YACT,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE;YAC9D,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE;SAC3D;QACD,WAAW,EAAE;YACX,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,EAAE,sBAAsB,EAAE;YAC7D,EAAE,IAAI,EAAE,QAAQ,EAAS,WAAW,EAAE,yCAAyC,EAAE;SAClF;QACD,SAAS,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE;QAC9B,YAAY,EAAE,EAAE,aAAa,EAAE,MAAO,EAAE,SAAS,EAAE,KAAM,EAAE;KAC5D,CAAC;AACJ,CAAC"}