@danielsimonjr/memory-mcp 12.2.3 → 12.5.2

package/dist/search/SearchSuggestions.js

@@ -1,57 +0,0 @@
-/**
- * Search Suggestions
- *
- * Provides "did you mean?" suggestions using Levenshtein distance.
- *
- * @module search/SearchSuggestions
- */
-import { levenshteinDistance } from '../utils/index.js';
-/**
- * Generates search suggestions based on entity names and types.
- */
-export class SearchSuggestions {
-    storage;
-    constructor(storage) {
-        this.storage = storage;
-    }
-    /**
-     * Get "did you mean?" suggestions for a query.
-     *
-     * Returns similar entity names and types that might be what the user intended.
-     * Excludes exact matches (similarity < 1.0) and very dissimilar strings (similarity > 0.5).
-     *
-     * @param query - The search query
-     * @param maxSuggestions - Maximum number of suggestions to return (default 5)
-     * @returns Array of suggested entity/type names sorted by similarity
-     */
-    async getSearchSuggestions(query, maxSuggestions = 5) {
-        const graph = await this.storage.loadGraph();
-        const queryLower = query.toLowerCase();
-        const suggestions = [];
-        // Check entity names
-        for (const entity of graph.entities) {
-            const distance = levenshteinDistance(queryLower, entity.name.toLowerCase());
-            const maxLength = Math.max(queryLower.length, entity.name.length);
-            const similarity = 1 - distance / maxLength;
-            if (similarity > 0.5 && similarity < 1.0) {
-                // Not exact match but similar
-                suggestions.push({ text: entity.name, similarity });
-            }
-        }
-        // Check entity types
-        const uniqueTypes = [...new Set(graph.entities.map(e => e.entityType))];
-        for (const type of uniqueTypes) {
-            const distance = levenshteinDistance(queryLower, type.toLowerCase());
-            const maxLength = Math.max(queryLower.length, type.length);
-            const similarity = 1 - distance / maxLength;
-            if (similarity > 0.5 && similarity < 1.0) {
-                suggestions.push({ text: type, similarity });
-            }
-        }
-        // Sort by similarity and return top suggestions
-        return suggestions
-            .sort((a, b) => b.similarity - a.similarity)
-            .slice(0, maxSuggestions)
-            .map(s => s.text);
-    }
-}

package/dist/search/SemanticSearch.d.ts

