@n-dx/core 0.1.0

package/packages/rex/dist/core/reorganize.d.ts

@@ -0,0 +1,109 @@
+/**
+ * Reorganization detector: analyzes PRD tree structure and proposes
+ * improvements such as merges, moves, and splits.
+ *
+ * Philosophy: The PRD is a living document. Reorganize strengthens and
+ * clarifies structure — it never deletes or prunes items. Completed work
+ * stays as a record of what was built. Use `rex prune` for explicit cleanup.
+ *
+ * Detection pipeline (ordered by confidence):
+ * 1. Structural checks — orphaned features
+ * 2. Similarity checks — near-duplicate items
+ * 3. Balance checks — oversized/undersized/single-child containers
+ *
+ * Each detector returns typed proposals that can be previewed, accepted
+ * individually, or batch-applied by the executor.
+ *
+ * @module core/reorganize
+ */
+import type { PRDItem } from "../schema/index.js";
+export type ProposalType = "merge" | "move" | "split" | "delete" | "prune" | "collapse";
+export type RiskLevel = "low" | "medium" | "high";
+export interface ReorganizationProposal {
+    /** Unique ID for this proposal (sequential, 1-based). */
+    id: number;
+    type: ProposalType;
+    /** Human-readable description of what this proposal does. */
+    description: string;
+    /** Why this proposal is being suggested. */
+    reason: string;
+    /** Confidence score, 0-1. Higher = more certain it's a good change. */
+    confidence: number;
+    risk: RiskLevel;
+    /** IDs of items affected by this proposal. */
+    items: string[];
+    /** Detail payload (type-specific). */
+    detail: ProposalDetail;
+}
+export type ProposalDetail = MergeDetail | MoveDetail | SplitDetail | DeleteDetail | PruneDetail | CollapseDetail;
+export interface MergeDetail {
+    kind: "merge";
+    /** IDs of items to merge (all must be siblings). */
+    sourceIds: string[];
+    /** ID of the surviving item. */
+    targetId: string;
+}
+export interface MoveDetail {
+    kind: "move";
+    itemId: string;
+    /** Current parent (null = root). */
+    fromParentId: string | null;
+    /** Proposed new parent (null = root). */
+    toParentId: string | null;
+}
+export interface SplitDetail {
+    kind: "split";
+    /** Container to split. */
+    containerId: string;
+    /** Proposed groups of child IDs to form new containers. */
+    groups: string[][];
+    /** Suggested titles for the new containers. */
+    suggestedTitles: string[];
+}
+export interface DeleteDetail {
+    kind: "delete";
+    itemId: string;
+    subtreeCount: number;
+}
+export interface PruneDetail {
+    kind: "prune";
+    /** Root items of completed subtrees. */
+    itemIds: string[];
+    totalCount: number;
+}
+export interface CollapseDetail {
+    kind: "collapse";
+    /** Parent with a single child. */
+    parentId: string;
+    /** The single child that would absorb the parent's role. */
+    childId: string;
+}
+export interface ReorganizationPlan {
+    proposals: ReorganizationProposal[];
+    /** Summary stats. */
+    stats: {
+        totalProposals: number;
+        byType: Record<ProposalType, number>;
+        byRisk: Record<RiskLevel, number>;
+        affectedItems: number;
+    };
+}
+export interface DetectorOptions {
+    /** Similarity threshold for near-duplicate detection. Default: 0.75 */
+    similarityThreshold?: number;
+    /** Max children before a container is considered oversized. Default: 15 */
+    maxContainerSize?: number;
+    /** Min children below which a container is undersized. Default: 2 */
+    minContainerSize?: number;
+    /** Include completed items in similarity checks. Default: false */
+    includeCompleted?: boolean;
+}
+/**
+ * Analyze the PRD tree and produce reorganization proposals.
+ * Runs all detection stages and returns a combined, deduplicated plan.
+ */
+export declare function detectReorganizations(items: PRDItem[], options?: DetectorOptions): ReorganizationPlan;
+/**
+ * Format a reorganization plan for human-readable display.
+ */
+export declare function formatReorganizationPlan(plan: ReorganizationPlan): string;

package/packages/rex/dist/core/reorganize.js

