codeseeker 1.4.0

package/dist/cli/features/documentation/map-analyzer.js

@@ -0,0 +1,320 @@
+"use strict";
+/**
+ * Document Map Analyzer with Semantic Graph Integration
+ * Combines documentation analysis with graph-based semantic search
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DocumentMapAnalyzer = void 0;
+// Import the base analyzer from a proper location or define it inline
+// For now, let's define basic interfaces to resolve the circular import
+const semantic_graph_1 = require("../../services/data/semantic-graph/semantic-graph");
+const logger_1 = require("../../../utils/logger");
+class DocumentMapAnalyzer {
+    semanticGraph;
+    constructor(semanticGraph) {
+        this.semanticGraph = semanticGraph || new semantic_graph_1.SemanticGraphService();
+    }
+    async analyzeDocumentation(params) {
+        // Basic implementation - this would be expanded in real use
+        return {
+            documents: [],
+            topics: [],
+            mainClasses: [],
+            crossReferences: []
+        };
+    }
+    async analyzeDocumentationWithSemantics(params) {
+        const startTime = Date.now();
+        const logger = logger_1.Logger.getInstance();
+        try {
+            logger.info('📚🔗 Starting enhanced documentation analysis with semantic graph...');
+            // 1. Run base documentation analysis
+            const baseResult = await this.analyzeDocumentation(params);
+            // 2. Initialize semantic graph if needed
+            await this.semanticGraph.initialize();
+            // 3. Populate semantic graph with documentation data
+            await this.populateSemanticGraph(baseResult, params.projectPath);
+            // 4. Extract concept clusters using graph analysis
+            const conceptClusters = await this.extractConceptClusters(baseResult);
+            // 5. Find cross-domain insights
+            const crossDomainInsights = await this.findCrossDomainInsights(baseResult);
+            // 6. Get graph statistics
+            const graphStats = await this.semanticGraph.getGraphStatistics();
+            const duration = Date.now() - startTime;
+            logger.info(`✅ Enhanced documentation analysis completed in ${duration}ms`, {
+                documentsFound: baseResult.documents.length,
+                conceptClusters: conceptClusters.length,
+                graphNodes: graphStats.nodeCount,
+                graphRelationships: graphStats.relationshipCount
+            });
+            return {
+                ...baseResult,
+                semanticGraph: {
+                    totalNodes: graphStats.nodeCount,
+                    totalRelationships: graphStats.relationshipCount,
+                    conceptClusters
+                },
+                crossDomainInsights
+            };
+        }
+        catch (error) {
+            logger.error('❌ Enhanced documentation analysis failed:', error);
+            throw error;
+        }
+    }
+    async semanticDocumentSearch(query, context) {
+        try {
+            const searchResults = await this.semanticGraph.semanticSearch(query, {
+                includeTypes: context?.includeCode ? ['Documentation', 'Code', 'BusinessConcept'] : ['Documentation', 'BusinessConcept'],
+                maxDepth: context?.maxResults || 10
+            });
+            return searchResults
+                .filter(result => result.nodes.length > 0 && ['Documentation', 'BusinessConcept'].includes(result.nodes[0].type))
+                .map(result => {
+                const node = result.nodes[0];
+                const relatedNodes = result.nodes.slice(1); // Related nodes are the rest
+                return {
+                    document: node.properties,
+                    relatedConcepts: relatedNodes
+                        .filter(rel => rel.type === 'BusinessConcept')
+                        .map(rel => rel.properties.name || rel.name),
+                    relatedCode: relatedNodes
+                        .filter(rel => rel.type === 'Code')
+                        .map(rel => rel.properties.path || rel.filePath),
+                    relevanceScore: result.stats?.relevantNodes || 0
+                };
+            })
+                .slice(0, context?.maxResults || 10);
+        }
+        catch (error) {
+            logger_1.Logger.getInstance().error('❌ Semantic document search failed:', error);
+            return [];
+        }
+    }
+    async populateSemanticGraph(result, projectPath) {
+        const logger = logger_1.Logger.getInstance();
+        logger.info('🔗 Populating semantic graph with documentation data...');
+        try {
+            // 1. Create business concept nodes
+            const conceptNodes = new Map();
+            for (const topic of result.topics) {
+                const conceptId = await this.semanticGraph.addNode('BusinessConcept', {
+                    name: topic.topic,
+                    domain: this.inferDomain(topic.topic),
+                    description: `Business concept derived from documentation analysis`,
+                    keywords: topic.keywords,
+                    importance: topic.importance,
+                    documentCount: topic.documents.length
+                });
+                conceptNodes.set(topic.topic, conceptId);
+            }
+            // 2. Create documentation nodes
+            const docNodes = new Map();
+            for (const doc of result.documents) {
+                const docId = await this.semanticGraph.addNode('Documentation', {
+                    path: doc.path,
+                    title: doc.title,
+                    type: doc.type,
+                    summary: doc.summary,
+                    content: doc.summary, // Full content would be too large
+                    wordCount: doc.wordCount,
+                    topics: doc.topics,
+                    lastModified: doc.lastModified.toISOString()
+                });
+                docNodes.set(doc.id, docId);
+            }
+            // 3. Create code nodes for referenced classes
+            const codeNodes = new Map();
+            for (const classSummary of result.mainClasses) {
+                const codeId = await this.semanticGraph.addNode('Code', {
+                    name: classSummary.name,
+                    type: 'class',
+                    description: classSummary.description,
+                    category: classSummary.category,
+                    mentionCount: classSummary.mentions.length
+                });
+                codeNodes.set(classSummary.name, codeId);
+            }
+            // 4. Create relationships
+            await this.createSemanticRelationships(result, conceptNodes, docNodes, codeNodes);
+            logger.info(`✅ Populated semantic graph: ${conceptNodes.size} concepts, ${docNodes.size} docs, ${codeNodes.size} code nodes`);
+        }
+        catch (error) {
+            logger.error('❌ Failed to populate semantic graph:', error);
+        }
+    }
+    async createSemanticRelationships(result, conceptNodes, docNodes, codeNodes) {
+        // Document -> Business Concept relationships
+        for (const doc of result.documents) {
+            const docId = docNodes.get(doc.id);
+            if (!docId)
+                continue;
+            for (const topic of doc.topics) {
+                const conceptId = conceptNodes.get(topic);
+                if (conceptId) {
+                    await this.semanticGraph.addRelationship(docId, conceptId, 'DEFINES', {
+                        strength: this.calculateTopicStrength(doc, topic)
+                    });
+                }
+            }
+        }
+        // Documentation -> Code relationships
+        for (const classSummary of result.mainClasses) {
+            const codeId = codeNodes.get(classSummary.name);
+            if (!codeId)
+                continue;
+            for (const mention of classSummary.mentions) {
+                const docId = docNodes.get(mention.documentId);
+                if (docId) {
+                    await this.semanticGraph.addRelationship(docId, codeId, 'DESCRIBES', {
+                        context: mention.context,
+                        strength: 1.0 / classSummary.mentions.length // Distribute strength across mentions
+                    });
+                }
+            }
+        }
+        // Business Concept relationships (based on co-occurrence)
+        const concepts = Array.from(conceptNodes.keys());
+        for (let i = 0; i < concepts.length; i++) {
+            for (let j = i + 1; j < concepts.length; j++) {
+                const concept1 = concepts[i];
+                const concept2 = concepts[j];
+                // Find documents that mention both concepts
+                const sharedDocs = result.documents.filter(doc => doc.topics.includes(concept1) && doc.topics.includes(concept2));
+                if (sharedDocs.length > 0) {
+                    const conceptId1 = conceptNodes.get(concept1);
+                    const conceptId2 = conceptNodes.get(concept2);
+                    await this.semanticGraph.addRelationship(conceptId1, conceptId2, 'RELATES_TO', {
+                        sharedDocuments: sharedDocs.length,
+                        strength: sharedDocs.length / result.documents.length
+                    });
+                }
+            }
+        }
+        // Cross-references
+        for (const crossRef of result.crossReferences) {
+            const fromDocId = docNodes.get(crossRef.from);
+            const toDocId = docNodes.get(crossRef.to);
+            if (fromDocId && toDocId) {
+                await this.semanticGraph.addRelationship(fromDocId, toDocId, 'RELATES_TO', {
+                    type: crossRef.type,
+                    context: crossRef.context
+                });
+            }
+        }
+    }
+    async extractConceptClusters(result) {
+        const clusters = [];
+        for (const topic of result.topics) {
+            try {
+                const crossRefs = await this.semanticGraph.findCrossReferences(topic.topic);
+                // Combine all cross-reference results
+                const allRelatedDocs = crossRefs.flatMap(ref => ref.relatedDocs);
+                const allRelatedCode = crossRefs.flatMap(ref => ref.relatedCode);
+                const allRelatedUI = crossRefs.flatMap(ref => ref.relatedUI);
+                clusters.push({
+                    conceptName: topic.topic,
+                    relatedDocs: allRelatedDocs.map(node => node.properties.path || node.filePath),
+                    relatedCode: allRelatedCode.map(node => node.properties.name || node.name),
+                    relatedUI: allRelatedUI.map(node => node.properties.name || node.name),
+                    strength: this.calculateClusterStrength(crossRefs)
+                });
+            }
+            catch (error) {
+                // Concept might not exist in graph yet
+                logger_1.Logger.getInstance().debug(`Could not find cross-references for ${topic.topic}`);
+            }
+        }
+        return clusters.sort((a, b) => b.strength - a.strength);
+    }
+    async findCrossDomainInsights(result) {
+        const insights = [];
+        // Find concepts that appear across multiple domains
+        const domainMap = new Map();
+        for (const doc of result.documents) {
+            const domain = this.inferDomain(doc.type);
+            for (const topic of doc.topics) {
+                if (!domainMap.has(topic)) {
+                    domainMap.set(topic, new Set());
+                }
+                domainMap.get(topic).add(domain);
+            }
+        }
+        // Find cross-domain concepts
+        for (const [concept, domains] of domainMap.entries()) {
+            if (domains.size > 1) {
+                try {
+                    const crossRefs = await this.semanticGraph.findCrossReferences(concept);
+                    // Analyze connections between domains
+                    const connections = [];
+                    const domainsArray = Array.from(domains);
+                    for (let i = 0; i < domainsArray.length; i++) {
+                        for (let j = i + 1; j < domainsArray.length; j++) {
+                            connections.push({
+                                from: domainsArray[i],
+                                to: domainsArray[j],
+                                type: 'concept_bridge',
+                                strength: this.calculateConnectionStrength(crossRefs, domainsArray[i], domainsArray[j])
+                            });
+                        }
+                    }
+                    insights.push({
+                        concept,
+                        domains: domainsArray,
+                        connections
+                    });
+                }
+                catch (error) {
+                    logger_1.Logger.getInstance().debug(`Could not analyze cross-domain insight for ${concept}`);
+                }
+            }
+        }
+        return insights.sort((a, b) => b.domains.length - a.domains.length);
+    }
+    // Helper methods
+    inferDomain(input) {
+        const domainKeywords = {
+            'frontend': ['ui', 'component', 'navigation', 'user', 'interface'],
+            'backend': ['api', 'server', 'database', 'service'],
+            'security': ['auth', 'authentication', 'authorization', 'security'],
+            'testing': ['test', 'testing', 'spec', 'coverage'],
+            'documentation': ['readme', 'guide', 'docs', 'documentation'],
+            'architecture': ['architecture', 'design', 'patterns', 'principles']
+        };
+        const inputLower = input.toLowerCase();
+        for (const [domain, keywords] of Object.entries(domainKeywords)) {
+            if (keywords.some(keyword => inputLower.includes(keyword))) {
+                return domain;
+            }
+        }
+        return 'general';
+    }
+    calculateTopicStrength(doc, topic) {
+        // Higher strength for topics that appear in title or multiple times
+        let strength = 0.5; // Base strength
+        if (doc.title.toLowerCase().includes(topic.toLowerCase())) {
+            strength += 0.3;
+        }
+        // Count occurrences in summary
+        const escapedTopic = topic.toLowerCase().replace(/[.*+?^${}()|[\]\\]/g, '\\$&');
+        const occurrences = (doc.summary.toLowerCase().match(new RegExp(escapedTopic, 'g')) || []).length;
+        strength += Math.min(occurrences * 0.1, 0.3);
+        return Math.min(strength, 1.0);
+    }
+    calculateClusterStrength(crossRefs) {
+        const totalConnections = crossRefs.relatedDocs.length +
+            crossRefs.relatedCode.length +
+            crossRefs.relatedUI.length +
+            crossRefs.relatedTests.length;
+        // Normalize to 0-1 scale (assume max 20 connections for a strong cluster)
+        return Math.min(totalConnections / 20, 1.0);
+    }
+    calculateConnectionStrength(crossRefs, domain1, domain2) {
+        // Simple heuristic based on shared resources
+        const sharedResources = crossRefs.relatedDocs.length + crossRefs.relatedCode.length;
+        return Math.min(sharedResources / 10, 1.0);
+    }
+}
+exports.DocumentMapAnalyzer = DocumentMapAnalyzer;
+exports.default = DocumentMapAnalyzer;
+//# sourceMappingURL=map-analyzer.js.map

package/dist/cli/features/documentation/map-analyzer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map-analyzer.js","sourceRoot":"","sources":["../../../../src/cli/features/documentation/map-analyzer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,sEAAsE;AACtE,wEAAwE;AACxE,sFAAqH;AACrH,kDAA+C;AAwE/C,MAAa,mBAAmB;IACtB,aAAa,CAAuB;IAE5C,YAAY,aAAoC;QAC9C,IAAI,CAAC,aAAa,GAAG,aAAa,IAAI,IAAI,qCAAoB,EAAE,CAAC;IACnE,CAAC;IAED,KAAK,CAAC,oBAAoB,CAAC,MAA0B;QACnD,4DAA4D;QAC5D,OAAO;YACL,SAAS,EAAE,EAAE;YACb,MAAM,EAAE,EAAE;YACV,WAAW,EAAE,EAAE;YACf,eAAe,EAAE,EAAE;SACpB,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,iCAAiC,CAAC,MAA0B;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;QAEpC,IAAI,CAAC;YACH,MAAM,CAAC,IAAI,CAAC,sEAAsE,CAAC,CAAC;YAEpF,qCAAqC;YACrC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;YAE3D,yCAAyC;YACzC,MAAM,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;YAEtC,qDAAqD;YACrD,MAAM,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;YAEjE,mDAAmD;YACnD,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,sBAAsB,CAAC,UAAU,CAAC,CAAC;YAEtE,gCAAgC;YAChC,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;YAE3E,0BAA0B;YAC1B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,kBAAkB,EAAE,CAAC;YAEjE,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,kDAAkD,QAAQ,IAAI,EAAE;gBAC1E,cAAc,EAAE,UAAU,CAAC,SAAS,CAAC,MAAM;gBAC3C,eAAe,EAAE,eAAe,CAAC,MAAM;gBACvC,UAAU,EAAE,UAAU,CAAC,SAAS;gBAChC,kBAAkB,EAAE,UAAU,CAAC,iBAAiB;aACjD,CAAC,CAAC;YAEH,OAAO;gBACL,GAAG,UAAU;gBACb,aAAa,EAAE;oBACb,UAAU,EAAE,UAAU,CAAC,SAAS;oBAChC,kBAAkB,EAAE,UAAU,CAAC,iBAAiB;oBAChD,eAAe;iBAChB;gBACD,mBAAmB;aACpB,CAAC;QAEJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,2CAA2C,EAAE,KAAK,CAAC,CAAC;YACjE,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,sBAAsB,CAC1B,KAAa,EACb,OAIC;QAOD,IAAI,CAAC;YACH,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,KAAK,EAAE;gBACnE,YAAY,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,iBAAiB,CAAC;gBACxH,QAAQ,EAAE,OAAO,EAAE,UAAU,IAAI,EAAE;aACpC,CAAC,CAAC;YAEH,OAAO,aAAa;iBACjB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,eAAe,EAAE,iBAAiB,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;iBAChH,GAAG,CAAC,MAAM,CAAC,EAAE;gBACZ,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,6BAA6B;gBACzE,OAAO;oBACL,QAAQ,EAAE,IAAI,CAAC,UAAU;oBACzB,eAAe,EAAE,YAAY;yBAC1B,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,iBAAiB,CAAC;yBAC7C,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;oBAC9C,WAAW,EAAE,YAAY;yBACtB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,KAAK,MAAM,CAAC;yBAClC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;oBAClD,cAAc,EAAE,MAAM,CAAC,KAAK,EAAE,aAAa,IAAI,CAAC;iBACjD,CAAC;YACJ,CAAC,CAAC;iBACD,KAAK,CAAC,CAAC,EAAE,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC,CAAC;QAEzC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,eAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,oCAAoC,EAAE,KAAK,CAAC,CAAC;YACxE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,qBAAqB,CAAC,MAAyB,EAAE,WAAmB;QAChF,MAAM,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;QAEvE,IAAI,CAAC;YACH,mCAAmC;YACnC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;gBAClC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,iBAAiB,EAAE;oBACpE,IAAI,EAAE,KAAK,CAAC,KAAK;oBACjB,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC;oBACrC,WAAW,EAAE,sDAAsD;oBACnE,QAAQ,EAAE,KAAK,CAAC,QAAQ;oBACxB,UAAU,EAAE,KAAK,CAAC,UAAU;oBAC5B,aAAa,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM;iBACtC,CAAC,CAAC;gBACH,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YAC3C,CAAC;YAED,gCAAgC;YAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC3C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,eAAe,EAAE;oBAC9D,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,KAAK,EAAE,GAAG,CAAC,KAAK;oBAChB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,kCAAkC;oBACxD,SAAS,EAAE,GAAG,CAAC,SAAS;oBACxB,MAAM,EAAE,GAAG,CAAC,MAAM;oBAClB,YAAY,EAAE,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE;iBAC7C,CAAC,CAAC;gBACH,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC9B,CAAC;YAED,8CAA8C;YAC9C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;YAC5C,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;gBAC9C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,EAAE;oBACtD,IAAI,EAAE,YAAY,CAAC,IAAI;oBACvB,IAAI,EAAE,OAAO;oBACb,WAAW,EAAE,YAAY,CAAC,WAAW;oBACrC,QAAQ,EAAE,YAAY,CAAC,QAAQ;oBAC/B,YAAY,EAAE,YAAY,CAAC,QAAQ,CAAC,MAAM;iBAC3C,CAAC,CAAC;gBACH,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC3C,CAAC;YAED,0BAA0B;YAC1B,MAAM,IAAI,CAAC,2BAA2B,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAElF,MAAM,CAAC,IAAI,CAAC,+BAA+B,YAAY,CAAC,IAAI,cAAc,QAAQ,CAAC,IAAI,UAAU,SAAS,CAAC,IAAI,aAAa,CAAC,CAAC;QAEhI,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,sCAAsC,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,2BAA2B,CACvC,MAAyB,EACzB,YAAiC,EACjC,QAA6B,EAC7B,SAA8B;QAE9B,6CAA6C;QAC7C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC1C,IAAI,SAAS,EAAE,CAAC;oBACd,MAAM,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE;wBACpE,QAAQ,EAAE,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,KAAK,CAAC;qBAClD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,CAAC,MAAM;gBAAE,SAAS;YAEtB,KAAK,MAAM,OAAO,IAAI,YAAY,CAAC,QAAQ,EAAE,CAAC;gBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBAC/C,IAAI,KAAK,EAAE,CAAC;oBACV,MAAM,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE;wBACnE,OAAO,EAAE,OAAO,CAAC,OAAO;wBACxB,QAAQ,EAAE,GAAG,GAAG,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,sCAAsC;qBACpF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,CAAC;QACjD,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,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC7B,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAE7B,4CAA4C;gBAC5C,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAC/C,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAC/D,CAAC;gBAEF,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC1B,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;oBAC/C,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;oBAE/C,MAAM,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE;wBAC7E,eAAe,EAAE,UAAU,CAAC,MAAM;wBAClC,QAAQ,EAAE,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM;qBACtD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,eAAe,EAAE,CAAC;YAC9C,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAE1C,IAAI,SAAS,IAAI,OAAO,EAAE,CAAC;gBACzB,MAAM,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,YAAY,EAAE;oBACzE,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,OAAO,EAAE,QAAQ,CAAC,OAAO;iBAC1B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,sBAAsB,CAAC,MAAyB;QAC5D,MAAM,QAAQ,GAAqB,EAAE,CAAC;QAEtC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,mBAAmB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAE5E,sCAAsC;gBACtC,MAAM,cAAc,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjE,MAAM,cAAc,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACjE,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAE7D,QAAQ,CAAC,IAAI,CAAC;oBACZ,WAAW,EAAE,KAAK,CAAC,KAAK;oBACxB,WAAW,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC;oBAC9E,WAAW,EAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;oBAC1E,SAAS,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;oBACtE,QAAQ,EAAE,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC;iBACnD,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,uCAAuC;gBACvC,eAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,uCAAuC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAEO,KAAK,CAAC,uBAAuB,CAAC,MAAyB;QAC7D,MAAM,QAAQ,GAAyB,EAAE,CAAC;QAE1C,oDAAoD;QACpD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;QAEjD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;gBAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;gBAClC,CAAC;gBACD,SAAS,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,6BAA6B;QAC7B,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YACrD,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBACrB,IAAI,CAAC;oBACH,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;oBAExE,sCAAsC;oBACtC,MAAM,WAAW,GAAG,EAAE,CAAC;oBACvB,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBAEzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACjD,WAAW,CAAC,IAAI,CAAC;gCACf,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;gCACrB,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC;gCACnB,IAAI,EAAE,gBAAgB;gCACtB,QAAQ,EAAE,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;6BACxF,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;oBAED,QAAQ,CAAC,IAAI,CAAC;wBACZ,OAAO;wBACP,OAAO,EAAE,YAAY;wBACrB,WAAW;qBACZ,CAAC,CAAC;gBACL,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,eAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,8CAA8C,OAAO,EAAE,CAAC,CAAC;gBACtF,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACtE,CAAC;IAED,iBAAiB;IACT,WAAW,CAAC,KAAa;QAC/B,MAAM,cAAc,GAAG;YACrB,UAAU,EAAE,CAAC,IAAI,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,EAAE,WAAW,CAAC;YAClE,SAAS,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,CAAC;YACnD,UAAU,EAAE,CAAC,MAAM,EAAE,gBAAgB,EAAE,eAAe,EAAE,UAAU,CAAC;YACnE,SAAS,EAAE,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,CAAC;YAClD,eAAe,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,eAAe,CAAC;YAC7D,cAAc,EAAE,CAAC,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,CAAC;SACrE,CAAC;QAEF,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YAChE,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;gBAC3D,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,sBAAsB,CAAC,GAAQ,EAAE,KAAa;QACpD,oEAAoE;QACpE,IAAI,QAAQ,GAAG,GAAG,CAAC,CAAC,gBAAgB;QAEpC,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;YAC1D,QAAQ,IAAI,GAAG,CAAC;QAClB,CAAC;QAED,+BAA+B;QAC/B,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAC;QAChF,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;QAClG,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;QAE7C,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IACjC,CAAC;IAEO,wBAAwB,CAAC,SAAc;QAC7C,MAAM,gBAAgB,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM;YAC9B,SAAS,CAAC,WAAW,CAAC,MAAM;YAC5B,SAAS,CAAC,SAAS,CAAC,MAAM;YAC1B,SAAS,CAAC,YAAY,CAAC,MAAM,CAAC;QAErD,0EAA0E;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,gBAAgB,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IAC9C,CAAC;IAEO,2BAA2B,CAAC,SAAc,EAAE,OAAe,EAAE,OAAe;QAClF,6CAA6C;QAC7C,MAAM,eAAe,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;QACpF,OAAO,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC;IAC7C,CAAC;CACF;AAtXD,kDAsXC;AAED,kBAAe,mBAAmB,CAAC"}

package/dist/cli/features/duplication/detector.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Duplication Detector (SOLID Refactored)
+ * SOLID Principles: Dependency Inversion - Coordinator depends on abstractions
+ * Coordinates all duplication detection operations using service abstractions
+ */
+import { DuplicationScanRequest, DuplicationResult, DuplicationGroup, IFileAnalysisService, IDuplicationDetectionService, IRefactoringAdvisorService, IStatisticsService } from './interfaces/index';
+export { DuplicationScanRequest, DuplicationResult, DuplicationGroup, ScanInfo, DuplicationType, RefactoringApproach, EffortEstimate, RefactoringAdvice, RefactoringImpact, CodeLocation, DuplicationStatistics } from './interfaces/index';
+export declare class DuplicationDetector {
+    private fileAnalysisService?;
+    private detectionService?;
+    private advisorService?;
+    private statisticsService?;
+    private logger;
+    constructor(fileAnalysisService?: IFileAnalysisService, detectionService?: IDuplicationDetectionService, advisorService?: IRefactoringAdvisorService, statisticsService?: IStatisticsService);
+    findDuplicates(request: DuplicationScanRequest): Promise<DuplicationResult>;
+    quickScan(projectPath: string): Promise<DuplicationResult>;
+    deepScan(projectPath: string): Promise<DuplicationResult>;
+    generateReport(result: DuplicationResult): Promise<string>;
+    getPriorityGroups(result: DuplicationResult, topN?: number): Promise<DuplicationGroup[]>;
+    private findAllDuplicateTypes;
+    private deduplicateAndPrioritize;
+    private hasSignificantLocationOverlap;
+    private locationsOverlap;
+    private calculateGroupPriority;
+    static createWithServices(fileAnalysisService: IFileAnalysisService, detectionService: IDuplicationDetectionService, advisorService: IRefactoringAdvisorService, statisticsService: IStatisticsService): DuplicationDetector;
+    static createDefault(): DuplicationDetector;
+}
+//# sourceMappingURL=detector.d.ts.map

