@tekmidian/pai 0.8.4 → 0.8.5

package/dist/postgres-CKf-EDtS.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"postgres-CKf-EDtS.mjs","names":["vault.upsertVaultFile","vault.deleteVaultFile","vault.getVaultFile","vault.getVaultFileByInode","vault.getAllVaultFiles","vault.getRecentVaultFiles","vault.countVaultFiles","vault.countVaultFilesWithPrefix","vault.countVaultFilesAfter","vault.getVaultFilesByPaths","vault.getVaultFilesByPathsAfter","vault.getAllVaultFilePaths","vault.getVaultFilePathsWithPrefix","vault.getVaultFilePathsAfter","vault.upsertVaultAliases","vault.deleteVaultAliases","vault.getVaultAlias","vault.replaceLinksForSources","vault.getLinksFromSource","vault.getLinksToTarget","vault.getVaultLinkGraph","vault.getDeadLinks","vault.getDeadLinksWithLineNumbers","vault.getDeadLinksWithPrefix","vault.getDeadLinksAfter","vault.countVaultLinksWithPrefix","vault.countVaultLinksAfter","vault.getVaultLinksFromPaths","vault.getVaultLinkEdges","vault.getVaultLinkEdgesWithPrefix","vault.getVaultLinkEdgesAfter","vault.upsertVaultHealth","vault.getVaultHealth","vault.getOrphans","vault.getOrphansWithPrefix","vault.getOrphansAfter","vault.getLowConnectivity","vault.getLowConnectivityWithPrefix","vault.getLowConnectivityAfter","vault.upsertNameIndex","vault.replaceNameIndex","vault.resolveVaultName","vault.searchVaultNameIndex"],"sources":["../src/storage/postgres/helpers.ts","../src/storage/postgres/search.ts","../src/storage/postgres/vault.ts","../src/storage/postgres/backend.ts"],"sourcesContent":["/**\n * Internal helper utilities for the Postgres storage backend.\n */\n\nimport { STOP_WORDS } from \"../../utils/stop-words.js\";\n\n/**\n * Convert a Buffer of Float32 LE bytes (as stored in SQLite) to number[].\n */\nexport function bufferToVector(buf: Buffer): number[] {\n  const floats: number[] = [];\n  for (let i = 0; i < buf.length; i += 4) {\n    floats.push(buf.readFloatLE(i));\n  }\n  return floats;\n}\n\n/**\n * Convert a free-text query to a Postgres tsquery string.\n *\n * Uses OR (|) semantics so that a chunk matching ANY query term is returned,\n * ranked by ts_rank (which scores higher when more terms match). AND (&)\n * semantics are too strict for multi-word queries because all terms rarely\n * co-occur in a single chunk.\n *\n * Example: \"Synchrotech interview follow-up Gilles\"\n *   → \"synchrotech | interview | follow | gilles\"\n */\nexport function buildPgTsQuery(query: string): string {\n  const tokens = query\n    .toLowerCase()\n    .split(/[\\s\\p{P}]+/u)\n    .filter(Boolean)\n    .filter((t) => t.length >= 2)\n    .filter((t) => !STOP_WORDS.has(t))\n    // Sanitize: strip tsquery special characters to prevent syntax errors\n    .map((t) => t.replace(/'/g, \"''\").replace(/[&|!():]/g, \"\"))\n    .filter(Boolean);\n\n  if (tokens.length === 0) {\n    const raw = query.replace(/[^a-z0-9]/gi, \" \").trim().split(/\\s+/).filter(Boolean).join(\" | \");\n    return raw || \"\";\n  }\n\n  return tokens.join(\" | \");\n}\n","/**\n * Keyword and semantic search implementations for the Postgres backend.\n * Functions take a `pool` parameter so they can be called from PostgresBackend methods.\n */\n\nimport type { Pool } from \"pg\";\nimport type { SearchResult, SearchOptions } from \"../../memory/search.js\";\nimport { buildPgTsQuery } from \"./helpers.js\";\n\n/**\n * Full-text keyword search using Postgres tsvector/tsquery with 'simple' dictionary.\n */\nexport async function searchKeyword(\n  pool: Pool,\n  query: string,\n  opts?: SearchOptions\n): Promise<SearchResult[]> {\n  const maxResults = opts?.maxResults ?? 10;\n\n  const tsQuery = buildPgTsQuery(query);\n  if (!tsQuery) return [];\n\n  const conditions: string[] = [\"fts_vector @@ to_tsquery('simple', $1)\"];\n  const params: (string | number)[] = [tsQuery];\n  let paramIdx = 2;\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`project_id IN (${placeholders})`);\n    params.push(...opts.projectIds);\n  }\n\n  if (opts?.sources && opts.sources.length > 0) {\n    const placeholders = opts.sources.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`source IN (${placeholders})`);\n    params.push(...opts.sources);\n  }\n\n  if (opts?.tiers && opts.tiers.length > 0) {\n    const placeholders = opts.tiers.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  params.push(maxResults);\n  const limitParam = `$${paramIdx}`;\n\n  const sql = `\n    SELECT\n      project_id,\n      path,\n      start_line,\n      end_line,\n      text AS snippet,\n      tier,\n      source,\n      ts_rank(fts_vector, to_tsquery('simple', $1)) AS rank_score\n    FROM pai_chunks\n    WHERE ${conditions.join(\" AND \")}\n    ORDER BY rank_score DESC\n    LIMIT ${limitParam}\n  `;\n\n  try {\n    const result = await pool.query<{\n      project_id: number;\n      path: string;\n      start_line: number;\n      end_line: number;\n      snippet: string;\n      tier: string;\n      source: string;\n      rank_score: number;\n    }>(sql, params);\n\n    return result.rows.map((row) => ({\n      projectId: row.project_id,\n      path: row.path,\n      startLine: row.start_line,\n      endLine: row.end_line,\n      snippet: row.snippet,\n      score: row.rank_score,\n      tier: row.tier,\n      source: row.source,\n    }));\n  } catch (e) {\n    process.stderr.write(`[pai-postgres] searchKeyword error: ${e}\\n`);\n    return [];\n  }\n}\n\n/**\n * Semantic vector similarity search using pgvector cosine distance (<=>).\n */\nexport async function searchSemantic(\n  pool: Pool,\n  queryEmbedding: Float32Array,\n  opts?: SearchOptions\n): Promise<SearchResult[]> {\n  const maxResults = opts?.maxResults ?? 10;\n\n  const conditions: string[] = [\"embedding IS NOT NULL\"];\n  const params: (string | number)[] = [];\n  let paramIdx = 1;\n\n  const vecStr = \"[\" + Array.from(queryEmbedding).join(\",\") + \"]\";\n  params.push(vecStr);\n  const vecParam = `$${paramIdx++}`;\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`project_id IN (${placeholders})`);\n    params.push(...opts.projectIds);\n  }\n\n  if (opts?.sources && opts.sources.length > 0) {\n    const placeholders = opts.sources.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`source IN (${placeholders})`);\n    params.push(...opts.sources);\n  }\n\n  if (opts?.tiers && opts.tiers.length > 0) {\n    const placeholders = opts.tiers.map(() => `$${paramIdx++}`).join(\", \");\n    conditions.push(`tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  params.push(maxResults);\n  const limitParam = `$${paramIdx}`;\n\n  // <=> is cosine distance; 1 - distance = cosine similarity\n  const sql = `\n    SELECT\n      project_id,\n      path,\n      start_line,\n      end_line,\n      text AS snippet,\n      tier,\n      source,\n      1 - (embedding <=> ${vecParam}::vector) AS cosine_similarity\n    FROM pai_chunks\n    WHERE ${conditions.join(\" AND \")}\n    ORDER BY embedding <=> ${vecParam}::vector\n    LIMIT ${limitParam}\n  `;\n\n  try {\n    const result = await pool.query<{\n      project_id: number;\n      path: string;\n      start_line: number;\n      end_line: number;\n      snippet: string;\n      tier: string;\n      source: string;\n      cosine_similarity: number;\n    }>(sql, params);\n\n    const minScore = opts?.minScore ?? -Infinity;\n\n    return result.rows\n      .map((row) => ({\n        projectId: row.project_id,\n        path: row.path,\n        startLine: row.start_line,\n        endLine: row.end_line,\n        snippet: row.snippet,\n        score: row.cosine_similarity,\n        tier: row.tier,\n        source: row.source,\n      }))\n      .filter((r) => r.score >= minScore);\n  } catch (e) {\n    process.stderr.write(`[pai-postgres] searchSemantic error: ${e}\\n`);\n    return [];\n  }\n}\n","/**\n * Vault storage operations for the Postgres backend.\n * All functions take a `pool` parameter — called from PostgresBackend methods.\n */\n\nimport type { Pool } from \"pg\";\nimport type {\n  VaultFileRow, VaultAliasRow, VaultLinkRow, VaultHealthRow, VaultNameEntry,\n} from \"../interface.js\";\n\n// ---------------------------------------------------------------------------\n// Vault files\n// ---------------------------------------------------------------------------\n\nexport async function upsertVaultFile(pool: Pool, file: VaultFileRow): Promise<void> {\n  await pool.query(\n    `INSERT INTO vault_files (vault_path, inode, device, hash, title, indexed_at)\n     VALUES ($1, $2, $3, $4, $5, $6)\n     ON CONFLICT (vault_path) DO UPDATE SET\n       inode = EXCLUDED.inode, device = EXCLUDED.device,\n       hash = EXCLUDED.hash, title = EXCLUDED.title,\n       indexed_at = EXCLUDED.indexed_at`,\n    [file.vaultPath, file.inode, file.device, file.hash, file.title, file.indexedAt]\n  );\n}\n\nexport async function deleteVaultFile(pool: Pool, vaultPath: string): Promise<void> {\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    await client.query(\"DELETE FROM vault_links WHERE source_path = $1\", [vaultPath]);\n    await client.query(\"DELETE FROM vault_health WHERE vault_path = $1\", [vaultPath]);\n    await client.query(\"DELETE FROM vault_name_index WHERE vault_path = $1\", [vaultPath]);\n    await client.query(\"DELETE FROM vault_aliases WHERE vault_path = $1 OR canonical_path = $1\", [vaultPath]);\n    await client.query(\"DELETE FROM vault_files WHERE vault_path = $1\", [vaultPath]);\n    await client.query(\"COMMIT\");\n  } catch (e) {\n    await client.query(\"ROLLBACK\");\n    throw e;\n  } finally {\n    client.release();\n  }\n}\n\ntype VaultFileDbRow = { vault_path: string; inode: string; device: string; hash: string; title: string | null; indexed_at: string };\n\nfunction mapVaultFileRow(row: VaultFileDbRow): VaultFileRow {\n  return {\n    vaultPath: row.vault_path,\n    inode: Number(row.inode),\n    device: Number(row.device),\n    hash: row.hash,\n    title: row.title,\n    indexedAt: Number(row.indexed_at),\n  };\n}\n\nexport async function getVaultFile(pool: Pool, vaultPath: string): Promise<VaultFileRow | null> {\n  const r = await pool.query<VaultFileDbRow>(\n    \"SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files WHERE vault_path = $1\",\n    [vaultPath]\n  );\n  return r.rows.length === 0 ? null : mapVaultFileRow(r.rows[0]);\n}\n\nexport async function getVaultFileByInode(pool: Pool, inode: number, device: number): Promise<VaultFileRow | null> {\n  const r = await pool.query<VaultFileDbRow>(\n    \"SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files WHERE inode = $1 AND device = $2 LIMIT 1\",\n    [inode, device]\n  );\n  return r.rows.length === 0 ? null : mapVaultFileRow(r.rows[0]);\n}\n\nexport async function getAllVaultFiles(pool: Pool): Promise<VaultFileRow[]> {\n  const r = await pool.query<VaultFileDbRow>(\"SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files\");\n  return r.rows.map(mapVaultFileRow);\n}\n\nexport async function getRecentVaultFiles(pool: Pool, sinceMs: number): Promise<VaultFileRow[]> {\n  const r = await pool.query<VaultFileDbRow>(\n    \"SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files WHERE indexed_at > $1\",\n    [sinceMs]\n  );\n  return r.rows.map(mapVaultFileRow);\n}\n\nexport async function countVaultFiles(pool: Pool): Promise<number> {\n  const r = await pool.query<{ n: string }>(\"SELECT COUNT(*)::text AS n FROM vault_files\");\n  return parseInt(r.rows[0]?.n ?? \"0\", 10);\n}\n\nexport async function countVaultFilesWithPrefix(pool: Pool, prefix: string): Promise<number> {\n  const r = await pool.query<{ n: string }>(\"SELECT COUNT(*) AS n FROM vault_files WHERE vault_path LIKE $1\", [`${prefix}%`]);\n  return Number(r.rows[0]?.n ?? 0);\n}\n\nexport async function countVaultFilesAfter(pool: Pool, sinceMs: number): Promise<number> {\n  const r = await pool.query<{ n: string }>(\"SELECT COUNT(*) AS n FROM vault_files WHERE indexed_at > $1\", [sinceMs]);\n  return Number(r.rows[0]?.n ?? 0);\n}\n\nexport async function getVaultFilesByPaths(pool: Pool, paths: string[]): Promise<VaultFileRow[]> {\n  if (paths.length === 0) return [];\n  const placeholders = paths.map((_, i) => `$${i + 1}`).join(\", \");\n  const r = await pool.query<VaultFileDbRow>(\n    `SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files WHERE vault_path IN (${placeholders})`,\n    paths\n  );\n  return r.rows.map(mapVaultFileRow);\n}\n\nexport async function getVaultFilesByPathsAfter(pool: Pool, paths: string[], sinceMs: number): Promise<VaultFileRow[]> {\n  if (paths.length === 0) return [];\n  const placeholders = paths.map((_, i) => `$${i + 1}`).join(\", \");\n  const r = await pool.query<VaultFileDbRow>(\n    `SELECT vault_path, inode, device, hash, title, indexed_at FROM vault_files WHERE vault_path IN (${placeholders}) AND indexed_at >= $${paths.length + 1} ORDER BY indexed_at ASC`,\n    [...paths, sinceMs]\n  );\n  return r.rows.map(mapVaultFileRow);\n}\n\nexport async function getAllVaultFilePaths(pool: Pool): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\"SELECT vault_path FROM vault_files\");\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getVaultFilePathsWithPrefix(pool: Pool, prefix: string): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_files WHERE vault_path LIKE $1\",\n    [`${prefix}%`]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getVaultFilePathsAfter(pool: Pool, sinceMs: number): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_files WHERE indexed_at > $1\",\n    [sinceMs]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\n// ---------------------------------------------------------------------------\n// Vault aliases\n// ---------------------------------------------------------------------------\n\nexport async function upsertVaultAliases(pool: Pool, aliases: VaultAliasRow[]): Promise<void> {\n  if (aliases.length === 0) return;\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    for (const a of aliases) {\n      await client.query(\n        `INSERT INTO vault_aliases (vault_path, canonical_path, inode, device)\n         VALUES ($1, $2, $3, $4)\n         ON CONFLICT (vault_path) DO UPDATE SET\n           canonical_path = EXCLUDED.canonical_path,\n           inode = EXCLUDED.inode, device = EXCLUDED.device`,\n        [a.vaultPath, a.canonicalPath, a.inode, a.device]\n      );\n    }\n    await client.query(\"COMMIT\");\n  } catch (e) {\n    await client.query(\"ROLLBACK\");\n    throw e;\n  } finally {\n    client.release();\n  }\n}\n\nexport async function deleteVaultAliases(pool: Pool, canonicalPath: string): Promise<void> {\n  await pool.query(\"DELETE FROM vault_aliases WHERE canonical_path = $1\", [canonicalPath]);\n}\n\nexport async function getVaultAlias(pool: Pool, vaultPath: string): Promise<{ canonicalPath: string } | null> {\n  const r = await pool.query<{ canonical_path: string }>(\n    \"SELECT canonical_path FROM vault_aliases WHERE vault_path = $1\",\n    [vaultPath]\n  );\n  return r.rows.length > 0 ? { canonicalPath: r.rows[0].canonical_path } : null;\n}\n\n// ---------------------------------------------------------------------------\n// Vault links\n// ---------------------------------------------------------------------------\n\ntype VaultLinkDbRow = { source_path: string; target_raw: string; target_path: string | null; link_type: string; line_number: number };\n\nfunction mapVaultLinkRow(row: VaultLinkDbRow): VaultLinkRow {\n  return {\n    sourcePath: row.source_path,\n    targetRaw: row.target_raw,\n    targetPath: row.target_path,\n    linkType: row.link_type,\n    lineNumber: row.line_number,\n  };\n}\n\nexport async function replaceLinksForSources(pool: Pool, sourcePaths: string[], links: VaultLinkRow[]): Promise<void> {\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    if (sourcePaths.length > 0) {\n      await client.query(\n        \"DELETE FROM vault_links WHERE source_path = ANY($1::text[])\",\n        [sourcePaths]\n      );\n    }\n    for (let i = 0; i < links.length; i += 500) {\n      const batch = links.slice(i, i + 500);\n      const values: string[] = [];\n      const params: (string | number | null)[] = [];\n      let idx = 1;\n      for (const l of batch) {\n        values.push(`($${idx++}, $${idx++}, $${idx++}, $${idx++}, $${idx++})`);\n        params.push(l.sourcePath, l.targetRaw, l.targetPath, l.linkType, l.lineNumber);\n      }\n      await client.query(\n        `INSERT INTO vault_links (source_path, target_raw, target_path, link_type, line_number)\n         VALUES ${values.join(\", \")}\n         ON CONFLICT (source_path, target_raw, line_number) DO UPDATE SET\n           target_path = EXCLUDED.target_path, link_type = EXCLUDED.link_type`,\n        params\n      );\n    }\n    await client.query(\"COMMIT\");\n  } catch (e) {\n    await client.query(\"ROLLBACK\");\n    throw e;\n  } finally {\n    client.release();\n  }\n}\n\nexport async function getLinksFromSource(pool: Pool, sourcePath: string): Promise<VaultLinkRow[]> {\n  const r = await pool.query<VaultLinkDbRow>(\n    \"SELECT source_path, target_raw, target_path, link_type, line_number FROM vault_links WHERE source_path = $1\",\n    [sourcePath]\n  );\n  return r.rows.map(mapVaultLinkRow);\n}\n\nexport async function getLinksToTarget(pool: Pool, targetPath: string): Promise<VaultLinkRow[]> {\n  const r = await pool.query<VaultLinkDbRow>(\n    \"SELECT source_path, target_raw, target_path, link_type, line_number FROM vault_links WHERE target_path = $1\",\n    [targetPath]\n  );\n  return r.rows.map(mapVaultLinkRow);\n}\n\nexport async function getVaultLinkGraph(pool: Pool): Promise<Array<{ source_path: string; target_path: string }>> {\n  const r = await pool.query<{ source_path: string; target_path: string }>(\n    \"SELECT source_path, target_path FROM vault_links WHERE target_path IS NOT NULL\"\n  );\n  return r.rows;\n}\n\nexport async function getDeadLinks(pool: Pool): Promise<Array<{ sourcePath: string; targetRaw: string }>> {\n  const r = await pool.query<{ source_path: string; target_raw: string }>(\n    \"SELECT source_path, target_raw FROM vault_links WHERE target_path IS NULL\"\n  );\n  return r.rows.map(row => ({ sourcePath: row.source_path, targetRaw: row.target_raw }));\n}\n\nexport async function getDeadLinksWithLineNumbers(pool: Pool): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> {\n  const r = await pool.query<{ source_path: string; target_raw: string; line_number: number }>(\n    \"SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL\"\n  );\n  return r.rows.map(row => ({ sourcePath: row.source_path, targetRaw: row.target_raw, lineNumber: row.line_number }));\n}\n\nexport async function getDeadLinksWithPrefix(pool: Pool, prefix: string): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> {\n  const r = await pool.query<{ source_path: string; target_raw: string; line_number: number }>(\n    \"SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL AND source_path LIKE $1\",\n    [`${prefix}%`]\n  );\n  return r.rows.map(row => ({ sourcePath: row.source_path, targetRaw: row.target_raw, lineNumber: row.line_number }));\n}\n\nexport async function getDeadLinksAfter(pool: Pool, sinceMs: number): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> {\n  const r = await pool.query<{ source_path: string; target_raw: string; line_number: number }>(\n    \"SELECT source_path, target_raw, line_number FROM vault_links WHERE target_path IS NULL AND source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > $1)\",\n    [sinceMs]\n  );\n  return r.rows.map(row => ({ sourcePath: row.source_path, targetRaw: row.target_raw, lineNumber: row.line_number }));\n}\n\nexport async function countVaultLinksWithPrefix(pool: Pool, prefix: string): Promise<number> {\n  const r = await pool.query<{ n: string }>(\"SELECT COUNT(*) AS n FROM vault_links WHERE source_path LIKE $1\", [`${prefix}%`]);\n  return Number(r.rows[0]?.n ?? 0);\n}\n\nexport async function countVaultLinksAfter(pool: Pool, sinceMs: number): Promise<number> {\n  const r = await pool.query<{ n: string }>(\n    \"SELECT COUNT(*) AS n FROM vault_links WHERE source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > $1)\",\n    [sinceMs]\n  );\n  return Number(r.rows[0]?.n ?? 0);\n}\n\nexport async function getVaultLinksFromPaths(pool: Pool, sourcePaths: string[]): Promise<VaultLinkRow[]> {\n  if (sourcePaths.length === 0) return [];\n  const placeholders = sourcePaths.map((_, i) => `$${i + 1}`).join(\", \");\n  const r = await pool.query<VaultLinkDbRow>(\n    `SELECT source_path, target_raw, target_path, link_type, line_number FROM vault_links WHERE source_path IN (${placeholders}) AND target_path IS NOT NULL`,\n    sourcePaths\n  );\n  return r.rows.map(mapVaultLinkRow);\n}\n\nexport async function getVaultLinkEdges(pool: Pool): Promise<Array<{ source: string; target: string }>> {\n  const r = await pool.query<{ source: string; target: string }>(\n    \"SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL\"\n  );\n  return r.rows;\n}\n\nexport async function getVaultLinkEdgesWithPrefix(pool: Pool, prefix: string): Promise<Array<{ source: string; target: string }>> {\n  const r = await pool.query<{ source: string; target: string }>(\n    \"SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL AND source_path LIKE $1\",\n    [`${prefix}%`]\n  );\n  return r.rows;\n}\n\nexport async function getVaultLinkEdgesAfter(pool: Pool, sinceMs: number): Promise<Array<{ source: string; target: string }>> {\n  const r = await pool.query<{ source: string; target: string }>(\n    \"SELECT DISTINCT source_path AS source, target_path AS target FROM vault_links WHERE target_path IS NOT NULL AND source_path IN (SELECT vault_path FROM vault_files WHERE indexed_at > $1)\",\n    [sinceMs]\n  );\n  return r.rows;\n}\n\n// ---------------------------------------------------------------------------\n// Vault health\n// ---------------------------------------------------------------------------\n\ntype VaultHealthDbRow = { vault_path: string; inbound_count: number; outbound_count: number; dead_link_count: number; is_orphan: number; computed_at: string };\n\nfunction mapVaultHealthRow(row: VaultHealthDbRow): VaultHealthRow {\n  return {\n    vaultPath: row.vault_path,\n    inboundCount: row.inbound_count,\n    outboundCount: row.outbound_count,\n    deadLinkCount: row.dead_link_count,\n    isOrphan: row.is_orphan === 1,\n    computedAt: Number(row.computed_at),\n  };\n}\n\nexport async function upsertVaultHealth(pool: Pool, rows: VaultHealthRow[]): Promise<void> {\n  if (rows.length === 0) return;\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    for (const h of rows) {\n      await client.query(\n        `INSERT INTO vault_health (vault_path, inbound_count, outbound_count, dead_link_count, is_orphan, computed_at)\n         VALUES ($1, $2, $3, $4, $5, $6)\n         ON CONFLICT (vault_path) DO UPDATE SET\n           inbound_count = EXCLUDED.inbound_count,\n           outbound_count = EXCLUDED.outbound_count,\n           dead_link_count = EXCLUDED.dead_link_count,\n           is_orphan = EXCLUDED.is_orphan,\n           computed_at = EXCLUDED.computed_at`,\n        [h.vaultPath, h.inboundCount, h.outboundCount, h.deadLinkCount, h.isOrphan ? 1 : 0, h.computedAt]\n      );\n    }\n    await client.query(\"COMMIT\");\n  } catch (e) {\n    await client.query(\"ROLLBACK\");\n    throw e;\n  } finally {\n    client.release();\n  }\n}\n\nexport async function getVaultHealth(pool: Pool, vaultPath: string): Promise<VaultHealthRow | null> {\n  const r = await pool.query<VaultHealthDbRow>(\n    \"SELECT vault_path, inbound_count, outbound_count, dead_link_count, is_orphan, computed_at FROM vault_health WHERE vault_path = $1\",\n    [vaultPath]\n  );\n  return r.rows.length === 0 ? null : mapVaultHealthRow(r.rows[0]);\n}\n\nexport async function getOrphans(pool: Pool): Promise<VaultHealthRow[]> {\n  const r = await pool.query<VaultHealthDbRow>(\n    \"SELECT vault_path, inbound_count, outbound_count, dead_link_count, is_orphan, computed_at FROM vault_health WHERE is_orphan = 1\"\n  );\n  return r.rows.map(row => ({ ...mapVaultHealthRow(row), isOrphan: true }));\n}\n\nexport async function getOrphansWithPrefix(pool: Pool, prefix: string): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_health WHERE is_orphan = 1 AND vault_path LIKE $1\",\n    [`${prefix}%`]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getOrphansAfter(pool: Pool, sinceMs: number): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vh.vault_path FROM vault_health vh JOIN vault_files vf ON vh.vault_path = vf.vault_path WHERE vh.is_orphan = 1 AND vf.indexed_at > $1\",\n    [sinceMs]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getLowConnectivity(pool: Pool): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_health WHERE inbound_count + outbound_count <= 1\"\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getLowConnectivityWithPrefix(pool: Pool, prefix: string): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_health WHERE inbound_count + outbound_count <= 1 AND vault_path LIKE $1\",\n    [`${prefix}%`]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function getLowConnectivityAfter(pool: Pool, sinceMs: number): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vh.vault_path FROM vault_health vh JOIN vault_files vf ON vh.vault_path = vf.vault_path WHERE vh.inbound_count + vh.outbound_count <= 1 AND vf.indexed_at > $1\",\n    [sinceMs]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\n// ---------------------------------------------------------------------------\n// Vault name index\n// ---------------------------------------------------------------------------\n\nexport async function upsertNameIndex(pool: Pool, entries: VaultNameEntry[]): Promise<void> {\n  if (entries.length === 0) return;\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    for (const e of entries) {\n      await client.query(\n        `INSERT INTO vault_name_index (name, vault_path)\n         VALUES ($1, $2) ON CONFLICT (name, vault_path) DO NOTHING`,\n        [e.name, e.vaultPath]\n      );\n    }\n    await client.query(\"COMMIT\");\n  } catch (e_) {\n    await client.query(\"ROLLBACK\");\n    throw e_;\n  } finally {\n    client.release();\n  }\n}\n\nexport async function replaceNameIndex(pool: Pool, entries: VaultNameEntry[]): Promise<void> {\n  const client = await pool.connect();\n  try {\n    await client.query(\"BEGIN\");\n    await client.query(\"DELETE FROM vault_name_index\");\n    for (let i = 0; i < entries.length; i += 500) {\n      const batch = entries.slice(i, i + 500);\n      const values: string[] = [];\n      const params: string[] = [];\n      let idx = 1;\n      for (const e of batch) {\n        values.push(`($${idx++}, $${idx++})`);\n        params.push(e.name, e.vaultPath);\n      }\n      await client.query(\n        `INSERT INTO vault_name_index (name, vault_path) VALUES ${values.join(\", \")}`,\n        params\n      );\n    }\n    await client.query(\"COMMIT\");\n  } catch (e) {\n    await client.query(\"ROLLBACK\");\n    throw e;\n  } finally {\n    client.release();\n  }\n}\n\nexport async function resolveVaultName(pool: Pool, name: string): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT vault_path FROM vault_name_index WHERE name = $1\",\n    [name]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n\nexport async function searchVaultNameIndex(pool: Pool, query: string, limit = 100): Promise<string[]> {\n  const r = await pool.query<{ vault_path: string }>(\n    \"SELECT DISTINCT vault_path FROM vault_name_index WHERE lower(name) LIKE lower($1) LIMIT $2\",\n    [`%${query}%`, limit]\n  );\n  return r.rows.map(row => row.vault_path);\n}\n","/**\n * PostgresBackend — implements StorageBackend using PostgreSQL + pgvector.\n *\n * Vector similarity: pgvector's <=> cosine distance operator\n * Full-text search:  PostgreSQL tsvector/tsquery (replaces SQLite FTS5)\n * Connection pooling: node-postgres Pool\n *\n * Schema is auto-initialized on first connection if tables don't exist.\n * Per-user database isolation: each macOS user gets their own database (pai_<username>).\n */\n\nimport pg from \"pg\";\nimport type { Pool, PoolClient } from \"pg\";\nimport { readFileSync } from \"node:fs\";\nimport { join, dirname } from \"node:path\";\nimport { fileURLToPath } from \"node:url\";\nimport type {\n  StorageBackend, ChunkRow, FileRow, FederationStats,\n  VaultFileRow, VaultAliasRow, VaultLinkRow, VaultHealthRow, VaultNameEntry,\n} from \"../interface.js\";\nimport type { SearchResult, SearchOptions } from \"../../memory/search.js\";\nimport type { PostgresConfig } from \"./config.js\";\nimport { bufferToVector } from \"./helpers.js\";\nimport { searchKeyword, searchSemantic } from \"./search.js\";\nimport * as vault from \"./vault.js\";\n\nconst { Pool: PgPool } = pg;\n\nexport class PostgresBackend implements StorageBackend {\n  readonly backendType = \"postgres\" as const;\n\n  private pool: Pool;\n\n  /**\n   * Ensure the per-user database exists and has the required schema.\n   * Connects to the default 'postgres' database to CREATE DATABASE if needed,\n   * then connects to the target database to apply init.sql schema.\n   * Safe to call multiple times (fully idempotent).\n   */\n  static async ensureDatabase(config: PostgresConfig): Promise<void> {\n    const connStr =\n      config.connectionString ??\n      `postgresql://${config.user ?? \"pai\"}:${config.password ?? \"pai\"}@${config.host ?? \"localhost\"}:${config.port ?? 5432}/${config.database ?? \"pai\"}`;\n    const url = new URL(connStr);\n    const targetDb = url.pathname.slice(1);\n\n    const adminUrl = new URL(connStr);\n    adminUrl.pathname = \"/postgres\";\n    const adminPool = new PgPool({\n      connectionString: adminUrl.toString(),\n      max: 1,\n      connectionTimeoutMillis: 5000,\n    });\n\n    try {\n      const check = await adminPool.query(\n        \"SELECT 1 FROM pg_database WHERE datname = $1\",\n        [targetDb]\n      );\n      if (check.rowCount === 0) {\n        await adminPool.query(`CREATE DATABASE \"${targetDb}\"`);\n        process.stderr.write(`[pai-postgres] Created database: ${targetDb}\\n`);\n      }\n    } finally {\n      await adminPool.end();\n    }\n\n    const targetPool = new PgPool({\n      connectionString: connStr,\n      max: 1,\n      connectionTimeoutMillis: 5000,\n    });\n\n    try {\n      const tableCheck = await targetPool.query(\n        \"SELECT 1 FROM information_schema.tables WHERE table_name = 'pai_chunks'\"\n      );\n      if (tableCheck.rowCount === 0) {\n        const __dirname = dirname(fileURLToPath(import.meta.url));\n        const initSqlPath = join(__dirname, \"../../docker/init.sql\");\n        let initSql: string;\n        try {\n          initSql = readFileSync(initSqlPath, \"utf-8\");\n        } catch {\n          const altPath = join(__dirname, \"../docker/init.sql\");\n          initSql = readFileSync(altPath, \"utf-8\");\n        }\n        await targetPool.query(initSql);\n        process.stderr.write(`[pai-postgres] Applied schema to database: ${targetDb}\\n`);\n      }\n    } finally {\n      await targetPool.end();\n    }\n  }\n\n  constructor(config: PostgresConfig) {\n    const connStr =\n      config.connectionString ??\n      `postgresql://${config.user ?? \"pai\"}:${config.password ?? \"pai\"}@${config.host ?? \"localhost\"}:${config.port ?? 5432}/${config.database ?? \"pai\"}`;\n\n    this.pool = new PgPool({\n      connectionString: connStr,\n      max: config.maxConnections ?? 5,\n      connectionTimeoutMillis: config.connectionTimeoutMs ?? 5000,\n      idleTimeoutMillis: 30_000,\n    });\n\n    this.pool.on(\"error\", (err) => {\n      process.stderr.write(`[pai-postgres] Pool error: ${err.message}\\n`);\n    });\n  }\n\n  // -------------------------------------------------------------------------\n  // Lifecycle\n  // -------------------------------------------------------------------------\n\n  async close(): Promise<void> {\n    await this.pool.end();\n  }\n\n  /**\n   * Expose the underlying pg.Pool for callers that need direct query access\n   * (e.g. the daemon's observation IPC methods).\n   */\n  getPool(): Pool {\n    return this.pool;\n  }\n\n  async getStats(): Promise<FederationStats> {\n    const client = await this.pool.connect();\n    try {\n      const filesResult = await client.query<{ n: string }>(\n        \"SELECT COUNT(*)::text AS n FROM pai_files\"\n      );\n      const chunksResult = await client.query<{ n: string }>(\n        \"SELECT COUNT(*)::text AS n FROM pai_chunks\"\n      );\n      return {\n        files: parseInt(filesResult.rows[0]?.n ?? \"0\", 10),\n        chunks: parseInt(chunksResult.rows[0]?.n ?? \"0\", 10),\n      };\n    } finally {\n      client.release();\n    }\n  }\n\n  /**\n   * Test the connection by running a trivial query.\n   * Returns null on success, error message on failure.\n   */\n  async testConnection(): Promise<string | null> {\n    let client: PoolClient | null = null;\n    try {\n      client = await this.pool.connect();\n      await client.query(\"SELECT 1\");\n      return null;\n    } catch (e) {\n      return e instanceof Error ? e.message : String(e);\n    } finally {\n      client?.release();\n    }\n  }\n\n  // -------------------------------------------------------------------------\n  // File tracking\n  // -------------------------------------------------------------------------\n\n  async getFileHash(projectId: number, path: string): Promise<string | undefined> {\n    const result = await this.pool.query<{ hash: string }>(\n      \"SELECT hash FROM pai_files WHERE project_id = $1 AND path = $2\",\n      [projectId, path]\n    );\n    return result.rows[0]?.hash;\n  }\n\n  async upsertFile(file: FileRow): Promise<void> {\n    await this.pool.query(\n      `INSERT INTO pai_files (project_id, path, source, tier, hash, mtime, size)\n       VALUES ($1, $2, $3, $4, $5, $6, $7)\n       ON CONFLICT (project_id, path) DO UPDATE SET\n         source = EXCLUDED.source,\n         tier   = EXCLUDED.tier,\n         hash   = EXCLUDED.hash,\n         mtime  = EXCLUDED.mtime,\n         size   = EXCLUDED.size`,\n      [file.projectId, file.path, file.source, file.tier, file.hash, file.mtime, file.size]\n    );\n  }\n\n  // -------------------------------------------------------------------------\n  // Chunk management\n  // -------------------------------------------------------------------------\n\n  async getChunkIds(projectId: number, path: string): Promise<string[]> {\n    const result = await this.pool.query<{ id: string }>(\n      \"SELECT id FROM pai_chunks WHERE project_id = $1 AND path = $2\",\n      [projectId, path]\n    );\n    return result.rows.map((r) => r.id);\n  }\n\n  async deleteChunksForFile(projectId: number, path: string): Promise<void> {\n    await this.pool.query(\n      \"DELETE FROM pai_chunks WHERE project_id = $1 AND path = $2\",\n      [projectId, path]\n    );\n  }\n\n  async insertChunks(chunks: ChunkRow[]): Promise<void> {\n    if (chunks.length === 0) return;\n\n    const client = await this.pool.connect();\n    try {\n      await client.query(\"BEGIN\");\n\n      for (const c of chunks) {\n        const safeText = c.text.replace(/\\0/g, \"\");\n\n        await client.query(\n          `INSERT INTO pai_chunks\n             (id, project_id, source, tier, path, start_line, end_line, hash, text, updated_at, fts_vector)\n           VALUES\n             ($1, $2, $3, $4, $5, $6, $7, $8, $9, $10,\n              to_tsvector('simple', $9))\n           ON CONFLICT (id) DO UPDATE SET\n             project_id = EXCLUDED.project_id,\n             source     = EXCLUDED.source,\n             tier       = EXCLUDED.tier,\n             path       = EXCLUDED.path,\n             start_line = EXCLUDED.start_line,\n             end_line   = EXCLUDED.end_line,\n             hash       = EXCLUDED.hash,\n             text       = EXCLUDED.text,\n             updated_at = EXCLUDED.updated_at,\n             fts_vector = EXCLUDED.fts_vector`,\n          [\n            c.id, c.projectId, c.source, c.tier, c.path,\n            c.startLine, c.endLine, c.hash, safeText, c.updatedAt,\n          ]\n        );\n      }\n\n      await client.query(\"COMMIT\");\n    } catch (e) {\n      await client.query(\"ROLLBACK\");\n      throw e;\n    } finally {\n      client.release();\n    }\n  }\n\n  async getDistinctChunkPaths(projectId: number): Promise<string[]> {\n    const result = await this.pool.query<{ path: string }>(\n      \"SELECT DISTINCT path FROM pai_chunks WHERE project_id = $1\",\n      [projectId]\n    );\n    return result.rows.map((r) => r.path);\n  }\n\n  async deletePaths(projectId: number, paths: string[]): Promise<void> {\n    if (paths.length === 0) return;\n    const client = await this.pool.connect();\n    try {\n      await client.query(\"BEGIN\");\n      for (const path of paths) {\n        await client.query(\"DELETE FROM pai_chunks WHERE project_id = $1 AND path = $2\", [projectId, path]);\n        await client.query(\"DELETE FROM pai_files WHERE project_id = $1 AND path = $2\", [projectId, path]);\n      }\n      await client.query(\"COMMIT\");\n    } catch (e) {\n      await client.query(\"ROLLBACK\");\n      throw e;\n    } finally {\n      client.release();\n    }\n  }\n\n  async getUnembeddedChunkIds(projectId?: number): Promise<Array<{ id: string; text: string; project_id: number; path: string }>> {\n    if (projectId !== undefined) {\n      const result = await this.pool.query<{ id: string; text: string; project_id: number; path: string }>(\n        \"SELECT id, text, project_id, path FROM pai_chunks WHERE embedding IS NULL AND project_id = $1 ORDER BY id\",\n        [projectId]\n      );\n      return result.rows;\n    }\n    const result = await this.pool.query<{ id: string; text: string; project_id: number; path: string }>(\n      \"SELECT id, text, project_id, path FROM pai_chunks WHERE embedding IS NULL ORDER BY id\"\n    );\n    return result.rows;\n  }\n\n  async updateEmbedding(chunkId: string, embedding: Buffer): Promise<void> {\n    const vec = bufferToVector(embedding);\n    const vecStr = \"[\" + vec.join(\",\") + \"]\";\n    await this.pool.query(\n      \"UPDATE pai_chunks SET embedding = $1::vector WHERE id = $2\",\n      [vecStr, chunkId]\n    );\n  }\n\n  // -------------------------------------------------------------------------\n  // Search\n  // -------------------------------------------------------------------------\n\n  async searchKeyword(query: string, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchKeyword(this.pool, query, opts);\n  }\n\n  async searchSemantic(queryEmbedding: Float32Array, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchSemantic(this.pool, queryEmbedding, opts);\n  }\n\n  // -------------------------------------------------------------------------\n  // Vault operations — delegated to vault.ts\n  // -------------------------------------------------------------------------\n\n  async upsertVaultFile(file: VaultFileRow): Promise<void> { return vault.upsertVaultFile(this.pool, file); }\n  async deleteVaultFile(vaultPath: string): Promise<void> { return vault.deleteVaultFile(this.pool, vaultPath); }\n  async getVaultFile(vaultPath: string): Promise<VaultFileRow | null> { return vault.getVaultFile(this.pool, vaultPath); }\n  async getVaultFileByInode(inode: number, device: number): Promise<VaultFileRow | null> { return vault.getVaultFileByInode(this.pool, inode, device); }\n  async getAllVaultFiles(): Promise<VaultFileRow[]> { return vault.getAllVaultFiles(this.pool); }\n  async getRecentVaultFiles(sinceMs: number): Promise<VaultFileRow[]> { return vault.getRecentVaultFiles(this.pool, sinceMs); }\n  async countVaultFiles(): Promise<number> { return vault.countVaultFiles(this.pool); }\n  async countVaultFilesWithPrefix(prefix: string): Promise<number> { return vault.countVaultFilesWithPrefix(this.pool, prefix); }\n  async countVaultFilesAfter(sinceMs: number): Promise<number> { return vault.countVaultFilesAfter(this.pool, sinceMs); }\n  async getVaultFilesByPaths(paths: string[]): Promise<VaultFileRow[]> { return vault.getVaultFilesByPaths(this.pool, paths); }\n  async getVaultFilesByPathsAfter(paths: string[], sinceMs: number): Promise<VaultFileRow[]> { return vault.getVaultFilesByPathsAfter(this.pool, paths, sinceMs); }\n  async getAllVaultFilePaths(): Promise<string[]> { return vault.getAllVaultFilePaths(this.pool); }\n  async getVaultFilePathsWithPrefix(prefix: string): Promise<string[]> { return vault.getVaultFilePathsWithPrefix(this.pool, prefix); }\n  async getVaultFilePathsAfter(sinceMs: number): Promise<string[]> { return vault.getVaultFilePathsAfter(this.pool, sinceMs); }\n\n  async upsertVaultAliases(aliases: VaultAliasRow[]): Promise<void> { return vault.upsertVaultAliases(this.pool, aliases); }\n  async deleteVaultAliases(canonicalPath: string): Promise<void> { return vault.deleteVaultAliases(this.pool, canonicalPath); }\n  async getVaultAlias(vaultPath: string): Promise<{ canonicalPath: string } | null> { return vault.getVaultAlias(this.pool, vaultPath); }\n\n  async replaceLinksForSources(sourcePaths: string[], links: VaultLinkRow[]): Promise<void> { return vault.replaceLinksForSources(this.pool, sourcePaths, links); }\n  async getLinksFromSource(sourcePath: string): Promise<VaultLinkRow[]> { return vault.getLinksFromSource(this.pool, sourcePath); }\n  async getLinksToTarget(targetPath: string): Promise<VaultLinkRow[]> { return vault.getLinksToTarget(this.pool, targetPath); }\n  async getVaultLinkGraph(): Promise<Array<{ source_path: string; target_path: string }>> { return vault.getVaultLinkGraph(this.pool); }\n  async getDeadLinks(): Promise<Array<{ sourcePath: string; targetRaw: string }>> { return vault.getDeadLinks(this.pool); }\n  async getDeadLinksWithLineNumbers(): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> { return vault.getDeadLinksWithLineNumbers(this.pool); }\n  async getDeadLinksWithPrefix(prefix: string): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> { return vault.getDeadLinksWithPrefix(this.pool, prefix); }\n  async getDeadLinksAfter(sinceMs: number): Promise<Array<{ sourcePath: string; targetRaw: string; lineNumber: number }>> { return vault.getDeadLinksAfter(this.pool, sinceMs); }\n  async countVaultLinksWithPrefix(prefix: string): Promise<number> { return vault.countVaultLinksWithPrefix(this.pool, prefix); }\n  async countVaultLinksAfter(sinceMs: number): Promise<number> { return vault.countVaultLinksAfter(this.pool, sinceMs); }\n  async getVaultLinksFromPaths(sourcePaths: string[]): Promise<VaultLinkRow[]> { return vault.getVaultLinksFromPaths(this.pool, sourcePaths); }\n  async getVaultLinkEdges(): Promise<Array<{ source: string; target: string }>> { return vault.getVaultLinkEdges(this.pool); }\n  async getVaultLinkEdgesWithPrefix(prefix: string): Promise<Array<{ source: string; target: string }>> { return vault.getVaultLinkEdgesWithPrefix(this.pool, prefix); }\n  async getVaultLinkEdgesAfter(sinceMs: number): Promise<Array<{ source: string; target: string }>> { return vault.getVaultLinkEdgesAfter(this.pool, sinceMs); }\n\n  async upsertVaultHealth(rows: VaultHealthRow[]): Promise<void> { return vault.upsertVaultHealth(this.pool, rows); }\n  async getVaultHealth(vaultPath: string): Promise<VaultHealthRow | null> { return vault.getVaultHealth(this.pool, vaultPath); }\n  async getOrphans(): Promise<VaultHealthRow[]> { return vault.getOrphans(this.pool); }\n  async getOrphansWithPrefix(prefix: string): Promise<string[]> { return vault.getOrphansWithPrefix(this.pool, prefix); }\n  async getOrphansAfter(sinceMs: number): Promise<string[]> { return vault.getOrphansAfter(this.pool, sinceMs); }\n  async getLowConnectivity(): Promise<string[]> { return vault.getLowConnectivity(this.pool); }\n  async getLowConnectivityWithPrefix(prefix: string): Promise<string[]> { return vault.getLowConnectivityWithPrefix(this.pool, prefix); }\n  async getLowConnectivityAfter(sinceMs: number): Promise<string[]> { return vault.getLowConnectivityAfter(this.pool, sinceMs); }\n\n  async upsertNameIndex(entries: VaultNameEntry[]): Promise<void> { return vault.upsertNameIndex(this.pool, entries); }\n  async replaceNameIndex(entries: VaultNameEntry[]): Promise<void> { return vault.replaceNameIndex(this.pool, entries); }\n  async resolveVaultName(name: string): Promise<string[]> { return vault.resolveVaultName(this.pool, name); }\n  async searchVaultNameIndex(query: string, limit?: number): Promise<string[]> { return vault.searchVaultNameIndex(this.pool, query, limit); }\n\n  // Legacy memory_chunks methods (used by graph and zettelkasten modules)\n  async getChunksWithEmbeddings(projectId: number, limit: number): Promise<Array<{ path: string; text: string; embedding: Buffer }>> {\n    const r = await this.pool.query<{ path: string; text: string; embedding: Buffer }>(\n      `SELECT path, text, embedding FROM memory_chunks WHERE project_id = $1 AND embedding IS NOT NULL ORDER BY path, start_line LIMIT $2`,\n      [projectId, limit]\n    );\n    return r.rows;\n  }\n\n  async getChunksForPath(projectId: number, path: string, limit = 20): Promise<Array<{ text: string; embedding: Buffer | null }>> {\n    const r = await this.pool.query<{ text: string; embedding: Buffer | null }>(\n      `SELECT text, embedding FROM memory_chunks WHERE project_id = $1 AND path = $2 AND embedding IS NOT NULL ORDER BY start_line LIMIT $3`,\n      [projectId, path, limit]\n    );\n    return r.rows;\n  }\n\n  async searchChunksByText(projectId: number, query: string, limit: number): Promise<Array<{ path: string; text: string }>> {\n    const r = await this.pool.query<{ path: string; text: string }>(\n      `SELECT DISTINCT path, text FROM memory_chunks WHERE project_id = $1 AND lower(text) LIKE lower($2) LIMIT $3`,\n      [projectId, `%${query}%`, limit]\n    );\n    return r.rows;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;AASA,SAAgB,eAAe,KAAuB;CACpD,MAAM,SAAmB,EAAE;AAC3B,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,EACnC,QAAO,KAAK,IAAI,YAAY,EAAE,CAAC;AAEjC,QAAO;;;;;;;;;;;;;AAcT,SAAgB,eAAe,OAAuB;CACpD,MAAM,SAAS,MACZ,aAAa,CACb,MAAM,cAAc,CACpB,OAAO,QAAQ,CACf,QAAQ,MAAM,EAAE,UAAU,EAAE,CAC5B,QAAQ,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC,CAEjC,KAAK,MAAM,EAAE,QAAQ,MAAM,KAAK,CAAC,QAAQ,aAAa,GAAG,CAAC,CAC1D,OAAO,QAAQ;AAElB,KAAI,OAAO,WAAW,EAEpB,QADY,MAAM,QAAQ,eAAe,IAAI,CAAC,MAAM,CAAC,MAAM,MAAM,CAAC,OAAO,QAAQ,CAAC,KAAK,MAAM,IAC/E;AAGhB,QAAO,OAAO,KAAK,MAAM;;;;;;;;AChC3B,eAAsB,cACpB,MACA,OACA,MACyB;CACzB,MAAM,aAAa,MAAM,cAAc;CAEvC,MAAM,UAAU,eAAe,MAAM;AACrC,KAAI,CAAC,QAAS,QAAO,EAAE;CAEvB,MAAM,aAAuB,CAAC,yCAAyC;CACvE,MAAM,SAA8B,CAAC,QAAQ;CAC7C,IAAI,WAAW;AAEf,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AAC3E,aAAW,KAAK,kBAAkB,aAAa,GAAG;AAClD,SAAO,KAAK,GAAG,KAAK,WAAW;;AAGjC,KAAI,MAAM,WAAW,KAAK,QAAQ,SAAS,GAAG;EAC5C,MAAM,eAAe,KAAK,QAAQ,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AACxE,aAAW,KAAK,cAAc,aAAa,GAAG;AAC9C,SAAO,KAAK,GAAG,KAAK,QAAQ;;AAG9B,KAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;EACxC,MAAM,eAAe,KAAK,MAAM,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AACtE,aAAW,KAAK,YAAY,aAAa,GAAG;AAC5C,SAAO,KAAK,GAAG,KAAK,MAAM;;AAG5B,QAAO,KAAK,WAAW;CACvB,MAAM,aAAa,IAAI;CAEvB,MAAM,MAAM;;;;;;;;;;;YAWF,WAAW,KAAK,QAAQ,CAAC;;YAEzB,WAAW;;AAGrB,KAAI;AAYF,UAXe,MAAM,KAAK,MASvB,KAAK,OAAO,EAED,KAAK,KAAK,SAAS;GAC/B,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb,OAAO,IAAI;GACX,MAAM,IAAI;GACV,QAAQ,IAAI;GACb,EAAE;UACI,GAAG;AACV,UAAQ,OAAO,MAAM,uCAAuC,EAAE,IAAI;AAClE,SAAO,EAAE;;;;;;AAOb,eAAsB,eACpB,MACA,gBACA,MACyB;CACzB,MAAM,aAAa,MAAM,cAAc;CAEvC,MAAM,aAAuB,CAAC,wBAAwB;CACtD,MAAM,SAA8B,EAAE;CACtC,IAAI,WAAW;CAEf,MAAM,SAAS,MAAM,MAAM,KAAK,eAAe,CAAC,KAAK,IAAI,GAAG;AAC5D,QAAO,KAAK,OAAO;CACnB,MAAM,WAAW,IAAI;AAErB,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AAC3E,aAAW,KAAK,kBAAkB,aAAa,GAAG;AAClD,SAAO,KAAK,GAAG,KAAK,WAAW;;AAGjC,KAAI,MAAM,WAAW,KAAK,QAAQ,SAAS,GAAG;EAC5C,MAAM,eAAe,KAAK,QAAQ,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AACxE,aAAW,KAAK,cAAc,aAAa,GAAG;AAC9C,SAAO,KAAK,GAAG,KAAK,QAAQ;;AAG9B,KAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;EACxC,MAAM,eAAe,KAAK,MAAM,UAAU,IAAI,aAAa,CAAC,KAAK,KAAK;AACtE,aAAW,KAAK,YAAY,aAAa,GAAG;AAC5C,SAAO,KAAK,GAAG,KAAK,MAAM;;AAG5B,QAAO,KAAK,WAAW;CACvB,MAAM,aAAa,IAAI;CAGvB,MAAM,MAAM;;;;;;;;;2BASa,SAAS;;YAExB,WAAW,KAAK,QAAQ,CAAC;6BACR,SAAS;YAC1B,WAAW;;AAGrB,KAAI;EACF,MAAM,SAAS,MAAM,KAAK,MASvB,KAAK,OAAO;EAEf,MAAM,WAAW,MAAM,YAAY;AAEnC,SAAO,OAAO,KACX,KAAK,SAAS;GACb,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb,OAAO,IAAI;GACX,MAAM,IAAI;GACV,QAAQ,IAAI;GACb,EAAE,CACF,QAAQ,MAAM,EAAE,SAAS,SAAS;UAC9B,GAAG;AACV,UAAQ,OAAO,MAAM,wCAAwC,EAAE,IAAI;AACnE,SAAO,EAAE;;;;;;ACjKb,eAAsB,gBAAgB,MAAY,MAAmC;AACnF,OAAM,KAAK,MACT;;;;;0CAMA;EAAC,KAAK;EAAW,KAAK;EAAO,KAAK;EAAQ,KAAK;EAAM,KAAK;EAAO,KAAK;EAAU,CACjF;;AAGH,eAAsB,gBAAgB,MAAY,WAAkC;CAClF,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,QAAM,OAAO,MAAM,kDAAkD,CAAC,UAAU,CAAC;AACjF,QAAM,OAAO,MAAM,kDAAkD,CAAC,UAAU,CAAC;AACjF,QAAM,OAAO,MAAM,sDAAsD,CAAC,UAAU,CAAC;AACrF,QAAM,OAAO,MAAM,0EAA0E,CAAC,UAAU,CAAC;AACzG,QAAM,OAAO,MAAM,iDAAiD,CAAC,UAAU,CAAC;AAChF,QAAM,OAAO,MAAM,SAAS;UACrB,GAAG;AACV,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAMpB,SAAS,gBAAgB,KAAmC;AAC1D,QAAO;EACL,WAAW,IAAI;EACf,OAAO,OAAO,IAAI,MAAM;EACxB,QAAQ,OAAO,IAAI,OAAO;EAC1B,MAAM,IAAI;EACV,OAAO,IAAI;EACX,WAAW,OAAO,IAAI,WAAW;EAClC;;AAGH,eAAsB,aAAa,MAAY,WAAiD;CAC9F,MAAM,IAAI,MAAM,KAAK,MACnB,oGACA,CAAC,UAAU,CACZ;AACD,QAAO,EAAE,KAAK,WAAW,IAAI,OAAO,gBAAgB,EAAE,KAAK,GAAG;;AAGhE,eAAsB,oBAAoB,MAAY,OAAe,QAA8C;CACjH,MAAM,IAAI,MAAM,KAAK,MACnB,uHACA,CAAC,OAAO,OAAO,CAChB;AACD,QAAO,EAAE,KAAK,WAAW,IAAI,OAAO,gBAAgB,EAAE,KAAK,GAAG;;AAGhE,eAAsB,iBAAiB,MAAqC;AAE1E,SADU,MAAM,KAAK,MAAsB,6EAA6E,EAC/G,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,oBAAoB,MAAY,SAA0C;AAK9F,SAJU,MAAM,KAAK,MACnB,oGACA,CAAC,QAAQ,CACV,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,gBAAgB,MAA6B;CACjE,MAAM,IAAI,MAAM,KAAK,MAAqB,8CAA8C;AACxF,QAAO,SAAS,EAAE,KAAK,IAAI,KAAK,KAAK,GAAG;;AAG1C,eAAsB,0BAA0B,MAAY,QAAiC;CAC3F,MAAM,IAAI,MAAM,KAAK,MAAqB,kEAAkE,CAAC,GAAG,OAAO,GAAG,CAAC;AAC3H,QAAO,OAAO,EAAE,KAAK,IAAI,KAAK,EAAE;;AAGlC,eAAsB,qBAAqB,MAAY,SAAkC;CACvF,MAAM,IAAI,MAAM,KAAK,MAAqB,+DAA+D,CAAC,QAAQ,CAAC;AACnH,QAAO,OAAO,EAAE,KAAK,IAAI,KAAK,EAAE;;AAGlC,eAAsB,qBAAqB,MAAY,OAA0C;AAC/F,KAAI,MAAM,WAAW,EAAG,QAAO,EAAE;CACjC,MAAM,eAAe,MAAM,KAAK,GAAG,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK;AAKhE,SAJU,MAAM,KAAK,MACnB,mGAAmG,aAAa,IAChH,MACD,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,0BAA0B,MAAY,OAAiB,SAA0C;AACrH,KAAI,MAAM,WAAW,EAAG,QAAO,EAAE;CACjC,MAAM,eAAe,MAAM,KAAK,GAAG,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK;AAKhE,SAJU,MAAM,KAAK,MACnB,mGAAmG,aAAa,uBAAuB,MAAM,SAAS,EAAE,2BACxJ,CAAC,GAAG,OAAO,QAAQ,CACpB,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,qBAAqB,MAA+B;AAExE,SADU,MAAM,KAAK,MAA8B,qCAAqC,EAC/E,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,4BAA4B,MAAY,QAAmC;AAK/F,SAJU,MAAM,KAAK,MACnB,+DACA,CAAC,GAAG,OAAO,GAAG,CACf,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,uBAAuB,MAAY,SAAoC;AAK3F,SAJU,MAAM,KAAK,MACnB,4DACA,CAAC,QAAQ,CACV,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAO1C,eAAsB,mBAAmB,MAAY,SAAyC;AAC5F,KAAI,QAAQ,WAAW,EAAG;CAC1B,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,OAAK,MAAM,KAAK,QACd,OAAM,OAAO,MACX;;;;8DAKA;GAAC,EAAE;GAAW,EAAE;GAAe,EAAE;GAAO,EAAE;GAAO,CAClD;AAEH,QAAM,OAAO,MAAM,SAAS;UACrB,GAAG;AACV,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAIpB,eAAsB,mBAAmB,MAAY,eAAsC;AACzF,OAAM,KAAK,MAAM,uDAAuD,CAAC,cAAc,CAAC;;AAG1F,eAAsB,cAAc,MAAY,WAA8D;CAC5G,MAAM,IAAI,MAAM,KAAK,MACnB,kEACA,CAAC,UAAU,CACZ;AACD,QAAO,EAAE,KAAK,SAAS,IAAI,EAAE,eAAe,EAAE,KAAK,GAAG,gBAAgB,GAAG;;AAS3E,SAAS,gBAAgB,KAAmC;AAC1D,QAAO;EACL,YAAY,IAAI;EAChB,WAAW,IAAI;EACf,YAAY,IAAI;EAChB,UAAU,IAAI;EACd,YAAY,IAAI;EACjB;;AAGH,eAAsB,uBAAuB,MAAY,aAAuB,OAAsC;CACpH,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,MAAI,YAAY,SAAS,EACvB,OAAM,OAAO,MACX,+DACA,CAAC,YAAY,CACd;AAEH,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,KAAK;GAC1C,MAAM,QAAQ,MAAM,MAAM,GAAG,IAAI,IAAI;GACrC,MAAM,SAAmB,EAAE;GAC3B,MAAM,SAAqC,EAAE;GAC7C,IAAI,MAAM;AACV,QAAK,MAAM,KAAK,OAAO;AACrB,WAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,GAAG;AACtE,WAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,UAAU,EAAE,WAAW;;AAEhF,SAAM,OAAO,MACX;kBACU,OAAO,KAAK,KAAK,CAAC;;gFAG5B,OACD;;AAEH,QAAM,OAAO,MAAM,SAAS;UACrB,GAAG;AACV,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAIpB,eAAsB,mBAAmB,MAAY,YAA6C;AAKhG,SAJU,MAAM,KAAK,MACnB,+GACA,CAAC,WAAW,CACb,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,iBAAiB,MAAY,YAA6C;AAK9F,SAJU,MAAM,KAAK,MACnB,+GACA,CAAC,WAAW,CACb,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,kBAAkB,MAA0E;AAIhH,SAHU,MAAM,KAAK,MACnB,iFACD,EACQ;;AAGX,eAAsB,aAAa,MAAuE;AAIxG,SAHU,MAAM,KAAK,MACnB,4EACD,EACQ,KAAK,KAAI,SAAQ;EAAE,YAAY,IAAI;EAAa,WAAW,IAAI;EAAY,EAAE;;AAGxF,eAAsB,4BAA4B,MAA2F;AAI3I,SAHU,MAAM,KAAK,MACnB,yFACD,EACQ,KAAK,KAAI,SAAQ;EAAE,YAAY,IAAI;EAAa,WAAW,IAAI;EAAY,YAAY,IAAI;EAAa,EAAE;;AAGrH,eAAsB,uBAAuB,MAAY,QAA+F;AAKtJ,SAJU,MAAM,KAAK,MACnB,kHACA,CAAC,GAAG,OAAO,GAAG,CACf,EACQ,KAAK,KAAI,SAAQ;EAAE,YAAY,IAAI;EAAa,WAAW,IAAI;EAAY,YAAY,IAAI;EAAa,EAAE;;AAGrH,eAAsB,kBAAkB,MAAY,SAAgG;AAKlJ,SAJU,MAAM,KAAK,MACnB,wKACA,CAAC,QAAQ,CACV,EACQ,KAAK,KAAI,SAAQ;EAAE,YAAY,IAAI;EAAa,WAAW,IAAI;EAAY,YAAY,IAAI;EAAa,EAAE;;AAGrH,eAAsB,0BAA0B,MAAY,QAAiC;CAC3F,MAAM,IAAI,MAAM,KAAK,MAAqB,mEAAmE,CAAC,GAAG,OAAO,GAAG,CAAC;AAC5H,QAAO,OAAO,EAAE,KAAK,IAAI,KAAK,EAAE;;AAGlC,eAAsB,qBAAqB,MAAY,SAAkC;CACvF,MAAM,IAAI,MAAM,KAAK,MACnB,yHACA,CAAC,QAAQ,CACV;AACD,QAAO,OAAO,EAAE,KAAK,IAAI,KAAK,EAAE;;AAGlC,eAAsB,uBAAuB,MAAY,aAAgD;AACvG,KAAI,YAAY,WAAW,EAAG,QAAO,EAAE;CACvC,MAAM,eAAe,YAAY,KAAK,GAAG,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK;AAKtE,SAJU,MAAM,KAAK,MACnB,8GAA8G,aAAa,gCAC3H,YACD,EACQ,KAAK,IAAI,gBAAgB;;AAGpC,eAAsB,kBAAkB,MAAgE;AAItG,SAHU,MAAM,KAAK,MACnB,8GACD,EACQ;;AAGX,eAAsB,4BAA4B,MAAY,QAAoE;AAKhI,SAJU,MAAM,KAAK,MACnB,uIACA,CAAC,GAAG,OAAO,GAAG,CACf,EACQ;;AAGX,eAAsB,uBAAuB,MAAY,SAAqE;AAK5H,SAJU,MAAM,KAAK,MACnB,6LACA,CAAC,QAAQ,CACV,EACQ;;AASX,SAAS,kBAAkB,KAAuC;AAChE,QAAO;EACL,WAAW,IAAI;EACf,cAAc,IAAI;EAClB,eAAe,IAAI;EACnB,eAAe,IAAI;EACnB,UAAU,IAAI,cAAc;EAC5B,YAAY,OAAO,IAAI,YAAY;EACpC;;AAGH,eAAsB,kBAAkB,MAAY,MAAuC;AACzF,KAAI,KAAK,WAAW,EAAG;CACvB,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,OAAK,MAAM,KAAK,KACd,OAAM,OAAO,MACX;;;;;;;gDAQA;GAAC,EAAE;GAAW,EAAE;GAAc,EAAE;GAAe,EAAE;GAAe,EAAE,WAAW,IAAI;GAAG,EAAE;GAAW,CAClG;AAEH,QAAM,OAAO,MAAM,SAAS;UACrB,GAAG;AACV,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAIpB,eAAsB,eAAe,MAAY,WAAmD;CAClG,MAAM,IAAI,MAAM,KAAK,MACnB,qIACA,CAAC,UAAU,CACZ;AACD,QAAO,EAAE,KAAK,WAAW,IAAI,OAAO,kBAAkB,EAAE,KAAK,GAAG;;AAGlE,eAAsB,WAAW,MAAuC;AAItE,SAHU,MAAM,KAAK,MACnB,kIACD,EACQ,KAAK,KAAI,SAAQ;EAAE,GAAG,kBAAkB,IAAI;EAAE,UAAU;EAAM,EAAE;;AAG3E,eAAsB,qBAAqB,MAAY,QAAmC;AAKxF,SAJU,MAAM,KAAK,MACnB,kFACA,CAAC,GAAG,OAAO,GAAG,CACf,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,gBAAgB,MAAY,SAAoC;AAKpF,SAJU,MAAM,KAAK,MACnB,gJACA,CAAC,QAAQ,CACV,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,mBAAmB,MAA+B;AAItE,SAHU,MAAM,KAAK,MACnB,gFACD,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,6BAA6B,MAAY,QAAmC;AAKhG,SAJU,MAAM,KAAK,MACnB,wGACA,CAAC,GAAG,OAAO,GAAG,CACf,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,wBAAwB,MAAY,SAAoC;AAK5F,SAJU,MAAM,KAAK,MACnB,yKACA,CAAC,QAAQ,CACV,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAO1C,eAAsB,gBAAgB,MAAY,SAA0C;AAC1F,KAAI,QAAQ,WAAW,EAAG;CAC1B,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,OAAK,MAAM,KAAK,QACd,OAAM,OAAO,MACX;qEAEA,CAAC,EAAE,MAAM,EAAE,UAAU,CACtB;AAEH,QAAM,OAAO,MAAM,SAAS;UACrB,IAAI;AACX,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAIpB,eAAsB,iBAAiB,MAAY,SAA0C;CAC3F,MAAM,SAAS,MAAM,KAAK,SAAS;AACnC,KAAI;AACF,QAAM,OAAO,MAAM,QAAQ;AAC3B,QAAM,OAAO,MAAM,+BAA+B;AAClD,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,KAAK;GAC5C,MAAM,QAAQ,QAAQ,MAAM,GAAG,IAAI,IAAI;GACvC,MAAM,SAAmB,EAAE;GAC3B,MAAM,SAAmB,EAAE;GAC3B,IAAI,MAAM;AACV,QAAK,MAAM,KAAK,OAAO;AACrB,WAAO,KAAK,KAAK,MAAM,KAAK,MAAM,GAAG;AACrC,WAAO,KAAK,EAAE,MAAM,EAAE,UAAU;;AAElC,SAAM,OAAO,MACX,0DAA0D,OAAO,KAAK,KAAK,IAC3E,OACD;;AAEH,QAAM,OAAO,MAAM,SAAS;UACrB,GAAG;AACV,QAAM,OAAO,MAAM,WAAW;AAC9B,QAAM;WACE;AACR,SAAO,SAAS;;;AAIpB,eAAsB,iBAAiB,MAAY,MAAiC;AAKlF,SAJU,MAAM,KAAK,MACnB,2DACA,CAAC,KAAK,CACP,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;AAG1C,eAAsB,qBAAqB,MAAY,OAAe,QAAQ,KAAwB;AAKpG,SAJU,MAAM,KAAK,MACnB,8FACA,CAAC,IAAI,MAAM,IAAI,MAAM,CACtB,EACQ,KAAK,KAAI,QAAO,IAAI,WAAW;;;;;;;;;;;;;;;ACvd1C,MAAM,EAAE,MAAM,WAAW;AAEzB,IAAa,kBAAb,MAAuD;CACrD,AAAS,cAAc;CAEvB,AAAQ;;;;;;;CAQR,aAAa,eAAe,QAAuC;EACjE,MAAM,UACJ,OAAO,oBACP,gBAAgB,OAAO,QAAQ,MAAM,GAAG,OAAO,YAAY,MAAM,GAAG,OAAO,QAAQ,YAAY,GAAG,OAAO,QAAQ,KAAK,GAAG,OAAO,YAAY;EAE9I,MAAM,WADM,IAAI,IAAI,QAAQ,CACP,SAAS,MAAM,EAAE;EAEtC,MAAM,WAAW,IAAI,IAAI,QAAQ;AACjC,WAAS,WAAW;EACpB,MAAM,YAAY,IAAI,OAAO;GAC3B,kBAAkB,SAAS,UAAU;GACrC,KAAK;GACL,yBAAyB;GAC1B,CAAC;AAEF,MAAI;AAKF,QAJc,MAAM,UAAU,MAC5B,gDACA,CAAC,SAAS,CACX,EACS,aAAa,GAAG;AACxB,UAAM,UAAU,MAAM,oBAAoB,SAAS,GAAG;AACtD,YAAQ,OAAO,MAAM,oCAAoC,SAAS,IAAI;;YAEhE;AACR,SAAM,UAAU,KAAK;;EAGvB,MAAM,aAAa,IAAI,OAAO;GAC5B,kBAAkB;GAClB,KAAK;GACL,yBAAyB;GAC1B,CAAC;AAEF,MAAI;AAIF,QAHmB,MAAM,WAAW,MAClC,0EACD,EACc,aAAa,GAAG;IAC7B,MAAM,YAAY,QAAQ,cAAc,OAAO,KAAK,IAAI,CAAC;IACzD,MAAM,cAAc,KAAK,WAAW,wBAAwB;IAC5D,IAAI;AACJ,QAAI;AACF,eAAU,aAAa,aAAa,QAAQ;YACtC;AAEN,eAAU,aADM,KAAK,WAAW,qBAAqB,EACrB,QAAQ;;AAE1C,UAAM,WAAW,MAAM,QAAQ;AAC/B,YAAQ,OAAO,MAAM,8CAA8C,SAAS,IAAI;;YAE1E;AACR,SAAM,WAAW,KAAK;;;CAI1B,YAAY,QAAwB;AAKlC,OAAK,OAAO,IAAI,OAAO;GACrB,kBAJA,OAAO,oBACP,gBAAgB,OAAO,QAAQ,MAAM,GAAG,OAAO,YAAY,MAAM,GAAG,OAAO,QAAQ,YAAY,GAAG,OAAO,QAAQ,KAAK,GAAG,OAAO,YAAY;GAI5I,KAAK,OAAO,kBAAkB;GAC9B,yBAAyB,OAAO,uBAAuB;GACvD,mBAAmB;GACpB,CAAC;AAEF,OAAK,KAAK,GAAG,UAAU,QAAQ;AAC7B,WAAQ,OAAO,MAAM,8BAA8B,IAAI,QAAQ,IAAI;IACnE;;CAOJ,MAAM,QAAuB;AAC3B,QAAM,KAAK,KAAK,KAAK;;;;;;CAOvB,UAAgB;AACd,SAAO,KAAK;;CAGd,MAAM,WAAqC;EACzC,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACxC,MAAI;GACF,MAAM,cAAc,MAAM,OAAO,MAC/B,4CACD;GACD,MAAM,eAAe,MAAM,OAAO,MAChC,6CACD;AACD,UAAO;IACL,OAAO,SAAS,YAAY,KAAK,IAAI,KAAK,KAAK,GAAG;IAClD,QAAQ,SAAS,aAAa,KAAK,IAAI,KAAK,KAAK,GAAG;IACrD;YACO;AACR,UAAO,SAAS;;;;;;;CAQpB,MAAM,iBAAyC;EAC7C,IAAI,SAA4B;AAChC,MAAI;AACF,YAAS,MAAM,KAAK,KAAK,SAAS;AAClC,SAAM,OAAO,MAAM,WAAW;AAC9B,UAAO;WACA,GAAG;AACV,UAAO,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;YACzC;AACR,WAAQ,SAAS;;;CAQrB,MAAM,YAAY,WAAmB,MAA2C;AAK9E,UAJe,MAAM,KAAK,KAAK,MAC7B,kEACA,CAAC,WAAW,KAAK,CAClB,EACa,KAAK,IAAI;;CAGzB,MAAM,WAAW,MAA8B;AAC7C,QAAM,KAAK,KAAK,MACd;;;;;;;kCAQA;GAAC,KAAK;GAAW,KAAK;GAAM,KAAK;GAAQ,KAAK;GAAM,KAAK;GAAM,KAAK;GAAO,KAAK;GAAK,CACtF;;CAOH,MAAM,YAAY,WAAmB,MAAiC;AAKpE,UAJe,MAAM,KAAK,KAAK,MAC7B,iEACA,CAAC,WAAW,KAAK,CAClB,EACa,KAAK,KAAK,MAAM,EAAE,GAAG;;CAGrC,MAAM,oBAAoB,WAAmB,MAA6B;AACxE,QAAM,KAAK,KAAK,MACd,8DACA,CAAC,WAAW,KAAK,CAClB;;CAGH,MAAM,aAAa,QAAmC;AACpD,MAAI,OAAO,WAAW,EAAG;EAEzB,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACxC,MAAI;AACF,SAAM,OAAO,MAAM,QAAQ;AAE3B,QAAK,MAAM,KAAK,QAAQ;IACtB,MAAM,WAAW,EAAE,KAAK,QAAQ,OAAO,GAAG;AAE1C,UAAM,OAAO,MACX;;;;;;;;;;;;;;;gDAgBA;KACE,EAAE;KAAI,EAAE;KAAW,EAAE;KAAQ,EAAE;KAAM,EAAE;KACvC,EAAE;KAAW,EAAE;KAAS,EAAE;KAAM;KAAU,EAAE;KAC7C,CACF;;AAGH,SAAM,OAAO,MAAM,SAAS;WACrB,GAAG;AACV,SAAM,OAAO,MAAM,WAAW;AAC9B,SAAM;YACE;AACR,UAAO,SAAS;;;CAIpB,MAAM,sBAAsB,WAAsC;AAKhE,UAJe,MAAM,KAAK,KAAK,MAC7B,8DACA,CAAC,UAAU,CACZ,EACa,KAAK,KAAK,MAAM,EAAE,KAAK;;CAGvC,MAAM,YAAY,WAAmB,OAAgC;AACnE,MAAI,MAAM,WAAW,EAAG;EACxB,MAAM,SAAS,MAAM,KAAK,KAAK,SAAS;AACxC,MAAI;AACF,SAAM,OAAO,MAAM,QAAQ;AAC3B,QAAK,MAAM,QAAQ,OAAO;AACxB,UAAM,OAAO,MAAM,8DAA8D,CAAC,WAAW,KAAK,CAAC;AACnG,UAAM,OAAO,MAAM,6DAA6D,CAAC,WAAW,KAAK,CAAC;;AAEpG,SAAM,OAAO,MAAM,SAAS;WACrB,GAAG;AACV,SAAM,OAAO,MAAM,WAAW;AAC9B,SAAM;YACE;AACR,UAAO,SAAS;;;CAIpB,MAAM,sBAAsB,WAAoG;AAC9H,MAAI,cAAc,OAKhB,SAJe,MAAM,KAAK,KAAK,MAC7B,6GACA,CAAC,UAAU,CACZ,EACa;AAKhB,UAHe,MAAM,KAAK,KAAK,MAC7B,wFACD,EACa;;CAGhB,MAAM,gBAAgB,SAAiB,WAAkC;EAEvE,MAAM,SAAS,MADH,eAAe,UAAU,CACZ,KAAK,IAAI,GAAG;AACrC,QAAM,KAAK,KAAK,MACd,8DACA,CAAC,QAAQ,QAAQ,CAClB;;CAOH,MAAM,cAAc,OAAe,MAA+C;AAChF,SAAO,cAAc,KAAK,MAAM,OAAO,KAAK;;CAG9C,MAAM,eAAe,gBAA8B,MAA+C;AAChG,SAAO,eAAe,KAAK,MAAM,gBAAgB,KAAK;;CAOxD,MAAM,gBAAgB,MAAmC;AAAE,SAAOA,gBAAsB,KAAK,MAAM,KAAK;;CACxG,MAAM,gBAAgB,WAAkC;AAAE,SAAOC,gBAAsB,KAAK,MAAM,UAAU;;CAC5G,MAAM,aAAa,WAAiD;AAAE,SAAOC,aAAmB,KAAK,MAAM,UAAU;;CACrH,MAAM,oBAAoB,OAAe,QAA8C;AAAE,SAAOC,oBAA0B,KAAK,MAAM,OAAO,OAAO;;CACnJ,MAAM,mBAA4C;AAAE,SAAOC,iBAAuB,KAAK,KAAK;;CAC5F,MAAM,oBAAoB,SAA0C;AAAE,SAAOC,oBAA0B,KAAK,MAAM,QAAQ;;CAC1H,MAAM,kBAAmC;AAAE,SAAOC,gBAAsB,KAAK,KAAK;;CAClF,MAAM,0BAA0B,QAAiC;AAAE,SAAOC,0BAAgC,KAAK,MAAM,OAAO;;CAC5H,MAAM,qBAAqB,SAAkC;AAAE,SAAOC,qBAA2B,KAAK,MAAM,QAAQ;;CACpH,MAAM,qBAAqB,OAA0C;AAAE,SAAOC,qBAA2B,KAAK,MAAM,MAAM;;CAC1H,MAAM,0BAA0B,OAAiB,SAA0C;AAAE,SAAOC,0BAAgC,KAAK,MAAM,OAAO,QAAQ;;CAC9J,MAAM,uBAA0C;AAAE,SAAOC,qBAA2B,KAAK,KAAK;;CAC9F,MAAM,4BAA4B,QAAmC;AAAE,SAAOC,4BAAkC,KAAK,MAAM,OAAO;;CAClI,MAAM,uBAAuB,SAAoC;AAAE,SAAOC,uBAA6B,KAAK,MAAM,QAAQ;;CAE1H,MAAM,mBAAmB,SAAyC;AAAE,SAAOC,mBAAyB,KAAK,MAAM,QAAQ;;CACvH,MAAM,mBAAmB,eAAsC;AAAE,SAAOC,mBAAyB,KAAK,MAAM,cAAc;;CAC1H,MAAM,cAAc,WAA8D;AAAE,SAAOC,cAAoB,KAAK,MAAM,UAAU;;CAEpI,MAAM,uBAAuB,aAAuB,OAAsC;AAAE,SAAOC,uBAA6B,KAAK,MAAM,aAAa,MAAM;;CAC9J,MAAM,mBAAmB,YAA6C;AAAE,SAAOC,mBAAyB,KAAK,MAAM,WAAW;;CAC9H,MAAM,iBAAiB,YAA6C;AAAE,SAAOC,iBAAuB,KAAK,MAAM,WAAW;;CAC1H,MAAM,oBAAkF;AAAE,SAAOC,kBAAwB,KAAK,KAAK;;CACnI,MAAM,eAA0E;AAAE,SAAOC,aAAmB,KAAK,KAAK;;CACtH,MAAM,8BAA6G;AAAE,SAAOC,4BAAkC,KAAK,KAAK;;CACxK,MAAM,uBAAuB,QAA+F;AAAE,SAAOC,uBAA6B,KAAK,MAAM,OAAO;;CACpL,MAAM,kBAAkB,SAAgG;AAAE,SAAOC,kBAAwB,KAAK,MAAM,QAAQ;;CAC5K,MAAM,0BAA0B,QAAiC;AAAE,SAAOC,0BAAgC,KAAK,MAAM,OAAO;;CAC5H,MAAM,qBAAqB,SAAkC;AAAE,SAAOC,qBAA2B,KAAK,MAAM,QAAQ;;CACpH,MAAM,uBAAuB,aAAgD;AAAE,SAAOC,uBAA6B,KAAK,MAAM,YAAY;;CAC1I,MAAM,oBAAwE;AAAE,SAAOC,kBAAwB,KAAK,KAAK;;CACzH,MAAM,4BAA4B,QAAoE;AAAE,SAAOC,4BAAkC,KAAK,MAAM,OAAO;;CACnK,MAAM,uBAAuB,SAAqE;AAAE,SAAOC,uBAA6B,KAAK,MAAM,QAAQ;;CAE3J,MAAM,kBAAkB,MAAuC;AAAE,SAAOC,kBAAwB,KAAK,MAAM,KAAK;;CAChH,MAAM,eAAe,WAAmD;AAAE,SAAOC,eAAqB,KAAK,MAAM,UAAU;;CAC3H,MAAM,aAAwC;AAAE,SAAOC,WAAiB,KAAK,KAAK;;CAClF,MAAM,qBAAqB,QAAmC;AAAE,SAAOC,qBAA2B,KAAK,MAAM,OAAO;;CACpH,MAAM,gBAAgB,SAAoC;AAAE,SAAOC,gBAAsB,KAAK,MAAM,QAAQ;;CAC5G,MAAM,qBAAwC;AAAE,SAAOC,mBAAyB,KAAK,KAAK;;CAC1F,MAAM,6BAA6B,QAAmC;AAAE,SAAOC,6BAAmC,KAAK,MAAM,OAAO;;CACpI,MAAM,wBAAwB,SAAoC;AAAE,SAAOC,wBAA8B,KAAK,MAAM,QAAQ;;CAE5H,MAAM,gBAAgB,SAA0C;AAAE,SAAOC,gBAAsB,KAAK,MAAM,QAAQ;;CAClH,MAAM,iBAAiB,SAA0C;AAAE,SAAOC,iBAAuB,KAAK,MAAM,QAAQ;;CACpH,MAAM,iBAAiB,MAAiC;AAAE,SAAOC,iBAAuB,KAAK,MAAM,KAAK;;CACxG,MAAM,qBAAqB,OAAe,OAAmC;AAAE,SAAOC,qBAA2B,KAAK,MAAM,OAAO,MAAM;;CAGzI,MAAM,wBAAwB,WAAmB,OAAkF;AAKjI,UAJU,MAAM,KAAK,KAAK,MACxB,sIACA,CAAC,WAAW,MAAM,CACnB,EACQ;;CAGX,MAAM,iBAAiB,WAAmB,MAAc,QAAQ,IAAgE;AAK9H,UAJU,MAAM,KAAK,KAAK,MACxB,wIACA;GAAC;GAAW;GAAM;GAAM,CACzB,EACQ;;CAGX,MAAM,mBAAmB,WAAmB,OAAe,OAA+D;AAKxH,UAJU,MAAM,KAAK,KAAK,MACxB,+GACA;GAAC;GAAW,IAAI,MAAM;GAAI;GAAM,CACjC,EACQ"}

