@tekmidian/pai 0.63.0 → 0.65.0

package/dist/{trace-BRflVyBi.mjs.map → trace-CmAB7iJZ.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"trace-BRflVyBi.mjs","names":[],"sources":["../src/graph/trace.ts"],"sourcesContent":["/**\n * trace.ts — graph_trace endpoint handler\n *\n * Given a topic/keyword query, searches vault notes for appearances of that topic\n * and returns a chronological timeline showing how the idea evolved over time.\n */\n\nimport type { StorageBackend } from \"../storage/interface.js\";\n\n// ---------------------------------------------------------------------------\n// Public param / result types\n// ---------------------------------------------------------------------------\n\nexport interface GraphTraceParams {\n  query: string;\n  project_id: number;\n  max_results?: number;\n  lookback_days?: number;\n}\n\nexport interface TraceEntry {\n  vault_path: string;\n  title: string;\n  folder: string;\n  indexed_at: number;\n  snippet: string;\n  dominant_type: string;\n}\n\nexport interface TraceConnection {\n  from_path: string;\n  to_path: string;\n  type: \"temporal\" | \"wikilink\";\n}\n\nexport interface GraphTraceResult {\n  query: string;\n  entries: TraceEntry[];\n  connections: TraceConnection[];\n  time_span: { from: number; to: number };\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction folderFromPath(vaultPath: string): string {\n  const lastSlash = vaultPath.lastIndexOf(\"/\");\n  return lastSlash === -1 ? \"\" : vaultPath.slice(0, lastSlash);\n}\n\nfunction extractSnippet(text: string, query: string): string {\n  const lowerText = text.toLowerCase();\n  const lowerQuery = query.toLowerCase();\n  const idx = lowerText.indexOf(lowerQuery);\n  if (idx === -1) {\n    return text.slice(0, 160).trimEnd() + (text.length > 160 ? \"…\" : \"\");\n  }\n\n  const CONTEXT = 70;\n  const start = Math.max(0, idx - CONTEXT);\n  const end = Math.min(text.length, idx + query.length + CONTEXT);\n\n  let snippet = text.slice(start, end).replace(/\\s+/g, \" \").trim();\n  if (start > 0) snippet = \"…\" + snippet;\n  if (end < text.length) snippet = snippet + \"…\";\n\n  return snippet;\n}\n\n// ---------------------------------------------------------------------------\n// Main handler\n// ---------------------------------------------------------------------------\n\nexport async function handleGraphTrace(\n  backend: StorageBackend,\n  params: GraphTraceParams\n): Promise<GraphTraceResult> {\n  const query = (params.query ?? \"\").trim();\n  if (!query) {\n    return { query: \"\", entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  const maxResults = params.max_results ?? 30;\n  const lookbackDays = params.lookback_days ?? 365;\n  const cutoffTimestamp = Math.floor(Date.now() / 1000) - lookbackDays * 86400;\n\n  // ---------------------------------------------------------------------------\n  // Step 1: Collect matching vault paths via multiple search strategies\n  // ---------------------------------------------------------------------------\n\n  const matchedPaths = new Map<string, string>(); // path → best snippet text\n\n  // Strategy A: title / alias match in vault_name_index\n  try {\n    const namePaths = await backend.searchVaultNameIndex(query, 100);\n    for (const vaultPath of namePaths) {\n      if (!matchedPaths.has(vaultPath)) {\n        matchedPaths.set(vaultPath, \"\");\n      }\n    }\n  } catch {\n    // vault_name_index may not exist in all schema versions\n  }\n\n  // Strategy B: content search in memory_chunks\n  try {\n    const chunkRows = await backend.searchChunksByText(params.project_id, query, 200);\n    for (const row of chunkRows) {\n      if (!matchedPaths.has(row.path)) {\n        matchedPaths.set(row.path, row.text);\n      } else if (!matchedPaths.get(row.path)) {\n        matchedPaths.set(row.path, row.text);\n      }\n    }\n  } catch {\n    // Best-effort — continue with what we have\n  }\n\n  if (matchedPaths.size === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 2: Fetch vault_files metadata for all matched paths, filtered by cutoff\n  // ---------------------------------------------------------------------------\n\n  const allPaths = Array.from(matchedPaths.keys());\n  let fileRows: Array<{ vaultPath: string; title: string | null; indexedAt: number }> = [];\n  try {\n    fileRows = await backend.getVaultFilesByPathsAfter(allPaths, cutoffTimestamp * 1000);\n    // Sort chronologically\n    fileRows.sort((a, b) => a.indexedAt - b.indexedAt);\n  } catch {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  if (fileRows.length === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 3: Build TraceEntry array\n  // ---------------------------------------------------------------------------\n\n  const entries: TraceEntry[] = fileRows.slice(0, maxResults).map((row) => {\n    const fileName = row.vaultPath.split(\"/\").pop() ?? row.vaultPath;\n    const title = row.title ?? fileName.replace(/\\.md$/i, \"\");\n    const chunkText = matchedPaths.get(row.vaultPath) ?? \"\";\n    const snippet = extractSnippet(chunkText, query);\n\n    return {\n      vault_path: row.vaultPath,\n      title,\n      folder: folderFromPath(row.vaultPath),\n      indexed_at: row.indexedAt,\n      snippet,\n      dominant_type: \"unknown\",\n    };\n  });\n\n  if (entries.length === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 4: Build connections\n  // ---------------------------------------------------------------------------\n\n  const connections: TraceConnection[] = [];\n  const entryPathSet = new Set(entries.map((e) => e.vault_path));\n\n  // Temporal edges: consecutive entries (oldest → next)\n  for (let i = 0; i < entries.length - 1; i++) {\n    connections.push({\n      from_path: entries[i].vault_path,\n      to_path: entries[i + 1].vault_path,\n      type: \"temporal\",\n    });\n  }\n\n  // Wikilink edges\n  try {\n    const entryPaths = entries.map(e => e.vault_path);\n    const linkRows = await backend.getVaultLinksFromPaths(entryPaths);\n\n    const wikiEdgeKeys = new Set<string>();\n    for (const row of linkRows) {\n      if (!row.targetPath) continue;\n      if (!entryPathSet.has(row.targetPath)) continue;\n\n      const key = `${row.sourcePath}|||${row.targetPath}`;\n      if (wikiEdgeKeys.has(key)) continue;\n      wikiEdgeKeys.add(key);\n\n      connections.push({\n        from_path: row.sourcePath,\n        to_path: row.targetPath,\n        type: \"wikilink\",\n      });\n    }\n  } catch {\n    // vault_links may not exist — temporal edges are sufficient\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 5: Compute time span\n  // ---------------------------------------------------------------------------\n\n  const timestamps = entries.map((e) => e.indexed_at).filter((t) => t > 0);\n  const timeFrom = timestamps.length > 0 ? Math.min(...timestamps) : 0;\n  const timeTo = timestamps.length > 0 ? Math.max(...timestamps) : 0;\n\n  return {\n    query,\n    entries,\n    connections,\n    time_span: { from: timeFrom, to: timeTo },\n  };\n}\n"],"mappings":";AA8CA,SAAS,eAAe,WAA2B;CACjD,MAAM,YAAY,UAAU,YAAY,IAAI;AAC5C,QAAO,cAAc,KAAK,KAAK,UAAU,MAAM,GAAG,UAAU;;AAG9D,SAAS,eAAe,MAAc,OAAuB;CAC3D,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,aAAa,MAAM,aAAa;CACtC,MAAM,MAAM,UAAU,QAAQ,WAAW;AACzC,KAAI,QAAQ,GACV,QAAO,KAAK,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,SAAS,MAAM,MAAM;CAGnE,MAAM,UAAU;CAChB,MAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,QAAQ;CACxC,MAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM,SAAS,QAAQ;CAE/D,IAAI,UAAU,KAAK,MAAM,OAAO,IAAI,CAAC,QAAQ,QAAQ,IAAI,CAAC,MAAM;AAChE,KAAI,QAAQ,EAAG,WAAU,MAAM;AAC/B,KAAI,MAAM,KAAK,OAAQ,WAAU,UAAU;AAE3C,QAAO;;AAOT,eAAsB,iBACpB,SACA,QAC2B;CAC3B,MAAM,SAAS,OAAO,SAAS,IAAI,MAAM;AACzC,KAAI,CAAC,MACH,QAAO;EAAE,OAAO;EAAI,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAGnF,MAAM,aAAa,OAAO,eAAe;CACzC,MAAM,eAAe,OAAO,iBAAiB;CAC7C,MAAM,kBAAkB,KAAK,MAAM,KAAK,KAAK,GAAG,IAAK,GAAG,eAAe;CAMvE,MAAM,+BAAe,IAAI,KAAqB;AAG9C,KAAI;EACF,MAAM,YAAY,MAAM,QAAQ,qBAAqB,OAAO,IAAI;AAChE,OAAK,MAAM,aAAa,UACtB,KAAI,CAAC,aAAa,IAAI,UAAU,CAC9B,cAAa,IAAI,WAAW,GAAG;SAG7B;AAKR,KAAI;EACF,MAAM,YAAY,MAAM,QAAQ,mBAAmB,OAAO,YAAY,OAAO,IAAI;AACjF,OAAK,MAAM,OAAO,UAChB,KAAI,CAAC,aAAa,IAAI,IAAI,KAAK,CAC7B,cAAa,IAAI,IAAI,MAAM,IAAI,KAAK;WAC3B,CAAC,aAAa,IAAI,IAAI,KAAK,CACpC,cAAa,IAAI,IAAI,MAAM,IAAI,KAAK;SAGlC;AAIR,KAAI,aAAa,SAAS,EACxB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,WAAW,MAAM,KAAK,aAAa,MAAM,CAAC;CAChD,IAAI,WAAkF,EAAE;AACxF,KAAI;AACF,aAAW,MAAM,QAAQ,0BAA0B,UAAU,kBAAkB,IAAK;AAEpF,WAAS,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;SAC5C;AACN,SAAO;GAAE;GAAO,SAAS,EAAE;GAAE,aAAa,EAAE;GAAE,WAAW;IAAE,MAAM;IAAG,IAAI;IAAG;GAAE;;AAG/E,KAAI,SAAS,WAAW,EACtB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,UAAwB,SAAS,MAAM,GAAG,WAAW,CAAC,KAAK,QAAQ;EACvE,MAAM,WAAW,IAAI,UAAU,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI;EACvD,MAAM,QAAQ,IAAI,SAAS,SAAS,QAAQ,UAAU,GAAG;EAEzD,MAAM,UAAU,eADE,aAAa,IAAI,IAAI,UAAU,IAAI,IACX,MAAM;AAEhD,SAAO;GACL,YAAY,IAAI;GAChB;GACA,QAAQ,eAAe,IAAI,UAAU;GACrC,YAAY,IAAI;GAChB;GACA,eAAe;GAChB;GACD;AAEF,KAAI,QAAQ,WAAW,EACrB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,cAAiC,EAAE;CACzC,MAAM,eAAe,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,WAAW,CAAC;AAG9D,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,IACtC,aAAY,KAAK;EACf,WAAW,QAAQ,GAAG;EACtB,SAAS,QAAQ,IAAI,GAAG;EACxB,MAAM;EACP,CAAC;AAIJ,KAAI;EACF,MAAM,aAAa,QAAQ,KAAI,MAAK,EAAE,WAAW;EACjD,MAAM,WAAW,MAAM,QAAQ,uBAAuB,WAAW;EAEjE,MAAM,+BAAe,IAAI,KAAa;AACtC,OAAK,MAAM,OAAO,UAAU;AAC1B,OAAI,CAAC,IAAI,WAAY;AACrB,OAAI,CAAC,aAAa,IAAI,IAAI,WAAW,CAAE;GAEvC,MAAM,MAAM,GAAG,IAAI,WAAW,KAAK,IAAI;AACvC,OAAI,aAAa,IAAI,IAAI,CAAE;AAC3B,gBAAa,IAAI,IAAI;AAErB,eAAY,KAAK;IACf,WAAW,IAAI;IACf,SAAS,IAAI;IACb,MAAM;IACP,CAAC;;SAEE;CAQR,MAAM,aAAa,QAAQ,KAAK,MAAM,EAAE,WAAW,CAAC,QAAQ,MAAM,IAAI,EAAE;AAIxE,QAAO;EACL;EACA;EACA;EACA,WAAW;GAAE,MAPE,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG;GAOpC,IANhB,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG;GAMtB;EAC1C"}
+{"version":3,"file":"trace-CmAB7iJZ.mjs","names":[],"sources":["../src/graph/trace.ts"],"sourcesContent":["/**\n * trace.ts — graph_trace endpoint handler\n *\n * Given a topic/keyword query, searches vault notes for appearances of that topic\n * and returns a chronological timeline showing how the idea evolved over time.\n */\n\nimport type { StorageBackend } from \"../storage/interface.js\";\n\n// ---------------------------------------------------------------------------\n// Public param / result types\n// ---------------------------------------------------------------------------\n\nexport interface GraphTraceParams {\n  query: string;\n  project_id: number;\n  max_results?: number;\n  lookback_days?: number;\n}\n\nexport interface TraceEntry {\n  vault_path: string;\n  title: string;\n  folder: string;\n  indexed_at: number;\n  snippet: string;\n  dominant_type: string;\n}\n\nexport interface TraceConnection {\n  from_path: string;\n  to_path: string;\n  type: \"temporal\" | \"wikilink\";\n}\n\nexport interface GraphTraceResult {\n  query: string;\n  entries: TraceEntry[];\n  connections: TraceConnection[];\n  time_span: { from: number; to: number };\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\nfunction folderFromPath(vaultPath: string): string {\n  const lastSlash = vaultPath.lastIndexOf(\"/\");\n  return lastSlash === -1 ? \"\" : vaultPath.slice(0, lastSlash);\n}\n\nfunction extractSnippet(text: string, query: string): string {\n  const lowerText = text.toLowerCase();\n  const lowerQuery = query.toLowerCase();\n  const idx = lowerText.indexOf(lowerQuery);\n  if (idx === -1) {\n    return text.slice(0, 160).trimEnd() + (text.length > 160 ? \"…\" : \"\");\n  }\n\n  const CONTEXT = 70;\n  const start = Math.max(0, idx - CONTEXT);\n  const end = Math.min(text.length, idx + query.length + CONTEXT);\n\n  let snippet = text.slice(start, end).replace(/\\s+/g, \" \").trim();\n  if (start > 0) snippet = \"…\" + snippet;\n  if (end < text.length) snippet = snippet + \"…\";\n\n  return snippet;\n}\n\n// ---------------------------------------------------------------------------\n// Main handler\n// ---------------------------------------------------------------------------\n\nexport async function handleGraphTrace(\n  backend: StorageBackend,\n  params: GraphTraceParams\n): Promise<GraphTraceResult> {\n  const query = (params.query ?? \"\").trim();\n  if (!query) {\n    return { query: \"\", entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  const maxResults = params.max_results ?? 30;\n  const lookbackDays = params.lookback_days ?? 365;\n  const cutoffTimestamp = Math.floor(Date.now() / 1000) - lookbackDays * 86400;\n\n  // ---------------------------------------------------------------------------\n  // Step 1: Collect matching vault paths via multiple search strategies\n  // ---------------------------------------------------------------------------\n\n  const matchedPaths = new Map<string, string>(); // path → best snippet text\n\n  // Strategy A: title / alias match in vault_name_index\n  try {\n    const namePaths = await backend.searchVaultNameIndex(query, 100);\n    for (const vaultPath of namePaths) {\n      if (!matchedPaths.has(vaultPath)) {\n        matchedPaths.set(vaultPath, \"\");\n      }\n    }\n  } catch {\n    // vault_name_index may not exist in all schema versions\n  }\n\n  // Strategy B: content search in memory_chunks\n  try {\n    const chunkRows = await backend.searchChunksByText(params.project_id, query, 200);\n    for (const row of chunkRows) {\n      if (!matchedPaths.has(row.path)) {\n        matchedPaths.set(row.path, row.text);\n      } else if (!matchedPaths.get(row.path)) {\n        matchedPaths.set(row.path, row.text);\n      }\n    }\n  } catch {\n    // Best-effort — continue with what we have\n  }\n\n  if (matchedPaths.size === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 2: Fetch vault_files metadata for all matched paths, filtered by cutoff\n  // ---------------------------------------------------------------------------\n\n  const allPaths = Array.from(matchedPaths.keys());\n  let fileRows: Array<{ vaultPath: string; title: string | null; indexedAt: number }> = [];\n  try {\n    fileRows = await backend.getVaultFilesByPathsAfter(allPaths, cutoffTimestamp * 1000);\n    // Sort chronologically\n    fileRows.sort((a, b) => a.indexedAt - b.indexedAt);\n  } catch {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  if (fileRows.length === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 3: Build TraceEntry array\n  // ---------------------------------------------------------------------------\n\n  const entries: TraceEntry[] = fileRows.slice(0, maxResults).map((row) => {\n    const fileName = row.vaultPath.split(\"/\").pop() ?? row.vaultPath;\n    const title = row.title ?? fileName.replace(/\\.md$/i, \"\");\n    const chunkText = matchedPaths.get(row.vaultPath) ?? \"\";\n    const snippet = extractSnippet(chunkText, query);\n\n    return {\n      vault_path: row.vaultPath,\n      title,\n      folder: folderFromPath(row.vaultPath),\n      indexed_at: row.indexedAt,\n      snippet,\n      dominant_type: \"unknown\",\n    };\n  });\n\n  if (entries.length === 0) {\n    return { query, entries: [], connections: [], time_span: { from: 0, to: 0 } };\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 4: Build connections\n  // ---------------------------------------------------------------------------\n\n  const connections: TraceConnection[] = [];\n  const entryPathSet = new Set(entries.map((e) => e.vault_path));\n\n  // Temporal edges: consecutive entries (oldest → next)\n  for (let i = 0; i < entries.length - 1; i++) {\n    connections.push({\n      from_path: entries[i].vault_path,\n      to_path: entries[i + 1].vault_path,\n      type: \"temporal\",\n    });\n  }\n\n  // Wikilink edges\n  try {\n    const entryPaths = entries.map(e => e.vault_path);\n    const linkRows = await backend.getVaultLinksFromPaths(entryPaths);\n\n    const wikiEdgeKeys = new Set<string>();\n    for (const row of linkRows) {\n      if (!row.targetPath) continue;\n      if (!entryPathSet.has(row.targetPath)) continue;\n\n      const key = `${row.sourcePath}|||${row.targetPath}`;\n      if (wikiEdgeKeys.has(key)) continue;\n      wikiEdgeKeys.add(key);\n\n      connections.push({\n        from_path: row.sourcePath,\n        to_path: row.targetPath,\n        type: \"wikilink\",\n      });\n    }\n  } catch {\n    // vault_links may not exist — temporal edges are sufficient\n  }\n\n  // ---------------------------------------------------------------------------\n  // Step 5: Compute time span\n  // ---------------------------------------------------------------------------\n\n  const timestamps = entries.map((e) => e.indexed_at).filter((t) => t > 0);\n  const timeFrom = timestamps.length > 0 ? Math.min(...timestamps) : 0;\n  const timeTo = timestamps.length > 0 ? Math.max(...timestamps) : 0;\n\n  return {\n    query,\n    entries,\n    connections,\n    time_span: { from: timeFrom, to: timeTo },\n  };\n}\n"],"mappings":";AA8CA,SAAS,eAAe,WAA2B;CACjD,MAAM,YAAY,UAAU,YAAY,IAAI;AAC5C,QAAO,cAAc,KAAK,KAAK,UAAU,MAAM,GAAG,UAAU;;AAG9D,SAAS,eAAe,MAAc,OAAuB;CAC3D,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,aAAa,MAAM,aAAa;CACtC,MAAM,MAAM,UAAU,QAAQ,WAAW;AACzC,KAAI,QAAQ,GACV,QAAO,KAAK,MAAM,GAAG,IAAI,CAAC,SAAS,IAAI,KAAK,SAAS,MAAM,MAAM;CAGnE,MAAM,UAAU;CAChB,MAAM,QAAQ,KAAK,IAAI,GAAG,MAAM,QAAQ;CACxC,MAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,MAAM,MAAM,SAAS,QAAQ;CAE/D,IAAI,UAAU,KAAK,MAAM,OAAO,IAAI,CAAC,QAAQ,QAAQ,IAAI,CAAC,MAAM;AAChE,KAAI,QAAQ,EAAG,WAAU,MAAM;AAC/B,KAAI,MAAM,KAAK,OAAQ,WAAU,UAAU;AAE3C,QAAO;;AAOT,eAAsB,iBACpB,SACA,QAC2B;CAC3B,MAAM,SAAS,OAAO,SAAS,IAAI,MAAM;AACzC,KAAI,CAAC,MACH,QAAO;EAAE,OAAO;EAAI,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAGnF,MAAM,aAAa,OAAO,eAAe;CACzC,MAAM,eAAe,OAAO,iBAAiB;CAC7C,MAAM,kBAAkB,KAAK,MAAM,KAAK,KAAK,GAAG,IAAK,GAAG,eAAe;CAMvE,MAAM,+BAAe,IAAI,KAAqB;AAG9C,KAAI;EACF,MAAM,YAAY,MAAM,QAAQ,qBAAqB,OAAO,IAAI;AAChE,OAAK,MAAM,aAAa,UACtB,KAAI,CAAC,aAAa,IAAI,UAAU,CAC9B,cAAa,IAAI,WAAW,GAAG;SAG7B;AAKR,KAAI;EACF,MAAM,YAAY,MAAM,QAAQ,mBAAmB,OAAO,YAAY,OAAO,IAAI;AACjF,OAAK,MAAM,OAAO,UAChB,KAAI,CAAC,aAAa,IAAI,IAAI,KAAK,CAC7B,cAAa,IAAI,IAAI,MAAM,IAAI,KAAK;WAC3B,CAAC,aAAa,IAAI,IAAI,KAAK,CACpC,cAAa,IAAI,IAAI,MAAM,IAAI,KAAK;SAGlC;AAIR,KAAI,aAAa,SAAS,EACxB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,WAAW,MAAM,KAAK,aAAa,MAAM,CAAC;CAChD,IAAI,WAAkF,EAAE;AACxF,KAAI;AACF,aAAW,MAAM,QAAQ,0BAA0B,UAAU,kBAAkB,IAAK;AAEpF,WAAS,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,UAAU;SAC5C;AACN,SAAO;GAAE;GAAO,SAAS,EAAE;GAAE,aAAa,EAAE;GAAE,WAAW;IAAE,MAAM;IAAG,IAAI;IAAG;GAAE;;AAG/E,KAAI,SAAS,WAAW,EACtB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,UAAwB,SAAS,MAAM,GAAG,WAAW,CAAC,KAAK,QAAQ;EACvE,MAAM,WAAW,IAAI,UAAU,MAAM,IAAI,CAAC,KAAK,IAAI,IAAI;EACvD,MAAM,QAAQ,IAAI,SAAS,SAAS,QAAQ,UAAU,GAAG;EAEzD,MAAM,UAAU,eADE,aAAa,IAAI,IAAI,UAAU,IAAI,IACX,MAAM;AAEhD,SAAO;GACL,YAAY,IAAI;GAChB;GACA,QAAQ,eAAe,IAAI,UAAU;GACrC,YAAY,IAAI;GAChB;GACA,eAAe;GAChB;GACD;AAEF,KAAI,QAAQ,WAAW,EACrB,QAAO;EAAE;EAAO,SAAS,EAAE;EAAE,aAAa,EAAE;EAAE,WAAW;GAAE,MAAM;GAAG,IAAI;GAAG;EAAE;CAO/E,MAAM,cAAiC,EAAE;CACzC,MAAM,eAAe,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,WAAW,CAAC;AAG9D,MAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,SAAS,GAAG,IACtC,aAAY,KAAK;EACf,WAAW,QAAQ,GAAG;EACtB,SAAS,QAAQ,IAAI,GAAG;EACxB,MAAM;EACP,CAAC;AAIJ,KAAI;EACF,MAAM,aAAa,QAAQ,KAAI,MAAK,EAAE,WAAW;EACjD,MAAM,WAAW,MAAM,QAAQ,uBAAuB,WAAW;EAEjE,MAAM,+BAAe,IAAI,KAAa;AACtC,OAAK,MAAM,OAAO,UAAU;AAC1B,OAAI,CAAC,IAAI,WAAY;AACrB,OAAI,CAAC,aAAa,IAAI,IAAI,WAAW,CAAE;GAEvC,MAAM,MAAM,GAAG,IAAI,WAAW,KAAK,IAAI;AACvC,OAAI,aAAa,IAAI,IAAI,CAAE;AAC3B,gBAAa,IAAI,IAAI;AAErB,eAAY,KAAK;IACf,WAAW,IAAI;IACf,SAAS,IAAI;IACb,MAAM;IACP,CAAC;;SAEE;CAQR,MAAM,aAAa,QAAQ,KAAK,MAAM,EAAE,WAAW,CAAC,QAAQ,MAAM,IAAI,EAAE;AAIxE,QAAO;EACL;EACA;EACA;EACA,WAAW;GAAE,MAPE,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG;GAOpC,IANhB,WAAW,SAAS,IAAI,KAAK,IAAI,GAAG,WAAW,GAAG;GAMtB;EAC1C"}

package/dist/{vault-indexer-mCFus_AM.mjs → vault-indexer-Ddq51X20.mjs}

@@ -1,4 +1,5 @@
-import { c as yieldToEventLoop, f as sha256File, l as chunkMarkdown, n as chunkId } from "./helpers-Dj-B314s.mjs";
+import { i as fileContentHash, n as chunkMarkdown } from "./chunker-BH4i-F2b.mjs";
+import { c as yieldToEventLoop, n as chunkId } from "./helpers-BRCJg0G3.mjs";
 import { existsSync, readFileSync, readdirSync, statSync } from "node:fs";
 import { basename, dirname, join, normalize, relative } from "node:path";
 
@@ -394,7 +395,7 @@ async function indexVault(backend, vaultProjectId, vaultRoot) {
 			result.filesSkipped++;
 			continue;
 		}
