@danielsimonjr/memoryjs 1.0.0 → 1.2.0

package/dist/workers/levenshteinWorker.cjs

@@ -0,0 +1,102 @@
+"use strict";
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(
+  // If the importer is in node compatibility mode or this is not an ESM
+  // file that has been converted to a CommonJS file using a Babel-
+  // compatible transform (i.e. "__esModule" has not been set), then set
+  // "default" to the CommonJS "module.exports" for node compatibility.
+  isNodeMode || !mod || !mod.__esModule ? __defProp(target, "default", { value: mod, enumerable: true }) : target,
+  mod
+));
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/workers/levenshteinWorker.ts
+var levenshteinWorker_exports = {};
+__export(levenshteinWorker_exports, {
+  levenshteinDistance: () => levenshteinDistance,
+  searchEntities: () => searchEntities,
+  similarity: () => similarity
+});
+module.exports = __toCommonJS(levenshteinWorker_exports);
+var import_workerpool = __toESM(require("@danielsimonjr/workerpool"), 1);
+function levenshteinDistance(s1, s2) {
+  const len1 = s1.length;
+  const len2 = s2.length;
+  if (len1 === 0) return len2;
+  if (len2 === 0) return len1;
+  const matrix = [];
+  for (let i = 0; i <= len1; i++) {
+    matrix[i] = [i];
+  }
+  for (let j = 0; j <= len2; j++) {
+    matrix[0][j] = j;
+  }
+  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];
+}
+function similarity(s1, s2) {
+  if (s1 === s2) return 1;
+  if (s1.includes(s2) || s2.includes(s1)) return 1;
+  const distance = levenshteinDistance(s1, s2);
+  const maxLength = Math.max(s1.length, s2.length);
+  return 1 - distance / maxLength;
+}
+function searchEntities(data) {
+  const { query, entities, threshold } = data;
+  const queryLower = query.toLowerCase();
+  const results = [];
+  for (const entity of entities) {
+    const nameScore = similarity(queryLower, entity.nameLower);
+    if (nameScore >= threshold) {
+      results.push({ name: entity.name, score: nameScore, matchedIn: "name" });
+      continue;
+    }
+    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;
+}
+import_workerpool.default.worker({
+  searchEntities
+});
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  levenshteinDistance,
+  searchEntities,
+  similarity
+});
+//# sourceMappingURL=levenshteinWorker.cjs.map

