codeseeker 1.4.0

package/dist/cli/services/data/semantic-graph/services/file-processing-service.js

@@ -0,0 +1,175 @@
+"use strict";
+/**
+ * File Processing Service
+ * SOLID Principles: Single Responsibility - Handle file processing coordination only
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.FileProcessingService = void 0;
+const logger_1 = require("../../../../../utils/logger");
+const index_1 = require("../processors/index");
+class FileProcessingService {
+    config;
+    treeSitterProcessor;
+    claudeProxyProcessor;
+    fallbackProcessor;
+    qualityAnalyzer;
+    logger = logger_1.Logger.getInstance();
+    constructor(config, treeSitterProcessor, claudeProxyProcessor, fallbackProcessor, qualityAnalyzer) {
+        this.config = config;
+        this.treeSitterProcessor = treeSitterProcessor;
+        this.claudeProxyProcessor = claudeProxyProcessor;
+        this.fallbackProcessor = fallbackProcessor;
+        this.qualityAnalyzer = qualityAnalyzer;
+        // Initialize processors with dependency injection
+        this.treeSitterProcessor = this.treeSitterProcessor || new index_1.TreeSitterProcessor();
+        this.claudeProxyProcessor = this.claudeProxyProcessor || new index_1.ClaudeProxyProcessor();
+        this.fallbackProcessor = this.fallbackProcessor || new index_1.FallbackProcessor();
+    }
+    async buildGraphFromFiles(files) {
+        this.logger.info('🔄 Starting integrated semantic graph building');
+        const startTime = Date.now();
+        // Filter and categorize files
+        const processableFiles = this.filterFiles(files);
+        const fileCategories = this.categorizeFiles(processableFiles);
+        // Process files with optimal strategy
+        const treeSitterResults = await this.treeSitterProcessor?.processFiles(fileCategories.treeSitter) || null;
+        const claudeProxyResults = await this.claudeProxyProcessor?.processFiles(fileCategories.claude) || null;
+        const fallbackResults = await this.fallbackProcessor?.processFiles(fileCategories.fallback) || this.createEmptyResult();
+        // Merge results
+        const integratedResult = await this.mergeProcessingResults(treeSitterResults, claudeProxyResults, fallbackResults, fileCategories);
+        // Add processing metrics
+        integratedResult.processingStrategy = {
+            treeSitterFiles: fileCategories.treeSitter.length,
+            claudeProxyFiles: fileCategories.claude.length,
+            fallbackFiles: fileCategories.fallback.length,
+            totalProcessingTime: Date.now() - startTime
+        };
+        // Calculate quality metrics
+        integratedResult.qualityMetrics = this.qualityAnalyzer
+            ? this.qualityAnalyzer.calculateQualityMetrics(integratedResult, fileCategories)
+            : this.calculateDefaultQualityMetrics(integratedResult, fileCategories);
+        this.logger.info(`✅ Integrated semantic graph complete: ${integratedResult.stats.totalEntities} entities, ${integratedResult.stats.totalRelationships} relationships`);
+        this.logger.info(`📊 Strategy: ${integratedResult.processingStrategy.treeSitterFiles} Tree-sitter, ${integratedResult.processingStrategy.claudeProxyFiles} Claude, ${integratedResult.processingStrategy.fallbackFiles} fallback`);
+        return integratedResult;
+    }
+    filterFiles(files) {
+        return files.filter(file => {
+            if (file.type !== 'source')
+                return false;
+            if (file.size === 0)
+                return false;
+            if (this.config.skipLargeFiles && file.size > this.config.maxFileSize) {
+                this.logger.debug(`⚠ Skipping large file: ${file.relativePath} (${Math.round(file.size / 1024)}KB)`);
+                return false;
+            }
+            return true;
+        });
+    }
+    categorizeFiles(files) {
+        const treeSitter = [];
+        const claude = [];
+        const fallback = [];
+        for (const file of files) {
+            const language = file.language?.toLowerCase();
+            if (this.config.useTreeSitter && this.config.preferTreeSitter && language && this.config.treeSitterLanguages.includes(language)) {
+                treeSitter.push(file);
+            }
+            else if (this.config.useClaudeProxy && this.shouldUseClaudeProxy(file)) {
+                claude.push(file);
+            }
+            else {
+                fallback.push(file);
+            }
+        }
+        return { treeSitter, claude, fallback };
+    }
+    shouldUseClaudeProxy(file) {
+        if (!file.language)
+            return false;
+        const language = file.language.toLowerCase();
+        const complexLanguages = ['c++', 'c#', 'swift', 'kotlin', 'scala', 'haskell', 'ocaml'];
+        return !this.config.treeSitterLanguages.includes(language) || complexLanguages.includes(language) ||
+            file.name.includes('config') || file.extension === '.sql';
+    }
+    async mergeProcessingResults(treeSitterResults, claudeProxyResults, fallbackResults, fileCategories) {
+        const mergedEntities = [...fallbackResults.entities];
+        const mergedRelationships = [...fallbackResults.relationships];
+        const mergedFileNodes = new Map(fallbackResults.fileNodes);
+        const mergedStats = { ...fallbackResults.stats };
+        // Merge Tree-sitter results
+        if (treeSitterResults) {
+            mergedEntities.push(...treeSitterResults.entities);
+            mergedRelationships.push(...treeSitterResults.relationships);
+            for (const [path, nodeId] of treeSitterResults.fileNodes) {
+                mergedFileNodes.set(path, nodeId);
+            }
+            this.mergeStats(mergedStats, treeSitterResults.stats);
+        }
+        // Merge Claude proxy results
+        if (claudeProxyResults) {
+            mergedEntities.push(...claudeProxyResults.entities);
+            mergedRelationships.push(...claudeProxyResults.relationships);
+            for (const [path, nodeId] of claudeProxyResults.fileNodes) {
+                mergedFileNodes.set(path, nodeId);
+            }
+            this.mergeStats(mergedStats, claudeProxyResults.stats);
+        }
+        return {
+            entities: mergedEntities,
+            relationships: mergedRelationships,
+            fileNodes: mergedFileNodes,
+            stats: mergedStats,
+            processingStrategy: {
+                treeSitterFiles: 0,
+                claudeProxyFiles: 0,
+                fallbackFiles: 0,
+                totalProcessingTime: 0
+            },
+            qualityMetrics: {
+                completeness: 0,
+                accuracy: 0,
+                consistency: 0,
+                coverage: 0
+            }
+        };
+    }
+    mergeStats(target, source) {
+        target.totalFiles += source.totalFiles;
+        target.totalEntities += source.totalEntities;
+        target.totalRelationships += source.totalRelationships;
+        // Merge by language counts
+        for (const [language, count] of Object.entries(source.byLanguage)) {
+            target.byLanguage[language] = (target.byLanguage[language] || 0) + count;
+        }
+    }
+    calculateDefaultQualityMetrics(result, fileCategories) {
+        const totalFiles = fileCategories.treeSitter.length + fileCategories.claude.length + fileCategories.fallback.length;
+        const processedFiles = result.stats.totalFiles;
+        // Simple quality metrics calculation
+        const coverage = totalFiles > 0 ? (processedFiles / totalFiles) * 100 : 0;
+        const completeness = result.stats.totalEntities > 0 ? Math.min(100, result.stats.totalEntities / totalFiles * 2) : 0;
+        const accuracy = result.processingStrategy.treeSitterFiles / Math.max(1, processedFiles) * 100;
+        const consistency = result.stats.totalRelationships > 0 ? Math.min(100, result.stats.totalRelationships / result.stats.totalEntities * 50) : 0;
+        return {
+            completeness: Math.round(completeness),
+            accuracy: Math.round(accuracy),
+            consistency: Math.round(consistency),
+            coverage: Math.round(coverage)
+        };
+    }
+    createEmptyResult() {
+        return {
+            entities: [],
+            relationships: [],
+            fileNodes: new Map(),
+            stats: {
+                totalFiles: 0,
+                totalEntities: 0,
+                totalRelationships: 0,
+                byLanguage: {}
+            }
+        };
+    }
+}
+exports.FileProcessingService = FileProcessingService;
+//# sourceMappingURL=file-processing-service.js.map

package/dist/cli/services/data/semantic-graph/services/file-processing-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-processing-service.js","sourceRoot":"","sources":["../../../../../../src/cli/services/data/semantic-graph/services/file-processing-service.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,wDAAqD;AAUrD,+CAAmG;AAEnG,MAAa,qBAAqB;IAItB;IACA;IACA;IACA;IACA;IAPF,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;IAEtC,YACU,MAA0B,EAC1B,mBAAyC,EACzC,oBAA2C,EAC3C,iBAAqC,EACrC,eAAkC;QAJlC,WAAM,GAAN,MAAM,CAAoB;QAC1B,wBAAmB,GAAnB,mBAAmB,CAAsB;QACzC,yBAAoB,GAApB,oBAAoB,CAAuB;QAC3C,sBAAiB,GAAjB,iBAAiB,CAAoB;QACrC,oBAAe,GAAf,eAAe,CAAmB;QAE1C,kDAAkD;QAClD,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,mBAAmB,IAAI,IAAI,2BAAmB,EAAE,CAAC;QACjF,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,IAAI,IAAI,4BAAoB,EAAE,CAAC;QACpF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,IAAI,IAAI,yBAAiB,EAAE,CAAC;IAC7E,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,KAAiB;QACzC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QACnE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,8BAA8B;QAC9B,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACjD,MAAM,cAAc,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC;QAE9D,sCAAsC;QACtC,MAAM,iBAAiB,GAAG,MAAM,IAAI,CAAC,mBAAmB,EAAE,YAAY,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC;QAC1G,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,oBAAoB,EAAE,YAAY,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;QACxG,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,YAAY,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAExH,gBAAgB;QAChB,MAAM,gBAAgB,GAAG,MAAM,IAAI,CAAC,sBAAsB,CACxD,iBAAiB,EAAE,kBAAkB,EAAE,eAAe,EAAE,cAAc,CACvE,CAAC;QAEF,yBAAyB;QACzB,gBAAgB,CAAC,kBAAkB,GAAG;YACpC,eAAe,EAAE,cAAc,CAAC,UAAU,CAAC,MAAM;YACjD,gBAAgB,EAAE,cAAc,CAAC,MAAM,CAAC,MAAM;YAC9C,aAAa,EAAE,cAAc,CAAC,QAAQ,CAAC,MAAM;YAC7C,mBAAmB,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SAC5C,CAAC;QAEF,4BAA4B;QAC5B,gBAAgB,CAAC,cAAc,GAAG,IAAI,CAAC,eAAe;YACpD,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,uBAAuB,CAAC,gBAAgB,EAAE,cAAc,CAAC;YAChF,CAAC,CAAC,IAAI,CAAC,8BAA8B,CAAC,gBAAgB,EAAE,cAAc,CAAC,CAAC;QAE1E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,yCAAyC,gBAAgB,CAAC,KAAK,CAAC,aAAa,cAAc,gBAAgB,CAAC,KAAK,CAAC,kBAAkB,gBAAgB,CAAC,CAAC;QACvK,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,gBAAgB,CAAC,kBAAkB,CAAC,eAAe,iBAAiB,gBAAgB,CAAC,kBAAkB,CAAC,gBAAgB,YAAY,gBAAgB,CAAC,kBAAkB,CAAC,aAAa,WAAW,CAAC,CAAC;QAEnO,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAED,WAAW,CAAC,KAAiB;QAC3B,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;YACzB,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,KAAK,CAAC;YACzC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;gBACtE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0BAA0B,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrG,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED,eAAe,CAAC,KAAiB;QAK/B,MAAM,UAAU,GAAe,EAAE,CAAC;QAClC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAe,EAAE,CAAC;QAEhC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC;YAC9C,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC,gBAAgB,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,IAAI,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;IAC1C,CAAC;IAEO,oBAAoB,CAAC,IAAc;QACzC,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;QAC7C,MAAM,gBAAgB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACvF,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC1F,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC;IACnE,CAAC;IAEO,KAAK,CAAC,sBAAsB,CAClC,iBAA2C,EAC3C,kBAA4C,EAC5C,eAAkC,EAClC,cAAmB;QAEnB,MAAM,cAAc,GAAG,CAAC,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,mBAAmB,GAAG,CAAC,GAAG,eAAe,CAAC,aAAa,CAAC,CAAC;QAC/D,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAC3D,MAAM,WAAW,GAAG,EAAE,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC;QAEjD,4BAA4B;QAC5B,IAAI,iBAAiB,EAAE,CAAC;YACtB,cAAc,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;YACnD,mBAAmB,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,aAAa,CAAC,CAAC;YAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,iBAAiB,CAAC,SAAS,EAAE,CAAC;gBACzD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxD,CAAC;QAED,6BAA6B;QAC7B,IAAI,kBAAkB,EAAE,CAAC;YACvB,cAAc,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;YACpD,mBAAmB,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,aAAa,CAAC,CAAC;YAC9D,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,kBAAkB,CAAC,SAAS,EAAE,CAAC;gBAC1D,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACpC,CAAC;YACD,IAAI,CAAC,UAAU,CAAC,WAAW,EAAE,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,cAAc;YACxB,aAAa,EAAE,mBAAmB;YAClC,SAAS,EAAE,eAAe;YAC1B,KAAK,EAAE,WAAW;YAClB,kBAAkB,EAAE;gBAClB,eAAe,EAAE,CAAC;gBAClB,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,CAAC;gBAChB,mBAAmB,EAAE,CAAC;aACvB;YACD,cAAc,EAAE;gBACd,YAAY,EAAE,CAAC;gBACf,QAAQ,EAAE,CAAC;gBACX,WAAW,EAAE,CAAC;gBACd,QAAQ,EAAE,CAAC;aACZ;SACF,CAAC;IACJ,CAAC;IAEO,UAAU,CAAC,MAAW,EAAE,MAAW;QACzC,MAAM,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,CAAC;QACvC,MAAM,CAAC,aAAa,IAAI,MAAM,CAAC,aAAa,CAAC;QAC7C,MAAM,CAAC,kBAAkB,IAAI,MAAM,CAAC,kBAAkB,CAAC;QAEvD,2BAA2B;QAC3B,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YAClE,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAI,KAAgB,CAAC;QACvF,CAAC;IACH,CAAC;IAEO,8BAA8B,CAAC,MAAgC,EAAE,cAAmB;QAM1F,MAAM,UAAU,GAAG,cAAc,CAAC,UAAU,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC;QACpH,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;QAE/C,qCAAqC;QACrC,MAAM,QAAQ,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,aAAa,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrH,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,GAAG,GAAG,CAAC;QAC/F,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,kBAAkB,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/I,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC;YACtC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC9B,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;YACpC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;SAC/B,CAAC;IACJ,CAAC;IAEO,iBAAiB;QACvB,OAAO;YACL,QAAQ,EAAE,EAAE;YACZ,aAAa,EAAE,EAAE;YACjB,SAAS,EAAE,IAAI,GAAG,EAAE;YACpB,KAAK,EAAE;gBACL,UAAU,EAAE,CAAC;gBACb,aAAa,EAAE,CAAC;gBAChB,kBAAkB,EAAE,CAAC;gBACrB,UAAU,EAAE,EAAE;aACf;SACF,CAAC;IACJ,CAAC;CACF;AAjMD,sDAiMC"}

package/dist/cli/services/data/semantic-graph/services/graph-query-service.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Graph Query Service
+ * SOLID Principles: Single Responsibility - Handle graph querying and analysis only
+ */
+import { IGraphQueryService, IGraphStorageService, IQualityAnalyzer, GraphNode, NodeType, SearchResult, SearchContext, ImpactAnalysisResult, CrossReferenceResult } from '../interfaces/index';
+export declare class GraphQueryService implements IGraphQueryService {
+    private storageService;
+    private qualityAnalyzer?;
+    private logger;
+    constructor(storageService: IGraphStorageService, qualityAnalyzer?: IQualityAnalyzer);
+    searchNodes(query: string, context?: SearchContext): Promise<SearchResult>;
+    findRelatedNodes(nodeId: string, maxDepth?: number): Promise<GraphNode[]>;
+    findPathBetweenNodes(fromId: string, toId: string): Promise<GraphNode[]>;
+    getNodesByType(type: NodeType): Promise<GraphNode[]>;
+    analyzeImpact(nodeId: string): Promise<ImpactAnalysisResult>;
+    performCrossReference(concept: string): Promise<CrossReferenceResult>;
+    findBusinessConcepts(): Promise<GraphNode[]>;
+    findOrphanedNodes(): Promise<GraphNode[]>;
+    getGraphStatistics(): Promise<{
+        nodeCount: number;
+        relationshipCount: number;
+        typeDistribution: Record<string, number>;
+    }>;
+    private getNodeRelationships;
+    private categorizeImpactNodes;
+    private calculateRiskLevel;
+    private filterByType;
+    private createEmptyCrossReference;
+    private calculateTypeDistribution;
+    calculateRelevanceScore(node: GraphNode, keywords: string[]): number;
+    performSemanticSearch(query: string, context?: SearchContext): Promise<SearchResult[]>;
+    findCrossReferences(nodeId: string): Promise<CrossReferenceResult[]>;
+}
+//# sourceMappingURL=graph-query-service.d.ts.map