-		const hash = sha256File(content);
+		const hash = fileContentHash(content);
 		if ((await backend.getVaultFile(canonical.vaultRelPath))?.hash === hash) {
 			result.filesSkipped++;
 			continue;
@@ -533,4 +534,4 @@ async function indexVault(backend, vaultProjectId, vaultRoot) {
 
 //#endregion
 export { indexVault };
-//# sourceMappingURL=vault-indexer-mCFus_AM.mjs.map
+//# sourceMappingURL=vault-indexer-Ddq51X20.mjs.map

package/dist/vault-indexer-Ddq51X20.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"vault-indexer-Ddq51X20.mjs","names":[],"sources":["../src/memory/vault/walk.ts","../src/memory/vault/deduplicate.ts","../src/memory/vault/parse-links.ts","../src/memory/vault/name-index.ts","../src/memory/vault/resolve.ts","../src/memory/vault/indexer.ts"],"sourcesContent":["/**\n * Vault directory walker — follows symlinks with cycle detection.\n */\n\nimport { statSync, readdirSync, existsSync } from \"node:fs\";\nimport { join, relative } from \"node:path\";\nimport type { VaultFile } from \"./types.js\";\n\n/** Maximum number of .md files to collect from a vault. */\nconst VAULT_MAX_FILES = 10_000;\n\n/** Maximum recursion depth for vault directory walks. */\nconst VAULT_MAX_DEPTH = 10;\n\n/**\n * Directories to always skip, at any depth, during vault walks.\n * Includes standard build/VCS noise plus Obsidian-specific directories.\n */\nconst VAULT_SKIP_DIRS = new Set([\n  // Version control\n  \".git\",\n  // Dependency directories (any language)\n  \"node_modules\",\n  \"vendor\",\n  \"Pods\",\n  // Build / compile output\n  \"dist\",\n  \"build\",\n  \"out\",\n  \"DerivedData\",\n  \".next\",\n  // Python virtual environments and caches\n  \".venv\",\n  \"venv\",\n  \"__pycache__\",\n  // General caches\n  \".cache\",\n  \".bun\",\n  // Obsidian internals\n  \".obsidian\",\n  \".trash\",\n]);\n\n/**\n * Recursively collect all .md files under a vault root, following symlinks.\n *\n * Symlink-following behaviour:\n *  - Symbolic links to files: followed if the target is a .md file\n *  - Symbolic links to directories: followed with cycle detection via inode\n *\n * Cycle detection is based on the real inode of each visited directory.\n * Using the real stat (not lstat) ensures that symlinked dirs resolve to\n * their actual inode, preventing infinite loops.\n *\n * @param vaultRoot  Absolute path to the vault root directory.\n * @param opts       Optional overrides for maxFiles and maxDepth.\n */\nexport function walkVaultMdFiles(\n  vaultRoot: string,\n  opts?: { maxFiles?: number; maxDepth?: number },\n): VaultFile[] {\n  const maxFiles = opts?.maxFiles ?? VAULT_MAX_FILES;\n  const maxDepth = opts?.maxDepth ?? VAULT_MAX_DEPTH;\n\n  const results: VaultFile[] = [];\n  const visitedDirs = new Set<string>();\n\n  function walk(dir: string, depth: number): void {\n    if (results.length >= maxFiles) return;\n    if (depth > maxDepth) return;\n\n    // Get the real inode of this directory (follows symlinks on the dir itself)\n    let dirStat: ReturnType<typeof statSync>;\n    try {\n      dirStat = statSync(dir);\n    } catch {\n      return; // Unreadable or broken symlink — skip\n    }\n\n    const dirKey = `${dirStat.dev}:${dirStat.ino}`;\n    if (visitedDirs.has(dirKey)) return; // Cycle detected\n    visitedDirs.add(dirKey);\n\n    let entries: import(\"node:fs\").Dirent<string>[];\n    try {\n      entries = readdirSync(dir, { withFileTypes: true, encoding: \"utf8\" });\n    } catch {\n      return; // Unreadable directory — skip\n    }\n\n    for (const entry of entries) {\n      if (results.length >= maxFiles) break;\n      if (VAULT_SKIP_DIRS.has(entry.name)) continue;\n\n      const full = join(dir, entry.name);\n\n      if (entry.isSymbolicLink()) {\n        // Follow the symlink — resolve to real target\n        let targetStat: ReturnType<typeof statSync>;\n        try {\n          targetStat = statSync(full); // statSync follows symlinks\n        } catch {\n          continue; // Broken symlink — skip\n        }\n\n        if (targetStat.isDirectory()) {\n          if (!VAULT_SKIP_DIRS.has(entry.name)) {\n            walk(full, depth + 1);\n          }\n        } else if (targetStat.isFile() && entry.name.endsWith(\".md\")) {\n          results.push({\n            absPath: full,\n            vaultRelPath: relative(vaultRoot, full),\n            inode: targetStat.ino,\n            device: targetStat.dev,\n          });\n        }\n      } else if (entry.isDirectory()) {\n        walk(full, depth + 1);\n      } else if (entry.isFile() && entry.name.endsWith(\".md\")) {\n        let fileStat: ReturnType<typeof statSync>;\n        try {\n          fileStat = statSync(full);\n        } catch {\n          continue;\n        }\n        results.push({\n          absPath: full,\n          vaultRelPath: relative(vaultRoot, full),\n          inode: fileStat.ino,\n          device: fileStat.dev,\n        });\n      }\n    }\n  }\n\n  if (existsSync(vaultRoot)) {\n    walk(vaultRoot, 0);\n  }\n\n  return results;\n}\n","/**\n * Inode-based deduplication for vault files.\n */\n\nimport type { VaultFile, InodeGroup } from \"./types.js\";\n\n/**\n * Group vault files by inode identity (device + inode).\n *\n * Within each group, the canonical file is chosen as the one with the\n * fewest path separators (shallowest), breaking ties by shortest string.\n * All other group members become aliases.\n */\nexport function deduplicateByInode(files: VaultFile[]): InodeGroup[] {\n  const groups = new Map<string, VaultFile[]>();\n\n  for (const file of files) {\n    const key = `${file.device}:${file.inode}`;\n    const existing = groups.get(key);\n    if (existing) {\n      existing.push(file);\n    } else {\n      groups.set(key, [file]);\n    }\n  }\n\n  const result: InodeGroup[] = [];\n\n  for (const group of groups.values()) {\n    if (group.length === 0) continue;\n\n    // Sort: fewest path separators first, then shortest string\n    const sorted = [...group].sort((a, b) => {\n      const aDepth = (a.vaultRelPath.match(/\\//g) ?? []).length;\n      const bDepth = (b.vaultRelPath.match(/\\//g) ?? []).length;\n      if (aDepth !== bDepth) return aDepth - bDepth;\n      return a.vaultRelPath.length - b.vaultRelPath.length;\n    });\n\n    const [canonical, ...aliases] = sorted as [VaultFile, ...VaultFile[]];\n    result.push({ canonical, aliases });\n  }\n\n  return result;\n}\n","/**\n * Markdown link parser for vault files.\n *\n * Handles wikilinks ([[target]]), markdown links ([text](path)),\n * embeds (![[target]]), and frontmatter wikilinks.\n */\n\nimport type { ParsedLink } from \"./types.js\";\n\n/**\n * Parse all links from markdown content.\n *\n * Handles:\n *  - Standard wikilinks: [[Target Note]]\n *  - Aliased wikilinks: [[Target Note|Display Text]]\n *  - Heading anchors: [[Target Note#Heading]] (stripped for resolution)\n *  - Embeds: ![[Target Note]]\n *  - Frontmatter wikilinks (YAML between --- delimiters)\n *  - Markdown links: [text](path/to/note.md)\n *  - Markdown embeds: ![alt](image.png)\n *\n * External URLs (http://, https://, mailto:, etc.) are excluded — only\n * relative paths are treated as vault links.\n *\n * @param content  Raw markdown file content.\n * @returns        Array of parsed links in document order.\n */\nexport function parseLinks(content: string): ParsedLink[] {\n  const links: ParsedLink[] = [];\n  const lines = content.split(\"\\n\");\n\n  // Determine frontmatter range (YAML between opening and closing ---)\n  let frontmatterEnd = 0;\n  if (content.startsWith(\"---\")) {\n    const closingIdx = content.indexOf(\"\\n---\", 3);\n    if (closingIdx !== -1) {\n      frontmatterEnd = content.slice(0, closingIdx + 4).split(\"\\n\").length - 1;\n    }\n  }\n\n  // Regex for [[wikilinks]] and ![[embeds]]\n  const wikilinkRe = /(!?)\\[\\[([^\\]]+?)\\]\\]/g;\n\n  // Regex for markdown links [text](target) and embeds ![alt](target)\n  const mdLinkRe = /(!)?\\[([^\\]]*)\\]\\(([^)]+)\\)/g;\n\n  for (let lineIdx = 0; lineIdx < lines.length; lineIdx++) {\n    const line = lines[lineIdx]!;\n    const lineNumber = lineIdx + 1; // 1-indexed\n    const isFrontmatter = lineIdx < frontmatterEnd;\n\n    // --- Wikilinks ---\n    wikilinkRe.lastIndex = 0;\n    let match: RegExpExecArray | null;\n    while ((match = wikilinkRe.exec(line)) !== null) {\n      const isEmbed = match[1] === \"!\";\n      const inner = match[2]!;\n\n      // Split on first | for alias\n      const pipeIdx = inner.indexOf(\"|\");\n      const beforePipe = pipeIdx === -1 ? inner : inner.slice(0, pipeIdx);\n      const alias = pipeIdx === -1 ? null : inner.slice(pipeIdx + 1);\n\n      // Strip heading anchor (everything after #)\n      const hashIdx = beforePipe.indexOf(\"#\");\n      const raw = hashIdx === -1 ? beforePipe.trim() : beforePipe.slice(0, hashIdx).trim();\n\n      if (!raw) continue; // Skip links with empty targets (e.g. [[#Heading]])\n\n      links.push({\n        raw,\n        alias: alias?.trim() ?? null,\n        lineNumber,\n        isEmbed: isEmbed && !isFrontmatter,\n        isMdLink: false,\n      });\n    }\n\n    // --- Markdown links --- (skip inside frontmatter)\n    if (!isFrontmatter) {\n      mdLinkRe.lastIndex = 0;\n      while ((match = mdLinkRe.exec(line)) !== null) {\n        const isEmbed = match[1] === \"!\";\n        const displayText = match[2]!;\n        let target = match[3]!.trim();\n\n        // Skip external URLs\n        if (/^[a-z][a-z0-9+.-]*:/i.test(target)) continue;\n\n        // Skip pure anchor links (#heading)\n        if (target.startsWith(\"#\")) continue;\n\n        // Strip heading anchor from target\n        const hashIdx = target.indexOf(\"#\");\n        if (hashIdx !== -1) target = target.slice(0, hashIdx);\n\n        // URL-decode (Obsidian encodes spaces as %20 in md links)\n        try {\n          target = decodeURIComponent(target);\n        } catch {\n          // Malformed encoding — use as-is\n        }\n\n        // Strip .md extension for resolution (resolveWikilink adds it back)\n        const raw = target.replace(/\\.md$/i, \"\").trim();\n        if (!raw) continue;\n\n        links.push({\n          raw,\n          alias: displayText || null,\n          lineNumber,\n          isEmbed,\n          isMdLink: true,\n        });\n      }\n    }\n  }\n\n  return links;\n}\n\n/** @deprecated Use {@link parseLinks} instead. */\nexport const parseWikilinks = parseLinks;\n","/**\n * Name index builder for Obsidian wikilink resolution.\n */\n\nimport { basename } from \"node:path\";\nimport type { VaultFile } from \"./types.js\";\n\n/**\n * Build a name lookup index for Obsidian wikilink resolution.\n *\n * Maps lowercase filename (without .md extension) to all vault-relative paths\n * that share that name. Includes both canonical paths and alias paths so that\n * wikilinks resolve regardless of which path the file is accessed through.\n */\nexport function buildNameIndex(files: VaultFile[]): Map<string, string[]> {\n  const index = new Map<string, string[]>();\n\n  for (const file of files) {\n    const name = basename(file.vaultRelPath, \".md\").toLowerCase();\n    const existing = index.get(name);\n    if (existing) {\n      existing.push(file.vaultRelPath);\n    } else {\n      index.set(name, [file.vaultRelPath]);\n    }\n  }\n\n  return index;\n}\n","/**\n * Wikilink resolver using Obsidian's shortest-match algorithm.\n */\n\nimport { normalize, basename, dirname } from \"node:path\";\n\n/**\n * Resolve a wikilink target to a vault-relative path using Obsidian's rules.\n *\n * Resolution algorithm:\n *  1. If raw contains \"/\", attempt exact path match (with and without .md).\n *  2. Normalize: lowercase the raw target, strip .md extension.\n *  3. Look up in the name index (all files with that basename).\n *  4. If exactly one match, return it.\n *  5. If multiple matches, pick the one closest to the source file\n *     (longest common directory prefix, then shortest overall path).\n *  6. If no matches, return null (dead link).\n *\n * @param raw         The raw link target (heading-stripped, pipe-stripped).\n * @param nameIndex   Map from lowercase basename-without-ext to vault paths.\n * @param sourcePath  Vault-relative path of the file containing the link.\n * @returns           Vault-relative path of the resolved target, or null.\n */\nexport function resolveWikilink(\n  raw: string,\n  nameIndex: Map<string, string[]>,\n  sourcePath: string,\n): string | null {\n  if (!raw) return null;\n\n  // Case 1: path contains \"/\" — try exact match with and without .md\n  if (raw.includes(\"/\")) {\n    const normalized = normalize(raw);\n    const normalizedMd = normalized.endsWith(\".md\") ? normalized : normalized + \".md\";\n\n    // Check if any indexed path matches (case-insensitive for macOS compatibility)\n    for (const [, paths] of nameIndex) {\n      for (const p of paths) {\n        if (p === normalizedMd || p === normalized) return p;\n        if (p.toLowerCase() === normalizedMd.toLowerCase()) return p;\n      }\n    }\n    // Fall through to name lookup in case the path prefix was wrong\n  }\n\n  // Normalize the raw target for name lookup.\n  // Use the basename only — Obsidian resolves by filename, not full path.\n  const rawBase = basename(raw)\n    .replace(/\\.md$/i, \"\")\n    .toLowerCase()\n    .trim();\n\n  if (!rawBase) return null;\n\n  const candidates = nameIndex.get(rawBase);\n\n  if (!candidates || candidates.length === 0) {\n    return null; // Dead link\n  }\n\n  if (candidates.length === 1) {\n    return candidates[0]!;\n  }\n\n  // Multiple matches — pick the one closest to the source file\n  const sourceDir = dirname(sourcePath);\n\n  let bestPath: string | null = null;\n  let bestPrefixLen = -1;\n  let bestPathLen = Infinity;\n\n  for (const candidate of candidates) {\n    const candidateDir = dirname(candidate);\n    const prefixLen = commonPrefixLength(sourceDir, candidateDir);\n    const pathLen = candidate.length;\n\n    if (\n      prefixLen > bestPrefixLen ||\n      (prefixLen === bestPrefixLen && pathLen < bestPathLen)\n    ) {\n      bestPrefixLen = prefixLen;\n      bestPathLen = pathLen;\n      bestPath = candidate;\n    }\n  }\n\n  return bestPath;\n}\n\n/**\n * Compute the length of the common prefix between two directory paths,\n * measured in path segments (not raw characters).\n *\n * Example: \"a/b/c\" and \"a/b/d\" → 2 (common: \"a\", \"b\")\n */\nfunction commonPrefixLength(a: string, b: string): number {\n  if (a === \".\" && b === \".\") return 0;\n  const aParts = a === \".\" ? [] : a.split(\"/\");\n  const bParts = b === \".\" ? [] : b.split(\"/\");\n  let count = 0;\n  const len = Math.min(aParts.length, bParts.length);\n  for (let i = 0; i < len; i++) {\n    if (aParts[i] === bParts[i]) {\n      count++;\n    } else {\n      break;\n    }\n  }\n  return count;\n}\n","/**\n * Main vault indexing orchestrator.\n *\n * Indexes an entire Obsidian vault (or any markdown knowledge base), following\n * symlinks, deduplicating files by inode, parsing wikilinks, and computing\n * per-file health metrics (orphan detection, dead links).\n *\n * Key differences from the project indexer (indexer/sync.ts):\n *  - Follows symbolic links (project indexer skips them)\n *  - Deduplicates files with the same inode (same content reachable via multiple paths)\n *  - Parses [[wikilinks]] and builds a directed link graph\n *  - Resolves wikilinks using Obsidian's shortest-match algorithm\n *  - Computes health metrics per file: inbound/outbound link counts, dead links, orphans\n */\n\nimport { readFileSync } from \"node:fs\";\nimport { basename } from \"node:path\";\nimport type {\n  StorageBackend,\n  VaultFileRow,\n  VaultAliasRow,\n  VaultLinkRow,\n  VaultHealthRow,\n  VaultNameEntry,\n  ChunkRow,\n} from \"../../storage/interface.js\";\nimport { chunkMarkdown, fileContentHash } from \"../chunker.js\";\nimport { sha256File, chunkId, yieldToEventLoop } from \"../indexer/helpers.js\";\nimport { walkVaultMdFiles } from \"./walk.js\";\nimport { deduplicateByInode } from \"./deduplicate.js\";\nimport { parseLinks } from \"./parse-links.js\";\nimport { buildNameIndex } from \"./name-index.js\";\nimport { resolveWikilink } from \"./resolve.js\";\nimport type { VaultIndexResult } from \"./types.js\";\n\n/** Number of files to process before yielding to the event loop. */\nconst VAULT_YIELD_EVERY = 1;\n\n/**\n * Index an entire Obsidian vault (or markdown knowledge base) using the\n * async StorageBackend interface.\n *\n * Steps:\n *  1. Walk vault root, following symlinks.\n *  2. Deduplicate by inode — each unique file is indexed once.\n *  3. Build a name index for wikilink resolution.\n *  4. For each canonical file:\n *     a. SHA-256 hash for change detection — skip unchanged files.\n *     b. Read content, chunk with chunkMarkdown().\n *     c. Insert chunks into backend (memory_chunks and memory_fts).\n *     d. Upsert vault_files row.\n *  5. Record aliases in vault_aliases.\n *  6. Rebuild vault_name_index table.\n *  7. Rebuild vault_links:\n *     a. Parse [[wikilinks]] from each canonical file.\n *     b. Resolve each link with resolveWikilink().\n *     c. Insert into vault_links.\n *  8. Compute and upsert health metrics (vault_health).\n *  9. Return statistics.\n *\n * @param backend         StorageBackend to write to.\n * @param vaultProjectId  Registry project ID for the vault \"project\".\n * @param vaultRoot       Absolute path to the vault root directory.\n */\nexport async function indexVault(\n  backend: StorageBackend,\n  vaultProjectId: number,\n  vaultRoot: string,\n): Promise<VaultIndexResult> {\n  const startTime = Date.now();\n\n  const result: VaultIndexResult = {\n    filesIndexed: 0,\n    chunksCreated: 0,\n    filesSkipped: 0,\n    aliasesRecorded: 0,\n    linksExtracted: 0,\n    deadLinksFound: 0,\n    orphansFound: 0,\n    elapsed: 0,\n  };\n\n  // Step 1: Walk vault, collecting all .md files (follows symlinks)\n  const allFiles = walkVaultMdFiles(vaultRoot);\n\n  // Step 2: Deduplicate by inode\n  const inodeGroups = deduplicateByInode(allFiles);\n\n  // Step 3: Build name index (from all files including aliases, for resolution)\n  const nameIndex = buildNameIndex(allFiles);\n\n  // Step 4: Index each canonical file\n  await yieldToEventLoop();\n  let filesSinceYield = 0;\n\n  for (const group of inodeGroups) {\n    if (filesSinceYield >= VAULT_YIELD_EVERY) {\n      await yieldToEventLoop();\n      filesSinceYield = 0;\n    }\n    filesSinceYield++;\n\n    const { canonical } = group;\n\n    let content: string;\n    try {\n      content = readFileSync(canonical.absPath, \"utf8\");\n    } catch {\n      result.filesSkipped++;\n      continue;\n    }\n\n    const hash = fileContentHash(content);\n\n    // Change detection: skip if hash is unchanged\n    const existing = await backend.getVaultFile(canonical.vaultRelPath);\n    if (existing?.hash === hash) {\n      result.filesSkipped++;\n      continue;\n    }\n\n    // Delete old chunks for this vault path\n    await backend.deleteChunksForFile(vaultProjectId, canonical.vaultRelPath);\n\n    // Chunk the content\n    const chunks = chunkMarkdown(content);\n    const updatedAt = Date.now();\n\n    // Extract title from first H1 heading or filename\n    const titleMatch = /^#\\s+(.+)$/m.exec(content);\n    const title = titleMatch\n      ? titleMatch[1]!.trim()\n      : basename(canonical.vaultRelPath, \".md\");\n\n    // Build chunk rows\n    const chunkRows: ChunkRow[] = [];\n    for (let i = 0; i < chunks.length; i++) {\n      const chunk = chunks[i]!;\n      const id = chunkId(\n        vaultProjectId,\n        canonical.vaultRelPath,\n        i,\n        chunk.startLine,\n        chunk.endLine,\n      );\n      chunkRows.push({\n        id,\n        projectId: vaultProjectId,\n        source: \"vault\",\n        tier: \"topic\",\n        path: canonical.vaultRelPath,\n        startLine: chunk.startLine,\n        endLine: chunk.endLine,\n        hash: chunk.hash,\n        text: chunk.text,\n        updatedAt,\n      });\n    }\n\n    if (chunkRows.length > 0) {\n      await backend.insertChunks(chunkRows);\n    }\n\n    // Upsert vault file record\n    const vaultFileRow: VaultFileRow = {\n      vaultPath: canonical.vaultRelPath,\n      inode: canonical.inode,\n      device: canonical.device,\n      hash,\n      title,\n      indexedAt: updatedAt,\n    };\n    await backend.upsertVaultFile(vaultFileRow);\n\n    result.filesIndexed++;\n    result.chunksCreated += chunks.length;\n  }\n\n  // Step 5: Record aliases in vault_aliases\n  await yieldToEventLoop();\n\n  const allAliases: VaultAliasRow[] = [];\n  for (const group of inodeGroups) {\n    for (const alias of group.aliases) {\n      allAliases.push({\n        vaultPath: alias.vaultRelPath,\n        canonicalPath: group.canonical.vaultRelPath,\n        inode: alias.inode,\n        device: alias.device,\n      });\n      result.aliasesRecorded++;\n    }\n  }\n\n  const canonicalPaths = new Set(inodeGroups.map((g) => g.canonical.vaultRelPath));\n  for (const canonPath of canonicalPaths) {\n    await backend.deleteVaultAliases(canonPath);\n  }\n  if (allAliases.length > 0) {\n    await backend.upsertVaultAliases(allAliases);\n  }\n\n  // Step 6: Rebuild vault_name_index\n  await yieldToEventLoop();\n\n  const nameEntries: VaultNameEntry[] = [];\n  for (const [name, paths] of nameIndex) {\n    for (const path of paths) {\n      nameEntries.push({ name, vaultPath: path });\n    }\n  }\n  await backend.replaceNameIndex(nameEntries);\n\n  // Step 7: Rebuild vault_links\n  await yieldToEventLoop();\n\n  const linkRows: VaultLinkRow[] = [];\n  const allSourcePaths: string[] = [];\n\n  let linkParseYield = 0;\n  for (const group of inodeGroups) {\n    if (linkParseYield++ % VAULT_YIELD_EVERY === 0) {\n      await yieldToEventLoop();\n    }\n\n    const { canonical } = group;\n    allSourcePaths.push(canonical.vaultRelPath);\n\n    let content: string;\n    try {\n      content = readFileSync(canonical.absPath, \"utf8\");\n    } catch {\n      continue;\n    }\n\n    const parsedLinks = parseLinks(content);\n    for (const link of parsedLinks) {\n      const target = resolveWikilink(link.raw, nameIndex, canonical.vaultRelPath);\n      let linkType: string;\n      if (link.isMdLink) {\n        linkType = link.isEmbed ? \"md-embed\" : \"md-link\";\n      } else {\n        linkType = link.isEmbed ? \"embed\" : \"wikilink\";\n      }\n      linkRows.push({\n        sourcePath: canonical.vaultRelPath,\n        targetRaw: link.raw,\n        targetPath: target,\n        linkType,\n        lineNumber: link.lineNumber,\n        confidence: \"EXTRACTED\",\n      });\n    }\n  }\n\n  // Replace all links for all sources in batches of 500\n  const LINK_BATCH_SIZE = 500;\n  for (let i = 0; i < allSourcePaths.length; i += LINK_BATCH_SIZE) {\n    const batchSources = allSourcePaths.slice(i, i + LINK_BATCH_SIZE);\n    const batchLinks = linkRows.filter((r) => batchSources.includes(r.sourcePath));\n    await backend.replaceLinksForSources(batchSources, batchLinks);\n    await yieldToEventLoop();\n  }\n\n  result.linksExtracted = linkRows.length;\n  result.deadLinksFound = linkRows.filter((r) => r.targetPath === null).length;\n\n  // Step 8: Compute and upsert vault_health metrics\n  await yieldToEventLoop();\n\n  const outboundMap = new Map<string, number>();\n  const deadMap = new Map<string, number>();\n  const inboundMap = new Map<string, number>();\n\n  for (const row of linkRows) {\n    outboundMap.set(row.sourcePath, (outboundMap.get(row.sourcePath) ?? 0) + 1);\n    if (row.targetPath === null) {\n      deadMap.set(row.sourcePath, (deadMap.get(row.sourcePath) ?? 0) + 1);\n    } else {\n      inboundMap.set(row.targetPath, (inboundMap.get(row.targetPath) ?? 0) + 1);\n    }\n  }\n\n  const computedAt = Date.now();\n  let orphanCount = 0;\n\n  const HEALTH_BATCH_SIZE = 500;\n  for (let i = 0; i < inodeGroups.length; i += HEALTH_BATCH_SIZE) {\n    const batch = inodeGroups.slice(i, i + HEALTH_BATCH_SIZE);\n    const healthRows: VaultHealthRow[] = batch.map((group) => {\n      const path = group.canonical.vaultRelPath;\n      const inbound = inboundMap.get(path) ?? 0;\n      const outbound = outboundMap.get(path) ?? 0;\n      const dead = deadMap.get(path) ?? 0;\n      const isOrphan = inbound === 0;\n      if (isOrphan) orphanCount++;\n      return {\n        vaultPath: path,\n        inboundCount: inbound,\n        outboundCount: outbound,\n        deadLinkCount: dead,\n        isOrphan,\n        computedAt,\n      };\n    });\n    await backend.upsertVaultHealth(healthRows);\n    await yieldToEventLoop();\n  }\n\n  result.orphansFound = orphanCount;\n  result.elapsed = Date.now() - startTime;\n\n  return result;\n}\n"],"mappings":";;;;;;;;;;AASA,MAAM,kBAAkB;;AAGxB,MAAM,kBAAkB;;;;;AAMxB,MAAM,kBAAkB,IAAI,IAAI;CAE9B;CAEA;CACA;CACA;CAEA;CACA;CACA;CACA;CACA;CAEA;CACA;CACA;CAEA;CACA;CAEA;CACA;CACD,CAAC;;;;;;;;;;;;;;;AAgBF,SAAgB,iBACd,WACA,MACa;CACb,MAAM,WAAW,MAAM,YAAY;CACnC,MAAM,WAAW,MAAM,YAAY;CAEnC,MAAM,UAAuB,EAAE;CAC/B,MAAM,8BAAc,IAAI,KAAa;CAErC,SAAS,KAAK,KAAa,OAAqB;AAC9C,MAAI,QAAQ,UAAU,SAAU;AAChC,MAAI,QAAQ,SAAU;EAGtB,IAAI;AACJ,MAAI;AACF,aAAU,SAAS,IAAI;UACjB;AACN;;EAGF,MAAM,SAAS,GAAG,QAAQ,IAAI,GAAG,QAAQ;AACzC,MAAI,YAAY,IAAI,OAAO,CAAE;AAC7B,cAAY,IAAI,OAAO;EAEvB,IAAI;AACJ,MAAI;AACF,aAAU,YAAY,KAAK;IAAE,eAAe;IAAM,UAAU;IAAQ,CAAC;UAC/D;AACN;;AAGF,OAAK,MAAM,SAAS,SAAS;AAC3B,OAAI,QAAQ,UAAU,SAAU;AAChC,OAAI,gBAAgB,IAAI,MAAM,KAAK,CAAE;GAErC,MAAM,OAAO,KAAK,KAAK,MAAM,KAAK;AAElC,OAAI,MAAM,gBAAgB,EAAE;IAE1B,IAAI;AACJ,QAAI;AACF,kBAAa,SAAS,KAAK;YACrB;AACN;;AAGF,QAAI,WAAW,aAAa,EAC1B;SAAI,CAAC,gBAAgB,IAAI,MAAM,KAAK,CAClC,MAAK,MAAM,QAAQ,EAAE;eAEd,WAAW,QAAQ,IAAI,MAAM,KAAK,SAAS,MAAM,CAC1D,SAAQ,KAAK;KACX,SAAS;KACT,cAAc,SAAS,WAAW,KAAK;KACvC,OAAO,WAAW;KAClB,QAAQ,WAAW;KACpB,CAAC;cAEK,MAAM,aAAa,CAC5B,MAAK,MAAM,QAAQ,EAAE;YACZ,MAAM,QAAQ,IAAI,MAAM,KAAK,SAAS,MAAM,EAAE;IACvD,IAAI;AACJ,QAAI;AACF,gBAAW,SAAS,KAAK;YACnB;AACN;;AAEF,YAAQ,KAAK;KACX,SAAS;KACT,cAAc,SAAS,WAAW,KAAK;KACvC,OAAO,SAAS;KAChB,QAAQ,SAAS;KAClB,CAAC;;;;AAKR,KAAI,WAAW,UAAU,CACvB,MAAK,WAAW,EAAE;AAGpB,QAAO;;;;;;;;;;;;AC/HT,SAAgB,mBAAmB,OAAkC;CACnE,MAAM,yBAAS,IAAI,KAA0B;AAE7C,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,MAAM,GAAG,KAAK,OAAO,GAAG,KAAK;EACnC,MAAM,WAAW,OAAO,IAAI,IAAI;AAChC,MAAI,SACF,UAAS,KAAK,KAAK;MAEnB,QAAO,IAAI,KAAK,CAAC,KAAK,CAAC;;CAI3B,MAAM,SAAuB,EAAE;AAE/B,MAAK,MAAM,SAAS,OAAO,QAAQ,EAAE;AACnC,MAAI,MAAM,WAAW,EAAG;EAUxB,MAAM,CAAC,WAAW,GAAG,WAPN,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,MAAM;GACvC,MAAM,UAAU,EAAE,aAAa,MAAM,MAAM,IAAI,EAAE,EAAE;GACnD,MAAM,UAAU,EAAE,aAAa,MAAM,MAAM,IAAI,EAAE,EAAE;AACnD,OAAI,WAAW,OAAQ,QAAO,SAAS;AACvC,UAAO,EAAE,aAAa,SAAS,EAAE,aAAa;IAC9C;AAGF,SAAO,KAAK;GAAE;GAAW;GAAS,CAAC;;AAGrC,QAAO;;;;;;;;;;;;;;;;;;;;;;;AChBT,SAAgB,WAAW,SAA+B;CACxD,MAAM,QAAsB,EAAE;CAC9B,MAAM,QAAQ,QAAQ,MAAM,KAAK;CAGjC,IAAI,iBAAiB;AACrB,KAAI,QAAQ,WAAW,MAAM,EAAE;EAC7B,MAAM,aAAa,QAAQ,QAAQ,SAAS,EAAE;AAC9C,MAAI,eAAe,GACjB,kBAAiB,QAAQ,MAAM,GAAG,aAAa,EAAE,CAAC,MAAM,KAAK,CAAC,SAAS;;CAK3E,MAAM,aAAa;CAGnB,MAAM,WAAW;AAEjB,MAAK,IAAI,UAAU,GAAG,UAAU,MAAM,QAAQ,WAAW;EACvD,MAAM,OAAO,MAAM;EACnB,MAAM,aAAa,UAAU;EAC7B,MAAM,gBAAgB,UAAU;AAGhC,aAAW,YAAY;EACvB,IAAI;AACJ,UAAQ,QAAQ,WAAW,KAAK,KAAK,MAAM,MAAM;GAC/C,MAAM,UAAU,MAAM,OAAO;GAC7B,MAAM,QAAQ,MAAM;GAGpB,MAAM,UAAU,MAAM,QAAQ,IAAI;GAClC,MAAM,aAAa,YAAY,KAAK,QAAQ,MAAM,MAAM,GAAG,QAAQ;GACnE,MAAM,QAAQ,YAAY,KAAK,OAAO,MAAM,MAAM,UAAU,EAAE;GAG9D,MAAM,UAAU,WAAW,QAAQ,IAAI;GACvC,MAAM,MAAM,YAAY,KAAK,WAAW,MAAM,GAAG,WAAW,MAAM,GAAG,QAAQ,CAAC,MAAM;AAEpF,OAAI,CAAC,IAAK;AAEV,SAAM,KAAK;IACT;IACA,OAAO,OAAO,MAAM,IAAI;IACxB;IACA,SAAS,WAAW,CAAC;IACrB,UAAU;IACX,CAAC;;AAIJ,MAAI,CAAC,eAAe;AAClB,YAAS,YAAY;AACrB,WAAQ,QAAQ,SAAS,KAAK,KAAK,MAAM,MAAM;IAC7C,MAAM,UAAU,MAAM,OAAO;IAC7B,MAAM,cAAc,MAAM;IAC1B,IAAI,SAAS,MAAM,GAAI,MAAM;AAG7B,QAAI,uBAAuB,KAAK,OAAO,CAAE;AAGzC,QAAI,OAAO,WAAW,IAAI,CAAE;IAG5B,MAAM,UAAU,OAAO,QAAQ,IAAI;AACnC,QAAI,YAAY,GAAI,UAAS,OAAO,MAAM,GAAG,QAAQ;AAGrD,QAAI;AACF,cAAS,mBAAmB,OAAO;YAC7B;IAKR,MAAM,MAAM,OAAO,QAAQ,UAAU,GAAG,CAAC,MAAM;AAC/C,QAAI,CAAC,IAAK;AAEV,UAAM,KAAK;KACT;KACA,OAAO,eAAe;KACtB;KACA;KACA,UAAU;KACX,CAAC;;;;AAKR,QAAO;;;;;;;;;;;;;;;ACxGT,SAAgB,eAAe,OAA2C;CACxE,MAAM,wBAAQ,IAAI,KAAuB;AAEzC,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,OAAO,SAAS,KAAK,cAAc,MAAM,CAAC,aAAa;EAC7D,MAAM,WAAW,MAAM,IAAI,KAAK;AAChC,MAAI,SACF,UAAS,KAAK,KAAK,aAAa;MAEhC,OAAM,IAAI,MAAM,CAAC,KAAK,aAAa,CAAC;;AAIxC,QAAO;;;;;;;;;;;;;;;;;;;;;;;;;ACJT,SAAgB,gBACd,KACA,WACA,YACe;AACf,KAAI,CAAC,IAAK,QAAO;AAGjB,KAAI,IAAI,SAAS,IAAI,EAAE;EACrB,MAAM,aAAa,UAAU,IAAI;EACjC,MAAM,eAAe,WAAW,SAAS,MAAM,GAAG,aAAa,aAAa;AAG5E,OAAK,MAAM,GAAG,UAAU,UACtB,MAAK,MAAM,KAAK,OAAO;AACrB,OAAI,MAAM,gBAAgB,MAAM,WAAY,QAAO;AACnD,OAAI,EAAE,aAAa,KAAK,aAAa,aAAa,CAAE,QAAO;;;CAQjE,MAAM,UAAU,SAAS,IAAI,CAC1B,QAAQ,UAAU,GAAG,CACrB,aAAa,CACb,MAAM;AAET,KAAI,CAAC,QAAS,QAAO;CAErB,MAAM,aAAa,UAAU,IAAI,QAAQ;AAEzC,KAAI,CAAC,cAAc,WAAW,WAAW,EACvC,QAAO;AAGT,KAAI,WAAW,WAAW,EACxB,QAAO,WAAW;CAIpB,MAAM,YAAY,QAAQ,WAAW;CAErC,IAAI,WAA0B;CAC9B,IAAI,gBAAgB;CACpB,IAAI,cAAc;AAElB,MAAK,MAAM,aAAa,YAAY;EAElC,MAAM,YAAY,mBAAmB,WADhB,QAAQ,UAAU,CACsB;EAC7D,MAAM,UAAU,UAAU;AAE1B,MACE,YAAY,iBACX,cAAc,iBAAiB,UAAU,aAC1C;AACA,mBAAgB;AAChB,iBAAc;AACd,cAAW;;;AAIf,QAAO;;;;;;;;AAST,SAAS,mBAAmB,GAAW,GAAmB;AACxD,KAAI,MAAM,OAAO,MAAM,IAAK,QAAO;CACnC,MAAM,SAAS,MAAM,MAAM,EAAE,GAAG,EAAE,MAAM,IAAI;CAC5C,MAAM,SAAS,MAAM,MAAM,EAAE,GAAG,EAAE,MAAM,IAAI;CAC5C,IAAI,QAAQ;CACZ,MAAM,MAAM,KAAK,IAAI,OAAO,QAAQ,OAAO,OAAO;AAClD,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,OAAO,OAAO,OAAO,GACvB;KAEA;AAGJ,QAAO;;;;;;;;;;;;;;;;;;;;ACxET,MAAM,oBAAoB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4B1B,eAAsB,WACpB,SACA,gBACA,WAC2B;CAC3B,MAAM,YAAY,KAAK,KAAK;CAE5B,MAAM,SAA2B;EAC/B,cAAc;EACd,eAAe;EACf,cAAc;EACd,iBAAiB;EACjB,gBAAgB;EAChB,gBAAgB;EAChB,cAAc;EACd,SAAS;EACV;CAGD,MAAM,WAAW,iBAAiB,UAAU;CAG5C,MAAM,cAAc,mBAAmB,SAAS;CAGhD,MAAM,YAAY,eAAe,SAAS;AAG1C,OAAM,kBAAkB;CACxB,IAAI,kBAAkB;AAEtB,MAAK,MAAM,SAAS,aAAa;AAC/B,MAAI,mBAAmB,mBAAmB;AACxC,SAAM,kBAAkB;AACxB,qBAAkB;;AAEpB;EAEA,MAAM,EAAE,cAAc;EAEtB,IAAI;AACJ,MAAI;AACF,aAAU,aAAa,UAAU,SAAS,OAAO;UAC3C;AACN,UAAO;AACP;;EAGF,MAAM,OAAO,gBAAgB,QAAQ;AAIrC,OADiB,MAAM,QAAQ,aAAa,UAAU,aAAa,GACrD,SAAS,MAAM;AAC3B,UAAO;AACP;;AAIF,QAAM,QAAQ,oBAAoB,gBAAgB,UAAU,aAAa;EAGzE,MAAM,SAAS,cAAc,QAAQ;EACrC,MAAM,YAAY,KAAK,KAAK;EAG5B,MAAM,aAAa,cAAc,KAAK,QAAQ;EAC9C,MAAM,QAAQ,aACV,WAAW,GAAI,MAAM,GACrB,SAAS,UAAU,cAAc,MAAM;EAG3C,MAAM,YAAwB,EAAE;AAChC,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;GACtC,MAAM,QAAQ,OAAO;GACrB,MAAM,KAAK,QACT,gBACA,UAAU,cACV,GACA,MAAM,WACN,MAAM,QACP;AACD,aAAU,KAAK;IACb;IACA,WAAW;IACX,QAAQ;IACR,MAAM;IACN,MAAM,UAAU;IAChB,WAAW,MAAM;IACjB,SAAS,MAAM;IACf,MAAM,MAAM;IACZ,MAAM,MAAM;IACZ;IACD,CAAC;;AAGJ,MAAI,UAAU,SAAS,EACrB,OAAM,QAAQ,aAAa,UAAU;EAIvC,MAAM,eAA6B;GACjC,WAAW,UAAU;GACrB,OAAO,UAAU;GACjB,QAAQ,UAAU;GAClB;GACA;GACA,WAAW;GACZ;AACD,QAAM,QAAQ,gBAAgB,aAAa;AAE3C,SAAO;AACP,SAAO,iBAAiB,OAAO;;AAIjC,OAAM,kBAAkB;CAExB,MAAM,aAA8B,EAAE;AACtC,MAAK,MAAM,SAAS,YAClB,MAAK,MAAM,SAAS,MAAM,SAAS;AACjC,aAAW,KAAK;GACd,WAAW,MAAM;GACjB,eAAe,MAAM,UAAU;GAC/B,OAAO,MAAM;GACb,QAAQ,MAAM;GACf,CAAC;AACF,SAAO;;CAIX,MAAM,iBAAiB,IAAI,IAAI,YAAY,KAAK,MAAM,EAAE,UAAU,aAAa,CAAC;AAChF,MAAK,MAAM,aAAa,eACtB,OAAM,QAAQ,mBAAmB,UAAU;AAE7C,KAAI,WAAW,SAAS,EACtB,OAAM,QAAQ,mBAAmB,WAAW;AAI9C,OAAM,kBAAkB;CAExB,MAAM,cAAgC,EAAE;AACxC,MAAK,MAAM,CAAC,MAAM,UAAU,UAC1B,MAAK,MAAM,QAAQ,MACjB,aAAY,KAAK;EAAE;EAAM,WAAW;EAAM,CAAC;AAG/C,OAAM,QAAQ,iBAAiB,YAAY;AAG3C,OAAM,kBAAkB;CAExB,MAAM,WAA2B,EAAE;CACnC,MAAM,iBAA2B,EAAE;CAEnC,IAAI,iBAAiB;AACrB,MAAK,MAAM,SAAS,aAAa;AAC/B,MAAI,mBAAmB,sBAAsB,EAC3C,OAAM,kBAAkB;EAG1B,MAAM,EAAE,cAAc;AACtB,iBAAe,KAAK,UAAU,aAAa;EAE3C,IAAI;AACJ,MAAI;AACF,aAAU,aAAa,UAAU,SAAS,OAAO;UAC3C;AACN;;EAGF,MAAM,cAAc,WAAW,QAAQ;AACvC,OAAK,MAAM,QAAQ,aAAa;GAC9B,MAAM,SAAS,gBAAgB,KAAK,KAAK,WAAW,UAAU,aAAa;GAC3E,IAAI;AACJ,OAAI,KAAK,SACP,YAAW,KAAK,UAAU,aAAa;OAEvC,YAAW,KAAK,UAAU,UAAU;AAEtC,YAAS,KAAK;IACZ,YAAY,UAAU;IACtB,WAAW,KAAK;IAChB,YAAY;IACZ;IACA,YAAY,KAAK;IACjB,YAAY;IACb,CAAC;;;CAKN,MAAM,kBAAkB;AACxB,MAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK,iBAAiB;EAC/D,MAAM,eAAe,eAAe,MAAM,GAAG,IAAI,gBAAgB;EACjE,MAAM,aAAa,SAAS,QAAQ,MAAM,aAAa,SAAS,EAAE,WAAW,CAAC;AAC9E,QAAM,QAAQ,uBAAuB,cAAc,WAAW;AAC9D,QAAM,kBAAkB;;AAG1B,QAAO,iBAAiB,SAAS;AACjC,QAAO,iBAAiB,SAAS,QAAQ,MAAM,EAAE,eAAe,KAAK,CAAC;AAGtE,OAAM,kBAAkB;CAExB,MAAM,8BAAc,IAAI,KAAqB;CAC7C,MAAM,0BAAU,IAAI,KAAqB;CACzC,MAAM,6BAAa,IAAI,KAAqB;AAE5C,MAAK,MAAM,OAAO,UAAU;AAC1B,cAAY,IAAI,IAAI,aAAa,YAAY,IAAI,IAAI,WAAW,IAAI,KAAK,EAAE;AAC3E,MAAI,IAAI,eAAe,KACrB,SAAQ,IAAI,IAAI,aAAa,QAAQ,IAAI,IAAI,WAAW,IAAI,KAAK,EAAE;MAEnE,YAAW,IAAI,IAAI,aAAa,WAAW,IAAI,IAAI,WAAW,IAAI,KAAK,EAAE;;CAI7E,MAAM,aAAa,KAAK,KAAK;CAC7B,IAAI,cAAc;CAElB,MAAM,oBAAoB;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,YAAY,QAAQ,KAAK,mBAAmB;EAE9D,MAAM,aADQ,YAAY,MAAM,GAAG,IAAI,kBAAkB,CACd,KAAK,UAAU;GACxD,MAAM,OAAO,MAAM,UAAU;GAC7B,MAAM,UAAU,WAAW,IAAI,KAAK,IAAI;GACxC,MAAM,WAAW,YAAY,IAAI,KAAK,IAAI;GAC1C,MAAM,OAAO,QAAQ,IAAI,KAAK,IAAI;GAClC,MAAM,WAAW,YAAY;AAC7B,OAAI,SAAU;AACd,UAAO;IACL,WAAW;IACX,cAAc;IACd,eAAe;IACf,eAAe;IACf;IACA;IACD;IACD;AACF,QAAM,QAAQ,kBAAkB,WAAW;AAC3C,QAAM,kBAAkB;;AAG1B,QAAO,eAAe;AACtB,QAAO,UAAU,KAAK,KAAK,GAAG;AAE9B,QAAO"}

package/dist/{wakeup-DO1O4udw.mjs → wakeup-CZw88uXf.mjs}

@@ -1,5 +1,5 @@
-import { i as getRegistryBackend } from "./factory-BozZa81q.mjs";
-import { a as paiHomePath, r as migratePaiFile } from "./pai-home-CeOIYltV.mjs";
+import { i as getRegistryBackend } from "./factory-y36qGegI.mjs";
+import { a as paiHomePath, r as migratePaiFile } from "./pai-home-Cm9rcJgX.mjs";
 import { existsSync, readFileSync, readdirSync, statSync } from "node:fs";
 import { homedir } from "node:os";
 import { basename, join, resolve } from "node:path";
@@ -332,4 +332,4 @@ function buildWakeupContext(rootPath, tokenBudget = L1_TOKEN_BUDGET, opts = {})
 
 //#endregion
 export { formatDetectionJson as a, formatDetection as i, migrateIdentityFile as n, detectProject as r, buildWakeupContext as t };
-//# sourceMappingURL=wakeup-DO1O4udw.mjs.map
+//# sourceMappingURL=wakeup-CZw88uXf.mjs.map

package/dist/{wakeup-DO1O4udw.mjs.map → wakeup-CZw88uXf.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"wakeup-DO1O4udw.mjs","names":[],"sources":["../src/cli/commands/detect.ts","../src/memory/wakeup.ts"],"sourcesContent":["/**\n * Project detection logic for PAI.\n *\n * detectProject(cwd) — given a filesystem path, returns the best matching\n * project from the registry:\n *   1. Exact path match\n *   2. Longest parent match (project whose root_path is an ancestor of cwd)\n *\n * Exported for use by the CLI `pai project detect` command and the MCP\n * `project_detect` tool.\n */\n\nimport { resolve } from \"node:path\";\nimport { getRegistryBackend } from \"../../storage/factory.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface DetectedProject {\n  id: number;\n  slug: string;\n  display_name: string;\n  root_path: string;\n  encoded_dir: string;\n  type: string;\n  status: string;\n  session_count: number;\n  last_session_date: string | null;\n  match_type: \"exact\" | \"parent\";\n  /** Only set when match_type is 'parent' — the portion of cwd below root_path */\n  relative_path: string | null;\n}\n\n// ---------------------------------------------------------------------------\n// Core detection function\n// ---------------------------------------------------------------------------\n\n/**\n * Detect which registered project a filesystem path belongs to.\n *\n * @param cwd  Absolute path to detect (defaults to process.cwd())\n * @returns    The best matching project, or null if no match\n */\nexport async function detectProject(cwd?: string): Promise<DetectedProject | null> {\n  const target = resolve(cwd ?? process.cwd());\n  const backend = await getRegistryBackend();\n\n  // Load all active projects ordered by root_path length descending\n  // so the longest (most specific) match wins in a linear scan.\n  const projects = await backend.listProjectsByPathLengthDesc({ excludeArchived: true });\n\n  let matched: (typeof projects)[number] | null = null;\n  let matchType: \"exact\" | \"parent\" = \"exact\";\n\n  for (const p of projects) {\n    const root = resolve(p.root_path);\n    if (target === root) {\n      matched = p;\n      matchType = \"exact\";\n      break;\n    }\n    if (!matched && target.startsWith(root + \"/\")) {\n      matched = p;\n      matchType = \"parent\";\n      // Keep scanning — a longer root_path match might exist (but shouldn't\n      // since we sorted by length desc). Safety break anyway once found.\n      break;\n    }\n  }\n\n  if (!matched) return null;\n\n  // Enrich with session stats\n  const sessionCount = await backend.countSessionsForProject(matched.id);\n  const lastDate = await backend.getMostRecentSessionDate(matched.id);\n\n  const relative =\n    matchType === \"parent\"\n      ? target.slice(resolve(matched.root_path).length + 1)\n      : null;\n\n  return {\n    id: matched.id,\n    slug: matched.slug,\n    display_name: matched.display_name,\n    root_path: matched.root_path,\n    encoded_dir: matched.encoded_dir,\n    type: matched.type,\n    status: matched.status,\n    session_count: sessionCount,\n    last_session_date: lastDate,\n    match_type: matchType,\n    relative_path: relative,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Format helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Format a DetectedProject for human-readable CLI output.\n */\nexport function formatDetection(d: DetectedProject): string {\n  const lines: string[] = [\n    `slug:         ${d.slug}`,\n    `display_name: ${d.display_name}`,\n    `root_path:    ${d.root_path}`,\n    `type:         ${d.type}`,\n    `status:       ${d.status}`,\n    `match:        ${d.match_type}${d.relative_path ? ` (+${d.relative_path})` : \"\"}`,\n    `sessions:     ${d.session_count}`,\n  ];\n  if (d.last_session_date) {\n    lines.push(`last_session: ${d.last_session_date}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/**\n * Format a DetectedProject as JSON for machine consumption.\n */\nexport function formatDetectionJson(d: DetectedProject): string {\n  return JSON.stringify(\n    {\n      slug: d.slug,\n      display_name: d.display_name,\n      root_path: d.root_path,\n      encoded_dir: d.encoded_dir,\n      type: d.type,\n      status: d.status,\n      match_type: d.match_type,\n      relative_path: d.relative_path,\n      session_count: d.session_count,\n      last_session_date: d.last_session_date,\n    },\n    null,\n    2\n  );\n}\n","/**\n * Wake-up context system — progressive context loading inspired by mempalace.\n *\n * Layers:\n *   L0 Identity     (~100 tokens)   — user identity from ~/.pai/identity.txt. Always loaded.\n *   L1 Essential Story (~500-800t)  — top session notes for the project, key lines extracted.\n *   L2 On-Demand                    — triggered by topic queries (handled by memory_search).\n *   L3 Deep Search                  — unlimited federated memory search (memory_search tool).\n */\n\nimport { existsSync, readdirSync, readFileSync, statSync } from \"node:fs\";\nimport { join, basename } from \"node:path\";\nimport { homedir } from \"node:os\";\nimport { paiHomePath, migratePaiFile, type MigrateFileResult } from \"../config/pai-home.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\n/** Maximum tokens for the L1 essential story block. Approx 4 chars/token.\n * Measured 2026-09-20: 800 tokens was mostly stale bullets. Reduced to 300.\n */\nconst L1_TOKEN_BUDGET = 300;\nconst L1_CHAR_BUDGET = L1_TOKEN_BUDGET * 4; // ~1600 chars\n\n/** Maximum session notes to scan when building L1. Reduced from 10 to 3 (2026-09-20). */\nconst L1_MAX_NOTES = 3;\n\n/** Sections to extract from session notes (in priority order). */\nconst EXTRACT_SECTIONS = [\n  \"Work Done\",\n  \"Key Decisions\",\n  \"Next Steps\",\n  \"Checkpoint\",\n];\n\n/** Identity file location. */\nconst IDENTITY_FILE = join(homedir(), \".pai\", \"identity.txt\");\n\n// ---------------------------------------------------------------------------\n// L0: Identity\n// ---------------------------------------------------------------------------\n\n/**\n * Load L0 identity. Prefers the PAI_HOME location (identity.txt migrated by\n * `pai config migrate`), falling back to the legacy ~/.pai/identity.txt so a\n * not-yet-migrated file keeps working. Returns \"\" if neither exists. Never\n * throws.\n */\nexport function loadL0Identity(\n  opts: { newPath?: string; legacyPath?: string } = {}\n): string {\n  const newPath = opts.newPath ?? paiHomePath(\"identity.txt\");\n  const legacyPath = opts.legacyPath ?? IDENTITY_FILE;\n  const path = existsSync(newPath) ? newPath : legacyPath;\n  if (!existsSync(path)) return \"\";\n  try {\n    return readFileSync(path, \"utf-8\").trim();\n  } catch {\n    return \"\";\n  }\n}\n\n/**\n * Move ~/.pai/identity.txt into PAI_HOME, following the same copy /\n * verify-byte-identical / rename-aside semantics as every other per-user\n * file (see migratePaiFile). `from`/`to` are overridable for tests.\n */\nexport function migrateIdentityFile(\n  opts: { dryRun?: boolean; from?: string; to?: string } = {}\n): MigrateFileResult {\n  const toPath = opts.to ?? paiHomePath(\"identity.txt\");\n  const fromPath = opts.from ?? IDENTITY_FILE;\n  return migratePaiFile(toPath, [fromPath], { dryRun: opts.dryRun });\n}\n\n// ---------------------------------------------------------------------------\n// L1: Essential Story\n// ---------------------------------------------------------------------------\n\n/**\n * Find the Notes directory for a project given its root_path from the registry.\n * Checks local Notes/ first, then central ~/.claude/projects/... path.\n */\nfunction findNotesDirForProject(rootPath: string): string | null {\n  // Check local Notes directories first\n  const localCandidates = [\n    join(rootPath, \"Notes\"),\n    join(rootPath, \"notes\"),\n    join(rootPath, \".claude\", \"Notes\"),\n  ];\n  for (const p of localCandidates) {\n    if (existsSync(p)) return p;\n  }\n\n  // Fall back to central ~/.claude/projects/{encoded}/Notes\n  const encoded = rootPath\n    .replace(/\\//g, \"-\")\n    .replace(/\\./g, \"-\")\n    .replace(/ /g, \"-\");\n  const centralNotes = join(\n    homedir(),\n    \".claude\",\n    \"projects\",\n    encoded,\n    \"Notes\"\n  );\n  if (existsSync(centralNotes)) return centralNotes;\n\n  return null;\n}\n\n/**\n * Recursively find all .md session note files in a Notes directory.\n * Handles both flat layout (Notes/*.md) and month-subdirectory layout\n * (Notes/YYYY/MM/*.md). Returns files sorted newest-first by filename\n * (note numbers are monotonically increasing, so lexicographic = newest-last,\n * so we reverse).\n */\nfunction findSessionNotes(notesDir: string): string[] {\n  const result: string[] = [];\n\n  const scanDir = (dir: string) => {\n    if (!existsSync(dir)) return;\n    let entries: Array<{ name: string; isDir: boolean }>;\n    try {\n      entries = readdirSync(dir, { withFileTypes: true })\n        .map((e) => ({ name: e.name, isDir: e.isDirectory() }));\n    } catch {\n      return;\n    }\n\n    for (const entry of entries) {\n      const fullPath = join(dir, entry.name);\n      if (entry.isDir) {\n        // Recurse into YYYY/MM subdirectories\n        scanDir(fullPath);\n      } else if (entry.name.match(/^\\d{3,4}[\\s_-].*\\.md$/)) {\n        result.push(fullPath);\n      }\n    }\n  };\n\n  scanDir(notesDir);\n\n  // Sort newest-first by the DATE in the filename, not the note number.\n  //\n  // The note number is only monotonic within one uninterrupted numbering run.\n  // It restarts — per month directory, and after a registry merge renumbers a\n  // project — so \"highest number\" and \"most recent\" diverge. Observed live:\n  // `0184 - 2026-02-22` outranked `0008 - 2026-08-01`, and the wake-up context\n  // handed a resumed session five-month-old material as its recent history.\n  //\n  // `NNNN - YYYY-MM-DD - Title.md` is the enforced layout, so the date is the\n  // reliable key. Number breaks ties within a day; mtime is the last resort\n  // for notes that predate the naming convention.\n  const dateOf = (p: string): string =>\n    basename(p).match(/(\\d{4}-\\d{2}-\\d{2})/)?.[1] ?? \"\";\n  const numberOf = (p: string): number =>\n    parseInt(basename(p).match(/^(\\d+)/)?.[1] ?? \"0\", 10);\n  const mtimeOf = (p: string): number => {\n    try {\n      return statSync(p).mtimeMs;\n    } catch {\n      return 0;\n    }\n  };\n\n  result.sort((a, b) => {\n    const dateA = dateOf(a);\n    const dateB = dateOf(b);\n    // Undated notes sort last rather than winning on an empty string.\n    if (dateA !== dateB) {\n      if (!dateA) return 1;\n      if (!dateB) return -1;\n      return dateB.localeCompare(dateA);\n    }\n    const byNumber = numberOf(b) - numberOf(a);\n    if (byNumber !== 0) return byNumber;\n    return mtimeOf(b) - mtimeOf(a);\n  });\n\n  return result;\n}\n\n/**\n * Extract the most important lines from a session note.\n * Prioritises: Work Done items, Key Decisions, Next Steps, Checkpoint headings.\n * Returns a condensed string under maxChars.\n */\nfunction normalizeLine(line: string): string {\n  return line\n    .replace(/^(- \\[[ x]\\] |- |\\* |\\d+\\.\\s)/, \"\")\n    .trim()\n    .replace(/\\s+/g, \" \");\n}\n\nfunction extractKeyLines(\n  content: string,\n  maxChars: number,\n  seen: Set<string> = new Set(),\n  seenLabels: Set<string> = new Set()\n): string {\n  const lines = content.split(\"\\n\");\n  const selected: string[] = [];\n  let inTargetSection = false;\n  let currentSection = \"\";\n  let charCount = 0;\n  // Heading text seen since the last line was emitted. Buffered rather than\n  // pushed immediately: a heading with no surviving lines under it (every\n  // line deduped against an earlier note) must not appear at all.\n  let pendingLabel: string | null = null;\n\n  // First pass: collect lines from priority sections\n  for (const line of lines) {\n    // Detect section headers\n    const h2Match = line.match(/^## (.+)$/);\n    const h3Match = line.match(/^### (.+)$/);\n    if (h2Match) {\n      currentSection = h2Match[1];\n      inTargetSection = EXTRACT_SECTIONS.some((s) =>\n        currentSection.toLowerCase().includes(s.toLowerCase())\n      );\n      pendingLabel = null;\n      continue;\n    }\n    if (h3Match) {\n      // Checkpoints / sub-sections — buffer as a candidate label.\n      if (inTargetSection) {\n        pendingLabel = h3Match[1];\n      }\n      continue;\n    }\n\n    if (!inTargetSection) continue;\n\n    // Skip blank lines and HTML comments\n    const trimmed = line.trim();\n    if (!trimmed || trimmed.startsWith(\"<!--\") || trimmed === \"---\") continue;\n\n    // Include checkbox items, bold text, and plain text lines\n    if (\n      trimmed.startsWith(\"- \") ||\n      trimmed.startsWith(\"* \") ||\n      trimmed.match(/^\\d+\\./) ||\n      trimmed.startsWith(\"**\")\n    ) {\n      const normalized = normalizeLine(trimmed);\n      if (seen.has(normalized)) continue;\n\n      let labelText = \"\";\n      let labelKey = \"\";\n      if (pendingLabel !== null) {\n        labelKey = pendingLabel.toLowerCase().trim();\n        if (!seenLabels.has(labelKey)) {\n          labelText = `[${pendingLabel}]`;\n        }\n      }\n\n      if (charCount + labelText.length + trimmed.length + 2 > maxChars) break;\n\n      if (labelText) {\n        selected.push(labelText);\n        seenLabels.add(labelKey);\n        charCount += labelText.length + 1;\n      }\n      pendingLabel = null;\n\n      seen.add(normalized);\n      selected.push(trimmed);\n      charCount += trimmed.length + 1;\n    }\n  }\n\n  return selected.join(\"\\n\");\n}\n\n/**\n * Build the L1 essential story block.\n *\n * Reads the most recent session notes for the project and extracts the key\n * lines (Work Done, Key Decisions, Next Steps) within the token budget.\n *\n * @param rootPath   The project root path (from the registry).\n * @param tokenBudget  Max tokens to consume. Default 800 (~3200 chars).\n * @returns Formatted L1 block, or empty string if no notes found.\n */\nexport function buildL1EssentialStory(\n  rootPath: string,\n  tokenBudget = L1_TOKEN_BUDGET\n): string {\n  const charBudget = tokenBudget * 4;\n  const notesDir = findNotesDirForProject(rootPath);\n  if (!notesDir) return \"\";\n\n  const noteFiles = findSessionNotes(notesDir).slice(0, L1_MAX_NOTES);\n  if (noteFiles.length === 0) return \"\";\n\n  const sections: string[] = [];\n  const seen = new Set<string>();\n  const seenLabels = new Set<string>();\n  let remaining = charBudget;\n\n  for (const noteFile of noteFiles) {\n    if (remaining <= 50) break;\n\n    let content: string;\n    try {\n      content = readFileSync(noteFile, \"utf-8\");\n    } catch {\n      continue;\n    }\n\n    // Extract the note date and title from the filename\n    const name = basename(noteFile);\n    const titleMatch = name.match(/^\\d+ - (\\d{4}-\\d{2}-\\d{2}) - (.+)\\.md$/);\n    const dateLabel = titleMatch ? titleMatch[1] : \"\";\n    const titleLabel = titleMatch\n      ? titleMatch[2]\n      : name.replace(/^\\d+ - /, \"\").replace(/\\.md$/, \"\");\n\n    // Skip if nothing useful extracted from this note\n    const perNoteChars = Math.min(remaining, Math.floor(charBudget / noteFiles.length) + 200);\n    const extracted = extractKeyLines(content, perNoteChars, seen, seenLabels);\n    // A note whose every extracted line survived only as a label (all its\n    // real lines deduped against an earlier, newer note) contributes nothing\n    // — including its title.\n    const hasContentLine = extracted\n      .split(\"\\n\")\n      .some((l) => !/^\\[.*\\]$/.test(l));\n    if (!extracted || !hasContentLine) continue;\n\n    const noteBlock = `[${dateLabel} - ${titleLabel}]\\n${extracted}`;\n    sections.push(noteBlock);\n    remaining -= noteBlock.length + 1;\n  }\n\n  if (sections.length === 0) return \"\";\n\n  return sections.join(\"\\n\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// Combined: buildWakeupContext\n// ---------------------------------------------------------------------------\n\n/**\n * Build the combined wake-up context block (L0 + L1).\n *\n * Returns a formatted string suitable for injection as a system-reminder,\n * or an empty string if both layers are empty.\n *\n * @param rootPath   Project root path for L1 note lookup. Optional.\n * @param tokenBudget  L1 token budget. Default 800.\n * @param opts.skipStory  Skip the L1 essential story. Set when a handover\n *   checkpoint was already injected — the story re-summarises the same note\n *   the handover came from, at lower quality.\n */\nexport function buildWakeupContext(\n  rootPath?: string,\n  tokenBudget = L1_TOKEN_BUDGET,\n  opts: { skipStory?: boolean } = {}\n): string {\n  const identity = loadL0Identity();\n  const essentialStory = rootPath && !opts.skipStory\n    ? buildL1EssentialStory(rootPath, tokenBudget)\n    : \"\";\n\n  if (!identity && !essentialStory) return \"\";\n\n  const parts: string[] = [];\n\n  if (identity) {\n    parts.push(`## L0 Identity\\n\\n${identity}`);\n  }\n\n  if (essentialStory) {\n    parts.push(`## L1 Essential Story\\n\\n${essentialStory}`);\n  }\n\n  return parts.join(\"\\n\\n\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA4CA,eAAsB,cAAc,KAA+C;CACjF,MAAM,SAAS,QAAQ,OAAO,QAAQ,KAAK,CAAC;CAC5C,MAAM,UAAU,MAAM,oBAAoB;CAI1C,MAAM,WAAW,MAAM,QAAQ,6BAA6B,EAAE,iBAAiB,MAAM,CAAC;CAEtF,IAAI,UAA4C;CAChD,IAAI,YAAgC;AAEpC,MAAK,MAAM,KAAK,UAAU;EACxB,MAAM,OAAO,QAAQ,EAAE,UAAU;AACjC,MAAI,WAAW,MAAM;AACnB,aAAU;AACV,eAAY;AACZ;;AAEF,MAAI,CAAC,WAAW,OAAO,WAAW,OAAO,IAAI,EAAE;AAC7C,aAAU;AACV,eAAY;AAGZ;;;AAIJ,KAAI,CAAC,QAAS,QAAO;CAGrB,MAAM,eAAe,MAAM,QAAQ,wBAAwB,QAAQ,GAAG;CACtE,MAAM,WAAW,MAAM,QAAQ,yBAAyB,QAAQ,GAAG;CAEnE,MAAM,WACJ,cAAc,WACV,OAAO,MAAM,QAAQ,QAAQ,UAAU,CAAC,SAAS,EAAE,GACnD;AAEN,QAAO;EACL,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,WAAW,QAAQ;EACnB,aAAa,QAAQ;EACrB,MAAM,QAAQ;EACd,QAAQ,QAAQ;EAChB,eAAe;EACf,mBAAmB;EACnB,YAAY;EACZ,eAAe;EAChB;;;;;AAUH,SAAgB,gBAAgB,GAA4B;CAC1D,MAAM,QAAkB;EACtB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE,aAAa,EAAE,gBAAgB,MAAM,EAAE,cAAc,KAAK;EAC7E,iBAAiB,EAAE;EACpB;AACD,KAAI,EAAE,kBACJ,OAAM,KAAK,iBAAiB,EAAE,oBAAoB;AAEpD,QAAO,MAAM,KAAK,KAAK;;;;;AAMzB,SAAgB,oBAAoB,GAA4B;AAC9D,QAAO,KAAK,UACV;EACE,MAAM,EAAE;EACR,cAAc,EAAE;EAChB,WAAW,EAAE;EACb,aAAa,EAAE;EACf,MAAM,EAAE;EACR,QAAQ,EAAE;EACV,YAAY,EAAE;EACd,eAAe,EAAE;EACjB,eAAe,EAAE;EACjB,mBAAmB,EAAE;EACtB,EACD,MACA,EACD;;;;;;;;;;;;;;;;;ACrHH,MAAM,kBAAkB;AACD,kBAAkB;;AAGzC,MAAM,eAAe;;AAGrB,MAAM,mBAAmB;CACvB;CACA;CACA;CACA;CACD;;AAGD,MAAM,gBAAgB,KAAK,SAAS,EAAE,QAAQ,eAAe;;;;;;;AAY7D,SAAgB,eACd,OAAkD,EAAE,EAC5C;CACR,MAAM,UAAU,KAAK,WAAW,YAAY,eAAe;CAC3D,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,OAAO,WAAW,QAAQ,GAAG,UAAU;AAC7C,KAAI,CAAC,WAAW,KAAK,CAAE,QAAO;AAC9B,KAAI;AACF,SAAO,aAAa,MAAM,QAAQ,CAAC,MAAM;SACnC;AACN,SAAO;;;;;;;;AASX,SAAgB,oBACd,OAAyD,EAAE,EACxC;AAGnB,QAAO,eAFQ,KAAK,MAAM,YAAY,eAAe,EAEvB,CADb,KAAK,QAAQ,cACU,EAAE,EAAE,QAAQ,KAAK,QAAQ,CAAC;;;;;;AAWpE,SAAS,uBAAuB,UAAiC;CAE/D,MAAM,kBAAkB;EACtB,KAAK,UAAU,QAAQ;EACvB,KAAK,UAAU,QAAQ;EACvB,KAAK,UAAU,WAAW,QAAQ;EACnC;AACD,MAAK,MAAM,KAAK,gBACd,KAAI,WAAW,EAAE,CAAE,QAAO;CAI5B,MAAM,UAAU,SACb,QAAQ,OAAO,IAAI,CACnB,QAAQ,OAAO,IAAI,CACnB,QAAQ,MAAM,IAAI;CACrB,MAAM,eAAe,KACnB,SAAS,EACT,WACA,YACA,SACA,QACD;AACD,KAAI,WAAW,aAAa,CAAE,QAAO;AAErC,QAAO;;;;;;;;;AAUT,SAAS,iBAAiB,UAA4B;CACpD,MAAM,SAAmB,EAAE;CAE3B,MAAM,WAAW,QAAgB;AAC/B,MAAI,CAAC,WAAW,IAAI,CAAE;EACtB,IAAI;AACJ,MAAI;AACF,aAAU,YAAY,KAAK,EAAE,eAAe,MAAM,CAAC,CAChD,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE,aAAa;IAAE,EAAE;UACnD;AACN;;AAGF,OAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,WAAW,KAAK,KAAK,MAAM,KAAK;AACtC,OAAI,MAAM,MAER,SAAQ,SAAS;YACR,MAAM,KAAK,MAAM,wBAAwB,CAClD,QAAO,KAAK,SAAS;;;AAK3B,SAAQ,SAAS;CAajB,MAAM,UAAU,MACd,SAAS,EAAE,CAAC,MAAM,sBAAsB,GAAG,MAAM;CACnD,MAAM,YAAY,MAChB,SAAS,SAAS,EAAE,CAAC,MAAM,SAAS,GAAG,MAAM,KAAK,GAAG;CACvD,MAAM,WAAW,MAAsB;AACrC,MAAI;AACF,UAAO,SAAS,EAAE,CAAC;UACb;AACN,UAAO;;;AAIX,QAAO,MAAM,GAAG,MAAM;EACpB,MAAM,QAAQ,OAAO,EAAE;EACvB,MAAM,QAAQ,OAAO,EAAE;AAEvB,MAAI,UAAU,OAAO;AACnB,OAAI,CAAC,MAAO,QAAO;AACnB,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO,MAAM,cAAc,MAAM;;EAEnC,MAAM,WAAW,SAAS,EAAE,GAAG,SAAS,EAAE;AAC1C,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,QAAQ,EAAE,GAAG,QAAQ,EAAE;GAC9B;AAEF,QAAO;;;;;;;AAQT,SAAS,cAAc,MAAsB;AAC3C,QAAO,KACJ,QAAQ,iCAAiC,GAAG,CAC5C,MAAM,CACN,QAAQ,QAAQ,IAAI;;AAGzB,SAAS,gBACP,SACA,UACA,uBAAoB,IAAI,KAAK,EAC7B,6BAA0B,IAAI,KAAK,EAC3B;CACR,MAAM,QAAQ,QAAQ,MAAM,KAAK;CACjC,MAAM,WAAqB,EAAE;CAC7B,IAAI,kBAAkB;CACtB,IAAI,iBAAiB;CACrB,IAAI,YAAY;CAIhB,IAAI,eAA8B;AAGlC,MAAK,MAAM,QAAQ,OAAO;EAExB,MAAM,UAAU,KAAK,MAAM,YAAY;EACvC,MAAM,UAAU,KAAK,MAAM,aAAa;AACxC,MAAI,SAAS;AACX,oBAAiB,QAAQ;AACzB,qBAAkB,iBAAiB,MAAM,MACvC,eAAe,aAAa,CAAC,SAAS,EAAE,aAAa,CAAC,CACvD;AACD,kBAAe;AACf;;AAEF,MAAI,SAAS;AAEX,OAAI,gBACF,gBAAe,QAAQ;AAEzB;;AAGF,MAAI,CAAC,gBAAiB;EAGtB,MAAM,UAAU,KAAK,MAAM;AAC3B,MAAI,CAAC,WAAW,QAAQ,WAAW,OAAO,IAAI,YAAY,MAAO;AAGjE,MACE,QAAQ,WAAW,KAAK,IACxB,QAAQ,WAAW,KAAK,IACxB,QAAQ,MAAM,SAAS,IACvB,QAAQ,WAAW,KAAK,EACxB;GACA,MAAM,aAAa,cAAc,QAAQ;AACzC,OAAI,KAAK,IAAI,WAAW,CAAE;GAE1B,IAAI,YAAY;GAChB,IAAI,WAAW;AACf,OAAI,iBAAiB,MAAM;AACzB,eAAW,aAAa,aAAa,CAAC,MAAM;AAC5C,QAAI,CAAC,WAAW,IAAI,SAAS,CAC3B,aAAY,IAAI,aAAa;;AAIjC,OAAI,YAAY,UAAU,SAAS,QAAQ,SAAS,IAAI,SAAU;AAElE,OAAI,WAAW;AACb,aAAS,KAAK,UAAU;AACxB,eAAW,IAAI,SAAS;AACxB,iBAAa,UAAU,SAAS;;AAElC,kBAAe;AAEf,QAAK,IAAI,WAAW;AACpB,YAAS,KAAK,QAAQ;AACtB,gBAAa,QAAQ,SAAS;;;AAIlC,QAAO,SAAS,KAAK,KAAK;;;;;;;;;;;;AAa5B,SAAgB,sBACd,UACA,cAAc,iBACN;CACR,MAAM,aAAa,cAAc;CACjC,MAAM,WAAW,uBAAuB,SAAS;AACjD,KAAI,CAAC,SAAU,QAAO;CAEtB,MAAM,YAAY,iBAAiB,SAAS,CAAC,MAAM,GAAG,aAAa;AACnE,KAAI,UAAU,WAAW,EAAG,QAAO;CAEnC,MAAM,WAAqB,EAAE;CAC7B,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,6BAAa,IAAI,KAAa;CACpC,IAAI,YAAY;AAEhB,MAAK,MAAM,YAAY,WAAW;AAChC,MAAI,aAAa,GAAI;EAErB,IAAI;AACJ,MAAI;AACF,aAAU,aAAa,UAAU,QAAQ;UACnC;AACN;;EAIF,MAAM,OAAO,SAAS,SAAS;EAC/B,MAAM,aAAa,KAAK,MAAM,yCAAyC;EACvE,MAAM,YAAY,aAAa,WAAW,KAAK;EAC/C,MAAM,aAAa,aACf,WAAW,KACX,KAAK,QAAQ,WAAW,GAAG,CAAC,QAAQ,SAAS,GAAG;EAGpD,MAAM,eAAe,KAAK,IAAI,WAAW,KAAK,MAAM,aAAa,UAAU,OAAO,GAAG,IAAI;EACzF,MAAM,YAAY,gBAAgB,SAAS,cAAc,MAAM,WAAW;EAI1E,MAAM,iBAAiB,UACpB,MAAM,KAAK,CACX,MAAM,MAAM,CAAC,WAAW,KAAK,EAAE,CAAC;AACnC,MAAI,CAAC,aAAa,CAAC,eAAgB;EAEnC,MAAM,YAAY,IAAI,UAAU,KAAK,WAAW,KAAK;AACrD,WAAS,KAAK,UAAU;AACxB,eAAa,UAAU,SAAS;;AAGlC,KAAI,SAAS,WAAW,EAAG,QAAO;AAElC,QAAO,SAAS,KAAK,OAAO;;;;;;;;;;;;;;AAmB9B,SAAgB,mBACd,UACA,cAAc,iBACd,OAAgC,EAAE,EAC1B;CACR,MAAM,WAAW,gBAAgB;CACjC,MAAM,iBAAiB,YAAY,CAAC,KAAK,YACrC,sBAAsB,UAAU,YAAY,GAC5C;AAEJ,KAAI,CAAC,YAAY,CAAC,eAAgB,QAAO;CAEzC,MAAM,QAAkB,EAAE;AAE1B,KAAI,SACF,OAAM,KAAK,qBAAqB,WAAW;AAG7C,KAAI,eACF,OAAM,KAAK,4BAA4B,iBAAiB;AAG1D,QAAO,MAAM,KAAK,OAAO"}
+{"version":3,"file":"wakeup-CZw88uXf.mjs","names":[],"sources":["../src/cli/commands/detect.ts","../src/memory/wakeup.ts"],"sourcesContent":["/**\n * Project detection logic for PAI.\n *\n * detectProject(cwd) — given a filesystem path, returns the best matching\n * project from the registry:\n *   1. Exact path match\n *   2. Longest parent match (project whose root_path is an ancestor of cwd)\n *\n * Exported for use by the CLI `pai project detect` command and the MCP\n * `project_detect` tool.\n */\n\nimport { resolve } from \"node:path\";\nimport { getRegistryBackend } from \"../../storage/factory.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface DetectedProject {\n  id: number;\n  slug: string;\n  display_name: string;\n  root_path: string;\n  encoded_dir: string;\n  type: string;\n  status: string;\n  session_count: number;\n  last_session_date: string | null;\n  match_type: \"exact\" | \"parent\";\n  /** Only set when match_type is 'parent' — the portion of cwd below root_path */\n  relative_path: string | null;\n}\n\n// ---------------------------------------------------------------------------\n// Core detection function\n// ---------------------------------------------------------------------------\n\n/**\n * Detect which registered project a filesystem path belongs to.\n *\n * @param cwd  Absolute path to detect (defaults to process.cwd())\n * @returns    The best matching project, or null if no match\n */\nexport async function detectProject(cwd?: string): Promise<DetectedProject | null> {\n  const target = resolve(cwd ?? process.cwd());\n  const backend = await getRegistryBackend();\n\n  // Load all active projects ordered by root_path length descending\n  // so the longest (most specific) match wins in a linear scan.\n  const projects = await backend.listProjectsByPathLengthDesc({ excludeArchived: true });\n\n  let matched: (typeof projects)[number] | null = null;\n  let matchType: \"exact\" | \"parent\" = \"exact\";\n\n  for (const p of projects) {\n    const root = resolve(p.root_path);\n    if (target === root) {\n      matched = p;\n      matchType = \"exact\";\n      break;\n    }\n    if (!matched && target.startsWith(root + \"/\")) {\n      matched = p;\n      matchType = \"parent\";\n      // Keep scanning — a longer root_path match might exist (but shouldn't\n      // since we sorted by length desc). Safety break anyway once found.\n      break;\n    }\n  }\n\n  if (!matched) return null;\n\n  // Enrich with session stats\n  const sessionCount = await backend.countSessionsForProject(matched.id);\n  const lastDate = await backend.getMostRecentSessionDate(matched.id);\n\n  const relative =\n    matchType === \"parent\"\n      ? target.slice(resolve(matched.root_path).length + 1)\n      : null;\n\n  return {\n    id: matched.id,\n    slug: matched.slug,\n    display_name: matched.display_name,\n    root_path: matched.root_path,\n    encoded_dir: matched.encoded_dir,\n    type: matched.type,\n    status: matched.status,\n    session_count: sessionCount,\n    last_session_date: lastDate,\n    match_type: matchType,\n    relative_path: relative,\n  };\n}\n\n// ---------------------------------------------------------------------------\n// Format helpers\n// ---------------------------------------------------------------------------\n\n/**\n * Format a DetectedProject for human-readable CLI output.\n */\nexport function formatDetection(d: DetectedProject): string {\n  const lines: string[] = [\n    `slug:         ${d.slug}`,\n    `display_name: ${d.display_name}`,\n    `root_path:    ${d.root_path}`,\n    `type:         ${d.type}`,\n    `status:       ${d.status}`,\n    `match:        ${d.match_type}${d.relative_path ? ` (+${d.relative_path})` : \"\"}`,\n    `sessions:     ${d.session_count}`,\n  ];\n  if (d.last_session_date) {\n    lines.push(`last_session: ${d.last_session_date}`);\n  }\n  return lines.join(\"\\n\");\n}\n\n/**\n * Format a DetectedProject as JSON for machine consumption.\n */\nexport function formatDetectionJson(d: DetectedProject): string {\n  return JSON.stringify(\n    {\n      slug: d.slug,\n      display_name: d.display_name,\n      root_path: d.root_path,\n      encoded_dir: d.encoded_dir,\n      type: d.type,\n      status: d.status,\n      match_type: d.match_type,\n      relative_path: d.relative_path,\n      session_count: d.session_count,\n      last_session_date: d.last_session_date,\n    },\n    null,\n    2\n  );\n}\n","/**\n * Wake-up context system — progressive context loading inspired by mempalace.\n *\n * Layers:\n *   L0 Identity     (~100 tokens)   — user identity from ~/.pai/identity.txt. Always loaded.\n *   L1 Essential Story (~500-800t)  — top session notes for the project, key lines extracted.\n *   L2 On-Demand                    — triggered by topic queries (handled by memory_search).\n *   L3 Deep Search                  — unlimited federated memory search (memory_search tool).\n */\n\nimport { existsSync, readdirSync, readFileSync, statSync } from \"node:fs\";\nimport { join, basename } from \"node:path\";\nimport { homedir } from \"node:os\";\nimport { paiHomePath, migratePaiFile, type MigrateFileResult } from \"../config/pai-home.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\n/** Maximum tokens for the L1 essential story block. Approx 4 chars/token.\n * Measured 2026-09-20: 800 tokens was mostly stale bullets. Reduced to 300.\n */\nconst L1_TOKEN_BUDGET = 300;\nconst L1_CHAR_BUDGET = L1_TOKEN_BUDGET * 4; // ~1600 chars\n\n/** Maximum session notes to scan when building L1. Reduced from 10 to 3 (2026-09-20). */\nconst L1_MAX_NOTES = 3;\n\n/** Sections to extract from session notes (in priority order). */\nconst EXTRACT_SECTIONS = [\n  \"Work Done\",\n  \"Key Decisions\",\n  \"Next Steps\",\n  \"Checkpoint\",\n];\n\n/** Identity file location. */\nconst IDENTITY_FILE = join(homedir(), \".pai\", \"identity.txt\");\n\n// ---------------------------------------------------------------------------\n// L0: Identity\n// ---------------------------------------------------------------------------\n\n/**\n * Load L0 identity. Prefers the PAI_HOME location (identity.txt migrated by\n * `pai config migrate`), falling back to the legacy ~/.pai/identity.txt so a\n * not-yet-migrated file keeps working. Returns \"\" if neither exists. Never\n * throws.\n */\nexport function loadL0Identity(\n  opts: { newPath?: string; legacyPath?: string } = {}\n): string {\n  const newPath = opts.newPath ?? paiHomePath(\"identity.txt\");\n  const legacyPath = opts.legacyPath ?? IDENTITY_FILE;\n  const path = existsSync(newPath) ? newPath : legacyPath;\n  if (!existsSync(path)) return \"\";\n  try {\n    return readFileSync(path, \"utf-8\").trim();\n  } catch {\n    return \"\";\n  }\n}\n\n/**\n * Move ~/.pai/identity.txt into PAI_HOME, following the same copy /\n * verify-byte-identical / rename-aside semantics as every other per-user\n * file (see migratePaiFile). `from`/`to` are overridable for tests.\n */\nexport function migrateIdentityFile(\n  opts: { dryRun?: boolean; from?: string; to?: string } = {}\n): MigrateFileResult {\n  const toPath = opts.to ?? paiHomePath(\"identity.txt\");\n  const fromPath = opts.from ?? IDENTITY_FILE;\n  return migratePaiFile(toPath, [fromPath], { dryRun: opts.dryRun });\n}\n\n// ---------------------------------------------------------------------------\n// L1: Essential Story\n// ---------------------------------------------------------------------------\n\n/**\n * Find the Notes directory for a project given its root_path from the registry.\n * Checks local Notes/ first, then central ~/.claude/projects/... path.\n */\nfunction findNotesDirForProject(rootPath: string): string | null {\n  // Check local Notes directories first\n  const localCandidates = [\n    join(rootPath, \"Notes\"),\n    join(rootPath, \"notes\"),\n    join(rootPath, \".claude\", \"Notes\"),\n  ];\n  for (const p of localCandidates) {\n    if (existsSync(p)) return p;\n  }\n\n  // Fall back to central ~/.claude/projects/{encoded}/Notes\n  const encoded = rootPath\n    .replace(/\\//g, \"-\")\n    .replace(/\\./g, \"-\")\n    .replace(/ /g, \"-\");\n  const centralNotes = join(\n    homedir(),\n    \".claude\",\n    \"projects\",\n    encoded,\n    \"Notes\"\n  );\n  if (existsSync(centralNotes)) return centralNotes;\n\n  return null;\n}\n\n/**\n * Recursively find all .md session note files in a Notes directory.\n * Handles both flat layout (Notes/*.md) and month-subdirectory layout\n * (Notes/YYYY/MM/*.md). Returns files sorted newest-first by filename\n * (note numbers are monotonically increasing, so lexicographic = newest-last,\n * so we reverse).\n */\nfunction findSessionNotes(notesDir: string): string[] {\n  const result: string[] = [];\n\n  const scanDir = (dir: string) => {\n    if (!existsSync(dir)) return;\n    let entries: Array<{ name: string; isDir: boolean }>;\n    try {\n      entries = readdirSync(dir, { withFileTypes: true })\n        .map((e) => ({ name: e.name, isDir: e.isDirectory() }));\n    } catch {\n      return;\n    }\n\n    for (const entry of entries) {\n      const fullPath = join(dir, entry.name);\n      if (entry.isDir) {\n        // Recurse into YYYY/MM subdirectories\n        scanDir(fullPath);\n      } else if (entry.name.match(/^\\d{3,4}[\\s_-].*\\.md$/)) {\n        result.push(fullPath);\n      }\n    }\n  };\n\n  scanDir(notesDir);\n\n  // Sort newest-first by the DATE in the filename, not the note number.\n  //\n  // The note number is only monotonic within one uninterrupted numbering run.\n  // It restarts — per month directory, and after a registry merge renumbers a\n  // project — so \"highest number\" and \"most recent\" diverge. Observed live:\n  // `0184 - 2026-02-22` outranked `0008 - 2026-08-01`, and the wake-up context\n  // handed a resumed session five-month-old material as its recent history.\n  //\n  // `NNNN - YYYY-MM-DD - Title.md` is the enforced layout, so the date is the\n  // reliable key. Number breaks ties within a day; mtime is the last resort\n  // for notes that predate the naming convention.\n  const dateOf = (p: string): string =>\n    basename(p).match(/(\\d{4}-\\d{2}-\\d{2})/)?.[1] ?? \"\";\n  const numberOf = (p: string): number =>\n    parseInt(basename(p).match(/^(\\d+)/)?.[1] ?? \"0\", 10);\n  const mtimeOf = (p: string): number => {\n    try {\n      return statSync(p).mtimeMs;\n    } catch {\n      return 0;\n    }\n  };\n\n  result.sort((a, b) => {\n    const dateA = dateOf(a);\n    const dateB = dateOf(b);\n    // Undated notes sort last rather than winning on an empty string.\n    if (dateA !== dateB) {\n      if (!dateA) return 1;\n      if (!dateB) return -1;\n      return dateB.localeCompare(dateA);\n    }\n    const byNumber = numberOf(b) - numberOf(a);\n    if (byNumber !== 0) return byNumber;\n    return mtimeOf(b) - mtimeOf(a);\n  });\n\n  return result;\n}\n\n/**\n * Extract the most important lines from a session note.\n * Prioritises: Work Done items, Key Decisions, Next Steps, Checkpoint headings.\n * Returns a condensed string under maxChars.\n */\nfunction normalizeLine(line: string): string {\n  return line\n    .replace(/^(- \\[[ x]\\] |- |\\* |\\d+\\.\\s)/, \"\")\n    .trim()\n    .replace(/\\s+/g, \" \");\n}\n\nfunction extractKeyLines(\n  content: string,\n  maxChars: number,\n  seen: Set<string> = new Set(),\n  seenLabels: Set<string> = new Set()\n): string {\n  const lines = content.split(\"\\n\");\n  const selected: string[] = [];\n  let inTargetSection = false;\n  let currentSection = \"\";\n  let charCount = 0;\n  // Heading text seen since the last line was emitted. Buffered rather than\n  // pushed immediately: a heading with no surviving lines under it (every\n  // line deduped against an earlier note) must not appear at all.\n  let pendingLabel: string | null = null;\n\n  // First pass: collect lines from priority sections\n  for (const line of lines) {\n    // Detect section headers\n    const h2Match = line.match(/^## (.+)$/);\n    const h3Match = line.match(/^### (.+)$/);\n    if (h2Match) {\n      currentSection = h2Match[1];\n      inTargetSection = EXTRACT_SECTIONS.some((s) =>\n        currentSection.toLowerCase().includes(s.toLowerCase())\n      );\n      pendingLabel = null;\n      continue;\n    }\n    if (h3Match) {\n      // Checkpoints / sub-sections — buffer as a candidate label.\n      if (inTargetSection) {\n        pendingLabel = h3Match[1];\n      }\n      continue;\n    }\n\n    if (!inTargetSection) continue;\n\n    // Skip blank lines and HTML comments\n    const trimmed = line.trim();\n    if (!trimmed || trimmed.startsWith(\"<!--\") || trimmed === \"---\") continue;\n\n    // Include checkbox items, bold text, and plain text lines\n    if (\n      trimmed.startsWith(\"- \") ||\n      trimmed.startsWith(\"* \") ||\n      trimmed.match(/^\\d+\\./) ||\n      trimmed.startsWith(\"**\")\n    ) {\n      const normalized = normalizeLine(trimmed);\n      if (seen.has(normalized)) continue;\n\n      let labelText = \"\";\n      let labelKey = \"\";\n      if (pendingLabel !== null) {\n        labelKey = pendingLabel.toLowerCase().trim();\n        if (!seenLabels.has(labelKey)) {\n          labelText = `[${pendingLabel}]`;\n        }\n      }\n\n      if (charCount + labelText.length + trimmed.length + 2 > maxChars) break;\n\n      if (labelText) {\n        selected.push(labelText);\n        seenLabels.add(labelKey);\n        charCount += labelText.length + 1;\n      }\n      pendingLabel = null;\n\n      seen.add(normalized);\n      selected.push(trimmed);\n      charCount += trimmed.length + 1;\n    }\n  }\n\n  return selected.join(\"\\n\");\n}\n\n/**\n * Build the L1 essential story block.\n *\n * Reads the most recent session notes for the project and extracts the key\n * lines (Work Done, Key Decisions, Next Steps) within the token budget.\n *\n * @param rootPath   The project root path (from the registry).\n * @param tokenBudget  Max tokens to consume. Default 800 (~3200 chars).\n * @returns Formatted L1 block, or empty string if no notes found.\n */\nexport function buildL1EssentialStory(\n  rootPath: string,\n  tokenBudget = L1_TOKEN_BUDGET\n): string {\n  const charBudget = tokenBudget * 4;\n  const notesDir = findNotesDirForProject(rootPath);\n  if (!notesDir) return \"\";\n\n  const noteFiles = findSessionNotes(notesDir).slice(0, L1_MAX_NOTES);\n  if (noteFiles.length === 0) return \"\";\n\n  const sections: string[] = [];\n  const seen = new Set<string>();\n  const seenLabels = new Set<string>();\n  let remaining = charBudget;\n\n  for (const noteFile of noteFiles) {\n    if (remaining <= 50) break;\n\n    let content: string;\n    try {\n      content = readFileSync(noteFile, \"utf-8\");\n    } catch {\n      continue;\n    }\n\n    // Extract the note date and title from the filename\n    const name = basename(noteFile);\n    const titleMatch = name.match(/^\\d+ - (\\d{4}-\\d{2}-\\d{2}) - (.+)\\.md$/);\n    const dateLabel = titleMatch ? titleMatch[1] : \"\";\n    const titleLabel = titleMatch\n      ? titleMatch[2]\n      : name.replace(/^\\d+ - /, \"\").replace(/\\.md$/, \"\");\n\n    // Skip if nothing useful extracted from this note\n    const perNoteChars = Math.min(remaining, Math.floor(charBudget / noteFiles.length) + 200);\n    const extracted = extractKeyLines(content, perNoteChars, seen, seenLabels);\n    // A note whose every extracted line survived only as a label (all its\n    // real lines deduped against an earlier, newer note) contributes nothing\n    // — including its title.\n    const hasContentLine = extracted\n      .split(\"\\n\")\n      .some((l) => !/^\\[.*\\]$/.test(l));\n    if (!extracted || !hasContentLine) continue;\n\n    const noteBlock = `[${dateLabel} - ${titleLabel}]\\n${extracted}`;\n    sections.push(noteBlock);\n    remaining -= noteBlock.length + 1;\n  }\n\n  if (sections.length === 0) return \"\";\n\n  return sections.join(\"\\n\\n\");\n}\n\n// ---------------------------------------------------------------------------\n// Combined: buildWakeupContext\n// ---------------------------------------------------------------------------\n\n/**\n * Build the combined wake-up context block (L0 + L1).\n *\n * Returns a formatted string suitable for injection as a system-reminder,\n * or an empty string if both layers are empty.\n *\n * @param rootPath   Project root path for L1 note lookup. Optional.\n * @param tokenBudget  L1 token budget. Default 800.\n * @param opts.skipStory  Skip the L1 essential story. Set when a handover\n *   checkpoint was already injected — the story re-summarises the same note\n *   the handover came from, at lower quality.\n */\nexport function buildWakeupContext(\n  rootPath?: string,\n  tokenBudget = L1_TOKEN_BUDGET,\n  opts: { skipStory?: boolean } = {}\n): string {\n  const identity = loadL0Identity();\n  const essentialStory = rootPath && !opts.skipStory\n    ? buildL1EssentialStory(rootPath, tokenBudget)\n    : \"\";\n\n  if (!identity && !essentialStory) return \"\";\n\n  const parts: string[] = [];\n\n  if (identity) {\n    parts.push(`## L0 Identity\\n\\n${identity}`);\n  }\n\n  if (essentialStory) {\n    parts.push(`## L1 Essential Story\\n\\n${essentialStory}`);\n  }\n\n  return parts.join(\"\\n\\n\");\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;AA4CA,eAAsB,cAAc,KAA+C;CACjF,MAAM,SAAS,QAAQ,OAAO,QAAQ,KAAK,CAAC;CAC5C,MAAM,UAAU,MAAM,oBAAoB;CAI1C,MAAM,WAAW,MAAM,QAAQ,6BAA6B,EAAE,iBAAiB,MAAM,CAAC;CAEtF,IAAI,UAA4C;CAChD,IAAI,YAAgC;AAEpC,MAAK,MAAM,KAAK,UAAU;EACxB,MAAM,OAAO,QAAQ,EAAE,UAAU;AACjC,MAAI,WAAW,MAAM;AACnB,aAAU;AACV,eAAY;AACZ;;AAEF,MAAI,CAAC,WAAW,OAAO,WAAW,OAAO,IAAI,EAAE;AAC7C,aAAU;AACV,eAAY;AAGZ;;;AAIJ,KAAI,CAAC,QAAS,QAAO;CAGrB,MAAM,eAAe,MAAM,QAAQ,wBAAwB,QAAQ,GAAG;CACtE,MAAM,WAAW,MAAM,QAAQ,yBAAyB,QAAQ,GAAG;CAEnE,MAAM,WACJ,cAAc,WACV,OAAO,MAAM,QAAQ,QAAQ,UAAU,CAAC,SAAS,EAAE,GACnD;AAEN,QAAO;EACL,IAAI,QAAQ;EACZ,MAAM,QAAQ;EACd,cAAc,QAAQ;EACtB,WAAW,QAAQ;EACnB,aAAa,QAAQ;EACrB,MAAM,QAAQ;EACd,QAAQ,QAAQ;EAChB,eAAe;EACf,mBAAmB;EACnB,YAAY;EACZ,eAAe;EAChB;;;;;AAUH,SAAgB,gBAAgB,GAA4B;CAC1D,MAAM,QAAkB;EACtB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE;EACnB,iBAAiB,EAAE,aAAa,EAAE,gBAAgB,MAAM,EAAE,cAAc,KAAK;EAC7E,iBAAiB,EAAE;EACpB;AACD,KAAI,EAAE,kBACJ,OAAM,KAAK,iBAAiB,EAAE,oBAAoB;AAEpD,QAAO,MAAM,KAAK,KAAK;;;;;AAMzB,SAAgB,oBAAoB,GAA4B;AAC9D,QAAO,KAAK,UACV;EACE,MAAM,EAAE;EACR,cAAc,EAAE;EAChB,WAAW,EAAE;EACb,aAAa,EAAE;EACf,MAAM,EAAE;EACR,QAAQ,EAAE;EACV,YAAY,EAAE;EACd,eAAe,EAAE;EACjB,eAAe,EAAE;EACjB,mBAAmB,EAAE;EACtB,EACD,MACA,EACD;;;;;;;;;;;;;;;;;ACrHH,MAAM,kBAAkB;AACD,kBAAkB;;AAGzC,MAAM,eAAe;;AAGrB,MAAM,mBAAmB;CACvB;CACA;CACA;CACA;CACD;;AAGD,MAAM,gBAAgB,KAAK,SAAS,EAAE,QAAQ,eAAe;;;;;;;AAY7D,SAAgB,eACd,OAAkD,EAAE,EAC5C;CACR,MAAM,UAAU,KAAK,WAAW,YAAY,eAAe;CAC3D,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,OAAO,WAAW,QAAQ,GAAG,UAAU;AAC7C,KAAI,CAAC,WAAW,KAAK,CAAE,QAAO;AAC9B,KAAI;AACF,SAAO,aAAa,MAAM,QAAQ,CAAC,MAAM;SACnC;AACN,SAAO;;;;;;;;AASX,SAAgB,oBACd,OAAyD,EAAE,EACxC;AAGnB,QAAO,eAFQ,KAAK,MAAM,YAAY,eAAe,EAEvB,CADb,KAAK,QAAQ,cACU,EAAE,EAAE,QAAQ,KAAK,QAAQ,CAAC;;;;;;AAWpE,SAAS,uBAAuB,UAAiC;CAE/D,MAAM,kBAAkB;EACtB,KAAK,UAAU,QAAQ;EACvB,KAAK,UAAU,QAAQ;EACvB,KAAK,UAAU,WAAW,QAAQ;EACnC;AACD,MAAK,MAAM,KAAK,gBACd,KAAI,WAAW,EAAE,CAAE,QAAO;CAI5B,MAAM,UAAU,SACb,QAAQ,OAAO,IAAI,CACnB,QAAQ,OAAO,IAAI,CACnB,QAAQ,MAAM,IAAI;CACrB,MAAM,eAAe,KACnB,SAAS,EACT,WACA,YACA,SACA,QACD;AACD,KAAI,WAAW,aAAa,CAAE,QAAO;AAErC,QAAO;;;;;;;;;AAUT,SAAS,iBAAiB,UAA4B;CACpD,MAAM,SAAmB,EAAE;CAE3B,MAAM,WAAW,QAAgB;AAC/B,MAAI,CAAC,WAAW,IAAI,CAAE;EACtB,IAAI;AACJ,MAAI;AACF,aAAU,YAAY,KAAK,EAAE,eAAe,MAAM,CAAC,CAChD,KAAK,OAAO;IAAE,MAAM,EAAE;IAAM,OAAO,EAAE,aAAa;IAAE,EAAE;UACnD;AACN;;AAGF,OAAK,MAAM,SAAS,SAAS;GAC3B,MAAM,WAAW,KAAK,KAAK,MAAM,KAAK;AACtC,OAAI,MAAM,MAER,SAAQ,SAAS;YACR,MAAM,KAAK,MAAM,wBAAwB,CAClD,QAAO,KAAK,SAAS;;;AAK3B,SAAQ,SAAS;CAajB,MAAM,UAAU,MACd,SAAS,EAAE,CAAC,MAAM,sBAAsB,GAAG,MAAM;CACnD,MAAM,YAAY,MAChB,SAAS,SAAS,EAAE,CAAC,MAAM,SAAS,GAAG,MAAM,KAAK,GAAG;CACvD,MAAM,WAAW,MAAsB;AACrC,MAAI;AACF,UAAO,SAAS,EAAE,CAAC;UACb;AACN,UAAO;;;AAIX,QAAO,MAAM,GAAG,MAAM;EACpB,MAAM,QAAQ,OAAO,EAAE;EACvB,MAAM,QAAQ,OAAO,EAAE;AAEvB,MAAI,UAAU,OAAO;AACnB,OAAI,CAAC,MAAO,QAAO;AACnB,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO,MAAM,cAAc,MAAM;;EAEnC,MAAM,WAAW,SAAS,EAAE,GAAG,SAAS,EAAE;AAC1C,MAAI,aAAa,EAAG,QAAO;AAC3B,SAAO,QAAQ,EAAE,GAAG,QAAQ,EAAE;GAC9B;AAEF,QAAO;;;;;;;AAQT,SAAS,cAAc,MAAsB;AAC3C,QAAO,KACJ,QAAQ,iCAAiC,GAAG,CAC5C,MAAM,CACN,QAAQ,QAAQ,IAAI;;AAGzB,SAAS,gBACP,SACA,UACA,uBAAoB,IAAI,KAAK,EAC7B,6BAA0B,IAAI,KAAK,EAC3B;CACR,MAAM,QAAQ,QAAQ,MAAM,KAAK;CACjC,MAAM,WAAqB,EAAE;CAC7B,IAAI,kBAAkB;CACtB,IAAI,iBAAiB;CACrB,IAAI,YAAY;CAIhB,IAAI,eAA8B;AAGlC,MAAK,MAAM,QAAQ,OAAO;EAExB,MAAM,UAAU,KAAK,MAAM,YAAY;EACvC,MAAM,UAAU,KAAK,MAAM,aAAa;AACxC,MAAI,SAAS;AACX,oBAAiB,QAAQ;AACzB,qBAAkB,iBAAiB,MAAM,MACvC,eAAe,aAAa,CAAC,SAAS,EAAE,aAAa,CAAC,CACvD;AACD,kBAAe;AACf;;AAEF,MAAI,SAAS;AAEX,OAAI,gBACF,gBAAe,QAAQ;AAEzB;;AAGF,MAAI,CAAC,gBAAiB;EAGtB,MAAM,UAAU,KAAK,MAAM;AAC3B,MAAI,CAAC,WAAW,QAAQ,WAAW,OAAO,IAAI,YAAY,MAAO;AAGjE,MACE,QAAQ,WAAW,KAAK,IACxB,QAAQ,WAAW,KAAK,IACxB,QAAQ,MAAM,SAAS,IACvB,QAAQ,WAAW,KAAK,EACxB;GACA,MAAM,aAAa,cAAc,QAAQ;AACzC,OAAI,KAAK,IAAI,WAAW,CAAE;GAE1B,IAAI,YAAY;GAChB,IAAI,WAAW;AACf,OAAI,iBAAiB,MAAM;AACzB,eAAW,aAAa,aAAa,CAAC,MAAM;AAC5C,QAAI,CAAC,WAAW,IAAI,SAAS,CAC3B,aAAY,IAAI,aAAa;;AAIjC,OAAI,YAAY,UAAU,SAAS,QAAQ,SAAS,IAAI,SAAU;AAElE,OAAI,WAAW;AACb,aAAS,KAAK,UAAU;AACxB,eAAW,IAAI,SAAS;AACxB,iBAAa,UAAU,SAAS;;AAElC,kBAAe;AAEf,QAAK,IAAI,WAAW;AACpB,YAAS,KAAK,QAAQ;AACtB,gBAAa,QAAQ,SAAS;;;AAIlC,QAAO,SAAS,KAAK,KAAK;;;;;;;;;;;;AAa5B,SAAgB,sBACd,UACA,cAAc,iBACN;CACR,MAAM,aAAa,cAAc;CACjC,MAAM,WAAW,uBAAuB,SAAS;AACjD,KAAI,CAAC,SAAU,QAAO;CAEtB,MAAM,YAAY,iBAAiB,SAAS,CAAC,MAAM,GAAG,aAAa;AACnE,KAAI,UAAU,WAAW,EAAG,QAAO;CAEnC,MAAM,WAAqB,EAAE;CAC7B,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,6BAAa,IAAI,KAAa;CACpC,IAAI,YAAY;AAEhB,MAAK,MAAM,YAAY,WAAW;AAChC,MAAI,aAAa,GAAI;EAErB,IAAI;AACJ,MAAI;AACF,aAAU,aAAa,UAAU,QAAQ;UACnC;AACN;;EAIF,MAAM,OAAO,SAAS,SAAS;EAC/B,MAAM,aAAa,KAAK,MAAM,yCAAyC;EACvE,MAAM,YAAY,aAAa,WAAW,KAAK;EAC/C,MAAM,aAAa,aACf,WAAW,KACX,KAAK,QAAQ,WAAW,GAAG,CAAC,QAAQ,SAAS,GAAG;EAGpD,MAAM,eAAe,KAAK,IAAI,WAAW,KAAK,MAAM,aAAa,UAAU,OAAO,GAAG,IAAI;EACzF,MAAM,YAAY,gBAAgB,SAAS,cAAc,MAAM,WAAW;EAI1E,MAAM,iBAAiB,UACpB,MAAM,KAAK,CACX,MAAM,MAAM,CAAC,WAAW,KAAK,EAAE,CAAC;AACnC,MAAI,CAAC,aAAa,CAAC,eAAgB;EAEnC,MAAM,YAAY,IAAI,UAAU,KAAK,WAAW,KAAK;AACrD,WAAS,KAAK,UAAU;AACxB,eAAa,UAAU,SAAS;;AAGlC,KAAI,SAAS,WAAW,EAAG,QAAO;AAElC,QAAO,SAAS,KAAK,OAAO;;;;;;;;;;;;;;AAmB9B,SAAgB,mBACd,UACA,cAAc,iBACd,OAAgC,EAAE,EAC1B;CACR,MAAM,WAAW,gBAAgB;CACjC,MAAM,iBAAiB,YAAY,CAAC,KAAK,YACrC,sBAAsB,UAAU,YAAY,GAC5C;AAEJ,KAAI,CAAC,YAAY,CAAC,eAAgB,QAAO;CAEzC,MAAM,QAAkB,EAAE;AAE1B,KAAI,SACF,OAAM,KAAK,qBAAqB,WAAW;AAG7C,KAAI,eACF,OAAM,KAAK,4BAA4B,iBAAiB;AAG1D,QAAO,MAAM,KAAK,OAAO"}

package/dist/{work-queue-worker-BbrC3I_R.mjs → work-queue-worker-DCzfH0d1.mjs}

@@ -1,6 +1,6 @@
-import { A as archiveSessionFilesToSessionsDir, D as appendCheckpoint, E as addWorkToSessionNote, F as performScan, O as finalizeSessionNote, _ as spawnSummarizer, a as enqueue, b as updateTodoContinue, f as contentToText$2, h as handleSessionSummary, i as dequeue, j as findNotesDir, k as getCurrentNotePath, l as markCompleted, m as getGitContext, n as writeContextHandoverCache, p as findLatestJsonl, r as cleanup, s as hasPendingOrProcessingOfType, t as readContextHandoverCache, u as markFailed, y as sessionIdFromTranscript } from "./context-handover-cache-DFNnlWv2.mjs";
-import { d as registryBackend, k as storageBackend } from "./state-n13uPK5B.mjs";
-import { t as detectTopicShift } from "./detector-3g7XuU1r.mjs";
+import { A as archiveSessionFilesToSessionsDir, D as appendCheckpoint, E as addWorkToSessionNote, F as performScan, O as finalizeSessionNote, _ as spawnSummarizer, a as enqueue, b as updateTodoContinue, f as contentToText$2, h as handleSessionSummary, i as dequeue, j as findNotesDir, k as getCurrentNotePath, l as markCompleted, m as getGitContext, n as writeContextHandoverCache, p as findLatestJsonl, r as cleanup, s as hasPendingOrProcessingOfType, t as readContextHandoverCache, u as markFailed, y as sessionIdFromTranscript } from "./context-handover-cache-mGxq2-8f.mjs";
+import { d as registryBackend, k as storageBackend } from "./state-HyjqTihC.mjs";
+import { t as detectTopicShift } from "./detector-CIHEXKsV.mjs";
 import { existsSync, readFileSync, writeFileSync } from "node:fs";
 import { basename, dirname, join } from "node:path";
 
@@ -564,4 +564,4 @@ function extractWorkFromTranscript(lines) {
 
 //#endregion
 export { stopWorker as i, notifyNewWork as n, startWorker as r, enqueueRegistryScan as t };
-//# sourceMappingURL=work-queue-worker-BbrC3I_R.mjs.map
+//# sourceMappingURL=work-queue-worker-DCzfH0d1.mjs.map

package/dist/{work-queue-worker-BbrC3I_R.mjs.map → work-queue-worker-DCzfH0d1.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"work-queue-worker-BbrC3I_R.mjs","names":["contentToText","contentToText"],"sources":["../src/daemon/templates/context-handover-prompt.ts","../src/daemon/context-handover-worker.ts","../src/daemon/topic-detect-worker.ts","../src/daemon/work-queue-worker.ts"],"sourcesContent":["/**\n * context-handover-prompt.ts — prompt template for the threshold-triggered\n * pre-compaction handover.\n *\n * This is NOT the session-note summary (session-summary-prompt.ts already\n * does that well, and Claude Code's own native compaction summary is also\n * genuinely detailed on file paths and issue numbers). This exists for the\n * one thing neither of those reliably carries: the reasoning behind what\n * happened, which compresses to bullets or vanishes outright once a native\n * compaction fires.\n *\n * FRAMING (lifted from a working example of this exact mechanism, read\n * before writing this prompt): the handover is a DIFF against everything\n * already durable, not a summary of the session. The successor can read\n * git, the tracker, and the notes — so this must not repeat what is\n * recoverable there. What cannot be recovered is what only ever existed in\n * the conversation: reasoning, rejected alternatives, negative results and\n * what they cost, traps discovered but invisible in the repo, and specific\n * values/ids/paths that would otherwise have to be dug up again.\n *\n * Length is not a target. A short session earns a short handover; every\n * line in a long one must be something the successor could not have\n * obtained anywhere else.\n */\n\nexport interface HandoverPromptParams {\n  /** Interleaved user + assistant turns, oldest first, each prefixed with\n   *  who said it — this prompt needs the assistant's reasoning, not just\n   *  what the user asked for. */\n  turns: string[];\n  /** Git log output for the session period, if any. */\n  gitLog: string;\n  cwd: string;\n  /** The previous cached handover's summary text, if this session already\n   *  produced one (the warmup handover, when this call is the refresh).\n   *  Passed through so the new handover can carry it forward rather than\n   *  silently dropping everything it already captured — see the \"pointer\n   *  to the previous handover, kept rather than superseded\" structure. */\n  previousHandover?: string;\n}\n\nexport function buildContextHandoverPrompt(params: HandoverPromptParams): string {\n  const { turns, gitLog, cwd, previousHandover } = params;\n\n  const turnsSection = turns.length > 0\n    ? turns.join(\"\\n\\n\")\n    : \"(No turns extracted)\";\n\n  const gitSection = gitLog.trim() || \"(No git commits during this session)\";\n\n  const previousSection = previousHandover\n    ? `\\nA PREVIOUS HANDOVER already exists for this session (from an earlier, \\\nlower threshold). Carry it forward — start your response with a one-line \\\npointer to it (\"Carries forward from the previous handover, which stays for \\\nits detail.\") and then write only what has happened SINCE it that a compact \\\nwould also lose. Do not re-derive or repeat what it already covered.\\n\\n\\\nPREVIOUS HANDOVER:\\n${previousHandover}\\n`\n    : \"\";\n\n  return `This session is approaching a context-window compaction. Write the \\\nhandover that would let a successor continue WITHOUT re-reading this \\\nconversation and WITHOUT asking the user to repeat themselves.\n\nProject directory: ${cwd}\n${previousSection}\nSCOPING RULE — the single most important instruction here: this is a DIFF \\\nagainst everything already durable, not a summary of the session. Assume \\\nthe successor can and will read git history, the issue tracker, and any \\\nnotes files themselves. Do NOT restate anything recoverable there — no file \\\ninventories, no \"implemented X\" restatements, no chronology of commands run. \\\nWrite down ONLY what existed exclusively in this conversation and would \\\notherwise be gone: the reasoning, not the result.\n\nWrite ONLY the sections below that this session actually has content for — \\\nomit a section entirely rather than writing \"none\" or padding it:\n\nWHERE THIS SESSION ENDED — the concrete state right now: what is verified \\\nworking (tests green, tree clean, etc.) versus merely attempted, any branch \\\nor working-tree state that isn't obvious from git status alone (e.g. a \\\ndetached HEAD, an intentionally uncommitted change, a stash).\n\nWHAT CLOSED — each item paired with the evidence that closed it, not just \\\nthe claim that it did.\n\nWHAT IS FILED AND STILL OPEN — each with its next concrete step or who/what \\\nit is waiting on.\n\nDECISIONS & REASONING — choices actually made, each with why this way and \\\nnot another way.\n\nREJECTED ALTERNATIVES — approaches considered and set aside, and why. An \\\nalternative without a reason is not worth recording.\n\nNEGATIVE RESULTS — something investigated that turned out NOT to be the \\\nanswer, kept WITH the reasoning that ruled it out (e.g. \"X looked like the \\\ncause — it wasn't; the actual mechanism was Y\"). Without the reasoning \\\nattached, a successor re-investigates the same dead end.\n\nTRAPS — anything discovered that is invisible from the repo alone and would \\\notherwise bite a successor immediately (a required manual step, an ordering \\\nconstraint, a state that looks fine but isn't).\n\nCRITICAL VALUES — any specific id, path, URL, credential name, version \\\nnumber, or configuration value that appeared in conversation and whose loss \\\nwould force someone to go find it again.\n\nTHE FEW THINGS THAT MATTER MOST, IF NOTHING ELSE IS READ — at most 3 bullets. \\\nForces a priority judgement; do not pad this to fill space.\n\nFormat your response as markdown with those section headers (only the ones \\\nyou have content for), no other structure.\n\n---\n\nCONVERSATION:\n${turnsSection}\n\nGIT COMMITS:\n${gitSection}`;\n}\n","/**\n * context-handover-worker.ts — the threshold-triggered pre-compaction\n * handover.\n *\n * `session-summary-worker.ts` already spawns a model to write session notes,\n * but only from the PreCompact hook itself — which fires at the compaction\n * boundary, far too late to be injected INTO that same compaction's\n * post-compact context. This worker runs earlier, off a token-count\n * threshold (see ../hooks/ts/lib/context-fill.ts), so a model-written\n * handover already exists in a cache file by the time compaction happens.\n *\n * Deliberately narrow: this does not write a session note, does not touch\n * the session-summary cooldown file, and does not run KG extraction. It\n * writes one thing — a cache file the PreCompact hook can read — because its\n * only job is to exist before compaction does, not to duplicate what\n * session-summary-worker already does well.\n *\n * The prompt itself (see templates/context-handover-prompt.ts) treats the\n * handover as a DIFF against everything already durable — git, the tracker,\n * the notes — not a session summary, and a refresh run carries the previous\n * cached handover forward rather than overwriting it.\n */\n\nimport { existsSync, readFileSync } from \"node:fs\";\n\nimport {\n  findLatestJsonl,\n  getGitContext,\n  spawnSummarizer,\n  contentToText,\n} from \"./session-summary-worker.js\";\nimport { buildContextHandoverPrompt } from \"./templates/context-handover-prompt.js\";\nimport {\n  readContextHandoverCache,\n  writeContextHandoverCache,\n  type HandoverThreshold,\n} from \"../hooks/ts/lib/context-handover-cache.js\";\n\nexport type { HandoverThreshold } from \"../hooks/ts/lib/context-handover-cache.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface ContextHandoverPayload {\n  cwd: string;\n  sessionId: string;\n  transcriptPath?: string;\n  threshold: HandoverThreshold;\n  /** True when this fired via the \"no time for a clean crossing\" path\n   *  (see isImmediate in context-fill.ts) — logged, not otherwise acted on. */\n  urgent?: boolean;\n}\n\n/** How much of the tail of the transcript to feed the summarizer. Generous —\n *  this runs at most twice per session, not on every tool call. */\nconst MAX_TURN_CHARS = 150_000;\n\n/** Max turns to include (a hard floor even if MAX_TURN_CHARS is not hit). */\nconst MAX_TURNS = 120;\n\n// ---------------------------------------------------------------------------\n// Transcript → turns\n// ---------------------------------------------------------------------------\n\n/**\n * Interleaved \"User:\"/\"Assistant:\" turns, oldest-kept-from-the-end so a long\n * transcript is truncated to its most recent content rather than its\n * earliest. Unlike session-summary-worker's extractFromJsonl (which keeps\n * only user messages, because a session note doesn't need the assistant's\n * own reasoning) this keeps BOTH sides — the whole point of this prompt is\n * the assistant's reasoning, which lives in assistant turns.\n */\nfunction extractTurns(jsonlPath: string): string[] {\n  let raw: string;\n  try {\n    raw = readFileSync(jsonlPath, \"utf-8\");\n  } catch {\n    return [];\n  }\n\n  if (raw.length > MAX_TURN_CHARS) {\n    const truncPoint = raw.indexOf(\"\\n\", raw.length - MAX_TURN_CHARS);\n    raw = truncPoint >= 0 ? raw.slice(truncPoint + 1) : raw.slice(-MAX_TURN_CHARS);\n  }\n\n  const turns: string[] = [];\n  for (const line of raw.trim().split(\"\\n\")) {\n    if (!line.trim()) continue;\n    let entry: Record<string, unknown>;\n    try {\n      entry = JSON.parse(line);\n    } catch {\n      continue;\n    }\n\n    if (entry.type === \"user\") {\n      const msg = entry.message as Record<string, unknown> | undefined;\n      const text = contentToText(msg?.content);\n      if (text && text.length >= 3 && !text.startsWith(\"<system-reminder>\")) {\n        turns.push(`User: ${text.slice(0, 2000)}`);\n      }\n    } else if (entry.type === \"assistant\") {\n      const msg = entry.message as Record<string, unknown> | undefined;\n      const text = contentToText(msg?.content);\n      if (text && text.length >= 3) {\n        turns.push(`Assistant: ${text.slice(0, 4000)}`);\n      }\n    }\n  }\n\n  return turns.slice(-MAX_TURNS);\n}\n\n// ---------------------------------------------------------------------------\n// Main entry point\n// ---------------------------------------------------------------------------\n\n/**\n * Process a `context-handover` work item.\n *\n * THROWS on every failure path (missing input, no transcript, no turns, an\n * empty/failed summarizer run) rather than logging and returning silently.\n * That used to be a deliberate choice — avoid the work queue's own retry\n * piling up redundant LLM calls — but it made a real failure invisible: a\n * daemon restart mid-spawn (session 77084e72-...) left no cache, no error\n * anywhere the work queue's own stats could show, and a trigger-side marker\n * that (at the time) had already been set to \"done\". Throwing here makes\n * work-queue-worker.ts call markFailed(), which logs prominently AND is\n * visible via `work_queue_stats` / `pai daemon status` — not just a stderr\n * line that can scroll away. It is a second, faster (seconds-to-minutes\n * backoff) retry path alongside the primary one in context-handover-\n * trigger.ts (which retries on its own ~5-minute cadence based on whether a\n * cache actually appeared); the two are complementary, not redundant — a\n * failed cache write costs nothing to retry twice.\n */\nexport async function handleContextHandover(payload: ContextHandoverPayload): Promise<void> {\n  const { cwd, sessionId, transcriptPath, threshold, urgent } = payload;\n\n  if (!cwd || !sessionId) {\n    throw new Error(\"[context-handover] payload missing cwd or sessionId\");\n  }\n\n  process.stderr.write(\n    `[context-handover] Starting for ${cwd} (session=${sessionId}, threshold=${threshold}` +\n    `${urgent ? \", urgent\" : \"\"}).\\n`\n  );\n\n  let jsonlPath: string | null = transcriptPath && existsSync(transcriptPath) ? transcriptPath : null;\n  if (!jsonlPath) jsonlPath = findLatestJsonl(cwd);\n  if (!jsonlPath) {\n    throw new Error(`[context-handover] No transcript found for ${cwd} (session=${sessionId})`);\n  }\n\n  const turns = extractTurns(jsonlPath);\n  if (turns.length === 0) {\n    throw new Error(`[context-handover] No turns extracted from ${jsonlPath} (session=${sessionId})`);\n  }\n\n  const gitLog = await getGitContext(cwd);\n\n  // Carry the previous handover forward (see buildContextHandoverPrompt's\n  // scoping rule) rather than silently overwriting it — a refresh at the\n  // second threshold should not lose what the warmup handover already\n  // captured.\n  const previous = readContextHandoverCache(sessionId);\n  const prompt = buildContextHandoverPrompt({\n    turns,\n    gitLog,\n    cwd,\n    previousHandover: previous?.summary,\n  });\n  process.stderr.write(`[context-handover] Sending ${prompt.length} char prompt to sonnet...\\n`);\n\n  const summary = await spawnSummarizer(prompt, \"sonnet\");\n  if (!summary || !summary.trim()) {\n    // No cache write on this path — an existing cache from an earlier\n    // successful run is left untouched rather than clobbered with nothing.\n    throw new Error(`[context-handover] sonnet produced no output (session=${sessionId})`);\n  }\n\n  writeContextHandoverCache({\n    sessionId,\n    cwd,\n    threshold,\n    generatedAt: new Date().toISOString(),\n    model: \"sonnet\",\n    summary: summary.trim(),\n  });\n\n  process.stderr.write(\n    `[context-handover] Wrote cache for session ${sessionId} (${summary.length} chars).\\n`\n  );\n}\n","/**\n * topic-detect-worker.ts — Topic shift detection for session note splitting\n *\n * Processes `topic-detect` work items by:\n *   1. Extracting recent user messages from the JSONL transcript\n *   2. Running the BM25-based topic shift detector against the PAI memory DB\n *   3. If a shift is detected, recording a topic boundary marker\n *\n * The actual note splitting is handled by session-summary-worker.ts when it\n * processes the next `session-summary` work item — it uses the TOPIC: line\n * from the summarizer to decide whether to create a new note.\n *\n * This worker provides an additional signal: project-level topic shift\n * (e.g., conversation moved from project A to project B). The session\n * summary worker handles intra-project topic shifts (e.g., from \"dark mode\"\n * to \"keyboard IPC\" within the same project).\n */\n\nimport { existsSync, readFileSync, writeFileSync } from \"node:fs\";\nimport { join, basename } from \"node:path\";\nimport { homedir } from \"node:os\";\n\nimport { detectTopicShift } from \"../topics/detector.js\";\nimport { registryBackend, storageBackend } from \"./daemon/state.js\";\nimport {\n  findNotesDir,\n  getCurrentNotePath,\n  appendCheckpoint,\n} from \"../hooks/ts/lib/project-utils/index.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface TopicDetectPayload {\n  /** Working directory of the session. */\n  cwd: string;\n  /** Recent conversation context (extracted user messages). */\n  context?: string;\n  /** The project slug the session is currently routed to. */\n  currentProject?: string;\n  /** Path to the JSONL transcript (optional — used to extract context if not provided). */\n  transcriptPath?: string;\n  /** Session ID (for logging). */\n  sessionId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// JSONL context extraction (lightweight — just last few user messages)\n// ---------------------------------------------------------------------------\n\nconst MAX_CONTEXT_MESSAGES = 5;\nconst MAX_CONTEXT_CHARS = 2000;\n\n/**\n * Extract recent user messages from a JSONL transcript for topic detection.\n * Takes only the last few messages to represent the current topic.\n */\nfunction extractRecentContext(jsonlPath: string): string {\n  try {\n    const raw = readFileSync(jsonlPath, \"utf-8\");\n    // Read from the end — last 50KB should be more than enough\n    const tail = raw.length > 50_000 ? raw.slice(-50_000) : raw;\n    const lines = tail.trim().split(\"\\n\");\n\n    const messages: string[] = [];\n\n    for (let i = lines.length - 1; i >= 0 && messages.length < MAX_CONTEXT_MESSAGES; i--) {\n      const line = lines[i].trim();\n      if (!line) continue;\n\n      try {\n        const entry = JSON.parse(line) as Record<string, unknown>;\n        if (entry.type === \"user\") {\n          const msg = entry.message as Record<string, unknown> | undefined;\n          if (msg?.content) {\n            const text = contentToText(msg.content);\n            if (text && text.length > 3) {\n              messages.unshift(text.slice(0, 500));\n            }\n          }\n        }\n      } catch { /* skip invalid JSON */ }\n    }\n\n    return messages.join(\"\\n\\n\").slice(0, MAX_CONTEXT_CHARS);\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert Claude content (string or content block array) to plain text. */\nfunction contentToText(content: unknown): string {\n  if (typeof content === \"string\") return content;\n  if (Array.isArray(content)) {\n    return content\n      .map((c) => {\n        if (typeof c === \"string\") return c;\n        const block = c as Record<string, unknown>;\n        if (block?.text) return String(block.text);\n        if (block?.content) return String(block.content);\n        return \"\";\n      })\n      .join(\" \")\n      .trim();\n  }\n  return \"\";\n}\n\n// ---------------------------------------------------------------------------\n// Topic boundary file — signals to session-summary-worker\n// ---------------------------------------------------------------------------\n\nconst TOPIC_BOUNDARY_FILE = \"topic-boundary.json\";\n\ninterface TopicBoundary {\n  timestamp: string;\n  previousProject: string | null;\n  suggestedProject: string | null;\n  confidence: number;\n  context: string;\n}\n\n/**\n * Write a topic boundary marker into the Notes directory.\n * The session-summary-worker checks for this file and uses it as an\n * additional signal that a new note should be created.\n */\nfunction writeTopicBoundary(\n  cwd: string,\n  boundary: TopicBoundary\n): void {\n  try {\n    const notesInfo = findNotesDir(cwd);\n    const boundaryPath = join(notesInfo.path, TOPIC_BOUNDARY_FILE);\n    writeFileSync(boundaryPath, JSON.stringify(boundary, null, 2), \"utf-8\");\n    process.stderr.write(\n      `[topic-detect] Wrote topic boundary marker: ${boundaryPath}\\n`\n    );\n  } catch (e) {\n    process.stderr.write(`[topic-detect] Could not write boundary marker: ${e}\\n`);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Main entry point\n// ---------------------------------------------------------------------------\n\n/**\n * Process a `topic-detect` work item.\n *\n * Called by work-queue-worker.ts. Throws on fatal errors so the work queue\n * retry logic handles them.\n */\nexport async function handleTopicDetect(payload: TopicDetectPayload): Promise<void> {\n  const { cwd, currentProject, transcriptPath, sessionId } = payload;\n\n  if (!cwd) {\n    throw new Error(\"topic-detect payload missing cwd\");\n  }\n\n  process.stderr.write(\n    `[topic-detect] Starting for ${cwd}` +\n    `${currentProject ? ` (project=${currentProject})` : \"\"}` +\n    `${sessionId ? ` (session=${sessionId})` : \"\"}\\n`\n  );\n\n  // Check that daemon state is available\n  if (!registryBackend || !storageBackend) {\n    process.stderr.write(\n      \"[topic-detect] Registry backend or storage backend not available — skipping.\\n\"\n    );\n    return;\n  }\n\n  // Extract context from payload or transcript\n  let context = payload.context || \"\";\n\n  if (!context && transcriptPath && existsSync(transcriptPath)) {\n    context = extractRecentContext(transcriptPath);\n  }\n\n  if (!context || context.trim().length < 10) {\n    process.stderr.write(\n      \"[topic-detect] Insufficient context for topic detection — skipping.\\n\"\n    );\n    return;\n  }\n\n  process.stderr.write(\n    `[topic-detect] Context: ${context.length} chars, checking against memory...\\n`\n  );\n\n  // Run the BM25-based topic shift detector\n  const result = await detectTopicShift(registryBackend, storageBackend, {\n    context,\n    currentProject,\n    threshold: 0.6,\n    candidates: 20,\n  });\n\n  process.stderr.write(\n    `[topic-detect] Result: shifted=${result.shifted}, ` +\n    `suggested=${result.suggestedProject}, confidence=${result.confidence.toFixed(2)}, ` +\n    `chunks=${result.chunkCount}\\n`\n  );\n\n  if (result.topProjects.length > 0) {\n    process.stderr.write(\n      `[topic-detect] Top projects: ${result.topProjects.map(\n        (p) => `${p.slug}(${(p.score * 100).toFixed(0)}%)`\n      ).join(\", \")}\\n`\n    );\n  }\n\n  if (result.shifted) {\n    // Record the topic boundary\n    writeTopicBoundary(cwd, {\n      timestamp: new Date().toISOString(),\n      previousProject: result.currentProject,\n      suggestedProject: result.suggestedProject,\n      confidence: result.confidence,\n      context: context.slice(0, 200),\n    });\n\n    // Also append a checkpoint to the current session note\n    try {\n      const notesInfo = findNotesDir(cwd);\n      const notePath = getCurrentNotePath(notesInfo.path);\n      if (notePath) {\n        appendCheckpoint(\n          notePath,\n          `Topic shift detected: conversation moved from **${result.currentProject}** ` +\n          `to **${result.suggestedProject}** (confidence: ${(result.confidence * 100).toFixed(0)}%). ` +\n          `A new session note will be created for the new topic.`\n        );\n      }\n    } catch (e) {\n      process.stderr.write(`[topic-detect] Could not append checkpoint: ${e}\\n`);\n    }\n  }\n\n  process.stderr.write(\"[topic-detect] Done.\\n\");\n}\n","/**\n * work-queue-worker.ts — Daemon worker loop for the persistent work queue\n *\n * Runs every 5 seconds to drain the queue.\n * Handles 'session-end' work items by reading the transcript, extracting\n * work summaries, updating the session note, and updating TODO.md.\n * Handles 'session-summary' items by spawning Haiku for AI-powered note generation.\n * Handles 'context-handover' items by spawning Sonnet to write the\n * threshold-triggered pre-compaction reasoning handover (see\n * context-handover-worker.ts and hooks/ts/lib/context-fill.ts).\n * Handles 'registry-scan' items by running performScan() against the registry DB.\n *\n * Handles 'topic-detect' items by running BM25-based topic shift detection.\n * Other item types (note-update, todo-update) are stubs — they log and\n * complete immediately, ready for future expansion.\n */\n\nimport { readFileSync } from \"node:fs\";\nimport { basename, dirname } from \"node:path\";\n\nimport {\n  dequeue,\n  enqueue,\n  markCompleted,\n  markFailed,\n  cleanup,\n  getStats,\n  hasPendingOrProcessingOfType,\n  type WorkItem,\n} from \"./work-queue.js\";\n\nimport {\n  handleSessionSummary,\n  type SessionSummaryPayload,\n} from \"./session-summary-worker.js\";\n\nimport {\n  handleContextHandover,\n  type ContextHandoverPayload,\n} from \"./context-handover-worker.js\";\n\nimport {\n  handleTopicDetect,\n  type TopicDetectPayload,\n} from \"./topic-detect-worker.js\";\n\n// Registry scan — called from handleRegistryScan()\nimport { performScan } from \"../cli/commands/registry/scan.js\";\nimport { registryBackend } from \"./daemon/state.js\";\n\n// Hooks lib imports — resolving through the compiled JS path.\n// These are the same utilities used by stop-hook.ts.\nimport {\n  findNotesDir,\n  getCurrentNotePath,\n  addWorkToSessionNote,\n  finalizeSessionNote,\n  updateTodoContinue, sessionIdFromTranscript,\n  archiveSessionFilesToSessionsDir,\n  type WorkItem as NoteWorkItem,\n} from \"../hooks/ts/lib/project-utils/index.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst WORKER_INTERVAL_MS = 5_000;\nconst HOUSEKEEPING_INTERVAL_MS = 10 * 60 * 1000; // 10 minutes\n\n// ---------------------------------------------------------------------------\n// Timers (stored so shutdown can clear them)\n// ---------------------------------------------------------------------------\n\nlet workerTimer: ReturnType<typeof setInterval> | null = null;\nlet housekeepingTimer: ReturnType<typeof setInterval> | null = null;\nlet _immediateSignal = false;\n\n// ---------------------------------------------------------------------------\n// Worker loop\n// ---------------------------------------------------------------------------\n\n/** Start the background worker and housekeeping timers. */\nexport function startWorker(): void {\n  process.stderr.write(\"[work-queue-worker] Starting worker loop.\\n\");\n\n  workerTimer = setInterval(async () => {\n    try {\n      await processNextItem();\n    } catch (e) {\n      process.stderr.write(`[work-queue-worker] Uncaught error in worker loop: ${e}\\n`);\n    }\n  }, WORKER_INTERVAL_MS);\n\n  housekeepingTimer = setInterval(() => {\n    try {\n      cleanup();\n    } catch (e) {\n      process.stderr.write(`[work-queue-worker] Housekeeping error: ${e}\\n`);\n    }\n  }, HOUSEKEEPING_INTERVAL_MS);\n\n  process.stderr.write(\"[work-queue-worker] Worker started (interval=5s, housekeeping=10min).\\n\");\n}\n\n/** Stop the worker timers gracefully. */\nexport function stopWorker(): void {\n  if (workerTimer !== null) {\n    clearInterval(workerTimer);\n    workerTimer = null;\n  }\n  if (housekeepingTimer !== null) {\n    clearInterval(housekeepingTimer);\n    housekeepingTimer = null;\n  }\n  process.stderr.write(\"[work-queue-worker] Worker stopped.\\n\");\n}\n\n/**\n * Signal that new work has been enqueued.\n * The worker will run on its next tick — we don't need to reset the timer\n * since 5 s is fast enough. The flag allows future optimisations.\n */\nexport function notifyNewWork(): void {\n  _immediateSignal = true;\n}\n\n// ---------------------------------------------------------------------------\n// Item processor (sequential — one item per tick)\n// ---------------------------------------------------------------------------\n\nasync function processNextItem(): Promise<void> {\n  const item = dequeue();\n  if (!item) return;\n\n  process.stderr.write(\n    `[work-queue-worker] Processing ${item.type} (id=${item.id}, attempt=${item.attempts}).\\n`\n  );\n\n  try {\n    switch (item.type) {\n      case \"session-end\":\n        await handleSessionEnd(item);\n        break;\n\n      case \"session-summary\":\n        await handleSessionSummary(item.payload as unknown as SessionSummaryPayload);\n        break;\n\n      case \"context-handover\":\n        await handleContextHandover(item.payload as unknown as ContextHandoverPayload);\n        break;\n\n      case \"topic-detect\":\n        await handleTopicDetect(item.payload as unknown as TopicDetectPayload);\n        break;\n\n      case \"registry-scan\":\n        await handleRegistryScan();\n        break;\n\n      case \"note-update\":\n      case \"todo-update\":\n        // Stubs — log and complete\n        process.stderr.write(\n          `[work-queue-worker] Item type '${item.type}' is not yet implemented — completing as no-op.\\n`\n        );\n        break;\n\n      default:\n        throw new Error(`Unknown work item type: ${(item as WorkItem).type}`);\n    }\n\n    markCompleted(item.id);\n    process.stderr.write(`[work-queue-worker] Completed ${item.type} (id=${item.id}).\\n`);\n  } catch (e) {\n    const msg = e instanceof Error ? e.message : String(e);\n    markFailed(item.id, msg);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// session-end handler\n// ---------------------------------------------------------------------------\n\n/**\n * Process a 'session-end' work item.\n *\n * Expected payload:\n *   transcriptPath: string   — absolute path to the .jsonl transcript\n *   cwd: string              — working directory of the session\n *   message?: string         — COMPLETED: line extracted by the hook (optional)\n */\nasync function handleSessionEnd(item: WorkItem): Promise<void> {\n  const { transcriptPath, cwd, message: hookMessage } = item.payload as {\n    transcriptPath: string;\n    cwd: string;\n    message?: string;\n  };\n\n  if (!transcriptPath) throw new Error(\"session-end payload missing transcriptPath\");\n  if (!cwd) throw new Error(\"session-end payload missing cwd\");\n\n  // Read transcript\n  let transcript: string;\n  try {\n    transcript = readFileSync(transcriptPath, \"utf-8\");\n  } catch (e) {\n    throw new Error(`Could not read transcript at ${transcriptPath}: ${e}`);\n  }\n\n  const lines = transcript.trim().split(\"\\n\");\n\n  // Extract work items from transcript\n  const workItems = extractWorkFromTranscript(lines);\n\n  // Determine completion message\n  let message = hookMessage ?? \"\";\n  if (!message) {\n    const lastEntry = tryParseJson(lines[lines.length - 1]) as\n      | { type?: string; message?: { content?: unknown } }\n      | null;\n    if (lastEntry?.type === \"assistant\" && lastEntry.message?.content) {\n      const content = contentToText(lastEntry.message.content);\n      const m = content.match(/COMPLETED:\\s*(.+?)(?:\\n|$)/i);\n      if (m) {\n        message = m[1].trim().replace(/\\*+/g, \"\").replace(/\\[.*?\\]/g, \"\").trim();\n      }\n    }\n  }\n\n  // Find notes directory and current note\n  const notesInfo = findNotesDir(cwd);\n  const currentNotePath = getCurrentNotePath(notesInfo.path);\n\n  if (currentNotePath) {\n    // Add work items to session note\n    if (workItems.length > 0) {\n      addWorkToSessionNote(currentNotePath, workItems);\n      process.stderr.write(\n        `[work-queue-worker] Added ${workItems.length} work item(s) to note.\\n`\n      );\n    } else if (message) {\n      addWorkToSessionNote(currentNotePath, [{ title: message, completed: true }]);\n      process.stderr.write(\"[work-queue-worker] Added completion message to note.\\n\");\n    }\n\n    // Finalize the note\n    const summary = message || \"Session completed.\";\n    finalizeSessionNote(currentNotePath, summary);\n    process.stderr.write(\n      `[work-queue-worker] Finalized session note: ${basename(currentNotePath)}.\\n`\n    );\n\n    // Update TODO.md ## Continue section.\n    //\n    // A session that produced neither work items nor a completion message has\n    // no handover to write. Claiming the slot anyway hands the next session a\n    // block naming a session that did nothing — see the 2026-08-04 incident\n    // recorded in AIBroker's Notes. applyContinue now refuses such a write on\n    // its own; this skips building it in the first place, so the \"last session\"\n    // line keeps pointing at the last session that actually did something.\n    if (workItems.length === 0 && !message) {\n      process.stderr.write(\n        \"[work-queue-worker] Nothing to hand over — leaving TODO.md ## Continue intact.\\n\"\n      );\n    } else {\n      try {\n        const stateLines: string[] = [];\n        stateLines.push(`Working directory: ${cwd}`);\n        if (workItems.length > 0) {\n          stateLines.push(\"\", \"Work completed:\");\n          for (const wi of workItems.slice(0, 5)) {\n            stateLines.push(`- ${wi.title}`);\n          }\n        }\n        if (message) {\n          stateLines.push(\"\", `Last completed: ${message}`);\n        }\n        updateTodoContinue(\n          cwd,\n          basename(currentNotePath),\n          stateLines.join(\"\\n\"),\n          \"session-end\",\n          // Same reasoning as the stop hook: the transcript filename is the\n          // session's real identity, and the note title is not.\n          sessionIdFromTranscript(transcriptPath)\n        );\n      } catch (todoError) {\n        // Non-fatal — log and continue\n        process.stderr.write(\n          `[work-queue-worker] Could not update TODO.md: ${todoError}\\n`\n        );\n      }\n    }\n  } else {\n    process.stderr.write(\n      \"[work-queue-worker] No current session note found — skipping note update.\\n\"\n    );\n  }\n\n  // Move session .jsonl files to sessions/ subdirectory\n  try {\n    const transcriptDir = dirname(transcriptPath);\n    const archivedCount = archiveSessionFilesToSessionsDir(transcriptDir);\n    if (archivedCount > 0) {\n      process.stderr.write(\n        `[work-queue-worker] Archived ${archivedCount} session file(s) to sessions/.\\n`\n      );\n    }\n  } catch (moveError) {\n    // Non-fatal\n    process.stderr.write(`[work-queue-worker] Could not move session files: ${moveError}\\n`);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// registry-scan handler\n// ---------------------------------------------------------------------------\n\n/**\n * Run performScan() against the registry DB.\n *\n * Debounce: if another registry-scan job is already pending in the queue,\n * we still run this one (dequeue already picked it), but enqueueRegistryScan()\n * checks before enqueuing so duplicates rarely reach here.\n */\nasync function handleRegistryScan(): Promise<void> {\n  if (!registryBackend) {\n    throw new Error(\"registry-scan: registryBackend not initialized yet\");\n  }\n\n  const t0 = Date.now();\n  process.stderr.write(\"[work-queue-worker] Running registry scan...\\n\");\n\n  const result = await performScan();\n  const elapsed = Date.now() - t0;\n\n  process.stderr.write(\n    `[work-queue-worker] Registry scan complete: ` +\n    `${result.projectsScanned} projects (${result.projectsNew} new, ${result.projectsUpdated} updated), ` +\n    `${result.sessionsScanned} sessions (${result.sessionsNew} new) in ${elapsed}ms.\\n`\n  );\n\n  if (result.skipped.length > 0) {\n    process.stderr.write(\n      `[work-queue-worker] Registry scan: ${result.skipped.length} project(s) skipped (path not found).\\n`\n    );\n  }\n}\n\n/**\n * Enqueue a registry-scan work item — debounced.\n * If a registry-scan item is already pending or processing, skip enqueue.\n */\nexport function enqueueRegistryScan(): void {\n  // Debounce: skip if already queued or processing\n  if (hasPendingOrProcessingOfType(\"registry-scan\")) {\n    process.stderr.write(\"[work-queue-worker] Registry scan already pending/processing — skipping duplicate enqueue.\\n\");\n    return;\n  }\n\n  enqueue({\n    type: \"registry-scan\",\n    priority: 5, // lowest priority — runs after session-end, session-summary\n    payload: {},\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Transcript parsing helpers (mirrors stop-hook.ts logic)\n// ---------------------------------------------------------------------------\n\nfunction tryParseJson(line: string): Record<string, unknown> | null {\n  try {\n    return JSON.parse(line) as Record<string, unknown>;\n  } catch {\n    return null;\n  }\n}\n\nfunction contentToText(content: unknown): string {\n  if (typeof content === \"string\") return content;\n  if (Array.isArray(content)) {\n    return content\n      .map((c) => {\n        if (typeof c === \"string\") return c;\n        const block = c as Record<string, unknown>;\n        if (block?.text) return String(block.text);\n        if (block?.content) return String(block.content);\n        return \"\";\n      })\n      .join(\" \")\n      .trim();\n  }\n  return \"\";\n}\n\nfunction extractWorkFromTranscript(lines: string[]): NoteWorkItem[] {\n  const workItems: NoteWorkItem[] = [];\n  const seenSummaries = new Set<string>();\n\n  for (const line of lines) {\n    const entry = tryParseJson(line);\n    if (!entry || entry.type !== \"assistant\") continue;\n\n    const msg = entry.message as Record<string, unknown> | undefined;\n    if (!msg?.content) continue;\n\n    const content = contentToText(msg.content);\n\n    // SUMMARY: line (preferred)\n    const summaryMatch = content.match(/SUMMARY:\\s*(.+?)(?:\\n|$)/i);\n    if (summaryMatch) {\n      const summary = summaryMatch[1].trim();\n      if (summary && !seenSummaries.has(summary) && summary.length > 5) {\n        seenSummaries.add(summary);\n\n        const details: string[] = [];\n        const actionsMatch = content.match(/ACTIONS:\\s*(.+?)(?=\\n[A-Z]+:|$)/is);\n        if (actionsMatch) {\n          const actionLines = actionsMatch[1]\n            .split(\"\\n\")\n            .map((l) =>\n              l.replace(/^[-*•]\\s*/, \"\").replace(/^\\d+\\.\\s*/, \"\").trim()\n            )\n            .filter((l) => l.length > 3 && l.length < 100);\n          details.push(...actionLines.slice(0, 3));\n        }\n\n        workItems.push({\n          title: summary,\n          details: details.length > 0 ? details : undefined,\n          completed: true,\n        });\n      }\n    }\n\n    // COMPLETED: line (fallback)\n    const completedMatch = content.match(/COMPLETED:\\s*(.+?)(?:\\n|$)/i);\n    if (completedMatch && workItems.length === 0) {\n      const completed = completedMatch[1]\n        .trim()\n        .replace(/\\*+/g, \"\")\n        .replace(/\\[.*?\\]/g, \"\")\n        .trim();\n      if (completed && !seenSummaries.has(completed) && completed.length > 5) {\n        seenSummaries.add(completed);\n        workItems.push({ title: completed, completed: true });\n      }\n    }\n  }\n\n  return workItems;\n}\n"],"mappings":";;;;;;;AAyCA,SAAgB,2BAA2B,QAAsC;CAC/E,MAAM,EAAE,OAAO,QAAQ,KAAK,qBAAqB;CAEjD,MAAM,eAAe,MAAM,SAAS,IAChC,MAAM,KAAK,OAAO,GAClB;CAEJ,MAAM,aAAa,OAAO,MAAM,IAAI;AAWpC,QAAO;;;;qBAIY,IAAI;EAbC,mBACpB;;;;;sBAKgB,iBAAiB,MACjC,GAOY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAmDhB,aAAa;;;EAGb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9DF,MAAM,iBAAiB;;AAGvB,MAAM,YAAY;;;;;;;;;AAclB,SAAS,aAAa,WAA6B;CACjD,IAAI;AACJ,KAAI;AACF,QAAM,aAAa,WAAW,QAAQ;SAChC;AACN,SAAO,EAAE;;AAGX,KAAI,IAAI,SAAS,gBAAgB;EAC/B,MAAM,aAAa,IAAI,QAAQ,MAAM,IAAI,SAAS,eAAe;AACjE,QAAM,cAAc,IAAI,IAAI,MAAM,aAAa,EAAE,GAAG,IAAI,MAAM,CAAC,eAAe;;CAGhF,MAAM,QAAkB,EAAE;AAC1B,MAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;AACzC,MAAI,CAAC,KAAK,MAAM,CAAE;EAClB,IAAI;AACJ,MAAI;AACF,WAAQ,KAAK,MAAM,KAAK;UAClB;AACN;;AAGF,MAAI,MAAM,SAAS,QAAQ;GACzB,MAAM,MAAM,MAAM;GAClB,MAAM,OAAOA,gBAAc,KAAK,QAAQ;AACxC,OAAI,QAAQ,KAAK,UAAU,KAAK,CAAC,KAAK,WAAW,oBAAoB,CACnE,OAAM,KAAK,SAAS,KAAK,MAAM,GAAG,IAAK,GAAG;aAEnC,MAAM,SAAS,aAAa;GACrC,MAAM,MAAM,MAAM;GAClB,MAAM,OAAOA,gBAAc,KAAK,QAAQ;AACxC,OAAI,QAAQ,KAAK,UAAU,EACzB,OAAM,KAAK,cAAc,KAAK,MAAM,GAAG,IAAK,GAAG;;;AAKrD,QAAO,MAAM,MAAM,CAAC,UAAU;;;;;;;;;;;;;;;;;;;;AAyBhC,eAAsB,sBAAsB,SAAgD;CAC1F,MAAM,EAAE,KAAK,WAAW,gBAAgB,WAAW,WAAW;AAE9D,KAAI,CAAC,OAAO,CAAC,UACX,OAAM,IAAI,MAAM,sDAAsD;AAGxE,SAAQ,OAAO,MACb,mCAAmC,IAAI,YAAY,UAAU,cAAc,YACxE,SAAS,aAAa,GAAG,MAC7B;CAED,IAAI,YAA2B,kBAAkB,WAAW,eAAe,GAAG,iBAAiB;AAC/F,KAAI,CAAC,UAAW,aAAY,gBAAgB,IAAI;AAChD,KAAI,CAAC,UACH,OAAM,IAAI,MAAM,8CAA8C,IAAI,YAAY,UAAU,GAAG;CAG7F,MAAM,QAAQ,aAAa,UAAU;AACrC,KAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM,8CAA8C,UAAU,YAAY,UAAU,GAAG;CAUnG,MAAM,SAAS,2BAA2B;EACxC;EACA,QATa,MAAM,cAAc,IAAI;EAUrC;EACA,kBALe,yBAAyB,UAAU,EAKtB;EAC7B,CAAC;AACF,SAAQ,OAAO,MAAM,8BAA8B,OAAO,OAAO,6BAA6B;CAE9F,MAAM,UAAU,MAAM,gBAAgB,QAAQ,SAAS;AACvD,KAAI,CAAC,WAAW,CAAC,QAAQ,MAAM,CAG7B,OAAM,IAAI,MAAM,yDAAyD,UAAU,GAAG;AAGxF,2BAA0B;EACxB;EACA;EACA;EACA,8BAAa,IAAI,MAAM,EAAC,aAAa;EACrC,OAAO;EACP,SAAS,QAAQ,MAAM;EACxB,CAAC;AAEF,SAAQ,OAAO,MACb,8CAA8C,UAAU,IAAI,QAAQ,OAAO,YAC5E;;;;;;;;;;;;;;;;;;;;;;AC7IH,MAAM,uBAAuB;AAC7B,MAAM,oBAAoB;;;;;AAM1B,SAAS,qBAAqB,WAA2B;AACvD,KAAI;EACF,MAAM,MAAM,aAAa,WAAW,QAAQ;EAG5C,MAAM,SADO,IAAI,SAAS,MAAS,IAAI,MAAM,KAAQ,GAAG,KACrC,MAAM,CAAC,MAAM,KAAK;EAErC,MAAM,WAAqB,EAAE;AAE7B,OAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,sBAAsB,KAAK;GACpF,MAAM,OAAO,MAAM,GAAG,MAAM;AAC5B,OAAI,CAAC,KAAM;AAEX,OAAI;IACF,MAAM,QAAQ,KAAK,MAAM,KAAK;AAC9B,QAAI,MAAM,SAAS,QAAQ;KACzB,MAAM,MAAM,MAAM;AAClB,SAAI,KAAK,SAAS;MAChB,MAAM,OAAOC,gBAAc,IAAI,QAAQ;AACvC,UAAI,QAAQ,KAAK,SAAS,EACxB,UAAS,QAAQ,KAAK,MAAM,GAAG,IAAI,CAAC;;;WAIpC;;AAGV,SAAO,SAAS,KAAK,OAAO,CAAC,MAAM,GAAG,kBAAkB;SAClD;AACN,SAAO;;;;AAKX,SAASA,gBAAc,SAA0B;AAC/C,KAAI,OAAO,YAAY,SAAU,QAAO;AACxC,KAAI,MAAM,QAAQ,QAAQ,CACxB,QAAO,QACJ,KAAK,MAAM;AACV,MAAI,OAAO,MAAM,SAAU,QAAO;EAClC,MAAM,QAAQ;AACd,MAAI,OAAO,KAAM,QAAO,OAAO,MAAM,KAAK;AAC1C,MAAI,OAAO,QAAS,QAAO,OAAO,MAAM,QAAQ;AAChD,SAAO;GACP,CACD,KAAK,IAAI,CACT,MAAM;AAEX,QAAO;;AAOT,MAAM,sBAAsB;;;;;;AAe5B,SAAS,mBACP,KACA,UACM;AACN,KAAI;EAEF,MAAM,eAAe,KADH,aAAa,IAAI,CACC,MAAM,oBAAoB;AAC9D,gBAAc,cAAc,KAAK,UAAU,UAAU,MAAM,EAAE,EAAE,QAAQ;AACvE,UAAQ,OAAO,MACb,+CAA+C,aAAa,IAC7D;UACM,GAAG;AACV,UAAQ,OAAO,MAAM,mDAAmD,EAAE,IAAI;;;;;;;;;AAclF,eAAsB,kBAAkB,SAA4C;CAClF,MAAM,EAAE,KAAK,gBAAgB,gBAAgB,cAAc;AAE3D,KAAI,CAAC,IACH,OAAM,IAAI,MAAM,mCAAmC;AAGrD,SAAQ,OAAO,MACb,+BAA+B,MAC5B,iBAAiB,aAAa,eAAe,KAAK,KAClD,YAAY,aAAa,UAAU,KAAK,GAAG,IAC/C;AAGD,KAAI,CAAC,mBAAmB,CAAC,gBAAgB;AACvC,UAAQ,OAAO,MACb,iFACD;AACD;;CAIF,IAAI,UAAU,QAAQ,WAAW;AAEjC,KAAI,CAAC,WAAW,kBAAkB,WAAW,eAAe,CAC1D,WAAU,qBAAqB,eAAe;AAGhD,KAAI,CAAC,WAAW,QAAQ,MAAM,CAAC,SAAS,IAAI;AAC1C,UAAQ,OAAO,MACb,wEACD;AACD;;AAGF,SAAQ,OAAO,MACb,2BAA2B,QAAQ,OAAO,sCAC3C;CAGD,MAAM,SAAS,MAAM,iBAAiB,iBAAiB,gBAAgB;EACrE;EACA;EACA,WAAW;EACX,YAAY;EACb,CAAC;AAEF,SAAQ,OAAO,MACb,kCAAkC,OAAO,QAAQ,cACpC,OAAO,iBAAiB,eAAe,OAAO,WAAW,QAAQ,EAAE,CAAC,WACvE,OAAO,WAAW,IAC7B;AAED,KAAI,OAAO,YAAY,SAAS,EAC9B,SAAQ,OAAO,MACb,gCAAgC,OAAO,YAAY,KAChD,MAAM,GAAG,EAAE,KAAK,IAAI,EAAE,QAAQ,KAAK,QAAQ,EAAE,CAAC,IAChD,CAAC,KAAK,KAAK,CAAC,IACd;AAGH,KAAI,OAAO,SAAS;AAElB,qBAAmB,KAAK;GACtB,4BAAW,IAAI,MAAM,EAAC,aAAa;GACnC,iBAAiB,OAAO;GACxB,kBAAkB,OAAO;GACzB,YAAY,OAAO;GACnB,SAAS,QAAQ,MAAM,GAAG,IAAI;GAC/B,CAAC;AAGF,MAAI;GAEF,MAAM,WAAW,mBADC,aAAa,IAAI,CACW,KAAK;AACnD,OAAI,SACF,kBACE,UACA,mDAAmD,OAAO,eAAe,UACjE,OAAO,iBAAiB,mBAAmB,OAAO,aAAa,KAAK,QAAQ,EAAE,CAAC,2DAExF;WAEI,GAAG;AACV,WAAQ,OAAO,MAAM,+CAA+C,EAAE,IAAI;;;AAI9E,SAAQ,OAAO,MAAM,yBAAyB;;;;;;;;;;;;;;;;;;;;;AChLhD,MAAM,qBAAqB;AAC3B,MAAM,2BAA2B,MAAU;AAM3C,IAAI,cAAqD;AACzD,IAAI,oBAA2D;;AAQ/D,SAAgB,cAAoB;AAClC,SAAQ,OAAO,MAAM,8CAA8C;AAEnE,eAAc,YAAY,YAAY;AACpC,MAAI;AACF,SAAM,iBAAiB;WAChB,GAAG;AACV,WAAQ,OAAO,MAAM,sDAAsD,EAAE,IAAI;;IAElF,mBAAmB;AAEtB,qBAAoB,kBAAkB;AACpC,MAAI;AACF,YAAS;WACF,GAAG;AACV,WAAQ,OAAO,MAAM,2CAA2C,EAAE,IAAI;;IAEvE,yBAAyB;AAE5B,SAAQ,OAAO,MAAM,0EAA0E;;;AAIjG,SAAgB,aAAmB;AACjC,KAAI,gBAAgB,MAAM;AACxB,gBAAc,YAAY;AAC1B,gBAAc;;AAEhB,KAAI,sBAAsB,MAAM;AAC9B,gBAAc,kBAAkB;AAChC,sBAAoB;;AAEtB,SAAQ,OAAO,MAAM,wCAAwC;;;;;;;AAQ/D,SAAgB,gBAAsB;AAQtC,eAAe,kBAAiC;CAC9C,MAAM,OAAO,SAAS;AACtB,KAAI,CAAC,KAAM;AAEX,SAAQ,OAAO,MACb,kCAAkC,KAAK,KAAK,OAAO,KAAK,GAAG,YAAY,KAAK,SAAS,MACtF;AAED,KAAI;AACF,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,UAAM,iBAAiB,KAAK;AAC5B;GAEF,KAAK;AACH,UAAM,qBAAqB,KAAK,QAA4C;AAC5E;GAEF,KAAK;AACH,UAAM,sBAAsB,KAAK,QAA6C;AAC9E;GAEF,KAAK;AACH,UAAM,kBAAkB,KAAK,QAAyC;AACtE;GAEF,KAAK;AACH,UAAM,oBAAoB;AAC1B;GAEF,KAAK;GACL,KAAK;AAEH,YAAQ,OAAO,MACb,kCAAkC,KAAK,KAAK,mDAC7C;AACD;GAEF,QACE,OAAM,IAAI,MAAM,2BAA4B,KAAkB,OAAO;;AAGzE,gBAAc,KAAK,GAAG;AACtB,UAAQ,OAAO,MAAM,iCAAiC,KAAK,KAAK,OAAO,KAAK,GAAG,MAAM;UAC9E,GAAG;EACV,MAAM,MAAM,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;AACtD,aAAW,KAAK,IAAI,IAAI;;;;;;;;;;;AAgB5B,eAAe,iBAAiB,MAA+B;CAC7D,MAAM,EAAE,gBAAgB,KAAK,SAAS,gBAAgB,KAAK;AAM3D,KAAI,CAAC,eAAgB,OAAM,IAAI,MAAM,6CAA6C;AAClF,KAAI,CAAC,IAAK,OAAM,IAAI,MAAM,kCAAkC;CAG5D,IAAI;AACJ,KAAI;AACF,eAAa,aAAa,gBAAgB,QAAQ;UAC3C,GAAG;AACV,QAAM,IAAI,MAAM,gCAAgC,eAAe,IAAI,IAAI;;CAGzE,MAAM,QAAQ,WAAW,MAAM,CAAC,MAAM,KAAK;CAG3C,MAAM,YAAY,0BAA0B,MAAM;CAGlD,IAAI,UAAU,eAAe;AAC7B,KAAI,CAAC,SAAS;EACZ,MAAM,YAAY,aAAa,MAAM,MAAM,SAAS,GAAG;AAGvD,MAAI,WAAW,SAAS,eAAe,UAAU,SAAS,SAAS;GAEjE,MAAM,IADU,cAAc,UAAU,QAAQ,QAAQ,CACtC,MAAM,8BAA8B;AACtD,OAAI,EACF,WAAU,EAAE,GAAG,MAAM,CAAC,QAAQ,QAAQ,GAAG,CAAC,QAAQ,YAAY,GAAG,CAAC,MAAM;;;CAO9E,MAAM,kBAAkB,mBADN,aAAa,IAAI,CACkB,KAAK;AAE1D,KAAI,iBAAiB;AAEnB,MAAI,UAAU,SAAS,GAAG;AACxB,wBAAqB,iBAAiB,UAAU;AAChD,WAAQ,OAAO,MACb,6BAA6B,UAAU,OAAO,0BAC/C;aACQ,SAAS;AAClB,wBAAqB,iBAAiB,CAAC;IAAE,OAAO;IAAS,WAAW;IAAM,CAAC,CAAC;AAC5E,WAAQ,OAAO,MAAM,0DAA0D;;AAKjF,sBAAoB,iBADJ,WAAW,qBACkB;AAC7C,UAAQ,OAAO,MACb,+CAA+C,SAAS,gBAAgB,CAAC,KAC1E;AAUD,MAAI,UAAU,WAAW,KAAK,CAAC,QAC7B,SAAQ,OAAO,MACb,mFACD;MAED,KAAI;GACF,MAAM,aAAuB,EAAE;AAC/B,cAAW,KAAK,sBAAsB,MAAM;AAC5C,OAAI,UAAU,SAAS,GAAG;AACxB,eAAW,KAAK,IAAI,kBAAkB;AACtC,SAAK,MAAM,MAAM,UAAU,MAAM,GAAG,EAAE,CACpC,YAAW,KAAK,KAAK,GAAG,QAAQ;;AAGpC,OAAI,QACF,YAAW,KAAK,IAAI,mBAAmB,UAAU;AAEnD,sBACE,KACA,SAAS,gBAAgB,EACzB,WAAW,KAAK,KAAK,EACrB,eAGA,wBAAwB,eAAe,CACxC;WACM,WAAW;AAElB,WAAQ,OAAO,MACb,iDAAiD,UAAU,IAC5D;;OAIL,SAAQ,OAAO,MACb,8EACD;AAIH,KAAI;EAEF,MAAM,gBAAgB,iCADA,QAAQ,eAAe,CACwB;AACrE,MAAI,gBAAgB,EAClB,SAAQ,OAAO,MACb,gCAAgC,cAAc,kCAC/C;UAEI,WAAW;AAElB,UAAQ,OAAO,MAAM,qDAAqD,UAAU,IAAI;;;;;;;;;;AAe5F,eAAe,qBAAoC;AACjD,KAAI,CAAC,gBACH,OAAM,IAAI,MAAM,qDAAqD;CAGvE,MAAM,KAAK,KAAK,KAAK;AACrB,SAAQ,OAAO,MAAM,iDAAiD;CAEtE,MAAM,SAAS,MAAM,aAAa;CAClC,MAAM,UAAU,KAAK,KAAK,GAAG;AAE7B,SAAQ,OAAO,MACb,+CACG,OAAO,gBAAgB,aAAa,OAAO,YAAY,QAAQ,OAAO,gBAAgB,aACtF,OAAO,gBAAgB,aAAa,OAAO,YAAY,WAAW,QAAQ,OAC9E;AAED,KAAI,OAAO,QAAQ,SAAS,EAC1B,SAAQ,OAAO,MACb,sCAAsC,OAAO,QAAQ,OAAO,yCAC7D;;;;;;AAQL,SAAgB,sBAA4B;AAE1C,KAAI,6BAA6B,gBAAgB,EAAE;AACjD,UAAQ,OAAO,MAAM,+FAA+F;AACpH;;AAGF,SAAQ;EACN,MAAM;EACN,UAAU;EACV,SAAS,EAAE;EACZ,CAAC;;AAOJ,SAAS,aAAa,MAA8C;AAClE,KAAI;AACF,SAAO,KAAK,MAAM,KAAK;SACjB;AACN,SAAO;;;AAIX,SAAS,cAAc,SAA0B;AAC/C,KAAI,OAAO,YAAY,SAAU,QAAO;AACxC,KAAI,MAAM,QAAQ,QAAQ,CACxB,QAAO,QACJ,KAAK,MAAM;AACV,MAAI,OAAO,MAAM,SAAU,QAAO;EAClC,MAAM,QAAQ;AACd,MAAI,OAAO,KAAM,QAAO,OAAO,MAAM,KAAK;AAC1C,MAAI,OAAO,QAAS,QAAO,OAAO,MAAM,QAAQ;AAChD,SAAO;GACP,CACD,KAAK,IAAI,CACT,MAAM;AAEX,QAAO;;AAGT,SAAS,0BAA0B,OAAiC;CAClE,MAAM,YAA4B,EAAE;CACpC,MAAM,gCAAgB,IAAI,KAAa;AAEvC,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,aAAa,KAAK;AAChC,MAAI,CAAC,SAAS,MAAM,SAAS,YAAa;EAE1C,MAAM,MAAM,MAAM;AAClB,MAAI,CAAC,KAAK,QAAS;EAEnB,MAAM,UAAU,cAAc,IAAI,QAAQ;EAG1C,MAAM,eAAe,QAAQ,MAAM,4BAA4B;AAC/D,MAAI,cAAc;GAChB,MAAM,UAAU,aAAa,GAAG,MAAM;AACtC,OAAI,WAAW,CAAC,cAAc,IAAI,QAAQ,IAAI,QAAQ,SAAS,GAAG;AAChE,kBAAc,IAAI,QAAQ;IAE1B,MAAM,UAAoB,EAAE;IAC5B,MAAM,eAAe,QAAQ,MAAM,oCAAoC;AACvE,QAAI,cAAc;KAChB,MAAM,cAAc,aAAa,GAC9B,MAAM,KAAK,CACX,KAAK,MACJ,EAAE,QAAQ,aAAa,GAAG,CAAC,QAAQ,aAAa,GAAG,CAAC,MAAM,CAC3D,CACA,QAAQ,MAAM,EAAE,SAAS,KAAK,EAAE,SAAS,IAAI;AAChD,aAAQ,KAAK,GAAG,YAAY,MAAM,GAAG,EAAE,CAAC;;AAG1C,cAAU,KAAK;KACb,OAAO;KACP,SAAS,QAAQ,SAAS,IAAI,UAAU;KACxC,WAAW;KACZ,CAAC;;;EAKN,MAAM,iBAAiB,QAAQ,MAAM,8BAA8B;AACnE,MAAI,kBAAkB,UAAU,WAAW,GAAG;GAC5C,MAAM,YAAY,eAAe,GAC9B,MAAM,CACN,QAAQ,QAAQ,GAAG,CACnB,QAAQ,YAAY,GAAG,CACvB,MAAM;AACT,OAAI,aAAa,CAAC,cAAc,IAAI,UAAU,IAAI,UAAU,SAAS,GAAG;AACtE,kBAAc,IAAI,UAAU;AAC5B,cAAU,KAAK;KAAE,OAAO;KAAW,WAAW;KAAM,CAAC;;;;AAK3D,QAAO"}
+{"version":3,"file":"work-queue-worker-DCzfH0d1.mjs","names":["contentToText","contentToText"],"sources":["../src/daemon/templates/context-handover-prompt.ts","../src/daemon/context-handover-worker.ts","../src/daemon/topic-detect-worker.ts","../src/daemon/work-queue-worker.ts"],"sourcesContent":["/**\n * context-handover-prompt.ts — prompt template for the threshold-triggered\n * pre-compaction handover.\n *\n * This is NOT the session-note summary (session-summary-prompt.ts already\n * does that well, and Claude Code's own native compaction summary is also\n * genuinely detailed on file paths and issue numbers). This exists for the\n * one thing neither of those reliably carries: the reasoning behind what\n * happened, which compresses to bullets or vanishes outright once a native\n * compaction fires.\n *\n * FRAMING (lifted from a working example of this exact mechanism, read\n * before writing this prompt): the handover is a DIFF against everything\n * already durable, not a summary of the session. The successor can read\n * git, the tracker, and the notes — so this must not repeat what is\n * recoverable there. What cannot be recovered is what only ever existed in\n * the conversation: reasoning, rejected alternatives, negative results and\n * what they cost, traps discovered but invisible in the repo, and specific\n * values/ids/paths that would otherwise have to be dug up again.\n *\n * Length is not a target. A short session earns a short handover; every\n * line in a long one must be something the successor could not have\n * obtained anywhere else.\n */\n\nexport interface HandoverPromptParams {\n  /** Interleaved user + assistant turns, oldest first, each prefixed with\n   *  who said it — this prompt needs the assistant's reasoning, not just\n   *  what the user asked for. */\n  turns: string[];\n  /** Git log output for the session period, if any. */\n  gitLog: string;\n  cwd: string;\n  /** The previous cached handover's summary text, if this session already\n   *  produced one (the warmup handover, when this call is the refresh).\n   *  Passed through so the new handover can carry it forward rather than\n   *  silently dropping everything it already captured — see the \"pointer\n   *  to the previous handover, kept rather than superseded\" structure. */\n  previousHandover?: string;\n}\n\nexport function buildContextHandoverPrompt(params: HandoverPromptParams): string {\n  const { turns, gitLog, cwd, previousHandover } = params;\n\n  const turnsSection = turns.length > 0\n    ? turns.join(\"\\n\\n\")\n    : \"(No turns extracted)\";\n\n  const gitSection = gitLog.trim() || \"(No git commits during this session)\";\n\n  const previousSection = previousHandover\n    ? `\\nA PREVIOUS HANDOVER already exists for this session (from an earlier, \\\nlower threshold). Carry it forward — start your response with a one-line \\\npointer to it (\"Carries forward from the previous handover, which stays for \\\nits detail.\") and then write only what has happened SINCE it that a compact \\\nwould also lose. Do not re-derive or repeat what it already covered.\\n\\n\\\nPREVIOUS HANDOVER:\\n${previousHandover}\\n`\n    : \"\";\n\n  return `This session is approaching a context-window compaction. Write the \\\nhandover that would let a successor continue WITHOUT re-reading this \\\nconversation and WITHOUT asking the user to repeat themselves.\n\nProject directory: ${cwd}\n${previousSection}\nSCOPING RULE — the single most important instruction here: this is a DIFF \\\nagainst everything already durable, not a summary of the session. Assume \\\nthe successor can and will read git history, the issue tracker, and any \\\nnotes files themselves. Do NOT restate anything recoverable there — no file \\\ninventories, no \"implemented X\" restatements, no chronology of commands run. \\\nWrite down ONLY what existed exclusively in this conversation and would \\\notherwise be gone: the reasoning, not the result.\n\nWrite ONLY the sections below that this session actually has content for — \\\nomit a section entirely rather than writing \"none\" or padding it:\n\nWHERE THIS SESSION ENDED — the concrete state right now: what is verified \\\nworking (tests green, tree clean, etc.) versus merely attempted, any branch \\\nor working-tree state that isn't obvious from git status alone (e.g. a \\\ndetached HEAD, an intentionally uncommitted change, a stash).\n\nWHAT CLOSED — each item paired with the evidence that closed it, not just \\\nthe claim that it did.\n\nWHAT IS FILED AND STILL OPEN — each with its next concrete step or who/what \\\nit is waiting on.\n\nDECISIONS & REASONING — choices actually made, each with why this way and \\\nnot another way.\n\nREJECTED ALTERNATIVES — approaches considered and set aside, and why. An \\\nalternative without a reason is not worth recording.\n\nNEGATIVE RESULTS — something investigated that turned out NOT to be the \\\nanswer, kept WITH the reasoning that ruled it out (e.g. \"X looked like the \\\ncause — it wasn't; the actual mechanism was Y\"). Without the reasoning \\\nattached, a successor re-investigates the same dead end.\n\nTRAPS — anything discovered that is invisible from the repo alone and would \\\notherwise bite a successor immediately (a required manual step, an ordering \\\nconstraint, a state that looks fine but isn't).\n\nCRITICAL VALUES — any specific id, path, URL, credential name, version \\\nnumber, or configuration value that appeared in conversation and whose loss \\\nwould force someone to go find it again.\n\nTHE FEW THINGS THAT MATTER MOST, IF NOTHING ELSE IS READ — at most 3 bullets. \\\nForces a priority judgement; do not pad this to fill space.\n\nFormat your response as markdown with those section headers (only the ones \\\nyou have content for), no other structure.\n\n---\n\nCONVERSATION:\n${turnsSection}\n\nGIT COMMITS:\n${gitSection}`;\n}\n","/**\n * context-handover-worker.ts — the threshold-triggered pre-compaction\n * handover.\n *\n * `session-summary-worker.ts` already spawns a model to write session notes,\n * but only from the PreCompact hook itself — which fires at the compaction\n * boundary, far too late to be injected INTO that same compaction's\n * post-compact context. This worker runs earlier, off a token-count\n * threshold (see ../hooks/ts/lib/context-fill.ts), so a model-written\n * handover already exists in a cache file by the time compaction happens.\n *\n * Deliberately narrow: this does not write a session note, does not touch\n * the session-summary cooldown file, and does not run KG extraction. It\n * writes one thing — a cache file the PreCompact hook can read — because its\n * only job is to exist before compaction does, not to duplicate what\n * session-summary-worker already does well.\n *\n * The prompt itself (see templates/context-handover-prompt.ts) treats the\n * handover as a DIFF against everything already durable — git, the tracker,\n * the notes — not a session summary, and a refresh run carries the previous\n * cached handover forward rather than overwriting it.\n */\n\nimport { existsSync, readFileSync } from \"node:fs\";\n\nimport {\n  findLatestJsonl,\n  getGitContext,\n  spawnSummarizer,\n  contentToText,\n} from \"./session-summary-worker.js\";\nimport { buildContextHandoverPrompt } from \"./templates/context-handover-prompt.js\";\nimport {\n  readContextHandoverCache,\n  writeContextHandoverCache,\n  type HandoverThreshold,\n} from \"../hooks/ts/lib/context-handover-cache.js\";\n\nexport type { HandoverThreshold } from \"../hooks/ts/lib/context-handover-cache.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface ContextHandoverPayload {\n  cwd: string;\n  sessionId: string;\n  transcriptPath?: string;\n  threshold: HandoverThreshold;\n  /** True when this fired via the \"no time for a clean crossing\" path\n   *  (see isImmediate in context-fill.ts) — logged, not otherwise acted on. */\n  urgent?: boolean;\n}\n\n/** How much of the tail of the transcript to feed the summarizer. Generous —\n *  this runs at most twice per session, not on every tool call. */\nconst MAX_TURN_CHARS = 150_000;\n\n/** Max turns to include (a hard floor even if MAX_TURN_CHARS is not hit). */\nconst MAX_TURNS = 120;\n\n// ---------------------------------------------------------------------------\n// Transcript → turns\n// ---------------------------------------------------------------------------\n\n/**\n * Interleaved \"User:\"/\"Assistant:\" turns, oldest-kept-from-the-end so a long\n * transcript is truncated to its most recent content rather than its\n * earliest. Unlike session-summary-worker's extractFromJsonl (which keeps\n * only user messages, because a session note doesn't need the assistant's\n * own reasoning) this keeps BOTH sides — the whole point of this prompt is\n * the assistant's reasoning, which lives in assistant turns.\n */\nfunction extractTurns(jsonlPath: string): string[] {\n  let raw: string;\n  try {\n    raw = readFileSync(jsonlPath, \"utf-8\");\n  } catch {\n    return [];\n  }\n\n  if (raw.length > MAX_TURN_CHARS) {\n    const truncPoint = raw.indexOf(\"\\n\", raw.length - MAX_TURN_CHARS);\n    raw = truncPoint >= 0 ? raw.slice(truncPoint + 1) : raw.slice(-MAX_TURN_CHARS);\n  }\n\n  const turns: string[] = [];\n  for (const line of raw.trim().split(\"\\n\")) {\n    if (!line.trim()) continue;\n    let entry: Record<string, unknown>;\n    try {\n      entry = JSON.parse(line);\n    } catch {\n      continue;\n    }\n\n    if (entry.type === \"user\") {\n      const msg = entry.message as Record<string, unknown> | undefined;\n      const text = contentToText(msg?.content);\n      if (text && text.length >= 3 && !text.startsWith(\"<system-reminder>\")) {\n        turns.push(`User: ${text.slice(0, 2000)}`);\n      }\n    } else if (entry.type === \"assistant\") {\n      const msg = entry.message as Record<string, unknown> | undefined;\n      const text = contentToText(msg?.content);\n      if (text && text.length >= 3) {\n        turns.push(`Assistant: ${text.slice(0, 4000)}`);\n      }\n    }\n  }\n\n  return turns.slice(-MAX_TURNS);\n}\n\n// ---------------------------------------------------------------------------\n// Main entry point\n// ---------------------------------------------------------------------------\n\n/**\n * Process a `context-handover` work item.\n *\n * THROWS on every failure path (missing input, no transcript, no turns, an\n * empty/failed summarizer run) rather than logging and returning silently.\n * That used to be a deliberate choice — avoid the work queue's own retry\n * piling up redundant LLM calls — but it made a real failure invisible: a\n * daemon restart mid-spawn (session 77084e72-...) left no cache, no error\n * anywhere the work queue's own stats could show, and a trigger-side marker\n * that (at the time) had already been set to \"done\". Throwing here makes\n * work-queue-worker.ts call markFailed(), which logs prominently AND is\n * visible via `work_queue_stats` / `pai daemon status` — not just a stderr\n * line that can scroll away. It is a second, faster (seconds-to-minutes\n * backoff) retry path alongside the primary one in context-handover-\n * trigger.ts (which retries on its own ~5-minute cadence based on whether a\n * cache actually appeared); the two are complementary, not redundant — a\n * failed cache write costs nothing to retry twice.\n */\nexport async function handleContextHandover(payload: ContextHandoverPayload): Promise<void> {\n  const { cwd, sessionId, transcriptPath, threshold, urgent } = payload;\n\n  if (!cwd || !sessionId) {\n    throw new Error(\"[context-handover] payload missing cwd or sessionId\");\n  }\n\n  process.stderr.write(\n    `[context-handover] Starting for ${cwd} (session=${sessionId}, threshold=${threshold}` +\n    `${urgent ? \", urgent\" : \"\"}).\\n`\n  );\n\n  let jsonlPath: string | null = transcriptPath && existsSync(transcriptPath) ? transcriptPath : null;\n  if (!jsonlPath) jsonlPath = findLatestJsonl(cwd);\n  if (!jsonlPath) {\n    throw new Error(`[context-handover] No transcript found for ${cwd} (session=${sessionId})`);\n  }\n\n  const turns = extractTurns(jsonlPath);\n  if (turns.length === 0) {\n    throw new Error(`[context-handover] No turns extracted from ${jsonlPath} (session=${sessionId})`);\n  }\n\n  const gitLog = await getGitContext(cwd);\n\n  // Carry the previous handover forward (see buildContextHandoverPrompt's\n  // scoping rule) rather than silently overwriting it — a refresh at the\n  // second threshold should not lose what the warmup handover already\n  // captured.\n  const previous = readContextHandoverCache(sessionId);\n  const prompt = buildContextHandoverPrompt({\n    turns,\n    gitLog,\n    cwd,\n    previousHandover: previous?.summary,\n  });\n  process.stderr.write(`[context-handover] Sending ${prompt.length} char prompt to sonnet...\\n`);\n\n  const summary = await spawnSummarizer(prompt, \"sonnet\");\n  if (!summary || !summary.trim()) {\n    // No cache write on this path — an existing cache from an earlier\n    // successful run is left untouched rather than clobbered with nothing.\n    throw new Error(`[context-handover] sonnet produced no output (session=${sessionId})`);\n  }\n\n  writeContextHandoverCache({\n    sessionId,\n    cwd,\n    threshold,\n    generatedAt: new Date().toISOString(),\n    model: \"sonnet\",\n    summary: summary.trim(),\n  });\n\n  process.stderr.write(\n    `[context-handover] Wrote cache for session ${sessionId} (${summary.length} chars).\\n`\n  );\n}\n","/**\n * topic-detect-worker.ts — Topic shift detection for session note splitting\n *\n * Processes `topic-detect` work items by:\n *   1. Extracting recent user messages from the JSONL transcript\n *   2. Running the BM25-based topic shift detector against the PAI memory DB\n *   3. If a shift is detected, recording a topic boundary marker\n *\n * The actual note splitting is handled by session-summary-worker.ts when it\n * processes the next `session-summary` work item — it uses the TOPIC: line\n * from the summarizer to decide whether to create a new note.\n *\n * This worker provides an additional signal: project-level topic shift\n * (e.g., conversation moved from project A to project B). The session\n * summary worker handles intra-project topic shifts (e.g., from \"dark mode\"\n * to \"keyboard IPC\" within the same project).\n */\n\nimport { existsSync, readFileSync, writeFileSync } from \"node:fs\";\nimport { join, basename } from \"node:path\";\nimport { homedir } from \"node:os\";\n\nimport { detectTopicShift } from \"../topics/detector.js\";\nimport { registryBackend, storageBackend } from \"./daemon/state.js\";\nimport {\n  findNotesDir,\n  getCurrentNotePath,\n  appendCheckpoint,\n} from \"../hooks/ts/lib/project-utils/index.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface TopicDetectPayload {\n  /** Working directory of the session. */\n  cwd: string;\n  /** Recent conversation context (extracted user messages). */\n  context?: string;\n  /** The project slug the session is currently routed to. */\n  currentProject?: string;\n  /** Path to the JSONL transcript (optional — used to extract context if not provided). */\n  transcriptPath?: string;\n  /** Session ID (for logging). */\n  sessionId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// JSONL context extraction (lightweight — just last few user messages)\n// ---------------------------------------------------------------------------\n\nconst MAX_CONTEXT_MESSAGES = 5;\nconst MAX_CONTEXT_CHARS = 2000;\n\n/**\n * Extract recent user messages from a JSONL transcript for topic detection.\n * Takes only the last few messages to represent the current topic.\n */\nfunction extractRecentContext(jsonlPath: string): string {\n  try {\n    const raw = readFileSync(jsonlPath, \"utf-8\");\n    // Read from the end — last 50KB should be more than enough\n    const tail = raw.length > 50_000 ? raw.slice(-50_000) : raw;\n    const lines = tail.trim().split(\"\\n\");\n\n    const messages: string[] = [];\n\n    for (let i = lines.length - 1; i >= 0 && messages.length < MAX_CONTEXT_MESSAGES; i--) {\n      const line = lines[i].trim();\n      if (!line) continue;\n\n      try {\n        const entry = JSON.parse(line) as Record<string, unknown>;\n        if (entry.type === \"user\") {\n          const msg = entry.message as Record<string, unknown> | undefined;\n          if (msg?.content) {\n            const text = contentToText(msg.content);\n            if (text && text.length > 3) {\n              messages.unshift(text.slice(0, 500));\n            }\n          }\n        }\n      } catch { /* skip invalid JSON */ }\n    }\n\n    return messages.join(\"\\n\\n\").slice(0, MAX_CONTEXT_CHARS);\n  } catch {\n    return \"\";\n  }\n}\n\n/** Convert Claude content (string or content block array) to plain text. */\nfunction contentToText(content: unknown): string {\n  if (typeof content === \"string\") return content;\n  if (Array.isArray(content)) {\n    return content\n      .map((c) => {\n        if (typeof c === \"string\") return c;\n        const block = c as Record<string, unknown>;\n        if (block?.text) return String(block.text);\n        if (block?.content) return String(block.content);\n        return \"\";\n      })\n      .join(\" \")\n      .trim();\n  }\n  return \"\";\n}\n\n// ---------------------------------------------------------------------------\n// Topic boundary file — signals to session-summary-worker\n// ---------------------------------------------------------------------------\n\nconst TOPIC_BOUNDARY_FILE = \"topic-boundary.json\";\n\ninterface TopicBoundary {\n  timestamp: string;\n  previousProject: string | null;\n  suggestedProject: string | null;\n  confidence: number;\n  context: string;\n}\n\n/**\n * Write a topic boundary marker into the Notes directory.\n * The session-summary-worker checks for this file and uses it as an\n * additional signal that a new note should be created.\n */\nfunction writeTopicBoundary(\n  cwd: string,\n  boundary: TopicBoundary\n): void {\n  try {\n    const notesInfo = findNotesDir(cwd);\n    const boundaryPath = join(notesInfo.path, TOPIC_BOUNDARY_FILE);\n    writeFileSync(boundaryPath, JSON.stringify(boundary, null, 2), \"utf-8\");\n    process.stderr.write(\n      `[topic-detect] Wrote topic boundary marker: ${boundaryPath}\\n`\n    );\n  } catch (e) {\n    process.stderr.write(`[topic-detect] Could not write boundary marker: ${e}\\n`);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Main entry point\n// ---------------------------------------------------------------------------\n\n/**\n * Process a `topic-detect` work item.\n *\n * Called by work-queue-worker.ts. Throws on fatal errors so the work queue\n * retry logic handles them.\n */\nexport async function handleTopicDetect(payload: TopicDetectPayload): Promise<void> {\n  const { cwd, currentProject, transcriptPath, sessionId } = payload;\n\n  if (!cwd) {\n    throw new Error(\"topic-detect payload missing cwd\");\n  }\n\n  process.stderr.write(\n    `[topic-detect] Starting for ${cwd}` +\n    `${currentProject ? ` (project=${currentProject})` : \"\"}` +\n    `${sessionId ? ` (session=${sessionId})` : \"\"}\\n`\n  );\n\n  // Check that daemon state is available\n  if (!registryBackend || !storageBackend) {\n    process.stderr.write(\n      \"[topic-detect] Registry backend or storage backend not available — skipping.\\n\"\n    );\n    return;\n  }\n\n  // Extract context from payload or transcript\n  let context = payload.context || \"\";\n\n  if (!context && transcriptPath && existsSync(transcriptPath)) {\n    context = extractRecentContext(transcriptPath);\n  }\n\n  if (!context || context.trim().length < 10) {\n    process.stderr.write(\n      \"[topic-detect] Insufficient context for topic detection — skipping.\\n\"\n    );\n    return;\n  }\n\n  process.stderr.write(\n    `[topic-detect] Context: ${context.length} chars, checking against memory...\\n`\n  );\n\n  // Run the BM25-based topic shift detector\n  const result = await detectTopicShift(registryBackend, storageBackend, {\n    context,\n    currentProject,\n    threshold: 0.6,\n    candidates: 20,\n  });\n\n  process.stderr.write(\n    `[topic-detect] Result: shifted=${result.shifted}, ` +\n    `suggested=${result.suggestedProject}, confidence=${result.confidence.toFixed(2)}, ` +\n    `chunks=${result.chunkCount}\\n`\n  );\n\n  if (result.topProjects.length > 0) {\n    process.stderr.write(\n      `[topic-detect] Top projects: ${result.topProjects.map(\n        (p) => `${p.slug}(${(p.score * 100).toFixed(0)}%)`\n      ).join(\", \")}\\n`\n    );\n  }\n\n  if (result.shifted) {\n    // Record the topic boundary\n    writeTopicBoundary(cwd, {\n      timestamp: new Date().toISOString(),\n      previousProject: result.currentProject,\n      suggestedProject: result.suggestedProject,\n      confidence: result.confidence,\n      context: context.slice(0, 200),\n    });\n\n    // Also append a checkpoint to the current session note\n    try {\n      const notesInfo = findNotesDir(cwd);\n      const notePath = getCurrentNotePath(notesInfo.path);\n      if (notePath) {\n        appendCheckpoint(\n          notePath,\n          `Topic shift detected: conversation moved from **${result.currentProject}** ` +\n          `to **${result.suggestedProject}** (confidence: ${(result.confidence * 100).toFixed(0)}%). ` +\n          `A new session note will be created for the new topic.`\n        );\n      }\n    } catch (e) {\n      process.stderr.write(`[topic-detect] Could not append checkpoint: ${e}\\n`);\n    }\n  }\n\n  process.stderr.write(\"[topic-detect] Done.\\n\");\n}\n","/**\n * work-queue-worker.ts — Daemon worker loop for the persistent work queue\n *\n * Runs every 5 seconds to drain the queue.\n * Handles 'session-end' work items by reading the transcript, extracting\n * work summaries, updating the session note, and updating TODO.md.\n * Handles 'session-summary' items by spawning Haiku for AI-powered note generation.\n * Handles 'context-handover' items by spawning Sonnet to write the\n * threshold-triggered pre-compaction reasoning handover (see\n * context-handover-worker.ts and hooks/ts/lib/context-fill.ts).\n * Handles 'registry-scan' items by running performScan() against the registry DB.\n *\n * Handles 'topic-detect' items by running BM25-based topic shift detection.\n * Other item types (note-update, todo-update) are stubs — they log and\n * complete immediately, ready for future expansion.\n */\n\nimport { readFileSync } from \"node:fs\";\nimport { basename, dirname } from \"node:path\";\n\nimport {\n  dequeue,\n  enqueue,\n  markCompleted,\n  markFailed,\n  cleanup,\n  getStats,\n  hasPendingOrProcessingOfType,\n  type WorkItem,\n} from \"./work-queue.js\";\n\nimport {\n  handleSessionSummary,\n  type SessionSummaryPayload,\n} from \"./session-summary-worker.js\";\n\nimport {\n  handleContextHandover,\n  type ContextHandoverPayload,\n} from \"./context-handover-worker.js\";\n\nimport {\n  handleTopicDetect,\n  type TopicDetectPayload,\n} from \"./topic-detect-worker.js\";\n\n// Registry scan — called from handleRegistryScan()\nimport { performScan } from \"../cli/commands/registry/scan.js\";\nimport { registryBackend } from \"./daemon/state.js\";\n\n// Hooks lib imports — resolving through the compiled JS path.\n// These are the same utilities used by stop-hook.ts.\nimport {\n  findNotesDir,\n  getCurrentNotePath,\n  addWorkToSessionNote,\n  finalizeSessionNote,\n  updateTodoContinue, sessionIdFromTranscript,\n  archiveSessionFilesToSessionsDir,\n  type WorkItem as NoteWorkItem,\n} from \"../hooks/ts/lib/project-utils/index.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst WORKER_INTERVAL_MS = 5_000;\nconst HOUSEKEEPING_INTERVAL_MS = 10 * 60 * 1000; // 10 minutes\n\n// ---------------------------------------------------------------------------\n// Timers (stored so shutdown can clear them)\n// ---------------------------------------------------------------------------\n\nlet workerTimer: ReturnType<typeof setInterval> | null = null;\nlet housekeepingTimer: ReturnType<typeof setInterval> | null = null;\nlet _immediateSignal = false;\n\n// ---------------------------------------------------------------------------\n// Worker loop\n// ---------------------------------------------------------------------------\n\n/** Start the background worker and housekeeping timers. */\nexport function startWorker(): void {\n  process.stderr.write(\"[work-queue-worker] Starting worker loop.\\n\");\n\n  workerTimer = setInterval(async () => {\n    try {\n      await processNextItem();\n    } catch (e) {\n      process.stderr.write(`[work-queue-worker] Uncaught error in worker loop: ${e}\\n`);\n    }\n  }, WORKER_INTERVAL_MS);\n\n  housekeepingTimer = setInterval(() => {\n    try {\n      cleanup();\n    } catch (e) {\n      process.stderr.write(`[work-queue-worker] Housekeeping error: ${e}\\n`);\n    }\n  }, HOUSEKEEPING_INTERVAL_MS);\n\n  process.stderr.write(\"[work-queue-worker] Worker started (interval=5s, housekeeping=10min).\\n\");\n}\n\n/** Stop the worker timers gracefully. */\nexport function stopWorker(): void {\n  if (workerTimer !== null) {\n    clearInterval(workerTimer);\n    workerTimer = null;\n  }\n  if (housekeepingTimer !== null) {\n    clearInterval(housekeepingTimer);\n    housekeepingTimer = null;\n  }\n  process.stderr.write(\"[work-queue-worker] Worker stopped.\\n\");\n}\n\n/**\n * Signal that new work has been enqueued.\n * The worker will run on its next tick — we don't need to reset the timer\n * since 5 s is fast enough. The flag allows future optimisations.\n */\nexport function notifyNewWork(): void {\n  _immediateSignal = true;\n}\n\n// ---------------------------------------------------------------------------\n// Item processor (sequential — one item per tick)\n// ---------------------------------------------------------------------------\n\nasync function processNextItem(): Promise<void> {\n  const item = dequeue();\n  if (!item) return;\n\n  process.stderr.write(\n    `[work-queue-worker] Processing ${item.type} (id=${item.id}, attempt=${item.attempts}).\\n`\n  );\n\n  try {\n    switch (item.type) {\n      case \"session-end\":\n        await handleSessionEnd(item);\n        break;\n\n      case \"session-summary\":\n        await handleSessionSummary(item.payload as unknown as SessionSummaryPayload);\n        break;\n\n      case \"context-handover\":\n        await handleContextHandover(item.payload as unknown as ContextHandoverPayload);\n        break;\n\n      case \"topic-detect\":\n        await handleTopicDetect(item.payload as unknown as TopicDetectPayload);\n        break;\n\n      case \"registry-scan\":\n        await handleRegistryScan();\n        break;\n\n      case \"note-update\":\n      case \"todo-update\":\n        // Stubs — log and complete\n        process.stderr.write(\n          `[work-queue-worker] Item type '${item.type}' is not yet implemented — completing as no-op.\\n`\n        );\n        break;\n\n      default:\n        throw new Error(`Unknown work item type: ${(item as WorkItem).type}`);\n    }\n\n    markCompleted(item.id);\n    process.stderr.write(`[work-queue-worker] Completed ${item.type} (id=${item.id}).\\n`);\n  } catch (e) {\n    const msg = e instanceof Error ? e.message : String(e);\n    markFailed(item.id, msg);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// session-end handler\n// ---------------------------------------------------------------------------\n\n/**\n * Process a 'session-end' work item.\n *\n * Expected payload:\n *   transcriptPath: string   — absolute path to the .jsonl transcript\n *   cwd: string              — working directory of the session\n *   message?: string         — COMPLETED: line extracted by the hook (optional)\n */\nasync function handleSessionEnd(item: WorkItem): Promise<void> {\n  const { transcriptPath, cwd, message: hookMessage } = item.payload as {\n    transcriptPath: string;\n    cwd: string;\n    message?: string;\n  };\n\n  if (!transcriptPath) throw new Error(\"session-end payload missing transcriptPath\");\n  if (!cwd) throw new Error(\"session-end payload missing cwd\");\n\n  // Read transcript\n  let transcript: string;\n  try {\n    transcript = readFileSync(transcriptPath, \"utf-8\");\n  } catch (e) {\n    throw new Error(`Could not read transcript at ${transcriptPath}: ${e}`);\n  }\n\n  const lines = transcript.trim().split(\"\\n\");\n\n  // Extract work items from transcript\n  const workItems = extractWorkFromTranscript(lines);\n\n  // Determine completion message\n  let message = hookMessage ?? \"\";\n  if (!message) {\n    const lastEntry = tryParseJson(lines[lines.length - 1]) as\n      | { type?: string; message?: { content?: unknown } }\n      | null;\n    if (lastEntry?.type === \"assistant\" && lastEntry.message?.content) {\n      const content = contentToText(lastEntry.message.content);\n      const m = content.match(/COMPLETED:\\s*(.+?)(?:\\n|$)/i);\n      if (m) {\n        message = m[1].trim().replace(/\\*+/g, \"\").replace(/\\[.*?\\]/g, \"\").trim();\n      }\n    }\n  }\n\n  // Find notes directory and current note\n  const notesInfo = findNotesDir(cwd);\n  const currentNotePath = getCurrentNotePath(notesInfo.path);\n\n  if (currentNotePath) {\n    // Add work items to session note\n    if (workItems.length > 0) {\n      addWorkToSessionNote(currentNotePath, workItems);\n      process.stderr.write(\n        `[work-queue-worker] Added ${workItems.length} work item(s) to note.\\n`\n      );\n    } else if (message) {\n      addWorkToSessionNote(currentNotePath, [{ title: message, completed: true }]);\n      process.stderr.write(\"[work-queue-worker] Added completion message to note.\\n\");\n    }\n\n    // Finalize the note\n    const summary = message || \"Session completed.\";\n    finalizeSessionNote(currentNotePath, summary);\n    process.stderr.write(\n      `[work-queue-worker] Finalized session note: ${basename(currentNotePath)}.\\n`\n    );\n\n    // Update TODO.md ## Continue section.\n    //\n    // A session that produced neither work items nor a completion message has\n    // no handover to write. Claiming the slot anyway hands the next session a\n    // block naming a session that did nothing — see the 2026-08-04 incident\n    // recorded in AIBroker's Notes. applyContinue now refuses such a write on\n    // its own; this skips building it in the first place, so the \"last session\"\n    // line keeps pointing at the last session that actually did something.\n    if (workItems.length === 0 && !message) {\n      process.stderr.write(\n        \"[work-queue-worker] Nothing to hand over — leaving TODO.md ## Continue intact.\\n\"\n      );\n    } else {\n      try {\n        const stateLines: string[] = [];\n        stateLines.push(`Working directory: ${cwd}`);\n        if (workItems.length > 0) {\n          stateLines.push(\"\", \"Work completed:\");\n          for (const wi of workItems.slice(0, 5)) {\n            stateLines.push(`- ${wi.title}`);\n          }\n        }\n        if (message) {\n          stateLines.push(\"\", `Last completed: ${message}`);\n        }\n        updateTodoContinue(\n          cwd,\n          basename(currentNotePath),\n          stateLines.join(\"\\n\"),\n          \"session-end\",\n          // Same reasoning as the stop hook: the transcript filename is the\n          // session's real identity, and the note title is not.\n          sessionIdFromTranscript(transcriptPath)\n        );\n      } catch (todoError) {\n        // Non-fatal — log and continue\n        process.stderr.write(\n          `[work-queue-worker] Could not update TODO.md: ${todoError}\\n`\n        );\n      }\n    }\n  } else {\n    process.stderr.write(\n      \"[work-queue-worker] No current session note found — skipping note update.\\n\"\n    );\n  }\n\n  // Move session .jsonl files to sessions/ subdirectory\n  try {\n    const transcriptDir = dirname(transcriptPath);\n    const archivedCount = archiveSessionFilesToSessionsDir(transcriptDir);\n    if (archivedCount > 0) {\n      process.stderr.write(\n        `[work-queue-worker] Archived ${archivedCount} session file(s) to sessions/.\\n`\n      );\n    }\n  } catch (moveError) {\n    // Non-fatal\n    process.stderr.write(`[work-queue-worker] Could not move session files: ${moveError}\\n`);\n  }\n}\n\n// ---------------------------------------------------------------------------\n// registry-scan handler\n// ---------------------------------------------------------------------------\n\n/**\n * Run performScan() against the registry DB.\n *\n * Debounce: if another registry-scan job is already pending in the queue,\n * we still run this one (dequeue already picked it), but enqueueRegistryScan()\n * checks before enqueuing so duplicates rarely reach here.\n */\nasync function handleRegistryScan(): Promise<void> {\n  if (!registryBackend) {\n    throw new Error(\"registry-scan: registryBackend not initialized yet\");\n  }\n\n  const t0 = Date.now();\n  process.stderr.write(\"[work-queue-worker] Running registry scan...\\n\");\n\n  const result = await performScan();\n  const elapsed = Date.now() - t0;\n\n  process.stderr.write(\n    `[work-queue-worker] Registry scan complete: ` +\n    `${result.projectsScanned} projects (${result.projectsNew} new, ${result.projectsUpdated} updated), ` +\n    `${result.sessionsScanned} sessions (${result.sessionsNew} new) in ${elapsed}ms.\\n`\n  );\n\n  if (result.skipped.length > 0) {\n    process.stderr.write(\n      `[work-queue-worker] Registry scan: ${result.skipped.length} project(s) skipped (path not found).\\n`\n    );\n  }\n}\n\n/**\n * Enqueue a registry-scan work item — debounced.\n * If a registry-scan item is already pending or processing, skip enqueue.\n */\nexport function enqueueRegistryScan(): void {\n  // Debounce: skip if already queued or processing\n  if (hasPendingOrProcessingOfType(\"registry-scan\")) {\n    process.stderr.write(\"[work-queue-worker] Registry scan already pending/processing — skipping duplicate enqueue.\\n\");\n    return;\n  }\n\n  enqueue({\n    type: \"registry-scan\",\n    priority: 5, // lowest priority — runs after session-end, session-summary\n    payload: {},\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Transcript parsing helpers (mirrors stop-hook.ts logic)\n// ---------------------------------------------------------------------------\n\nfunction tryParseJson(line: string): Record<string, unknown> | null {\n  try {\n    return JSON.parse(line) as Record<string, unknown>;\n  } catch {\n    return null;\n  }\n}\n\nfunction contentToText(content: unknown): string {\n  if (typeof content === \"string\") return content;\n  if (Array.isArray(content)) {\n    return content\n      .map((c) => {\n        if (typeof c === \"string\") return c;\n        const block = c as Record<string, unknown>;\n        if (block?.text) return String(block.text);\n        if (block?.content) return String(block.content);\n        return \"\";\n      })\n      .join(\" \")\n      .trim();\n  }\n  return \"\";\n}\n\nfunction extractWorkFromTranscript(lines: string[]): NoteWorkItem[] {\n  const workItems: NoteWorkItem[] = [];\n  const seenSummaries = new Set<string>();\n\n  for (const line of lines) {\n    const entry = tryParseJson(line);\n    if (!entry || entry.type !== \"assistant\") continue;\n\n    const msg = entry.message as Record<string, unknown> | undefined;\n    if (!msg?.content) continue;\n\n    const content = contentToText(msg.content);\n\n    // SUMMARY: line (preferred)\n    const summaryMatch = content.match(/SUMMARY:\\s*(.+?)(?:\\n|$)/i);\n    if (summaryMatch) {\n      const summary = summaryMatch[1].trim();\n      if (summary && !seenSummaries.has(summary) && summary.length > 5) {\n        seenSummaries.add(summary);\n\n        const details: string[] = [];\n        const actionsMatch = content.match(/ACTIONS:\\s*(.+?)(?=\\n[A-Z]+:|$)/is);\n        if (actionsMatch) {\n          const actionLines = actionsMatch[1]\n            .split(\"\\n\")\n            .map((l) =>\n              l.replace(/^[-*•]\\s*/, \"\").replace(/^\\d+\\.\\s*/, \"\").trim()\n            )\n            .filter((l) => l.length > 3 && l.length < 100);\n          details.push(...actionLines.slice(0, 3));\n        }\n\n        workItems.push({\n          title: summary,\n          details: details.length > 0 ? details : undefined,\n          completed: true,\n        });\n      }\n    }\n\n    // COMPLETED: line (fallback)\n    const completedMatch = content.match(/COMPLETED:\\s*(.+?)(?:\\n|$)/i);\n    if (completedMatch && workItems.length === 0) {\n      const completed = completedMatch[1]\n        .trim()\n        .replace(/\\*+/g, \"\")\n        .replace(/\\[.*?\\]/g, \"\")\n        .trim();\n      if (completed && !seenSummaries.has(completed) && completed.length > 5) {\n        seenSummaries.add(completed);\n        workItems.push({ title: completed, completed: true });\n      }\n    }\n  }\n\n  return workItems;\n}\n"],"mappings":";;;;;;;AAyCA,SAAgB,2BAA2B,QAAsC;CAC/E,MAAM,EAAE,OAAO,QAAQ,KAAK,qBAAqB;CAEjD,MAAM,eAAe,MAAM,SAAS,IAChC,MAAM,KAAK,OAAO,GAClB;CAEJ,MAAM,aAAa,OAAO,MAAM,IAAI;AAWpC,QAAO;;;;qBAIY,IAAI;EAbC,mBACpB;;;;;sBAKgB,iBAAiB,MACjC,GAOY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAmDhB,aAAa;;;EAGb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC9DF,MAAM,iBAAiB;;AAGvB,MAAM,YAAY;;;;;;;;;AAclB,SAAS,aAAa,WAA6B;CACjD,IAAI;AACJ,KAAI;AACF,QAAM,aAAa,WAAW,QAAQ;SAChC;AACN,SAAO,EAAE;;AAGX,KAAI,IAAI,SAAS,gBAAgB;EAC/B,MAAM,aAAa,IAAI,QAAQ,MAAM,IAAI,SAAS,eAAe;AACjE,QAAM,cAAc,IAAI,IAAI,MAAM,aAAa,EAAE,GAAG,IAAI,MAAM,CAAC,eAAe;;CAGhF,MAAM,QAAkB,EAAE;AAC1B,MAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,EAAE;AACzC,MAAI,CAAC,KAAK,MAAM,CAAE;EAClB,IAAI;AACJ,MAAI;AACF,WAAQ,KAAK,MAAM,KAAK;UAClB;AACN;;AAGF,MAAI,MAAM,SAAS,QAAQ;GACzB,MAAM,MAAM,MAAM;GAClB,MAAM,OAAOA,gBAAc,KAAK,QAAQ;AACxC,OAAI,QAAQ,KAAK,UAAU,KAAK,CAAC,KAAK,WAAW,oBAAoB,CACnE,OAAM,KAAK,SAAS,KAAK,MAAM,GAAG,IAAK,GAAG;aAEnC,MAAM,SAAS,aAAa;GACrC,MAAM,MAAM,MAAM;GAClB,MAAM,OAAOA,gBAAc,KAAK,QAAQ;AACxC,OAAI,QAAQ,KAAK,UAAU,EACzB,OAAM,KAAK,cAAc,KAAK,MAAM,GAAG,IAAK,GAAG;;;AAKrD,QAAO,MAAM,MAAM,CAAC,UAAU;;;;;;;;;;;;;;;;;;;;AAyBhC,eAAsB,sBAAsB,SAAgD;CAC1F,MAAM,EAAE,KAAK,WAAW,gBAAgB,WAAW,WAAW;AAE9D,KAAI,CAAC,OAAO,CAAC,UACX,OAAM,IAAI,MAAM,sDAAsD;AAGxE,SAAQ,OAAO,MACb,mCAAmC,IAAI,YAAY,UAAU,cAAc,YACxE,SAAS,aAAa,GAAG,MAC7B;CAED,IAAI,YAA2B,kBAAkB,WAAW,eAAe,GAAG,iBAAiB;AAC/F,KAAI,CAAC,UAAW,aAAY,gBAAgB,IAAI;AAChD,KAAI,CAAC,UACH,OAAM,IAAI,MAAM,8CAA8C,IAAI,YAAY,UAAU,GAAG;CAG7F,MAAM,QAAQ,aAAa,UAAU;AACrC,KAAI,MAAM,WAAW,EACnB,OAAM,IAAI,MAAM,8CAA8C,UAAU,YAAY,UAAU,GAAG;CAUnG,MAAM,SAAS,2BAA2B;EACxC;EACA,QATa,MAAM,cAAc,IAAI;EAUrC;EACA,kBALe,yBAAyB,UAAU,EAKtB;EAC7B,CAAC;AACF,SAAQ,OAAO,MAAM,8BAA8B,OAAO,OAAO,6BAA6B;CAE9F,MAAM,UAAU,MAAM,gBAAgB,QAAQ,SAAS;AACvD,KAAI,CAAC,WAAW,CAAC,QAAQ,MAAM,CAG7B,OAAM,IAAI,MAAM,yDAAyD,UAAU,GAAG;AAGxF,2BAA0B;EACxB;EACA;EACA;EACA,8BAAa,IAAI,MAAM,EAAC,aAAa;EACrC,OAAO;EACP,SAAS,QAAQ,MAAM;EACxB,CAAC;AAEF,SAAQ,OAAO,MACb,8CAA8C,UAAU,IAAI,QAAQ,OAAO,YAC5E;;;;;;;;;;;;;;;;;;;;;;AC7IH,MAAM,uBAAuB;AAC7B,MAAM,oBAAoB;;;;;AAM1B,SAAS,qBAAqB,WAA2B;AACvD,KAAI;EACF,MAAM,MAAM,aAAa,WAAW,QAAQ;EAG5C,MAAM,SADO,IAAI,SAAS,MAAS,IAAI,MAAM,KAAQ,GAAG,KACrC,MAAM,CAAC,MAAM,KAAK;EAErC,MAAM,WAAqB,EAAE;AAE7B,OAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,KAAK,SAAS,SAAS,sBAAsB,KAAK;GACpF,MAAM,OAAO,MAAM,GAAG,MAAM;AAC5B,OAAI,CAAC,KAAM;AAEX,OAAI;IACF,MAAM,QAAQ,KAAK,MAAM,KAAK;AAC9B,QAAI,MAAM,SAAS,QAAQ;KACzB,MAAM,MAAM,MAAM;AAClB,SAAI,KAAK,SAAS;MAChB,MAAM,OAAOC,gBAAc,IAAI,QAAQ;AACvC,UAAI,QAAQ,KAAK,SAAS,EACxB,UAAS,QAAQ,KAAK,MAAM,GAAG,IAAI,CAAC;;;WAIpC;;AAGV,SAAO,SAAS,KAAK,OAAO,CAAC,MAAM,GAAG,kBAAkB;SAClD;AACN,SAAO;;;;AAKX,SAASA,gBAAc,SAA0B;AAC/C,KAAI,OAAO,YAAY,SAAU,QAAO;AACxC,KAAI,MAAM,QAAQ,QAAQ,CACxB,QAAO,QACJ,KAAK,MAAM;AACV,MAAI,OAAO,MAAM,SAAU,QAAO;EAClC,MAAM,QAAQ;AACd,MAAI,OAAO,KAAM,QAAO,OAAO,MAAM,KAAK;AAC1C,MAAI,OAAO,QAAS,QAAO,OAAO,MAAM,QAAQ;AAChD,SAAO;GACP,CACD,KAAK,IAAI,CACT,MAAM;AAEX,QAAO;;AAOT,MAAM,sBAAsB;;;;;;AAe5B,SAAS,mBACP,KACA,UACM;AACN,KAAI;EAEF,MAAM,eAAe,KADH,aAAa,IAAI,CACC,MAAM,oBAAoB;AAC9D,gBAAc,cAAc,KAAK,UAAU,UAAU,MAAM,EAAE,EAAE,QAAQ;AACvE,UAAQ,OAAO,MACb,+CAA+C,aAAa,IAC7D;UACM,GAAG;AACV,UAAQ,OAAO,MAAM,mDAAmD,EAAE,IAAI;;;;;;;;;AAclF,eAAsB,kBAAkB,SAA4C;CAClF,MAAM,EAAE,KAAK,gBAAgB,gBAAgB,cAAc;AAE3D,KAAI,CAAC,IACH,OAAM,IAAI,MAAM,mCAAmC;AAGrD,SAAQ,OAAO,MACb,+BAA+B,MAC5B,iBAAiB,aAAa,eAAe,KAAK,KAClD,YAAY,aAAa,UAAU,KAAK,GAAG,IAC/C;AAGD,KAAI,CAAC,mBAAmB,CAAC,gBAAgB;AACvC,UAAQ,OAAO,MACb,iFACD;AACD;;CAIF,IAAI,UAAU,QAAQ,WAAW;AAEjC,KAAI,CAAC,WAAW,kBAAkB,WAAW,eAAe,CAC1D,WAAU,qBAAqB,eAAe;AAGhD,KAAI,CAAC,WAAW,QAAQ,MAAM,CAAC,SAAS,IAAI;AAC1C,UAAQ,OAAO,MACb,wEACD;AACD;;AAGF,SAAQ,OAAO,MACb,2BAA2B,QAAQ,OAAO,sCAC3C;CAGD,MAAM,SAAS,MAAM,iBAAiB,iBAAiB,gBAAgB;EACrE;EACA;EACA,WAAW;EACX,YAAY;EACb,CAAC;AAEF,SAAQ,OAAO,MACb,kCAAkC,OAAO,QAAQ,cACpC,OAAO,iBAAiB,eAAe,OAAO,WAAW,QAAQ,EAAE,CAAC,WACvE,OAAO,WAAW,IAC7B;AAED,KAAI,OAAO,YAAY,SAAS,EAC9B,SAAQ,OAAO,MACb,gCAAgC,OAAO,YAAY,KAChD,MAAM,GAAG,EAAE,KAAK,IAAI,EAAE,QAAQ,KAAK,QAAQ,EAAE,CAAC,IAChD,CAAC,KAAK,KAAK,CAAC,IACd;AAGH,KAAI,OAAO,SAAS;AAElB,qBAAmB,KAAK;GACtB,4BAAW,IAAI,MAAM,EAAC,aAAa;GACnC,iBAAiB,OAAO;GACxB,kBAAkB,OAAO;GACzB,YAAY,OAAO;GACnB,SAAS,QAAQ,MAAM,GAAG,IAAI;GAC/B,CAAC;AAGF,MAAI;GAEF,MAAM,WAAW,mBADC,aAAa,IAAI,CACW,KAAK;AACnD,OAAI,SACF,kBACE,UACA,mDAAmD,OAAO,eAAe,UACjE,OAAO,iBAAiB,mBAAmB,OAAO,aAAa,KAAK,QAAQ,EAAE,CAAC,2DAExF;WAEI,GAAG;AACV,WAAQ,OAAO,MAAM,+CAA+C,EAAE,IAAI;;;AAI9E,SAAQ,OAAO,MAAM,yBAAyB;;;;;;;;;;;;;;;;;;;;;AChLhD,MAAM,qBAAqB;AAC3B,MAAM,2BAA2B,MAAU;AAM3C,IAAI,cAAqD;AACzD,IAAI,oBAA2D;;AAQ/D,SAAgB,cAAoB;AAClC,SAAQ,OAAO,MAAM,8CAA8C;AAEnE,eAAc,YAAY,YAAY;AACpC,MAAI;AACF,SAAM,iBAAiB;WAChB,GAAG;AACV,WAAQ,OAAO,MAAM,sDAAsD,EAAE,IAAI;;IAElF,mBAAmB;AAEtB,qBAAoB,kBAAkB;AACpC,MAAI;AACF,YAAS;WACF,GAAG;AACV,WAAQ,OAAO,MAAM,2CAA2C,EAAE,IAAI;;IAEvE,yBAAyB;AAE5B,SAAQ,OAAO,MAAM,0EAA0E;;;AAIjG,SAAgB,aAAmB;AACjC,KAAI,gBAAgB,MAAM;AACxB,gBAAc,YAAY;AAC1B,gBAAc;;AAEhB,KAAI,sBAAsB,MAAM;AAC9B,gBAAc,kBAAkB;AAChC,sBAAoB;;AAEtB,SAAQ,OAAO,MAAM,wCAAwC;;;;;;;AAQ/D,SAAgB,gBAAsB;AAQtC,eAAe,kBAAiC;CAC9C,MAAM,OAAO,SAAS;AACtB,KAAI,CAAC,KAAM;AAEX,SAAQ,OAAO,MACb,kCAAkC,KAAK,KAAK,OAAO,KAAK,GAAG,YAAY,KAAK,SAAS,MACtF;AAED,KAAI;AACF,UAAQ,KAAK,MAAb;GACE,KAAK;AACH,UAAM,iBAAiB,KAAK;AAC5B;GAEF,KAAK;AACH,UAAM,qBAAqB,KAAK,QAA4C;AAC5E;GAEF,KAAK;AACH,UAAM,sBAAsB,KAAK,QAA6C;AAC9E;GAEF,KAAK;AACH,UAAM,kBAAkB,KAAK,QAAyC;AACtE;GAEF,KAAK;AACH,UAAM,oBAAoB;AAC1B;GAEF,KAAK;GACL,KAAK;AAEH,YAAQ,OAAO,MACb,kCAAkC,KAAK,KAAK,mDAC7C;AACD;GAEF,QACE,OAAM,IAAI,MAAM,2BAA4B,KAAkB,OAAO;;AAGzE,gBAAc,KAAK,GAAG;AACtB,UAAQ,OAAO,MAAM,iCAAiC,KAAK,KAAK,OAAO,KAAK,GAAG,MAAM;UAC9E,GAAG;EACV,MAAM,MAAM,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;AACtD,aAAW,KAAK,IAAI,IAAI;;;;;;;;;;;AAgB5B,eAAe,iBAAiB,MAA+B;CAC7D,MAAM,EAAE,gBAAgB,KAAK,SAAS,gBAAgB,KAAK;AAM3D,KAAI,CAAC,eAAgB,OAAM,IAAI,MAAM,6CAA6C;AAClF,KAAI,CAAC,IAAK,OAAM,IAAI,MAAM,kCAAkC;CAG5D,IAAI;AACJ,KAAI;AACF,eAAa,aAAa,gBAAgB,QAAQ;UAC3C,GAAG;AACV,QAAM,IAAI,MAAM,gCAAgC,eAAe,IAAI,IAAI;;CAGzE,MAAM,QAAQ,WAAW,MAAM,CAAC,MAAM,KAAK;CAG3C,MAAM,YAAY,0BAA0B,MAAM;CAGlD,IAAI,UAAU,eAAe;AAC7B,KAAI,CAAC,SAAS;EACZ,MAAM,YAAY,aAAa,MAAM,MAAM,SAAS,GAAG;AAGvD,MAAI,WAAW,SAAS,eAAe,UAAU,SAAS,SAAS;GAEjE,MAAM,IADU,cAAc,UAAU,QAAQ,QAAQ,CACtC,MAAM,8BAA8B;AACtD,OAAI,EACF,WAAU,EAAE,GAAG,MAAM,CAAC,QAAQ,QAAQ,GAAG,CAAC,QAAQ,YAAY,GAAG,CAAC,MAAM;;;CAO9E,MAAM,kBAAkB,mBADN,aAAa,IAAI,CACkB,KAAK;AAE1D,KAAI,iBAAiB;AAEnB,MAAI,UAAU,SAAS,GAAG;AACxB,wBAAqB,iBAAiB,UAAU;AAChD,WAAQ,OAAO,MACb,6BAA6B,UAAU,OAAO,0BAC/C;aACQ,SAAS;AAClB,wBAAqB,iBAAiB,CAAC;IAAE,OAAO;IAAS,WAAW;IAAM,CAAC,CAAC;AAC5E,WAAQ,OAAO,MAAM,0DAA0D;;AAKjF,sBAAoB,iBADJ,WAAW,qBACkB;AAC7C,UAAQ,OAAO,MACb,+CAA+C,SAAS,gBAAgB,CAAC,KAC1E;AAUD,MAAI,UAAU,WAAW,KAAK,CAAC,QAC7B,SAAQ,OAAO,MACb,mFACD;MAED,KAAI;GACF,MAAM,aAAuB,EAAE;AAC/B,cAAW,KAAK,sBAAsB,MAAM;AAC5C,OAAI,UAAU,SAAS,GAAG;AACxB,eAAW,KAAK,IAAI,kBAAkB;AACtC,SAAK,MAAM,MAAM,UAAU,MAAM,GAAG,EAAE,CACpC,YAAW,KAAK,KAAK,GAAG,QAAQ;;AAGpC,OAAI,QACF,YAAW,KAAK,IAAI,mBAAmB,UAAU;AAEnD,sBACE,KACA,SAAS,gBAAgB,EACzB,WAAW,KAAK,KAAK,EACrB,eAGA,wBAAwB,eAAe,CACxC;WACM,WAAW;AAElB,WAAQ,OAAO,MACb,iDAAiD,UAAU,IAC5D;;OAIL,SAAQ,OAAO,MACb,8EACD;AAIH,KAAI;EAEF,MAAM,gBAAgB,iCADA,QAAQ,eAAe,CACwB;AACrE,MAAI,gBAAgB,EAClB,SAAQ,OAAO,MACb,gCAAgC,cAAc,kCAC/C;UAEI,WAAW;AAElB,UAAQ,OAAO,MAAM,qDAAqD,UAAU,IAAI;;;;;;;;;;AAe5F,eAAe,qBAAoC;AACjD,KAAI,CAAC,gBACH,OAAM,IAAI,MAAM,qDAAqD;CAGvE,MAAM,KAAK,KAAK,KAAK;AACrB,SAAQ,OAAO,MAAM,iDAAiD;CAEtE,MAAM,SAAS,MAAM,aAAa;CAClC,MAAM,UAAU,KAAK,KAAK,GAAG;AAE7B,SAAQ,OAAO,MACb,+CACG,OAAO,gBAAgB,aAAa,OAAO,YAAY,QAAQ,OAAO,gBAAgB,aACtF,OAAO,gBAAgB,aAAa,OAAO,YAAY,WAAW,QAAQ,OAC9E;AAED,KAAI,OAAO,QAAQ,SAAS,EAC1B,SAAQ,OAAO,MACb,sCAAsC,OAAO,QAAQ,OAAO,yCAC7D;;;;;;AAQL,SAAgB,sBAA4B;AAE1C,KAAI,6BAA6B,gBAAgB,EAAE;AACjD,UAAQ,OAAO,MAAM,+FAA+F;AACpH;;AAGF,SAAQ;EACN,MAAM;EACN,UAAU;EACV,SAAS,EAAE;EACZ,CAAC;;AAOJ,SAAS,aAAa,MAA8C;AAClE,KAAI;AACF,SAAO,KAAK,MAAM,KAAK;SACjB;AACN,SAAO;;;AAIX,SAAS,cAAc,SAA0B;AAC/C,KAAI,OAAO,YAAY,SAAU,QAAO;AACxC,KAAI,MAAM,QAAQ,QAAQ,CACxB,QAAO,QACJ,KAAK,MAAM;AACV,MAAI,OAAO,MAAM,SAAU,QAAO;EAClC,MAAM,QAAQ;AACd,MAAI,OAAO,KAAM,QAAO,OAAO,MAAM,KAAK;AAC1C,MAAI,OAAO,QAAS,QAAO,OAAO,MAAM,QAAQ;AAChD,SAAO;GACP,CACD,KAAK,IAAI,CACT,MAAM;AAEX,QAAO;;AAGT,SAAS,0BAA0B,OAAiC;CAClE,MAAM,YAA4B,EAAE;CACpC,MAAM,gCAAgB,IAAI,KAAa;AAEvC,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,aAAa,KAAK;AAChC,MAAI,CAAC,SAAS,MAAM,SAAS,YAAa;EAE1C,MAAM,MAAM,MAAM;AAClB,MAAI,CAAC,KAAK,QAAS;EAEnB,MAAM,UAAU,cAAc,IAAI,QAAQ;EAG1C,MAAM,eAAe,QAAQ,MAAM,4BAA4B;AAC/D,MAAI,cAAc;GAChB,MAAM,UAAU,aAAa,GAAG,MAAM;AACtC,OAAI,WAAW,CAAC,cAAc,IAAI,QAAQ,IAAI,QAAQ,SAAS,GAAG;AAChE,kBAAc,IAAI,QAAQ;IAE1B,MAAM,UAAoB,EAAE;IAC5B,MAAM,eAAe,QAAQ,MAAM,oCAAoC;AACvE,QAAI,cAAc;KAChB,MAAM,cAAc,aAAa,GAC9B,MAAM,KAAK,CACX,KAAK,MACJ,EAAE,QAAQ,aAAa,GAAG,CAAC,QAAQ,aAAa,GAAG,CAAC,MAAM,CAC3D,CACA,QAAQ,MAAM,EAAE,SAAS,KAAK,EAAE,SAAS,IAAI;AAChD,aAAQ,KAAK,GAAG,YAAY,MAAM,GAAG,EAAE,CAAC;;AAG1C,cAAU,KAAK;KACb,OAAO;KACP,SAAS,QAAQ,SAAS,IAAI,UAAU;KACxC,WAAW;KACZ,CAAC;;;EAKN,MAAM,iBAAiB,QAAQ,MAAM,8BAA8B;AACnE,MAAI,kBAAkB,UAAU,WAAW,GAAG;GAC5C,MAAM,YAAY,eAAe,GAC9B,MAAM,CACN,QAAQ,QAAQ,GAAG,CACnB,QAAQ,YAAY,GAAG,CACvB,MAAM;AACT,OAAI,aAAa,CAAC,cAAc,IAAI,UAAU,IAAI,UAAU,SAAS,GAAG;AACtE,kBAAc,IAAI,UAAU;AAC5B,cAAU,KAAK;KAAE,OAAO;KAAW,WAAW;KAAM,CAAC;;;;AAK3D,QAAO"}

package/dist/work-queue-worker-Taba_vcA.mjs

@@ -0,0 +1,11 @@
+import "./utils-C9HsYDpO.mjs";
+import "./migrate-BD7D8EEh.mjs";
+import "./factory-y36qGegI.mjs";
+import "./context-handover-cache-mGxq2-8f.mjs";
+import "./config-BbLFD7Uf.mjs";
+import "./run-env-BHWnXqle.mjs";
+import "./server-DlL1QI2k.mjs";
+import "./state-HyjqTihC.mjs";
+import { i as stopWorker, n as notifyNewWork, r as startWorker, t as enqueueRegistryScan } from "./work-queue-worker-DCzfH0d1.mjs";
+
+export { enqueueRegistryScan };

package/dist/{zettelkasten-BPxSOalU.mjs → zettelkasten-Dwj67e4p.mjs}

@@ -1,6 +1,6 @@
-import { r as saveQueryResult } from "./query-feedback-xz5axTj3.mjs";
-import { i as generateEmbedding, n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-DfrYNIng.mjs";
-import { t as zettelThemes } from "./themes-B2v7RNnA.mjs";
+import { r as saveQueryResult } from "./query-feedback-BIaZTTFO.mjs";
+import { i as generateEmbedding, n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-BbNVXa_0.mjs";
+import { t as zettelThemes } from "./themes-BgqahYVM.mjs";
 import { basename, dirname } from "node:path";
 
 //#region src/zettelkasten/explore.ts
@@ -1060,4 +1060,4 @@ async function zettelCommunities(backend, opts) {
 
 //#endregion
 export { zettelCommunities, zettelConverse, zettelExplore, zettelGodNotes, zettelHealth, zettelSuggest, zettelSurprise, zettelThemes };
-//# sourceMappingURL=zettelkasten-BPxSOalU.mjs.map
+//# sourceMappingURL=zettelkasten-Dwj67e4p.mjs.map