@anuma/sdk 6.38.0 → 6.39.0

package/dist/server/index.mjs

@@ -32242,7 +32242,6 @@ async function recall(query, ctx, options = {}) {
   }
   const needsChunkEmbedding = types.includes("chunk") && ctx.storageCtx;
   const wantsTemporal = types.includes("fact") && (ctx.factSource || ctx.vaultCtx);
-  const graphRefiner = flags.traverse && options.graphRefine && options.decomposeOptions ? createLlmNeighborRefiner(options.decomposeOptions) : void 0;
   const queryEmbedTotalTimeoutMs = options.queryEmbedTotalTimeoutMs ?? DEFAULT_QUERY_EMBED_TOTAL_TIMEOUT_MS;
   const prepStart = nowMs2();
   let sharedEmbedMs = 0;
@@ -32271,13 +32270,12 @@ async function recall(query, ctx, options = {}) {
     safeLane(
       "graph",
       () => graphLaneFailed = true,
-      () => ctx.factSource ? ctx.factSource.graphRanking(query, flags.traverse, options) : buildGraphLaneRanking(query, ctx, flags.traverse, {
-        ...options.maxHops !== void 0 && { maxHops: options.maxHops },
-        ...options.entityFanout !== void 0 && { entityFanout: options.entityFanout },
-        ...options.nodeBudget !== void 0 && { nodeBudget: options.nodeBudget },
-        ...options.rrfK !== void 0 && { rrfK: options.rrfK },
-        ...graphRefiner && { refineNeighbors: graphRefiner }
-      })
+      () => ctx.factSource ? ctx.factSource.graphRanking(query, flags.traverse, options) : buildGraphLaneRanking(
+        query,
+        ctx,
+        flags.traverse,
+        graphTraversalOptions(options, flags.traverse)
+      )
     ),
     wantsTemporal ? safeLane(
       "temporal",
@@ -32496,6 +32494,16 @@ function toFactMemory(r, now) {
     updatedAt: r.updatedAt ?? /* @__PURE__ */ new Date(0)
   };
 }
+function graphTraversalOptions(options, traverse) {
+  const refineNeighbors = traverse && options.graphRefine && options.decomposeOptions ? createLlmNeighborRefiner(options.decomposeOptions) : void 0;
+  return {
+    ...options.maxHops !== void 0 && { maxHops: options.maxHops },
+    ...options.entityFanout !== void 0 && { entityFanout: options.entityFanout },
+    ...options.nodeBudget !== void 0 && { nodeBudget: options.nodeBudget },
+    ...options.rrfK !== void 0 && { rrfK: options.rrfK },
+    ...refineNeighbors && { refineNeighbors }
+  };
+}
 async function buildGraphLaneRanking(query, ctx, traverse = false, traversalOptions = {}) {
   const entityCtx = ctx.entityCtx ?? ctx.vaultCtx?.entityCtx;
   if (!entityCtx) return [];
@@ -32661,24 +32669,33 @@ function isDumpQuery(query) {
   return false;
 }
 async function listRecentFacts(ctx, limit, toolOptions) {
+  const store = toolOptions?.memoryStore;
   const vaultCtx = ctx.vaultCtx;
-  if (!vaultCtx) return [];
-  const ordered = await getVaultRankingProjectionsOp(vaultCtx, {
+  if (!vaultCtx && !store) return [];
+  const read = (ids) => store ? store.list({ memoryIds: ids }) : getVaultMemoriesByIdsOp(vaultCtx, ids);
+  const filters = {
     ...toolOptions?.scopes && { scopes: toolOptions.scopes },
-    ...toolOptions?.memoryIds !== void 0 && { memoryIds: toolOptions.memoryIds },
+    ...toolOptions?.memoryIds !== void 0 && { memoryIds: toolOptions.memoryIds }
+  };
+  const project = (size) => store ? store.listProjections({ ...filters, limit: size }) : getVaultRankingProjectionsOp(vaultCtx, {
+    ...filters,
     ...toolOptions?.folderId !== void 0 && { folderId: toolOptions.folderId }
   });
   const readable = [];
-  for (let i = 0; i < ordered.length && readable.length < limit; i += limit) {
-    const batch = ordered.slice(i, i + limit).map((p) => p.uniqueId);
-    const byId = new Map(
-      (await getVaultMemoriesByIdsOp(vaultCtx, batch)).map((m) => [m.uniqueId, m])
-    );
-    for (const id of batch) {
-      const m = byId.get(id);
-      if (m && !isEncrypted(m.content)) readable.push(m);
-      if (readable.length >= limit) break;
+  let start = 0;
+  for (let size = limit; readable.length < limit; size *= 2) {
+    const ordered = await project(size);
+    for (let i = start; i < ordered.length && readable.length < limit; i += limit) {
+      const batch = ordered.slice(i, i + limit).map((p) => p.uniqueId);
+      const byId = new Map((await read(batch)).map((m) => [m.uniqueId, m]));
+      for (const id of batch) {
+        const m = byId.get(id);
+        if (m && !isEncrypted(m.content)) readable.push(m);
+        if (readable.length >= limit) break;
+      }
     }
+    if (!store || ordered.length < size) break;
+    start = ordered.length;
   }
   return readable.map((m) => ({
     id: m.uniqueId,
@@ -32695,6 +32712,8 @@ async function listRecentFacts(ctx, limit, toolOptions) {
   }));
 }
 function createRecallTool(ctx, toolOptions, callbacks) {
+  if (toolOptions?.memoryStore && toolOptions.folderId !== void 0)
+    throw new Error("Folders are not supported with a memoryStore");
   const defaultTypes = toolOptions?.types ?? ["fact", "chunk"];
   const defaultLimit = toolOptions?.limit ?? DEFAULT_LIMIT2;
   const defaultBudget = toolOptions?.budget ?? DEFAULT_BUDGET2;
@@ -32766,7 +32785,7 @@ function createRecallTool(ctx, toolOptions, callbacks) {
       let surfaced = 0;
       try {
         let recallDegraded = [];
-        const wantsRecent = args.sort === "recent" && defaultTypes.includes("fact") && ctx.vaultCtx !== void 0;
+        const wantsRecent = args.sort === "recent" && defaultTypes.includes("fact") && (ctx.vaultCtx !== void 0 || toolOptions?.memoryStore !== void 0);
         let result;
         if (wantsRecent) {
           result = { memories: await listRecentFacts(ctx, effectiveLimit, toolOptions) };
@@ -33268,6 +33287,7 @@ function createLocalMemoryStore(options) {
     });
   };
   return {
+    masksEmbeddingInput: options.embeddingOptions.maskInput !== void 0,
     list: (listOptions) => getAllVaultMemoriesOp(vaultCtx, listOptions),
     get: (id) => getVaultMemoryOp(vaultCtx, id),
     listArchived: async () => {
@@ -33349,6 +33369,22 @@ function createLocalMemoryStore(options) {
       { vaultCtx, embeddingOptions: options.embeddingOptions, vaultCache },
       retainOptions
     ),
+    factSource: {
+      search: (query, searchOptions) => searchVaultMemoriesWithSize(
+        query,
+        vaultCtx,
+        options.embeddingOptions,
+        vaultCache,
+        searchOptions
+      ),
+      graphRanking: (query, traverse, recallOptions) => buildGraphLaneRanking(
+        query,
+        { vaultCtx, entityCtx, embeddingOptions: options.embeddingOptions },
+        traverse,
+        graphTraversalOptions(recallOptions, traverse)
+      ),
+      temporalRanking: (query, now) => buildTemporalLaneRanking(query, vaultCtx, now)
+    },
     subscribe: (onChange, subscribeOptions) => {
       const afterFirst = () => {
         let first = true;
@@ -35039,19 +35075,20 @@ function createMemoryVaultSearchTool(vaultCtx, embeddingOptions, cache, searchOp
         const budget = wantsDecompose ? "high" : searchOptions?.rerank ? "mid" : "low";
         const folderId = searchOptions?.folderId ?? argFolderId;
         if (searchOptions?.useFusion === false) {
-          const { results: legacy, embeddingsUnavailable } = await searchVaultMemoriesWithSize(
+          const legacyOptions = {
+            limit: requestLimit,
+            minSimilarity,
+            useFusion: false,
+            ...tuningForward,
+            ...folderId !== void 0 && { folderId },
+            ...searchOptions?.scopes && { scopes: searchOptions.scopes }
+          };
+          const { results: legacy, embeddingsUnavailable } = "retain" in vaultCtx ? await vaultCtx.factSource.search(query, legacyOptions) : await searchVaultMemoriesWithSize(
             query,
             vaultCtx,
             embeddingOptions,
             cache,
-            {
-              limit: requestLimit,
-              minSimilarity,
-              useFusion: false,
-              ...tuningForward,
-              ...folderId !== void 0 && { folderId },
-              ...searchOptions?.scopes && { scopes: searchOptions.scopes }
-            }
+            legacyOptions
           );
           if (legacy.length === 0) {
             return embeddingsUnavailable ? EMBEDDINGS_DEGRADED_EMPTY_NO_LEXICAL : "No relevant memories found in the vault.";
@@ -35070,7 +35107,7 @@ function createMemoryVaultSearchTool(vaultCtx, embeddingOptions, cache, searchOp
         let recallDegraded = [];
         const result = await recall(
           query,
-          { vaultCtx, embeddingOptions, vaultCache: cache },
+          "retain" in vaultCtx ? { factSource: vaultCtx.factSource, embeddingOptions } : { vaultCtx, embeddingOptions, vaultCache: cache },
           {
             onDiagnostics: (d) => {
               recallDegraded = d.degraded;
@@ -35150,8 +35187,10 @@ function describeWriteOutcome(outcome) {
   }
 }
 function createMemoryVaultTool(vaultCtx, options, embeddingOptions, cache) {
+  const store = "retain" in vaultCtx ? vaultCtx : void 0;
+  const ctx = "retain" in vaultCtx ? void 0 : vaultCtx;
   const hasOnSave = !!options?.onSave;
-  const folderNames = options?.folderMap ? Array.from(options.folderMap.keys()) : [];
+  const folderNames = !store && options?.folderMap ? Array.from(options.folderMap.keys()) : [];
   return {
     type: "function",
     function: {
@@ -35196,7 +35235,7 @@ function createMemoryVaultTool(vaultCtx, options, embeddingOptions, cache) {
         let previousContent;
         const scope = options?.scope ?? "private";
         if (isUpdate) {
-          const existing = await getVaultMemoryOp(vaultCtx, id);
+          const existing = store ? await store.get(id) : await getVaultMemoryOp(ctx, id);
           if (!existing) {
             return `Error: Memory with ID "${id}" not found. Creating a new memory instead would require a separate call without an ID.`;
           }
@@ -35217,9 +35256,18 @@ function createMemoryVaultTool(vaultCtx, options, embeddingOptions, cache) {
             return isUpdate ? `Memory update was cancelled by the user. The memory "${id}" was not modified.` : "Memory save was cancelled by the user. No memory was created.";
           }
         }
-        if (isUpdate) {
+        if (isUpdate && store) {
+          const updated = await store.update(id, {
+            content,
+            ...factType !== void 0 && { factType }
+          });
+          if (!updated) {
+            return `Error: Failed to update memory "${id}".`;
+          }
+          return `Memory updated successfully (ID: ${updated.uniqueId}).`;
+        } else if (isUpdate) {
           const folderId = folderName ? options?.folderMap?.get(folderName) : void 0;
-          const updated = await updateVaultMemoryOp(vaultCtx, id, {
+          const updated = await updateVaultMemoryOp(ctx, id, {
             content,
             embedding: null,
             folderId,
@@ -35234,7 +35282,7 @@ function createMemoryVaultTool(vaultCtx, options, embeddingOptions, cache) {
               content,
               embeddingOptions,
               cache,
-              vaultCtx,
+              ctx,
               id,
               updated.updatedAt
             ).catch(() => {
@@ -35254,18 +35302,22 @@ function createMemoryVaultTool(vaultCtx, options, embeddingOptions, cache) {
             await notifyWritten(options, input, outcome);
             return describeWriteOutcome(outcome);
           }
-          const created = await createVaultMemoryOp(vaultCtx, {
+          const created = store ? await store.create({
+            content,
+            scope,
+            ...factType !== void 0 && { factType }
+          }) : await createVaultMemoryOp(ctx, {
             content,
             scope,
             folderId,
             ...factType !== void 0 && { factType }
           });
-          if (embeddingOptions && cache) {
+          if (ctx && embeddingOptions && cache) {
             eagerEmbedContent(
               content,
               embeddingOptions,
               cache,
-              vaultCtx,
+              ctx,
               created.uniqueId,
               created.updatedAt
             ).catch(() => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@anuma/sdk",
-  "version": "6.38.0",
+  "version": "6.39.0",
   "description": "",
   "main": "./dist/index.cjs",
   "module": "./dist/index.mjs",