@tekmidian/pai 0.33.2 → 0.34.0

package/dist/{sqlite-Cs_PXpyt.mjs.map → sqlite-R0pIbTmj.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"sqlite-Cs_PXpyt.mjs","names":[],"sources":["../src/storage/sqlite.ts"],"sourcesContent":["/**\n * SQLiteBackend — wraps the existing better-sqlite3 federation.db\n * behind the StorageBackend interface.\n *\n * This is a thin adapter.  The heavy lifting is all in the existing\n * memory/indexer.ts and memory/search.ts code; we just provide a\n * backend-agnostic surface so the daemon and tools can call either\n * SQLite or Postgres transparently.\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend, ChunkRow, FileRow, FederationStats } from \"./interface.js\";\nimport type { SearchResult, SearchOptions } from \"../memory/search.js\";\nimport { searchMemory, searchMemorySemantic } from \"../memory/search.js\";\n\nexport class SQLiteBackend implements StorageBackend {\n  readonly backendType = \"sqlite\" as const;\n\n  private db: Database;\n\n  constructor(db: Database) {\n    this.db = db;\n  }\n\n  /**\n   * Expose the raw better-sqlite3 Database handle.\n   * Used by the daemon to pass to indexAll() which still uses the synchronous API directly.\n   */\n  getRawDb(): Database {\n    return this.db;\n  }\n\n  /**\n   * Alias for getRawDb() — used by the dispatcher for operations that require\n   * direct SQLite access (e.g. memory_feedback, touchChunksLastAccessed).\n   */\n  getSqliteDb(): Database {\n    return this.db;\n  }\n\n  // -------------------------------------------------------------------------\n  // Lifecycle\n  // -------------------------------------------------------------------------\n\n  async close(): Promise<void> {\n    try {\n      this.db.close();\n    } catch {\n      // ignore\n    }\n  }\n\n  async getStats(): Promise<FederationStats> {\n    const files = (\n      this.db.prepare(\"SELECT COUNT(*) AS n FROM memory_files\").get() as { n: number }\n    ).n;\n    const chunks = (\n      this.db.prepare(\"SELECT COUNT(*) AS n FROM memory_chunks\").get() as { n: number }\n    ).n;\n    return { files, chunks };\n  }\n\n  // -------------------------------------------------------------------------\n  // File tracking\n  // -------------------------------------------------------------------------\n\n  async getFileHash(projectId: number, path: string): Promise<string | undefined> {\n    const row = this.db\n      .prepare(\"SELECT hash FROM memory_files WHERE project_id = ? AND path = ?\")\n      .get(projectId, path) as { hash: string } | undefined;\n    return row?.hash;\n  }\n\n  async upsertFile(file: FileRow): Promise<void> {\n    this.db\n      .prepare(\n        `INSERT INTO memory_files (project_id, path, source, tier, hash, mtime, size)\n         VALUES (?, ?, ?, ?, ?, ?, ?)\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      )\n      .run(file.projectId, file.path, file.source, file.tier, file.hash, file.mtime, file.size);\n  }\n\n  // -------------------------------------------------------------------------\n  // Chunk management\n  // -------------------------------------------------------------------------\n\n  async getChunkIds(projectId: number, path: string): Promise<string[]> {\n    const rows = this.db\n      .prepare(\"SELECT id FROM memory_chunks WHERE project_id = ? AND path = ?\")\n      .all(projectId, path) as Array<{ id: string }>;\n    return rows.map((r) => r.id);\n  }\n\n  async deleteChunksForFile(projectId: number, path: string): Promise<void> {\n    const ids = await this.getChunkIds(projectId, path);\n    const deleteFts = this.db.prepare(\"DELETE FROM memory_fts WHERE id = ?\");\n    const deleteChunks = this.db.prepare(\n      \"DELETE FROM memory_chunks WHERE project_id = ? AND path = ?\"\n    );\n    this.db.transaction(() => {\n      for (const id of ids) {\n        deleteFts.run(id);\n      }\n      deleteChunks.run(projectId, path);\n    })();\n  }\n\n  async insertChunks(chunks: ChunkRow[]): Promise<void> {\n    if (chunks.length === 0) return;\n\n    const insertChunk = this.db.prepare(\n      `INSERT INTO memory_chunks (id, project_id, source, tier, path, start_line, end_line, hash, text, updated_at)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`\n    );\n    const insertFts = this.db.prepare(\n      `INSERT INTO memory_fts (text, id, project_id, path, source, tier, start_line, end_line)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`\n    );\n\n    this.db.transaction(() => {\n      for (const c of chunks) {\n        insertChunk.run(\n          c.id,\n          c.projectId,\n          c.source,\n          c.tier,\n          c.path,\n          c.startLine,\n          c.endLine,\n          c.hash,\n          c.text,\n          c.updatedAt\n        );\n        insertFts.run(\n          c.text,\n          c.id,\n          c.projectId,\n          c.path,\n          c.source,\n          c.tier,\n          c.startLine,\n          c.endLine\n        );\n      }\n    })();\n  }\n\n  async getDistinctChunkPaths(projectId: number): Promise<string[]> {\n    const rows = this.db\n      .prepare(\"SELECT DISTINCT path FROM memory_chunks WHERE project_id = ?\")\n      .all(projectId) as Array<{ path: string }>;\n    return rows.map((r) => r.path);\n  }\n\n  async deletePaths(projectId: number, paths: string[]): Promise<void> {\n    if (paths.length === 0) return;\n    const deleteFts = this.db.prepare(\"DELETE FROM memory_fts WHERE id = ?\");\n    const deleteChunks = this.db.prepare(\n      \"DELETE FROM memory_chunks WHERE project_id = ? AND path = ?\"\n    );\n    const deleteFile = this.db.prepare(\n      \"DELETE FROM memory_files WHERE project_id = ? AND path = ?\"\n    );\n    this.db.transaction(() => {\n      for (const path of paths) {\n        const ids = this.db\n          .prepare(\"SELECT id FROM memory_chunks WHERE project_id = ? AND path = ?\")\n          .all(projectId, path) as Array<{ id: string }>;\n        for (const { id } of ids) {\n          deleteFts.run(id);\n        }\n        deleteChunks.run(projectId, path);\n        deleteFile.run(projectId, path);\n      }\n    })();\n  }\n\n  async getUnembeddedChunkIds(projectId?: number, limit?: number): Promise<Array<{ id: string; text: string; project_id: number; path: string }>> {\n    const conditions = [\"embedding IS NULL\"];\n    const params: (string | number)[] = [];\n\n    if (projectId !== undefined) {\n      conditions.push(\"project_id = ?\");\n      params.push(projectId);\n    }\n\n    const where = \"WHERE \" + conditions.join(\" AND \");\n    // Prioritize real knowledge notes over PAI session/job-search noise.\n    // CASE expression assigns lower priority numbers to knowledge paths.\n    const rows = this.db\n      .prepare(`SELECT id, text, project_id, path FROM memory_chunks ${where}\n        ORDER BY CASE\n          WHEN path LIKE '🧠 Ideaverse/%' THEN 0\n          WHEN path LIKE 'Z - Zettelkasten/%' THEN 0\n          WHEN path LIKE '💼 Business/%' THEN 0\n          WHEN path LIKE '📆 Meetings/%' THEN 1\n          WHEN path LIKE '💡 Insights/%' THEN 1\n          WHEN path LIKE '👨‍💻 People/%' THEN 1\n          WHEN path LIKE 'University/%' THEN 1\n          WHEN path LIKE 'Copilot/%' THEN 1\n          WHEN path LIKE '🗓️ Daily Notes/%' THEN 2\n          WHEN path LIKE 'PAI/%' THEN 3\n          WHEN path LIKE '09-job-search/%' THEN 4\n          WHEN path LIKE 'seriousletter/%' THEN 4\n          WHEN path LIKE 'Attachments/%' THEN 5\n          ELSE 2\n        END, id${limit !== undefined ? \" LIMIT ?\" : \"\"}`)\n      .all(...params, ...(limit !== undefined ? [limit] : [])) as Array<{ id: string; text: string; project_id: number; path: string }>;\n    return rows;\n  }\n\n  async updateEmbedding(chunkId: string, embedding: Buffer): Promise<void> {\n    this.db\n      .prepare(\"UPDATE memory_chunks SET embedding = ? WHERE id = ?\")\n      .run(embedding, chunkId);\n  }\n\n  // -------------------------------------------------------------------------\n  // Search\n  // -------------------------------------------------------------------------\n\n  async searchKeyword(query: string, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchMemory(this.db, query, opts);\n  }\n\n  async searchSemantic(queryEmbedding: Float32Array, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchMemorySemantic(this.db, queryEmbedding, opts);\n  }\n\n  // -------------------------------------------------------------------------\n  // Vault operations — not supported on SQLite backend (use Postgres)\n  // -------------------------------------------------------------------------\n\n  private vaultNotSupported(): never {\n    throw new Error(\"Vault operations require the Postgres backend\");\n  }\n\n  async upsertVaultFile(): Promise<void> { this.vaultNotSupported(); }\n  async deleteVaultFile(): Promise<void> { this.vaultNotSupported(); }\n  async getVaultFile(): Promise<null> { this.vaultNotSupported(); }\n  async getVaultFileByInode(): Promise<null> { this.vaultNotSupported(); }\n  async getAllVaultFiles(): Promise<never[]> { this.vaultNotSupported(); }\n  async getRecentVaultFiles(): Promise<never[]> { this.vaultNotSupported(); }\n  async countVaultFiles(): Promise<number> { this.vaultNotSupported(); }\n  async upsertVaultAliases(): Promise<void> { this.vaultNotSupported(); }\n  async deleteVaultAliases(): Promise<void> { this.vaultNotSupported(); }\n  async replaceLinksForSources(): Promise<void> { this.vaultNotSupported(); }\n  async getLinksFromSource(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLinksToTarget(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkGraph(): Promise<never[]> { this.vaultNotSupported(); }\n  async upsertVaultHealth(): Promise<void> { this.vaultNotSupported(); }\n  async getVaultHealth(): Promise<null> { this.vaultNotSupported(); }\n  async getOrphans(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinks(): Promise<never[]> { this.vaultNotSupported(); }\n  async upsertNameIndex(): Promise<void> { this.vaultNotSupported(); }\n  async replaceNameIndex(): Promise<void> { this.vaultNotSupported(); }\n  async resolveVaultName(): Promise<never[]> { this.vaultNotSupported(); }\n  async searchVaultNameIndex(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilesByPaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilesByPathsAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinksFromPaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getChunksWithEmbeddings(): Promise<never[]> { this.vaultNotSupported(); }\n  async getChunksForPath(): Promise<never[]> { this.vaultNotSupported(); }\n  async searchChunksByText(): Promise<never[]> { this.vaultNotSupported(); }\n  async countVaultFilesWithPrefix(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultFilesAfter(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultLinksWithPrefix(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultLinksAfter(): Promise<number> { this.vaultNotSupported(); }\n  async getDeadLinksWithLineNumbers(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinksWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinksAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getOrphansWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getOrphansAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivity(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivityWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivityAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getAllVaultFilePaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilePathsWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilePathsAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdges(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdgesWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdgesAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultAlias(): Promise<null> { this.vaultNotSupported(); }\n}\n"],"mappings":";;;;AAeA,IAAa,gBAAb,MAAqD;CACnD,AAAS,cAAc;CAEvB,AAAQ;CAER,YAAY,IAAc;AACxB,OAAK,KAAK;;;;;;CAOZ,WAAqB;AACnB,SAAO,KAAK;;;;;;CAOd,cAAwB;AACtB,SAAO,KAAK;;CAOd,MAAM,QAAuB;AAC3B,MAAI;AACF,QAAK,GAAG,OAAO;UACT;;CAKV,MAAM,WAAqC;AAOzC,SAAO;GAAE,OALP,KAAK,GAAG,QAAQ,yCAAyC,CAAC,KAAK,CAC/D;GAIc,QAFd,KAAK,GAAG,QAAQ,0CAA0C,CAAC,KAAK,CAChE;GACsB;;CAO1B,MAAM,YAAY,WAAmB,MAA2C;AAI9E,SAHY,KAAK,GACd,QAAQ,kEAAkE,CAC1E,IAAI,WAAW,KAAK,EACX;;CAGd,MAAM,WAAW,MAA8B;AAC7C,OAAK,GACF,QACC;;;;;;;mCAQD,CACA,IAAI,KAAK,WAAW,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,KAAK;;CAO7F,MAAM,YAAY,WAAmB,MAAiC;AAIpE,SAHa,KAAK,GACf,QAAQ,iEAAiE,CACzE,IAAI,WAAW,KAAK,CACX,KAAK,MAAM,EAAE,GAAG;;CAG9B,MAAM,oBAAoB,WAAmB,MAA6B;EACxE,MAAM,MAAM,MAAM,KAAK,YAAY,WAAW,KAAK;EACnD,MAAM,YAAY,KAAK,GAAG,QAAQ,sCAAsC;EACxE,MAAM,eAAe,KAAK,GAAG,QAC3B,8DACD;AACD,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,MAAM,IACf,WAAU,IAAI,GAAG;AAEnB,gBAAa,IAAI,WAAW,KAAK;IACjC,EAAE;;CAGN,MAAM,aAAa,QAAmC;AACpD,MAAI,OAAO,WAAW,EAAG;EAEzB,MAAM,cAAc,KAAK,GAAG,QAC1B;8CAED;EACD,MAAM,YAAY,KAAK,GAAG,QACxB;wCAED;AAED,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,KAAK,QAAQ;AACtB,gBAAY,IACV,EAAE,IACF,EAAE,WACF,EAAE,QACF,EAAE,MACF,EAAE,MACF,EAAE,WACF,EAAE,SACF,EAAE,MACF,EAAE,MACF,EAAE,UACH;AACD,cAAU,IACR,EAAE,MACF,EAAE,IACF,EAAE,WACF,EAAE,MACF,EAAE,QACF,EAAE,MACF,EAAE,WACF,EAAE,QACH;;IAEH,EAAE;;CAGN,MAAM,sBAAsB,WAAsC;AAIhE,SAHa,KAAK,GACf,QAAQ,+DAA+D,CACvE,IAAI,UAAU,CACL,KAAK,MAAM,EAAE,KAAK;;CAGhC,MAAM,YAAY,WAAmB,OAAgC;AACnE,MAAI,MAAM,WAAW,EAAG;EACxB,MAAM,YAAY,KAAK,GAAG,QAAQ,sCAAsC;EACxE,MAAM,eAAe,KAAK,GAAG,QAC3B,8DACD;EACD,MAAM,aAAa,KAAK,GAAG,QACzB,6DACD;AACD,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,MAAM,KAAK,GACd,QAAQ,iEAAiE,CACzE,IAAI,WAAW,KAAK;AACvB,SAAK,MAAM,EAAE,QAAQ,IACnB,WAAU,IAAI,GAAG;AAEnB,iBAAa,IAAI,WAAW,KAAK;AACjC,eAAW,IAAI,WAAW,KAAK;;IAEjC,EAAE;;CAGN,MAAM,sBAAsB,WAAoB,OAAgG;EAC9I,MAAM,aAAa,CAAC,oBAAoB;EACxC,MAAM,SAA8B,EAAE;AAEtC,MAAI,cAAc,QAAW;AAC3B,cAAW,KAAK,iBAAiB;AACjC,UAAO,KAAK,UAAU;;EAGxB,MAAM,QAAQ,WAAW,WAAW,KAAK,QAAQ;AAsBjD,SAnBa,KAAK,GACf,QAAQ,wDAAwD,MAAM;;;;;;;;;;;;;;;;iBAgB5D,UAAU,SAAY,aAAa,KAAK,CAClD,IAAI,GAAG,QAAQ,GAAI,UAAU,SAAY,CAAC,MAAM,GAAG,EAAE,CAAE;;CAI5D,MAAM,gBAAgB,SAAiB,WAAkC;AACvE,OAAK,GACF,QAAQ,sDAAsD,CAC9D,IAAI,WAAW,QAAQ;;CAO5B,MAAM,cAAc,OAAe,MAA+C;AAChF,SAAO,aAAa,KAAK,IAAI,OAAO,KAAK;;CAG3C,MAAM,eAAe,gBAA8B,MAA+C;AAChG,SAAO,qBAAqB,KAAK,IAAI,gBAAgB,KAAK;;CAO5D,AAAQ,oBAA2B;AACjC,QAAM,IAAI,MAAM,gDAAgD;;CAGlE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,eAA8B;AAAE,OAAK,mBAAmB;;CAC9D,MAAM,sBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,sBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,kBAAmC;AAAE,OAAK,mBAAmB;;CACnE,MAAM,qBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,qBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,yBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,oBAAmC;AAAE,OAAK,mBAAmB;;CACnE,MAAM,iBAAgC;AAAE,OAAK,mBAAmB;;CAChE,MAAM,aAA+B;AAAE,OAAK,mBAAmB;;CAC/D,MAAM,eAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,mBAAkC;AAAE,OAAK,mBAAmB;;CAClE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,4BAA8C;AAAE,OAAK,mBAAmB;;CAC9E,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,0BAA4C;AAAE,OAAK,mBAAmB;;CAC5E,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,4BAA6C;AAAE,OAAK,mBAAmB;;CAC7E,MAAM,uBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,4BAA6C;AAAE,OAAK,mBAAmB;;CAC7E,MAAM,uBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,kBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,+BAAiD;AAAE,OAAK,mBAAmB;;CACjF,MAAM,0BAA4C;AAAE,OAAK,mBAAmB;;CAC5E,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,gBAA+B;AAAE,OAAK,mBAAmB"}
+{"version":3,"file":"sqlite-R0pIbTmj.mjs","names":[],"sources":["../src/storage/sqlite.ts"],"sourcesContent":["/**\n * SQLiteBackend — wraps the existing better-sqlite3 federation.db\n * behind the StorageBackend interface.\n *\n * This is a thin adapter.  The heavy lifting is all in the existing\n * memory/indexer.ts and memory/search.ts code; we just provide a\n * backend-agnostic surface so the daemon and tools can call either\n * SQLite or Postgres transparently.\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport type { StorageBackend, ChunkRow, FileRow, FederationStats } from \"./interface.js\";\nimport type { SearchResult, SearchOptions } from \"../memory/search.js\";\nimport { searchMemory, searchMemorySemantic } from \"../memory/search.js\";\n\nexport class SQLiteBackend implements StorageBackend {\n  readonly backendType = \"sqlite\" as const;\n\n  private db: Database;\n\n  constructor(db: Database) {\n    this.db = db;\n  }\n\n  /**\n   * Expose the raw better-sqlite3 Database handle.\n   * Used by the daemon to pass to indexAll() which still uses the synchronous API directly.\n   */\n  getRawDb(): Database {\n    return this.db;\n  }\n\n  /**\n   * Alias for getRawDb() — used by the dispatcher for operations that require\n   * direct SQLite access (e.g. memory_feedback, touchChunksLastAccessed).\n   */\n  getSqliteDb(): Database {\n    return this.db;\n  }\n\n  // -------------------------------------------------------------------------\n  // Lifecycle\n  // -------------------------------------------------------------------------\n\n  async close(): Promise<void> {\n    try {\n      this.db.close();\n    } catch {\n      // ignore\n    }\n  }\n\n  async getStats(): Promise<FederationStats> {\n    const files = (\n      this.db.prepare(\"SELECT COUNT(*) AS n FROM memory_files\").get() as { n: number }\n    ).n;\n    const chunks = (\n      this.db.prepare(\"SELECT COUNT(*) AS n FROM memory_chunks\").get() as { n: number }\n    ).n;\n    return { files, chunks };\n  }\n\n  // -------------------------------------------------------------------------\n  // File tracking\n  // -------------------------------------------------------------------------\n\n  async getFileHash(projectId: number, path: string): Promise<string | undefined> {\n    const row = this.db\n      .prepare(\"SELECT hash FROM memory_files WHERE project_id = ? AND path = ?\")\n      .get(projectId, path) as { hash: string } | undefined;\n    return row?.hash;\n  }\n\n  async upsertFile(file: FileRow): Promise<void> {\n    this.db\n      .prepare(\n        `INSERT INTO memory_files (project_id, path, source, tier, hash, mtime, size)\n         VALUES (?, ?, ?, ?, ?, ?, ?)\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      )\n      .run(file.projectId, file.path, file.source, file.tier, file.hash, file.mtime, file.size);\n  }\n\n  // -------------------------------------------------------------------------\n  // Chunk management\n  // -------------------------------------------------------------------------\n\n  async getChunkIds(projectId: number, path: string): Promise<string[]> {\n    const rows = this.db\n      .prepare(\"SELECT id FROM memory_chunks WHERE project_id = ? AND path = ?\")\n      .all(projectId, path) as Array<{ id: string }>;\n    return rows.map((r) => r.id);\n  }\n\n  async deleteChunksForFile(projectId: number, path: string): Promise<void> {\n    const ids = await this.getChunkIds(projectId, path);\n    const deleteFts = this.db.prepare(\"DELETE FROM memory_fts WHERE id = ?\");\n    const deleteChunks = this.db.prepare(\n      \"DELETE FROM memory_chunks WHERE project_id = ? AND path = ?\"\n    );\n    this.db.transaction(() => {\n      for (const id of ids) {\n        deleteFts.run(id);\n      }\n      deleteChunks.run(projectId, path);\n    })();\n  }\n\n  async insertChunks(chunks: ChunkRow[]): Promise<void> {\n    if (chunks.length === 0) return;\n\n    const insertChunk = this.db.prepare(\n      `INSERT INTO memory_chunks (id, project_id, source, tier, path, start_line, end_line, hash, text, updated_at)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`\n    );\n    const insertFts = this.db.prepare(\n      `INSERT INTO memory_fts (text, id, project_id, path, source, tier, start_line, end_line)\n       VALUES (?, ?, ?, ?, ?, ?, ?, ?)`\n    );\n\n    this.db.transaction(() => {\n      for (const c of chunks) {\n        insertChunk.run(\n          c.id,\n          c.projectId,\n          c.source,\n          c.tier,\n          c.path,\n          c.startLine,\n          c.endLine,\n          c.hash,\n          c.text,\n          c.updatedAt\n        );\n        insertFts.run(\n          c.text,\n          c.id,\n          c.projectId,\n          c.path,\n          c.source,\n          c.tier,\n          c.startLine,\n          c.endLine\n        );\n      }\n    })();\n  }\n\n  async getDistinctChunkPaths(projectId: number): Promise<string[]> {\n    const rows = this.db\n      .prepare(\"SELECT DISTINCT path FROM memory_chunks WHERE project_id = ?\")\n      .all(projectId) as Array<{ path: string }>;\n    return rows.map((r) => r.path);\n  }\n\n  async deletePaths(projectId: number, paths: string[]): Promise<void> {\n    if (paths.length === 0) return;\n    const deleteFts = this.db.prepare(\"DELETE FROM memory_fts WHERE id = ?\");\n    const deleteChunks = this.db.prepare(\n      \"DELETE FROM memory_chunks WHERE project_id = ? AND path = ?\"\n    );\n    const deleteFile = this.db.prepare(\n      \"DELETE FROM memory_files WHERE project_id = ? AND path = ?\"\n    );\n    this.db.transaction(() => {\n      for (const path of paths) {\n        const ids = this.db\n          .prepare(\"SELECT id FROM memory_chunks WHERE project_id = ? AND path = ?\")\n          .all(projectId, path) as Array<{ id: string }>;\n        for (const { id } of ids) {\n          deleteFts.run(id);\n        }\n        deleteChunks.run(projectId, path);\n        deleteFile.run(projectId, path);\n      }\n    })();\n  }\n\n  async getUnembeddedChunkIds(projectId?: number, limit?: number): Promise<Array<{ id: string; text: string; project_id: number; path: string }>> {\n    const conditions = [\"embedding IS NULL\"];\n    const params: (string | number)[] = [];\n\n    if (projectId !== undefined) {\n      conditions.push(\"project_id = ?\");\n      params.push(projectId);\n    }\n\n    const where = \"WHERE \" + conditions.join(\" AND \");\n    // Prioritize real knowledge notes over PAI session/job-search noise.\n    // CASE expression assigns lower priority numbers to knowledge paths.\n    const rows = this.db\n      .prepare(`SELECT id, text, project_id, path FROM memory_chunks ${where}\n        ORDER BY CASE\n          WHEN path LIKE '🧠 Ideaverse/%' THEN 0\n          WHEN path LIKE 'Z - Zettelkasten/%' THEN 0\n          WHEN path LIKE '💼 Business/%' THEN 0\n          WHEN path LIKE '📆 Meetings/%' THEN 1\n          WHEN path LIKE '💡 Insights/%' THEN 1\n          WHEN path LIKE '👨‍💻 People/%' THEN 1\n          WHEN path LIKE 'University/%' THEN 1\n          WHEN path LIKE 'Copilot/%' THEN 1\n          WHEN path LIKE '🗓️ Daily Notes/%' THEN 2\n          WHEN path LIKE 'PAI/%' THEN 3\n          WHEN path LIKE '09-job-search/%' THEN 4\n          WHEN path LIKE 'seriousletter/%' THEN 4\n          WHEN path LIKE 'Attachments/%' THEN 5\n          ELSE 2\n        END, id${limit !== undefined ? \" LIMIT ?\" : \"\"}`)\n      .all(...params, ...(limit !== undefined ? [limit] : [])) as Array<{ id: string; text: string; project_id: number; path: string }>;\n    return rows;\n  }\n\n  async updateEmbedding(chunkId: string, embedding: Buffer): Promise<void> {\n    this.db\n      .prepare(\"UPDATE memory_chunks SET embedding = ? WHERE id = ?\")\n      .run(embedding, chunkId);\n  }\n\n  // -------------------------------------------------------------------------\n  // Search\n  // -------------------------------------------------------------------------\n\n  async searchKeyword(query: string, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchMemory(this.db, query, opts);\n  }\n\n  async searchSemantic(queryEmbedding: Float32Array, opts?: SearchOptions): Promise<SearchResult[]> {\n    return searchMemorySemantic(this.db, queryEmbedding, opts);\n  }\n\n  // -------------------------------------------------------------------------\n  // Vault operations — not supported on SQLite backend (use Postgres)\n  // -------------------------------------------------------------------------\n\n  private vaultNotSupported(): never {\n    throw new Error(\"Vault operations require the Postgres backend\");\n  }\n\n  async upsertVaultFile(): Promise<void> { this.vaultNotSupported(); }\n  async deleteVaultFile(): Promise<void> { this.vaultNotSupported(); }\n  async getVaultFile(): Promise<null> { this.vaultNotSupported(); }\n  async getVaultFileByInode(): Promise<null> { this.vaultNotSupported(); }\n  async getAllVaultFiles(): Promise<never[]> { this.vaultNotSupported(); }\n  async getRecentVaultFiles(): Promise<never[]> { this.vaultNotSupported(); }\n  async countVaultFiles(): Promise<number> { this.vaultNotSupported(); }\n  async upsertVaultAliases(): Promise<void> { this.vaultNotSupported(); }\n  async deleteVaultAliases(): Promise<void> { this.vaultNotSupported(); }\n  async replaceLinksForSources(): Promise<void> { this.vaultNotSupported(); }\n  async getLinksFromSource(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLinksToTarget(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkGraph(): Promise<never[]> { this.vaultNotSupported(); }\n  async upsertVaultHealth(): Promise<void> { this.vaultNotSupported(); }\n  async getVaultHealth(): Promise<null> { this.vaultNotSupported(); }\n  async getOrphans(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinks(): Promise<never[]> { this.vaultNotSupported(); }\n  async upsertNameIndex(): Promise<void> { this.vaultNotSupported(); }\n  async replaceNameIndex(): Promise<void> { this.vaultNotSupported(); }\n  async resolveVaultName(): Promise<never[]> { this.vaultNotSupported(); }\n  async searchVaultNameIndex(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilesByPaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilesByPathsAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinksFromPaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getChunksWithEmbeddings(): Promise<never[]> { this.vaultNotSupported(); }\n  async getChunksForPath(): Promise<never[]> { this.vaultNotSupported(); }\n  async searchChunksByText(): Promise<never[]> { this.vaultNotSupported(); }\n  async countVaultFilesWithPrefix(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultFilesAfter(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultLinksWithPrefix(): Promise<number> { this.vaultNotSupported(); }\n  async countVaultLinksAfter(): Promise<number> { this.vaultNotSupported(); }\n  async getDeadLinksWithLineNumbers(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinksWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getDeadLinksAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getOrphansWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getOrphansAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivity(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivityWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getLowConnectivityAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getAllVaultFilePaths(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilePathsWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultFilePathsAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdges(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdgesWithPrefix(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultLinkEdgesAfter(): Promise<never[]> { this.vaultNotSupported(); }\n  async getVaultAlias(): Promise<null> { this.vaultNotSupported(); }\n}\n"],"mappings":";;;;AAeA,IAAa,gBAAb,MAAqD;CACnD,AAAS,cAAc;CAEvB,AAAQ;CAER,YAAY,IAAc;AACxB,OAAK,KAAK;;;;;;CAOZ,WAAqB;AACnB,SAAO,KAAK;;;;;;CAOd,cAAwB;AACtB,SAAO,KAAK;;CAOd,MAAM,QAAuB;AAC3B,MAAI;AACF,QAAK,GAAG,OAAO;UACT;;CAKV,MAAM,WAAqC;AAOzC,SAAO;GAAE,OALP,KAAK,GAAG,QAAQ,yCAAyC,CAAC,KAAK,CAC/D;GAIc,QAFd,KAAK,GAAG,QAAQ,0CAA0C,CAAC,KAAK,CAChE;GACsB;;CAO1B,MAAM,YAAY,WAAmB,MAA2C;AAI9E,SAHY,KAAK,GACd,QAAQ,kEAAkE,CAC1E,IAAI,WAAW,KAAK,EACX;;CAGd,MAAM,WAAW,MAA8B;AAC7C,OAAK,GACF,QACC;;;;;;;mCAQD,CACA,IAAI,KAAK,WAAW,KAAK,MAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,KAAK;;CAO7F,MAAM,YAAY,WAAmB,MAAiC;AAIpE,SAHa,KAAK,GACf,QAAQ,iEAAiE,CACzE,IAAI,WAAW,KAAK,CACX,KAAK,MAAM,EAAE,GAAG;;CAG9B,MAAM,oBAAoB,WAAmB,MAA6B;EACxE,MAAM,MAAM,MAAM,KAAK,YAAY,WAAW,KAAK;EACnD,MAAM,YAAY,KAAK,GAAG,QAAQ,sCAAsC;EACxE,MAAM,eAAe,KAAK,GAAG,QAC3B,8DACD;AACD,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,MAAM,IACf,WAAU,IAAI,GAAG;AAEnB,gBAAa,IAAI,WAAW,KAAK;IACjC,EAAE;;CAGN,MAAM,aAAa,QAAmC;AACpD,MAAI,OAAO,WAAW,EAAG;EAEzB,MAAM,cAAc,KAAK,GAAG,QAC1B;8CAED;EACD,MAAM,YAAY,KAAK,GAAG,QACxB;wCAED;AAED,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,KAAK,QAAQ;AACtB,gBAAY,IACV,EAAE,IACF,EAAE,WACF,EAAE,QACF,EAAE,MACF,EAAE,MACF,EAAE,WACF,EAAE,SACF,EAAE,MACF,EAAE,MACF,EAAE,UACH;AACD,cAAU,IACR,EAAE,MACF,EAAE,IACF,EAAE,WACF,EAAE,MACF,EAAE,QACF,EAAE,MACF,EAAE,WACF,EAAE,QACH;;IAEH,EAAE;;CAGN,MAAM,sBAAsB,WAAsC;AAIhE,SAHa,KAAK,GACf,QAAQ,+DAA+D,CACvE,IAAI,UAAU,CACL,KAAK,MAAM,EAAE,KAAK;;CAGhC,MAAM,YAAY,WAAmB,OAAgC;AACnE,MAAI,MAAM,WAAW,EAAG;EACxB,MAAM,YAAY,KAAK,GAAG,QAAQ,sCAAsC;EACxE,MAAM,eAAe,KAAK,GAAG,QAC3B,8DACD;EACD,MAAM,aAAa,KAAK,GAAG,QACzB,6DACD;AACD,OAAK,GAAG,kBAAkB;AACxB,QAAK,MAAM,QAAQ,OAAO;IACxB,MAAM,MAAM,KAAK,GACd,QAAQ,iEAAiE,CACzE,IAAI,WAAW,KAAK;AACvB,SAAK,MAAM,EAAE,QAAQ,IACnB,WAAU,IAAI,GAAG;AAEnB,iBAAa,IAAI,WAAW,KAAK;AACjC,eAAW,IAAI,WAAW,KAAK;;IAEjC,EAAE;;CAGN,MAAM,sBAAsB,WAAoB,OAAgG;EAC9I,MAAM,aAAa,CAAC,oBAAoB;EACxC,MAAM,SAA8B,EAAE;AAEtC,MAAI,cAAc,QAAW;AAC3B,cAAW,KAAK,iBAAiB;AACjC,UAAO,KAAK,UAAU;;EAGxB,MAAM,QAAQ,WAAW,WAAW,KAAK,QAAQ;AAsBjD,SAnBa,KAAK,GACf,QAAQ,wDAAwD,MAAM;;;;;;;;;;;;;;;;iBAgB5D,UAAU,SAAY,aAAa,KAAK,CAClD,IAAI,GAAG,QAAQ,GAAI,UAAU,SAAY,CAAC,MAAM,GAAG,EAAE,CAAE;;CAI5D,MAAM,gBAAgB,SAAiB,WAAkC;AACvE,OAAK,GACF,QAAQ,sDAAsD,CAC9D,IAAI,WAAW,QAAQ;;CAO5B,MAAM,cAAc,OAAe,MAA+C;AAChF,SAAO,aAAa,KAAK,IAAI,OAAO,KAAK;;CAG3C,MAAM,eAAe,gBAA8B,MAA+C;AAChG,SAAO,qBAAqB,KAAK,IAAI,gBAAgB,KAAK;;CAO5D,AAAQ,oBAA2B;AACjC,QAAM,IAAI,MAAM,gDAAgD;;CAGlE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,eAA8B;AAAE,OAAK,mBAAmB;;CAC9D,MAAM,sBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,sBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,kBAAmC;AAAE,OAAK,mBAAmB;;CACnE,MAAM,qBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,qBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,yBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,oBAAmC;AAAE,OAAK,mBAAmB;;CACnE,MAAM,iBAAgC;AAAE,OAAK,mBAAmB;;CAChE,MAAM,aAA+B;AAAE,OAAK,mBAAmB;;CAC/D,MAAM,eAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,kBAAiC;AAAE,OAAK,mBAAmB;;CACjE,MAAM,mBAAkC;AAAE,OAAK,mBAAmB;;CAClE,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,4BAA8C;AAAE,OAAK,mBAAmB;;CAC9E,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,0BAA4C;AAAE,OAAK,mBAAmB;;CAC5E,MAAM,mBAAqC;AAAE,OAAK,mBAAmB;;CACrE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,4BAA6C;AAAE,OAAK,mBAAmB;;CAC7E,MAAM,uBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,4BAA6C;AAAE,OAAK,mBAAmB;;CAC7E,MAAM,uBAAwC;AAAE,OAAK,mBAAmB;;CACxE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,kBAAoC;AAAE,OAAK,mBAAmB;;CACpE,MAAM,qBAAuC;AAAE,OAAK,mBAAmB;;CACvE,MAAM,+BAAiD;AAAE,OAAK,mBAAmB;;CACjF,MAAM,0BAA4C;AAAE,OAAK,mBAAmB;;CAC5E,MAAM,uBAAyC;AAAE,OAAK,mBAAmB;;CACzE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,oBAAsC;AAAE,OAAK,mBAAmB;;CACtE,MAAM,8BAAgD;AAAE,OAAK,mBAAmB;;CAChF,MAAM,yBAA2C;AAAE,OAAK,mBAAmB;;CAC3E,MAAM,gBAA+B;AAAE,OAAK,mBAAmB"}

