@usewhisper/mcp-server 0.1.0 → 0.3.0

package/dist/chunk-OBLI4FE4.js

@@ -0,0 +1,276 @@
+import {
+  buildRelationGraph,
+  calculateTemporalRelevance,
+  parseTemporalQuery
+} from "./chunk-UYWE7HSU.js";
+import {
+  db,
+  embedSingle
+} from "./chunk-X2DL2GWT.js";
+
+// src/engine/memory/search.ts
+async function searchMemories(params) {
+  const {
+    query,
+    questionDate,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    topK = 10,
+    includeInactive = false,
+    memoryTypes
+  } = params;
+  const temporal = params.temporalFilter || await parseTemporalQuery(query, questionDate);
+  const queryEmbedding = await embedSingle(query);
+  const semanticResults = await vectorSearchMemories({
+    embedding: queryEmbedding,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    temporal,
+    includeInactive,
+    memoryTypes,
+    limit: topK * 3
+    // Get more for reranking
+  });
+  if (semanticResults.length === 0) {
+    return [];
+  }
+  const enriched = await enrichWithRelations(semanticResults, topK * 2);
+  const scored = enriched.map((memory) => ({
+    ...memory,
+    temporalScore: memory.documentDate ? calculateTemporalRelevance(memory.documentDate, questionDate) : 0.5
+  }));
+  const combined = scored.map((m) => ({
+    ...m,
+    finalScore: m.similarity * 0.7 + m.temporalScore * 0.3
+  }));
+  combined.sort((a, b) => b.finalScore - a.finalScore);
+  const topMemories = combined.slice(0, topK);
+  const results = await injectSourceChunks(topMemories);
+  return results;
+}
+async function vectorSearchMemories(params) {
+  const {
+    embedding,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    temporal,
+    includeInactive,
+    memoryTypes,
+    limit
+  } = params;
+  const whereConditions = [
+    { projectId }
+  ];
+  if (orgId) {
+    whereConditions.push({ orgId });
+  }
+  if (userId) {
+    whereConditions.push({ userId });
+  }
+  if (sessionId) {
+    whereConditions.push({ sessionId });
+  }
+  if (!includeInactive) {
+    whereConditions.push({ isActive: true });
+  }
+  whereConditions.push({
+    OR: [
+      { validUntil: null },
+      { validUntil: { gt: /* @__PURE__ */ new Date() } }
+    ]
+  });
+  if (memoryTypes && memoryTypes.length > 0) {
+    whereConditions.push({
+      memoryType: { in: memoryTypes }
+    });
+  }
+  if (temporal.hasTemporalConstraint && temporal.dateRange) {
+    whereConditions.push({
+      documentDate: {
+        gte: temporal.dateRange.start,
+        lte: temporal.dateRange.end
+      }
+    });
+  }
+  const embeddingStr = `[${embedding.join(",")}]`;
+  const results = await db.$queryRaw`
+    SELECT
+      id,
+      content,
+      "memoryType",
+      "entityMentions",
+      confidence,
+      version,
+      "documentDate",
+      "eventDate",
+      "validFrom",
+      "validUntil",
+      "sourceChunkId",
+      metadata,
+      1 - (embedding <=> ${embeddingStr}::vector) as similarity
+    FROM memories
+    WHERE
+      "projectId" = ${projectId}
+      ${orgId ? db.$queryRaw`AND "orgId" = ${orgId}` : db.$queryRaw``}
+      ${userId ? db.$queryRaw`AND "userId" = ${userId}` : db.$queryRaw``}
+      ${sessionId ? db.$queryRaw`AND "sessionId" = ${sessionId}` : db.$queryRaw``}
+      ${!includeInactive ? db.$queryRaw`AND "isActive" = true` : db.$queryRaw``}
+      AND ("validUntil" IS NULL OR "validUntil" > NOW())
+      ${memoryTypes && memoryTypes.length > 0 ? db.$queryRaw`AND "memoryType" = ANY(${memoryTypes})` : db.$queryRaw``}
+      ${temporal.hasTemporalConstraint && temporal.dateRange ? db.$queryRaw`AND "documentDate" >= ${temporal.dateRange.start} AND "documentDate" <= ${temporal.dateRange.end}` : db.$queryRaw``}
+    ORDER BY similarity DESC
+    LIMIT ${limit}
+  `;
+  return results;
+}
+async function enrichWithRelations(memories, maxTotal) {
+  if (memories.length === 0) {
+    return [];
+  }
+  const memoryIds = memories.map((m) => m.id);
+  const relations = await db.memoryRelation.findMany({
+    where: {
+      OR: [
+        { fromMemoryId: { in: memoryIds } },
+        { toMemoryId: { in: memoryIds } }
+      ]
+    }
+  });
+  if (relations.length === 0) {
+    return memories;
+  }
+  const graph = buildRelationGraph(relations);
+  const relatedIds = /* @__PURE__ */ new Set();
+  for (const memory of memories) {
+    const neighbors = graph.get(memory.id) || [];
+    for (const neighbor of neighbors.slice(0, 3)) {
+      relatedIds.add(neighbor.memoryId);
+    }
+  }
+  memoryIds.forEach((id) => relatedIds.delete(id));
+  if (relatedIds.size === 0) {
+    return memories;
+  }
+  const related = await db.memory.findMany({
+    where: {
+      id: { in: Array.from(relatedIds) },
+      isActive: true
+    },
+    take: maxTotal - memories.length
+  });
+  const relatedWithScores = related.map((m) => ({
+    ...m,
+    similarity: 0.6,
+    // Lower score for related but not directly matched
+    isRelated: true
+  }));
+  return [...memories, ...relatedWithScores];
+}
+async function injectSourceChunks(memories) {
+  const chunkIds = memories.map((m) => m.sourceChunkId).filter((id) => id !== null);
+  if (chunkIds.length === 0) {
+    return memories.map((m) => ({
+      memory: {
+        id: m.id,
+        content: m.content,
+        memoryType: m.memoryType,
+        entityMentions: m.entityMentions || [],
+        confidence: m.confidence,
+        version: m.version,
+        temporal: {
+          documentDate: m.documentDate,
+          eventDate: m.eventDate,
+          validFrom: m.validFrom,
+          validUntil: m.validUntil
+        }
+      },
+      similarity: m.similarity
+    }));
+  }
+  const chunks = await db.chunk.findMany({
+    where: {
+      id: { in: chunkIds }
+    },
+    select: {
+      id: true,
+      content: true,
+      metadata: true
+    }
+  });
+  const chunkMap = new Map(chunks.map((c) => [c.id, c]));
+  return memories.map((m) => ({
+    memory: {
+      id: m.id,
+      content: m.content,
+      memoryType: m.memoryType,
+      entityMentions: m.entityMentions || [],
+      confidence: m.confidence,
+      version: m.version,
+      temporal: {
+        documentDate: m.documentDate,
+        eventDate: m.eventDate,
+        validFrom: m.validFrom,
+        validUntil: m.validUntil
+      }
+    },
+    chunk: m.sourceChunkId && chunkMap.has(m.sourceChunkId) ? {
+      id: chunkMap.get(m.sourceChunkId).id,
+      content: chunkMap.get(m.sourceChunkId).content,
+      metadata: chunkMap.get(m.sourceChunkId).metadata
+    } : void 0,
+    similarity: m.similarity,
+    relations: m.isRelated ? [] : void 0
+  }));
+}
+async function getSessionMemories(params) {
+  const { sessionId, projectId, limit = 50, sinceDate } = params;
+  const where = {
+    sessionId,
+    projectId,
+    isActive: true
+  };
+  if (sinceDate) {
+    where.createdAt = { gte: sinceDate };
+  }
+  return db.memory.findMany({
+    where,
+    orderBy: {
+      createdAt: "desc"
+    },
+    take: limit
+  });
+}
+async function getUserProfile(params) {
+  const { userId, projectId, memoryTypes } = params;
+  const where = {
+    userId,
+    projectId,
+    isActive: true,
+    scope: "USER"
+    // Long-term user-level memories
+  };
+  if (memoryTypes) {
+    where.memoryType = { in: memoryTypes };
+  }
+  return db.memory.findMany({
+    where,
+    orderBy: {
+      importance: "desc"
+    },
+    take: 100
+    // Top 100 most important user memories
+  });
+}
+
+export {
+  searchMemories,
+  getSessionMemories,
+  getUserProfile
+};
+//# sourceMappingURL=chunk-OBLI4FE4.js.map