package/dist/workers/levenshteinWorker.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/workers/levenshteinWorker.ts"],"sourcesContent":["/**\r\n * Levenshtein Worker\r\n *\r\n * Worker thread for calculating Levenshtein distances in parallel.\r\n * Uses workerpool for worker management.\r\n *\r\n * @module workers/levenshteinWorker\r\n */\r\n\r\nimport workerpool from '@danielsimonjr/workerpool';\r\n\r\n/**\r\n * Input data structure for the worker.\r\n */\r\nexport interface WorkerInput {\r\n  /** Search query string */\r\n  query: string;\r\n  /** Array of entities to search */\r\n  entities: Array<{\r\n    name: string;\r\n    nameLower: string;\r\n    observations: string[];\r\n  }>;\r\n  /** Similarity threshold (0.0 to 1.0) */\r\n  threshold: number;\r\n}\r\n\r\n/**\r\n * Match result returned by the worker.\r\n */\r\nexport interface MatchResult {\r\n  /** Entity name that matched */\r\n  name: string;\r\n  /** Similarity score (0.0 to 1.0) */\r\n  score: number;\r\n  /** Where the match occurred */\r\n  matchedIn: 'name' | 'observation';\r\n}\r\n\r\n/**\r\n * Calculate Levenshtein distance between two strings.\r\n *\r\n * Uses dynamic programming matrix for efficient computation.\r\n *\r\n * @param s1 - First string\r\n * @param s2 - Second string\r\n * @returns Levenshtein distance (number of edits)\r\n */\r\nexport function levenshteinDistance(s1: string, s2: string): number {\r\n  const len1 = s1.length;\r\n  const len2 = s2.length;\r\n\r\n  if (len1 === 0) return len2;\r\n  if (len2 === 0) return len1;\r\n\r\n  const matrix: number[][] = [];\r\n\r\n  // Initialize first column\r\n  for (let i = 0; i <= len1; i++) {\r\n    matrix[i] = [i];\r\n  }\r\n\r\n  // Initialize first row\r\n  for (let j = 0; j <= len2; j++) {\r\n    matrix[0][j] = j;\r\n  }\r\n\r\n  // Fill matrix\r\n  for (let i = 1; i <= len1; i++) {\r\n    for (let j = 1; j <= len2; j++) {\r\n      const cost = s1[i - 1] === s2[j - 1] ? 0 : 1;\r\n      matrix[i][j] = Math.min(\r\n        matrix[i - 1][j] + 1, // deletion\r\n        matrix[i][j - 1] + 1, // insertion\r\n        matrix[i - 1][j - 1] + cost // substitution\r\n      );\r\n    }\r\n  }\r\n\r\n  return matrix[len1][len2];\r\n}\r\n\r\n/**\r\n * Calculate similarity score between two strings.\r\n *\r\n * @param s1 - First string\r\n * @param s2 - Second string\r\n * @returns Similarity score (0.0 to 1.0, where 1.0 is identical)\r\n */\r\nexport function similarity(s1: string, s2: string): number {\r\n  // Exact match\r\n  if (s1 === s2) return 1.0;\r\n\r\n  // One contains the other\r\n  if (s1.includes(s2) || s2.includes(s1)) return 1.0;\r\n\r\n  // Calculate Levenshtein-based similarity\r\n  const distance = levenshteinDistance(s1, s2);\r\n  const maxLength = Math.max(s1.length, s2.length);\r\n  return 1 - distance / maxLength;\r\n}\r\n\r\n/**\r\n * Search entities for fuzzy matches.\r\n *\r\n * @param data - Worker input containing query, entities, and threshold\r\n * @returns Array of match results\r\n */\r\nexport function searchEntities(data: WorkerInput): MatchResult[] {\r\n  const { query, entities, threshold } = data;\r\n  const queryLower = query.toLowerCase();\r\n  const results: MatchResult[] = [];\r\n\r\n  for (const entity of entities) {\r\n    // Check name similarity\r\n    const nameScore = similarity(queryLower, entity.nameLower);\r\n    if (nameScore >= threshold) {\r\n      results.push({ name: entity.name, score: nameScore, matchedIn: 'name' });\r\n      continue;\r\n    }\r\n\r\n    // Check observations\r\n    for (const obs of entity.observations) {\r\n      const obsScore = similarity(queryLower, obs);\r\n      if (obsScore >= threshold) {\r\n        results.push({ name: entity.name, score: obsScore, matchedIn: 'observation' });\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  return results;\r\n}\r\n\r\n// Register worker methods with workerpool\r\n// Cast to satisfy workerpool's generic type signature\r\nworkerpool.worker({\r\n  searchEntities: searchEntities as (...args: unknown[]) => unknown,\r\n});\r\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AASA,wBAAuB;AAuChB,SAAS,oBAAoB,IAAY,IAAoB;AAClE,QAAM,OAAO,GAAG;AAChB,QAAM,OAAO,GAAG;AAEhB,MAAI,SAAS,EAAG,QAAO;AACvB,MAAI,SAAS,EAAG,QAAO;AAEvB,QAAM,SAAqB,CAAC;AAG5B,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,WAAO,CAAC,IAAI,CAAC,CAAC;AAAA,EAChB;AAGA,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,WAAO,CAAC,EAAE,CAAC,IAAI;AAAA,EACjB;AAGA,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,aAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,YAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,IAAI;AAC3C,aAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,QAClB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA;AAAA,QACnB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,QACnB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,OAAO,IAAI,EAAE,IAAI;AAC1B;AASO,SAAS,WAAW,IAAY,IAAoB;AAEzD,MAAI,OAAO,GAAI,QAAO;AAGtB,MAAI,GAAG,SAAS,EAAE,KAAK,GAAG,SAAS,EAAE,EAAG,QAAO;AAG/C,QAAM,WAAW,oBAAoB,IAAI,EAAE;AAC3C,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,GAAG,MAAM;AAC/C,SAAO,IAAI,WAAW;AACxB;AAQO,SAAS,eAAe,MAAkC;AAC/D,QAAM,EAAE,OAAO,UAAU,UAAU,IAAI;AACvC,QAAM,aAAa,MAAM,YAAY;AACrC,QAAM,UAAyB,CAAC;AAEhC,aAAW,UAAU,UAAU;AAE7B,UAAM,YAAY,WAAW,YAAY,OAAO,SAAS;AACzD,QAAI,aAAa,WAAW;AAC1B,cAAQ,KAAK,EAAE,MAAM,OAAO,MAAM,OAAO,WAAW,WAAW,OAAO,CAAC;AACvE;AAAA,IACF;AAGA,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,WAAW,WAAW,YAAY,GAAG;AAC3C,UAAI,YAAY,WAAW;AACzB,gBAAQ,KAAK,EAAE,MAAM,OAAO,MAAM,OAAO,UAAU,WAAW,cAAc,CAAC;AAC7E;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAIA,kBAAAA,QAAW,OAAO;AAAA,EAChB;AACF,CAAC;","names":["workerpool"]}

package/dist/workers/levenshteinWorker.js

@@ -1,99 +1,65 @@
-/**
- * Levenshtein Worker
- *
- * Worker thread for calculating Levenshtein distances in parallel.
- * Uses workerpool for worker management.
- *
- * @module workers/levenshteinWorker
- */
-import workerpool from '@danielsimonjr/workerpool';
-/**
- * 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];
+// src/workers/levenshteinWorker.ts
+import workerpool from "@danielsimonjr/workerpool";
+function levenshteinDistance(s1, s2) {
+  const len1 = s1.length;
+  const len2 = s2.length;
+  if (len1 === 0) return len2;
+  if (len2 === 0) return len1;
+  const matrix = [];
+  for (let i = 0; i <= len1; i++) {
+    matrix[i] = [i];
+  }
+  for (let j = 0; j <= len2; j++) {
+    matrix[0][j] = j;
+  }
+  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
+      );
     }
-    // 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];
+  }
+  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;
+function similarity(s1, s2) {
+  if (s1 === s2) return 1;
+  if (s1.includes(s2) || s2.includes(s1)) return 1;
+  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;
-            }
-        }
+function searchEntities(data) {
+  const { query, entities, threshold } = data;
+  const queryLower = query.toLowerCase();
+  const results = [];
+  for (const entity of entities) {
+    const nameScore = similarity(queryLower, entity.nameLower);
+    if (nameScore >= threshold) {
+      results.push({ name: entity.name, score: nameScore, matchedIn: "name" });
+      continue;
+    }
+    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;
+  }
+  return results;
 }
-// Register worker methods with workerpool
-// Cast to satisfy workerpool's generic type signature
 workerpool.worker({
-    searchEntities: searchEntities,
+  searchEntities
 });
+export {
+  levenshteinDistance,
+  searchEntities,
+  similarity
+};
 //# sourceMappingURL=levenshteinWorker.js.map

package/dist/workers/levenshteinWorker.js.map

@@ -1 +1 @@
-{"version":3,"file":"levenshteinWorker.js","sourceRoot":"","sources":["../../src/workers/levenshteinWorker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,UAAU,MAAM,2BAA2B,CAAC;AA8BnD;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAU,EAAE,EAAU;IACxD,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC;IACvB,MAAM,IAAI,GAAG,EAAE,CAAC,MAAM,CAAC;IAEvB,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC5B,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,0BAA0B;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,uBAAuB;IACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,cAAc;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACrB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,WAAW;YACjC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,YAAY;YAClC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe;aAC5C,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,UAAU,CAAC,EAAU,EAAE,EAAU;IAC/C,cAAc;IACd,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAE1B,yBAAyB;IACzB,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAO,GAAG,CAAC;IAEnD,yCAAyC;IACzC,MAAM,QAAQ,GAAG,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IACjD,OAAO,CAAC,GAAG,QAAQ,GAAG,SAAS,CAAC;AAClC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,IAAiB;IAC9C,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC;IAC5C,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,wBAAwB;QACxB,MAAM,SAAS,GAAG,UAAU,CAAC,UAAU,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;QAC3D,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC,CAAC;YACzE,SAAS;QACX,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;YAC7C,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC1B,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC;gBAC/E,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,0CAA0C;AAC1C,sDAAsD;AACtD,UAAU,CAAC,MAAM,CAAC;IAChB,cAAc,EAAE,cAAiD;CAClE,CAAC,CAAC"}
+{"version":3,"sources":["../../src/workers/levenshteinWorker.ts"],"sourcesContent":["/**\r\n * Levenshtein Worker\r\n *\r\n * Worker thread for calculating Levenshtein distances in parallel.\r\n * Uses workerpool for worker management.\r\n *\r\n * @module workers/levenshteinWorker\r\n */\r\n\r\nimport workerpool from '@danielsimonjr/workerpool';\r\n\r\n/**\r\n * Input data structure for the worker.\r\n */\r\nexport interface WorkerInput {\r\n  /** Search query string */\r\n  query: string;\r\n  /** Array of entities to search */\r\n  entities: Array<{\r\n    name: string;\r\n    nameLower: string;\r\n    observations: string[];\r\n  }>;\r\n  /** Similarity threshold (0.0 to 1.0) */\r\n  threshold: number;\r\n}\r\n\r\n/**\r\n * Match result returned by the worker.\r\n */\r\nexport interface MatchResult {\r\n  /** Entity name that matched */\r\n  name: string;\r\n  /** Similarity score (0.0 to 1.0) */\r\n  score: number;\r\n  /** Where the match occurred */\r\n  matchedIn: 'name' | 'observation';\r\n}\r\n\r\n/**\r\n * Calculate Levenshtein distance between two strings.\r\n *\r\n * Uses dynamic programming matrix for efficient computation.\r\n *\r\n * @param s1 - First string\r\n * @param s2 - Second string\r\n * @returns Levenshtein distance (number of edits)\r\n */\r\nexport function levenshteinDistance(s1: string, s2: string): number {\r\n  const len1 = s1.length;\r\n  const len2 = s2.length;\r\n\r\n  if (len1 === 0) return len2;\r\n  if (len2 === 0) return len1;\r\n\r\n  const matrix: number[][] = [];\r\n\r\n  // Initialize first column\r\n  for (let i = 0; i <= len1; i++) {\r\n    matrix[i] = [i];\r\n  }\r\n\r\n  // Initialize first row\r\n  for (let j = 0; j <= len2; j++) {\r\n    matrix[0][j] = j;\r\n  }\r\n\r\n  // Fill matrix\r\n  for (let i = 1; i <= len1; i++) {\r\n    for (let j = 1; j <= len2; j++) {\r\n      const cost = s1[i - 1] === s2[j - 1] ? 0 : 1;\r\n      matrix[i][j] = Math.min(\r\n        matrix[i - 1][j] + 1, // deletion\r\n        matrix[i][j - 1] + 1, // insertion\r\n        matrix[i - 1][j - 1] + cost // substitution\r\n      );\r\n    }\r\n  }\r\n\r\n  return matrix[len1][len2];\r\n}\r\n\r\n/**\r\n * Calculate similarity score between two strings.\r\n *\r\n * @param s1 - First string\r\n * @param s2 - Second string\r\n * @returns Similarity score (0.0 to 1.0, where 1.0 is identical)\r\n */\r\nexport function similarity(s1: string, s2: string): number {\r\n  // Exact match\r\n  if (s1 === s2) return 1.0;\r\n\r\n  // One contains the other\r\n  if (s1.includes(s2) || s2.includes(s1)) return 1.0;\r\n\r\n  // Calculate Levenshtein-based similarity\r\n  const distance = levenshteinDistance(s1, s2);\r\n  const maxLength = Math.max(s1.length, s2.length);\r\n  return 1 - distance / maxLength;\r\n}\r\n\r\n/**\r\n * Search entities for fuzzy matches.\r\n *\r\n * @param data - Worker input containing query, entities, and threshold\r\n * @returns Array of match results\r\n */\r\nexport function searchEntities(data: WorkerInput): MatchResult[] {\r\n  const { query, entities, threshold } = data;\r\n  const queryLower = query.toLowerCase();\r\n  const results: MatchResult[] = [];\r\n\r\n  for (const entity of entities) {\r\n    // Check name similarity\r\n    const nameScore = similarity(queryLower, entity.nameLower);\r\n    if (nameScore >= threshold) {\r\n      results.push({ name: entity.name, score: nameScore, matchedIn: 'name' });\r\n      continue;\r\n    }\r\n\r\n    // Check observations\r\n    for (const obs of entity.observations) {\r\n      const obsScore = similarity(queryLower, obs);\r\n      if (obsScore >= threshold) {\r\n        results.push({ name: entity.name, score: obsScore, matchedIn: 'observation' });\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  return results;\r\n}\r\n\r\n// Register worker methods with workerpool\r\n// Cast to satisfy workerpool's generic type signature\r\nworkerpool.worker({\r\n  searchEntities: searchEntities as (...args: unknown[]) => unknown,\r\n});\r\n"],"mappings":";AASA,OAAO,gBAAgB;AAuChB,SAAS,oBAAoB,IAAY,IAAoB;AAClE,QAAM,OAAO,GAAG;AAChB,QAAM,OAAO,GAAG;AAEhB,MAAI,SAAS,EAAG,QAAO;AACvB,MAAI,SAAS,EAAG,QAAO;AAEvB,QAAM,SAAqB,CAAC;AAG5B,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,WAAO,CAAC,IAAI,CAAC,CAAC;AAAA,EAChB;AAGA,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,WAAO,CAAC,EAAE,CAAC,IAAI;AAAA,EACjB;AAGA,WAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,aAAS,IAAI,GAAG,KAAK,MAAM,KAAK;AAC9B,YAAM,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,IAAI;AAC3C,aAAO,CAAC,EAAE,CAAC,IAAI,KAAK;AAAA,QAClB,OAAO,IAAI,CAAC,EAAE,CAAC,IAAI;AAAA;AAAA,QACnB,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,QACnB,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI;AAAA;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AAEA,SAAO,OAAO,IAAI,EAAE,IAAI;AAC1B;AASO,SAAS,WAAW,IAAY,IAAoB;AAEzD,MAAI,OAAO,GAAI,QAAO;AAGtB,MAAI,GAAG,SAAS,EAAE,KAAK,GAAG,SAAS,EAAE,EAAG,QAAO;AAG/C,QAAM,WAAW,oBAAoB,IAAI,EAAE;AAC3C,QAAM,YAAY,KAAK,IAAI,GAAG,QAAQ,GAAG,MAAM;AAC/C,SAAO,IAAI,WAAW;AACxB;AAQO,SAAS,eAAe,MAAkC;AAC/D,QAAM,EAAE,OAAO,UAAU,UAAU,IAAI;AACvC,QAAM,aAAa,MAAM,YAAY;AACrC,QAAM,UAAyB,CAAC;AAEhC,aAAW,UAAU,UAAU;AAE7B,UAAM,YAAY,WAAW,YAAY,OAAO,SAAS;AACzD,QAAI,aAAa,WAAW;AAC1B,cAAQ,KAAK,EAAE,MAAM,OAAO,MAAM,OAAO,WAAW,WAAW,OAAO,CAAC;AACvE;AAAA,IACF;AAGA,eAAW,OAAO,OAAO,cAAc;AACrC,YAAM,WAAW,WAAW,YAAY,GAAG;AAC3C,UAAI,YAAY,WAAW;AACzB,gBAAQ,KAAK,EAAE,MAAM,OAAO,MAAM,OAAO,UAAU,WAAW,cAAc,CAAC;AAC7E;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;AAIA,WAAW,OAAO;AAAA,EAChB;AACF,CAAC;","names":[]}

package/package.json

@@ -1,69 +1,75 @@
-{
-  "name": "@danielsimonjr/memoryjs",
-  "version": "1.0.0",
-  "description": "Core knowledge graph library with search, storage, and graph algorithms",
-  "type": "module",
-  "main": "dist/index.js",
-  "types": "dist/index.d.ts",
-  "exports": {
-    ".": {
-      "types": "./dist/index.d.ts",
-      "import": "./dist/index.js"
-    }
-  },
-  "bin": {
-    "memoryjs": "./dist/index.js"
-  },
-  "files": [
-    "dist",
-    "README.md",
-    "LICENSE"
-  ],
-  "scripts": {
-    "build": "tsc",
-    "build:watch": "tsc --watch",
-    "typecheck": "tsc --noEmit",
-    "test": "vitest run",
-    "test:watch": "vitest",
-    "test:coverage": "vitest run --coverage",
-    "clean": "rimraf dist",
-    "prepublishOnly": "npm run clean && npm run build && npm run test"
-  },
-  "keywords": [
-    "knowledge-graph",
-    "graph-database",
-    "entity-management",
-    "search",
-    "sqlite",
-    "jsonl",
-    "semantic-search",
-    "hybrid-search"
-  ],
-  "author": "Daniel Simon Jr",
-  "license": "MIT",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/danielsimonjr/memoryjs.git"
-  },
-  "bugs": {
-    "url": "https://github.com/danielsimonjr/memoryjs/issues"
-  },
-  "homepage": "https://github.com/danielsimonjr/memoryjs#readme",
-  "engines": {
-    "node": ">=18.0.0"
-  },
-  "dependencies": {
-    "@danielsimonjr/workerpool": "^10.0.1",
-    "async-mutex": "^0.5.0",
-    "better-sqlite3": "^11.7.0",
-    "zod": "^3.24.1"
-  },
-  "devDependencies": {
-    "@types/better-sqlite3": "^7.6.12",
-    "@types/node": "^22.10.5",
-    "@vitest/coverage-v8": "^4.0.16",
-    "rimraf": "^6.0.1",
-    "typescript": "^5.7.2",
-    "vitest": "^4.0.16"
-  }
-}
+{
+  "name": "@danielsimonjr/memoryjs",
+  "version": "1.2.0",
+  "description": "Core knowledge graph library with search, storage, and graph algorithms",
+  "type": "module",
+  "main": "dist/index.cjs",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "require": "./dist/index.cjs"
+    }
+  },
+  "bin": {
+    "memoryjs": "./dist/index.js"
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsup",
+    "build:watch": "tsup --watch",
+    "build:tsc": "tsc",
+    "typecheck": "tsc --noEmit",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:coverage": "vitest run --coverage",
+    "clean": "rimraf dist",
+    "prepublishOnly": "npm run clean && npm run build && npm run test",
+    "tools:install": "cd tools/chunking-for-files && npm install && cd ../compress-for-context && npm install && cd ../create-dependency-graph && npm install && cd ../migrate-from-jsonl-to-sqlite && npm install",
+    "tools:build": "cd tools/chunking-for-files && npm run build && cd ../compress-for-context && npm run build && cd ../create-dependency-graph && npm run build && cd ../migrate-from-jsonl-to-sqlite && npm run build"
+  },
+  "keywords": [
+    "knowledge-graph",
+    "graph-database",
+    "entity-management",
+    "search",
+    "sqlite",
+    "jsonl",
+    "semantic-search",
+    "hybrid-search"
+  ],
+  "author": "Daniel Simon Jr",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/danielsimonjr/memoryjs.git"
+  },
+  "bugs": {
+    "url": "https://github.com/danielsimonjr/memoryjs/issues"
+  },
+  "homepage": "https://github.com/danielsimonjr/memoryjs#readme",
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "dependencies": {
+    "@danielsimonjr/workerpool": "^10.0.1",
+    "async-mutex": "^0.5.0",
+    "better-sqlite3": "^11.7.0",
+    "zod": "^3.24.1"
+  },
+  "devDependencies": {
+    "@types/better-sqlite3": "^7.6.12",
+    "@types/node": "^22.10.5",
+    "@vitest/coverage-v8": "^4.0.16",
+    "rimraf": "^6.0.1",
+    "tsup": "^8.3.5",
+    "typescript": "^5.7.2",
+    "vitest": "^4.0.16"
+  }
+}