codehere 0.1.1

package/dist/domain/services/knowledge-graph-builder.js

@@ -0,0 +1,268 @@
+/**
+ * Domain Service: KnowledgeGraphBuilder
+ * Builds knowledge graph from code, patterns, and memories
+ *
+ * Clean Architecture: Domain Layer
+ * Pattern: Builder Pattern
+ *
+ * Responsibilities:
+ * - Extract relationships from code (AST-based)
+ * - Extract relationships from patterns
+ * - Extract relationships from memories
+ * - Build graph incrementally
+ */
+import { randomUUID } from 'crypto';
+/**
+ * Knowledge Graph Builder Service
+ * Builds knowledge graph incrementally from various sources
+ */
+export class KnowledgeGraphBuilder {
+    graphRepository;
+    patternRepository;
+    memoryRepository;
+    constructor(graphRepository, patternRepository, memoryRepository) {
+        this.graphRepository = graphRepository;
+        this.patternRepository = patternRepository;
+        this.memoryRepository = memoryRepository;
+    }
+    /**
+     * Build knowledge graph from patterns, memories, and code
+     */
+    async buildGraph(request) {
+        const startTime = Date.now();
+        let nodesCreated = 0;
+        let edgesCreated = 0;
+        const sources = request.sources || {
+            patterns: true,
+            memories: true,
+            code: false, // Code analysis requires AST parsing - can be added later
+        };
+        // 1. Build from patterns
+        if (sources.patterns) {
+            const patternResult = await this.buildFromPatterns(request.codebaseId);
+            nodesCreated += patternResult.nodesCreated;
+            edgesCreated += patternResult.edgesCreated;
+        }
+        // 2. Build from memories
+        if (sources.memories) {
+            const memoryResult = await this.buildFromMemories(request.codebaseId);
+            nodesCreated += memoryResult.nodesCreated;
+            edgesCreated += memoryResult.edgesCreated;
+        }
+        // 3. Build relationships between patterns and memories
+        const relationshipResult = await this.buildPatternMemoryRelationships(request.codebaseId);
+        edgesCreated += relationshipResult.edgesCreated;
+        const buildTime = Date.now() - startTime;
+        return {
+            nodesCreated,
+            edgesCreated,
+            buildTime,
+        };
+    }
+    /**
+     * Build graph nodes and edges from patterns
+     */
+    async buildFromPatterns(codebaseId) {
+        const patterns = await this.patternRepository.findByCodebase(codebaseId);
+        let nodesCreated = 0;
+        let edgesCreated = 0;
+        for (const pattern of patterns) {
+            // Create pattern node
+            const patternNode = {
+                id: pattern.id || randomUUID(),
+                codebaseId,
+                type: 'pattern',
+                label: pattern.name,
+                content: pattern.description,
+                metadata: {
+                    source: 'pattern',
+                    sourceId: pattern.id,
+                    filepath: pattern.filepath,
+                    lineNumbers: pattern.lineNumbers,
+                    importance: pattern.metadata?.complexity || 5,
+                    confidence: pattern.metadata?.confidence || 5,
+                    tags: pattern.metadata?.tags,
+                },
+                createdAt: pattern.createdAt,
+                lastUpdated: pattern.lastUsed || pattern.createdAt,
+            };
+            await this.graphRepository.storeNode(patternNode);
+            nodesCreated++;
+            // Create pattern instance nodes if pattern has code examples
+            if (pattern.codeExample && pattern.filepath) {
+                const instanceNode = {
+                    id: randomUUID(),
+                    codebaseId,
+                    type: 'pattern-instance',
+                    label: `${pattern.name} Instance`,
+                    content: pattern.codeExample.substring(0, 500),
+                    metadata: {
+                        source: 'pattern',
+                        sourceId: pattern.id,
+                        filepath: pattern.filepath,
+                        lineNumbers: pattern.lineNumbers,
+                    },
+                    createdAt: pattern.createdAt,
+                    lastUpdated: pattern.createdAt,
+                };
+                await this.graphRepository.storeNode(instanceNode);
+                nodesCreated++;
+                // Create edge: pattern-instance follows pattern
+                const edge = {
+                    id: randomUUID(),
+                    fromNodeId: instanceNode.id,
+                    toNodeId: patternNode.id,
+                    type: 'follows',
+                    weight: 0.9,
+                    metadata: {
+                        confidence: 9,
+                        source: 'pattern',
+                        sourceId: pattern.id,
+                        filepath: pattern.filepath,
+                    },
+                    createdAt: pattern.createdAt,
+                };
+                await this.graphRepository.storeEdge(edge);
+                edgesCreated++;
+            }
+            // Create relationships between related patterns
+            if (pattern.metadata?.relatedPatterns && pattern.metadata.relatedPatterns.length > 0) {
+                for (const relatedPatternId of pattern.metadata.relatedPatterns) {
+                    const relatedPattern = await this.patternRepository.getById(relatedPatternId);
+                    if (relatedPattern && relatedPattern.codebaseId === codebaseId) {
+                        const edge = {
+                            id: randomUUID(),
+                            fromNodeId: patternNode.id,
+                            toNodeId: relatedPatternId,
+                            type: 'related-to',
+                            weight: 0.7,
+                            metadata: {
+                                confidence: 7,
+                                source: 'pattern',
+                                sourceId: pattern.id,
+                            },
+                            createdAt: new Date(),
+                        };
+                        await this.graphRepository.storeEdge(edge);
+                        edgesCreated++;
+                    }
+                }
+            }
+        }
+        return { nodesCreated, edgesCreated };
+    }
+    /**
+     * Build graph nodes and edges from memories
+     */
+    async buildFromMemories(codebaseId) {
+        const memories = await this.memoryRepository.getAllByCodebase(codebaseId);
+        let nodesCreated = 0;
+        let edgesCreated = 0;
+        for (const memory of memories) {
+            // Create memory node
+            const memoryNode = {
+                id: memory.id || randomUUID(),
+                codebaseId,
+                type: 'memory',
+                label: `Memory: ${memory.type}`,
+                content: memory.description,
+                metadata: {
+                    source: 'memory',
+                    sourceId: memory.id,
+                    filepath: memory.metadata?.filepath,
+                    importance: memory.importance,
+                },
+                createdAt: memory.timestamp,
+                lastUpdated: memory.lastAccessed,
+            };
+            await this.graphRepository.storeNode(memoryNode);
+            nodesCreated++;
+            // Create relationships between memories and patterns (if memory references patterns)
+            if (memory.metadata?.filepath) {
+                // Try to find related patterns
+                const relatedPatterns = await this.patternRepository.search(codebaseId, memory.description.substring(0, 100), 5);
+                for (const pattern of relatedPatterns) {
+                    if (pattern.id) {
+                        const edge = {
+                            id: randomUUID(),
+                            fromNodeId: memoryNode.id,
+                            toNodeId: pattern.id,
+                            type: 'references',
+                            weight: 0.6,
+                            metadata: {
+                                confidence: 6,
+                                source: 'memory',
+                                sourceId: memory.id,
+                            },
+                            createdAt: memory.timestamp,
+                        };
+                        await this.graphRepository.storeEdge(edge);
+                        edgesCreated++;
+                    }
+                }
+            }
+        }
+        return { nodesCreated, edgesCreated };
+    }
+    /**
+     * Build relationships between patterns and memories
+     */
+    async buildPatternMemoryRelationships(codebaseId) {
+        const patterns = await this.patternRepository.findByCodebase(codebaseId);
+        const memories = await this.memoryRepository.getAllByCodebase(codebaseId);
+        let edgesCreated = 0;
+        // Create relationships where memories mention patterns
+        for (const memory of memories) {
+            for (const pattern of patterns) {
+                if (pattern.name && memory.description.toLowerCase().includes(pattern.name.toLowerCase())) {
+                    if (memory.id && pattern.id) {
+                        const edge = {
+                            id: randomUUID(),
+                            fromNodeId: memory.id,
+                            toNodeId: pattern.id,
+                            type: 'references',
+                            weight: 0.7,
+                            metadata: {
+                                confidence: 7,
+                                source: 'memory',
+                                sourceId: memory.id,
+                            },
+                            createdAt: memory.timestamp,
+                        };
+                        await this.graphRepository.storeEdge(edge);
+                        edgesCreated++;
+                    }
+                }
+            }
+        }
+        return { edgesCreated };
+    }
+    /**
+     * Add a node to the graph
+     */
+    async addNode(node) {
+        await this.graphRepository.storeNode(node);
+    }
+    /**
+     * Add an edge to the graph
+     */
+    async addEdge(edge) {
+        await this.graphRepository.storeEdge(edge);
+    }
+    /**
+     * Update graph incrementally (add new patterns/memories)
+     */
+    async updateGraphIncremental(codebaseId) {
+        // Only build from new patterns and memories
+        return await this.buildGraph({
+            codebaseId,
+            codebasePath: '', // Not needed for incremental updates
+            sources: {
+                patterns: true,
+                memories: true,
+                code: false,
+            },
+        });
+    }
+}
+//# sourceMappingURL=knowledge-graph-builder.js.map

