@danielsimonjr/memory-mcp 11.1.1 → 12.5.2

package/dist/workers/levenshteinWorker.d.ts

@@ -1,60 +0,0 @@
-/**
- * Levenshtein Worker
- *
- * Worker thread for calculating Levenshtein distances in parallel.
- * Uses workerpool for worker management.
- *
- * @module workers/levenshteinWorker
- */
-/**
- * Input data structure for the worker.
- */
-export interface WorkerInput {
-    /** Search query string */
-    query: string;
-    /** Array of entities to search */
-    entities: Array<{
-        name: string;
-        nameLower: string;
-        observations: string[];
-    }>;
-    /** Similarity threshold (0.0 to 1.0) */
-    threshold: number;
-}
-/**
- * Match result returned by the worker.
- */
-export interface MatchResult {
-    /** Entity name that matched */
-    name: string;
-    /** Similarity score (0.0 to 1.0) */
-    score: number;
-    /** Where the match occurred */
-    matchedIn: 'name' | 'observation';
-}
-/**
- * Calculate Levenshtein distance between two strings.
- *
- * Uses dynamic programming matrix for efficient computation.
- *
- * @param s1 - First string
- * @param s2 - Second string
- * @returns Levenshtein distance (number of edits)
- */
-export declare function levenshteinDistance(s1: string, s2: string): number;
-/**
- * Calculate similarity score between two strings.
- *
- * @param s1 - First string
- * @param s2 - Second string
- * @returns Similarity score (0.0 to 1.0, where 1.0 is identical)
- */
-export declare function similarity(s1: string, s2: string): number;
-/**
- * Search entities for fuzzy matches.
- *
- * @param data - Worker input containing query, entities, and threshold
- * @returns Array of match results
- */
-export declare function searchEntities(data: WorkerInput): MatchResult[];
-//# sourceMappingURL=levenshteinWorker.d.ts.map

package/dist/workers/levenshteinWorker.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"levenshteinWorker.d.ts","sourceRoot":"","sources":["../../src/workers/levenshteinWorker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,0BAA0B;IAC1B,KAAK,EAAE,MAAM,CAAC;IACd,kCAAkC;IAClC,QAAQ,EAAE,KAAK,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,YAAY,EAAE,MAAM,EAAE,CAAC;KACxB,CAAC,CAAC;IACH,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,oCAAoC;IACpC,KAAK,EAAE,MAAM,CAAC;IACd,+BAA+B;IAC/B,SAAS,EAAE,MAAM,GAAG,aAAa,CAAC;CACnC;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAgClE;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAWzD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,WAAW,GAAG,WAAW,EAAE,CAwB/D"}

package/dist/workers/levenshteinWorker.js

@@ -1,98 +0,0 @@
-/**
- * Levenshtein Worker
- *
- * Worker thread for calculating Levenshtein distances in parallel.
- * Uses workerpool for worker management.
- *
- * @module workers/levenshteinWorker
- */
-import workerpool from '@danielsimonjr/workerpool/modern';
-/**
- * Calculate Levenshtein distance between two strings.
- *
- * Uses dynamic programming matrix for efficient computation.
- *
- * @param s1 - First string
- * @param s2 - Second string
- * @returns Levenshtein distance (number of edits)
- */
-export function levenshteinDistance(s1, s2) {
-    const len1 = s1.length;
-    const len2 = s2.length;
-    if (len1 === 0)
-        return len2;
-    if (len2 === 0)
-        return len1;
-    const matrix = [];
-    // Initialize first column
-    for (let i = 0; i <= len1; i++) {
-        matrix[i] = [i];
-    }
-    // Initialize first row
-    for (let j = 0; j <= len2; j++) {
-        matrix[0][j] = j;
-    }
-    // Fill matrix
-    for (let i = 1; i <= len1; i++) {
-        for (let j = 1; j <= len2; j++) {
-            const cost = s1[i - 1] === s2[j - 1] ? 0 : 1;
-            matrix[i][j] = Math.min(matrix[i - 1][j] + 1, // deletion
-            matrix[i][j - 1] + 1, // insertion
-            matrix[i - 1][j - 1] + cost // substitution
-            );
-        }
-    }
-    return matrix[len1][len2];
-}
-/**
- * Calculate similarity score between two strings.
- *
- * @param s1 - First string
- * @param s2 - Second string
- * @returns Similarity score (0.0 to 1.0, where 1.0 is identical)
- */
-export function similarity(s1, s2) {
-    // Exact match
-    if (s1 === s2)
-        return 1.0;
-    // One contains the other
-    if (s1.includes(s2) || s2.includes(s1))
-        return 1.0;
-    // Calculate Levenshtein-based similarity
-    const distance = levenshteinDistance(s1, s2);
-    const maxLength = Math.max(s1.length, s2.length);
-    return 1 - distance / maxLength;
-}
-/**
- * Search entities for fuzzy matches.
- *
- * @param data - Worker input containing query, entities, and threshold
- * @returns Array of match results
- */
-export function searchEntities(data) {
-    const { query, entities, threshold } = data;
-    const queryLower = query.toLowerCase();
-    const results = [];
-    for (const entity of entities) {
-        // Check name similarity
-        const nameScore = similarity(queryLower, entity.nameLower);
-        if (nameScore >= threshold) {
-            results.push({ name: entity.name, score: nameScore, matchedIn: 'name' });
-            continue;
-        }
-        // Check observations
-        for (const obs of entity.observations) {
-            const obsScore = similarity(queryLower, obs);
-            if (obsScore >= threshold) {
-                results.push({ name: entity.name, score: obsScore, matchedIn: 'observation' });
-                break;
-            }
-        }
-    }
-    return results;
-}
-// Register worker methods with workerpool
-// Cast to satisfy workerpool's generic type signature
-workerpool.worker({
-    searchEntities: searchEntities,
-});