@danielsimonjr/memoryjs 1.0.0

package/dist/search/SearchManager.js

@@ -0,0 +1,454 @@
+/**
+ * Search Manager
+ *
+ * Orchestrates all search types (basic, ranked, boolean, fuzzy).
+ * Focused on search operations only (Phase 4: Consolidate God Objects).
+ *
+ * @module search/SearchManager
+ */
+import { BasicSearch } from './BasicSearch.js';
+import { RankedSearch } from './RankedSearch.js';
+import { BooleanSearch } from './BooleanSearch.js';
+import { FuzzySearch } from './FuzzySearch.js';
+import { SearchSuggestions } from './SearchSuggestions.js';
+import { SavedSearchManager } from './SavedSearchManager.js';
+import { QueryCostEstimator } from './QueryCostEstimator.js';
+/**
+ * Unified search manager providing access to all search types.
+ *
+ * Phase 4 Sprint 5: Manages search caches across all search types.
+ */
+export class SearchManager {
+    basicSearch;
+    rankedSearch;
+    booleanSearcher;
+    fuzzySearcher;
+    searchSuggestions;
+    savedSearchManager;
+    storage;
+    queryEstimator;
+    constructor(storage, savedSearchesFilePath) {
+        this.storage = storage;
+        this.basicSearch = new BasicSearch(storage);
+        this.rankedSearch = new RankedSearch(storage);
+        this.booleanSearcher = new BooleanSearch(storage);
+        this.fuzzySearcher = new FuzzySearch(storage);
+        this.searchSuggestions = new SearchSuggestions(storage);
+        this.savedSearchManager = new SavedSearchManager(savedSearchesFilePath, this.basicSearch);
+        this.queryEstimator = new QueryCostEstimator();
+    }
+    // ==================== Cache Management (Phase 4 Sprint 5) ====================
+    /**
+     * Phase 4 Sprint 5: Clear all search caches.
+     *
+     * Clears caches in all search types: fuzzy, boolean, and ranked token cache.
+     * Call this when the graph has been modified to ensure fresh results.
+     */
+    clearAllCaches() {
+        this.fuzzySearcher.clearCache();
+        this.booleanSearcher.clearCache();
+        this.rankedSearch.clearTokenCache();
+    }
+    /**
+     * Phase 4 Sprint 5: Clear fuzzy search cache.
+     */
+    clearFuzzyCache() {
+        this.fuzzySearcher.clearCache();
+    }
+    /**
+     * Phase 4 Sprint 5: Clear boolean search cache.
+     */
+    clearBooleanCache() {
+        this.booleanSearcher.clearCache();
+    }
+    /**
+     * Phase 4 Sprint 5: Clear ranked search token cache.
+     */
+    clearRankedCache() {
+        this.rankedSearch.clearTokenCache();
+    }
+    // ==================== Basic Search ====================
+    /**
+     * Perform a simple text-based search across entity names and observations.
+     *
+     * This is the primary search method that searches through entity names,
+     * observations, and types using case-insensitive substring matching.
+     * Optionally filter by tags and importance range.
+     *
+     * @param query - Text to search for (case-insensitive, searches names/observations/types)
+     * @param tags - Optional array of tags to filter results (lowercase)
+     * @param minImportance - Optional minimum importance value (0-10)
+     * @param maxImportance - Optional maximum importance value (0-10)
+     * @returns KnowledgeGraph containing matching entities and their relations
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Simple text search
+     * const results = await manager.searchNodes('Alice');
+     *
+     * // Search with tag filter
+     * const engineeringResults = await manager.searchNodes('project', ['engineering']);
+     *
+     * // Search with importance range
+     * const importantResults = await manager.searchNodes('critical', undefined, 8, 10);
+     *
+     * // Combined filters
+     * const filtered = await manager.searchNodes('bug', ['backend'], 5, 10);
+     * ```
+     */
+    async searchNodes(query, tags, minImportance, maxImportance) {
+        return this.basicSearch.searchNodes(query, tags, minImportance, maxImportance);
+    }
+    /**
+     * Open specific nodes by name.
+     *
+     * @param names - Array of entity names
+     * @returns Knowledge graph with specified entities
+     */
+    async openNodes(names) {
+        return this.basicSearch.openNodes(names);
+    }
+    /**
+     * Search by date range.
+     *
+     * @param startDate - Optional start date (ISO 8601)
+     * @param endDate - Optional end date (ISO 8601)
+     * @param entityType - Optional entity type filter
+     * @param tags - Optional tags filter
+     * @returns Filtered knowledge graph
+     */
+    async searchByDateRange(startDate, endDate, entityType, tags) {
+        return this.basicSearch.searchByDateRange(startDate, endDate, entityType, tags);
+    }
+    // ==================== Ranked Search ====================
+    /**
+     * Perform TF-IDF ranked search with relevance scoring.
+     *
+     * Uses Term Frequency-Inverse Document Frequency algorithm to rank results
+     * by relevance to the query. Results are sorted by score (highest first).
+     * This is ideal for finding the most relevant entities for a search query.
+     *
+     * @param query - Search query (analyzed for term frequency)
+     * @param tags - Optional array of tags to filter results (lowercase)
+     * @param minImportance - Optional minimum importance value (0-10)
+     * @param maxImportance - Optional maximum importance value (0-10)
+     * @param limit - Maximum number of results to return (default: 50, max: 200)
+     * @returns Array of SearchResult objects sorted by relevance score (descending)
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Basic ranked search
+     * const results = await manager.searchNodesRanked('machine learning algorithms');
+     * results.forEach(r => {
+     *   console.log(`${r.entity.name} (score: ${r.score})`);
+     * });
+     *
+     * // Limit to top 10 most relevant results
+     * const top10 = await manager.searchNodesRanked('database optimization', undefined, undefined, undefined, 10);
+     *
+     * // Ranked search with filters
+     * const relevantImportant = await manager.searchNodesRanked(
+     *   'security vulnerability',
+     *   ['security', 'critical'],
+     *   8,
+     *   10,
+     *   20
+     * );
+     * ```
+     */
+    async searchNodesRanked(query, tags, minImportance, maxImportance, limit) {
+        return this.rankedSearch.searchNodesRanked(query, tags, minImportance, maxImportance, limit);
+    }
+    // ==================== Boolean Search ====================
+    /**
+     * Perform boolean search with AND, OR, NOT operators.
+     *
+     * Supports complex boolean logic for precise search queries.
+     * Use AND/OR/NOT operators (case-insensitive) to combine search terms.
+     * Parentheses are supported for grouping.
+     *
+     * @param query - Boolean query string (e.g., "alice AND bob", "frontend OR backend NOT legacy")
+     * @param tags - Optional array of tags to filter results (lowercase)
+     * @param minImportance - Optional minimum importance value (0-10)
+     * @param maxImportance - Optional maximum importance value (0-10)
+     * @returns KnowledgeGraph containing entities matching the boolean expression
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // AND operator - entities matching all terms
+     * const both = await manager.booleanSearch('database AND performance');
+     *
+     * // OR operator - entities matching any term
+     * const either = await manager.booleanSearch('frontend OR backend');
+     *
+     * // NOT operator - exclude terms
+     * const excluding = await manager.booleanSearch('API NOT deprecated');
+     *
+     * // Complex queries with grouping
+     * const complex = await manager.booleanSearch('(react OR vue) AND (component OR hook) NOT legacy');
+     * ```
+     */
+    async booleanSearch(query, tags, minImportance, maxImportance) {
+        return this.booleanSearcher.booleanSearch(query, tags, minImportance, maxImportance);
+    }
+    // ==================== Fuzzy Search ====================
+    /**
+     * Perform fuzzy search with typo tolerance.
+     *
+     * Uses Levenshtein distance to find entities that approximately match the query,
+     * making it ideal for handling typos and variations in spelling.
+     * Higher threshold values require closer matches.
+     *
+     * @param query - Search query (will match approximate spellings)
+     * @param threshold - Similarity threshold from 0.0 (very lenient) to 1.0 (exact match). Default: 0.7
+     * @param tags - Optional array of tags to filter results (lowercase)
+     * @param minImportance - Optional minimum importance value (0-10)
+     * @param maxImportance - Optional maximum importance value (0-10)
+     * @returns KnowledgeGraph containing entities with similar names/observations
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Find entities even with typos
+     * const results = await manager.fuzzySearch('databse'); // Will match "database"
+     *
+     * // Adjust threshold for strictness
+     * const strict = await manager.fuzzySearch('optmization', 0.9); // Requires very close match
+     * const lenient = await manager.fuzzySearch('optmization', 0.6); // More tolerant of differences
+     *
+     * // Fuzzy search with filters
+     * const filtered = await manager.fuzzySearch('secrity', 0.7, ['important'], 7, 10);
+     * ```
+     */
+    async fuzzySearch(query, threshold, tags, minImportance, maxImportance) {
+        return this.fuzzySearcher.fuzzySearch(query, threshold, tags, minImportance, maxImportance);
+    }
+    // ==================== Search Suggestions ====================
+    /**
+     * Get search suggestions for a query.
+     *
+     * @param query - Search query
+     * @param maxSuggestions - Maximum suggestions to return
+     * @returns Array of suggested terms
+     */
+    async getSearchSuggestions(query, maxSuggestions) {
+        return this.searchSuggestions.getSearchSuggestions(query, maxSuggestions);
+    }
+    // ==================== Saved Searches ====================
+    /**
+     * Save a search query for later reuse.
+     *
+     * Saved searches store query parameters and can be re-executed later.
+     * The system tracks usage count and last used timestamp automatically.
+     *
+     * @param search - Search parameters (name, query, and optional filters)
+     * @returns Newly created SavedSearch object with metadata
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Save a simple search
+     * const saved = await manager.saveSearch({
+     *   name: 'High Priority Bugs',
+     *   query: 'bug',
+     *   tags: ['critical'],
+     *   minImportance: 8
+     * });
+     *
+     * // Save a complex search
+     * await manager.saveSearch({
+     *   name: 'Recent Frontend Work',
+     *   query: 'component OR hook',
+     *   tags: ['frontend', 'react'],
+     *   searchType: 'boolean'
+     * });
+     * ```
+     */
+    async saveSearch(search) {
+        return this.savedSearchManager.saveSearch(search);
+    }
+    /**
+     * List all saved searches.
+     *
+     * @returns Array of saved searches
+     */
+    async listSavedSearches() {
+        return this.savedSearchManager.listSavedSearches();
+    }
+    /**
+     * Get a saved search by name.
+     *
+     * @param name - Search name
+     * @returns Saved search or null
+     */
+    async getSavedSearch(name) {
+        return this.savedSearchManager.getSavedSearch(name);
+    }
+    /**
+     * Execute a saved search by name.
+     *
+     * Runs a previously saved search with its stored parameters.
+     * Automatically updates the search's useCount and lastUsed timestamp.
+     *
+     * @param name - The unique name of the saved search to execute
+     * @returns KnowledgeGraph containing the search results
+     * @throws Error if saved search not found
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Execute a saved search
+     * const results = await manager.executeSavedSearch('High Priority Bugs');
+     * console.log(`Found ${results.entities.length} high priority bugs`);
+     *
+     * // Handle missing saved search
+     * try {
+     *   await manager.executeSavedSearch('NonExistent');
+     * } catch (error) {
+     *   console.error('Search not found');
+     * }
+     * ```
+     */
+    async executeSavedSearch(name) {
+        return this.savedSearchManager.executeSavedSearch(name);
+    }
+    /**
+     * Delete a saved search.
+     *
+     * @param name - Search name
+     * @returns True if deleted
+     */
+    async deleteSavedSearch(name) {
+        return this.savedSearchManager.deleteSavedSearch(name);
+    }
+    /**
+     * Update a saved search.
+     *
+     * @param name - Search name
+     * @param updates - Fields to update
+     * @returns Updated saved search
+     */
+    async updateSavedSearch(name, updates) {
+        return this.savedSearchManager.updateSavedSearch(name, updates);
+    }
+    // ==================== Phase 10 Sprint 4: Automatic Search ====================
+    /**
+     * Phase 10 Sprint 4: Automatically select and execute the best search method.
+     *
+     * Analyzes the query and graph size to determine the optimal search method,
+     * then executes it and returns both the results and the selection reasoning.
+     *
+     * @param query - The search query
+     * @param limit - Maximum number of results (default: 10)
+     * @returns AutoSearchResult with selected method, results, and estimates
+     *
+     * @example
+     * ```typescript
+     * const manager = new SearchManager(storage, savedSearchesPath);
+     *
+     * // Let the system choose the best search method
+     * const result = await manager.autoSearch('software engineer skills');
+     *
+     * console.log(`Used ${result.selectedMethod} because: ${result.selectionReason}`);
+     * console.log(`Found ${result.results.length} results in ${result.executionTimeMs}ms`);
+     * ```
+     */
+    async autoSearch(query, limit = 10) {
+        const startTime = Date.now();
+        // Get entity count from graph
+        const graph = await this.storage.loadGraph();
+        const entityCount = graph.entities.length;
+        // Get cost estimates for all methods
+        const estimates = this.queryEstimator.estimateAllMethods(query, entityCount);
+        // Get the recommended method
+        const recommendation = this.queryEstimator.recommendMethod(query, entityCount);
+        const selectedMethod = recommendation.method;
+        const selectionReason = recommendation.reason;
+        // Execute the selected search method
+        let results;
+        switch (selectedMethod) {
+            case 'basic': {
+                const basicResult = await this.basicSearch.searchNodes(query);
+                results = basicResult.entities.map((e, idx) => ({
+                    entity: e,
+                    score: 1.0 - idx * 0.01, // Rank by position
+                    matchedFields: { name: true, observations: e.observations },
+                }));
+                break;
+            }
+            case 'ranked': {
+                results = await this.rankedSearch.searchNodesRanked(query, undefined, undefined, undefined, limit);
+                break;
+            }
+            case 'boolean': {
+                const booleanResult = await this.booleanSearcher.booleanSearch(query);
+                results = booleanResult.entities.map((e, idx) => ({
+                    entity: e,
+                    score: 1.0 - idx * 0.01, // Rank by position
+                    matchedFields: { name: true, observations: e.observations },
+                }));
+                break;
+            }
+            case 'fuzzy': {
+                const fuzzyResult = await this.fuzzySearcher.fuzzySearch(query);
+                results = fuzzyResult.entities.map((e, idx) => ({
+                    entity: e,
+                    score: 1.0 - idx * 0.01, // Rank by position
+                    matchedFields: { name: true, observations: e.observations },
+                }));
+                break;
+            }
+            case 'semantic': {
+                // Semantic search not available through SearchManager
+                // Fall back to ranked search
+                results = await this.rankedSearch.searchNodesRanked(query, undefined, undefined, undefined, limit);
+                break;
+            }
+            default: {
+                const _exhaustiveCheck = selectedMethod;
+                throw new Error(`Unknown search method: ${_exhaustiveCheck}`);
+            }
+        }
+        // Limit results
+        const limitedResults = results.slice(0, limit);
+        return {
+            selectedMethod,
+            selectionReason,
+            estimates,
+            results: limitedResults,
+            executionTimeMs: Date.now() - startTime,
+        };
+    }
+    /**
+     * Phase 10 Sprint 4: Get cost estimates for all search methods.
+     *
+     * Useful for clients that want to display cost information or
+     * make their own method selection decisions.
+     *
+     * @param query - The search query
+     * @returns Array of cost estimates for all methods
+     */
+    async getSearchCostEstimates(query) {
+        const graph = await this.storage.loadGraph();
+        const entityCount = graph.entities.length;
+        return this.queryEstimator.estimateAllMethods(query, entityCount);
+    }
+    /**
+     * Phase 10 Sprint 4: Get the query cost estimator instance.
+     *
+     * @returns The QueryCostEstimator instance
+     */
+    getQueryEstimator() {
+        return this.queryEstimator;
+    }
+}
+//# sourceMappingURL=SearchManager.js.map