package/dist/domain/services/knowledge-graph-builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph-builder.js","sourceRoot":"","sources":["../../../src/domain/services/knowledge-graph-builder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAaH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAkBpC;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAEtB;IACA;IACA;IAHV,YACU,eAA0C,EAC1C,iBAAqC,EACrC,gBAAmC;QAFnC,oBAAe,GAAf,eAAe,CAA2B;QAC1C,sBAAiB,GAAjB,iBAAiB,CAAoB;QACrC,qBAAgB,GAAhB,gBAAgB,CAAmB;IAC1C,CAAC;IAEJ;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAA0B;QACzC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI;YACjC,QAAQ,EAAE,IAAI;YACd,QAAQ,EAAE,IAAI;YACd,IAAI,EAAE,KAAK,EAAE,0DAA0D;SACxE,CAAC;QAEF,yBAAyB;QACzB,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACvE,YAAY,IAAI,aAAa,CAAC,YAAY,CAAC;YAC3C,YAAY,IAAI,aAAa,CAAC,YAAY,CAAC;QAC7C,CAAC;QAED,yBAAyB;QACzB,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACtE,YAAY,IAAI,YAAY,CAAC,YAAY,CAAC;YAC1C,YAAY,IAAI,YAAY,CAAC,YAAY,CAAC;QAC5C,CAAC;QAED,uDAAuD;QACvD,MAAM,kBAAkB,GAAG,MAAM,IAAI,CAAC,+BAA+B,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC1F,YAAY,IAAI,kBAAkB,CAAC,YAAY,CAAC;QAEhD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAEzC,OAAO;YACL,YAAY;YACZ,YAAY;YACZ,SAAS;SACV,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB,CAAC,UAAkB;QAChD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QACzE,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,sBAAsB;YACtB,MAAM,WAAW,GAAkB;gBACjC,EAAE,EAAE,OAAO,CAAC,EAAE,IAAI,UAAU,EAAE;gBAC9B,UAAU;gBACV,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,OAAO,CAAC,IAAI;gBACnB,OAAO,EAAE,OAAO,CAAC,WAAW;gBAC5B,QAAQ,EAAE;oBACR,MAAM,EAAE,SAAS;oBACjB,QAAQ,EAAE,OAAO,CAAC,EAAE;oBACpB,QAAQ,EAAE,OAAO,CAAC,QAAQ;oBAC1B,WAAW,EAAE,OAAO,CAAC,WAAW;oBAChC,UAAU,EAAE,OAAO,CAAC,QAAQ,EAAE,UAAU,IAAI,CAAC;oBAC7C,UAAU,EAAE,OAAO,CAAC,QAAQ,EAAE,UAAU,IAAI,CAAC;oBAC7C,IAAI,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI;iBAC7B;gBACD,SAAS,EAAE,OAAO,CAAC,SAAS;gBAC5B,WAAW,EAAE,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,SAAS;aACnD,CAAC;YAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YAClD,YAAY,EAAE,CAAC;YAEf,6DAA6D;YAC7D,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAC5C,MAAM,YAAY,GAAkB;oBAClC,EAAE,EAAE,UAAU,EAAE;oBAChB,UAAU;oBACV,IAAI,EAAE,kBAAkB;oBACxB,KAAK,EAAE,GAAG,OAAO,CAAC,IAAI,WAAW;oBACjC,OAAO,EAAE,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC9C,QAAQ,EAAE;wBACR,MAAM,EAAE,SAAS;wBACjB,QAAQ,EAAE,OAAO,CAAC,EAAE;wBACpB,QAAQ,EAAE,OAAO,CAAC,QAAQ;wBAC1B,WAAW,EAAE,OAAO,CAAC,WAAW;qBACjC;oBACD,SAAS,EAAE,OAAO,CAAC,SAAS;oBAC5B,WAAW,EAAE,OAAO,CAAC,SAAS;iBAC/B,CAAC;gBAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;gBACnD,YAAY,EAAE,CAAC;gBAEf,gDAAgD;gBAChD,MAAM,IAAI,GAAkB;oBAC1B,EAAE,EAAE,UAAU,EAAE;oBAChB,UAAU,EAAE,YAAY,CAAC,EAAE;oBAC3B,QAAQ,EAAE,WAAW,CAAC,EAAE;oBACxB,IAAI,EAAE,SAAS;oBACf,MAAM,EAAE,GAAG;oBACX,QAAQ,EAAE;wBACR,UAAU,EAAE,CAAC;wBACb,MAAM,EAAE,SAAS;wBACjB,QAAQ,EAAE,OAAO,CAAC,EAAE;wBACpB,QAAQ,EAAE,OAAO,CAAC,QAAQ;qBAC3B;oBACD,SAAS,EAAE,OAAO,CAAC,SAAS;iBAC7B,CAAC;gBAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC3C,YAAY,EAAE,CAAC;YACjB,CAAC;YAED,gDAAgD;YAChD,IAAI,OAAO,CAAC,QAAQ,EAAE,eAAe,IAAI,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrF,KAAK,MAAM,gBAAgB,IAAI,OAAO,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC;oBAChE,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;oBAC9E,IAAI,cAAc,IAAI,cAAc,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;wBAC/D,MAAM,IAAI,GAAkB;4BAC1B,EAAE,EAAE,UAAU,EAAE;4BAChB,UAAU,EAAE,WAAW,CAAC,EAAE;4BAC1B,QAAQ,EAAE,gBAAgB;4BAC1B,IAAI,EAAE,YAAY;4BAClB,MAAM,EAAE,GAAG;4BACX,QAAQ,EAAE;gCACR,UAAU,EAAE,CAAC;gCACb,MAAM,EAAE,SAAS;gCACjB,QAAQ,EAAE,OAAO,CAAC,EAAE;6BACrB;4BACD,SAAS,EAAE,IAAI,IAAI,EAAE;yBACtB,CAAC;wBAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBAC3C,YAAY,EAAE,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,iBAAiB,CAAC,UAAkB;QAChD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,qBAAqB;YACrB,MAAM,UAAU,GAAkB;gBAChC,EAAE,EAAE,MAAM,CAAC,EAAE,IAAI,UAAU,EAAE;gBAC7B,UAAU;gBACV,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,WAAW,MAAM,CAAC,IAAI,EAAE;gBAC/B,OAAO,EAAE,MAAM,CAAC,WAAW;gBAC3B,QAAQ,EAAE;oBACR,MAAM,EAAE,QAAQ;oBAChB,QAAQ,EAAE,MAAM,CAAC,EAAE;oBACnB,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,QAAQ;oBACnC,UAAU,EAAE,MAAM,CAAC,UAAU;iBAC9B;gBACD,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,WAAW,EAAE,MAAM,CAAC,YAAY;aACjC,CAAC;YAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACjD,YAAY,EAAE,CAAC;YAEf,qFAAqF;YACrF,IAAI,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC;gBAC9B,+BAA+B;gBAC/B,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,MAAM,CACzD,UAAU,EACV,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EACpC,CAAC,CACF,CAAC;gBAEF,KAAK,MAAM,OAAO,IAAI,eAAe,EAAE,CAAC;oBACtC,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;wBACf,MAAM,IAAI,GAAkB;4BAC1B,EAAE,EAAE,UAAU,EAAE;4BAChB,UAAU,EAAE,UAAU,CAAC,EAAE;4BACzB,QAAQ,EAAE,OAAO,CAAC,EAAE;4BACpB,IAAI,EAAE,YAAY;4BAClB,MAAM,EAAE,GAAG;4BACX,QAAQ,EAAE;gCACR,UAAU,EAAE,CAAC;gCACb,MAAM,EAAE,QAAQ;gCAChB,QAAQ,EAAE,MAAM,CAAC,EAAE;6BACpB;4BACD,SAAS,EAAE,MAAM,CAAC,SAAS;yBAC5B,CAAC;wBAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBAC3C,YAAY,EAAE,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC;IACxC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,+BAA+B,CAAC,UAAkB;QAC9D,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QACzE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,uDAAuD;QACvD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;oBAC1F,IAAI,MAAM,CAAC,EAAE,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;wBAC5B,MAAM,IAAI,GAAkB;4BAC1B,EAAE,EAAE,UAAU,EAAE;4BAChB,UAAU,EAAE,MAAM,CAAC,EAAE;4BACrB,QAAQ,EAAE,OAAO,CAAC,EAAE;4BACpB,IAAI,EAAE,YAAY;4BAClB,MAAM,EAAE,GAAG;4BACX,QAAQ,EAAE;gCACR,UAAU,EAAE,CAAC;gCACb,MAAM,EAAE,QAAQ;gCAChB,QAAQ,EAAE,MAAM,CAAC,EAAE;6BACpB;4BACD,SAAS,EAAE,MAAM,CAAC,SAAS;yBAC5B,CAAC;wBAEF,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBAC3C,YAAY,EAAE,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,YAAY,EAAE,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,IAAmB;QAC/B,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,IAAmB;QAC/B,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,sBAAsB,CAAC,UAAkB;QAC7C,4CAA4C;QAC5C,OAAO,MAAM,IAAI,CAAC,UAAU,CAAC;YAC3B,UAAU;YACV,YAAY,EAAE,EAAE,EAAE,qCAAqC;YACvD,OAAO,EAAE;gBACP,QAAQ,EAAE,IAAI;gBACd,QAAQ,EAAE,IAAI;gBACd,IAAI,EAAE,KAAK;aACZ;SACF,CAAC,CAAC;IACL,CAAC;CACF"}

