@tekmidian/pai 0.35.2 → 0.36.1

package/dist/query-feedback-BBMBp96K.mjs

@@ -0,0 +1,3 @@
+import { t as saveQueryResult } from "./query-feedback-C1T6kS18.mjs";
+
+export { saveQueryResult };

package/dist/{query-feedback-D4U56Hz6.mjs → query-feedback-C1T6kS18.mjs}

@@ -1,4 +1,3 @@
-import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
 import { existsSync, mkdirSync, writeFileSync } from "node:fs";
 import { homedir } from "node:os";
 import { join } from "node:path";
@@ -13,7 +12,6 @@ import { join } from "node:path";
 * them into federation.db, creating a self-reinforcing feedback loop: past
 * queries become searchable context for future queries.
 */
-var query_feedback_exports = /* @__PURE__ */ __exportAll({ saveQueryResult: () => saveQueryResult });
 const QUERIES_DIR = join(homedir(), ".config", "pai", "queries");
 /**
 * Ensure the queries directory exists.
@@ -72,5 +70,5 @@ function saveQueryResult(record) {
 }
 
 //#endregion
-export { saveQueryResult as n, query_feedback_exports as t };
-//# sourceMappingURL=query-feedback-D4U56Hz6.mjs.map
+export { saveQueryResult as t };
+//# sourceMappingURL=query-feedback-C1T6kS18.mjs.map

package/dist/{query-feedback-D4U56Hz6.mjs.map → query-feedback-C1T6kS18.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"query-feedback-D4U56Hz6.mjs","names":[],"sources":["../src/zettelkasten/query-feedback.ts"],"sourcesContent":["/**\n * Query feedback loop — persist search queries and results as markdown files.\n *\n * When memory_search or zettel_converse returns results, the query + result\n * metadata is saved to ~/.config/pai/queries/ as a markdown file with YAML\n * frontmatter. The daemon indexer picks these up on the next cycle and indexes\n * them into federation.db, creating a self-reinforcing feedback loop: past\n * queries become searchable context for future queries.\n */\n\nimport { existsSync, mkdirSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { homedir } from \"node:os\";\n\nexport interface QueryRecord {\n  /** The original query string. */\n  query: string;\n  /** Timestamp of the query. */\n  timestamp: number;\n  /** Tool that produced the result: 'memory_search' | 'zettel_converse'. */\n  source: string;\n  /** Slugs of the top result paths (for linking back). */\n  sourceSlugs: string[];\n  /** Preview of the answer/result (first 500 chars). */\n  answerPreview: string;\n  /** Number of results returned. */\n  resultCount: number;\n}\n\nconst QUERIES_DIR = join(homedir(), \".config\", \"pai\", \"queries\");\n\n/**\n * Ensure the queries directory exists.\n */\nfunction ensureQueriesDir(): void {\n  if (!existsSync(QUERIES_DIR)) {\n    mkdirSync(QUERIES_DIR, { recursive: true });\n  }\n}\n\n/**\n * Generate a filename-safe slug from a query string.\n */\nfunction querySlug(query: string, timestamp: number): string {\n  const slug = query\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s]/g, \"\")\n    .replace(/\\s+/g, \"-\")\n    .slice(0, 60);\n  const ts = new Date(timestamp).toISOString().slice(0, 10);\n  const shortHash = timestamp.toString(36).slice(-4);\n  return `${ts}-${slug}-${shortHash}`;\n}\n\n/**\n * Save a query + result record as a markdown file with YAML frontmatter.\n *\n * The file is written to ~/.config/pai/queries/ and will be picked up by\n * the daemon indexer on the next cycle.\n */\nexport function saveQueryResult(record: QueryRecord): string | null {\n  try {\n    ensureQueriesDir();\n\n    const filename = querySlug(record.query, record.timestamp) + \".md\";\n    const filepath = join(QUERIES_DIR, filename);\n\n    // Don't overwrite if the exact file already exists\n    if (existsSync(filepath)) return filepath;\n\n    const frontmatter = [\n      \"---\",\n      `query: \"${record.query.replace(/\"/g, '\\\\\"')}\"`,\n      `timestamp: ${new Date(record.timestamp).toISOString()}`,\n      `source: ${record.source}`,\n      `result_count: ${record.resultCount}`,\n      `source_slugs:`,\n      ...record.sourceSlugs.map((s) => `  - \"${s}\"`),\n      \"---\",\n    ].join(\"\\n\");\n\n    const body = [\n      \"\",\n      `# Query: ${record.query}`,\n      \"\",\n      `**Source:** ${record.source}  `,\n      `**Date:** ${new Date(record.timestamp).toISOString().slice(0, 19).replace(\"T\", \" \")}  `,\n      `**Results:** ${record.resultCount}`,\n      \"\",\n      \"## Answer Preview\",\n      \"\",\n      record.answerPreview,\n      \"\",\n      \"## Source Paths\",\n      \"\",\n      ...record.sourceSlugs.map((s) => `- \\`${s}\\``),\n      \"\",\n    ].join(\"\\n\");\n\n    writeFileSync(filepath, frontmatter + body, \"utf8\");\n    return filepath;\n  } catch {\n    // Non-critical — don't crash the parent tool if query logging fails\n    return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AA6BA,MAAM,cAAc,KAAK,SAAS,EAAE,WAAW,OAAO,UAAU;;;;AAKhE,SAAS,mBAAyB;AAChC,KAAI,CAAC,WAAW,YAAY,CAC1B,WAAU,aAAa,EAAE,WAAW,MAAM,CAAC;;;;;AAO/C,SAAS,UAAU,OAAe,WAA2B;CAC3D,MAAM,OAAO,MACV,aAAa,CACb,QAAQ,gBAAgB,GAAG,CAC3B,QAAQ,QAAQ,IAAI,CACpB,MAAM,GAAG,GAAG;AAGf,QAAO,GAFI,IAAI,KAAK,UAAU,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAE5C,GAAG,KAAK,GADH,UAAU,SAAS,GAAG,CAAC,MAAM,GAAG;;;;;;;;AAUpD,SAAgB,gBAAgB,QAAoC;AAClE,KAAI;AACF,oBAAkB;EAGlB,MAAM,WAAW,KAAK,aADL,UAAU,OAAO,OAAO,OAAO,UAAU,GAAG,MACjB;AAG5C,MAAI,WAAW,SAAS,CAAE,QAAO;AA+BjC,gBAAc,UA7BM;GAClB;GACA,WAAW,OAAO,MAAM,QAAQ,MAAM,OAAM,CAAC;GAC7C,cAAc,IAAI,KAAK,OAAO,UAAU,CAAC,aAAa;GACtD,WAAW,OAAO;GAClB,iBAAiB,OAAO;GACxB;GACA,GAAG,OAAO,YAAY,KAAK,MAAM,QAAQ,EAAE,GAAG;GAC9C;GACD,CAAC,KAAK,KAAK,GAEC;GACX;GACA,YAAY,OAAO;GACnB;GACA,eAAe,OAAO,OAAO;GAC7B,aAAa,IAAI,KAAK,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAAC,QAAQ,KAAK,IAAI,CAAC;GACrF,gBAAgB,OAAO;GACvB;GACA;GACA;GACA,OAAO;GACP;GACA;GACA;GACA,GAAG,OAAO,YAAY,KAAK,MAAM,OAAO,EAAE,IAAI;GAC9C;GACD,CAAC,KAAK,KAAK,EAEgC,OAAO;AACnD,SAAO;SACD;AAEN,SAAO"}
+{"version":3,"file":"query-feedback-C1T6kS18.mjs","names":[],"sources":["../src/zettelkasten/query-feedback.ts"],"sourcesContent":["/**\n * Query feedback loop — persist search queries and results as markdown files.\n *\n * When memory_search or zettel_converse returns results, the query + result\n * metadata is saved to ~/.config/pai/queries/ as a markdown file with YAML\n * frontmatter. The daemon indexer picks these up on the next cycle and indexes\n * them into federation.db, creating a self-reinforcing feedback loop: past\n * queries become searchable context for future queries.\n */\n\nimport { existsSync, mkdirSync, writeFileSync } from \"node:fs\";\nimport { join } from \"node:path\";\nimport { homedir } from \"node:os\";\n\nexport interface QueryRecord {\n  /** The original query string. */\n  query: string;\n  /** Timestamp of the query. */\n  timestamp: number;\n  /** Tool that produced the result: 'memory_search' | 'zettel_converse'. */\n  source: string;\n  /** Slugs of the top result paths (for linking back). */\n  sourceSlugs: string[];\n  /** Preview of the answer/result (first 500 chars). */\n  answerPreview: string;\n  /** Number of results returned. */\n  resultCount: number;\n}\n\nconst QUERIES_DIR = join(homedir(), \".config\", \"pai\", \"queries\");\n\n/**\n * Ensure the queries directory exists.\n */\nfunction ensureQueriesDir(): void {\n  if (!existsSync(QUERIES_DIR)) {\n    mkdirSync(QUERIES_DIR, { recursive: true });\n  }\n}\n\n/**\n * Generate a filename-safe slug from a query string.\n */\nfunction querySlug(query: string, timestamp: number): string {\n  const slug = query\n    .toLowerCase()\n    .replace(/[^a-z0-9\\s]/g, \"\")\n    .replace(/\\s+/g, \"-\")\n    .slice(0, 60);\n  const ts = new Date(timestamp).toISOString().slice(0, 10);\n  const shortHash = timestamp.toString(36).slice(-4);\n  return `${ts}-${slug}-${shortHash}`;\n}\n\n/**\n * Save a query + result record as a markdown file with YAML frontmatter.\n *\n * The file is written to ~/.config/pai/queries/ and will be picked up by\n * the daemon indexer on the next cycle.\n */\nexport function saveQueryResult(record: QueryRecord): string | null {\n  try {\n    ensureQueriesDir();\n\n    const filename = querySlug(record.query, record.timestamp) + \".md\";\n    const filepath = join(QUERIES_DIR, filename);\n\n    // Don't overwrite if the exact file already exists\n    if (existsSync(filepath)) return filepath;\n\n    const frontmatter = [\n      \"---\",\n      `query: \"${record.query.replace(/\"/g, '\\\\\"')}\"`,\n      `timestamp: ${new Date(record.timestamp).toISOString()}`,\n      `source: ${record.source}`,\n      `result_count: ${record.resultCount}`,\n      `source_slugs:`,\n      ...record.sourceSlugs.map((s) => `  - \"${s}\"`),\n      \"---\",\n    ].join(\"\\n\");\n\n    const body = [\n      \"\",\n      `# Query: ${record.query}`,\n      \"\",\n      `**Source:** ${record.source}  `,\n      `**Date:** ${new Date(record.timestamp).toISOString().slice(0, 19).replace(\"T\", \" \")}  `,\n      `**Results:** ${record.resultCount}`,\n      \"\",\n      \"## Answer Preview\",\n      \"\",\n      record.answerPreview,\n      \"\",\n      \"## Source Paths\",\n      \"\",\n      ...record.sourceSlugs.map((s) => `- \\`${s}\\``),\n      \"\",\n    ].join(\"\\n\");\n\n    writeFileSync(filepath, frontmatter + body, \"utf8\");\n    return filepath;\n  } catch {\n    // Non-critical — don't crash the parent tool if query logging fails\n    return null;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA6BA,MAAM,cAAc,KAAK,SAAS,EAAE,WAAW,OAAO,UAAU;;;;AAKhE,SAAS,mBAAyB;AAChC,KAAI,CAAC,WAAW,YAAY,CAC1B,WAAU,aAAa,EAAE,WAAW,MAAM,CAAC;;;;;AAO/C,SAAS,UAAU,OAAe,WAA2B;CAC3D,MAAM,OAAO,MACV,aAAa,CACb,QAAQ,gBAAgB,GAAG,CAC3B,QAAQ,QAAQ,IAAI,CACpB,MAAM,GAAG,GAAG;AAGf,QAAO,GAFI,IAAI,KAAK,UAAU,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAE5C,GAAG,KAAK,GADH,UAAU,SAAS,GAAG,CAAC,MAAM,GAAG;;;;;;;;AAUpD,SAAgB,gBAAgB,QAAoC;AAClE,KAAI;AACF,oBAAkB;EAGlB,MAAM,WAAW,KAAK,aADL,UAAU,OAAO,OAAO,OAAO,UAAU,GAAG,MACjB;AAG5C,MAAI,WAAW,SAAS,CAAE,QAAO;AA+BjC,gBAAc,UA7BM;GAClB;GACA,WAAW,OAAO,MAAM,QAAQ,MAAM,OAAM,CAAC;GAC7C,cAAc,IAAI,KAAK,OAAO,UAAU,CAAC,aAAa;GACtD,WAAW,OAAO;GAClB,iBAAiB,OAAO;GACxB;GACA,GAAG,OAAO,YAAY,KAAK,MAAM,QAAQ,EAAE,GAAG;GAC9C;GACD,CAAC,KAAK,KAAK,GAEC;GACX;GACA,YAAY,OAAO;GACnB;GACA,eAAe,OAAO,OAAO;GAC7B,aAAa,IAAI,KAAK,OAAO,UAAU,CAAC,aAAa,CAAC,MAAM,GAAG,GAAG,CAAC,QAAQ,KAAK,IAAI,CAAC;GACrF,gBAAgB,OAAO;GACvB;GACA;GACA;GACA,OAAO;GACP;GACA;GACA;GACA,GAAG,OAAO,YAAY,KAAK,MAAM,OAAO,EAAE,IAAI;GAC9C;GACD,CAAC,KAAK,KAAK,EAEgC,OAAO;AACnD,SAAO;SACD;AAEN,SAAO"}

package/dist/reranker-CwTCNsgA.mjs

@@ -0,0 +1,3 @@
+import { n as rerankResults, t as configureRerankerModel } from "./reranker-xPm04PXx.mjs";
+
+export { rerankResults };

package/dist/{reranker-CMNZcfVx.mjs → reranker-xPm04PXx.mjs}

@@ -1,10 +1,4 @@
-import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
-
 //#region src/memory/reranker.ts
-var reranker_exports = /* @__PURE__ */ __exportAll({
-	configureRerankerModel: () => configureRerankerModel,
-	rerankResults: () => rerankResults
-});
 const DEFAULT_RERANKER_MODEL = "Xenova/ms-marco-MiniLM-L-6-v2";
 let _tokenizer = null;
 let _model = null;
@@ -67,5 +61,5 @@ async function rerankResults(query, results, opts) {
 }
 
 //#endregion
-export { rerankResults as n, reranker_exports as r, configureRerankerModel as t };
-//# sourceMappingURL=reranker-CMNZcfVx.mjs.map
+export { rerankResults as n, configureRerankerModel as t };
+//# sourceMappingURL=reranker-xPm04PXx.mjs.map

package/dist/{reranker-CMNZcfVx.mjs.map → reranker-xPm04PXx.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"reranker-CMNZcfVx.mjs","names":[],"sources":["../src/memory/reranker.ts"],"sourcesContent":["/**\n * Cross-encoder reranker for PAI memory search results.\n *\n * Uses Xenova/ms-marco-MiniLM-L-6-v2 — a 22.7M param cross-encoder trained on\n * MS MARCO passage ranking.  The q8 quantized ONNX model is ~23 MB.\n *\n * Cross-encoders score (query, document) pairs jointly, producing more accurate\n * relevance scores than bi-encoder cosine similarity alone.  The trade-off is\n * latency: cross-encoders must score each pair independently, so they are used\n * as a reranking step on top of a fast first-stage retriever (BM25 / cosine).\n *\n * The model is loaded as a lazy singleton — no startup cost until the first\n * rerank call.  Subsequent calls reuse the loaded model.\n *\n * Inspired by QMD's Qwen3-reranker step (tobi/qmd).\n */\n\nimport type { SearchResult } from \"./search.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst DEFAULT_RERANKER_MODEL = \"Xenova/ms-marco-MiniLM-L-6-v2\";\n\n// ---------------------------------------------------------------------------\n// Lazy singleton\n// ---------------------------------------------------------------------------\n\nlet _tokenizer: any = null;\nlet _model: any = null;\nlet _currentModel: string | null = null;\nlet _loading: Promise<void> | null = null;\n\n/**\n * Configure the reranker model.\n * Must be called before the first rerank() call if you want a non-default model.\n */\nexport function configureRerankerModel(model?: string): void {\n  const resolved = model?.trim() || DEFAULT_RERANKER_MODEL;\n  if (_currentModel !== null && _currentModel !== resolved) {\n    _tokenizer = null;\n    _model = null;\n    _loading = null;\n  }\n  _currentModel = resolved;\n}\n\nasync function ensureLoaded(): Promise<void> {\n  if (_tokenizer && _model) return;\n  if (_loading) return _loading;\n\n  _loading = (async () => {\n    const model = _currentModel ?? DEFAULT_RERANKER_MODEL;\n    const {\n      AutoTokenizer,\n      AutoModelForSequenceClassification,\n    } = await import(\"@huggingface/transformers\");\n\n    _tokenizer = await AutoTokenizer.from_pretrained(model);\n    _model = await AutoModelForSequenceClassification.from_pretrained(\n      model,\n      { dtype: \"q8\" },\n    );\n    _currentModel = model;\n  })();\n\n  return _loading;\n}\n\n// ---------------------------------------------------------------------------\n// Reranking\n// ---------------------------------------------------------------------------\n\nexport interface RerankOptions {\n  /** Maximum number of results to return after reranking. */\n  topK?: number;\n  /**\n   * Maximum number of candidates to rerank.\n   * Cross-encoders are O(n) per candidate, so we cap to keep latency\n   * reasonable.  Default: 50.\n   */\n  maxCandidates?: number;\n}\n\n/**\n * Rerank search results using a cross-encoder model.\n *\n * Takes the top `maxCandidates` results from a first-stage retriever,\n * scores each (query, snippet) pair through the cross-encoder, and\n * returns them sorted by cross-encoder relevance score.\n *\n * The original retrieval score is replaced with the cross-encoder score.\n */\nexport async function rerankResults(\n  query: string,\n  results: SearchResult[],\n  opts?: RerankOptions,\n): Promise<SearchResult[]> {\n  if (results.length === 0) return [];\n\n  const maxCandidates = opts?.maxCandidates ?? 50;\n  const topK = opts?.topK ?? results.length;\n\n  // Cap candidates to rerank\n  const candidates = results.slice(0, maxCandidates);\n\n  await ensureLoaded();\n\n  // Tokenize all (query, document) pairs in a single batch\n  const queries = new Array(candidates.length).fill(query);\n  const documents = candidates.map((r) => r.snippet);\n\n  const inputs = _tokenizer!(queries, {\n    text_pair: documents,\n    padding: true,\n    truncation: true,\n  });\n\n  // Run the cross-encoder\n  const output = await _model!(inputs);\n  const logits = output.logits;\n\n  // ms-marco-MiniLM returns raw logits (not sigmoid-normalized).\n  // Higher = more relevant.\n  const scores: number[][] = logits.tolist();\n\n  // Build reranked results\n  const scored = candidates.map((result, i) => ({\n    ...result,\n    score: scores[i][0],\n  }));\n\n  // Sort by cross-encoder score descending\n  scored.sort((a, b) => b.score - a.score);\n\n  return scored.slice(0, topK);\n}\n"],"mappings":";;;;;;;AAuBA,MAAM,yBAAyB;AAM/B,IAAI,aAAkB;AACtB,IAAI,SAAc;AAClB,IAAI,gBAA+B;AACnC,IAAI,WAAiC;;;;;AAMrC,SAAgB,uBAAuB,OAAsB;CAC3D,MAAM,WAAW,OAAO,MAAM,IAAI;AAClC,KAAI,kBAAkB,QAAQ,kBAAkB,UAAU;AACxD,eAAa;AACb,WAAS;AACT,aAAW;;AAEb,iBAAgB;;AAGlB,eAAe,eAA8B;AAC3C,KAAI,cAAc,OAAQ;AAC1B,KAAI,SAAU,QAAO;AAErB,aAAY,YAAY;EACtB,MAAM,QAAQ,iBAAiB;EAC/B,MAAM,EACJ,eACA,uCACE,MAAM,OAAO;AAEjB,eAAa,MAAM,cAAc,gBAAgB,MAAM;AACvD,WAAS,MAAM,mCAAmC,gBAChD,OACA,EAAE,OAAO,MAAM,CAChB;AACD,kBAAgB;KACd;AAEJ,QAAO;;;;;;;;;;;AA2BT,eAAsB,cACpB,OACA,SACA,MACyB;AACzB,KAAI,QAAQ,WAAW,EAAG,QAAO,EAAE;CAEnC,MAAM,gBAAgB,MAAM,iBAAiB;CAC7C,MAAM,OAAO,MAAM,QAAQ,QAAQ;CAGnC,MAAM,aAAa,QAAQ,MAAM,GAAG,cAAc;AAElD,OAAM,cAAc;CAGpB,MAAM,UAAU,IAAI,MAAM,WAAW,OAAO,CAAC,KAAK,MAAM;CACxD,MAAM,YAAY,WAAW,KAAK,MAAM,EAAE,QAAQ;CAElD,MAAM,SAAS,WAAY,SAAS;EAClC,WAAW;EACX,SAAS;EACT,YAAY;EACb,CAAC;CAQF,MAAM,UALS,MAAM,OAAQ,OAAO,EACd,OAIY,QAAQ;CAG1C,MAAM,SAAS,WAAW,KAAK,QAAQ,OAAO;EAC5C,GAAG;EACH,OAAO,OAAO,GAAG;EAClB,EAAE;AAGH,QAAO,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AAExC,QAAO,OAAO,MAAM,GAAG,KAAK"}
+{"version":3,"file":"reranker-xPm04PXx.mjs","names":[],"sources":["../src/memory/reranker.ts"],"sourcesContent":["/**\n * Cross-encoder reranker for PAI memory search results.\n *\n * Uses Xenova/ms-marco-MiniLM-L-6-v2 — a 22.7M param cross-encoder trained on\n * MS MARCO passage ranking.  The q8 quantized ONNX model is ~23 MB.\n *\n * Cross-encoders score (query, document) pairs jointly, producing more accurate\n * relevance scores than bi-encoder cosine similarity alone.  The trade-off is\n * latency: cross-encoders must score each pair independently, so they are used\n * as a reranking step on top of a fast first-stage retriever (BM25 / cosine).\n *\n * The model is loaded as a lazy singleton — no startup cost until the first\n * rerank call.  Subsequent calls reuse the loaded model.\n *\n * Inspired by QMD's Qwen3-reranker step (tobi/qmd).\n */\n\nimport type { SearchResult } from \"./search.js\";\n\n// ---------------------------------------------------------------------------\n// Constants\n// ---------------------------------------------------------------------------\n\nconst DEFAULT_RERANKER_MODEL = \"Xenova/ms-marco-MiniLM-L-6-v2\";\n\n// ---------------------------------------------------------------------------\n// Lazy singleton\n// ---------------------------------------------------------------------------\n\nlet _tokenizer: any = null;\nlet _model: any = null;\nlet _currentModel: string | null = null;\nlet _loading: Promise<void> | null = null;\n\n/**\n * Configure the reranker model.\n * Must be called before the first rerank() call if you want a non-default model.\n */\nexport function configureRerankerModel(model?: string): void {\n  const resolved = model?.trim() || DEFAULT_RERANKER_MODEL;\n  if (_currentModel !== null && _currentModel !== resolved) {\n    _tokenizer = null;\n    _model = null;\n    _loading = null;\n  }\n  _currentModel = resolved;\n}\n\nasync function ensureLoaded(): Promise<void> {\n  if (_tokenizer && _model) return;\n  if (_loading) return _loading;\n\n  _loading = (async () => {\n    const model = _currentModel ?? DEFAULT_RERANKER_MODEL;\n    const {\n      AutoTokenizer,\n      AutoModelForSequenceClassification,\n    } = await import(\"@huggingface/transformers\");\n\n    _tokenizer = await AutoTokenizer.from_pretrained(model);\n    _model = await AutoModelForSequenceClassification.from_pretrained(\n      model,\n      { dtype: \"q8\" },\n    );\n    _currentModel = model;\n  })();\n\n  return _loading;\n}\n\n// ---------------------------------------------------------------------------\n// Reranking\n// ---------------------------------------------------------------------------\n\nexport interface RerankOptions {\n  /** Maximum number of results to return after reranking. */\n  topK?: number;\n  /**\n   * Maximum number of candidates to rerank.\n   * Cross-encoders are O(n) per candidate, so we cap to keep latency\n   * reasonable.  Default: 50.\n   */\n  maxCandidates?: number;\n}\n\n/**\n * Rerank search results using a cross-encoder model.\n *\n * Takes the top `maxCandidates` results from a first-stage retriever,\n * scores each (query, snippet) pair through the cross-encoder, and\n * returns them sorted by cross-encoder relevance score.\n *\n * The original retrieval score is replaced with the cross-encoder score.\n */\nexport async function rerankResults(\n  query: string,\n  results: SearchResult[],\n  opts?: RerankOptions,\n): Promise<SearchResult[]> {\n  if (results.length === 0) return [];\n\n  const maxCandidates = opts?.maxCandidates ?? 50;\n  const topK = opts?.topK ?? results.length;\n\n  // Cap candidates to rerank\n  const candidates = results.slice(0, maxCandidates);\n\n  await ensureLoaded();\n\n  // Tokenize all (query, document) pairs in a single batch\n  const queries = new Array(candidates.length).fill(query);\n  const documents = candidates.map((r) => r.snippet);\n\n  const inputs = _tokenizer!(queries, {\n    text_pair: documents,\n    padding: true,\n    truncation: true,\n  });\n\n  // Run the cross-encoder\n  const output = await _model!(inputs);\n  const logits = output.logits;\n\n  // ms-marco-MiniLM returns raw logits (not sigmoid-normalized).\n  // Higher = more relevant.\n  const scores: number[][] = logits.tolist();\n\n  // Build reranked results\n  const scored = candidates.map((result, i) => ({\n    ...result,\n    score: scores[i][0],\n  }));\n\n  // Sort by cross-encoder score descending\n  scored.sort((a, b) => b.score - a.score);\n\n  return scored.slice(0, topK);\n}\n"],"mappings":";AAuBA,MAAM,yBAAyB;AAM/B,IAAI,aAAkB;AACtB,IAAI,SAAc;AAClB,IAAI,gBAA+B;AACnC,IAAI,WAAiC;;;;;AAMrC,SAAgB,uBAAuB,OAAsB;CAC3D,MAAM,WAAW,OAAO,MAAM,IAAI;AAClC,KAAI,kBAAkB,QAAQ,kBAAkB,UAAU;AACxD,eAAa;AACb,WAAS;AACT,aAAW;;AAEb,iBAAgB;;AAGlB,eAAe,eAA8B;AAC3C,KAAI,cAAc,OAAQ;AAC1B,KAAI,SAAU,QAAO;AAErB,aAAY,YAAY;EACtB,MAAM,QAAQ,iBAAiB;EAC/B,MAAM,EACJ,eACA,uCACE,MAAM,OAAO;AAEjB,eAAa,MAAM,cAAc,gBAAgB,MAAM;AACvD,WAAS,MAAM,mCAAmC,gBAChD,OACA,EAAE,OAAO,MAAM,CAChB;AACD,kBAAgB;KACd;AAEJ,QAAO;;;;;;;;;;;AA2BT,eAAsB,cACpB,OACA,SACA,MACyB;AACzB,KAAI,QAAQ,WAAW,EAAG,QAAO,EAAE;CAEnC,MAAM,gBAAgB,MAAM,iBAAiB;CAC7C,MAAM,OAAO,MAAM,QAAQ,QAAQ;CAGnC,MAAM,aAAa,QAAQ,MAAM,GAAG,cAAc;AAElD,OAAM,cAAc;CAGpB,MAAM,UAAU,IAAI,MAAM,WAAW,OAAO,CAAC,KAAK,MAAM;CACxD,MAAM,YAAY,WAAW,KAAK,MAAM,EAAE,QAAQ;CAElD,MAAM,SAAS,WAAY,SAAS;EAClC,WAAW;EACX,SAAS;EACT,YAAY;EACb,CAAC;CAQF,MAAM,UALS,MAAM,OAAQ,OAAO,EACd,OAIY,QAAQ;CAG1C,MAAM,SAAS,WAAW,KAAK,QAAQ,OAAO;EAC5C,GAAG;EACH,OAAO,OAAO,GAAG;EAClB,EAAE;AAGH,QAAO,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM;AAExC,QAAO,OAAO,MAAM,GAAG,KAAK"}

package/dist/router-BMkOb62X.mjs

@@ -0,0 +1,3 @@
+import { t as routeNotification } from "./router-CsDm7HvK.mjs";
+
+export { routeNotification };

package/dist/{router-i9S19Usg.mjs → router-CsDm7HvK.mjs}

@@ -1,4 +1,3 @@
-import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
 import { randomUUID } from "node:crypto";
 import { connect } from "node:net";
 import { spawn } from "node:child_process";
@@ -164,7 +163,6 @@ var CliProvider = class {
 
 //#endregion
 //#region src/notifications/router.ts
-var router_exports = /* @__PURE__ */ __exportAll({ routeNotification: () => routeNotification });
 const PROVIDERS = {
 	ntfy: new NtfyProvider(),
 	whatsapp: new WhatsAppProvider(),
@@ -247,5 +245,5 @@ async function routeNotification(payload, config) {
 }
 
 //#endregion
-export { router_exports as n, routeNotification as t };
-//# sourceMappingURL=router-i9S19Usg.mjs.map
+export { routeNotification as t };
+//# sourceMappingURL=router-CsDm7HvK.mjs.map

package/dist/{router-i9S19Usg.mjs.map → router-CsDm7HvK.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"router-i9S19Usg.mjs","names":[],"sources":["../src/notifications/providers/ntfy.ts","../src/notifications/providers/whatsapp.ts","../src/notifications/providers/macos.ts","../src/notifications/providers/cli.ts","../src/notifications/router.ts"],"sourcesContent":["/**\n * ntfy.ts — ntfy.sh notification provider\n *\n * Sends notifications to a configured ntfy.sh topic via HTTP.\n */\n\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class NtfyProvider implements NotificationProvider {\n  readonly channelId = \"ntfy\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.ntfy;\n    if (!cfg.enabled || !cfg.url) return false;\n\n    try {\n      const headers: Record<string, string> = {\n        \"Content-Type\": \"text/plain; charset=utf-8\",\n      };\n\n      if (payload.title) {\n        headers[\"Title\"] = payload.title;\n      }\n\n      if (cfg.priority && cfg.priority !== \"default\") {\n        headers[\"Priority\"] = cfg.priority;\n      }\n\n      const response = await fetch(cfg.url, {\n        method: \"POST\",\n        headers,\n        body: payload.message,\n      });\n\n      return response.ok;\n    } catch {\n      return false;\n    }\n  }\n}\n","/**\n * whatsapp.ts — WhatsApp notification provider (via the AIBroker hub)\n *\n * Sends through AIBroker's hub socket, which proxies to the whazaa adapter.\n *\n * It used to dial /tmp/whazaa.sock and call a method named `whatsapp_send`.\n * Both were wrong, and had been since AIBroker became the runtime hub and\n * adapters became thin transports: Whazaa no longer owns an IPC socket of its\n * own (it registers with the hub, currently at /tmp/whazaa-watcher.sock, which\n * is the hub's business and not ours), and `whatsapp_send` is an MCP TOOL name\n * — the adapter itself takes `send` and `tts`.\n *\n * So every WhatsApp notification failed. Silently, because a failed channel\n * writes one line to stderr and the router has no fallback: on 2026-08-04 four\n * task-bus escalations about a job that had not run for nine hours reached\n * /tmp/pai-scheduler.log and nowhere else, while the user had no idea.\n *\n * Routing through the hub rather than at the adapter directly is deliberate:\n * the hub knows where its adapters are, and that is exactly the knowledge whose\n * absence broke this. Connect-per-call, no persistent state.\n */\n\nimport { connect } from \"node:net\";\nimport { randomUUID } from \"node:crypto\";\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\n/**\n * AIBroker's hub socket.\n *\n * Hardcoded rather than imported: PAI must not depend on AIBroker. This is a\n * protocol constant between them, like the agent mark in tasks/poller.ts.\n */\nconst HUB_SOCKET = \"/tmp/aibroker.sock\";\nconst HUB_TIMEOUT_MS = 10_000;\n\n/**\n * Send a single IPC call to the hub.\n * Returns true on success, false if the hub is not available or errors.\n */\nfunction callHub(\n  method: string,\n  params: Record<string, unknown>\n): Promise<boolean> {\n  return new Promise((resolve) => {\n    let done = false;\n    let buffer = \"\";\n    let timer: ReturnType<typeof setTimeout> | null = null;\n\n    function finish(ok: boolean): void {\n      if (done) return;\n      done = true;\n      if (timer) { clearTimeout(timer); timer = null; }\n      try { socket?.destroy(); } catch { /* ignore */ }\n      resolve(ok);\n    }\n\n    const socket = connect(HUB_SOCKET, () => {\n      const request = {\n        jsonrpc: \"2.0\",\n        id: randomUUID(),\n        method,\n        params,\n      };\n      socket.write(JSON.stringify(request) + \"\\n\");\n    });\n\n    socket.on(\"data\", (chunk: Buffer) => {\n      buffer += chunk.toString();\n      const nl = buffer.indexOf(\"\\n\");\n      if (nl === -1) return;\n      try {\n        const resp = JSON.parse(buffer.slice(0, nl)) as { error?: unknown; ok?: boolean };\n        // The hub reports failure as {ok:false,error}; JSON-RPC reports {error}.\n        // Checking only `error` counted an {ok:false} reply as a delivered\n        // notification, which is the one mistake this file must never make.\n        finish(!resp.error && resp.ok !== false);\n      } catch {\n        finish(false);\n      }\n    });\n\n    socket.on(\"error\", () => finish(false));\n    socket.on(\"end\", () => finish(false));\n\n    timer = setTimeout(() => finish(false), HUB_TIMEOUT_MS);\n  });\n}\n\nexport class WhatsAppProvider implements NotificationProvider {\n  readonly channelId = \"whatsapp\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.whatsapp;\n    if (!cfg.enabled) return false;\n\n    const isVoiceMode = config.mode === \"voice\" || config.channels.voice.enabled;\n    const asVoice = isVoiceMode && config.mode === \"voice\";\n\n    // The adapter's own vocabulary is `send` and `tts`, reached through the\n    // hub's `adapter_call`. `whatsapp_send` — what this used to ask for — is the\n    // name of the MCP TOOL that wraps it, and the adapter has never answered to\n    // it. The two vocabularies are easy to confuse because the MCP tool exists\n    // and works; it just is not this interface.\n    const inner: Record<string, unknown> = asVoice\n      ? { text: payload.message, voice: config.channels.voice.voiceName ?? \"bm_george\" }\n      : { message: payload.message };\n\n    if (cfg.recipient) {\n      // `send` addresses by `recipient`, `tts` by `jid` — same destination,\n      // different key, per the adapter's interface.\n      inner[asVoice ? \"jid\" : \"recipient\"] = cfg.recipient;\n    }\n\n    return callHub(\"adapter_call\", {\n      adapter: \"whazaa\",\n      method: asVoice ? \"tts\" : \"send\",\n      params: inner,\n    });\n  }\n}\n","/**\n * macos.ts — macOS notification provider\n *\n * Uses the `osascript` command to display a macOS system notification.\n * Non-blocking: spawns the process and returns success without waiting.\n */\n\nimport { spawn } from \"node:child_process\";\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class MacOsProvider implements NotificationProvider {\n  readonly channelId = \"macos\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.macos;\n    if (!cfg.enabled) return false;\n\n    try {\n      const title = payload.title ?? \"PAI\";\n      // Escape single quotes in title and message for AppleScript\n      const safeTitle = title.replace(/'/g, \"\\\\'\");\n      const safeMessage = payload.message.replace(/'/g, \"\\\\'\");\n\n      const script = `display notification \"${safeMessage}\" with title \"${safeTitle}\"`;\n\n      return new Promise((resolve) => {\n        const child = spawn(\"osascript\", [\"-e\", script], {\n          detached: true,\n          stdio: \"ignore\",\n        });\n        child.unref();\n\n        // Give the process a moment to start, then assume success.\n        // osascript is always present on macOS.\n        child.on(\"error\", () => resolve(false));\n\n        // Resolve after a short timeout — osascript exits quickly\n        setTimeout(() => resolve(true), 200);\n      });\n    } catch {\n      return false;\n    }\n  }\n}\n","/**\n * cli.ts — CLI notification provider\n *\n * Writes notifications to the PAI daemon log (stderr).\n * Always succeeds — it's the fallback channel.\n */\n\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class CliProvider implements NotificationProvider {\n  readonly channelId = \"cli\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    _config: NotificationConfig\n  ): Promise<boolean> {\n    const prefix = `[pai-notify:${payload.event}]`;\n    const title = payload.title ? ` ${payload.title}:` : \"\";\n    process.stderr.write(`${prefix}${title} ${payload.message}\\n`);\n    return true;\n  }\n}\n","/**\n * router.ts — Notification router\n *\n * Routes notification events to the appropriate channels based on the\n * current mode and per-event routing config.\n *\n * Channel providers are instantiated lazily and cached.\n */\n\nimport type {\n  NotificationPayload,\n  NotificationConfig,\n  NotificationProvider,\n  ChannelId,\n  SendResult,\n  NotificationMode,\n} from \"./types.js\";\nimport { NtfyProvider } from \"./providers/ntfy.js\";\nimport { WhatsAppProvider } from \"./providers/whatsapp.js\";\nimport { MacOsProvider } from \"./providers/macos.js\";\nimport { CliProvider } from \"./providers/cli.js\";\n\n// ---------------------------------------------------------------------------\n// Provider registry (singletons — stateless, safe to reuse)\n// ---------------------------------------------------------------------------\n\nconst PROVIDERS: Record<ChannelId, NotificationProvider> = {\n  ntfy:      new NtfyProvider(),\n  whatsapp:  new WhatsAppProvider(),\n  macos:     new MacOsProvider(),\n  voice:     new WhatsAppProvider(), // Voice uses WhatsApp TTS; handled in WhatsAppProvider\n  cli:       new CliProvider(),\n};\n\n// ---------------------------------------------------------------------------\n// Channel resolution\n// ---------------------------------------------------------------------------\n\n/**\n * Given the current config, resolve which channels should receive a\n * notification for the given event type.\n *\n * Mode overrides:\n *   \"off\"       → no channels\n *   \"auto\"      → use routing table, filtered by enabled channels\n *   \"voice\"     → whatsapp (TTS enabled in provider)\n *   \"whatsapp\"  → whatsapp\n *   \"ntfy\"      → ntfy\n *   \"macos\"     → macos\n *   \"cli\"       → cli\n */\nfunction resolveChannels(\n  config: NotificationConfig,\n  event: NotificationPayload[\"event\"]\n): ChannelId[] {\n  const { mode, channels, routing } = config;\n\n  if (mode === \"off\") return [];\n\n  // Non-auto modes: force a single channel\n  const modeToChannel: Partial<Record<NotificationMode, ChannelId>> = {\n    voice:     \"whatsapp\",  // WhatsAppProvider checks mode === \"voice\" for TTS\n    whatsapp:  \"whatsapp\",\n    ntfy:      \"ntfy\",\n    macos:     \"macos\",\n    cli:       \"cli\",\n  };\n\n  if (mode !== \"auto\") {\n    const ch = modeToChannel[mode];\n    if (!ch) return [];\n    // Check the channel is enabled\n    const cfg = channels[ch];\n    if (cfg && !cfg.enabled) return [ch]; // Still send — mode override bypasses enabled check\n    return [ch];\n  }\n\n  // Auto mode: use routing table, filter to enabled channels\n  const candidates = routing[event] ?? [];\n  return candidates.filter((ch) => {\n    const cfg = channels[ch];\n    // \"voice\" channel is virtual — it overlaps with whatsapp.\n    // Skip \"voice\" as an independent channel; voice is handled by checking config.mode.\n    if (ch === \"voice\") return false;\n    return cfg?.enabled === true;\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Router\n// ---------------------------------------------------------------------------\n\n/**\n * Route a notification to the appropriate channels.\n *\n * Sends to all resolved channels in parallel.\n * Individual channel failures are non-fatal and logged to stderr.\n *\n * @param payload  The notification to send\n * @param config   The current notification config (from daemon state)\n */\nexport async function routeNotification(\n  payload: NotificationPayload,\n  config: NotificationConfig\n): Promise<SendResult> {\n  const channels = resolveChannels(config, payload.event);\n\n  if (channels.length === 0) {\n    return {\n      channelsAttempted: [],\n      channelsSucceeded: [],\n      channelsFailed: [],\n      mode: config.mode,\n    };\n  }\n\n  const results = await Promise.allSettled(\n    channels.map(async (ch) => {\n      const provider = PROVIDERS[ch];\n      const ok = await provider.send(payload, config);\n      if (!ok) {\n        process.stderr.write(\n          `[pai-notify] Channel ${ch} failed for event ${payload.event}\\n`\n        );\n      }\n      return { ch, ok };\n    })\n  );\n\n  const succeeded: ChannelId[] = [];\n  const failed: ChannelId[] = [];\n\n  for (const r of results) {\n    if (r.status === \"fulfilled\") {\n      if (r.value.ok) {\n        succeeded.push(r.value.ch);\n      } else {\n        failed.push(r.value.ch);\n      }\n    } else {\n      // Provider threw — treat as failure\n      failed.push(channels[results.indexOf(r)]);\n    }\n  }\n\n  return {\n    channelsAttempted: channels,\n    channelsSucceeded: succeeded,\n    channelsFailed: failed,\n    mode: config.mode,\n  };\n}\n"],"mappings":";;;;;;AAYA,IAAa,eAAb,MAA0D;CACxD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;EAClB,MAAM,MAAM,OAAO,SAAS;AAC5B,MAAI,CAAC,IAAI,WAAW,CAAC,IAAI,IAAK,QAAO;AAErC,MAAI;GACF,MAAM,UAAkC,EACtC,gBAAgB,6BACjB;AAED,OAAI,QAAQ,MACV,SAAQ,WAAW,QAAQ;AAG7B,OAAI,IAAI,YAAY,IAAI,aAAa,UACnC,SAAQ,cAAc,IAAI;AAS5B,WANiB,MAAM,MAAM,IAAI,KAAK;IACpC,QAAQ;IACR;IACA,MAAM,QAAQ;IACf,CAAC,EAEc;UACV;AACN,UAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACPb,MAAM,aAAa;AACnB,MAAM,iBAAiB;;;;;AAMvB,SAAS,QACP,QACA,QACkB;AAClB,QAAO,IAAI,SAAS,YAAY;EAC9B,IAAI,OAAO;EACX,IAAI,SAAS;EACb,IAAI,QAA8C;EAElD,SAAS,OAAO,IAAmB;AACjC,OAAI,KAAM;AACV,UAAO;AACP,OAAI,OAAO;AAAE,iBAAa,MAAM;AAAE,YAAQ;;AAC1C,OAAI;AAAE,YAAQ,SAAS;WAAU;AACjC,WAAQ,GAAG;;EAGb,MAAM,SAAS,QAAQ,kBAAkB;GACvC,MAAM,UAAU;IACd,SAAS;IACT,IAAI,YAAY;IAChB;IACA;IACD;AACD,UAAO,MAAM,KAAK,UAAU,QAAQ,GAAG,KAAK;IAC5C;AAEF,SAAO,GAAG,SAAS,UAAkB;AACnC,aAAU,MAAM,UAAU;GAC1B,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC/B,OAAI,OAAO,GAAI;AACf,OAAI;IACF,MAAM,OAAO,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,CAAC;AAI5C,WAAO,CAAC,KAAK,SAAS,KAAK,OAAO,MAAM;WAClC;AACN,WAAO,MAAM;;IAEf;AAEF,SAAO,GAAG,eAAe,OAAO,MAAM,CAAC;AACvC,SAAO,GAAG,aAAa,OAAO,MAAM,CAAC;AAErC,UAAQ,iBAAiB,OAAO,MAAM,EAAE,eAAe;GACvD;;AAGJ,IAAa,mBAAb,MAA8D;CAC5D,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;EAClB,MAAM,MAAM,OAAO,SAAS;AAC5B,MAAI,CAAC,IAAI,QAAS,QAAO;EAGzB,MAAM,WADc,OAAO,SAAS,WAAW,OAAO,SAAS,MAAM,YACtC,OAAO,SAAS;EAO/C,MAAM,QAAiC,UACnC;GAAE,MAAM,QAAQ;GAAS,OAAO,OAAO,SAAS,MAAM,aAAa;GAAa,GAChF,EAAE,SAAS,QAAQ,SAAS;AAEhC,MAAI,IAAI,UAGN,OAAM,UAAU,QAAQ,eAAe,IAAI;AAG7C,SAAO,QAAQ,gBAAgB;GAC7B,SAAS;GACT,QAAQ,UAAU,QAAQ;GAC1B,QAAQ;GACT,CAAC;;;;;;;;;;;;AC9GN,IAAa,gBAAb,MAA2D;CACzD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;AAElB,MAAI,CADQ,OAAO,SAAS,MACnB,QAAS,QAAO;AAEzB,MAAI;GAGF,MAAM,aAFQ,QAAQ,SAAS,OAEP,QAAQ,MAAM,MAAM;GAG5C,MAAM,SAAS,yBAFK,QAAQ,QAAQ,QAAQ,MAAM,MAAM,CAEJ,gBAAgB,UAAU;AAE9E,UAAO,IAAI,SAAS,YAAY;IAC9B,MAAM,QAAQ,MAAM,aAAa,CAAC,MAAM,OAAO,EAAE;KAC/C,UAAU;KACV,OAAO;KACR,CAAC;AACF,UAAM,OAAO;AAIb,UAAM,GAAG,eAAe,QAAQ,MAAM,CAAC;AAGvC,qBAAiB,QAAQ,KAAK,EAAE,IAAI;KACpC;UACI;AACN,UAAO;;;;;;;AClCb,IAAa,cAAb,MAAyD;CACvD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,SACkB;EAClB,MAAM,SAAS,eAAe,QAAQ,MAAM;EAC5C,MAAM,QAAQ,QAAQ,QAAQ,IAAI,QAAQ,MAAM,KAAK;AACrD,UAAQ,OAAO,MAAM,GAAG,SAAS,MAAM,GAAG,QAAQ,QAAQ,IAAI;AAC9D,SAAO;;;;;;;ACGX,MAAM,YAAqD;CACzD,MAAW,IAAI,cAAc;CAC7B,UAAW,IAAI,kBAAkB;CACjC,OAAW,IAAI,eAAe;CAC9B,OAAW,IAAI,kBAAkB;CACjC,KAAW,IAAI,aAAa;CAC7B;;;;;;;;;;;;;;AAmBD,SAAS,gBACP,QACA,OACa;CACb,MAAM,EAAE,MAAM,UAAU,YAAY;AAEpC,KAAI,SAAS,MAAO,QAAO,EAAE;CAG7B,MAAM,gBAA8D;EAClE,OAAW;EACX,UAAW;EACX,MAAW;EACX,OAAW;EACX,KAAW;EACZ;AAED,KAAI,SAAS,QAAQ;EACnB,MAAM,KAAK,cAAc;AACzB,MAAI,CAAC,GAAI,QAAO,EAAE;EAElB,MAAM,MAAM,SAAS;AACrB,MAAI,OAAO,CAAC,IAAI,QAAS,QAAO,CAAC,GAAG;AACpC,SAAO,CAAC,GAAG;;AAKb,SADmB,QAAQ,UAAU,EAAE,EACrB,QAAQ,OAAO;EAC/B,MAAM,MAAM,SAAS;AAGrB,MAAI,OAAO,QAAS,QAAO;AAC3B,SAAO,KAAK,YAAY;GACxB;;;;;;;;;;;AAgBJ,eAAsB,kBACpB,SACA,QACqB;CACrB,MAAM,WAAW,gBAAgB,QAAQ,QAAQ,MAAM;AAEvD,KAAI,SAAS,WAAW,EACtB,QAAO;EACL,mBAAmB,EAAE;EACrB,mBAAmB,EAAE;EACrB,gBAAgB,EAAE;EAClB,MAAM,OAAO;EACd;CAGH,MAAM,UAAU,MAAM,QAAQ,WAC5B,SAAS,IAAI,OAAO,OAAO;EAEzB,MAAM,KAAK,MADM,UAAU,IACD,KAAK,SAAS,OAAO;AAC/C,MAAI,CAAC,GACH,SAAQ,OAAO,MACb,wBAAwB,GAAG,oBAAoB,QAAQ,MAAM,IAC9D;AAEH,SAAO;GAAE;GAAI;GAAI;GACjB,CACH;CAED,MAAM,YAAyB,EAAE;CACjC,MAAM,SAAsB,EAAE;AAE9B,MAAK,MAAM,KAAK,QACd,KAAI,EAAE,WAAW,YACf,KAAI,EAAE,MAAM,GACV,WAAU,KAAK,EAAE,MAAM,GAAG;KAE1B,QAAO,KAAK,EAAE,MAAM,GAAG;KAIzB,QAAO,KAAK,SAAS,QAAQ,QAAQ,EAAE,EAAE;AAI7C,QAAO;EACL,mBAAmB;EACnB,mBAAmB;EACnB,gBAAgB;EAChB,MAAM,OAAO;EACd"}
+{"version":3,"file":"router-CsDm7HvK.mjs","names":[],"sources":["../src/notifications/providers/ntfy.ts","../src/notifications/providers/whatsapp.ts","../src/notifications/providers/macos.ts","../src/notifications/providers/cli.ts","../src/notifications/router.ts"],"sourcesContent":["/**\n * ntfy.ts — ntfy.sh notification provider\n *\n * Sends notifications to a configured ntfy.sh topic via HTTP.\n */\n\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class NtfyProvider implements NotificationProvider {\n  readonly channelId = \"ntfy\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.ntfy;\n    if (!cfg.enabled || !cfg.url) return false;\n\n    try {\n      const headers: Record<string, string> = {\n        \"Content-Type\": \"text/plain; charset=utf-8\",\n      };\n\n      if (payload.title) {\n        headers[\"Title\"] = payload.title;\n      }\n\n      if (cfg.priority && cfg.priority !== \"default\") {\n        headers[\"Priority\"] = cfg.priority;\n      }\n\n      const response = await fetch(cfg.url, {\n        method: \"POST\",\n        headers,\n        body: payload.message,\n      });\n\n      return response.ok;\n    } catch {\n      return false;\n    }\n  }\n}\n","/**\n * whatsapp.ts — WhatsApp notification provider (via the AIBroker hub)\n *\n * Sends through AIBroker's hub socket, which proxies to the whazaa adapter.\n *\n * It used to dial /tmp/whazaa.sock and call a method named `whatsapp_send`.\n * Both were wrong, and had been since AIBroker became the runtime hub and\n * adapters became thin transports: Whazaa no longer owns an IPC socket of its\n * own (it registers with the hub, currently at /tmp/whazaa-watcher.sock, which\n * is the hub's business and not ours), and `whatsapp_send` is an MCP TOOL name\n * — the adapter itself takes `send` and `tts`.\n *\n * So every WhatsApp notification failed. Silently, because a failed channel\n * writes one line to stderr and the router has no fallback: on 2026-08-04 four\n * task-bus escalations about a job that had not run for nine hours reached\n * /tmp/pai-scheduler.log and nowhere else, while the user had no idea.\n *\n * Routing through the hub rather than at the adapter directly is deliberate:\n * the hub knows where its adapters are, and that is exactly the knowledge whose\n * absence broke this. Connect-per-call, no persistent state.\n */\n\nimport { connect } from \"node:net\";\nimport { randomUUID } from \"node:crypto\";\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\n/**\n * AIBroker's hub socket.\n *\n * Hardcoded rather than imported: PAI must not depend on AIBroker. This is a\n * protocol constant between them, like the agent mark in tasks/poller.ts.\n */\nconst HUB_SOCKET = \"/tmp/aibroker.sock\";\nconst HUB_TIMEOUT_MS = 10_000;\n\n/**\n * Send a single IPC call to the hub.\n * Returns true on success, false if the hub is not available or errors.\n */\nfunction callHub(\n  method: string,\n  params: Record<string, unknown>\n): Promise<boolean> {\n  return new Promise((resolve) => {\n    let done = false;\n    let buffer = \"\";\n    let timer: ReturnType<typeof setTimeout> | null = null;\n\n    function finish(ok: boolean): void {\n      if (done) return;\n      done = true;\n      if (timer) { clearTimeout(timer); timer = null; }\n      try { socket?.destroy(); } catch { /* ignore */ }\n      resolve(ok);\n    }\n\n    const socket = connect(HUB_SOCKET, () => {\n      const request = {\n        jsonrpc: \"2.0\",\n        id: randomUUID(),\n        method,\n        params,\n      };\n      socket.write(JSON.stringify(request) + \"\\n\");\n    });\n\n    socket.on(\"data\", (chunk: Buffer) => {\n      buffer += chunk.toString();\n      const nl = buffer.indexOf(\"\\n\");\n      if (nl === -1) return;\n      try {\n        const resp = JSON.parse(buffer.slice(0, nl)) as { error?: unknown; ok?: boolean };\n        // The hub reports failure as {ok:false,error}; JSON-RPC reports {error}.\n        // Checking only `error` counted an {ok:false} reply as a delivered\n        // notification, which is the one mistake this file must never make.\n        finish(!resp.error && resp.ok !== false);\n      } catch {\n        finish(false);\n      }\n    });\n\n    socket.on(\"error\", () => finish(false));\n    socket.on(\"end\", () => finish(false));\n\n    timer = setTimeout(() => finish(false), HUB_TIMEOUT_MS);\n  });\n}\n\nexport class WhatsAppProvider implements NotificationProvider {\n  readonly channelId = \"whatsapp\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.whatsapp;\n    if (!cfg.enabled) return false;\n\n    const isVoiceMode = config.mode === \"voice\" || config.channels.voice.enabled;\n    const asVoice = isVoiceMode && config.mode === \"voice\";\n\n    // The adapter's own vocabulary is `send` and `tts`, reached through the\n    // hub's `adapter_call`. `whatsapp_send` — what this used to ask for — is the\n    // name of the MCP TOOL that wraps it, and the adapter has never answered to\n    // it. The two vocabularies are easy to confuse because the MCP tool exists\n    // and works; it just is not this interface.\n    const inner: Record<string, unknown> = asVoice\n      ? { text: payload.message, voice: config.channels.voice.voiceName ?? \"bm_george\" }\n      : { message: payload.message };\n\n    if (cfg.recipient) {\n      // `send` addresses by `recipient`, `tts` by `jid` — same destination,\n      // different key, per the adapter's interface.\n      inner[asVoice ? \"jid\" : \"recipient\"] = cfg.recipient;\n    }\n\n    return callHub(\"adapter_call\", {\n      adapter: \"whazaa\",\n      method: asVoice ? \"tts\" : \"send\",\n      params: inner,\n    });\n  }\n}\n","/**\n * macos.ts — macOS notification provider\n *\n * Uses the `osascript` command to display a macOS system notification.\n * Non-blocking: spawns the process and returns success without waiting.\n */\n\nimport { spawn } from \"node:child_process\";\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class MacOsProvider implements NotificationProvider {\n  readonly channelId = \"macos\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    config: NotificationConfig\n  ): Promise<boolean> {\n    const cfg = config.channels.macos;\n    if (!cfg.enabled) return false;\n\n    try {\n      const title = payload.title ?? \"PAI\";\n      // Escape single quotes in title and message for AppleScript\n      const safeTitle = title.replace(/'/g, \"\\\\'\");\n      const safeMessage = payload.message.replace(/'/g, \"\\\\'\");\n\n      const script = `display notification \"${safeMessage}\" with title \"${safeTitle}\"`;\n\n      return new Promise((resolve) => {\n        const child = spawn(\"osascript\", [\"-e\", script], {\n          detached: true,\n          stdio: \"ignore\",\n        });\n        child.unref();\n\n        // Give the process a moment to start, then assume success.\n        // osascript is always present on macOS.\n        child.on(\"error\", () => resolve(false));\n\n        // Resolve after a short timeout — osascript exits quickly\n        setTimeout(() => resolve(true), 200);\n      });\n    } catch {\n      return false;\n    }\n  }\n}\n","/**\n * cli.ts — CLI notification provider\n *\n * Writes notifications to the PAI daemon log (stderr).\n * Always succeeds — it's the fallback channel.\n */\n\nimport type {\n  NotificationProvider,\n  NotificationPayload,\n  NotificationConfig,\n} from \"../types.js\";\n\nexport class CliProvider implements NotificationProvider {\n  readonly channelId = \"cli\" as const;\n\n  async send(\n    payload: NotificationPayload,\n    _config: NotificationConfig\n  ): Promise<boolean> {\n    const prefix = `[pai-notify:${payload.event}]`;\n    const title = payload.title ? ` ${payload.title}:` : \"\";\n    process.stderr.write(`${prefix}${title} ${payload.message}\\n`);\n    return true;\n  }\n}\n","/**\n * router.ts — Notification router\n *\n * Routes notification events to the appropriate channels based on the\n * current mode and per-event routing config.\n *\n * Channel providers are instantiated lazily and cached.\n */\n\nimport type {\n  NotificationPayload,\n  NotificationConfig,\n  NotificationProvider,\n  ChannelId,\n  SendResult,\n  NotificationMode,\n} from \"./types.js\";\nimport { NtfyProvider } from \"./providers/ntfy.js\";\nimport { WhatsAppProvider } from \"./providers/whatsapp.js\";\nimport { MacOsProvider } from \"./providers/macos.js\";\nimport { CliProvider } from \"./providers/cli.js\";\n\n// ---------------------------------------------------------------------------\n// Provider registry (singletons — stateless, safe to reuse)\n// ---------------------------------------------------------------------------\n\nconst PROVIDERS: Record<ChannelId, NotificationProvider> = {\n  ntfy:      new NtfyProvider(),\n  whatsapp:  new WhatsAppProvider(),\n  macos:     new MacOsProvider(),\n  voice:     new WhatsAppProvider(), // Voice uses WhatsApp TTS; handled in WhatsAppProvider\n  cli:       new CliProvider(),\n};\n\n// ---------------------------------------------------------------------------\n// Channel resolution\n// ---------------------------------------------------------------------------\n\n/**\n * Given the current config, resolve which channels should receive a\n * notification for the given event type.\n *\n * Mode overrides:\n *   \"off\"       → no channels\n *   \"auto\"      → use routing table, filtered by enabled channels\n *   \"voice\"     → whatsapp (TTS enabled in provider)\n *   \"whatsapp\"  → whatsapp\n *   \"ntfy\"      → ntfy\n *   \"macos\"     → macos\n *   \"cli\"       → cli\n */\nfunction resolveChannels(\n  config: NotificationConfig,\n  event: NotificationPayload[\"event\"]\n): ChannelId[] {\n  const { mode, channels, routing } = config;\n\n  if (mode === \"off\") return [];\n\n  // Non-auto modes: force a single channel\n  const modeToChannel: Partial<Record<NotificationMode, ChannelId>> = {\n    voice:     \"whatsapp\",  // WhatsAppProvider checks mode === \"voice\" for TTS\n    whatsapp:  \"whatsapp\",\n    ntfy:      \"ntfy\",\n    macos:     \"macos\",\n    cli:       \"cli\",\n  };\n\n  if (mode !== \"auto\") {\n    const ch = modeToChannel[mode];\n    if (!ch) return [];\n    // Check the channel is enabled\n    const cfg = channels[ch];\n    if (cfg && !cfg.enabled) return [ch]; // Still send — mode override bypasses enabled check\n    return [ch];\n  }\n\n  // Auto mode: use routing table, filter to enabled channels\n  const candidates = routing[event] ?? [];\n  return candidates.filter((ch) => {\n    const cfg = channels[ch];\n    // \"voice\" channel is virtual — it overlaps with whatsapp.\n    // Skip \"voice\" as an independent channel; voice is handled by checking config.mode.\n    if (ch === \"voice\") return false;\n    return cfg?.enabled === true;\n  });\n}\n\n// ---------------------------------------------------------------------------\n// Router\n// ---------------------------------------------------------------------------\n\n/**\n * Route a notification to the appropriate channels.\n *\n * Sends to all resolved channels in parallel.\n * Individual channel failures are non-fatal and logged to stderr.\n *\n * @param payload  The notification to send\n * @param config   The current notification config (from daemon state)\n */\nexport async function routeNotification(\n  payload: NotificationPayload,\n  config: NotificationConfig\n): Promise<SendResult> {\n  const channels = resolveChannels(config, payload.event);\n\n  if (channels.length === 0) {\n    return {\n      channelsAttempted: [],\n      channelsSucceeded: [],\n      channelsFailed: [],\n      mode: config.mode,\n    };\n  }\n\n  const results = await Promise.allSettled(\n    channels.map(async (ch) => {\n      const provider = PROVIDERS[ch];\n      const ok = await provider.send(payload, config);\n      if (!ok) {\n        process.stderr.write(\n          `[pai-notify] Channel ${ch} failed for event ${payload.event}\\n`\n        );\n      }\n      return { ch, ok };\n    })\n  );\n\n  const succeeded: ChannelId[] = [];\n  const failed: ChannelId[] = [];\n\n  for (const r of results) {\n    if (r.status === \"fulfilled\") {\n      if (r.value.ok) {\n        succeeded.push(r.value.ch);\n      } else {\n        failed.push(r.value.ch);\n      }\n    } else {\n      // Provider threw — treat as failure\n      failed.push(channels[results.indexOf(r)]);\n    }\n  }\n\n  return {\n    channelsAttempted: channels,\n    channelsSucceeded: succeeded,\n    channelsFailed: failed,\n    mode: config.mode,\n  };\n}\n"],"mappings":";;;;;AAYA,IAAa,eAAb,MAA0D;CACxD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;EAClB,MAAM,MAAM,OAAO,SAAS;AAC5B,MAAI,CAAC,IAAI,WAAW,CAAC,IAAI,IAAK,QAAO;AAErC,MAAI;GACF,MAAM,UAAkC,EACtC,gBAAgB,6BACjB;AAED,OAAI,QAAQ,MACV,SAAQ,WAAW,QAAQ;AAG7B,OAAI,IAAI,YAAY,IAAI,aAAa,UACnC,SAAQ,cAAc,IAAI;AAS5B,WANiB,MAAM,MAAM,IAAI,KAAK;IACpC,QAAQ;IACR;IACA,MAAM,QAAQ;IACf,CAAC,EAEc;UACV;AACN,UAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACPb,MAAM,aAAa;AACnB,MAAM,iBAAiB;;;;;AAMvB,SAAS,QACP,QACA,QACkB;AAClB,QAAO,IAAI,SAAS,YAAY;EAC9B,IAAI,OAAO;EACX,IAAI,SAAS;EACb,IAAI,QAA8C;EAElD,SAAS,OAAO,IAAmB;AACjC,OAAI,KAAM;AACV,UAAO;AACP,OAAI,OAAO;AAAE,iBAAa,MAAM;AAAE,YAAQ;;AAC1C,OAAI;AAAE,YAAQ,SAAS;WAAU;AACjC,WAAQ,GAAG;;EAGb,MAAM,SAAS,QAAQ,kBAAkB;GACvC,MAAM,UAAU;IACd,SAAS;IACT,IAAI,YAAY;IAChB;IACA;IACD;AACD,UAAO,MAAM,KAAK,UAAU,QAAQ,GAAG,KAAK;IAC5C;AAEF,SAAO,GAAG,SAAS,UAAkB;AACnC,aAAU,MAAM,UAAU;GAC1B,MAAM,KAAK,OAAO,QAAQ,KAAK;AAC/B,OAAI,OAAO,GAAI;AACf,OAAI;IACF,MAAM,OAAO,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,CAAC;AAI5C,WAAO,CAAC,KAAK,SAAS,KAAK,OAAO,MAAM;WAClC;AACN,WAAO,MAAM;;IAEf;AAEF,SAAO,GAAG,eAAe,OAAO,MAAM,CAAC;AACvC,SAAO,GAAG,aAAa,OAAO,MAAM,CAAC;AAErC,UAAQ,iBAAiB,OAAO,MAAM,EAAE,eAAe;GACvD;;AAGJ,IAAa,mBAAb,MAA8D;CAC5D,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;EAClB,MAAM,MAAM,OAAO,SAAS;AAC5B,MAAI,CAAC,IAAI,QAAS,QAAO;EAGzB,MAAM,WADc,OAAO,SAAS,WAAW,OAAO,SAAS,MAAM,YACtC,OAAO,SAAS;EAO/C,MAAM,QAAiC,UACnC;GAAE,MAAM,QAAQ;GAAS,OAAO,OAAO,SAAS,MAAM,aAAa;GAAa,GAChF,EAAE,SAAS,QAAQ,SAAS;AAEhC,MAAI,IAAI,UAGN,OAAM,UAAU,QAAQ,eAAe,IAAI;AAG7C,SAAO,QAAQ,gBAAgB;GAC7B,SAAS;GACT,QAAQ,UAAU,QAAQ;GAC1B,QAAQ;GACT,CAAC;;;;;;;;;;;;AC9GN,IAAa,gBAAb,MAA2D;CACzD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,QACkB;AAElB,MAAI,CADQ,OAAO,SAAS,MACnB,QAAS,QAAO;AAEzB,MAAI;GAGF,MAAM,aAFQ,QAAQ,SAAS,OAEP,QAAQ,MAAM,MAAM;GAG5C,MAAM,SAAS,yBAFK,QAAQ,QAAQ,QAAQ,MAAM,MAAM,CAEJ,gBAAgB,UAAU;AAE9E,UAAO,IAAI,SAAS,YAAY;IAC9B,MAAM,QAAQ,MAAM,aAAa,CAAC,MAAM,OAAO,EAAE;KAC/C,UAAU;KACV,OAAO;KACR,CAAC;AACF,UAAM,OAAO;AAIb,UAAM,GAAG,eAAe,QAAQ,MAAM,CAAC;AAGvC,qBAAiB,QAAQ,KAAK,EAAE,IAAI;KACpC;UACI;AACN,UAAO;;;;;;;AClCb,IAAa,cAAb,MAAyD;CACvD,AAAS,YAAY;CAErB,MAAM,KACJ,SACA,SACkB;EAClB,MAAM,SAAS,eAAe,QAAQ,MAAM;EAC5C,MAAM,QAAQ,QAAQ,QAAQ,IAAI,QAAQ,MAAM,KAAK;AACrD,UAAQ,OAAO,MAAM,GAAG,SAAS,MAAM,GAAG,QAAQ,QAAQ,IAAI;AAC9D,SAAO;;;;;;ACGX,MAAM,YAAqD;CACzD,MAAW,IAAI,cAAc;CAC7B,UAAW,IAAI,kBAAkB;CACjC,OAAW,IAAI,eAAe;CAC9B,OAAW,IAAI,kBAAkB;CACjC,KAAW,IAAI,aAAa;CAC7B;;;;;;;;;;;;;;AAmBD,SAAS,gBACP,QACA,OACa;CACb,MAAM,EAAE,MAAM,UAAU,YAAY;AAEpC,KAAI,SAAS,MAAO,QAAO,EAAE;CAG7B,MAAM,gBAA8D;EAClE,OAAW;EACX,UAAW;EACX,MAAW;EACX,OAAW;EACX,KAAW;EACZ;AAED,KAAI,SAAS,QAAQ;EACnB,MAAM,KAAK,cAAc;AACzB,MAAI,CAAC,GAAI,QAAO,EAAE;EAElB,MAAM,MAAM,SAAS;AACrB,MAAI,OAAO,CAAC,IAAI,QAAS,QAAO,CAAC,GAAG;AACpC,SAAO,CAAC,GAAG;;AAKb,SADmB,QAAQ,UAAU,EAAE,EACrB,QAAQ,OAAO;EAC/B,MAAM,MAAM,SAAS;AAGrB,MAAI,OAAO,QAAS,QAAO;AAC3B,SAAO,KAAK,YAAY;GACxB;;;;;;;;;;;AAgBJ,eAAsB,kBACpB,SACA,QACqB;CACrB,MAAM,WAAW,gBAAgB,QAAQ,QAAQ,MAAM;AAEvD,KAAI,SAAS,WAAW,EACtB,QAAO;EACL,mBAAmB,EAAE;EACrB,mBAAmB,EAAE;EACrB,gBAAgB,EAAE;EAClB,MAAM,OAAO;EACd;CAGH,MAAM,UAAU,MAAM,QAAQ,WAC5B,SAAS,IAAI,OAAO,OAAO;EAEzB,MAAM,KAAK,MADM,UAAU,IACD,KAAK,SAAS,OAAO;AAC/C,MAAI,CAAC,GACH,SAAQ,OAAO,MACb,wBAAwB,GAAG,oBAAoB,QAAQ,MAAM,IAC9D;AAEH,SAAO;GAAE;GAAI;GAAI;GACjB,CACH;CAED,MAAM,YAAyB,EAAE;CACjC,MAAM,SAAsB,EAAE;AAE9B,MAAK,MAAM,KAAK,QACd,KAAI,EAAE,WAAW,YACf,KAAI,EAAE,MAAM,GACV,WAAU,KAAK,EAAE,MAAM,GAAG;KAE1B,QAAO,KAAK,EAAE,MAAM,GAAG;KAIzB,QAAO,KAAK,SAAS,QAAQ,QAAQ,EAAE,EAAE;AAI7C,QAAO;EACL,mBAAmB;EACnB,mBAAmB;EACnB,gBAAgB;EAChB,MAAM,OAAO;EACd"}

package/dist/{runtime-paths-B0P1TvUr.mjs → runtime-paths-rni52zHX.mjs}

@@ -47,4 +47,4 @@ function schedulerLogPath() {
 
 //#endregion
 export { schedulerLogPath as a, paiSocketPath as i, daemonLogPath as n, daemonPidPath as r, aibrokerSocketPath as t };
-//# sourceMappingURL=runtime-paths-B0P1TvUr.mjs.map
+//# sourceMappingURL=runtime-paths-rni52zHX.mjs.map

package/dist/{runtime-paths-B0P1TvUr.mjs.map → runtime-paths-rni52zHX.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"runtime-paths-B0P1TvUr.mjs","names":[],"sources":["../src/runtime-paths.ts"],"sourcesContent":["/**\n * runtime-paths.ts — the shared files PAI talks to the running daemon through.\n *\n * Sockets, logs and pidfiles live at fixed absolute paths under /tmp, and every\n * one of them is shared with a *live* daemon. That makes them the same hazard\n * as any other piece of real user state a test can reach: writing one from a\n * test does not fail, it corrupts something already running, silently.\n *\n * The home guard in test/setup-home-guard.ts does not cover them. It works by\n * redirecting HOME, so it protects paths *derived* from the home directory and\n * nothing else — a hardcoded \"/tmp/pai.sock\" walks straight past it. Verified\n * on 2026-08-01 by snapshotting all five and running the suite: nothing writes\n * to them today. But \"no test does this yet\" is not a property, and the next\n * daemon test to be written would clobber the live socket with nothing to stop\n * it.\n *\n * So each path is read from an environment variable with the historical /tmp\n * value as its default. Behaviour is unchanged for every real invocation; the\n * test setup overrides the variables and the whole class becomes unreachable\n * rather than merely absent, the same way the home guard works.\n *\n * Read at call time, not at module load: the test setup file runs before any\n * module is imported, but resolving these eagerly would still bake in whatever\n * the environment held at import and make the override order matter.\n */\n\n/** IPC socket for the PAI daemon. */\nexport function paiSocketPath(): string {\n  return process.env.PAI_SOCKET_PATH ?? \"/tmp/pai.sock\";\n}\n\n/** IPC socket for the AIBroker daemon — read by PAI, owned by AIBroker. */\nexport function aibrokerSocketPath(): string {\n  return process.env.PAI_AIBROKER_SOCKET_PATH ?? \"/tmp/aibroker.sock\";\n}\n\n/** Where the daemon's stdout and stderr are collected. */\nexport function daemonLogPath(): string {\n  return process.env.PAI_DAEMON_LOG_PATH ?? \"/tmp/pai-daemon.log\";\n}\n\n/** Pidfile for the running daemon. */\nexport function daemonPidPath(): string {\n  return process.env.PAI_DAEMON_PID_PATH ?? \"/tmp/pai-daemon.pid\";\n}\n\n/** Where the launchd scheduler tick writes its output. */\nexport function schedulerLogPath(): string {\n  return process.env.PAI_SCHEDULER_LOG_PATH ?? \"/tmp/pai-scheduler.log\";\n}\n\n/**\n * Every runtime path, for the test guard to redirect in one place.\n *\n * Listed here rather than in the guard so that adding a path and forgetting to\n * protect it is not possible: the guard iterates this.\n */\nexport const RUNTIME_PATH_ENV_VARS = [\n  \"PAI_SOCKET_PATH\",\n  \"PAI_AIBROKER_SOCKET_PATH\",\n  \"PAI_DAEMON_LOG_PATH\",\n  \"PAI_DAEMON_PID_PATH\",\n  \"PAI_SCHEDULER_LOG_PATH\",\n] as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,mBAAmB;;;AAIxC,SAAgB,qBAA6B;AAC3C,QAAO,QAAQ,IAAI,4BAA4B;;;AAIjD,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,uBAAuB;;;AAI5C,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,uBAAuB;;;AAI5C,SAAgB,mBAA2B;AACzC,QAAO,QAAQ,IAAI,0BAA0B"}
+{"version":3,"file":"runtime-paths-rni52zHX.mjs","names":[],"sources":["../src/runtime-paths.ts"],"sourcesContent":["/**\n * runtime-paths.ts — the shared files PAI talks to the running daemon through.\n *\n * Sockets, logs and pidfiles live at fixed absolute paths under /tmp, and every\n * one of them is shared with a *live* daemon. That makes them the same hazard\n * as any other piece of real user state a test can reach: writing one from a\n * test does not fail, it corrupts something already running, silently.\n *\n * The home guard in test/setup-home-guard.ts does not cover them. It works by\n * redirecting HOME, so it protects paths *derived* from the home directory and\n * nothing else — a hardcoded \"/tmp/pai.sock\" walks straight past it. Verified\n * on 2026-08-01 by snapshotting all five and running the suite: nothing writes\n * to them today. But \"no test does this yet\" is not a property, and the next\n * daemon test to be written would clobber the live socket with nothing to stop\n * it.\n *\n * So each path is read from an environment variable with the historical /tmp\n * value as its default. Behaviour is unchanged for every real invocation; the\n * test setup overrides the variables and the whole class becomes unreachable\n * rather than merely absent, the same way the home guard works.\n *\n * Read at call time, not at module load: the test setup file runs before any\n * module is imported, but resolving these eagerly would still bake in whatever\n * the environment held at import and make the override order matter.\n */\n\n/** IPC socket for the PAI daemon. */\nexport function paiSocketPath(): string {\n  return process.env.PAI_SOCKET_PATH ?? \"/tmp/pai.sock\";\n}\n\n/** IPC socket for the AIBroker daemon — read by PAI, owned by AIBroker. */\nexport function aibrokerSocketPath(): string {\n  return process.env.PAI_AIBROKER_SOCKET_PATH ?? \"/tmp/aibroker.sock\";\n}\n\n/** Where the daemon's stdout and stderr are collected. */\nexport function daemonLogPath(): string {\n  return process.env.PAI_DAEMON_LOG_PATH ?? \"/tmp/pai-daemon.log\";\n}\n\n/** Pidfile for the running daemon. */\nexport function daemonPidPath(): string {\n  return process.env.PAI_DAEMON_PID_PATH ?? \"/tmp/pai-daemon.pid\";\n}\n\n/** Where the launchd scheduler tick writes its output. */\nexport function schedulerLogPath(): string {\n  return process.env.PAI_SCHEDULER_LOG_PATH ?? \"/tmp/pai-scheduler.log\";\n}\n\n/**\n * Every runtime path, for the test guard to redirect in one place.\n *\n * Listed here rather than in the guard so that adding a path and forgetting to\n * protect it is not possible: the guard iterates this.\n */\nexport const RUNTIME_PATH_ENV_VARS = [\n  \"PAI_SOCKET_PATH\",\n  \"PAI_AIBROKER_SOCKET_PATH\",\n  \"PAI_DAEMON_LOG_PATH\",\n  \"PAI_DAEMON_PID_PATH\",\n  \"PAI_SCHEDULER_LOG_PATH\",\n] as const;\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,mBAAmB;;;AAIxC,SAAgB,qBAA6B;AAC3C,QAAO,QAAQ,IAAI,4BAA4B;;;AAIjD,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,uBAAuB;;;AAI5C,SAAgB,gBAAwB;AACtC,QAAO,QAAQ,IAAI,uBAAuB;;;AAI5C,SAAgB,mBAA2B;AACzC,QAAO,QAAQ,IAAI,0BAA0B"}

package/dist/search-CfPpJAWQ.mjs

@@ -0,0 +1,4 @@
+import "./embeddings-DOLZnT1X.mjs";
+import { a as searchMemory, c as touchChunksLastAccessed, i as populateSlugs, n as buildFtsQuery, o as searchMemoryHybrid, r as isQuerySyntaxError, s as searchMemorySemantic, t as applyRecencyBoost } from "./search-Rpk1cSBC.mjs";
+
+export { applyRecencyBoost, searchMemory, searchMemorySemantic };

package/dist/{search-C32zQ0V0.mjs → search-Rpk1cSBC.mjs}

@@ -1,18 +1,7 @@
-import { t as __exportAll } from "./rolldown-runtime-95iHPtFO.mjs";
-import { n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-Bn86ssxR.mjs";
-import { t as STOP_WORDS } from "./stop-words-BaMEGVeY.mjs";
+import { n as cosineSimilarity, r as deserializeEmbedding } from "./embeddings-DOLZnT1X.mjs";
+import { t as STOP_WORDS } from "./stop-words-Hfu8u22w.mjs";
 
 //#region src/memory/search.ts
-var search_exports = /* @__PURE__ */ __exportAll({
-	applyRecencyBoost: () => applyRecencyBoost,
-	buildFtsQuery: () => buildFtsQuery,
-	isQuerySyntaxError: () => isQuerySyntaxError,
-	populateSlugs: () => populateSlugs,
-	searchMemory: () => searchMemory,
-	searchMemoryHybrid: () => searchMemoryHybrid,
-	searchMemorySemantic: () => searchMemorySemantic,
-	touchChunksLastAccessed: () => touchChunksLastAccessed
-});
 /**
 * Convert a free-text query into an FTS5 query string.
 *
@@ -310,5 +299,5 @@ function applyRecencyBoost(results, halfLifeDays = 90) {
 }
 
 //#endregion
-export { searchMemorySemantic as a, searchMemoryHybrid as i, populateSlugs as n, search_exports as o, searchMemory as r, touchChunksLastAccessed as s, buildFtsQuery as t };
-//# sourceMappingURL=search-C32zQ0V0.mjs.map
+export { searchMemory as a, touchChunksLastAccessed as c, populateSlugs as i, buildFtsQuery as n, searchMemoryHybrid as o, isQuerySyntaxError as r, searchMemorySemantic as s, applyRecencyBoost as t };
+//# sourceMappingURL=search-Rpk1cSBC.mjs.map

package/dist/{search-C32zQ0V0.mjs.map → search-Rpk1cSBC.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"search-C32zQ0V0.mjs","names":[],"sources":["../src/memory/search.ts"],"sourcesContent":["/**\n * Search over the PAI federation memory index.\n *\n * Provides three search modes:\n *  - keyword  — BM25 full-text search (default, fast, no ML required)\n *  - semantic — Brute-force cosine similarity over pre-computed embeddings\n *  - hybrid   — Normalized combination of BM25 + cosine scores\n *\n * BM25 uses SQLite's FTS5 extension.  Semantic search requires embeddings to\n * have been generated first via `embedChunks()` in the indexer.\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport { deserializeEmbedding, cosineSimilarity } from \"./embeddings.js\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface SearchResult {\n  projectId: number;\n  projectSlug?: string;   // populated from registry after search when available\n  path: string;\n  startLine: number;\n  endLine: number;\n  snippet: string;\n  score: number;          // raw BM25 score (lower = more relevant in FTS5)\n  tier: string;\n  source: string;\n  updatedAt?: number;     // Unix ms from memory_chunks.updated_at\n  lastAccessedAt?: number; // Unix ms from memory_chunks.last_accessed_at (QW2)\n  chunkId?: string;        // chunk ID for last_accessed_at update (QW2)\n}\n\nexport interface SearchOptions {\n  /** Restrict search to these project IDs. */\n  projectIds?: number[];\n  /** Restrict to 'memory' or 'notes' sources. */\n  sources?: string[];\n  /** Restrict to specific tier(s): 'evergreen' | 'daily' | 'topic' | 'session' */\n  tiers?: string[];\n  /** Maximum number of results to return. Default 10. */\n  maxResults?: number;\n  /** Minimum BM25 score threshold (FTS5 scores are negative; 0.0 means no filter). */\n  minScore?: number;\n}\n\n// STOP_WORDS imported from utils/stop-words.ts\n\n// ---------------------------------------------------------------------------\n// Query builder\n// ---------------------------------------------------------------------------\n\n/**\n * Convert a free-text query into an FTS5 query string.\n *\n * Strategy:\n *  1. Tokenise by whitespace and punctuation\n *  2. Remove stop words and tokens shorter than 2 characters\n *  3. Double-quote each remaining token (exact word form)\n *  4. Join with OR so that any matching token returns a result\n *\n * Using OR instead of AND is critical for multi-word queries: the words rarely\n * all appear in the same chunk, so AND would return zero results.  FTS5 BM25\n * scoring naturally ranks chunks where more terms match higher, so the most\n * relevant chunks still surface at the top.\n *\n * Example: \"Synchrotech interview follow-up Gilles\"\n *   → `\"synchrotech\" OR \"interview\" OR \"follow\" OR \"gilles\"`\n *   → chunks matching any term, ranked by how many terms match\n */\n/**\n * Did SQLite reject the QUERY, or fail at the STORE?\n *\n * Only the first justifies an empty result. FTS5 reports a bad MATCH expression\n * with a recognisable message; a missing table, a corrupt index or a locked\n * database do not, and must not be reported as \"nothing found\".\n *\n * Matching on message text is unlovely, and the alternative — treating every\n * failure as empty — is what produced a confidently wrong answer to a human.\n */\nexport function isQuerySyntaxError(e: unknown): boolean {\n  const msg = e instanceof Error ? e.message : String(e);\n  return /fts5|malformed MATCH|syntax error|unterminated string|no such column/i.test(msg);\n}\n\nexport function buildFtsQuery(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    // Escape any double-quotes inside the token (FTS5 uses them as delimiters)\n    .map((t) => `\"${t.replace(/\"/g, '\"\"')}\"`)\n\n  if (tokens.length === 0) {\n    // Fallback: use original query as a raw string (may produce no results)\n    return `\"${query.replace(/\"/g, '\"\"')}\"`;\n  }\n\n  return tokens.join(\" OR \");\n}\n\n// ---------------------------------------------------------------------------\n// Search\n// ---------------------------------------------------------------------------\n\n/**\n * Search across all indexed memory using FTS5 BM25 ranking.\n *\n * Results are ordered by BM25 score (most relevant first).\n * FTS5 bm25() returns negative values; closer to 0 = more relevant.\n * We negate the score so callers get positive values where higher = better.\n *\n * Multilingual note: SQLite FTS5 uses the `unicode61` tokenizer by default,\n * which handles Unicode correctly (German umlauts, French accents, etc.) without\n * language-specific stemming. No changes needed here — it is already\n * multilingual-safe.\n */\nexport function searchMemory(\n  db: Database,\n  query: string,\n  opts?: SearchOptions,\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n  const ftsQuery = buildFtsQuery(query);\n\n  // Build the SQL with optional filters\n  const conditions: string[] = [];\n  const params: (string | number)[] = [ftsQuery];\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => \"?\").join(\", \");\n    conditions.push(`c.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(() => \"?\").join(\", \");\n    conditions.push(`c.source IN (${placeholders})`);\n    params.push(...opts.sources);\n  }\n\n  if (opts?.tiers && opts.tiers.length > 0) {\n    const placeholders = opts.tiers.map(() => \"?\").join(\", \");\n    conditions.push(`c.tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  const whereClause = conditions.length > 0\n    ? \"AND \" + conditions.join(\" AND \")\n    : \"\";\n\n  params.push(maxResults);\n\n  // FTS5: join memory_fts with memory_chunks to get metadata\n  // bm25(memory_fts) returns negative values (lower = better match)\n  const sql = `\n    SELECT\n      c.id,\n      c.project_id,\n      c.path,\n      c.start_line,\n      c.end_line,\n      c.text             AS snippet,\n      c.tier,\n      c.source,\n      c.updated_at,\n      c.last_accessed_at,\n      c.relevance_score,\n      bm25(memory_fts) AS bm25_score\n    FROM memory_fts\n    JOIN memory_chunks c ON memory_fts.id = c.id\n    WHERE memory_fts MATCH ?\n      ${whereClause}\n    ORDER BY bm25_score\n    LIMIT ?\n  `;\n\n  let rows: Array<{\n    id: string;\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    updated_at: number;\n    last_accessed_at: number | null;\n    relevance_score: number | null;\n    bm25_score: number;\n  }>;\n\n  try {\n    rows = db.prepare(sql).all(...params) as typeof rows;\n  } catch (e) {\n    // FTS5 MATCH throws on a malformed query, and for THAT an empty result is the\n    // honest answer — nothing matches a query that cannot be parsed.\n    //\n    // Everything else is a failure of the store: a missing table, a corrupt\n    // index, a locked database. Those used to return [] as well, which made an\n    // unusable index byte-identical to a genuine miss. The Postgres path had the\n    // same defect and it cost a real wrong answer on 2026-08-04 — the backend was\n    // down for two hours, every search reported \"No results found\", and a sibling\n    // session told the owner a DMARC note did not exist. See\n    // storage/postgres/search.ts.\n    if (!isQuerySyntaxError(e)) {\n      throw new Error(\n        `Memory keyword search failed — the index is unusable, so this is NOT an ` +\n          `empty result set. Cause: ${e instanceof Error ? e.message : String(e)}`\n      );\n    }\n    return [];\n  }\n\n  const minScore = opts?.minScore ?? 0.0;\n\n  return rows\n    .map((row) => {\n      // Negate so higher = better match for callers\n      const baseScore = -row.bm25_score;\n      // MR2: scale by feedback relevance_score: multiplier in [0.5, 1.5]\n      const relevanceScore = row.relevance_score ?? 0.5;\n      const score = baseScore * (0.5 + relevanceScore);\n      return {\n        chunkId: row.id,\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,\n        tier: row.tier,\n        source: row.source,\n        updatedAt: row.updated_at,\n        lastAccessedAt: row.last_accessed_at ?? undefined,\n      };\n    })\n    .filter((r) => r.score >= minScore);\n}\n\n// ---------------------------------------------------------------------------\n// Semantic search\n// ---------------------------------------------------------------------------\n\n/**\n * Search chunks using brute-force cosine similarity over stored embeddings.\n *\n * Only chunks that have a non-null embedding BLOB are considered.  Chunks\n * without embeddings are silently skipped (they can be embedded later via\n * `embedChunks()`).\n *\n * @param queryEmbedding  Pre-computed Float32Array for the search query.\n */\nexport function searchMemorySemantic(\n  db: Database,\n  queryEmbedding: Float32Array,\n  opts?: SearchOptions,\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n\n  // Build the SQL filter conditions\n  const conditions: string[] = [\"embedding IS NOT NULL\"];\n  const params: (string | number)[] = [];\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => \"?\").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(() => \"?\").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(() => \"?\").join(\", \");\n    conditions.push(`tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  const where = \"WHERE \" + conditions.join(\" AND \");\n\n  // Hard cap for SQLite semantic path — prevents OOM on large corpora.\n  // Use Postgres for production semantic search.\n  const sql = `\n    SELECT id, project_id, path, start_line, end_line, text, tier, source, embedding, updated_at, last_accessed_at, relevance_score\n    FROM memory_chunks\n    ${where}\n    LIMIT 5000\n  `;\n\n  const rows = db.prepare(sql).all(...params) as Array<{\n    id: string;\n    project_id: number;\n    path: string;\n    start_line: number;\n    end_line: number;\n    text: string;\n    tier: string;\n    source: string;\n    embedding: Buffer;\n    updated_at: number;\n    last_accessed_at: number | null;\n    relevance_score: number | null;\n  }>;\n\n  if (rows.length === 0) return [];\n\n  // Compute cosine similarity for every chunk\n  const scored = rows.map((row) => {\n    const vec = deserializeEmbedding(row.embedding);\n    const baseScore = cosineSimilarity(queryEmbedding, vec);\n    // MR2: scale by feedback relevance_score: multiplier in [0.5, 1.5]\n    const relevanceScore = row.relevance_score ?? 0.5;\n    const score = baseScore * (0.5 + relevanceScore);\n    return {\n      chunkId: row.id,\n      projectId: row.project_id,\n      path: row.path,\n      startLine: row.start_line,\n      endLine: row.end_line,\n      snippet: row.text,\n      score,\n      tier: row.tier,\n      source: row.source,\n      updatedAt: row.updated_at,\n      lastAccessedAt: row.last_accessed_at ?? undefined,\n    };\n  });\n\n  // Sort by descending similarity, apply optional min score filter, limit\n  const minScore = opts?.minScore ?? -Infinity;\n\n  return scored\n    .filter((r) => r.score >= minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults);\n}\n\n// ---------------------------------------------------------------------------\n// Hybrid search\n// ---------------------------------------------------------------------------\n\n/**\n * Combine BM25 keyword search and semantic search using normalized scores.\n *\n * Both score sets are min-max normalized to [0,1] before combining, so neither\n * dominates the other regardless of their raw scales.\n *\n * @param queryEmbedding  Pre-computed embedding for the query.\n * @param keywordWeight   Weight for BM25 score (default 0.5).\n * @param semanticWeight  Weight for cosine similarity score (default 0.5).\n */\nexport function searchMemoryHybrid(\n  db: Database,\n  query: string,\n  queryEmbedding: Float32Array,\n  opts?: SearchOptions & { keywordWeight?: number; semanticWeight?: number },\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n  const kw = opts?.keywordWeight ?? 0.5;\n  const sw = opts?.semanticWeight ?? 0.5;\n\n  // Fetch keyword results — 50 candidates is sufficient for min-max normalization\n  const keywordResults = searchMemory(db, query, {\n    ...opts,\n    maxResults: 50,\n  });\n\n  // Fetch semantic results — 50 candidates is sufficient for min-max normalization\n  const semanticResults = searchMemorySemantic(db, queryEmbedding, {\n    ...opts,\n    maxResults: 50,\n  });\n\n  if (keywordResults.length === 0 && semanticResults.length === 0) return [];\n\n  // Build a map of chunk ID → combined result\n  // Use \"projectId:path:startLine:endLine\" as a stable key (same as chunk IDs)\n  const keyFor = (r: SearchResult) =>\n    `${r.projectId}:${r.path}:${r.startLine}:${r.endLine}`;\n\n  // Min-max normalize helper\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  // Union of all chunk keys\n  const allKeys = new Set<string>([\n    ...keywordResults.map(keyFor),\n    ...semanticResults.map(keyFor),\n  ]);\n\n  // Build a lookup from key → result metadata\n  const metaMap = new Map<string, SearchResult>();\n  for (const r of [...keywordResults, ...semanticResults]) {\n    metaMap.set(keyFor(r), r);\n  }\n\n  // Combine scores\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 = kw * kwScore + sw * semScore;\n    combined.push({ ...meta, score: combinedScore, combinedScore });\n  }\n\n  // Sort by combined score descending\n  return combined\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults)\n    .map(({ combinedScore: _unused, ...r }) => r);\n}\n\n// ---------------------------------------------------------------------------\n// Access timestamp tracking (QW2)\n// ---------------------------------------------------------------------------\n\n/**\n * Update last_accessed_at for a set of chunk IDs to the current timestamp.\n *\n * Called after a successful search to record that these chunks were retrieved.\n * This enables the recency boost to account for access patterns, not just\n * modification time.\n *\n * Best-effort: errors are silently ignored so search is never blocked.\n */\nexport function touchChunksLastAccessed(db: Database, chunkIds: string[]): void {\n  if (chunkIds.length === 0) return;\n  try {\n    const now = Date.now();\n    const placeholders = chunkIds.map(() => \"?\").join(\", \");\n    db.prepare(\n      `UPDATE memory_chunks SET last_accessed_at = ? WHERE id IN (${placeholders})`\n    ).run(now, ...chunkIds);\n  } catch {\n    // non-critical — do not block search results\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Slug lookup helper\n// ---------------------------------------------------------------------------\n\n/**\n * Populate the projectSlug field on search results by looking up project IDs\n * in the registry database.\n */\nexport function populateSlugs(\n  results: SearchResult[],\n  registryDb: Database,\n): SearchResult[] {\n  if (results.length === 0) return results;\n\n  const ids = [...new Set(results.map((r) => r.projectId))];\n  const placeholders = ids.map(() => \"?\").join(\", \");\n  const rows = registryDb\n    .prepare(`SELECT id, slug FROM projects WHERE id IN (${placeholders})`)\n    .all(...ids) as Array<{ id: number; slug: string }>;\n\n  const slugMap = new Map(rows.map((r) => [r.id, r.slug]));\n\n  return results.map((r) => ({\n    ...r,\n    projectSlug: slugMap.get(r.projectId),\n  }));\n}\n\n// ---------------------------------------------------------------------------\n// Recency boost\n// ---------------------------------------------------------------------------\n\n/**\n * Apply exponential recency boost to search scores.\n *\n * Scores are first min-max normalized to [0,1], then multiplied by an\n * exponential decay factor based on chunk age.  Normalization is required\n * because the cross-encoder reranker produces negative logit scores — naive\n * multiplication of a negative score by a decay factor (0 < d ≤ 1) would\n * make the score *less* negative, effectively boosting old results instead\n * of penalizing them.\n *\n * Formula: score_final = normalized * exp(-lambda * age_days)\n * where lambda = ln(2) / halfLifeDays, normalized ∈ [0,1]\n *\n * With default halfLifeDays=90, a 3-month-old chunk retains 50% of its\n * normalized score, a 6-month-old retains 25%, and a 1-year-old ~6%.\n *\n * Results without an updatedAt timestamp receive no decay penalty.\n * Results are re-sorted by the boosted score after application.\n *\n * @param results      Search results with optional updatedAt timestamps.\n * @param halfLifeDays Score halves every N days. Default 90 (~3 months).\n * @returns New array sorted by decayed normalized score (descending).\n */\nexport function applyRecencyBoost(\n  results: SearchResult[],\n  halfLifeDays = 90,\n): SearchResult[] {\n  if (halfLifeDays <= 0 || results.length === 0) return results;\n\n  const lambda = Math.LN2 / halfLifeDays;\n  const now = Date.now();\n\n  // Min-max normalize scores to [0,1] so multiplicative decay works\n  // correctly regardless of the raw score sign/scale.\n  const scores = results.map((r) => r.score);\n  const minScore = Math.min(...scores);\n  const maxScore = Math.max(...scores);\n  const range = maxScore - minScore;\n\n  return results\n    .map((r) => {\n      const normalized = range === 0 ? 1 : (r.score - minScore) / range;\n      // QW2: use the more recent of updated_at and last_accessed_at for recency decay\n      const effectiveTs = r.updatedAt != null && r.lastAccessedAt != null\n        ? Math.max(r.updatedAt, r.lastAccessedAt)\n        : (r.lastAccessedAt ?? r.updatedAt);\n      const decay = effectiveTs\n        ? Math.exp(-lambda * Math.max(0, (now - effectiveTs) / 86_400_000))\n        : 1; // no timestamp → no penalty\n      return { ...r, score: normalized * decay };\n    })\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkFA,SAAgB,mBAAmB,GAAqB;CACtD,MAAM,MAAM,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;AACtD,QAAO,wEAAwE,KAAK,IAAI;;AAG1F,SAAgB,cAAc,OAAuB;CACnD,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,IAAI,EAAE,QAAQ,MAAM,OAAK,CAAC,GAAG;AAE3C,KAAI,OAAO,WAAW,EAEpB,QAAO,IAAI,MAAM,QAAQ,MAAM,OAAK,CAAC;AAGvC,QAAO,OAAO,KAAK,OAAO;;;;;;;;;;;;;;AAmB5B,SAAgB,aACd,IACA,OACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,WAAW,cAAc,MAAM;CAGrC,MAAM,aAAuB,EAAE;CAC/B,MAAM,SAA8B,CAAC,SAAS;AAE9C,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,CAAC,KAAK,KAAK;AAC9D,aAAW,KAAK,oBAAoB,aAAa,GAAG;AACpD,SAAO,KAAK,GAAG,KAAK,WAAW;;AAGjC,KAAI,MAAM,WAAW,KAAK,QAAQ,SAAS,GAAG;EAC5C,MAAM,eAAe,KAAK,QAAQ,UAAU,IAAI,CAAC,KAAK,KAAK;AAC3D,aAAW,KAAK,gBAAgB,aAAa,GAAG;AAChD,SAAO,KAAK,GAAG,KAAK,QAAQ;;AAG9B,KAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;EACxC,MAAM,eAAe,KAAK,MAAM,UAAU,IAAI,CAAC,KAAK,KAAK;AACzD,aAAW,KAAK,cAAc,aAAa,GAAG;AAC9C,SAAO,KAAK,GAAG,KAAK,MAAM;;CAG5B,MAAM,cAAc,WAAW,SAAS,IACpC,SAAS,WAAW,KAAK,QAAQ,GACjC;AAEJ,QAAO,KAAK,WAAW;CAIvB,MAAM,MAAM;;;;;;;;;;;;;;;;;QAiBN,YAAY;;;;CAKlB,IAAI;AAeJ,KAAI;AACF,SAAO,GAAG,QAAQ,IAAI,CAAC,IAAI,GAAG,OAAO;UAC9B,GAAG;AAWV,MAAI,CAAC,mBAAmB,EAAE,CACxB,OAAM,IAAI,MACR,oGAC8B,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,GACzE;AAEH,SAAO,EAAE;;CAGX,MAAM,WAAW,MAAM,YAAY;AAEnC,QAAO,KACJ,KAAK,QAAQ;EAKZ,MAAM,QAHY,CAAC,IAAI,cAGI,MADJ,IAAI,mBAAmB;AAE9C,SAAO;GACL,SAAS,IAAI;GACb,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb;GACA,MAAM,IAAI;GACV,QAAQ,IAAI;GACZ,WAAW,IAAI;GACf,gBAAgB,IAAI,oBAAoB;GACzC;GACD,CACD,QAAQ,MAAM,EAAE,SAAS,SAAS;;;;;;;;;;;AAgBvC,SAAgB,qBACd,IACA,gBACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CAGvC,MAAM,aAAuB,CAAC,wBAAwB;CACtD,MAAM,SAA8B,EAAE;AAEtC,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,CAAC,KAAK,KAAK;AAC9D,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,CAAC,KAAK,KAAK;AAC3D,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,CAAC,KAAK,KAAK;AACzD,aAAW,KAAK,YAAY,aAAa,GAAG;AAC5C,SAAO,KAAK,GAAG,KAAK,MAAM;;CAO5B,MAAM,MAAM;;;MAJE,WAAW,WAAW,KAAK,QAAQ,CAOvC;;;CAIV,MAAM,OAAO,GAAG,QAAQ,IAAI,CAAC,IAAI,GAAG,OAAO;AAe3C,KAAI,KAAK,WAAW,EAAG,QAAO,EAAE;CAGhC,MAAM,SAAS,KAAK,KAAK,QAAQ;EAK/B,MAAM,QAHY,iBAAiB,gBADvB,qBAAqB,IAAI,UAAU,CACQ,IAG5B,MADJ,IAAI,mBAAmB;AAE9C,SAAO;GACL,SAAS,IAAI;GACb,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb;GACA,MAAM,IAAI;GACV,QAAQ,IAAI;GACZ,WAAW,IAAI;GACf,gBAAgB,IAAI,oBAAoB;GACzC;GACD;CAGF,MAAM,WAAW,MAAM,YAAY;AAEnC,QAAO,OACJ,QAAQ,MAAM,EAAE,SAAS,SAAS,CAClC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,CACjC,MAAM,GAAG,WAAW;;;;;;;;;;;;AAiBzB,SAAgB,mBACd,IACA,OACA,gBACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,KAAK,MAAM,iBAAiB;CAClC,MAAM,KAAK,MAAM,kBAAkB;CAGnC,MAAM,iBAAiB,aAAa,IAAI,OAAO;EAC7C,GAAG;EACH,YAAY;EACb,CAAC;CAGF,MAAM,kBAAkB,qBAAqB,IAAI,gBAAgB;EAC/D,GAAG;EACH,YAAY;EACb,CAAC;AAEF,KAAI,eAAe,WAAW,KAAK,gBAAgB,WAAW,EAAG,QAAO,EAAE;CAI1E,MAAM,UAAU,MACd,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE;CAG/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;CAGhD,MAAM,UAAU,IAAI,IAAY,CAC9B,GAAG,eAAe,IAAI,OAAO,EAC7B,GAAG,gBAAgB,IAAI,OAAO,CAC/B,CAAC;CAGF,MAAM,0BAAU,IAAI,KAA2B;AAC/C,MAAK,MAAM,KAAK,CAAC,GAAG,gBAAgB,GAAG,gBAAgB,CACrD,SAAQ,IAAI,OAAO,EAAE,EAAE,EAAE;CAI3B,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,KAAK,UAAU,KAAK;AAC1C,WAAS,KAAK;GAAE,GAAG;GAAM,OAAO;GAAe;GAAe,CAAC;;AAIjE,QAAO,SACJ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,CACjC,MAAM,GAAG,WAAW,CACpB,KAAK,EAAE,eAAe,SAAS,GAAG,QAAQ,EAAE;;;;;;;;;;;AAgBjD,SAAgB,wBAAwB,IAAc,UAA0B;AAC9E,KAAI,SAAS,WAAW,EAAG;AAC3B,KAAI;EACF,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,eAAe,SAAS,UAAU,IAAI,CAAC,KAAK,KAAK;AACvD,KAAG,QACD,8DAA8D,aAAa,GAC5E,CAAC,IAAI,KAAK,GAAG,SAAS;SACjB;;;;;;AAaV,SAAgB,cACd,SACA,YACgB;AAChB,KAAI,QAAQ,WAAW,EAAG,QAAO;CAEjC,MAAM,MAAM,CAAC,GAAG,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC;CACzD,MAAM,eAAe,IAAI,UAAU,IAAI,CAAC,KAAK,KAAK;CAClD,MAAM,OAAO,WACV,QAAQ,8CAA8C,aAAa,GAAG,CACtE,IAAI,GAAG,IAAI;CAEd,MAAM,UAAU,IAAI,IAAI,KAAK,KAAK,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAExD,QAAO,QAAQ,KAAK,OAAO;EACzB,GAAG;EACH,aAAa,QAAQ,IAAI,EAAE,UAAU;EACtC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;AA8BL,SAAgB,kBACd,SACA,eAAe,IACC;AAChB,KAAI,gBAAgB,KAAK,QAAQ,WAAW,EAAG,QAAO;CAEtD,MAAM,SAAS,KAAK,MAAM;CAC1B,MAAM,MAAM,KAAK,KAAK;CAItB,MAAM,SAAS,QAAQ,KAAK,MAAM,EAAE,MAAM;CAC1C,MAAM,WAAW,KAAK,IAAI,GAAG,OAAO;CAEpC,MAAM,QADW,KAAK,IAAI,GAAG,OAAO,GACX;AAEzB,QAAO,QACJ,KAAK,MAAM;EACV,MAAM,aAAa,UAAU,IAAI,KAAK,EAAE,QAAQ,YAAY;EAE5D,MAAM,cAAc,EAAE,aAAa,QAAQ,EAAE,kBAAkB,OAC3D,KAAK,IAAI,EAAE,WAAW,EAAE,eAAe,GACtC,EAAE,kBAAkB,EAAE;EAC3B,MAAM,QAAQ,cACV,KAAK,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,MAAM,eAAe,MAAW,CAAC,GACjE;AACJ,SAAO;GAAE,GAAG;GAAG,OAAO,aAAa;GAAO;GAC1C,CACD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM"}
+{"version":3,"file":"search-Rpk1cSBC.mjs","names":[],"sources":["../src/memory/search.ts"],"sourcesContent":["/**\n * Search over the PAI federation memory index.\n *\n * Provides three search modes:\n *  - keyword  — BM25 full-text search (default, fast, no ML required)\n *  - semantic — Brute-force cosine similarity over pre-computed embeddings\n *  - hybrid   — Normalized combination of BM25 + cosine scores\n *\n * BM25 uses SQLite's FTS5 extension.  Semantic search requires embeddings to\n * have been generated first via `embedChunks()` in the indexer.\n */\n\nimport type { Database } from \"better-sqlite3\";\nimport { deserializeEmbedding, cosineSimilarity } from \"./embeddings.js\";\nimport { STOP_WORDS } from \"../utils/stop-words.js\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface SearchResult {\n  projectId: number;\n  projectSlug?: string;   // populated from registry after search when available\n  path: string;\n  startLine: number;\n  endLine: number;\n  snippet: string;\n  score: number;          // raw BM25 score (lower = more relevant in FTS5)\n  tier: string;\n  source: string;\n  updatedAt?: number;     // Unix ms from memory_chunks.updated_at\n  lastAccessedAt?: number; // Unix ms from memory_chunks.last_accessed_at (QW2)\n  chunkId?: string;        // chunk ID for last_accessed_at update (QW2)\n}\n\nexport interface SearchOptions {\n  /** Restrict search to these project IDs. */\n  projectIds?: number[];\n  /** Restrict to 'memory' or 'notes' sources. */\n  sources?: string[];\n  /** Restrict to specific tier(s): 'evergreen' | 'daily' | 'topic' | 'session' */\n  tiers?: string[];\n  /** Maximum number of results to return. Default 10. */\n  maxResults?: number;\n  /** Minimum BM25 score threshold (FTS5 scores are negative; 0.0 means no filter). */\n  minScore?: number;\n}\n\n// STOP_WORDS imported from utils/stop-words.ts\n\n// ---------------------------------------------------------------------------\n// Query builder\n// ---------------------------------------------------------------------------\n\n/**\n * Convert a free-text query into an FTS5 query string.\n *\n * Strategy:\n *  1. Tokenise by whitespace and punctuation\n *  2. Remove stop words and tokens shorter than 2 characters\n *  3. Double-quote each remaining token (exact word form)\n *  4. Join with OR so that any matching token returns a result\n *\n * Using OR instead of AND is critical for multi-word queries: the words rarely\n * all appear in the same chunk, so AND would return zero results.  FTS5 BM25\n * scoring naturally ranks chunks where more terms match higher, so the most\n * relevant chunks still surface at the top.\n *\n * Example: \"Synchrotech interview follow-up Gilles\"\n *   → `\"synchrotech\" OR \"interview\" OR \"follow\" OR \"gilles\"`\n *   → chunks matching any term, ranked by how many terms match\n */\n/**\n * Did SQLite reject the QUERY, or fail at the STORE?\n *\n * Only the first justifies an empty result. FTS5 reports a bad MATCH expression\n * with a recognisable message; a missing table, a corrupt index or a locked\n * database do not, and must not be reported as \"nothing found\".\n *\n * Matching on message text is unlovely, and the alternative — treating every\n * failure as empty — is what produced a confidently wrong answer to a human.\n */\nexport function isQuerySyntaxError(e: unknown): boolean {\n  const msg = e instanceof Error ? e.message : String(e);\n  return /fts5|malformed MATCH|syntax error|unterminated string|no such column/i.test(msg);\n}\n\nexport function buildFtsQuery(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    // Escape any double-quotes inside the token (FTS5 uses them as delimiters)\n    .map((t) => `\"${t.replace(/\"/g, '\"\"')}\"`)\n\n  if (tokens.length === 0) {\n    // Fallback: use original query as a raw string (may produce no results)\n    return `\"${query.replace(/\"/g, '\"\"')}\"`;\n  }\n\n  return tokens.join(\" OR \");\n}\n\n// ---------------------------------------------------------------------------\n// Search\n// ---------------------------------------------------------------------------\n\n/**\n * Search across all indexed memory using FTS5 BM25 ranking.\n *\n * Results are ordered by BM25 score (most relevant first).\n * FTS5 bm25() returns negative values; closer to 0 = more relevant.\n * We negate the score so callers get positive values where higher = better.\n *\n * Multilingual note: SQLite FTS5 uses the `unicode61` tokenizer by default,\n * which handles Unicode correctly (German umlauts, French accents, etc.) without\n * language-specific stemming. No changes needed here — it is already\n * multilingual-safe.\n */\nexport function searchMemory(\n  db: Database,\n  query: string,\n  opts?: SearchOptions,\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n  const ftsQuery = buildFtsQuery(query);\n\n  // Build the SQL with optional filters\n  const conditions: string[] = [];\n  const params: (string | number)[] = [ftsQuery];\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => \"?\").join(\", \");\n    conditions.push(`c.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(() => \"?\").join(\", \");\n    conditions.push(`c.source IN (${placeholders})`);\n    params.push(...opts.sources);\n  }\n\n  if (opts?.tiers && opts.tiers.length > 0) {\n    const placeholders = opts.tiers.map(() => \"?\").join(\", \");\n    conditions.push(`c.tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  const whereClause = conditions.length > 0\n    ? \"AND \" + conditions.join(\" AND \")\n    : \"\";\n\n  params.push(maxResults);\n\n  // FTS5: join memory_fts with memory_chunks to get metadata\n  // bm25(memory_fts) returns negative values (lower = better match)\n  const sql = `\n    SELECT\n      c.id,\n      c.project_id,\n      c.path,\n      c.start_line,\n      c.end_line,\n      c.text             AS snippet,\n      c.tier,\n      c.source,\n      c.updated_at,\n      c.last_accessed_at,\n      c.relevance_score,\n      bm25(memory_fts) AS bm25_score\n    FROM memory_fts\n    JOIN memory_chunks c ON memory_fts.id = c.id\n    WHERE memory_fts MATCH ?\n      ${whereClause}\n    ORDER BY bm25_score\n    LIMIT ?\n  `;\n\n  let rows: Array<{\n    id: string;\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    updated_at: number;\n    last_accessed_at: number | null;\n    relevance_score: number | null;\n    bm25_score: number;\n  }>;\n\n  try {\n    rows = db.prepare(sql).all(...params) as typeof rows;\n  } catch (e) {\n    // FTS5 MATCH throws on a malformed query, and for THAT an empty result is the\n    // honest answer — nothing matches a query that cannot be parsed.\n    //\n    // Everything else is a failure of the store: a missing table, a corrupt\n    // index, a locked database. Those used to return [] as well, which made an\n    // unusable index byte-identical to a genuine miss. The Postgres path had the\n    // same defect and it cost a real wrong answer on 2026-08-04 — the backend was\n    // down for two hours, every search reported \"No results found\", and a sibling\n    // session told the owner a DMARC note did not exist. See\n    // storage/postgres/search.ts.\n    if (!isQuerySyntaxError(e)) {\n      throw new Error(\n        `Memory keyword search failed — the index is unusable, so this is NOT an ` +\n          `empty result set. Cause: ${e instanceof Error ? e.message : String(e)}`\n      );\n    }\n    return [];\n  }\n\n  const minScore = opts?.minScore ?? 0.0;\n\n  return rows\n    .map((row) => {\n      // Negate so higher = better match for callers\n      const baseScore = -row.bm25_score;\n      // MR2: scale by feedback relevance_score: multiplier in [0.5, 1.5]\n      const relevanceScore = row.relevance_score ?? 0.5;\n      const score = baseScore * (0.5 + relevanceScore);\n      return {\n        chunkId: row.id,\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,\n        tier: row.tier,\n        source: row.source,\n        updatedAt: row.updated_at,\n        lastAccessedAt: row.last_accessed_at ?? undefined,\n      };\n    })\n    .filter((r) => r.score >= minScore);\n}\n\n// ---------------------------------------------------------------------------\n// Semantic search\n// ---------------------------------------------------------------------------\n\n/**\n * Search chunks using brute-force cosine similarity over stored embeddings.\n *\n * Only chunks that have a non-null embedding BLOB are considered.  Chunks\n * without embeddings are silently skipped (they can be embedded later via\n * `embedChunks()`).\n *\n * @param queryEmbedding  Pre-computed Float32Array for the search query.\n */\nexport function searchMemorySemantic(\n  db: Database,\n  queryEmbedding: Float32Array,\n  opts?: SearchOptions,\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n\n  // Build the SQL filter conditions\n  const conditions: string[] = [\"embedding IS NOT NULL\"];\n  const params: (string | number)[] = [];\n\n  if (opts?.projectIds && opts.projectIds.length > 0) {\n    const placeholders = opts.projectIds.map(() => \"?\").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(() => \"?\").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(() => \"?\").join(\", \");\n    conditions.push(`tier IN (${placeholders})`);\n    params.push(...opts.tiers);\n  }\n\n  const where = \"WHERE \" + conditions.join(\" AND \");\n\n  // Hard cap for SQLite semantic path — prevents OOM on large corpora.\n  // Use Postgres for production semantic search.\n  const sql = `\n    SELECT id, project_id, path, start_line, end_line, text, tier, source, embedding, updated_at, last_accessed_at, relevance_score\n    FROM memory_chunks\n    ${where}\n    LIMIT 5000\n  `;\n\n  const rows = db.prepare(sql).all(...params) as Array<{\n    id: string;\n    project_id: number;\n    path: string;\n    start_line: number;\n    end_line: number;\n    text: string;\n    tier: string;\n    source: string;\n    embedding: Buffer;\n    updated_at: number;\n    last_accessed_at: number | null;\n    relevance_score: number | null;\n  }>;\n\n  if (rows.length === 0) return [];\n\n  // Compute cosine similarity for every chunk\n  const scored = rows.map((row) => {\n    const vec = deserializeEmbedding(row.embedding);\n    const baseScore = cosineSimilarity(queryEmbedding, vec);\n    // MR2: scale by feedback relevance_score: multiplier in [0.5, 1.5]\n    const relevanceScore = row.relevance_score ?? 0.5;\n    const score = baseScore * (0.5 + relevanceScore);\n    return {\n      chunkId: row.id,\n      projectId: row.project_id,\n      path: row.path,\n      startLine: row.start_line,\n      endLine: row.end_line,\n      snippet: row.text,\n      score,\n      tier: row.tier,\n      source: row.source,\n      updatedAt: row.updated_at,\n      lastAccessedAt: row.last_accessed_at ?? undefined,\n    };\n  });\n\n  // Sort by descending similarity, apply optional min score filter, limit\n  const minScore = opts?.minScore ?? -Infinity;\n\n  return scored\n    .filter((r) => r.score >= minScore)\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults);\n}\n\n// ---------------------------------------------------------------------------\n// Hybrid search\n// ---------------------------------------------------------------------------\n\n/**\n * Combine BM25 keyword search and semantic search using normalized scores.\n *\n * Both score sets are min-max normalized to [0,1] before combining, so neither\n * dominates the other regardless of their raw scales.\n *\n * @param queryEmbedding  Pre-computed embedding for the query.\n * @param keywordWeight   Weight for BM25 score (default 0.5).\n * @param semanticWeight  Weight for cosine similarity score (default 0.5).\n */\nexport function searchMemoryHybrid(\n  db: Database,\n  query: string,\n  queryEmbedding: Float32Array,\n  opts?: SearchOptions & { keywordWeight?: number; semanticWeight?: number },\n): SearchResult[] {\n  const maxResults = opts?.maxResults ?? 10;\n  const kw = opts?.keywordWeight ?? 0.5;\n  const sw = opts?.semanticWeight ?? 0.5;\n\n  // Fetch keyword results — 50 candidates is sufficient for min-max normalization\n  const keywordResults = searchMemory(db, query, {\n    ...opts,\n    maxResults: 50,\n  });\n\n  // Fetch semantic results — 50 candidates is sufficient for min-max normalization\n  const semanticResults = searchMemorySemantic(db, queryEmbedding, {\n    ...opts,\n    maxResults: 50,\n  });\n\n  if (keywordResults.length === 0 && semanticResults.length === 0) return [];\n\n  // Build a map of chunk ID → combined result\n  // Use \"projectId:path:startLine:endLine\" as a stable key (same as chunk IDs)\n  const keyFor = (r: SearchResult) =>\n    `${r.projectId}:${r.path}:${r.startLine}:${r.endLine}`;\n\n  // Min-max normalize helper\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  // Union of all chunk keys\n  const allKeys = new Set<string>([\n    ...keywordResults.map(keyFor),\n    ...semanticResults.map(keyFor),\n  ]);\n\n  // Build a lookup from key → result metadata\n  const metaMap = new Map<string, SearchResult>();\n  for (const r of [...keywordResults, ...semanticResults]) {\n    metaMap.set(keyFor(r), r);\n  }\n\n  // Combine scores\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 = kw * kwScore + sw * semScore;\n    combined.push({ ...meta, score: combinedScore, combinedScore });\n  }\n\n  // Sort by combined score descending\n  return combined\n    .sort((a, b) => b.score - a.score)\n    .slice(0, maxResults)\n    .map(({ combinedScore: _unused, ...r }) => r);\n}\n\n// ---------------------------------------------------------------------------\n// Access timestamp tracking (QW2)\n// ---------------------------------------------------------------------------\n\n/**\n * Update last_accessed_at for a set of chunk IDs to the current timestamp.\n *\n * Called after a successful search to record that these chunks were retrieved.\n * This enables the recency boost to account for access patterns, not just\n * modification time.\n *\n * Best-effort: errors are silently ignored so search is never blocked.\n */\nexport function touchChunksLastAccessed(db: Database, chunkIds: string[]): void {\n  if (chunkIds.length === 0) return;\n  try {\n    const now = Date.now();\n    const placeholders = chunkIds.map(() => \"?\").join(\", \");\n    db.prepare(\n      `UPDATE memory_chunks SET last_accessed_at = ? WHERE id IN (${placeholders})`\n    ).run(now, ...chunkIds);\n  } catch {\n    // non-critical — do not block search results\n  }\n}\n\n// ---------------------------------------------------------------------------\n// Slug lookup helper\n// ---------------------------------------------------------------------------\n\n/**\n * Populate the projectSlug field on search results by looking up project IDs\n * in the registry database.\n */\nexport function populateSlugs(\n  results: SearchResult[],\n  registryDb: Database,\n): SearchResult[] {\n  if (results.length === 0) return results;\n\n  const ids = [...new Set(results.map((r) => r.projectId))];\n  const placeholders = ids.map(() => \"?\").join(\", \");\n  const rows = registryDb\n    .prepare(`SELECT id, slug FROM projects WHERE id IN (${placeholders})`)\n    .all(...ids) as Array<{ id: number; slug: string }>;\n\n  const slugMap = new Map(rows.map((r) => [r.id, r.slug]));\n\n  return results.map((r) => ({\n    ...r,\n    projectSlug: slugMap.get(r.projectId),\n  }));\n}\n\n// ---------------------------------------------------------------------------\n// Recency boost\n// ---------------------------------------------------------------------------\n\n/**\n * Apply exponential recency boost to search scores.\n *\n * Scores are first min-max normalized to [0,1], then multiplied by an\n * exponential decay factor based on chunk age.  Normalization is required\n * because the cross-encoder reranker produces negative logit scores — naive\n * multiplication of a negative score by a decay factor (0 < d ≤ 1) would\n * make the score *less* negative, effectively boosting old results instead\n * of penalizing them.\n *\n * Formula: score_final = normalized * exp(-lambda * age_days)\n * where lambda = ln(2) / halfLifeDays, normalized ∈ [0,1]\n *\n * With default halfLifeDays=90, a 3-month-old chunk retains 50% of its\n * normalized score, a 6-month-old retains 25%, and a 1-year-old ~6%.\n *\n * Results without an updatedAt timestamp receive no decay penalty.\n * Results are re-sorted by the boosted score after application.\n *\n * @param results      Search results with optional updatedAt timestamps.\n * @param halfLifeDays Score halves every N days. Default 90 (~3 months).\n * @returns New array sorted by decayed normalized score (descending).\n */\nexport function applyRecencyBoost(\n  results: SearchResult[],\n  halfLifeDays = 90,\n): SearchResult[] {\n  if (halfLifeDays <= 0 || results.length === 0) return results;\n\n  const lambda = Math.LN2 / halfLifeDays;\n  const now = Date.now();\n\n  // Min-max normalize scores to [0,1] so multiplicative decay works\n  // correctly regardless of the raw score sign/scale.\n  const scores = results.map((r) => r.score);\n  const minScore = Math.min(...scores);\n  const maxScore = Math.max(...scores);\n  const range = maxScore - minScore;\n\n  return results\n    .map((r) => {\n      const normalized = range === 0 ? 1 : (r.score - minScore) / range;\n      // QW2: use the more recent of updated_at and last_accessed_at for recency decay\n      const effectiveTs = r.updatedAt != null && r.lastAccessedAt != null\n        ? Math.max(r.updatedAt, r.lastAccessedAt)\n        : (r.lastAccessedAt ?? r.updatedAt);\n      const decay = effectiveTs\n        ? Math.exp(-lambda * Math.max(0, (now - effectiveTs) / 86_400_000))\n        : 1; // no timestamp → no penalty\n      return { ...r, score: normalized * decay };\n    })\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkFA,SAAgB,mBAAmB,GAAqB;CACtD,MAAM,MAAM,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE;AACtD,QAAO,wEAAwE,KAAK,IAAI;;AAG1F,SAAgB,cAAc,OAAuB;CACnD,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,IAAI,EAAE,QAAQ,MAAM,OAAK,CAAC,GAAG;AAE3C,KAAI,OAAO,WAAW,EAEpB,QAAO,IAAI,MAAM,QAAQ,MAAM,OAAK,CAAC;AAGvC,QAAO,OAAO,KAAK,OAAO;;;;;;;;;;;;;;AAmB5B,SAAgB,aACd,IACA,OACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,WAAW,cAAc,MAAM;CAGrC,MAAM,aAAuB,EAAE;CAC/B,MAAM,SAA8B,CAAC,SAAS;AAE9C,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,CAAC,KAAK,KAAK;AAC9D,aAAW,KAAK,oBAAoB,aAAa,GAAG;AACpD,SAAO,KAAK,GAAG,KAAK,WAAW;;AAGjC,KAAI,MAAM,WAAW,KAAK,QAAQ,SAAS,GAAG;EAC5C,MAAM,eAAe,KAAK,QAAQ,UAAU,IAAI,CAAC,KAAK,KAAK;AAC3D,aAAW,KAAK,gBAAgB,aAAa,GAAG;AAChD,SAAO,KAAK,GAAG,KAAK,QAAQ;;AAG9B,KAAI,MAAM,SAAS,KAAK,MAAM,SAAS,GAAG;EACxC,MAAM,eAAe,KAAK,MAAM,UAAU,IAAI,CAAC,KAAK,KAAK;AACzD,aAAW,KAAK,cAAc,aAAa,GAAG;AAC9C,SAAO,KAAK,GAAG,KAAK,MAAM;;CAG5B,MAAM,cAAc,WAAW,SAAS,IACpC,SAAS,WAAW,KAAK,QAAQ,GACjC;AAEJ,QAAO,KAAK,WAAW;CAIvB,MAAM,MAAM;;;;;;;;;;;;;;;;;QAiBN,YAAY;;;;CAKlB,IAAI;AAeJ,KAAI;AACF,SAAO,GAAG,QAAQ,IAAI,CAAC,IAAI,GAAG,OAAO;UAC9B,GAAG;AAWV,MAAI,CAAC,mBAAmB,EAAE,CACxB,OAAM,IAAI,MACR,oGAC8B,aAAa,QAAQ,EAAE,UAAU,OAAO,EAAE,GACzE;AAEH,SAAO,EAAE;;CAGX,MAAM,WAAW,MAAM,YAAY;AAEnC,QAAO,KACJ,KAAK,QAAQ;EAKZ,MAAM,QAHY,CAAC,IAAI,cAGI,MADJ,IAAI,mBAAmB;AAE9C,SAAO;GACL,SAAS,IAAI;GACb,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb;GACA,MAAM,IAAI;GACV,QAAQ,IAAI;GACZ,WAAW,IAAI;GACf,gBAAgB,IAAI,oBAAoB;GACzC;GACD,CACD,QAAQ,MAAM,EAAE,SAAS,SAAS;;;;;;;;;;;AAgBvC,SAAgB,qBACd,IACA,gBACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CAGvC,MAAM,aAAuB,CAAC,wBAAwB;CACtD,MAAM,SAA8B,EAAE;AAEtC,KAAI,MAAM,cAAc,KAAK,WAAW,SAAS,GAAG;EAClD,MAAM,eAAe,KAAK,WAAW,UAAU,IAAI,CAAC,KAAK,KAAK;AAC9D,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,CAAC,KAAK,KAAK;AAC3D,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,CAAC,KAAK,KAAK;AACzD,aAAW,KAAK,YAAY,aAAa,GAAG;AAC5C,SAAO,KAAK,GAAG,KAAK,MAAM;;CAO5B,MAAM,MAAM;;;MAJE,WAAW,WAAW,KAAK,QAAQ,CAOvC;;;CAIV,MAAM,OAAO,GAAG,QAAQ,IAAI,CAAC,IAAI,GAAG,OAAO;AAe3C,KAAI,KAAK,WAAW,EAAG,QAAO,EAAE;CAGhC,MAAM,SAAS,KAAK,KAAK,QAAQ;EAK/B,MAAM,QAHY,iBAAiB,gBADvB,qBAAqB,IAAI,UAAU,CACQ,IAG5B,MADJ,IAAI,mBAAmB;AAE9C,SAAO;GACL,SAAS,IAAI;GACb,WAAW,IAAI;GACf,MAAM,IAAI;GACV,WAAW,IAAI;GACf,SAAS,IAAI;GACb,SAAS,IAAI;GACb;GACA,MAAM,IAAI;GACV,QAAQ,IAAI;GACZ,WAAW,IAAI;GACf,gBAAgB,IAAI,oBAAoB;GACzC;GACD;CAGF,MAAM,WAAW,MAAM,YAAY;AAEnC,QAAO,OACJ,QAAQ,MAAM,EAAE,SAAS,SAAS,CAClC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,CACjC,MAAM,GAAG,WAAW;;;;;;;;;;;;AAiBzB,SAAgB,mBACd,IACA,OACA,gBACA,MACgB;CAChB,MAAM,aAAa,MAAM,cAAc;CACvC,MAAM,KAAK,MAAM,iBAAiB;CAClC,MAAM,KAAK,MAAM,kBAAkB;CAGnC,MAAM,iBAAiB,aAAa,IAAI,OAAO;EAC7C,GAAG;EACH,YAAY;EACb,CAAC;CAGF,MAAM,kBAAkB,qBAAqB,IAAI,gBAAgB;EAC/D,GAAG;EACH,YAAY;EACb,CAAC;AAEF,KAAI,eAAe,WAAW,KAAK,gBAAgB,WAAW,EAAG,QAAO,EAAE;CAI1E,MAAM,UAAU,MACd,GAAG,EAAE,UAAU,GAAG,EAAE,KAAK,GAAG,EAAE,UAAU,GAAG,EAAE;CAG/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;CAGhD,MAAM,UAAU,IAAI,IAAY,CAC9B,GAAG,eAAe,IAAI,OAAO,EAC7B,GAAG,gBAAgB,IAAI,OAAO,CAC/B,CAAC;CAGF,MAAM,0BAAU,IAAI,KAA2B;AAC/C,MAAK,MAAM,KAAK,CAAC,GAAG,gBAAgB,GAAG,gBAAgB,CACrD,SAAQ,IAAI,OAAO,EAAE,EAAE,EAAE;CAI3B,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,KAAK,UAAU,KAAK;AAC1C,WAAS,KAAK;GAAE,GAAG;GAAM,OAAO;GAAe;GAAe,CAAC;;AAIjE,QAAO,SACJ,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM,CACjC,MAAM,GAAG,WAAW,CACpB,KAAK,EAAE,eAAe,SAAS,GAAG,QAAQ,EAAE;;;;;;;;;;;AAgBjD,SAAgB,wBAAwB,IAAc,UAA0B;AAC9E,KAAI,SAAS,WAAW,EAAG;AAC3B,KAAI;EACF,MAAM,MAAM,KAAK,KAAK;EACtB,MAAM,eAAe,SAAS,UAAU,IAAI,CAAC,KAAK,KAAK;AACvD,KAAG,QACD,8DAA8D,aAAa,GAC5E,CAAC,IAAI,KAAK,GAAG,SAAS;SACjB;;;;;;AAaV,SAAgB,cACd,SACA,YACgB;AAChB,KAAI,QAAQ,WAAW,EAAG,QAAO;CAEjC,MAAM,MAAM,CAAC,GAAG,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,UAAU,CAAC,CAAC;CACzD,MAAM,eAAe,IAAI,UAAU,IAAI,CAAC,KAAK,KAAK;CAClD,MAAM,OAAO,WACV,QAAQ,8CAA8C,aAAa,GAAG,CACtE,IAAI,GAAG,IAAI;CAEd,MAAM,UAAU,IAAI,IAAI,KAAK,KAAK,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AAExD,QAAO,QAAQ,KAAK,OAAO;EACzB,GAAG;EACH,aAAa,QAAQ,IAAI,EAAE,UAAU;EACtC,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;AA8BL,SAAgB,kBACd,SACA,eAAe,IACC;AAChB,KAAI,gBAAgB,KAAK,QAAQ,WAAW,EAAG,QAAO;CAEtD,MAAM,SAAS,KAAK,MAAM;CAC1B,MAAM,MAAM,KAAK,KAAK;CAItB,MAAM,SAAS,QAAQ,KAAK,MAAM,EAAE,MAAM;CAC1C,MAAM,WAAW,KAAK,IAAI,GAAG,OAAO;CAEpC,MAAM,QADW,KAAK,IAAI,GAAG,OAAO,GACX;AAEzB,QAAO,QACJ,KAAK,MAAM;EACV,MAAM,aAAa,UAAU,IAAI,KAAK,EAAE,QAAQ,YAAY;EAE5D,MAAM,cAAc,EAAE,aAAa,QAAQ,EAAE,kBAAkB,OAC3D,KAAK,IAAI,EAAE,WAAW,EAAE,eAAe,GACtC,EAAE,kBAAkB,EAAE;EAC3B,MAAM,QAAQ,cACV,KAAK,IAAI,CAAC,SAAS,KAAK,IAAI,IAAI,MAAM,eAAe,MAAW,CAAC,GACjE;AACJ,SAAO;GAAE,GAAG;GAAG,OAAO,aAAa;GAAO;GAC1C,CACD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM"}

package/dist/{sources-BDwN0B8i.mjs → sources-D8ZdNfvK.mjs}

@@ -1,4 +1,4 @@
-import { _ as warn, c as ok, l as renderTable, n as dim, o as header, t as bold } from "./utils-BAxjW3j8.mjs";
+import { _ as warn, c as ok, n as dim, o as header, t as bold, u as renderTable } from "./utils-9Err2RBW.mjs";
 
 //#region src/cli/commands/memory/sources.ts
 /**
@@ -133,4 +133,4 @@ function tail(s, n) {
 
 //#endregion
 export { cmdMemorySources };
-//# sourceMappingURL=sources-BDwN0B8i.mjs.map
+//# sourceMappingURL=sources-D8ZdNfvK.mjs.map

package/dist/{sources-BDwN0B8i.mjs.map → sources-D8ZdNfvK.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"sources-BDwN0B8i.mjs","names":[],"sources":["../src/cli/commands/memory/sources.ts"],"sourcesContent":["/**\n * `pai memory sources` — what the indexer is actually taking in.\n *\n * The index had grown to ~1.5M chunks against a vault of ~2,700 notes, and\n * nothing in the CLI could show why. `memory status` refuses to report at all\n * when the backend is not SQLite, and `daemon status` gives three totals with no\n * composition — so answering \"what is it indexing, and why is it re-indexing\"\n * meant hand-writing aggregate SQL against the container.\n *\n * The cause, when it was finally measured, was visible in one breakdown: the\n * vault indexer follows symlinks out of the vault into cloud-synced trees, and\n * those trees have mtimes rewritten by the sync client on content that has not\n * changed. Each rewrite re-chunks the file, and re-chunking assigns new chunk\n * ids, which discards the embeddings — so the embedder was re-doing work\n * indefinitely while never catching up.\n *\n * Hence the four sections below. Each one exists because it was needed:\n *   composition — the vault dwarfing everything else is the first clue\n *   roots       — where content enters from, which is how symlink leakage shows\n *   heaviest    — single files contributing thousands of chunks (attachments)\n *   churn       — chunks rewritten per day, which is what distinguishes a\n *                 backlog that will finish from a treadmill that never will\n */\n\nimport { ok, warn, dim, bold, header, renderTable } from \"../../utils.js\";\nimport type { StorageBackend } from \"../../../storage/interface.js\";\n\ninterface Row {\n  label: string;\n  chunks: number;\n  embedded: number;\n}\n\ninterface ChurnRow {\n  day: string;\n  chunks: number;\n  embedded: number;\n}\n\n/** A backend that can answer aggregate SQL. Both concrete backends can. */\ninterface Queryable {\n  backendType: \"sqlite\" | \"postgres\";\n  getPool?: () => { query: (sql: string) => Promise<{ rows: unknown[] }> };\n  getSqliteDb?: () => { prepare: (sql: string) => { all: () => unknown[] } };\n}\n\n/**\n * Run one aggregate query against whichever backend is configured.\n *\n * The two dialects differ only in the epoch conversion, so the SQL is passed in\n * per-dialect rather than abstracted — an abstraction over four reporting\n * queries would cost more than it saves.\n */\nasync function queryRows(\n  backend: Queryable,\n  pgSql: string,\n  sqliteSql: string\n): Promise<Record<string, unknown>[]> {\n  if (backend.backendType === \"postgres\" && backend.getPool) {\n    const res = await backend.getPool().query(pgSql);\n    return res.rows as Record<string, unknown>[];\n  }\n  if (backend.getSqliteDb) {\n    return backend.getSqliteDb().prepare(sqliteSql).all() as Record<string, unknown>[];\n  }\n  return [];\n}\n\nconst num = (v: unknown): number => Number(v ?? 0);\nconst pct = (part: number, whole: number): string =>\n  whole === 0 ? \"—\" : `${Math.round((part / whole) * 100)}%`;\n\n/** Group the leading path segments, which is where content enters the index. */\nexport function rootOf(path: string, depth = 2): string {\n  const parts = path.split(\"/\").filter(Boolean);\n  if (parts.length <= depth) return path;\n  return parts.slice(0, depth).join(\"/\") + \"/…\";\n}\n\nexport async function cmdMemorySources(\n  backend: StorageBackend,\n  opts: { limit?: number } = {}\n): Promise<void> {\n  const q = backend as unknown as Queryable;\n  const limit = opts.limit ?? 8;\n\n  // ---- composition -------------------------------------------------------\n  const comp = (await queryRows(\n    q,\n    `SELECT source, tier, COUNT(*) AS chunks, COUNT(embedding) AS embedded\n       FROM pai_chunks GROUP BY source, tier ORDER BY COUNT(*) DESC`,\n    `SELECT source, tier, COUNT(*) AS chunks,\n            SUM(CASE WHEN embedding IS NOT NULL THEN 1 ELSE 0 END) AS embedded\n       FROM memory_chunks GROUP BY source, tier ORDER BY COUNT(*) DESC`\n  )) as Array<{ source: string; tier: string; chunks: unknown; embedded: unknown }>;\n\n  if (comp.length === 0) {\n    console.log();\n    console.log(warn(`  Nothing indexed yet, or the backend is unreachable.`));\n    console.log(dim(`  Backend: ${q.backendType}`));\n    console.log();\n    return;\n  }\n\n  const totalChunks = comp.reduce((s, r) => s + num(r.chunks), 0);\n  const totalEmbedded = comp.reduce((s, r) => s + num(r.embedded), 0);\n\n  console.log();\n  console.log(header(`What the indexer has taken in`));\n  console.log();\n  console.log(\n    `  ${bold(totalChunks.toLocaleString())} chunks   ` +\n      `${totalEmbedded.toLocaleString()} embedded (${pct(totalEmbedded, totalChunks)})   ` +\n      dim(`backend: ${q.backendType}`)\n  );\n  console.log();\n\n  console.log(\n    renderTable(\n      [\"source / tier\", \"chunks\", \"share\", \"embedded\"],\n      comp.map((r) => [\n        `${r.source} / ${r.tier}`,\n        num(r.chunks).toLocaleString(),\n        pct(num(r.chunks), totalChunks),\n        `${num(r.embedded).toLocaleString()} (${pct(num(r.embedded), num(r.chunks))})`,\n      ])\n    )\n  );\n\n  // ---- where it enters from ---------------------------------------------\n  const paths = (await queryRows(\n    q,\n    `SELECT path, COUNT(*) AS chunks FROM pai_chunks GROUP BY path`,\n    `SELECT path, COUNT(*) AS chunks FROM memory_chunks GROUP BY path`\n  )) as Array<{ path: string; chunks: unknown }>;\n\n  const byRoot = new Map<string, number>();\n  for (const r of paths) {\n    const k = rootOf(String(r.path ?? \"\"));\n    byRoot.set(k, (byRoot.get(k) ?? 0) + num(r.chunks));\n  }\n  const roots = [...byRoot.entries()].sort((a, b) => b[1] - a[1]).slice(0, limit);\n\n  console.log();\n  console.log(header(`Where it comes from`));\n  console.log(dim(`  A root you did not expect here is usually a symlink leading out of the vault.`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"root\", \"chunks\", \"share\"],\n      roots.map(([k, v]) => [k, v.toLocaleString(), pct(v, totalChunks)])\n    )\n  );\n\n  // ---- heaviest single files -------------------------------------------\n  const heaviest = [...paths]\n    .sort((a, b) => num(b.chunks) - num(a.chunks))\n    .slice(0, limit);\n\n  console.log();\n  console.log(header(`Heaviest single files`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"chunks\", \"path\"],\n      heaviest.map((r) => [num(r.chunks).toLocaleString(), tail(String(r.path ?? \"\"), 62)])\n    )\n  );\n\n  // ---- churn ------------------------------------------------------------\n  // The section that distinguishes a backlog from a treadmill. A day with a\n  // large chunk count and a small embedded count means those chunks were\n  // rewritten and their embeddings thrown away.\n  const churn = (await queryRows(\n    q,\n    `SELECT to_char(to_timestamp(updated_at/1000),'YYYY-MM-DD') AS day,\n            COUNT(*) AS chunks, COUNT(embedding) AS embedded\n       FROM pai_chunks GROUP BY day ORDER BY day DESC LIMIT 10`,\n    `SELECT date(updated_at/1000,'unixepoch') AS day, COUNT(*) AS chunks,\n            SUM(CASE WHEN embedding IS NOT NULL THEN 1 ELSE 0 END) AS embedded\n       FROM memory_chunks GROUP BY day ORDER BY day DESC LIMIT 10`\n  )) as unknown as ChurnRow[];\n\n  console.log();\n  console.log(header(`Rewritten per day`));\n  console.log(\n    dim(`  Many chunks with few embedded means they were re-chunked and their`)\n  );\n  console.log(dim(`  embeddings discarded — work the embedder has to redo.`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"day\", \"chunks touched\", \"of those embedded\"],\n      churn.map((r) => [\n        String(r.day),\n        num(r.chunks).toLocaleString(),\n        `${num(r.embedded).toLocaleString()} (${pct(num(r.embedded), num(r.chunks))})`,\n      ])\n    )\n  );\n\n  const missing = totalChunks - totalEmbedded;\n  console.log();\n  if (missing > 0) {\n    console.log(`  ${bold(missing.toLocaleString())} chunks still need embedding.`);\n  } else {\n    console.log(ok(`  Everything indexed is embedded.`));\n  }\n  console.log();\n}\n\n/** Keep the informative end of a long path. */\nfunction tail(s: string, n: number): string {\n  return s.length <= n ? s : \"…\" + s.slice(-(n - 1));\n}\n\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDA,eAAe,UACb,SACA,OACA,WACoC;AACpC,KAAI,QAAQ,gBAAgB,cAAc,QAAQ,QAEhD,SADY,MAAM,QAAQ,SAAS,CAAC,MAAM,MAAM,EACrC;AAEb,KAAI,QAAQ,YACV,QAAO,QAAQ,aAAa,CAAC,QAAQ,UAAU,CAAC,KAAK;AAEvD,QAAO,EAAE;;AAGX,MAAM,OAAO,MAAuB,OAAO,KAAK,EAAE;AAClD,MAAM,OAAO,MAAc,UACzB,UAAU,IAAI,MAAM,GAAG,KAAK,MAAO,OAAO,QAAS,IAAI,CAAC;;AAG1D,SAAgB,OAAO,MAAc,QAAQ,GAAW;CACtD,MAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,OAAO,QAAQ;AAC7C,KAAI,MAAM,UAAU,MAAO,QAAO;AAClC,QAAO,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG;;AAG3C,eAAsB,iBACpB,SACA,OAA2B,EAAE,EACd;CACf,MAAM,IAAI;CACV,MAAM,QAAQ,KAAK,SAAS;CAG5B,MAAM,OAAQ,MAAM,UAClB,GACA;sEAEA;;wEAGD;AAED,KAAI,KAAK,WAAW,GAAG;AACrB,UAAQ,KAAK;AACb,UAAQ,IAAI,KAAK,wDAAwD,CAAC;AAC1E,UAAQ,IAAI,IAAI,cAAc,EAAE,cAAc,CAAC;AAC/C,UAAQ,KAAK;AACb;;CAGF,MAAM,cAAc,KAAK,QAAQ,GAAG,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,EAAE;CAC/D,MAAM,gBAAgB,KAAK,QAAQ,GAAG,MAAM,IAAI,IAAI,EAAE,SAAS,EAAE,EAAE;AAEnE,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,gCAAgC,CAAC;AACpD,SAAQ,KAAK;AACb,SAAQ,IACN,KAAK,KAAK,YAAY,gBAAgB,CAAC,CAAC,YACnC,cAAc,gBAAgB,CAAC,aAAa,IAAI,eAAe,YAAY,CAAC,QAC/E,IAAI,YAAY,EAAE,cAAc,CACnC;AACD,SAAQ,KAAK;AAEb,SAAQ,IACN,YACE;EAAC;EAAiB;EAAU;EAAS;EAAW,EAChD,KAAK,KAAK,MAAM;EACd,GAAG,EAAE,OAAO,KAAK,EAAE;EACnB,IAAI,EAAE,OAAO,CAAC,gBAAgB;EAC9B,IAAI,IAAI,EAAE,OAAO,EAAE,YAAY;EAC/B,GAAG,IAAI,EAAE,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;EAC7E,CAAC,CACH,CACF;CAGD,MAAM,QAAS,MAAM,UACnB,GACA,iEACA,mEACD;CAED,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAK,MAAM,KAAK,OAAO;EACrB,MAAM,IAAI,OAAO,OAAO,EAAE,QAAQ,GAAG,CAAC;AACtC,SAAO,IAAI,IAAI,OAAO,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,CAAC;;CAErD,MAAM,QAAQ,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM;AAE/E,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,sBAAsB,CAAC;AAC1C,SAAQ,IAAI,IAAI,kFAAkF,CAAC;AACnG,SAAQ,KAAK;AACb,SAAQ,IACN,YACE;EAAC;EAAQ;EAAU;EAAQ,EAC3B,MAAM,KAAK,CAAC,GAAG,OAAO;EAAC;EAAG,EAAE,gBAAgB;EAAE,IAAI,GAAG,YAAY;EAAC,CAAC,CACpE,CACF;CAGD,MAAM,WAAW,CAAC,GAAG,MAAM,CACxB,MAAM,GAAG,MAAM,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,OAAO,CAAC,CAC7C,MAAM,GAAG,MAAM;AAElB,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,wBAAwB,CAAC;AAC5C,SAAQ,KAAK;AACb,SAAQ,IACN,YACE,CAAC,UAAU,OAAO,EAClB,SAAS,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,gBAAgB,EAAE,KAAK,OAAO,EAAE,QAAQ,GAAG,EAAE,GAAG,CAAC,CAAC,CACtF,CACF;CAMD,MAAM,QAAS,MAAM,UACnB,GACA;;iEAGA;;mEAGD;AAED,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,oBAAoB,CAAC;AACxC,SAAQ,IACN,IAAI,uEAAuE,CAC5E;AACD,SAAQ,IAAI,IAAI,0DAA0D,CAAC;AAC3E,SAAQ,KAAK;AACb,SAAQ,IACN,YACE;EAAC;EAAO;EAAkB;EAAoB,EAC9C,MAAM,KAAK,MAAM;EACf,OAAO,EAAE,IAAI;EACb,IAAI,EAAE,OAAO,CAAC,gBAAgB;EAC9B,GAAG,IAAI,EAAE,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;EAC7E,CAAC,CACH,CACF;CAED,MAAM,UAAU,cAAc;AAC9B,SAAQ,KAAK;AACb,KAAI,UAAU,EACZ,SAAQ,IAAI,KAAK,KAAK,QAAQ,gBAAgB,CAAC,CAAC,+BAA+B;KAE/E,SAAQ,IAAI,GAAG,oCAAoC,CAAC;AAEtD,SAAQ,KAAK;;;AAIf,SAAS,KAAK,GAAW,GAAmB;AAC1C,QAAO,EAAE,UAAU,IAAI,IAAI,MAAM,EAAE,MAAM,EAAE,IAAI,GAAG"}
+{"version":3,"file":"sources-D8ZdNfvK.mjs","names":[],"sources":["../src/cli/commands/memory/sources.ts"],"sourcesContent":["/**\n * `pai memory sources` — what the indexer is actually taking in.\n *\n * The index had grown to ~1.5M chunks against a vault of ~2,700 notes, and\n * nothing in the CLI could show why. `memory status` refuses to report at all\n * when the backend is not SQLite, and `daemon status` gives three totals with no\n * composition — so answering \"what is it indexing, and why is it re-indexing\"\n * meant hand-writing aggregate SQL against the container.\n *\n * The cause, when it was finally measured, was visible in one breakdown: the\n * vault indexer follows symlinks out of the vault into cloud-synced trees, and\n * those trees have mtimes rewritten by the sync client on content that has not\n * changed. Each rewrite re-chunks the file, and re-chunking assigns new chunk\n * ids, which discards the embeddings — so the embedder was re-doing work\n * indefinitely while never catching up.\n *\n * Hence the four sections below. Each one exists because it was needed:\n *   composition — the vault dwarfing everything else is the first clue\n *   roots       — where content enters from, which is how symlink leakage shows\n *   heaviest    — single files contributing thousands of chunks (attachments)\n *   churn       — chunks rewritten per day, which is what distinguishes a\n *                 backlog that will finish from a treadmill that never will\n */\n\nimport { ok, warn, dim, bold, header, renderTable } from \"../../utils.js\";\nimport type { StorageBackend } from \"../../../storage/interface.js\";\n\ninterface Row {\n  label: string;\n  chunks: number;\n  embedded: number;\n}\n\ninterface ChurnRow {\n  day: string;\n  chunks: number;\n  embedded: number;\n}\n\n/** A backend that can answer aggregate SQL. Both concrete backends can. */\ninterface Queryable {\n  backendType: \"sqlite\" | \"postgres\";\n  getPool?: () => { query: (sql: string) => Promise<{ rows: unknown[] }> };\n  getSqliteDb?: () => { prepare: (sql: string) => { all: () => unknown[] } };\n}\n\n/**\n * Run one aggregate query against whichever backend is configured.\n *\n * The two dialects differ only in the epoch conversion, so the SQL is passed in\n * per-dialect rather than abstracted — an abstraction over four reporting\n * queries would cost more than it saves.\n */\nasync function queryRows(\n  backend: Queryable,\n  pgSql: string,\n  sqliteSql: string\n): Promise<Record<string, unknown>[]> {\n  if (backend.backendType === \"postgres\" && backend.getPool) {\n    const res = await backend.getPool().query(pgSql);\n    return res.rows as Record<string, unknown>[];\n  }\n  if (backend.getSqliteDb) {\n    return backend.getSqliteDb().prepare(sqliteSql).all() as Record<string, unknown>[];\n  }\n  return [];\n}\n\nconst num = (v: unknown): number => Number(v ?? 0);\nconst pct = (part: number, whole: number): string =>\n  whole === 0 ? \"—\" : `${Math.round((part / whole) * 100)}%`;\n\n/** Group the leading path segments, which is where content enters the index. */\nexport function rootOf(path: string, depth = 2): string {\n  const parts = path.split(\"/\").filter(Boolean);\n  if (parts.length <= depth) return path;\n  return parts.slice(0, depth).join(\"/\") + \"/…\";\n}\n\nexport async function cmdMemorySources(\n  backend: StorageBackend,\n  opts: { limit?: number } = {}\n): Promise<void> {\n  const q = backend as unknown as Queryable;\n  const limit = opts.limit ?? 8;\n\n  // ---- composition -------------------------------------------------------\n  const comp = (await queryRows(\n    q,\n    `SELECT source, tier, COUNT(*) AS chunks, COUNT(embedding) AS embedded\n       FROM pai_chunks GROUP BY source, tier ORDER BY COUNT(*) DESC`,\n    `SELECT source, tier, COUNT(*) AS chunks,\n            SUM(CASE WHEN embedding IS NOT NULL THEN 1 ELSE 0 END) AS embedded\n       FROM memory_chunks GROUP BY source, tier ORDER BY COUNT(*) DESC`\n  )) as Array<{ source: string; tier: string; chunks: unknown; embedded: unknown }>;\n\n  if (comp.length === 0) {\n    console.log();\n    console.log(warn(`  Nothing indexed yet, or the backend is unreachable.`));\n    console.log(dim(`  Backend: ${q.backendType}`));\n    console.log();\n    return;\n  }\n\n  const totalChunks = comp.reduce((s, r) => s + num(r.chunks), 0);\n  const totalEmbedded = comp.reduce((s, r) => s + num(r.embedded), 0);\n\n  console.log();\n  console.log(header(`What the indexer has taken in`));\n  console.log();\n  console.log(\n    `  ${bold(totalChunks.toLocaleString())} chunks   ` +\n      `${totalEmbedded.toLocaleString()} embedded (${pct(totalEmbedded, totalChunks)})   ` +\n      dim(`backend: ${q.backendType}`)\n  );\n  console.log();\n\n  console.log(\n    renderTable(\n      [\"source / tier\", \"chunks\", \"share\", \"embedded\"],\n      comp.map((r) => [\n        `${r.source} / ${r.tier}`,\n        num(r.chunks).toLocaleString(),\n        pct(num(r.chunks), totalChunks),\n        `${num(r.embedded).toLocaleString()} (${pct(num(r.embedded), num(r.chunks))})`,\n      ])\n    )\n  );\n\n  // ---- where it enters from ---------------------------------------------\n  const paths = (await queryRows(\n    q,\n    `SELECT path, COUNT(*) AS chunks FROM pai_chunks GROUP BY path`,\n    `SELECT path, COUNT(*) AS chunks FROM memory_chunks GROUP BY path`\n  )) as Array<{ path: string; chunks: unknown }>;\n\n  const byRoot = new Map<string, number>();\n  for (const r of paths) {\n    const k = rootOf(String(r.path ?? \"\"));\n    byRoot.set(k, (byRoot.get(k) ?? 0) + num(r.chunks));\n  }\n  const roots = [...byRoot.entries()].sort((a, b) => b[1] - a[1]).slice(0, limit);\n\n  console.log();\n  console.log(header(`Where it comes from`));\n  console.log(dim(`  A root you did not expect here is usually a symlink leading out of the vault.`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"root\", \"chunks\", \"share\"],\n      roots.map(([k, v]) => [k, v.toLocaleString(), pct(v, totalChunks)])\n    )\n  );\n\n  // ---- heaviest single files -------------------------------------------\n  const heaviest = [...paths]\n    .sort((a, b) => num(b.chunks) - num(a.chunks))\n    .slice(0, limit);\n\n  console.log();\n  console.log(header(`Heaviest single files`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"chunks\", \"path\"],\n      heaviest.map((r) => [num(r.chunks).toLocaleString(), tail(String(r.path ?? \"\"), 62)])\n    )\n  );\n\n  // ---- churn ------------------------------------------------------------\n  // The section that distinguishes a backlog from a treadmill. A day with a\n  // large chunk count and a small embedded count means those chunks were\n  // rewritten and their embeddings thrown away.\n  const churn = (await queryRows(\n    q,\n    `SELECT to_char(to_timestamp(updated_at/1000),'YYYY-MM-DD') AS day,\n            COUNT(*) AS chunks, COUNT(embedding) AS embedded\n       FROM pai_chunks GROUP BY day ORDER BY day DESC LIMIT 10`,\n    `SELECT date(updated_at/1000,'unixepoch') AS day, COUNT(*) AS chunks,\n            SUM(CASE WHEN embedding IS NOT NULL THEN 1 ELSE 0 END) AS embedded\n       FROM memory_chunks GROUP BY day ORDER BY day DESC LIMIT 10`\n  )) as unknown as ChurnRow[];\n\n  console.log();\n  console.log(header(`Rewritten per day`));\n  console.log(\n    dim(`  Many chunks with few embedded means they were re-chunked and their`)\n  );\n  console.log(dim(`  embeddings discarded — work the embedder has to redo.`));\n  console.log();\n  console.log(\n    renderTable(\n      [\"day\", \"chunks touched\", \"of those embedded\"],\n      churn.map((r) => [\n        String(r.day),\n        num(r.chunks).toLocaleString(),\n        `${num(r.embedded).toLocaleString()} (${pct(num(r.embedded), num(r.chunks))})`,\n      ])\n    )\n  );\n\n  const missing = totalChunks - totalEmbedded;\n  console.log();\n  if (missing > 0) {\n    console.log(`  ${bold(missing.toLocaleString())} chunks still need embedding.`);\n  } else {\n    console.log(ok(`  Everything indexed is embedded.`));\n  }\n  console.log();\n}\n\n/** Keep the informative end of a long path. */\nfunction tail(s: string, n: number): string {\n  return s.length <= n ? s : \"…\" + s.slice(-(n - 1));\n}\n\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDA,eAAe,UACb,SACA,OACA,WACoC;AACpC,KAAI,QAAQ,gBAAgB,cAAc,QAAQ,QAEhD,SADY,MAAM,QAAQ,SAAS,CAAC,MAAM,MAAM,EACrC;AAEb,KAAI,QAAQ,YACV,QAAO,QAAQ,aAAa,CAAC,QAAQ,UAAU,CAAC,KAAK;AAEvD,QAAO,EAAE;;AAGX,MAAM,OAAO,MAAuB,OAAO,KAAK,EAAE;AAClD,MAAM,OAAO,MAAc,UACzB,UAAU,IAAI,MAAM,GAAG,KAAK,MAAO,OAAO,QAAS,IAAI,CAAC;;AAG1D,SAAgB,OAAO,MAAc,QAAQ,GAAW;CACtD,MAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,OAAO,QAAQ;AAC7C,KAAI,MAAM,UAAU,MAAO,QAAO;AAClC,QAAO,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,IAAI,GAAG;;AAG3C,eAAsB,iBACpB,SACA,OAA2B,EAAE,EACd;CACf,MAAM,IAAI;CACV,MAAM,QAAQ,KAAK,SAAS;CAG5B,MAAM,OAAQ,MAAM,UAClB,GACA;sEAEA;;wEAGD;AAED,KAAI,KAAK,WAAW,GAAG;AACrB,UAAQ,KAAK;AACb,UAAQ,IAAI,KAAK,wDAAwD,CAAC;AAC1E,UAAQ,IAAI,IAAI,cAAc,EAAE,cAAc,CAAC;AAC/C,UAAQ,KAAK;AACb;;CAGF,MAAM,cAAc,KAAK,QAAQ,GAAG,MAAM,IAAI,IAAI,EAAE,OAAO,EAAE,EAAE;CAC/D,MAAM,gBAAgB,KAAK,QAAQ,GAAG,MAAM,IAAI,IAAI,EAAE,SAAS,EAAE,EAAE;AAEnE,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,gCAAgC,CAAC;AACpD,SAAQ,KAAK;AACb,SAAQ,IACN,KAAK,KAAK,YAAY,gBAAgB,CAAC,CAAC,YACnC,cAAc,gBAAgB,CAAC,aAAa,IAAI,eAAe,YAAY,CAAC,QAC/E,IAAI,YAAY,EAAE,cAAc,CACnC;AACD,SAAQ,KAAK;AAEb,SAAQ,IACN,YACE;EAAC;EAAiB;EAAU;EAAS;EAAW,EAChD,KAAK,KAAK,MAAM;EACd,GAAG,EAAE,OAAO,KAAK,EAAE;EACnB,IAAI,EAAE,OAAO,CAAC,gBAAgB;EAC9B,IAAI,IAAI,EAAE,OAAO,EAAE,YAAY;EAC/B,GAAG,IAAI,EAAE,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;EAC7E,CAAC,CACH,CACF;CAGD,MAAM,QAAS,MAAM,UACnB,GACA,iEACA,mEACD;CAED,MAAM,yBAAS,IAAI,KAAqB;AACxC,MAAK,MAAM,KAAK,OAAO;EACrB,MAAM,IAAI,OAAO,OAAO,EAAE,QAAQ,GAAG,CAAC;AACtC,SAAO,IAAI,IAAI,OAAO,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,OAAO,CAAC;;CAErD,MAAM,QAAQ,CAAC,GAAG,OAAO,SAAS,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,GAAG,MAAM;AAE/E,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,sBAAsB,CAAC;AAC1C,SAAQ,IAAI,IAAI,kFAAkF,CAAC;AACnG,SAAQ,KAAK;AACb,SAAQ,IACN,YACE;EAAC;EAAQ;EAAU;EAAQ,EAC3B,MAAM,KAAK,CAAC,GAAG,OAAO;EAAC;EAAG,EAAE,gBAAgB;EAAE,IAAI,GAAG,YAAY;EAAC,CAAC,CACpE,CACF;CAGD,MAAM,WAAW,CAAC,GAAG,MAAM,CACxB,MAAM,GAAG,MAAM,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,OAAO,CAAC,CAC7C,MAAM,GAAG,MAAM;AAElB,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,wBAAwB,CAAC;AAC5C,SAAQ,KAAK;AACb,SAAQ,IACN,YACE,CAAC,UAAU,OAAO,EAClB,SAAS,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,gBAAgB,EAAE,KAAK,OAAO,EAAE,QAAQ,GAAG,EAAE,GAAG,CAAC,CAAC,CACtF,CACF;CAMD,MAAM,QAAS,MAAM,UACnB,GACA;;iEAGA;;mEAGD;AAED,SAAQ,KAAK;AACb,SAAQ,IAAI,OAAO,oBAAoB,CAAC;AACxC,SAAQ,IACN,IAAI,uEAAuE,CAC5E;AACD,SAAQ,IAAI,IAAI,0DAA0D,CAAC;AAC3E,SAAQ,KAAK;AACb,SAAQ,IACN,YACE;EAAC;EAAO;EAAkB;EAAoB,EAC9C,MAAM,KAAK,MAAM;EACf,OAAO,EAAE,IAAI;EACb,IAAI,EAAE,OAAO,CAAC,gBAAgB;EAC9B,GAAG,IAAI,EAAE,SAAS,CAAC,gBAAgB,CAAC,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;EAC7E,CAAC,CACH,CACF;CAED,MAAM,UAAU,cAAc;AAC9B,SAAQ,KAAK;AACb,KAAI,UAAU,EACZ,SAAQ,IAAI,KAAK,KAAK,QAAQ,gBAAgB,CAAC,CAAC,+BAA+B;KAE/E,SAAQ,IAAI,GAAG,oCAAoC,CAAC;AAEtD,SAAQ,KAAK;;;AAIf,SAAS,KAAK,GAAW,GAAmB;AAC1C,QAAO,EAAE,UAAU,IAAI,IAAI,MAAM,EAAE,MAAM,EAAE,IAAI,GAAG"}

package/dist/{sqlite-C6FHnMkn.mjs → sqlite-D1IaR8Am.mjs}

@@ -1,5 +1,5 @@
-import "./embeddings-Bn86ssxR.mjs";
-import { a as searchMemorySemantic, r as searchMemory } from "./search-C32zQ0V0.mjs";
+import "./embeddings-DOLZnT1X.mjs";
+import { a as searchMemory, s as searchMemorySemantic } from "./search-Rpk1cSBC.mjs";
 
 //#region src/storage/sqlite.ts
 var SQLiteBackend = class {
@@ -268,4 +268,4 @@ var SQLiteBackend = class {
 
 //#endregion
 export { SQLiteBackend };
-//# sourceMappingURL=sqlite-C6FHnMkn.mjs.map
+//# sourceMappingURL=sqlite-D1IaR8Am.mjs.map

package/dist/{sqlite-C6FHnMkn.mjs.map → sqlite-D1IaR8Am.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"sqlite-C6FHnMkn.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-D1IaR8Am.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"}