package/dist/cli/features/duplication/detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detector.d.ts","sourceRoot":"","sources":["../../../../src/cli/features/duplication/detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EACL,sBAAsB,EACtB,iBAAiB,EACjB,gBAAgB,EAEhB,oBAAoB,EACpB,4BAA4B,EAC5B,0BAA0B,EAC1B,kBAAkB,EACnB,MAAM,oBAAoB,CAAC;AAO5B,OAAO,EACL,sBAAsB,EACtB,iBAAiB,EACjB,gBAAgB,EAChB,QAAQ,EACR,eAAe,EACf,mBAAmB,EACnB,cAAc,EACd,iBAAiB,EACjB,iBAAiB,EACjB,YAAY,EACZ,qBAAqB,EACtB,MAAM,oBAAoB,CAAC;AAE5B,qBAAa,mBAAmB;IAI5B,OAAO,CAAC,mBAAmB,CAAC;IAC5B,OAAO,CAAC,gBAAgB,CAAC;IACzB,OAAO,CAAC,cAAc,CAAC;IACvB,OAAO,CAAC,iBAAiB,CAAC;IAN5B,OAAO,CAAC,MAAM,CAAwB;gBAG5B,mBAAmB,CAAC,EAAE,oBAAoB,EAC1C,gBAAgB,CAAC,EAAE,4BAA4B,EAC/C,cAAc,CAAC,EAAE,0BAA0B,EAC3C,iBAAiB,CAAC,EAAE,kBAAkB;IAS1C,cAAc,CAAC,OAAO,EAAE,sBAAsB,GAAG,OAAO,CAAC,iBAAiB,CAAC;IA+E3E,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAa1D,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,iBAAiB,CAAC;IAYzD,cAAc,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,MAAM,CAAC;IAI1D,iBAAiB,CAAC,MAAM,EAAE,iBAAiB,EAAE,IAAI,GAAE,MAAW,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAKpF,qBAAqB;IAqCnC,OAAO,CAAC,wBAAwB;IAsBhC,OAAO,CAAC,6BAA6B;IAmBrC,OAAO,CAAC,gBAAgB;IAqBxB,OAAO,CAAC,sBAAsB;IAwB9B,MAAM,CAAC,kBAAkB,CACvB,mBAAmB,EAAE,oBAAoB,EACzC,gBAAgB,EAAE,4BAA4B,EAC9C,cAAc,EAAE,0BAA0B,EAC1C,iBAAiB,EAAE,kBAAkB,GACpC,mBAAmB;IAStB,MAAM,CAAC,aAAa,IAAI,mBAAmB;CAG5C"}