package/dist/tools-DcaJlYDN.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"tools-DcaJlYDN.mjs","names":[],"sources":["../src/mcp/tools/types.ts","../src/mcp/tools/memory.ts","../src/mcp/tools/projects.ts","../src/mcp/tools/sessions.ts","../src/mcp/tools/registry.ts","../src/mcp/tools/zettel.ts","../src/mcp/tools.ts"],"sourcesContent":["/**\n * Shared types and project-row helpers used across all MCP tool handler modules.\n */\n\nimport { resolve } from \"node:path\";\nimport type { Database } from \"better-sqlite3\";\n\nexport interface ToolContent {\n  type: \"text\";\n  text: string;\n}\n\nexport interface ToolResult {\n  content: ToolContent[];\n  isError?: boolean;\n}\n\n// ---------------------------------------------------------------------------\n// Shared row type — mirrors the projects SQLite schema\n// ---------------------------------------------------------------------------\n\nexport interface ProjectRow {\n  id: number;\n  slug: string;\n  display_name: string;\n  root_path: string;\n  type: string;\n  status: string;\n  created_at: number;\n  updated_at: number;\n  archived_at?: number | null;\n  parent_id?: number | null;\n  obsidian_link?: string | null;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: lookup project_id by slug (also checks aliases)\n// ---------------------------------------------------------------------------\n\nexport function lookupProjectId(\n  registryDb: Database,\n  slug: string\n): number | null {\n  const bySlug = registryDb\n    .prepare(\"SELECT id FROM projects WHERE slug = ?\")\n    .get(slug) as { id: number } | undefined;\n  if (bySlug) return bySlug.id;\n\n  const byAlias = registryDb\n    .prepare(\"SELECT project_id FROM aliases WHERE alias = ?\")\n    .get(slug) as { project_id: number } | undefined;\n  if (byAlias) return byAlias.project_id;\n\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: detect project from a filesystem path\n// ---------------------------------------------------------------------------\n\nexport function detectProjectFromPath(\n  registryDb: Database,\n  fsPath: string\n): ProjectRow | null {\n  const resolved = resolve(fsPath);\n\n  const exact = registryDb\n    .prepare(\n      \"SELECT id, slug, display_name, root_path, type, status, created_at, updated_at FROM projects WHERE root_path = ?\"\n    )\n    .get(resolved) as ProjectRow | undefined;\n\n  if (exact) return exact;\n\n  const all = registryDb\n    .prepare(\n      \"SELECT id, slug, display_name, root_path, type, status, created_at, updated_at FROM projects ORDER BY LENGTH(root_path) DESC\"\n    )\n    .all() as ProjectRow[];\n\n  for (const project of all) {\n    if (\n      resolved.startsWith(project.root_path + \"/\") ||\n      resolved === project.root_path\n    ) {\n      return project;\n    }\n  }\n\n  return null;\n}\n\n// ---------------------------------------------------------------------------\n// Helper: format project row for tool output\n// ---------------------------------------------------------------------------\n\nexport function formatProject(registryDb: Database, project: ProjectRow): string {\n  const sessionCount = (\n    registryDb\n      .prepare(\"SELECT COUNT(*) AS n FROM sessions WHERE project_id = ?\")\n      .get(project.id) as { n: number }\n  ).n;\n\n  const lastSession = registryDb\n    .prepare(\n      \"SELECT date FROM sessions WHERE project_id = ? ORDER BY date DESC LIMIT 1\"\n    )\n    .get(project.id) as { date: string } | undefined;\n\n  const tags = (\n    registryDb\n      .prepare(\n        `SELECT t.name FROM tags t\n         JOIN project_tags pt ON pt.tag_id = t.id\n         WHERE pt.project_id = ?\n         ORDER BY t.name`\n      )\n      .all(project.id) as Array<{ name: string }>\n  ).map((r) => r.name);\n\n  const aliases = (\n    registryDb\n      .prepare(\"SELECT alias FROM aliases WHERE project_id = ? ORDER BY alias\")\n      .all(project.id) as Array<{ alias: string }>\n  ).map((r) => r.alias);\n\n  const lines: string[] = [\n    `slug: ${project.slug}`,\n    `display_name: ${project.display_name}`,\n    `root_path: ${project.root_path}`,\n    `type: ${project.type}`,\n    `status: ${project.status}`,\n    `sessions: ${sessionCount}`,\n  ];\n\n  if (lastSession) lines.push(`last_session: ${lastSession.date}`);\n  if (tags.length) lines.push(`tags: ${tags.join(\", \")}`);\n  if (aliases.length) lines.push(`aliases: ${aliases.join(\", \")}`);\n  if (project.obsidian_link) lines.push(`obsidian_link: ${project.obsidian_link}`);\n  if (project.archived_at) {\n    lines.push(\n      `archived_at: ${new Date(project.archived_at).toISOString().slice(0, 10)}`\n    );\n  }\n\n  return lines.join(\"\\n\");\n}\n","/**\n * MCP tool handlers: memory_search, memory_get\n */\n\nimport { readFileSync, existsSync, statSync } from \"node:fs\";\nimport { join, resolve, isAbsolute } from \"node:path\";\nimport type { Database } from \"better-sqlite3\";\nimport { populateSlugs, searchMemoryHybrid } from \"../../memory/search.js\";\nimport type { StorageBackend } from \"../../storage/interface.js\";\nimport type { SearchConfig } from \"../../daemon/config.js\";\nimport type { SearchResult } from \"../../memory/search.js\";\nimport {\n  lookupProjectId,\n  type ToolResult,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Tool: memory_search\n// ---------------------------------------------------------------------------\n\nexport interface MemorySearchParams {\n  query: string;\n  project?: string;\n  all_projects?: boolean;\n  sources?: Array<\"memory\" | \"notes\">;\n  limit?: number;\n  mode?: \"keyword\" | \"semantic\" | \"hybrid\";\n  /** Rerank results using cross-encoder model for better relevance ordering. */\n  rerank?: boolean;\n  /** Apply recency boost — score decays by half every N days. 0 = off (default). */\n  recencyBoost?: number;\n  /** Maximum characters per result snippet. Default 200.\n   *  Limit context consumption — MCP results go into Claude's context window. */\n  snippetLength?: number;\n}\n\nexport async function toolMemorySearch(\n  registryDb: Database,\n  federation: Database | StorageBackend,\n  params: MemorySearchParams,\n  searchDefaults?: SearchConfig,\n): Promise<ToolResult> {\n  try {\n    const projectIds: number[] | undefined = params.project\n      ? (() => {\n          const id = lookupProjectId(registryDb, params.project!);\n          return id != null ? [id] : [];\n        })()\n      : undefined;\n\n    if (params.project && (!projectIds || projectIds.length === 0)) {\n      return {\n        content: [\n          { type: \"text\", text: `Project not found: ${params.project}` },\n        ],\n        isError: true,\n      };\n    }\n\n    // NOTE: No indexAll() here — indexing is handled by the daemon scheduler.\n    // The daemon ensures the index stays fresh; the search hot path is read-only.\n\n    const mode = params.mode ?? (searchDefaults?.mode ?? \"keyword\");\n    // Limit context consumption — MCP results go into Claude's context window.\n    // Default to 5 results and 200-char snippets to keep a single search call\n    // within ~1-2K tokens rather than 5K+.\n    const snippetLength = params.snippetLength ?? (searchDefaults?.snippetLength ?? 200);\n    const searchOpts = {\n      projectIds,\n      sources: params.sources,\n      maxResults: params.limit ?? (searchDefaults?.defaultLimit ?? 5),\n    };\n\n    let results;\n\n    // Determine if federation is a StorageBackend or a raw Database\n    const isBackend = (x: Database | StorageBackend): x is StorageBackend =>\n      \"backendType\" in x;\n\n    if (isBackend(federation)) {\n      // Use the storage backend interface (works for both SQLite and Postgres)\n      if (mode === \"keyword\") {\n        results = await federation.searchKeyword(params.query, searchOpts);\n      } else if (mode === \"semantic\" || mode === \"hybrid\") {\n        const { generateEmbedding } = await import(\"../../memory/embeddings.js\");\n        const queryEmbedding = await generateEmbedding(params.query, true);\n\n        if (mode === \"semantic\") {\n          results = await federation.searchSemantic(queryEmbedding, searchOpts);\n        } else {\n          // Hybrid: combine keyword + semantic\n          const [kwResults, semResults] = await Promise.all([\n            federation.searchKeyword(params.query, { ...searchOpts, maxResults: 50 }),\n            federation.searchSemantic(queryEmbedding, { ...searchOpts, maxResults: 50 }),\n          ]); // 50 candidates is sufficient for min-max normalization\n          // Reuse the existing hybrid scoring logic\n          results = combineHybridResults(kwResults, semResults, searchOpts.maxResults ?? 10);\n        }\n      } else {\n        results = await federation.searchKeyword(params.query, searchOpts);\n      }\n    } else {\n      // Legacy path: raw better-sqlite3 Database (for direct MCP server usage)\n      const { searchMemory, searchMemorySemantic } = await import(\"../../memory/search.js\");\n\n      if (mode === \"keyword\") {\n        results = searchMemory(federation, params.query, searchOpts);\n      } else if (mode === \"semantic\" || mode === \"hybrid\") {\n        const { generateEmbedding } = await import(\"../../memory/embeddings.js\");\n        const queryEmbedding = await generateEmbedding(params.query, true);\n\n        if (mode === \"semantic\") {\n          results = searchMemorySemantic(federation, queryEmbedding, searchOpts);\n        } else {\n          results = searchMemoryHybrid(\n            federation,\n            params.query,\n            queryEmbedding,\n            searchOpts\n          );\n        }\n      } else {\n        results = searchMemory(federation, params.query, searchOpts);\n      }\n    }\n\n    // Cross-encoder reranking (on by default)\n    const shouldRerank = params.rerank ?? (searchDefaults?.rerank ?? true);\n    if (shouldRerank && results.length > 0) {\n      const { rerankResults } = await import(\"../../memory/reranker.js\");\n      results = await rerankResults(params.query, results, {\n        topK: searchOpts.maxResults ?? 5,\n      });\n    }\n\n    // Recency boost (off by default, applied after reranking)\n    const recencyDays = params.recencyBoost ?? (searchDefaults?.recencyBoostDays ?? 0);\n    if (recencyDays > 0 && results.length > 0) {\n      const { applyRecencyBoost } = await import(\"../../memory/search.js\");\n      results = applyRecencyBoost(results, recencyDays);\n    }\n\n    const withSlugs = populateSlugs(results, registryDb);\n\n    if (withSlugs.length === 0) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `No results found for query: \"${params.query}\" (mode: ${mode})`,\n          },\n        ],\n      };\n    }\n\n    const rerankLabel = shouldRerank ? \" +rerank\" : \"\";\n    const formatted = withSlugs\n      .map((r, i) => {\n        const header = `[${i + 1}] ${r.projectSlug ?? `project:${r.projectId}`} — ${r.path} (lines ${r.startLine}-${r.endLine}) score=${r.score.toFixed(4)} tier=${r.tier} source=${r.source}`;\n        // Truncate snippet to snippetLength — limit context consumption.\n        // MCP results go into Claude's context window; keep each result tight.\n        const raw = r.snippet.trim();\n        const snippet = raw.length > snippetLength\n          ? raw.slice(0, snippetLength) + \"...\"\n          : raw;\n        return `${header}\\n${snippet}`;\n      })\n      .join(\"\\n\\n---\\n\\n\");\n\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: `Found ${withSlugs.length} result(s) for \"${params.query}\" (mode: ${mode}${rerankLabel}):\\n\\n${formatted}`,\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `Search error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: memory_get\n// ---------------------------------------------------------------------------\n\nexport interface MemoryGetParams {\n  project: string;\n  path: string;\n  from?: number;\n  lines?: number;\n}\n\nexport function toolMemoryGet(\n  registryDb: Database,\n  params: MemoryGetParams\n): ToolResult {\n  try {\n    const projectId = lookupProjectId(registryDb, params.project);\n    if (projectId == null) {\n      return {\n        content: [\n          { type: \"text\", text: `Project not found: ${params.project}` },\n        ],\n        isError: true,\n      };\n    }\n\n    const project = registryDb\n      .prepare(\"SELECT root_path FROM projects WHERE id = ?\")\n      .get(projectId) as { root_path: string } | undefined;\n\n    if (!project) {\n      return {\n        content: [\n          { type: \"text\", text: `Project not found: ${params.project}` },\n        ],\n        isError: true,\n      };\n    }\n\n    const requestedPath = params.path;\n    if (requestedPath.includes(\"..\") || isAbsolute(requestedPath)) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `Invalid path: ${params.path} (must be a relative path within the project root, no ../ allowed)`,\n          },\n        ],\n        isError: true,\n      };\n    }\n\n    const fullPath = join(project.root_path, requestedPath);\n    const resolvedFull = resolve(fullPath);\n    const resolvedRoot = resolve(project.root_path);\n\n    if (\n      !resolvedFull.startsWith(resolvedRoot + \"/\") &&\n      resolvedFull !== resolvedRoot\n    ) {\n      return {\n        content: [\n          { type: \"text\", text: `Path traversal blocked: ${params.path}` },\n        ],\n        isError: true,\n      };\n    }\n\n    if (!existsSync(fullPath)) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `File not found: ${requestedPath} (project: ${params.project})`,\n          },\n        ],\n        isError: true,\n      };\n    }\n\n    const stat = statSync(fullPath);\n    if (stat.size > 5 * 1024 * 1024) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `Error: file too large (${(stat.size / 1024 / 1024).toFixed(1)} MB). Maximum 5 MB.`,\n          },\n        ],\n      };\n    }\n\n    const content = readFileSync(fullPath, \"utf8\");\n    const allLines = content.split(\"\\n\");\n\n    const fromLine = (params.from ?? 1) - 1;\n    const toLine =\n      params.lines != null\n        ? Math.min(fromLine + params.lines, allLines.length)\n        : allLines.length;\n\n    const selectedLines = allLines.slice(fromLine, toLine);\n    const text = selectedLines.join(\"\\n\");\n\n    const header =\n      params.from != null\n        ? `${params.project}/${requestedPath} (lines ${fromLine + 1}-${toLine}):`\n        : `${params.project}/${requestedPath}:`;\n\n    return {\n      content: [{ type: \"text\", text: `${header}\\n\\n${text}` }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `Read error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Hybrid search helper (backend-agnostic)\n// ---------------------------------------------------------------------------\n\n/**\n * Combine keyword + semantic results using min-max normalized scoring.\n * Mirrors the logic in searchMemoryHybrid() from memory/search.ts,\n * but works on pre-computed result arrays so it works for any backend.\n */\nexport function combineHybridResults(\n  keywordResults: SearchResult[],\n  semanticResults: SearchResult[],\n  maxResults: number,\n  keywordWeight = 0.5,\n  semanticWeight = 0.5\n): SearchResult[] {\n  if (keywordResults.length === 0 && semanticResults.length === 0) return [];\n\n  const keyFor = (r: SearchResult) =>\n    `${r.projectId}:${r.path}:${r.startLine}:${r.endLine}`;\n\n  function minMaxNormalize(items: SearchResult[]): Map<string, number> {\n    if (items.length === 0) return new Map();\n    const min = Math.min(...items.map((r) => r.score));\n    const max = Math.max(...items.map((r) => r.score));\n    const range = max - min;\n    const m = new Map<string, number>();\n    for (const r of items) {\n      m.set(keyFor(r), range === 0 ? 1 : (r.score - min) / range);\n    }\n    return m;\n  }\n\n  const kwNorm = minMaxNormalize(keywordResults);\n  const semNorm = minMaxNormalize(semanticResults);\n\n  const allKeys = new Set<string>([\n    ...keywordResults.map(keyFor),\n    ...semanticResults.map(keyFor),\n  ]);\n\n  const metaMap = new Map<string, SearchResult>();\n  for (const r of [...keywordResults, ...semanticResults]) {\n    metaMap.set(keyFor(r), r);\n  }\n\n  const combined: Array<SearchResult & { combinedScore: number }> = [];\n  for (const key of allKeys) {\n    const meta = metaMap.get(key)!;\n    const kwScore = kwNorm.get(key) ?? 0;\n    const semScore = semNorm.get(key) ?? 0;\n    const combinedScore = keywordWeight * kwScore + semanticWeight * semScore;\n    combined.push({ ...meta, score: combinedScore, combinedScore });\n  }\n\n  return combined\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults)\n    .map(({ combinedScore: _unused, ...r }) => r);\n}\n","/**\n * MCP tool handlers: project_info, project_list, project_detect,\n *                    project_health, project_todo\n */\n\nimport { readFileSync, existsSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport type { Database } from \"better-sqlite3\";\nimport { detectProject, formatDetectionJson } from \"../../cli/commands/detect.js\";\nimport {\n  lookupProjectId,\n  detectProjectFromPath,\n  formatProject,\n  type ProjectRow,\n  type ToolResult,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Tool: project_info\n// ---------------------------------------------------------------------------\n\nexport interface ProjectInfoParams {\n  slug?: string;\n}\n\nexport function toolProjectInfo(\n  registryDb: Database,\n  params: ProjectInfoParams\n): ToolResult {\n  try {\n    let project: ProjectRow | null = null;\n\n    if (params.slug) {\n      const projectId = lookupProjectId(registryDb, params.slug);\n      if (projectId != null) {\n        project = registryDb\n          .prepare(\n            \"SELECT id, slug, display_name, root_path, type, status, created_at, updated_at, archived_at, parent_id, obsidian_link FROM projects WHERE id = ?\"\n          )\n          .get(projectId) as ProjectRow | null;\n      }\n    } else {\n      const cwd = process.cwd();\n      project = detectProjectFromPath(registryDb, cwd);\n    }\n\n    if (!project) {\n      const message = params.slug\n        ? `Project not found: ${params.slug}`\n        : `No PAI project found matching the current directory: ${process.cwd()}`;\n      return {\n        content: [{ type: \"text\", text: message }],\n        isError: !params.slug,\n      };\n    }\n\n    return {\n      content: [{ type: \"text\", text: formatProject(registryDb, project) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `project_info error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: project_list\n// ---------------------------------------------------------------------------\n\nexport interface ProjectListParams {\n  status?: \"active\" | \"archived\" | \"migrating\";\n  tag?: string;\n  limit?: number;\n}\n\nexport function toolProjectList(\n  registryDb: Database,\n  params: ProjectListParams\n): ToolResult {\n  try {\n    const conditions: string[] = [];\n    const queryParams: (string | number)[] = [];\n\n    if (params.status) {\n      conditions.push(\"p.status = ?\");\n      queryParams.push(params.status);\n    }\n\n    if (params.tag) {\n      conditions.push(\n        \"p.id IN (SELECT pt.project_id FROM project_tags pt JOIN tags t ON pt.tag_id = t.id WHERE t.name = ?)\"\n      );\n      queryParams.push(params.tag);\n    }\n\n    const where =\n      conditions.length > 0 ? `WHERE ${conditions.join(\" AND \")}` : \"\";\n    const limit = params.limit ?? 50;\n    queryParams.push(limit);\n\n    const projects = registryDb\n      .prepare(\n        `SELECT p.id, p.slug, p.display_name, p.root_path, p.type, p.status, p.updated_at\n         FROM projects p\n         ${where}\n         ORDER BY p.updated_at DESC\n         LIMIT ?`\n      )\n      .all(...queryParams) as Array<{\n      id: number;\n      slug: string;\n      display_name: string;\n      root_path: string;\n      type: string;\n      status: string;\n      updated_at: number;\n    }>;\n\n    if (projects.length === 0) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: \"No projects found matching the given filters.\",\n          },\n        ],\n      };\n    }\n\n    const lines = projects.map(\n      (p) =>\n        `${p.slug}  [${p.status}]  ${p.root_path}  (updated: ${new Date(p.updated_at).toISOString().slice(0, 10)})`\n    );\n\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: `${projects.length} project(s):\\n\\n${lines.join(\"\\n\")}`,\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `project_list error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: project_detect\n// ---------------------------------------------------------------------------\n\nexport interface ProjectDetectParams {\n  cwd?: string;\n}\n\nexport function toolProjectDetect(\n  registryDb: Database,\n  params: ProjectDetectParams\n): ToolResult {\n  try {\n    const detection = detectProject(registryDb, params.cwd);\n\n    if (!detection) {\n      const target = params.cwd ?? process.cwd();\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `No registered project found for path: ${target}\\n\\nRun 'pai project add .' to register this directory.`,\n          },\n        ],\n      };\n    }\n\n    return {\n      content: [{ type: \"text\", text: formatDetectionJson(detection) }],\n    };\n  } catch (e) {\n    return {\n      content: [\n        { type: \"text\", text: `project_detect error: ${String(e)}` },\n      ],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: project_health\n// ---------------------------------------------------------------------------\n\nexport interface ProjectHealthParams {\n  category?: \"active\" | \"stale\" | \"dead\" | \"all\";\n}\n\nexport async function toolProjectHealth(\n  registryDb: Database,\n  params: ProjectHealthParams\n): Promise<ToolResult> {\n  try {\n    const { existsSync: fsExists, readdirSync, statSync } = await import(\n      \"node:fs\"\n    );\n    const {\n      join: pathJoin,\n      basename: pathBasename,\n    } = await import(\"node:path\");\n    const { homedir } = await import(\"node:os\");\n    const { encodeDir: enc } = await import(\"../../cli/utils.js\");\n\n    interface HealthRowLocal {\n      id: number;\n      slug: string;\n      display_name: string;\n      root_path: string;\n      encoded_dir: string;\n      status: string;\n      type: string;\n      session_count: number;\n    }\n\n    const rows = registryDb\n      .prepare(\n        `SELECT p.id, p.slug, p.display_name, p.root_path, p.encoded_dir, p.status, p.type,\n           (SELECT COUNT(*) FROM sessions s WHERE s.project_id = p.id) AS session_count\n         FROM projects p\n         ORDER BY p.slug ASC`\n      )\n      .all() as HealthRowLocal[];\n\n    const home = homedir();\n    const claudeProjects = pathJoin(home, \".claude\", \"projects\");\n\n    function suggestMoved(rootPath: string): string | undefined {\n      const name = pathBasename(rootPath);\n      const candidates = [\n        pathJoin(home, \"dev\", name),\n        pathJoin(home, \"dev\", \"ai\", name),\n        pathJoin(home, \"Desktop\", name),\n        pathJoin(home, \"Projects\", name),\n      ];\n      return candidates.find((c) => fsExists(c));\n    }\n\n    function hasClaudeNotes(encodedDir: string): boolean {\n      if (!fsExists(claudeProjects)) return false;\n      try {\n        for (const entry of readdirSync(claudeProjects)) {\n          if (entry !== encodedDir && !entry.startsWith(encodedDir)) continue;\n          const full = pathJoin(claudeProjects, entry);\n          try {\n            if (!statSync(full).isDirectory()) continue;\n          } catch {\n            continue;\n          }\n          if (fsExists(pathJoin(full, \"Notes\"))) return true;\n        }\n      } catch {\n        /* ignore */\n      }\n      return false;\n    }\n\n    interface HealthResult {\n      slug: string;\n      display_name: string;\n      root_path: string;\n      status: string;\n      type: string;\n      session_count: number;\n      health: string;\n      suggested_path: string | null;\n      has_claude_notes: boolean;\n      todo: {\n        found: boolean;\n        path: string | null;\n        has_continue: boolean;\n      };\n    }\n\n    function findTodoForProject(rootPath: string): {\n      found: boolean;\n      path: string | null;\n      has_continue: boolean;\n    } {\n      const locs = [\n        \"Notes/TODO.md\",\n        \".claude/Notes/TODO.md\",\n        \"tasks/todo.md\",\n        \"TODO.md\",\n      ];\n      for (const rel of locs) {\n        const full = pathJoin(rootPath, rel);\n        if (fsExists(full)) {\n          try {\n            const raw = readFileSync(full, \"utf8\");\n            const hasContinue = /^## Continue$/m.test(raw);\n            return { found: true, path: rel, has_continue: hasContinue };\n          } catch {\n            return { found: true, path: rel, has_continue: false };\n          }\n        }\n      }\n      return { found: false, path: null, has_continue: false };\n    }\n\n    const results: HealthResult[] = rows.map((p) => {\n      const pathExists = fsExists(p.root_path);\n      let health: string;\n      let suggestedPath: string | null = null;\n\n      if (pathExists) {\n        health = \"active\";\n      } else {\n        suggestedPath = suggestMoved(p.root_path) ?? null;\n        health = suggestedPath ? \"stale\" : \"dead\";\n      }\n\n      const todo = pathExists\n        ? findTodoForProject(p.root_path)\n        : { found: false, path: null, has_continue: false };\n\n      return {\n        slug: p.slug,\n        display_name: p.display_name,\n        root_path: p.root_path,\n        status: p.status,\n        type: p.type,\n        session_count: p.session_count,\n        health,\n        suggested_path: suggestedPath,\n        has_claude_notes: hasClaudeNotes(p.encoded_dir),\n        todo,\n      };\n    });\n\n    const filtered =\n      !params.category || params.category === \"all\"\n        ? results\n        : results.filter((r) => r.health === params.category);\n\n    const summary = {\n      total: rows.length,\n      active: results.filter((r) => r.health === \"active\").length,\n      stale: results.filter((r) => r.health === \"stale\").length,\n      dead: results.filter((r) => r.health === \"dead\").length,\n    };\n\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: JSON.stringify({ summary, projects: filtered }, null, 2),\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [\n        { type: \"text\", text: `project_health error: ${String(e)}` },\n      ],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: project_todo\n// ---------------------------------------------------------------------------\n\nexport interface ProjectTodoParams {\n  project?: string;\n}\n\n/**\n * TODO candidate locations searched in priority order.\n * Returns the first one that exists, along with its label.\n */\nconst TODO_LOCATIONS = [\n  { rel: \"Notes/TODO.md\",       label: \"Notes/TODO.md\" },\n  { rel: \".claude/Notes/TODO.md\", label: \".claude/Notes/TODO.md\" },\n  { rel: \"tasks/todo.md\",       label: \"tasks/todo.md\" },\n  { rel: \"TODO.md\",             label: \"TODO.md\" },\n];\n\n/**\n * Given TODO file content, extract and surface the ## Continue section first,\n * then return the remaining content. Returns an object with:\n *   continueSection: string | null\n *   fullContent: string\n *   hasContinue: boolean\n */\nfunction parseTodoContent(raw: string): {\n  continueSection: string | null;\n  fullContent: string;\n  hasContinue: boolean;\n} {\n  const lines = raw.split(\"\\n\");\n\n  // Find the ## Continue heading\n  const continueIdx = lines.findIndex(\n    (l) => l.trim() === \"## Continue\"\n  );\n\n  if (continueIdx === -1) {\n    return { continueSection: null, fullContent: raw, hasContinue: false };\n  }\n\n  // The section ends at the first `---` separator or next `##` heading after\n  // the Continue heading (whichever comes first).\n  let endIdx = lines.length;\n  for (let i = continueIdx + 1; i < lines.length; i++) {\n    const trimmed = lines[i].trim();\n    if (trimmed === \"---\" || (trimmed.startsWith(\"##\") && trimmed !== \"## Continue\")) {\n      endIdx = i;\n      break;\n    }\n  }\n\n  const continueLines = lines.slice(continueIdx, endIdx);\n  const continueSection = continueLines.join(\"\\n\").trim();\n\n  return { continueSection, fullContent: raw, hasContinue: true };\n}\n\nexport function toolProjectTodo(\n  registryDb: Database,\n  params: ProjectTodoParams\n): ToolResult {\n  try {\n    let rootPath: string;\n    let projectSlug: string;\n\n    if (params.project) {\n      const projectId = lookupProjectId(registryDb, params.project);\n      if (projectId == null) {\n        return {\n          content: [\n            { type: \"text\", text: `Project not found: ${params.project}` },\n          ],\n          isError: true,\n        };\n      }\n\n      const row = registryDb\n        .prepare(\"SELECT root_path, slug FROM projects WHERE id = ?\")\n        .get(projectId) as { root_path: string; slug: string } | undefined;\n\n      if (!row) {\n        return {\n          content: [\n            { type: \"text\", text: `Project not found: ${params.project}` },\n          ],\n          isError: true,\n        };\n      }\n\n      rootPath = row.root_path;\n      projectSlug = row.slug;\n    } else {\n      // Auto-detect from cwd\n      const project = detectProjectFromPath(registryDb, process.cwd());\n      if (!project) {\n        return {\n          content: [\n            {\n              type: \"text\",\n              text: `No PAI project found matching the current directory: ${process.cwd()}\\n\\nProvide a project slug or run 'pai project add .' to register this directory.`,\n            },\n          ],\n        };\n      }\n      rootPath = project.root_path;\n      projectSlug = project.slug;\n    }\n\n    // Search for TODO in priority order\n    for (const loc of TODO_LOCATIONS) {\n      const fullPath = join(rootPath, loc.rel);\n      if (existsSync(fullPath)) {\n        const raw = readFileSync(fullPath, \"utf8\");\n        const { continueSection, fullContent, hasContinue } = parseTodoContent(raw);\n\n        let output: string;\n        if (hasContinue && continueSection) {\n          // Surface the ## Continue section first, then the full content\n          output = [\n            `TODO found: ${projectSlug}/${loc.label}`,\n            \"\",\n            \"=== CONTINUE SECTION (surfaced first) ===\",\n            continueSection,\n            \"\",\n            \"=== FULL TODO CONTENT ===\",\n            fullContent,\n          ].join(\"\\n\");\n        } else {\n          output = [\n            `TODO found: ${projectSlug}/${loc.label}`,\n            \"\",\n            fullContent,\n          ].join(\"\\n\");\n        }\n\n        return {\n          content: [{ type: \"text\", text: output }],\n        };\n      }\n    }\n\n    // No TODO found in any location\n    const searched = TODO_LOCATIONS.map((l) => `  ${rootPath}/${l.rel}`).join(\"\\n\");\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: [\n            `No TODO.md found for project: ${projectSlug}`,\n            \"\",\n            \"Searched locations (in order):\",\n            searched,\n            \"\",\n            \"Create a TODO with: echo '## Tasks\\\\n- [ ] First task' > Notes/TODO.md\",\n          ].join(\"\\n\"),\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `project_todo error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n","/**\n * MCP tool handlers: session_list, session_route\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend } from \"../../storage/interface.js\";\nimport {\n  lookupProjectId,\n  type ToolResult,\n} from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Tool: session_list\n// ---------------------------------------------------------------------------\n\nexport interface SessionListParams {\n  project: string;\n  limit?: number;\n  status?: \"open\" | \"completed\" | \"compacted\";\n}\n\nexport function toolSessionList(\n  registryDb: Database,\n  params: SessionListParams\n): ToolResult {\n  try {\n    const projectId = lookupProjectId(registryDb, params.project);\n    if (projectId == null) {\n      return {\n        content: [\n          { type: \"text\", text: `Project not found: ${params.project}` },\n        ],\n        isError: true,\n      };\n    }\n\n    const conditions = [\"project_id = ?\"];\n    const queryParams: (string | number)[] = [projectId];\n\n    if (params.status) {\n      conditions.push(\"status = ?\");\n      queryParams.push(params.status);\n    }\n\n    const limit = params.limit ?? 10;\n    queryParams.push(limit);\n\n    const sessions = registryDb\n      .prepare(\n        `SELECT number, date, title, filename, status\n         FROM sessions\n         WHERE ${conditions.join(\" AND \")}\n         ORDER BY number DESC\n         LIMIT ?`\n      )\n      .all(...queryParams) as Array<{\n      number: number;\n      date: string;\n      title: string;\n      filename: string;\n      status: string;\n    }>;\n\n    if (sessions.length === 0) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `No sessions found for project: ${params.project}`,\n          },\n        ],\n      };\n    }\n\n    const lines = sessions.map(\n      (s) =>\n        `#${String(s.number).padStart(4, \"0\")}  ${s.date}  [${s.status}]  ${s.title}\\n        file: Notes/${s.filename}`\n    );\n\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: `${sessions.length} session(s) for ${params.project}:\\n\\n${lines.join(\"\\n\\n\")}`,\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `session_list error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: session_route\n// ---------------------------------------------------------------------------\n\nexport interface SessionRouteParams {\n  /** Working directory to route from (defaults to process.cwd()) */\n  cwd?: string;\n  /** Optional conversation context for topic-based fallback routing */\n  context?: string;\n}\n\n/**\n * Automatically suggest which project a session belongs to.\n *\n * Strategy (in priority order):\n *   1. path   — exact or parent-directory match in the project registry\n *   2. marker — walk up from cwd looking for Notes/PAI.md\n *   3. topic  — BM25 keyword search against memory (requires context)\n *\n * Call this at session start (e.g., from CLAUDE.md or a session-start hook)\n * to automatically route the session to the correct project.\n */\nexport async function toolSessionRoute(\n  registryDb: Database,\n  federation: Database | StorageBackend,\n  params: SessionRouteParams\n): Promise<ToolResult> {\n  try {\n    const { autoRoute, formatAutoRouteJson } = await import(\"../../session/auto-route.js\");\n\n    const result = await autoRoute(\n      registryDb,\n      federation,\n      params.cwd,\n      params.context\n    );\n\n    if (!result) {\n      const target = params.cwd ?? process.cwd();\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: [\n              `No project match found for: ${target}`,\n              \"\",\n              \"Tried: path match, PAI.md marker walk\" +\n                (params.context ? \", topic detection\" : \"\"),\n              \"\",\n              \"Run 'pai project add .' to register this directory,\",\n              \"or provide conversation context for topic-based routing.\",\n            ].join(\"\\n\"),\n          },\n        ],\n      };\n    }\n\n    return {\n      content: [{ type: \"text\", text: formatAutoRouteJson(result) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `session_route error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n","/**\n * MCP tool handler: registry_search\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { ToolResult } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Tool: registry_search\n// ---------------------------------------------------------------------------\n\nexport interface RegistrySearchParams {\n  query: string;\n}\n\nexport function toolRegistrySearch(\n  registryDb: Database,\n  params: RegistrySearchParams\n): ToolResult {\n  try {\n    const q = `%${params.query}%`;\n    const projects = registryDb\n      .prepare(\n        `SELECT id, slug, display_name, root_path, type, status, updated_at\n         FROM projects\n         WHERE slug LIKE ?\n            OR display_name LIKE ?\n            OR root_path LIKE ?\n         ORDER BY updated_at DESC\n         LIMIT 20`\n      )\n      .all(q, q, q) as Array<{\n      id: number;\n      slug: string;\n      display_name: string;\n      root_path: string;\n      type: string;\n      status: string;\n      updated_at: number;\n    }>;\n\n    if (projects.length === 0) {\n      return {\n        content: [\n          {\n            type: \"text\",\n            text: `No projects found matching: \"${params.query}\"`,\n          },\n        ],\n      };\n    }\n\n    const lines = projects.map((p) => `${p.slug}  [${p.status}]  ${p.root_path}`);\n\n    return {\n      content: [\n        {\n          type: \"text\",\n          text: `${projects.length} match(es) for \"${params.query}\":\\n\\n${lines.join(\"\\n\")}`,\n        },\n      ],\n    };\n  } catch (e) {\n    return {\n      content: [\n        { type: \"text\", text: `registry_search error: ${String(e)}` },\n      ],\n      isError: true,\n    };\n  }\n}\n","/**\n * MCP tool handlers: zettel_explore, zettel_health, zettel_surprise,\n *                    zettel_suggest, zettel_converse, zettel_themes\n */\n\nimport type { StorageBackend } from \"../../storage/interface.js\";\nimport type { ToolResult } from \"./types.js\";\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_explore\n// ---------------------------------------------------------------------------\n\nexport interface ZettelExploreParams {\n  start_note: string;\n  depth?: number;\n  direction?: string;\n  mode?: string;\n}\n\nexport async function toolZettelExplore(\n  backend: StorageBackend,\n  params: ZettelExploreParams\n): Promise<ToolResult> {\n  try {\n    const { zettelExplore } = await import(\"../../zettelkasten/index.js\");\n    const result = await zettelExplore(backend, {\n      startNote: params.start_note,\n      depth: params.depth,\n      direction: params.direction as \"forward\" | \"backward\" | \"both\" | undefined,\n      mode: params.mode as \"sequential\" | \"associative\" | \"all\" | undefined,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(result, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_explore error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_health\n// ---------------------------------------------------------------------------\n\nexport interface ZettelHealthParams {\n  scope?: string;\n  project_path?: string;\n  recent_days?: number;\n  include?: string[];\n}\n\nexport async function toolZettelHealth(\n  backend: StorageBackend,\n  params: ZettelHealthParams\n): Promise<ToolResult> {\n  try {\n    const { zettelHealth } = await import(\"../../zettelkasten/index.js\");\n    const result = await zettelHealth(backend, {\n      scope: params.scope as \"full\" | \"recent\" | \"project\" | undefined,\n      projectPath: params.project_path,\n      recentDays: params.recent_days,\n      include: params.include as Array<\"dead_links\" | \"orphans\" | \"disconnected\" | \"low_connectivity\"> | undefined,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(result, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_health error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_surprise\n// ---------------------------------------------------------------------------\n\nexport interface ZettelSurpriseParams {\n  reference_path: string;\n  vault_project_id: number;\n  limit?: number;\n  min_similarity?: number;\n  min_graph_distance?: number;\n}\n\nexport async function toolZettelSurprise(\n  backend: StorageBackend,\n  params: ZettelSurpriseParams\n): Promise<ToolResult> {\n  try {\n    const { zettelSurprise } = await import(\"../../zettelkasten/index.js\");\n    const results = await zettelSurprise(backend, {\n      referencePath: params.reference_path,\n      vaultProjectId: params.vault_project_id,\n      limit: params.limit,\n      minSimilarity: params.min_similarity,\n      minGraphDistance: params.min_graph_distance,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(results, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_surprise error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_suggest\n// ---------------------------------------------------------------------------\n\nexport interface ZettelSuggestParams {\n  note_path: string;\n  vault_project_id: number;\n  limit?: number;\n  exclude_linked?: boolean;\n}\n\nexport async function toolZettelSuggest(\n  backend: StorageBackend,\n  params: ZettelSuggestParams\n): Promise<ToolResult> {\n  try {\n    const { zettelSuggest } = await import(\"../../zettelkasten/index.js\");\n    const results = await zettelSuggest(backend, {\n      notePath: params.note_path,\n      vaultProjectId: params.vault_project_id,\n      limit: params.limit,\n      excludeLinked: params.exclude_linked,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(results, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_suggest error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_converse\n// ---------------------------------------------------------------------------\n\nexport interface ZettelConverseParams {\n  question: string;\n  vault_project_id: number;\n  depth?: number;\n  limit?: number;\n}\n\nexport async function toolZettelConverse(\n  backend: StorageBackend,\n  params: ZettelConverseParams\n): Promise<ToolResult> {\n  try {\n    const { zettelConverse } = await import(\"../../zettelkasten/index.js\");\n    const result = await zettelConverse(backend, {\n      question: params.question,\n      vaultProjectId: params.vault_project_id,\n      depth: params.depth,\n      limit: params.limit,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(result, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_converse error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Tool: zettel_themes\n// ---------------------------------------------------------------------------\n\nexport interface ZettelThemesParams {\n  vault_project_id: number;\n  lookback_days?: number;\n  min_cluster_size?: number;\n  max_themes?: number;\n  similarity_threshold?: number;\n}\n\nexport async function toolZettelThemes(\n  backend: StorageBackend,\n  params: ZettelThemesParams\n): Promise<ToolResult> {\n  try {\n    const { zettelThemes } = await import(\"../../zettelkasten/index.js\");\n    const result = await zettelThemes(backend, {\n      vaultProjectId: params.vault_project_id,\n      lookbackDays: params.lookback_days,\n      minClusterSize: params.min_cluster_size,\n      maxThemes: params.max_themes,\n      similarityThreshold: params.similarity_threshold,\n    });\n    return {\n      content: [{ type: \"text\", text: JSON.stringify(result, null, 2) }],\n    };\n  } catch (e) {\n    return {\n      content: [{ type: \"text\", text: `zettel_themes error: ${String(e)}` }],\n      isError: true,\n    };\n  }\n}\n","/**\n * PAI Knowledge OS — MCP tool handlers (barrel re-export)\n *\n * All tool implementations have been split into domain modules under\n * src/mcp/tools/. This file re-exports everything so existing imports\n * (from \"../mcp/tools.js\") continue to work unchanged.\n *\n * Domain modules:\n *   tools/types.ts         — shared types + project-row helpers\n *   tools/memory.ts        — memory_search, memory_get\n *   tools/projects.ts      — project_info, project_list, project_detect,\n *                            project_health, project_todo\n *   tools/sessions.ts      — session_list, session_route\n *   tools/registry.ts      — registry_search\n *   tools/notifications.ts — notification_config\n *   tools/topics.ts        — topic_detect\n *   tools/zettel.ts        — zettel_explore, zettel_health, zettel_surprise,\n *                            zettel_suggest, zettel_converse, zettel_themes\n *   tools/observations.ts  — observation_search, observation_timeline\n */\n\nexport * from \"./tools/index.js\";\n"],"mappings":";;;;;;;;;;AAuCA,SAAgB,gBACd,YACA,MACe;CACf,MAAM,SAAS,WACZ,QAAQ,yCAAyC,CACjD,IAAI,KAAK;AACZ,KAAI,OAAQ,QAAO,OAAO;CAE1B,MAAM,UAAU,WACb,QAAQ,iDAAiD,CACzD,IAAI,KAAK;AACZ,KAAI,QAAS,QAAO,QAAQ;AAE5B,QAAO;;AAOT,SAAgB,sBACd,YACA,QACmB;CACnB,MAAM,WAAW,QAAQ,OAAO;CAEhC,MAAM,QAAQ,WACX,QACC,mHACD,CACA,IAAI,SAAS;AAEhB,KAAI,MAAO,QAAO;CAElB,MAAM,MAAM,WACT,QACC,+HACD,CACA,KAAK;AAER,MAAK,MAAM,WAAW,IACpB,KACE,SAAS,WAAW,QAAQ,YAAY,IAAI,IAC5C,aAAa,QAAQ,UAErB,QAAO;AAIX,QAAO;;AAOT,SAAgB,cAAc,YAAsB,SAA6B;CAC/E,MAAM,eACJ,WACG,QAAQ,0DAA0D,CAClE,IAAI,QAAQ,GAAG,CAClB;CAEF,MAAM,cAAc,WACjB,QACC,4EACD,CACA,IAAI,QAAQ,GAAG;CAElB,MAAM,OACJ,WACG,QACC;;;0BAID,CACA,IAAI,QAAQ,GAAG,CAClB,KAAK,MAAM,EAAE,KAAK;CAEpB,MAAM,UACJ,WACG,QAAQ,gEAAgE,CACxE,IAAI,QAAQ,GAAG,CAClB,KAAK,MAAM,EAAE,MAAM;CAErB,MAAM,QAAkB;EACtB,SAAS,QAAQ;EACjB,iBAAiB,QAAQ;EACzB,cAAc,QAAQ;EACtB,SAAS,QAAQ;EACjB,WAAW,QAAQ;EACnB,aAAa;EACd;AAED,KAAI,YAAa,OAAM,KAAK,iBAAiB,YAAY,OAAO;AAChE,KAAI,KAAK,OAAQ,OAAM,KAAK,SAAS,KAAK,KAAK,KAAK,GAAG;AACvD,KAAI,QAAQ,OAAQ,OAAM,KAAK,YAAY,QAAQ,KAAK,KAAK,GAAG;AAChE,KAAI,QAAQ,cAAe,OAAM,KAAK,kBAAkB,QAAQ,gBAAgB;AAChF,KAAI,QAAQ,YACV,OAAM,KACJ,gBAAgB,IAAI,KAAK,QAAQ,YAAY,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,GACzE;AAGH,QAAO,MAAM,KAAK,KAAK;;;;;;;;AC7GzB,eAAsB,iBACpB,YACA,YACA,QACA,gBACqB;AACrB,KAAI;EACF,MAAM,aAAmC,OAAO,iBACrC;GACL,MAAM,KAAK,gBAAgB,YAAY,OAAO,QAAS;AACvD,UAAO,MAAM,OAAO,CAAC,GAAG,GAAG,EAAE;MAC3B,GACJ;AAEJ,MAAI,OAAO,YAAY,CAAC,cAAc,WAAW,WAAW,GAC1D,QAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,sBAAsB,OAAO;IAAW,CAC/D;GACD,SAAS;GACV;EAMH,MAAM,OAAO,OAAO,QAAS,gBAAgB,QAAQ;EAIrD,MAAM,gBAAgB,OAAO,iBAAkB,gBAAgB,iBAAiB;EAChF,MAAM,aAAa;GACjB;GACA,SAAS,OAAO;GAChB,YAAY,OAAO,SAAU,gBAAgB,gBAAgB;GAC9D;EAED,IAAI;EAGJ,MAAM,aAAa,MACjB,iBAAiB;AAEnB,MAAI,UAAU,WAAW,CAEvB,KAAI,SAAS,UACX,WAAU,MAAM,WAAW,cAAc,OAAO,OAAO,WAAW;WACzD,SAAS,cAAc,SAAS,UAAU;GACnD,MAAM,EAAE,sBAAsB,MAAM,OAAO;GAC3C,MAAM,iBAAiB,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAElE,OAAI,SAAS,WACX,WAAU,MAAM,WAAW,eAAe,gBAAgB,WAAW;QAChE;IAEL,MAAM,CAAC,WAAW,cAAc,MAAM,QAAQ,IAAI,CAChD,WAAW,cAAc,OAAO,OAAO;KAAE,GAAG;KAAY,YAAY;KAAI,CAAC,EACzE,WAAW,eAAe,gBAAgB;KAAE,GAAG;KAAY,YAAY;KAAI,CAAC,CAC7E,CAAC;AAEF,cAAU,qBAAqB,WAAW,YAAY,WAAW,cAAc,GAAG;;QAGpF,WAAU,MAAM,WAAW,cAAc,OAAO,OAAO,WAAW;OAE/D;GAEL,MAAM,EAAE,cAAc,yBAAyB,MAAM,OAAO;AAE5D,OAAI,SAAS,UACX,WAAU,aAAa,YAAY,OAAO,OAAO,WAAW;YACnD,SAAS,cAAc,SAAS,UAAU;IACnD,MAAM,EAAE,sBAAsB,MAAM,OAAO;IAC3C,MAAM,iBAAiB,MAAM,kBAAkB,OAAO,OAAO,KAAK;AAElE,QAAI,SAAS,WACX,WAAU,qBAAqB,YAAY,gBAAgB,WAAW;QAEtE,WAAU,mBACR,YACA,OAAO,OACP,gBACA,WACD;SAGH,WAAU,aAAa,YAAY,OAAO,OAAO,WAAW;;EAKhE,MAAM,eAAe,OAAO,UAAW,gBAAgB,UAAU;AACjE,MAAI,gBAAgB,QAAQ,SAAS,GAAG;GACtC,MAAM,EAAE,kBAAkB,MAAM,OAAO;AACvC,aAAU,MAAM,cAAc,OAAO,OAAO,SAAS,EACnD,MAAM,WAAW,cAAc,GAChC,CAAC;;EAIJ,MAAM,cAAc,OAAO,gBAAiB,gBAAgB,oBAAoB;AAChF,MAAI,cAAc,KAAK,QAAQ,SAAS,GAAG;GACzC,MAAM,EAAE,sBAAsB,MAAM,OAAO;AAC3C,aAAU,kBAAkB,SAAS,YAAY;;EAGnD,MAAM,YAAY,cAAc,SAAS,WAAW;AAEpD,MAAI,UAAU,WAAW,EACvB,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,gCAAgC,OAAO,MAAM,WAAW,KAAK;GACpE,CACF,EACF;EAGH,MAAM,cAAc,eAAe,aAAa;EAChD,MAAM,YAAY,UACf,KAAK,GAAG,MAAM;GACb,MAAM,SAAS,IAAI,IAAI,EAAE,IAAI,EAAE,eAAe,WAAW,EAAE,YAAY,KAAK,EAAE,KAAK,UAAU,EAAE,UAAU,GAAG,EAAE,QAAQ,UAAU,EAAE,MAAM,QAAQ,EAAE,CAAC,QAAQ,EAAE,KAAK,UAAU,EAAE;GAG9K,MAAM,MAAM,EAAE,QAAQ,MAAM;AAI5B,UAAO,GAAG,OAAO,IAHD,IAAI,SAAS,gBACzB,IAAI,MAAM,GAAG,cAAc,GAAG,QAC9B;IAEJ,CACD,KAAK,cAAc;AAEtB,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,SAAS,UAAU,OAAO,kBAAkB,OAAO,MAAM,WAAW,OAAO,YAAY,QAAQ;GACtG,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,iBAAiB,OAAO,EAAE;IAAI,CAAC;GAC/D,SAAS;GACV;;;AAeL,SAAgB,cACd,YACA,QACY;AACZ,KAAI;EACF,MAAM,YAAY,gBAAgB,YAAY,OAAO,QAAQ;AAC7D,MAAI,aAAa,KACf,QAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,sBAAsB,OAAO;IAAW,CAC/D;GACD,SAAS;GACV;EAGH,MAAM,UAAU,WACb,QAAQ,8CAA8C,CACtD,IAAI,UAAU;AAEjB,MAAI,CAAC,QACH,QAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,sBAAsB,OAAO;IAAW,CAC/D;GACD,SAAS;GACV;EAGH,MAAM,gBAAgB,OAAO;AAC7B,MAAI,cAAc,SAAS,KAAK,IAAI,WAAW,cAAc,CAC3D,QAAO;GACL,SAAS,CACP;IACE,MAAM;IACN,MAAM,iBAAiB,OAAO,KAAK;IACpC,CACF;GACD,SAAS;GACV;EAGH,MAAM,WAAW,KAAK,QAAQ,WAAW,cAAc;EACvD,MAAM,eAAe,QAAQ,SAAS;EACtC,MAAM,eAAe,QAAQ,QAAQ,UAAU;AAE/C,MACE,CAAC,aAAa,WAAW,eAAe,IAAI,IAC5C,iBAAiB,aAEjB,QAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,2BAA2B,OAAO;IAAQ,CACjE;GACD,SAAS;GACV;AAGH,MAAI,CAAC,WAAW,SAAS,CACvB,QAAO;GACL,SAAS,CACP;IACE,MAAM;IACN,MAAM,mBAAmB,cAAc,aAAa,OAAO,QAAQ;IACpE,CACF;GACD,SAAS;GACV;EAGH,MAAM,OAAO,SAAS,SAAS;AAC/B,MAAI,KAAK,OAAO,IAAI,OAAO,KACzB,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,2BAA2B,KAAK,OAAO,OAAO,MAAM,QAAQ,EAAE,CAAC;GACtE,CACF,EACF;EAIH,MAAM,WADU,aAAa,UAAU,OAAO,CACrB,MAAM,KAAK;EAEpC,MAAM,YAAY,OAAO,QAAQ,KAAK;EACtC,MAAM,SACJ,OAAO,SAAS,OACZ,KAAK,IAAI,WAAW,OAAO,OAAO,SAAS,OAAO,GAClD,SAAS;EAGf,MAAM,OADgB,SAAS,MAAM,UAAU,OAAO,CAC3B,KAAK,KAAK;AAOrC,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,GALhC,OAAO,QAAQ,OACX,GAAG,OAAO,QAAQ,GAAG,cAAc,UAAU,WAAW,EAAE,GAAG,OAAO,MACpE,GAAG,OAAO,QAAQ,GAAG,cAAc,GAGG,MAAM;GAAQ,CAAC,EAC1D;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,eAAe,OAAO,EAAE;IAAI,CAAC;GAC7D,SAAS;GACV;;;;;;;;AAaL,SAAgB,qBACd,gBACA,iBACA,YACA,gBAAgB,IAChB,iBAAiB,IACD;AAChB,KAAI,eAAe,WAAW,KAAK,gBAAgB,WAAW,EAAG,QAAO,EAAE;CAE1E,MAAM,UAAU,MACd,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE;CAE/C,SAAS,gBAAgB,OAA4C;AACnE,MAAI,MAAM,WAAW,EAAG,wBAAO,IAAI,KAAK;EACxC,MAAM,MAAM,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,MAAM,CAAC;EAElD,MAAM,QADM,KAAK,IAAI,GAAG,MAAM,KAAK,MAAM,EAAE,MAAM,CAAC,GAC9B;EACpB,MAAM,oBAAI,IAAI,KAAqB;AACnC,OAAK,MAAM,KAAK,MACd,GAAE,IAAI,OAAO,EAAE,EAAE,UAAU,IAAI,KAAK,EAAE,QAAQ,OAAO,MAAM;AAE7D,SAAO;;CAGT,MAAM,SAAS,gBAAgB,eAAe;CAC9C,MAAM,UAAU,gBAAgB,gBAAgB;CAEhD,MAAM,UAAU,IAAI,IAAY,CAC9B,GAAG,eAAe,IAAI,OAAO,EAC7B,GAAG,gBAAgB,IAAI,OAAO,CAC/B,CAAC;CAEF,MAAM,0BAAU,IAAI,KAA2B;AAC/C,MAAK,MAAM,KAAK,CAAC,GAAG,gBAAgB,GAAG,gBAAgB,CACrD,SAAQ,IAAI,OAAO,EAAE,EAAE,EAAE;CAG3B,MAAM,WAA4D,EAAE;AACpE,MAAK,MAAM,OAAO,SAAS;EACzB,MAAM,OAAO,QAAQ,IAAI,IAAI;EAC7B,MAAM,UAAU,OAAO,IAAI,IAAI,IAAI;EACnC,MAAM,WAAW,QAAQ,IAAI,IAAI,IAAI;EACrC,MAAM,gBAAgB,gBAAgB,UAAU,iBAAiB;AACjE,WAAS,KAAK;GAAE,GAAG;GAAM,OAAO;GAAe;GAAe,CAAC;;AAGjE,QAAO,SACJ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,CACjC,MAAM,GAAG,WAAW,CACpB,KAAK,EAAE,eAAe,SAAS,GAAG,QAAQ,EAAE;;;;;;;;;AClVjD,SAAgB,gBACd,YACA,QACY;AACZ,KAAI;EACF,IAAI,UAA6B;AAEjC,MAAI,OAAO,MAAM;GACf,MAAM,YAAY,gBAAgB,YAAY,OAAO,KAAK;AAC1D,OAAI,aAAa,KACf,WAAU,WACP,QACC,mJACD,CACA,IAAI,UAAU;QAInB,WAAU,sBAAsB,YADpB,QAAQ,KAAK,CACuB;AAGlD,MAAI,CAAC,QAIH,QAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAJZ,OAAO,OACnB,sBAAsB,OAAO,SAC7B,wDAAwD,QAAQ,KAAK;IAE9B,CAAC;GAC1C,SAAS,CAAC,OAAO;GAClB;AAGH,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,cAAc,YAAY,QAAQ;GAAE,CAAC,EACtE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,uBAAuB,OAAO,EAAE;IAAI,CAAC;GACrE,SAAS;GACV;;;AAcL,SAAgB,gBACd,YACA,QACY;AACZ,KAAI;EACF,MAAM,aAAuB,EAAE;EAC/B,MAAM,cAAmC,EAAE;AAE3C,MAAI,OAAO,QAAQ;AACjB,cAAW,KAAK,eAAe;AAC/B,eAAY,KAAK,OAAO,OAAO;;AAGjC,MAAI,OAAO,KAAK;AACd,cAAW,KACT,uGACD;AACD,eAAY,KAAK,OAAO,IAAI;;EAG9B,MAAM,QACJ,WAAW,SAAS,IAAI,SAAS,WAAW,KAAK,QAAQ,KAAK;EAChE,MAAM,QAAQ,OAAO,SAAS;AAC9B,cAAY,KAAK,MAAM;EAEvB,MAAM,WAAW,WACd,QACC;;WAEG,MAAM;;kBAGV,CACA,IAAI,GAAG,YAAY;AAUtB,MAAI,SAAS,WAAW,EACtB,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM;GACP,CACF,EACF;EAGH,MAAM,QAAQ,SAAS,KACpB,MACC,GAAG,EAAE,KAAK,KAAK,EAAE,OAAO,KAAK,EAAE,UAAU,cAAc,IAAI,KAAK,EAAE,WAAW,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAAC,GAC5G;AAED,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,GAAG,SAAS,OAAO,kBAAkB,MAAM,KAAK,KAAK;GAC5D,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,uBAAuB,OAAO,EAAE;IAAI,CAAC;GACrE,SAAS;GACV;;;AAYL,SAAgB,kBACd,YACA,QACY;AACZ,KAAI;EACF,MAAM,YAAY,cAAc,YAAY,OAAO,IAAI;AAEvD,MAAI,CAAC,UAEH,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,yCALG,OAAO,OAAO,QAAQ,KAAK,CAKkB;GACvD,CACF,EACF;AAGH,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,oBAAoB,UAAU;GAAE,CAAC,EAClE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,yBAAyB,OAAO,EAAE;IAAI,CAC7D;GACD,SAAS;GACV;;;AAYL,eAAsB,kBACpB,YACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,YAAY,UAAU,aAAa,aAAa,MAAM,OAC5D;EAEF,MAAM,EACJ,MAAM,UACN,UAAU,iBACR,MAAM,OAAO;EACjB,MAAM,EAAE,YAAY,MAAM,OAAO;EACjC,MAAM,EAAE,WAAW,QAAQ,MAAM,OAAO;EAaxC,MAAM,OAAO,WACV,QACC;;;8BAID,CACA,KAAK;EAER,MAAM,OAAO,SAAS;EACtB,MAAM,iBAAiB,SAAS,MAAM,WAAW,WAAW;EAE5D,SAAS,aAAa,UAAsC;GAC1D,MAAM,OAAO,aAAa,SAAS;AAOnC,UANmB;IACjB,SAAS,MAAM,OAAO,KAAK;IAC3B,SAAS,MAAM,OAAO,MAAM,KAAK;IACjC,SAAS,MAAM,WAAW,KAAK;IAC/B,SAAS,MAAM,YAAY,KAAK;IACjC,CACiB,MAAM,MAAM,SAAS,EAAE,CAAC;;EAG5C,SAAS,eAAe,YAA6B;AACnD,OAAI,CAAC,SAAS,eAAe,CAAE,QAAO;AACtC,OAAI;AACF,SAAK,MAAM,SAAS,YAAY,eAAe,EAAE;AAC/C,SAAI,UAAU,cAAc,CAAC,MAAM,WAAW,WAAW,CAAE;KAC3D,MAAM,OAAO,SAAS,gBAAgB,MAAM;AAC5C,SAAI;AACF,UAAI,CAAC,SAAS,KAAK,CAAC,aAAa,CAAE;aAC7B;AACN;;AAEF,SAAI,SAAS,SAAS,MAAM,QAAQ,CAAC,CAAE,QAAO;;WAE1C;AAGR,UAAO;;EAoBT,SAAS,mBAAmB,UAI1B;AAOA,QAAK,MAAM,OANE;IACX;IACA;IACA;IACA;IACD,EACuB;IACtB,MAAM,OAAO,SAAS,UAAU,IAAI;AACpC,QAAI,SAAS,KAAK,CAChB,KAAI;KACF,MAAM,MAAM,aAAa,MAAM,OAAO;AAEtC,YAAO;MAAE,OAAO;MAAM,MAAM;MAAK,cADb,iBAAiB,KAAK,IAAI;MACc;YACtD;AACN,YAAO;MAAE,OAAO;MAAM,MAAM;MAAK,cAAc;MAAO;;;AAI5D,UAAO;IAAE,OAAO;IAAO,MAAM;IAAM,cAAc;IAAO;;EAG1D,MAAM,UAA0B,KAAK,KAAK,MAAM;GAC9C,MAAM,aAAa,SAAS,EAAE,UAAU;GACxC,IAAI;GACJ,IAAI,gBAA+B;AAEnC,OAAI,WACF,UAAS;QACJ;AACL,oBAAgB,aAAa,EAAE,UAAU,IAAI;AAC7C,aAAS,gBAAgB,UAAU;;GAGrC,MAAM,OAAO,aACT,mBAAmB,EAAE,UAAU,GAC/B;IAAE,OAAO;IAAO,MAAM;IAAM,cAAc;IAAO;AAErD,UAAO;IACL,MAAM,EAAE;IACR,cAAc,EAAE;IAChB,WAAW,EAAE;IACb,QAAQ,EAAE;IACV,MAAM,EAAE;IACR,eAAe,EAAE;IACjB;IACA,gBAAgB;IAChB,kBAAkB,eAAe,EAAE,YAAY;IAC/C;IACD;IACD;EAEF,MAAM,WACJ,CAAC,OAAO,YAAY,OAAO,aAAa,QACpC,UACA,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,SAAS;EAEzD,MAAM,UAAU;GACd,OAAO,KAAK;GACZ,QAAQ,QAAQ,QAAQ,MAAM,EAAE,WAAW,SAAS,CAAC;GACrD,OAAO,QAAQ,QAAQ,MAAM,EAAE,WAAW,QAAQ,CAAC;GACnD,MAAM,QAAQ,QAAQ,MAAM,EAAE,WAAW,OAAO,CAAC;GAClD;AAED,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,KAAK,UAAU;IAAE;IAAS,UAAU;IAAU,EAAE,MAAM,EAAE;GAC/D,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,yBAAyB,OAAO,EAAE;IAAI,CAC7D;GACD,SAAS;GACV;;;;;;;AAgBL,MAAM,iBAAiB;CACrB;EAAE,KAAK;EAAuB,OAAO;EAAiB;CACtD;EAAE,KAAK;EAAyB,OAAO;EAAyB;CAChE;EAAE,KAAK;EAAuB,OAAO;EAAiB;CACtD;EAAE,KAAK;EAAuB,OAAO;EAAW;CACjD;;;;;;;;AASD,SAAS,iBAAiB,KAIxB;CACA,MAAM,QAAQ,IAAI,MAAM,KAAK;CAG7B,MAAM,cAAc,MAAM,WACvB,MAAM,EAAE,MAAM,KAAK,cACrB;AAED,KAAI,gBAAgB,GAClB,QAAO;EAAE,iBAAiB;EAAM,aAAa;EAAK,aAAa;EAAO;CAKxE,IAAI,SAAS,MAAM;AACnB,MAAK,IAAI,IAAI,cAAc,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnD,MAAM,UAAU,MAAM,GAAG,MAAM;AAC/B,MAAI,YAAY,SAAU,QAAQ,WAAW,KAAK,IAAI,YAAY,eAAgB;AAChF,YAAS;AACT;;;AAOJ,QAAO;EAAE,iBAHa,MAAM,MAAM,aAAa,OAAO,CAChB,KAAK,KAAK,CAAC,MAAM;EAE7B,aAAa;EAAK,aAAa;EAAM;;AAGjE,SAAgB,gBACd,YACA,QACY;AACZ,KAAI;EACF,IAAI;EACJ,IAAI;AAEJ,MAAI,OAAO,SAAS;GAClB,MAAM,YAAY,gBAAgB,YAAY,OAAO,QAAQ;AAC7D,OAAI,aAAa,KACf,QAAO;IACL,SAAS,CACP;KAAE,MAAM;KAAQ,MAAM,sBAAsB,OAAO;KAAW,CAC/D;IACD,SAAS;IACV;GAGH,MAAM,MAAM,WACT,QAAQ,oDAAoD,CAC5D,IAAI,UAAU;AAEjB,OAAI,CAAC,IACH,QAAO;IACL,SAAS,CACP;KAAE,MAAM;KAAQ,MAAM,sBAAsB,OAAO;KAAW,CAC/D;IACD,SAAS;IACV;AAGH,cAAW,IAAI;AACf,iBAAc,IAAI;SACb;GAEL,MAAM,UAAU,sBAAsB,YAAY,QAAQ,KAAK,CAAC;AAChE,OAAI,CAAC,QACH,QAAO,EACL,SAAS,CACP;IACE,MAAM;IACN,MAAM,wDAAwD,QAAQ,KAAK,CAAC;IAC7E,CACF,EACF;AAEH,cAAW,QAAQ;AACnB,iBAAc,QAAQ;;AAIxB,OAAK,MAAM,OAAO,gBAAgB;GAChC,MAAM,WAAW,KAAK,UAAU,IAAI,IAAI;AACxC,OAAI,WAAW,SAAS,EAAE;IAExB,MAAM,EAAE,iBAAiB,aAAa,gBAAgB,iBAD1C,aAAa,UAAU,OAAO,CACiC;IAE3E,IAAI;AACJ,QAAI,eAAe,gBAEjB,UAAS;KACP,eAAe,YAAY,GAAG,IAAI;KAClC;KACA;KACA;KACA;KACA;KACA;KACD,CAAC,KAAK,KAAK;QAEZ,UAAS;KACP,eAAe,YAAY,GAAG,IAAI;KAClC;KACA;KACD,CAAC,KAAK,KAAK;AAGd,WAAO,EACL,SAAS,CAAC;KAAE,MAAM;KAAQ,MAAM;KAAQ,CAAC,EAC1C;;;EAKL,MAAM,WAAW,eAAe,KAAK,MAAM,KAAK,SAAS,GAAG,EAAE,MAAM,CAAC,KAAK,KAAK;AAC/E,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM;IACJ,iCAAiC;IACjC;IACA;IACA;IACA;IACA;IACD,CAAC,KAAK,KAAK;GACb,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,uBAAuB,OAAO,EAAE;IAAI,CAAC;GACrE,SAAS;GACV;;;;;;AClgBL,SAAgB,gBACd,YACA,QACY;AACZ,KAAI;EACF,MAAM,YAAY,gBAAgB,YAAY,OAAO,QAAQ;AAC7D,MAAI,aAAa,KACf,QAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,sBAAsB,OAAO;IAAW,CAC/D;GACD,SAAS;GACV;EAGH,MAAM,aAAa,CAAC,iBAAiB;EACrC,MAAM,cAAmC,CAAC,UAAU;AAEpD,MAAI,OAAO,QAAQ;AACjB,cAAW,KAAK,aAAa;AAC7B,eAAY,KAAK,OAAO,OAAO;;EAGjC,MAAM,QAAQ,OAAO,SAAS;AAC9B,cAAY,KAAK,MAAM;EAEvB,MAAM,WAAW,WACd,QACC;;iBAES,WAAW,KAAK,QAAQ,CAAC;;kBAGnC,CACA,IAAI,GAAG,YAAY;AAQtB,MAAI,SAAS,WAAW,EACtB,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,kCAAkC,OAAO;GAChD,CACF,EACF;EAGH,MAAM,QAAQ,SAAS,KACpB,MACC,IAAI,OAAO,EAAE,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,EAAE,KAAK,KAAK,EAAE,OAAO,KAAK,EAAE,MAAM,wBAAwB,EAAE,WACzG;AAED,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,GAAG,SAAS,OAAO,kBAAkB,OAAO,QAAQ,OAAO,MAAM,KAAK,OAAO;GACpF,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,uBAAuB,OAAO,EAAE;IAAI,CAAC;GACrE,SAAS;GACV;;;;;;;;;;;;;;AA0BL,eAAsB,iBACpB,YACA,YACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,WAAW,wBAAwB,MAAM,OAAO;EAExD,MAAM,SAAS,MAAM,UACnB,YACA,YACA,OAAO,KACP,OAAO,QACR;AAED,MAAI,CAAC,OAEH,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM;IACJ,+BANO,OAAO,OAAO,QAAQ,KAAK;IAOlC;IACA,2CACG,OAAO,UAAU,sBAAsB;IAC1C;IACA;IACA;IACD,CAAC,KAAK,KAAK;GACb,CACF,EACF;AAGH,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,oBAAoB,OAAO;GAAE,CAAC,EAC/D;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,wBAAwB,OAAO,EAAE;IAAI,CAAC;GACtE,SAAS;GACV;;;;;;AChJL,SAAgB,mBACd,YACA,QACY;AACZ,KAAI;EACF,MAAM,IAAI,IAAI,OAAO,MAAM;EAC3B,MAAM,WAAW,WACd,QACC;;;;;;mBAOD,CACA,IAAI,GAAG,GAAG,EAAE;AAUf,MAAI,SAAS,WAAW,EACtB,QAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,gCAAgC,OAAO,MAAM;GACpD,CACF,EACF;EAGH,MAAM,QAAQ,SAAS,KAAK,MAAM,GAAG,EAAE,KAAK,KAAK,EAAE,OAAO,KAAK,EAAE,YAAY;AAE7E,SAAO,EACL,SAAS,CACP;GACE,MAAM;GACN,MAAM,GAAG,SAAS,OAAO,kBAAkB,OAAO,MAAM,QAAQ,MAAM,KAAK,KAAK;GACjF,CACF,EACF;UACM,GAAG;AACV,SAAO;GACL,SAAS,CACP;IAAE,MAAM;IAAQ,MAAM,0BAA0B,OAAO,EAAE;IAAI,CAC9D;GACD,SAAS;GACV;;;;;;ACjDL,eAAsB,kBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,kBAAkB,MAAM,OAAO;EACvC,MAAM,SAAS,MAAM,cAAc,SAAS;GAC1C,WAAW,OAAO;GAClB,OAAO,OAAO;GACd,WAAW,OAAO;GAClB,MAAM,OAAO;GACd,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,QAAQ,MAAM,EAAE;GAAE,CAAC,EACnE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,yBAAyB,OAAO,EAAE;IAAI,CAAC;GACvE,SAAS;GACV;;;AAeL,eAAsB,iBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,iBAAiB,MAAM,OAAO;EACtC,MAAM,SAAS,MAAM,aAAa,SAAS;GACzC,OAAO,OAAO;GACd,aAAa,OAAO;GACpB,YAAY,OAAO;GACnB,SAAS,OAAO;GACjB,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,QAAQ,MAAM,EAAE;GAAE,CAAC,EACnE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,wBAAwB,OAAO,EAAE;IAAI,CAAC;GACtE,SAAS;GACV;;;AAgBL,eAAsB,mBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,mBAAmB,MAAM,OAAO;EACxC,MAAM,UAAU,MAAM,eAAe,SAAS;GAC5C,eAAe,OAAO;GACtB,gBAAgB,OAAO;GACvB,OAAO,OAAO;GACd,eAAe,OAAO;GACtB,kBAAkB,OAAO;GAC1B,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,SAAS,MAAM,EAAE;GAAE,CAAC,EACpE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,0BAA0B,OAAO,EAAE;IAAI,CAAC;GACxE,SAAS;GACV;;;AAeL,eAAsB,kBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,kBAAkB,MAAM,OAAO;EACvC,MAAM,UAAU,MAAM,cAAc,SAAS;GAC3C,UAAU,OAAO;GACjB,gBAAgB,OAAO;GACvB,OAAO,OAAO;GACd,eAAe,OAAO;GACvB,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,SAAS,MAAM,EAAE;GAAE,CAAC,EACpE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,yBAAyB,OAAO,EAAE;IAAI,CAAC;GACvE,SAAS;GACV;;;AAeL,eAAsB,mBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,mBAAmB,MAAM,OAAO;EACxC,MAAM,SAAS,MAAM,eAAe,SAAS;GAC3C,UAAU,OAAO;GACjB,gBAAgB,OAAO;GACvB,OAAO,OAAO;GACd,OAAO,OAAO;GACf,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,QAAQ,MAAM,EAAE;GAAE,CAAC,EACnE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,0BAA0B,OAAO,EAAE;IAAI,CAAC;GACxE,SAAS;GACV;;;AAgBL,eAAsB,iBACpB,SACA,QACqB;AACrB,KAAI;EACF,MAAM,EAAE,iBAAiB,MAAM,OAAO;EACtC,MAAM,SAAS,MAAM,aAAa,SAAS;GACzC,gBAAgB,OAAO;GACvB,cAAc,OAAO;GACrB,gBAAgB,OAAO;GACvB,WAAW,OAAO;GAClB,qBAAqB,OAAO;GAC7B,CAAC;AACF,SAAO,EACL,SAAS,CAAC;GAAE,MAAM;GAAQ,MAAM,KAAK,UAAU,QAAQ,MAAM,EAAE;GAAE,CAAC,EACnE;UACM,GAAG;AACV,SAAO;GACL,SAAS,CAAC;IAAE,MAAM;IAAQ,MAAM,wBAAwB,OAAO,EAAE;IAAI,CAAC;GACtE,SAAS;GACV"}