package/dist/cli/services/data/semantic-graph/services/graph-query-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-query-service.d.ts","sourceRoot":"","sources":["../../../../../../src/cli/services/data/semantic-graph/services/graph-query-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACL,kBAAkB,EAClB,oBAAoB,EACpB,gBAAgB,EAChB,SAAS,EACT,QAAQ,EACR,YAAY,EACZ,aAAa,EACb,oBAAoB,EACpB,oBAAoB,EACrB,MAAM,qBAAqB,CAAC;AAE7B,qBAAa,iBAAkB,YAAW,kBAAkB;IAIxD,OAAO,CAAC,cAAc;IACtB,OAAO,CAAC,eAAe,CAAC;IAJ1B,OAAO,CAAC,MAAM,CAAwB;gBAG5B,cAAc,EAAE,oBAAoB,EACpC,eAAe,CAAC,EAAE,gBAAgB;IAGtC,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,CAAC;IAc1E,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAU5E,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAqBxE,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAiBpD,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,oBAAoB,CAAC;IA4B5D,qBAAqB,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,oBAAoB,CAAC;IAkCrE,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAI5C,iBAAiB,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAYzC,kBAAkB,IAAI,OAAO,CAAC;QAClC,SAAS,EAAE,MAAM,CAAC;QAClB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,gBAAgB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAC1C,CAAC;YAwBY,oBAAoB;IAUlC,OAAO,CAAC,qBAAqB;IAiC7B,OAAO,CAAC,kBAAkB;IAU1B,OAAO,CAAC,YAAY;IAIpB,OAAO,CAAC,yBAAyB;IAejC,OAAO,CAAC,yBAAyB;IAWjC,uBAAuB,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM;IAoB9D,qBAAqB,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAYtF,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC;CAoB3E"}