package/dist/chunk-OBLI4FE4.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/engine/memory/search.ts"],"sourcesContent":["/**\n * SOTA Memory Search Engine\n * Memory-first hybrid search with temporal filtering and graph traversal\n * Beats Supermemory's 81.6% and targets 85%+ on LongMemEval\n */\n\nimport { db } from \"../../db/index.js\";\nimport { embed, embedSingle } from \"../embeddings.js\";\nimport { parseTemporalQuery, calculateTemporalRelevance } from \"./temporal.js\";\nimport { buildRelationGraph } from \"./relations.js\";\nimport type { MemorySearchParams, MemorySearchResult } from \"./types.js\";\n\n/**\n * Main memory search function\n * Implements memory-first hybrid approach from Supermemory\n */\nexport async function searchMemories(\n  params: MemorySearchParams\n): Promise<MemorySearchResult[]> {\n  const {\n    query,\n    questionDate,\n    userId,\n    projectId,\n    orgId,\n    sessionId,\n    topK = 10,\n    includeInactive = false,\n    memoryTypes,\n  } = params;\n\n  // Step 1: Parse temporal constraints from query\n  const temporal = params.temporalFilter || await parseTemporalQuery(query, questionDate);\n\n  // Step 2: Embed query for semantic search\n  const queryEmbedding = await embedSingle(query);\n\n  // Step 3: Vector search on memories (NOT chunks!)\n  const semanticResults = await vectorSearchMemories({\n    embedding: queryEmbedding,\n    userId,\n    projectId,\n    orgId,\n    sessionId,\n    temporal,\n    includeInactive,\n    memoryTypes,\n    limit: topK * 3, // Get more for reranking\n  });\n\n  if (semanticResults.length === 0) {\n    return [];\n  }\n\n  // Step 4: Graph traversal - enrich with related memories\n  const enriched = await enrichWithRelations(semanticResults, topK * 2);\n\n  // Step 5: Temporal relevance scoring\n  const scored = enriched.map((memory) => ({\n    ...memory,\n    temporalScore: memory.documentDate\n      ? calculateTemporalRelevance(memory.documentDate, questionDate)\n      : 0.5,\n  }));\n\n  // Step 6: Combine scores (semantic + temporal)\n  const combined = scored.map((m) => ({\n    ...m,\n    finalScore: m.similarity * 0.7 + m.temporalScore * 0.3,\n  }));\n\n  // Step 7: Sort by final score\n  combined.sort((a, b) => b.finalScore - a.finalScore);\n\n  // Step 8: Take top K\n  const topMemories = combined.slice(0, topK);\n\n  // Step 9: Inject source chunks for context\n  const results = await injectSourceChunks(topMemories);\n\n  return results;\n}\n\n/**\n * Vector search on memories table\n */\nasync function vectorSearchMemories(params: {\n  embedding: number[];\n  userId?: string;\n  projectId: string;\n  orgId?: string;\n  sessionId?: string;\n  temporal: { hasTemporalConstraint: boolean; dateRange?: { start: Date; end: Date } };\n  includeInactive: boolean;\n  memoryTypes?: string[];\n  limit: number;\n}): Promise<any[]> {\n  const {\n    embedding,\n    userId,\n    projectId,\n    orgId,\n    sessionId,\n    temporal,\n    includeInactive,\n    memoryTypes,\n    limit,\n  } = params;\n\n  // Build where clause\n  const whereConditions: any[] = [\n    { projectId },\n  ];\n\n  if (orgId) {\n    whereConditions.push({ orgId });\n  }\n\n  if (userId) {\n    whereConditions.push({ userId });\n  }\n\n  if (sessionId) {\n    whereConditions.push({ sessionId });\n  }\n\n  if (!includeInactive) {\n    whereConditions.push({ isActive: true });\n  }\n\n  // Only get current versions (validUntil = null)\n  whereConditions.push({\n    OR: [\n      { validUntil: null },\n      { validUntil: { gt: new Date() } },\n    ],\n  });\n\n  if (memoryTypes && memoryTypes.length > 0) {\n    whereConditions.push({\n      memoryType: { in: memoryTypes },\n    });\n  }\n\n  // Temporal filtering\n  if (temporal.hasTemporalConstraint && temporal.dateRange) {\n    whereConditions.push({\n      documentDate: {\n        gte: temporal.dateRange.start,\n        lte: temporal.dateRange.end,\n      },\n    });\n  }\n\n  // Vector similarity search using Prisma raw SQL\n  // Note: Adjust this based on your actual vector column setup\n  const embeddingStr = `[${embedding.join(\",\")}]`;\n\n  const results = await db.$queryRaw`\n    SELECT\n      id,\n      content,\n      \"memoryType\",\n      \"entityMentions\",\n      confidence,\n      version,\n      \"documentDate\",\n      \"eventDate\",\n      \"validFrom\",\n      \"validUntil\",\n      \"sourceChunkId\",\n      metadata,\n      1 - (embedding <=> ${embeddingStr}::vector) as similarity\n    FROM memories\n    WHERE\n      \"projectId\" = ${projectId}\n      ${orgId ? db.$queryRaw`AND \"orgId\" = ${orgId}` : db.$queryRaw``}\n      ${userId ? db.$queryRaw`AND \"userId\" = ${userId}` : db.$queryRaw``}\n      ${sessionId ? db.$queryRaw`AND \"sessionId\" = ${sessionId}` : db.$queryRaw``}\n      ${!includeInactive ? db.$queryRaw`AND \"isActive\" = true` : db.$queryRaw``}\n      AND (\"validUntil\" IS NULL OR \"validUntil\" > NOW())\n      ${memoryTypes && memoryTypes.length > 0\n        ? db.$queryRaw`AND \"memoryType\" = ANY(${memoryTypes})`\n        : db.$queryRaw``}\n      ${temporal.hasTemporalConstraint && temporal.dateRange\n        ? db.$queryRaw`AND \"documentDate\" >= ${temporal.dateRange.start} AND \"documentDate\" <= ${temporal.dateRange.end}`\n        : db.$queryRaw``}\n    ORDER BY similarity DESC\n    LIMIT ${limit}\n  `;\n\n  return results as any[];\n}\n\n/**\n * Enrich memories with related memories via graph traversal\n * Follows \"extends\", \"derives\", \"supports\" relations\n */\nasync function enrichWithRelations(\n  memories: any[],\n  maxTotal: number\n): Promise<any[]> {\n  if (memories.length === 0) {\n    return [];\n  }\n\n  const memoryIds = memories.map((m) => m.id);\n\n  // Get all relations for these memories\n  const relations = await db.memoryRelation.findMany({\n    where: {\n      OR: [\n        { fromMemoryId: { in: memoryIds } },\n        { toMemoryId: { in: memoryIds } },\n      ],\n    },\n  });\n\n  if (relations.length === 0) {\n    return memories;\n  }\n\n  // Build graph\n  const graph = buildRelationGraph(relations);\n\n  // Collect related memory IDs\n  const relatedIds = new Set<string>();\n\n  for (const memory of memories) {\n    const neighbors = graph.get(memory.id) || [];\n\n    // Add neighbors (but limit to avoid explosion)\n    for (const neighbor of neighbors.slice(0, 3)) {\n      // Max 3 per memory\n      relatedIds.add(neighbor.memoryId);\n    }\n  }\n\n  // Remove already included memories\n  memoryIds.forEach((id) => relatedIds.delete(id));\n\n  if (relatedIds.size === 0) {\n    return memories;\n  }\n\n  // Fetch related memories\n  const related = await db.memory.findMany({\n    where: {\n      id: { in: Array.from(relatedIds) },\n      isActive: true,\n    },\n    take: maxTotal - memories.length,\n  });\n\n  // Assign lower similarity scores to related memories\n  const relatedWithScores = related.map((m: any) => ({\n    ...m,\n    similarity: 0.6, // Lower score for related but not directly matched\n    isRelated: true,\n  }));\n\n  return [...memories, ...relatedWithScores];\n}\n\n/**\n * Inject source chunks for top memories\n * Provides full context for LLM\n */\nasync function injectSourceChunks(\n  memories: any[]\n): Promise<MemorySearchResult[]> {\n  const chunkIds = memories\n    .map((m) => m.sourceChunkId)\n    .filter((id): id is string => id !== null);\n\n  if (chunkIds.length === 0) {\n    // Return memories without chunks\n    return memories.map((m) => ({\n      memory: {\n        id: m.id,\n        content: m.content,\n        memoryType: m.memoryType,\n        entityMentions: m.entityMentions || [],\n        confidence: m.confidence,\n        version: m.version,\n        temporal: {\n          documentDate: m.documentDate,\n          eventDate: m.eventDate,\n          validFrom: m.validFrom,\n          validUntil: m.validUntil,\n        },\n      },\n      similarity: m.similarity,\n    }));\n  }\n\n  // Fetch chunks\n  const chunks = await db.chunk.findMany({\n    where: {\n      id: { in: chunkIds },\n    },\n    select: {\n      id: true,\n      content: true,\n      metadata: true,\n    },\n  });\n\n  const chunkMap = new Map(chunks.map((c) => [c.id, c]));\n\n  // Map memories to results with chunks\n  return memories.map((m) => ({\n    memory: {\n      id: m.id,\n      content: m.content,\n      memoryType: m.memoryType,\n      entityMentions: m.entityMentions || [],\n      confidence: m.confidence,\n      version: m.version,\n      temporal: {\n        documentDate: m.documentDate,\n        eventDate: m.eventDate,\n        validFrom: m.validFrom,\n        validUntil: m.validUntil,\n      },\n    },\n    chunk: m.sourceChunkId && chunkMap.has(m.sourceChunkId)\n      ? {\n          id: chunkMap.get(m.sourceChunkId)!.id,\n          content: chunkMap.get(m.sourceChunkId)!.content,\n          metadata: chunkMap.get(m.sourceChunkId)!.metadata,\n        }\n      : undefined,\n    similarity: m.similarity,\n    relations: m.isRelated ? [] : undefined,\n  }));\n}\n\n/**\n * Session-based memory query\n * Gets recent memories from a session for context building\n */\nexport async function getSessionMemories(params: {\n  sessionId: string;\n  projectId: string;\n  limit?: number;\n  sinceDate?: Date;\n}): Promise<any[]> {\n  const { sessionId, projectId, limit = 50, sinceDate } = params;\n\n  const where: any = {\n    sessionId,\n    projectId,\n    isActive: true,\n  };\n\n  if (sinceDate) {\n    where.createdAt = { gte: sinceDate };\n  }\n\n  return db.memory.findMany({\n    where,\n    orderBy: {\n      createdAt: \"desc\",\n    },\n    take: limit,\n  });\n}\n\n/**\n * User profile memory query\n * Gets long-term user preferences and facts\n */\nexport async function getUserProfile(params: {\n  userId: string;\n  projectId: string;\n  memoryTypes?: string[];\n}): Promise<any[]> {\n  const { userId, projectId, memoryTypes } = params;\n\n  const where: any = {\n    userId,\n    projectId,\n    isActive: true,\n    scope: \"USER\", // Long-term user-level memories\n  };\n\n  if (memoryTypes) {\n    where.memoryType = { in: memoryTypes };\n  }\n\n  return db.memory.findMany({\n    where,\n    orderBy: {\n      importance: \"desc\",\n    },\n    take: 100, // Top 100 most important user memories\n  });\n}\n"],"mappings":";;;;;;;;;;;AAgBA,eAAsB,eACpB,QAC+B;AAC/B,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,kBAAkB;AAAA,IAClB;AAAA,EACF,IAAI;AAGJ,QAAM,WAAW,OAAO,kBAAkB,MAAM,mBAAmB,OAAO,YAAY;AAGtF,QAAM,iBAAiB,MAAM,YAAY,KAAK;AAG9C,QAAM,kBAAkB,MAAM,qBAAqB;AAAA,IACjD,WAAW;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,OAAO;AAAA;AAAA,EAChB,CAAC;AAED,MAAI,gBAAgB,WAAW,GAAG;AAChC,WAAO,CAAC;AAAA,EACV;AAGA,QAAM,WAAW,MAAM,oBAAoB,iBAAiB,OAAO,CAAC;AAGpE,QAAM,SAAS,SAAS,IAAI,CAAC,YAAY;AAAA,IACvC,GAAG;AAAA,IACH,eAAe,OAAO,eAClB,2BAA2B,OAAO,cAAc,YAAY,IAC5D;AAAA,EACN,EAAE;AAGF,QAAM,WAAW,OAAO,IAAI,CAAC,OAAO;AAAA,IAClC,GAAG;AAAA,IACH,YAAY,EAAE,aAAa,MAAM,EAAE,gBAAgB;AAAA,EACrD,EAAE;AAGF,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU;AAGnD,QAAM,cAAc,SAAS,MAAM,GAAG,IAAI;AAG1C,QAAM,UAAU,MAAM,mBAAmB,WAAW;AAEpD,SAAO;AACT;AAKA,eAAe,qBAAqB,QAUjB;AACjB,QAAM;AAAA,IACJ;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,IAAI;AAGJ,QAAM,kBAAyB;AAAA,IAC7B,EAAE,UAAU;AAAA,EACd;AAEA,MAAI,OAAO;AACT,oBAAgB,KAAK,EAAE,MAAM,CAAC;AAAA,EAChC;AAEA,MAAI,QAAQ;AACV,oBAAgB,KAAK,EAAE,OAAO,CAAC;AAAA,EACjC;AAEA,MAAI,WAAW;AACb,oBAAgB,KAAK,EAAE,UAAU,CAAC;AAAA,EACpC;AAEA,MAAI,CAAC,iBAAiB;AACpB,oBAAgB,KAAK,EAAE,UAAU,KAAK,CAAC;AAAA,EACzC;AAGA,kBAAgB,KAAK;AAAA,IACnB,IAAI;AAAA,MACF,EAAE,YAAY,KAAK;AAAA,MACnB,EAAE,YAAY,EAAE,IAAI,oBAAI,KAAK,EAAE,EAAE;AAAA,IACnC;AAAA,EACF,CAAC;AAED,MAAI,eAAe,YAAY,SAAS,GAAG;AACzC,oBAAgB,KAAK;AAAA,MACnB,YAAY,EAAE,IAAI,YAAY;AAAA,IAChC,CAAC;AAAA,EACH;AAGA,MAAI,SAAS,yBAAyB,SAAS,WAAW;AACxD,oBAAgB,KAAK;AAAA,MACnB,cAAc;AAAA,QACZ,KAAK,SAAS,UAAU;AAAA,QACxB,KAAK,SAAS,UAAU;AAAA,MAC1B;AAAA,IACF,CAAC;AAAA,EACH;AAIA,QAAM,eAAe,IAAI,UAAU,KAAK,GAAG,CAAC;AAE5C,QAAM,UAAU,MAAM,GAAG;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2BAcA,YAAY;AAAA;AAAA;AAAA,sBAGjB,SAAS;AAAA,QACvB,QAAQ,GAAG,0BAA0B,KAAK,KAAK,GAAG,WAAW;AAAA,QAC7D,SAAS,GAAG,2BAA2B,MAAM,KAAK,GAAG,WAAW;AAAA,QAChE,YAAY,GAAG,8BAA8B,SAAS,KAAK,GAAG,WAAW;AAAA,QACzE,CAAC,kBAAkB,GAAG,mCAAmC,GAAG,WAAW;AAAA;AAAA,QAEvE,eAAe,YAAY,SAAS,IAClC,GAAG,mCAAmC,WAAW,MACjD,GAAG,WAAW;AAAA,QAChB,SAAS,yBAAyB,SAAS,YACzC,GAAG,kCAAkC,SAAS,UAAU,KAAK,0BAA0B,SAAS,UAAU,GAAG,KAC7G,GAAG,WAAW;AAAA;AAAA,YAEZ,KAAK;AAAA;AAGf,SAAO;AACT;AAMA,eAAe,oBACb,UACA,UACgB;AAChB,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,YAAY,SAAS,IAAI,CAAC,MAAM,EAAE,EAAE;AAG1C,QAAM,YAAY,MAAM,GAAG,eAAe,SAAS;AAAA,IACjD,OAAO;AAAA,MACL,IAAI;AAAA,QACF,EAAE,cAAc,EAAE,IAAI,UAAU,EAAE;AAAA,QAClC,EAAE,YAAY,EAAE,IAAI,UAAU,EAAE;AAAA,MAClC;AAAA,IACF;AAAA,EACF,CAAC;AAED,MAAI,UAAU,WAAW,GAAG;AAC1B,WAAO;AAAA,EACT;AAGA,QAAM,QAAQ,mBAAmB,SAAS;AAG1C,QAAM,aAAa,oBAAI,IAAY;AAEnC,aAAW,UAAU,UAAU;AAC7B,UAAM,YAAY,MAAM,IAAI,OAAO,EAAE,KAAK,CAAC;AAG3C,eAAW,YAAY,UAAU,MAAM,GAAG,CAAC,GAAG;AAE5C,iBAAW,IAAI,SAAS,QAAQ;AAAA,IAClC;AAAA,EACF;AAGA,YAAU,QAAQ,CAAC,OAAO,WAAW,OAAO,EAAE,CAAC;AAE/C,MAAI,WAAW,SAAS,GAAG;AACzB,WAAO;AAAA,EACT;AAGA,QAAM,UAAU,MAAM,GAAG,OAAO,SAAS;AAAA,IACvC,OAAO;AAAA,MACL,IAAI,EAAE,IAAI,MAAM,KAAK,UAAU,EAAE;AAAA,MACjC,UAAU;AAAA,IACZ;AAAA,IACA,MAAM,WAAW,SAAS;AAAA,EAC5B,CAAC;AAGD,QAAM,oBAAoB,QAAQ,IAAI,CAAC,OAAY;AAAA,IACjD,GAAG;AAAA,IACH,YAAY;AAAA;AAAA,IACZ,WAAW;AAAA,EACb,EAAE;AAEF,SAAO,CAAC,GAAG,UAAU,GAAG,iBAAiB;AAC3C;AAMA,eAAe,mBACb,UAC+B;AAC/B,QAAM,WAAW,SACd,IAAI,CAAC,MAAM,EAAE,aAAa,EAC1B,OAAO,CAAC,OAAqB,OAAO,IAAI;AAE3C,MAAI,SAAS,WAAW,GAAG;AAEzB,WAAO,SAAS,IAAI,CAAC,OAAO;AAAA,MAC1B,QAAQ;AAAA,QACN,IAAI,EAAE;AAAA,QACN,SAAS,EAAE;AAAA,QACX,YAAY,EAAE;AAAA,QACd,gBAAgB,EAAE,kBAAkB,CAAC;AAAA,QACrC,YAAY,EAAE;AAAA,QACd,SAAS,EAAE;AAAA,QACX,UAAU;AAAA,UACR,cAAc,EAAE;AAAA,UAChB,WAAW,EAAE;AAAA,UACb,WAAW,EAAE;AAAA,UACb,YAAY,EAAE;AAAA,QAChB;AAAA,MACF;AAAA,MACA,YAAY,EAAE;AAAA,IAChB,EAAE;AAAA,EACJ;AAGA,QAAM,SAAS,MAAM,GAAG,MAAM,SAAS;AAAA,IACrC,OAAO;AAAA,MACL,IAAI,EAAE,IAAI,SAAS;AAAA,IACrB;AAAA,IACA,QAAQ;AAAA,MACN,IAAI;AAAA,MACJ,SAAS;AAAA,MACT,UAAU;AAAA,IACZ;AAAA,EACF,CAAC;AAED,QAAM,WAAW,IAAI,IAAI,OAAO,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;AAGrD,SAAO,SAAS,IAAI,CAAC,OAAO;AAAA,IAC1B,QAAQ;AAAA,MACN,IAAI,EAAE;AAAA,MACN,SAAS,EAAE;AAAA,MACX,YAAY,EAAE;AAAA,MACd,gBAAgB,EAAE,kBAAkB,CAAC;AAAA,MACrC,YAAY,EAAE;AAAA,MACd,SAAS,EAAE;AAAA,MACX,UAAU;AAAA,QACR,cAAc,EAAE;AAAA,QAChB,WAAW,EAAE;AAAA,QACb,WAAW,EAAE;AAAA,QACb,YAAY,EAAE;AAAA,MAChB;AAAA,IACF;AAAA,IACA,OAAO,EAAE,iBAAiB,SAAS,IAAI,EAAE,aAAa,IAClD;AAAA,MACE,IAAI,SAAS,IAAI,EAAE,aAAa,EAAG;AAAA,MACnC,SAAS,SAAS,IAAI,EAAE,aAAa,EAAG;AAAA,MACxC,UAAU,SAAS,IAAI,EAAE,aAAa,EAAG;AAAA,IAC3C,IACA;AAAA,IACJ,YAAY,EAAE;AAAA,IACd,WAAW,EAAE,YAAY,CAAC,IAAI;AAAA,EAChC,EAAE;AACJ;AAMA,eAAsB,mBAAmB,QAKtB;AACjB,QAAM,EAAE,WAAW,WAAW,QAAQ,IAAI,UAAU,IAAI;AAExD,QAAM,QAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA,UAAU;AAAA,EACZ;AAEA,MAAI,WAAW;AACb,UAAM,YAAY,EAAE,KAAK,UAAU;AAAA,EACrC;AAEA,SAAO,GAAG,OAAO,SAAS;AAAA,IACxB;AAAA,IACA,SAAS;AAAA,MACP,WAAW;AAAA,IACb;AAAA,IACA,MAAM;AAAA,EACR,CAAC;AACH;AAMA,eAAsB,eAAe,QAIlB;AACjB,QAAM,EAAE,QAAQ,WAAW,YAAY,IAAI;AAE3C,QAAM,QAAa;AAAA,IACjB;AAAA,IACA;AAAA,IACA,UAAU;AAAA,IACV,OAAO;AAAA;AAAA,EACT;AAEA,MAAI,aAAa;AACf,UAAM,aAAa,EAAE,IAAI,YAAY;AAAA,EACvC;AAEA,SAAO,GAAG,OAAO,SAAS;AAAA,IACxB;AAAA,IACA,SAAS;AAAA,MACP,YAAY;AAAA,IACd;AAAA,IACA,MAAM;AAAA;AAAA,EACR,CAAC;AACH;","names":[]}