package/dist/domain/services/knowledge-graph-query.d.ts

@@ -0,0 +1,69 @@
+/**
+ * Domain Service: KnowledgeGraphQuery
+ * Query and analyze knowledge graph
+ *
+ * Clean Architecture: Domain Layer
+ *
+ * Responsibilities:
+ * - Find related patterns
+ * - Discover dependencies
+ * - Identify architectural relationships
+ * - Graph traversal and analysis
+ */
+import type { IKnowledgeGraphRepository } from '../interfaces/knowledge-graph-repository.interface.js';
+import type { KnowledgeNode, KnowledgeEdge, NodeType, RelationshipType } from '../entities/knowledge-node.js';
+export interface RelatedPatternsResult {
+    patterns: KnowledgeNode[];
+    relationships: KnowledgeEdge[];
+    path?: KnowledgeNode[];
+}
+export interface DependencyResult {
+    dependencies: KnowledgeNode[];
+    dependents: KnowledgeNode[];
+    depth: number;
+}
+/**
+ * Knowledge Graph Query Service
+ * Provides query and analysis capabilities for the knowledge graph
+ */
+export declare class KnowledgeGraphQuery {
+    private graphRepository;
+    constructor(graphRepository: IKnowledgeGraphRepository);
+    /**
+     * Find patterns related to a given pattern
+     */
+    findRelatedPatterns(patternId: string, maxDepth?: number): Promise<RelatedPatternsResult>;
+    /**
+     * Discover dependencies for a pattern or node
+     */
+    discoverDependencies(nodeId: string, maxDepth?: number): Promise<DependencyResult>;
+    /**
+     * Identify architectural relationships
+     */
+    identifyArchitecturalRelationships(codebaseId: string): Promise<{
+        layers: KnowledgeNode[][];
+        relationships: KnowledgeEdge[];
+    }>;
+    /**
+     * Find shortest path between two nodes
+     */
+    findPath(fromNodeId: string, toNodeId: string): Promise<KnowledgeNode[] | null>;
+    /**
+     * Get all nodes of a specific type
+     */
+    getNodesByType(codebaseId: string, type: NodeType): Promise<KnowledgeNode[]>;
+    /**
+     * Search nodes by query
+     */
+    searchNodes(codebaseId: string, query: string): Promise<KnowledgeNode[]>;
+    /**
+     * Get graph statistics
+     */
+    getGraphStatistics(codebaseId: string): Promise<{
+        nodeCount: number;
+        edgeCount: number;
+        nodeTypes: Record<NodeType, number>;
+        relationshipTypes: Record<RelationshipType, number>;
+    }>;
+}
+//# sourceMappingURL=knowledge-graph-query.d.ts.map