@@ -1,146 +0,0 @@
-/**
- * Semantic Search Manager
- *
- * Phase 4 Sprint 12: Orchestrates embedding service and vector store
- * to provide semantic similarity search capabilities.
- *
- * @module search/SemanticSearch
- */
-import type { Entity, EmbeddingService, IVectorStore, SemanticSearchResult, SemanticIndexOptions, ReadonlyKnowledgeGraph } from '../types/index.js';
-/**
- * Convert an entity to a text representation for embedding.
- *
- * Creates a structured text that captures the entity's key information
- * for generating meaningful embeddings.
- *
- * @param entity - Entity to convert
- * @returns Text representation suitable for embedding
- */
-export declare function entityToText(entity: Entity): string;
-/**
- * Semantic Search Manager
- *
- * Provides semantic similarity search by converting entities to embeddings
- * and storing them in a vector store. Supports search by query text and
- * finding similar entities.
- *
- * @example
- * ```typescript
- * const semanticSearch = new SemanticSearch(embeddingService, vectorStore);
- * await semanticSearch.indexAll(graph);
- * const results = await semanticSearch.search(graph, "machine learning");
- * ```
- */
-export declare class SemanticSearch {
-    /** Embedding service for generating vectors */
-    private embeddingService;
-    /** Vector store for storing and searching embeddings */
-    private vectorStore;
-    /** Whether embeddings have been indexed */
-    private indexed;
-    /** Number of entities currently indexed */
-    private indexedCount;
-    /**
-     * Create a semantic search manager.
-     *
-     * @param embeddingService - Service for generating embeddings
-     * @param vectorStore - Store for vector storage and search
-     */
-    constructor(embeddingService: EmbeddingService, vectorStore?: IVectorStore);
-    /**
-     * Index all entities in the knowledge graph.
-     *
-     * Generates embeddings for all entities and stores them in the vector store.
-     * Can be called incrementally - only indexes entities that aren't already indexed.
-     *
-     * @param graph - Knowledge graph to index
-     * @param options - Indexing options
-     * @returns Index statistics
-     */
-    indexAll(graph: ReadonlyKnowledgeGraph, options?: SemanticIndexOptions): Promise<{
-        indexed: number;
-        skipped: number;
-        errors: number;
-    }>;
-    /**
-     * Index a single entity.
-     *
-     * @param entity - Entity to index
-     * @returns True if indexed successfully
-     */
-    indexEntity(entity: Entity): Promise<boolean>;
-    /**
-     * Remove an entity from the index.
-     *
-     * @param entityName - Name of entity to remove
-     * @returns True if found and removed
-     */
-    removeEntity(entityName: string): boolean;
-    /**
-     * Search for entities semantically similar to a query.
-     *
-     * @param graph - Knowledge graph to search in
-     * @param query - Search query text
-     * @param limit - Maximum number of results (default: 10)
-     * @param minSimilarity - Minimum similarity threshold (default: 0)
-     * @returns Array of search results with similarity scores
-     */
-    search(graph: ReadonlyKnowledgeGraph, query: string, limit?: number, minSimilarity?: number): Promise<SemanticSearchResult[]>;
-    /**
-     * Find entities similar to a given entity.
-     *
-     * @param graph - Knowledge graph to search in
-     * @param entityName - Name of entity to find similar entities for
-     * @param limit - Maximum number of results (default: 10)
-     * @param minSimilarity - Minimum similarity threshold (default: 0)
-     * @returns Array of search results with similarity scores
-     */
-    findSimilar(graph: ReadonlyKnowledgeGraph, entityName: string, limit?: number, minSimilarity?: number): Promise<SemanticSearchResult[]>;
-    /**
-     * Get the embedding service.
-     *
-     * @returns Embedding service instance
-     */
-    getEmbeddingService(): EmbeddingService;
-    /**
-     * Get the vector store.
-     *
-     * @returns Vector store instance
-     */
-    getVectorStore(): IVectorStore;
-    /**
-     * Check if the index has been built.
-     *
-     * @returns True if indexAll has been called
-     */
-    isIndexed(): boolean;
-    /**
-     * Get the number of indexed entities.
-     *
-     * @returns Number of entities in the vector store
-     */
-    getIndexedCount(): number;
-    /**
-     * Clear all indexed embeddings.
-     */
-    clearIndex(): void;
-    /**
-     * Check if semantic search is available.
-     *
-     * @returns True if embedding service is ready
-     */
-    isAvailable(): Promise<boolean>;
-    /**
-     * Get semantic search statistics.
-     *
-     * @returns Statistics about the semantic search index
-     */
-    getStats(): {
-        indexed: boolean;
-        indexedCount: number;
-        provider: string;
-        model: string;
-        dimensions: number;
-    };
-}
-//# sourceMappingURL=SemanticSearch.d.ts.map