package/dist/chunk-PPGYJJED.js

@@ -0,0 +1,271 @@
+import {
+  buildRelationGraph,
+  calculateTemporalRelevance,
+  parseTemporalQuery
+} from "./chunk-LMEYV4JD.js";
+import {
+  db,
+  embedSingle
+} from "./chunk-3WGYBAYR.js";
+
+// ../src/engine/memory/search.ts
+async function searchMemories(params) {
+  const {
+    query,
+    questionDate,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    topK = 10,
+    includeInactive = false,
+    memoryTypes
+  } = params;
+  const temporal = params.temporalFilter || await parseTemporalQuery(query, questionDate);
+  const queryEmbedding = await embedSingle(query);
+  const semanticResults = await vectorSearchMemories({
+    embedding: queryEmbedding,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    temporal,
+    includeInactive,
+    memoryTypes,
+    limit: topK * 3
+    // Get more for reranking
+  });
+  if (semanticResults.length === 0) {
+    return [];
+  }
+  const enriched = await enrichWithRelations(semanticResults, topK * 2);
+  const scored = enriched.map((memory) => ({
+    ...memory,
+    temporalScore: memory.documentDate ? calculateTemporalRelevance(memory.documentDate, questionDate) : 0.5
+  }));
+  const combined = scored.map((m) => ({
+    ...m,
+    finalScore: m.similarity * 0.7 + m.temporalScore * 0.3
+  }));
+  combined.sort((a, b) => b.finalScore - a.finalScore);
+  const topMemories = combined.slice(0, topK);
+  const results = await injectSourceChunks(topMemories);
+  return results;
+}
+async function vectorSearchMemories(params) {
+  const {
+    embedding,
+    userId,
+    projectId,
+    orgId,
+    sessionId,
+    temporal,
+    includeInactive,
+    memoryTypes,
+    limit
+  } = params;
+  const whereConditions = [
+    { projectId }
+  ];
+  if (orgId) {
+    whereConditions.push({ orgId });
+  }
+  if (userId) {
+    whereConditions.push({ userId });
+  }
+  if (sessionId) {
+    whereConditions.push({ sessionId });
+  }
+  if (!includeInactive) {
+    whereConditions.push({ isActive: true });
+  }
+  whereConditions.push({
+    OR: [
+      { validUntil: null },
+      { validUntil: { gt: /* @__PURE__ */ new Date() } }
+    ]
+  });
+  if (memoryTypes && memoryTypes.length > 0) {
+    whereConditions.push({
+      memoryType: { in: memoryTypes }
+    });
+  }
+  if (temporal.hasTemporalConstraint && temporal.dateRange) {
+    whereConditions.push({
+      documentDate: {
+        gte: temporal.dateRange.start,
+        lte: temporal.dateRange.end
+      }
+    });
+  }
+  const embeddingStr = `[${embedding.join(",")}]`;
+  const results = await db.$queryRaw`
+    SELECT
+      id,
+      content,
+      "memoryType",
+      "entityMentions",
+      confidence,
+      version,
+      "documentDate",
+      "eventDate",
+      "validFrom",
+      "validUntil",
+      "sourceChunkId",
+      metadata,
+      1 - (embedding <=> ${embeddingStr}::vector) as similarity
+    FROM memories
+    WHERE
+      "projectId" = ${projectId}
+      ${orgId ? db.$queryRaw`AND "orgId" = ${orgId}` : db.$queryRaw``}
+      ${userId ? db.$queryRaw`AND "userId" = ${userId}` : db.$queryRaw``}
+      ${sessionId ? db.$queryRaw`AND "sessionId" = ${sessionId}` : db.$queryRaw``}
+      ${!includeInactive ? db.$queryRaw`AND "isActive" = true` : db.$queryRaw``}
+      AND ("validUntil" IS NULL OR "validUntil" > NOW())
+      ${memoryTypes && memoryTypes.length > 0 ? db.$queryRaw`AND "memoryType" = ANY(${memoryTypes})` : db.$queryRaw``}
+      ${temporal.hasTemporalConstraint && temporal.dateRange ? db.$queryRaw`AND "documentDate" >= ${temporal.dateRange.start} AND "documentDate" <= ${temporal.dateRange.end}` : db.$queryRaw``}
+    ORDER BY similarity DESC
+    LIMIT ${limit}
+  `;
+  return results;
+}
+async function enrichWithRelations(memories, maxTotal) {
+  if (memories.length === 0) {
+    return [];
+  }
+  const memoryIds = memories.map((m) => m.id);
+  const relations = await db.memoryRelation.findMany({
+    where: {
+      OR: [
+        { fromMemoryId: { in: memoryIds } },
+        { toMemoryId: { in: memoryIds } }
+      ]
+    }
+  });
+  if (relations.length === 0) {
+    return memories;
+  }
+  const graph = buildRelationGraph(relations);
+  const relatedIds = /* @__PURE__ */ new Set();
+  for (const memory of memories) {
+    const neighbors = graph.get(memory.id) || [];
+    for (const neighbor of neighbors.slice(0, 3)) {
+      relatedIds.add(neighbor.memoryId);
+    }
+  }
+  memoryIds.forEach((id) => relatedIds.delete(id));
+  if (relatedIds.size === 0) {
+    return memories;
+  }
+  const related = await db.memory.findMany({
+    where: {
+      id: { in: Array.from(relatedIds) },
+      isActive: true
+    },
+    take: maxTotal - memories.length
+  });
+  const relatedWithScores = related.map((m) => ({
+    ...m,
+    similarity: 0.6,
+    // Lower score for related but not directly matched
+    isRelated: true
+  }));
+  return [...memories, ...relatedWithScores];
+}
+async function injectSourceChunks(memories) {
+  const chunkIds = memories.map((m) => m.sourceChunkId).filter((id) => id !== null);
+  if (chunkIds.length === 0) {
+    return memories.map((m) => ({
+      memory: {
+        id: m.id,
+        content: m.content,
+        memoryType: m.memoryType,
+        entityMentions: m.entityMentions || [],
+        confidence: m.confidence,
+        version: m.version,
+        temporal: {
+          documentDate: m.documentDate,
+          eventDate: m.eventDate,
+          validFrom: m.validFrom,
+          validUntil: m.validUntil
+        }
+      },
+      similarity: m.similarity
+    }));
+  }
+  const chunks = await db.chunk.findMany({
+    where: {
+      id: { in: chunkIds }
+    },
+    select: {
+      id: true,
+      content: true,
+      metadata: true
+    }
+  });
+  const chunkMap = new Map(chunks.map((c) => [c.id, c]));
+  return memories.map((m) => ({
+    memory: {
+      id: m.id,
+      content: m.content,
+      memoryType: m.memoryType,
+      entityMentions: m.entityMentions || [],
+      confidence: m.confidence,
+      version: m.version,
+      temporal: {
+        documentDate: m.documentDate,
+        eventDate: m.eventDate,
+        validFrom: m.validFrom,
+        validUntil: m.validUntil
+      }
+    },
+    chunk: m.sourceChunkId && chunkMap.has(m.sourceChunkId) ? {
+      id: chunkMap.get(m.sourceChunkId).id,
+      content: chunkMap.get(m.sourceChunkId).content,
+      metadata: chunkMap.get(m.sourceChunkId).metadata
+    } : void 0,
+    similarity: m.similarity,
+    relations: m.isRelated ? [] : void 0
+  }));
+}
+async function getSessionMemories(params) {
+  const { sessionId, projectId, limit = 50, sinceDate } = params;
+  const where = {
+    sessionId,
+    projectId,
+    isActive: true
+  };
+  if (sinceDate) {
+    where.createdAt = { gte: sinceDate };
+  }
+  return db.memory.findMany({
+    where,
+    orderBy: {
+      createdAt: "desc"
+    },
+    take: limit
+  });
+}
+async function getUserProfile(params) {
+  const { userId, projectId, memoryTypes, limit = 50 } = params;
+  const where = {
+    userId,
+    projectId,
+    isActive: true,
+    scope: "USER"
+  };
+  if (memoryTypes) {
+    where.memoryType = { in: memoryTypes };
+  }
+  return db.memory.findMany({
+    where,
+    orderBy: { importance: "desc" },
+    take: Math.min(limit, 100)
+  });
+}
+
+export {
+  searchMemories,
+  getSessionMemories,
+  getUserProfile
+};

package/dist/chunk-QGM4M3NI.js

@@ -0,0 +1,37 @@
+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 __require = /* @__PURE__ */ ((x) => typeof require !== "undefined" ? require : typeof Proxy !== "undefined" ? new Proxy(x, {
+  get: (a, b) => (typeof require !== "undefined" ? require : a)[b]
+}) : x)(function(x) {
+  if (typeof require !== "undefined") return require.apply(this, arguments);
+  throw Error('Dynamic require of "' + x + '" is not supported');
+});
+var __commonJS = (cb, mod) => function __require2() {
+  return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;
+};
+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
+));
+
+export {
+  __require,
+  __commonJS,
+  __toESM
+};