package/dist/domain/services/knowledge-graph-query.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph-query.d.ts","sourceRoot":"","sources":["../../../src/domain/services/knowledge-graph-query.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,uDAAuD,CAAC;AACvG,OAAO,KAAK,EACV,aAAa,EACb,aAAa,EACb,QAAQ,EACR,gBAAgB,EACjB,MAAM,+BAA+B,CAAC;AAEvC,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,aAAa,EAAE,CAAC;IAC1B,aAAa,EAAE,aAAa,EAAE,CAAC;IAC/B,IAAI,CAAC,EAAE,aAAa,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,aAAa,EAAE,CAAC;IAC9B,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;GAGG;AACH,qBAAa,mBAAmB;IAClB,OAAO,CAAC,eAAe;gBAAf,eAAe,EAAE,yBAAyB;IAE9D;;OAEG;IACG,mBAAmB,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,qBAAqB,CAAC;IA2BlG;;OAEG;IACG,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO,CAAC,gBAAgB,CAAC;IA+D3F;;OAEG;IACG,kCAAkC,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;QACpE,MAAM,EAAE,aAAa,EAAE,EAAE,CAAC;QAC1B,aAAa,EAAE,aAAa,EAAE,CAAC;KAChC,CAAC;IA4CF;;OAEG;IACG,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC;IAIrF;;OAEG;IACG,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAIlF;;OAEG;IACG,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAI9E;;OAEG;IACG,kBAAkB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC;QACpD,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACpC,iBAAiB,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAC;KACrD,CAAC;CAmBH"}