package/dist/search/SemanticSearch.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SemanticSearch.d.ts","sourceRoot":"","sources":["../../src/search/SemanticSearch.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EACV,MAAM,EACN,gBAAgB,EAChB,YAAY,EACZ,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACvB,MAAM,mBAAmB,CAAC;AAI3B;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAkBnD;AAED;;;;;;;;;;;;;GAaG;AACH,qBAAa,cAAc;IACzB,+CAA+C;IAC/C,OAAO,CAAC,gBAAgB,CAAmB;IAE3C,wDAAwD;IACxD,OAAO,CAAC,WAAW,CAAe;IAElC,2CAA2C;IAC3C,OAAO,CAAC,OAAO,CAAS;IAExB,2CAA2C;IAC3C,OAAO,CAAC,YAAY,CAAK;IAEzB;;;;;OAKG;gBACS,gBAAgB,EAAE,gBAAgB,EAAE,WAAW,CAAC,EAAE,YAAY;IAK1E;;;;;;;;;OASG;IACG,QAAQ,CACZ,KAAK,EAAE,sBAAsB,EAC7B,OAAO,GAAE,oBAAyB,GACjC,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IA8DhE;;;;;OAKG;IACG,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAYnD;;;;;OAKG;IACH,YAAY,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAQzC;;;;;;;;OAQG;IACG,MAAM,CACV,KAAK,EAAE,sBAAsB,EAC7B,KAAK,EAAE,MAAM,EACb,KAAK,GAAE,MAA6C,EACpD,aAAa,GAAE,MAA8C,GAC5D,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAsClC;;;;;;;;OAQG;IACG,WAAW,CACf,KAAK,EAAE,sBAAsB,EAC7B,UAAU,EAAE,MAAM,EAClB,KAAK,GAAE,MAA6C,EACpD,aAAa,GAAE,MAA8C,GAC5D,OAAO,CAAC,oBAAoB,EAAE,CAAC;IAoDlC;;;;OAIG;IACH,mBAAmB,IAAI,gBAAgB;IAIvC;;;;OAIG;IACH,cAAc,IAAI,YAAY;IAI9B;;;;OAIG;IACH,SAAS,IAAI,OAAO;IAIpB;;;;OAIG;IACH,eAAe,IAAI,MAAM;IAIzB;;OAEG;IACH,UAAU,IAAI,IAAI;IAMlB;;;;OAIG;IACG,WAAW,IAAI,OAAO,CAAC,OAAO,CAAC;IAIrC;;;;OAIG;IACH,QAAQ,IAAI;QACV,OAAO,EAAE,OAAO,CAAC;QACjB,YAAY,EAAE,MAAM,CAAC;QACrB,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,UAAU,EAAE,MAAM,CAAC;KACpB;CASF"}

package/dist/search/SemanticSearch.js

