@tekmidian/pai 0.11.0 → 0.12.0

package/dist/index.mjs

@@ -1,12 +1,11 @@
-import { a as initializeSchema, i as SCHEMA_VERSION, n as openRegistry, r as CREATE_TABLES_SQL } from "./db-BtuN768f.mjs";
-import "./utils-BAxjW3j8.mjs";
-import { a as slugify, i as parseSessionFilename, n as decodeEncodedDir, r as migrateFromJson } from "./migrate-fLD6rAdO.mjs";
-import { n as ensurePaiMarker, r as readPaiMarker, t as discoverPaiMarkers } from "./pai-marker-CXQPX2P6.mjs";
-import { i as initializeFederationSchema, n as openFederation, r as FEDERATION_SCHEMA_SQL } from "./db-CYmBWcjh.mjs";
-import { l as chunkMarkdown, r as detectTier, u as estimateTokens } from "./helpers-crDEr6S2.mjs";
-import { i as indexProject, n as indexAll, r as indexFile } from "./sync-CmBKOL3K.mjs";
-import "./embeddings-DGRAPAYb.mjs";
-import { n as populateSlugs, r as searchMemory, t as buildFtsQuery } from "./search-i2nlQ-JM.mjs";
-import { n as rerankResults, t as configureRerankerModel } from "./reranker-CMNZcfVx.mjs";
+import { a as openRegistry, c as initializeSchema, i as indexProject, n as indexAll, o as CREATE_TABLES_SQL, r as indexFile, s as SCHEMA_VERSION } from "./sync-uPR4g438.mjs";
+import "./utils-CqqgB0dH.mjs";
+import { a as slugify, i as parseSessionFilename, n as decodeEncodedDir, r as migrateFromJson } from "./migrate-B02wDDgS.mjs";
+import { n as ensurePaiMarker, r as readPaiMarker, t as discoverPaiMarkers } from "./pai-marker-HVBwwBW-.mjs";
+import { i as initializeFederationSchema, n as openFederation, r as FEDERATION_SCHEMA_SQL } from "./db-CmYbAVCD.mjs";
+import { l as chunkMarkdown, r as detectTier, u as estimateTokens } from "./helpers-IjZkXBhj.mjs";
+import "./embeddings-BJPOcbik.mjs";
+import { n as populateSlugs, r as searchMemory, t as buildFtsQuery } from "./search-HcdKtMla.mjs";
+import { n as rerankResults, t as configureRerankerModel } from "./reranker-C08R99zn.mjs";
 
 export { CREATE_TABLES_SQL, FEDERATION_SCHEMA_SQL, SCHEMA_VERSION, buildFtsQuery, chunkMarkdown, configureRerankerModel, decodeEncodedDir, detectTier, discoverPaiMarkers, ensurePaiMarker, estimateTokens, indexAll, indexFile, indexProject, initializeFederationSchema, initializeSchema, migrateFromJson, openFederation, openRegistry, parseSessionFilename, populateSlugs, readPaiMarker, rerankResults, searchMemory, slugify };

package/dist/{indexer-backend-DcYThufd.mjs → indexer-backend-Cm5RS7y0.mjs}

@@ -1,4 +1,4 @@
-import { a as parseSessionTitleChunk, c as yieldToEventLoop, f as sha256File, i as isPathTooBroadForContentScan, l as chunkMarkdown, n as chunkId, o as walkContentFiles, r as detectTier, s as walkMdFiles, t as INDEX_YIELD_EVERY } from "./helpers-crDEr6S2.mjs";
+import { a as parseSessionTitleChunk, c as yieldToEventLoop, f as sha256File, i as isPathTooBroadForContentScan, l as chunkMarkdown, n as chunkId, o as walkContentFiles, r as detectTier, s as walkMdFiles, t as INDEX_YIELD_EVERY } from "./helpers-IjZkXBhj.mjs";
 import { existsSync, readFileSync, statSync } from "node:fs";
 import { basename, join, relative } from "node:path";
 