package/dist/domain/services/knowledge-graph-query.js

@@ -0,0 +1,187 @@
+/**
+ * Domain Service: KnowledgeGraphQuery
+ * Query and analyze knowledge graph
+ *
+ * Clean Architecture: Domain Layer
+ *
+ * Responsibilities:
+ * - Find related patterns
+ * - Discover dependencies
+ * - Identify architectural relationships
+ * - Graph traversal and analysis
+ */
+/**
+ * Knowledge Graph Query Service
+ * Provides query and analysis capabilities for the knowledge graph
+ */
+export class KnowledgeGraphQuery {
+    graphRepository;
+    constructor(graphRepository) {
+        this.graphRepository = graphRepository;
+    }
+    /**
+     * Find patterns related to a given pattern
+     */
+    async findRelatedPatterns(patternId, maxDepth = 2) {
+        // Get neighbors (directly connected patterns)
+        const neighbors = await this.graphRepository.getNeighbors(patternId, 'both');
+        // Filter to only pattern nodes
+        const patternNeighbors = neighbors.filter(n => n.type === 'pattern' || n.type === 'pattern-instance');
+        // Get edges connecting to these patterns
+        const edges = [];
+        for (const neighbor of patternNeighbors) {
+            if (neighbor.id) {
+                const fromEdges = await this.graphRepository.findEdgesFromNode(patternId);
+                const toEdges = await this.graphRepository.findEdgesToNode(patternId);
+                edges.push(...fromEdges, ...toEdges);
+            }
+        }
+        // Get nodes within N hops for deeper relationships
+        const nodesWithinHops = await this.graphRepository.getNodesWithinHops(patternId, maxDepth);
+        const relatedPatterns = nodesWithinHops.filter(n => n.type === 'pattern' || n.type === 'pattern-instance');
+        return {
+            patterns: relatedPatterns,
+            relationships: edges,
+        };
+    }
+    /**
+     * Discover dependencies for a pattern or node
+     */
+    async discoverDependencies(nodeId, maxDepth = 3) {
+        // Get outgoing edges (dependencies)
+        const outgoingEdges = await this.graphRepository.findEdgesFromNode(nodeId);
+        const dependencyIds = new Set();
+        for (const edge of outgoingEdges) {
+            if (edge.type === 'depends-on' || edge.type === 'uses' || edge.type === 'imports') {
+                dependencyIds.add(edge.toNodeId);
+            }
+        }
+        // Get incoming edges (dependents)
+        const incomingEdges = await this.graphRepository.findEdgesToNode(nodeId);
+        const dependentIds = new Set();
+        for (const edge of incomingEdges) {
+            if (edge.type === 'depends-on' || edge.type === 'uses' || edge.type === 'imports') {
+                dependentIds.add(edge.fromNodeId);
+            }
+        }
+        // Get nodes within maxDepth for transitive dependencies
+        const nodesWithinHops = await this.graphRepository.getNodesWithinHops(nodeId, maxDepth);
+        const allDependencyIds = new Set(dependencyIds);
+        const allDependentIds = new Set(dependentIds);
+        // Add transitive dependencies
+        for (const node of nodesWithinHops) {
+            if (node.id) {
+                const nodeEdges = await this.graphRepository.findEdgesFromNode(node.id);
+                for (const edge of nodeEdges) {
+                    if (edge.type === 'depends-on' || edge.type === 'uses') {
+                        allDependencyIds.add(edge.toNodeId);
+                    }
+                }
+            }
+        }
+        // Fetch dependency nodes
+        const dependencies = [];
+        for (const id of allDependencyIds) {
+            const node = await this.graphRepository.getNodeById(id);
+            if (node) {
+                dependencies.push(node);
+            }
+        }
+        // Fetch dependent nodes
+        const dependents = [];
+        for (const id of allDependentIds) {
+            const node = await this.graphRepository.getNodeById(id);
+            if (node) {
+                dependents.push(node);
+            }
+        }
+        return {
+            dependencies,
+            dependents,
+            depth: maxDepth,
+        };
+    }
+    /**
+     * Identify architectural relationships
+     */
+    async identifyArchitecturalRelationships(codebaseId) {
+        // Get all pattern nodes
+        const patterns = await this.graphRepository.findNodesByType(codebaseId, 'pattern');
+        // Group patterns by architectural layer (based on metadata or type)
+        const layers = [];
+        const architecturalPatterns = [];
+        const structuralPatterns = [];
+        const behavioralPatterns = [];
+        for (const pattern of patterns) {
+            if (pattern.type === 'pattern') {
+                // Categorize based on pattern metadata or content
+                if (pattern.content.toLowerCase().includes('architectural') ||
+                    pattern.content.toLowerCase().includes('architecture') ||
+                    pattern.content.toLowerCase().includes('layer')) {
+                    architecturalPatterns.push(pattern);
+                }
+                else if (pattern.content.toLowerCase().includes('structure') ||
+                    pattern.content.toLowerCase().includes('organization')) {
+                    structuralPatterns.push(pattern);
+                }
+                else {
+                    behavioralPatterns.push(pattern);
+                }
+            }
+        }
+        if (architecturalPatterns.length > 0)
+            layers.push(architecturalPatterns);
+        if (structuralPatterns.length > 0)
+            layers.push(structuralPatterns);
+        if (behavioralPatterns.length > 0)
+            layers.push(behavioralPatterns);
+        // Get relationships between architectural patterns
+        const relationships = [];
+        for (const pattern of architecturalPatterns) {
+            if (pattern.id) {
+                const edges = await this.graphRepository.findEdgesFromNode(pattern.id);
+                relationships.push(...edges.filter(e => e.type === 'depends-on' || e.type === 'uses' || e.type === 'implements'));
+            }
+        }
+        return { layers, relationships };
+    }
+    /**
+     * Find shortest path between two nodes
+     */
+    async findPath(fromNodeId, toNodeId) {
+        return await this.graphRepository.findShortestPath(fromNodeId, toNodeId);
+    }
+    /**
+     * Get all nodes of a specific type
+     */
+    async getNodesByType(codebaseId, type) {
+        return await this.graphRepository.findNodesByType(codebaseId, type);
+    }
+    /**
+     * Search nodes by query
+     */
+    async searchNodes(codebaseId, query) {
+        return await this.graphRepository.searchNodes(codebaseId, query);
+    }
+    /**
+     * Get graph statistics
+     */
+    async getGraphStatistics(codebaseId) {
+        const graph = await this.graphRepository.getGraphByCodebase(codebaseId);
+        if (!graph.metadata) {
+            return {
+                nodeCount: graph.nodes.length,
+                edgeCount: graph.edges.length,
+                nodeTypes: {},
+                relationshipTypes: {},
+            };
+        }
+        return {
+            nodeCount: graph.metadata.nodeCount,
+            edgeCount: graph.metadata.edgeCount,
+            nodeTypes: graph.metadata.nodeTypes,
+            relationshipTypes: graph.metadata.relationshipTypes,
+        };
+    }
+}
+//# sourceMappingURL=knowledge-graph-query.js.map