package/dist/search/SearchManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SearchManager.js","sourceRoot":"","sources":["../../src/search/SearchManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAE7D;;;;GAIG;AACH,MAAM,OAAO,aAAa;IAChB,WAAW,CAAc;IACzB,YAAY,CAAe;IAC3B,eAAe,CAAgB;IAC/B,aAAa,CAAc;IAC3B,iBAAiB,CAAoB;IACrC,kBAAkB,CAAqB;IACvC,OAAO,CAAe;IACtB,cAAc,CAAqB;IAE3C,YAAY,OAAqB,EAAE,qBAA6B;QAC9D,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,CAAC,eAAe,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,CAAC,iBAAiB,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;QACxD,IAAI,CAAC,kBAAkB,GAAG,IAAI,kBAAkB,CAAC,qBAAqB,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAC1F,IAAI,CAAC,cAAc,GAAG,IAAI,kBAAkB,EAAE,CAAC;IACjD,CAAC;IAED,gFAAgF;IAEhF;;;;;OAKG;IACH,cAAc;QACZ,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,eAAe;QACb,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,IAAI,CAAC,YAAY,CAAC,eAAe,EAAE,CAAC;IACtC,CAAC;IAED,yDAAyD;IAEzD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,KAAK,CAAC,WAAW,CACf,KAAa,EACb,IAAe,EACf,aAAsB,EACtB,aAAsB;QAEtB,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;IACjF,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS,CAAC,KAAe;QAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,iBAAiB,CACrB,SAAkB,EAClB,OAAgB,EAChB,UAAmB,EACnB,IAAe;QAEf,OAAO,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IAClF,CAAC;IAED,0DAA0D;IAE1D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoCG;IACH,KAAK,CAAC,iBAAiB,CACrB,KAAa,EACb,IAAe,EACf,aAAsB,EACtB,aAAsB,EACtB,KAAc;QAEd,OAAO,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;IAC/F,CAAC;IAED,2DAA2D;IAE3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,KAAK,CAAC,aAAa,CACjB,KAAa,EACb,IAAe,EACf,aAAsB,EACtB,aAAsB;QAEtB,OAAO,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;IACvF,CAAC;IAED,yDAAyD;IAEzD;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,KAAK,CAAC,WAAW,CACf,KAAa,EACb,SAAkB,EAClB,IAAe,EACf,aAAsB,EACtB,aAAsB;QAEtB,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;IAC9F,CAAC;IAED,+DAA+D;IAE/D;;;;;;OAMG;IACH,KAAK,CAAC,oBAAoB,CAAC,KAAa,EAAE,cAAuB;QAC/D,OAAO,IAAI,CAAC,iBAAiB,CAAC,oBAAoB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;IAC5E,CAAC;IAED,2DAA2D;IAE3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACH,KAAK,CAAC,UAAU,CACd,MAAgE;QAEhE,OAAO,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,iBAAiB;QACrB,OAAO,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,cAAc,CAAC,IAAY;QAC/B,OAAO,IAAI,CAAC,kBAAkB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,KAAK,CAAC,kBAAkB,CAAC,IAAY;QACnC,OAAO,IAAI,CAAC,kBAAkB,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,iBAAiB,CAAC,IAAY;QAClC,OAAO,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,iBAAiB,CACrB,IAAY,EACZ,OAAmF;QAEnF,OAAO,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAClE,CAAC;IAED,gFAAgF;IAEhF;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,KAAK,CAAC,UAAU,CAAC,KAAa,EAAE,QAAgB,EAAE;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,8BAA8B;QAC9B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAE1C,qCAAqC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAE7E,6BAA6B;QAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;QAC/E,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC;QAC7C,MAAM,eAAe,GAAG,cAAc,CAAC,MAAM,CAAC;QAE9C,qCAAqC;QACrC,IAAI,OAAuB,CAAC;QAE5B,QAAQ,cAAc,EAAE,CAAC;YACvB,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAC9D,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC;oBAC9D,MAAM,EAAE,CAAC;oBACT,KAAK,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,mBAAmB;oBAC5C,aAAa,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE;iBAC5D,CAAC,CAAC,CAAC;gBACJ,MAAM;YACR,CAAC;YAED,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gBACnG,MAAM;YACR,CAAC;YAED,KAAK,SAAS,CAAC,CAAC,CAAC;gBACf,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACtE,OAAO,GAAG,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC;oBAChE,MAAM,EAAE,CAAC;oBACT,KAAK,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,mBAAmB;oBAC5C,aAAa,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE;iBAC5D,CAAC,CAAC,CAAC;gBACJ,MAAM;YACR,CAAC;YAED,KAAK,OAAO,CAAC,CAAC,CAAC;gBACb,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChE,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAS,EAAE,GAAW,EAAE,EAAE,CAAC,CAAC;oBAC9D,MAAM,EAAE,CAAC;oBACT,KAAK,EAAE,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE,mBAAmB;oBAC5C,aAAa,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC,YAAY,EAAE;iBAC5D,CAAC,CAAC,CAAC;gBACJ,MAAM;YACR,CAAC;YAED,KAAK,UAAU,CAAC,CAAC,CAAC;gBAChB,sDAAsD;gBACtD,6BAA6B;gBAC7B,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;gBACnG,MAAM;YACR,CAAC;YAED,OAAO,CAAC,CAAC,CAAC;gBACR,MAAM,gBAAgB,GAAU,cAAc,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,0BAA0B,gBAAgB,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,gBAAgB;QAChB,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAE/C,OAAO;YACL,cAAc;YACd,eAAe;YACf,SAAS;YACT,OAAO,EAAE,cAAc;YACvB,eAAe,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;SACxC,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,sBAAsB,CAAC,KAAa;QACxC,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,WAAW,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC1C,OAAO,IAAI,CAAC,cAAc,CAAC,kBAAkB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACpE,CAAC;IAED;;;;OAIG;IACH,iBAAiB;QACf,OAAO,IAAI,CAAC,cAAc,CAAC;IAC7B,CAAC;CACF"}

