@apart-tech/intelligence-core 0.1.0

package/dist/services/cleaning-service.js

@@ -0,0 +1,632 @@
+import { tenantWhere, SINGLE_TENANT_ORG_ID } from "../db/tenant.js";
+// ── Service ─────────────────────────────────────────────────────────────────
+export class CleaningService {
+    db;
+    tenantCtx;
+    constructor(db, tenantCtx) {
+        this.db = db;
+        this.tenantCtx = tenantCtx ?? { organizationId: SINGLE_TENANT_ORG_ID };
+    }
+    /**
+     * Find nodes with zero edges.
+     */
+    async findOrphans() {
+        const orgFilter = tenantWhere(this.tenantCtx, "n");
+        const orphanIds = await this.db.$queryRaw `
+      SELECT n.id
+      FROM nodes n
+      LEFT JOIN edges e ON e.source_node_id = n.id OR e.target_node_id = n.id
+      WHERE e.id IS NULL
+        AND ${orgFilter}
+      ORDER BY n.created_at DESC
+    `;
+        if (orphanIds.length === 0)
+            return [];
+        const nodes = await this.db.node.findMany({
+            where: { id: { in: orphanIds.map((r) => r.id) } },
+            orderBy: { createdAt: "desc" },
+        });
+        return nodes.map((node) => ({ node }));
+    }
+    /**
+     * Find node pairs with cosine similarity above threshold.
+     */
+    async findDuplicates(threshold = 0.95, limit = 50) {
+        const orgFilterA = tenantWhere(this.tenantCtx, "a");
+        const pairs = await this.db.$queryRaw `
+      SELECT
+        a.id AS a_id,
+        b.id AS b_id,
+        1 - (a.embedding <=> b.embedding) AS similarity
+      FROM nodes a
+      JOIN nodes b ON a.id < b.id
+      WHERE a.embedding IS NOT NULL
+        AND b.embedding IS NOT NULL
+        AND 1 - (a.embedding <=> b.embedding) >= ${threshold}
+        AND ${orgFilterA}
+      ORDER BY similarity DESC
+      LIMIT ${limit}
+    `;
+        if (pairs.length === 0)
+            return [];
+        // Batch-fetch all involved nodes
+        const nodeIds = new Set();
+        for (const p of pairs) {
+            nodeIds.add(p.a_id);
+            nodeIds.add(p.b_id);
+        }
+        const nodes = await this.db.node.findMany({
+            where: { id: { in: [...nodeIds] } },
+        });
+        const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+        return pairs
+            .filter((p) => nodeMap.has(p.a_id) && nodeMap.has(p.b_id))
+            .map((p) => ({
+            nodeA: nodeMap.get(p.a_id),
+            nodeB: nodeMap.get(p.b_id),
+            similarity: Number(p.similarity),
+        }));
+    }
+    /**
+     * Comprehensive graph health report.
+     */
+    async getHealthReport(staleDays = 90) {
+        const staleDate = new Date();
+        staleDate.setDate(staleDate.getDate() - staleDays);
+        const orgFilterN = tenantWhere(this.tenantCtx, "n");
+        const orgFilterE = tenantWhere(this.tenantCtx);
+        const orgFilterA = tenantWhere(this.tenantCtx, "a");
+        // Run independent queries in parallel
+        const [totalNodes, totalEdges, byStatus, byType, byRelType, orphanCount, undomainedCount, staleCount, selfLoopCount, duplicateEdgeRows, duplicateCandidateCount, allEdges,] = await Promise.all([
+            this.db.node.count(),
+            this.db.edge.count(),
+            this.db.node.groupBy({
+                by: ["status"],
+                _count: { status: true },
+                orderBy: { _count: { status: "desc" } },
+            }),
+            this.db.node.groupBy({
+                by: ["type"],
+                _count: { type: true },
+                orderBy: { _count: { type: "desc" } },
+            }),
+            this.db.edge.groupBy({
+                by: ["relationshipType"],
+                _count: { relationshipType: true },
+                orderBy: { _count: { relationshipType: "desc" } },
+            }),
+            this.db.$queryRaw `
+        SELECT COUNT(*) as count FROM nodes n
+        LEFT JOIN edges e ON e.source_node_id = n.id OR e.target_node_id = n.id
+        WHERE e.id IS NULL
+          AND ${orgFilterN}
+      `.then((r) => Number(r[0].count)),
+            this.db.node.count({ where: { domainId: null } }),
+            this.db.node.count({ where: { updatedAt: { lt: staleDate } } }),
+            this.db.$queryRaw `
+        SELECT COUNT(*) as count FROM edges
+        WHERE source_node_id = target_node_id
+          AND ${orgFilterE}
+      `.then((r) => Number(r[0].count)),
+            this.db.$queryRaw `
+        SELECT COUNT(*) as count FROM (
+          SELECT source_node_id, target_node_id, relationship_type
+          FROM edges
+          WHERE ${orgFilterE}
+          GROUP BY source_node_id, target_node_id, relationship_type
+          HAVING COUNT(*) > 1
+        ) dupes
+      `.then((r) => Number(r[0].count)),
+            this.db.$queryRaw `
+        SELECT COUNT(*) as count FROM (
+          SELECT a.id
+          FROM nodes a
+          JOIN nodes b ON a.id < b.id
+          WHERE a.embedding IS NOT NULL
+            AND b.embedding IS NOT NULL
+            AND 1 - (a.embedding <=> b.embedding) >= 0.95
+            AND ${orgFilterA}
+          LIMIT 1
+        ) pairs
+      `.then((r) => Number(r[0].count)),
+            this.db.edge.findMany({ select: { sourceNodeId: true, targetNodeId: true } }),
+        ]);
+        // Compute connected components via union-find
+        const componentMap = this.computeComponentMap(allEdges);
+        const { components, largestSize } = this.summarizeComponents(componentMap, totalNodes);
+        const avgEdgesPerNode = totalNodes > 0 ? (totalEdges * 2) / totalNodes : 0;
+        return {
+            nodes: {
+                total: totalNodes,
+                byStatus: byStatus.map((r) => ({
+                    status: r.status,
+                    count: r._count.status,
+                })),
+                byType: byType.map((r) => ({
+                    type: r.type,
+                    count: r._count.type,
+                })),
+                orphanCount,
+                undomainedCount,
+                staleCount,
+            },
+            edges: {
+                total: totalEdges,
+                byRelationshipType: byRelType.map((r) => ({
+                    relationshipType: r.relationshipType,
+                    count: r._count.relationshipType,
+                })),
+                selfLoopCount,
+                duplicateCount: duplicateEdgeRows,
+            },
+            graph: {
+                avgEdgesPerNode: Math.round(avgEdgesPerNode * 100) / 100,
+                connectedComponents: components,
+                largestComponentSize: largestSize,
+            },
+            duplicateCandidates: duplicateCandidateCount > 0 ? duplicateCandidateCount : 0,
+        };
+    }
+    /**
+     * Validate edges for integrity issues.
+     */
+    async validateEdges({ lowRelevanceThreshold = 0.3, rareTypeThreshold = 1 } = {}) {
+        const issues = [];
+        const orgFilterE = tenantWhere(this.tenantCtx);
+        const orgFilterEdge = tenantWhere(this.tenantCtx, "e");
+        const [selfLoopRows, duplicateEdges, lowRelevancePairs, relTypeCounts, allEdges,] = await Promise.all([
+            this.db.$queryRaw `
+        SELECT id, source_node_id FROM edges WHERE source_node_id = target_node_id AND ${orgFilterE}
+      `,
+            this.db.$queryRaw `
+        SELECT source_node_id, target_node_id, relationship_type, COUNT(*) as cnt,
+               array_agg(id::text) as ids
+        FROM edges
+        WHERE ${orgFilterE}
+        GROUP BY source_node_id, target_node_id, relationship_type
+        HAVING COUNT(*) > 1
+      `,
+            this.db.$queryRaw `
+        SELECT e.id as edge_id, e.source_node_id, e.target_node_id, e.relationship_type,
+               1 - (a.embedding <=> b.embedding) AS similarity
+        FROM edges e
+        JOIN nodes a ON a.id = e.source_node_id
+        JOIN nodes b ON b.id = e.target_node_id
+        WHERE a.embedding IS NOT NULL AND b.embedding IS NOT NULL
+          AND 1 - (a.embedding <=> b.embedding) < ${lowRelevanceThreshold}
+          AND ${orgFilterEdge}
+        ORDER BY similarity ASC
+      `,
+            this.db.edge.groupBy({
+                by: ["relationshipType"],
+                _count: { relationshipType: true },
+            }),
+            this.db.edge.findMany(),
+        ]);
+        const totalEdgesChecked = allEdges.length;
+        // Batch-fetch nodes for all issues
+        const nodeIdsNeeded = new Set();
+        for (const e of selfLoopRows)
+            nodeIdsNeeded.add(e.source_node_id);
+        for (const d of duplicateEdges) {
+            nodeIdsNeeded.add(d.source_node_id);
+            nodeIdsNeeded.add(d.target_node_id);
+        }
+        for (const lr of lowRelevancePairs) {
+            nodeIdsNeeded.add(lr.source_node_id);
+            nodeIdsNeeded.add(lr.target_node_id);
+        }
+        const nodesById = nodeIdsNeeded.size > 0
+            ? new Map((await this.db.node.findMany({
+                where: { id: { in: [...nodeIdsNeeded] } },
+            })).map((n) => [n.id, n]))
+            : new Map();
+        // 1. Self-loops
+        for (const row of selfLoopRows) {
+            const edge = allEdges.find((e) => e.id === row.id);
+            if (!edge)
+                continue;
+            const node = nodesById.get(row.source_node_id);
+            issues.push({
+                severity: "error",
+                category: "self-loop",
+                message: `Edge points to itself: ${node?.title ?? row.source_node_id}`,
+                edges: [edge],
+                sourceNode: node,
+                targetNode: node,
+            });
+        }
+        // 2. Duplicate edges
+        for (const dupe of duplicateEdges) {
+            const edgeIds = dupe.ids;
+            const edges = allEdges.filter((e) => edgeIds.includes(e.id));
+            issues.push({
+                severity: "warning",
+                category: "duplicate-edge",
+                message: `${Number(dupe.cnt)} duplicate "${dupe.relationship_type}" edges between nodes`,
+                edges,
+                sourceNode: nodesById.get(dupe.source_node_id),
+                targetNode: nodesById.get(dupe.target_node_id),
+            });
+        }
+        // 3. Low-relevance connections
+        for (const lr of lowRelevancePairs) {
+            const edge = allEdges.find((e) => e.id === lr.edge_id);
+            if (!edge)
+                continue;
+            issues.push({
+                severity: "warning",
+                category: "low-relevance",
+                message: `Low similarity (${(Number(lr.similarity) * 100).toFixed(1)}%) between connected nodes`,
+                edges: [edge],
+                sourceNode: nodesById.get(lr.source_node_id),
+                targetNode: nodesById.get(lr.target_node_id),
+                similarity: Number(lr.similarity),
+            });
+        }
+        // 4. Contradictory edges (same node pair with opposing relationship types)
+        const contradictionPairs = [
+            ["supports", "contradicts"],
+            ["enables", "blocks"],
+            ["requires", "excludes"],
+        ];
+        const edgesByPair = new Map();
+        for (const edge of allEdges) {
+            const key = [edge.sourceNodeId, edge.targetNodeId].sort().join("|");
+            if (!edgesByPair.has(key))
+                edgesByPair.set(key, []);
+            edgesByPair.get(key).push(edge);
+        }
+        for (const [, pairEdges] of edgesByPair) {
+            if (pairEdges.length < 2)
+                continue;
+            const types = new Set(pairEdges.map((e) => e.relationshipType));
+            for (const [typeA, typeB] of contradictionPairs) {
+                if (types.has(typeA) && types.has(typeB)) {
+                    const contradicting = pairEdges.filter((e) => e.relationshipType === typeA || e.relationshipType === typeB);
+                    // Fetch nodes if not already loaded
+                    for (const e of contradicting) {
+                        if (!nodesById.has(e.sourceNodeId)) {
+                            const n = await this.db.node.findUnique({ where: { id: e.sourceNodeId } });
+                            if (n)
+                                nodesById.set(n.id, n);
+                        }
+                        if (!nodesById.has(e.targetNodeId)) {
+                            const n = await this.db.node.findUnique({ where: { id: e.targetNodeId } });
+                            if (n)
+                                nodesById.set(n.id, n);
+                        }
+                    }
+                    issues.push({
+                        severity: "error",
+                        category: "contradictory",
+                        message: `Contradictory edges: "${typeA}" and "${typeB}" between same nodes`,
+                        edges: contradicting,
+                        sourceNode: nodesById.get(contradicting[0].sourceNodeId),
+                        targetNode: nodesById.get(contradicting[0].targetNodeId),
+                    });
+                }
+            }
+        }
+        // 5. Rare relationship types (potential typos)
+        const rareTypes = relTypeCounts.filter((r) => r._count.relationshipType <= rareTypeThreshold);
+        for (const rare of rareTypes) {
+            const rareEdges = allEdges.filter((e) => e.relationshipType === rare.relationshipType);
+            // Fetch nodes for rare edges
+            for (const e of rareEdges) {
+                if (!nodesById.has(e.sourceNodeId)) {
+                    const n = await this.db.node.findUnique({ where: { id: e.sourceNodeId } });
+                    if (n)
+                        nodesById.set(n.id, n);
+                }
+                if (!nodesById.has(e.targetNodeId)) {
+                    const n = await this.db.node.findUnique({ where: { id: e.targetNodeId } });
+                    if (n)
+                        nodesById.set(n.id, n);
+                }
+            }
+            issues.push({
+                severity: "info",
+                category: "rare-relationship-type",
+                message: `Relationship type "${rare.relationshipType}" used only ${rare._count.relationshipType} time(s) — possible typo?`,
+                edges: rareEdges,
+                sourceNode: rareEdges[0] ? nodesById.get(rareEdges[0].sourceNodeId) : undefined,
+                targetNode: rareEdges[0] ? nodesById.get(rareEdges[0].targetNodeId) : undefined,
+            });
+        }
+        // Build summary
+        const summary = {
+            "self-loop": 0,
+            "duplicate-edge": 0,
+            "low-relevance": 0,
+            "contradictory": 0,
+            "rare-relationship-type": 0,
+        };
+        for (const issue of issues) {
+            summary[issue.category]++;
+        }
+        return {
+            issues,
+            summary,
+            totalIssues: issues.length,
+            totalEdgesChecked,
+        };
+    }
+    /**
+     * Suggest links for a specific node based on embedding similarity,
+     * excluding nodes already connected to it.
+     */
+    async suggestLinksForNode(nodeId, { limit = 10, minSimilarity = 0.7 } = {}) {
+        const orgFilterA = tenantWhere(this.tenantCtx, "a");
+        const suggestions = await this.db.$queryRaw `
+      SELECT
+        b.id AS target_id,
+        1 - (a.embedding <=> b.embedding) AS similarity
+      FROM nodes a
+      JOIN nodes b ON a.id != b.id
+      WHERE a.id = ${nodeId}::uuid
+        AND a.embedding IS NOT NULL
+        AND b.embedding IS NOT NULL
+        AND b.id NOT IN (
+          SELECT CASE WHEN source_node_id = ${nodeId}::uuid THEN target_node_id ELSE source_node_id END
+          FROM edges
+          WHERE source_node_id = ${nodeId}::uuid OR target_node_id = ${nodeId}::uuid
+        )
+        AND 1 - (a.embedding <=> b.embedding) >= ${minSimilarity}
+        AND ${orgFilterA}
+      ORDER BY similarity DESC
+      LIMIT ${limit}
+    `;
+        if (suggestions.length === 0)
+            return [];
+        const sourceNode = await this.db.node.findUnique({ where: { id: nodeId } });
+        if (!sourceNode)
+            return [];
+        const targetNodes = await this.db.node.findMany({
+            where: { id: { in: suggestions.map((s) => s.target_id) } },
+        });
+        const targetMap = new Map(targetNodes.map((n) => [n.id, n]));
+        return suggestions
+            .filter((s) => targetMap.has(s.target_id))
+            .map((s) => ({
+            source: sourceNode,
+            target: targetMap.get(s.target_id),
+            similarity: Number(s.similarity),
+        }));
+    }
+    /**
+     * Scan the full graph for high-similarity unconnected pairs.
+     */
+    async suggestLinksGlobal({ limit = 20, minSimilarity = 0.8 } = {}) {
+        const orgFilterA = tenantWhere(this.tenantCtx, "a");
+        const pairs = await this.db.$queryRaw `
+      SELECT
+        a.id AS a_id,
+        b.id AS b_id,
+        1 - (a.embedding <=> b.embedding) AS similarity
+      FROM nodes a
+      JOIN nodes b ON a.id < b.id
+      WHERE a.embedding IS NOT NULL
+        AND b.embedding IS NOT NULL
+        AND 1 - (a.embedding <=> b.embedding) >= ${minSimilarity}
+        AND NOT EXISTS (
+          SELECT 1 FROM edges e
+          WHERE (e.source_node_id = a.id AND e.target_node_id = b.id)
+             OR (e.source_node_id = b.id AND e.target_node_id = a.id)
+        )
+        AND ${orgFilterA}
+      ORDER BY similarity DESC
+      LIMIT ${limit}
+    `;
+        if (pairs.length === 0)
+            return [];
+        const nodeIds = new Set();
+        for (const p of pairs) {
+            nodeIds.add(p.a_id);
+            nodeIds.add(p.b_id);
+        }
+        const nodes = await this.db.node.findMany({
+            where: { id: { in: [...nodeIds] } },
+        });
+        const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+        return pairs
+            .filter((p) => nodeMap.has(p.a_id) && nodeMap.has(p.b_id))
+            .map((p) => ({
+            source: nodeMap.get(p.a_id),
+            target: nodeMap.get(p.b_id),
+            similarity: Number(p.similarity),
+        }));
+    }
+    /**
+     * Find all disconnected clusters (islands) in the graph.
+     * Returns islands sorted by size descending, excluding orphan nodes (size 1).
+     */
+    async findIslands() {
+        const allEdges = await this.db.edge.findMany({
+            select: { sourceNodeId: true, targetNodeId: true },
+        });
+        const componentMap = this.computeComponentMap(allEdges);
+        // Group node IDs by component root
+        const groups = new Map();
+        for (const [nodeId, root] of componentMap.entries()) {
+            if (!groups.has(root))
+                groups.set(root, []);
+            groups.get(root).push(nodeId);
+        }
+        // Filter to multi-node components, sort by size desc
+        const sortedGroups = [...groups.values()]
+            .filter((g) => g.length > 1)
+            .sort((a, b) => b.length - a.length);
+        // Batch-fetch all nodes involved
+        const allNodeIds = sortedGroups.flat();
+        const nodes = await this.db.node.findMany({
+            where: { id: { in: allNodeIds } },
+        });
+        const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+        return sortedGroups.map((group, idx) => ({
+            id: idx + 1,
+            size: group.length,
+            nodes: group
+                .map((id) => nodeMap.get(id))
+                .filter((n) => n !== undefined),
+        }));
+    }
+    /**
+     * Suggest bridges between the top islands using embedding similarity.
+     */
+    async suggestBridges(maxBridges = 10) {
+        const islands = await this.findIslands();
+        if (islands.length < 2)
+            return [];
+        const bridges = [];
+        // For each pair of islands (largest first), find the best cross-island link
+        for (let i = 0; i < islands.length && bridges.length < maxBridges; i++) {
+            for (let j = i + 1; j < islands.length && bridges.length < maxBridges; j++) {
+                const fromIds = islands[i].nodes.map((n) => n.id);
+                const toIds = islands[j].nodes.map((n) => n.id);
+                const orgFilterA = tenantWhere(this.tenantCtx, "a");
+                const best = await this.db.$queryRaw `
+          SELECT
+            a.id AS a_id,
+            b.id AS b_id,
+            1 - (a.embedding <=> b.embedding) AS similarity
+          FROM nodes a
+          JOIN nodes b ON a.id != b.id
+          WHERE a.id = ANY(${fromIds}::uuid[])
+            AND b.id = ANY(${toIds}::uuid[])
+            AND a.embedding IS NOT NULL
+            AND b.embedding IS NOT NULL
+            AND ${orgFilterA}
+          ORDER BY similarity DESC
+          LIMIT 1
+        `;
+                if (best.length > 0) {
+                    const nodeA = islands[i].nodes.find((n) => n.id === best[0].a_id);
+                    const nodeB = islands[j].nodes.find((n) => n.id === best[0].b_id);
+                    if (nodeA && nodeB) {
+                        bridges.push({
+                            from: islands[i],
+                            to: islands[j],
+                            suggestion: {
+                                source: nodeA,
+                                target: nodeB,
+                                similarity: Number(best[0].similarity),
+                            },
+                        });
+                    }
+                }
+            }
+        }
+        return bridges.sort((a, b) => b.suggestion.similarity - a.suggestion.similarity);
+    }
+    /**
+     * Analyze relationship types and suggest normalizations using embedding similarity.
+     * Compares type names semantically to find ones that likely mean the same thing.
+     */
+    async analyzeRelationshipTypes(embeddings, { minSimilarity = 0.7 } = {}) {
+        const typeCounts = await this.db.edge.groupBy({
+            by: ["relationshipType"],
+            _count: { relationshipType: true },
+            orderBy: { _count: { relationshipType: "desc" } },
+        });
+        const allTypes = typeCounts.map((r) => ({
+            relationshipType: r.relationshipType,
+            count: r._count.relationshipType,
+        }));
+        if (allTypes.length < 2) {
+            return { suggestions: [], allTypes };
+        }
+        // Embed all relationship type names (expand hyphens to spaces for better semantics)
+        const typeNames = allTypes.map((t) => t.relationshipType.replace(/-/g, " "));
+        const typeEmbeddings = await embeddings.embedBatch(typeNames);
+        // Compare all pairs, suggest merging rare → common when similar
+        const suggestions = [];
+        for (let i = 0; i < allTypes.length; i++) {
+            for (let j = i + 1; j < allTypes.length; j++) {
+                const sim = cosineSimilarity(typeEmbeddings[i], typeEmbeddings[j]);
+                if (sim < minSimilarity)
+                    continue;
+                // Suggest merging the less-used type into the more-used one
+                const [from, to] = allTypes[i].count >= allTypes[j].count ? [j, i] : [i, j];
+                suggestions.push({
+                    fromType: allTypes[from].relationshipType,
+                    fromCount: allTypes[from].count,
+                    toType: allTypes[to].relationshipType,
+                    toCount: allTypes[to].count,
+                    similarity: Math.round(sim * 1000) / 1000,
+                });
+            }
+        }
+        suggestions.sort((a, b) => b.similarity - a.similarity);
+        return { suggestions, allTypes };
+    }
+    // ── Private helpers ─────────────────────────────────────────────────────
+    /**
+     * Union-find returning a map of nodeId -> component root.
+     */
+    computeComponentMap(edges) {
+        const parent = new Map();
+        function find(x) {
+            if (!parent.has(x))
+                parent.set(x, x);
+            let root = x;
+            while (parent.get(root) !== root)
+                root = parent.get(root);
+            let cur = x;
+            while (cur !== root) {
+                const next = parent.get(cur);
+                parent.set(cur, root);
+                cur = next;
+            }
+            return root;
+        }
+        function union(a, b) {
+            const ra = find(a);
+            const rb = find(b);
+            if (ra !== rb)
+                parent.set(ra, rb);
+        }
+        for (const edge of edges) {
+            union(edge.sourceNodeId, edge.targetNodeId);
+        }
+        // Normalize all roots
+        for (const nodeId of parent.keys()) {
+            find(nodeId);
+        }
+        return parent;
+    }
+    /**
+     * Summarize component map into counts for the health report.
+     */
+    summarizeComponents(componentMap, totalNodes) {
+        const componentSizes = new Map();
+        for (const [, root] of componentMap.entries()) {
+            componentSizes.set(root, (componentSizes.get(root) ?? 0) + 1);
+        }
+        const connectedNodeCount = componentMap.size;
+        const orphanNodeCount = totalNodes - connectedNodeCount;
+        const totalComponents = componentSizes.size + orphanNodeCount;
+        let largestSize = 0;
+        for (const size of componentSizes.values()) {
+            if (size > largestSize)
+                largestSize = size;
+        }
+        if (largestSize === 0 && totalNodes > 0)
+            largestSize = 1;
+        return { components: totalComponents, largestSize };
+    }
+}
+// ── Utilities ───────────────────────────────────────────────────────────────
+function cosineSimilarity(a, b) {
+    let dot = 0;
+    let magA = 0;
+    let magB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        magA += a[i] * a[i];
+        magB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(magA) * Math.sqrt(magB);
+    return denom === 0 ? 0 : dot / denom;
+}
+//# sourceMappingURL=cleaning-service.js.map

