@danielsimonjr/memoryjs 1.0.0 → 1.2.0

package/dist/search/SearchFilterChain.js

@@ -1,186 +0,0 @@
-/**
- * Search Filter Chain
- *
- * Centralizes filter logic for all search implementations to eliminate
- * duplicate filtering code across BasicSearch, BooleanSearch, FuzzySearch,
- * and RankedSearch.
- *
- * @module search/SearchFilterChain
- */
-import { normalizeTags, hasMatchingTag, isWithinImportanceRange, validatePagination, applyPagination, } from '../utils/index.js';
-/**
- * Centralized filter chain for all search implementations.
- * Ensures consistent filtering behavior across search types.
- *
- * @example
- * ```typescript
- * const filters: SearchFilters = { tags: ['important'], minImportance: 5 };
- * const filtered = SearchFilterChain.applyFilters(entities, filters);
- * const pagination = SearchFilterChain.validatePagination(0, 50);
- * const result = SearchFilterChain.paginate(filtered, pagination);
- * ```
- */
-export class SearchFilterChain {
-    /**
-     * Applies all filters to an array of entities.
-     * Entities must pass ALL specified filters to be included.
-     *
-     * @param entities - Entities to filter
-     * @param filters - Filter criteria to apply
-     * @returns Filtered entities array
-     */
-    static applyFilters(entities, filters) {
-        // Early return if no filters are active
-        if (!this.hasActiveFilters(filters)) {
-            return [...entities];
-        }
-        // Pre-normalize tags once for efficiency
-        const normalizedSearchTags = filters.tags?.length
-            ? normalizeTags(filters.tags)
-            : undefined;
-        return entities.filter(entity => this.entityPassesFilters(entity, filters, normalizedSearchTags));
-    }
-    /**
-     * Checks if an entity passes all active filters.
-     * Short-circuits on first failing filter for performance.
-     *
-     * @param entity - Entity to check
-     * @param filters - Filter criteria
-     * @param normalizedSearchTags - Pre-normalized search tags (for efficiency)
-     * @returns true if entity passes all filters
-     */
-    static entityPassesFilters(entity, filters, normalizedSearchTags) {
-        // Tag filter - check if entity has any matching tag
-        if (normalizedSearchTags && normalizedSearchTags.length > 0) {
-            if (!entity.tags || entity.tags.length === 0) {
-                return false;
-            }
-            const entityTags = normalizeTags(entity.tags);
-            const hasMatch = normalizedSearchTags.some(tag => entityTags.includes(tag));
-            if (!hasMatch) {
-                return false;
-            }
-        }
-        // Importance filter
-        if (!isWithinImportanceRange(entity.importance, filters.minImportance, filters.maxImportance)) {
-            return false;
-        }
-        // Entity type filter
-        if (filters.entityType && entity.entityType !== filters.entityType) {
-            return false;
-        }
-        // Created date filter
-        if (filters.createdAfter || filters.createdBefore) {
-            if (!entity.createdAt) {
-                return false;
-            }
-            const createdAt = new Date(entity.createdAt);
-            if (filters.createdAfter && createdAt < new Date(filters.createdAfter)) {
-                return false;
-            }
-            if (filters.createdBefore && createdAt > new Date(filters.createdBefore)) {
-                return false;
-            }
-        }
-        // Modified date filter
-        if (filters.modifiedAfter || filters.modifiedBefore) {
-            if (!entity.lastModified) {
-                return false;
-            }
-            const modifiedAt = new Date(entity.lastModified);
-            if (filters.modifiedAfter && modifiedAt < new Date(filters.modifiedAfter)) {
-                return false;
-            }
-            if (filters.modifiedBefore && modifiedAt > new Date(filters.modifiedBefore)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Checks if any filters are actually specified.
-     * Used for early return optimization.
-     *
-     * @param filters - Filter criteria to check
-     * @returns true if at least one filter is active
-     */
-    static hasActiveFilters(filters) {
-        return !!((filters.tags && filters.tags.length > 0) ||
-            filters.minImportance !== undefined ||
-            filters.maxImportance !== undefined ||
-            filters.entityType ||
-            filters.createdAfter ||
-            filters.createdBefore ||
-            filters.modifiedAfter ||
-            filters.modifiedBefore);
-    }
-    /**
-     * Validates and returns pagination parameters.
-     * Delegates to paginationUtils.validatePagination.
-     *
-     * @param offset - Starting position
-     * @param limit - Maximum results
-     * @returns Validated pagination object
-     */
-    static validatePagination(offset = 0, limit) {
-        return validatePagination(offset, limit);
-    }
-    /**
-     * Applies pagination to a filtered result set.
-     *
-     * @param entities - Entities to paginate
-     * @param pagination - Validated pagination parameters
-     * @returns Paginated slice of entities
-     */
-    static paginate(entities, pagination) {
-        return applyPagination(entities, pagination);
-    }
-    /**
-     * Convenience method to apply both filters and pagination in one call.
-     *
-     * @param entities - Entities to process
-     * @param filters - Filter criteria
-     * @param offset - Pagination offset
-     * @param limit - Pagination limit
-     * @returns Filtered and paginated entities
-     */
-    static filterAndPaginate(entities, filters, offset = 0, limit) {
-        const filtered = this.applyFilters(entities, filters);
-        const pagination = this.validatePagination(offset, limit);
-        return this.paginate(filtered, pagination);
-    }
-    /**
-     * Applies tag filter only. Useful when other filters are handled separately.
-     *
-     * @param entities - Entities to filter
-     * @param tags - Tags to filter by
-     * @returns Filtered entities
-     */
-    static filterByTags(entities, tags) {
-        if (!tags || tags.length === 0) {
-            return entities;
-        }
-        const normalizedTags = normalizeTags(tags);
-        return entities.filter(entity => {
-            if (!entity.tags || entity.tags.length === 0) {
-                return false;
-            }
-            return hasMatchingTag(entity.tags, normalizedTags);
-        });
-    }
-    /**
-     * Applies importance filter only. Useful when other filters are handled separately.
-     *
-     * @param entities - Entities to filter
-     * @param minImportance - Minimum importance
-     * @param maxImportance - Maximum importance
-     * @returns Filtered entities
-     */
-    static filterByImportance(entities, minImportance, maxImportance) {
-        if (minImportance === undefined && maxImportance === undefined) {
-            return entities;
-        }
-        return entities.filter(entity => isWithinImportanceRange(entity.importance, minImportance, maxImportance));
-    }
-}
-//# sourceMappingURL=SearchFilterChain.js.map

package/dist/search/SearchFilterChain.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SearchFilterChain.js","sourceRoot":"","sources":["../../src/search/SearchFilterChain.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EACL,aAAa,EACb,cAAc,EACd,uBAAuB,EACvB,kBAAkB,EAClB,eAAe,GAEhB,MAAM,mBAAmB,CAAC;AAyB3B;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,iBAAiB;IAC5B;;;;;;;OAOG;IACH,MAAM,CAAC,YAAY,CAAC,QAA2B,EAAE,OAAsB;QACrE,wCAAwC;QACxC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;QACvB,CAAC;QAED,yCAAyC;QACzC,MAAM,oBAAoB,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM;YAC/C,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC;YAC7B,CAAC,CAAC,SAAS,CAAC;QAEd,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAC9B,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,EAAE,oBAAoB,CAAC,CAChE,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,mBAAmB,CACxB,MAAc,EACd,OAAsB,EACtB,oBAA+B;QAE/B,oDAAoD;QACpD,IAAI,oBAAoB,IAAI,oBAAoB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5D,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,oBAAoB;QACpB,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;YAC9F,OAAO,KAAK,CAAC;QACf,CAAC;QAED,qBAAqB;QACrB,IAAI,OAAO,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC;YACnE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,sBAAsB;QACtB,IAAI,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAClD,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;gBACtB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC7C,IAAI,OAAO,CAAC,YAAY,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBACvE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,OAAO,CAAC,aAAa,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;gBACzE,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;YACpD,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YACjD,IAAI,OAAO,CAAC,aAAa,IAAI,UAAU,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC1E,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,OAAO,CAAC,cAAc,IAAI,UAAU,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC5E,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,gBAAgB,CAAC,OAAsB;QAC5C,OAAO,CAAC,CAAC,CACP,CAAC,OAAO,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACzC,OAAO,CAAC,aAAa,KAAK,SAAS;YACnC,OAAO,CAAC,aAAa,KAAK,SAAS;YACnC,OAAO,CAAC,UAAU;YAClB,OAAO,CAAC,YAAY;YACpB,OAAO,CAAC,aAAa;YACrB,OAAO,CAAC,aAAa;YACrB,OAAO,CAAC,cAAc,CACvB,CAAC;IACJ,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,kBAAkB,CAAC,SAAiB,CAAC,EAAE,KAAc;QAC1D,OAAO,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAkB,EAAE,UAA+B;QACjE,OAAO,eAAe,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;;;OAQG;IACH,MAAM,CAAC,iBAAiB,CACtB,QAAkB,EAClB,OAAsB,EACtB,SAAiB,CAAC,EAClB,KAAc;QAEd,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAC,YAAY,CAAC,QAAkB,EAAE,IAAe;QACrD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,cAAc,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QAC3C,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,cAAc,CAAC,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,kBAAkB,CACvB,QAAkB,EAClB,aAAsB,EACtB,aAAsB;QAEtB,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAC/D,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAC9B,uBAAuB,CAAC,MAAM,CAAC,UAAU,EAAE,aAAa,EAAE,aAAa,CAAC,CACzE,CAAC;IACJ,CAAC;CACF"}

package/dist/search/SearchManager.d.ts

@@ -1,326 +0,0 @@
-/**
- * Search Manager
- *
- * Orchestrates all search types (basic, ranked, boolean, fuzzy).
- * Focused on search operations only (Phase 4: Consolidate God Objects).
- *
- * @module search/SearchManager
- */
-import type { KnowledgeGraph, SearchResult, SavedSearch, AutoSearchResult } from '../types/index.js';
-import type { GraphStorage } from '../core/GraphStorage.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 declare class SearchManager {
-    private basicSearch;
-    private rankedSearch;
-    private booleanSearcher;
-    private fuzzySearcher;
-    private searchSuggestions;
-    private savedSearchManager;
-    private storage;
-    private queryEstimator;
-    constructor(storage: GraphStorage, savedSearchesFilePath: string);
-    /**
-     * 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(): void;
-    /**
-     * Phase 4 Sprint 5: Clear fuzzy search cache.
-     */
-    clearFuzzyCache(): void;
-    /**
-     * Phase 4 Sprint 5: Clear boolean search cache.
-     */
-    clearBooleanCache(): void;
-    /**
-     * Phase 4 Sprint 5: Clear ranked search token cache.
-     */
-    clearRankedCache(): void;
-    /**
-     * 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);
-     * ```
-     */
-    searchNodes(query: string, tags?: string[], minImportance?: number, maxImportance?: number): Promise<KnowledgeGraph>;
-    /**
-     * Open specific nodes by name.
-     *
-     * @param names - Array of entity names
-     * @returns Knowledge graph with specified entities
-     */
-    openNodes(names: string[]): Promise<KnowledgeGraph>;
-    /**
-     * 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
-     */
-    searchByDateRange(startDate?: string, endDate?: string, entityType?: string, tags?: string[]): Promise<KnowledgeGraph>;
-    /**
-     * 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
-     * );
-     * ```
-     */
-    searchNodesRanked(query: string, tags?: string[], minImportance?: number, maxImportance?: number, limit?: number): Promise<SearchResult[]>;
-    /**
-     * 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');
-     * ```
-     */
-    booleanSearch(query: string, tags?: string[], minImportance?: number, maxImportance?: number): Promise<KnowledgeGraph>;
-    /**
-     * 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);
-     * ```
-     */
-    fuzzySearch(query: string, threshold?: number, tags?: string[], minImportance?: number, maxImportance?: number): Promise<KnowledgeGraph>;
-    /**
-     * Get search suggestions for a query.
-     *
-     * @param query - Search query
-     * @param maxSuggestions - Maximum suggestions to return
-     * @returns Array of suggested terms
-     */
-    getSearchSuggestions(query: string, maxSuggestions?: number): Promise<string[]>;
-    /**
-     * 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'
-     * });
-     * ```
-     */
-    saveSearch(search: Omit<SavedSearch, 'createdAt' | 'useCount' | 'lastUsed'>): Promise<SavedSearch>;
-    /**
-     * List all saved searches.
-     *
-     * @returns Array of saved searches
-     */
-    listSavedSearches(): Promise<SavedSearch[]>;
-    /**
-     * Get a saved search by name.
-     *
-     * @param name - Search name
-     * @returns Saved search or null
-     */
-    getSavedSearch(name: string): Promise<SavedSearch | null>;
-    /**
-     * 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');
-     * }
-     * ```
-     */
-    executeSavedSearch(name: string): Promise<KnowledgeGraph>;
-    /**
-     * Delete a saved search.
-     *
-     * @param name - Search name
-     * @returns True if deleted
-     */
-    deleteSavedSearch(name: string): Promise<boolean>;
-    /**
-     * Update a saved search.
-     *
-     * @param name - Search name
-     * @param updates - Fields to update
-     * @returns Updated saved search
-     */
-    updateSavedSearch(name: string, updates: Partial<Omit<SavedSearch, 'name' | 'createdAt' | 'useCount' | 'lastUsed'>>): Promise<SavedSearch>;
-    /**
-     * 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`);
-     * ```
-     */
-    autoSearch(query: string, limit?: number): Promise<AutoSearchResult>;
-    /**
-     * 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
-     */
-    getSearchCostEstimates(query: string): Promise<import('../types/index.js').QueryCostEstimate[]>;
-    /**
-     * Phase 10 Sprint 4: Get the query cost estimator instance.
-     *
-     * @returns The QueryCostEstimator instance
-     */
-    getQueryEstimator(): QueryCostEstimator;
-}
-//# sourceMappingURL=SearchManager.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"SearchManager.d.ts","sourceRoot":"","sources":["../../src/search/SearchManager.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,YAAY,EAAE,WAAW,EAAE,gBAAgB,EAAU,MAAM,mBAAmB,CAAC;AAC7G,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAO5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAE7D;;;;GAIG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,WAAW,CAAc;IACjC,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,eAAe,CAAgB;IACvC,OAAO,CAAC,aAAa,CAAc;IACnC,OAAO,CAAC,iBAAiB,CAAoB;IAC7C,OAAO,CAAC,kBAAkB,CAAqB;IAC/C,OAAO,CAAC,OAAO,CAAe;IAC9B,OAAO,CAAC,cAAc,CAAqB;gBAE/B,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,MAAM;IAahE;;;;;OAKG;IACH,cAAc,IAAI,IAAI;IAMtB;;OAEG;IACH,eAAe,IAAI,IAAI;IAIvB;;OAEG;IACH,iBAAiB,IAAI,IAAI;IAIzB;;OAEG;IACH,gBAAgB,IAAI,IAAI;IAMxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACG,WAAW,CACf,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,MAAM,EAAE,EACf,aAAa,CAAC,EAAE,MAAM,EACtB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAAC,cAAc,CAAC;IAI1B;;;;;OAKG;IACG,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,CAAC;IAIzD;;;;;;;;OAQG;IACG,iBAAiB,CACrB,SAAS,CAAC,EAAE,MAAM,EAClB,OAAO,CAAC,EAAE,MAAM,EAChB,UAAU,CAAC,EAAE,MAAM,EACnB,IAAI,CAAC,EAAE,MAAM,EAAE,GACd,OAAO,CAAC,cAAc,CAAC;IAM1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoCG;IACG,iBAAiB,CACrB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,MAAM,EAAE,EACf,aAAa,CAAC,EAAE,MAAM,EACtB,aAAa,CAAC,EAAE,MAAM,EACtB,KAAK,CAAC,EAAE,MAAM,GACb,OAAO,CAAC,YAAY,EAAE,CAAC;IAM1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACG,aAAa,CACjB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE,MAAM,EAAE,EACf,aAAa,CAAC,EAAE,MAAM,EACtB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAAC,cAAc,CAAC;IAM1B;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACG,WAAW,CACf,KAAK,EAAE,MAAM,EACb,SAAS,CAAC,EAAE,MAAM,EAClB,IAAI,CAAC,EAAE,MAAM,EAAE,EACf,aAAa,CAAC,EAAE,MAAM,EACtB,aAAa,CAAC,EAAE,MAAM,GACrB,OAAO,CAAC,cAAc,CAAC;IAM1B;;;;;;OAMG;IACG,oBAAoB,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAMrF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACG,UAAU,CACd,MAAM,EAAE,IAAI,CAAC,WAAW,EAAE,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC,GAC/D,OAAO,CAAC,WAAW,CAAC;IAIvB;;;;OAIG;IACG,iBAAiB,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;IAIjD;;;;;OAKG;IACG,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAI/D;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACG,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC;IAI/D;;;;;OAKG;IACG,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAIvD;;;;;;OAMG;IACG,iBAAiB,CACrB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC,CAAC,GAClF,OAAO,CAAC,WAAW,CAAC;IAMvB;;;;;;;;;;;;;;;;;;;;OAoBG;IACG,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,OAAO,CAAC,gBAAgB,CAAC;IA+E9E;;;;;;;;OAQG;IACG,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,mBAAmB,EAAE,iBAAiB,EAAE,CAAC;IAMrG;;;;OAIG;IACH,iBAAiB,IAAI,kBAAkB;CAGxC"}