package/dist/domain/services/knowledge-graph-query.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph-query.js","sourceRoot":"","sources":["../../../src/domain/services/knowledge-graph-query.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAsBH;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACV;IAApB,YAAoB,eAA0C;QAA1C,oBAAe,GAAf,eAAe,CAA2B;IAAG,CAAC;IAElE;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,SAAiB,EAAE,WAAmB,CAAC;QAC/D,8CAA8C;QAC9C,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAE7E,+BAA+B;QAC/B,MAAM,gBAAgB,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC,CAAC;QAEtG,yCAAyC;QACzC,MAAM,KAAK,GAAoB,EAAE,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;gBAChB,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBAC1E,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;gBACtE,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,GAAG,OAAO,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,mDAAmD;QACnD,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,kBAAkB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAC3F,MAAM,eAAe,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB,CAAC,CAAC;QAE3G,OAAO;YACL,QAAQ,EAAE,eAAe;YACzB,aAAa,EAAE,KAAK;SACrB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB,CAAC,MAAc,EAAE,WAAmB,CAAC;QAC7D,oCAAoC;QACpC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC3E,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;QAExC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAClF,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnC,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACzE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QAEvC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAClF,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,kBAAkB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACxF,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;QAChD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;QAE9C,8BAA8B;QAC9B,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;gBACZ,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;oBAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;wBACvD,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACtC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,MAAM,YAAY,GAAoB,EAAE,CAAC;QACzC,KAAK,MAAM,EAAE,IAAI,gBAAgB,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACxD,IAAI,IAAI,EAAE,CAAC;gBACT,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,wBAAwB;QACxB,MAAM,UAAU,GAAoB,EAAE,CAAC;QACvC,KAAK,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;YACxD,IAAI,IAAI,EAAE,CAAC;gBACT,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,OAAO;YACL,YAAY;YACZ,UAAU;YACV,KAAK,EAAE,QAAQ;SAChB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kCAAkC,CAAC,UAAkB;QAIzD,wBAAwB;QACxB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAEnF,oEAAoE;QACpE,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,MAAM,qBAAqB,GAAoB,EAAE,CAAC;QAClD,MAAM,kBAAkB,GAAoB,EAAE,CAAC;QAC/C,MAAM,kBAAkB,GAAoB,EAAE,CAAC;QAE/C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC/B,kDAAkD;gBAClD,IAAI,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,eAAe,CAAC;oBACvD,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,cAAc,CAAC;oBACtD,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;oBACpD,qBAAqB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtC,CAAC;qBAAM,IAAI,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC;oBACnD,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC;oBAClE,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,CAAC;qBAAM,CAAC;oBACN,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QACzE,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACnE,IAAI,kBAAkB,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAEnE,mDAAmD;QACnD,MAAM,aAAa,GAAoB,EAAE,CAAC;QAC1C,KAAK,MAAM,OAAO,IAAI,qBAAqB,EAAE,CAAC;YAC5C,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC;gBACf,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACvE,aAAa,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACrC,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,YAAY,CACxE,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,UAAkB,EAAE,QAAgB;QACjD,OAAO,MAAM,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;IAC3E,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,UAAkB,EAAE,IAAc;QACrD,OAAO,MAAM,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACtE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,UAAkB,EAAE,KAAa;QACjD,OAAO,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CAAC,UAAkB;QAMzC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;QAExE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpB,OAAO;gBACL,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;gBAC7B,SAAS,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;gBAC7B,SAAS,EAAE,EAA8B;gBACzC,iBAAiB,EAAE,EAAsC;aAC1D,CAAC;QACJ,CAAC;QAED,OAAO;YACL,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS;YACnC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS;YACnC,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC,SAAS;YACnC,iBAAiB,EAAE,KAAK,CAAC,QAAQ,CAAC,iBAAiB;SACpD,CAAC;IACJ,CAAC;CACF"}

