conatus 0.1.0

package/dist/satisficing-judge.js

@@ -0,0 +1,592 @@
+import { computeRawGap, normalizeGap } from "./gap-calculator.js";
+/**
+ * SatisficingJudge implements the completion judgment logic defined in satisficing.md.
+ *
+ * Responsibility: determine whether a goal (or individual dimension) is "good enough"
+ * to declare done, applying progress ceilings based on confidence tiers.
+ *
+ * Key design rules:
+ * - Completion requires ALL dimensions satisfied AND no low-confidence dimensions.
+ * - Progress ceiling: high >= 0.85 → 1.0 | medium >= 0.50 → 0.85 | low < 0.50 → 0.60
+ * - These ceiling values are from satisficing.md (distinct from ObservationEngine ceilings).
+ * - null current_value is treated as fully unsatisfied.
+ */
+export class SatisficingJudge {
+    stateManager;
+    embeddingClient;
+    onSatisficingJudgment;
+    constructor(stateManager, embeddingClient, // Phase 2: for dimension mapping proposals
+    onSatisficingJudgment) {
+        this.stateManager = stateManager;
+        this.embeddingClient = embeddingClient;
+        this.onSatisficingJudgment = onSatisficingJudgment;
+    }
+    // ─── Confidence Tier Helpers ───
+    getConfidenceTier(confidence) {
+        if (confidence >= 0.85)
+            return "high";
+        if (confidence >= 0.50)
+            return "medium";
+        return "low";
+    }
+    getCeiling(tier) {
+        switch (tier) {
+            case "high":
+                return 1.0;
+            case "medium":
+                return 0.85;
+            case "low":
+                return 0.60;
+        }
+    }
+    // ─── Progress Calculation (inverse of gap) ───
+    /**
+     * Compute actual progress (0–1) toward satisfying a dimension.
+     * Progress = 1 - normalized_gap, clamped to [0, 1].
+     * For binary thresholds (present/match), either 0 or 1.
+     * null current_value = 0 progress.
+     */
+    computeActualProgress(dim) {
+        const { current_value, threshold } = dim;
+        if (current_value === null)
+            return 0;
+        const rawGap = computeRawGap(current_value, threshold);
+        const normalizedGap = normalizeGap(rawGap, threshold, current_value);
+        // Clamp to [0, 1] and invert: progress = 1 - gap
+        const clamped = Math.min(1, Math.max(0, normalizedGap));
+        return 1 - clamped;
+    }
+    // ─── Satisfaction Check ───
+    /**
+     * Determine whether a dimension's current_value meets its threshold.
+     * Uses raw boolean logic (not gap magnitude) for the is_satisfied flag.
+     */
+    isSatisfiedRaw(dim) {
+        const { current_value, threshold } = dim;
+        if (current_value === null)
+            return false;
+        switch (threshold.type) {
+            case "min":
+                return toNumber(current_value) >= threshold.value;
+            case "max":
+                return toNumber(current_value) <= threshold.value;
+            case "range":
+                return (toNumber(current_value) >= threshold.low &&
+                    toNumber(current_value) <= threshold.high);
+            case "present":
+                return isTruthy(current_value);
+            case "match":
+                return current_value === threshold.value;
+        }
+    }
+    // ─── Public API ───
+    /**
+     * Check if a single dimension is satisfied with appropriate confidence ceiling.
+     */
+    isDimensionSatisfied(dim) {
+        const isSatisfied = this.isSatisfiedRaw(dim);
+        const tier = this.getConfidenceTier(dim.confidence);
+        const ceiling = this.getCeiling(tier);
+        const actualProgress = this.computeActualProgress(dim);
+        const effectiveProgress = Math.min(actualProgress, ceiling);
+        // threshold_value for the schema — use numeric representation where applicable
+        const thresholdValue = getNumericThresholdValue(dim);
+        return {
+            dimension_name: dim.name,
+            is_satisfied: isSatisfied,
+            current_value: toNumberOrNull(dim.current_value),
+            threshold_value: thresholdValue,
+            confidence: dim.confidence,
+            confidence_tier: tier,
+            effective_progress: effectiveProgress,
+            progress_ceiling: ceiling,
+        };
+    }
+    /**
+     * Propose dimension mappings between subgoal and parent goal dimensions
+     * using embedding similarity.
+     */
+    async proposeDimensionMapping(subgoalDimensions, parentGoalDimensions) {
+        if (!this.embeddingClient)
+            return [];
+        const proposals = [];
+        for (const subDim of subgoalDimensions) {
+            const subText = subDim.description ? `${subDim.name}: ${subDim.description}` : subDim.name;
+            const subVector = await this.embeddingClient.embed(subText);
+            let bestMatch = null;
+            for (const parentDim of parentGoalDimensions) {
+                const parentText = parentDim.description ? `${parentDim.name}: ${parentDim.description}` : parentDim.name;
+                const parentVector = await this.embeddingClient.embed(parentText);
+                const similarity = this.embeddingClient.cosineSimilarity(subVector, parentVector);
+                if (!bestMatch || similarity > bestMatch.similarity) {
+                    bestMatch = { name: parentDim.name, similarity };
+                }
+            }
+            if (bestMatch && bestMatch.similarity > 0.5) {
+                proposals.push({
+                    subgoal_dimension: subDim.name,
+                    parent_dimension: bestMatch.name,
+                    similarity_score: bestMatch.similarity,
+                    suggested_aggregation: "avg", // default; could be smarter
+                    confidence: Math.min(bestMatch.similarity, 0.9),
+                    reasoning: `Dimension "${subDim.name}" is semantically similar to parent dimension "${bestMatch.name}" (similarity: ${bestMatch.similarity.toFixed(3)})`,
+                });
+            }
+        }
+        return proposals;
+    }
+    /**
+     * Determine if a goal is fully complete.
+     * Complete iff all dimensions are satisfied AND no dimension has low confidence.
+     */
+    isGoalComplete(goal) {
+        const dims = goal.dimensions;
+        if (dims.length === 0) {
+            return {
+                is_complete: true,
+                blocking_dimensions: [],
+                low_confidence_dimensions: [],
+                needs_verification_task: false,
+                checked_at: new Date().toISOString(),
+            };
+        }
+        const satisfactions = dims.map((d) => this.isDimensionSatisfied(d));
+        const blockingDimensions = satisfactions
+            .filter((s) => !s.is_satisfied)
+            .map((s) => s.dimension_name);
+        const lowConfidenceDimensions = satisfactions
+            .filter((s) => s.confidence_tier === "low")
+            .map((s) => s.dimension_name);
+        // needs_verification_task: any dimension appears to meet threshold but confidence < 0.85
+        const needsVerification = satisfactions.some((s) => s.is_satisfied && s.confidence < 0.85);
+        const isComplete = blockingDimensions.length === 0 && lowConfidenceDimensions.length === 0;
+        if (this.onSatisficingJudgment) {
+            const satisfiedDims = dims
+                .filter(d => this.isDimensionSatisfied(d).is_satisfied)
+                .map(d => d.name);
+            if (satisfiedDims.length > 0) {
+                this.onSatisficingJudgment(goal.id, satisfiedDims);
+            }
+        }
+        return {
+            is_complete: isComplete,
+            blocking_dimensions: blockingDimensions,
+            low_confidence_dimensions: lowConfidenceDimensions,
+            needs_verification_task: needsVerification,
+            checked_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Apply progress ceiling based on confidence tier.
+     * Returns min(actualProgress, ceiling).
+     */
+    applyProgressCeiling(actualProgress, confidence) {
+        const tier = this.getConfidenceTier(confidence);
+        const ceiling = this.getCeiling(tier);
+        return Math.min(actualProgress, ceiling);
+    }
+    /**
+     * Select dimensions to focus on in the next iteration.
+     *
+     * Algorithm:
+     * 1. Exclude already-satisfied dimensions.
+     * 2. Among remaining, sort by drive score (highest first).
+     * 3. Take top max_dimensions.
+     */
+    selectDimensionsForIteration(dimensions, driveScores, constraints) {
+        const maxDimensions = constraints?.max_dimensions ?? 3;
+        const uncertaintyThreshold = constraints?.uncertainty_threshold ?? 0.50;
+        // Build score lookup
+        const scoreMap = new Map(driveScores.map((ds) => [ds.dimension_name, ds.score]));
+        // Filter out satisfied dimensions; mark low-confidence as needing observation first
+        const candidates = dimensions
+            .filter((dim) => !this.isSatisfiedRaw(dim))
+            .filter((dim) => dim.confidence >= uncertaintyThreshold);
+        // Sort by drive score descending
+        candidates.sort((a, b) => {
+            const scoreA = scoreMap.get(a.name) ?? 0;
+            const scoreB = scoreMap.get(b.name) ?? 0;
+            return scoreB - scoreA;
+        });
+        return candidates.slice(0, maxDimensions).map((d) => d.name);
+    }
+    /**
+     * Detect dimensions where threshold adjustment may be warranted.
+     *
+     * Condition 1: >= 3 failures AND normalized_gap has not improved (no progress).
+     * Condition 2: all other dimensions satisfied, this one is still far from threshold.
+     */
+    detectThresholdAdjustmentNeeded(goal, failureCounts) {
+        const proposals = [];
+        const dims = goal.dimensions;
+        if (dims.length === 0)
+            return proposals;
+        const satisfactions = dims.map((d) => this.isDimensionSatisfied(d));
+        const satisfiedSet = new Set(satisfactions.filter((s) => s.is_satisfied).map((s) => s.dimension_name));
+        for (const dim of dims) {
+            const failures = failureCounts.get(dim.name) ?? 0;
+            const progress = this.computeActualProgress(dim);
+            // Condition 1: high failure count + no meaningful progress (< 10%)
+            if (failures >= 3 && progress < 0.10) {
+                const currentThreshold = getNumericThresholdValueForProposal(dim);
+                if (currentThreshold !== null) {
+                    const proposedThreshold = currentThreshold * 0.8; // propose 20% reduction
+                    proposals.push({
+                        goal_id: goal.id,
+                        dimension_name: dim.name,
+                        current_threshold: currentThreshold,
+                        proposed_threshold: proposedThreshold,
+                        reason: "high_failure_no_progress",
+                        evidence: `${failures} failures with ${Math.round(progress * 100)}% progress toward threshold`,
+                    });
+                }
+            }
+            // Condition 3: Resource undershoot — tasks complete much faster than estimated
+            // but goal progress is stagnant, suggesting the threshold may be too ambitious.
+            // Requires task cost history (actual_elapsed_ms + estimated_duration_ms fields).
+            {
+                const rawHistory = this.stateManager.readRaw(`tasks/${goal.id}/task-history.json`);
+                const taskHistory = Array.isArray(rawHistory) ? rawHistory : [];
+                const dimHistory = taskHistory.filter((h) => h.primary_dimension === dim.name &&
+                    typeof h.actual_elapsed_ms === "number" &&
+                    typeof h.estimated_duration_ms === "number" &&
+                    h.estimated_duration_ms > 0);
+                if (dimHistory.length >= 3) {
+                    const avgEstimated = dimHistory.reduce((s, h) => s + h.estimated_duration_ms, 0) / dimHistory.length;
+                    const avgActual = dimHistory.reduce((s, h) => s + h.actual_elapsed_ms, 0) / dimHistory.length;
+                    if (avgActual < 0.5 * avgEstimated && progress < 0.5) {
+                        const currentThreshold = getNumericThresholdValueForProposal(dim);
+                        if (currentThreshold !== null &&
+                            !proposals.some((p) => p.dimension_name === dim.name)) {
+                            proposals.push({
+                                goal_id: goal.id,
+                                dimension_name: dim.name,
+                                current_threshold: currentThreshold,
+                                proposed_threshold: currentThreshold * 0.85,
+                                reason: "resource_undershoot",
+                                evidence: `${dimHistory.length} tasks averaged ${Math.round(avgActual)}ms vs ${Math.round(avgEstimated)}ms estimated; goal progress at ${Math.round(progress * 100)}%`,
+                            });
+                        }
+                    }
+                }
+            }
+            // Condition 2: bottleneck — all other dimensions satisfied, this one is far (< 30%)
+            const othersAllSatisfied = dims
+                .filter((d) => d.name !== dim.name)
+                .every((d) => satisfiedSet.has(d.name));
+            if (othersAllSatisfied && !satisfiedSet.has(dim.name) && progress < 0.30) {
+                const currentThreshold = getNumericThresholdValueForProposal(dim);
+                if (currentThreshold !== null && !proposals.some((p) => p.dimension_name === dim.name)) {
+                    const proposedThreshold = currentThreshold * 0.8;
+                    proposals.push({
+                        goal_id: goal.id,
+                        dimension_name: dim.name,
+                        current_threshold: currentThreshold,
+                        proposed_threshold: proposedThreshold,
+                        reason: "bottleneck_dimension",
+                        evidence: `All other dimensions satisfied; this dimension at ${Math.round(progress * 100)}% progress`,
+                    });
+                }
+            }
+        }
+        return proposals;
+    }
+    /**
+     * Judge completion of an entire goal tree by checking all children recursively.
+     * Non-leaf nodes are complete when all children are completed or cancelled(merged).
+     *
+     * @param rootId The ID of the root goal of the tree.
+     * @returns CompletionJudgment for the root node.
+     */
+    judgeTreeCompletion(rootId) {
+        const goal = this.stateManager.loadGoal(rootId);
+        if (goal === null) {
+            return {
+                is_complete: false,
+                blocking_dimensions: [],
+                low_confidence_dimensions: [],
+                needs_verification_task: false,
+                checked_at: new Date().toISOString(),
+            };
+        }
+        // Leaf node (no children): delegate to existing isGoalComplete
+        if (!goal.children_ids || goal.children_ids.length === 0) {
+            return this.isGoalComplete(goal);
+        }
+        // Non-leaf node: check all children recursively
+        const blockingDimensions = [];
+        const lowConfidenceDimensions = [];
+        let needsVerification = false;
+        for (const childId of goal.children_ids) {
+            const child = this.stateManager.loadGoal(childId);
+            // Missing child is treated as blocking
+            if (child === null) {
+                blockingDimensions.push(childId);
+                continue;
+            }
+            // Cancelled children count as complete (covers "merged" prune reason)
+            if (child.status === "cancelled") {
+                continue;
+            }
+            // Recurse into child
+            const childJudgment = this.judgeTreeCompletion(childId);
+            if (!childJudgment.is_complete) {
+                // Aggregate child's blocking and low-confidence dimensions
+                for (const dim of childJudgment.blocking_dimensions) {
+                    if (!blockingDimensions.includes(dim)) {
+                        blockingDimensions.push(dim);
+                    }
+                }
+                for (const dim of childJudgment.low_confidence_dimensions) {
+                    if (!lowConfidenceDimensions.includes(dim)) {
+                        lowConfidenceDimensions.push(dim);
+                    }
+                }
+            }
+            if (childJudgment.needs_verification_task) {
+                needsVerification = true;
+            }
+        }
+        const isComplete = blockingDimensions.length === 0 && lowConfidenceDimensions.length === 0;
+        return {
+            is_complete: isComplete,
+            blocking_dimensions: blockingDimensions,
+            low_confidence_dimensions: lowConfidenceDimensions,
+            needs_verification_task: needsVerification,
+            checked_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Propagate subgoal completion to the parent goal's matching dimension.
+     *
+     * Phase 2: supports dimension_mapping for aggregation-based propagation.
+     * - If any subgoal dimension has dimension_mapping set, use aggregation path.
+     * - Mixed: mapped dimensions use aggregation; unmapped dimensions fall back to name matching.
+     * - Backwards compatible: if no dimensions have dimension_mapping, behaves like MVP.
+     *
+     * @param subgoalId The subgoal's ID (used for name matching in MVP path).
+     * @param parentGoalId The parent goal's ID to update.
+     * @param subgoalDimensions Optional subgoal dimensions for aggregation mapping.
+     *   When omitted, falls back to MVP name-based matching only.
+     */
+    propagateSubgoalCompletion(subgoalId, parentGoalId, subgoalDimensions) {
+        const parentGoal = this.stateManager.loadGoal(parentGoalId);
+        if (parentGoal === null) {
+            throw new Error(`propagateSubgoalCompletion: parent goal "${parentGoalId}" not found`);
+        }
+        const now = new Date().toISOString();
+        // Phase 2: if subgoalDimensions are provided and any has dimension_mapping, use aggregation path
+        if (subgoalDimensions && subgoalDimensions.length > 0) {
+            const mappedDims = subgoalDimensions.filter((d) => d.dimension_mapping !== null);
+            const unmappedDims = subgoalDimensions.filter((d) => d.dimension_mapping === null);
+            // Process mapped dimensions: group by parent_dimension
+            const parentDimUpdates = new Map();
+            if (mappedDims.length > 0) {
+                // Group subgoal dimensions by target parent_dimension
+                const grouped = new Map();
+                for (const dim of mappedDims) {
+                    const mapping = dim.dimension_mapping;
+                    const existing = grouped.get(mapping.parent_dimension) ?? [];
+                    existing.push(dim);
+                    grouped.set(mapping.parent_dimension, existing);
+                }
+                // Compute aggregated value for each parent dimension
+                for (const [parentDimName, dims] of grouped) {
+                    const aggregation = dims[0].dimension_mapping.aggregation;
+                    const numericValues = [];
+                    const fulfillmentRatios = [];
+                    for (const dim of dims) {
+                        const cv = dim.current_value;
+                        if (typeof cv === "number") {
+                            numericValues.push(cv);
+                        }
+                        else if (typeof cv === "boolean") {
+                            numericValues.push(cv ? 1 : 0);
+                        }
+                        else if (typeof cv === "string") {
+                            const parsed = Number(cv);
+                            if (!isNaN(parsed)) {
+                                numericValues.push(parsed);
+                            }
+                            else {
+                                // Non-numeric in avg mode: skip with warning
+                                if (aggregation === "avg") {
+                                    console.warn(`propagateSubgoalCompletion: skipping non-numeric current_value "${cv}" for dimension "${dim.name}" in avg aggregation`);
+                                }
+                            }
+                        }
+                        // For all_required: also compute fulfillment ratio
+                        if (aggregation === "all_required") {
+                            const progress = this.computeActualProgress(dim);
+                            fulfillmentRatios.push(progress);
+                        }
+                    }
+                    const thresholds = dims.map((d) => {
+                        const th = d.threshold;
+                        if (th.type === "min")
+                            return th.value;
+                        if (th.type === "max")
+                            return th.value;
+                        if (th.type === "range")
+                            return th.high;
+                        return 1;
+                    });
+                    const aggregated = aggregation === "all_required"
+                        ? aggregateValues(fulfillmentRatios, aggregation, thresholds)
+                        : aggregateValues(numericValues, aggregation, thresholds);
+                    parentDimUpdates.set(parentDimName, aggregated);
+                }
+            }
+            // Build updated dimensions array for the parent goal
+            let updatedDimensions = parentGoal.dimensions.map((d) => {
+                if (parentDimUpdates.has(d.name)) {
+                    return { ...d, current_value: parentDimUpdates.get(d.name), last_updated: now };
+                }
+                return d;
+            });
+            // Process unmapped dimensions: fall back to name-based matching (MVP path)
+            for (const unmappedDim of unmappedDims) {
+                const matchedIndex = updatedDimensions.findIndex((d) => d.name === unmappedDim.name || d.name.includes(unmappedDim.name));
+                if (matchedIndex !== -1) {
+                    const matchedDim = updatedDimensions[matchedIndex];
+                    const satisfiedValue = getSatisfiedValue(matchedDim);
+                    updatedDimensions = updatedDimensions.map((d, i) => i === matchedIndex ? { ...d, current_value: satisfiedValue, last_updated: now } : d);
+                }
+            }
+            this.stateManager.saveGoal({
+                ...parentGoal,
+                dimensions: updatedDimensions,
+                updated_at: now,
+            });
+            return;
+        }
+        // MVP path: name-based matching (backwards compatible)
+        const matchedDimIndex = parentGoal.dimensions.findIndex((d) => d.name === subgoalId || d.name.includes(subgoalId));
+        if (matchedDimIndex === -1) {
+            // No matching dimension — nothing to propagate
+            return;
+        }
+        const matchedDim = parentGoal.dimensions[matchedDimIndex];
+        // Set current_value to threshold value so isDimensionSatisfied returns true
+        const satisfiedValue = getSatisfiedValue(matchedDim);
+        const updatedDimensions = parentGoal.dimensions.map((d, i) => i === matchedDimIndex
+            ? { ...d, current_value: satisfiedValue, last_updated: now }
+            : d);
+        this.stateManager.saveGoal({
+            ...parentGoal,
+            dimensions: updatedDimensions,
+            updated_at: now,
+        });
+    }
+}
+// ─── Pure Helper: aggregateValues ───
+/**
+ * Aggregate an array of numeric values using the specified strategy.
+ *
+ * @param values - Numeric values to aggregate.
+ * @param aggregation - Strategy: "min" | "avg" | "max" | "all_required".
+ * @param thresholds - For "all_required": fulfillment ratios are already computed (values = ratios).
+ * @returns Aggregated value, or 0 if values array is empty.
+ */
+export function aggregateValues(values, aggregation, thresholds) {
+    if (values.length === 0)
+        return 0;
+    switch (aggregation) {
+        case "min":
+            return Math.min(...values);
+        case "max":
+            return Math.max(...values);
+        case "avg": {
+            const sum = values.reduce((acc, v) => acc + v, 0);
+            return sum / values.length;
+        }
+        case "all_required":
+            // values are fulfillment ratios (0..1); return the minimum ratio
+            // (parent is "complete" only if all ratios = 1.0, expressed as min)
+            return Math.min(...values);
+    }
+}
+// ─── Helpers (non-exported) ───
+function toNumber(value) {
+    if (typeof value === "number")
+        return value;
+    if (typeof value === "boolean")
+        return value ? 1 : 0;
+    if (typeof value === "string") {
+        const n = Number(value);
+        return isNaN(n) ? 0 : n;
+    }
+    return 0;
+}
+function isTruthy(value) {
+    if (value === null || value === undefined)
+        return false;
+    if (typeof value === "boolean")
+        return value;
+    if (typeof value === "number")
+        return value !== 0;
+    if (typeof value === "string")
+        return value.length > 0;
+    return false;
+}
+function toNumberOrNull(value) {
+    if (value === null)
+        return null;
+    return toNumber(value);
+}
+/**
+ * Extract a representative numeric threshold value for the DimensionSatisfaction schema.
+ * Returns null for "present" (no numeric threshold).
+ */
+function getNumericThresholdValue(dim) {
+    const { threshold } = dim;
+    switch (threshold.type) {
+        case "min":
+            return threshold.value;
+        case "max":
+            return threshold.value;
+        case "range":
+            return threshold.high; // use upper bound as representative
+        case "present":
+            return null;
+        case "match":
+            return typeof threshold.value === "number" ? threshold.value : null;
+    }
+}
+/**
+ * Returns the numeric threshold for adjustment proposals.
+ * Only applicable to numeric thresholds (min/max/range).
+ */
+function getNumericThresholdValueForProposal(dim) {
+    const { threshold } = dim;
+    switch (threshold.type) {
+        case "min":
+            return threshold.value;
+        case "max":
+            return threshold.value;
+        case "range":
+            return threshold.high;
+        case "present":
+        case "match":
+            return null; // adjustment not meaningful for binary thresholds
+    }
+}
+/**
+ * Compute the value that fully satisfies the threshold (for propagation).
+ */
+function getSatisfiedValue(dim) {
+    const { threshold } = dim;
+    switch (threshold.type) {
+        case "min":
+            return threshold.value;
+        case "max":
+            return threshold.value;
+        case "range":
+            return (threshold.low + threshold.high) / 2;
+        case "present":
+            return true;
+        case "match":
+            return threshold.value;
+    }
+}
+//# sourceMappingURL=satisficing-judge.js.map

package/dist/satisficing-judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisficing-judge.js","sourceRoot":"","sources":["../src/satisficing-judge.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAWlE;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,gBAAgB;IACV,YAAY,CAAe;IAC3B,eAAe,CAAoB;IACnC,qBAAqB,CAA2D;IAEjG,YACE,YAA0B,EAC1B,eAAkC,EAAG,2CAA2C;IAChF,qBAA+E;QAE/E,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;IACrD,CAAC;IAED,kCAAkC;IAE1B,iBAAiB,CAAC,UAAkB;QAC1C,IAAI,UAAU,IAAI,IAAI;YAAE,OAAO,MAAM,CAAC;QACtC,IAAI,UAAU,IAAI,IAAI;YAAE,OAAO,QAAQ,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,UAAU,CAAC,IAA+B;QAChD,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,MAAM;gBACT,OAAO,GAAG,CAAC;YACb,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC;YACd,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IAED,gDAAgD;IAEhD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAc;QAC1C,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;QAEzC,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QAErC,MAAM,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;QACvD,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;QAErE,iDAAiD;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;QACxD,OAAO,CAAC,GAAG,OAAO,CAAC;IACrB,CAAC;IAED,6BAA6B;IAE7B;;;OAGG;IACK,cAAc,CAAC,GAAc;QACnC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;QAEzC,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAEzC,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;YACpD,KAAK,KAAK;gBACR,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;YACpD,KAAK,OAAO;gBACV,OAAO,CACL,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,GAAG;oBACxC,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,IAAI,CAC1C,CAAC;YACJ,KAAK,SAAS;gBACZ,OAAO,QAAQ,CAAC,aAAa,CAAC,CAAC;YACjC,KAAK,OAAO;gBACV,OAAO,aAAa,KAAK,SAAS,CAAC,KAAK,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,qBAAqB;IAErB;;OAEG;IACH,oBAAoB,CAAC,GAAc;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACvD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAE5D,+EAA+E;QAC/E,MAAM,cAAc,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC;QAErD,OAAO;YACL,cAAc,EAAE,GAAG,CAAC,IAAI;YACxB,YAAY,EAAE,WAAW;YACzB,aAAa,EAAE,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC;YAChD,eAAe,EAAE,cAAc;YAC/B,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,eAAe,EAAE,IAAI;YACrB,kBAAkB,EAAE,iBAAiB;YACrC,gBAAgB,EAAE,OAAO;SAC1B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,uBAAuB,CAC3B,iBAAgE,EAChE,oBAAmE;QAEnE,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,SAAS,GAAsB,EAAE,CAAC;QAExC,KAAK,MAAM,MAAM,IAAI,iBAAiB,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YAC3F,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAE5D,IAAI,SAAS,GAAgD,IAAI,CAAC;YAElE,KAAK,MAAM,SAAS,IAAI,oBAAoB,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBAC1G,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBAClE,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gBAElF,IAAI,CAAC,SAAS,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;oBACpD,SAAS,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;gBACnD,CAAC;YACH,CAAC;YAED,IAAI,SAAS,IAAI,SAAS,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBAC5C,SAAS,CAAC,IAAI,CAAC;oBACb,iBAAiB,EAAE,MAAM,CAAC,IAAI;oBAC9B,gBAAgB,EAAE,SAAS,CAAC,IAAI;oBAChC,gBAAgB,EAAE,SAAS,CAAC,UAAU;oBACtC,qBAAqB,EAAE,KAAK,EAAG,4BAA4B;oBAC3D,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,GAAG,CAAC;oBAC/C,SAAS,EAAE,cAAc,MAAM,CAAC,IAAI,kDAAkD,SAAS,CAAC,IAAI,kBAAkB,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;iBACzJ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,IAAU;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QAE7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO;gBACL,WAAW,EAAE,IAAI;gBACjB,mBAAmB,EAAE,EAAE;gBACvB,yBAAyB,EAAE,EAAE;gBAC7B,uBAAuB,EAAE,KAAK;gBAC9B,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC,CAAC;QACJ,CAAC;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpE,MAAM,kBAAkB,GAAG,aAAa;aACrC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;aAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAEhC,MAAM,uBAAuB,GAAG,aAAa;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAEhC,yFAAyF;QACzF,MAAM,iBAAiB,GAAG,aAAa,CAAC,IAAI,CAC1C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,UAAU,GAAG,IAAI,CAC7C,CAAC;QAEF,MAAM,UAAU,GACd,kBAAkB,CAAC,MAAM,KAAK,CAAC,IAAI,uBAAuB,CAAC,MAAM,KAAK,CAAC,CAAC;QAE1E,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC/B,MAAM,aAAa,GAAG,IAAI;iBACvB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;iBACtD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpB,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,OAAO;YACL,WAAW,EAAE,UAAU;YACvB,mBAAmB,EAAE,kBAAkB;YACvC,yBAAyB,EAAE,uBAAuB;YAClD,uBAAuB,EAAE,iBAAiB;YAC1C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,cAAsB,EAAE,UAAkB;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;OAOG;IACH,4BAA4B,CAC1B,UAAuB,EACvB,WAA6D,EAC7D,WAAkC;QAElC,MAAM,aAAa,GAAG,WAAW,EAAE,cAAc,IAAI,CAAC,CAAC;QACvD,MAAM,oBAAoB,GAAG,WAAW,EAAE,qBAAqB,IAAI,IAAI,CAAC;QAExE,qBAAqB;QACrB,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CACvD,CAAC;QAEF,oFAAoF;QACpF,MAAM,UAAU,GAAG,UAAU;aAC1B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;aAC1C,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,IAAI,oBAAoB,CAAC,CAAC;QAE3D,iCAAiC;QACjC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,OAAO,MAAM,GAAG,MAAM,CAAC;QACzB,CAAC,CAAC,CAAC;QAEH,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;OAKG;IACH,+BAA+B,CAC7B,IAAU,EACV,aAAkC;QAElC,MAAM,SAAS,GAAkC,EAAE,CAAC;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QAE7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAExC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CACzE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;YAEjD,mEAAmE;YACnE,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,EAAE,CAAC;gBACrC,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;gBAClE,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;oBAC9B,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC,CAAC,wBAAwB;oBAC1E,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,cAAc,EAAE,GAAG,CAAC,IAAI;wBACxB,iBAAiB,EAAE,gBAAgB;wBACnC,kBAAkB,EAAE,iBAAiB;wBACrC,MAAM,EAAE,0BAA0B;wBAClC,QAAQ,EAAE,GAAG,QAAQ,kBAAkB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,6BAA6B;qBAC/F,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,+EAA+E;YAC/E,gFAAgF;YAChF,iFAAiF;YACjF,CAAC;gBACC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBACnF,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;gBAEhE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CACnC,CAAC,CAA0B,EAAE,EAAE,CAC7B,CAAC,CAAC,iBAAiB,KAAK,GAAG,CAAC,IAAI;oBAChC,OAAO,CAAC,CAAC,iBAAiB,KAAK,QAAQ;oBACvC,OAAO,CAAC,CAAC,qBAAqB,KAAK,QAAQ;oBAC1C,CAAC,CAAC,qBAAgC,GAAG,CAAC,CAC6B,CAAC;gBAEzE,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBAC3B,MAAM,YAAY,GAChB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,qBAAqB,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;oBAClF,MAAM,SAAS,GACb,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;oBAE9E,IAAI,SAAS,GAAG,GAAG,GAAG,YAAY,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;wBACrD,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;wBAClE,IACE,gBAAgB,KAAK,IAAI;4BACzB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,GAAG,CAAC,IAAI,CAAC,EACrD,CAAC;4BACD,SAAS,CAAC,IAAI,CAAC;gCACb,OAAO,EAAE,IAAI,CAAC,EAAE;gCAChB,cAAc,EAAE,GAAG,CAAC,IAAI;gCACxB,iBAAiB,EAAE,gBAAgB;gCACnC,kBAAkB,EAAE,gBAAgB,GAAG,IAAI;gCAC3C,MAAM,EAAE,qBAAqB;gCAC7B,QAAQ,EAAE,GAAG,UAAU,CAAC,MAAM,mBAAmB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,kCAAkC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG;6BACvK,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,IAAI;iBAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC;iBAClC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAE1C,IAAI,kBAAkB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,EAAE,CAAC;gBACzE,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;gBAClE,IAAI,gBAAgB,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvF,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC;oBACjD,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,cAAc,EAAE,GAAG,CAAC,IAAI;wBACxB,iBAAiB,EAAE,gBAAgB;wBACnC,kBAAkB,EAAE,iBAAiB;wBACrC,MAAM,EAAE,sBAAsB;wBAC9B,QAAQ,EAAE,qDAAqD,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,YAAY;qBACtG,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,mBAAmB,CAAC,MAAc;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,OAAO;gBACL,WAAW,EAAE,KAAK;gBAClB,mBAAmB,EAAE,EAAE;gBACvB,yBAAyB,EAAE,EAAE;gBAC7B,uBAAuB,EAAE,KAAK;gBAC9B,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC,CAAC;QACJ,CAAC;QAED,+DAA+D;QAC/D,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzD,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QAED,gDAAgD;QAChD,MAAM,kBAAkB,GAAa,EAAE,CAAC;QACxC,MAAM,uBAAuB,GAAa,EAAE,CAAC;QAC7C,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAE9B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAElD,uCAAuC;YACvC,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjC,SAAS;YACX,CAAC;YAED,sEAAsE;YACtE,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBACjC,SAAS;YACX,CAAC;YAED,qBAAqB;YACrB,MAAM,aAAa,GAAG,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;YAExD,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC;gBAC/B,2DAA2D;gBAC3D,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,mBAAmB,EAAE,CAAC;oBACpD,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;wBACtC,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;gBACD,KAAK,MAAM,GAAG,IAAI,aAAa,CAAC,yBAAyB,EAAE,CAAC;oBAC1D,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC3C,uBAAuB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACpC,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,aAAa,CAAC,uBAAuB,EAAE,CAAC;gBAC1C,iBAAiB,GAAG,IAAI,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,MAAM,KAAK,CAAC,IAAI,uBAAuB,CAAC,MAAM,KAAK,CAAC,CAAC;QAE3F,OAAO;YACL,WAAW,EAAE,UAAU;YACvB,mBAAmB,EAAE,kBAAkB;YACvC,yBAAyB,EAAE,uBAAuB;YAClD,uBAAuB,EAAE,iBAAiB;YAC1C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,0BAA0B,CACxB,SAAiB,EACjB,YAAoB,EACpB,iBAAyD;QAEzD,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAC5D,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CACb,4CAA4C,YAAY,aAAa,CACtE,CAAC;QACJ,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,iGAAiG;QACjG,IAAI,iBAAiB,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtD,MAAM,UAAU,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,KAAK,IAAI,CAAC,CAAC;YACjF,MAAM,YAAY,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,KAAK,IAAI,CAAC,CAAC;YAEnF,uDAAuD;YACvD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;YAEnD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,sDAAsD;gBACtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiD,CAAC;gBACzE,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;oBAC7B,MAAM,OAAO,GAAG,GAAG,CAAC,iBAAkB,CAAC;oBACvC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;oBAC7D,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACnB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,gBAAgB,EAAE,QAAQ,CAAC,CAAC;gBAClD,CAAC;gBAED,qDAAqD;gBACrD,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;oBAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC,iBAAkB,CAAC,WAAW,CAAC;oBAE5D,MAAM,aAAa,GAAa,EAAE,CAAC;oBACnC,MAAM,iBAAiB,GAAa,EAAE,CAAC;oBAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;wBACvB,MAAM,EAAE,GAAG,GAAG,CAAC,aAAa,CAAC;wBAC7B,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;4BAC3B,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACzB,CAAC;6BAAM,IAAI,OAAO,EAAE,KAAK,SAAS,EAAE,CAAC;4BACnC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACjC,CAAC;6BAAM,IAAI,OAAO,EAAE,KAAK,QAAQ,EAAE,CAAC;4BAClC,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;4BAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gCACnB,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;4BAC7B,CAAC;iCAAM,CAAC;gCACN,6CAA6C;gCAC7C,IAAI,WAAW,KAAK,KAAK,EAAE,CAAC;oCAC1B,OAAO,CAAC,IAAI,CACV,mEAAmE,EAAE,oBAAoB,GAAG,CAAC,IAAI,sBAAsB,CACxH,CAAC;gCACJ,CAAC;4BACH,CAAC;wBACH,CAAC;wBACD,mDAAmD;wBACnD,IAAI,WAAW,KAAK,cAAc,EAAE,CAAC;4BACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;4BACjD,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;oBAED,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC;wBACvB,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;4BAAE,OAAO,EAAE,CAAC,KAAK,CAAC;wBACvC,IAAI,EAAE,CAAC,IAAI,KAAK,KAAK;4BAAE,OAAO,EAAE,CAAC,KAAK,CAAC;wBACvC,IAAI,EAAE,CAAC,IAAI,KAAK,OAAO;4BAAE,OAAO,EAAE,CAAC,IAAI,CAAC;wBACxC,OAAO,CAAC,CAAC;oBACX,CAAC,CAAC,CAAC;oBAEH,MAAM,UAAU,GACd,WAAW,KAAK,cAAc;wBAC5B,CAAC,CAAC,eAAe,CAAC,iBAAiB,EAAE,WAAW,EAAE,UAAU,CAAC;wBAC7D,CAAC,CAAC,eAAe,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;oBAE9D,gBAAgB,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,qDAAqD;YACrD,IAAI,iBAAiB,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACtD,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjC,OAAO,EAAE,GAAG,CAAC,EAAE,aAAa,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;gBACnF,CAAC;gBACD,OAAO,CAAC,CAAC;YACX,CAAC,CAAC,CAAC;YAEH,2EAA2E;YAC3E,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;gBACvC,MAAM,YAAY,GAAG,iBAAiB,CAAC,SAAS,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CACxE,CAAC;gBACF,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;oBACxB,MAAM,UAAU,GAAG,iBAAiB,CAAC,YAAY,CAAE,CAAC;oBACpD,MAAM,cAAc,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;oBACrD,iBAAiB,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjD,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CACpF,CAAC;gBACJ,CAAC;YACH,CAAC;YAED,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;gBACzB,GAAG,UAAU;gBACb,UAAU,EAAE,iBAAiB;gBAC7B,UAAU,EAAE,GAAG;aAChB,CAAC,CAAC;YACH,OAAO;QACT,CAAC;QAED,uDAAuD;QACvD,MAAM,eAAe,GAAG,UAAU,CAAC,UAAU,CAAC,SAAS,CACrD,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAC1D,CAAC;QAEF,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE,CAAC;YAC3B,+CAA+C;YAC/C,OAAO;QACT,CAAC;QAED,MAAM,UAAU,GAAG,UAAU,CAAC,UAAU,CAAC,eAAe,CAAE,CAAC;QAE3D,4EAA4E;QAC5E,MAAM,cAAc,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAErD,MAAM,iBAAiB,GAAG,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC3D,CAAC,KAAK,eAAe;YACnB,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,aAAa,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,EAAE;YAC5D,CAAC,CAAC,CAAC,CACN,CAAC;QAEF,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;YACzB,GAAG,UAAU;YACb,UAAU,EAAE,iBAAiB;YAC7B,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;IACL,CAAC;CACF;AAED,uCAAuC;AAEvC;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAgB,EAChB,WAAmD,EACnD,UAAqB;IAErB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,QAAQ,WAAW,EAAE,CAAC;QACpB,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7B,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7B,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,OAAO,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;QAC7B,CAAC;QACD,KAAK,cAAc;YACjB,iEAAiE;YACjE,oEAAoE;YACpE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,iCAAiC;AAEjC,SAAS,QAAQ,CAAC,KAAuC;IACvD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,QAAQ,CAAC,KAAuC;IACvD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,cAAc,CAAC,KAAuC;IAC7D,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,SAAS,wBAAwB,CAAC,GAAc;IAC9C,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,oCAAoC;QAC7D,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACxE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,mCAAmC,CAAC,GAAc;IACzD,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,IAAI,CAAC;QACxB,KAAK,SAAS,CAAC;QACf,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,CAAC,kDAAkD;IACnE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,GAAc;IACvC,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,KAAK,CAAC;IAC3B,CAAC;AACH,CAAC"}