@higher.archi/boe 1.0.0

package/dist/engines/constraint/strategy.js

@@ -0,0 +1,529 @@
+"use strict";
+/**
+ * Constraint Satisfaction Engine Strategy
+ *
+ * Implements backtracking search with constraint propagation.
+ * Uses MRV (Minimum Remaining Values) heuristic for variable ordering.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.constraintStrategy = exports.ConstraintStrategy = void 0;
+const core_1 = require("../../core");
+// ========================================
+// Constraint Checking
+// ========================================
+/**
+ * Check if a constraint is satisfied given current assignments.
+ * Returns true if satisfied, false if violated, undefined if can't be evaluated yet.
+ */
+function checkConstraint(constraint, state, variables, factContext) {
+    // Build binding context with assigned values
+    const bindingContext = { ...factContext };
+    // Check if all variables for this constraint are assigned
+    for (const varIndex of constraint.variableIndices) {
+        if (!state.assigned[varIndex]) {
+            // Can't evaluate yet - not all variables assigned
+            return undefined;
+        }
+        const variable = variables[varIndex];
+        const value = state.assignment[varIndex];
+        // Create a pseudo-fact for the variable
+        // If value is an object, use it as data; otherwise wrap it
+        const data = (typeof value === 'object' && value !== null) ? value : value;
+        bindingContext[variable.name] = {
+            id: variable.name,
+            type: '_variable',
+            data: data
+        };
+    }
+    // Evaluate the constraint condition
+    try {
+        return (0, core_1.evaluateCondition)(constraint.condition, bindingContext);
+    }
+    catch (e) {
+        // If evaluation fails, treat as violated
+        return false;
+    }
+}
+/**
+ * Check all constraints involving a specific variable.
+ * Returns list of violated constraint IDs, or empty if all satisfied.
+ */
+function checkConstraintsForVariable(varIndex, state, ruleSet, factContext) {
+    const conflicts = [];
+    const constraintIndices = ruleSet.constraintsByVariable.get(varIndex) ?? [];
+    for (const ci of constraintIndices) {
+        const constraint = ruleSet.constraints[ci];
+        const result = checkConstraint(constraint, state, ruleSet.variables, factContext);
+        if (result === false) {
+            // Constraint violated
+            const values = {};
+            for (const vi of constraint.variableIndices) {
+                if (state.assigned[vi]) {
+                    values[ruleSet.variables[vi].name] = state.assignment[vi];
+                }
+            }
+            conflicts.push({
+                constraintId: constraint.id,
+                constraintName: constraint.name,
+                variables: constraint.variableNames,
+                values
+            });
+        }
+    }
+    return conflicts;
+}
+// ========================================
+// Variable Ordering (MRV Heuristic)
+// ========================================
+/**
+ * Select the next unassigned variable using MRV (Minimum Remaining Values).
+ * This heuristic picks the variable with the smallest remaining domain,
+ * which helps fail fast and prune the search space.
+ */
+function selectUnassignedVariable(state, ruleSet) {
+    let bestIndex;
+    let bestDomainSize = Infinity;
+    for (let i = 0; i < ruleSet.variables.length; i++) {
+        if (!state.assigned[i]) {
+            const domainSize = state.domains[i].length;
+            // If domain is empty, this path is impossible
+            if (domainSize === 0) {
+                return i; // Return it so we can backtrack
+            }
+            if (domainSize < bestDomainSize) {
+                bestDomainSize = domainSize;
+                bestIndex = i;
+            }
+        }
+    }
+    return bestIndex;
+}
+/**
+ * Static variable ordering - just pick the first unassigned.
+ */
+function selectUnassignedVariableStatic(state, ruleSet) {
+    for (let i = 0; i < ruleSet.variables.length; i++) {
+        if (!state.assigned[i]) {
+            return i;
+        }
+    }
+    return undefined;
+}
+// ========================================
+// Forward Checking (Domain Pruning)
+// ========================================
+/**
+ * After assigning a variable, prune inconsistent values from neighboring domains.
+ * Returns true if all domains still have values, false if any domain is emptied.
+ */
+function forwardCheck(assignedVarIndex, state, ruleSet, factContext) {
+    const constraintIndices = ruleSet.constraintsByVariable.get(assignedVarIndex) ?? [];
+    for (const ci of constraintIndices) {
+        const constraint = ruleSet.constraints[ci];
+        // Find unassigned variables in this constraint
+        for (const varIndex of constraint.variableIndices) {
+            if (state.assigned[varIndex])
+                continue;
+            // Try each value in the domain
+            const validValues = [];
+            for (const value of state.domains[varIndex]) {
+                // Temporarily assign
+                state.assignment[varIndex] = value;
+                state.assigned[varIndex] = true;
+                // Check constraint
+                const result = checkConstraint(constraint, state, ruleSet.variables, factContext);
+                // Unassign
+                state.assignment[varIndex] = undefined;
+                state.assigned[varIndex] = false;
+                // Keep value if constraint is satisfied or can't be evaluated yet
+                if (result !== false) {
+                    validValues.push(value);
+                }
+                else {
+                    state.stats.pruned++;
+                }
+            }
+            state.domains[varIndex] = validValues;
+            // If domain is empty, forward check failed
+            if (validValues.length === 0) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+// ========================================
+// Backtracking Search
+// ========================================
+/**
+ * Recursive backtracking search.
+ * Returns true if a solution is found.
+ */
+function backtrack(state, ruleSet, factContext, options, useForwardCheck) {
+    // Check limits
+    state.stats.iterations++;
+    state.stats.elapsed = Date.now() - state.startTime;
+    if (state.stats.iterations >= state.maxIterations) {
+        return false;
+    }
+    if (state.stats.elapsed >= state.timeout) {
+        return false;
+    }
+    // Select next variable
+    const selectVar = ruleSet.config.variableOrdering === 'mrv'
+        ? selectUnassignedVariable
+        : selectUnassignedVariableStatic;
+    const varIndex = selectVar(state, ruleSet);
+    // If no unassigned variables, we have a solution
+    if (varIndex === undefined) {
+        return true;
+    }
+    const variable = ruleSet.variables[varIndex];
+    const domain = state.domains[varIndex];
+    // If domain is empty, backtrack
+    if (domain.length === 0) {
+        return false;
+    }
+    // Save domain state for backtracking
+    const savedDomains = state.domains.map(d => [...d]);
+    // Try each value in the domain
+    for (const value of domain) {
+        // Assign value
+        state.assignment[varIndex] = value;
+        state.assigned[varIndex] = true;
+        // Callback
+        if (options.onAssign) {
+            options.onAssign(variable.name, value);
+        }
+        // Check constraints
+        const conflicts = checkConstraintsForVariable(varIndex, state, ruleSet, factContext);
+        if (conflicts.length === 0) {
+            // No immediate conflicts
+            // Forward check if enabled
+            let consistent = true;
+            if (useForwardCheck) {
+                consistent = forwardCheck(varIndex, state, ruleSet, factContext);
+            }
+            if (consistent) {
+                // Recurse
+                if (backtrack(state, ruleSet, factContext, options, useForwardCheck)) {
+                    return true;
+                }
+            }
+        }
+        // Backtrack
+        state.assignment[varIndex] = undefined;
+        state.assigned[varIndex] = false;
+        state.domains = savedDomains.map(d => [...d]); // Restore domains
+        state.stats.backtracks++;
+        if (options.onBacktrack) {
+            options.onBacktrack(variable.name);
+        }
+    }
+    return false;
+}
+/**
+ * Search for all solutions up to a limit.
+ */
+function backtrackAll(state, ruleSet, factContext, options, solutions, maxSolutions, useForwardCheck) {
+    // Check limits
+    state.stats.iterations++;
+    state.stats.elapsed = Date.now() - state.startTime;
+    if (state.stats.iterations >= state.maxIterations) {
+        return;
+    }
+    if (state.stats.elapsed >= state.timeout) {
+        return;
+    }
+    if (solutions.length >= maxSolutions) {
+        return;
+    }
+    // Select next variable
+    const selectVar = ruleSet.config.variableOrdering === 'mrv'
+        ? selectUnassignedVariable
+        : selectUnassignedVariableStatic;
+    const varIndex = selectVar(state, ruleSet);
+    // If no unassigned variables, we have a solution
+    if (varIndex === undefined) {
+        // Build assignment object
+        const assignment = {};
+        for (let i = 0; i < ruleSet.variables.length; i++) {
+            assignment[ruleSet.variables[i].name] = state.assignment[i];
+        }
+        solutions.push(assignment);
+        if (options.onSolution) {
+            options.onSolution(assignment);
+        }
+        return;
+    }
+    const variable = ruleSet.variables[varIndex];
+    const domain = state.domains[varIndex];
+    if (domain.length === 0) {
+        return;
+    }
+    const savedDomains = state.domains.map(d => [...d]);
+    for (const value of domain) {
+        state.assignment[varIndex] = value;
+        state.assigned[varIndex] = true;
+        if (options.onAssign) {
+            options.onAssign(variable.name, value);
+        }
+        const conflicts = checkConstraintsForVariable(varIndex, state, ruleSet, factContext);
+        if (conflicts.length === 0) {
+            let consistent = true;
+            if (useForwardCheck) {
+                consistent = forwardCheck(varIndex, state, ruleSet, factContext);
+            }
+            if (consistent) {
+                backtrackAll(state, ruleSet, factContext, options, solutions, maxSolutions, useForwardCheck);
+            }
+        }
+        state.assignment[varIndex] = undefined;
+        state.assigned[varIndex] = false;
+        state.domains = savedDomains.map(d => [...d]);
+        state.stats.backtracks++;
+        if (options.onBacktrack) {
+            options.onBacktrack(variable.name);
+        }
+        // Check if we've found enough solutions
+        if (solutions.length >= maxSolutions) {
+            return;
+        }
+    }
+}
+// ========================================
+// Preference Scoring
+// ========================================
+/**
+ * Check if a preference is satisfied for a given assignment.
+ */
+function checkPreference(preference, assignment, variables, factContext) {
+    // Build binding context with assigned values
+    const bindingContext = { ...factContext };
+    // Add all variable values to context
+    for (const varIndex of preference.variableIndices) {
+        const variable = variables[varIndex];
+        const value = assignment[variable.name];
+        // Create a pseudo-fact for the variable
+        const data = (typeof value === 'object' && value !== null) ? value : value;
+        bindingContext[variable.name] = {
+            id: variable.name,
+            type: '_variable',
+            data: data
+        };
+    }
+    // Evaluate the preference condition
+    try {
+        return (0, core_1.evaluateCondition)(preference.condition, bindingContext);
+    }
+    catch (e) {
+        // If evaluation fails, treat as not satisfied
+        return false;
+    }
+}
+/**
+ * Score a solution against all preferences.
+ * Returns the total score and list of satisfied preference IDs.
+ */
+function scoreSolution(assignment, ruleSet, factContext) {
+    let score = 0;
+    const satisfiedPreferences = [];
+    for (const preference of ruleSet.preferences) {
+        if (checkPreference(preference, assignment, ruleSet.variables, factContext)) {
+            score += preference.weight;
+            satisfiedPreferences.push(preference.id);
+        }
+    }
+    return { score, satisfiedPreferences };
+}
+/**
+ * Rank solutions by preference score.
+ * For 'maximize', higher scores come first.
+ * For 'minimize', lower scores come first.
+ */
+function rankSolutions(solutions, ruleSet, factContext, optimize) {
+    // Score each solution
+    const scored = solutions.map(assignment => {
+        const { score, satisfiedPreferences } = scoreSolution(assignment, ruleSet, factContext);
+        return { assignment, score, satisfiedPreferences };
+    });
+    // Sort by score
+    if (optimize === 'maximize') {
+        scored.sort((a, b) => b.score - a.score); // Descending
+    }
+    else {
+        scored.sort((a, b) => a.score - b.score); // Ascending
+    }
+    return scored;
+}
+// ========================================
+// Strategy Implementation
+// ========================================
+class ConstraintStrategy {
+    /**
+     * Find one solution that satisfies all constraints.
+     * When optimization is enabled, finds the best solution by preference score.
+     */
+    solve(ruleSet, wm, options = {}) {
+        const startTime = performance.now();
+        const config = ruleSet.config;
+        // Build fact context from working memory
+        const factContext = {};
+        for (const input of ruleSet.inputs) {
+            const facts = wm.getByType(input.type);
+            if (facts.length > 0) {
+                factContext[input.name] = facts[0];
+            }
+        }
+        // If optimization is enabled, use solveAll and return the best
+        if (config.optimize !== 'none' && ruleSet.preferences.length > 0) {
+            const allResult = this.solveAll(ruleSet, wm, options);
+            if (allResult.solutions.length === 0) {
+                return {
+                    solved: false,
+                    conflicts: [],
+                    stats: allResult.stats,
+                    exhausted: !allResult.timedOut,
+                    timedOut: allResult.timedOut,
+                    executionTimeMs: allResult.executionTimeMs
+                };
+            }
+            // Get the best solution (first in ranked list)
+            const ranked = allResult.rankedSolutions;
+            const best = ranked[0];
+            return {
+                solved: true,
+                assignment: best.assignment,
+                score: best.score,
+                satisfiedPreferences: best.satisfiedPreferences,
+                stats: allResult.stats,
+                exhausted: allResult.complete,
+                timedOut: allResult.timedOut,
+                executionTimeMs: allResult.executionTimeMs
+            };
+        }
+        // Standard solve without optimization
+        const state = {
+            assignment: new Array(ruleSet.variables.length).fill(undefined),
+            domains: ruleSet.variables.map(v => [...v.domain]),
+            assigned: new Array(ruleSet.variables.length).fill(false),
+            stats: {
+                iterations: 0,
+                backtracks: 0,
+                pruned: 0,
+                elapsed: 0
+            },
+            startTime: Date.now(),
+            maxIterations: options.maxIterations ?? config.maxIterations,
+            timeout: options.timeout ?? config.timeout
+        };
+        // Use forward checking for 'forward-check' strategy
+        const useForwardCheck = config.strategy === 'forward-check';
+        // Run search
+        const found = backtrack(state, ruleSet, factContext, options, useForwardCheck);
+        // Update elapsed time
+        state.stats.elapsed = Date.now() - state.startTime;
+        // Build result
+        if (found) {
+            const assignment = {};
+            for (let i = 0; i < ruleSet.variables.length; i++) {
+                assignment[ruleSet.variables[i].name] = state.assignment[i];
+            }
+            const executionTimeMs = Math.round((performance.now() - startTime) * 100) / 100;
+            // Score the solution if preferences exist (even without optimize mode)
+            let score;
+            let satisfiedPreferences;
+            if (ruleSet.preferences.length > 0) {
+                const scoring = scoreSolution(assignment, ruleSet, factContext);
+                score = scoring.score;
+                satisfiedPreferences = scoring.satisfiedPreferences;
+            }
+            return {
+                solved: true,
+                assignment,
+                score,
+                satisfiedPreferences,
+                stats: state.stats,
+                exhausted: false,
+                timedOut: false,
+                executionTimeMs
+            };
+        }
+        // No solution found - determine why
+        const timedOut = state.stats.elapsed >= state.timeout;
+        const exhausted = !timedOut && state.stats.iterations < state.maxIterations;
+        // Try to identify conflicts (last attempted assignment)
+        const conflicts = [];
+        // Could enhance this to track the actual failing constraints
+        const executionTimeMs = Math.round((performance.now() - startTime) * 100) / 100;
+        return {
+            solved: false,
+            conflicts,
+            stats: state.stats,
+            exhausted,
+            timedOut,
+            executionTimeMs
+        };
+    }
+    /**
+     * Find all solutions up to a limit.
+     * When optimization is enabled, returns solutions ranked by preference score.
+     */
+    solveAll(ruleSet, wm, options = {}) {
+        const startTime = performance.now();
+        const config = ruleSet.config;
+        // Build fact context
+        const factContext = {};
+        for (const input of ruleSet.inputs) {
+            const facts = wm.getByType(input.type);
+            if (facts.length > 0) {
+                factContext[input.name] = facts[0];
+            }
+        }
+        // Initialize search state
+        const state = {
+            assignment: new Array(ruleSet.variables.length).fill(undefined),
+            domains: ruleSet.variables.map(v => [...v.domain]),
+            assigned: new Array(ruleSet.variables.length).fill(false),
+            stats: {
+                iterations: 0,
+                backtracks: 0,
+                pruned: 0,
+                elapsed: 0
+            },
+            startTime: Date.now(),
+            maxIterations: options.maxIterations ?? config.maxIterations,
+            timeout: options.timeout ?? config.timeout
+        };
+        const maxSolutions = options.maxSolutions ?? config.maxSolutions;
+        const solutions = [];
+        const useForwardCheck = config.strategy === 'forward-check';
+        // Run search
+        backtrackAll(state, ruleSet, factContext, options, solutions, maxSolutions, useForwardCheck);
+        // Update elapsed time
+        state.stats.elapsed = Date.now() - state.startTime;
+        // Determine if search completed
+        const timedOut = state.stats.elapsed >= state.timeout;
+        const hitIterationLimit = state.stats.iterations >= state.maxIterations;
+        const hitSolutionLimit = solutions.length >= maxSolutions;
+        const complete = !timedOut && !hitIterationLimit && !hitSolutionLimit;
+        const executionTimeMs = Math.round((performance.now() - startTime) * 100) / 100;
+        // Rank solutions by preference score if optimization is enabled
+        let rankedSolutions;
+        if (config.optimize !== 'none' && ruleSet.preferences.length > 0 && solutions.length > 0) {
+            rankedSolutions = rankSolutions(solutions, ruleSet, factContext, config.optimize);
+        }
+        return {
+            solutions,
+            rankedSolutions,
+            complete,
+            stats: state.stats,
+            timedOut,
+            executionTimeMs
+        };
+    }
+}
+exports.ConstraintStrategy = ConstraintStrategy;
+// Export singleton instance
+exports.constraintStrategy = new ConstraintStrategy();
+//# sourceMappingURL=strategy.js.map

package/dist/engines/constraint/strategy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strategy.js","sourceRoot":"","sources":["../../../src/engines/constraint/strategy.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAEH,qCAA+C;AA2C/C,2CAA2C;AAC3C,sBAAsB;AACtB,2CAA2C;AAE3C;;;GAGG;AACH,SAAS,eAAe,CACtB,UAA8B,EAC9B,KAAkB,EAClB,SAAuC,EACvC,WAAiC;IAEjC,6CAA6C;IAC7C,MAAM,cAAc,GAAyB,EAAE,GAAG,WAAW,EAAE,CAAC;IAEhE,0DAA0D;IAC1D,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,kDAAkD;YAClD,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAEzC,wCAAwC;QACxC,2DAA2D;QAC3D,MAAM,IAAI,GAAG,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3E,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG;YAC9B,EAAE,EAAE,QAAQ,CAAC,IAAI;YACjB,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,IAA2B;SAClC,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,IAAI,CAAC;QACH,OAAO,IAAA,wBAAiB,EAAC,UAAU,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IACjE,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,yCAAyC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,2BAA2B,CAClC,QAAgB,EAChB,KAAkB,EAClB,OAAkC,EAClC,WAAiC;IAEjC,MAAM,SAAS,GAAmB,EAAE,CAAC;IACrC,MAAM,iBAAiB,GAAG,OAAO,CAAC,qBAAqB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IAE5E,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAElF,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;YACrB,sBAAsB;YACtB,MAAM,MAAM,GAAwB,EAAE,CAAC;YACvC,KAAK,MAAM,EAAE,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;gBAC5C,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;oBACvB,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;YAED,SAAS,CAAC,IAAI,CAAC;gBACb,YAAY,EAAE,UAAU,CAAC,EAAE;gBAC3B,cAAc,EAAE,UAAU,CAAC,IAAI;gBAC/B,SAAS,EAAE,UAAU,CAAC,aAAa;gBACnC,MAAM;aACP,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2CAA2C;AAC3C,oCAAoC;AACpC,2CAA2C;AAE3C;;;;GAIG;AACH,SAAS,wBAAwB,CAC/B,KAAkB,EAClB,OAAkC;IAElC,IAAI,SAA6B,CAAC;IAClC,IAAI,cAAc,GAAG,QAAQ,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAE3C,8CAA8C;YAC9C,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;gBACrB,OAAO,CAAC,CAAC,CAAE,gCAAgC;YAC7C,CAAC;YAED,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;gBAChC,cAAc,GAAG,UAAU,CAAC;gBAC5B,SAAS,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;GAEG;AACH,SAAS,8BAA8B,CACrC,KAAkB,EAClB,OAAkC;IAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2CAA2C;AAC3C,oCAAoC;AACpC,2CAA2C;AAE3C;;;GAGG;AACH,SAAS,YAAY,CACnB,gBAAwB,EACxB,KAAkB,EAClB,OAAkC,EAClC,WAAiC;IAEjC,MAAM,iBAAiB,GAAG,OAAO,CAAC,qBAAqB,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;IAEpF,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAE3C,+CAA+C;QAC/C,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAEvC,+BAA+B;YAC/B,MAAM,WAAW,GAAU,EAAE,CAAC;YAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5C,qBAAqB;gBACrB,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;gBACnC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;gBAEhC,mBAAmB;gBACnB,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;gBAElF,WAAW;gBACX,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;gBACvC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;gBAEjC,kEAAkE;gBAClE,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;oBACrB,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;YAED,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;YAEtC,2CAA2C;YAC3C,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7B,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2CAA2C;AAC3C,sBAAsB;AACtB,2CAA2C;AAE3C;;;GAGG;AACH,SAAS,SAAS,CAChB,KAAkB,EAClB,OAAkC,EAClC,WAAiC,EACjC,OAA0B,EAC1B,eAAwB;IAExB,eAAe;IACf,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;IACzB,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;IAEnD,IAAI,KAAK,CAAC,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QAClD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uBAAuB;IACvB,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,gBAAgB,KAAK,KAAK;QACzD,CAAC,CAAC,wBAAwB;QAC1B,CAAC,CAAC,8BAA8B,CAAC;IAEnC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE3C,iDAAiD;IACjD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEvC,gCAAgC;IAChC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,qCAAqC;IACrC,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD,+BAA+B;IAC/B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,eAAe;QACf,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACnC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;QAEhC,WAAW;QACX,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;QAED,oBAAoB;QACpB,MAAM,SAAS,GAAG,2BAA2B,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAErF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,yBAAyB;YAEzB,2BAA2B;YAC3B,IAAI,UAAU,GAAG,IAAI,CAAC;YACtB,IAAI,eAAe,EAAE,CAAC;gBACpB,UAAU,GAAG,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;YACnE,CAAC;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU;gBACV,IAAI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,eAAe,CAAC,EAAE,CAAC;oBACrE,OAAO,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;QAED,YAAY;QACZ,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;QACvC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACjC,KAAK,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,kBAAkB;QAClE,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QAEzB,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACnB,KAAkB,EAClB,OAAkC,EAClC,WAAiC,EACjC,OAA0B,EAC1B,SAAuB,EACvB,YAAoB,EACpB,eAAwB;IAExB,eAAe;IACf,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;IACzB,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;IAEnD,IAAI,KAAK,CAAC,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QAClD,OAAO;IACT,CAAC;IAED,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO;IACT,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;QACrC,OAAO;IACT,CAAC;IAED,uBAAuB;IACvB,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,gBAAgB,KAAK,KAAK;QACzD,CAAC,CAAC,wBAAwB;QAC1B,CAAC,CAAC,8BAA8B,CAAC;IAEnC,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE3C,iDAAiD;IACjD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,0BAA0B;QAC1B,MAAM,UAAU,GAAe,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9D,CAAC;QACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAE3B,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;YACvB,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QACjC,CAAC;QACD,OAAO;IACT,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,OAAO;IACT,CAAC;IAED,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEpD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACnC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;QAEhC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzC,CAAC;QAED,MAAM,SAAS,GAAG,2BAA2B,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAErF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,UAAU,GAAG,IAAI,CAAC;YACtB,IAAI,eAAe,EAAE,CAAC;gBACpB,UAAU,GAAG,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;YACnE,CAAC;YAED,IAAI,UAAU,EAAE,CAAC;gBACf,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;YAC/F,CAAC;QACH,CAAC;QAED,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAC;QACvC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;QACjC,KAAK,CAAC,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QAEzB,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YACxB,OAAO,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QAED,wCAAwC;QACxC,IAAI,SAAS,CAAC,MAAM,IAAI,YAAY,EAAE,CAAC;YACrC,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAED,2CAA2C;AAC3C,qBAAqB;AACrB,2CAA2C;AAE3C;;GAEG;AACH,SAAS,eAAe,CACtB,UAA8B,EAC9B,UAAsB,EACtB,SAAuC,EACvC,WAAiC;IAEjC,6CAA6C;IAC7C,MAAM,cAAc,GAAyB,EAAE,GAAG,WAAW,EAAE,CAAC;IAEhE,qCAAqC;IACrC,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,eAAe,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAExC,wCAAwC;QACxC,MAAM,IAAI,GAAG,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QAC3E,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG;YAC9B,EAAE,EAAE,QAAQ,CAAC,IAAI;YACjB,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,IAA2B;SAClC,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,IAAI,CAAC;QACH,OAAO,IAAA,wBAAiB,EAAC,UAAU,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IACjE,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,8CAA8C;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,aAAa,CACpB,UAAsB,EACtB,OAAkC,EAClC,WAAiC;IAEjC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,oBAAoB,GAAa,EAAE,CAAC;IAE1C,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QAC7C,IAAI,eAAe,CAAC,UAAU,EAAE,UAAU,EAAE,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,EAAE,CAAC;YAC5E,KAAK,IAAI,UAAU,CAAC,MAAM,CAAC;YAC3B,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CACpB,SAAuB,EACvB,OAAkC,EAClC,WAAiC,EACjC,QAAiC;IAEjC,sBAAsB;IACtB,MAAM,MAAM,GAAqB,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;QAC1D,MAAM,EAAE,KAAK,EAAE,oBAAoB,EAAE,GAAG,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QACxF,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,oBAAoB,EAAE,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,gBAAgB;IAChB,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,aAAa;IAC1D,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAE,YAAY;IACzD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,2CAA2C;AAC3C,0BAA0B;AAC1B,2CAA2C;AAE3C,MAAa,kBAAkB;IAC7B;;;OAGG;IACH,KAAK,CACH,OAAkC,EAClC,EAAkB,EAClB,UAA6B,EAAE;QAE/B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAE9B,yCAAyC;QACzC,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,+DAA+D;QAC/D,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjE,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;YAEtD,IAAI,SAAS,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACrC,OAAO;oBACL,MAAM,EAAE,KAAK;oBACb,SAAS,EAAE,EAAE;oBACb,KAAK,EAAE,SAAS,CAAC,KAAK;oBACtB,SAAS,EAAE,CAAC,SAAS,CAAC,QAAQ;oBAC9B,QAAQ,EAAE,SAAS,CAAC,QAAQ;oBAC5B,eAAe,EAAE,SAAS,CAAC,eAAe;iBAC3C,CAAC;YACJ,CAAC;YAED,+CAA+C;YAC/C,MAAM,MAAM,GAAG,SAAS,CAAC,eAAgB,CAAC;YAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAEvB,OAAO;gBACL,MAAM,EAAE,IAAI;gBACZ,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;gBAC/C,KAAK,EAAE,SAAS,CAAC,KAAK;gBACtB,SAAS,EAAE,SAAS,CAAC,QAAQ;gBAC7B,QAAQ,EAAE,SAAS,CAAC,QAAQ;gBAC5B,eAAe,EAAE,SAAS,CAAC,eAAe;aAC3C,CAAC;QACJ,CAAC;QAED,sCAAsC;QACtC,MAAM,KAAK,GAAgB;YACzB,UAAU,EAAE,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;YAC/D,OAAO,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAClD,QAAQ,EAAE,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YACzD,KAAK,EAAE;gBACL,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,MAAM,EAAE,CAAC;gBACT,OAAO,EAAE,CAAC;aACX;YACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,MAAM,CAAC,aAAa;YAC5D,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO;SAC3C,CAAC;QAEF,oDAAoD;QACpD,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,KAAK,eAAe,CAAC;QAE5D,aAAa;QACb,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;QAE/E,sBAAsB;QACtB,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;QAEnD,eAAe;QACf,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,UAAU,GAAe,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC;YAED,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;YAEhF,uEAAuE;YACvE,IAAI,KAAyB,CAAC;YAC9B,IAAI,oBAA0C,CAAC;YAC/C,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnC,MAAM,OAAO,GAAG,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;gBAChE,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;gBACtB,oBAAoB,GAAG,OAAO,CAAC,oBAAoB,CAAC;YACtD,CAAC;YAED,OAAO;gBACL,MAAM,EAAE,IAAI;gBACZ,UAAU;gBACV,KAAK;gBACL,oBAAoB;gBACpB,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,SAAS,EAAE,KAAK;gBAChB,QAAQ,EAAE,KAAK;gBACf,eAAe;aAChB,CAAC;QACJ,CAAC;QAED,oCAAoC;QACpC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC;QACtD,MAAM,SAAS,GAAG,CAAC,QAAQ,IAAI,KAAK,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,aAAa,CAAC;QAE5E,wDAAwD;QACxD,MAAM,SAAS,GAAmB,EAAE,CAAC;QACrC,6DAA6D;QAE7D,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAChF,OAAO;YACL,MAAM,EAAE,KAAK;YACb,SAAS;YACT,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,SAAS;YACT,QAAQ;YACR,eAAe;SAChB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,QAAQ,CACN,OAAkC,EAClC,EAAkB,EAClB,UAA6B,EAAE;QAE/B,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAE9B,qBAAqB;QACrB,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,MAAM,KAAK,GAAgB;YACzB,UAAU,EAAE,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC;YAC/D,OAAO,EAAE,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;YAClD,QAAQ,EAAE,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YACzD,KAAK,EAAE;gBACL,UAAU,EAAE,CAAC;gBACb,UAAU,EAAE,CAAC;gBACb,MAAM,EAAE,CAAC;gBACT,OAAO,EAAE,CAAC;aACX;YACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,MAAM,CAAC,aAAa;YAC5D,OAAO,EAAE,OAAO,CAAC,OAAO,IAAI,MAAM,CAAC,OAAO;SAC3C,CAAC;QAEF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,MAAM,CAAC,YAAY,CAAC;QACjE,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,KAAK,eAAe,CAAC;QAE5D,aAAa;QACb,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;QAE7F,sBAAsB;QACtB,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,CAAC;QAEnD,gCAAgC;QAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC;QACtD,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,IAAI,KAAK,CAAC,aAAa,CAAC;QACxE,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,IAAI,YAAY,CAAC;QAC1D,MAAM,QAAQ,GAAG,CAAC,QAAQ,IAAI,CAAC,iBAAiB,IAAI,CAAC,gBAAgB,CAAC;QAEtE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAEhF,gEAAgE;QAChE,IAAI,eAA6C,CAAC;QAClD,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,IAAI,OAAO,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzF,eAAe,GAAG,aAAa,CAAC,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QACpF,CAAC;QAED,OAAO;YACL,SAAS;YACT,eAAe;YACf,QAAQ;YACR,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,QAAQ;YACR,eAAe;SAChB,CAAC;IACJ,CAAC;CACF;AArMD,gDAqMC;AAED,4BAA4B;AACf,QAAA,kBAAkB,GAAG,IAAI,kBAAkB,EAAE,CAAC"}