package/dist/domain/services/memory-retriever.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Domain Service: MemoryRetriever
+ * Retrieves relevant memories using 3-factor scoring + Graded Activation
+ * (Recency × Importance × Relevance × Activation)
+ *
+ * Pure domain logic - no external dependencies
+ */
+import type { Memory } from '../entities/memory.js';
+export declare class MemoryRetriever {
+    private readonly DECAY_CONSTANT;
+    private gradedActivation;
+    constructor();
+    /**
+     * Retrieve relevant memories with 3-factor scoring + graded activation
+     * @param memories - All available memories
+     * @param queryEmbedding - Pre-computed query embedding vector
+     * @param limit - Maximum number of memories to return
+     * @param useGradedActivation - Whether to apply g(t) function (default: true)
+     */
+    retrieve(memories: Memory[], queryEmbedding: number[], limit: number, useGradedActivation?: boolean): Memory[];
+    /**
+     * Calculate recency score (exponential decay)
+     */
+    private calculateRecency;
+    /**
+     * Calculate cosine similarity
+     */
+    private cosineSimilarity;
+}
+//# sourceMappingURL=memory-retriever.d.ts.map

package/dist/domain/services/memory-retriever.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-retriever.d.ts","sourceRoot":"","sources":["../../../src/domain/services/memory-retriever.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,uBAAuB,CAAC;AAGpD,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAY;IAC3C,OAAO,CAAC,gBAAgB,CAAyB;;IAMjD;;;;;;OAMG;IACH,QAAQ,CACN,QAAQ,EAAE,MAAM,EAAE,EAClB,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,EAAE,MAAM,EACb,mBAAmB,GAAE,OAAc,GAClC,MAAM,EAAE;IAsCX;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAMxB;;OAEG;IACH,OAAO,CAAC,gBAAgB;CAsBzB"}