package/dist/search/SearchSuggestions.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Search Suggestions
+ *
+ * Provides "did you mean?" suggestions using Levenshtein distance.
+ *
+ * @module search/SearchSuggestions
+ */
+import type { GraphStorage } from '../core/GraphStorage.js';
+/**
+ * Generates search suggestions based on entity names and types.
+ */
+export declare class SearchSuggestions {
+    private storage;
+    constructor(storage: GraphStorage);
+    /**
+     * 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
+     */
+    getSearchSuggestions(query: string, maxSuggestions?: number): Promise<string[]>;
+}
+//# sourceMappingURL=SearchSuggestions.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SearchSuggestions.d.ts","sourceRoot":"","sources":["../../src/search/SearchSuggestions.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAW5D;;GAEG;AACH,qBAAa,iBAAiB;IAChB,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,YAAY;IAEzC;;;;;;;;;OASG;IACG,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,GAAE,MAAU,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;CAoCzF"}

package/dist/search/SearchSuggestions.js

@@ -0,0 +1,58 @@
+/**
+ * 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);
+    }
+}
+//# sourceMappingURL=SearchSuggestions.js.map

package/dist/search/SearchSuggestions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SearchSuggestions.js","sourceRoot":"","sources":["../../src/search/SearchSuggestions.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AAUxD;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACR;IAApB,YAAoB,OAAqB;QAArB,YAAO,GAAP,OAAO,CAAc;IAAG,CAAC;IAE7C;;;;;;;;;OASG;IACH,KAAK,CAAC,oBAAoB,CAAC,KAAa,EAAE,iBAAyB,CAAC;QAClE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QAC7C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAEvC,MAAM,WAAW,GAAiB,EAAE,CAAC;QAErC,qBAAqB;QACrB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClE,MAAM,UAAU,GAAG,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;YAE5C,IAAI,UAAU,GAAG,GAAG,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBACzC,8BAA8B;gBAC9B,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,qBAAqB;QACrB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,mBAAmB,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YACrE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;YAE5C,IAAI,UAAU,GAAG,GAAG,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBACzC,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,OAAO,WAAW;aACf,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;CACF"}