package/dist/cli/features/duplication/detector.js

@@ -0,0 +1,228 @@
+"use strict";
+/**
+ * Duplication Detector (SOLID Refactored)
+ * SOLID Principles: Dependency Inversion - Coordinator depends on abstractions
+ * Coordinates all duplication detection operations using service abstractions
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DuplicationDetector = exports.EffortEstimate = exports.RefactoringApproach = exports.DuplicationType = void 0;
+const logger_1 = require("../../../utils/logger");
+const file_analysis_service_1 = require("./services/file-analysis-service");
+const duplication_detection_service_1 = require("./services/duplication-detection-service");
+const refactoring_advisor_service_1 = require("./services/refactoring-advisor-service");
+const statistics_service_1 = require("./services/statistics-service");
+// Re-export interfaces and types for backward compatibility
+var index_1 = require("./interfaces/index");
+Object.defineProperty(exports, "DuplicationType", { enumerable: true, get: function () { return index_1.DuplicationType; } });
+Object.defineProperty(exports, "RefactoringApproach", { enumerable: true, get: function () { return index_1.RefactoringApproach; } });
+Object.defineProperty(exports, "EffortEstimate", { enumerable: true, get: function () { return index_1.EffortEstimate; } });
+class DuplicationDetector {
+    fileAnalysisService;
+    detectionService;
+    advisorService;
+    statisticsService;
+    logger = logger_1.Logger.getInstance();
+    constructor(fileAnalysisService, detectionService, advisorService, statisticsService) {
+        this.fileAnalysisService = fileAnalysisService;
+        this.detectionService = detectionService;
+        this.advisorService = advisorService;
+        this.statisticsService = statisticsService;
+        // Initialize services with dependency injection
+        this.fileAnalysisService = this.fileAnalysisService || new file_analysis_service_1.FileAnalysisService();
+        this.detectionService = this.detectionService || new duplication_detection_service_1.DuplicationDetectionService();
+        this.advisorService = this.advisorService || new refactoring_advisor_service_1.RefactoringAdvisorService();
+        this.statisticsService = this.statisticsService || new statistics_service_1.StatisticsService();
+    }
+    async findDuplicates(request) {
+        const startTime = Date.now();
+        this.logger.info(`🔍 Starting duplication detection in ${request.projectPath}`);
+        const scanInfo = {
+            totalFiles: 0,
+            analyzedFiles: 0,
+            skippedFiles: 0,
+            processingTime: 0,
+            timestamp: new Date()
+        };
+        try {
+            // Step 1: Get all files to analyze
+            this.logger.debug('📂 Discovering project files...');
+            const files = await this.fileAnalysisService.getProjectFiles(request.projectPath, request.filePatterns, request.excludePatterns);
+            scanInfo.totalFiles = files.length;
+            // Step 2: Extract code blocks from all files
+            this.logger.debug('🧩 Extracting code blocks...');
+            const allCodeBlocks = [];
+            for (const file of files) {
+                try {
+                    const filePath = require('path').join(request.projectPath, file);
+                    const blocks = await this.fileAnalysisService.extractCodeBlocks(filePath);
+                    allCodeBlocks.push(...blocks);
+                    scanInfo.analyzedFiles++;
+                }
+                catch (error) {
+                    this.logger.debug(`⚠️ Failed to process ${file}:`, error);
+                    scanInfo.skippedFiles++;
+                }
+            }
+            // Step 3: Find different types of duplicates
+            this.logger.debug('🔄 Analyzing duplicates...');
+            const duplicateGroups = await this.findAllDuplicateTypes(allCodeBlocks, request);
+            // Step 4: Generate refactoring advice if requested
+            if (request.includeRefactoringSuggestions) {
+                this.logger.debug('💡 Generating refactoring advice...');
+                for (const group of duplicateGroups) {
+                    group.refactoring = this.advisorService.generateRefactoringAdvice(group);
+                }
+            }
+            // Step 5: Calculate statistics
+            this.logger.debug('📊 Calculating statistics...');
+            const statistics = this.statisticsService.calculateStatistics(duplicateGroups);
+            // Complete scan info
+            scanInfo.processingTime = Date.now() - startTime;
+            const result = {
+                duplicates: duplicateGroups,
+                scanInfo,
+                statistics
+            };
+            this.logger.info(`✅ Duplication detection completed: found ${duplicateGroups.length} duplicate groups in ${scanInfo.processingTime}ms`);
+            return result;
+        }
+        catch (error) {
+            this.logger.error('❌ Duplication detection failed:', error);
+            scanInfo.processingTime = Date.now() - startTime;
+            return {
+                duplicates: [],
+                scanInfo,
+                statistics: this.statisticsService.calculateStatistics([])
+            };
+        }
+    }
+    async quickScan(projectPath) {
+        const quickRequest = {
+            projectPath,
+            includeSemantic: false, // Skip semantic analysis for speed
+            similarityThreshold: 0.8,
+            includeRefactoringSuggestions: false,
+            filePatterns: ['**/*.ts', '**/*.js'], // Limited file types
+            excludePatterns: ['node_modules/**', 'dist/**', '**/*.test.*']
+        };
+        return this.findDuplicates(quickRequest);
+    }
+    async deepScan(projectPath) {
+        const deepRequest = {
+            projectPath,
+            includeSemantic: true, // Include semantic analysis
+            similarityThreshold: 0.7, // Lower threshold for more matches
+            includeRefactoringSuggestions: true,
+            filePatterns: ['**/*.ts', '**/*.js', '**/*.tsx', '**/*.jsx', '**/*.py', '**/*.java']
+        };
+        return this.findDuplicates(deepRequest);
+    }
+    async generateReport(result) {
+        return this.statisticsService.generateSummaryReport(result.duplicates);
+    }
+    async getPriorityGroups(result, topN = 10) {
+        return this.statisticsService.identifyPriorityGroups(result.duplicates, topN);
+    }
+    // Helper method for finding all duplicate types
+    async findAllDuplicateTypes(codeBlocks, request) {
+        const allGroups = [];
+        // Find exact duplicates
+        const exactGroups = this.detectionService.findExactDuplicates(codeBlocks);
+        allGroups.push(...exactGroups);
+        // Find structural duplicates
+        const structuralGroups = this.detectionService.findStructuralDuplicates(codeBlocks, request.similarityThreshold);
+        allGroups.push(...structuralGroups);
+        // Find renamed duplicates
+        const renamedGroups = this.detectionService.findRenamedDuplicates(codeBlocks, request.similarityThreshold);
+        allGroups.push(...renamedGroups);
+        // Find semantic duplicates (if enabled)
+        if (request.includeSemantic) {
+            const semanticGroups = await this.detectionService.findSemanticDuplicates(codeBlocks, request.similarityThreshold);
+            allGroups.push(...semanticGroups);
+        }
+        // Remove overlapping groups and sort by priority
+        return this.deduplicateAndPrioritize(allGroups);
+    }
+    deduplicateAndPrioritize(groups) {
+        // Remove groups where locations significantly overlap
+        const uniqueGroups = [];
+        for (const group of groups) {
+            const hasSignificantOverlap = uniqueGroups.some(existing => this.hasSignificantLocationOverlap(group, existing));
+            if (!hasSignificantOverlap) {
+                uniqueGroups.push(group);
+            }
+        }
+        // Sort by a priority score (higher is more important)
+        return uniqueGroups.sort((a, b) => {
+            const scoreA = this.calculateGroupPriority(a);
+            const scoreB = this.calculateGroupPriority(b);
+            return scoreB - scoreA;
+        });
+    }
+    hasSignificantLocationOverlap(group1, group2) {
+        const locations1 = group1.locations;
+        const locations2 = group2.locations;
+        let overlappingCount = 0;
+        for (const loc1 of locations1) {
+            for (const loc2 of locations2) {
+                if (this.locationsOverlap(loc1, loc2)) {
+                    overlappingCount++;
+                }
+            }
+        }
+        // Consider it significant overlap if more than 50% of locations overlap
+        const minLocations = Math.min(locations1.length, locations2.length);
+        return overlappingCount / minLocations > 0.5;
+    }
+    locationsOverlap(loc1, loc2) {
+        // Check if two locations overlap significantly
+        if (loc1.file !== loc2.file)
+            return false;
+        const range1 = { start: loc1.startLine, end: loc1.endLine };
+        const range2 = { start: loc2.startLine, end: loc2.endLine };
+        const overlapStart = Math.max(range1.start, range2.start);
+        const overlapEnd = Math.min(range1.end, range2.end);
+        if (overlapStart > overlapEnd)
+            return false; // No overlap
+        const overlapSize = overlapEnd - overlapStart + 1;
+        const size1 = range1.end - range1.start + 1;
+        const size2 = range2.end - range2.start + 1;
+        const minSize = Math.min(size1, size2);
+        // Consider overlap significant if it's more than 70% of the smaller range
+        return overlapSize / minSize > 0.7;
+    }
+    calculateGroupPriority(group) {
+        let priority = 0;
+        // Higher priority for exact duplicates
+        switch (group.type) {
+            case 'exact':
+                priority += 100;
+                break;
+            case 'renamed':
+                priority += 80;
+                break;
+            case 'structural':
+                priority += 60;
+                break;
+            case 'semantic':
+                priority += 40;
+                break;
+        }
+        // Higher priority for more locations
+        priority += group.locations.length * 20;
+        // Higher priority for more lines of code
+        priority += group.metadata.linesOfCode * 0.5;
+        // Higher priority for higher complexity
+        priority += group.metadata.complexity * 10;
+        return priority;
+    }
+    // Factory methods for testing and dependency injection
+    static createWithServices(fileAnalysisService, detectionService, advisorService, statisticsService) {
+        return new DuplicationDetector(fileAnalysisService, detectionService, advisorService, statisticsService);
+    }
+    static createDefault() {
+        return new DuplicationDetector();
+    }
+}
+exports.DuplicationDetector = DuplicationDetector;
+//# sourceMappingURL=detector.js.map