@@ -1,313 +0,0 @@
-/**
- * Semantic Search Manager
- *
- * Phase 4 Sprint 12: Orchestrates embedding service and vector store
- * to provide semantic similarity search capabilities.
- *
- * @module search/SemanticSearch
- */
-import { InMemoryVectorStore } from './VectorStore.js';
-import { EMBEDDING_DEFAULTS, SEMANTIC_SEARCH_LIMITS } from '../utils/constants.js';
-/**
- * Convert an entity to a text representation for embedding.
- *
- * Creates a structured text that captures the entity's key information
- * for generating meaningful embeddings.
- *
- * @param entity - Entity to convert
- * @returns Text representation suitable for embedding
- */
-export function entityToText(entity) {
-    const parts = [];
-    // Name and type are most important
-    parts.push(`${entity.name} (${entity.entityType})`);
-    // Add observations (limited to prevent overly long text)
-    if (entity.observations.length > 0) {
-        const observationText = entity.observations.slice(0, 10).join('. ');
-        parts.push(observationText);
-    }
-    // Add tags if present
-    if (entity.tags && entity.tags.length > 0) {
-        parts.push(`Tags: ${entity.tags.join(', ')}`);
-    }
-    return parts.join('\n');
-}
-/**
- * Semantic Search Manager
- *
- * Provides semantic similarity search by converting entities to embeddings
- * and storing them in a vector store. Supports search by query text and
- * finding similar entities.
- *
- * @example
- * ```typescript
- * const semanticSearch = new SemanticSearch(embeddingService, vectorStore);
- * await semanticSearch.indexAll(graph);
- * const results = await semanticSearch.search(graph, "machine learning");
- * ```
- */
-export class SemanticSearch {
-    /** Embedding service for generating vectors */
-    embeddingService;
-    /** Vector store for storing and searching embeddings */
-    vectorStore;
-    /** Whether embeddings have been indexed */
-    indexed = false;
-    /** Number of entities currently indexed */
-    indexedCount = 0;
-    /**
-     * Create a semantic search manager.
-     *
-     * @param embeddingService - Service for generating embeddings
-     * @param vectorStore - Store for vector storage and search
-     */
-    constructor(embeddingService, vectorStore) {
-        this.embeddingService = embeddingService;
-        this.vectorStore = vectorStore || new InMemoryVectorStore();
-    }
-    /**
-     * Index all entities in the knowledge graph.
-     *
-     * Generates embeddings for all entities and stores them in the vector store.
-     * Can be called incrementally - only indexes entities that aren't already indexed.
-     *
-     * @param graph - Knowledge graph to index
-     * @param options - Indexing options
-     * @returns Index statistics
-     */
-    async indexAll(graph, options = {}) {
-        const { forceReindex = false, onProgress, batchSize = EMBEDDING_DEFAULTS.DEFAULT_BATCH_SIZE, } = options;
-        let indexed = 0;
-        let skipped = 0;
-        let errors = 0;
-        const entities = graph.entities;
-        const total = entities.length;
-        // Collect entities to index
-        const toIndex = [];
-        for (const entity of entities) {
-            if (forceReindex || !this.vectorStore.has(entity.name)) {
-                toIndex.push(entity);
-            }
-            else {
-                skipped++;
-            }
-        }
-        // Process in batches
-        for (let i = 0; i < toIndex.length; i += batchSize) {
-            const batch = toIndex.slice(i, i + batchSize);
-            const texts = batch.map(entityToText);
-            try {
-                const embeddings = await this.embeddingService.embedBatch(texts);
-                for (let j = 0; j < batch.length; j++) {
-                    this.vectorStore.add(batch[j].name, embeddings[j]);
-                    indexed++;
-                }
-            }
-            catch (error) {
-                // Try individual embeddings on batch failure
-                for (const entity of batch) {
-                    try {
-                        const text = entityToText(entity);
-                        const embedding = await this.embeddingService.embed(text);
-                        this.vectorStore.add(entity.name, embedding);
-                        indexed++;
-                    }
-                    catch {
-                        errors++;
-                    }
-                }
-            }
-            // Report progress
-            if (onProgress) {
-                onProgress(indexed + skipped + errors, total);
-            }
-        }
-        this.indexed = true;
-        this.indexedCount = this.vectorStore.size();
-        return { indexed, skipped, errors };
-    }
-    /**
-     * Index a single entity.
-     *
-     * @param entity - Entity to index
-     * @returns True if indexed successfully
-     */
-    async indexEntity(entity) {
-        try {
-            const text = entityToText(entity);
-            const embedding = await this.embeddingService.embed(text);
-            this.vectorStore.add(entity.name, embedding);
-            this.indexedCount = this.vectorStore.size();
-            return true;
-        }
-        catch {
-            return false;
-        }
-    }
-    /**
-     * Remove an entity from the index.
-     *
-     * @param entityName - Name of entity to remove
-     * @returns True if found and removed
-     */
-    removeEntity(entityName) {
-        const removed = this.vectorStore.remove(entityName);
-        if (removed) {
-            this.indexedCount = this.vectorStore.size();
-        }
-        return removed;
-    }
-    /**
-     * Search for entities semantically similar to a query.
-     *
-     * @param graph - Knowledge graph to search in
-     * @param query - Search query text
-     * @param limit - Maximum number of results (default: 10)
-     * @param minSimilarity - Minimum similarity threshold (default: 0)
-     * @returns Array of search results with similarity scores
-     */
-    async search(graph, query, limit = SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT, minSimilarity = SEMANTIC_SEARCH_LIMITS.MIN_SIMILARITY) {
-        // Ensure limit is within bounds
-        const effectiveLimit = Math.min(limit, SEMANTIC_SEARCH_LIMITS.MAX_LIMIT);
-        // Generate embedding for query
-        const queryEmbedding = await this.embeddingService.embed(query);
-        // Search vector store
-        const vectorResults = this.vectorStore.search(queryEmbedding, effectiveLimit * 2); // Get extra for filtering
-        // Convert to SemanticSearchResult with entity lookup
-        const entityMap = new Map();
-        for (const entity of graph.entities) {
-            entityMap.set(entity.name, entity);
-        }
-        const results = [];
-        for (const result of vectorResults) {
-            if (result.score < minSimilarity) {
-                continue;
-            }
-            const entity = entityMap.get(result.name);
-            if (entity) {
-                results.push({
-                    entity,
-                    similarity: result.score,
-                });
-            }
-            if (results.length >= effectiveLimit) {
-                break;
-            }
-        }
-        return results;
-    }
-    /**
-     * Find entities similar to a given entity.
-     *
-     * @param graph - Knowledge graph to search in
-     * @param entityName - Name of entity to find similar entities for
-     * @param limit - Maximum number of results (default: 10)
-     * @param minSimilarity - Minimum similarity threshold (default: 0)
-     * @returns Array of search results with similarity scores
-     */
-    async findSimilar(graph, entityName, limit = SEMANTIC_SEARCH_LIMITS.DEFAULT_LIMIT, minSimilarity = SEMANTIC_SEARCH_LIMITS.MIN_SIMILARITY) {
-        // Get the entity's embedding
-        const embedding = this.vectorStore.get(entityName);
-        if (!embedding) {
-            // Try to find and index the entity
-            const entity = graph.entities.find(e => e.name === entityName);
-            if (entity) {
-                await this.indexEntity(entity);
-                return this.findSimilar(graph, entityName, limit, minSimilarity);
-            }
-            return [];
-        }
-        // Ensure limit is within bounds
-        const effectiveLimit = Math.min(limit, SEMANTIC_SEARCH_LIMITS.MAX_LIMIT);
-        // Search vector store (request extra to filter out self)
-        const vectorResults = this.vectorStore.search(embedding, effectiveLimit + 1);
-        // Convert to SemanticSearchResult with entity lookup
-        const entityMap = new Map();
-        for (const entity of graph.entities) {
-            entityMap.set(entity.name, entity);
-        }
-        const results = [];
-        for (const result of vectorResults) {
-            // Skip self
-            if (result.name === entityName) {
-                continue;
-            }
-            if (result.score < minSimilarity) {
-                continue;
-            }
-            const entity = entityMap.get(result.name);
-            if (entity) {
-                results.push({
-                    entity,
-                    similarity: result.score,
-                });
-            }
-            if (results.length >= effectiveLimit) {
-                break;
-            }
-        }
-        return results;
-    }
-    /**
-     * Get the embedding service.
-     *
-     * @returns Embedding service instance
-     */
-    getEmbeddingService() {
-        return this.embeddingService;
-    }
-    /**
-     * Get the vector store.
-     *
-     * @returns Vector store instance
-     */
-    getVectorStore() {
-        return this.vectorStore;
-    }
-    /**
-     * Check if the index has been built.
-     *
-     * @returns True if indexAll has been called
-     */
-    isIndexed() {
-        return this.indexed;
-    }
-    /**
-     * Get the number of indexed entities.
-     *
-     * @returns Number of entities in the vector store
-     */
-    getIndexedCount() {
-        return this.indexedCount;
-    }
-    /**
-     * Clear all indexed embeddings.
-     */
-    clearIndex() {
-        this.vectorStore.clear();
-        this.indexed = false;
-        this.indexedCount = 0;
-    }
-    /**
-     * Check if semantic search is available.
-     *
-     * @returns True if embedding service is ready
-     */
-    async isAvailable() {
-        return this.embeddingService.isReady();
-    }
-    /**
-     * Get semantic search statistics.
-     *
-     * @returns Statistics about the semantic search index
-     */
-    getStats() {
-        return {
-            indexed: this.indexed,
-            indexedCount: this.indexedCount,
-            provider: this.embeddingService.provider,
-            model: this.embeddingService.model,
-            dimensions: this.embeddingService.dimensions,
-        };
-    }
-}