package/dist/cli/services/data/semantic-graph/services/graph-query-service.js

@@ -0,0 +1,285 @@
+"use strict";
+/**
+ * Graph Query Service
+ * SOLID Principles: Single Responsibility - Handle graph querying and analysis only
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphQueryService = void 0;
+const logger_1 = require("../../../../../utils/logger");
+class GraphQueryService {
+    storageService;
+    qualityAnalyzer;
+    logger = logger_1.Logger.getInstance();
+    constructor(storageService, qualityAnalyzer) {
+        this.storageService = storageService;
+        this.qualityAnalyzer = qualityAnalyzer;
+    }
+    async searchNodes(query, context) {
+        try {
+            this.logger.debug(`🔍 Searching nodes with query: "${query}"`);
+            return await this.storageService.searchNodes(query, context);
+        }
+        catch (error) {
+            this.logger.error('Failed to search nodes:', error);
+            return {
+                nodes: [],
+                relationships: [],
+                stats: { totalResults: 0, relevantNodes: 0, searchTime: 0 }
+            };
+        }
+    }
+    async findRelatedNodes(nodeId, maxDepth = 2) {
+        try {
+            this.logger.debug(`🔗 Finding nodes related to ${nodeId} (depth: ${maxDepth})`);
+            return await this.storageService.findRelatedNodes(nodeId, maxDepth);
+        }
+        catch (error) {
+            this.logger.error(`Failed to find related nodes for ${nodeId}:`, error);
+            return [];
+        }
+    }
+    async findPathBetweenNodes(fromId, toId) {
+        try {
+            this.logger.debug(`🗺️ Finding path from ${fromId} to ${toId}`);
+            // This is a simplified implementation
+            // In a full implementation, this would use graph algorithms like Dijkstra
+            const fromRelated = await this.findRelatedNodes(fromId, 3);
+            const toRelated = await this.findRelatedNodes(toId, 3);
+            // Find common nodes as a simple path approximation
+            const commonNodes = fromRelated.filter(fromNode => toRelated.some(toNode => toNode.id === fromNode.id));
+            return commonNodes;
+        }
+        catch (error) {
+            this.logger.error(`Failed to find path between ${fromId} and ${toId}:`, error);
+            return [];
+        }
+    }
+    async getNodesByType(type) {
+        try {
+            this.logger.debug(`📋 Getting all nodes of type: ${type}`);
+            // Use search with type filter
+            const context = {
+                includeTypes: [type]
+            };
+            const result = await this.storageService.searchNodes('*', context);
+            return result.nodes;
+        }
+        catch (error) {
+            this.logger.error(`Failed to get nodes of type ${type}:`, error);
+            return [];
+        }
+    }
+    async analyzeImpact(nodeId) {
+        try {
+            this.logger.debug(`📊 Analyzing impact for node: ${nodeId}`);
+            const affectedNodes = await this.findRelatedNodes(nodeId, 3);
+            const relationships = await this.getNodeRelationships(nodeId);
+            // Categorize affected nodes
+            const impact = this.categorizeImpactNodes(affectedNodes);
+            const riskLevel = this.calculateRiskLevel(affectedNodes, impact);
+            return {
+                affectedNodes,
+                relationships,
+                impact,
+                riskLevel
+            };
+        }
+        catch (error) {
+            this.logger.error(`Failed to analyze impact for ${nodeId}:`, error);
+            return {
+                affectedNodes: [],
+                relationships: [],
+                impact: { codeFiles: 0, documentation: 0, tests: 0, uiComponents: 0 },
+                riskLevel: 'low'
+            };
+        }
+    }
+    async performCrossReference(concept) {
+        try {
+            this.logger.debug(`🔄 Performing cross-reference analysis for: ${concept}`);
+            // Search for the main concept
+            const searchResult = await this.searchNodes(concept);
+            const mainConcept = searchResult.nodes[0];
+            if (!mainConcept) {
+                return this.createEmptyCrossReference(concept);
+            }
+            // Find related nodes by category
+            const relatedNodes = await this.findRelatedNodes(mainConcept.id, 2);
+            const relatedCode = this.filterByType(relatedNodes, 'Code');
+            const relatedDocs = this.filterByType(relatedNodes, 'Documentation');
+            const relatedUI = this.filterByType(relatedNodes, 'UIComponent');
+            const relatedTests = this.filterByType(relatedNodes, 'TestCase');
+            return {
+                concept: mainConcept,
+                relatedCode,
+                relatedDocs,
+                relatedUI,
+                relatedTests
+            };
+        }
+        catch (error) {
+            this.logger.error(`Failed to perform cross-reference for ${concept}:`, error);
+            return this.createEmptyCrossReference(concept);
+        }
+    }
+    // Advanced query methods
+    async findBusinessConcepts() {
+        return this.getNodesByType('BusinessConcept');
+    }
+    async findOrphanedNodes() {
+        try {
+            // This would require a custom Cypher query to find nodes with no relationships
+            // For now, return empty array as placeholder
+            this.logger.debug('🔍 Finding orphaned nodes...');
+            return [];
+        }
+        catch (error) {
+            this.logger.error('Failed to find orphaned nodes:', error);
+            return [];
+        }
+    }
+    async getGraphStatistics() {
+        try {
+            const nodeCount = await this.storageService.getNodeCount?.() || 0;
+            const relationshipCount = await this.storageService.getRelationshipCount?.() || 0;
+            // Get type distribution
+            const allNodes = await this.searchNodes('*');
+            const typeDistribution = this.calculateTypeDistribution(allNodes.nodes);
+            return {
+                nodeCount,
+                relationshipCount,
+                typeDistribution
+            };
+        }
+        catch (error) {
+            this.logger.error('Failed to get graph statistics:', error);
+            return {
+                nodeCount: 0,
+                relationshipCount: 0,
+                typeDistribution: {}
+            };
+        }
+    }
+    async getNodeRelationships(nodeId) {
+        try {
+            // This is a placeholder - in a full implementation, this would query relationships
+            return [];
+        }
+        catch (error) {
+            this.logger.error(`Failed to get relationships for ${nodeId}:`, error);
+            return [];
+        }
+    }
+    categorizeImpactNodes(nodes) {
+        const impact = {
+            codeFiles: 0,
+            documentation: 0,
+            tests: 0,
+            uiComponents: 0
+        };
+        for (const node of nodes) {
+            switch (node.type) {
+                case 'Code':
+                    impact.codeFiles++;
+                    break;
+                case 'Documentation':
+                    impact.documentation++;
+                    break;
+                case 'TestCase':
+                    impact.tests++;
+                    break;
+                case 'UIComponent':
+                    impact.uiComponents++;
+                    break;
+            }
+        }
+        return impact;
+    }
+    calculateRiskLevel(nodes, impact) {
+        const totalAffected = nodes.length;
+        const criticalTypes = impact.codeFiles + impact.uiComponents;
+        if (totalAffected > 20 || criticalTypes > 10)
+            return 'critical';
+        if (totalAffected > 10 || criticalTypes > 5)
+            return 'high';
+        if (totalAffected > 5 || criticalTypes > 2)
+            return 'medium';
+        return 'low';
+    }
+    filterByType(nodes, type) {
+        return nodes.filter(node => node.type === type);
+    }
+    createEmptyCrossReference(concept) {
+        return {
+            concept: {
+                id: '',
+                type: 'BusinessConcept',
+                properties: { name: concept },
+                name: concept
+            },
+            relatedCode: [],
+            relatedDocs: [],
+            relatedUI: [],
+            relatedTests: []
+        };
+    }
+    calculateTypeDistribution(nodes) {
+        const distribution = {};
+        for (const node of nodes) {
+            distribution[node.type] = (distribution[node.type] || 0) + 1;
+        }
+        return distribution;
+    }
+    // Quality analysis integration
+    calculateRelevanceScore(node, keywords) {
+        if (this.qualityAnalyzer) {
+            return this.qualityAnalyzer.calculateRelevanceScore(node, keywords);
+        }
+        // Simple fallback scoring
+        const name = node.name?.toLowerCase() || '';
+        const description = node.properties?.description?.toLowerCase() || '';
+        let score = 0;
+        for (const keyword of keywords) {
+            const keywordLower = keyword.toLowerCase();
+            if (name.includes(keywordLower))
+                score += 10;
+            if (description.includes(keywordLower))
+                score += 5;
+        }
+        return Math.min(100, score);
+    }
+    // Additional methods required by interface
+    async performSemanticSearch(query, context) {
+        try {
+            this.logger.debug(`🔍 Performing semantic search: "${query}"`);
+            const result = await this.searchNodes(query, context);
+            // Return array of single result for now
+            return [result];
+        }
+        catch (error) {
+            this.logger.error(`Failed to perform semantic search:`, error);
+            return [];
+        }
+    }
+    async findCrossReferences(nodeId) {
+        try {
+            this.logger.debug(`🔗 Finding cross-references for node: ${nodeId}`);
+            const relatedNodes = await this.findRelatedNodes(nodeId, 2);
+            // Group related nodes by type and create cross-reference results
+            const crossRef = {
+                concept: relatedNodes[0] || { id: nodeId, type: 'BusinessConcept', properties: {}, name: nodeId },
+                relatedCode: this.filterByType(relatedNodes, 'Code'),
+                relatedDocs: this.filterByType(relatedNodes, 'Documentation'),
+                relatedUI: this.filterByType(relatedNodes, 'UIComponent'),
+                relatedTests: this.filterByType(relatedNodes, 'TestCase')
+            };
+            return [crossRef];
+        }
+        catch (error) {
+            this.logger.error(`Failed to find cross-references:`, error);
+            return [];
+        }
+    }
+}
+exports.GraphQueryService = GraphQueryService;
+//# sourceMappingURL=graph-query-service.js.map

package/dist/cli/services/data/semantic-graph/services/graph-query-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-query-service.js","sourceRoot":"","sources":["../../../../../../src/cli/services/data/semantic-graph/services/graph-query-service.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,wDAAqD;AAarD,MAAa,iBAAiB;IAIlB;IACA;IAJF,MAAM,GAAG,eAAM,CAAC,WAAW,EAAE,CAAC;IAEtC,YACU,cAAoC,EACpC,eAAkC;QADlC,mBAAc,GAAd,cAAc,CAAsB;QACpC,oBAAe,GAAf,eAAe,CAAmB;IACzC,CAAC;IAEJ,KAAK,CAAC,WAAW,CAAC,KAAa,EAAE,OAAuB;QACtD,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAmC,KAAK,GAAG,CAAC,CAAC;YAC/D,OAAO,MAAM,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC/D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,yBAAyB,EAAE,KAAK,CAAC,CAAC;YACpD,OAAO;gBACL,KAAK,EAAE,EAAE;gBACT,aAAa,EAAE,EAAE;gBACjB,KAAK,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;aAC5D,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,gBAAgB,CAAC,MAAc,EAAE,WAAmB,CAAC;QACzD,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,+BAA+B,MAAM,YAAY,QAAQ,GAAG,CAAC,CAAC;YAChF,OAAO,MAAM,IAAI,CAAC,cAAc,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACtE,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,oCAAoC,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC;YACxE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,oBAAoB,CAAC,MAAc,EAAE,IAAY;QACrD,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,yBAAyB,MAAM,OAAO,IAAI,EAAE,CAAC,CAAC;YAEhE,sCAAsC;YACtC,0EAA0E;YAC1E,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC3D,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAEvD,mDAAmD;YACnD,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAChD,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,CAAC,CACpD,CAAC;YAEF,OAAO,WAAW,CAAC;QACrB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,+BAA+B,MAAM,QAAQ,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YAC/E,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,IAAc;QACjC,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iCAAiC,IAAI,EAAE,CAAC,CAAC;YAE3D,8BAA8B;YAC9B,MAAM,OAAO,GAAkB;gBAC7B,YAAY,EAAE,CAAC,IAAI,CAAC;aACrB,CAAC;YAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;YACnE,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,+BAA+B,IAAI,GAAG,EAAE,KAAK,CAAC,CAAC;YACjE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,MAAc;QAChC,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iCAAiC,MAAM,EAAE,CAAC,CAAC;YAE7D,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;YAE9D,4BAA4B;YAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YACzD,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;YAEjE,OAAO;gBACL,aAAa;gBACb,aAAa;gBACb,MAAM;gBACN,SAAS;aACV,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,gCAAgC,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC;YACpE,OAAO;gBACL,aAAa,EAAE,EAAE;gBACjB,aAAa,EAAE,EAAE;gBACjB,MAAM,EAAE,EAAE,SAAS,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE;gBACrE,SAAS,EAAE,KAAK;aACjB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,qBAAqB,CAAC,OAAe;QACzC,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,+CAA+C,OAAO,EAAE,CAAC,CAAC;YAE5E,8BAA8B;YAC9B,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE1C,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YACjD,CAAC;YAED,iCAAiC;YACjC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAEpE,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;YAC5D,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;YACrE,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;YACjE,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAEjE,OAAO;gBACL,OAAO,EAAE,WAAW;gBACpB,WAAW;gBACX,WAAW;gBACX,SAAS;gBACT,YAAY;aACb,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,yCAAyC,OAAO,GAAG,EAAE,KAAK,CAAC,CAAC;YAC9E,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,KAAK,CAAC,oBAAoB;QACxB,OAAO,IAAI,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,iBAAiB;QACrB,IAAI,CAAC;YACH,+EAA+E;YAC/E,6CAA6C;YAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;YAClD,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC;YAC3D,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,kBAAkB;QAKtB,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,MAAO,IAAI,CAAC,cAAsB,CAAC,YAAY,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3E,MAAM,iBAAiB,GAAG,MAAO,IAAI,CAAC,cAAsB,CAAC,oBAAoB,EAAE,EAAE,IAAI,CAAC,CAAC;YAE3F,wBAAwB;YACxB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC7C,MAAM,gBAAgB,GAAG,IAAI,CAAC,yBAAyB,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YAExE,OAAO;gBACL,SAAS;gBACT,iBAAiB;gBACjB,gBAAgB;aACjB,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iCAAiC,EAAE,KAAK,CAAC,CAAC;YAC5D,OAAO;gBACL,SAAS,EAAE,CAAC;gBACZ,iBAAiB,EAAE,CAAC;gBACpB,gBAAgB,EAAE,EAAE;aACrB,CAAC;QACJ,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,oBAAoB,CAAC,MAAc;QAC/C,IAAI,CAAC;YACH,mFAAmF;YACnF,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAmC,MAAM,GAAG,EAAE,KAAK,CAAC,CAAC;YACvE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,qBAAqB,CAAC,KAAkB;QAM9C,MAAM,MAAM,GAAG;YACb,SAAS,EAAE,CAAC;YACZ,aAAa,EAAE,CAAC;YAChB,KAAK,EAAE,CAAC;YACR,YAAY,EAAE,CAAC;SAChB,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBAClB,KAAK,MAAM;oBACT,MAAM,CAAC,SAAS,EAAE,CAAC;oBACnB,MAAM;gBACR,KAAK,eAAe;oBAClB,MAAM,CAAC,aAAa,EAAE,CAAC;oBACvB,MAAM;gBACR,KAAK,UAAU;oBACb,MAAM,CAAC,KAAK,EAAE,CAAC;oBACf,MAAM;gBACR,KAAK,aAAa;oBAChB,MAAM,CAAC,YAAY,EAAE,CAAC;oBACtB,MAAM;YACV,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,kBAAkB,CAAC,KAAkB,EAAE,MAAW;QACxD,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC;QACnC,MAAM,aAAa,GAAG,MAAM,CAAC,SAAS,GAAG,MAAM,CAAC,YAAY,CAAC;QAE7D,IAAI,aAAa,GAAG,EAAE,IAAI,aAAa,GAAG,EAAE;YAAE,OAAO,UAAU,CAAC;QAChE,IAAI,aAAa,GAAG,EAAE,IAAI,aAAa,GAAG,CAAC;YAAE,OAAO,MAAM,CAAC;QAC3D,IAAI,aAAa,GAAG,CAAC,IAAI,aAAa,GAAG,CAAC;YAAE,OAAO,QAAQ,CAAC;QAC5D,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,YAAY,CAAC,KAAkB,EAAE,IAAc;QACrD,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAClD,CAAC;IAEO,yBAAyB,CAAC,OAAe;QAC/C,OAAO;YACL,OAAO,EAAE;gBACP,EAAE,EAAE,EAAE;gBACN,IAAI,EAAE,iBAAiB;gBACvB,UAAU,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE;gBAC7B,IAAI,EAAE,OAAO;aACd;YACD,WAAW,EAAE,EAAE;YACf,WAAW,EAAE,EAAE;YACf,SAAS,EAAE,EAAE;YACb,YAAY,EAAE,EAAE;SACjB,CAAC;IACJ,CAAC;IAEO,yBAAyB,CAAC,KAAkB;QAClD,MAAM,YAAY,GAA2B,EAAE,CAAC;QAEhD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/D,CAAC;QAED,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,+BAA+B;IAC/B,uBAAuB,CAAC,IAAe,EAAE,QAAkB;QACzD,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,eAAe,CAAC,uBAAuB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACtE,CAAC;QAED,0BAA0B;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;QAEtE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;YAC3C,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC;gBAAE,KAAK,IAAI,EAAE,CAAC;YAC7C,IAAI,WAAW,CAAC,QAAQ,CAAC,YAAY,CAAC;gBAAE,KAAK,IAAI,CAAC,CAAC;QACrD,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,2CAA2C;IAC3C,KAAK,CAAC,qBAAqB,CAAC,KAAa,EAAE,OAAuB;QAChE,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAmC,KAAK,GAAG,CAAC,CAAC;YAC/D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACtD,wCAAwC;YACxC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,oCAAoC,EAAE,KAAK,CAAC,CAAC;YAC/D,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,KAAK,CAAC,mBAAmB,CAAC,MAAc;QACtC,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,yCAAyC,MAAM,EAAE,CAAC,CAAC;YACrE,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAE5D,iEAAiE;YACjE,MAAM,QAAQ,GAAyB;gBACrC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,iBAAiB,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE;gBACjG,WAAW,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC;gBACpD,WAAW,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,eAAe,CAAC;gBAC7D,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,aAAa,CAAC;gBACzD,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,CAAC;aAC1D,CAAC;YAEF,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE,KAAK,CAAC,CAAC;YAC7D,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;CACF;AAvTD,8CAuTC"}

package/dist/cli/services/data/semantic-graph/services/graph-storage-service.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Graph Storage Service
+ * SOLID Principles: Single Responsibility - Handle Neo4j database operations only
+ */
+import { IGraphStorageService, NodeType, RelationshipType, GraphNode, SearchResult, SearchContext } from '../interfaces/index';
+export declare class GraphStorageService implements IGraphStorageService {
+    private driver;
+    private logger;
+    constructor(uri?: string, username?: string, password?: string);
+    initialize(): Promise<void>;
+    close(): Promise<void>;
+    addNode(type: NodeType, properties: Record<string, any>): Promise<string>;
+    addRelationship(fromId: string, toId: string, type: RelationshipType, properties?: Record<string, any>): Promise<void>;
+    batchCreateNodes(nodes: Array<{
+        type: NodeType;
+        properties: Record<string, any>;
+    }>): Promise<string[]>;
+    searchNodes(query: string, context?: SearchContext): Promise<SearchResult>;
+    findRelatedNodes(nodeId: string, maxDepth?: number): Promise<GraphNode[]>;
+    clearGraph(): Promise<void>;
+    getNodeCount(): Promise<number>;
+    getRelationshipCount(): Promise<number>;
+    private processBatch;
+    private extractSearchTerms;
+    private buildSearchQuery;
+    private processSearchResults;
+    private getRelationshipsForNodes;
+    private findRelatedNodesSimple;
+    /**
+     * Update a property on an existing node
+     * Used for adding external import information after node creation
+     */
+    updateNodeProperty(nodeId: string, propertyName: string, propertyValue: string): Promise<void>;
+}
+//# sourceMappingURL=graph-storage-service.d.ts.map