package/dist/{themes-DICajLf-.mjs → themes-BObEGMWn.mjs}

@@ -145,4 +145,4 @@ async function zettelThemes(backend, opts) {
 
 //#endregion
 export { zettelThemes as t };
-//# sourceMappingURL=themes-DICajLf-.mjs.map
+//# sourceMappingURL=themes-BObEGMWn.mjs.map

package/dist/{themes-DICajLf-.mjs.map → themes-BObEGMWn.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"themes-DICajLf-.mjs","names":[],"sources":["../src/zettelkasten/themes.ts"],"sourcesContent":["import type { StorageBackend } from \"../storage/interface.js\";\nimport { deserializeEmbedding, cosineSimilarity } from \"../memory/embeddings.js\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\nexport interface ThemeOptions {\n  vaultProjectId: number;\n  lookbackDays?: number;\n  minClusterSize?: number;\n  maxThemes?: number;\n  similarityThreshold?: number;\n}\n\nexport interface ThemeCluster {\n  id: number;\n  label: string;\n  notes: Array<{\n    path: string;\n    title: string | null;\n  }>;\n  size: number;\n  folderDiversity: number;\n  avgRecency: number;\n  linkedRatio: number;\n  suggestIndexNote: boolean;\n}\n\nexport interface ThemeResult {\n  themes: ThemeCluster[];\n  totalNotesAnalyzed: number;\n  timeWindow: { from: number; to: number };\n}\n\nconst MAX_CHUNKS = 5000;\n\n// STOP_WORDS imported from utils/stop-words.ts\n\nfunction getTopFolder(vaultPath: string): string {\n  const parts = vaultPath.split(\"/\");\n  return parts.length > 1 ? parts[0] : \"\";\n}\n\nfunction generateLabel(titles: Array<string | null>): string {\n  const wordCounts = new Map<string, number>();\n  for (const title of titles) {\n    if (!title) continue;\n    const words = title\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s]/g, \" \")\n      .split(/\\s+/)\n      .filter((w) => w.length > 2 && !STOP_WORDS.has(w));\n    for (const word of words) {\n      wordCounts.set(word, (wordCounts.get(word) ?? 0) + 1);\n    }\n  }\n  const sorted = [...wordCounts.entries()].sort((a, b) => b[1] - a[1]);\n  return sorted\n    .slice(0, 3)\n    .map(([w]) => w)\n    .join(\" / \");\n}\n\nasync function computeLinkedRatio(backend: StorageBackend, paths: string[]): Promise<number> {\n  if (paths.length < 2) return 0;\n  const totalPairs = (paths.length * (paths.length - 1)) / 2;\n  const pathSet = new Set(paths);\n  let linkedPairs = 0;\n\n  for (const path of paths) {\n    const links = await backend.getLinksFromSource(path);\n    for (const link of links) {\n      if (link.targetPath && pathSet.has(link.targetPath)) {\n        linkedPairs++;\n      }\n    }\n  }\n\n  // Each bidirectional pair might be counted once per direction; divide by 2 to normalize\n  const uniquePairs = linkedPairs / 2;\n  return Math.min(1, uniquePairs / totalPairs);\n}\n\ntype ClusterNode = {\n  paths: string[];\n  titles: Array<string | null>;\n  indexedAts: number[];\n  centroid: Float32Array;\n};\n\nfunction averageEmbeddings(embeddings: Float32Array[]): Float32Array {\n  if (embeddings.length === 0) return new Float32Array(0);\n  const dim = embeddings[0].length;\n  const sum = new Float32Array(dim);\n  for (const vec of embeddings) {\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] / embeddings.length;\n  }\n  return avg;\n}\n\n/**\n * Detect emerging themes in recently-modified notes using agglomerative single-linkage\n * clustering of note-level embeddings.\n */\nexport async function zettelThemes(\n  backend: StorageBackend,\n  opts: ThemeOptions,\n): Promise<ThemeResult> {\n  const lookbackDays = opts.lookbackDays ?? 30;\n  const minClusterSize = opts.minClusterSize ?? 3;\n  const maxThemes = opts.maxThemes ?? 10;\n  const similarityThreshold = opts.similarityThreshold ?? 0.65;\n\n  const now = Date.now();\n  const from = now - lookbackDays * 86400000;\n\n  // Step 1: get recent notes\n  const recentFiles = await backend.getRecentVaultFiles(from);\n  const recentNotes = recentFiles.map(f => ({ vault_path: f.vaultPath, title: f.title, indexed_at: f.indexedAt }));\n\n  // Step 2: get file-level embeddings from memory_chunks\n  const chunkRows = await backend.getChunksWithEmbeddings(opts.vaultProjectId, MAX_CHUNKS);\n\n  const embeddingsByPath = new Map<string, Float32Array[]>();\n  for (const row of chunkRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const arr = embeddingsByPath.get(row.path);\n    if (!arr) {\n      embeddingsByPath.set(row.path, [vec]);\n    } else {\n      arr.push(vec);\n    }\n  }\n\n  const fileEmbeddings = new Map<string, Float32Array>();\n  for (const [path, vecs] of embeddingsByPath) {\n    fileEmbeddings.set(path, averageEmbeddings(vecs));\n  }\n\n  // Step 3: build initial clusters — only include notes that have embeddings\n  const clusters: ClusterNode[] = [];\n  for (const note of recentNotes) {\n    const embedding = fileEmbeddings.get(note.vault_path);\n    if (!embedding) continue;\n    clusters.push({\n      paths: [note.vault_path],\n      titles: [note.title],\n      indexedAts: [note.indexed_at],\n      centroid: embedding,\n    });\n  }\n\n  const totalNotesAnalyzed = clusters.length;\n\n  // Step 4: agglomerative single-linkage clustering\n  // Stop when no two clusters have similarity >= threshold\n  let merged = true;\n  while (merged && clusters.length > 1) {\n    merged = false;\n    let bestSim = similarityThreshold;\n    let bestI = -1;\n    let bestJ = -1;\n\n    for (let i = 0; i < clusters.length; i++) {\n      for (let j = i + 1; j < clusters.length; j++) {\n        const sim = cosineSimilarity(clusters[i].centroid, clusters[j].centroid);\n        if (sim > bestSim) {\n          bestSim = sim;\n          bestI = i;\n          bestJ = j;\n        }\n      }\n    }\n\n    if (bestI === -1) break;\n\n    // Merge cluster j into cluster i\n    const ci = clusters[bestI];\n    const cj = clusters[bestJ];\n    const mergedPaths = [...ci.paths, ...cj.paths];\n    const mergedTitles = [...ci.titles, ...cj.titles];\n    const mergedIndexedAts = [...ci.indexedAts, ...cj.indexedAts];\n\n    // Recompute centroid from averaged embeddings of all member paths\n    const memberEmbeddings: Float32Array[] = [];\n    for (const p of mergedPaths) {\n      const emb = fileEmbeddings.get(p);\n      if (emb) memberEmbeddings.push(emb);\n    }\n\n    clusters[bestI] = {\n      paths: mergedPaths,\n      titles: mergedTitles,\n      indexedAts: mergedIndexedAts,\n      centroid: averageEmbeddings(memberEmbeddings),\n    };\n\n    clusters.splice(bestJ, 1);\n    merged = true;\n  }\n\n  // Step 5: filter and annotate clusters\n  const themes: ThemeCluster[] = [];\n  let clusterIndex = 0;\n\n  for (const cluster of clusters) {\n    if (cluster.paths.length < minClusterSize) continue;\n\n    const label = generateLabel(cluster.titles) || `Theme ${clusterIndex + 1}`;\n    const avgRecency =\n      cluster.indexedAts.reduce((sum, t) => sum + t, 0) / cluster.indexedAts.length;\n\n    const uniqueFolders = new Set(cluster.paths.map(getTopFolder));\n    const folderDiversity = uniqueFolders.size / cluster.paths.length;\n\n    const linkedRatio = await computeLinkedRatio(backend, cluster.paths);\n    const suggestIndexNote = linkedRatio < 0.3 && cluster.paths.length >= 5;\n\n    themes.push({\n      id: clusterIndex++,\n      label,\n      notes: cluster.paths.map((path, idx) => ({\n        path,\n        title: cluster.titles[idx],\n      })),\n      size: cluster.paths.length,\n      folderDiversity,\n      avgRecency,\n      linkedRatio,\n      suggestIndexNote,\n    });\n  }\n\n  // Step 6: rank by size * folderDiversity * recency_ratio\n  themes.sort(\n    (a, b) =>\n      b.size * b.folderDiversity * (b.avgRecency / now) -\n      a.size * a.folderDiversity * (a.avgRecency / now),\n  );\n\n  return {\n    themes: themes.slice(0, maxThemes),\n    totalNotesAnalyzed,\n    timeWindow: { from, to: now },\n  };\n}\n"],"mappings":";;;;AAgCA,MAAM,aAAa;AAInB,SAAS,aAAa,WAA2B;CAC/C,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,QAAO,MAAM,SAAS,IAAI,MAAM,KAAK;;AAGvC,SAAS,cAAc,QAAsC;CAC3D,MAAM,6BAAa,IAAI,KAAqB;AAC5C,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,CAAC,MAAO;EACZ,MAAM,QAAQ,MACX,aAAa,CACb,QAAQ,gBAAgB,IAAI,CAC5B,MAAM,MAAM,CACZ,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;AACpD,OAAK,MAAM,QAAQ,MACjB,YAAW,IAAI,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE;;AAIzD,QADe,CAAC,GAAG,WAAW,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAEjE,MAAM,GAAG,EAAE,CACX,KAAK,CAAC,OAAO,EAAE,CACf,KAAK,MAAM;;AAGhB,eAAe,mBAAmB,SAAyB,OAAkC;AAC3F,KAAI,MAAM,SAAS,EAAG,QAAO;CAC7B,MAAM,aAAc,MAAM,UAAU,MAAM,SAAS,KAAM;CACzD,MAAM,UAAU,IAAI,IAAI,MAAM;CAC9B,IAAI,cAAc;AAElB,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,MAAM,QAAQ,mBAAmB,KAAK;AACpD,OAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,cAAc,QAAQ,IAAI,KAAK,WAAW,CACjD;;CAMN,MAAM,cAAc,cAAc;AAClC,QAAO,KAAK,IAAI,GAAG,cAAc,WAAW;;AAU9C,SAAS,kBAAkB,YAA0C;AACnE,KAAI,WAAW,WAAW,EAAG,QAAO,IAAI,aAAa,EAAE;CACvD,MAAM,MAAM,WAAW,GAAG;CAC1B,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,MAAM,OAAO,WAChB,MAAK,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,WAAW;AAE/B,QAAO;;;;;;AAOT,eAAsB,aACpB,SACA,MACsB;CACtB,MAAM,eAAe,KAAK,gBAAgB;CAC1C,MAAM,iBAAiB,KAAK,kBAAkB;CAC9C,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,sBAAsB,KAAK,uBAAuB;CAExD,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,OAAO,MAAM,eAAe;CAIlC,MAAM,eADc,MAAM,QAAQ,oBAAoB,KAAK,EAC3B,KAAI,OAAM;EAAE,YAAY,EAAE;EAAW,OAAO,EAAE;EAAO,YAAY,EAAE;EAAW,EAAE;CAGhH,MAAM,YAAY,MAAM,QAAQ,wBAAwB,KAAK,gBAAgB,WAAW;CAExF,MAAM,mCAAmB,IAAI,KAA6B;AAC1D,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,MAAM,iBAAiB,IAAI,IAAI,KAAK;AAC1C,MAAI,CAAC,IACH,kBAAiB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;MAErC,KAAI,KAAK,IAAI;;CAIjB,MAAM,iCAAiB,IAAI,KAA2B;AACtD,MAAK,MAAM,CAAC,MAAM,SAAS,iBACzB,gBAAe,IAAI,MAAM,kBAAkB,KAAK,CAAC;CAInD,MAAM,WAA0B,EAAE;AAClC,MAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,YAAY,eAAe,IAAI,KAAK,WAAW;AACrD,MAAI,CAAC,UAAW;AAChB,WAAS,KAAK;GACZ,OAAO,CAAC,KAAK,WAAW;GACxB,QAAQ,CAAC,KAAK,MAAM;GACpB,YAAY,CAAC,KAAK,WAAW;GAC7B,UAAU;GACX,CAAC;;CAGJ,MAAM,qBAAqB,SAAS;CAIpC,IAAI,SAAS;AACb,QAAO,UAAU,SAAS,SAAS,GAAG;AACpC,WAAS;EACT,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,IAAI,QAAQ;AAEZ,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,MAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GAC5C,MAAM,MAAM,iBAAiB,SAAS,GAAG,UAAU,SAAS,GAAG,SAAS;AACxE,OAAI,MAAM,SAAS;AACjB,cAAU;AACV,YAAQ;AACR,YAAQ;;;AAKd,MAAI,UAAU,GAAI;EAGlB,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,SAAS;EACpB,MAAM,cAAc,CAAC,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM;EAC9C,MAAM,eAAe,CAAC,GAAG,GAAG,QAAQ,GAAG,GAAG,OAAO;EACjD,MAAM,mBAAmB,CAAC,GAAG,GAAG,YAAY,GAAG,GAAG,WAAW;EAG7D,MAAM,mBAAmC,EAAE;AAC3C,OAAK,MAAM,KAAK,aAAa;GAC3B,MAAM,MAAM,eAAe,IAAI,EAAE;AACjC,OAAI,IAAK,kBAAiB,KAAK,IAAI;;AAGrC,WAAS,SAAS;GAChB,OAAO;GACP,QAAQ;GACR,YAAY;GACZ,UAAU,kBAAkB,iBAAiB;GAC9C;AAED,WAAS,OAAO,OAAO,EAAE;AACzB,WAAS;;CAIX,MAAM,SAAyB,EAAE;CACjC,IAAI,eAAe;AAEnB,MAAK,MAAM,WAAW,UAAU;AAC9B,MAAI,QAAQ,MAAM,SAAS,eAAgB;EAE3C,MAAM,QAAQ,cAAc,QAAQ,OAAO,IAAI,SAAS,eAAe;EACvE,MAAM,aACJ,QAAQ,WAAW,QAAQ,KAAK,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,WAAW;EAGzE,MAAM,kBADgB,IAAI,IAAI,QAAQ,MAAM,IAAI,aAAa,CAAC,CACxB,OAAO,QAAQ,MAAM;EAE3D,MAAM,cAAc,MAAM,mBAAmB,SAAS,QAAQ,MAAM;EACpE,MAAM,mBAAmB,cAAc,MAAO,QAAQ,MAAM,UAAU;AAEtE,SAAO,KAAK;GACV,IAAI;GACJ;GACA,OAAO,QAAQ,MAAM,KAAK,MAAM,SAAS;IACvC;IACA,OAAO,QAAQ,OAAO;IACvB,EAAE;GACH,MAAM,QAAQ,MAAM;GACpB;GACA;GACA;GACA;GACD,CAAC;;AAIJ,QAAO,MACJ,GAAG,MACF,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,OAC7C,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,KAChD;AAED,QAAO;EACL,QAAQ,OAAO,MAAM,GAAG,UAAU;EAClC;EACA,YAAY;GAAE;GAAM,IAAI;GAAK;EAC9B"}
+{"version":3,"file":"themes-BObEGMWn.mjs","names":[],"sources":["../src/zettelkasten/themes.ts"],"sourcesContent":["import type { StorageBackend } from \"../storage/interface.js\";\nimport { deserializeEmbedding, cosineSimilarity } from \"../memory/embeddings.js\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\nexport interface ThemeOptions {\n  vaultProjectId: number;\n  lookbackDays?: number;\n  minClusterSize?: number;\n  maxThemes?: number;\n  similarityThreshold?: number;\n}\n\nexport interface ThemeCluster {\n  id: number;\n  label: string;\n  notes: Array<{\n    path: string;\n    title: string | null;\n  }>;\n  size: number;\n  folderDiversity: number;\n  avgRecency: number;\n  linkedRatio: number;\n  suggestIndexNote: boolean;\n}\n\nexport interface ThemeResult {\n  themes: ThemeCluster[];\n  totalNotesAnalyzed: number;\n  timeWindow: { from: number; to: number };\n}\n\nconst MAX_CHUNKS = 5000;\n\n// STOP_WORDS imported from utils/stop-words.ts\n\nfunction getTopFolder(vaultPath: string): string {\n  const parts = vaultPath.split(\"/\");\n  return parts.length > 1 ? parts[0] : \"\";\n}\n\nfunction generateLabel(titles: Array<string | null>): string {\n  const wordCounts = new Map<string, number>();\n  for (const title of titles) {\n    if (!title) continue;\n    const words = title\n      .toLowerCase()\n      .replace(/[^a-z0-9\\s]/g, \" \")\n      .split(/\\s+/)\n      .filter((w) => w.length > 2 && !STOP_WORDS.has(w));\n    for (const word of words) {\n      wordCounts.set(word, (wordCounts.get(word) ?? 0) + 1);\n    }\n  }\n  const sorted = [...wordCounts.entries()].sort((a, b) => b[1] - a[1]);\n  return sorted\n    .slice(0, 3)\n    .map(([w]) => w)\n    .join(\" / \");\n}\n\nasync function computeLinkedRatio(backend: StorageBackend, paths: string[]): Promise<number> {\n  if (paths.length < 2) return 0;\n  const totalPairs = (paths.length * (paths.length - 1)) / 2;\n  const pathSet = new Set(paths);\n  let linkedPairs = 0;\n\n  for (const path of paths) {\n    const links = await backend.getLinksFromSource(path);\n    for (const link of links) {\n      if (link.targetPath && pathSet.has(link.targetPath)) {\n        linkedPairs++;\n      }\n    }\n  }\n\n  // Each bidirectional pair might be counted once per direction; divide by 2 to normalize\n  const uniquePairs = linkedPairs / 2;\n  return Math.min(1, uniquePairs / totalPairs);\n}\n\ntype ClusterNode = {\n  paths: string[];\n  titles: Array<string | null>;\n  indexedAts: number[];\n  centroid: Float32Array;\n};\n\nfunction averageEmbeddings(embeddings: Float32Array[]): Float32Array {\n  if (embeddings.length === 0) return new Float32Array(0);\n  const dim = embeddings[0].length;\n  const sum = new Float32Array(dim);\n  for (const vec of embeddings) {\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] / embeddings.length;\n  }\n  return avg;\n}\n\n/**\n * Detect emerging themes in recently-modified notes using agglomerative single-linkage\n * clustering of note-level embeddings.\n */\nexport async function zettelThemes(\n  backend: StorageBackend,\n  opts: ThemeOptions,\n): Promise<ThemeResult> {\n  const lookbackDays = opts.lookbackDays ?? 30;\n  const minClusterSize = opts.minClusterSize ?? 3;\n  const maxThemes = opts.maxThemes ?? 10;\n  const similarityThreshold = opts.similarityThreshold ?? 0.65;\n\n  const now = Date.now();\n  const from = now - lookbackDays * 86400000;\n\n  // Step 1: get recent notes\n  const recentFiles = await backend.getRecentVaultFiles(from);\n  const recentNotes = recentFiles.map(f => ({ vault_path: f.vaultPath, title: f.title, indexed_at: f.indexedAt }));\n\n  // Step 2: get file-level embeddings from memory_chunks\n  const chunkRows = await backend.getChunksWithEmbeddings(opts.vaultProjectId, MAX_CHUNKS);\n\n  const embeddingsByPath = new Map<string, Float32Array[]>();\n  for (const row of chunkRows) {\n    const vec = deserializeEmbedding(row.embedding);\n    const arr = embeddingsByPath.get(row.path);\n    if (!arr) {\n      embeddingsByPath.set(row.path, [vec]);\n    } else {\n      arr.push(vec);\n    }\n  }\n\n  const fileEmbeddings = new Map<string, Float32Array>();\n  for (const [path, vecs] of embeddingsByPath) {\n    fileEmbeddings.set(path, averageEmbeddings(vecs));\n  }\n\n  // Step 3: build initial clusters — only include notes that have embeddings\n  const clusters: ClusterNode[] = [];\n  for (const note of recentNotes) {\n    const embedding = fileEmbeddings.get(note.vault_path);\n    if (!embedding) continue;\n    clusters.push({\n      paths: [note.vault_path],\n      titles: [note.title],\n      indexedAts: [note.indexed_at],\n      centroid: embedding,\n    });\n  }\n\n  const totalNotesAnalyzed = clusters.length;\n\n  // Step 4: agglomerative single-linkage clustering\n  // Stop when no two clusters have similarity >= threshold\n  let merged = true;\n  while (merged && clusters.length > 1) {\n    merged = false;\n    let bestSim = similarityThreshold;\n    let bestI = -1;\n    let bestJ = -1;\n\n    for (let i = 0; i < clusters.length; i++) {\n      for (let j = i + 1; j < clusters.length; j++) {\n        const sim = cosineSimilarity(clusters[i].centroid, clusters[j].centroid);\n        if (sim > bestSim) {\n          bestSim = sim;\n          bestI = i;\n          bestJ = j;\n        }\n      }\n    }\n\n    if (bestI === -1) break;\n\n    // Merge cluster j into cluster i\n    const ci = clusters[bestI];\n    const cj = clusters[bestJ];\n    const mergedPaths = [...ci.paths, ...cj.paths];\n    const mergedTitles = [...ci.titles, ...cj.titles];\n    const mergedIndexedAts = [...ci.indexedAts, ...cj.indexedAts];\n\n    // Recompute centroid from averaged embeddings of all member paths\n    const memberEmbeddings: Float32Array[] = [];\n    for (const p of mergedPaths) {\n      const emb = fileEmbeddings.get(p);\n      if (emb) memberEmbeddings.push(emb);\n    }\n\n    clusters[bestI] = {\n      paths: mergedPaths,\n      titles: mergedTitles,\n      indexedAts: mergedIndexedAts,\n      centroid: averageEmbeddings(memberEmbeddings),\n    };\n\n    clusters.splice(bestJ, 1);\n    merged = true;\n  }\n\n  // Step 5: filter and annotate clusters\n  const themes: ThemeCluster[] = [];\n  let clusterIndex = 0;\n\n  for (const cluster of clusters) {\n    if (cluster.paths.length < minClusterSize) continue;\n\n    const label = generateLabel(cluster.titles) || `Theme ${clusterIndex + 1}`;\n    const avgRecency =\n      cluster.indexedAts.reduce((sum, t) => sum + t, 0) / cluster.indexedAts.length;\n\n    const uniqueFolders = new Set(cluster.paths.map(getTopFolder));\n    const folderDiversity = uniqueFolders.size / cluster.paths.length;\n\n    const linkedRatio = await computeLinkedRatio(backend, cluster.paths);\n    const suggestIndexNote = linkedRatio < 0.3 && cluster.paths.length >= 5;\n\n    themes.push({\n      id: clusterIndex++,\n      label,\n      notes: cluster.paths.map((path, idx) => ({\n        path,\n        title: cluster.titles[idx],\n      })),\n      size: cluster.paths.length,\n      folderDiversity,\n      avgRecency,\n      linkedRatio,\n      suggestIndexNote,\n    });\n  }\n\n  // Step 6: rank by size * folderDiversity * recency_ratio\n  themes.sort(\n    (a, b) =>\n      b.size * b.folderDiversity * (b.avgRecency / now) -\n      a.size * a.folderDiversity * (a.avgRecency / now),\n  );\n\n  return {\n    themes: themes.slice(0, maxThemes),\n    totalNotesAnalyzed,\n    timeWindow: { from, to: now },\n  };\n}\n"],"mappings":";;;;AAgCA,MAAM,aAAa;AAInB,SAAS,aAAa,WAA2B;CAC/C,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,QAAO,MAAM,SAAS,IAAI,MAAM,KAAK;;AAGvC,SAAS,cAAc,QAAsC;CAC3D,MAAM,6BAAa,IAAI,KAAqB;AAC5C,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,CAAC,MAAO;EACZ,MAAM,QAAQ,MACX,aAAa,CACb,QAAQ,gBAAgB,IAAI,CAC5B,MAAM,MAAM,CACZ,QAAQ,MAAM,EAAE,SAAS,KAAK,CAAC,WAAW,IAAI,EAAE,CAAC;AACpD,OAAK,MAAM,QAAQ,MACjB,YAAW,IAAI,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,EAAE;;AAIzD,QADe,CAAC,GAAG,WAAW,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAEjE,MAAM,GAAG,EAAE,CACX,KAAK,CAAC,OAAO,EAAE,CACf,KAAK,MAAM;;AAGhB,eAAe,mBAAmB,SAAyB,OAAkC;AAC3F,KAAI,MAAM,SAAS,EAAG,QAAO;CAC7B,MAAM,aAAc,MAAM,UAAU,MAAM,SAAS,KAAM;CACzD,MAAM,UAAU,IAAI,IAAI,MAAM;CAC9B,IAAI,cAAc;AAElB,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,QAAQ,MAAM,QAAQ,mBAAmB,KAAK;AACpD,OAAK,MAAM,QAAQ,MACjB,KAAI,KAAK,cAAc,QAAQ,IAAI,KAAK,WAAW,CACjD;;CAMN,MAAM,cAAc,cAAc;AAClC,QAAO,KAAK,IAAI,GAAG,cAAc,WAAW;;AAU9C,SAAS,kBAAkB,YAA0C;AACnE,KAAI,WAAW,WAAW,EAAG,QAAO,IAAI,aAAa,EAAE;CACvD,MAAM,MAAM,WAAW,GAAG;CAC1B,MAAM,MAAM,IAAI,aAAa,IAAI;AACjC,MAAK,MAAM,OAAO,WAChB,MAAK,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,WAAW;AAE/B,QAAO;;;;;;AAOT,eAAsB,aACpB,SACA,MACsB;CACtB,MAAM,eAAe,KAAK,gBAAgB;CAC1C,MAAM,iBAAiB,KAAK,kBAAkB;CAC9C,MAAM,YAAY,KAAK,aAAa;CACpC,MAAM,sBAAsB,KAAK,uBAAuB;CAExD,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,OAAO,MAAM,eAAe;CAIlC,MAAM,eADc,MAAM,QAAQ,oBAAoB,KAAK,EAC3B,KAAI,OAAM;EAAE,YAAY,EAAE;EAAW,OAAO,EAAE;EAAO,YAAY,EAAE;EAAW,EAAE;CAGhH,MAAM,YAAY,MAAM,QAAQ,wBAAwB,KAAK,gBAAgB,WAAW;CAExF,MAAM,mCAAmB,IAAI,KAA6B;AAC1D,MAAK,MAAM,OAAO,WAAW;EAC3B,MAAM,MAAM,qBAAqB,IAAI,UAAU;EAC/C,MAAM,MAAM,iBAAiB,IAAI,IAAI,KAAK;AAC1C,MAAI,CAAC,IACH,kBAAiB,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC;MAErC,KAAI,KAAK,IAAI;;CAIjB,MAAM,iCAAiB,IAAI,KAA2B;AACtD,MAAK,MAAM,CAAC,MAAM,SAAS,iBACzB,gBAAe,IAAI,MAAM,kBAAkB,KAAK,CAAC;CAInD,MAAM,WAA0B,EAAE;AAClC,MAAK,MAAM,QAAQ,aAAa;EAC9B,MAAM,YAAY,eAAe,IAAI,KAAK,WAAW;AACrD,MAAI,CAAC,UAAW;AAChB,WAAS,KAAK;GACZ,OAAO,CAAC,KAAK,WAAW;GACxB,QAAQ,CAAC,KAAK,MAAM;GACpB,YAAY,CAAC,KAAK,WAAW;GAC7B,UAAU;GACX,CAAC;;CAGJ,MAAM,qBAAqB,SAAS;CAIpC,IAAI,SAAS;AACb,QAAO,UAAU,SAAS,SAAS,GAAG;AACpC,WAAS;EACT,IAAI,UAAU;EACd,IAAI,QAAQ;EACZ,IAAI,QAAQ;AAEZ,OAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACnC,MAAK,IAAI,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK;GAC5C,MAAM,MAAM,iBAAiB,SAAS,GAAG,UAAU,SAAS,GAAG,SAAS;AACxE,OAAI,MAAM,SAAS;AACjB,cAAU;AACV,YAAQ;AACR,YAAQ;;;AAKd,MAAI,UAAU,GAAI;EAGlB,MAAM,KAAK,SAAS;EACpB,MAAM,KAAK,SAAS;EACpB,MAAM,cAAc,CAAC,GAAG,GAAG,OAAO,GAAG,GAAG,MAAM;EAC9C,MAAM,eAAe,CAAC,GAAG,GAAG,QAAQ,GAAG,GAAG,OAAO;EACjD,MAAM,mBAAmB,CAAC,GAAG,GAAG,YAAY,GAAG,GAAG,WAAW;EAG7D,MAAM,mBAAmC,EAAE;AAC3C,OAAK,MAAM,KAAK,aAAa;GAC3B,MAAM,MAAM,eAAe,IAAI,EAAE;AACjC,OAAI,IAAK,kBAAiB,KAAK,IAAI;;AAGrC,WAAS,SAAS;GAChB,OAAO;GACP,QAAQ;GACR,YAAY;GACZ,UAAU,kBAAkB,iBAAiB;GAC9C;AAED,WAAS,OAAO,OAAO,EAAE;AACzB,WAAS;;CAIX,MAAM,SAAyB,EAAE;CACjC,IAAI,eAAe;AAEnB,MAAK,MAAM,WAAW,UAAU;AAC9B,MAAI,QAAQ,MAAM,SAAS,eAAgB;EAE3C,MAAM,QAAQ,cAAc,QAAQ,OAAO,IAAI,SAAS,eAAe;EACvE,MAAM,aACJ,QAAQ,WAAW,QAAQ,KAAK,MAAM,MAAM,GAAG,EAAE,GAAG,QAAQ,WAAW;EAGzE,MAAM,kBADgB,IAAI,IAAI,QAAQ,MAAM,IAAI,aAAa,CAAC,CACxB,OAAO,QAAQ,MAAM;EAE3D,MAAM,cAAc,MAAM,mBAAmB,SAAS,QAAQ,MAAM;EACpE,MAAM,mBAAmB,cAAc,MAAO,QAAQ,MAAM,UAAU;AAEtE,SAAO,KAAK;GACV,IAAI;GACJ;GACA,OAAO,QAAQ,MAAM,KAAK,MAAM,SAAS;IACvC;IACA,OAAO,QAAQ,OAAO;IACvB,EAAE;GACH,MAAM,QAAQ,MAAM;GACpB;GACA;GACA;GACA;GACD,CAAC;;AAIJ,QAAO,MACJ,GAAG,MACF,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,OAC7C,EAAE,OAAO,EAAE,mBAAmB,EAAE,aAAa,KAChD;AAED,QAAO;EACL,QAAQ,OAAO,MAAM,GAAG,UAAU;EAClC;EACA,YAAY;GAAE;GAAM,IAAI;GAAK;EAC9B"}

package/dist/{tools-B3BP_zjZ.mjs → tools-B5t3lZ7v.mjs}

@@ -137,7 +137,7 @@ async function toolMemorySearch(registryDb, federation, params, searchDefaults)
 			return `${header}\n${raw.length > snippetLength ? raw.slice(0, snippetLength) + "..." : raw}`;
 		}).join(useCompact ? "\n" : "\n\n---\n\n");
 		try {
-			const { saveQueryResult } = await import("./query-feedback-BX5nSyRm.mjs").then((n) => n.t);
+			const { saveQueryResult } = await import("./query-feedback-ytPNVJWt.mjs").then((n) => n.t);
 			saveQueryResult({
 				query: params.query,
 				timestamp: Date.now(),
@@ -662,7 +662,7 @@ function toolSessionList(registryDb, params) {
 */
 async function toolSessionRoute(registryDb, federation, params) {
 	try {
-		const { autoRoute, formatAutoRouteJson } = await import("./auto-route-C8xAfsds.mjs");
+		const { autoRoute, formatAutoRouteJson } = await import("./auto-route-lDk1q_2h.mjs");
 		const result = await autoRoute(registryDb, federation, params.cwd, params.context);
 		if (!result) return { content: [{
 			type: "text",
@@ -726,7 +726,7 @@ function toolRegistrySearch(registryDb, params) {
 //#region src/mcp/tools/zettel.ts
 async function toolZettelExplore(backend, params) {
 	try {
-		const { zettelExplore } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelExplore } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelExplore(backend, {
 			startNote: params.start_note,
 			depth: params.depth,
@@ -749,7 +749,7 @@ async function toolZettelExplore(backend, params) {
 }
 async function toolZettelHealth(backend, params) {
 	try {
-		const { zettelHealth } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelHealth } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelHealth(backend, {
 			scope: params.scope,
 			projectPath: params.project_path,
@@ -772,7 +772,7 @@ async function toolZettelHealth(backend, params) {
 }
 async function toolZettelSurprise(backend, params) {
 	try {
-		const { zettelSurprise } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelSurprise } = await import("./zettelkasten-DePb0LVI.mjs");
 		const results = await zettelSurprise(backend, {
 			referencePath: params.reference_path,
 			vaultProjectId: params.vault_project_id,
@@ -796,7 +796,7 @@ async function toolZettelSurprise(backend, params) {
 }
 async function toolZettelSuggest(backend, params) {
 	try {
-		const { zettelSuggest } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelSuggest } = await import("./zettelkasten-DePb0LVI.mjs");
 		const results = await zettelSuggest(backend, {
 			notePath: params.note_path,
 			vaultProjectId: params.vault_project_id,
@@ -819,7 +819,7 @@ async function toolZettelSuggest(backend, params) {
 }
 async function toolZettelConverse(backend, params) {
 	try {
-		const { zettelConverse } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelConverse } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelConverse(backend, {
 			question: params.question,
 			vaultProjectId: params.vault_project_id,
@@ -827,7 +827,7 @@ async function toolZettelConverse(backend, params) {
 			limit: params.limit
 		});
 		try {
-			const { saveQueryResult } = await import("./query-feedback-BX5nSyRm.mjs").then((n) => n.t);
+			const { saveQueryResult } = await import("./query-feedback-ytPNVJWt.mjs").then((n) => n.t);
 			saveQueryResult({
 				query: params.question,
 				timestamp: Date.now(),
@@ -855,7 +855,7 @@ async function toolZettelConverse(backend, params) {
 }
 async function toolZettelThemes(backend, params) {
 	try {
-		const { zettelThemes } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelThemes } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelThemes(backend, {
 			vaultProjectId: params.vault_project_id,
 			lookbackDays: params.lookback_days,
@@ -879,7 +879,7 @@ async function toolZettelThemes(backend, params) {
 }
 async function toolZettelGodNotes(backend, params) {
 	try {
-		const { zettelGodNotes } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelGodNotes } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelGodNotes(backend, {
 			limit: params.limit,
 			minInbound: params.min_inbound
@@ -900,7 +900,7 @@ async function toolZettelGodNotes(backend, params) {
 }
 async function toolZettelCommunities(backend, params) {
 	try {
-		const { zettelCommunities } = await import("./zettelkasten-C8BikWss.mjs");
+		const { zettelCommunities } = await import("./zettelkasten-DePb0LVI.mjs");
 		const result = await zettelCommunities(backend, {
 			minSize: params.min_size,
 			maxCommunities: params.max_communities,
@@ -1936,4 +1936,4 @@ var tools_exports = /* @__PURE__ */ __exportAll({
 
 //#endregion
 export { toolMemoryWakeup as a, toolSessionRoute as c, toolProjectInfo as d, toolProjectList as f, toolMemorySearch as h, toolMemoryTaxonomy as i, toolProjectDetect as l, toolMemoryGet as m, toolMemoryKgSearch as n, toolRegistrySearch as o, toolProjectTodo as p, toolMemoryFeedback as r, toolSessionList as s, tools_exports as t, toolProjectHealth as u };
-//# sourceMappingURL=tools-B3BP_zjZ.mjs.map
+//# sourceMappingURL=tools-B5t3lZ7v.mjs.map