package/dist/services/cleaning-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cleaning-service.js","sourceRoot":"","sources":["../../src/services/cleaning-service.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAsB,MAAM,iBAAiB,CAAC;AA6FxF,+EAA+E;AAE/E,MAAM,OAAO,eAAe;IAGN;IAFZ,SAAS,CAAgB;IAEjC,YAAoB,EAAgB,EAAE,SAAyB;QAA3C,OAAE,GAAF,EAAE,CAAc;QAClC,IAAI,CAAC,SAAS,GAAG,SAAS,IAAI,EAAE,cAAc,EAAE,oBAAoB,EAAE,CAAC;IACzE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACnD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAAkB;;;;;cAKjD,SAAS;;KAElB,CAAC;QAEF,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACjD,OAAO,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE;SAC/B,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,SAAS,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE;QAC/C,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAEpC;;;;;;;;;mDAS8C,SAAS;cAC9C,UAAU;;cAEV,KAAK;KACd,CAAC;QAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,iCAAiC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,EAAE;SACpC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAErD,OAAO,KAAK;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACzD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE;YAC3B,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE;YAC3B,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;SACjC,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,SAAS,GAAG,EAAE;QAClC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,CAAC;QAEnD,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAEpD,sCAAsC;QACtC,MAAM,CACJ,UAAU,EACV,UAAU,EACV,QAAQ,EACR,MAAM,EACN,SAAS,EACT,WAAW,EACX,eAAe,EACf,UAAU,EACV,aAAa,EACb,iBAAiB,EACjB,uBAAuB,EACvB,QAAQ,EACT,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE;YACpB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE;YACpB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;gBACnB,EAAE,EAAE,CAAC,QAAQ,CAAC;gBACd,MAAM,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;gBACxB,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;aACxC,CAAC;YACF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;gBACnB,EAAE,EAAE,CAAC,MAAM,CAAC;gBACZ,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE;gBACtB,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE;aACtC,CAAC;YACF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;gBACnB,EAAE,EAAE,CAAC,kBAAkB,CAAC;gBACxB,MAAM,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAE;gBAClC,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,gBAAgB,EAAE,MAAM,EAAE,EAAE;aAClD,CAAC;YACF,IAAI,CAAC,EAAE,CAAC,SAAS,CAAqB;;;;gBAI5B,UAAU;OACnB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC;YACjD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,EAAE,CAAC,SAAS,CAAqB;;;gBAG5B,UAAU;OACnB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAqB;;;;kBAI1B,UAAU;;;;OAIrB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAqB;;;;;;;;kBAQ1B,UAAU;;;OAGrB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,EAAE,CAAC;SAC9E,CAAC,CAAC;QAEH,8CAA8C;QAC9C,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QACxD,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;QAEvF,MAAM,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3E,OAAO;YACL,KAAK,EAAE;gBACL,KAAK,EAAE,UAAU;gBACjB,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC7B,MAAM,EAAE,CAAC,CAAC,MAAM;oBAChB,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM;iBACvB,CAAC,CAAC;gBACH,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACzB,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI;iBACrB,CAAC,CAAC;gBACH,WAAW;gBACX,eAAe;gBACf,UAAU;aACX;YACD,KAAK,EAAE;gBACL,KAAK,EAAE,UAAU;gBACjB,kBAAkB,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACxC,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;oBACpC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,gBAAgB;iBACjC,CAAC,CAAC;gBACH,aAAa;gBACb,cAAc,EAAE,iBAAiB;aAClC;YACD,KAAK,EAAE;gBACL,eAAe,EAAE,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,GAAG,CAAC,GAAG,GAAG;gBACxD,mBAAmB,EAAE,UAAU;gBAC/B,oBAAoB,EAAE,WAAW;aAClC;YACD,mBAAmB,EAAE,uBAAuB,GAAG,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;SAC/E,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,EAAE,qBAAqB,GAAG,GAAG,EAAE,iBAAiB,GAAG,CAAC,KACa,EAAE;QAEnE,MAAM,MAAM,GAAsB,EAAE,CAAC;QAErC,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAEvD,MAAM,CACJ,YAAY,EACZ,cAAc,EACd,iBAAiB,EACjB,aAAa,EACb,QAAQ,EACT,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,SAAS,CAA0C;yFACwB,UAAU;OAC5F;YACD,IAAI,CAAC,EAAE,CAAC,SAAS,CAA6G;;;;gBAIpH,UAAU;;;OAGnB;YACD,IAAI,CAAC,EAAE,CAAC,SAAS,CAAsH;;;;;;;oDAOzF,qBAAqB;gBACzD,aAAa;;OAEtB;YACD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;gBACnB,EAAE,EAAE,CAAC,kBAAkB,CAAC;gBACxB,MAAM,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAE;aACnC,CAAC;YACF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,EAAE;SACxB,CAAC,CAAC;QAEH,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE1C,mCAAmC;QACnC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,YAAY;YAAE,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAClE,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;YAC/B,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YACpC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QACtC,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;YACnC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC;YACrC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC;QACvC,CAAC;QAED,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,GAAG,CAAC;YACtC,CAAC,CAAC,IAAI,GAAG,CACL,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC3B,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,aAAa,CAAC,EAAE,EAAE;aAC1C,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAC1B;YACH,CAAC,CAAC,IAAI,GAAG,EAAgB,CAAC;QAE5B,gBAAgB;QAChB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,OAAO;gBACjB,QAAQ,EAAE,WAAW;gBACrB,OAAO,EAAE,0BAA0B,IAAI,EAAE,KAAK,IAAI,GAAG,CAAC,cAAc,EAAE;gBACtE,KAAK,EAAE,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,IAAI;gBAChB,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC;QACL,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC;YACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,SAAS;gBACnB,QAAQ,EAAE,gBAAgB;gBAC1B,OAAO,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,IAAI,CAAC,iBAAiB,uBAAuB;gBACxF,KAAK;gBACL,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;gBAC9C,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;aAC/C,CAAC,CAAC;QACL,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,EAAE,IAAI,iBAAiB,EAAE,CAAC;YACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,CAAC;YACvD,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,SAAS;gBACnB,QAAQ,EAAE,eAAe;gBACzB,OAAO,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,4BAA4B;gBAChG,KAAK,EAAE,CAAC,IAAI,CAAC;gBACb,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC;gBAC5C,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,cAAc,CAAC;gBAC5C,UAAU,EAAE,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC;aAClC,CAAC,CAAC;QACL,CAAC;QAED,2EAA2E;QAC3E,MAAM,kBAAkB,GAAG;YACzB,CAAC,UAAU,EAAE,aAAa,CAAC;YAC3B,CAAC,SAAS,EAAE,QAAQ,CAAC;YACrB,CAAC,UAAU,EAAE,UAAU,CAAC;SACzB,CAAC;QAEF,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACpD,WAAW,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,SAAS,CAAC,IAAI,WAAW,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;gBAAE,SAAS;YACnC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAChE,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,kBAAkB,EAAE,CAAC;gBAChD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzC,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,KAAK,KAAK,IAAI,CAAC,CAAC,gBAAgB,KAAK,KAAK,CACpE,CAAC;oBACF,oCAAoC;oBACpC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;wBAC9B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;4BACnC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;4BAC3E,IAAI,CAAC;gCAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAChC,CAAC;wBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;4BACnC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;4BAC3E,IAAI,CAAC;gCAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAChC,CAAC;oBACH,CAAC;oBACD,MAAM,CAAC,IAAI,CAAC;wBACV,QAAQ,EAAE,OAAO;wBACjB,QAAQ,EAAE,eAAe;wBACzB,OAAO,EAAE,yBAAyB,KAAK,UAAU,KAAK,sBAAsB;wBAC5E,KAAK,EAAE,aAAa;wBACpB,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;wBACxD,UAAU,EAAE,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;qBACzD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,+CAA+C;QAC/C,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,IAAI,iBAAiB,CACtD,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAC/B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,KAAK,IAAI,CAAC,gBAAgB,CACpD,CAAC;YACF,6BAA6B;YAC7B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;oBAC3E,IAAI,CAAC;wBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAChC,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;oBACnC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;oBAC3E,IAAI,CAAC;wBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAChC,CAAC;YACH,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;gBACV,QAAQ,EAAE,MAAM;gBAChB,QAAQ,EAAE,wBAAwB;gBAClC,OAAO,EAAE,sBAAsB,IAAI,CAAC,gBAAgB,eAAe,IAAI,CAAC,MAAM,CAAC,gBAAgB,2BAA2B;gBAC1H,KAAK,EAAE,SAAS;gBAChB,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS;gBAC/E,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS;aAChF,CAAC,CAAC;QACL,CAAC;QAED,gBAAgB;QAChB,MAAM,OAAO,GAAuC;YAClD,WAAW,EAAE,CAAC;YACd,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,CAAC;YAClB,eAAe,EAAE,CAAC;YAClB,wBAAwB,EAAE,CAAC;SAC5B,CAAC;QACF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5B,CAAC;QAED,OAAO;YACL,MAAM;YACN,OAAO;YACP,WAAW,EAAE,MAAM,CAAC,MAAM;YAC1B,iBAAiB;SAClB,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,mBAAmB,CACvB,MAAc,EACd,EAAE,KAAK,GAAG,EAAE,EAAE,aAAa,GAAG,GAAG,KAAiD,EAAE;QAEpF,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAE1C;;;;;;qBAMgB,MAAM;;;;8CAImB,MAAM;;mCAEjB,MAAM,8BAA8B,MAAM;;mDAE1B,aAAa;cAClD,UAAU;;cAEV,KAAK;KACd,CAAC;QAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;QAC5E,IAAI,CAAC,UAAU;YAAE,OAAO,EAAE,CAAC;QAE3B,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC9C,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE;SAC3D,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7D,OAAO,WAAW;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;aACzC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,MAAM,EAAE,UAAU;YAClB,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAE;YACnC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;SACjC,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CACtB,EAAE,KAAK,GAAG,EAAE,EAAE,aAAa,GAAG,GAAG,KAAiD,EAAE;QAEpF,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAEpC;;;;;;;;;mDAS8C,aAAa;;;;;;cAMlD,UAAU;;cAEV,KAAK;KACd,CAAC;QAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,EAAE;SACpC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAErD,OAAO,KAAK;aACT,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACzD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE;YAC5B,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE;YAC5B,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC;SACjC,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW;QACf,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC3C,MAAM,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE;SACnD,CAAC,CAAC;QAEH,MAAM,YAAY,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QAExD,mCAAmC;QACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,qDAAqD;QACrD,MAAM,YAAY,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;aACtC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;aAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAEvC,iCAAiC;QACjC,MAAM,UAAU,GAAG,YAAY,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YACxC,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE;SAClC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAErD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YACvC,EAAE,EAAE,GAAG,GAAG,CAAC;YACX,IAAI,EAAE,KAAK,CAAC,MAAM;YAClB,KAAK,EAAE,KAAK;iBACT,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBAC5B,MAAM,CAAC,CAAC,CAAC,EAAa,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;SAC7C,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,UAAU,GAAG,EAAE;QAClC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAmB,EAAE,CAAC;QAEnC,4EAA4E;QAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACvE,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3E,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAClD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBAEhD,MAAM,UAAU,GAAG,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBACpD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,SAAS,CAEnC;;;;;;;6BAOoB,OAAO;6BACP,KAAK;;;kBAGhB,UAAU;;;SAGnB,CAAC;gBAEF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAClE,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAClE,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;wBACnB,OAAO,CAAC,IAAI,CAAC;4BACX,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;4BAChB,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;4BACd,UAAU,EAAE;gCACV,MAAM,EAAE,KAAK;gCACb,MAAM,EAAE,KAAK;gCACb,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;6BACvC;yBACF,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACnF,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,wBAAwB,CAC5B,UAA6B,EAC7B,EAAE,aAAa,GAAG,GAAG,KAAiC,EAAE;QAExD,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC;YAC5C,EAAE,EAAE,CAAC,kBAAkB,CAAC;YACxB,MAAM,EAAE,EAAE,gBAAgB,EAAE,IAAI,EAAE;YAClC,OAAO,EAAE,EAAE,MAAM,EAAE,EAAE,gBAAgB,EAAE,MAAM,EAAE,EAAE;SAClD,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACtC,gBAAgB,EAAE,CAAC,CAAC,gBAAgB;YACpC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,gBAAgB;SACjC,CAAC,CAAC,CAAC;QAEJ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;QACvC,CAAC;QAED,oFAAoF;QACpF,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7E,MAAM,cAAc,GAAG,MAAM,UAAU,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAE9D,gEAAgE;QAChE,MAAM,WAAW,GAA0B,EAAE,CAAC;QAE9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,GAAG,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnE,IAAI,GAAG,GAAG,aAAa;oBAAE,SAAS;gBAElC,4DAA4D;gBAC5D,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GACd,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAE3D,WAAW,CAAC,IAAI,CAAC;oBACf,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,gBAAgB;oBACzC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK;oBAC/B,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,gBAAgB;oBACrC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK;oBAC3B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI;iBAC1C,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAExD,OAAO,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;IACnC,CAAC;IAED,2EAA2E;IAE3E;;OAEG;IACK,mBAAmB,CACzB,KAAuD;QAEvD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEzC,SAAS,IAAI,CAAC,CAAS;YACrB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;gBAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;YAC3D,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,OAAO,GAAG,KAAK,IAAI,EAAE,CAAC;gBACpB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACtB,GAAG,GAAG,IAAI,CAAC;YACb,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QAED,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACjC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,EAAE,KAAK,EAAE;gBAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACpC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;QAED,sBAAsB;QACtB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,MAAM,CAAC,CAAC;QACf,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,YAAiC,EACjC,UAAkB;QAElB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YAC9C,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC;QAED,MAAM,kBAAkB,GAAG,YAAY,CAAC,IAAI,CAAC;QAC7C,MAAM,eAAe,GAAG,UAAU,GAAG,kBAAkB,CAAC;QACxD,MAAM,eAAe,GAAG,cAAc,CAAC,IAAI,GAAG,eAAe,CAAC;QAE9D,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,IAAI,IAAI,GAAG,WAAW;gBAAE,WAAW,GAAG,IAAI,CAAC;QAC7C,CAAC;QACD,IAAI,WAAW,KAAK,CAAC,IAAI,UAAU,GAAG,CAAC;YAAE,WAAW,GAAG,CAAC,CAAC;QAEzD,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,WAAW,EAAE,CAAC;IACtD,CAAC;CACF;AAED,+EAA+E;AAE/E,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC"}