@danielsimonjr/memory-mcp 11.0.1 → 11.1.1

package/dist/search/SearchManager.js

@@ -12,7 +12,6 @@ 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.
  *
@@ -25,17 +24,13 @@ export class SearchManager {
     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) ====================
     /**
@@ -340,114 +335,4 @@ export class SearchManager {
     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;
-    }
 }

package/dist/search/SemanticSearch.d.ts

@@ -53,12 +53,9 @@ export declare class SemanticSearch {
      * Generates embeddings for all entities and stores them in the vector store.
      * Can be called incrementally - only indexes entities that aren't already indexed.
      *
-     * Phase 9B: Supports cancellation via AbortSignal in options.
-     *
      * @param graph - Knowledge graph to index
-     * @param options - Indexing options (includes signal for cancellation)
+     * @param options - Indexing options
      * @returns Index statistics
-     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
      */
     indexAll(graph: ReadonlyKnowledgeGraph, options?: SemanticIndexOptions): Promise<{
         indexed: number;

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

@@ -1 +1 @@
-{"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;AAK3B;;;;;;;;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;;;;;;;;;;;;OAYG;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;IAwEhE;;;;;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"}
+{"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

@@ -8,7 +8,6 @@
  */
 import { InMemoryVectorStore } from './VectorStore.js';
 import { EMBEDDING_DEFAULTS, SEMANTIC_SEARCH_LIMITS } from '../utils/constants.js';
-import { checkCancellation } from '../utils/index.js';
 /**
  * Convert an entity to a text representation for embedding.
  *
@@ -72,17 +71,12 @@ export class SemanticSearch {
      * Generates embeddings for all entities and stores them in the vector store.
      * Can be called incrementally - only indexes entities that aren't already indexed.
      *
-     * Phase 9B: Supports cancellation via AbortSignal in options.
-     *
      * @param graph - Knowledge graph to index
-     * @param options - Indexing options (includes signal for cancellation)
+     * @param options - Indexing options
      * @returns Index statistics
-     * @throws {OperationCancelledError} If operation is cancelled via signal (Phase 9B)
      */
     async indexAll(graph, options = {}) {
-        const { forceReindex = false, onProgress, batchSize = EMBEDDING_DEFAULTS.DEFAULT_BATCH_SIZE, signal, } = options;
-        // Check for early cancellation
-        checkCancellation(signal, 'indexAll');
+        const { forceReindex = false, onProgress, batchSize = EMBEDDING_DEFAULTS.DEFAULT_BATCH_SIZE, } = options;
         let indexed = 0;
         let skipped = 0;
         let errors = 0;
@@ -100,8 +94,6 @@ export class SemanticSearch {
         }
         // Process in batches
         for (let i = 0; i < toIndex.length; i += batchSize) {
-            // Check for cancellation between batches
-            checkCancellation(signal, 'indexAll');
             const batch = toIndex.slice(i, i + batchSize);
             const texts = batch.map(entityToText);
             try {
@@ -114,8 +106,6 @@ export class SemanticSearch {
             catch (error) {
                 // Try individual embeddings on batch failure
                 for (const entity of batch) {
-                    // Check for cancellation during fallback
-                    checkCancellation(signal, 'indexAll');
                     try {
                         const text = entityToText(entity);
                         const embedding = await this.embeddingService.embed(text);

package/dist/search/TFIDFIndexManager.d.ts

@@ -59,93 +59,5 @@ export declare class TFIDFIndexManager {
      * @returns True if index should be rebuilt
      */
     needsRebuild(graph: KnowledgeGraph): boolean;
-    /**
-     * Phase 10 Sprint 3: Add a single document to the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity additions.
-     * Updates TF for the new document and recalculates IDF for affected terms.
-     *
-     * @param entity - The entity to add
-     *
-     * @example
-     * ```typescript
-     * const indexManager = new TFIDFIndexManager('/data');
-     * await indexManager.loadIndex();
-     *
-     * // Add new entity
-     * indexManager.addDocument({
-     *   name: 'NewEntity',
-     *   entityType: 'person',
-     *   observations: ['Software engineer']
-     * });
-     * ```
-     */
-    addDocument(entity: {
-        name: string;
-        entityType: string;
-        observations: string[];
-    }): void;
-    /**
-     * Phase 10 Sprint 3: Remove a single document from the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity deletions.
-     * Recalculates IDF for terms that were in the removed document.
-     *
-     * @param entityName - Name of the entity to remove
-     *
-     * @example
-     * ```typescript
-     * indexManager.removeDocument('DeletedEntity');
-     * ```
-     */
-    removeDocument(entityName: string): void;
-    /**
-     * Phase 10 Sprint 3: Update a single document in the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity updates.
-     * Handles both term changes and observation updates.
-     *
-     * @param entity - The updated entity
-     *
-     * @example
-     * ```typescript
-     * indexManager.updateDocument({
-     *   name: 'ExistingEntity',
-     *   entityType: 'person',
-     *   observations: ['Updated observations']
-     * });
-     * ```
-     */
-    updateDocument(entity: {
-        name: string;
-        entityType: string;
-        observations: string[];
-    }): void;
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for a set of terms.
-     *
-     * @param terms - Set of terms to recalculate IDF for
-     * @private
-     */
-    private recalculateIDFForTerms;
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for ALL terms in the index.
-     *
-     * Called when the total document count changes (add/remove document).
-     * @private
-     */
-    private recalculateAllIDF;
-    /**
-     * Phase 10 Sprint 3: Check if the index is loaded/initialized.
-     *
-     * @returns True if index is available
-     */
-    isInitialized(): boolean;
-    /**
-     * Phase 10 Sprint 3: Get the number of documents in the index.
-     *
-     * @returns Document count or 0 if not initialized
-     */
-    getDocumentCount(): number;
 }
 //# sourceMappingURL=TFIDFIndexManager.d.ts.map

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

@@ -1 +1 @@
-{"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;IAsB5C;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,WAAW,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,IAAI;IA+BvF;;;;;;;;;;;;OAYG;IACH,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;IAqBxC;;;;;;;;;;;;;;;;OAgBG;IACH,cAAc,CAAC,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,IAAI;IAgD1F;;;;;OAKG;IACH,OAAO,CAAC,sBAAsB;IAkC9B;;;;;OAKG;IACH,OAAO,CAAC,iBAAiB;IA8BzB;;;;OAIG;IACH,aAAa,IAAI,OAAO;IAIxB;;;;OAIG;IACH,gBAAgB,IAAI,MAAM;CAG3B"}
+{"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"}

package/dist/search/TFIDFIndexManager.js

@@ -212,221 +212,4 @@ export class TFIDFIndexManager {
         }
         return false;
     }
-    // ==================== Phase 10 Sprint 3: Incremental Index Updates ====================
-    /**
-     * Phase 10 Sprint 3: Add a single document to the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity additions.
-     * Updates TF for the new document and recalculates IDF for affected terms.
-     *
-     * @param entity - The entity to add
-     *
-     * @example
-     * ```typescript
-     * const indexManager = new TFIDFIndexManager('/data');
-     * await indexManager.loadIndex();
-     *
-     * // Add new entity
-     * indexManager.addDocument({
-     *   name: 'NewEntity',
-     *   entityType: 'person',
-     *   observations: ['Software engineer']
-     * });
-     * ```
-     */
-    addDocument(entity) {
-        if (!this.index) {
-            // Can't add to non-existent index
-            return;
-        }
-        // Build document text and tokens
-        const documentText = [entity.name, entity.entityType, ...entity.observations].join(' ');
-        const tokens = tokenize(documentText);
-        // Calculate term frequencies
-        const termFreq = {};
-        for (const term of tokens) {
-            termFreq[term] = (termFreq[term] || 0) + 1;
-        }
-        // Add to documents map
-        this.index.documents.set(entity.name, {
-            entityName: entity.name,
-            terms: termFreq,
-            documentText,
-        });
-        // Update IDF for ALL terms because N changed (total document count)
-        // IDF = log(N/df), and N has increased
-        this.recalculateAllIDF();
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Remove a single document from the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity deletions.
-     * Recalculates IDF for terms that were in the removed document.
-     *
-     * @param entityName - Name of the entity to remove
-     *
-     * @example
-     * ```typescript
-     * indexManager.removeDocument('DeletedEntity');
-     * ```
-     */
-    removeDocument(entityName) {
-        if (!this.index) {
-            return;
-        }
-        const document = this.index.documents.get(entityName);
-        if (!document) {
-            return;
-        }
-        // Remove from documents map
-        this.index.documents.delete(entityName);
-        // Update IDF for ALL terms because N changed (total document count)
-        // IDF = log(N/df), and N has decreased
-        this.recalculateAllIDF();
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Update a single document in the index incrementally.
-     *
-     * More efficient than rebuilding the entire index for single entity updates.
-     * Handles both term changes and observation updates.
-     *
-     * @param entity - The updated entity
-     *
-     * @example
-     * ```typescript
-     * indexManager.updateDocument({
-     *   name: 'ExistingEntity',
-     *   entityType: 'person',
-     *   observations: ['Updated observations']
-     * });
-     * ```
-     */
-    updateDocument(entity) {
-        if (!this.index) {
-            return;
-        }
-        const oldDocument = this.index.documents.get(entity.name);
-        const oldTerms = oldDocument ? new Set(Object.keys(oldDocument.terms)) : new Set();
-        // Build new document
-        const documentText = [entity.name, entity.entityType, ...entity.observations].join(' ');
-        const tokens = tokenize(documentText);
-        const newTerms = new Set(tokens);
-        // Calculate term frequencies
-        const termFreq = {};
-        for (const term of tokens) {
-            termFreq[term] = (termFreq[term] || 0) + 1;
-        }
-        // Update documents map
-        this.index.documents.set(entity.name, {
-            entityName: entity.name,
-            terms: termFreq,
-            documentText,
-        });
-        // Find terms that changed (added or removed)
-        const changedTerms = new Set();
-        for (const term of oldTerms) {
-            if (!newTerms.has(term)) {
-                changedTerms.add(term);
-            }
-        }
-        for (const term of newTerms) {
-            if (!oldTerms.has(term)) {
-                changedTerms.add(term);
-            }
-        }
-        // Recalculate IDF for changed terms
-        if (changedTerms.size > 0) {
-            this.recalculateIDFForTerms(changedTerms);
-        }
-        // Update timestamp
-        this.index.lastUpdated = new Date().toISOString();
-    }
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for a set of terms.
-     *
-     * @param terms - Set of terms to recalculate IDF for
-     * @private
-     */
-    recalculateIDFForTerms(terms) {
-        if (!this.index) {
-            return;
-        }
-        const totalDocs = this.index.documents.size;
-        if (totalDocs === 0) {
-            // No documents, clear all IDF for these terms
-            for (const term of terms) {
-                this.index.idf.delete(term);
-            }
-            return;
-        }
-        // Count documents containing each term
-        for (const term of terms) {
-            let docCount = 0;
-            for (const doc of this.index.documents.values()) {
-                if (term in doc.terms) {
-                    docCount++;
-                }
-            }
-            if (docCount > 0) {
-                // IDF = log(N / df) where N = total docs, df = doc frequency
-                const idfScore = Math.log(totalDocs / docCount);
-                this.index.idf.set(term, idfScore);
-            }
-            else {
-                // Term no longer exists in any document
-                this.index.idf.delete(term);
-            }
-        }
-    }
-    /**
-     * Phase 10 Sprint 3: Recalculate IDF scores for ALL terms in the index.
-     *
-     * Called when the total document count changes (add/remove document).
-     * @private
-     */
-    recalculateAllIDF() {
-        if (!this.index) {
-            return;
-        }
-        const totalDocs = this.index.documents.size;
-        if (totalDocs === 0) {
-            // No documents, clear all IDF
-            this.index.idf.clear();
-            return;
-        }
-        // Build term -> document count map
-        const termDocCounts = new Map();
-        for (const doc of this.index.documents.values()) {
-            for (const term of Object.keys(doc.terms)) {
-                termDocCounts.set(term, (termDocCounts.get(term) ?? 0) + 1);
-            }
-        }
-        // Clear old IDF and recalculate
-        this.index.idf.clear();
-        for (const [term, docCount] of termDocCounts) {
-            // IDF = log(N / df) where N = total docs, df = doc frequency
-            const idfScore = Math.log(totalDocs / docCount);
-            this.index.idf.set(term, idfScore);
-        }
-    }
-    /**
-     * Phase 10 Sprint 3: Check if the index is loaded/initialized.
-     *
-     * @returns True if index is available
-     */
-    isInitialized() {
-        return this.index !== null;
-    }
-    /**
-     * Phase 10 Sprint 3: Get the number of documents in the index.
-     *
-     * @returns Document count or 0 if not initialized
-     */
-    getDocumentCount() {
-        return this.index?.documents.size ?? 0;
-    }
 }

package/dist/search/index.d.ts

@@ -12,24 +12,7 @@ export { SearchSuggestions } from './SearchSuggestions.js';
 export { SavedSearchManager } from './SavedSearchManager.js';
 export { SearchManager } from './SearchManager.js';
 export { SearchFilterChain, type SearchFilters, type ValidatedPagination } from './SearchFilterChain.js';
-export { OpenAIEmbeddingService, LocalEmbeddingService, MockEmbeddingService, createEmbeddingService, l2Normalize, QUERY_PREFIX, DOCUMENT_PREFIX, type EmbeddingProgressCallback, } from './EmbeddingService.js';
-export { EmbeddingCache, DEFAULT_EMBEDDING_CACHE_OPTIONS, type EmbeddingCacheStats, type EmbeddingCacheOptions, } from './EmbeddingCache.js';
-export { IncrementalIndexer, DEFAULT_INDEXER_OPTIONS, type IndexOperationType, type IndexOperation, type IncrementalIndexerOptions, type FlushResult, } from './IncrementalIndexer.js';
+export { OpenAIEmbeddingService, LocalEmbeddingService, MockEmbeddingService, createEmbeddingService, } from './EmbeddingService.js';
 export { InMemoryVectorStore, SQLiteVectorStore, createVectorStore, cosineSimilarity, type SQLiteStorageWithEmbeddings, } from './VectorStore.js';
 export { SemanticSearch, entityToText, } from './SemanticSearch.js';
-export { TFIDFIndexManager } from './TFIDFIndexManager.js';
-export { TFIDFEventSync } from './TFIDFEventSync.js';
-export { QueryCostEstimator, type SearchLayer, type ExtendedQueryCostEstimate, type LayerRecommendationOptions, type TokenEstimationOptions, type AdaptiveDepthConfig, } from './QueryCostEstimator.js';
-export { SymbolicSearch, type SymbolicResult } from './SymbolicSearch.js';
-export { HybridSearchManager, DEFAULT_HYBRID_WEIGHTS } from './HybridSearchManager.js';
-export { QueryAnalyzer } from './QueryAnalyzer.js';
-export { QueryPlanner } from './QueryPlanner.js';
-export { ReflectionManager, type ReflectionOptions, type ReflectionResult, type RefinementHistoryEntry, } from './ReflectionManager.js';
-export { BM25Search, STOPWORDS, DEFAULT_BM25_CONFIG, type BM25DocumentEntry, type BM25Index, type BM25Config, } from './BM25Search.js';
-export { OptimizedInvertedIndex, type IndexMemoryUsage, type PostingListResult, } from './OptimizedInvertedIndex.js';
-export { HybridScorer, DEFAULT_SCORER_WEIGHTS, type SemanticSearchResult, type LexicalSearchResult, type SymbolicSearchResult, type ScoredResult, type HybridWeights, type HybridScorerOptions, } from './HybridScorer.js';
-export { ParallelSearchExecutor, type LayerTiming, type ParallelSearchResult, type ParallelSearchOptions, } from './ParallelSearchExecutor.js';
-export { EarlyTerminationManager, type AdequacyCheck, type EarlyTerminationOptions, type EarlyTerminationResult, } from './EarlyTerminationManager.js';
-export { QueryPlanCache, type CachedQueryEntry, type QueryPlanCacheStats, type QueryPlanCacheOptions, } from './QueryPlanCache.js';
-export { QuantizedVectorStore, type QuantizationParams, type QuantizedVectorStoreStats, type QuantizedSearchResult, type QuantizedVectorStoreOptions, } from './QuantizedVectorStore.js';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,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,KAAK,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGnD,OAAO,EAAE,iBAAiB,EAAE,KAAK,aAAa,EAAE,KAAK,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAIzG,OAAO,EACL,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,sBAAsB,EACtB,WAAW,EACX,YAAY,EACZ,eAAe,EACf,KAAK,yBAAyB,GAC/B,MAAM,uBAAuB,CAAC;AAG/B,OAAO,EACL,cAAc,EACd,+BAA+B,EAC/B,KAAK,mBAAmB,EACxB,KAAK,qBAAqB,GAC3B,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,KAAK,kBAAkB,EACvB,KAAK,cAAc,EACnB,KAAK,yBAAyB,EAC9B,KAAK,WAAW,GACjB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EACL,mBAAmB,EACnB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,KAAK,2BAA2B,GACjC,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,cAAc,EACd,YAAY,GACb,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAIrD,OAAO,EACL,kBAAkB,EAClB,KAAK,WAAW,EAChB,KAAK,yBAAyB,EAC9B,KAAK,0BAA0B,EAC/B,KAAK,sBAAsB,EAC3B,KAAK,mBAAmB,GACzB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,cAAc,EAAE,KAAK,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGvF,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAIjD,OAAO,EACL,iBAAiB,EACjB,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACrB,KAAK,sBAAsB,GAC5B,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,UAAU,EACV,SAAS,EACT,mBAAmB,EACnB,KAAK,iBAAiB,EACtB,KAAK,SAAS,EACd,KAAK,UAAU,GAChB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,sBAAsB,EACtB,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,GACvB,MAAM,6BAA6B,CAAC;AAErC,OAAO,EACL,YAAY,EACZ,sBAAsB,EACtB,KAAK,oBAAoB,EACzB,KAAK,mBAAmB,EACxB,KAAK,oBAAoB,EACzB,KAAK,YAAY,EACjB,KAAK,aAAa,EAClB,KAAK,mBAAmB,GACzB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EACL,sBAAsB,EACtB,KAAK,WAAW,EAChB,KAAK,oBAAoB,EACzB,KAAK,qBAAqB,GAC3B,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,uBAAuB,EACvB,KAAK,aAAa,EAClB,KAAK,uBAAuB,EAC5B,KAAK,sBAAsB,GAC5B,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EACL,cAAc,EACd,KAAK,gBAAgB,EACrB,KAAK,mBAAmB,EACxB,KAAK,qBAAqB,GAC3B,MAAM,qBAAqB,CAAC;AAG7B,OAAO,EACL,oBAAoB,EACpB,KAAK,kBAAkB,EACvB,KAAK,yBAAyB,EAC9B,KAAK,qBAAqB,EAC1B,KAAK,2BAA2B,GACjC,MAAM,2BAA2B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/search/index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,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,KAAK,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AACxE,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC7D,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AAGnD,OAAO,EAAE,iBAAiB,EAAE,KAAK,aAAa,EAAE,KAAK,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAGzG,OAAO,EACL,sBAAsB,EACtB,qBAAqB,EACrB,oBAAoB,EACpB,sBAAsB,GACvB,MAAM,uBAAuB,CAAC;AAG/B,OAAO,EACL,mBAAmB,EACnB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,KAAK,2BAA2B,GACjC,MAAM,kBAAkB,CAAC;AAG1B,OAAO,EACL,cAAc,EACd,YAAY,GACb,MAAM,qBAAqB,CAAC"}

package/dist/search/index.js

@@ -14,39 +14,8 @@ export { SearchManager } from './SearchManager.js';
 // Sprint 2: Search Filter Chain utilities
 export { SearchFilterChain } from './SearchFilterChain.js';
 // Phase 4 Sprint 10: Embedding Service for semantic search
-// Phase 12 Sprint 5: Added l2Normalize, prefixes, and progress callback
-export { OpenAIEmbeddingService, LocalEmbeddingService, MockEmbeddingService, createEmbeddingService, l2Normalize, QUERY_PREFIX, DOCUMENT_PREFIX, } from './EmbeddingService.js';
-// Phase 12 Sprint 5: Embedding Cache with LRU eviction
-export { EmbeddingCache, DEFAULT_EMBEDDING_CACHE_OPTIONS, } from './EmbeddingCache.js';
-// Phase 12 Sprint 5: Incremental Indexer for batch updates
-export { IncrementalIndexer, DEFAULT_INDEXER_OPTIONS, } from './IncrementalIndexer.js';
+export { OpenAIEmbeddingService, LocalEmbeddingService, MockEmbeddingService, createEmbeddingService, } from './EmbeddingService.js';
 // Phase 4 Sprint 11: Vector Store for semantic search
 export { InMemoryVectorStore, SQLiteVectorStore, createVectorStore, cosineSimilarity, } from './VectorStore.js';
 // Phase 4 Sprint 12: Semantic Search Manager
 export { SemanticSearch, entityToText, } from './SemanticSearch.js';
-// Phase 10 Sprint 3: TF-IDF Index Manager and Event Sync
-export { TFIDFIndexManager } from './TFIDFIndexManager.js';
-export { TFIDFEventSync } from './TFIDFEventSync.js';
-// Phase 10 Sprint 4: Query Cost Estimation
-// Phase 12 Sprint 4: Enhanced with adaptive depth, token estimation, layer recommendations
-export { QueryCostEstimator, } from './QueryCostEstimator.js';
-// Phase 11 Sprint 1: Hybrid Search
-export { SymbolicSearch } from './SymbolicSearch.js';
-export { HybridSearchManager, DEFAULT_HYBRID_WEIGHTS } from './HybridSearchManager.js';
-// Phase 11 Sprint 3: Query Analysis
-export { QueryAnalyzer } from './QueryAnalyzer.js';
-export { QueryPlanner } from './QueryPlanner.js';
-// Phase 11 Sprint 4: Reflection-based Retrieval
-// Phase 12 Sprint 4: Enhanced with progressive limits, focused refinement, history tracking
-export { ReflectionManager, } from './ReflectionManager.js';
-// Phase 12 Sprint 3: Search Algorithm Optimization
-export { BM25Search, STOPWORDS, DEFAULT_BM25_CONFIG, } from './BM25Search.js';
-export { OptimizedInvertedIndex, } from './OptimizedInvertedIndex.js';
-export { HybridScorer, DEFAULT_SCORER_WEIGHTS, } from './HybridScorer.js';
-// Phase 12 Sprint 2: Parallel Search Execution
-export { ParallelSearchExecutor, } from './ParallelSearchExecutor.js';
-// Phase 12 Sprint 4: Query Execution Optimization
-export { EarlyTerminationManager, } from './EarlyTerminationManager.js';
-export { QueryPlanCache, } from './QueryPlanCache.js';
-// Phase 12 Sprint 6: Quantized Vector Store
-export { QuantizedVectorStore, } from './QuantizedVectorStore.js';

package/dist/server/MCPServer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MCPServer.d.ts","sourceRoot":"","sources":["../../src/server/MCPServer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAQH,OAAO,EAAU,KAAK,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAItE;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,GAAG,CAAiB;gBAEhB,GAAG,EAAE,cAAc;IAiB/B,OAAO,CAAC,oBAAoB;IAetB,KAAK;CAKZ"}
+{"version":3,"file":"MCPServer.d.ts","sourceRoot":"","sources":["../../src/server/MCPServer.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH,OAAO,EAAU,KAAK,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAOtE;;;GAGG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,GAAG,CAAiB;gBAEhB,GAAG,EAAE,cAAc;IAiB/B,OAAO,CAAC,oBAAoB;IAetB,KAAK;CAKZ"}

package/dist/server/MCPServer.js

@@ -6,12 +6,15 @@
  *
  * @module server/MCPServer
  */
+import { createRequire } from 'node:module';
 import { Server } from "@modelcontextprotocol/sdk/server/index.js";
 import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
 import { CallToolRequestSchema, ListToolsRequestSchema, } from "@modelcontextprotocol/sdk/types.js";
 import { logger } from '@danielsimonjr/memoryjs';
 import { toolDefinitions } from './toolDefinitions.js';
 import { handleToolCall } from './toolHandlers.js';
+const require = createRequire(import.meta.url);
+const { version } = require('../../package.json');
 /**
  * MCP Server for Knowledge Graph operations.
  * Exposes tools for entity/relation management, search, and analysis.
@@ -23,7 +26,7 @@ export class MCPServer {
         this.ctx = ctx;
         this.server = new Server({
             name: "memory-server",
-            version: "11.0.0",
+            version,
         }, {
             capabilities: {
                 tools: {},

package/dist/server/responseCompressor.js

@@ -111,16 +111,16 @@ export function estimateCompressionRatio(content) {
     const jsonIndicators = (content.match(/[{}\[\]":,]/g) || []).length;
     const jsonRatio = jsonIndicators / size;
     if (jsonRatio > 0.1) {
-        // Highly JSON-like, expect 60-75% compression
-        return 0.25 + (0.1 * Math.random());
+        // Highly JSON-like, expect ~70% compression
+        return 0.3;
     }
     // Check for repetitive content
     const uniqueChars = new Set(content).size;
     const repetitionRatio = uniqueChars / Math.min(size, 256);
     if (repetitionRatio < 0.3) {
-        // Very repetitive, expect 50-70% compression
-        return 0.3 + (0.15 * Math.random());
+        // Very repetitive, expect ~60% compression
+        return 0.4;
     }
     // Default estimate for mixed content
-    return 0.5 + (0.2 * Math.random());
+    return 0.6;
 }