package/dist/search/TFIDFIndexManager.d.ts

@@ -1,63 +0,0 @@
-/**
- * TF-IDF Index Manager
- *
- * Manages pre-calculated TF-IDF indexes for fast ranked search.
- * Handles index building, incremental updates, and persistence.
- *
- * @module search/TFIDFIndexManager
- */
-import type { TFIDFIndex, KnowledgeGraph, ReadonlyKnowledgeGraph } from '../types/index.js';
-/**
- * Manages TF-IDF index lifecycle: building, updating, and persistence.
- */
-export declare class TFIDFIndexManager {
-    private indexPath;
-    private index;
-    constructor(storageDir: string);
-    /**
-     * Build a complete TF-IDF index from a knowledge graph.
-     *
-     * @param graph - Knowledge graph to index
-     * @returns Newly built TF-IDF index
-     */
-    buildIndex(graph: ReadonlyKnowledgeGraph): Promise<TFIDFIndex>;
-    /**
-     * Update the index incrementally when entities change.
-     *
-     * More efficient than rebuilding the entire index.
-     *
-     * @param graph - Updated knowledge graph
-     * @param changedEntityNames - Names of entities that changed
-     */
-    updateIndex(graph: ReadonlyKnowledgeGraph, changedEntityNames: Set<string>): Promise<TFIDFIndex>;
-    /**
-     * Load index from disk.
-     *
-     * @returns Loaded index or null if not found
-     */
-    loadIndex(): Promise<TFIDFIndex | null>;
-    /**
-     * Save index to disk.
-     *
-     * @param index - Index to save (uses cached index if not provided)
-     */
-    saveIndex(index?: TFIDFIndex): Promise<void>;
-    /**
-     * Get the current cached index.
-     *
-     * @returns Cached index or null if not loaded
-     */
-    getIndex(): TFIDFIndex | null;
-    /**
-     * Clear the cached index and delete from disk.
-     */
-    clearIndex(): Promise<void>;
-    /**
-     * Check if the index needs rebuilding based on graph state.
-     *
-     * @param graph - Current knowledge graph
-     * @returns True if index should be rebuilt
-     */
-    needsRebuild(graph: KnowledgeGraph): boolean;
-}
-//# sourceMappingURL=TFIDFIndexManager.d.ts.map

package/dist/search/TFIDFIndexManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TFIDFIndexManager.d.ts","sourceRoot":"","sources":["../../src/search/TFIDFIndexManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,KAAK,EAAE,UAAU,EAAkB,cAAc,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AAgB5G;;GAEG;AACH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,KAAK,CAA2B;gBAE5B,UAAU,EAAE,MAAM;IAI9B;;;;;OAKG;IACG,UAAU,CAAC,KAAK,EAAE,sBAAsB,GAAG,OAAO,CAAC,UAAU,CAAC;IAgDpE;;;;;;;OAOG;IACG,WAAW,CAAC,KAAK,EAAE,sBAAsB,EAAE,kBAAkB,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC;IAgEtG;;;;OAIG;IACG,SAAS,IAAI,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC;IAmB7C;;;;OAIG;IACG,SAAS,CAAC,KAAK,CAAC,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBlD;;;;OAIG;IACH,QAAQ,IAAI,UAAU,GAAG,IAAI;IAI7B;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IASjC;;;;;OAKG;IACH,YAAY,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO;CAmB7C"}