spec-gen-cli 1.0.0

package/dist/core/analyzer/dependency-graph.js

@@ -0,0 +1,574 @@
+/**
+ * Dependency Graph Service
+ *
+ * Builds a complete graph of how files relate to each other through imports.
+ * Provides metrics like in-degree, out-degree, betweenness centrality, and PageRank.
+ * Detects clusters, cycles, and special nodes (centers, leaves, bridges, orphans).
+ */
+import { ImportExportParser, resolveImport } from './import-parser.js';
+// ============================================================================
+// DEPENDENCY GRAPH BUILDER
+// ============================================================================
+/**
+ * Builds and analyzes a dependency graph from scored files
+ */
+export class DependencyGraphBuilder {
+    nodes = new Map();
+    edges = [];
+    adjacencyList = new Map();
+    reverseAdjacencyList = new Map();
+    parser;
+    options;
+    constructor(options) {
+        this.parser = new ImportExportParser();
+        this.options = {
+            rootDir: options.rootDir,
+            extensions: options.extensions ?? [], // empty = auto-detect per file in resolveImport
+            minClusterSize: options.minClusterSize ?? 2,
+            dampingFactor: options.dampingFactor ?? 0.85,
+            maxIterations: options.maxIterations ?? 100,
+        };
+    }
+    /**
+     * Build the dependency graph from scored files
+     */
+    async build(files) {
+        // Clear any previous state
+        this.nodes.clear();
+        this.edges = [];
+        this.adjacencyList.clear();
+        this.reverseAdjacencyList.clear();
+        // Parse all files and create nodes
+        const analyses = await this.parseFiles(files);
+        // Create nodes for each file
+        for (const file of files) {
+            const analysis = analyses.get(file.absolutePath);
+            this.nodes.set(file.absolutePath, {
+                id: file.absolutePath,
+                file,
+                exports: analysis?.exports ?? [],
+                metrics: {
+                    inDegree: 0,
+                    outDegree: 0,
+                    betweenness: 0,
+                    pageRank: 1 / files.length,
+                },
+            });
+            this.adjacencyList.set(file.absolutePath, new Set());
+            this.reverseAdjacencyList.set(file.absolutePath, new Set());
+        }
+        // Create edges from imports
+        await this.buildEdges(files, analyses);
+        // Calculate metrics
+        this.calculateDegrees();
+        this.calculateBetweenness();
+        this.calculatePageRank();
+        // Detect clusters
+        const clusters = this.detectClusters();
+        // Detect cycles
+        const cycles = this.detectCycles();
+        // Generate rankings
+        const rankings = this.generateRankings(clusters);
+        // Calculate statistics
+        const statistics = this.calculateStatistics(clusters, cycles);
+        return {
+            nodes: Array.from(this.nodes.values()),
+            edges: this.edges,
+            clusters,
+            rankings,
+            cycles,
+            statistics,
+        };
+    }
+    /**
+     * Parse all files to extract imports/exports
+     */
+    async parseFiles(files) {
+        const analyses = new Map();
+        for (const file of files) {
+            try {
+                const analysis = await this.parser.parseFile(file.absolutePath);
+                analyses.set(file.absolutePath, analysis);
+            }
+            catch {
+                // File couldn't be parsed, skip it
+            }
+        }
+        return analyses;
+    }
+    /**
+     * Build edges from import relationships
+     */
+    async buildEdges(files, analyses) {
+        const fileSet = new Set(files.map(f => f.absolutePath));
+        for (const file of files) {
+            const analysis = analyses.get(file.absolutePath);
+            if (!analysis)
+                continue;
+            for (const imp of analysis.imports) {
+                // Skip non-relative imports (packages, builtins)
+                if (!imp.isRelative)
+                    continue;
+                // Resolve the import to an absolute path
+                const resolvedPath = await resolveImport(imp.source, file.absolutePath, {
+                    baseDir: this.options.rootDir,
+                    extensions: this.options.extensions.length > 0 ? this.options.extensions : undefined,
+                });
+                // Skip if not resolved or not in our file set
+                if (!resolvedPath || !fileSet.has(resolvedPath))
+                    continue;
+                // Create edge
+                const edge = {
+                    source: file.absolutePath,
+                    target: resolvedPath,
+                    importedNames: imp.importedNames,
+                    isTypeOnly: imp.isTypeOnly,
+                    weight: imp.isTypeOnly ? 0.5 : 1,
+                };
+                this.edges.push(edge);
+                // Update adjacency lists
+                this.adjacencyList.get(file.absolutePath)?.add(resolvedPath);
+                this.reverseAdjacencyList.get(resolvedPath)?.add(file.absolutePath);
+            }
+        }
+    }
+    /**
+     * Calculate in-degree and out-degree for each node
+     */
+    calculateDegrees() {
+        for (const [nodeId, node] of this.nodes) {
+            node.metrics.outDegree = this.adjacencyList.get(nodeId)?.size ?? 0;
+            node.metrics.inDegree = this.reverseAdjacencyList.get(nodeId)?.size ?? 0;
+        }
+    }
+    /**
+     * Calculate betweenness centrality using Brandes' algorithm
+     */
+    calculateBetweenness() {
+        const nodeIds = Array.from(this.nodes.keys());
+        const betweenness = new Map();
+        // Initialize betweenness to 0
+        for (const id of nodeIds) {
+            betweenness.set(id, 0);
+        }
+        // Brandes' algorithm
+        for (const source of nodeIds) {
+            const stack = [];
+            const predecessors = new Map();
+            const sigma = new Map();
+            const distance = new Map();
+            const delta = new Map();
+            // Initialize
+            for (const v of nodeIds) {
+                predecessors.set(v, []);
+                sigma.set(v, 0);
+                distance.set(v, -1);
+                delta.set(v, 0);
+            }
+            sigma.set(source, 1);
+            distance.set(source, 0);
+            // BFS
+            const queue = [source];
+            while (queue.length > 0) {
+                const v = queue.shift();
+                stack.push(v);
+                const neighbors = this.adjacencyList.get(v) ?? new Set();
+                for (const w of neighbors) {
+                    // First visit?
+                    if (distance.get(w) < 0) {
+                        queue.push(w);
+                        distance.set(w, distance.get(v) + 1);
+                    }
+                    // Shortest path to w via v?
+                    if (distance.get(w) === distance.get(v) + 1) {
+                        sigma.set(w, sigma.get(w) + sigma.get(v));
+                        predecessors.get(w).push(v);
+                    }
+                }
+            }
+            // Back-propagation
+            while (stack.length > 0) {
+                const w = stack.pop();
+                for (const v of predecessors.get(w)) {
+                    delta.set(v, delta.get(v) + (sigma.get(v) / sigma.get(w)) * (1 + delta.get(w)));
+                }
+                if (w !== source) {
+                    betweenness.set(w, betweenness.get(w) + delta.get(w));
+                }
+            }
+        }
+        // Normalize and update nodes
+        const maxBetweenness = Math.max(...Array.from(betweenness.values()), 1);
+        for (const [nodeId, node] of this.nodes) {
+            node.metrics.betweenness = betweenness.get(nodeId) / maxBetweenness;
+        }
+    }
+    /**
+     * Calculate PageRank-style importance scores
+     */
+    calculatePageRank() {
+        const nodeIds = Array.from(this.nodes.keys());
+        const n = nodeIds.length;
+        if (n === 0)
+            return;
+        const d = this.options.dampingFactor;
+        let pageRank = new Map();
+        let newPageRank = new Map();
+        // Initialize
+        for (const id of nodeIds) {
+            pageRank.set(id, 1 / n);
+        }
+        // Iterate until convergence
+        for (let iter = 0; iter < this.options.maxIterations; iter++) {
+            let maxDiff = 0;
+            for (const id of nodeIds) {
+                // Sum contributions from nodes that link to this one
+                let sum = 0;
+                const incomingNodes = this.reverseAdjacencyList.get(id) ?? new Set();
+                for (const source of incomingNodes) {
+                    const outDegree = this.adjacencyList.get(source)?.size ?? 1;
+                    sum += pageRank.get(source) / outDegree;
+                }
+                const newRank = (1 - d) / n + d * sum;
+                newPageRank.set(id, newRank);
+                maxDiff = Math.max(maxDiff, Math.abs(newRank - pageRank.get(id)));
+            }
+            // Swap
+            [pageRank, newPageRank] = [newPageRank, pageRank];
+            // Check convergence
+            if (maxDiff < 1e-6)
+                break;
+        }
+        // Normalize and update nodes
+        const maxPageRank = Math.max(...Array.from(pageRank.values()), 0.001);
+        for (const [nodeId, node] of this.nodes) {
+            node.metrics.pageRank = pageRank.get(nodeId) / maxPageRank;
+        }
+    }
+    /**
+     * Detect clusters using a simple community detection approach
+     * Groups files by their common directory prefix and connectivity
+     */
+    detectClusters() {
+        const clusters = [];
+        const nodeIds = Array.from(this.nodes.keys());
+        // Group by directory
+        const dirGroups = new Map();
+        for (const nodeId of nodeIds) {
+            const node = this.nodes.get(nodeId);
+            const dir = node.file.directory || '(root)';
+            if (!dirGroups.has(dir)) {
+                dirGroups.set(dir, []);
+            }
+            dirGroups.get(dir).push(nodeId);
+        }
+        // Create clusters from directory groups
+        let clusterId = 0;
+        for (const [dir, files] of dirGroups) {
+            if (files.length < this.options.minClusterSize)
+                continue;
+            // Calculate internal and external edges
+            let internalEdges = 0;
+            let externalEdges = 0;
+            const fileSet = new Set(files);
+            for (const edge of this.edges) {
+                const sourceInCluster = fileSet.has(edge.source);
+                const targetInCluster = fileSet.has(edge.target);
+                if (sourceInCluster && targetInCluster) {
+                    internalEdges++;
+                }
+                else if (sourceInCluster || targetInCluster) {
+                    externalEdges++;
+                }
+            }
+            // Calculate cohesion (internal density)
+            const possibleInternalEdges = files.length * (files.length - 1);
+            const cohesion = possibleInternalEdges > 0 ? internalEdges / possibleInternalEdges : 0;
+            // Calculate coupling (external connections)
+            const totalEdges = internalEdges + externalEdges;
+            const coupling = totalEdges > 0 ? externalEdges / totalEdges : 0;
+            // Generate suggested domain name
+            const suggestedDomain = this.suggestDomainName(dir, files);
+            clusters.push({
+                id: `cluster-${clusterId++}`,
+                name: dir,
+                files,
+                internalEdges,
+                externalEdges,
+                cohesion,
+                coupling,
+                suggestedDomain,
+            });
+        }
+        return clusters;
+    }
+    /**
+     * Suggest a domain name based on directory and file contents
+     */
+    suggestDomainName(dir, files) {
+        // Extract meaningful name from directory
+        const parts = dir.split('/').filter(p => p && p !== '(root)');
+        // Common patterns to convert
+        const patterns = [
+            [/^src$/i, ''],
+            [/^lib$/i, ''],
+            [/^app$/i, ''],
+            [/^(api|routes|endpoints?)$/i, 'api'],
+            [/^(models?|entities|schemas?)$/i, 'domain'],
+            [/^(services?)$/i, 'services'],
+            [/^(controllers?)$/i, 'controllers'],
+            [/^(utils?|helpers?|common)$/i, 'utilities'],
+            [/^(components?)$/i, 'components'],
+            [/^(hooks?)$/i, 'hooks'],
+            [/^(auth|authentication)$/i, 'authentication'],
+            [/^(users?)$/i, 'users'],
+            [/^(products?)$/i, 'products'],
+            [/^(orders?)$/i, 'orders'],
+            [/^(payments?)$/i, 'payments'],
+            [/^(core)$/i, 'core'],
+        ];
+        // Try to find a meaningful name
+        for (const part of parts.reverse()) {
+            for (const [pattern, replacement] of patterns) {
+                if (pattern.test(part)) {
+                    return replacement || part.toLowerCase();
+                }
+            }
+            // If no pattern matches, use the part as-is
+            if (!/^(src|lib|app)$/i.test(part)) {
+                return part.toLowerCase().replace(/[^a-z0-9]/g, '-');
+            }
+        }
+        // Fallback: use first file's name pattern
+        if (files.length > 0) {
+            const firstFile = this.nodes.get(files[0])?.file.name ?? 'unknown';
+            return firstFile.replace(/\.(ts|js|tsx|jsx|py)x?$/, '').toLowerCase();
+        }
+        return 'misc';
+    }
+    /**
+     * Detect cycles in the dependency graph using DFS
+     */
+    detectCycles() {
+        const cycles = [];
+        const visited = new Set();
+        const recursionStack = new Set();
+        const path = [];
+        const dfs = (node) => {
+            visited.add(node);
+            recursionStack.add(node);
+            path.push(node);
+            const neighbors = this.adjacencyList.get(node) ?? new Set();
+            for (const neighbor of neighbors) {
+                if (!visited.has(neighbor)) {
+                    dfs(neighbor);
+                }
+                else if (recursionStack.has(neighbor)) {
+                    // Found a cycle
+                    const cycleStart = path.indexOf(neighbor);
+                    const cycle = path.slice(cycleStart);
+                    cycle.push(neighbor); // Complete the cycle
+                    // Check if this cycle is not a duplicate (or rotation of existing)
+                    if (!this.isDuplicateCycle(cycles, cycle)) {
+                        cycles.push(cycle);
+                    }
+                }
+            }
+            path.pop();
+            recursionStack.delete(node);
+        };
+        for (const nodeId of this.nodes.keys()) {
+            if (!visited.has(nodeId)) {
+                dfs(nodeId);
+            }
+        }
+        return cycles;
+    }
+    /**
+     * Check if a cycle is a duplicate or rotation of an existing cycle
+     */
+    isDuplicateCycle(existingCycles, newCycle) {
+        const normalizedNew = this.normalizeCycle(newCycle);
+        for (const existing of existingCycles) {
+            const normalizedExisting = this.normalizeCycle(existing);
+            if (normalizedNew === normalizedExisting) {
+                return true;
+            }
+        }
+        return false;
+    }
+    /**
+     * Normalize a cycle for comparison (smallest element first, then compare)
+     */
+    normalizeCycle(cycle) {
+        // Remove the duplicate closing element
+        const clean = cycle.slice(0, -1);
+        if (clean.length === 0)
+            return '';
+        // Find the smallest element
+        const minIdx = clean.indexOf(clean.reduce((min, curr) => (curr < min ? curr : min)));
+        // Rotate so smallest is first
+        const rotated = [...clean.slice(minIdx), ...clean.slice(0, minIdx)];
+        return rotated.join('|');
+    }
+    /**
+     * Generate various rankings of nodes
+     */
+    generateRankings(clusters) {
+        const nodes = Array.from(this.nodes.values());
+        // By PageRank importance
+        const byImportance = nodes
+            .sort((a, b) => b.metrics.pageRank - a.metrics.pageRank)
+            .map(n => n.id);
+        // By total connectivity (in + out degree)
+        const byConnectivity = nodes
+            .sort((a, b) => (b.metrics.inDegree + b.metrics.outDegree) -
+            (a.metrics.inDegree + a.metrics.outDegree))
+            .map(n => n.id);
+        // Cluster centers (highest in-degree within each cluster)
+        const clusterCenters = [];
+        for (const cluster of clusters) {
+            const clusterNodes = cluster.files
+                .map(f => this.nodes.get(f))
+                .filter((n) => n !== undefined);
+            if (clusterNodes.length > 0) {
+                const center = clusterNodes.reduce((max, n) => n.metrics.inDegree > max.metrics.inDegree ? n : max);
+                clusterCenters.push(center.id);
+            }
+        }
+        // Leaf nodes (high out-degree, low in-degree)
+        const leafNodes = nodes
+            .filter(n => n.metrics.outDegree > 0 && n.metrics.inDegree === 0)
+            .sort((a, b) => b.metrics.outDegree - a.metrics.outDegree)
+            .map(n => n.id);
+        // Bridge nodes (high betweenness)
+        const bridgeNodes = nodes
+            .filter(n => n.metrics.betweenness > 0.1)
+            .sort((a, b) => b.metrics.betweenness - a.metrics.betweenness)
+            .map(n => n.id);
+        // Orphan nodes (no connections)
+        const orphanNodes = nodes
+            .filter(n => n.metrics.inDegree === 0 && n.metrics.outDegree === 0)
+            .map(n => n.id);
+        return {
+            byImportance,
+            byConnectivity,
+            clusterCenters,
+            leafNodes,
+            bridgeNodes,
+            orphanNodes,
+        };
+    }
+    /**
+     * Calculate overall statistics
+     */
+    calculateStatistics(clusters, cycles) {
+        const nodeCount = this.nodes.size;
+        const edgeCount = this.edges.length;
+        // Average degree
+        let totalDegree = 0;
+        for (const node of this.nodes.values()) {
+            totalDegree += node.metrics.inDegree + node.metrics.outDegree;
+        }
+        const avgDegree = nodeCount > 0 ? totalDegree / nodeCount : 0;
+        // Density: actual edges / possible edges
+        const possibleEdges = nodeCount * (nodeCount - 1);
+        const density = possibleEdges > 0 ? edgeCount / possibleEdges : 0;
+        return {
+            nodeCount,
+            edgeCount,
+            avgDegree,
+            density,
+            clusterCount: clusters.length,
+            cycleCount: cycles.length,
+        };
+    }
+}
+// ============================================================================
+// CONVENIENCE FUNCTIONS
+// ============================================================================
+/**
+ * Build a dependency graph from scored files
+ */
+export async function buildDependencyGraph(files, options) {
+    const builder = new DependencyGraphBuilder(options);
+    return builder.build(files);
+}
+// ============================================================================
+// EXPORT FORMATS
+// ============================================================================
+/**
+ * Convert graph to D3.js force graph format
+ */
+export function toD3Format(result) {
+    // Create cluster index map
+    const clusterIndex = new Map();
+    result.clusters.forEach((cluster, idx) => {
+        for (const file of cluster.files) {
+            clusterIndex.set(file, idx);
+        }
+    });
+    return {
+        nodes: result.nodes.map(n => ({
+            id: n.file.path,
+            group: clusterIndex.get(n.id) ?? -1,
+            score: n.metrics.pageRank,
+        })),
+        links: result.edges.map(e => ({
+            source: result.nodes.find(n => n.id === e.source)?.file.path ?? e.source,
+            target: result.nodes.find(n => n.id === e.target)?.file.path ?? e.target,
+            value: e.weight,
+        })),
+    };
+}
+/**
+ * Convert graph to Mermaid diagram syntax
+ */
+export function toMermaidFormat(result, maxNodes = 50) {
+    const lines = ['graph TD'];
+    // Take top nodes by importance
+    const topNodes = result.rankings.byImportance.slice(0, maxNodes);
+    const nodeSet = new Set(topNodes);
+    // Create node labels
+    const nodeLabels = new Map();
+    result.nodes
+        .filter(n => nodeSet.has(n.id))
+        .forEach((n, idx) => {
+        const label = `N${idx}`;
+        nodeLabels.set(n.id, label);
+        const name = n.file.name.replace(/["[\]]/g, '');
+        lines.push(`    ${label}["${name}"]`);
+    });
+    // Create edges
+    for (const edge of result.edges) {
+        const sourceLabel = nodeLabels.get(edge.source);
+        const targetLabel = nodeLabels.get(edge.target);
+        if (sourceLabel && targetLabel) {
+            const style = edge.isTypeOnly ? '-.->' : '-->';
+            lines.push(`    ${sourceLabel} ${style} ${targetLabel}`);
+        }
+    }
+    return lines.join('\n');
+}
+/**
+ * Convert graph to DOT format (Graphviz)
+ */
+export function toDotFormat(result) {
+    const lines = ['digraph Dependencies {'];
+    lines.push('    rankdir=LR;');
+    lines.push('    node [shape=box];');
+    // Create node definitions with labels
+    for (const node of result.nodes) {
+        const name = node.file.name.replace(/"/g, '\\"');
+        const color = node.metrics.pageRank > 0.5 ? 'lightblue' : 'white';
+        lines.push(`    "${node.id}" [label="${name}" fillcolor="${color}" style="filled"];`);
+    }
+    // Create edges
+    for (const edge of result.edges) {
+        const style = edge.isTypeOnly ? 'dashed' : 'solid';
+        lines.push(`    "${edge.source}" -> "${edge.target}" [style="${style}"];`);
+    }
+    lines.push('}');
+    return lines.join('\n');
+}
+//# sourceMappingURL=dependency-graph.js.map

package/dist/core/analyzer/dependency-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.js","sourceRoot":"","sources":["../../../src/core/analyzer/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAsC,MAAM,oBAAoB,CAAC;AAyF3G,+EAA+E;AAC/E,2BAA2B;AAC3B,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,sBAAsB;IACzB,KAAK,GAAgC,IAAI,GAAG,EAAE,CAAC;IAC/C,KAAK,GAAqB,EAAE,CAAC;IAC7B,aAAa,GAA6B,IAAI,GAAG,EAAE,CAAC;IACpD,oBAAoB,GAA6B,IAAI,GAAG,EAAE,CAAC;IAC3D,MAAM,CAAqB;IAC3B,OAAO,CAAmC;IAElD,YAAY,OAA+B;QACzC,IAAI,CAAC,MAAM,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACvC,IAAI,CAAC,OAAO,GAAG;YACb,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,EAAE,EAAG,gDAAgD;YACvF,cAAc,EAAE,OAAO,CAAC,cAAc,IAAI,CAAC;YAC3C,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,IAAI;YAC5C,aAAa,EAAE,OAAO,CAAC,aAAa,IAAI,GAAG;SAC5C,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK,CAAC,KAAmB;QAC7B,2BAA2B;QAC3B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;QAElC,mCAAmC;QACnC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAE9C,6BAA6B;QAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE;gBAChC,EAAE,EAAE,IAAI,CAAC,YAAY;gBACrB,IAAI;gBACJ,OAAO,EAAE,QAAQ,EAAE,OAAO,IAAI,EAAE;gBAChC,OAAO,EAAE;oBACP,QAAQ,EAAE,CAAC;oBACX,SAAS,EAAE,CAAC;oBACZ,WAAW,EAAE,CAAC;oBACd,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM;iBAC3B;aACF,CAAC,CAAC;YACH,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YACrD,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,4BAA4B;QAC5B,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAEvC,oBAAoB;QACpB,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC5B,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,kBAAkB;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAEvC,gBAAgB;QAChB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QAEnC,oBAAoB;QACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEjD,uBAAuB;QACvB,MAAM,UAAU,GAAG,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QAE9D,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ;YACR,QAAQ;YACR,MAAM;YACN,UAAU;SACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CAAC,KAAmB;QAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;QAEjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAChE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;YAC5C,CAAC;YAAC,MAAM,CAAC;gBACP,mCAAmC;YACrC,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CACtB,KAAmB,EACnB,QAAmC;QAEnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;QAExD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACnC,iDAAiD;gBACjD,IAAI,CAAC,GAAG,CAAC,UAAU;oBAAE,SAAS;gBAE9B,yCAAyC;gBACzC,MAAM,YAAY,GAAG,MAAM,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE;oBACtE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO;oBAC7B,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS;iBACrF,CAAC,CAAC;gBAEH,8CAA8C;gBAC9C,IAAI,CAAC,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC;oBAAE,SAAS;gBAE1D,cAAc;gBACd,MAAM,IAAI,GAAmB;oBAC3B,MAAM,EAAE,IAAI,CAAC,YAAY;oBACzB,MAAM,EAAE,YAAY;oBACpB,aAAa,EAAE,GAAG,CAAC,aAAa;oBAChC,UAAU,EAAE,GAAG,CAAC,UAAU;oBAC1B,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACjC,CAAC;gBAEF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAEtB,yBAAyB;gBACzB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;gBAC7D,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB;QACtB,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACnE,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;QAC3E,CAAC;IACH,CAAC;IAED;;OAEG;IACK,oBAAoB;QAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,8BAA8B;QAC9B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;YACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;YACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;YAExC,aAAa;YACb,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACxB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAChB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,CAAC;YAED,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACrB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAExB,MAAM;YACN,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;YACjC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEd,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;gBACzD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;oBAC1B,eAAe;oBACf,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;wBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACd,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC;oBACxC,CAAC;oBACD,4BAA4B;oBAC5B,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,EAAE,CAAC;wBAC7C,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;wBAC5C,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;YACH,CAAC;YAED,mBAAmB;YACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACvB,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;oBACrC,KAAK,CAAC,GAAG,CACP,CAAC,EACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CACtE,CAAC;gBACJ,CAAC;gBACD,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC;oBACjB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,cAAc,CAAC;QACvE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,iBAAiB;QACvB,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9C,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO;QAEpB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC;QACrC,IAAI,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,IAAI,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE5C,aAAa;QACb,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,4BAA4B;QAC5B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAC7D,IAAI,OAAO,GAAG,CAAC,CAAC;YAEhB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,qDAAqD;gBACrD,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,MAAM,aAAa,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;gBACrE,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;oBAC5D,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,SAAS,CAAC;gBAC3C,CAAC;gBAED,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;gBACtC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC7B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,CAAC;YACrE,CAAC;YAED,OAAO;YACP,CAAC,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAElD,oBAAoB;YACpB,IAAI,OAAO,GAAG,IAAI;gBAAE,MAAM;QAC5B,CAAC;QAED,6BAA6B;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACxC,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,GAAG,WAAW,CAAC;QAC9D,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,cAAc;QACpB,MAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAE9C,qBAAqB;QACrB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC9C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;YACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC;YAE5C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACzB,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAED,wCAAwC;QACxC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,SAAS,EAAE,CAAC;YACrC,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc;gBAAE,SAAS;YAEzD,wCAAwC;YACxC,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YAE/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC9B,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACjD,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEjD,IAAI,eAAe,IAAI,eAAe,EAAE,CAAC;oBACvC,aAAa,EAAE,CAAC;gBAClB,CAAC;qBAAM,IAAI,eAAe,IAAI,eAAe,EAAE,CAAC;oBAC9C,aAAa,EAAE,CAAC;gBAClB,CAAC;YACH,CAAC;YAED,wCAAwC;YACxC,MAAM,qBAAqB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAChE,MAAM,QAAQ,GAAG,qBAAqB,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC;YAEvF,4CAA4C;YAC5C,MAAM,UAAU,GAAG,aAAa,GAAG,aAAa,CAAC;YACjD,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAEjE,iCAAiC;YACjC,MAAM,eAAe,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAE3D,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,WAAW,SAAS,EAAE,EAAE;gBAC5B,IAAI,EAAE,GAAG;gBACT,KAAK;gBACL,aAAa;gBACb,aAAa;gBACb,QAAQ;gBACR,QAAQ;gBACR,eAAe;aAChB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,GAAW,EAAE,KAAe;QACpD,yCAAyC;QACzC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,CAAC;QAE9D,6BAA6B;QAC7B,MAAM,QAAQ,GAAuB;YACnC,CAAC,QAAQ,EAAE,EAAE,CAAC;YACd,CAAC,QAAQ,EAAE,EAAE,CAAC;YACd,CAAC,QAAQ,EAAE,EAAE,CAAC;YACd,CAAC,4BAA4B,EAAE,KAAK,CAAC;YACrC,CAAC,gCAAgC,EAAE,QAAQ,CAAC;YAC5C,CAAC,gBAAgB,EAAE,UAAU,CAAC;YAC9B,CAAC,mBAAmB,EAAE,aAAa,CAAC;YACpC,CAAC,6BAA6B,EAAE,WAAW,CAAC;YAC5C,CAAC,kBAAkB,EAAE,YAAY,CAAC;YAClC,CAAC,aAAa,EAAE,OAAO,CAAC;YACxB,CAAC,0BAA0B,EAAE,gBAAgB,CAAC;YAC9C,CAAC,aAAa,EAAE,OAAO,CAAC;YACxB,CAAC,gBAAgB,EAAE,UAAU,CAAC;YAC9B,CAAC,cAAc,EAAE,QAAQ,CAAC;YAC1B,CAAC,gBAAgB,EAAE,UAAU,CAAC;YAC9B,CAAC,WAAW,EAAE,MAAM,CAAC;SACtB,CAAC;QAEF,gCAAgC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACnC,KAAK,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC9C,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvB,OAAO,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC3C,CAAC;YACH,CAAC;YACD,4CAA4C;YAC5C,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;YACnE,OAAO,SAAS,CAAC,OAAO,CAAC,yBAAyB,EAAE,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;QACxE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;QACzC,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,MAAM,GAAG,GAAG,CAAC,IAAY,EAAQ,EAAE;YACjC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAEhB,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;YAC5D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAChB,CAAC;qBAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxC,gBAAgB;oBAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACrC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,qBAAqB;oBAE3C,mEAAmE;oBACnE,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;wBAC1C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,GAAG,CAAC,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,cAA0B,EAAE,QAAkB;QACrE,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAEpD,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;YACtC,MAAM,kBAAkB,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,aAAa,KAAK,kBAAkB,EAAE,CAAC;gBACzC,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,KAAe;QACpC,uCAAuC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,4BAA4B;QAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CACvD,CAAC;QAEF,8BAA8B;QAC9B,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACpE,OAAO,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,QAAuB;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QAE9C,yBAAyB;QACzB,MAAM,YAAY,GAAG,KAAK;aACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;aACvD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,0CAA0C;QAC1C,MAAM,cAAc,GAAG,KAAK;aACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACb,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;YAC1C,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAC3C;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,0DAA0D;QAC1D,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK;iBAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBAC3B,MAAM,CAAC,CAAC,CAAC,EAAuB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YAEvD,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAC5C,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CACpD,CAAC;gBACF,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,SAAS,GAAG,KAAK;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,CAAC,CAAC;aAChE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC;aACzD,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,kCAAkC;QAClC,MAAM,WAAW,GAAG,KAAK;aACtB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,GAAG,GAAG,CAAC;aACxC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC;aAC7D,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,gCAAgC;QAChC,MAAM,WAAW,GAAG,KAAK;aACtB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,KAAK,CAAC,CAAC;aAClE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAElB,OAAO;YACL,YAAY;YACZ,cAAc;YACd,cAAc;YACd,SAAS;YACT,WAAW;YACX,WAAW;SACZ,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,mBAAmB,CACzB,QAAuB,EACvB,MAAkB;QAElB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAEpC,iBAAiB;QACjB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,WAAW,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC;QAChE,CAAC;QACD,MAAM,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9D,yCAAyC;QACzC,MAAM,aAAa,GAAG,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,OAAO,GAAG,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QAElE,OAAO;YACL,SAAS;YACT,SAAS;YACT,SAAS;YACT,OAAO;YACP,YAAY,EAAE,QAAQ,CAAC,MAAM;YAC7B,UAAU,EAAE,MAAM,CAAC,MAAM;SAC1B,CAAC;IACJ,CAAC;CACF;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,KAAmB,EACnB,OAA+B;IAE/B,MAAM,OAAO,GAAG,IAAI,sBAAsB,CAAC,OAAO,CAAC,CAAC;IACpD,OAAO,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,MAA6B;IAItD,2BAA2B;IAC3B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE;QACvC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YACjC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC5B,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ;SAC1B,CAAC,CAAC;QACH,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM;YACxE,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM;YACxE,KAAK,EAAE,CAAC,CAAC,MAAM;SAChB,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAA6B,EAAE,QAAQ,GAAG,EAAE;IAC1E,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,CAAC;IAErC,+BAA+B;IAC/B,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;IAElC,qBAAqB;IACrB,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,MAAM,CAAC,KAAK;SACT,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAC9B,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;QAClB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;QAChD,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEL,eAAe;IACf,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,WAAW,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YAC/C,KAAK,CAAC,IAAI,CAAC,OAAO,WAAW,IAAI,KAAK,IAAI,WAAW,EAAE,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,MAA6B;IACvD,MAAM,KAAK,GAAa,CAAC,wBAAwB,CAAC,CAAC;IACnD,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC9B,KAAK,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;IAEpC,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;QAClE,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,aAAa,IAAI,gBAAgB,KAAK,oBAAoB,CAAC,CAAC;IACxF,CAAC;IAED,eAAe;IACf,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;QACnD,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,MAAM,SAAS,IAAI,CAAC,MAAM,aAAa,KAAK,KAAK,CAAC,CAAC;IAC7E,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChB,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/core/analyzer/duplicate-detector.d.ts

@@ -0,0 +1,52 @@
+/**
+ * Duplicate Code Detector
+ *
+ * Detects code clones using pure static analysis — no LLM calls:
+ *   - Type 1 (exact):      identical code after whitespace/comment normalization
+ *   - Type 2 (structural): same AST structure with renamed variables
+ *   - Type 3 (near):       high Jaccard similarity on token n-grams (≥ 0.7)
+ *
+ * Requires a CallGraphResult for precise function boundaries (byte ranges).
+ * Complexity: O(n) for Types 1-2, O(n²) for Type 3 (bounded by MAX_NEAR_FUNCTIONS).
+ */
+import type { CallGraphResult } from './call-graph.js';
+export interface CloneInstance {
+    file: string;
+    functionName: string;
+    className?: string;
+    startLine: number;
+    endLine: number;
+}
+/** 'exact' = identical after normalization, 'structural' = same shape renamed, 'near' = high Jaccard */
+export type CloneType = 'exact' | 'structural' | 'near';
+export interface CloneGroup {
+    type: CloneType;
+    /** 1.0 for exact/structural; Jaccard similarity for near */
+    similarity: number;
+    instances: CloneInstance[];
+    /** Number of lines in the smallest instance of the cloned block */
+    lineCount: number;
+}
+export interface DuplicateDetectionResult {
+    cloneGroups: CloneGroup[];
+    stats: {
+        /** Functions analyzed (above minimum size threshold) */
+        totalFunctions: number;
+        /** Functions that appear in at least one clone group */
+        duplicatedFunctions: number;
+        /** duplicatedFunctions / totalFunctions */
+        duplicationRatio: number;
+        /** Number of distinct clone groups */
+        cloneGroupCount: number;
+    };
+}
+/**
+ * Detect duplicate functions across the codebase using the call graph's
+ * function nodes (which carry byte-range boundaries) and the original file
+ * contents.
+ */
+export declare function detectDuplicates(files: Array<{
+    path: string;
+    content: string;
+}>, callGraph: CallGraphResult): DuplicateDetectionResult;
+//# sourceMappingURL=duplicate-detector.d.ts.map

package/dist/core/analyzer/duplicate-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"duplicate-detector.d.ts","sourceRoot":"","sources":["../../../src/core/analyzer/duplicate-detector.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,iBAAiB,CAAC;AAMvD,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wGAAwG;AACxG,MAAM,MAAM,SAAS,GAAG,OAAO,GAAG,YAAY,GAAG,MAAM,CAAC;AAExD,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,SAAS,CAAC;IAChB,4DAA4D;IAC5D,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,aAAa,EAAE,CAAC;IAC3B,mEAAmE;IACnE,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,wBAAwB;IACvC,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,KAAK,EAAE;QACL,wDAAwD;QACxD,cAAc,EAAE,MAAM,CAAC;QACvB,wDAAwD;QACxD,mBAAmB,EAAE,MAAM,CAAC;QAC5B,2CAA2C;QAC3C,gBAAgB,EAAE,MAAM,CAAC;QACzB,sCAAsC;QACtC,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;CACH;AA+ID;;;;GAIG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EAC/C,SAAS,EAAE,eAAe,GACzB,wBAAwB,CA2J1B"}