@@ -0,0 +1,453 @@
+/**
+ * Reorganization detector: analyzes PRD tree structure and proposes
+ * improvements such as merges, moves, and splits.
+ *
+ * Philosophy: The PRD is a living document. Reorganize strengthens and
+ * clarifies structure — it never deletes or prunes items. Completed work
+ * stays as a record of what was built. Use `rex prune` for explicit cleanup.
+ *
+ * Detection pipeline (ordered by confidence):
+ * 1. Structural checks — orphaned features
+ * 2. Similarity checks — near-duplicate items
+ * 3. Balance checks — oversized/undersized/single-child containers
+ *
+ * Each detector returns typed proposals that can be previewed, accepted
+ * individually, or batch-applied by the executor.
+ *
+ * @module core/reorganize
+ */
+import { isRootLevel, isContainerLevel, getLevelLabel, getLevelPlural, } from "../schema/index.js";
+import { walkTree } from "./tree.js";
+import { findEpiclessFeatures } from "./structural.js";
+import { similarity } from "../analyze/dedupe.js";
+const DEFAULT_OPTIONS = {
+    similarityThreshold: 0.75,
+    maxContainerSize: 15,
+    minContainerSize: 2,
+    includeCompleted: false,
+};
+// ── Main entry point ─────────────────────────────────────────────────────────
+/**
+ * Analyze the PRD tree and produce reorganization proposals.
+ * Runs all detection stages and returns a combined, deduplicated plan.
+ */
+export function detectReorganizations(items, options) {
+    const opts = { ...DEFAULT_OPTIONS, ...options };
+    const proposals = [];
+    let nextId = 1;
+    // Stage 1: Structural checks (high confidence)
+    for (const p of detectOrphanedFeatures(items)) {
+        proposals.push({ ...p, id: nextId++ });
+    }
+    // Note: Empty container deletion and completed subtree pruning are intentionally
+    // excluded from reorganize. The PRD is a living document — completed items stay
+    // as a record of what was built. Use `rex prune` for explicit cleanup.
+    // Stage 2: Similarity checks (medium confidence)
+    for (const p of detectNearDuplicates(items, opts)) {
+        proposals.push({ ...p, id: nextId++ });
+    }
+    // Stage 3: Balance checks (medium confidence)
+    for (const p of detectOversizedContainers(items, opts)) {
+        proposals.push({ ...p, id: nextId++ });
+    }
+    for (const p of detectUndersizedContainers(items, opts)) {
+        proposals.push({ ...p, id: nextId++ });
+    }
+    for (const p of detectSingleChildContainers(items)) {
+        proposals.push({ ...p, id: nextId++ });
+    }
+    // Compute stats
+    const byType = {
+        merge: 0, move: 0, split: 0, delete: 0, prune: 0, collapse: 0,
+    };
+    const byRisk = { low: 0, medium: 0, high: 0 };
+    const affectedIds = new Set();
+    for (const p of proposals) {
+        byType[p.type]++;
+        byRisk[p.risk]++;
+        for (const id of p.items)
+            affectedIds.add(id);
+    }
+    return {
+        proposals,
+        stats: {
+            totalProposals: proposals.length,
+            byType,
+            byRisk,
+            affectedItems: affectedIds.size,
+        },
+    };
+}
+/**
+ * Detect features at root level that should be under an epic.
+ * Uses the existing `findEpiclessFeatures()` structural check.
+ */
+function detectOrphanedFeatures(items) {
+    const orphans = findEpiclessFeatures(items);
+    if (orphans.length === 0)
+        return [];
+    // Find potential target epics
+    const epics = items.filter((i) => isRootLevel(i.level) && i.status !== "deleted");
+    return orphans.map((orphan) => {
+        // Try to find the best matching epic by title similarity
+        let bestEpic = null;
+        let bestScore = 0;
+        for (const epic of epics) {
+            const score = similarity(orphan.title, epic.title);
+            if (score > bestScore && score > 0.3) {
+                bestScore = score;
+                bestEpic = epic;
+            }
+        }
+        const toParentId = bestEpic?.id ?? null;
+        const suggestion = bestEpic
+            ? `Move under "${bestEpic.title}"`
+            : "Create a new parent or move under an existing one";
+        return {
+            type: "move",
+            description: `Move orphaned feature "${orphan.title}" under an ${getLevelLabel("epic").toLowerCase()}`,
+            reason: `Feature is at root level without a parent ${getLevelLabel("epic").toLowerCase()}. ${suggestion}.`,
+            confidence: bestEpic ? 0.7 : 0.5,
+            risk: "low",
+            items: [orphan.itemId, ...(toParentId ? [toParentId] : [])],
+            detail: {
+                kind: "move",
+                itemId: orphan.itemId,
+                fromParentId: null,
+                toParentId,
+            },
+        };
+    });
+}
+/**
+ * Collect groups of siblings at each level in the tree.
+ */
+function collectSiblingGroups(items) {
+    const groups = [];
+    // Root-level items
+    const rootItems = items.filter((i) => i.status !== "deleted");
+    if (rootItems.length > 1) {
+        // Group by level
+        const byLevel = new Map();
+        for (const item of rootItems) {
+            const arr = byLevel.get(item.level) ?? [];
+            arr.push(item);
+            byLevel.set(item.level, arr);
+        }
+        for (const [level, levelItems] of byLevel) {
+            if (levelItems.length > 1) {
+                groups.push({
+                    parentId: null,
+                    parentTitle: null,
+                    level,
+                    items: levelItems,
+                });
+            }
+        }
+    }
+    // Children at each container
+    for (const { item } of walkTree(items)) {
+        if (!isContainerLevel(item.level))
+            continue;
+        const children = (item.children ?? []).filter((c) => c.status !== "deleted");
+        if (children.length < 2)
+            continue;
+        // Group children by level
+        const byLevel = new Map();
+        for (const child of children) {
+            const arr = byLevel.get(child.level) ?? [];
+            arr.push(child);
+            byLevel.set(child.level, arr);
+        }
+        for (const [level, levelItems] of byLevel) {
+            if (levelItems.length > 1) {
+                groups.push({
+                    parentId: item.id,
+                    parentTitle: item.title,
+                    level,
+                    items: levelItems,
+                });
+            }
+        }
+    }
+    return groups;
+}
+/**
+ * Detect near-duplicate items that could be merged.
+ * Only compares siblings at the same level.
+ */
+function detectNearDuplicates(items, opts) {
+    const proposals = [];
+    const groups = collectSiblingGroups(items);
+    for (const group of groups) {
+        // Filter out completed items unless includeCompleted is set
+        const candidates = opts.includeCompleted
+            ? group.items
+            : group.items.filter((i) => i.status !== "completed");
+        if (candidates.length < 2)
+            continue;
+        // Compare all pairs
+        const merged = new Set();
+        for (let i = 0; i < candidates.length; i++) {
+            if (merged.has(candidates[i].id))
+                continue;
+            for (let j = i + 1; j < candidates.length; j++) {
+                if (merged.has(candidates[j].id))
+                    continue;
+                const a = candidates[i];
+                const b = candidates[j];
+                // Title similarity
+                let score = similarity(a.title, b.title);
+                // Boost with description similarity if both have descriptions
+                if (a.description && b.description) {
+                    const descScore = similarity(a.description, b.description);
+                    score = Math.max(score, score * 0.6 + descScore * 0.4);
+                }
+                if (score >= opts.similarityThreshold) {
+                    // Pick the richer item as the target
+                    const targetId = pickRicher(a, b);
+                    const otherId = targetId === a.id ? b.id : a.id;
+                    const target = targetId === a.id ? a : b;
+                    const other = targetId === a.id ? b : a;
+                    merged.add(otherId);
+                    const label = getLevelLabel(group.level);
+                    proposals.push({
+                        type: "merge",
+                        description: `Merge similar ${label.toLowerCase()}s: "${other.title}" into "${target.title}"`,
+                        reason: `These ${label.toLowerCase()}s have ${Math.round(score * 100)}% title/description similarity and appear to cover the same work.`,
+                        confidence: Math.min(score, 0.85),
+                        risk: "medium",
+                        items: [targetId, otherId],
+                        detail: {
+                            kind: "merge",
+                            sourceIds: [targetId, otherId],
+                            targetId,
+                        },
+                    });
+                }
+            }
+        }
+    }
+    return proposals;
+}
+/**
+ * Pick the "richer" item between two candidates for merge targeting.
+ * Prefers items with more children, descriptions, acceptance criteria.
+ */
+function pickRicher(a, b) {
+    let scoreA = 0;
+    let scoreB = 0;
+    // More children = richer
+    scoreA += (a.children?.length ?? 0) * 10;
+    scoreB += (b.children?.length ?? 0) * 10;
+    // Has description
+    if (a.description)
+        scoreA += 5;
+    if (b.description)
+        scoreB += 5;
+    // Has acceptance criteria
+    if (a.acceptanceCriteria?.length)
+        scoreA += 3;
+    if (b.acceptanceCriteria?.length)
+        scoreB += 3;
+    // Longer title (more descriptive)
+    scoreA += a.title.length;
+    scoreB += b.title.length;
+    return scoreA >= scoreB ? a.id : b.id;
+}
+// ── Stage 3: Balance checks ─────────────────────────────────────────────────
+/**
+ * Detect containers with too many direct children.
+ */
+function detectOversizedContainers(items, opts) {
+    const proposals = [];
+    for (const { item } of walkTree(items)) {
+        if (!isContainerLevel(item.level))
+            continue;
+        if (item.status === "deleted")
+            continue;
+        const liveChildren = (item.children ?? []).filter((c) => c.status !== "deleted");
+        if (liveChildren.length <= opts.maxContainerSize)
+            continue;
+        const label = getLevelLabel(item.level);
+        const childLabel = getLevelPlural(liveChildren[0]?.level ?? item.level);
+        proposals.push({
+            type: "split",
+            description: `Split oversized ${label.toLowerCase()} "${item.title}" (${liveChildren.length} ${childLabel.toLowerCase()})`,
+            reason: `This ${label.toLowerCase()} has ${liveChildren.length} direct children, exceeding the recommended maximum of ${opts.maxContainerSize}. Splitting improves navigability.`,
+            confidence: 0.6,
+            risk: "medium",
+            items: [item.id, ...liveChildren.map((c) => c.id)],
+            detail: {
+                kind: "split",
+                containerId: item.id,
+                groups: [], // Populated by executor or LLM
+                suggestedTitles: [],
+            },
+        });
+    }
+    return proposals;
+}
+/**
+ * Detect containers with very few children (below minimum threshold).
+ * These might be better merged with a sibling container.
+ */
+function detectUndersizedContainers(items, opts) {
+    const proposals = [];
+    const seen = new Set();
+    // Check root-level containers
+    checkSiblingContainers(items, null, opts, proposals, seen);
+    // Check nested containers
+    for (const { item } of walkTree(items)) {
+        if (!isContainerLevel(item.level))
+            continue;
+        if (item.status === "deleted")
+            continue;
+        if (!item.children?.length)
+            continue;
+        checkSiblingContainers(item.children, item.id, opts, proposals, seen);
+    }
+    return proposals;
+}
+function checkSiblingContainers(siblings, parentId, opts, proposals, seen) {
+    const containers = siblings.filter((s) => isContainerLevel(s.level) && s.status !== "deleted");
+    if (containers.length < 2)
+        return;
+    for (const container of containers) {
+        if (seen.has(container.id))
+            continue;
+        const liveChildren = (container.children ?? []).filter((c) => c.status !== "deleted");
+        if (liveChildren.length >= opts.minContainerSize)
+            continue;
+        if (liveChildren.length === 0)
+            continue; // Empty containers handled separately
+        // Find a sibling to merge into
+        const bestSibling = findBestMergeSibling(container, containers);
+        if (!bestSibling)
+            continue;
+        seen.add(container.id);
+        const label = getLevelLabel(container.level);
+        proposals.push({
+            type: "merge",
+            description: `Merge undersized ${label.toLowerCase()} "${container.title}" (${liveChildren.length} child${liveChildren.length === 1 ? "" : "ren"}) into "${bestSibling.title}"`,
+            reason: `This ${label.toLowerCase()} has only ${liveChildren.length} child item${liveChildren.length === 1 ? "" : "s"}, below the recommended minimum of ${opts.minContainerSize}. Consider merging with a related sibling.`,
+            confidence: 0.5,
+            risk: "medium",
+            items: [bestSibling.id, container.id],
+            detail: {
+                kind: "merge",
+                sourceIds: [bestSibling.id, container.id],
+                targetId: bestSibling.id,
+            },
+        });
+    }
+}
+/**
+ * Find the best sibling to merge into based on title similarity.
+ */
+function findBestMergeSibling(item, siblings) {
+    let best = null;
+    let bestScore = -1;
+    for (const sibling of siblings) {
+        if (sibling.id === item.id)
+            continue;
+        if (sibling.status === "deleted")
+            continue;
+        const score = similarity(item.title, sibling.title);
+        if (score > bestScore) {
+            bestScore = score;
+            best = sibling;
+        }
+    }
+    return best;
+}
+/**
+ * Detect containers with exactly one child — the container can be collapsed
+ * by promoting the child or merging into the child.
+ */
+function detectSingleChildContainers(items) {
+    const proposals = [];
+    for (const { item } of walkTree(items)) {
+        if (!isContainerLevel(item.level))
+            continue;
+        if (item.status === "deleted" || item.status === "completed")
+            continue;
+        const liveChildren = (item.children ?? []).filter((c) => c.status !== "deleted");
+        if (liveChildren.length !== 1)
+            continue;
+        const child = liveChildren[0];
+        // Only propose collapse if the child is also a container
+        if (!isContainerLevel(child.level))
+            continue;
+        const parentLabel = getLevelLabel(item.level);
+        const childLabel = getLevelLabel(child.level);
+        proposals.push({
+            type: "collapse",
+            description: `Collapse single-child ${parentLabel.toLowerCase()} "${item.title}" → ${childLabel.toLowerCase()} "${child.title}"`,
+            reason: `This ${parentLabel.toLowerCase()} has only one child ${childLabel.toLowerCase()}. The intermediate level adds hierarchy without adding organization value.`,
+            confidence: 0.65,
+            risk: "low",
+            items: [item.id, child.id],
+            detail: {
+                kind: "collapse",
+                parentId: item.id,
+                childId: child.id,
+            },
+        });
+    }
+    return proposals;
+}
+// ── Formatting ───────────────────────────────────────────────────────────────
+const TYPE_ICONS = {
+    merge: "🔀",
+    move: "📦",
+    split: "✂️",
+    delete: "🗑️",
+    prune: "🌿",
+    collapse: "📎",
+};
+const RISK_ICONS = {
+    low: "🟢",
+    medium: "🟡",
+    high: "🔴",
+};
+/**
+ * Format a reorganization plan for human-readable display.
+ */
+export function formatReorganizationPlan(plan) {
+    if (plan.proposals.length === 0) {
+        return "No reorganization proposals. The PRD structure looks good.";
+    }
+    const lines = [];
+    lines.push("Reorganization Proposals");
+    lines.push("─".repeat(50));
+    lines.push("");
+    // Group by type
+    const grouped = new Map();
+    for (const p of plan.proposals) {
+        const arr = grouped.get(p.type) ?? [];
+        arr.push(p);
+        grouped.set(p.type, arr);
+    }
+    for (const [type, proposals] of grouped) {
+        const icon = TYPE_ICONS[type];
+        lines.push(`${icon} ${capitalize(type)} (${proposals.length})`);
+        lines.push("");
+        for (const p of proposals) {
+            const riskIcon = RISK_ICONS[p.risk];
+            lines.push(`  #${p.id} ${riskIcon} ${p.description}`);
+            lines.push(`     ${p.reason}`);
+            lines.push(`     Confidence: ${Math.round(p.confidence * 100)}% | Risk: ${p.risk}`);
+            lines.push("");
+        }
+    }
+    lines.push("─".repeat(50));
+    lines.push(`${plan.stats.totalProposals} proposal${plan.stats.totalProposals === 1 ? "" : "s"} | ` +
+        `${plan.stats.affectedItems} affected item${plan.stats.affectedItems === 1 ? "" : "s"} | ` +
+        `Low risk: ${plan.stats.byRisk.low} | Medium: ${plan.stats.byRisk.medium} | High: ${plan.stats.byRisk.high}`);
+    return lines.join("\n");
+}
+function capitalize(s) {
+    return s.charAt(0).toUpperCase() + s.slice(1);
+}
+//# sourceMappingURL=reorganize.js.map