package/dist/cli/features/duplication/detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detector.js","sourceRoot":"","sources":["../../../../src/cli/features/duplication/detector.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,kDAA+C;AAW/C,4EAAuE;AACvE,4FAAuF;AACvF,wFAAmF;AACnF,sEAAkE;AAElE,4DAA4D;AAC5D,4CAY4B;AAP1B,wGAAA,eAAe,OAAA;AACf,4GAAA,mBAAmB,OAAA;AACnB,uGAAA,cAAc,OAAA;AAOhB,MAAa,mBAAmB;IAIpB;IACA;IACA;IACA;IANF,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;IAEtC,YACU,mBAA0C,EAC1C,gBAA+C,EAC/C,cAA2C,EAC3C,iBAAsC;QAHtC,wBAAmB,GAAnB,mBAAmB,CAAuB;QAC1C,qBAAgB,GAAhB,gBAAgB,CAA+B;QAC/C,mBAAc,GAAd,cAAc,CAA6B;QAC3C,sBAAiB,GAAjB,iBAAiB,CAAqB;QAE9C,gDAAgD;QAChD,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,IAAI,IAAI,2CAAmB,EAAE,CAAC;QACjF,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,IAAI,IAAI,2DAA2B,EAAE,CAAC;QACnF,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,uDAAyB,EAAE,CAAC;QAC7E,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,IAAI,sCAAiB,EAAE,CAAC;IAC7E,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,OAA+B;QAClD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,wCAAwC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;QAEhF,MAAM,QAAQ,GAAa;YACzB,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC;YAChB,YAAY,EAAE,CAAC;YACf,cAAc,EAAE,CAAC;YACjB,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAC;QAEF,IAAI,CAAC;YACH,mCAAmC;YACnC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;YACrD,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,mBAAoB,CAAC,eAAe,CAC3D,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,YAAY,EACpB,OAAO,CAAC,eAAe,CACxB,CAAC;YACF,QAAQ,CAAC,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;YAEnC,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,EAAE,CAAC;YAEzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC;oBACH,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;oBACjE,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,mBAAoB,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;oBAC3E,aAAa,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;oBAC9B,QAAQ,CAAC,aAAa,EAAE,CAAC;gBAC3B,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,wBAAwB,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;oBAC1D,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC1B,CAAC;YACH,CAAC;YAED,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAChD,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YAEjF,mDAAmD;YACnD,IAAI,OAAO,CAAC,6BAA6B,EAAE,CAAC;gBAC1C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAC;gBACzD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;oBACpC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,cAAe,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;gBAC5E,CAAC;YACH,CAAC;YAED,+BAA+B;YAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;YAClD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAkB,CAAC,mBAAmB,CAAC,eAAe,CAAC,CAAC;YAEhF,qBAAqB;YACrB,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAEjD,MAAM,MAAM,GAAsB;gBAChC,UAAU,EAAE,eAAe;gBAC3B,QAAQ;gBACR,UAAU;aACX,CAAC;YAEF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,4CAA4C,eAAe,CAAC,MAAM,wBAAwB,QAAQ,CAAC,cAAc,IAAI,CAAC,CAAC;YACxI,OAAO,MAAM,CAAC;QAEhB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAC;YAE5D,QAAQ,CAAC,cAAc,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;YAEjD,OAAO;gBACL,UAAU,EAAE,EAAE;gBACd,QAAQ;gBACR,UAAU,EAAE,IAAI,CAAC,iBAAkB,CAAC,mBAAmB,CAAC,EAAE,CAAC;aAC5D,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,WAAmB;QACjC,MAAM,YAAY,GAA2B;YAC3C,WAAW;YACX,eAAe,EAAE,KAAK,EAAE,mCAAmC;YAC3D,mBAAmB,EAAE,GAAG;YACxB,6BAA6B,EAAE,KAAK;YACpC,YAAY,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,EAAE,qBAAqB;YAC3D,eAAe,EAAE,CAAC,iBAAiB,EAAE,SAAS,EAAE,aAAa,CAAC;SAC/D,CAAC;QAEF,OAAO,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,WAAmB;QAChC,MAAM,WAAW,GAA2B;YAC1C,WAAW;YACX,eAAe,EAAE,IAAI,EAAE,4BAA4B;YACnD,mBAAmB,EAAE,GAAG,EAAE,mCAAmC;YAC7D,6BAA6B,EAAE,IAAI;YACnC,YAAY,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,CAAC;SACrF,CAAC;QAEF,OAAO,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,MAAyB;QAC5C,OAAO,IAAI,CAAC,iBAAkB,CAAC,qBAAqB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC1E,CAAC;IAED,KAAK,CAAC,iBAAiB,CAAC,MAAyB,EAAE,OAAe,EAAE;QAClE,OAAO,IAAI,CAAC,iBAAkB,CAAC,sBAAsB,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjF,CAAC;IAED,gDAAgD;IACxC,KAAK,CAAC,qBAAqB,CACjC,UAAiB,EACjB,OAA+B;QAE/B,MAAM,SAAS,GAAuB,EAAE,CAAC;QAEzC,wBAAwB;QACxB,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAiB,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC3E,SAAS,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAE/B,6BAA6B;QAC7B,MAAM,gBAAgB,GAAG,IAAI,CAAC,gBAAiB,CAAC,wBAAwB,CACtE,UAAU,EACV,OAAO,CAAC,mBAAmB,CAC5B,CAAC;QACF,SAAS,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;QAEpC,0BAA0B;QAC1B,MAAM,aAAa,GAAG,IAAI,CAAC,gBAAiB,CAAC,qBAAqB,CAChE,UAAU,EACV,OAAO,CAAC,mBAAmB,CAC5B,CAAC;QACF,SAAS,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC;QAEjC,wCAAwC;QACxC,IAAI,OAAO,CAAC,eAAe,EAAE,CAAC;YAC5B,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,gBAAiB,CAAC,sBAAsB,CACxE,UAAU,EACV,OAAO,CAAC,mBAAmB,CAC5B,CAAC;YACF,SAAS,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAC;QACpC,CAAC;QAED,iDAAiD;QACjD,OAAO,IAAI,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;IAClD,CAAC;IAEO,wBAAwB,CAAC,MAA0B;QACzD,sDAAsD;QACtD,MAAM,YAAY,GAAuB,EAAE,CAAC;QAE5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,qBAAqB,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CACzD,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,QAAQ,CAAC,CACpD,CAAC;YAEF,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBAC3B,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,OAAO,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAChC,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAC9C,OAAO,MAAM,GAAG,MAAM,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,6BAA6B,CAAC,MAAwB,EAAE,MAAwB;QACtF,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QACpC,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QAEpC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QAEzB,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBACtC,gBAAgB,EAAE,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QAED,wEAAwE;QACxE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;QACpE,OAAO,gBAAgB,GAAG,YAAY,GAAG,GAAG,CAAC;IAC/C,CAAC;IAEO,gBAAgB,CAAC,IAAS,EAAE,IAAS;QAC3C,+CAA+C;QAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAE1C,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;QAE5D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;QAEpD,IAAI,YAAY,GAAG,UAAU;YAAE,OAAO,KAAK,CAAC,CAAC,aAAa;QAE1D,MAAM,WAAW,GAAG,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAEvC,0EAA0E;QAC1E,OAAO,WAAW,GAAG,OAAO,GAAG,GAAG,CAAC;IACrC,CAAC;IAEO,sBAAsB,CAAC,KAAuB;QACpD,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,uCAAuC;QACvC,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;YACnB,KAAK,OAAO;gBAAE,QAAQ,IAAI,GAAG,CAAC;gBAAC,MAAM;YACrC,KAAK,SAAS;gBAAE,QAAQ,IAAI,EAAE,CAAC;gBAAC,MAAM;YACtC,KAAK,YAAY;gBAAE,QAAQ,IAAI,EAAE,CAAC;gBAAC,MAAM;YACzC,KAAK,UAAU;gBAAE,QAAQ,IAAI,EAAE,CAAC;gBAAC,MAAM;QACzC,CAAC;QAED,qCAAqC;QACrC,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;QAExC,yCAAyC;QACzC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,WAAW,GAAG,GAAG,CAAC;QAE7C,wCAAwC;QACxC,QAAQ,IAAI,KAAK,CAAC,QAAQ,CAAC,UAAU,GAAG,EAAE,CAAC;QAE3C,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,uDAAuD;IACvD,MAAM,CAAC,kBAAkB,CACvB,mBAAyC,EACzC,gBAA8C,EAC9C,cAA0C,EAC1C,iBAAqC;QAErC,OAAO,IAAI,mBAAmB,CAC5B,mBAAmB,EACnB,gBAAgB,EAChB,cAAc,EACd,iBAAiB,CAClB,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,aAAa;QAClB,OAAO,IAAI,mBAAmB,EAAE,CAAC;IACnC,CAAC;CACF;AA7QD,kDA6QC"}