package/dist/domain/services/memory-retriever.js

@@ -0,0 +1,82 @@
+/**
+ * Domain Service: MemoryRetriever
+ * Retrieves relevant memories using 3-factor scoring + Graded Activation
+ * (Recency × Importance × Relevance × Activation)
+ *
+ * Pure domain logic - no external dependencies
+ */
+import { GradedMemoryActivation } from './graded-memory-activation.js';
+export class MemoryRetriever {
+    DECAY_CONSTANT = 86400000; // 24 hours in ms
+    gradedActivation;
+    constructor() {
+        this.gradedActivation = new GradedMemoryActivation();
+    }
+    /**
+     * Retrieve relevant memories with 3-factor scoring + graded activation
+     * @param memories - All available memories
+     * @param queryEmbedding - Pre-computed query embedding vector
+     * @param limit - Maximum number of memories to return
+     * @param useGradedActivation - Whether to apply g(t) function (default: true)
+     */
+    retrieve(memories, queryEmbedding, limit, useGradedActivation = true) {
+        if (memories.length === 0) {
+            return [];
+        }
+        // Score each memory with 3-factor scoring
+        const scored = memories.map((memory) => {
+            const recency = this.calculateRecency(memory.lastAccessed);
+            const importance = memory.importance / 10; // Normalize to 0-1
+            const relevance = this.cosineSimilarity(queryEmbedding, memory.embedding);
+            const baseScore = recency * importance * relevance;
+            return { memory, baseScore };
+        });
+        // Apply graded activation if enabled
+        let finalScored;
+        if (useGradedActivation && memories.length > 10) {
+            // Use graded activation for strategic learning
+            finalScored = this.gradedActivation.applyGradedActivation(scored);
+        }
+        else {
+            finalScored = scored.map(({ memory, baseScore }) => ({
+                memory,
+                finalScore: baseScore,
+            }));
+        }
+        // Sort by final score and return top N
+        return finalScored
+            .sort((a, b) => b.finalScore - a.finalScore)
+            .slice(0, limit)
+            .map(({ memory }) => memory);
+    }
+    /**
+     * Calculate recency score (exponential decay)
+     */
+    calculateRecency(lastAccessed) {
+        const now = Date.now();
+        const timeSinceAccess = now - lastAccessed.getTime();
+        return Math.exp(-timeSinceAccess / this.DECAY_CONSTANT);
+    }
+    /**
+     * Calculate cosine similarity
+     */
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length) {
+            return 0;
+        }
+        let dotProduct = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dotProduct += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+        if (denominator === 0) {
+            return 0;
+        }
+        return dotProduct / denominator;
+    }
+}
+//# sourceMappingURL=memory-retriever.js.map