@@ -217,7 +217,7 @@ const EMBED_YIELD_EVERY = 1;
 * Returns the number of newly embedded chunks.
 */
 async function embedChunksWithBackend(backend, shouldStop, projectNames) {
-	const { generateEmbedding, serializeEmbedding } = await import("./embeddings-DGRAPAYb.mjs").then((n) => n.i);
+	const { generateEmbedding, serializeEmbedding } = await import("./embeddings-BJPOcbik.mjs").then((n) => n.i);
 	const rows = await backend.getUnembeddedChunkIds();
 	if (rows.length === 0) return 0;
 	const total = rows.length;
@@ -285,4 +285,4 @@ async function indexAllWithBackend(backend, registryDb) {
 
 //#endregion
 export { embedChunksWithBackend, indexAllWithBackend };
-//# sourceMappingURL=indexer-backend-DcYThufd.mjs.map
+//# sourceMappingURL=indexer-backend-Cm5RS7y0.mjs.map

package/dist/{indexer-backend-DcYThufd.mjs.map → indexer-backend-Cm5RS7y0.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"indexer-backend-DcYThufd.mjs","names":[],"sources":["../src/memory/indexer/async.ts"],"sourcesContent":["/**\n * Backend-aware async indexer for PAI federation memory.\n *\n * Provides the same functionality as sync.ts but writes through the\n * StorageBackend interface instead of directly to better-sqlite3.\n * Used when the daemon is configured with the Postgres backend.\n *\n * The SQLite path still uses sync.ts directly (which is faster for SQLite\n * due to synchronous transactions).\n */\n\nimport { readFileSync, statSync, existsSync } from \"node:fs\";\nimport { join, relative, basename } from \"node:path\";\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend, ChunkRow } from \"../../storage/interface.js\";\nimport { chunkMarkdown } from \"../chunker.js\";\nimport {\n  sha256File,\n  chunkId,\n  detectTier,\n  walkMdFiles,\n  walkContentFiles,\n  isPathTooBroadForContentScan,\n  parseSessionTitleChunk,\n  yieldToEventLoop,\n  INDEX_YIELD_EVERY,\n} from \"./helpers.js\";\nimport type { IndexResult } from \"./types.js\";\n\nexport type { IndexResult };\n\n// ---------------------------------------------------------------------------\n// Single-file indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\n/**\n * Index a single file through the StorageBackend interface.\n * Returns true if the file was re-indexed (changed or new), false if skipped.\n */\nexport async function indexFileWithBackend(\n  backend: StorageBackend,\n  projectId: number,\n  rootPath: string,\n  relativePath: string,\n  source: string,\n  tier: string,\n): Promise<boolean> {\n  const absPath = join(rootPath, relativePath);\n\n  let content: string;\n  let stat: ReturnType<typeof statSync>;\n  try {\n    content = readFileSync(absPath, \"utf8\");\n    stat = statSync(absPath);\n  } catch {\n    return false;\n  }\n\n  const hash = sha256File(content);\n  const mtime = Math.floor(stat.mtimeMs);\n  const size = stat.size;\n\n  // Change detection\n  const existingHash = await backend.getFileHash(projectId, relativePath);\n  if (existingHash === hash) return false;\n\n  // Delete old chunks\n  await backend.deleteChunksForFile(projectId, relativePath);\n\n  // Chunk the content\n  const rawChunks = chunkMarkdown(content);\n  const updatedAt = Date.now();\n\n  const chunks: ChunkRow[] = rawChunks.map((c, i) => ({\n    id: chunkId(projectId, relativePath, i, c.startLine, c.endLine),\n    projectId,\n    source,\n    tier,\n    path: relativePath,\n    startLine: c.startLine,\n    endLine: c.endLine,\n    hash: c.hash,\n    text: c.text,\n    updatedAt,\n    embedding: null,\n  }));\n\n  // Insert chunks + update file record\n  await backend.insertChunks(chunks);\n  await backend.upsertFile({ projectId, path: relativePath, source, tier, hash, mtime, size });\n\n  return true;\n}\n\n// ---------------------------------------------------------------------------\n// Project-level indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\nexport async function indexProjectWithBackend(\n  backend: StorageBackend,\n  projectId: number,\n  rootPath: string,\n  claudeNotesDir?: string | null,\n): Promise<IndexResult> {\n  const result: IndexResult = { filesProcessed: 0, chunksCreated: 0, filesSkipped: 0 };\n\n  const filesToIndex: Array<{ absPath: string; rootBase: string; source: string; tier: string }> = [];\n\n  const rootMemoryMd = join(rootPath, \"MEMORY.md\");\n  if (existsSync(rootMemoryMd)) {\n    filesToIndex.push({ absPath: rootMemoryMd, rootBase: rootPath, source: \"memory\", tier: \"evergreen\" });\n  }\n\n  const memoryDir = join(rootPath, \"memory\");\n  for (const absPath of walkMdFiles(memoryDir)) {\n    const relPath = relative(rootPath, absPath);\n    const tier = detectTier(relPath);\n    filesToIndex.push({ absPath, rootBase: rootPath, source: \"memory\", tier });\n  }\n\n  const notesDir = join(rootPath, \"Notes\");\n  for (const absPath of walkMdFiles(notesDir)) {\n    filesToIndex.push({ absPath, rootBase: rootPath, source: \"notes\", tier: \"session\" });\n  }\n\n  // Synthetic session-title chunks for Notes files\n  {\n    const updatedAt = Date.now();\n    for (const absPath of walkMdFiles(notesDir)) {\n      const fileName = basename(absPath);\n      const text = parseSessionTitleChunk(fileName);\n      if (!text) continue;\n      const relPath = relative(rootPath, absPath);\n      const syntheticPath = `${relPath}::title`;\n      const id = chunkId(projectId, syntheticPath, 0, 0, 0);\n      const hash = sha256File(text);\n      const titleChunk: ChunkRow = {\n        id, projectId, source: \"notes\", tier: \"session\",\n        path: syntheticPath, startLine: 0, endLine: 0,\n        hash, text, updatedAt, embedding: null,\n      };\n      try {\n        await backend.insertChunks([titleChunk]);\n      } catch {\n        // Skip title chunks that cause backend errors\n      }\n    }\n  }\n\n  if (!isPathTooBroadForContentScan(rootPath)) {\n    for (const absPath of walkContentFiles(rootPath)) {\n      filesToIndex.push({ absPath, rootBase: rootPath, source: \"content\", tier: \"topic\" });\n    }\n  }\n\n  if (claudeNotesDir && claudeNotesDir !== notesDir) {\n    for (const absPath of walkMdFiles(claudeNotesDir)) {\n      filesToIndex.push({ absPath, rootBase: claudeNotesDir, source: \"notes\", tier: \"session\" });\n    }\n\n    // Synthetic title chunks for claude notes dir\n    {\n      const updatedAt = Date.now();\n      for (const absPath of walkMdFiles(claudeNotesDir)) {\n        const fileName = basename(absPath);\n        const text = parseSessionTitleChunk(fileName);\n        if (!text) continue;\n        const relPath = relative(claudeNotesDir, absPath);\n        const syntheticPath = `${relPath}::title`;\n        const id = chunkId(projectId, syntheticPath, 0, 0, 0);\n        const hash = sha256File(text);\n        const titleChunk: ChunkRow = {\n          id, projectId, source: \"notes\", tier: \"session\",\n          path: syntheticPath, startLine: 0, endLine: 0,\n          hash, text, updatedAt, embedding: null,\n        };\n        try {\n          await backend.insertChunks([titleChunk]);\n        } catch {\n          // Skip title chunks that cause backend errors\n        }\n      }\n    }\n\n    if (claudeNotesDir.endsWith(\"/Notes\")) {\n      const claudeProjectDir = claudeNotesDir.slice(0, -\"/Notes\".length);\n      const claudeMemoryMd = join(claudeProjectDir, \"MEMORY.md\");\n      if (existsSync(claudeMemoryMd)) {\n        filesToIndex.push({ absPath: claudeMemoryMd, rootBase: claudeProjectDir, source: \"memory\", tier: \"evergreen\" });\n      }\n      const claudeMemoryDir = join(claudeProjectDir, \"memory\");\n      for (const absPath of walkMdFiles(claudeMemoryDir)) {\n        const relPath = relative(claudeProjectDir, absPath);\n        const tier = detectTier(relPath);\n        filesToIndex.push({ absPath, rootBase: claudeProjectDir, source: \"memory\", tier });\n      }\n    }\n  }\n\n  await yieldToEventLoop();\n\n  let filesSinceYield = 0;\n\n  for (const { absPath, rootBase, source, tier } of filesToIndex) {\n    if (filesSinceYield >= INDEX_YIELD_EVERY) {\n      await yieldToEventLoop();\n      filesSinceYield = 0;\n    }\n    filesSinceYield++;\n\n    const relPath = relative(rootBase, absPath);\n    try {\n      const changed = await indexFileWithBackend(backend, projectId, rootBase, relPath, source, tier);\n\n      if (changed) {\n        const ids = await backend.getChunkIds(projectId, relPath);\n        result.filesProcessed++;\n        result.chunksCreated += ids.length;\n      } else {\n        result.filesSkipped++;\n      }\n    } catch {\n      // Skip files that cause backend errors (e.g. null bytes in Postgres)\n      result.filesSkipped++;\n    }\n  }\n\n  // Prune stale paths\n  const livePaths = new Set<string>();\n  for (const { absPath, rootBase } of filesToIndex) {\n    livePaths.add(relative(rootBase, absPath));\n  }\n\n  const dbChunkPaths = await backend.getDistinctChunkPaths(projectId);\n\n  const stalePaths: string[] = [];\n  for (const p of dbChunkPaths) {\n    const basePath = p.endsWith(\"::title\") ? p.slice(0, -\"::title\".length) : p;\n    if (!livePaths.has(basePath)) {\n      stalePaths.push(p);\n    }\n  }\n\n  if (stalePaths.length > 0) {\n    await backend.deletePaths(projectId, stalePaths);\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Embedding generation via StorageBackend\n// ---------------------------------------------------------------------------\n\nconst EMBED_BATCH_SIZE = 50;\nconst EMBED_YIELD_EVERY = 1;\n\n/**\n * Generate and store embeddings for all unembedded chunks via the StorageBackend.\n *\n * Processes chunks in batches of EMBED_BATCH_SIZE, yielding to the event loop\n * every EMBED_YIELD_EVERY chunks to avoid blocking IPC calls from MCP shims.\n *\n * The optional `shouldStop` callback is checked between every batch. When it\n * returns true the embed loop exits early so the caller (e.g. the daemon\n * shutdown handler) can close the pool without racing against active queries.\n *\n * Returns the number of newly embedded chunks.\n */\nexport async function embedChunksWithBackend(\n  backend: StorageBackend,\n  shouldStop?: () => boolean,\n  projectNames?: Map<number, string>,\n): Promise<number> {\n  const { generateEmbedding, serializeEmbedding } = await import(\"../embeddings.js\");\n\n  const rows = await backend.getUnembeddedChunkIds();\n  if (rows.length === 0) return 0;\n\n  const total = rows.length;\n  let embedded = 0;\n\n  // Build a summary of what needs embedding: count chunks per project_id\n  const projectChunkCounts = new Map<number, { count: number; samplePath: string }>();\n  for (const row of rows) {\n    const entry = projectChunkCounts.get(row.project_id);\n    if (entry) {\n      entry.count++;\n    } else {\n      projectChunkCounts.set(row.project_id, { count: 1, samplePath: row.path });\n    }\n  }\n  const pName = (pid: number) => projectNames?.get(pid) ?? `project ${pid}`;\n  const projectSummary = Array.from(projectChunkCounts.entries())\n    .map(([pid, { count, samplePath }]) => `  ${pName(pid)}: ${count} chunks (e.g. ${samplePath})`)\n    .join(\"\\n\");\n  process.stderr.write(\n    `[pai-daemon] Embed pass: ${total} unembedded chunks across ${projectChunkCounts.size} project(s)\\n${projectSummary}\\n`\n  );\n\n  // Track current project for transition logging\n  let currentProjectId = -1;\n  let projectEmbedded = 0;\n\n  for (let i = 0; i < rows.length; i += EMBED_BATCH_SIZE) {\n    // Check cancellation between every batch before touching the pool again\n    if (shouldStop?.()) {\n      process.stderr.write(\n        `[pai-daemon] Embed pass cancelled after ${embedded}/${total} chunks (shutdown requested)\\n`\n      );\n      break;\n    }\n\n    const batch = rows.slice(i, i + EMBED_BATCH_SIZE);\n\n    for (let j = 0; j < batch.length; j++) {\n      const { id, text, project_id, path } = batch[j];\n\n      // Log when switching to a new project\n      if (project_id !== currentProjectId) {\n        if (currentProjectId !== -1) {\n          process.stderr.write(\n            `[pai-daemon] Finished ${pName(currentProjectId)}: ${projectEmbedded} chunks embedded\\n`\n          );\n        }\n        const info = projectChunkCounts.get(project_id);\n        process.stderr.write(\n          `[pai-daemon] Embedding ${pName(project_id)} (${info?.count ?? \"?\"} chunks, starting at ${path})\\n`\n        );\n        currentProjectId = project_id;\n        projectEmbedded = 0;\n      }\n\n      // Yield to the event loop periodically to keep IPC responsive\n      if ((embedded + j) % EMBED_YIELD_EVERY === 0) {\n        await yieldToEventLoop();\n      }\n\n      const vec = await generateEmbedding(text);\n      const blob = serializeEmbedding(vec);\n      await backend.updateEmbedding(id, blob);\n      projectEmbedded++;\n    }\n\n    embedded += batch.length;\n\n    // Log progress with current file path for context\n    const lastChunk = batch[batch.length - 1];\n    process.stderr.write(\n      `[pai-daemon] Embedded ${embedded}/${total} chunks (${pName(lastChunk.project_id)}: ${lastChunk.path})\\n`\n    );\n  }\n\n  // Log final project completion\n  if (currentProjectId !== -1) {\n    process.stderr.write(\n      `[pai-daemon] Finished ${pName(currentProjectId)}: ${projectEmbedded} chunks embedded\\n`\n    );\n  }\n\n  return embedded;\n}\n\n// ---------------------------------------------------------------------------\n// Global indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\nexport async function indexAllWithBackend(\n  backend: StorageBackend,\n  registryDb: Database,\n): Promise<{ projects: number; result: IndexResult }> {\n  const projects = registryDb\n    .prepare(\"SELECT id, root_path, claude_notes_dir FROM projects WHERE status = 'active'\")\n    .all() as Array<{ id: number; root_path: string; claude_notes_dir: string | null }>;\n\n  const totals: IndexResult = { filesProcessed: 0, chunksCreated: 0, filesSkipped: 0 };\n\n  for (const project of projects) {\n    await yieldToEventLoop();\n    const r = await indexProjectWithBackend(backend, project.id, project.root_path, project.claude_notes_dir);\n    totals.filesProcessed += r.filesProcessed;\n    totals.chunksCreated += r.chunksCreated;\n    totals.filesSkipped += r.filesSkipped;\n  }\n\n  return { projects: projects.length, result: totals };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAuCA,eAAsB,qBACpB,SACA,WACA,UACA,cACA,QACA,MACkB;CAClB,MAAM,UAAU,KAAK,UAAU,aAAa;CAE5C,IAAI;CACJ,IAAI;AACJ,KAAI;AACF,YAAU,aAAa,SAAS,OAAO;AACvC,SAAO,SAAS,QAAQ;SAClB;AACN,SAAO;;CAGT,MAAM,OAAO,WAAW,QAAQ;CAChC,MAAM,QAAQ,KAAK,MAAM,KAAK,QAAQ;CACtC,MAAM,OAAO,KAAK;AAIlB,KADqB,MAAM,QAAQ,YAAY,WAAW,aAAa,KAClD,KAAM,QAAO;AAGlC,OAAM,QAAQ,oBAAoB,WAAW,aAAa;CAG1D,MAAM,YAAY,cAAc,QAAQ;CACxC,MAAM,YAAY,KAAK,KAAK;CAE5B,MAAM,SAAqB,UAAU,KAAK,GAAG,OAAO;EAClD,IAAI,QAAQ,WAAW,cAAc,GAAG,EAAE,WAAW,EAAE,QAAQ;EAC/D;EACA;EACA;EACA,MAAM;EACN,WAAW,EAAE;EACb,SAAS,EAAE;EACX,MAAM,EAAE;EACR,MAAM,EAAE;EACR;EACA,WAAW;EACZ,EAAE;AAGH,OAAM,QAAQ,aAAa,OAAO;AAClC,OAAM,QAAQ,WAAW;EAAE;EAAW,MAAM;EAAc;EAAQ;EAAM;EAAM;EAAO;EAAM,CAAC;AAE5F,QAAO;;AAOT,eAAsB,wBACpB,SACA,WACA,UACA,gBACsB;CACtB,MAAM,SAAsB;EAAE,gBAAgB;EAAG,eAAe;EAAG,cAAc;EAAG;CAEpF,MAAM,eAA2F,EAAE;CAEnG,MAAM,eAAe,KAAK,UAAU,YAAY;AAChD,KAAI,WAAW,aAAa,CAC1B,cAAa,KAAK;EAAE,SAAS;EAAc,UAAU;EAAU,QAAQ;EAAU,MAAM;EAAa,CAAC;CAGvG,MAAM,YAAY,KAAK,UAAU,SAAS;AAC1C,MAAK,MAAM,WAAW,YAAY,UAAU,EAAE;EAE5C,MAAM,OAAO,WADG,SAAS,UAAU,QAAQ,CACX;AAChC,eAAa,KAAK;GAAE;GAAS,UAAU;GAAU,QAAQ;GAAU;GAAM,CAAC;;CAG5E,MAAM,WAAW,KAAK,UAAU,QAAQ;AACxC,MAAK,MAAM,WAAW,YAAY,SAAS,CACzC,cAAa,KAAK;EAAE;EAAS,UAAU;EAAU,QAAQ;EAAS,MAAM;EAAW,CAAC;CAItF;EACE,MAAM,YAAY,KAAK,KAAK;AAC5B,OAAK,MAAM,WAAW,YAAY,SAAS,EAAE;GAE3C,MAAM,OAAO,uBADI,SAAS,QAAQ,CACW;AAC7C,OAAI,CAAC,KAAM;GAEX,MAAM,gBAAgB,GADN,SAAS,UAAU,QAAQ,CACV;GAGjC,MAAM,aAAuB;IAC3B,IAHS,QAAQ,WAAW,eAAe,GAAG,GAAG,EAAE;IAG/C;IAAW,QAAQ;IAAS,MAAM;IACtC,MAAM;IAAe,WAAW;IAAG,SAAS;IAC5C,MAJW,WAAW,KAAK;IAIrB;IAAM;IAAW,WAAW;IACnC;AACD,OAAI;AACF,UAAM,QAAQ,aAAa,CAAC,WAAW,CAAC;WAClC;;;AAMZ,KAAI,CAAC,6BAA6B,SAAS,CACzC,MAAK,MAAM,WAAW,iBAAiB,SAAS,CAC9C,cAAa,KAAK;EAAE;EAAS,UAAU;EAAU,QAAQ;EAAW,MAAM;EAAS,CAAC;AAIxF,KAAI,kBAAkB,mBAAmB,UAAU;AACjD,OAAK,MAAM,WAAW,YAAY,eAAe,CAC/C,cAAa,KAAK;GAAE;GAAS,UAAU;GAAgB,QAAQ;GAAS,MAAM;GAAW,CAAC;EAI5F;GACE,MAAM,YAAY,KAAK,KAAK;AAC5B,QAAK,MAAM,WAAW,YAAY,eAAe,EAAE;IAEjD,MAAM,OAAO,uBADI,SAAS,QAAQ,CACW;AAC7C,QAAI,CAAC,KAAM;IAEX,MAAM,gBAAgB,GADN,SAAS,gBAAgB,QAAQ,CAChB;IAGjC,MAAM,aAAuB;KAC3B,IAHS,QAAQ,WAAW,eAAe,GAAG,GAAG,EAAE;KAG/C;KAAW,QAAQ;KAAS,MAAM;KACtC,MAAM;KAAe,WAAW;KAAG,SAAS;KAC5C,MAJW,WAAW,KAAK;KAIrB;KAAM;KAAW,WAAW;KACnC;AACD,QAAI;AACF,WAAM,QAAQ,aAAa,CAAC,WAAW,CAAC;YAClC;;;AAMZ,MAAI,eAAe,SAAS,SAAS,EAAE;GACrC,MAAM,mBAAmB,eAAe,MAAM,GAAG,GAAiB;GAClE,MAAM,iBAAiB,KAAK,kBAAkB,YAAY;AAC1D,OAAI,WAAW,eAAe,CAC5B,cAAa,KAAK;IAAE,SAAS;IAAgB,UAAU;IAAkB,QAAQ;IAAU,MAAM;IAAa,CAAC;GAEjH,MAAM,kBAAkB,KAAK,kBAAkB,SAAS;AACxD,QAAK,MAAM,WAAW,YAAY,gBAAgB,EAAE;IAElD,MAAM,OAAO,WADG,SAAS,kBAAkB,QAAQ,CACnB;AAChC,iBAAa,KAAK;KAAE;KAAS,UAAU;KAAkB,QAAQ;KAAU;KAAM,CAAC;;;;AAKxF,OAAM,kBAAkB;CAExB,IAAI,kBAAkB;AAEtB,MAAK,MAAM,EAAE,SAAS,UAAU,QAAQ,UAAU,cAAc;AAC9D,MAAI,mBAAmB,mBAAmB;AACxC,SAAM,kBAAkB;AACxB,qBAAkB;;AAEpB;EAEA,MAAM,UAAU,SAAS,UAAU,QAAQ;AAC3C,MAAI;AAGF,OAFgB,MAAM,qBAAqB,SAAS,WAAW,UAAU,SAAS,QAAQ,KAAK,EAElF;IACX,MAAM,MAAM,MAAM,QAAQ,YAAY,WAAW,QAAQ;AACzD,WAAO;AACP,WAAO,iBAAiB,IAAI;SAE5B,QAAO;UAEH;AAEN,UAAO;;;CAKX,MAAM,4BAAY,IAAI,KAAa;AACnC,MAAK,MAAM,EAAE,SAAS,cAAc,aAClC,WAAU,IAAI,SAAS,UAAU,QAAQ,CAAC;CAG5C,MAAM,eAAe,MAAM,QAAQ,sBAAsB,UAAU;CAEnE,MAAM,aAAuB,EAAE;AAC/B,MAAK,MAAM,KAAK,cAAc;EAC5B,MAAM,WAAW,EAAE,SAAS,UAAU,GAAG,EAAE,MAAM,GAAG,GAAkB,GAAG;AACzE,MAAI,CAAC,UAAU,IAAI,SAAS,CAC1B,YAAW,KAAK,EAAE;;AAItB,KAAI,WAAW,SAAS,EACtB,OAAM,QAAQ,YAAY,WAAW,WAAW;AAGlD,QAAO;;AAOT,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;;;;;;;;;;;;;AAc1B,eAAsB,uBACpB,SACA,YACA,cACiB;CACjB,MAAM,EAAE,mBAAmB,uBAAuB,MAAM,OAAO;CAE/D,MAAM,OAAO,MAAM,QAAQ,uBAAuB;AAClD,KAAI,KAAK,WAAW,EAAG,QAAO;CAE9B,MAAM,QAAQ,KAAK;CACnB,IAAI,WAAW;CAGf,MAAM,qCAAqB,IAAI,KAAoD;AACnF,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,mBAAmB,IAAI,IAAI,WAAW;AACpD,MAAI,MACF,OAAM;MAEN,oBAAmB,IAAI,IAAI,YAAY;GAAE,OAAO;GAAG,YAAY,IAAI;GAAM,CAAC;;CAG9E,MAAM,SAAS,QAAgB,cAAc,IAAI,IAAI,IAAI,WAAW;CACpE,MAAM,iBAAiB,MAAM,KAAK,mBAAmB,SAAS,CAAC,CAC5D,KAAK,CAAC,KAAK,EAAE,OAAO,kBAAkB,KAAK,MAAM,IAAI,CAAC,IAAI,MAAM,gBAAgB,WAAW,GAAG,CAC9F,KAAK,KAAK;AACb,SAAQ,OAAO,MACb,4BAA4B,MAAM,4BAA4B,mBAAmB,KAAK,eAAe,eAAe,IACrH;CAGD,IAAI,mBAAmB;CACvB,IAAI,kBAAkB;AAEtB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,kBAAkB;AAEtD,MAAI,cAAc,EAAE;AAClB,WAAQ,OAAO,MACb,2CAA2C,SAAS,GAAG,MAAM,gCAC9D;AACD;;EAGF,MAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,iBAAiB;AAEjD,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,EAAE,IAAI,MAAM,YAAY,SAAS,MAAM;AAG7C,OAAI,eAAe,kBAAkB;AACnC,QAAI,qBAAqB,GACvB,SAAQ,OAAO,MACb,yBAAyB,MAAM,iBAAiB,CAAC,IAAI,gBAAgB,oBACtE;IAEH,MAAM,OAAO,mBAAmB,IAAI,WAAW;AAC/C,YAAQ,OAAO,MACb,0BAA0B,MAAM,WAAW,CAAC,IAAI,MAAM,SAAS,IAAI,uBAAuB,KAAK,KAChG;AACD,uBAAmB;AACnB,sBAAkB;;AAIpB,QAAK,WAAW,KAAK,sBAAsB,EACzC,OAAM,kBAAkB;GAI1B,MAAM,OAAO,mBADD,MAAM,kBAAkB,KAAK,CACL;AACpC,SAAM,QAAQ,gBAAgB,IAAI,KAAK;AACvC;;AAGF,cAAY,MAAM;EAGlB,MAAM,YAAY,MAAM,MAAM,SAAS;AACvC,UAAQ,OAAO,MACb,yBAAyB,SAAS,GAAG,MAAM,WAAW,MAAM,UAAU,WAAW,CAAC,IAAI,UAAU,KAAK,KACtG;;AAIH,KAAI,qBAAqB,GACvB,SAAQ,OAAO,MACb,yBAAyB,MAAM,iBAAiB,CAAC,IAAI,gBAAgB,oBACtE;AAGH,QAAO;;AAOT,eAAsB,oBACpB,SACA,YACoD;CACpD,MAAM,WAAW,WACd,QAAQ,+EAA+E,CACvF,KAAK;CAER,MAAM,SAAsB;EAAE,gBAAgB;EAAG,eAAe;EAAG,cAAc;EAAG;AAEpF,MAAK,MAAM,WAAW,UAAU;AAC9B,QAAM,kBAAkB;EACxB,MAAM,IAAI,MAAM,wBAAwB,SAAS,QAAQ,IAAI,QAAQ,WAAW,QAAQ,iBAAiB;AACzG,SAAO,kBAAkB,EAAE;AAC3B,SAAO,iBAAiB,EAAE;AAC1B,SAAO,gBAAgB,EAAE;;AAG3B,QAAO;EAAE,UAAU,SAAS;EAAQ,QAAQ;EAAQ"}
+{"version":3,"file":"indexer-backend-Cm5RS7y0.mjs","names":[],"sources":["../src/memory/indexer/async.ts"],"sourcesContent":["/**\n * Backend-aware async indexer for PAI federation memory.\n *\n * Provides the same functionality as sync.ts but writes through the\n * StorageBackend interface instead of directly to better-sqlite3.\n * Used when the daemon is configured with the Postgres backend.\n *\n * The SQLite path still uses sync.ts directly (which is faster for SQLite\n * due to synchronous transactions).\n */\n\nimport { readFileSync, statSync, existsSync } from \"node:fs\";\nimport { join, relative, basename } from \"node:path\";\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend, ChunkRow } from \"../../storage/interface.js\";\nimport { chunkMarkdown } from \"../chunker.js\";\nimport {\n  sha256File,\n  chunkId,\n  detectTier,\n  walkMdFiles,\n  walkContentFiles,\n  isPathTooBroadForContentScan,\n  parseSessionTitleChunk,\n  yieldToEventLoop,\n  INDEX_YIELD_EVERY,\n} from \"./helpers.js\";\nimport type { IndexResult } from \"./types.js\";\n\nexport type { IndexResult };\n\n// ---------------------------------------------------------------------------\n// Single-file indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\n/**\n * Index a single file through the StorageBackend interface.\n * Returns true if the file was re-indexed (changed or new), false if skipped.\n */\nexport async function indexFileWithBackend(\n  backend: StorageBackend,\n  projectId: number,\n  rootPath: string,\n  relativePath: string,\n  source: string,\n  tier: string,\n): Promise<boolean> {\n  const absPath = join(rootPath, relativePath);\n\n  let content: string;\n  let stat: ReturnType<typeof statSync>;\n  try {\n    content = readFileSync(absPath, \"utf8\");\n    stat = statSync(absPath);\n  } catch {\n    return false;\n  }\n\n  const hash = sha256File(content);\n  const mtime = Math.floor(stat.mtimeMs);\n  const size = stat.size;\n\n  // Change detection\n  const existingHash = await backend.getFileHash(projectId, relativePath);\n  if (existingHash === hash) return false;\n\n  // Delete old chunks\n  await backend.deleteChunksForFile(projectId, relativePath);\n\n  // Chunk the content\n  const rawChunks = chunkMarkdown(content);\n  const updatedAt = Date.now();\n\n  const chunks: ChunkRow[] = rawChunks.map((c, i) => ({\n    id: chunkId(projectId, relativePath, i, c.startLine, c.endLine),\n    projectId,\n    source,\n    tier,\n    path: relativePath,\n    startLine: c.startLine,\n    endLine: c.endLine,\n    hash: c.hash,\n    text: c.text,\n    updatedAt,\n    embedding: null,\n  }));\n\n  // Insert chunks + update file record\n  await backend.insertChunks(chunks);\n  await backend.upsertFile({ projectId, path: relativePath, source, tier, hash, mtime, size });\n\n  return true;\n}\n\n// ---------------------------------------------------------------------------\n// Project-level indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\nexport async function indexProjectWithBackend(\n  backend: StorageBackend,\n  projectId: number,\n  rootPath: string,\n  claudeNotesDir?: string | null,\n): Promise<IndexResult> {\n  const result: IndexResult = { filesProcessed: 0, chunksCreated: 0, filesSkipped: 0 };\n\n  const filesToIndex: Array<{ absPath: string; rootBase: string; source: string; tier: string }> = [];\n\n  const rootMemoryMd = join(rootPath, \"MEMORY.md\");\n  if (existsSync(rootMemoryMd)) {\n    filesToIndex.push({ absPath: rootMemoryMd, rootBase: rootPath, source: \"memory\", tier: \"evergreen\" });\n  }\n\n  const memoryDir = join(rootPath, \"memory\");\n  for (const absPath of walkMdFiles(memoryDir)) {\n    const relPath = relative(rootPath, absPath);\n    const tier = detectTier(relPath);\n    filesToIndex.push({ absPath, rootBase: rootPath, source: \"memory\", tier });\n  }\n\n  const notesDir = join(rootPath, \"Notes\");\n  for (const absPath of walkMdFiles(notesDir)) {\n    filesToIndex.push({ absPath, rootBase: rootPath, source: \"notes\", tier: \"session\" });\n  }\n\n  // Synthetic session-title chunks for Notes files\n  {\n    const updatedAt = Date.now();\n    for (const absPath of walkMdFiles(notesDir)) {\n      const fileName = basename(absPath);\n      const text = parseSessionTitleChunk(fileName);\n      if (!text) continue;\n      const relPath = relative(rootPath, absPath);\n      const syntheticPath = `${relPath}::title`;\n      const id = chunkId(projectId, syntheticPath, 0, 0, 0);\n      const hash = sha256File(text);\n      const titleChunk: ChunkRow = {\n        id, projectId, source: \"notes\", tier: \"session\",\n        path: syntheticPath, startLine: 0, endLine: 0,\n        hash, text, updatedAt, embedding: null,\n      };\n      try {\n        await backend.insertChunks([titleChunk]);\n      } catch {\n        // Skip title chunks that cause backend errors\n      }\n    }\n  }\n\n  if (!isPathTooBroadForContentScan(rootPath)) {\n    for (const absPath of walkContentFiles(rootPath)) {\n      filesToIndex.push({ absPath, rootBase: rootPath, source: \"content\", tier: \"topic\" });\n    }\n  }\n\n  if (claudeNotesDir && claudeNotesDir !== notesDir) {\n    for (const absPath of walkMdFiles(claudeNotesDir)) {\n      filesToIndex.push({ absPath, rootBase: claudeNotesDir, source: \"notes\", tier: \"session\" });\n    }\n\n    // Synthetic title chunks for claude notes dir\n    {\n      const updatedAt = Date.now();\n      for (const absPath of walkMdFiles(claudeNotesDir)) {\n        const fileName = basename(absPath);\n        const text = parseSessionTitleChunk(fileName);\n        if (!text) continue;\n        const relPath = relative(claudeNotesDir, absPath);\n        const syntheticPath = `${relPath}::title`;\n        const id = chunkId(projectId, syntheticPath, 0, 0, 0);\n        const hash = sha256File(text);\n        const titleChunk: ChunkRow = {\n          id, projectId, source: \"notes\", tier: \"session\",\n          path: syntheticPath, startLine: 0, endLine: 0,\n          hash, text, updatedAt, embedding: null,\n        };\n        try {\n          await backend.insertChunks([titleChunk]);\n        } catch {\n          // Skip title chunks that cause backend errors\n        }\n      }\n    }\n\n    if (claudeNotesDir.endsWith(\"/Notes\")) {\n      const claudeProjectDir = claudeNotesDir.slice(0, -\"/Notes\".length);\n      const claudeMemoryMd = join(claudeProjectDir, \"MEMORY.md\");\n      if (existsSync(claudeMemoryMd)) {\n        filesToIndex.push({ absPath: claudeMemoryMd, rootBase: claudeProjectDir, source: \"memory\", tier: \"evergreen\" });\n      }\n      const claudeMemoryDir = join(claudeProjectDir, \"memory\");\n      for (const absPath of walkMdFiles(claudeMemoryDir)) {\n        const relPath = relative(claudeProjectDir, absPath);\n        const tier = detectTier(relPath);\n        filesToIndex.push({ absPath, rootBase: claudeProjectDir, source: \"memory\", tier });\n      }\n    }\n  }\n\n  await yieldToEventLoop();\n\n  let filesSinceYield = 0;\n\n  for (const { absPath, rootBase, source, tier } of filesToIndex) {\n    if (filesSinceYield >= INDEX_YIELD_EVERY) {\n      await yieldToEventLoop();\n      filesSinceYield = 0;\n    }\n    filesSinceYield++;\n\n    const relPath = relative(rootBase, absPath);\n    try {\n      const changed = await indexFileWithBackend(backend, projectId, rootBase, relPath, source, tier);\n\n      if (changed) {\n        const ids = await backend.getChunkIds(projectId, relPath);\n        result.filesProcessed++;\n        result.chunksCreated += ids.length;\n      } else {\n        result.filesSkipped++;\n      }\n    } catch {\n      // Skip files that cause backend errors (e.g. null bytes in Postgres)\n      result.filesSkipped++;\n    }\n  }\n\n  // Prune stale paths\n  const livePaths = new Set<string>();\n  for (const { absPath, rootBase } of filesToIndex) {\n    livePaths.add(relative(rootBase, absPath));\n  }\n\n  const dbChunkPaths = await backend.getDistinctChunkPaths(projectId);\n\n  const stalePaths: string[] = [];\n  for (const p of dbChunkPaths) {\n    const basePath = p.endsWith(\"::title\") ? p.slice(0, -\"::title\".length) : p;\n    if (!livePaths.has(basePath)) {\n      stalePaths.push(p);\n    }\n  }\n\n  if (stalePaths.length > 0) {\n    await backend.deletePaths(projectId, stalePaths);\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// Embedding generation via StorageBackend\n// ---------------------------------------------------------------------------\n\nconst EMBED_BATCH_SIZE = 50;\nconst EMBED_YIELD_EVERY = 1;\n\n/**\n * Generate and store embeddings for all unembedded chunks via the StorageBackend.\n *\n * Processes chunks in batches of EMBED_BATCH_SIZE, yielding to the event loop\n * every EMBED_YIELD_EVERY chunks to avoid blocking IPC calls from MCP shims.\n *\n * The optional `shouldStop` callback is checked between every batch. When it\n * returns true the embed loop exits early so the caller (e.g. the daemon\n * shutdown handler) can close the pool without racing against active queries.\n *\n * Returns the number of newly embedded chunks.\n */\nexport async function embedChunksWithBackend(\n  backend: StorageBackend,\n  shouldStop?: () => boolean,\n  projectNames?: Map<number, string>,\n): Promise<number> {\n  const { generateEmbedding, serializeEmbedding } = await import(\"../embeddings.js\");\n\n  const rows = await backend.getUnembeddedChunkIds();\n  if (rows.length === 0) return 0;\n\n  const total = rows.length;\n  let embedded = 0;\n\n  // Build a summary of what needs embedding: count chunks per project_id\n  const projectChunkCounts = new Map<number, { count: number; samplePath: string }>();\n  for (const row of rows) {\n    const entry = projectChunkCounts.get(row.project_id);\n    if (entry) {\n      entry.count++;\n    } else {\n      projectChunkCounts.set(row.project_id, { count: 1, samplePath: row.path });\n    }\n  }\n  const pName = (pid: number) => projectNames?.get(pid) ?? `project ${pid}`;\n  const projectSummary = Array.from(projectChunkCounts.entries())\n    .map(([pid, { count, samplePath }]) => `  ${pName(pid)}: ${count} chunks (e.g. ${samplePath})`)\n    .join(\"\\n\");\n  process.stderr.write(\n    `[pai-daemon] Embed pass: ${total} unembedded chunks across ${projectChunkCounts.size} project(s)\\n${projectSummary}\\n`\n  );\n\n  // Track current project for transition logging\n  let currentProjectId = -1;\n  let projectEmbedded = 0;\n\n  for (let i = 0; i < rows.length; i += EMBED_BATCH_SIZE) {\n    // Check cancellation between every batch before touching the pool again\n    if (shouldStop?.()) {\n      process.stderr.write(\n        `[pai-daemon] Embed pass cancelled after ${embedded}/${total} chunks (shutdown requested)\\n`\n      );\n      break;\n    }\n\n    const batch = rows.slice(i, i + EMBED_BATCH_SIZE);\n\n    for (let j = 0; j < batch.length; j++) {\n      const { id, text, project_id, path } = batch[j];\n\n      // Log when switching to a new project\n      if (project_id !== currentProjectId) {\n        if (currentProjectId !== -1) {\n          process.stderr.write(\n            `[pai-daemon] Finished ${pName(currentProjectId)}: ${projectEmbedded} chunks embedded\\n`\n          );\n        }\n        const info = projectChunkCounts.get(project_id);\n        process.stderr.write(\n          `[pai-daemon] Embedding ${pName(project_id)} (${info?.count ?? \"?\"} chunks, starting at ${path})\\n`\n        );\n        currentProjectId = project_id;\n        projectEmbedded = 0;\n      }\n\n      // Yield to the event loop periodically to keep IPC responsive\n      if ((embedded + j) % EMBED_YIELD_EVERY === 0) {\n        await yieldToEventLoop();\n      }\n\n      const vec = await generateEmbedding(text);\n      const blob = serializeEmbedding(vec);\n      await backend.updateEmbedding(id, blob);\n      projectEmbedded++;\n    }\n\n    embedded += batch.length;\n\n    // Log progress with current file path for context\n    const lastChunk = batch[batch.length - 1];\n    process.stderr.write(\n      `[pai-daemon] Embedded ${embedded}/${total} chunks (${pName(lastChunk.project_id)}: ${lastChunk.path})\\n`\n    );\n  }\n\n  // Log final project completion\n  if (currentProjectId !== -1) {\n    process.stderr.write(\n      `[pai-daemon] Finished ${pName(currentProjectId)}: ${projectEmbedded} chunks embedded\\n`\n    );\n  }\n\n  return embedded;\n}\n\n// ---------------------------------------------------------------------------\n// Global indexing via StorageBackend\n// ---------------------------------------------------------------------------\n\nexport async function indexAllWithBackend(\n  backend: StorageBackend,\n  registryDb: Database,\n): Promise<{ projects: number; result: IndexResult }> {\n  const projects = registryDb\n    .prepare(\"SELECT id, root_path, claude_notes_dir FROM projects WHERE status = 'active'\")\n    .all() as Array<{ id: number; root_path: string; claude_notes_dir: string | null }>;\n\n  const totals: IndexResult = { filesProcessed: 0, chunksCreated: 0, filesSkipped: 0 };\n\n  for (const project of projects) {\n    await yieldToEventLoop();\n    const r = await indexProjectWithBackend(backend, project.id, project.root_path, project.claude_notes_dir);\n    totals.filesProcessed += r.filesProcessed;\n    totals.chunksCreated += r.chunksCreated;\n    totals.filesSkipped += r.filesSkipped;\n  }\n\n  return { projects: projects.length, result: totals };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAuCA,eAAsB,qBACpB,SACA,WACA,UACA,cACA,QACA,MACkB;CAClB,MAAM,UAAU,KAAK,UAAU,aAAa;CAE5C,IAAI;CACJ,IAAI;AACJ,KAAI;AACF,YAAU,aAAa,SAAS,OAAO;AACvC,SAAO,SAAS,QAAQ;SAClB;AACN,SAAO;;CAGT,MAAM,OAAO,WAAW,QAAQ;CAChC,MAAM,QAAQ,KAAK,MAAM,KAAK,QAAQ;CACtC,MAAM,OAAO,KAAK;AAIlB,KADqB,MAAM,QAAQ,YAAY,WAAW,aAAa,KAClD,KAAM,QAAO;AAGlC,OAAM,QAAQ,oBAAoB,WAAW,aAAa;CAG1D,MAAM,YAAY,cAAc,QAAQ;CACxC,MAAM,YAAY,KAAK,KAAK;CAE5B,MAAM,SAAqB,UAAU,KAAK,GAAG,OAAO;EAClD,IAAI,QAAQ,WAAW,cAAc,GAAG,EAAE,WAAW,EAAE,QAAQ;EAC/D;EACA;EACA;EACA,MAAM;EACN,WAAW,EAAE;EACb,SAAS,EAAE;EACX,MAAM,EAAE;EACR,MAAM,EAAE;EACR;EACA,WAAW;EACZ,EAAE;AAGH,OAAM,QAAQ,aAAa,OAAO;AAClC,OAAM,QAAQ,WAAW;EAAE;EAAW,MAAM;EAAc;EAAQ;EAAM;EAAM;EAAO;EAAM,CAAC;AAE5F,QAAO;;AAOT,eAAsB,wBACpB,SACA,WACA,UACA,gBACsB;CACtB,MAAM,SAAsB;EAAE,gBAAgB;EAAG,eAAe;EAAG,cAAc;EAAG;CAEpF,MAAM,eAA2F,EAAE;CAEnG,MAAM,eAAe,KAAK,UAAU,YAAY;AAChD,KAAI,WAAW,aAAa,CAC1B,cAAa,KAAK;EAAE,SAAS;EAAc,UAAU;EAAU,QAAQ;EAAU,MAAM;EAAa,CAAC;CAGvG,MAAM,YAAY,KAAK,UAAU,SAAS;AAC1C,MAAK,MAAM,WAAW,YAAY,UAAU,EAAE;EAE5C,MAAM,OAAO,WADG,SAAS,UAAU,QAAQ,CACX;AAChC,eAAa,KAAK;GAAE;GAAS,UAAU;GAAU,QAAQ;GAAU;GAAM,CAAC;;CAG5E,MAAM,WAAW,KAAK,UAAU,QAAQ;AACxC,MAAK,MAAM,WAAW,YAAY,SAAS,CACzC,cAAa,KAAK;EAAE;EAAS,UAAU;EAAU,QAAQ;EAAS,MAAM;EAAW,CAAC;CAItF;EACE,MAAM,YAAY,KAAK,KAAK;AAC5B,OAAK,MAAM,WAAW,YAAY,SAAS,EAAE;GAE3C,MAAM,OAAO,uBADI,SAAS,QAAQ,CACW;AAC7C,OAAI,CAAC,KAAM;GAEX,MAAM,gBAAgB,GADN,SAAS,UAAU,QAAQ,CACV;GAGjC,MAAM,aAAuB;IAC3B,IAHS,QAAQ,WAAW,eAAe,GAAG,GAAG,EAAE;IAG/C;IAAW,QAAQ;IAAS,MAAM;IACtC,MAAM;IAAe,WAAW;IAAG,SAAS;IAC5C,MAJW,WAAW,KAAK;IAIrB;IAAM;IAAW,WAAW;IACnC;AACD,OAAI;AACF,UAAM,QAAQ,aAAa,CAAC,WAAW,CAAC;WAClC;;;AAMZ,KAAI,CAAC,6BAA6B,SAAS,CACzC,MAAK,MAAM,WAAW,iBAAiB,SAAS,CAC9C,cAAa,KAAK;EAAE;EAAS,UAAU;EAAU,QAAQ;EAAW,MAAM;EAAS,CAAC;AAIxF,KAAI,kBAAkB,mBAAmB,UAAU;AACjD,OAAK,MAAM,WAAW,YAAY,eAAe,CAC/C,cAAa,KAAK;GAAE;GAAS,UAAU;GAAgB,QAAQ;GAAS,MAAM;GAAW,CAAC;EAI5F;GACE,MAAM,YAAY,KAAK,KAAK;AAC5B,QAAK,MAAM,WAAW,YAAY,eAAe,EAAE;IAEjD,MAAM,OAAO,uBADI,SAAS,QAAQ,CACW;AAC7C,QAAI,CAAC,KAAM;IAEX,MAAM,gBAAgB,GADN,SAAS,gBAAgB,QAAQ,CAChB;IAGjC,MAAM,aAAuB;KAC3B,IAHS,QAAQ,WAAW,eAAe,GAAG,GAAG,EAAE;KAG/C;KAAW,QAAQ;KAAS,MAAM;KACtC,MAAM;KAAe,WAAW;KAAG,SAAS;KAC5C,MAJW,WAAW,KAAK;KAIrB;KAAM;KAAW,WAAW;KACnC;AACD,QAAI;AACF,WAAM,QAAQ,aAAa,CAAC,WAAW,CAAC;YAClC;;;AAMZ,MAAI,eAAe,SAAS,SAAS,EAAE;GACrC,MAAM,mBAAmB,eAAe,MAAM,GAAG,GAAiB;GAClE,MAAM,iBAAiB,KAAK,kBAAkB,YAAY;AAC1D,OAAI,WAAW,eAAe,CAC5B,cAAa,KAAK;IAAE,SAAS;IAAgB,UAAU;IAAkB,QAAQ;IAAU,MAAM;IAAa,CAAC;GAEjH,MAAM,kBAAkB,KAAK,kBAAkB,SAAS;AACxD,QAAK,MAAM,WAAW,YAAY,gBAAgB,EAAE;IAElD,MAAM,OAAO,WADG,SAAS,kBAAkB,QAAQ,CACnB;AAChC,iBAAa,KAAK;KAAE;KAAS,UAAU;KAAkB,QAAQ;KAAU;KAAM,CAAC;;;;AAKxF,OAAM,kBAAkB;CAExB,IAAI,kBAAkB;AAEtB,MAAK,MAAM,EAAE,SAAS,UAAU,QAAQ,UAAU,cAAc;AAC9D,MAAI,mBAAmB,mBAAmB;AACxC,SAAM,kBAAkB;AACxB,qBAAkB;;AAEpB;EAEA,MAAM,UAAU,SAAS,UAAU,QAAQ;AAC3C,MAAI;AAGF,OAFgB,MAAM,qBAAqB,SAAS,WAAW,UAAU,SAAS,QAAQ,KAAK,EAElF;IACX,MAAM,MAAM,MAAM,QAAQ,YAAY,WAAW,QAAQ;AACzD,WAAO;AACP,WAAO,iBAAiB,IAAI;SAE5B,QAAO;UAEH;AAEN,UAAO;;;CAKX,MAAM,4BAAY,IAAI,KAAa;AACnC,MAAK,MAAM,EAAE,SAAS,cAAc,aAClC,WAAU,IAAI,SAAS,UAAU,QAAQ,CAAC;CAG5C,MAAM,eAAe,MAAM,QAAQ,sBAAsB,UAAU;CAEnE,MAAM,aAAuB,EAAE;AAC/B,MAAK,MAAM,KAAK,cAAc;EAC5B,MAAM,WAAW,EAAE,SAAS,UAAU,GAAG,EAAE,MAAM,GAAG,GAAkB,GAAG;AACzE,MAAI,CAAC,UAAU,IAAI,SAAS,CAC1B,YAAW,KAAK,EAAE;;AAItB,KAAI,WAAW,SAAS,EACtB,OAAM,QAAQ,YAAY,WAAW,WAAW;AAGlD,QAAO;;AAOT,MAAM,mBAAmB;AACzB,MAAM,oBAAoB;;;;;;;;;;;;;AAc1B,eAAsB,uBACpB,SACA,YACA,cACiB;CACjB,MAAM,EAAE,mBAAmB,uBAAuB,MAAM,OAAO;CAE/D,MAAM,OAAO,MAAM,QAAQ,uBAAuB;AAClD,KAAI,KAAK,WAAW,EAAG,QAAO;CAE9B,MAAM,QAAQ,KAAK;CACnB,IAAI,WAAW;CAGf,MAAM,qCAAqB,IAAI,KAAoD;AACnF,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,QAAQ,mBAAmB,IAAI,IAAI,WAAW;AACpD,MAAI,MACF,OAAM;MAEN,oBAAmB,IAAI,IAAI,YAAY;GAAE,OAAO;GAAG,YAAY,IAAI;GAAM,CAAC;;CAG9E,MAAM,SAAS,QAAgB,cAAc,IAAI,IAAI,IAAI,WAAW;CACpE,MAAM,iBAAiB,MAAM,KAAK,mBAAmB,SAAS,CAAC,CAC5D,KAAK,CAAC,KAAK,EAAE,OAAO,kBAAkB,KAAK,MAAM,IAAI,CAAC,IAAI,MAAM,gBAAgB,WAAW,GAAG,CAC9F,KAAK,KAAK;AACb,SAAQ,OAAO,MACb,4BAA4B,MAAM,4BAA4B,mBAAmB,KAAK,eAAe,eAAe,IACrH;CAGD,IAAI,mBAAmB;CACvB,IAAI,kBAAkB;AAEtB,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,kBAAkB;AAEtD,MAAI,cAAc,EAAE;AAClB,WAAQ,OAAO,MACb,2CAA2C,SAAS,GAAG,MAAM,gCAC9D;AACD;;EAGF,MAAM,QAAQ,KAAK,MAAM,GAAG,IAAI,iBAAiB;AAEjD,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;GACrC,MAAM,EAAE,IAAI,MAAM,YAAY,SAAS,MAAM;AAG7C,OAAI,eAAe,kBAAkB;AACnC,QAAI,qBAAqB,GACvB,SAAQ,OAAO,MACb,yBAAyB,MAAM,iBAAiB,CAAC,IAAI,gBAAgB,oBACtE;IAEH,MAAM,OAAO,mBAAmB,IAAI,WAAW;AAC/C,YAAQ,OAAO,MACb,0BAA0B,MAAM,WAAW,CAAC,IAAI,MAAM,SAAS,IAAI,uBAAuB,KAAK,KAChG;AACD,uBAAmB;AACnB,sBAAkB;;AAIpB,QAAK,WAAW,KAAK,sBAAsB,EACzC,OAAM,kBAAkB;GAI1B,MAAM,OAAO,mBADD,MAAM,kBAAkB,KAAK,CACL;AACpC,SAAM,QAAQ,gBAAgB,IAAI,KAAK;AACvC;;AAGF,cAAY,MAAM;EAGlB,MAAM,YAAY,MAAM,MAAM,SAAS;AACvC,UAAQ,OAAO,MACb,yBAAyB,SAAS,GAAG,MAAM,WAAW,MAAM,UAAU,WAAW,CAAC,IAAI,UAAU,KAAK,KACtG;;AAIH,KAAI,qBAAqB,GACvB,SAAQ,OAAO,MACb,yBAAyB,MAAM,iBAAiB,CAAC,IAAI,gBAAgB,oBACtE;AAGH,QAAO;;AAOT,eAAsB,oBACpB,SACA,YACoD;CACpD,MAAM,WAAW,WACd,QAAQ,+EAA+E,CACvF,KAAK;CAER,MAAM,SAAsB;EAAE,gBAAgB;EAAG,eAAe;EAAG,cAAc;EAAG;AAEpF,MAAK,MAAM,WAAW,UAAU;AAC9B,QAAM,kBAAkB;EACxB,MAAM,IAAI,MAAM,wBAAwB,SAAS,QAAQ,IAAI,QAAQ,WAAW,QAAQ,iBAAiB;AACzG,SAAO,kBAAkB,EAAE;AAC3B,SAAO,iBAAiB,EAAE;AAC1B,SAAO,gBAAgB,EAAE;;AAG3B,QAAO;EAAE,UAAU,SAAS;EAAQ,QAAQ;EAAQ"}

package/dist/{ipc-client-C3pjwy2m.mjs → ipc-client-CoyUHPod.mjs}

@@ -148,4 +148,4 @@ var PaiClient = class {
 
 //#endregion
 export { PaiClient as t };
-//# sourceMappingURL=ipc-client-C3pjwy2m.mjs.map
+//# sourceMappingURL=ipc-client-CoyUHPod.mjs.map

package/dist/{ipc-client-C3pjwy2m.mjs.map → ipc-client-CoyUHPod.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"ipc-client-C3pjwy2m.mjs","names":[],"sources":["../src/daemon/ipc-client.ts"],"sourcesContent":["/**\n * ipc-client.ts — IPC client for the PAI Daemon MCP shim\n *\n * PaiClient connects to the Unix Domain Socket served by daemon.ts\n * and forwards tool calls to the daemon. Uses a fresh socket connection per\n * call (connect → write JSON + newline → read response line → parse → destroy).\n * This keeps the client stateless and avoids connection management complexity.\n *\n * Adapted from the Coogle ipc-client pattern (which was adapted from Whazaa).\n */\n\nimport { connect, Socket } from \"node:net\";\nimport { randomUUID } from \"node:crypto\";\nimport type {\n  NotificationConfig,\n  NotificationMode,\n  NotificationEvent,\n  SendResult,\n} from \"../notifications/types.js\";\nimport type { TopicCheckParams, TopicCheckResult } from \"../topics/detector.js\";\nimport type { AutoRouteResult } from \"../session/auto-route.js\";\n\n// ---------------------------------------------------------------------------\n// Protocol types\n// ---------------------------------------------------------------------------\n\n/** Default socket path */\nexport const IPC_SOCKET_PATH = \"/tmp/pai.sock\";\n\n/** Timeout for IPC calls (60 seconds) */\nconst IPC_TIMEOUT_MS = 60_000;\n\ninterface IpcRequest {\n  id: string;\n  method: string;\n  params: Record<string, unknown>;\n}\n\ninterface IpcResponse {\n  id: string;\n  ok: boolean;\n  result?: unknown;\n  error?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Client\n// ---------------------------------------------------------------------------\n\n/**\n * Thin IPC proxy that forwards tool calls to pai-daemon over a Unix\n * Domain Socket. Each call opens a fresh connection, sends one NDJSON request,\n * reads the response, and closes. Stateless and simple.\n */\nexport class PaiClient {\n  private readonly socketPath: string;\n\n  constructor(socketPath?: string) {\n    this.socketPath = socketPath ?? IPC_SOCKET_PATH;\n  }\n\n  /**\n   * Call a PAI tool by name with the given params.\n   * Returns the tool result or throws on error.\n   */\n  async call(method: string, params: Record<string, unknown>): Promise<unknown> {\n    return this.send(method, params);\n  }\n\n  /**\n   * Check daemon status.\n   */\n  async status(): Promise<Record<string, unknown>> {\n    const result = await this.send(\"status\", {});\n    return result as Record<string, unknown>;\n  }\n\n  /**\n   * Trigger an immediate index run.\n   */\n  async triggerIndex(): Promise<void> {\n    await this.send(\"index_now\", {});\n  }\n\n  // -------------------------------------------------------------------------\n  // Notification methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Get the current notification config from the daemon.\n   */\n  async getNotificationConfig(): Promise<{\n    config: NotificationConfig;\n    activeChannels: string[];\n  }> {\n    const result = await this.send(\"notification_get_config\", {});\n    return result as { config: NotificationConfig; activeChannels: string[] };\n  }\n\n  /**\n   * Patch the notification config on the daemon (and persist to disk).\n   */\n  async setNotificationConfig(patch: {\n    mode?: NotificationMode;\n    channels?: Partial<NotificationConfig[\"channels\"]>;\n    routing?: Partial<NotificationConfig[\"routing\"]>;\n  }): Promise<{ config: NotificationConfig }> {\n    const result = await this.send(\"notification_set_config\", patch as Record<string, unknown>);\n    return result as { config: NotificationConfig };\n  }\n\n  /**\n   * Send a notification via the daemon (routes to configured channels).\n   */\n  async sendNotification(payload: {\n    event: NotificationEvent;\n    message: string;\n    title?: string;\n  }): Promise<SendResult> {\n    const result = await this.send(\"notification_send\", payload as Record<string, unknown>);\n    return result as SendResult;\n  }\n\n  // -------------------------------------------------------------------------\n  // Topic detection methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Check whether the provided context text has drifted to a different project\n   * than the session's current routing.\n   */\n  async topicCheck(params: TopicCheckParams): Promise<TopicCheckResult> {\n    const result = await this.send(\"topic_check\", params as unknown as Record<string, unknown>);\n    return result as TopicCheckResult;\n  }\n\n  // -------------------------------------------------------------------------\n  // Session routing methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Automatically detect which project a session belongs to.\n   * Tries path match, PAI.md marker walk, then topic detection (if context given).\n   */\n  async sessionAutoRoute(params: {\n    cwd?: string;\n    context?: string;\n  }): Promise<AutoRouteResult | null> {\n    // session_auto_route returns a ToolResult (content array). Extract the text\n    // and parse JSON from it.\n    const result = await this.send(\"session_auto_route\", params as Record<string, unknown>);\n    const toolResult = result as { content?: Array<{ text: string }>; isError?: boolean };\n    if (toolResult.isError) return null;\n    const text = toolResult.content?.[0]?.text ?? \"\";\n    // Text is either JSON (on match) or a human-readable \"no match\" message\n    try {\n      return JSON.parse(text) as AutoRouteResult;\n    } catch {\n      return null;\n    }\n  }\n\n  // -------------------------------------------------------------------------\n  // Internal transport\n  // -------------------------------------------------------------------------\n\n  /**\n   * Send a single IPC request and wait for the response.\n   * Opens a new socket connection per call — simple and reliable.\n   */\n  private send(\n    method: string,\n    params: Record<string, unknown>\n  ): Promise<unknown> {\n    const socketPath = this.socketPath;\n\n    return new Promise((resolve, reject) => {\n      let socket: Socket | null = null;\n      let done = false;\n      let buffer = \"\";\n      let timer: ReturnType<typeof setTimeout> | null = null;\n\n      function finish(error: Error | null, value?: unknown): void {\n        if (done) return;\n        done = true;\n        if (timer !== null) {\n          clearTimeout(timer);\n          timer = null;\n        }\n        try {\n          socket?.destroy();\n        } catch {\n          // ignore\n        }\n        if (error) {\n          reject(error);\n        } else {\n          resolve(value);\n        }\n      }\n\n      socket = connect(socketPath, () => {\n        const request: IpcRequest = {\n          id: randomUUID(),\n          method,\n          params,\n        };\n        socket!.write(JSON.stringify(request) + \"\\n\");\n      });\n\n      socket.on(\"data\", (chunk: Buffer) => {\n        buffer += chunk.toString();\n        const nl = buffer.indexOf(\"\\n\");\n        if (nl === -1) return;\n\n        const line = buffer.slice(0, nl);\n        buffer = buffer.slice(nl + 1);\n\n        let response: IpcResponse;\n        try {\n          response = JSON.parse(line) as IpcResponse;\n        } catch {\n          finish(new Error(`IPC parse error: ${line}`));\n          return;\n        }\n\n        if (!response.ok) {\n          finish(new Error(response.error ?? \"IPC call failed\"));\n        } else {\n          finish(null, response.result);\n        }\n      });\n\n      socket.on(\"error\", (e: NodeJS.ErrnoException) => {\n        if (e.code === \"ENOENT\" || e.code === \"ECONNREFUSED\") {\n          finish(\n            new Error(\n              \"PAI daemon not running. Start it with: pai daemon serve\"\n            )\n          );\n        } else {\n          finish(e);\n        }\n      });\n\n      socket.on(\"end\", () => {\n        if (!done) {\n          finish(new Error(\"IPC connection closed before response\"));\n        }\n      });\n\n      timer = setTimeout(() => {\n        finish(new Error(\"IPC call timed out after 60s\"));\n      }, IPC_TIMEOUT_MS);\n    });\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AA2BA,MAAa,kBAAkB;;AAG/B,MAAM,iBAAiB;;;;;;AAwBvB,IAAa,YAAb,MAAuB;CACrB,AAAiB;CAEjB,YAAY,YAAqB;AAC/B,OAAK,aAAa,cAAc;;;;;;CAOlC,MAAM,KAAK,QAAgB,QAAmD;AAC5E,SAAO,KAAK,KAAK,QAAQ,OAAO;;;;;CAMlC,MAAM,SAA2C;AAE/C,SADe,MAAM,KAAK,KAAK,UAAU,EAAE,CAAC;;;;;CAO9C,MAAM,eAA8B;AAClC,QAAM,KAAK,KAAK,aAAa,EAAE,CAAC;;;;;CAUlC,MAAM,wBAGH;AAED,SADe,MAAM,KAAK,KAAK,2BAA2B,EAAE,CAAC;;;;;CAO/D,MAAM,sBAAsB,OAIgB;AAE1C,SADe,MAAM,KAAK,KAAK,2BAA2B,MAAiC;;;;;CAO7F,MAAM,iBAAiB,SAIC;AAEtB,SADe,MAAM,KAAK,KAAK,qBAAqB,QAAmC;;;;;;CAYzF,MAAM,WAAW,QAAqD;AAEpE,SADe,MAAM,KAAK,KAAK,eAAe,OAA6C;;;;;;CAY7F,MAAM,iBAAiB,QAGa;EAIlC,MAAM,aADS,MAAM,KAAK,KAAK,sBAAsB,OAAkC;AAEvF,MAAI,WAAW,QAAS,QAAO;EAC/B,MAAM,OAAO,WAAW,UAAU,IAAI,QAAQ;AAE9C,MAAI;AACF,UAAO,KAAK,MAAM,KAAK;UACjB;AACN,UAAO;;;;;;;CAYX,AAAQ,KACN,QACA,QACkB;EAClB,MAAM,aAAa,KAAK;AAExB,SAAO,IAAI,SAAS,SAAS,WAAW;GACtC,IAAI,SAAwB;GAC5B,IAAI,OAAO;GACX,IAAI,SAAS;GACb,IAAI,QAA8C;GAElD,SAAS,OAAO,OAAqB,OAAuB;AAC1D,QAAI,KAAM;AACV,WAAO;AACP,QAAI,UAAU,MAAM;AAClB,kBAAa,MAAM;AACnB,aAAQ;;AAEV,QAAI;AACF,aAAQ,SAAS;YACX;AAGR,QAAI,MACF,QAAO,MAAM;QAEb,SAAQ,MAAM;;AAIlB,YAAS,QAAQ,kBAAkB;IACjC,MAAM,UAAsB;KAC1B,IAAI,YAAY;KAChB;KACA;KACD;AACD,WAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,KAAK;KAC7C;AAEF,UAAO,GAAG,SAAS,UAAkB;AACnC,cAAU,MAAM,UAAU;IAC1B,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC/B,QAAI,OAAO,GAAI;IAEf,MAAM,OAAO,OAAO,MAAM,GAAG,GAAG;AAChC,aAAS,OAAO,MAAM,KAAK,EAAE;IAE7B,IAAI;AACJ,QAAI;AACF,gBAAW,KAAK,MAAM,KAAK;YACrB;AACN,4BAAO,IAAI,MAAM,oBAAoB,OAAO,CAAC;AAC7C;;AAGF,QAAI,CAAC,SAAS,GACZ,QAAO,IAAI,MAAM,SAAS,SAAS,kBAAkB,CAAC;QAEtD,QAAO,MAAM,SAAS,OAAO;KAE/B;AAEF,UAAO,GAAG,UAAU,MAA6B;AAC/C,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,eACpC,wBACE,IAAI,MACF,0DACD,CACF;QAED,QAAO,EAAE;KAEX;AAEF,UAAO,GAAG,aAAa;AACrB,QAAI,CAAC,KACH,wBAAO,IAAI,MAAM,wCAAwC,CAAC;KAE5D;AAEF,WAAQ,iBAAiB;AACvB,2BAAO,IAAI,MAAM,+BAA+B,CAAC;MAChD,eAAe;IAClB"}
+{"version":3,"file":"ipc-client-CoyUHPod.mjs","names":[],"sources":["../src/daemon/ipc-client.ts"],"sourcesContent":["/**\n * ipc-client.ts — IPC client for the PAI Daemon MCP shim\n *\n * PaiClient connects to the Unix Domain Socket served by daemon.ts\n * and forwards tool calls to the daemon. Uses a fresh socket connection per\n * call (connect → write JSON + newline → read response line → parse → destroy).\n * This keeps the client stateless and avoids connection management complexity.\n *\n * Adapted from the Coogle ipc-client pattern (which was adapted from Whazaa).\n */\n\nimport { connect, Socket } from \"node:net\";\nimport { randomUUID } from \"node:crypto\";\nimport type {\n  NotificationConfig,\n  NotificationMode,\n  NotificationEvent,\n  SendResult,\n} from \"../notifications/types.js\";\nimport type { TopicCheckParams, TopicCheckResult } from \"../topics/detector.js\";\nimport type { AutoRouteResult } from \"../session/auto-route.js\";\n\n// ---------------------------------------------------------------------------\n// Protocol types\n// ---------------------------------------------------------------------------\n\n/** Default socket path */\nexport const IPC_SOCKET_PATH = \"/tmp/pai.sock\";\n\n/** Timeout for IPC calls (60 seconds) */\nconst IPC_TIMEOUT_MS = 60_000;\n\ninterface IpcRequest {\n  id: string;\n  method: string;\n  params: Record<string, unknown>;\n}\n\ninterface IpcResponse {\n  id: string;\n  ok: boolean;\n  result?: unknown;\n  error?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Client\n// ---------------------------------------------------------------------------\n\n/**\n * Thin IPC proxy that forwards tool calls to pai-daemon over a Unix\n * Domain Socket. Each call opens a fresh connection, sends one NDJSON request,\n * reads the response, and closes. Stateless and simple.\n */\nexport class PaiClient {\n  private readonly socketPath: string;\n\n  constructor(socketPath?: string) {\n    this.socketPath = socketPath ?? IPC_SOCKET_PATH;\n  }\n\n  /**\n   * Call a PAI tool by name with the given params.\n   * Returns the tool result or throws on error.\n   */\n  async call(method: string, params: Record<string, unknown>): Promise<unknown> {\n    return this.send(method, params);\n  }\n\n  /**\n   * Check daemon status.\n   */\n  async status(): Promise<Record<string, unknown>> {\n    const result = await this.send(\"status\", {});\n    return result as Record<string, unknown>;\n  }\n\n  /**\n   * Trigger an immediate index run.\n   */\n  async triggerIndex(): Promise<void> {\n    await this.send(\"index_now\", {});\n  }\n\n  // -------------------------------------------------------------------------\n  // Notification methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Get the current notification config from the daemon.\n   */\n  async getNotificationConfig(): Promise<{\n    config: NotificationConfig;\n    activeChannels: string[];\n  }> {\n    const result = await this.send(\"notification_get_config\", {});\n    return result as { config: NotificationConfig; activeChannels: string[] };\n  }\n\n  /**\n   * Patch the notification config on the daemon (and persist to disk).\n   */\n  async setNotificationConfig(patch: {\n    mode?: NotificationMode;\n    channels?: Partial<NotificationConfig[\"channels\"]>;\n    routing?: Partial<NotificationConfig[\"routing\"]>;\n  }): Promise<{ config: NotificationConfig }> {\n    const result = await this.send(\"notification_set_config\", patch as Record<string, unknown>);\n    return result as { config: NotificationConfig };\n  }\n\n  /**\n   * Send a notification via the daemon (routes to configured channels).\n   */\n  async sendNotification(payload: {\n    event: NotificationEvent;\n    message: string;\n    title?: string;\n  }): Promise<SendResult> {\n    const result = await this.send(\"notification_send\", payload as Record<string, unknown>);\n    return result as SendResult;\n  }\n\n  // -------------------------------------------------------------------------\n  // Topic detection methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Check whether the provided context text has drifted to a different project\n   * than the session's current routing.\n   */\n  async topicCheck(params: TopicCheckParams): Promise<TopicCheckResult> {\n    const result = await this.send(\"topic_check\", params as unknown as Record<string, unknown>);\n    return result as TopicCheckResult;\n  }\n\n  // -------------------------------------------------------------------------\n  // Session routing methods\n  // -------------------------------------------------------------------------\n\n  /**\n   * Automatically detect which project a session belongs to.\n   * Tries path match, PAI.md marker walk, then topic detection (if context given).\n   */\n  async sessionAutoRoute(params: {\n    cwd?: string;\n    context?: string;\n  }): Promise<AutoRouteResult | null> {\n    // session_auto_route returns a ToolResult (content array). Extract the text\n    // and parse JSON from it.\n    const result = await this.send(\"session_auto_route\", params as Record<string, unknown>);\n    const toolResult = result as { content?: Array<{ text: string }>; isError?: boolean };\n    if (toolResult.isError) return null;\n    const text = toolResult.content?.[0]?.text ?? \"\";\n    // Text is either JSON (on match) or a human-readable \"no match\" message\n    try {\n      return JSON.parse(text) as AutoRouteResult;\n    } catch {\n      return null;\n    }\n  }\n\n  // -------------------------------------------------------------------------\n  // Internal transport\n  // -------------------------------------------------------------------------\n\n  /**\n   * Send a single IPC request and wait for the response.\n   * Opens a new socket connection per call — simple and reliable.\n   */\n  private send(\n    method: string,\n    params: Record<string, unknown>\n  ): Promise<unknown> {\n    const socketPath = this.socketPath;\n\n    return new Promise((resolve, reject) => {\n      let socket: Socket | null = null;\n      let done = false;\n      let buffer = \"\";\n      let timer: ReturnType<typeof setTimeout> | null = null;\n\n      function finish(error: Error | null, value?: unknown): void {\n        if (done) return;\n        done = true;\n        if (timer !== null) {\n          clearTimeout(timer);\n          timer = null;\n        }\n        try {\n          socket?.destroy();\n        } catch {\n          // ignore\n        }\n        if (error) {\n          reject(error);\n        } else {\n          resolve(value);\n        }\n      }\n\n      socket = connect(socketPath, () => {\n        const request: IpcRequest = {\n          id: randomUUID(),\n          method,\n          params,\n        };\n        socket!.write(JSON.stringify(request) + \"\\n\");\n      });\n\n      socket.on(\"data\", (chunk: Buffer) => {\n        buffer += chunk.toString();\n        const nl = buffer.indexOf(\"\\n\");\n        if (nl === -1) return;\n\n        const line = buffer.slice(0, nl);\n        buffer = buffer.slice(nl + 1);\n\n        let response: IpcResponse;\n        try {\n          response = JSON.parse(line) as IpcResponse;\n        } catch {\n          finish(new Error(`IPC parse error: ${line}`));\n          return;\n        }\n\n        if (!response.ok) {\n          finish(new Error(response.error ?? \"IPC call failed\"));\n        } else {\n          finish(null, response.result);\n        }\n      });\n\n      socket.on(\"error\", (e: NodeJS.ErrnoException) => {\n        if (e.code === \"ENOENT\" || e.code === \"ECONNREFUSED\") {\n          finish(\n            new Error(\n              \"PAI daemon not running. Start it with: pai daemon serve\"\n            )\n          );\n        } else {\n          finish(e);\n        }\n      });\n\n      socket.on(\"end\", () => {\n        if (!done) {\n          finish(new Error(\"IPC connection closed before response\"));\n        }\n      });\n\n      timer = setTimeout(() => {\n        finish(new Error(\"IPC call timed out after 60s\"));\n      }, IPC_TIMEOUT_MS);\n    });\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;AA2BA,MAAa,kBAAkB;;AAG/B,MAAM,iBAAiB;;;;;;AAwBvB,IAAa,YAAb,MAAuB;CACrB,AAAiB;CAEjB,YAAY,YAAqB;AAC/B,OAAK,aAAa,cAAc;;;;;;CAOlC,MAAM,KAAK,QAAgB,QAAmD;AAC5E,SAAO,KAAK,KAAK,QAAQ,OAAO;;;;;CAMlC,MAAM,SAA2C;AAE/C,SADe,MAAM,KAAK,KAAK,UAAU,EAAE,CAAC;;;;;CAO9C,MAAM,eAA8B;AAClC,QAAM,KAAK,KAAK,aAAa,EAAE,CAAC;;;;;CAUlC,MAAM,wBAGH;AAED,SADe,MAAM,KAAK,KAAK,2BAA2B,EAAE,CAAC;;;;;CAO/D,MAAM,sBAAsB,OAIgB;AAE1C,SADe,MAAM,KAAK,KAAK,2BAA2B,MAAiC;;;;;CAO7F,MAAM,iBAAiB,SAIC;AAEtB,SADe,MAAM,KAAK,KAAK,qBAAqB,QAAmC;;;;;;CAYzF,MAAM,WAAW,QAAqD;AAEpE,SADe,MAAM,KAAK,KAAK,eAAe,OAA6C;;;;;;CAY7F,MAAM,iBAAiB,QAGa;EAIlC,MAAM,aADS,MAAM,KAAK,KAAK,sBAAsB,OAAkC;AAEvF,MAAI,WAAW,QAAS,QAAO;EAC/B,MAAM,OAAO,WAAW,UAAU,IAAI,QAAQ;AAE9C,MAAI;AACF,UAAO,KAAK,MAAM,KAAK;UACjB;AACN,UAAO;;;;;;;CAYX,AAAQ,KACN,QACA,QACkB;EAClB,MAAM,aAAa,KAAK;AAExB,SAAO,IAAI,SAAS,SAAS,WAAW;GACtC,IAAI,SAAwB;GAC5B,IAAI,OAAO;GACX,IAAI,SAAS;GACb,IAAI,QAA8C;GAElD,SAAS,OAAO,OAAqB,OAAuB;AAC1D,QAAI,KAAM;AACV,WAAO;AACP,QAAI,UAAU,MAAM;AAClB,kBAAa,MAAM;AACnB,aAAQ;;AAEV,QAAI;AACF,aAAQ,SAAS;YACX;AAGR,QAAI,MACF,QAAO,MAAM;QAEb,SAAQ,MAAM;;AAIlB,YAAS,QAAQ,kBAAkB;IACjC,MAAM,UAAsB;KAC1B,IAAI,YAAY;KAChB;KACA;KACD;AACD,WAAQ,MAAM,KAAK,UAAU,QAAQ,GAAG,KAAK;KAC7C;AAEF,UAAO,GAAG,SAAS,UAAkB;AACnC,cAAU,MAAM,UAAU;IAC1B,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC/B,QAAI,OAAO,GAAI;IAEf,MAAM,OAAO,OAAO,MAAM,GAAG,GAAG;AAChC,aAAS,OAAO,MAAM,KAAK,EAAE;IAE7B,IAAI;AACJ,QAAI;AACF,gBAAW,KAAK,MAAM,KAAK;YACrB;AACN,4BAAO,IAAI,MAAM,oBAAoB,OAAO,CAAC;AAC7C;;AAGF,QAAI,CAAC,SAAS,GACZ,QAAO,IAAI,MAAM,SAAS,SAAS,kBAAkB,CAAC;QAEtD,QAAO,MAAM,SAAS,OAAO;KAE/B;AAEF,UAAO,GAAG,UAAU,MAA6B;AAC/C,QAAI,EAAE,SAAS,YAAY,EAAE,SAAS,eACpC,wBACE,IAAI,MACF,0DACD,CACF;QAED,QAAO,EAAE;KAEX;AAEF,UAAO,GAAG,aAAa;AACrB,QAAI,CAAC,KACH,wBAAO,IAAI,MAAM,wCAAwC,CAAC;KAE5D;AAEF,WAAQ,iBAAiB;AACvB,2BAAO,IAAI,MAAM,+BAA+B,CAAC;MAChD,eAAe;IAClB"}

package/dist/{kg-entity-DVzTsy6G.mjs → kg-entity-LXblD7LZ.mjs}

@@ -173,4 +173,4 @@ function updateEntityFeedbackWeight(db, entityId, normalizedRating, alpha = .1)
 
 //#endregion
 export { kgContradictions as a, kgAdd as i, updateEntityFeedbackWeight as n, kgInvalidate as o, upsertKgEntity as r, kgQuery as s, listKgEntities as t };
-//# sourceMappingURL=kg-entity-DVzTsy6G.mjs.map
+//# sourceMappingURL=kg-entity-LXblD7LZ.mjs.map

package/dist/{kg-entity-DVzTsy6G.mjs.map → kg-entity-LXblD7LZ.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"kg-entity-DVzTsy6G.mjs","names":[],"sources":["../src/memory/kg.ts","../src/memory/kg-entity.ts"],"sourcesContent":["/**\n * Temporal Knowledge Graph — kg_triples CRUD layer.\n *\n * Uses the Postgres connection pool from the storage backend.\n * Triples are time-scoped: valid_from/valid_to enable point-in-time queries.\n * Invalidation sets valid_to = NOW() instead of deleting rows.\n */\n\nimport type { Pool } from \"pg\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgTriple {\n  id: number;\n  subject: string;\n  predicate: string;\n  object: string;\n  project_id?: number;\n  source_session?: string;\n  valid_from: Date;\n  valid_to?: Date;\n  confidence: \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n  created_at: Date;\n}\n\nexport interface KgAddParams {\n  subject: string;\n  predicate: string;\n  object: string;\n  project_id?: number;\n  source_session?: string;\n  confidence?: \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n}\n\nexport interface KgQueryParams {\n  subject?: string;\n  predicate?: string;\n  object?: string;\n  project_id?: number;\n  as_of?: Date;\n  include_invalidated?: boolean;\n}\n\nexport interface KgContradiction {\n  subject: string;\n  predicate: string;\n  objects: string[];\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction rowToTriple(row: Record<string, unknown>): KgTriple {\n  return {\n    id: row.id as number,\n    subject: row.subject as string,\n    predicate: row.predicate as string,\n    object: row.object as string,\n    project_id: row.project_id as number | undefined,\n    source_session: row.source_session as string | undefined,\n    valid_from: new Date(row.valid_from as string),\n    valid_to: row.valid_to ? new Date(row.valid_to as string) : undefined,\n    confidence: row.confidence as \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\",\n    created_at: new Date(row.created_at as string),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Core operations\n// ---------------------------------------------------------------------------\n\n/**\n * Add a new triple to the knowledge graph.\n * Returns the inserted triple.\n */\nexport async function kgAdd(pool: Pool, params: KgAddParams): Promise<KgTriple> {\n  const confidence = params.confidence ?? \"EXTRACTED\";\n  const result = await pool.query<Record<string, unknown>>(\n    `INSERT INTO kg_triples\n       (subject, predicate, object, project_id, source_session, confidence)\n     VALUES ($1, $2, $3, $4, $5, $6)\n     RETURNING *`,\n    [\n      params.subject,\n      params.predicate,\n      params.object,\n      params.project_id ?? null,\n      params.source_session ?? null,\n      confidence,\n    ]\n  );\n  return rowToTriple(result.rows[0]);\n}\n\n/**\n * Query triples by subject, predicate, object, and/or project.\n * Supports point-in-time queries via as_of.\n * By default only returns currently-valid triples (valid_to IS NULL).\n */\nexport async function kgQuery(pool: Pool, params: KgQueryParams): Promise<KgTriple[]> {\n  const conditions: string[] = [];\n  const values: unknown[] = [];\n  let idx = 1;\n\n  if (params.subject !== undefined) {\n    conditions.push(`subject = $${idx++}`);\n    values.push(params.subject);\n  }\n  if (params.predicate !== undefined) {\n    conditions.push(`predicate = $${idx++}`);\n    values.push(params.predicate);\n  }\n  if (params.object !== undefined) {\n    conditions.push(`object = $${idx++}`);\n    values.push(params.object);\n  }\n  if (params.project_id !== undefined) {\n    conditions.push(`project_id = $${idx++}`);\n    values.push(params.project_id);\n  }\n\n  if (params.as_of !== undefined) {\n    // Valid at the given timestamp: started before or at as_of, and not yet ended\n    conditions.push(`valid_from <= $${idx++}`);\n    values.push(params.as_of);\n    conditions.push(`(valid_to IS NULL OR valid_to > $${idx++})`);\n    values.push(params.as_of);\n  } else if (!params.include_invalidated) {\n    // Default: only currently-valid (no valid_to set)\n    conditions.push(`valid_to IS NULL`);\n  }\n\n  const where = conditions.length > 0 ? `WHERE ${conditions.join(\" AND \")}` : \"\";\n  const result = await pool.query<Record<string, unknown>>(\n    `SELECT * FROM kg_triples ${where} ORDER BY valid_from DESC`,\n    values\n  );\n  return result.rows.map(rowToTriple);\n}\n\n/**\n * Invalidate a triple by setting valid_to = NOW().\n * Does not delete the row — preserves history.\n */\nexport async function kgInvalidate(pool: Pool, tripleId: number): Promise<void> {\n  await pool.query(\n    `UPDATE kg_triples SET valid_to = NOW() WHERE id = $1 AND valid_to IS NULL`,\n    [tripleId]\n  );\n}\n\n/**\n * Find contradictions: cases where the same (subject, predicate) pair has\n * multiple currently-valid objects.\n */\nexport async function kgContradictions(\n  pool: Pool,\n  subject: string\n): Promise<KgContradiction[]> {\n  const result = await pool.query<{ subject: string; predicate: string; objects: string[] }>(\n    `SELECT subject, predicate, array_agg(object ORDER BY object) AS objects\n     FROM kg_triples\n     WHERE subject = $1\n       AND valid_to IS NULL\n     GROUP BY subject, predicate\n     HAVING COUNT(*) > 1`,\n    [subject]\n  );\n  return result.rows.map((row) => ({\n    subject: row.subject,\n    predicate: row.predicate,\n    objects: row.objects,\n  }));\n}\n","/**\n * kg-entity.ts — Entity content-addressing with multi-tenant support.\n *\n * Provides UUID5-style deterministic content hashes for KG entities and edges,\n * ensuring that the same entity name always maps to the same ID within a tenant.\n * This enables idempotent upserts and stable foreign keys for kg_triples.\n *\n * Multi-tenant support: each tenant namespace gets its own entity ID space.\n * The default tenant is \"default\" for single-user deployments.\n */\n\nimport { createHash } from \"node:crypto\";\nimport type { Database } from \"better-sqlite3\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgEntity {\n  entity_id: string;\n  tenant_id: string;\n  name: string;\n  type: string;\n  description?: string;\n  first_seen?: number;\n  last_seen?: number;\n  mention_count: number;\n  feedback_weight: number;\n}\n\nexport interface KgEntityUpsertParams {\n  name: string;\n  type?: string;\n  description?: string;\n  tenantId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Content addressing\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a deterministic entity ID (UUID5-style) for a given name and tenant.\n *\n * The ID is a hex digest derived from \"tenant_id:name\" so the same entity\n * always receives the same ID within a tenant namespace.\n *\n * @param name      Entity name (case-preserved)\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function entityContentId(name: string, tenantId = \"default\"): string {\n  return createHash(\"sha256\")\n    .update(`entity:${tenantId}:${name}`)\n    .digest(\"hex\")\n    .slice(0, 32); // 128-bit hex string — UUID5-compatible length\n}\n\n/**\n * Generate a deterministic edge ID for a (source, relation, target) triple\n * within a tenant namespace.\n *\n * @param source    Source entity name\n * @param relation  Relation/predicate verb phrase\n * @param target    Target entity name\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function edgeContentId(\n  source: string,\n  relation: string,\n  target: string,\n  tenantId = \"default\"\n): string {\n  return createHash(\"sha256\")\n    .update(`edge:${tenantId}:${source}:${relation}:${target}`)\n    .digest(\"hex\")\n    .slice(0, 32);\n}\n\n// ---------------------------------------------------------------------------\n// SQLite entity upsert (for federation.db)\n// ---------------------------------------------------------------------------\n\n/**\n * Upsert a KG entity in the federation SQLite database.\n *\n * If the entity already exists for this tenant:\n *   - Updates last_seen to now\n *   - Increments mention_count\n *   - Updates description if provided (overwrites older description)\n *\n * Returns the entity_id for use as a foreign key in kg_triples.\n */\nexport function upsertKgEntity(\n  db: Database,\n  params: KgEntityUpsertParams\n): string {\n  const tenantId = params.tenantId ?? \"default\";\n  const entityId = entityContentId(params.name, tenantId);\n  const now = Date.now();\n\n  db.prepare(`\n    INSERT INTO kg_entities\n      (entity_id, tenant_id, name, type, description, first_seen, last_seen, mention_count, feedback_weight)\n    VALUES\n      (?, ?, ?, ?, ?, ?, ?, 1, 0.5)\n    ON CONFLICT(entity_id) DO UPDATE SET\n      last_seen     = excluded.last_seen,\n      mention_count = mention_count + 1,\n      description   = COALESCE(excluded.description, description),\n      type          = CASE WHEN excluded.type != 'unknown' THEN excluded.type ELSE type END\n  `).run(\n    entityId,\n    tenantId,\n    params.name,\n    params.type ?? \"unknown\",\n    params.description ?? null,\n    now,\n    now\n  );\n\n  return entityId;\n}\n\n/**\n * Look up a KG entity by name within a tenant.\n * Returns null if the entity does not exist.\n */\nexport function findKgEntity(\n  db: Database,\n  name: string,\n  tenantId = \"default\"\n): KgEntity | null {\n  const entityId = entityContentId(name, tenantId);\n  const row = db.prepare(\n    \"SELECT * FROM kg_entities WHERE entity_id = ? AND tenant_id = ?\"\n  ).get(entityId, tenantId) as KgEntity | undefined;\n  return row ?? null;\n}\n\n/**\n * List KG entities for a tenant, optionally filtered by type.\n *\n * @param db        Federation SQLite database\n * @param tenantId  Tenant namespace (default: \"default\")\n * @param type      Optional entity type filter\n * @param limit     Maximum entities to return (default: 100)\n */\nexport function listKgEntities(\n  db: Database,\n  tenantId = \"default\",\n  type?: string,\n  limit = 100\n): KgEntity[] {\n  if (type) {\n    return db.prepare(\n      \"SELECT * FROM kg_entities WHERE tenant_id = ? AND type = ? ORDER BY mention_count DESC LIMIT ?\"\n    ).all(tenantId, type, limit) as KgEntity[];\n  }\n  return db.prepare(\n    \"SELECT * FROM kg_entities WHERE tenant_id = ? ORDER BY mention_count DESC LIMIT ?\"\n  ).all(tenantId, limit) as KgEntity[];\n}\n\n// ---------------------------------------------------------------------------\n// Feedback weight update (MR2 — EMA)\n// ---------------------------------------------------------------------------\n\n/**\n * Apply an EMA (Exponential Moving Average) feedback update to an entity's weight.\n *\n * EMA formula: new_weight = old_weight + alpha * (target - old_weight)\n *\n * @param db            Federation SQLite database\n * @param entityId      Entity ID to update\n * @param normalizedRating  Rating normalized to [0, 1] (e.g., rating/5 for 1-5 scale)\n * @param alpha         EMA learning rate (default: 0.1)\n */\nexport function updateEntityFeedbackWeight(\n  db: Database,\n  entityId: string,\n  normalizedRating: number,\n  alpha = 0.1\n): void {\n  const row = db.prepare(\n    \"SELECT feedback_weight FROM kg_entities WHERE entity_id = ?\"\n  ).get(entityId) as { feedback_weight: number } | undefined;\n\n  if (!row) return;\n\n  const newWeight = row.feedback_weight + alpha * (normalizedRating - row.feedback_weight);\n  db.prepare(\n    \"UPDATE kg_entities SET feedback_weight = ? WHERE entity_id = ?\"\n  ).run(newWeight, entityId);\n}\n"],"mappings":";;;AAuDA,SAAS,YAAY,KAAwC;AAC3D,QAAO;EACL,IAAI,IAAI;EACR,SAAS,IAAI;EACb,WAAW,IAAI;EACf,QAAQ,IAAI;EACZ,YAAY,IAAI;EAChB,gBAAgB,IAAI;EACpB,YAAY,IAAI,KAAK,IAAI,WAAqB;EAC9C,UAAU,IAAI,WAAW,IAAI,KAAK,IAAI,SAAmB,GAAG;EAC5D,YAAY,IAAI;EAChB,YAAY,IAAI,KAAK,IAAI,WAAqB;EAC/C;;;;;;AAWH,eAAsB,MAAM,MAAY,QAAwC;CAC9E,MAAM,aAAa,OAAO,cAAc;AAexC,QAAO,aAdQ,MAAM,KAAK,MACxB;;;mBAIA;EACE,OAAO;EACP,OAAO;EACP,OAAO;EACP,OAAO,cAAc;EACrB,OAAO,kBAAkB;EACzB;EACD,CACF,EACyB,KAAK,GAAG;;;;;;;AAQpC,eAAsB,QAAQ,MAAY,QAA4C;CACpF,MAAM,aAAuB,EAAE;CAC/B,MAAM,SAAoB,EAAE;CAC5B,IAAI,MAAM;AAEV,KAAI,OAAO,YAAY,QAAW;AAChC,aAAW,KAAK,cAAc,QAAQ;AACtC,SAAO,KAAK,OAAO,QAAQ;;AAE7B,KAAI,OAAO,cAAc,QAAW;AAClC,aAAW,KAAK,gBAAgB,QAAQ;AACxC,SAAO,KAAK,OAAO,UAAU;;AAE/B,KAAI,OAAO,WAAW,QAAW;AAC/B,aAAW,KAAK,aAAa,QAAQ;AACrC,SAAO,KAAK,OAAO,OAAO;;AAE5B,KAAI,OAAO,eAAe,QAAW;AACnC,aAAW,KAAK,iBAAiB,QAAQ;AACzC,SAAO,KAAK,OAAO,WAAW;;AAGhC,KAAI,OAAO,UAAU,QAAW;AAE9B,aAAW,KAAK,kBAAkB,QAAQ;AAC1C,SAAO,KAAK,OAAO,MAAM;AACzB,aAAW,KAAK,oCAAoC,MAAM,GAAG;AAC7D,SAAO,KAAK,OAAO,MAAM;YAChB,CAAC,OAAO,oBAEjB,YAAW,KAAK,mBAAmB;CAGrC,MAAM,QAAQ,WAAW,SAAS,IAAI,SAAS,WAAW,KAAK,QAAQ,KAAK;AAK5E,SAJe,MAAM,KAAK,MACxB,4BAA4B,MAAM,4BAClC,OACD,EACa,KAAK,IAAI,YAAY;;;;;;AAOrC,eAAsB,aAAa,MAAY,UAAiC;AAC9E,OAAM,KAAK,MACT,6EACA,CAAC,SAAS,CACX;;;;;;AAOH,eAAsB,iBACpB,MACA,SAC4B;AAU5B,SATe,MAAM,KAAK,MACxB;;;;;2BAMA,CAAC,QAAQ,CACV,EACa,KAAK,KAAK,SAAS;EAC/B,SAAS,IAAI;EACb,WAAW,IAAI;EACf,SAAS,IAAI;EACd,EAAE;;;;;;;;;;;;;;;;;;;;;;;;AC7HL,SAAgB,gBAAgB,MAAc,WAAW,WAAmB;AAC1E,QAAO,WAAW,SAAS,CACxB,OAAO,UAAU,SAAS,GAAG,OAAO,CACpC,OAAO,MAAM,CACb,MAAM,GAAG,GAAG;;;;;;;;;;;;AAsCjB,SAAgB,eACd,IACA,QACQ;CACR,MAAM,WAAW,OAAO,YAAY;CACpC,MAAM,WAAW,gBAAgB,OAAO,MAAM,SAAS;CACvD,MAAM,MAAM,KAAK,KAAK;AAEtB,IAAG,QAAQ;;;;;;;;;;IAUT,CAAC,IACD,UACA,UACA,OAAO,MACP,OAAO,QAAQ,WACf,OAAO,eAAe,MACtB,KACA,IACD;AAED,QAAO;;;;;;;;;;AA2BT,SAAgB,eACd,IACA,WAAW,WACX,MACA,QAAQ,KACI;AACZ,KAAI,KACF,QAAO,GAAG,QACR,iGACD,CAAC,IAAI,UAAU,MAAM,MAAM;AAE9B,QAAO,GAAG,QACR,oFACD,CAAC,IAAI,UAAU,MAAM;;;;;;;;;;;;AAiBxB,SAAgB,2BACd,IACA,UACA,kBACA,QAAQ,IACF;CACN,MAAM,MAAM,GAAG,QACb,8DACD,CAAC,IAAI,SAAS;AAEf,KAAI,CAAC,IAAK;CAEV,MAAM,YAAY,IAAI,kBAAkB,SAAS,mBAAmB,IAAI;AACxE,IAAG,QACD,iEACD,CAAC,IAAI,WAAW,SAAS"}
+{"version":3,"file":"kg-entity-LXblD7LZ.mjs","names":[],"sources":["../src/memory/kg.ts","../src/memory/kg-entity.ts"],"sourcesContent":["/**\n * Temporal Knowledge Graph — kg_triples CRUD layer.\n *\n * Uses the Postgres connection pool from the storage backend.\n * Triples are time-scoped: valid_from/valid_to enable point-in-time queries.\n * Invalidation sets valid_to = NOW() instead of deleting rows.\n */\n\nimport type { Pool } from \"pg\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgTriple {\n  id: number;\n  subject: string;\n  predicate: string;\n  object: string;\n  project_id?: number;\n  source_session?: string;\n  valid_from: Date;\n  valid_to?: Date;\n  confidence: \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n  created_at: Date;\n}\n\nexport interface KgAddParams {\n  subject: string;\n  predicate: string;\n  object: string;\n  project_id?: number;\n  source_session?: string;\n  confidence?: \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\";\n}\n\nexport interface KgQueryParams {\n  subject?: string;\n  predicate?: string;\n  object?: string;\n  project_id?: number;\n  as_of?: Date;\n  include_invalidated?: boolean;\n}\n\nexport interface KgContradiction {\n  subject: string;\n  predicate: string;\n  objects: string[];\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction rowToTriple(row: Record<string, unknown>): KgTriple {\n  return {\n    id: row.id as number,\n    subject: row.subject as string,\n    predicate: row.predicate as string,\n    object: row.object as string,\n    project_id: row.project_id as number | undefined,\n    source_session: row.source_session as string | undefined,\n    valid_from: new Date(row.valid_from as string),\n    valid_to: row.valid_to ? new Date(row.valid_to as string) : undefined,\n    confidence: row.confidence as \"EXTRACTED\" | \"INFERRED\" | \"AMBIGUOUS\",\n    created_at: new Date(row.created_at as string),\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Core operations\n// ---------------------------------------------------------------------------\n\n/**\n * Add a new triple to the knowledge graph.\n * Returns the inserted triple.\n */\nexport async function kgAdd(pool: Pool, params: KgAddParams): Promise<KgTriple> {\n  const confidence = params.confidence ?? \"EXTRACTED\";\n  const result = await pool.query<Record<string, unknown>>(\n    `INSERT INTO kg_triples\n       (subject, predicate, object, project_id, source_session, confidence)\n     VALUES ($1, $2, $3, $4, $5, $6)\n     RETURNING *`,\n    [\n      params.subject,\n      params.predicate,\n      params.object,\n      params.project_id ?? null,\n      params.source_session ?? null,\n      confidence,\n    ]\n  );\n  return rowToTriple(result.rows[0]);\n}\n\n/**\n * Query triples by subject, predicate, object, and/or project.\n * Supports point-in-time queries via as_of.\n * By default only returns currently-valid triples (valid_to IS NULL).\n */\nexport async function kgQuery(pool: Pool, params: KgQueryParams): Promise<KgTriple[]> {\n  const conditions: string[] = [];\n  const values: unknown[] = [];\n  let idx = 1;\n\n  if (params.subject !== undefined) {\n    conditions.push(`subject = $${idx++}`);\n    values.push(params.subject);\n  }\n  if (params.predicate !== undefined) {\n    conditions.push(`predicate = $${idx++}`);\n    values.push(params.predicate);\n  }\n  if (params.object !== undefined) {\n    conditions.push(`object = $${idx++}`);\n    values.push(params.object);\n  }\n  if (params.project_id !== undefined) {\n    conditions.push(`project_id = $${idx++}`);\n    values.push(params.project_id);\n  }\n\n  if (params.as_of !== undefined) {\n    // Valid at the given timestamp: started before or at as_of, and not yet ended\n    conditions.push(`valid_from <= $${idx++}`);\n    values.push(params.as_of);\n    conditions.push(`(valid_to IS NULL OR valid_to > $${idx++})`);\n    values.push(params.as_of);\n  } else if (!params.include_invalidated) {\n    // Default: only currently-valid (no valid_to set)\n    conditions.push(`valid_to IS NULL`);\n  }\n\n  const where = conditions.length > 0 ? `WHERE ${conditions.join(\" AND \")}` : \"\";\n  const result = await pool.query<Record<string, unknown>>(\n    `SELECT * FROM kg_triples ${where} ORDER BY valid_from DESC`,\n    values\n  );\n  return result.rows.map(rowToTriple);\n}\n\n/**\n * Invalidate a triple by setting valid_to = NOW().\n * Does not delete the row — preserves history.\n */\nexport async function kgInvalidate(pool: Pool, tripleId: number): Promise<void> {\n  await pool.query(\n    `UPDATE kg_triples SET valid_to = NOW() WHERE id = $1 AND valid_to IS NULL`,\n    [tripleId]\n  );\n}\n\n/**\n * Find contradictions: cases where the same (subject, predicate) pair has\n * multiple currently-valid objects.\n */\nexport async function kgContradictions(\n  pool: Pool,\n  subject: string\n): Promise<KgContradiction[]> {\n  const result = await pool.query<{ subject: string; predicate: string; objects: string[] }>(\n    `SELECT subject, predicate, array_agg(object ORDER BY object) AS objects\n     FROM kg_triples\n     WHERE subject = $1\n       AND valid_to IS NULL\n     GROUP BY subject, predicate\n     HAVING COUNT(*) > 1`,\n    [subject]\n  );\n  return result.rows.map((row) => ({\n    subject: row.subject,\n    predicate: row.predicate,\n    objects: row.objects,\n  }));\n}\n","/**\n * kg-entity.ts — Entity content-addressing with multi-tenant support.\n *\n * Provides UUID5-style deterministic content hashes for KG entities and edges,\n * ensuring that the same entity name always maps to the same ID within a tenant.\n * This enables idempotent upserts and stable foreign keys for kg_triples.\n *\n * Multi-tenant support: each tenant namespace gets its own entity ID space.\n * The default tenant is \"default\" for single-user deployments.\n */\n\nimport { createHash } from \"node:crypto\";\nimport type { Database } from \"better-sqlite3\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgEntity {\n  entity_id: string;\n  tenant_id: string;\n  name: string;\n  type: string;\n  description?: string;\n  first_seen?: number;\n  last_seen?: number;\n  mention_count: number;\n  feedback_weight: number;\n}\n\nexport interface KgEntityUpsertParams {\n  name: string;\n  type?: string;\n  description?: string;\n  tenantId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Content addressing\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a deterministic entity ID (UUID5-style) for a given name and tenant.\n *\n * The ID is a hex digest derived from \"tenant_id:name\" so the same entity\n * always receives the same ID within a tenant namespace.\n *\n * @param name      Entity name (case-preserved)\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function entityContentId(name: string, tenantId = \"default\"): string {\n  return createHash(\"sha256\")\n    .update(`entity:${tenantId}:${name}`)\n    .digest(\"hex\")\n    .slice(0, 32); // 128-bit hex string — UUID5-compatible length\n}\n\n/**\n * Generate a deterministic edge ID for a (source, relation, target) triple\n * within a tenant namespace.\n *\n * @param source    Source entity name\n * @param relation  Relation/predicate verb phrase\n * @param target    Target entity name\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function edgeContentId(\n  source: string,\n  relation: string,\n  target: string,\n  tenantId = \"default\"\n): string {\n  return createHash(\"sha256\")\n    .update(`edge:${tenantId}:${source}:${relation}:${target}`)\n    .digest(\"hex\")\n    .slice(0, 32);\n}\n\n// ---------------------------------------------------------------------------\n// SQLite entity upsert (for federation.db)\n// ---------------------------------------------------------------------------\n\n/**\n * Upsert a KG entity in the federation SQLite database.\n *\n * If the entity already exists for this tenant:\n *   - Updates last_seen to now\n *   - Increments mention_count\n *   - Updates description if provided (overwrites older description)\n *\n * Returns the entity_id for use as a foreign key in kg_triples.\n */\nexport function upsertKgEntity(\n  db: Database,\n  params: KgEntityUpsertParams\n): string {\n  const tenantId = params.tenantId ?? \"default\";\n  const entityId = entityContentId(params.name, tenantId);\n  const now = Date.now();\n\n  db.prepare(`\n    INSERT INTO kg_entities\n      (entity_id, tenant_id, name, type, description, first_seen, last_seen, mention_count, feedback_weight)\n    VALUES\n      (?, ?, ?, ?, ?, ?, ?, 1, 0.5)\n    ON CONFLICT(entity_id) DO UPDATE SET\n      last_seen     = excluded.last_seen,\n      mention_count = mention_count + 1,\n      description   = COALESCE(excluded.description, description),\n      type          = CASE WHEN excluded.type != 'unknown' THEN excluded.type ELSE type END\n  `).run(\n    entityId,\n    tenantId,\n    params.name,\n    params.type ?? \"unknown\",\n    params.description ?? null,\n    now,\n    now\n  );\n\n  return entityId;\n}\n\n/**\n * Look up a KG entity by name within a tenant.\n * Returns null if the entity does not exist.\n */\nexport function findKgEntity(\n  db: Database,\n  name: string,\n  tenantId = \"default\"\n): KgEntity | null {\n  const entityId = entityContentId(name, tenantId);\n  const row = db.prepare(\n    \"SELECT * FROM kg_entities WHERE entity_id = ? AND tenant_id = ?\"\n  ).get(entityId, tenantId) as KgEntity | undefined;\n  return row ?? null;\n}\n\n/**\n * List KG entities for a tenant, optionally filtered by type.\n *\n * @param db        Federation SQLite database\n * @param tenantId  Tenant namespace (default: \"default\")\n * @param type      Optional entity type filter\n * @param limit     Maximum entities to return (default: 100)\n */\nexport function listKgEntities(\n  db: Database,\n  tenantId = \"default\",\n  type?: string,\n  limit = 100\n): KgEntity[] {\n  if (type) {\n    return db.prepare(\n      \"SELECT * FROM kg_entities WHERE tenant_id = ? AND type = ? ORDER BY mention_count DESC LIMIT ?\"\n    ).all(tenantId, type, limit) as KgEntity[];\n  }\n  return db.prepare(\n    \"SELECT * FROM kg_entities WHERE tenant_id = ? ORDER BY mention_count DESC LIMIT ?\"\n  ).all(tenantId, limit) as KgEntity[];\n}\n\n// ---------------------------------------------------------------------------\n// Feedback weight update (MR2 — EMA)\n// ---------------------------------------------------------------------------\n\n/**\n * Apply an EMA (Exponential Moving Average) feedback update to an entity's weight.\n *\n * EMA formula: new_weight = old_weight + alpha * (target - old_weight)\n *\n * @param db            Federation SQLite database\n * @param entityId      Entity ID to update\n * @param normalizedRating  Rating normalized to [0, 1] (e.g., rating/5 for 1-5 scale)\n * @param alpha         EMA learning rate (default: 0.1)\n */\nexport function updateEntityFeedbackWeight(\n  db: Database,\n  entityId: string,\n  normalizedRating: number,\n  alpha = 0.1\n): void {\n  const row = db.prepare(\n    \"SELECT feedback_weight FROM kg_entities WHERE entity_id = ?\"\n  ).get(entityId) as { feedback_weight: number } | undefined;\n\n  if (!row) return;\n\n  const newWeight = row.feedback_weight + alpha * (normalizedRating - row.feedback_weight);\n  db.prepare(\n    \"UPDATE kg_entities SET feedback_weight = ? WHERE entity_id = ?\"\n  ).run(newWeight, entityId);\n}\n"],"mappings":";;;AAuDA,SAAS,YAAY,KAAwC;AAC3D,QAAO;EACL,IAAI,IAAI;EACR,SAAS,IAAI;EACb,WAAW,IAAI;EACf,QAAQ,IAAI;EACZ,YAAY,IAAI;EAChB,gBAAgB,IAAI;EACpB,YAAY,IAAI,KAAK,IAAI,WAAqB;EAC9C,UAAU,IAAI,WAAW,IAAI,KAAK,IAAI,SAAmB,GAAG;EAC5D,YAAY,IAAI;EAChB,YAAY,IAAI,KAAK,IAAI,WAAqB;EAC/C;;;;;;AAWH,eAAsB,MAAM,MAAY,QAAwC;CAC9E,MAAM,aAAa,OAAO,cAAc;AAexC,QAAO,aAdQ,MAAM,KAAK,MACxB;;;mBAIA;EACE,OAAO;EACP,OAAO;EACP,OAAO;EACP,OAAO,cAAc;EACrB,OAAO,kBAAkB;EACzB;EACD,CACF,EACyB,KAAK,GAAG;;;;;;;AAQpC,eAAsB,QAAQ,MAAY,QAA4C;CACpF,MAAM,aAAuB,EAAE;CAC/B,MAAM,SAAoB,EAAE;CAC5B,IAAI,MAAM;AAEV,KAAI,OAAO,YAAY,QAAW;AAChC,aAAW,KAAK,cAAc,QAAQ;AACtC,SAAO,KAAK,OAAO,QAAQ;;AAE7B,KAAI,OAAO,cAAc,QAAW;AAClC,aAAW,KAAK,gBAAgB,QAAQ;AACxC,SAAO,KAAK,OAAO,UAAU;;AAE/B,KAAI,OAAO,WAAW,QAAW;AAC/B,aAAW,KAAK,aAAa,QAAQ;AACrC,SAAO,KAAK,OAAO,OAAO;;AAE5B,KAAI,OAAO,eAAe,QAAW;AACnC,aAAW,KAAK,iBAAiB,QAAQ;AACzC,SAAO,KAAK,OAAO,WAAW;;AAGhC,KAAI,OAAO,UAAU,QAAW;AAE9B,aAAW,KAAK,kBAAkB,QAAQ;AAC1C,SAAO,KAAK,OAAO,MAAM;AACzB,aAAW,KAAK,oCAAoC,MAAM,GAAG;AAC7D,SAAO,KAAK,OAAO,MAAM;YAChB,CAAC,OAAO,oBAEjB,YAAW,KAAK,mBAAmB;CAGrC,MAAM,QAAQ,WAAW,SAAS,IAAI,SAAS,WAAW,KAAK,QAAQ,KAAK;AAK5E,SAJe,MAAM,KAAK,MACxB,4BAA4B,MAAM,4BAClC,OACD,EACa,KAAK,IAAI,YAAY;;;;;;AAOrC,eAAsB,aAAa,MAAY,UAAiC;AAC9E,OAAM,KAAK,MACT,6EACA,CAAC,SAAS,CACX;;;;;;AAOH,eAAsB,iBACpB,MACA,SAC4B;AAU5B,SATe,MAAM,KAAK,MACxB;;;;;2BAMA,CAAC,QAAQ,CACV,EACa,KAAK,KAAK,SAAS;EAC/B,SAAS,IAAI;EACb,WAAW,IAAI;EACf,SAAS,IAAI;EACd,EAAE;;;;;;;;;;;;;;;;;;;;;;;;AC7HL,SAAgB,gBAAgB,MAAc,WAAW,WAAmB;AAC1E,QAAO,WAAW,SAAS,CACxB,OAAO,UAAU,SAAS,GAAG,OAAO,CACpC,OAAO,MAAM,CACb,MAAM,GAAG,GAAG;;;;;;;;;;;;AAsCjB,SAAgB,eACd,IACA,QACQ;CACR,MAAM,WAAW,OAAO,YAAY;CACpC,MAAM,WAAW,gBAAgB,OAAO,MAAM,SAAS;CACvD,MAAM,MAAM,KAAK,KAAK;AAEtB,IAAG,QAAQ;;;;;;;;;;IAUT,CAAC,IACD,UACA,UACA,OAAO,MACP,OAAO,QAAQ,WACf,OAAO,eAAe,MACtB,KACA,IACD;AAED,QAAO;;;;;;;;;;AA2BT,SAAgB,eACd,IACA,WAAW,WACX,MACA,QAAQ,KACI;AACZ,KAAI,KACF,QAAO,GAAG,QACR,iGACD,CAAC,IAAI,UAAU,MAAM,MAAM;AAE9B,QAAO,GAAG,QACR,oFACD,CAAC,IAAI,UAAU,MAAM;;;;;;;;;;;;AAiBxB,SAAgB,2BACd,IACA,UACA,kBACA,QAAQ,IACF;CACN,MAAM,MAAM,GAAG,QACb,8DACD,CAAC,IAAI,SAAS;AAEf,KAAI,CAAC,IAAK;CAEV,MAAM,YAAY,IAAI,kBAAkB,SAAS,mBAAmB,IAAI;AACxE,IAAG,QACD,iEACD,CAAC,IAAI,WAAW,SAAS"}

package/dist/{kg-extraction-iR1BKKWK.mjs → kg-extraction-C8DEUHTS.mjs}

@@ -1,7 +1,7 @@
-import { _ as warn, c as ok, i as err, n as dim, r as encodeDir, s as now, t as bold } from "./utils-BAxjW3j8.mjs";
-import { a as slugify, i as parseSessionFilename, n as decodeEncodedDir, t as buildEncodedDirMap } from "./migrate-fLD6rAdO.mjs";
-import { n as ensurePaiMarker, t as discoverPaiMarkers } from "./pai-marker-CXQPX2P6.mjs";
-import { i as kgAdd, o as kgInvalidate, r as upsertKgEntity, s as kgQuery } from "./kg-entity-DVzTsy6G.mjs";
+import { _ as warn, c as ok, i as err, n as dim, r as encodeDir, s as now, t as bold } from "./utils-CqqgB0dH.mjs";
+import { a as slugify, i as parseSessionFilename, n as decodeEncodedDir, t as buildEncodedDirMap } from "./migrate-B02wDDgS.mjs";
+import { n as ensurePaiMarker, t as discoverPaiMarkers } from "./pai-marker-HVBwwBW-.mjs";
+import { i as kgAdd, o as kgInvalidate, r as upsertKgEntity, s as kgQuery } from "./kg-entity-LXblD7LZ.mjs";
 import { existsSync, mkdirSync, readFileSync, readdirSync, realpathSync, statSync, writeFileSync } from "node:fs";
 import { homedir } from "node:os";
 import { basename, join, resolve } from "node:path";
@@ -14,6 +14,9 @@ import { basename, join, resolve } from "node:path";
 *  1. root_path  — most reliable; handles slug collisions
 *  2. encoded_dir — Claude project dirs are canonical
 *  3. Insert with suffix-deduplication on slug collision
+*
+* display_name is set to basename(rootPath) on INSERT so that the unified
+* listing always shows a human-readable name rather than the kebab-case slug.
 */
 function upsertProject(db, slug, rootPath, encodedDir) {
 	const ts = now();
@@ -42,9 +45,10 @@ function upsertProject(db, slug, rootPath, encodedDir) {
 		attempt++;
 		finalSlug = `${slug}-${attempt}`;
 	}
+	const displayName = basename(rootPath) || finalSlug;
 	const result = db.prepare(`INSERT OR IGNORE INTO projects
          (slug, display_name, root_path, encoded_dir, type, status, created_at, updated_at)
-       VALUES (?, ?, ?, ?, 'local', 'active', ?, ?)`).run(finalSlug, finalSlug, rootPath, encodedDir, ts, ts);
+       VALUES (?, ?, ?, ?, 'local', 'active', ?, ?)`).run(finalSlug, displayName, rootPath, encodedDir, ts, ts);
 	if (result.changes === 0) {
 		const fallback = db.prepare("SELECT id FROM projects WHERE encoded_dir = ?").get(encodedDir) ?? db.prepare("SELECT id FROM projects WHERE root_path = ?").get(rootPath);
 		if (fallback) return {
@@ -277,6 +281,13 @@ function performScan(db) {
 			}
 		}
 	}
+	{
+		const stale = db.prepare("SELECT id, slug, root_path FROM projects WHERE display_name = slug AND root_path IS NOT NULL AND root_path != ''").all();
+		for (const row of stale) {
+			const name = basename(row.root_path);
+			if (name && name !== row.slug) db.prepare("UPDATE projects SET display_name = ?, updated_at = ? WHERE id = ?").run(name, Date.now(), row.id);
+		}
+	}
 	return result;
 }
 /**
@@ -555,4 +566,4 @@ async function extractAndStoreTriples(pool, params) {
 
 //#endregion
 export { resolveHome as a, upsertSession as c, performScan as i, cmdScan as n, saveScanConfig as o, loadScanConfig as r, upsertProject as s, extractAndStoreTriples as t };
-//# sourceMappingURL=kg-extraction-iR1BKKWK.mjs.map
+//# sourceMappingURL=kg-extraction-C8DEUHTS.mjs.map

package/dist/kg-extraction-C8DEUHTS.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"kg-extraction-C8DEUHTS.mjs","names":[],"sources":["../src/cli/commands/registry/utils.ts","../src/cli/commands/registry/scan.ts","../src/daemon/templates/triple-extraction-prompt.ts","../src/memory/kg-extraction.ts"],"sourcesContent":["/** Shared database helpers for registry command operations. */\n\nimport type { Database } from \"better-sqlite3\";\nimport { now } from \"../../utils.js\";\nimport { basename } from \"node:path\";\n\n/**\n * Upsert a project row. Returns { id, isNew }.\n *\n * Matching priority:\n *  1. root_path  — most reliable; handles slug collisions\n *  2. encoded_dir — Claude project dirs are canonical\n *  3. Insert with suffix-deduplication on slug collision\n *\n * display_name is set to basename(rootPath) on INSERT so that the unified\n * listing always shows a human-readable name rather than the kebab-case slug.\n */\nexport function upsertProject(\n  db: Database,\n  slug: string,\n  rootPath: string,\n  encodedDir: string\n): { id: number; isNew: boolean } {\n  const ts = now();\n\n  const byPath = db\n    .prepare(\"SELECT id FROM projects WHERE root_path = ?\")\n    .get(rootPath) as { id: number } | undefined;\n\n  if (byPath) {\n    const encodedOwner = db\n      .prepare(\"SELECT id FROM projects WHERE encoded_dir = ?\")\n      .get(encodedDir) as { id: number } | undefined;\n\n    if (!encodedOwner || encodedOwner.id === byPath.id) {\n      db.prepare(\n        \"UPDATE projects SET encoded_dir = ?, updated_at = ? WHERE id = ?\"\n      ).run(encodedDir, ts, byPath.id);\n    }\n    return { id: byPath.id, isNew: false };\n  }\n\n  const byEncoded = db\n    .prepare(\"SELECT id FROM projects WHERE encoded_dir = ?\")\n    .get(encodedDir) as { id: number } | undefined;\n\n  if (byEncoded) {\n    const pathOwner = db\n      .prepare(\"SELECT id FROM projects WHERE root_path = ?\")\n      .get(rootPath) as { id: number } | undefined;\n\n    if (!pathOwner || pathOwner.id === byEncoded.id) {\n      db.prepare(\n        \"UPDATE projects SET root_path = ?, updated_at = ? WHERE id = ?\"\n      ).run(rootPath, ts, byEncoded.id);\n    }\n    return { id: byEncoded.id, isNew: false };\n  }\n\n  // Insert — deduplicate slug with numeric suffix if needed.\n  let finalSlug = slug;\n  let attempt = 0;\n  while (true) {\n    const conflict = db\n      .prepare(\"SELECT id FROM projects WHERE slug = ?\")\n      .get(finalSlug) as { id: number } | undefined;\n    if (!conflict) break;\n    attempt++;\n    finalSlug = `${slug}-${attempt}`;\n  }\n\n  // Use basename(rootPath) as the human display name. If rootPath is empty or\n  // just \"/\" fall back to the slug so we always have something non-empty.\n  const displayName = basename(rootPath) || finalSlug;\n\n  const result = db\n    .prepare(\n      `INSERT OR IGNORE INTO projects\n         (slug, display_name, root_path, encoded_dir, type, status, created_at, updated_at)\n       VALUES (?, ?, ?, ?, 'local', 'active', ?, ?)`\n    )\n    .run(finalSlug, displayName, rootPath, encodedDir, ts, ts);\n\n  if (result.changes === 0) {\n    const fallback =\n      (db.prepare(\"SELECT id FROM projects WHERE encoded_dir = ?\").get(encodedDir) as { id: number } | undefined) ??\n      (db.prepare(\"SELECT id FROM projects WHERE root_path = ?\").get(rootPath) as { id: number } | undefined);\n\n    if (fallback) {\n      return { id: fallback.id, isNew: false };\n    }\n\n    throw new Error(\n      `upsertProject: INSERT OR IGNORE was suppressed but no matching row found ` +\n      `for root_path=${rootPath} encoded_dir=${encodedDir}`\n    );\n  }\n\n  return { id: result.lastInsertRowid as number, isNew: true };\n}\n\n/** Upsert a session note. Returns true if newly inserted. */\nexport function upsertSession(\n  db: Database,\n  projectId: number,\n  number: number,\n  date: string,\n  slug: string,\n  title: string,\n  filename: string\n): boolean {\n  const existing = db\n    .prepare(\"SELECT id FROM sessions WHERE project_id = ? AND number = ?\")\n    .get(projectId, number);\n\n  if (existing) return false;\n\n  const ts = now();\n  db.prepare(\n    `INSERT INTO sessions\n       (project_id, number, date, slug, title, filename, status, created_at)\n     VALUES (?, ?, ?, ?, ?, ?, 'completed', ?)`\n  ).run(projectId, number, date, slug, title, filename, ts);\n\n  return true;\n}\n","/** Registry scan command: walk ~/.claude/projects/ and populate the registry. */\n\nimport { existsSync, readdirSync, statSync, readFileSync, writeFileSync, mkdirSync } from \"node:fs\";\nimport { realpathSync } from \"node:fs\";\nimport { join, basename, resolve } from \"node:path\";\nimport { homedir } from \"node:os\";\nimport { ok, warn, err, dim, bold } from \"../../utils.js\";\nimport { encodeDir } from \"../../utils.js\";\nimport { decodeEncodedDir, slugify, parseSessionFilename, buildEncodedDirMap } from \"../../../registry/migrate.js\";\nimport { ensurePaiMarker, discoverPaiMarkers } from \"../../../registry/pai-marker.js\";\nimport { upsertProject, upsertSession } from \"./utils.js\";\nimport type { Database } from \"better-sqlite3\";\n\n// ---------------------------------------------------------------------------\n// clc session.json fallback map\n// ---------------------------------------------------------------------------\n\n/**\n * Build a reverse map from encoded-dir → real path using the clc session\n * registry (~/.claude/session.json).\n *\n * The clc registry stores { sessions: [{ directory, ... }, ...] }. For each\n * entry with a resolvable directory, we encode the realpath and add it to\n * the map. This lets the scanner recover project paths that are not in\n * Claude's session-registry.json but were registered by clc.\n */\nfunction buildClcDirMap(): Map<string, string> {\n  const map = new Map<string, string>();\n  const sessionFile = join(homedir(), \".claude\", \"session.json\");\n  if (!existsSync(sessionFile)) return map;\n\n  try {\n    const raw = readFileSync(sessionFile, \"utf8\");\n    const parsed = JSON.parse(raw) as { sessions?: Array<{ directory?: string }> };\n    for (const entry of parsed.sessions ?? []) {\n      const dir = entry.directory;\n      if (!dir) continue;\n      try {\n        const real = realpathSync(dir);\n        if (!existsSync(real)) continue;\n        const encoded = encodeDir(real);\n        map.set(encoded, real);\n      } catch {\n        // Unresolvable path — skip\n      }\n    }\n  } catch {\n    // Unparseable — return empty map\n  }\n  return map;\n}\n\n// ---------------------------------------------------------------------------\n// Config helpers\n// ---------------------------------------------------------------------------\n\nconst CLAUDE_PROJECTS_DIR = join(homedir(), \".claude\", \"projects\");\nconst PAI_CONFIG_DIR = join(homedir(), \".pai\");\nconst PAI_CONFIG_FILE = join(PAI_CONFIG_DIR, \"config.json\");\n\ninterface PaiConfig {\n  scan_dirs: string[];\n}\n\nexport function loadScanConfig(): PaiConfig {\n  if (!existsSync(PAI_CONFIG_FILE)) return { scan_dirs: [] };\n  try {\n    return JSON.parse(readFileSync(PAI_CONFIG_FILE, \"utf8\")) as PaiConfig;\n  } catch {\n    return { scan_dirs: [] };\n  }\n}\n\nexport function saveScanConfig(config: PaiConfig): void {\n  mkdirSync(PAI_CONFIG_DIR, { recursive: true });\n  writeFileSync(PAI_CONFIG_FILE, JSON.stringify(config, null, 2) + \"\\n\", \"utf8\");\n}\n\nexport function resolveHome(p: string): string {\n  if (p.startsWith(\"~/\")) return join(homedir(), p.slice(2));\n  return resolve(p);\n}\n\n// ---------------------------------------------------------------------------\n// File discovery\n// ---------------------------------------------------------------------------\n\n/**\n * Recursively find all .md files in a directory, including YYYY/MM subdirectories.\n * Returns filenames (basename only).\n */\nexport function findNoteFiles(dir: string): string[] {\n  const results: string[] = [];\n  if (!existsSync(dir)) return results;\n\n  for (const entry of readdirSync(dir, { withFileTypes: true })) {\n    if (entry.isFile() && entry.name.endsWith(\".md\")) {\n      results.push(entry.name);\n    } else if (entry.isDirectory() && /^\\d{4}$/.test(entry.name)) {\n      const yearDir = join(dir, entry.name);\n      for (const monthEntry of readdirSync(yearDir, { withFileTypes: true })) {\n        if (monthEntry.isDirectory() && /^\\d{2}$/.test(monthEntry.name)) {\n          const monthDir = join(yearDir, monthEntry.name);\n          for (const noteEntry of readdirSync(monthDir, { withFileTypes: true })) {\n            if (noteEntry.isFile() && noteEntry.name.endsWith(\".md\")) {\n              results.push(noteEntry.name);\n            }\n          }\n        }\n      }\n    }\n  }\n  return results;\n}\n\n// ---------------------------------------------------------------------------\n// Scan result type\n// ---------------------------------------------------------------------------\n\nexport interface ScanResult {\n  projectsScanned: number;\n  projectsNew: number;\n  projectsUpdated: number;\n  sessionsScanned: number;\n  sessionsNew: number;\n  skipped: string[];\n}\n\n// ---------------------------------------------------------------------------\n// Core scan logic\n// ---------------------------------------------------------------------------\n\nexport function performScan(db: Database): ScanResult {\n  const result: ScanResult = {\n    projectsScanned: 0,\n    projectsNew: 0,\n    projectsUpdated: 0,\n    sessionsScanned: 0,\n    sessionsNew: 0,\n    skipped: [],\n  };\n\n  if (!existsSync(CLAUDE_PROJECTS_DIR)) {\n    throw new Error(`Claude projects directory not found: ${CLAUDE_PROJECTS_DIR}`);\n  }\n\n  const entries = readdirSync(CLAUDE_PROJECTS_DIR).filter((name) => {\n    const full = join(CLAUDE_PROJECTS_DIR, name);\n    return statSync(full).isDirectory();\n  });\n\n  const lookupMap = buildEncodedDirMap();\n  const clcMap = buildClcDirMap();\n\n  for (const encodedDir of entries) {\n    let rootPath = decodeEncodedDir(encodedDir, lookupMap);\n\n    // If the decoded path doesn't exist, try the clc session.json fallback map.\n    // The clc map is keyed by encodeDir(realpathSync(directory)), so paths that\n    // were registered by clc but not in session-registry.json can be recovered.\n    if (!existsSync(rootPath) && clcMap.has(encodedDir)) {\n      const clcPath = clcMap.get(encodedDir)!;\n      if (existsSync(clcPath)) {\n        rootPath = clcPath;\n      }\n    }\n\n    if (!existsSync(rootPath)) {\n      result.skipped.push(`${encodedDir} (decoded: ${rootPath} — path not found on disk)`);\n      result.projectsScanned++;\n      continue;\n    }\n\n    const slug = slugify(basename(rootPath) || encodedDir);\n    const { id, isNew } = upsertProject(db, slug, rootPath, encodedDir);\n\n    result.projectsScanned++;\n    if (isNew) result.projectsNew++;\n    else result.projectsUpdated++;\n\n    try {\n      ensurePaiMarker(rootPath, slug);\n    } catch {\n      // Non-fatal\n    }\n\n    const claudeNotesDir = join(CLAUDE_PROJECTS_DIR, encodedDir, \"Notes\");\n\n    if (existsSync(claudeNotesDir)) {\n      const rootNotesDir = join(rootPath, \"Notes\");\n      if (claudeNotesDir !== rootNotesDir) {\n        db.prepare(\n          \"UPDATE projects SET claude_notes_dir = ?, updated_at = ? WHERE id = ?\"\n        ).run(claudeNotesDir, Date.now(), id);\n      }\n    }\n\n    if (!existsSync(claudeNotesDir)) continue;\n\n    const noteFiles = findNoteFiles(claudeNotesDir);\n\n    for (const filename of noteFiles) {\n      const parsed = parseSessionFilename(filename);\n      if (!parsed) continue;\n\n      result.sessionsScanned++;\n      const isNewSession = upsertSession(db, id, parsed.number, parsed.date, parsed.slug, parsed.title, parsed.filename);\n      if (isNewSession) result.sessionsNew++;\n    }\n  }\n\n  // Phase 2: Scan project-root Notes/ for all registered active projects\n  {\n    const activeProjects = db\n      .prepare(\"SELECT id, slug, root_path FROM projects WHERE status = 'active'\")\n      .all() as { id: number; slug: string; root_path: string }[];\n\n    for (const project of activeProjects) {\n      const notesDir = join(project.root_path, \"Notes\");\n      if (!existsSync(notesDir)) continue;\n\n      let files: string[];\n      try {\n        files = findNoteFiles(notesDir);\n      } catch {\n        continue;\n      }\n\n      for (const filename of files) {\n        const parsed = parseSessionFilename(filename);\n        if (!parsed) continue;\n\n        result.sessionsScanned++;\n        const isNewSession = upsertSession(db, project.id, parsed.number, parsed.date, parsed.slug, parsed.title, parsed.filename);\n        if (isNewSession) result.sessionsNew++;\n      }\n    }\n  }\n\n  // Phase 3: Scan extra directories from config\n  const config = loadScanConfig();\n  if (config.scan_dirs.length) {\n    for (const rawDir of config.scan_dirs) {\n      const scanDir = resolveHome(rawDir);\n      if (!existsSync(scanDir)) {\n        result.skipped.push(`${rawDir} (configured scan_dir not found)`);\n        continue;\n      }\n\n      const children = readdirSync(scanDir).filter((name) => {\n        if (name.startsWith(\".\")) return false;\n        const full = join(scanDir, name);\n        try { return statSync(full).isDirectory(); } catch { return false; }\n      });\n\n      for (const child of children) {\n        const childPath = join(scanDir, child);\n        const childSlug = slugify(child);\n        const childEncoded = encodeDir(childPath);\n\n        const existing = db\n          .prepare(\"SELECT id FROM projects WHERE root_path = ?\")\n          .get(childPath) as { id: number } | undefined;\n\n        if (existing) {\n          result.projectsScanned++;\n          result.projectsUpdated++;\n\n          try { ensurePaiMarker(childPath, childSlug); } catch { /* non-fatal */ }\n\n          const notesDir = join(childPath, \"Notes\");\n          if (existsSync(notesDir)) {\n            const noteFiles = readdirSync(notesDir).filter((f) => f.endsWith(\".md\"));\n            for (const filename of noteFiles) {\n              const parsed = parseSessionFilename(filename);\n              if (!parsed) continue;\n              result.sessionsScanned++;\n              if (upsertSession(db, existing.id, parsed.number, parsed.date, parsed.slug, parsed.title, parsed.filename)) {\n                result.sessionsNew++;\n              }\n            }\n          }\n          continue;\n        }\n\n        const { id, isNew } = upsertProject(db, childSlug, childPath, childEncoded);\n        result.projectsScanned++;\n        if (isNew) result.projectsNew++;\n        else result.projectsUpdated++;\n\n        try { ensurePaiMarker(childPath, childSlug); } catch { /* non-fatal */ }\n\n        const notesDir = join(childPath, \"Notes\");\n        if (existsSync(notesDir)) {\n          const noteFiles = readdirSync(notesDir).filter((f) => f.endsWith(\".md\"));\n          for (const filename of noteFiles) {\n            const parsed = parseSessionFilename(filename);\n            if (!parsed) continue;\n            result.sessionsScanned++;\n            if (upsertSession(db, id, parsed.number, parsed.date, parsed.slug, parsed.title, parsed.filename)) {\n              result.sessionsNew++;\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Phase 4: Discover PAI.md markers in scan_dirs\n  if (config.scan_dirs.length) {\n    const resolvedScanDirs = config.scan_dirs.map(resolveHome).filter(existsSync);\n    const markers = discoverPaiMarkers(resolvedScanDirs);\n\n    for (const marker of markers) {\n      const registeredRow = db\n        .prepare(\"SELECT id, root_path, slug FROM projects WHERE slug = ?\")\n        .get(marker.slug) as { id: number; root_path: string; slug: string } | undefined;\n\n      if (!registeredRow) continue;\n\n      if (registeredRow.root_path !== marker.projectRoot) {\n        const newEncoded = encodeDir(marker.projectRoot);\n        const now4 = Date.now();\n\n        const encodedOwner = db\n          .prepare(\"SELECT id FROM projects WHERE encoded_dir = ?\")\n          .get(newEncoded) as { id: number } | undefined;\n        const pathOwner = db\n          .prepare(\"SELECT id FROM projects WHERE root_path = ?\")\n          .get(marker.projectRoot) as { id: number } | undefined;\n\n        const encodedSafe = !encodedOwner || encodedOwner.id === registeredRow.id;\n        const pathSafe = !pathOwner || pathOwner.id === registeredRow.id;\n\n        if (encodedSafe && pathSafe) {\n          db.prepare(\n            \"UPDATE projects SET root_path = ?, encoded_dir = ?, updated_at = ? WHERE id = ?\"\n          ).run(marker.projectRoot, newEncoded, now4, registeredRow.id);\n        } else if (pathSafe) {\n          db.prepare(\n            \"UPDATE projects SET root_path = ?, updated_at = ? WHERE id = ?\"\n          ).run(marker.projectRoot, now4, registeredRow.id);\n        }\n      }\n    }\n  }\n\n  // Phase 5: Backfill display_name for rows where it still equals the slug.\n  // This converts legacy entries created before the basename-based naming was\n  // introduced: \"jobs-grazyna\" → \"Jobs Grazyna\" (from basename of root_path).\n  {\n    const stale = db\n      .prepare(\"SELECT id, slug, root_path FROM projects WHERE display_name = slug AND root_path IS NOT NULL AND root_path != ''\")\n      .all() as { id: number; slug: string; root_path: string }[];\n\n    for (const row of stale) {\n      const name = basename(row.root_path);\n      if (name && name !== row.slug) {\n        db.prepare(\"UPDATE projects SET display_name = ?, updated_at = ? WHERE id = ?\")\n          .run(name, Date.now(), row.id);\n      }\n    }\n  }\n\n  return result;\n}\n\n// ---------------------------------------------------------------------------\n// cmdScan\n// ---------------------------------------------------------------------------\n\n/**\n * Run the registry scan CLI command.\n *\n * @param opts.quick  When true, skips verbose output (same scan, less noise).\n *                    The underlying scan is always incremental via upsert —\n *                    this flag exists for hook/daemon-triggered invocations that\n *                    want minimal log output.\n */\nexport function cmdScan(db: Database, opts: { quick?: boolean } = {}): void {\n  const config = loadScanConfig();\n  if (!opts.quick) {\n    console.log(dim(\"Scanning ~/.claude/projects/ ...\"));\n    if (config.scan_dirs.length) {\n      console.log(dim(`Scanning ${config.scan_dirs.length} extra dir(s): ${config.scan_dirs.join(\", \")}`));\n    }\n    console.log(dim(\"Scanning project-root Notes/ directories ...\"));\n  }\n\n  let result: ScanResult;\n  try {\n    result = performScan(db);\n  } catch (e) {\n    console.error(err(String(e)));\n    process.exit(1);\n  }\n\n  if (!opts.quick) {\n    console.log(\n      ok(`Scanned ${bold(String(result.projectsScanned))} projects, ${bold(String(result.sessionsScanned))} session notes.`)\n    );\n    console.log(dim(`  Projects: ${result.projectsNew} new, ${result.projectsUpdated} updated`));\n    console.log(dim(`  Sessions: ${result.sessionsNew} new`));\n\n    if (result.skipped.length) {\n      console.log();\n      console.log(warn(`  ${result.skipped.length} project(s) skipped (path not found on disk):`));\n      for (const s of result.skipped.slice(0, 10)) {\n        console.log(dim(`    ${s}`));\n      }\n      if (result.skipped.length > 10) {\n        console.log(dim(`    ... and ${result.skipped.length - 10} more`));\n      }\n    }\n  } else {\n    // Quick mode: single compact line (stderr so it doesn't pollute pipe output)\n    process.stderr.write(\n      `[registry-scan] ${result.projectsScanned} projects, ${result.sessionsScanned} sessions ` +\n      `(${result.projectsNew}+${result.sessionsNew} new).\\n`\n    );\n  }\n}\n","/**\n * triple-extraction-prompt.ts — Prompt template for KG triple extraction.\n *\n * Used by the session-summary-worker to extract structured facts from\n * a completed session summary and store them in the temporal knowledge graph.\n */\n\nexport function buildTripleExtractionPrompt(params: {\n  sessionContent: string;\n  projectSlug: string;\n  gitLog: string;\n}): string {\n  return `Extract structured entities and relations from this coding session.\n\nOutput a single JSON object with two arrays: \"entities\" and \"relations\".\n\nEntity types: project | person | concept | tool | file | version | decision | technology | organization\n\nRules:\n- Be SPECIFIC: entity names must be concrete (e.g., \"FSRS\", \"Glidr\", \"Matthias\")\n- Use snake_case relation verb phrases (e.g., \"uses_algorithm\", \"decided_to\", \"shipped_version\")\n- Skip opinions, speculation, and \"we should\" statements\n- Skip entities obvious from project metadata unless they have a meaningful relation\n- Maximum 15 relations per session — pick the most important\n- Each entity should have a brief description (1 sentence, what it is in this context)\n- Each relation must reference entity names that appear in the entities array\n\nExample output:\n{\n  \"entities\": [\n    {\"name\": \"Glidr\", \"type\": \"project\", \"description\": \"Flashcard app using FSRS spaced repetition\"},\n    {\"name\": \"FSRS\", \"type\": \"concept\", \"description\": \"Free Spaced Repetition Scheduler algorithm\"},\n    {\"name\": \"Matthias\", \"type\": \"person\", \"description\": \"Developer of Glidr and Quassl\"},\n    {\"name\": \"Quassl\", \"type\": \"project\", \"description\": \"iOS app being rewritten in Flutter\"},\n    {\"name\": \"Flutter\", \"type\": \"technology\", \"description\": \"Cross-platform mobile framework\"}\n  ],\n  \"relations\": [\n    {\"source\": \"Glidr\", \"relation\": \"uses_algorithm\", \"target\": \"FSRS\"},\n    {\"source\": \"Glidr\", \"relation\": \"shipped_version\", \"target\": \"1.0.5\"},\n    {\"source\": \"Matthias\", \"relation\": \"decided_to_rewrite\", \"target\": \"Quassl\"},\n    {\"source\": \"Quassl\", \"relation\": \"migrating_to\", \"target\": \"Flutter\"}\n  ]\n}\n\nPROJECT: ${params.projectSlug}\n\nSESSION CONTENT:\n${params.sessionContent}\n\nGIT COMMITS:\n${params.gitLog}\n\nJSON object (entities + relations):`;\n}\n","/**\n * kg-extraction.ts — Shared KG triple extraction logic.\n *\n * Extracted from session-summary-worker.ts so both the worker and the\n * CLI backfill (`pai kg backfill`) can use the same code path.\n *\n * Provides:\n *   - findClaudeBinary()       — locate the claude CLI\n *   - spawnClaude()            — generic prompt -> response runner (strips ANTHROPIC_API_KEY)\n *   - extractAndStoreTriples() — run the extractor prompt and persist triples to Postgres\n */\n\nimport { existsSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { homedir } from \"node:os\";\nimport type { Pool } from \"pg\";\nimport type { Database } from \"better-sqlite3\";\n\nimport { buildTripleExtractionPrompt } from \"../daemon/templates/triple-extraction-prompt.js\";\nimport { kgAdd, kgQuery, kgInvalidate } from \"./kg.js\";\nimport { upsertKgEntity } from \"./kg-entity.js\";\n\n// ---------------------------------------------------------------------------\n// Claude CLI binary discovery\n// ---------------------------------------------------------------------------\n\n/**\n * Find the `claude` CLI binary. Checks common installation locations first\n * (launchd PATH is minimal so bare \"claude\" often won't resolve).\n */\nexport function findClaudeBinary(): string | null {\n  const candidates = [\n    join(homedir(), \".local\", \"bin\", \"claude\"),\n    join(homedir(), \".claude\", \"local\", \"claude\"),\n    \"/usr/local/bin/claude\",\n    \"/opt/homebrew/bin/claude\",\n  ];\n\n  for (const candidate of candidates) {\n    try {\n      if (existsSync(candidate)) return candidate;\n    } catch { /* skip */ }\n  }\n  return \"claude\";\n}\n\nconst CLAUDE_TIMEOUT_MS: Record<string, number> = {\n  haiku: 60_000,\n  sonnet: 120_000,\n  opus: 300_000,\n};\n\n/**\n * Spawn the claude CLI with a prompt on stdin and return stdout.\n *\n * IMPORTANT: ANTHROPIC_API_KEY is stripped from the spawned environment so\n * the CLI uses the user's Max plan (free) instead of billing the API key.\n */\nexport async function spawnClaude(\n  prompt: string,\n  model: \"haiku\" | \"sonnet\" | \"opus\" = \"sonnet\"\n): Promise<string | null> {\n  const claudeBin = findClaudeBinary();\n  if (!claudeBin) {\n    process.stderr.write(\"[kg-extraction] claude CLI not found.\\n\");\n    return null;\n  }\n\n  const { spawn } = await import(\"node:child_process\");\n\n  return new Promise((resolve) => {\n    let timer: ReturnType<typeof setTimeout> | null = null;\n\n    const { ANTHROPIC_API_KEY: _drop, ...envWithoutApiKey } = process.env;\n    const child = spawn(\n      claudeBin,\n      [\"--model\", model, \"-p\", \"--no-session-persistence\"],\n      { env: envWithoutApiKey, stdio: [\"pipe\", \"pipe\", \"pipe\"] }\n    );\n\n    let stdout = \"\";\n    let stderr = \"\";\n\n    child.stdout.on(\"data\", (chunk: Buffer) => { stdout += chunk.toString(); });\n    child.stderr.on(\"data\", (chunk: Buffer) => { stderr += chunk.toString(); });\n\n    child.on(\"error\", (err: Error) => {\n      if (timer) { clearTimeout(timer); timer = null; }\n      process.stderr.write(`[kg-extraction] ${model} spawn error: ${err.message}\\n`);\n      resolve(null);\n    });\n\n    child.on(\"close\", (code: number | null) => {\n      if (timer) { clearTimeout(timer); timer = null; }\n      if (code !== 0) {\n        process.stderr.write(\n          `[kg-extraction] ${model} exited ${code}: ${stderr.slice(0, 300)}\\n`\n        );\n        resolve(null);\n      } else {\n        resolve(stdout.trim() || null);\n      }\n    });\n\n    timer = setTimeout(() => {\n      process.stderr.write(`[kg-extraction] ${model} timed out — killing process.\\n`);\n      child.kill(\"SIGTERM\");\n      resolve(null);\n    }, CLAUDE_TIMEOUT_MS[model] ?? 120_000);\n\n    child.stdin.write(prompt);\n    child.stdin.end();\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Triple extraction\n// ---------------------------------------------------------------------------\n\nexport interface ExtractTriplesParams {\n  summaryText: string;\n  projectSlug: string;\n  projectId: number | null;\n  sessionId: string;\n  gitLog?: string;\n  model?: \"haiku\" | \"sonnet\" | \"opus\";\n  /** Optional federation SQLite db — when provided, entities are upserted into kg_entities (QW1) */\n  federationDb?: Database;\n  /** Tenant ID for multi-tenant entity scoping (default: \"default\") */\n  tenantId?: string;\n}\n\nexport interface ExtractTriplesResult {\n  extracted: number;\n  added: number;\n  superseded: number;\n}\n\n/**\n * Extract structured KG triples from a session summary and store them in\n * Postgres. Idempotent: if a (subject, predicate) pair already has the same\n * object, no new row is added; if the object differs, the old triple is\n * invalidated (valid_to = NOW()) and a new one is inserted.\n *\n * Best-effort: per-triple errors are caught and logged but never thrown.\n * Returns a small stats object so callers can report progress.\n */\nexport async function extractAndStoreTriples(\n  pool: Pool,\n  params: ExtractTriplesParams\n): Promise<ExtractTriplesResult> {\n  const stats: ExtractTriplesResult = { extracted: 0, added: 0, superseded: 0 };\n\n  const prompt = buildTripleExtractionPrompt({\n    sessionContent: params.summaryText,\n    projectSlug: params.projectSlug,\n    gitLog: params.gitLog ?? \"\",\n  });\n\n  const jsonOutput = await spawnClaude(prompt, params.model ?? \"sonnet\");\n  if (!jsonOutput) return stats;\n\n  // Strip markdown code fences if Claude wrapped the JSON\n  const cleaned = jsonOutput\n    .replace(/^```json\\s*/m, \"\")\n    .replace(/^```\\s*/m, \"\")\n    .replace(/\\s*```$/m, \"\")\n    .trim();\n\n  // Support both legacy array format and new structured format\n  type LegacyTriple = { subject: string; predicate: string; object: string };\n  type NewRelation = { source: string; relation: string; target: string };\n  type NewEntity = { name: string; type: string; description: string };\n  type NewFormat = { entities: NewEntity[]; relations: NewRelation[] };\n\n  let triples: Array<LegacyTriple>;\n  try {\n    const parsed = JSON.parse(cleaned);\n\n    if (Array.isArray(parsed)) {\n      // Legacy format: [{subject, predicate, object}]\n      triples = parsed;\n    } else if (parsed && typeof parsed === \"object\" && Array.isArray(parsed.relations)) {\n      // New structured format: {entities: [...], relations: [...]}\n      const newFmt = parsed as NewFormat;\n\n      // QW1: Upsert entities into federation SQLite kg_entities table when db is available\n      if (params.federationDb && Array.isArray(newFmt.entities)) {\n        const tenantId = params.tenantId ?? \"default\";\n        for (const entity of newFmt.entities) {\n          if (!entity.name) continue;\n          try {\n            upsertKgEntity(params.federationDb, {\n              name: entity.name,\n              type: entity.type ?? \"unknown\",\n              description: entity.description,\n              tenantId,\n            });\n          } catch (entityErr) {\n            process.stderr.write(`[kg-extraction] entity upsert error (${entity.name}): ${entityErr}\\n`);\n          }\n        }\n      }\n\n      triples = newFmt.relations.map((r: NewRelation) => ({\n        subject: r.source,\n        predicate: r.relation,\n        object: r.target,\n      }));\n    } else {\n      process.stderr.write(`[kg-extraction] Unexpected JSON shape — neither array nor {entities,relations}\\n`);\n      return stats;\n    }\n  } catch (e) {\n    process.stderr.write(`[kg-extraction] JSON parse failed: ${e}\\n`);\n    return stats;\n  }\n\n  if (!Array.isArray(triples)) return stats;\n  stats.extracted = triples.length;\n\n  for (const t of triples) {\n    if (!t.subject || !t.predicate || !t.object) continue;\n\n    try {\n      const existing = await kgQuery(pool, {\n        subject: t.subject,\n        predicate: t.predicate,\n        project_id: params.projectId ?? undefined,\n      });\n\n      // If an identical (subject, predicate, object) is already valid, skip — idempotent\n      const alreadyValid = existing.find((e) => e.object === t.object && !e.valid_to);\n      if (alreadyValid) continue;\n\n      // Invalidate any superseded triple (same subject+predicate, different object)\n      const supersedes = existing.find((e) => e.object !== t.object && !e.valid_to);\n      if (supersedes) {\n        await kgInvalidate(pool, supersedes.id);\n        stats.superseded++;\n      }\n\n      await kgAdd(pool, {\n        subject: t.subject,\n        predicate: t.predicate,\n        object: t.object,\n        project_id: params.projectId ?? undefined,\n        source_session: params.sessionId,\n        confidence: \"EXTRACTED\",\n      });\n      stats.added++;\n    } catch (tripleErr) {\n      process.stderr.write(`[kg-extraction] store error (${t.subject}): ${tripleErr}\\n`);\n    }\n  }\n\n  return stats;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAiBA,SAAgB,cACd,IACA,MACA,UACA,YACgC;CAChC,MAAM,KAAK,KAAK;CAEhB,MAAM,SAAS,GACZ,QAAQ,8CAA8C,CACtD,IAAI,SAAS;AAEhB,KAAI,QAAQ;EACV,MAAM,eAAe,GAClB,QAAQ,gDAAgD,CACxD,IAAI,WAAW;AAElB,MAAI,CAAC,gBAAgB,aAAa,OAAO,OAAO,GAC9C,IAAG,QACD,mEACD,CAAC,IAAI,YAAY,IAAI,OAAO,GAAG;AAElC,SAAO;GAAE,IAAI,OAAO;GAAI,OAAO;GAAO;;CAGxC,MAAM,YAAY,GACf,QAAQ,gDAAgD,CACxD,IAAI,WAAW;AAElB,KAAI,WAAW;EACb,MAAM,YAAY,GACf,QAAQ,8CAA8C,CACtD,IAAI,SAAS;AAEhB,MAAI,CAAC,aAAa,UAAU,OAAO,UAAU,GAC3C,IAAG,QACD,iEACD,CAAC,IAAI,UAAU,IAAI,UAAU,GAAG;AAEnC,SAAO;GAAE,IAAI,UAAU;GAAI,OAAO;GAAO;;CAI3C,IAAI,YAAY;CAChB,IAAI,UAAU;AACd,QAAO,MAAM;AAIX,MAAI,CAHa,GACd,QAAQ,yCAAyC,CACjD,IAAI,UAAU,CACF;AACf;AACA,cAAY,GAAG,KAAK,GAAG;;CAKzB,MAAM,cAAc,SAAS,SAAS,IAAI;CAE1C,MAAM,SAAS,GACZ,QACC;;qDAGD,CACA,IAAI,WAAW,aAAa,UAAU,YAAY,IAAI,GAAG;AAE5D,KAAI,OAAO,YAAY,GAAG;EACxB,MAAM,WACH,GAAG,QAAQ,gDAAgD,CAAC,IAAI,WAAW,IAC3E,GAAG,QAAQ,8CAA8C,CAAC,IAAI,SAAS;AAE1E,MAAI,SACF,QAAO;GAAE,IAAI,SAAS;GAAI,OAAO;GAAO;AAG1C,QAAM,IAAI,MACR,0FACiB,SAAS,eAAe,aAC1C;;AAGH,QAAO;EAAE,IAAI,OAAO;EAA2B,OAAO;EAAM;;;AAI9D,SAAgB,cACd,IACA,WACA,QACA,MACA,MACA,OACA,UACS;AAKT,KAJiB,GACd,QAAQ,8DAA8D,CACtE,IAAI,WAAW,OAAO,CAEX,QAAO;CAErB,MAAM,KAAK,KAAK;AAChB,IAAG,QACD;;gDAGD,CAAC,IAAI,WAAW,QAAQ,MAAM,MAAM,OAAO,UAAU,GAAG;AAEzD,QAAO;;;;;;;;;;;;;;;AClGT,SAAS,iBAAsC;CAC7C,MAAM,sBAAM,IAAI,KAAqB;CACrC,MAAM,cAAc,KAAK,SAAS,EAAE,WAAW,eAAe;AAC9D,KAAI,CAAC,WAAW,YAAY,CAAE,QAAO;AAErC,KAAI;EACF,MAAM,MAAM,aAAa,aAAa,OAAO;EAC7C,MAAM,SAAS,KAAK,MAAM,IAAI;AAC9B,OAAK,MAAM,SAAS,OAAO,YAAY,EAAE,EAAE;GACzC,MAAM,MAAM,MAAM;AAClB,OAAI,CAAC,IAAK;AACV,OAAI;IACF,MAAM,OAAO,aAAa,IAAI;AAC9B,QAAI,CAAC,WAAW,KAAK,CAAE;IACvB,MAAM,UAAU,UAAU,KAAK;AAC/B,QAAI,IAAI,SAAS,KAAK;WAChB;;SAIJ;AAGR,QAAO;;AAOT,MAAM,sBAAsB,KAAK,SAAS,EAAE,WAAW,WAAW;AAClE,MAAM,iBAAiB,KAAK,SAAS,EAAE,OAAO;AAC9C,MAAM,kBAAkB,KAAK,gBAAgB,cAAc;AAM3D,SAAgB,iBAA4B;AAC1C,KAAI,CAAC,WAAW,gBAAgB,CAAE,QAAO,EAAE,WAAW,EAAE,EAAE;AAC1D,KAAI;AACF,SAAO,KAAK,MAAM,aAAa,iBAAiB,OAAO,CAAC;SAClD;AACN,SAAO,EAAE,WAAW,EAAE,EAAE;;;AAI5B,SAAgB,eAAe,QAAyB;AACtD,WAAU,gBAAgB,EAAE,WAAW,MAAM,CAAC;AAC9C,eAAc,iBAAiB,KAAK,UAAU,QAAQ,MAAM,EAAE,GAAG,MAAM,OAAO;;AAGhF,SAAgB,YAAY,GAAmB;AAC7C,KAAI,EAAE,WAAW,KAAK,CAAE,QAAO,KAAK,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC;AAC1D,QAAO,QAAQ,EAAE;;;;;;AAWnB,SAAgB,cAAc,KAAuB;CACnD,MAAM,UAAoB,EAAE;AAC5B,KAAI,CAAC,WAAW,IAAI,CAAE,QAAO;AAE7B,MAAK,MAAM,SAAS,YAAY,KAAK,EAAE,eAAe,MAAM,CAAC,CAC3D,KAAI,MAAM,QAAQ,IAAI,MAAM,KAAK,SAAS,MAAM,CAC9C,SAAQ,KAAK,MAAM,KAAK;UACf,MAAM,aAAa,IAAI,UAAU,KAAK,MAAM,KAAK,EAAE;EAC5D,MAAM,UAAU,KAAK,KAAK,MAAM,KAAK;AACrC,OAAK,MAAM,cAAc,YAAY,SAAS,EAAE,eAAe,MAAM,CAAC,CACpE,KAAI,WAAW,aAAa,IAAI,UAAU,KAAK,WAAW,KAAK,EAAE;GAC/D,MAAM,WAAW,KAAK,SAAS,WAAW,KAAK;AAC/C,QAAK,MAAM,aAAa,YAAY,UAAU,EAAE,eAAe,MAAM,CAAC,CACpE,KAAI,UAAU,QAAQ,IAAI,UAAU,KAAK,SAAS,MAAM,CACtD,SAAQ,KAAK,UAAU,KAAK;;;AAOxC,QAAO;;AAoBT,SAAgB,YAAY,IAA0B;CACpD,MAAM,SAAqB;EACzB,iBAAiB;EACjB,aAAa;EACb,iBAAiB;EACjB,iBAAiB;EACjB,aAAa;EACb,SAAS,EAAE;EACZ;AAED,KAAI,CAAC,WAAW,oBAAoB,CAClC,OAAM,IAAI,MAAM,wCAAwC,sBAAsB;CAGhF,MAAM,UAAU,YAAY,oBAAoB,CAAC,QAAQ,SAAS;AAEhE,SAAO,SADM,KAAK,qBAAqB,KAAK,CACvB,CAAC,aAAa;GACnC;CAEF,MAAM,YAAY,oBAAoB;CACtC,MAAM,SAAS,gBAAgB;AAE/B,MAAK,MAAM,cAAc,SAAS;EAChC,IAAI,WAAW,iBAAiB,YAAY,UAAU;AAKtD,MAAI,CAAC,WAAW,SAAS,IAAI,OAAO,IAAI,WAAW,EAAE;GACnD,MAAM,UAAU,OAAO,IAAI,WAAW;AACtC,OAAI,WAAW,QAAQ,CACrB,YAAW;;AAIf,MAAI,CAAC,WAAW,SAAS,EAAE;AACzB,UAAO,QAAQ,KAAK,GAAG,WAAW,aAAa,SAAS,4BAA4B;AACpF,UAAO;AACP;;EAGF,MAAM,OAAO,QAAQ,SAAS,SAAS,IAAI,WAAW;EACtD,MAAM,EAAE,IAAI,UAAU,cAAc,IAAI,MAAM,UAAU,WAAW;AAEnE,SAAO;AACP,MAAI,MAAO,QAAO;MACb,QAAO;AAEZ,MAAI;AACF,mBAAgB,UAAU,KAAK;UACzB;EAIR,MAAM,iBAAiB,KAAK,qBAAqB,YAAY,QAAQ;AAErE,MAAI,WAAW,eAAe,EAE5B;OAAI,mBADiB,KAAK,UAAU,QAAQ,CAE1C,IAAG,QACD,wEACD,CAAC,IAAI,gBAAgB,KAAK,KAAK,EAAE,GAAG;;AAIzC,MAAI,CAAC,WAAW,eAAe,CAAE;EAEjC,MAAM,YAAY,cAAc,eAAe;AAE/C,OAAK,MAAM,YAAY,WAAW;GAChC,MAAM,SAAS,qBAAqB,SAAS;AAC7C,OAAI,CAAC,OAAQ;AAEb,UAAO;AAEP,OADqB,cAAc,IAAI,IAAI,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO,OAAO,SAAS,CAChG,QAAO;;;CAK7B;EACE,MAAM,iBAAiB,GACpB,QAAQ,mEAAmE,CAC3E,KAAK;AAER,OAAK,MAAM,WAAW,gBAAgB;GACpC,MAAM,WAAW,KAAK,QAAQ,WAAW,QAAQ;AACjD,OAAI,CAAC,WAAW,SAAS,CAAE;GAE3B,IAAI;AACJ,OAAI;AACF,YAAQ,cAAc,SAAS;WACzB;AACN;;AAGF,QAAK,MAAM,YAAY,OAAO;IAC5B,MAAM,SAAS,qBAAqB,SAAS;AAC7C,QAAI,CAAC,OAAQ;AAEb,WAAO;AAEP,QADqB,cAAc,IAAI,QAAQ,IAAI,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO,OAAO,SAAS,CACxG,QAAO;;;;CAM/B,MAAM,SAAS,gBAAgB;AAC/B,KAAI,OAAO,UAAU,OACnB,MAAK,MAAM,UAAU,OAAO,WAAW;EACrC,MAAM,UAAU,YAAY,OAAO;AACnC,MAAI,CAAC,WAAW,QAAQ,EAAE;AACxB,UAAO,QAAQ,KAAK,GAAG,OAAO,kCAAkC;AAChE;;EAGF,MAAM,WAAW,YAAY,QAAQ,CAAC,QAAQ,SAAS;AACrD,OAAI,KAAK,WAAW,IAAI,CAAE,QAAO;GACjC,MAAM,OAAO,KAAK,SAAS,KAAK;AAChC,OAAI;AAAE,WAAO,SAAS,KAAK,CAAC,aAAa;WAAU;AAAE,WAAO;;IAC5D;AAEF,OAAK,MAAM,SAAS,UAAU;GAC5B,MAAM,YAAY,KAAK,SAAS,MAAM;GACtC,MAAM,YAAY,QAAQ,MAAM;GAChC,MAAM,eAAe,UAAU,UAAU;GAEzC,MAAM,WAAW,GACd,QAAQ,8CAA8C,CACtD,IAAI,UAAU;AAEjB,OAAI,UAAU;AACZ,WAAO;AACP,WAAO;AAEP,QAAI;AAAE,qBAAgB,WAAW,UAAU;YAAU;IAErD,MAAM,WAAW,KAAK,WAAW,QAAQ;AACzC,QAAI,WAAW,SAAS,EAAE;KACxB,MAAM,YAAY,YAAY,SAAS,CAAC,QAAQ,MAAM,EAAE,SAAS,MAAM,CAAC;AACxE,UAAK,MAAM,YAAY,WAAW;MAChC,MAAM,SAAS,qBAAqB,SAAS;AAC7C,UAAI,CAAC,OAAQ;AACb,aAAO;AACP,UAAI,cAAc,IAAI,SAAS,IAAI,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO,OAAO,SAAS,CACxG,QAAO;;;AAIb;;GAGF,MAAM,EAAE,IAAI,UAAU,cAAc,IAAI,WAAW,WAAW,aAAa;AAC3E,UAAO;AACP,OAAI,MAAO,QAAO;OACb,QAAO;AAEZ,OAAI;AAAE,oBAAgB,WAAW,UAAU;WAAU;GAErD,MAAM,WAAW,KAAK,WAAW,QAAQ;AACzC,OAAI,WAAW,SAAS,EAAE;IACxB,MAAM,YAAY,YAAY,SAAS,CAAC,QAAQ,MAAM,EAAE,SAAS,MAAM,CAAC;AACxE,SAAK,MAAM,YAAY,WAAW;KAChC,MAAM,SAAS,qBAAqB,SAAS;AAC7C,SAAI,CAAC,OAAQ;AACb,YAAO;AACP,SAAI,cAAc,IAAI,IAAI,OAAO,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,OAAO,OAAO,SAAS,CAC/F,QAAO;;;;;AASnB,KAAI,OAAO,UAAU,QAAQ;EAE3B,MAAM,UAAU,mBADS,OAAO,UAAU,IAAI,YAAY,CAAC,OAAO,WAAW,CACzB;AAEpD,OAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,gBAAgB,GACnB,QAAQ,0DAA0D,CAClE,IAAI,OAAO,KAAK;AAEnB,OAAI,CAAC,cAAe;AAEpB,OAAI,cAAc,cAAc,OAAO,aAAa;IAClD,MAAM,aAAa,UAAU,OAAO,YAAY;IAChD,MAAM,OAAO,KAAK,KAAK;IAEvB,MAAM,eAAe,GAClB,QAAQ,gDAAgD,CACxD,IAAI,WAAW;IAClB,MAAM,YAAY,GACf,QAAQ,8CAA8C,CACtD,IAAI,OAAO,YAAY;IAE1B,MAAM,cAAc,CAAC,gBAAgB,aAAa,OAAO,cAAc;IACvE,MAAM,WAAW,CAAC,aAAa,UAAU,OAAO,cAAc;AAE9D,QAAI,eAAe,SACjB,IAAG,QACD,kFACD,CAAC,IAAI,OAAO,aAAa,YAAY,MAAM,cAAc,GAAG;aACpD,SACT,IAAG,QACD,iEACD,CAAC,IAAI,OAAO,aAAa,MAAM,cAAc,GAAG;;;;CASzD;EACE,MAAM,QAAQ,GACX,QAAQ,mHAAmH,CAC3H,KAAK;AAER,OAAK,MAAM,OAAO,OAAO;GACvB,MAAM,OAAO,SAAS,IAAI,UAAU;AACpC,OAAI,QAAQ,SAAS,IAAI,KACvB,IAAG,QAAQ,oEAAoE,CAC5E,IAAI,MAAM,KAAK,KAAK,EAAE,IAAI,GAAG;;;AAKtC,QAAO;;;;;;;;;;AAeT,SAAgB,QAAQ,IAAc,OAA4B,EAAE,EAAQ;CAC1E,MAAM,SAAS,gBAAgB;AAC/B,KAAI,CAAC,KAAK,OAAO;AACf,UAAQ,IAAI,IAAI,mCAAmC,CAAC;AACpD,MAAI,OAAO,UAAU,OACnB,SAAQ,IAAI,IAAI,YAAY,OAAO,UAAU,OAAO,iBAAiB,OAAO,UAAU,KAAK,KAAK,GAAG,CAAC;AAEtG,UAAQ,IAAI,IAAI,+CAA+C,CAAC;;CAGlE,IAAI;AACJ,KAAI;AACF,WAAS,YAAY,GAAG;UACjB,GAAG;AACV,UAAQ,MAAM,IAAI,OAAO,EAAE,CAAC,CAAC;AAC7B,UAAQ,KAAK,EAAE;;AAGjB,KAAI,CAAC,KAAK,OAAO;AACf,UAAQ,IACN,GAAG,WAAW,KAAK,OAAO,OAAO,gBAAgB,CAAC,CAAC,aAAa,KAAK,OAAO,OAAO,gBAAgB,CAAC,CAAC,iBAAiB,CACvH;AACD,UAAQ,IAAI,IAAI,eAAe,OAAO,YAAY,QAAQ,OAAO,gBAAgB,UAAU,CAAC;AAC5F,UAAQ,IAAI,IAAI,eAAe,OAAO,YAAY,MAAM,CAAC;AAEzD,MAAI,OAAO,QAAQ,QAAQ;AACzB,WAAQ,KAAK;AACb,WAAQ,IAAI,KAAK,KAAK,OAAO,QAAQ,OAAO,+CAA+C,CAAC;AAC5F,QAAK,MAAM,KAAK,OAAO,QAAQ,MAAM,GAAG,GAAG,CACzC,SAAQ,IAAI,IAAI,OAAO,IAAI,CAAC;AAE9B,OAAI,OAAO,QAAQ,SAAS,GAC1B,SAAQ,IAAI,IAAI,eAAe,OAAO,QAAQ,SAAS,GAAG,OAAO,CAAC;;OAKtE,SAAQ,OAAO,MACb,mBAAmB,OAAO,gBAAgB,aAAa,OAAO,gBAAgB,aAC1E,OAAO,YAAY,GAAG,OAAO,YAAY,UAC9C;;;;;;;;;;;AC5ZL,SAAgB,4BAA4B,QAIjC;AACT,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;WAgCE,OAAO,YAAY;;;EAG5B,OAAO,eAAe;;;EAGtB,OAAO,OAAO;;;;;;;;;;;;;;;;;;;;;;ACpBhB,SAAgB,mBAAkC;CAChD,MAAM,aAAa;EACjB,KAAK,SAAS,EAAE,UAAU,OAAO,SAAS;EAC1C,KAAK,SAAS,EAAE,WAAW,SAAS,SAAS;EAC7C;EACA;EACD;AAED,MAAK,MAAM,aAAa,WACtB,KAAI;AACF,MAAI,WAAW,UAAU,CAAE,QAAO;SAC5B;AAEV,QAAO;;AAGT,MAAM,oBAA4C;CAChD,OAAO;CACP,QAAQ;CACR,MAAM;CACP;;;;;;;AAQD,eAAsB,YACpB,QACA,QAAqC,UACb;CACxB,MAAM,YAAY,kBAAkB;AACpC,KAAI,CAAC,WAAW;AACd,UAAQ,OAAO,MAAM,0CAA0C;AAC/D,SAAO;;CAGT,MAAM,EAAE,UAAU,MAAM,OAAO;AAE/B,QAAO,IAAI,SAAS,YAAY;EAC9B,IAAI,QAA8C;EAElD,MAAM,EAAE,mBAAmB,OAAO,GAAG,qBAAqB,QAAQ;EAClE,MAAM,QAAQ,MACZ,WACA;GAAC;GAAW;GAAO;GAAM;GAA2B,EACpD;GAAE,KAAK;GAAkB,OAAO;IAAC;IAAQ;IAAQ;IAAO;GAAE,CAC3D;EAED,IAAI,SAAS;EACb,IAAI,SAAS;AAEb,QAAM,OAAO,GAAG,SAAS,UAAkB;AAAE,aAAU,MAAM,UAAU;IAAI;AAC3E,QAAM,OAAO,GAAG,SAAS,UAAkB;AAAE,aAAU,MAAM,UAAU;IAAI;AAE3E,QAAM,GAAG,UAAU,QAAe;AAChC,OAAI,OAAO;AAAE,iBAAa,MAAM;AAAE,YAAQ;;AAC1C,WAAQ,OAAO,MAAM,mBAAmB,MAAM,gBAAgB,IAAI,QAAQ,IAAI;AAC9E,WAAQ,KAAK;IACb;AAEF,QAAM,GAAG,UAAU,SAAwB;AACzC,OAAI,OAAO;AAAE,iBAAa,MAAM;AAAE,YAAQ;;AAC1C,OAAI,SAAS,GAAG;AACd,YAAQ,OAAO,MACb,mBAAmB,MAAM,UAAU,KAAK,IAAI,OAAO,MAAM,GAAG,IAAI,CAAC,IAClE;AACD,YAAQ,KAAK;SAEb,SAAQ,OAAO,MAAM,IAAI,KAAK;IAEhC;AAEF,UAAQ,iBAAiB;AACvB,WAAQ,OAAO,MAAM,mBAAmB,MAAM,iCAAiC;AAC/E,SAAM,KAAK,UAAU;AACrB,WAAQ,KAAK;KACZ,kBAAkB,UAAU,KAAQ;AAEvC,QAAM,MAAM,MAAM,OAAO;AACzB,QAAM,MAAM,KAAK;GACjB;;;;;;;;;;;AAmCJ,eAAsB,uBACpB,MACA,QAC+B;CAC/B,MAAM,QAA8B;EAAE,WAAW;EAAG,OAAO;EAAG,YAAY;EAAG;CAQ7E,MAAM,aAAa,MAAM,YANV,4BAA4B;EACzC,gBAAgB,OAAO;EACvB,aAAa,OAAO;EACpB,QAAQ,OAAO,UAAU;EAC1B,CAAC,EAE2C,OAAO,SAAS,SAAS;AACtE,KAAI,CAAC,WAAY,QAAO;CAGxB,MAAM,UAAU,WACb,QAAQ,gBAAgB,GAAG,CAC3B,QAAQ,YAAY,GAAG,CACvB,QAAQ,YAAY,GAAG,CACvB,MAAM;CAQT,IAAI;AACJ,KAAI;EACF,MAAM,SAAS,KAAK,MAAM,QAAQ;AAElC,MAAI,MAAM,QAAQ,OAAO,CAEvB,WAAU;WACD,UAAU,OAAO,WAAW,YAAY,MAAM,QAAQ,OAAO,UAAU,EAAE;GAElF,MAAM,SAAS;AAGf,OAAI,OAAO,gBAAgB,MAAM,QAAQ,OAAO,SAAS,EAAE;IACzD,MAAM,WAAW,OAAO,YAAY;AACpC,SAAK,MAAM,UAAU,OAAO,UAAU;AACpC,SAAI,CAAC,OAAO,KAAM;AAClB,SAAI;AACF,qBAAe,OAAO,cAAc;OAClC,MAAM,OAAO;OACb,MAAM,OAAO,QAAQ;OACrB,aAAa,OAAO;OACpB;OACD,CAAC;cACK,WAAW;AAClB,cAAQ,OAAO,MAAM,wCAAwC,OAAO,KAAK,KAAK,UAAU,IAAI;;;;AAKlG,aAAU,OAAO,UAAU,KAAK,OAAoB;IAClD,SAAS,EAAE;IACX,WAAW,EAAE;IACb,QAAQ,EAAE;IACX,EAAE;SACE;AACL,WAAQ,OAAO,MAAM,mFAAmF;AACxG,UAAO;;UAEF,GAAG;AACV,UAAQ,OAAO,MAAM,sCAAsC,EAAE,IAAI;AACjE,SAAO;;AAGT,KAAI,CAAC,MAAM,QAAQ,QAAQ,CAAE,QAAO;AACpC,OAAM,YAAY,QAAQ;AAE1B,MAAK,MAAM,KAAK,SAAS;AACvB,MAAI,CAAC,EAAE,WAAW,CAAC,EAAE,aAAa,CAAC,EAAE,OAAQ;AAE7C,MAAI;GACF,MAAM,WAAW,MAAM,QAAQ,MAAM;IACnC,SAAS,EAAE;IACX,WAAW,EAAE;IACb,YAAY,OAAO,aAAa;IACjC,CAAC;AAIF,OADqB,SAAS,MAAM,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,SAAS,CAC7D;GAGlB,MAAM,aAAa,SAAS,MAAM,MAAM,EAAE,WAAW,EAAE,UAAU,CAAC,EAAE,SAAS;AAC7E,OAAI,YAAY;AACd,UAAM,aAAa,MAAM,WAAW,GAAG;AACvC,UAAM;;AAGR,SAAM,MAAM,MAAM;IAChB,SAAS,EAAE;IACX,WAAW,EAAE;IACb,QAAQ,EAAE;IACV,YAAY,OAAO,aAAa;IAChC,gBAAgB,OAAO;IACvB,YAAY;IACb,CAAC;AACF,SAAM;WACC,WAAW;AAClB,WAAQ,OAAO,MAAM,gCAAgC,EAAE,QAAQ,KAAK,UAAU,IAAI;;;AAItF,QAAO"}

package/dist/{latent-ideas-dWVuI_dg.mjs → latent-ideas-RyC6eyqI.mjs}

@@ -1,6 +1,6 @@
-import "./embeddings-DGRAPAYb.mjs";
-import { n as TITLE_STOP_WORDS } from "./stop-words-BaMEGVeY.mjs";
-import { t as zettelThemes } from "./themes-DO8mUVwD.mjs";
+import "./embeddings-BJPOcbik.mjs";
+import { n as TITLE_STOP_WORDS } from "./stop-words-BwplsQ3z.mjs";
+import { t as zettelThemes } from "./themes-Cg8oG9Ra.mjs";
 import { mkdirSync, writeFileSync } from "node:fs";
 import { dirname, join } from "node:path";
 
@@ -188,4 +188,4 @@ function handleIdeaMaterialize(params, vaultPath) {
 
 //#endregion
 export { handleGraphLatentIdeas, handleIdeaMaterialize };
-//# sourceMappingURL=latent-ideas-dWVuI_dg.mjs.map
+//# sourceMappingURL=latent-ideas-RyC6eyqI.mjs.map

package/dist/{latent-ideas-dWVuI_dg.mjs.map → latent-ideas-RyC6eyqI.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"latent-ideas-dWVuI_dg.mjs","names":[],"sources":["../src/graph/latent-ideas.ts"],"sourcesContent":["/**\n * latent-ideas.ts — graph_latent_ideas and idea_materialize endpoint handlers\n *\n * \"Latent ideas\" are recurring themes in the vault that exist as embedding\n * clusters but have NO dedicated note written about them yet.  PAI surfaces\n * these by running the same agglomerative clustering used by graph_clusters /\n * zettelThemes and then filtering OUT any cluster whose label is well-matched\n * by an existing note title.\n *\n * The materialize endpoint writes a new Markdown note to the vault filesystem\n * and returns its content so the plugin can open it immediately.\n */\n\nimport { mkdirSync, writeFileSync } from \"node:fs\";\nimport { dirname, join } from \"node:path\";\nimport { TITLE_STOP_WORDS } from \"../utils/stop-words.js\";\nimport type { StorageBackend } from \"../storage/interface.js\";\nimport { zettelThemes } from \"../zettelkasten/themes.js\";\n\n// ---------------------------------------------------------------------------\n// Public param / result types\n// ---------------------------------------------------------------------------\n\nexport interface GraphLatentIdeasParams {\n  project_id: number;\n  /** Minimum notes in a cluster (default: 3) */\n  min_cluster_size?: number;\n  /** Cap on returned ideas (default: 15) */\n  max_ideas?: number;\n  /** How far back to look in days (default: 180) */\n  lookback_days?: number;\n  /** Cosine similarity clustering threshold (default: 0.65) */\n  similarity_threshold?: number;\n}\n\nexport interface LatentIdeaSourceNote {\n  vault_path: string;\n  title: string;\n  /** How strongly this note relates to the theme (0-1) */\n  relevance: number;\n}\n\nexport interface LatentIdea {\n  id: number;\n  /** Auto-generated cluster label from zettelThemes */\n  label: string;\n  /** Number of notes touching this theme */\n  size: number;\n  /** 0-1, how likely this is a real coherent idea */\n  confidence: number;\n  /** Notes that contribute to this theme */\n  source_notes: LatentIdeaSourceNote[];\n  /** Cleaned-up version of label for a potential note title */\n  suggested_title: string;\n  /** Most common folder among source notes */\n  suggested_folder: string;\n  /** Number of distinct session date-folders (e.g. \"2026/03\") touching this theme */\n  sessions_count: number;\n}\n\nexport interface GraphLatentIdeasResult {\n  ideas: LatentIdea[];\n  total_clusters_analyzed: number;\n  /** How many clusters already have a matching note (excluded from results) */\n  materialized_count: number;\n}\n\n// ---------------------------------------------------------------------------\n// Materialize params / result\n// ---------------------------------------------------------------------------\n\nexport interface IdeaMaterializeParams {\n  idea_label: string;\n  /** User-chosen title for the new note */\n  title: string;\n  /** Vault-relative folder path where the note should be created */\n  folder: string;\n  /** Vault-relative paths of the source notes to link from the new note */\n  source_paths: string[];\n  project_id: number;\n}\n\nexport interface IdeaMaterializeResult {\n  /** Vault-relative path of the created note */\n  vault_path: string;\n  /** Generated markdown content */\n  content: string;\n  /** Number of wikilinks inserted */\n  links_created: number;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: check if a cluster already has a matching note\n// ---------------------------------------------------------------------------\n\n/**\n * Returns true when any existing vault note title closely matches the cluster\n * label — meaning a dedicated note already exists for this topic.\n *\n * Matching strategy (simple, fast, no embeddings needed):\n *   1. Lowercase both sides and split into words.\n *   2. Remove stop words from the label words.\n *   3. If ≥ 60% of the significant label words appear in a note title → match.\n */\n// TITLE_STOP_WORDS imported from utils/stop-words.ts\n\nfunction labelMatchesTitle(label: string, title: string): boolean {\n  const labelWords = label\n    .toLowerCase()\n    .split(/[\\s\\-_/]+/)\n    .filter((w) => w.length > 2 && !TITLE_STOP_WORDS.has(w));\n\n  if (labelWords.length === 0) return false;\n\n  const titleLower = title.toLowerCase();\n  const matchCount = labelWords.filter((w) => titleLower.includes(w)).length;\n  return matchCount / labelWords.length >= 0.6;\n}\n\n/**\n * Check whether any note indexed in the vault has a title matching the label.\n * Fetches all vault file rows via StorageBackend for efficiency.\n */\nasync function clusterHasMatchingNote(\n  backend: StorageBackend,\n  label: string,\n  notePaths: string[]\n): Promise<boolean> {\n  // First check the notes already in the cluster themselves — if any cluster\n  // member's title matches the label it IS the index note → materialized.\n  const pathSet = new Set(notePaths);\n\n  // Fetch all vault files (bounded — vault rarely > 50k notes)\n  const rows = await backend.getAllVaultFiles();\n\n  for (const row of rows) {\n    if (!row.title) continue;\n    // Skip notes already counted inside the cluster — they don't count as\n    // \"dedicated notes\"; we only skip a cluster if a SEPARATE note exists.\n    if (pathSet.has(row.vaultPath)) continue;\n    if (labelMatchesTitle(label, row.title)) return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: generate a clean suggested title\n// ---------------------------------------------------------------------------\n\nfunction toSuggestedTitle(label: string): string {\n  // Remove leading/trailing whitespace, capitalize each word, remove stop words\n  // that are all-lowercase at the start of the title.\n  const words = label\n    .trim()\n    .split(/\\s+/)\n    .map((w, i) => {\n      const lower = w.toLowerCase();\n      // Drop leading stop words (but keep if they're the only word)\n      if (i === 0 && TITLE_STOP_WORDS.has(lower) && label.trim().split(/\\s+/).length > 1) {\n        return \"\";\n      }\n      return w.charAt(0).toUpperCase() + w.slice(1);\n    })\n    .filter(Boolean);\n\n  return words.join(\" \") || label;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: find most common folder\n// ---------------------------------------------------------------------------\n\nfunction mostCommonFolder(vaultPaths: string[]): string {\n  const counts = new Map<string, number>();\n  for (const p of vaultPaths) {\n    const parts = p.split(\"/\");\n    const folder = parts.length > 1 ? parts.slice(0, -1).join(\"/\") : \"\";\n    counts.set(folder, (counts.get(folder) ?? 0) + 1);\n  }\n\n  let best = \"\";\n  let bestCount = 0;\n  for (const [folder, count] of counts) {\n    if (count > bestCount) {\n      bestCount = count;\n      best = folder;\n    }\n  }\n  return best;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: count distinct session date-folders\n// ---------------------------------------------------------------------------\n\n/**\n * Heuristic: vault notes are often stored in date-based folders like\n * \"2026/03/15\" or \"Daily/2026-03\".  We extract the first numeric path\n * segment that looks like a year (2020-2030) and group by year+month.\n *\n * Falls back to counting distinct top-level folders.\n */\nfunction countDistinctSessions(vaultPaths: string[]): number {\n  const sessions = new Set<string>();\n  const yearMonthRe = /\\b(202\\d)\\D?(0[1-9]|1[0-2])\\b/;\n\n  for (const p of vaultPaths) {\n    const m = yearMonthRe.exec(p);\n    if (m) {\n      sessions.add(`${m[1]}-${m[2]}`);\n    } else {\n      // Fallback: use top-level folder as a proxy for \"session bucket\"\n      const topFolder = p.split(\"/\")[0];\n      sessions.add(topFolder);\n    }\n  }\n  return sessions.size;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: calculate confidence score\n// ---------------------------------------------------------------------------\n\n/**\n * Confidence combines:\n *  - Cluster size (normalized, capped at 20 for max contribution)\n *  - Folder diversity (0-1 already)\n *  - Sessions count (normalized, capped at 5)\n *\n * Formula: 0.4 * sizeScore + 0.35 * folderDiversity + 0.25 * sessionScore\n */\nfunction calcConfidence(\n  size: number,\n  folderDiversity: number,\n  sessionsCount: number\n): number {\n  const sizeScore = Math.min(size / 20, 1.0);\n  const sessionScore = Math.min(sessionsCount / 5, 1.0);\n  const raw = 0.4 * sizeScore + 0.35 * folderDiversity + 0.25 * sessionScore;\n  return Math.round(raw * 100) / 100;\n}\n\n// ---------------------------------------------------------------------------\n// Main handler: graph_latent_ideas\n// ---------------------------------------------------------------------------\n\nexport async function handleGraphLatentIdeas(\n  backend: StorageBackend,\n  params: GraphLatentIdeasParams\n): Promise<GraphLatentIdeasResult> {\n  const minClusterSize = params.min_cluster_size ?? 3;\n  const maxIdeas = params.max_ideas ?? 15;\n  const lookbackDays = params.lookback_days ?? 180;\n  const similarityThreshold = params.similarity_threshold ?? 0.65;\n\n  const { project_id: vaultProjectId } = params;\n  if (!vaultProjectId) {\n    throw new Error(\n      \"graph_latent_ideas: project_id is required (pass the vault project's numeric ID)\"\n    );\n  }\n\n  // Run the same clustering algorithm used by graph_clusters\n  const themeResult = await zettelThemes(backend, {\n    vaultProjectId,\n    lookbackDays,\n    minClusterSize,\n    maxThemes: maxIdeas * 3, // Over-fetch — many will be filtered as materialized\n    similarityThreshold,\n  });\n\n  const ideas: LatentIdea[] = [];\n  let materializedCount = 0;\n\n  for (const theme of themeResult.themes) {\n    const notePaths = theme.notes.map((n) => n.path);\n\n    // Check if a dedicated note already exists for this theme\n    if (await clusterHasMatchingNote(backend, theme.label, notePaths)) {\n      materializedCount++;\n      continue;\n    }\n\n    // This is a latent idea — no dedicated note exists yet\n    const suggestedFolder = mostCommonFolder(notePaths);\n    const sessionsCount = countDistinctSessions(notePaths);\n    const confidence = calcConfidence(theme.size, theme.folderDiversity, sessionsCount);\n\n    // Build source notes with relevance scores\n    // Relevance is approximated by position in cluster (centroid-closest first)\n    // zettelThemes returns notes in no guaranteed order; assign uniform relevance\n    // decreasing from 1.0 to 0.5 across the list.\n    const sourceNotes: LatentIdeaSourceNote[] = theme.notes.map((n, idx) => ({\n      vault_path: n.path,\n      title: n.title ?? n.path.split(\"/\").pop()?.replace(/\\.md$/i, \"\") ?? n.path,\n      relevance: Math.round((1.0 - (idx / Math.max(theme.notes.length - 1, 1)) * 0.5) * 100) / 100,\n    }));\n\n    ideas.push({\n      id: theme.id,\n      label: theme.label,\n      size: theme.size,\n      confidence,\n      source_notes: sourceNotes,\n      suggested_title: toSuggestedTitle(theme.label),\n      suggested_folder: suggestedFolder,\n      sessions_count: sessionsCount,\n    });\n\n    if (ideas.length >= maxIdeas) break;\n  }\n\n  // Sort by confidence descending\n  ideas.sort((a, b) => b.confidence - a.confidence);\n\n  return {\n    ideas,\n    total_clusters_analyzed: themeResult.themes.length + materializedCount,\n    materialized_count: materializedCount,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Materialize handler: idea_materialize\n// ---------------------------------------------------------------------------\n\nexport function handleIdeaMaterialize(\n  params: IdeaMaterializeParams,\n  vaultPath: string\n): IdeaMaterializeResult {\n  const { idea_label, title, folder, source_paths } = params;\n\n  // Sanitize filename: replace characters illegal in filenames\n  const safeTitle = title.replace(/[/\\\\:*?\"<>|]/g, \"-\");\n  const fileName = `${safeTitle}.md`;\n\n  // Vault-relative path (forward slashes, no leading slash)\n  const relFolder = folder.replace(/^\\/+|\\/+$/g, \"\");\n  const vault_path = relFolder ? `${relFolder}/${fileName}` : fileName;\n\n  // Absolute filesystem path\n  const absPath = join(vaultPath, vault_path);\n  const absDir = dirname(absPath);\n\n  // Build wikilinks from source_paths\n  const wikilinks = source_paths\n    .map((p) => {\n      // Derive a display name: filename without extension\n      const name = p.split(\"/\").pop()?.replace(/\\.md$/i, \"\") ?? p;\n      // Relative wikilink — use just the filename (Obsidian resolves by title)\n      return `- [[${name}]]`;\n    })\n    .join(\"\\n\");\n\n  const links_created = source_paths.length;\n\n  const content = [\n    `# ${title}`,\n    \"\",\n    `*Materialized from latent idea: \"${idea_label}\"*`,\n    `*Sources: ${links_created} notes*`,\n    \"\",\n    \"## Related Notes\",\n    \"\",\n    wikilinks || \"*(no source notes)*\",\n    \"\",\n    \"## Notes\",\n    \"\",\n    \"<!-- Add your thoughts about this idea here -->\",\n    \"\",\n  ].join(\"\\n\");\n\n  // Write the file (create parent directories as needed)\n  mkdirSync(absDir, { recursive: true });\n  writeFileSync(absPath, content, \"utf-8\");\n\n  return {\n    vault_path,\n    content,\n    links_created,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0GA,SAAS,kBAAkB,OAAe,OAAwB;CAChE,MAAM,aAAa,MAChB,aAAa,CACb,MAAM,YAAY,CAClB,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC;AAE1D,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,MAAM,aAAa,MAAM,aAAa;AAEtC,QADmB,WAAW,QAAQ,MAAM,WAAW,SAAS,EAAE,CAAC,CAAC,SAChD,WAAW,UAAU;;;;;;AAO3C,eAAe,uBACb,SACA,OACA,WACkB;CAGlB,MAAM,UAAU,IAAI,IAAI,UAAU;CAGlC,MAAM,OAAO,MAAM,QAAQ,kBAAkB;AAE7C,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,CAAC,IAAI,MAAO;AAGhB,MAAI,QAAQ,IAAI,IAAI,UAAU,CAAE;AAChC,MAAI,kBAAkB,OAAO,IAAI,MAAM,CAAE,QAAO;;AAElD,QAAO;;AAOT,SAAS,iBAAiB,OAAuB;AAgB/C,QAbc,MACX,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,GAAG,MAAM;EACb,MAAM,QAAQ,EAAE,aAAa;AAE7B,MAAI,MAAM,KAAK,iBAAiB,IAAI,MAAM,IAAI,MAAM,MAAM,CAAC,MAAM,MAAM,CAAC,SAAS,EAC/E,QAAO;AAET,SAAO,EAAE,OAAO,EAAE,CAAC,aAAa,GAAG,EAAE,MAAM,EAAE;GAC7C,CACD,OAAO,QAAQ,CAEL,KAAK,IAAI,IAAI;;AAO5B,SAAS,iBAAiB,YAA8B;CACtD,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAK,MAAM,KAAK,YAAY;EAC1B,MAAM,QAAQ,EAAE,MAAM,IAAI;EAC1B,MAAM,SAAS,MAAM,SAAS,IAAI,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG;AACjE,SAAO,IAAI,SAAS,OAAO,IAAI,OAAO,IAAI,KAAK,EAAE;;CAGnD,IAAI,OAAO;CACX,IAAI,YAAY;AAChB,MAAK,MAAM,CAAC,QAAQ,UAAU,OAC5B,KAAI,QAAQ,WAAW;AACrB,cAAY;AACZ,SAAO;;AAGX,QAAO;;;;;;;;;AAcT,SAAS,sBAAsB,YAA8B;CAC3D,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,cAAc;AAEpB,MAAK,MAAM,KAAK,YAAY;EAC1B,MAAM,IAAI,YAAY,KAAK,EAAE;AAC7B,MAAI,EACF,UAAS,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK;OAC1B;GAEL,MAAM,YAAY,EAAE,MAAM,IAAI,CAAC;AAC/B,YAAS,IAAI,UAAU;;;AAG3B,QAAO,SAAS;;;;;;;;;;AAelB,SAAS,eACP,MACA,iBACA,eACQ;CACR,MAAM,YAAY,KAAK,IAAI,OAAO,IAAI,EAAI;CAC1C,MAAM,eAAe,KAAK,IAAI,gBAAgB,GAAG,EAAI;CACrD,MAAM,MAAM,KAAM,YAAY,MAAO,kBAAkB,MAAO;AAC9D,QAAO,KAAK,MAAM,MAAM,IAAI,GAAG;;AAOjC,eAAsB,uBACpB,SACA,QACiC;CACjC,MAAM,iBAAiB,OAAO,oBAAoB;CAClD,MAAM,WAAW,OAAO,aAAa;CACrC,MAAM,eAAe,OAAO,iBAAiB;CAC7C,MAAM,sBAAsB,OAAO,wBAAwB;CAE3D,MAAM,EAAE,YAAY,mBAAmB;AACvC,KAAI,CAAC,eACH,OAAM,IAAI,MACR,mFACD;CAIH,MAAM,cAAc,MAAM,aAAa,SAAS;EAC9C;EACA;EACA;EACA,WAAW,WAAW;EACtB;EACD,CAAC;CAEF,MAAM,QAAsB,EAAE;CAC9B,IAAI,oBAAoB;AAExB,MAAK,MAAM,SAAS,YAAY,QAAQ;EACtC,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,KAAK;AAGhD,MAAI,MAAM,uBAAuB,SAAS,MAAM,OAAO,UAAU,EAAE;AACjE;AACA;;EAIF,MAAM,kBAAkB,iBAAiB,UAAU;EACnD,MAAM,gBAAgB,sBAAsB,UAAU;EACtD,MAAM,aAAa,eAAe,MAAM,MAAM,MAAM,iBAAiB,cAAc;EAMnF,MAAM,cAAsC,MAAM,MAAM,KAAK,GAAG,SAAS;GACvE,YAAY,EAAE;GACd,OAAO,EAAE,SAAS,EAAE,KAAK,MAAM,IAAI,CAAC,KAAK,EAAE,QAAQ,UAAU,GAAG,IAAI,EAAE;GACtE,WAAW,KAAK,OAAO,IAAO,MAAM,KAAK,IAAI,MAAM,MAAM,SAAS,GAAG,EAAE,GAAI,MAAO,IAAI,GAAG;GAC1F,EAAE;AAEH,QAAM,KAAK;GACT,IAAI,MAAM;GACV,OAAO,MAAM;GACb,MAAM,MAAM;GACZ;GACA,cAAc;GACd,iBAAiB,iBAAiB,MAAM,MAAM;GAC9C,kBAAkB;GAClB,gBAAgB;GACjB,CAAC;AAEF,MAAI,MAAM,UAAU,SAAU;;AAIhC,OAAM,MAAM,GAAG,MAAM,EAAE,aAAa,EAAE,WAAW;AAEjD,QAAO;EACL;EACA,yBAAyB,YAAY,OAAO,SAAS;EACrD,oBAAoB;EACrB;;AAOH,SAAgB,sBACd,QACA,WACuB;CACvB,MAAM,EAAE,YAAY,OAAO,QAAQ,iBAAiB;CAIpD,MAAM,WAAW,GADC,MAAM,QAAQ,iBAAiB,IAAI,CACvB;CAG9B,MAAM,YAAY,OAAO,QAAQ,cAAc,GAAG;CAClD,MAAM,aAAa,YAAY,GAAG,UAAU,GAAG,aAAa;CAG5D,MAAM,UAAU,KAAK,WAAW,WAAW;CAC3C,MAAM,SAAS,QAAQ,QAAQ;CAG/B,MAAM,YAAY,aACf,KAAK,MAAM;AAIV,SAAO,OAFM,EAAE,MAAM,IAAI,CAAC,KAAK,EAAE,QAAQ,UAAU,GAAG,IAAI,EAEvC;GACnB,CACD,KAAK,KAAK;CAEb,MAAM,gBAAgB,aAAa;CAEnC,MAAM,UAAU;EACd,KAAK;EACL;EACA,oCAAoC,WAAW;EAC/C,aAAa,cAAc;EAC3B;EACA;EACA;EACA,aAAa;EACb;EACA;EACA;EACA;EACA;EACD,CAAC,KAAK,KAAK;AAGZ,WAAU,QAAQ,EAAE,WAAW,MAAM,CAAC;AACtC,eAAc,SAAS,SAAS,QAAQ;AAExC,QAAO;EACL;EACA;EACA;EACD"}
+{"version":3,"file":"latent-ideas-RyC6eyqI.mjs","names":[],"sources":["../src/graph/latent-ideas.ts"],"sourcesContent":["/**\n * latent-ideas.ts — graph_latent_ideas and idea_materialize endpoint handlers\n *\n * \"Latent ideas\" are recurring themes in the vault that exist as embedding\n * clusters but have NO dedicated note written about them yet.  PAI surfaces\n * these by running the same agglomerative clustering used by graph_clusters /\n * zettelThemes and then filtering OUT any cluster whose label is well-matched\n * by an existing note title.\n *\n * The materialize endpoint writes a new Markdown note to the vault filesystem\n * and returns its content so the plugin can open it immediately.\n */\n\nimport { mkdirSync, writeFileSync } from \"node:fs\";\nimport { dirname, join } from \"node:path\";\nimport { TITLE_STOP_WORDS } from \"../utils/stop-words.js\";\nimport type { StorageBackend } from \"../storage/interface.js\";\nimport { zettelThemes } from \"../zettelkasten/themes.js\";\n\n// ---------------------------------------------------------------------------\n// Public param / result types\n// ---------------------------------------------------------------------------\n\nexport interface GraphLatentIdeasParams {\n  project_id: number;\n  /** Minimum notes in a cluster (default: 3) */\n  min_cluster_size?: number;\n  /** Cap on returned ideas (default: 15) */\n  max_ideas?: number;\n  /** How far back to look in days (default: 180) */\n  lookback_days?: number;\n  /** Cosine similarity clustering threshold (default: 0.65) */\n  similarity_threshold?: number;\n}\n\nexport interface LatentIdeaSourceNote {\n  vault_path: string;\n  title: string;\n  /** How strongly this note relates to the theme (0-1) */\n  relevance: number;\n}\n\nexport interface LatentIdea {\n  id: number;\n  /** Auto-generated cluster label from zettelThemes */\n  label: string;\n  /** Number of notes touching this theme */\n  size: number;\n  /** 0-1, how likely this is a real coherent idea */\n  confidence: number;\n  /** Notes that contribute to this theme */\n  source_notes: LatentIdeaSourceNote[];\n  /** Cleaned-up version of label for a potential note title */\n  suggested_title: string;\n  /** Most common folder among source notes */\n  suggested_folder: string;\n  /** Number of distinct session date-folders (e.g. \"2026/03\") touching this theme */\n  sessions_count: number;\n}\n\nexport interface GraphLatentIdeasResult {\n  ideas: LatentIdea[];\n  total_clusters_analyzed: number;\n  /** How many clusters already have a matching note (excluded from results) */\n  materialized_count: number;\n}\n\n// ---------------------------------------------------------------------------\n// Materialize params / result\n// ---------------------------------------------------------------------------\n\nexport interface IdeaMaterializeParams {\n  idea_label: string;\n  /** User-chosen title for the new note */\n  title: string;\n  /** Vault-relative folder path where the note should be created */\n  folder: string;\n  /** Vault-relative paths of the source notes to link from the new note */\n  source_paths: string[];\n  project_id: number;\n}\n\nexport interface IdeaMaterializeResult {\n  /** Vault-relative path of the created note */\n  vault_path: string;\n  /** Generated markdown content */\n  content: string;\n  /** Number of wikilinks inserted */\n  links_created: number;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: check if a cluster already has a matching note\n// ---------------------------------------------------------------------------\n\n/**\n * Returns true when any existing vault note title closely matches the cluster\n * label — meaning a dedicated note already exists for this topic.\n *\n * Matching strategy (simple, fast, no embeddings needed):\n *   1. Lowercase both sides and split into words.\n *   2. Remove stop words from the label words.\n *   3. If ≥ 60% of the significant label words appear in a note title → match.\n */\n// TITLE_STOP_WORDS imported from utils/stop-words.ts\n\nfunction labelMatchesTitle(label: string, title: string): boolean {\n  const labelWords = label\n    .toLowerCase()\n    .split(/[\\s\\-_/]+/)\n    .filter((w) => w.length > 2 && !TITLE_STOP_WORDS.has(w));\n\n  if (labelWords.length === 0) return false;\n\n  const titleLower = title.toLowerCase();\n  const matchCount = labelWords.filter((w) => titleLower.includes(w)).length;\n  return matchCount / labelWords.length >= 0.6;\n}\n\n/**\n * Check whether any note indexed in the vault has a title matching the label.\n * Fetches all vault file rows via StorageBackend for efficiency.\n */\nasync function clusterHasMatchingNote(\n  backend: StorageBackend,\n  label: string,\n  notePaths: string[]\n): Promise<boolean> {\n  // First check the notes already in the cluster themselves — if any cluster\n  // member's title matches the label it IS the index note → materialized.\n  const pathSet = new Set(notePaths);\n\n  // Fetch all vault files (bounded — vault rarely > 50k notes)\n  const rows = await backend.getAllVaultFiles();\n\n  for (const row of rows) {\n    if (!row.title) continue;\n    // Skip notes already counted inside the cluster — they don't count as\n    // \"dedicated notes\"; we only skip a cluster if a SEPARATE note exists.\n    if (pathSet.has(row.vaultPath)) continue;\n    if (labelMatchesTitle(label, row.title)) return true;\n  }\n  return false;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: generate a clean suggested title\n// ---------------------------------------------------------------------------\n\nfunction toSuggestedTitle(label: string): string {\n  // Remove leading/trailing whitespace, capitalize each word, remove stop words\n  // that are all-lowercase at the start of the title.\n  const words = label\n    .trim()\n    .split(/\\s+/)\n    .map((w, i) => {\n      const lower = w.toLowerCase();\n      // Drop leading stop words (but keep if they're the only word)\n      if (i === 0 && TITLE_STOP_WORDS.has(lower) && label.trim().split(/\\s+/).length > 1) {\n        return \"\";\n      }\n      return w.charAt(0).toUpperCase() + w.slice(1);\n    })\n    .filter(Boolean);\n\n  return words.join(\" \") || label;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: find most common folder\n// ---------------------------------------------------------------------------\n\nfunction mostCommonFolder(vaultPaths: string[]): string {\n  const counts = new Map<string, number>();\n  for (const p of vaultPaths) {\n    const parts = p.split(\"/\");\n    const folder = parts.length > 1 ? parts.slice(0, -1).join(\"/\") : \"\";\n    counts.set(folder, (counts.get(folder) ?? 0) + 1);\n  }\n\n  let best = \"\";\n  let bestCount = 0;\n  for (const [folder, count] of counts) {\n    if (count > bestCount) {\n      bestCount = count;\n      best = folder;\n    }\n  }\n  return best;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: count distinct session date-folders\n// ---------------------------------------------------------------------------\n\n/**\n * Heuristic: vault notes are often stored in date-based folders like\n * \"2026/03/15\" or \"Daily/2026-03\".  We extract the first numeric path\n * segment that looks like a year (2020-2030) and group by year+month.\n *\n * Falls back to counting distinct top-level folders.\n */\nfunction countDistinctSessions(vaultPaths: string[]): number {\n  const sessions = new Set<string>();\n  const yearMonthRe = /\\b(202\\d)\\D?(0[1-9]|1[0-2])\\b/;\n\n  for (const p of vaultPaths) {\n    const m = yearMonthRe.exec(p);\n    if (m) {\n      sessions.add(`${m[1]}-${m[2]}`);\n    } else {\n      // Fallback: use top-level folder as a proxy for \"session bucket\"\n      const topFolder = p.split(\"/\")[0];\n      sessions.add(topFolder);\n    }\n  }\n  return sessions.size;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: calculate confidence score\n// ---------------------------------------------------------------------------\n\n/**\n * Confidence combines:\n *  - Cluster size (normalized, capped at 20 for max contribution)\n *  - Folder diversity (0-1 already)\n *  - Sessions count (normalized, capped at 5)\n *\n * Formula: 0.4 * sizeScore + 0.35 * folderDiversity + 0.25 * sessionScore\n */\nfunction calcConfidence(\n  size: number,\n  folderDiversity: number,\n  sessionsCount: number\n): number {\n  const sizeScore = Math.min(size / 20, 1.0);\n  const sessionScore = Math.min(sessionsCount / 5, 1.0);\n  const raw = 0.4 * sizeScore + 0.35 * folderDiversity + 0.25 * sessionScore;\n  return Math.round(raw * 100) / 100;\n}\n\n// ---------------------------------------------------------------------------\n// Main handler: graph_latent_ideas\n// ---------------------------------------------------------------------------\n\nexport async function handleGraphLatentIdeas(\n  backend: StorageBackend,\n  params: GraphLatentIdeasParams\n): Promise<GraphLatentIdeasResult> {\n  const minClusterSize = params.min_cluster_size ?? 3;\n  const maxIdeas = params.max_ideas ?? 15;\n  const lookbackDays = params.lookback_days ?? 180;\n  const similarityThreshold = params.similarity_threshold ?? 0.65;\n\n  const { project_id: vaultProjectId } = params;\n  if (!vaultProjectId) {\n    throw new Error(\n      \"graph_latent_ideas: project_id is required (pass the vault project's numeric ID)\"\n    );\n  }\n\n  // Run the same clustering algorithm used by graph_clusters\n  const themeResult = await zettelThemes(backend, {\n    vaultProjectId,\n    lookbackDays,\n    minClusterSize,\n    maxThemes: maxIdeas * 3, // Over-fetch — many will be filtered as materialized\n    similarityThreshold,\n  });\n\n  const ideas: LatentIdea[] = [];\n  let materializedCount = 0;\n\n  for (const theme of themeResult.themes) {\n    const notePaths = theme.notes.map((n) => n.path);\n\n    // Check if a dedicated note already exists for this theme\n    if (await clusterHasMatchingNote(backend, theme.label, notePaths)) {\n      materializedCount++;\n      continue;\n    }\n\n    // This is a latent idea — no dedicated note exists yet\n    const suggestedFolder = mostCommonFolder(notePaths);\n    const sessionsCount = countDistinctSessions(notePaths);\n    const confidence = calcConfidence(theme.size, theme.folderDiversity, sessionsCount);\n\n    // Build source notes with relevance scores\n    // Relevance is approximated by position in cluster (centroid-closest first)\n    // zettelThemes returns notes in no guaranteed order; assign uniform relevance\n    // decreasing from 1.0 to 0.5 across the list.\n    const sourceNotes: LatentIdeaSourceNote[] = theme.notes.map((n, idx) => ({\n      vault_path: n.path,\n      title: n.title ?? n.path.split(\"/\").pop()?.replace(/\\.md$/i, \"\") ?? n.path,\n      relevance: Math.round((1.0 - (idx / Math.max(theme.notes.length - 1, 1)) * 0.5) * 100) / 100,\n    }));\n\n    ideas.push({\n      id: theme.id,\n      label: theme.label,\n      size: theme.size,\n      confidence,\n      source_notes: sourceNotes,\n      suggested_title: toSuggestedTitle(theme.label),\n      suggested_folder: suggestedFolder,\n      sessions_count: sessionsCount,\n    });\n\n    if (ideas.length >= maxIdeas) break;\n  }\n\n  // Sort by confidence descending\n  ideas.sort((a, b) => b.confidence - a.confidence);\n\n  return {\n    ideas,\n    total_clusters_analyzed: themeResult.themes.length + materializedCount,\n    materialized_count: materializedCount,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Materialize handler: idea_materialize\n// ---------------------------------------------------------------------------\n\nexport function handleIdeaMaterialize(\n  params: IdeaMaterializeParams,\n  vaultPath: string\n): IdeaMaterializeResult {\n  const { idea_label, title, folder, source_paths } = params;\n\n  // Sanitize filename: replace characters illegal in filenames\n  const safeTitle = title.replace(/[/\\\\:*?\"<>|]/g, \"-\");\n  const fileName = `${safeTitle}.md`;\n\n  // Vault-relative path (forward slashes, no leading slash)\n  const relFolder = folder.replace(/^\\/+|\\/+$/g, \"\");\n  const vault_path = relFolder ? `${relFolder}/${fileName}` : fileName;\n\n  // Absolute filesystem path\n  const absPath = join(vaultPath, vault_path);\n  const absDir = dirname(absPath);\n\n  // Build wikilinks from source_paths\n  const wikilinks = source_paths\n    .map((p) => {\n      // Derive a display name: filename without extension\n      const name = p.split(\"/\").pop()?.replace(/\\.md$/i, \"\") ?? p;\n      // Relative wikilink — use just the filename (Obsidian resolves by title)\n      return `- [[${name}]]`;\n    })\n    .join(\"\\n\");\n\n  const links_created = source_paths.length;\n\n  const content = [\n    `# ${title}`,\n    \"\",\n    `*Materialized from latent idea: \"${idea_label}\"*`,\n    `*Sources: ${links_created} notes*`,\n    \"\",\n    \"## Related Notes\",\n    \"\",\n    wikilinks || \"*(no source notes)*\",\n    \"\",\n    \"## Notes\",\n    \"\",\n    \"<!-- Add your thoughts about this idea here -->\",\n    \"\",\n  ].join(\"\\n\");\n\n  // Write the file (create parent directories as needed)\n  mkdirSync(absDir, { recursive: true });\n  writeFileSync(absPath, content, \"utf-8\");\n\n  return {\n    vault_path,\n    content,\n    links_created,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;AA0GA,SAAS,kBAAkB,OAAe,OAAwB;CAChE,MAAM,aAAa,MAChB,aAAa,CACb,MAAM,YAAY,CAClB,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,iBAAiB,IAAI,EAAE,CAAC;AAE1D,KAAI,WAAW,WAAW,EAAG,QAAO;CAEpC,MAAM,aAAa,MAAM,aAAa;AAEtC,QADmB,WAAW,QAAQ,MAAM,WAAW,SAAS,EAAE,CAAC,CAAC,SAChD,WAAW,UAAU;;;;;;AAO3C,eAAe,uBACb,SACA,OACA,WACkB;CAGlB,MAAM,UAAU,IAAI,IAAI,UAAU;CAGlC,MAAM,OAAO,MAAM,QAAQ,kBAAkB;AAE7C,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,CAAC,IAAI,MAAO;AAGhB,MAAI,QAAQ,IAAI,IAAI,UAAU,CAAE;AAChC,MAAI,kBAAkB,OAAO,IAAI,MAAM,CAAE,QAAO;;AAElD,QAAO;;AAOT,SAAS,iBAAiB,OAAuB;AAgB/C,QAbc,MACX,MAAM,CACN,MAAM,MAAM,CACZ,KAAK,GAAG,MAAM;EACb,MAAM,QAAQ,EAAE,aAAa;AAE7B,MAAI,MAAM,KAAK,iBAAiB,IAAI,MAAM,IAAI,MAAM,MAAM,CAAC,MAAM,MAAM,CAAC,SAAS,EAC/E,QAAO;AAET,SAAO,EAAE,OAAO,EAAE,CAAC,aAAa,GAAG,EAAE,MAAM,EAAE;GAC7C,CACD,OAAO,QAAQ,CAEL,KAAK,IAAI,IAAI;;AAO5B,SAAS,iBAAiB,YAA8B;CACtD,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAK,MAAM,KAAK,YAAY;EAC1B,MAAM,QAAQ,EAAE,MAAM,IAAI;EAC1B,MAAM,SAAS,MAAM,SAAS,IAAI,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,IAAI,GAAG;AACjE,SAAO,IAAI,SAAS,OAAO,IAAI,OAAO,IAAI,KAAK,EAAE;;CAGnD,IAAI,OAAO;CACX,IAAI,YAAY;AAChB,MAAK,MAAM,CAAC,QAAQ,UAAU,OAC5B,KAAI,QAAQ,WAAW;AACrB,cAAY;AACZ,SAAO;;AAGX,QAAO;;;;;;;;;AAcT,SAAS,sBAAsB,YAA8B;CAC3D,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,cAAc;AAEpB,MAAK,MAAM,KAAK,YAAY;EAC1B,MAAM,IAAI,YAAY,KAAK,EAAE;AAC7B,MAAI,EACF,UAAS,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,KAAK;OAC1B;GAEL,MAAM,YAAY,EAAE,MAAM,IAAI,CAAC;AAC/B,YAAS,IAAI,UAAU;;;AAG3B,QAAO,SAAS;;;;;;;;;;AAelB,SAAS,eACP,MACA,iBACA,eACQ;CACR,MAAM,YAAY,KAAK,IAAI,OAAO,IAAI,EAAI;CAC1C,MAAM,eAAe,KAAK,IAAI,gBAAgB,GAAG,EAAI;CACrD,MAAM,MAAM,KAAM,YAAY,MAAO,kBAAkB,MAAO;AAC9D,QAAO,KAAK,MAAM,MAAM,IAAI,GAAG;;AAOjC,eAAsB,uBACpB,SACA,QACiC;CACjC,MAAM,iBAAiB,OAAO,oBAAoB;CAClD,MAAM,WAAW,OAAO,aAAa;CACrC,MAAM,eAAe,OAAO,iBAAiB;CAC7C,MAAM,sBAAsB,OAAO,wBAAwB;CAE3D,MAAM,EAAE,YAAY,mBAAmB;AACvC,KAAI,CAAC,eACH,OAAM,IAAI,MACR,mFACD;CAIH,MAAM,cAAc,MAAM,aAAa,SAAS;EAC9C;EACA;EACA;EACA,WAAW,WAAW;EACtB;EACD,CAAC;CAEF,MAAM,QAAsB,EAAE;CAC9B,IAAI,oBAAoB;AAExB,MAAK,MAAM,SAAS,YAAY,QAAQ;EACtC,MAAM,YAAY,MAAM,MAAM,KAAK,MAAM,EAAE,KAAK;AAGhD,MAAI,MAAM,uBAAuB,SAAS,MAAM,OAAO,UAAU,EAAE;AACjE;AACA;;EAIF,MAAM,kBAAkB,iBAAiB,UAAU;EACnD,MAAM,gBAAgB,sBAAsB,UAAU;EACtD,MAAM,aAAa,eAAe,MAAM,MAAM,MAAM,iBAAiB,cAAc;EAMnF,MAAM,cAAsC,MAAM,MAAM,KAAK,GAAG,SAAS;GACvE,YAAY,EAAE;GACd,OAAO,EAAE,SAAS,EAAE,KAAK,MAAM,IAAI,CAAC,KAAK,EAAE,QAAQ,UAAU,GAAG,IAAI,EAAE;GACtE,WAAW,KAAK,OAAO,IAAO,MAAM,KAAK,IAAI,MAAM,MAAM,SAAS,GAAG,EAAE,GAAI,MAAO,IAAI,GAAG;GAC1F,EAAE;AAEH,QAAM,KAAK;GACT,IAAI,MAAM;GACV,OAAO,MAAM;GACb,MAAM,MAAM;GACZ;GACA,cAAc;GACd,iBAAiB,iBAAiB,MAAM,MAAM;GAC9C,kBAAkB;GAClB,gBAAgB;GACjB,CAAC;AAEF,MAAI,MAAM,UAAU,SAAU;;AAIhC,OAAM,MAAM,GAAG,MAAM,EAAE,aAAa,EAAE,WAAW;AAEjD,QAAO;EACL;EACA,yBAAyB,YAAY,OAAO,SAAS;EACrD,oBAAoB;EACrB;;AAOH,SAAgB,sBACd,QACA,WACuB;CACvB,MAAM,EAAE,YAAY,OAAO,QAAQ,iBAAiB;CAIpD,MAAM,WAAW,GADC,MAAM,QAAQ,iBAAiB,IAAI,CACvB;CAG9B,MAAM,YAAY,OAAO,QAAQ,cAAc,GAAG;CAClD,MAAM,aAAa,YAAY,GAAG,UAAU,GAAG,aAAa;CAG5D,MAAM,UAAU,KAAK,WAAW,WAAW;CAC3C,MAAM,SAAS,QAAQ,QAAQ;CAG/B,MAAM,YAAY,aACf,KAAK,MAAM;AAIV,SAAO,OAFM,EAAE,MAAM,IAAI,CAAC,KAAK,EAAE,QAAQ,UAAU,GAAG,IAAI,EAEvC;GACnB,CACD,KAAK,KAAK;CAEb,MAAM,gBAAgB,aAAa;CAEnC,MAAM,UAAU;EACd,KAAK;EACL;EACA,oCAAoC,WAAW;EAC/C,aAAa,cAAc;EAC3B;EACA;EACA;EACA,aAAa;EACb;EACA;EACA;EACA;EACA;EACD,CAAC,KAAK,KAAK;AAGZ,WAAU,QAAQ,EAAE,WAAW,MAAM,CAAC;AACtC,eAAc,SAAS,SAAS,QAAQ;AAExC,QAAO;EACL;EACA;EACA;EACD"}