package/dist/cli/services/data/semantic-graph/services/graph-storage-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-storage-service.d.ts","sourceRoot":"","sources":["../../../../../../src/cli/services/data/semantic-graph/services/graph-storage-service.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EACL,oBAAoB,EACpB,QAAQ,EACR,gBAAgB,EAChB,SAAS,EACT,YAAY,EACZ,aAAa,EACd,MAAM,qBAAqB,CAAC;AAE7B,qBAAa,mBAAoB,YAAW,oBAAoB;IAC9D,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,MAAM,CAAwB;gBAGpC,GAAG,GAAE,MAAgC,EACrC,QAAQ,GAAE,MAAgB,EAC1B,QAAQ,GAAE,MAAwB;IAO9B,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAU3B,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IAkBzE,eAAe,CACnB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,IAAI,EAAE,gBAAgB,EACtB,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAC/B,OAAO,CAAC,IAAI,CAAC;IAgBV,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,QAAQ,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAA;KAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAsBtG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,CAAC;IAyC1E,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAoC5E,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAc3B,YAAY,IAAI,OAAO,CAAC,MAAM,CAAC;IAa/B,oBAAoB,IAAI,OAAO,CAAC,MAAM,CAAC;YAa/B,YAAY;IAmB1B,OAAO,CAAC,kBAAkB;IAQ1B,OAAO,CAAC,gBAAgB;IA6CxB,OAAO,CAAC,oBAAoB;YASd,wBAAwB;YAuBxB,sBAAsB;IAqBpC;;;OAGG;IACG,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAcrG"}