package/dist/zettelkasten-cdajbnPr.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"zettelkasten-cdajbnPr.mjs","names":["MAX_CHUNKS"],"sources":["../src/zettelkasten/explore.ts","../src/zettelkasten/surprise.ts","../src/zettelkasten/converse.ts","../src/zettelkasten/health.ts","../src/zettelkasten/suggest.ts"],"sourcesContent":["import type { StorageBackend } from \"../storage/interface.js\";\nimport { dirname } from \"node:path\";\n\nexport interface ExploreOptions {\n  startNote: string;\n  depth?: number;\n  direction?: \"forward\" | \"backward\" | \"both\";\n  mode?: \"sequential\" | \"associative\" | \"all\";\n}\n\nexport interface ExploreNode {\n  path: string;\n  title: string | null;\n  depth: number;\n  linkType: \"sequential\" | \"associative\";\n  inbound: number;\n  outbound: number;\n}\n\nexport interface ExploreResult {\n  root: string;\n  nodes: ExploreNode[];\n  edges: Array<{ from: string; to: string; type: \"sequential\" | \"associative\" }>;\n  branchingPoints: string[];\n  maxDepthReached: boolean;\n}\n\nfunction classifyEdge(source: string, target: string): \"sequential\" | \"associative\" {\n  return dirname(source) === dirname(target) ? \"sequential\" : \"associative\";\n}\n\nasync function resolveStart(backend: StorageBackend, startNote: string): Promise<string | null> {\n  // Try direct lookup first\n  const files = await backend.getVaultFilesByPaths([startNote]);\n  if (files.length > 0) return files[0].vaultPath;\n\n  // Try alias lookup\n  const alias = await backend.getVaultAlias(startNote);\n  if (!alias) return null;\n\n  const canonical = await backend.getVaultFilesByPaths([alias.canonicalPath]);\n  return canonical.length > 0 ? canonical[0].vaultPath : null;\n}\n\nasync function getForwardNeighbors(backend: StorageBackend, path: string): Promise<string[]> {\n  const links = await backend.getLinksFromSource(path);\n  return links.filter(l => l.targetPath !== null).map(l => l.targetPath as string);\n}\n\nasync function getBackwardNeighbors(backend: StorageBackend, path: string): Promise<string[]> {\n  const links = await backend.getLinksToTarget(path);\n  return links.map(l => l.sourcePath);\n}\n\nasync function getFileInfo(\n  backend: StorageBackend,\n  path: string,\n): Promise<{ title: string | null; inbound: number; outbound: number }> {\n  const [files, health] = await Promise.all([\n    backend.getVaultFilesByPaths([path]),\n    backend.getVaultHealth(path),\n  ]);\n\n  return {\n    title: files[0]?.title ?? null,\n    inbound: health?.inboundCount ?? 0,\n    outbound: health?.outboundCount ?? 0,\n  };\n}\n\n/**\n * Traverse the Zettelkasten link graph using BFS, following chains of thought\n * from a starting note up to a configurable depth.\n */\nexport async function zettelExplore(backend: StorageBackend, opts: ExploreOptions): Promise<ExploreResult> {\n  const depth = Math.min(Math.max(opts.depth ?? 3, 1), 10);\n  const direction = opts.direction ?? \"both\";\n  const mode = opts.mode ?? \"all\";\n\n  const root = await resolveStart(backend, opts.startNote);\n  if (!root) {\n    return {\n      root: opts.startNote,\n      nodes: [],\n      edges: [],\n      branchingPoints: [],\n      maxDepthReached: false,\n    };\n  }\n\n  const visited = new Set<string>([root]);\n  const nodes: ExploreNode[] = [];\n  const edges: Array<{ from: string; to: string; type: \"sequential\" | \"associative\" }> = [];\n  let maxDepthReached = false;\n\n  const queue: Array<{ path: string; depth: number }> = [{ path: root, depth: 0 }];\n\n  while (queue.length > 0) {\n    const current = queue.shift()!;\n\n    if (current.depth >= depth) {\n      maxDepthReached = true;\n      continue;\n    }\n\n    const neighbors: Array<{ neighbor: string; from: string; to: string }> = [];\n\n    if (direction === \"forward\" || direction === \"both\") {\n      for (const n of await getForwardNeighbors(backend, current.path)) {\n        neighbors.push({ neighbor: n, from: current.path, to: n });\n      }\n    }\n\n    if (direction === \"backward\" || direction === \"both\") {\n      for (const n of await getBackwardNeighbors(backend, current.path)) {\n        neighbors.push({ neighbor: n, from: n, to: current.path });\n      }\n    }\n\n    for (const { neighbor, from, to } of neighbors) {\n      const edgeType = classifyEdge(from, to);\n\n      if (mode !== \"all\" && edgeType !== mode) {\n        continue;\n      }\n\n      const alreadyHasEdge = edges.some((e) => e.from === from && e.to === to);\n      if (!alreadyHasEdge) {\n        edges.push({ from, to, type: edgeType });\n      }\n\n      if (!visited.has(neighbor)) {\n        visited.add(neighbor);\n\n        const info = await getFileInfo(backend, neighbor);\n        nodes.push({\n          path: neighbor,\n          title: info.title,\n          depth: current.depth + 1,\n          linkType: edgeType,\n          inbound: info.inbound,\n          outbound: info.outbound,\n        });\n\n        queue.push({ path: neighbor, depth: current.depth + 1 });\n      }\n    }\n  }\n\n  const branchingPoints = nodes\n    .filter((n) => n.outbound > 2)\n    .map((n) => n.path);\n\n  const rootInfo = await getFileInfo(backend, root);\n  if (rootInfo.outbound > 2) {\n    branchingPoints.unshift(root);\n  }\n\n  return { root, nodes, edges, branchingPoints, maxDepthReached };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport {\n  deserializeEmbedding,\n  generateEmbedding,\n  cosineSimilarity,\n} from \"../memory/embeddings.js\";\n\nexport interface SurpriseOptions {\n  referencePath: string;\n  vaultProjectId: number;\n  limit?: number;\n  minSimilarity?: number;\n  minGraphDistance?: number;\n}\n\nexport interface SurpriseResult {\n  path: string;\n  title: string | null;\n  cosineSimilarity: number;\n  graphDistance: number;\n  surpriseScore: number;\n  sharedSnippet: string;\n}\n\nconst MAX_CHUNKS = 5000;\nconst BFS_HOP_CAP = 20;\n\nasync function getFileEmbeddings(\n  backend: StorageBackend,\n  projectId: number,\n): Promise<Map<string, { embedding: Float32Array; text: string }>> {\n  const rows = await backend.getChunksWithEmbeddings(projectId, MAX_CHUNKS);\n\n  const byPath = new Map<string, { sum: Float32Array; count: number; text: string }>();\n  for (const row of rows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const entry = byPath.get(row.path);\n    if (!entry) {\n      byPath.set(row.path, { sum: new Float32Array(vec), count: 1, text: row.text });\n    } else {\n      for (let i = 0; i < vec.length; i++) {\n        entry.sum[i] += vec[i];\n      }\n      entry.count++;\n    }\n  }\n\n  const result = new Map<string, { embedding: Float32Array; text: string }>();\n  for (const [path, { sum, count, text }] of byPath) {\n    const avg = new Float32Array(sum.length);\n    for (let i = 0; i < sum.length; i++) {\n      avg[i] = sum[i] / count;\n    }\n    result.set(path, { embedding: avg, text });\n  }\n  return result;\n}\n\nasync function getReferenceEmbedding(\n  backend: StorageBackend,\n  projectId: number,\n  path: string,\n): Promise<{ embedding: Float32Array; found: boolean }> {\n  const rows = await backend.getChunksForPath(projectId, path);\n\n  if (rows.length === 0) {\n    return { embedding: new Float32Array(0), found: false };\n  }\n\n  const embRows = rows.filter(r => r.embedding !== null) as Array<{ text: string; embedding: Buffer }>;\n  if (embRows.length === 0) {\n    return { embedding: new Float32Array(0), found: false };\n  }\n\n  const dim = deserializeEmbedding(embRows[0].embedding).length;\n  const sum = new Float32Array(dim);\n  for (const row of embRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    for (let i = 0; i < dim; i++) {\n      sum[i] += vec[i];\n    }\n  }\n  const avg = new Float32Array(dim);\n  for (let i = 0; i < dim; i++) {\n    avg[i] = sum[i] / embRows.length;\n  }\n  return { embedding: avg, found: true };\n}\n\nasync function bfsGraphDistance(backend: StorageBackend, source: string, target: string): Promise<number> {\n  if (source === target) return 0;\n\n  const visited = new Set<string>([source]);\n  const queue: Array<{ path: string; hops: number }> = [{ path: source, hops: 0 }];\n\n  while (queue.length > 0) {\n    const { path, hops } = queue.shift()!;\n    if (hops >= BFS_HOP_CAP) continue;\n\n    const [forwardLinks, backwardLinks] = await Promise.all([\n      backend.getLinksFromSource(path),\n      backend.getLinksToTarget(path),\n    ]);\n\n    const neighbors: string[] = [\n      ...forwardLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string),\n      ...backwardLinks.map(l => l.sourcePath),\n    ];\n\n    for (const neighbor of neighbors) {\n      if (neighbor === target) return hops + 1;\n      if (!visited.has(neighbor)) {\n        visited.add(neighbor);\n        queue.push({ path: neighbor, hops: hops + 1 });\n      }\n    }\n  }\n\n  return Infinity;\n}\n\nfunction getBestChunkText(\n  chunkRows: Array<{ text: string; embedding: Buffer | null }>,\n  refEmbedding: Float32Array,\n): string {\n  const rows = chunkRows.filter(r => r.embedding !== null) as Array<{ text: string; embedding: Buffer }>;\n  if (rows.length === 0) return \"\";\n\n  let bestText = rows[0].text;\n  let bestSim = -Infinity;\n\n  for (const row of rows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const sim = cosineSimilarity(refEmbedding, vec);\n    if (sim > bestSim) {\n      bestSim = sim;\n      bestText = row.text;\n    }\n  }\n\n  return bestText.trim().slice(0, 200);\n}\n\n/**\n * Find notes that are semantically similar to a reference note but graph-distant —\n * revealing surprising conceptual connections across unrelated areas of the Zettelkasten.\n */\nexport async function zettelSurprise(\n  backend: StorageBackend,\n  opts: SurpriseOptions,\n): Promise<SurpriseResult[]> {\n  const limit = opts.limit ?? 10;\n  const minSimilarity = opts.minSimilarity ?? 0.3;\n  const minGraphDistance = opts.minGraphDistance ?? 3;\n\n  let { embedding: refEmbedding, found } = await getReferenceEmbedding(\n    backend,\n    opts.vaultProjectId,\n    opts.referencePath,\n  );\n\n  // Fall back to generating an embedding from the file title if no chunks exist\n  if (!found) {\n    const files = await backend.getVaultFilesByPaths([opts.referencePath]);\n    const text = files[0]?.title ?? opts.referencePath;\n    refEmbedding = await generateEmbedding(text, true);\n  }\n\n  const allFileEmbeddings = await getFileEmbeddings(backend, opts.vaultProjectId);\n\n  // Remove the reference note itself from candidates\n  allFileEmbeddings.delete(opts.referencePath);\n\n  // First pass: filter by semantic similarity to avoid BFS on all nodes\n  const semanticCandidates: Array<{ path: string; sim: number }> = [];\n  for (const [path, { embedding }] of allFileEmbeddings) {\n    const sim = cosineSimilarity(refEmbedding, embedding);\n    if (sim >= minSimilarity) {\n      semanticCandidates.push({ path, sim });\n    }\n  }\n\n  // Compute graph distances for semantic candidates\n  const results: SurpriseResult[] = [];\n\n  for (const { path, sim } of semanticCandidates) {\n    const graphDistance = await bfsGraphDistance(backend, opts.referencePath, path);\n\n    const effectiveDistance = isFinite(graphDistance) ? graphDistance : BFS_HOP_CAP;\n    if (effectiveDistance < minGraphDistance) continue;\n\n    const files = await backend.getVaultFilesByPaths([path]);\n    const chunkRows = await backend.getChunksForPath(opts.vaultProjectId, path, 20);\n\n    const surpriseScore = sim * Math.log2(effectiveDistance + 1);\n    const sharedSnippet = getBestChunkText(chunkRows, refEmbedding);\n\n    results.push({\n      path,\n      title: files[0]?.title ?? null,\n      cosineSimilarity: sim,\n      graphDistance: isFinite(graphDistance) ? graphDistance : Infinity,\n      surpriseScore,\n      sharedSnippet,\n    });\n  }\n\n  results.sort((a, b) => b.surpriseScore - a.surpriseScore);\n  return results.slice(0, limit);\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport type { SearchResult } from \"../memory/search.js\";\nimport { generateEmbedding } from \"../memory/embeddings.js\";\n\nexport interface ConverseOptions {\n  /** The user's question or topic to explore. */\n  question: string;\n  /** project_id for vault chunks in memory_chunks. */\n  vaultProjectId: number;\n  /** Graph expansion depth. Default 2. */\n  depth?: number;\n  /** Maximum number of relevant notes to return. Default 15. */\n  limit?: number;\n}\n\nexport interface ConverseConnection {\n  fromPath: string;\n  toPath: string;\n  /** Top-level folder of fromPath. */\n  fromDomain: string;\n  /** Top-level folder of toPath. */\n  toDomain: string;\n  /** Link count between these two notes (can be > 1). */\n  strength: number;\n}\n\nexport interface ConverseResult {\n  relevantNotes: Array<{\n    path: string;\n    title: string | null;\n    snippet: string;\n    score: number;\n    domain: string;\n  }>;\n  /** Cross-domain connections found among the selected notes. */\n  connections: ConverseConnection[];\n  /** Unique domains involved across all selected notes. */\n  domains: string[];\n  /** AI-ready prompt combining notes + connections for insight generation. */\n  synthesisPrompt: string;\n}\n\n// ---------------------------------------------------------------------------\n// Helpers\n// ---------------------------------------------------------------------------\n\n/** Extract the top-level folder from a vault path (first path segment). */\nfunction extractDomain(vaultPath: string): string {\n  const slash = vaultPath.indexOf(\"/\");\n  return slash === -1 ? vaultPath : vaultPath.slice(0, slash);\n}\n\n/**\n * Expand one level of graph neighbors for a set of paths.\n * Returns all outbound and inbound neighbor paths (excluding already-visited).\n */\nasync function expandNeighbors(backend: StorageBackend, paths: Set<string>): Promise<string[]> {\n  if (paths.size === 0) return [];\n  const pathList = Array.from(paths);\n\n  const [forwardLinks, backwardLinks] = await Promise.all([\n    backend.getVaultLinksFromPaths(pathList),\n    Promise.all(pathList.map(p => backend.getLinksToTarget(p))),\n  ]);\n\n  const neighbors: string[] = [];\n  for (const link of forwardLinks) {\n    if (link.targetPath) neighbors.push(link.targetPath);\n  }\n  for (const linkList of backwardLinks) {\n    for (const link of linkList) {\n      neighbors.push(link.sourcePath);\n    }\n  }\n  return neighbors;\n}\n\n/**\n * Hybrid search combining keyword + semantic results using the StorageBackend.\n */\nasync function hybridSearch(\n  backend: StorageBackend,\n  query: string,\n  queryEmbedding: Float32Array,\n  opts: { projectIds?: number[]; maxResults?: number },\n): Promise<SearchResult[]> {\n  const maxResults = opts.maxResults ?? 10;\n  const kw = 0.5;\n  const sw = 0.5;\n\n  const [keywordResults, semanticResults] = await Promise.all([\n    backend.searchKeyword(query, { ...opts, maxResults: 50 }),\n    backend.searchSemantic(queryEmbedding, { ...opts, maxResults: 50 }),\n  ]);\n\n  if (keywordResults.length === 0 && semanticResults.length === 0) return [];\n\n  const keyFor = (r: SearchResult) =>\n    `${r.projectId}:${r.path}:${r.startLine}:${r.endLine}`;\n\n  function minMaxNormalize(scores: number[]): number[] {\n    const min = Math.min(...scores);\n    const max = Math.max(...scores);\n    const range = max - min;\n    if (range === 0) return scores.map(() => 1.0);\n    return scores.map(s => (s - min) / range);\n  }\n\n  const kwNorm = minMaxNormalize(keywordResults.map(r => r.score));\n  const semNorm = minMaxNormalize(semanticResults.map(r => r.score));\n\n  const combined = new Map<string, SearchResult & { combinedScore: number }>();\n\n  for (let i = 0; i < keywordResults.length; i++) {\n    const r = keywordResults[i];\n    const k = keyFor(r);\n    combined.set(k, { ...r, combinedScore: kw * kwNorm[i] });\n  }\n\n  for (let i = 0; i < semanticResults.length; i++) {\n    const r = semanticResults[i];\n    const k = keyFor(r);\n    const existing = combined.get(k);\n    if (existing) {\n      existing.combinedScore += sw * semNorm[i];\n    } else {\n      combined.set(k, { ...r, combinedScore: sw * semNorm[i] });\n    }\n  }\n\n  const sorted = Array.from(combined.values())\n    .sort((a, b) => b.combinedScore - a.combinedScore)\n    .slice(0, maxResults);\n\n  return sorted.map(r => ({ ...r, score: r.combinedScore }));\n}\n\n// ---------------------------------------------------------------------------\n// Main export\n// ---------------------------------------------------------------------------\n\n/**\n * Let the vault \"talk back\" — find notes relevant to a question, expand\n * through the link graph, identify cross-domain connections, and return a\n * structured result including a synthesis prompt for an AI to generate insights.\n */\nexport async function zettelConverse(\n  backend: StorageBackend,\n  opts: ConverseOptions,\n): Promise<ConverseResult> {\n  const depth = Math.max(opts.depth ?? 2, 0);\n  const limit = Math.max(opts.limit ?? 15, 1);\n  const candidateLimit = 20;\n\n  // ------------------------------------------------------------------\n  // 1. Hybrid search: find top candidates via BM25 + semantic similarity\n  // ------------------------------------------------------------------\n  const queryEmbedding = await generateEmbedding(opts.question, true);\n\n  const searchResults = await hybridSearch(\n    backend,\n    opts.question,\n    queryEmbedding,\n    {\n      projectIds: [opts.vaultProjectId],\n      maxResults: candidateLimit,\n    },\n  );\n\n  // Map of path -> best score + snippet from search results\n  const searchHits = new Map<string, { score: number; snippet: string }>();\n  for (const r of searchResults) {\n    const existing = searchHits.get(r.path);\n    if (!existing || r.score > existing.score) {\n      searchHits.set(r.path, { score: r.score, snippet: r.snippet });\n    }\n  }\n\n  // ------------------------------------------------------------------\n  // 2. Graph expansion: BFS from each search result up to `depth` levels\n  // ------------------------------------------------------------------\n  const allPaths = new Set<string>(searchHits.keys());\n  let frontier = new Set<string>(searchHits.keys());\n\n  for (let d = 0; d < depth; d++) {\n    const neighbors = await expandNeighbors(backend, frontier);\n    const newFrontier = new Set<string>();\n    for (const n of neighbors) {\n      if (!allPaths.has(n)) {\n        allPaths.add(n);\n        newFrontier.add(n);\n      }\n    }\n    if (newFrontier.size === 0) break;\n    frontier = newFrontier;\n  }\n\n  // ------------------------------------------------------------------\n  // 3. Deduplicate + trim to limit\n  // ------------------------------------------------------------------\n  const searchRanked = Array.from(searchHits.entries())\n    .sort((a, b) => b[1].score - a[1].score)\n    .map(([path, info]) => ({ path, ...info, isSearchResult: true }));\n\n  const neighborPaths = Array.from(allPaths).filter((p) => !searchHits.has(p));\n\n  // Fetch health data for neighbor ranking\n  const neighborHealthRows = await Promise.all(\n    neighborPaths.map(p => backend.getVaultHealth(p))\n  );\n  const neighborRanked = neighborPaths\n    .map((path, idx) => ({\n      path,\n      score: 0,\n      snippet: \"\",\n      inbound: neighborHealthRows[idx]?.inboundCount ?? 0,\n      isSearchResult: false,\n    }))\n    .sort((a, b) => b.inbound - a.inbound);\n\n  const budgetForNeighbors = Math.max(limit - searchRanked.length, 0);\n  const selectedNeighbors = neighborRanked.slice(0, budgetForNeighbors);\n\n  const selectedSearchPaths = searchRanked.slice(0, limit);\n  const selectedPaths = new Set<string>([\n    ...selectedSearchPaths.map((r) => r.path),\n    ...selectedNeighbors.map((r) => r.path),\n  ]);\n\n  // ------------------------------------------------------------------\n  // 4. Build relevantNotes with titles + domains\n  // ------------------------------------------------------------------\n\n  // Fetch titles in bulk\n  const allSelectedPaths = Array.from(selectedPaths);\n  const fileRows = await backend.getVaultFilesByPaths(allSelectedPaths);\n  const titleMap = new Map<string, string | null>(fileRows.map(f => [f.vaultPath, f.title]));\n\n  const relevantNotes: ConverseResult[\"relevantNotes\"] = [];\n\n  for (const r of selectedSearchPaths) {\n    if (!selectedPaths.has(r.path)) continue;\n    relevantNotes.push({\n      path: r.path,\n      title: titleMap.get(r.path) ?? null,\n      snippet: r.snippet,\n      score: r.score,\n      domain: extractDomain(r.path),\n    });\n  }\n\n  for (const r of selectedNeighbors) {\n    relevantNotes.push({\n      path: r.path,\n      title: titleMap.get(r.path) ?? null,\n      snippet: r.snippet,\n      score: 0,\n      domain: extractDomain(r.path),\n    });\n  }\n\n  // ------------------------------------------------------------------\n  // 5. Find connections between the selected notes\n  // ------------------------------------------------------------------\n  let connections: ConverseConnection[] = [];\n\n  if (selectedPaths.size > 0) {\n    const pathList = Array.from(selectedPaths);\n    const pathSet = new Set(pathList);\n\n    // Get all outbound links from the selected paths\n    const linkRows = await backend.getVaultLinksFromPaths(pathList);\n\n    // Count links between selected paths\n    const edgeCounts = new Map<string, number>();\n    for (const link of linkRows) {\n      if (link.targetPath && pathSet.has(link.targetPath)) {\n        const key = `${link.sourcePath}|||${link.targetPath}`;\n        edgeCounts.set(key, (edgeCounts.get(key) ?? 0) + 1);\n      }\n    }\n\n    for (const [key, cnt] of edgeCounts) {\n      const [sourcePath, targetPath] = key.split(\"|||\");\n      connections.push({\n        fromPath: sourcePath,\n        toPath: targetPath,\n        fromDomain: extractDomain(sourcePath),\n        toDomain: extractDomain(targetPath),\n        strength: cnt,\n      });\n    }\n  }\n\n  // ------------------------------------------------------------------\n  // 6. Domains + cross-domain filter\n  // ------------------------------------------------------------------\n  const domainSet = new Set<string>(relevantNotes.map((n) => n.domain));\n  const domains = Array.from(domainSet).sort();\n\n  const crossDomainConnections = connections.filter(\n    (c) => c.fromDomain !== c.toDomain,\n  );\n\n  // ------------------------------------------------------------------\n  // 7. Build synthesis prompt\n  // ------------------------------------------------------------------\n  const notesSummary = relevantNotes\n    .map((n, i) => {\n      const title = n.title ? `\"${n.title}\"` : \"(untitled)\";\n      const domain = n.domain;\n      const scoreLabel = n.score > 0 ? ` [relevance: ${n.score.toFixed(3)}]` : \" [context]\";\n      const snippet = n.snippet.trim().slice(0, 300);\n      return `${i + 1}. [${domain}] ${title}${scoreLabel}\\n   Path: ${n.path}\\n   \"${snippet}\"`;\n    })\n    .join(\"\\n\\n\");\n\n  const connectionSummary =\n    crossDomainConnections.length > 0\n      ? crossDomainConnections\n          .map(\n            (c) =>\n              `- \"${c.fromPath}\" (${c.fromDomain}) → \"${c.toPath}\" (${c.toDomain}) [strength: ${c.strength}]`,\n          )\n          .join(\"\\n\")\n      : \"(no cross-domain connections found)\";\n\n  const domainList = domains.join(\", \");\n\n  const synthesisPrompt = `You are a Zettelkasten research assistant. The vault has surfaced the following notes in response to this question:\n\nQUESTION: ${opts.question}\n\n---\n\nRELEVANT NOTES (${relevantNotes.length} notes across ${domains.length} domain(s): ${domainList}):\n\n${notesSummary}\n\n---\n\nCROSS-DOMAIN CONNECTIONS (links bridging different knowledge areas):\n\n${connectionSummary}\n\n---\n\nSYNTHESIS TASK:\n\nBased on these notes and the connections between them, please:\n\n1. Identify the key insights that emerge in direct response to the question.\n2. Highlight any unexpected connections between notes from different domains (${domainList}).\n3. Point out tensions, contradictions, or open questions the vault raises but does not resolve.\n4. Suggest what is notably absent — what the vault does NOT yet contain that would strengthen the understanding of this topic.\n5. Propose 2-3 new notes that would meaningfully extend this knowledge cluster.\n\nThink like a scholar who has deeply internalized these ideas and is now synthesizing them for the first time.`;\n\n  return {\n    relevantNotes,\n    connections: crossDomainConnections,\n    domains,\n    synthesisPrompt,\n  };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\n\nexport interface HealthOptions {\n  scope?: \"full\" | \"recent\" | \"project\";\n  projectPath?: string;\n  recentDays?: number;\n  include?: Array<\"dead_links\" | \"orphans\" | \"disconnected\" | \"low_connectivity\">;\n}\n\nexport interface DeadLink {\n  sourcePath: string;\n  targetRaw: string;\n  lineNumber: number;\n}\n\nexport interface HealthResult {\n  totalFiles: number;\n  totalLinks: number;\n  deadLinks: DeadLink[];\n  orphans: string[];\n  disconnectedClusters: number;\n  lowConnectivity: string[];\n  healthScore: number;\n  computedAt: number;\n}\n\nfunction countComponents(nodes: string[], edges: Array<{ source: string; target: string }>): number {\n  if (nodes.length === 0) return 0;\n\n  const parent = new Map<string, string>();\n  const rank = new Map<string, number>();\n\n  for (const n of nodes) {\n    parent.set(n, n);\n    rank.set(n, 0);\n  }\n\n  function find(x: string): string {\n    let root = x;\n    while (parent.get(root) !== root) {\n      root = parent.get(root)!;\n    }\n    let current = x;\n    while (current !== root) {\n      const next = parent.get(current)!;\n      parent.set(current, root);\n      current = next;\n    }\n    return root;\n  }\n\n  function union(a: string, b: string): void {\n    const ra = find(a);\n    const rb = find(b);\n    if (ra === rb) return;\n    const rankA = rank.get(ra) ?? 0;\n    const rankB = rank.get(rb) ?? 0;\n    if (rankA < rankB) {\n      parent.set(ra, rb);\n    } else if (rankA > rankB) {\n      parent.set(rb, ra);\n    } else {\n      parent.set(rb, ra);\n      rank.set(ra, rankA + 1);\n    }\n  }\n\n  for (const { source, target } of edges) {\n    if (parent.has(source) && parent.has(target)) {\n      union(source, target);\n    }\n  }\n\n  const roots = new Set<string>();\n  for (const n of nodes) {\n    roots.add(find(n));\n  }\n  return roots.size;\n}\n\n/**\n * Audit the structural health of the Zettelkasten vault using graph metrics.\n */\nexport async function zettelHealth(backend: StorageBackend, opts?: HealthOptions): Promise<HealthResult> {\n  const options = opts ?? {};\n  const scope = options.scope ?? \"full\";\n  const include = options.include ?? [\"dead_links\", \"orphans\", \"disconnected\", \"low_connectivity\"];\n\n  const computedAt = Date.now();\n\n  // --- totalFiles ---\n  let totalFiles = 0;\n  if (scope === \"full\") {\n    totalFiles = await backend.countVaultFiles();\n  } else if (scope === \"project\") {\n    const prefix = options.projectPath ?? \"\";\n    totalFiles = await backend.countVaultFilesWithPrefix(prefix);\n  } else {\n    const days = options.recentDays ?? 30;\n    const cutoff = computedAt - days * 86400000;\n    totalFiles = await backend.countVaultFilesAfter(cutoff);\n  }\n\n  // --- totalLinks ---\n  let totalLinks = 0;\n  if (scope === \"full\") {\n    // Count total links via link graph length\n    const graph = await backend.getVaultLinkGraph();\n    totalLinks = graph.length;\n  } else if (scope === \"project\") {\n    const prefix = options.projectPath ?? \"\";\n    totalLinks = await backend.countVaultLinksWithPrefix(prefix);\n  } else {\n    const days = options.recentDays ?? 30;\n    const cutoff = computedAt - days * 86400000;\n    totalLinks = await backend.countVaultLinksAfter(cutoff);\n  }\n\n  // --- deadLinks ---\n  let deadLinks: DeadLink[] = [];\n  if (include.includes(\"dead_links\")) {\n    if (scope === \"full\") {\n      deadLinks = await backend.getDeadLinksWithLineNumbers();\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      deadLinks = await backend.getDeadLinksWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      deadLinks = await backend.getDeadLinksAfter(cutoff);\n    }\n  }\n\n  // --- orphans ---\n  let orphans: string[] = [];\n  if (include.includes(\"orphans\")) {\n    if (scope === \"full\") {\n      const orphanRows = await backend.getOrphans();\n      orphans = orphanRows.map(r => r.vaultPath);\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      orphans = await backend.getOrphansWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      orphans = await backend.getOrphansAfter(cutoff);\n    }\n  }\n\n  // --- disconnectedClusters (union-find) ---\n  let disconnectedClusters = 1;\n  if (include.includes(\"disconnected\")) {\n    let allNodes: string[];\n    let allEdges: Array<{ source: string; target: string }>;\n\n    if (scope === \"full\") {\n      [allNodes, allEdges] = await Promise.all([\n        backend.getAllVaultFilePaths(),\n        backend.getVaultLinkEdges(),\n      ]);\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      [allNodes, allEdges] = await Promise.all([\n        backend.getVaultFilePathsWithPrefix(prefix),\n        backend.getVaultLinkEdgesWithPrefix(prefix),\n      ]);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      [allNodes, allEdges] = await Promise.all([\n        backend.getVaultFilePathsAfter(cutoff),\n        backend.getVaultLinkEdgesAfter(cutoff),\n      ]);\n    }\n\n    disconnectedClusters = countComponents(allNodes, allEdges);\n  }\n\n  // --- lowConnectivity ---\n  let lowConnectivity: string[] = [];\n  if (include.includes(\"low_connectivity\")) {\n    if (scope === \"full\") {\n      lowConnectivity = await backend.getLowConnectivity();\n    } else if (scope === \"project\") {\n      const prefix = options.projectPath ?? \"\";\n      lowConnectivity = await backend.getLowConnectivityWithPrefix(prefix);\n    } else {\n      const days = options.recentDays ?? 30;\n      const cutoff = computedAt - days * 86400000;\n      lowConnectivity = await backend.getLowConnectivityAfter(cutoff);\n    }\n  }\n\n  // --- healthScore ---\n  const deadRatio = totalLinks > 0 ? deadLinks.length / totalLinks : 0;\n  const orphanRatio = totalFiles > 0 ? orphans.length / totalFiles : 0;\n  const lowConnRatio = totalFiles > 0 ? lowConnectivity.length / totalFiles : 0;\n  const healthScore = Math.round(\n    100 * (1 - deadRatio) * (1 - orphanRatio * 0.5) * (1 - lowConnRatio * 0.3),\n  );\n\n  return {\n    totalFiles,\n    totalLinks,\n    deadLinks,\n    orphans,\n    disconnectedClusters,\n    lowConnectivity,\n    healthScore,\n    computedAt,\n  };\n}\n","import type { StorageBackend } from \"../storage/interface.js\";\nimport { deserializeEmbedding, cosineSimilarity } from \"../memory/embeddings.js\";\nimport { basename } from \"node:path\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\nexport interface SuggestOptions {\n  notePath: string;\n  vaultProjectId: number;\n  limit?: number;\n  excludeLinked?: boolean;\n}\n\nexport interface Suggestion {\n  path: string;\n  title: string | null;\n  score: number;\n  semanticScore: number;\n  tagScore: number;\n  neighborScore: number;\n  reason: string;\n  suggestedWikilink: string;\n}\n\nconst MAX_CHUNKS = 5000;\nconst SEMANTIC_WEIGHT = 0.5;\nconst TAG_WEIGHT = 0.2;\nconst NEIGHBOR_WEIGHT = 0.3;\n\n// STOP_WORDS imported from utils/stop-words.ts\n\nfunction extractTagsFromChunkTexts(texts: string[]): Set<string> {\n  const tags = new Set<string>();\n  for (const text of texts) {\n    // Match YAML frontmatter tags block: \"tags:\\n  - tag1\\n  - tag2\"\n    const match = text.match(/^tags:\\s*\\n((?:[ \\t]*-[ \\t]*.+\\n?)*)/m);\n    if (!match) continue;\n    const block = match[1];\n    const lines = block.split(\"\\n\");\n    for (const line of lines) {\n      const tagMatch = line.match(/^[ \\t]*-[ \\t]*(.+)/);\n      if (tagMatch) {\n        const tag = tagMatch[1].trim().toLowerCase();\n        if (tag) tags.add(tag);\n      }\n    }\n  }\n  return tags;\n}\n\nfunction jaccardSimilarity(a: Set<string>, b: Set<string>): number {\n  if (a.size === 0 && b.size === 0) return 0;\n  let intersection = 0;\n  for (const tag of a) {\n    if (b.has(tag)) intersection++;\n  }\n  const union = a.size + b.size - intersection;\n  return union === 0 ? 0 : intersection / union;\n}\n\nfunction buildReason(\n  semanticScore: number,\n  tagScore: number,\n  neighborScore: number,\n  neighborCount: number,\n): string {\n  const signals: Array<{ label: string; value: number }> = [\n    { label: `Semantically similar (${semanticScore.toFixed(2)})`, value: semanticScore * SEMANTIC_WEIGHT },\n    { label: `Shared tags (${tagScore.toFixed(2)} Jaccard)`, value: tagScore * TAG_WEIGHT },\n    { label: `Linked by ${neighborCount} mutual connection${neighborCount !== 1 ? \"s\" : \"\"}`, value: neighborScore * NEIGHBOR_WEIGHT },\n  ];\n  signals.sort((a, b) => b.value - a.value);\n  return signals[0].label;\n}\n\nfunction suggestedWikilink(vaultPath: string): string {\n  const base = basename(vaultPath);\n  const name = base.endsWith(\".md\") ? base.slice(0, -3) : base;\n  return `[[${name}]]`;\n}\n\n/**\n * Proactively find notes worth linking to a given note, combining semantic similarity,\n * shared tags, and graph-neighborhood signals into a ranked list of suggestions.\n */\nexport async function zettelSuggest(\n  backend: StorageBackend,\n  opts: SuggestOptions,\n): Promise<Suggestion[]> {\n  const limit = opts.limit ?? 5;\n  const excludeLinked = opts.excludeLinked ?? true;\n\n  // Step 1: get current outbound links\n  const outboundLinks = await backend.getLinksFromSource(opts.notePath);\n  const linkedPaths = new Set(outboundLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string));\n\n  // Step 2a: get all file-level embeddings for semantic scoring\n  const chunkRows = await backend.getChunksWithEmbeddings(opts.vaultProjectId, MAX_CHUNKS);\n\n  const byPath = new Map<string, { sum: Float32Array; count: number }>();\n  for (const row of chunkRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const entry = byPath.get(row.path);\n    if (!entry) {\n      byPath.set(row.path, { sum: new Float32Array(vec), count: 1 });\n    } else {\n      for (let i = 0; i < vec.length; i++) {\n        entry.sum[i] += vec[i];\n      }\n      entry.count++;\n    }\n  }\n\n  const allEmbeddings = new Map<string, Float32Array>();\n  for (const [path, { sum, count }] of byPath) {\n    const avg = new Float32Array(sum.length);\n    for (let i = 0; i < sum.length; i++) {\n      avg[i] = sum[i] / count;\n    }\n    allEmbeddings.set(path, avg);\n  }\n  allEmbeddings.delete(opts.notePath);\n\n  // Step 2b: get source embedding\n  const sourceEmbedding = allEmbeddings.get(opts.notePath) ?? null;\n\n  // Step 2c: get source tags\n  const sourceChunkTexts = await backend.getChunksForPath(opts.vaultProjectId, opts.notePath, 5);\n  const sourceTags = extractTagsFromChunkTexts(sourceChunkTexts.map(r => r.text));\n\n  // Step 2d: compute graph neighborhood (friends-of-friends)\n  const directLinks = await backend.getLinksFromSource(opts.notePath);\n  const directTargets = directLinks.filter(l => l.targetPath !== null).map(l => l.targetPath as string);\n\n  const friendLinkCounts = new Map<string, number>();\n  for (const target of directTargets) {\n    const friendLinks = await backend.getLinksFromSource(target);\n    for (const link of friendLinks) {\n      if (link.targetPath && link.targetPath !== opts.notePath) {\n        friendLinkCounts.set(link.targetPath, (friendLinkCounts.get(link.targetPath) ?? 0) + 1);\n      }\n    }\n  }\n  const maxFriendLinks = Math.max(1, ...friendLinkCounts.values());\n\n  // Get all vault files to enumerate candidates\n  const allFiles = await backend.getAllVaultFiles();\n\n  const suggestions: Suggestion[] = [];\n\n  for (const fileRow of allFiles) {\n    const vault_path = fileRow.vaultPath;\n    const title = fileRow.title;\n\n    if (vault_path === opts.notePath) continue;\n    if (excludeLinked && linkedPaths.has(vault_path)) continue;\n\n    // Semantic score\n    let semanticScore = 0;\n    if (sourceEmbedding) {\n      const candidateEmbedding = allEmbeddings.get(vault_path);\n      if (candidateEmbedding) {\n        semanticScore = Math.max(0, cosineSimilarity(sourceEmbedding, candidateEmbedding));\n      }\n    }\n\n    // Tag score (only compute if candidate might have chunks)\n    let tagScore = 0;\n    if (allEmbeddings.has(vault_path)) {\n      const candidateChunkTexts = await backend.getChunksForPath(opts.vaultProjectId, vault_path, 5);\n      const candidateTags = extractTagsFromChunkTexts(candidateChunkTexts.map(r => r.text));\n      tagScore = jaccardSimilarity(sourceTags, candidateTags);\n    }\n\n    // Neighbor score\n    const friendCount = friendLinkCounts.get(vault_path) ?? 0;\n    const neighborScore = friendCount / maxFriendLinks;\n\n    const score =\n      SEMANTIC_WEIGHT * semanticScore +\n      TAG_WEIGHT * tagScore +\n      NEIGHBOR_WEIGHT * neighborScore;\n\n    // Only include if there is at least some signal\n    if (score <= 0) continue;\n\n    const reason = buildReason(semanticScore, tagScore, neighborScore, friendCount);\n\n    suggestions.push({\n      path: vault_path,\n      title,\n      score,\n      semanticScore,\n      tagScore,\n      neighborScore,\n      reason,\n      suggestedWikilink: suggestedWikilink(vault_path),\n    });\n  }\n\n  suggestions.sort((a, b) => b.score - a.score);\n  return suggestions.slice(0, limit);\n}\n"],"mappings":";;;;;AA2BA,SAAS,aAAa,QAAgB,QAA8C;AAClF,QAAO,QAAQ,OAAO,KAAK,QAAQ,OAAO,GAAG,eAAe;;AAG9D,eAAe,aAAa,SAAyB,WAA2C;CAE9F,MAAM,QAAQ,MAAM,QAAQ,qBAAqB,CAAC,UAAU,CAAC;AAC7D,KAAI,MAAM,SAAS,EAAG,QAAO,MAAM,GAAG;CAGtC,MAAM,QAAQ,MAAM,QAAQ,cAAc,UAAU;AACpD,KAAI,CAAC,MAAO,QAAO;CAEnB,MAAM,YAAY,MAAM,QAAQ,qBAAqB,CAAC,MAAM,cAAc,CAAC;AAC3E,QAAO,UAAU,SAAS,IAAI,UAAU,GAAG,YAAY;;AAGzD,eAAe,oBAAoB,SAAyB,MAAiC;AAE3F,SADc,MAAM,QAAQ,mBAAmB,KAAK,EACvC,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB;;AAGlF,eAAe,qBAAqB,SAAyB,MAAiC;AAE5F,SADc,MAAM,QAAQ,iBAAiB,KAAK,EACrC,KAAI,MAAK,EAAE,WAAW;;AAGrC,eAAe,YACb,SACA,MACsE;CACtE,MAAM,CAAC,OAAO,UAAU,MAAM,QAAQ,IAAI,CACxC,QAAQ,qBAAqB,CAAC,KAAK,CAAC,EACpC,QAAQ,eAAe,KAAK,CAC7B,CAAC;AAEF,QAAO;EACL,OAAO,MAAM,IAAI,SAAS;EAC1B,SAAS,QAAQ,gBAAgB;EACjC,UAAU,QAAQ,iBAAiB;EACpC;;;;;;AAOH,eAAsB,cAAc,SAAyB,MAA8C;CACzG,MAAM,QAAQ,KAAK,IAAI,KAAK,IAAI,KAAK,SAAS,GAAG,EAAE,EAAE,GAAG;CACxD,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,OAAO,KAAK,QAAQ;CAE1B,MAAM,OAAO,MAAM,aAAa,SAAS,KAAK,UAAU;AACxD,KAAI,CAAC,KACH,QAAO;EACL,MAAM,KAAK;EACX,OAAO,EAAE;EACT,OAAO,EAAE;EACT,iBAAiB,EAAE;EACnB,iBAAiB;EAClB;CAGH,MAAM,UAAU,IAAI,IAAY,CAAC,KAAK,CAAC;CACvC,MAAM,QAAuB,EAAE;CAC/B,MAAM,QAAiF,EAAE;CACzF,IAAI,kBAAkB;CAEtB,MAAM,QAAgD,CAAC;EAAE,MAAM;EAAM,OAAO;EAAG,CAAC;AAEhF,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;AAE7B,MAAI,QAAQ,SAAS,OAAO;AAC1B,qBAAkB;AAClB;;EAGF,MAAM,YAAmE,EAAE;AAE3E,MAAI,cAAc,aAAa,cAAc,OAC3C,MAAK,MAAM,KAAK,MAAM,oBAAoB,SAAS,QAAQ,KAAK,CAC9D,WAAU,KAAK;GAAE,UAAU;GAAG,MAAM,QAAQ;GAAM,IAAI;GAAG,CAAC;AAI9D,MAAI,cAAc,cAAc,cAAc,OAC5C,MAAK,MAAM,KAAK,MAAM,qBAAqB,SAAS,QAAQ,KAAK,CAC/D,WAAU,KAAK;GAAE,UAAU;GAAG,MAAM;GAAG,IAAI,QAAQ;GAAM,CAAC;AAI9D,OAAK,MAAM,EAAE,UAAU,MAAM,QAAQ,WAAW;GAC9C,MAAM,WAAW,aAAa,MAAM,GAAG;AAEvC,OAAI,SAAS,SAAS,aAAa,KACjC;AAIF,OAAI,CADmB,MAAM,MAAM,MAAM,EAAE,SAAS,QAAQ,EAAE,OAAO,GAAG,CAEtE,OAAM,KAAK;IAAE;IAAM;IAAI,MAAM;IAAU,CAAC;AAG1C,OAAI,CAAC,QAAQ,IAAI,SAAS,EAAE;AAC1B,YAAQ,IAAI,SAAS;IAErB,MAAM,OAAO,MAAM,YAAY,SAAS,SAAS;AACjD,UAAM,KAAK;KACT,MAAM;KACN,OAAO,KAAK;KACZ,OAAO,QAAQ,QAAQ;KACvB,UAAU;KACV,SAAS,KAAK;KACd,UAAU,KAAK;KAChB,CAAC;AAEF,UAAM,KAAK;KAAE,MAAM;KAAU,OAAO,QAAQ,QAAQ;KAAG,CAAC;;;;CAK9D,MAAM,kBAAkB,MACrB,QAAQ,MAAM,EAAE,WAAW,EAAE,CAC7B,KAAK,MAAM,EAAE,KAAK;AAGrB,MADiB,MAAM,YAAY,SAAS,KAAK,EACpC,WAAW,EACtB,iBAAgB,QAAQ,KAAK;AAG/B,QAAO;EAAE;EAAM;EAAO;EAAO;EAAiB;EAAiB;;;;;ACtIjE,MAAMA,eAAa;AACnB,MAAM,cAAc;AAEpB,eAAe,kBACb,SACA,WACiE;CACjE,MAAM,OAAO,MAAM,QAAQ,wBAAwB,WAAWA,aAAW;CAEzE,MAAM,yBAAS,IAAI,KAAiE;AACpF,MAAK,MAAM,OAAO,MAAM;EACtB,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK;AAClC,MAAI,CAAC,MACH,QAAO,IAAI,IAAI,MAAM;GAAE,KAAK,IAAI,aAAa,IAAI;GAAE,OAAO;GAAG,MAAM,IAAI;GAAM,CAAC;OACzE;AACL,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,OAAM,IAAI,MAAM,IAAI;AAEtB,SAAM;;;CAIV,MAAM,yBAAS,IAAI,KAAwD;AAC3E,MAAK,MAAM,CAAC,MAAM,EAAE,KAAK,OAAO,WAAW,QAAQ;EACjD,MAAM,MAAM,IAAI,aAAa,IAAI,OAAO;AACxC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,KAAK,IAAI,KAAK;AAEpB,SAAO,IAAI,MAAM;GAAE,WAAW;GAAK;GAAM,CAAC;;AAE5C,QAAO;;AAGT,eAAe,sBACb,SACA,WACA,MACsD;CACtD,MAAM,OAAO,MAAM,QAAQ,iBAAiB,WAAW,KAAK;AAE5D,KAAI,KAAK,WAAW,EAClB,QAAO;EAAE,WAAW,IAAI,aAAa,EAAE;EAAE,OAAO;EAAO;CAGzD,MAAM,UAAU,KAAK,QAAO,MAAK,EAAE,cAAc,KAAK;AACtD,KAAI,QAAQ,WAAW,EACrB,QAAO;EAAE,WAAW,IAAI,aAAa,EAAE;EAAE,OAAO;EAAO;CAGzD,MAAM,MAAM,qBAAqB,QAAQ,GAAG,UAAU,CAAC;CACvD,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,MAAM,OAAO,SAAS;EACzB,MAAM,MAAM,qBAAqB,IAAI,UAAU;AAC/C,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,MAAM,IAAI;;CAGlB,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IACvB,KAAI,KAAK,IAAI,KAAK,QAAQ;AAE5B,QAAO;EAAE,WAAW;EAAK,OAAO;EAAM;;AAGxC,eAAe,iBAAiB,SAAyB,QAAgB,QAAiC;AACxG,KAAI,WAAW,OAAQ,QAAO;CAE9B,MAAM,UAAU,IAAI,IAAY,CAAC,OAAO,CAAC;CACzC,MAAM,QAA+C,CAAC;EAAE,MAAM;EAAQ,MAAM;EAAG,CAAC;AAEhF,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,EAAE,MAAM,SAAS,MAAM,OAAO;AACpC,MAAI,QAAQ,YAAa;EAEzB,MAAM,CAAC,cAAc,iBAAiB,MAAM,QAAQ,IAAI,CACtD,QAAQ,mBAAmB,KAAK,EAChC,QAAQ,iBAAiB,KAAK,CAC/B,CAAC;EAEF,MAAM,YAAsB,CAC1B,GAAG,aAAa,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB,EACnF,GAAG,cAAc,KAAI,MAAK,EAAE,WAAW,CACxC;AAED,OAAK,MAAM,YAAY,WAAW;AAChC,OAAI,aAAa,OAAQ,QAAO,OAAO;AACvC,OAAI,CAAC,QAAQ,IAAI,SAAS,EAAE;AAC1B,YAAQ,IAAI,SAAS;AACrB,UAAM,KAAK;KAAE,MAAM;KAAU,MAAM,OAAO;KAAG,CAAC;;;;AAKpD,QAAO;;AAGT,SAAS,iBACP,WACA,cACQ;CACR,MAAM,OAAO,UAAU,QAAO,MAAK,EAAE,cAAc,KAAK;AACxD,KAAI,KAAK,WAAW,EAAG,QAAO;CAE9B,IAAI,WAAW,KAAK,GAAG;CACvB,IAAI,UAAU;AAEd,MAAK,MAAM,OAAO,MAAM;EAEtB,MAAM,MAAM,iBAAiB,cADjB,qBAAqB,IAAI,UAAU,CACA;AAC/C,MAAI,MAAM,SAAS;AACjB,aAAU;AACV,cAAW,IAAI;;;AAInB,QAAO,SAAS,MAAM,CAAC,MAAM,GAAG,IAAI;;;;;;AAOtC,eAAsB,eACpB,SACA,MAC2B;CAC3B,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,gBAAgB,KAAK,iBAAiB;CAC5C,MAAM,mBAAmB,KAAK,oBAAoB;CAElD,IAAI,EAAE,WAAW,cAAc,UAAU,MAAM,sBAC7C,SACA,KAAK,gBACL,KAAK,cACN;AAGD,KAAI,CAAC,MAGH,gBAAe,MAAM,mBAFP,MAAM,QAAQ,qBAAqB,CAAC,KAAK,cAAc,CAAC,EACnD,IAAI,SAAS,KAAK,eACQ,KAAK;CAGpD,MAAM,oBAAoB,MAAM,kBAAkB,SAAS,KAAK,eAAe;AAG/E,mBAAkB,OAAO,KAAK,cAAc;CAG5C,MAAM,qBAA2D,EAAE;AACnE,MAAK,MAAM,CAAC,MAAM,EAAE,gBAAgB,mBAAmB;EACrD,MAAM,MAAM,iBAAiB,cAAc,UAAU;AACrD,MAAI,OAAO,cACT,oBAAmB,KAAK;GAAE;GAAM;GAAK,CAAC;;CAK1C,MAAM,UAA4B,EAAE;AAEpC,MAAK,MAAM,EAAE,MAAM,SAAS,oBAAoB;EAC9C,MAAM,gBAAgB,MAAM,iBAAiB,SAAS,KAAK,eAAe,KAAK;EAE/E,MAAM,oBAAoB,SAAS,cAAc,GAAG,gBAAgB;AACpE,MAAI,oBAAoB,iBAAkB;EAE1C,MAAM,QAAQ,MAAM,QAAQ,qBAAqB,CAAC,KAAK,CAAC;EACxD,MAAM,YAAY,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,MAAM,GAAG;EAE/E,MAAM,gBAAgB,MAAM,KAAK,KAAK,oBAAoB,EAAE;EAC5D,MAAM,gBAAgB,iBAAiB,WAAW,aAAa;AAE/D,UAAQ,KAAK;GACX;GACA,OAAO,MAAM,IAAI,SAAS;GAC1B,kBAAkB;GAClB,eAAe,SAAS,cAAc,GAAG,gBAAgB;GACzD;GACA;GACD,CAAC;;AAGJ,SAAQ,MAAM,GAAG,MAAM,EAAE,gBAAgB,EAAE,cAAc;AACzD,QAAO,QAAQ,MAAM,GAAG,MAAM;;;;;;ACjKhC,SAAS,cAAc,WAA2B;CAChD,MAAM,QAAQ,UAAU,QAAQ,IAAI;AACpC,QAAO,UAAU,KAAK,YAAY,UAAU,MAAM,GAAG,MAAM;;;;;;AAO7D,eAAe,gBAAgB,SAAyB,OAAuC;AAC7F,KAAI,MAAM,SAAS,EAAG,QAAO,EAAE;CAC/B,MAAM,WAAW,MAAM,KAAK,MAAM;CAElC,MAAM,CAAC,cAAc,iBAAiB,MAAM,QAAQ,IAAI,CACtD,QAAQ,uBAAuB,SAAS,EACxC,QAAQ,IAAI,SAAS,KAAI,MAAK,QAAQ,iBAAiB,EAAE,CAAC,CAAC,CAC5D,CAAC;CAEF,MAAM,YAAsB,EAAE;AAC9B,MAAK,MAAM,QAAQ,aACjB,KAAI,KAAK,WAAY,WAAU,KAAK,KAAK,WAAW;AAEtD,MAAK,MAAM,YAAY,cACrB,MAAK,MAAM,QAAQ,SACjB,WAAU,KAAK,KAAK,WAAW;AAGnC,QAAO;;;;;AAMT,eAAe,aACb,SACA,OACA,gBACA,MACyB;CACzB,MAAM,aAAa,KAAK,cAAc;CACtC,MAAM,KAAK;CACX,MAAM,KAAK;CAEX,MAAM,CAAC,gBAAgB,mBAAmB,MAAM,QAAQ,IAAI,CAC1D,QAAQ,cAAc,OAAO;EAAE,GAAG;EAAM,YAAY;EAAI,CAAC,EACzD,QAAQ,eAAe,gBAAgB;EAAE,GAAG;EAAM,YAAY;EAAI,CAAC,CACpE,CAAC;AAEF,KAAI,eAAe,WAAW,KAAK,gBAAgB,WAAW,EAAG,QAAO,EAAE;CAE1E,MAAM,UAAU,MACd,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE;CAE/C,SAAS,gBAAgB,QAA4B;EACnD,MAAM,MAAM,KAAK,IAAI,GAAG,OAAO;EAE/B,MAAM,QADM,KAAK,IAAI,GAAG,OAAO,GACX;AACpB,MAAI,UAAU,EAAG,QAAO,OAAO,UAAU,EAAI;AAC7C,SAAO,OAAO,KAAI,OAAM,IAAI,OAAO,MAAM;;CAG3C,MAAM,SAAS,gBAAgB,eAAe,KAAI,MAAK,EAAE,MAAM,CAAC;CAChE,MAAM,UAAU,gBAAgB,gBAAgB,KAAI,MAAK,EAAE,MAAM,CAAC;CAElE,MAAM,2BAAW,IAAI,KAAuD;AAE5E,MAAK,IAAI,IAAI,GAAG,IAAI,eAAe,QAAQ,KAAK;EAC9C,MAAM,IAAI,eAAe;EACzB,MAAM,IAAI,OAAO,EAAE;AACnB,WAAS,IAAI,GAAG;GAAE,GAAG;GAAG,eAAe,KAAK,OAAO;GAAI,CAAC;;AAG1D,MAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;EAC/C,MAAM,IAAI,gBAAgB;EAC1B,MAAM,IAAI,OAAO,EAAE;EACnB,MAAM,WAAW,SAAS,IAAI,EAAE;AAChC,MAAI,SACF,UAAS,iBAAiB,KAAK,QAAQ;MAEvC,UAAS,IAAI,GAAG;GAAE,GAAG;GAAG,eAAe,KAAK,QAAQ;GAAI,CAAC;;AAQ7D,QAJe,MAAM,KAAK,SAAS,QAAQ,CAAC,CACzC,MAAM,GAAG,MAAM,EAAE,gBAAgB,EAAE,cAAc,CACjD,MAAM,GAAG,WAAW,CAET,KAAI,OAAM;EAAE,GAAG;EAAG,OAAO,EAAE;EAAe,EAAE;;;;;;;AAY5D,eAAsB,eACpB,SACA,MACyB;CACzB,MAAM,QAAQ,KAAK,IAAI,KAAK,SAAS,GAAG,EAAE;CAC1C,MAAM,QAAQ,KAAK,IAAI,KAAK,SAAS,IAAI,EAAE;CAC3C,MAAM,iBAAiB;CAKvB,MAAM,iBAAiB,MAAM,kBAAkB,KAAK,UAAU,KAAK;CAEnE,MAAM,gBAAgB,MAAM,aAC1B,SACA,KAAK,UACL,gBACA;EACE,YAAY,CAAC,KAAK,eAAe;EACjC,YAAY;EACb,CACF;CAGD,MAAM,6BAAa,IAAI,KAAiD;AACxE,MAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,WAAW,WAAW,IAAI,EAAE,KAAK;AACvC,MAAI,CAAC,YAAY,EAAE,QAAQ,SAAS,MAClC,YAAW,IAAI,EAAE,MAAM;GAAE,OAAO,EAAE;GAAO,SAAS,EAAE;GAAS,CAAC;;CAOlE,MAAM,WAAW,IAAI,IAAY,WAAW,MAAM,CAAC;CACnD,IAAI,WAAW,IAAI,IAAY,WAAW,MAAM,CAAC;AAEjD,MAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;EAC9B,MAAM,YAAY,MAAM,gBAAgB,SAAS,SAAS;EAC1D,MAAM,8BAAc,IAAI,KAAa;AACrC,OAAK,MAAM,KAAK,UACd,KAAI,CAAC,SAAS,IAAI,EAAE,EAAE;AACpB,YAAS,IAAI,EAAE;AACf,eAAY,IAAI,EAAE;;AAGtB,MAAI,YAAY,SAAS,EAAG;AAC5B,aAAW;;CAMb,MAAM,eAAe,MAAM,KAAK,WAAW,SAAS,CAAC,CAClD,MAAM,GAAG,MAAM,EAAE,GAAG,QAAQ,EAAE,GAAG,MAAM,CACvC,KAAK,CAAC,MAAM,WAAW;EAAE;EAAM,GAAG;EAAM,gBAAgB;EAAM,EAAE;CAEnE,MAAM,gBAAgB,MAAM,KAAK,SAAS,CAAC,QAAQ,MAAM,CAAC,WAAW,IAAI,EAAE,CAAC;CAG5E,MAAM,qBAAqB,MAAM,QAAQ,IACvC,cAAc,KAAI,MAAK,QAAQ,eAAe,EAAE,CAAC,CAClD;CACD,MAAM,iBAAiB,cACpB,KAAK,MAAM,SAAS;EACnB;EACA,OAAO;EACP,SAAS;EACT,SAAS,mBAAmB,MAAM,gBAAgB;EAClD,gBAAgB;EACjB,EAAE,CACF,MAAM,GAAG,MAAM,EAAE,UAAU,EAAE,QAAQ;CAExC,MAAM,qBAAqB,KAAK,IAAI,QAAQ,aAAa,QAAQ,EAAE;CACnE,MAAM,oBAAoB,eAAe,MAAM,GAAG,mBAAmB;CAErE,MAAM,sBAAsB,aAAa,MAAM,GAAG,MAAM;CACxD,MAAM,gBAAgB,IAAI,IAAY,CACpC,GAAG,oBAAoB,KAAK,MAAM,EAAE,KAAK,EACzC,GAAG,kBAAkB,KAAK,MAAM,EAAE,KAAK,CACxC,CAAC;CAOF,MAAM,mBAAmB,MAAM,KAAK,cAAc;CAClD,MAAM,WAAW,MAAM,QAAQ,qBAAqB,iBAAiB;CACrE,MAAM,WAAW,IAAI,IAA2B,SAAS,KAAI,MAAK,CAAC,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;CAE1F,MAAM,gBAAiD,EAAE;AAEzD,MAAK,MAAM,KAAK,qBAAqB;AACnC,MAAI,CAAC,cAAc,IAAI,EAAE,KAAK,CAAE;AAChC,gBAAc,KAAK;GACjB,MAAM,EAAE;GACR,OAAO,SAAS,IAAI,EAAE,KAAK,IAAI;GAC/B,SAAS,EAAE;GACX,OAAO,EAAE;GACT,QAAQ,cAAc,EAAE,KAAK;GAC9B,CAAC;;AAGJ,MAAK,MAAM,KAAK,kBACd,eAAc,KAAK;EACjB,MAAM,EAAE;EACR,OAAO,SAAS,IAAI,EAAE,KAAK,IAAI;EAC/B,SAAS,EAAE;EACX,OAAO;EACP,QAAQ,cAAc,EAAE,KAAK;EAC9B,CAAC;CAMJ,IAAI,cAAoC,EAAE;AAE1C,KAAI,cAAc,OAAO,GAAG;EAC1B,MAAM,WAAW,MAAM,KAAK,cAAc;EAC1C,MAAM,UAAU,IAAI,IAAI,SAAS;EAGjC,MAAM,WAAW,MAAM,QAAQ,uBAAuB,SAAS;EAG/D,MAAM,6BAAa,IAAI,KAAqB;AAC5C,OAAK,MAAM,QAAQ,SACjB,KAAI,KAAK,cAAc,QAAQ,IAAI,KAAK,WAAW,EAAE;GACnD,MAAM,MAAM,GAAG,KAAK,WAAW,KAAK,KAAK;AACzC,cAAW,IAAI,MAAM,WAAW,IAAI,IAAI,IAAI,KAAK,EAAE;;AAIvD,OAAK,MAAM,CAAC,KAAK,QAAQ,YAAY;GACnC,MAAM,CAAC,YAAY,cAAc,IAAI,MAAM,MAAM;AACjD,eAAY,KAAK;IACf,UAAU;IACV,QAAQ;IACR,YAAY,cAAc,WAAW;IACrC,UAAU,cAAc,WAAW;IACnC,UAAU;IACX,CAAC;;;CAON,MAAM,YAAY,IAAI,IAAY,cAAc,KAAK,MAAM,EAAE,OAAO,CAAC;CACrE,MAAM,UAAU,MAAM,KAAK,UAAU,CAAC,MAAM;CAE5C,MAAM,yBAAyB,YAAY,QACxC,MAAM,EAAE,eAAe,EAAE,SAC3B;CAKD,MAAM,eAAe,cAClB,KAAK,GAAG,MAAM;EACb,MAAM,QAAQ,EAAE,QAAQ,IAAI,EAAE,MAAM,KAAK;EACzC,MAAM,SAAS,EAAE;EACjB,MAAM,aAAa,EAAE,QAAQ,IAAI,gBAAgB,EAAE,MAAM,QAAQ,EAAE,CAAC,KAAK;EACzE,MAAM,UAAU,EAAE,QAAQ,MAAM,CAAC,MAAM,GAAG,IAAI;AAC9C,SAAO,GAAG,IAAI,EAAE,KAAK,OAAO,IAAI,QAAQ,WAAW,aAAa,EAAE,KAAK,QAAQ,QAAQ;GACvF,CACD,KAAK,OAAO;CAEf,MAAM,oBACJ,uBAAuB,SAAS,IAC5B,uBACG,KACE,MACC,MAAM,EAAE,SAAS,KAAK,EAAE,WAAW,OAAO,EAAE,OAAO,KAAK,EAAE,SAAS,eAAe,EAAE,SAAS,GAChG,CACA,KAAK,KAAK,GACb;CAEN,MAAM,aAAa,QAAQ,KAAK,KAAK;AAgCrC,QAAO;EACL;EACA,aAAa;EACb;EACA,iBAlCsB;;YAEd,KAAK,SAAS;;;;kBAIR,cAAc,OAAO,gBAAgB,QAAQ,OAAO,cAAc,WAAW;;EAE7F,aAAa;;;;;;EAMb,kBAAkB;;;;;;;;;gFAS4D,WAAW;;;;;;EAYxF;;;;;AClVH,SAAS,gBAAgB,OAAiB,OAA0D;AAClG,KAAI,MAAM,WAAW,EAAG,QAAO;CAE/B,MAAM,yBAAS,IAAI,KAAqB;CACxC,MAAM,uBAAO,IAAI,KAAqB;AAEtC,MAAK,MAAM,KAAK,OAAO;AACrB,SAAO,IAAI,GAAG,EAAE;AAChB,OAAK,IAAI,GAAG,EAAE;;CAGhB,SAAS,KAAK,GAAmB;EAC/B,IAAI,OAAO;AACX,SAAO,OAAO,IAAI,KAAK,KAAK,KAC1B,QAAO,OAAO,IAAI,KAAK;EAEzB,IAAI,UAAU;AACd,SAAO,YAAY,MAAM;GACvB,MAAM,OAAO,OAAO,IAAI,QAAQ;AAChC,UAAO,IAAI,SAAS,KAAK;AACzB,aAAU;;AAEZ,SAAO;;CAGT,SAAS,MAAM,GAAW,GAAiB;EACzC,MAAM,KAAK,KAAK,EAAE;EAClB,MAAM,KAAK,KAAK,EAAE;AAClB,MAAI,OAAO,GAAI;EACf,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;EAC9B,MAAM,QAAQ,KAAK,IAAI,GAAG,IAAI;AAC9B,MAAI,QAAQ,MACV,QAAO,IAAI,IAAI,GAAG;WACT,QAAQ,MACjB,QAAO,IAAI,IAAI,GAAG;OACb;AACL,UAAO,IAAI,IAAI,GAAG;AAClB,QAAK,IAAI,IAAI,QAAQ,EAAE;;;AAI3B,MAAK,MAAM,EAAE,QAAQ,YAAY,MAC/B,KAAI,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO,CAC1C,OAAM,QAAQ,OAAO;CAIzB,MAAM,wBAAQ,IAAI,KAAa;AAC/B,MAAK,MAAM,KAAK,MACd,OAAM,IAAI,KAAK,EAAE,CAAC;AAEpB,QAAO,MAAM;;;;;AAMf,eAAsB,aAAa,SAAyB,MAA6C;CACvG,MAAM,UAAU,QAAQ,EAAE;CAC1B,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,UAAU,QAAQ,WAAW;EAAC;EAAc;EAAW;EAAgB;EAAmB;CAEhG,MAAM,aAAa,KAAK,KAAK;CAG7B,IAAI,aAAa;AACjB,KAAI,UAAU,OACZ,cAAa,MAAM,QAAQ,iBAAiB;UACnC,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,eAAa,MAAM,QAAQ,0BAA0B,OAAO;QACvD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,eAAa,MAAM,QAAQ,qBAAqB,OAAO;;CAIzD,IAAI,aAAa;AACjB,KAAI,UAAU,OAGZ,eADc,MAAM,QAAQ,mBAAmB,EAC5B;UACV,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,eAAa,MAAM,QAAQ,0BAA0B,OAAO;QACvD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,eAAa,MAAM,QAAQ,qBAAqB,OAAO;;CAIzD,IAAI,YAAwB,EAAE;AAC9B,KAAI,QAAQ,SAAS,aAAa,CAChC,KAAI,UAAU,OACZ,aAAY,MAAM,QAAQ,6BAA6B;UAC9C,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,cAAY,MAAM,QAAQ,uBAAuB,OAAO;QACnD;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,cAAY,MAAM,QAAQ,kBAAkB,OAAO;;CAKvD,IAAI,UAAoB,EAAE;AAC1B,KAAI,QAAQ,SAAS,UAAU,CAC7B,KAAI,UAAU,OAEZ,YADmB,MAAM,QAAQ,YAAY,EACxB,KAAI,MAAK,EAAE,UAAU;UACjC,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,YAAU,MAAM,QAAQ,qBAAqB,OAAO;QAC/C;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,YAAU,MAAM,QAAQ,gBAAgB,OAAO;;CAKnD,IAAI,uBAAuB;AAC3B,KAAI,QAAQ,SAAS,eAAe,EAAE;EACpC,IAAI;EACJ,IAAI;AAEJ,MAAI,UAAU,OACZ,EAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,sBAAsB,EAC9B,QAAQ,mBAAmB,CAC5B,CAAC;WACO,UAAU,WAAW;GAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,IAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,4BAA4B,OAAO,EAC3C,QAAQ,4BAA4B,OAAO,CAC5C,CAAC;SACG;GAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,IAAC,UAAU,YAAY,MAAM,QAAQ,IAAI,CACvC,QAAQ,uBAAuB,OAAO,EACtC,QAAQ,uBAAuB,OAAO,CACvC,CAAC;;AAGJ,yBAAuB,gBAAgB,UAAU,SAAS;;CAI5D,IAAI,kBAA4B,EAAE;AAClC,KAAI,QAAQ,SAAS,mBAAmB,CACtC,KAAI,UAAU,OACZ,mBAAkB,MAAM,QAAQ,oBAAoB;UAC3C,UAAU,WAAW;EAC9B,MAAM,SAAS,QAAQ,eAAe;AACtC,oBAAkB,MAAM,QAAQ,6BAA6B,OAAO;QAC/D;EAEL,MAAM,SAAS,cADF,QAAQ,cAAc,MACA;AACnC,oBAAkB,MAAM,QAAQ,wBAAwB,OAAO;;CAKnE,MAAM,YAAY,aAAa,IAAI,UAAU,SAAS,aAAa;CACnE,MAAM,cAAc,aAAa,IAAI,QAAQ,SAAS,aAAa;CACnE,MAAM,eAAe,aAAa,IAAI,gBAAgB,SAAS,aAAa;CAC5E,MAAM,cAAc,KAAK,MACvB,OAAO,IAAI,cAAc,IAAI,cAAc,OAAQ,IAAI,eAAe,IACvE;AAED,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACD;;;;;AC3LH,MAAM,aAAa;AACnB,MAAM,kBAAkB;AACxB,MAAM,aAAa;AACnB,MAAM,kBAAkB;AAIxB,SAAS,0BAA0B,OAA8B;CAC/D,MAAM,uBAAO,IAAI,KAAa;AAC9B,MAAK,MAAM,QAAQ,OAAO;EAExB,MAAM,QAAQ,KAAK,MAAM,wCAAwC;AACjE,MAAI,CAAC,MAAO;EAEZ,MAAM,QADQ,MAAM,GACA,MAAM,KAAK;AAC/B,OAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,WAAW,KAAK,MAAM,qBAAqB;AACjD,OAAI,UAAU;IACZ,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,aAAa;AAC5C,QAAI,IAAK,MAAK,IAAI,IAAI;;;;AAI5B,QAAO;;AAGT,SAAS,kBAAkB,GAAgB,GAAwB;AACjE,KAAI,EAAE,SAAS,KAAK,EAAE,SAAS,EAAG,QAAO;CACzC,IAAI,eAAe;AACnB,MAAK,MAAM,OAAO,EAChB,KAAI,EAAE,IAAI,IAAI,CAAE;CAElB,MAAM,QAAQ,EAAE,OAAO,EAAE,OAAO;AAChC,QAAO,UAAU,IAAI,IAAI,eAAe;;AAG1C,SAAS,YACP,eACA,UACA,eACA,eACQ;CACR,MAAM,UAAmD;EACvD;GAAE,OAAO,yBAAyB,cAAc,QAAQ,EAAE,CAAC;GAAI,OAAO,gBAAgB;GAAiB;EACvG;GAAE,OAAO,gBAAgB,SAAS,QAAQ,EAAE,CAAC;GAAY,OAAO,WAAW;GAAY;EACvF;GAAE,OAAO,aAAa,cAAc,oBAAoB,kBAAkB,IAAI,MAAM;GAAM,OAAO,gBAAgB;GAAiB;EACnI;AACD,SAAQ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AACzC,QAAO,QAAQ,GAAG;;AAGpB,SAAS,kBAAkB,WAA2B;CACpD,MAAM,OAAO,SAAS,UAAU;AAEhC,QAAO,KADM,KAAK,SAAS,MAAM,GAAG,KAAK,MAAM,GAAG,GAAG,GAAG,KACvC;;;;;;AAOnB,eAAsB,cACpB,SACA,MACuB;CACvB,MAAM,QAAQ,KAAK,SAAS;CAC5B,MAAM,gBAAgB,KAAK,iBAAiB;CAG5C,MAAM,gBAAgB,MAAM,QAAQ,mBAAmB,KAAK,SAAS;CACrE,MAAM,cAAc,IAAI,IAAI,cAAc,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB,CAAC;CAG9G,MAAM,YAAY,MAAM,QAAQ,wBAAwB,KAAK,gBAAgB,WAAW;CAExF,MAAM,yBAAS,IAAI,KAAmD;AACtE,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,QAAQ,OAAO,IAAI,IAAI,KAAK;AAClC,MAAI,CAAC,MACH,QAAO,IAAI,IAAI,MAAM;GAAE,KAAK,IAAI,aAAa,IAAI;GAAE,OAAO;GAAG,CAAC;OACzD;AACL,QAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,OAAM,IAAI,MAAM,IAAI;AAEtB,SAAM;;;CAIV,MAAM,gCAAgB,IAAI,KAA2B;AACrD,MAAK,MAAM,CAAC,MAAM,EAAE,KAAK,YAAY,QAAQ;EAC3C,MAAM,MAAM,IAAI,aAAa,IAAI,OAAO;AACxC,OAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAC9B,KAAI,KAAK,IAAI,KAAK;AAEpB,gBAAc,IAAI,MAAM,IAAI;;AAE9B,eAAc,OAAO,KAAK,SAAS;CAGnC,MAAM,kBAAkB,cAAc,IAAI,KAAK,SAAS,IAAI;CAI5D,MAAM,aAAa,2BADM,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,KAAK,UAAU,EAAE,EAChC,KAAI,MAAK,EAAE,KAAK,CAAC;CAI/E,MAAM,iBADc,MAAM,QAAQ,mBAAmB,KAAK,SAAS,EACjC,QAAO,MAAK,EAAE,eAAe,KAAK,CAAC,KAAI,MAAK,EAAE,WAAqB;CAErG,MAAM,mCAAmB,IAAI,KAAqB;AAClD,MAAK,MAAM,UAAU,eAAe;EAClC,MAAM,cAAc,MAAM,QAAQ,mBAAmB,OAAO;AAC5D,OAAK,MAAM,QAAQ,YACjB,KAAI,KAAK,cAAc,KAAK,eAAe,KAAK,SAC9C,kBAAiB,IAAI,KAAK,aAAa,iBAAiB,IAAI,KAAK,WAAW,IAAI,KAAK,EAAE;;CAI7F,MAAM,iBAAiB,KAAK,IAAI,GAAG,GAAG,iBAAiB,QAAQ,CAAC;CAGhE,MAAM,WAAW,MAAM,QAAQ,kBAAkB;CAEjD,MAAM,cAA4B,EAAE;AAEpC,MAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,aAAa,QAAQ;EAC3B,MAAM,QAAQ,QAAQ;AAEtB,MAAI,eAAe,KAAK,SAAU;AAClC,MAAI,iBAAiB,YAAY,IAAI,WAAW,CAAE;EAGlD,IAAI,gBAAgB;AACpB,MAAI,iBAAiB;GACnB,MAAM,qBAAqB,cAAc,IAAI,WAAW;AACxD,OAAI,mBACF,iBAAgB,KAAK,IAAI,GAAG,iBAAiB,iBAAiB,mBAAmB,CAAC;;EAKtF,IAAI,WAAW;AACf,MAAI,cAAc,IAAI,WAAW,CAG/B,YAAW,kBAAkB,YADP,2BADM,MAAM,QAAQ,iBAAiB,KAAK,gBAAgB,YAAY,EAAE,EAC1B,KAAI,MAAK,EAAE,KAAK,CAAC,CAC9B;EAIzD,MAAM,cAAc,iBAAiB,IAAI,WAAW,IAAI;EACxD,MAAM,gBAAgB,cAAc;EAEpC,MAAM,QACJ,kBAAkB,gBAClB,aAAa,WACb,kBAAkB;AAGpB,MAAI,SAAS,EAAG;EAEhB,MAAM,SAAS,YAAY,eAAe,UAAU,eAAe,YAAY;AAE/E,cAAY,KAAK;GACf,MAAM;GACN;GACA;GACA;GACA;GACA;GACA;GACA,mBAAmB,kBAAkB,WAAW;GACjD,CAAC;;AAGJ,aAAY,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AAC7C,QAAO,YAAY,MAAM,GAAG,MAAM"}