@wrongstack/vector-memory 0.319.0 → 0.319.1

package/dist/index.js

@@ -165,9 +165,7 @@ function initVectorSchema(db) {
   db.exec("CREATE INDEX IF NOT EXISTS idx_entries_scope ON entries(scope)");
   db.exec("CREATE INDEX IF NOT EXISTS idx_entries_kind ON entries(kind)");
   db.exec("CREATE UNIQUE INDEX IF NOT EXISTS idx_entries_hash ON entries(content_hash)");
-  db.exec(
-    "CREATE INDEX IF NOT EXISTS idx_entries_updated ON entries(updated_at DESC)"
-  );
+  db.exec("CREATE INDEX IF NOT EXISTS idx_entries_updated ON entries(updated_at DESC)");
   db.exec(`
     CREATE TABLE IF NOT EXISTS vectors (
       entry_id TEXT NOT NULL,
@@ -229,15 +227,7 @@ function upsertEmbeddingCache(db, row) {
        last_used_at = excluded.last_used_at,
        use_count = embedding_cache.use_count + 1,
        vector = excluded.vector`
-  ).run(
-    row.contentHash,
-    row.providerId,
-    row.dimensions,
-    row.vector,
-    row.text,
-    row.now,
-    row.now
-  );
+  ).run(row.contentHash, row.providerId, row.dimensions, row.vector, row.text, row.now, row.now);
 }
 function lookupEmbeddingCache(db, contentHash, providerId, dimensions, now) {
   const row = db.prepare(
@@ -934,7 +924,10 @@ function decideWhetherToSync(store, staleAfterMs, now = /* @__PURE__ */ new Date
   const ageMs = Number.isNaN(startedAt) ? Number.POSITIVE_INFINITY : now.getTime() - startedAt;
   const stale = ageMs > staleAfterMs;
   if (existing.pid === void 0) {
-    return Number.isNaN(startedAt) || stale ? { run: true, reason: Number.isNaN(startedAt) ? "running-marker-undated" : "running-marker-stale" } : { run: false, reason: "running-unknown-pid" };
+    return Number.isNaN(startedAt) || stale ? {
+      run: true,
+      reason: Number.isNaN(startedAt) ? "running-marker-undated" : "running-marker-stale"
+    } : { run: false, reason: "running-unknown-pid" };
   }
   try {
     if (pidAlive(existing.pid)) {
@@ -987,7 +980,12 @@ function storeProvider(store) {
   return void 0;
 }
 function counts(report) {
-  return { scanned: report.scanned, indexed: report.indexed, skipped: report.skipped, failed: report.failed };
+  return {
+    scanned: report.scanned,
+    indexed: report.indexed,
+    skipped: report.skipped,
+    failed: report.failed
+  };
 }
 
 // src/tools.ts
@@ -1062,7 +1060,12 @@ function vectorMemorySearchTool(store) {
       type: "object",
       properties: {
         query: { type: "string", minLength: 1, description: "The natural-language query." },
-        limit: { type: "number", minimum: 1, maximum: 100, description: "Max results (default 10)." },
+        limit: {
+          type: "number",
+          minimum: 1,
+          maximum: 100,
+          description: "Max results (default 10)."
+        },
         threshold: {
           type: "number",
           minimum: 0,
@@ -1137,7 +1140,11 @@ function vectorMemoryForgetTool(store) {
     inputSchema: {
       type: "object",
       properties: {
-        id: { type: "string", minLength: 1, description: "Entry id returned by `vector_memory_remember`." }
+        id: {
+          type: "string",
+          minLength: 1,
+          description: "Entry id returned by `vector_memory_remember`."
+        }
       },
       required: ["id"],
       additionalProperties: false
@@ -1317,9 +1324,7 @@ function wrapMemoryPortWithVectorRecall(port, options) {
         // want the per-channel score breakdown get the same fusion
         // behaviour as `searchSage`.
         ...original.searchSageWithBreakdown ? {
-          searchSageWithBreakdown: wrapSearch(
-            original.searchSageWithBreakdown
-          )
+          searchSageWithBreakdown: wrapSearch(original.searchSageWithBreakdown)
         } : {}
       };
     }
@@ -1330,9 +1335,7 @@ function wrapMemoryPortWithVectorRecall(port, options) {
         ...original,
         searchSage: wrapSearch(original.searchSage),
         ...original.searchSageWithBreakdown ? {
-          searchSageWithBreakdown: wrapSearch(
-            original.searchSageWithBreakdown
-          )
+          searchSageWithBreakdown: wrapSearch(original.searchSageWithBreakdown)
         } : {}
       };
     }
@@ -1363,9 +1366,7 @@ function subscribeVectorMemoryToSage(opts) {
     try {
       return await surface.getSage(memoryId);
     } catch (err) {
-      log?.warn?.(
-        `vector-memory mirror fetch failed for ${memoryId}: ${errMsg2(err)}`
-      );
+      log?.warn?.(`vector-memory mirror fetch failed for ${memoryId}: ${errMsg2(err)}`);
       return null;
     }
   };
@@ -1392,9 +1393,7 @@ function subscribeVectorMemoryToSage(opts) {
         }
       });
     } catch (err) {
-      log?.warn?.(
-        `vector-memory mirror remember failed for ${memoryId}: ${errMsg2(err)}`
-      );
+      log?.warn?.(`vector-memory mirror remember failed for ${memoryId}: ${errMsg2(err)}`);
     }
   };
   const forgetMirror = async (memoryId) => {
@@ -1402,9 +1401,7 @@ function subscribeVectorMemoryToSage(opts) {
       const existing = store.findBySageId(memoryId);
       if (existing) await store.forget(existing.id);
     } catch (err) {
-      log?.warn?.(
-        `vector-memory mirror forget failed for ${memoryId}: ${errMsg2(err)}`
-      );
+      log?.warn?.(`vector-memory mirror forget failed for ${memoryId}: ${errMsg2(err)}`);
     }
   };
   const offAccepted = events.onPattern("memory.accepted", (_event, payload) => {
@@ -1456,9 +1453,7 @@ async function forgetStaleSageMirrors(store, memoryStore, logger) {
         await store.forget(entry.id);
         removed++;
       } catch (err) {
-        logger?.warn?.(
-          `vector-memory stale-mirror sweep failed for ${sageId}: ${errMsg2(err)}`
-        );
+        logger?.warn?.(`vector-memory stale-mirror sweep failed for ${sageId}: ${errMsg2(err)}`);
       }
     }
     if (page.length < 1e3) break;
@@ -1499,8 +1494,8 @@ async function runSearchRace(query, lexical, vectorStore, options = {}) {
     overlap.push({
       id,
       lexicalScore: score,
-      vectorScore: 0,
-      // patched below
+      vectorScore: null,
+      // patched below when a vector hit carries this id
       preview: previewText(mem.text, 140)
     });
   }
@@ -1523,7 +1518,7 @@ async function runSearchRace(query, lexical, vectorStore, options = {}) {
   }
   for (let i = overlap.length - 1; i >= 0; i--) {
     const row = overlap[i];
-    if (row.vectorScore === 0) {
+    if (row.vectorScore === null) {
       lexicalOnly.push({
         id: row.id,
         lexicalScore: row.lexicalScore,
@@ -1540,6 +1535,8 @@ async function runSearchRace(query, lexical, vectorStore, options = {}) {
     query,
     lexicalOnly,
     vectorOnly,
+    // The sweep above removed every row still carrying a null vectorScore,
+    // so every remaining row holds a real number here.
     overlap,
     metrics: {
       lexicalCount,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@wrongstack/vector-memory",
-  "version": "0.319.0",
+  "version": "0.319.1",
   "license": "MIT",
   "description": "WrongStack Vector Memory — an additional vector-search memory store powered by @huggingface/transformers (local ONNX embeddings), alongside the SAGE lexical memory system.",
   "repository": {
@@ -27,9 +27,9 @@
     "README.md"
   ],
   "dependencies": {
-    "@wrongstack/core": "0.319.0",
-    "@wrongstack/persistence": "0.319.0",
-    "@wrongstack/sage": "0.319.0"
+    "@wrongstack/core": "0.319.1",
+    "@wrongstack/persistence": "0.319.1",
+    "@wrongstack/sage": "0.319.1"
   },
   "optionalDependencies": {
     "@huggingface/transformers": "^4.2.0"