@prmichaelsen/remember-mcp 3.14.9 → 3.14.10

package/dist/server-factory.js

@@ -2451,6 +2451,56 @@ var MemoryService = class {
       limit
     };
   }
+  // ── By Density (relationship count) ────────────────────────────────
+  async byDensity(input) {
+    const limit = input.limit ?? 50;
+    const offset = input.offset ?? 0;
+    const memoryFilters = buildMemoryOnlyFilters(this.collection, input.filters);
+    const ghostFilters = [];
+    if (input.ghost_context) {
+      ghostFilters.push(buildTrustFilter(this.collection, input.ghost_context.accessor_trust_level));
+    }
+    if (!input.ghost_context?.include_ghost_content) {
+      ghostFilters.push(this.collection.filter.byProperty("content_type").notEqual("ghost"));
+    }
+    const densityFilters = [];
+    if (input.min_relationship_count !== void 0) {
+      densityFilters.push(this.collection.filter.byProperty("relationship_count").greaterOrEqual(input.min_relationship_count));
+    }
+    const executeQuery = async (useDeletedFilter) => {
+      const deletedFilter = useDeletedFilter ? buildDeletedFilter(this.collection, input.deleted_filter || "exclude") : null;
+      const combinedFilters = combineFiltersWithAnd([deletedFilter, memoryFilters, ...ghostFilters, ...densityFilters].filter((f) => f !== null));
+      const queryOptions = {
+        limit: limit + offset,
+        sort: [
+          {
+            property: "relationship_count",
+            order: "desc"
+            // Highest first
+          }
+        ]
+      };
+      if (combinedFilters) {
+        queryOptions.filters = combinedFilters;
+      }
+      return this.collection.query.fetchObjects(queryOptions);
+    };
+    const results = await this.retryWithoutDeletedFilter(executeQuery);
+    const paginated = results.objects.slice(offset);
+    const memories = [];
+    for (const obj of paginated) {
+      const doc = { id: obj.uuid, ...obj.properties };
+      if (doc.doc_type === "memory") {
+        memories.push(doc);
+      }
+    }
+    return {
+      memories,
+      total: memories.length,
+      offset,
+      limit
+    };
+  }
   // ── Find Similar (vector) ──────────────────────────────────────────
   async findSimilar(input) {
     if (!input.memory_id && !input.text)

package/dist/server.js

@@ -2135,6 +2135,56 @@ var MemoryService = class {
       limit
     };
   }
+  // ── By Density (relationship count) ────────────────────────────────
+  async byDensity(input) {
+    const limit = input.limit ?? 50;
+    const offset = input.offset ?? 0;
+    const memoryFilters = buildMemoryOnlyFilters(this.collection, input.filters);
+    const ghostFilters = [];
+    if (input.ghost_context) {
+      ghostFilters.push(buildTrustFilter(this.collection, input.ghost_context.accessor_trust_level));
+    }
+    if (!input.ghost_context?.include_ghost_content) {
+      ghostFilters.push(this.collection.filter.byProperty("content_type").notEqual("ghost"));
+    }
+    const densityFilters = [];
+    if (input.min_relationship_count !== void 0) {
+      densityFilters.push(this.collection.filter.byProperty("relationship_count").greaterOrEqual(input.min_relationship_count));
+    }
+    const executeQuery = async (useDeletedFilter) => {
+      const deletedFilter = useDeletedFilter ? buildDeletedFilter(this.collection, input.deleted_filter || "exclude") : null;
+      const combinedFilters = combineFiltersWithAnd([deletedFilter, memoryFilters, ...ghostFilters, ...densityFilters].filter((f) => f !== null));
+      const queryOptions = {
+        limit: limit + offset,
+        sort: [
+          {
+            property: "relationship_count",
+            order: "desc"
+            // Highest first
+          }
+        ]
+      };
+      if (combinedFilters) {
+        queryOptions.filters = combinedFilters;
+      }
+      return this.collection.query.fetchObjects(queryOptions);
+    };
+    const results = await this.retryWithoutDeletedFilter(executeQuery);
+    const paginated = results.objects.slice(offset);
+    const memories = [];
+    for (const obj of paginated) {
+      const doc = { id: obj.uuid, ...obj.properties };
+      if (doc.doc_type === "memory") {
+        memories.push(doc);
+      }
+    }
+    return {
+      memories,
+      total: memories.length,
+      offset,
+      limit
+    };
+  }
   // ── Find Similar (vector) ──────────────────────────────────────────
   async findSimilar(input) {
     if (!input.memory_id && !input.text)

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@prmichaelsen/remember-mcp",
-  "version": "3.14.9",
+  "version": "3.14.10",
   "description": "Multi-tenant memory system MCP server with vector search and relationships",
   "main": "dist/server.js",
   "type": "module",