@cleocode/nexus 2026.5.15 → 2026.5.17

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@cleocode/nexus",
-  "version": "2026.5.15",
+  "version": "2026.5.17",
   "private": false,
   "type": "module",
   "description": "CLEO project registry and code intelligence — unified nexus package",
@@ -62,6 +62,7 @@
   "author": "CLEO Code <hello@cleocode.dev> (https://cleocode.dev)",
   "license": "MIT",
   "dependencies": {
+    "@aflsolutions/graphology-communities-leiden": "1.1.1",
     "drizzle-orm": "1.0.0-beta.22-ec7b61d",
     "graphology": "^0.26.0",
     "graphology-communities-louvain": "^2.0.2",
@@ -76,7 +77,7 @@
     "tree-sitter-ruby": "^0.23.1",
     "tree-sitter-rust": "0.23.1",
     "tree-sitter-typescript": "^0.23.2",
-    "@cleocode/contracts": "2026.5.15"
+    "@cleocode/contracts": "2026.5.17"
   },
   "devDependencies": {
     "@types/node": "^24.3.0",

package/dist/src/pipeline/leiden.d.ts

@@ -1,67 +0,0 @@
-/**
- * Pure-TypeScript Leiden Algorithm Implementation
- *
- * Implements the Leiden algorithm for community detection as described in:
- * "From Louvain to Leiden: guaranteeing well-connected communities"
- * Traag, V. A., Waltman, L., & van Eck, N. J. (2019).
- *
- * The Leiden algorithm improves upon Louvain by:
- * 1. Local Moving Phase: Optimizes modularity by moving nodes to communities
- * 2. Refinement Phase: Splits poorly-optimized communities to remove sub-optimal structures
- * 3. Aggregation Phase: Contracts the graph and repeats
- *
- * This implementation includes:
- * - Full 3-phase iteration for fine-grained community detection
- * - Modularity calculation respecting resolution parameter
- * - Seed-based randomization for reproducibility
- * - Early termination when modularity plateaus
- *
- * @module pipeline/leiden
- * @task T1063
- */
-/** Minimal graphology-compatible graph interface. */
-export interface Graph {
-    order: number;
-    size: number;
-    hasNode(id: string): boolean;
-    hasEdge(source: string, target: string): boolean;
-    forEachNode(callback: (nodeId: string) => void): void;
-    forEachNeighbor(nodeId: string, callback: (neighbour: string) => void): void;
-    getNodeAttribute(nodeId: string, attribute: string): unknown;
-}
-/** Result from Leiden algorithm. */
-export interface LeidenResult {
-    /** Mapping of node ID to community number. */
-    communities: Record<string, number>;
-    /** Total number of communities detected. */
-    count: number;
-    /** Modularity score (0–1, higher = better). */
-    modularity: number;
-    /** Number of nodes processed. */
-    nodesProcessed: number;
-    /** Number of refinement iterations performed. */
-    refinementIterations: number;
-    /** Duration in milliseconds. */
-    durationMs: number;
-}
-/**
- * Run the Leiden algorithm on a graphology-compatible graph.
- *
- * Detects communities by optimizing modularity through three phases:
- * 1. Local moving: move nodes to best-neighbor communities
- * 2. Refinement: split communities to improve local modularity
- * 3. Aggregation: contract graph and repeat
- *
- * @param graph - The undirected graphology graph to process
- * @param options - Algorithm parameters
- * @returns Leiden result with community assignments and modularity
- */
-export declare function leiden(graph: Graph, options?: {
-    /** Resolution parameter (higher = more communities, default 1.0) */
-    resolution?: number;
-    /** Random seed for reproducibility (default varies) */
-    seed?: number;
-    /** Maximum iterations (default 10) */
-    maxIterations?: number;
-}): LeidenResult;
-//# sourceMappingURL=leiden.d.ts.map

package/dist/src/pipeline/leiden.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"leiden.d.ts","sourceRoot":"","sources":["../../../src/pipeline/leiden.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAQH,qDAAqD;AACrD,MAAM,WAAW,KAAK;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC;IAC7B,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;IACjD,WAAW,CAAC,QAAQ,EAAE,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;IACtD,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;IAC7E,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;CAC9D;AAED,oCAAoC;AACpC,MAAM,WAAW,YAAY;IAC3B,8CAA8C;IAC9C,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,+CAA+C;IAC/C,UAAU,EAAE,MAAM,CAAC;IACnB,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAC;IACvB,iDAAiD;IACjD,oBAAoB,EAAE,MAAM,CAAC;IAC7B,gCAAgC;IAChC,UAAU,EAAE,MAAM,CAAC;CACpB;AAMD;;;;;;;;;;;GAWG;AACH,wBAAgB,MAAM,CACpB,KAAK,EAAE,KAAK,EACZ,OAAO,GAAE;IACP,oEAAoE;IACpE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,sCAAsC;IACtC,aAAa,CAAC,EAAE,MAAM,CAAC;CACnB,GACL,YAAY,CAiKd"}

package/dist/src/pipeline/leiden.js

@@ -1,283 +0,0 @@
-/**
- * Pure-TypeScript Leiden Algorithm Implementation
- *
- * Implements the Leiden algorithm for community detection as described in:
- * "From Louvain to Leiden: guaranteeing well-connected communities"
- * Traag, V. A., Waltman, L., & van Eck, N. J. (2019).
- *
- * The Leiden algorithm improves upon Louvain by:
- * 1. Local Moving Phase: Optimizes modularity by moving nodes to communities
- * 2. Refinement Phase: Splits poorly-optimized communities to remove sub-optimal structures
- * 3. Aggregation Phase: Contracts the graph and repeats
- *
- * This implementation includes:
- * - Full 3-phase iteration for fine-grained community detection
- * - Modularity calculation respecting resolution parameter
- * - Seed-based randomization for reproducibility
- * - Early termination when modularity plateaus
- *
- * @module pipeline/leiden
- * @task T1063
- */
-import { performance } from 'node:perf_hooks';
-// =============================================================================
-// LEIDEN ALGORITHM
-// =============================================================================
-/**
- * Run the Leiden algorithm on a graphology-compatible graph.
- *
- * Detects communities by optimizing modularity through three phases:
- * 1. Local moving: move nodes to best-neighbor communities
- * 2. Refinement: split communities to improve local modularity
- * 3. Aggregation: contract graph and repeat
- *
- * @param graph - The undirected graphology graph to process
- * @param options - Algorithm parameters
- * @returns Leiden result with community assignments and modularity
- */
-export function leiden(graph, options = {}) {
-    const startTime = performance.now();
-    const resolution = options.resolution ?? 1.0;
-    const maxIterations = options.maxIterations ?? 10;
-    const seed = options.seed ?? Math.random();
-    // Build node and edge lists
-    const nodeIds = [];
-    const nodeIndex = new Map();
-    graph.forEachNode((nodeId) => {
-        nodeIndex.set(nodeId, nodeIds.length);
-        nodeIds.push(nodeId);
-    });
-    const edgeList = [];
-    const adjList = new Map();
-    for (let i = 0; i < nodeIds.length; i++) {
-        adjList.set(i, new Set());
-    }
-    graph.forEachNode((source) => {
-        const sourceIdx = nodeIndex.get(source);
-        if (sourceIdx === undefined)
-            return;
-        graph.forEachNeighbor(source, (target) => {
-            const targetIdx = nodeIndex.get(target);
-            if (targetIdx === undefined)
-                return;
-            if (sourceIdx < targetIdx) {
-                edgeList.push([sourceIdx, targetIdx]);
-                adjList.get(sourceIdx).add(targetIdx);
-                adjList.get(targetIdx).add(sourceIdx);
-            }
-        });
-    });
-    const n = nodeIds.length;
-    const m = edgeList.length; // undirected edge count (each edge counted once)
-    const totalWeight = m * 2; // total weight in weighted graph = sum of all edge weights (each edge = 2)
-    if (n === 0 || m === 0) {
-        return {
-            communities: {},
-            count: 0,
-            modularity: 0,
-            nodesProcessed: 0,
-            refinementIterations: 0,
-            durationMs: performance.now() - startTime,
-        };
-    }
-    // Initialize: each node is its own community
-    const communities = new Array(n);
-    for (let i = 0; i < n; i++) {
-        communities[i] = i;
-    }
-    // Store intermediate results
-    let currentModularity = 0;
-    let bestCommunities = [...communities];
-    let bestModularity = 0;
-    let refinementIterations = 0;
-    // Main iteration loop
-    for (let iteration = 0; iteration < maxIterations; iteration++) {
-        // Phase 1: Local moving
-        let moved = true;
-        let moveRounds = 0;
-        while (moved && moveRounds < 10) {
-            moved = false;
-            moveRounds++;
-            // Shuffle nodes for randomness
-            const shuffled = [...Array(n).keys()].sort(() => ((seed * 997 + moveRounds) % 2) - 0.5);
-            for (const nodeIdx of shuffled) {
-                const currentComm = communities[nodeIdx];
-                let bestComm = currentComm;
-                let bestGain = 0;
-                // Get neighbor communities
-                const neighborComms = new Set();
-                for (const neighbor of adjList.get(nodeIdx)) {
-                    neighborComms.add(communities[neighbor]);
-                }
-                neighborComms.add(currentComm);
-                // Try moving to each neighbor community
-                for (const targetComm of neighborComms) {
-                    const gain = calculateModularityGain(nodeIdx, currentComm, targetComm, communities, adjList, totalWeight, resolution);
-                    if (gain > bestGain) {
-                        bestGain = gain;
-                        bestComm = targetComm;
-                    }
-                }
-                // If moving improves, update
-                if (bestComm !== currentComm) {
-                    communities[nodeIdx] = bestComm;
-                    moved = true;
-                }
-            }
-        }
-        // Calculate current modularity
-        currentModularity = calculateModularity(communities, adjList, totalWeight, resolution);
-        // Phase 2: Refinement (split over-large communities)
-        refinePasses(communities, adjList, totalWeight, resolution, n);
-        refinementIterations++;
-        // Calculate modularity after refinement
-        const afterRefinement = calculateModularity(communities, adjList, totalWeight, resolution);
-        // Phase 3: Check convergence
-        if (Math.abs(afterRefinement - currentModularity) < 1e-6) {
-            currentModularity = afterRefinement;
-            break; // Converged
-        }
-        currentModularity = afterRefinement;
-        // Track best
-        if (currentModularity > bestModularity) {
-            bestModularity = currentModularity;
-            bestCommunities = [...communities];
-        }
-    }
-    // Relabel communities to be 0, 1, 2, ...
-    const communityMap = new Map();
-    let nextLabel = 0;
-    const result = {};
-    for (let i = 0; i < n; i++) {
-        const oldComm = bestCommunities[i];
-        if (!communityMap.has(oldComm)) {
-            communityMap.set(oldComm, nextLabel++);
-        }
-        const newComm = communityMap.get(oldComm);
-        result[nodeIds[i]] = newComm;
-    }
-    const durationMs = performance.now() - startTime;
-    return {
-        communities: result,
-        count: nextLabel,
-        modularity: bestModularity,
-        nodesProcessed: n,
-        refinementIterations,
-        durationMs,
-    };
-}
-// =============================================================================
-// HELPER FUNCTIONS
-// =============================================================================
-/**
- * Calculate the gain in modularity from moving a node to a target community.
- * A positive gain means the move improves modularity.
- */
-function calculateModularityGain(nodeIdx, currentComm, targetComm, communities, adjList, totalWeight, resolution) {
-    if (totalWeight === 0)
-        return 0;
-    const neighbors = adjList.get(nodeIdx);
-    // Count edges to current and target communities
-    let edgesToCurrent = 0;
-    let edgesToTarget = 0;
-    for (const neighbor of neighbors) {
-        const neighborComm = communities[neighbor];
-        if (neighborComm === currentComm) {
-            edgesToCurrent++;
-        }
-        else if (neighborComm === targetComm) {
-            edgesToTarget++;
-        }
-    }
-    // Self-loop contributes 1 edge to both when removing/adding
-    if (currentComm === targetComm) {
-        edgesToTarget = neighbors.size + 1; // includes self
-    }
-    // Degree of the node
-    const degree = neighbors.size;
-    // Modularity contribution (ignoring constant terms independent of movement)
-    const gain = (2 * edgesToTarget - edgesToCurrent) / totalWeight - (resolution * degree) / totalWeight;
-    return gain;
-}
-/**
- * Calculate the modularity of the current partition.
- * Modularity = sum of (e_ii - a_i^2) where e_ii is internal edges and a_i is weighted degree.
- */
-function calculateModularity(communities, adjList, totalWeight, resolution) {
-    if (totalWeight === 0)
-        return 0;
-    const communityEdges = new Map();
-    const communityDegree = new Map();
-    // Count edges and degree per community
-    for (let i = 0; i < communities.length; i++) {
-        const comm = communities[i];
-        const degree = adjList.get(i).size;
-        if (!communityDegree.has(comm)) {
-            communityDegree.set(comm, 0);
-        }
-        communityDegree.set(comm, communityDegree.get(comm) + degree);
-        // Count internal edges
-        let internal = 0;
-        for (const neighbor of adjList.get(i)) {
-            if (communities[neighbor] === comm) {
-                internal++;
-            }
-        }
-        if (!communityEdges.has(comm)) {
-            communityEdges.set(comm, 0);
-        }
-        communityEdges.set(comm, communityEdges.get(comm) + internal);
-    }
-    // Calculate modularity
-    let modularity = 0;
-    for (const [comm, internalEdges] of communityEdges) {
-        const a = communityDegree.get(comm) || 0;
-        modularity += internalEdges / totalWeight - resolution * (a / totalWeight) ** 2;
-    }
-    return modularity;
-}
-/**
- * Refinement phase: split large communities to improve local modularity.
- * This is the key difference from Louvain — it prevents sub-optimal structures.
- */
-function refinePasses(communities, adjList, totalWeight, resolution, n) {
-    // Identify large communities (more than sqrt(n) nodes)
-    const commSizes = new Map();
-    for (let i = 0; i < n; i++) {
-        const comm = communities[i];
-        commSizes.set(comm, (commSizes.get(comm) || 0) + 1);
-    }
-    const threshold = Math.ceil(Math.sqrt(n));
-    // For each large community, try to split it
-    for (const [comm, size] of commSizes) {
-        if (size <= threshold)
-            continue;
-        // Find nodes in this community
-        const commNodes = [];
-        for (let i = 0; i < n; i++) {
-            if (communities[i] === comm) {
-                commNodes.push(i);
-            }
-        }
-        // Try to move nodes to new sub-communities
-        const newCommunity = Math.max(...communities) + 1;
-        let moved = false;
-        for (const nodeIdx of commNodes) {
-            const gain = calculateModularityGain(nodeIdx, comm, newCommunity, communities, adjList, totalWeight, resolution);
-            if (gain > 0) {
-                communities[nodeIdx] = newCommunity;
-                moved = true;
-            }
-        }
-        // If we moved at least one node, this is a successful split
-        if (!moved) {
-            // No nodes wanted to move, remove the phantom community
-            for (let i = 0; i < n; i++) {
-                if (communities[i] === newCommunity) {
-                    communities[i] = comm;
-                }
-            }
-        }
-    }
-}
-//# sourceMappingURL=leiden.js.map

package/dist/src/pipeline/leiden.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"leiden.js","sourceRoot":"","sources":["../../../src/pipeline/leiden.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAiC9C,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,MAAM,CACpB,KAAY,EACZ,UAOI,EAAE;IAEN,MAAM,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;IAEpC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC;IAC7C,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,EAAE,CAAC;IAClD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;IAE3C,4BAA4B;IAC5B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,CAAC,WAAW,CAAC,CAAC,MAAc,EAAE,EAAE;QACnC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACtC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,MAAM,QAAQ,GAA4B,EAAE,CAAC;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,CAAC,MAAc,EAAE,EAAE;QACnC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO;QACpC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,MAAc,EAAE,EAAE;YAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACxC,IAAI,SAAS,KAAK,SAAS;gBAAE,OAAO;YACpC,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;gBAC1B,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;gBACtC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACvC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,MAAM,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,iDAAiD;IAC5E,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,2EAA2E;IAEtG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO;YACL,WAAW,EAAE,EAAE;YACf,KAAK,EAAE,CAAC;YACR,UAAU,EAAE,CAAC;YACb,cAAc,EAAE,CAAC;YACjB,oBAAoB,EAAE,CAAC;YACvB,UAAU,EAAE,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS;SAC1C,CAAC;IACJ,CAAC;IAED,6CAA6C;IAC7C,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,6BAA6B;IAC7B,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAC1B,IAAI,eAAe,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IACvC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,oBAAoB,GAAG,CAAC,CAAC;IAE7B,sBAAsB;IACtB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,aAAa,EAAE,SAAS,EAAE,EAAE,CAAC;QAC/D,wBAAwB;QACxB,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,KAAK,IAAI,UAAU,GAAG,EAAE,EAAE,CAAC;YAChC,KAAK,GAAG,KAAK,CAAC;YACd,UAAU,EAAE,CAAC;YAEb,+BAA+B;YAC/B,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;YAExF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;gBACzC,IAAI,QAAQ,GAAG,WAAW,CAAC;gBAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC;gBAEjB,2BAA2B;gBAC3B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;gBACxC,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,EAAE,CAAC;oBAC7C,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC3C,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAE/B,wCAAwC;gBACxC,KAAK,MAAM,UAAU,IAAI,aAAa,EAAE,CAAC;oBACvC,MAAM,IAAI,GAAG,uBAAuB,CAClC,OAAO,EACP,WAAW,EACX,UAAU,EACV,WAAW,EACX,OAAO,EACP,WAAW,EACX,UAAU,CACX,CAAC;oBAEF,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;wBACpB,QAAQ,GAAG,IAAI,CAAC;wBAChB,QAAQ,GAAG,UAAU,CAAC;oBACxB,CAAC;gBACH,CAAC;gBAED,6BAA6B;gBAC7B,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;oBAC7B,WAAW,CAAC,OAAO,CAAC,GAAG,QAAQ,CAAC;oBAChC,KAAK,GAAG,IAAI,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,iBAAiB,GAAG,mBAAmB,CAAC,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QAEvF,qDAAqD;QACrD,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QAC/D,oBAAoB,EAAE,CAAC;QAEvB,wCAAwC;QACxC,MAAM,eAAe,GAAG,mBAAmB,CAAC,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QAE3F,6BAA6B;QAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,iBAAiB,CAAC,GAAG,IAAI,EAAE,CAAC;YACzD,iBAAiB,GAAG,eAAe,CAAC;YACpC,MAAM,CAAC,YAAY;QACrB,CAAC;QACD,iBAAiB,GAAG,eAAe,CAAC;QAEpC,aAAa;QACb,IAAI,iBAAiB,GAAG,cAAc,EAAE,CAAC;YACvC,cAAc,GAAG,iBAAiB,CAAC;YACnC,eAAe,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC/B,YAAY,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QACzC,CAAC;QACD,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;IAC/B,CAAC;IAED,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IAEjD,OAAO;QACL,WAAW,EAAE,MAAM;QACnB,KAAK,EAAE,SAAS;QAChB,UAAU,EAAE,cAAc;QAC1B,cAAc,EAAE,CAAC;QACjB,oBAAoB;QACpB,UAAU;KACX,CAAC;AACJ,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,OAAe,EACf,WAAmB,EACnB,UAAkB,EAClB,WAAqB,EACrB,OAAiC,EACjC,WAAmB,EACnB,UAAkB;IAElB,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;IAExC,gDAAgD;IAChD,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,MAAM,YAAY,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,YAAY,KAAK,WAAW,EAAE,CAAC;YACjC,cAAc,EAAE,CAAC;QACnB,CAAC;aAAM,IAAI,YAAY,KAAK,UAAU,EAAE,CAAC;YACvC,aAAa,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,IAAI,WAAW,KAAK,UAAU,EAAE,CAAC;QAC/B,aAAa,GAAG,SAAS,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,gBAAgB;IACtD,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC;IAE9B,4EAA4E;IAC5E,MAAM,IAAI,GACR,CAAC,CAAC,GAAG,aAAa,GAAG,cAAc,CAAC,GAAG,WAAW,GAAG,CAAC,UAAU,GAAG,MAAM,CAAC,GAAG,WAAW,CAAC;IAE3F,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAC1B,WAAqB,EACrB,OAAiC,EACjC,WAAmB,EACnB,UAAkB;IAElB,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IACjD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD,uCAAuC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC;QAEpC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,eAAe,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,MAAM,CAAC,CAAC;QAE/D,uBAAuB;QACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;YACvC,IAAI,WAAW,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBACnC,QAAQ,EAAE,CAAC;YACb,CAAC;QACH,CAAC;QAED,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,QAAQ,CAAC,CAAC;IACjE,CAAC;IAED,uBAAuB;IACvB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE,CAAC;QACnD,MAAM,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,UAAU,IAAI,aAAa,GAAG,WAAW,GAAG,UAAU,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAClF,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACnB,WAAqB,EACrB,OAAiC,EACjC,WAAmB,EACnB,UAAkB,EAClB,CAAS;IAET,uDAAuD;IACvD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1C,4CAA4C;IAC5C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;QACrC,IAAI,IAAI,IAAI,SAAS;YAAE,SAAS;QAEhC,+BAA+B;QAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC5B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAClD,IAAI,KAAK,GAAG,KAAK,CAAC;QAElB,KAAK,MAAM,OAAO,IAAI,SAAS,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,uBAAuB,CAClC,OAAO,EACP,IAAI,EACJ,YAAY,EACZ,WAAW,EACX,OAAO,EACP,WAAW,EACX,UAAU,CACX,CAAC;YACF,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACb,WAAW,CAAC,OAAO,CAAC,GAAG,YAAY,CAAC;gBACpC,KAAK,GAAG,IAAI,CAAC;YACf,CAAC;QACH,CAAC;QAED,4DAA4D;QAC5D,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,wDAAwD;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,YAAY,EAAE,CAAC;oBACpC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC"}