package/packages/rex/dist/core/reorganize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reorganize.js","sourceRoot":"","sources":["../../src/core/reorganize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAGH,OAAO,EACL,WAAW,EACX,gBAAgB,EAEhB,aAAa,EACb,cAAc,GACf,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,QAAQ,EAAY,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AAEvD,OAAO,EAAE,UAAU,EAAE,MAAM,sBAAsB,CAAC;AA+GlD,MAAM,eAAe,GAA8B;IACjD,mBAAmB,EAAE,IAAI;IACzB,gBAAgB,EAAE,EAAE;IACpB,gBAAgB,EAAE,CAAC;IACnB,gBAAgB,EAAE,KAAK;CACxB,CAAC;AAEF,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,KAAgB,EAChB,OAAyB;IAEzB,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAChD,MAAM,SAAS,GAA6B,EAAE,CAAC;IAC/C,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,+CAA+C;IAC/C,KAAK,MAAM,CAAC,IAAI,sBAAsB,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,iFAAiF;IACjF,gFAAgF;IAChF,uEAAuE;IAEvE,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QAClD,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,8CAA8C;IAC9C,KAAK,MAAM,CAAC,IAAI,yBAAyB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACvD,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,0BAA0B,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;QACxD,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,2BAA2B,CAAC,KAAK,CAAC,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IAED,gBAAgB;IAChB,MAAM,MAAM,GAAiC;QAC3C,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC;KAC9D,CAAC;IACF,MAAM,MAAM,GAA8B,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IACzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IAEtC,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjB,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjB,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK;YAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,OAAO;QACL,SAAS;QACT,KAAK,EAAE;YACL,cAAc,EAAE,SAAS,CAAC,MAAM;YAChC,MAAM;YACN,MAAM;YACN,aAAa,EAAE,WAAW,CAAC,IAAI;SAChC;KACF,CAAC;AACJ,CAAC;AAMD;;;GAGG;AACH,SAAS,sBAAsB,CAAC,KAAgB;IAC9C,MAAM,OAAO,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,8BAA8B;IAC9B,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAElF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAC5B,yDAAyD;QACzD,IAAI,QAAQ,GAAmB,IAAI,CAAC;QACpC,IAAI,SAAS,GAAG,CAAC,CAAC;QAElB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;YACnD,IAAI,KAAK,GAAG,SAAS,IAAI,KAAK,GAAG,GAAG,EAAE,CAAC;gBACrC,SAAS,GAAG,KAAK,CAAC;gBAClB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,QAAQ,EAAE,EAAE,IAAI,IAAI,CAAC;QACxC,MAAM,UAAU,GAAG,QAAQ;YACzB,CAAC,CAAC,eAAe,QAAQ,CAAC,KAAK,GAAG;YAClC,CAAC,CAAC,mDAAmD,CAAC;QAExD,OAAO;YACL,IAAI,EAAE,MAAe;YACrB,WAAW,EAAE,0BAA0B,MAAM,CAAC,KAAK,cAAc,aAAa,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE;YACtG,MAAM,EAAE,6CAA6C,aAAa,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,KAAK,UAAU,GAAG;YAC1G,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;YAChC,IAAI,EAAE,KAAc;YACpB,KAAK,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC3D,MAAM,EAAE;gBACN,IAAI,EAAE,MAAe;gBACrB,MAAM,EAAE,MAAM,CAAC,MAAM;gBACrB,YAAY,EAAE,IAAI;gBAClB,UAAU;aACX;SACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAWD;;GAEG;AACH,SAAS,oBAAoB,CAAC,KAAgB;IAC5C,MAAM,MAAM,GAAmB,EAAE,CAAC;IAElC,mBAAmB;IACnB,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;IAC9D,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,iBAAiB;QACjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;QAChD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1C,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACf,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC/B,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,OAAO,EAAE,CAAC;YAC1C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC;oBACV,QAAQ,EAAE,IAAI;oBACd,WAAW,EAAE,IAAI;oBACjB,KAAK;oBACL,KAAK,EAAE,UAAU;iBAClB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5C,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;QAC7E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAElC,0BAA0B;QAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAC3C,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,OAAO,EAAE,CAAC;YAC1C,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC;oBACV,QAAQ,EAAE,IAAI,CAAC,EAAE;oBACjB,WAAW,EAAE,IAAI,CAAC,KAAK;oBACvB,KAAK;oBACL,KAAK,EAAE,UAAU;iBAClB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,KAAgB,EAChB,IAA+B;IAE/B,MAAM,SAAS,GAAsB,EAAE,CAAC;IACxC,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAE3C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,4DAA4D;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB;YACtC,CAAC,CAAC,KAAK,CAAC,KAAK;YACb,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;QAExD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAEpC,oBAAoB;QACpB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAE3C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBACxB,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAExB,mBAAmB;gBACnB,IAAI,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAEzC,8DAA8D;gBAC9D,IAAI,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC;oBAC3D,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC,CAAC;gBACzD,CAAC;gBAED,IAAI,KAAK,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBACtC,qCAAqC;oBACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClC,MAAM,OAAO,GAAG,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChD,MAAM,MAAM,GAAG,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzC,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAExC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oBAEpB,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBACzC,SAAS,CAAC,IAAI,CAAC;wBACb,IAAI,EAAE,OAAO;wBACb,WAAW,EAAE,iBAAiB,KAAK,CAAC,WAAW,EAAE,OAAO,KAAK,CAAC,KAAK,WAAW,MAAM,CAAC,KAAK,GAAG;wBAC7F,MAAM,EAAE,SAAS,KAAK,CAAC,WAAW,EAAE,UAAU,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,mEAAmE;wBACxI,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC;wBACjC,IAAI,EAAE,QAAQ;wBACd,KAAK,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC;wBAC1B,MAAM,EAAE;4BACN,IAAI,EAAE,OAAO;4BACb,SAAS,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC;4BAC9B,QAAQ;yBACT;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAU,EAAE,CAAU;IACxC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,yBAAyB;IACzB,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;IACzC,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC;IAEzC,kBAAkB;IAClB,IAAI,CAAC,CAAC,WAAW;QAAE,MAAM,IAAI,CAAC,CAAC;IAC/B,IAAI,CAAC,CAAC,WAAW;QAAE,MAAM,IAAI,CAAC,CAAC;IAE/B,0BAA0B;IAC1B,IAAI,CAAC,CAAC,kBAAkB,EAAE,MAAM;QAAE,MAAM,IAAI,CAAC,CAAC;IAC9C,IAAI,CAAC,CAAC,kBAAkB,EAAE,MAAM;QAAE,MAAM,IAAI,CAAC,CAAC;IAE9C,kCAAkC;IAClC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACzB,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAEzB,OAAO,MAAM,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AACxC,CAAC;AAED,+EAA+E;AAE/E;;GAEG;AACH,SAAS,yBAAyB,CAChC,KAAgB,EAChB,IAA+B;IAE/B,MAAM,SAAS,GAAsB,EAAE,CAAC;IAExC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QAExC,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;QACjF,IAAI,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,gBAAgB;YAAE,SAAS;QAE3D,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;QAExE,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,OAAO;YACb,WAAW,EAAE,mBAAmB,KAAK,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,KAAK,MAAM,YAAY,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,EAAE,GAAG;YAC1H,MAAM,EAAE,QAAQ,KAAK,CAAC,WAAW,EAAE,QAAQ,YAAY,CAAC,MAAM,0DAA0D,IAAI,CAAC,gBAAgB,oCAAoC;YACjL,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClD,MAAM,EAAE;gBACN,IAAI,EAAE,OAAO;gBACb,WAAW,EAAE,IAAI,CAAC,EAAE;gBACpB,MAAM,EAAE,EAAE,EAAE,+BAA+B;gBAC3C,eAAe,EAAE,EAAE;aACpB;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;GAGG;AACH,SAAS,0BAA0B,CACjC,KAAgB,EAChB,IAA+B;IAE/B,MAAM,SAAS,GAAsB,EAAE,CAAC;IACxC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,8BAA8B;IAC9B,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IAE3D,0BAA0B;IAC1B,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QACxC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM;YAAE,SAAS;QACrC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACxE,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,sBAAsB,CAC7B,QAAmB,EACnB,QAAuB,EACvB,IAA+B,EAC/B,SAA4B,EAC5B,IAAiB;IAEjB,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,SAAS,CAC3D,CAAC;IACF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO;IAElC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;YAAE,SAAS;QAErC,MAAM,YAAY,GAAG,CAAC,SAAS,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;QACtF,IAAI,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,gBAAgB;YAAE,SAAS;QAC3D,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS,CAAC,sCAAsC;QAE/E,+BAA+B;QAC/B,MAAM,WAAW,GAAG,oBAAoB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAChE,IAAI,CAAC,WAAW;YAAE,SAAS;QAE3B,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAEvB,MAAM,KAAK,GAAG,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7C,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,OAAO;YACb,WAAW,EAAE,oBAAoB,KAAK,CAAC,WAAW,EAAE,KAAK,SAAS,CAAC,KAAK,MAAM,YAAY,CAAC,MAAM,SAAS,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,WAAW,WAAW,CAAC,KAAK,GAAG;YAC/K,MAAM,EAAE,QAAQ,KAAK,CAAC,WAAW,EAAE,aAAa,YAAY,CAAC,MAAM,cAAc,YAAY,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,sCAAsC,IAAI,CAAC,gBAAgB,4CAA4C;YAC5N,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC;YACrC,MAAM,EAAE;gBACN,IAAI,EAAE,OAAO;gBACb,SAAS,EAAE,CAAC,WAAW,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,CAAC;gBACzC,QAAQ,EAAE,WAAW,CAAC,EAAE;aACzB;SACF,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,IAAa,EACb,QAAmB;IAEnB,IAAI,IAAI,GAAmB,IAAI,CAAC;IAChC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IAEnB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE;YAAE,SAAS;QACrC,IAAI,OAAO,CAAC,MAAM,KAAK,SAAS;YAAE,SAAS;QAE3C,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACpD,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,IAAI,GAAG,OAAO,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,2BAA2B,CAAC,KAAgB;IACnD,MAAM,SAAS,GAAsB,EAAE,CAAC;IAExC,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,SAAS;QAC5C,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW;YAAE,SAAS;QAEvE,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC;QACjF,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAExC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,yDAAyD;QACzD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,SAAS;QAE7C,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAE9C,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,UAAU;YAChB,WAAW,EAAE,yBAAyB,WAAW,CAAC,WAAW,EAAE,KAAK,IAAI,CAAC,KAAK,OAAO,UAAU,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,KAAK,GAAG;YAChI,MAAM,EAAE,QAAQ,WAAW,CAAC,WAAW,EAAE,uBAAuB,UAAU,CAAC,WAAW,EAAE,4EAA4E;YACpK,UAAU,EAAE,IAAI;YAChB,IAAI,EAAE,KAAK;YACX,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,EAAE;gBACN,IAAI,EAAE,UAAU;gBAChB,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,OAAO,EAAE,KAAK,CAAC,EAAE;aAClB;SACF,CAAC,CAAC;IACL,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,GAAiC;IAC/C,KAAK,EAAE,IAAI;IACX,IAAI,EAAE,IAAI;IACV,KAAK,EAAE,IAAI;IACX,MAAM,EAAE,KAAK;IACb,KAAK,EAAE,IAAI;IACX,QAAQ,EAAE,IAAI;CACf,CAAC;AAEF,MAAM,UAAU,GAA8B;IAC5C,GAAG,EAAE,IAAI;IACT,MAAM,EAAE,IAAI;IACZ,IAAI,EAAE,IAAI;CACX,CAAC;AAEF;;GAEG;AACH,MAAM,UAAU,wBAAwB,CAAC,IAAwB;IAC/D,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAChC,OAAO,4DAA4D,CAAC;IACtE,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IACvC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,gBAAgB;IAChB,MAAM,OAAO,GAAG,IAAI,GAAG,EAA0C,CAAC;IAClE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACtC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;QACxC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAChE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,QAAQ,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,oBAAoB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YACpF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,KAAK,CAAC,IAAI,CACR,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,YAAY,IAAI,CAAC,KAAK,CAAC,cAAc,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK;QACvF,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,iBAAiB,IAAI,CAAC,KAAK,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK;QAC1F,aAAa,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,cAAc,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,YAAY,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAC7G,CAAC;IAEF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,UAAU,CAAC,CAAS;IAC3B,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC"}