@tekmidian/pai 0.63.0 → 0.65.0

package/dist/index.d.mts

@@ -433,18 +433,13 @@ declare function readPaiMarker(projectRoot: string): {
 declare function discoverPaiMarkers(searchDirs: string[]): PaiMarker[];
 //#endregion
 //#region src/memory/chunker.d.ts
-/**
- * Markdown text chunker for the PAI memory engine.
- *
- * Splits markdown files into overlapping text segments suitable for BM25
- * full-text indexing.  Respects heading boundaries where possible, falling
- * back to paragraph and sentence splitting when sections are large.
- */
 interface Chunk {
   text: string;
   startLine: number;
   endLine: number;
   hash: string;
+  /** Ancestor heading titles, outermost first, including the chunk's own section heading. */
+  headingPath: string[];
 }
 interface ChunkOptions {
   /** Approximate maximum tokens per chunk. Default 400. */
@@ -457,6 +452,29 @@ interface ChunkOptions {
  * Matches the OpenClaw estimate approach.
  */
 declare function estimateTokens(text: string): number;
+interface Heading {
+  level: number;
+  title: string;
+  line: number;
+}
+/**
+ * Parse ATX headings (levels 1-6) from lines. Lines inside ``` or ~~~ fences
+ * are never headings.
+ */
+declare function parseHeadings(lines: string[]): Heading[];
+interface OutlineNode {
+  level: number;
+  title: string;
+  startLine: number;
+  endLine: number;
+  tokens: number;
+  children: OutlineNode[];
+}
+/**
+ * Heading tree of a markdown file. A section ends on the line before the next
+ * heading of the same or higher level (or at EOF) and includes its children.
+ */
+declare function buildOutline(content: string): OutlineNode[];
 declare function chunkMarkdown(content: string, opts?: ChunkOptions): Chunk[];
 //#endregion
 //#region src/memory/indexer/helpers.d.ts
@@ -548,5 +566,5 @@ interface RerankOptions {
  */
 declare function rerankResults(query: string, results: SearchResult[], opts?: RerankOptions): Promise<SearchResult[]>;
 //#endregion
-export { Chunk, ChunkOptions, IndexResult, MigrationResult, PaiMarker, RerankOptions, SearchOptions, SearchResult, buildFtsQuery, chunkMarkdown, configureRerankerModel, decodeEncodedDir, detectTier, discoverPaiMarkers, ensurePaiMarker, estimateTokens, migrateFromJson, parseSessionFilename, populateSlugs, readPaiMarker, rerankResults, slugify };
+export { Chunk, ChunkOptions, Heading, IndexResult, MigrationResult, OutlineNode, PaiMarker, RerankOptions, SearchOptions, SearchResult, buildFtsQuery, buildOutline, chunkMarkdown, configureRerankerModel, decodeEncodedDir, detectTier, discoverPaiMarkers, ensurePaiMarker, estimateTokens, migrateFromJson, parseHeadings, parseSessionFilename, populateSlugs, readPaiMarker, rerankResults, slugify };
 //# sourceMappingURL=index.d.mts.map

package/dist/index.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.mts","names":[],"sources":["../src/registry/merge.ts","../src/storage/registry-interface.ts","../src/registry/migrate.ts","../src/registry/pai-marker.ts","../src/memory/chunker.ts","../src/memory/indexer/helpers.ts","../src/memory/indexer/types.ts","../src/memory/search.ts","../src/memory/reranker.ts"],"mappings":";;AAcA;;;;;;;;;;;;UAAiB,SAAA;EACf,MAAA;EACA,QAAA;EACA,MAAA;EACA,QAAA;EAQU;EANV,QAAA;IAAY,EAAA;IAAY,IAAA;IAAc,EAAA;EAAA;EACtC,IAAA;EACA,OAAA;EACA,WAAA;EACA,KAAA;ECAU;EDEV,UAAA;AAAA;;;KCHU,WAAA;AAAA,KACA,aAAA;AAAA,KACA,aAAA;AAAA,KACA,QAAA;AAAA,KACA,iBAAA;AAAA,UAEK,OAAA;EACf,EAAA;EACA,IAAA;EACA,YAAA;EACA,SAAA;EACA,WAAA;EACA,IAAA,EAAM,WAAA;EACN,MAAA,EAAQ,aAAA;EACR,SAAA;EACA,aAAA;EACA,gBAAA;EACA,cAAA;EACA,UAAA;EACA,UAAA;EACA,WAAA;AAAA;AAAA,UAGe,uBAAA,SAAgC,OAAA;EAC/C,aAAA;EACA,WAAA;AAAA;AAAA,UAGe,OAAA;EACf,EAAA;EACA,UAAA;EACA,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;EACA,MAAA,EAAQ,aAAA;EACR,iBAAA;EACA,WAAA;EACA,UAAA;EACA,SAAA;AAAA;AAAA,UAGe,kBAAA,SAA2B,OAAA;EAC1C,YAAA;EACA,YAAA;AAAA;AAAA,UAOe,UAAA;EACf,IAAA;EACA,WAAA;EACA,QAAA;EACA,UAAA;EACA,IAAA,GAAO,WAAA;EACP,MAAA,GAAS,aAAA;EACT,SAAA;EACA,SAAA;AAAA;;UAIe,uBAAA;EACf,QAAA;EACA,WAAA;EACA,QAAA;EACA,UAAA;EACA,SAAA;EACA,SAAA;AAAA;AAAA,UAGe,UAAA;EACf,SAAA;EACA,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;EACA,MAAA,GAAS,aAAA;EACT,SAAA;AAAA;AAAA,UAGe,qBAAA;EACf,SAAA;EACA,SAAA;EACA,OAAA,EAAS,iBAAA;EACT,YAAA;EACA,UAAA;EACA,SAAA;AAAA;AAAA,UAGe,mBAAA;EACf,MAAA,GAAS,aAAA;EAnDM;EAqDf,eAAA;EACA,OAAA;EACA,OAAA;EACA,KAAA;AAAA;AAAA,UAGe,+BAAA;EACf,eAAA;AAAA;AAAA,UAGe,4BAAA;EACf,MAAA,GAAS,aAAA;EACT,KAAA;EACA,OAAA;AAAA;AAAA,UAGe,wBAAA;EAzDf;EA2DA,cAAA;AAAA;AAAA,UAGe,mBAAA;EACf,SAAA;EACA,MAAA,GAAS,aAAA;EACT,KAAA;AAAA;AAAA,UAGe,6BAAA;EACf,OAAA;EACA,KAAA;AAAA;AAAA,UAOe,eAAA;EAAA,SACN,WAAA;EAET,KAAA,IAAS,OAAA;EArET;;;;;EA4EA,aAAA,IAAiB,OAAA;EAMjB,cAAA,CAAe,EAAA,WAAa,OAAA,CAAQ,OAAA;EA3ErB;EA6Ef,gBAAA,CACE,IAAA,UACA,IAAA;IAAS,eAAA;IAA2B,SAAA;EAAA,IACnC,OAAA,CAAQ,OAAA;EACX,iBAAA,CACE,KAAA,UACA,IAAA;IAAS,eAAA;EAAA,IACR,OAAA,CAAQ,OAAA;EACX,oBAAA,CAAqB,QAAA,UAAkB,IAAA;IAAS,SAAA;EAAA,IAAuB,OAAA,CAAQ,OAAA;EAC/E,sBAAA,CAAuB,UAAA,UAAoB,IAAA;IAAS,SAAA;EAAA,IAAuB,OAAA,CAAQ,OAAA;EA9E1E;EAgFT,sBAAA,CAAuB,GAAA,WAAc,OAAA,CAAQ,OAAA;EAC7C,YAAA,CAAa,IAAA,GAAO,mBAAA,GAAsB,OAAA,CAAQ,OAAA;;EAElD,4BAAA,CAA6B,IAAA,GAAO,+BAAA,GAAkC,OAAA,CAAQ,OAAA;EAC9E,4BAAA,CAA6B,IAAA,GAAO,4BAAA,GAA+B,OAAA,CAAQ,uBAAA;EA/E3E;EAiFA,iBAAA,CAAkB,IAAA,GAAO,wBAAA,GAA2B,OAAA,CAClD,KAAA,CAAM,uBAAA;IAA4B,IAAA;EAAA;EAEpC,cAAA,CAAe,KAAA,UAAe,KAAA,YAAiB,OAAA,CAAQ,OAAA;EACvD,aAAA,CAAc,IAAA;IAAS,MAAA,GAAS,aAAA;EAAA,IAAkB,OAAA;EAClD,6BAAA,IAAiC,OAAA;EACjC,kBAAA,CAAmB,QAAA,WAAmB,OAAA;;EAEtC,gCAAA,CACE,gBAAA,UACA,IAAA,UACA,KAAA,YACC,OAAA,CAAQ,KAAA;IAAQ,IAAA;IAAc,SAAA;IAAmB,aAAA;EAAA;EAMpD,aAAA,CAAc,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,OAAA;EAC1C,0BAAA,CAA2B,KAAA,EAAO,uBAAA,GAA0B,OAAA;IAAU,EAAA;IAAY,IAAA;IAAc,OAAA;EAAA;EAChG,iBAAA,CAAkB,EAAA,UAAY,KAAA;IAAS,QAAA;IAAmB,UAAA;EAAA,GAAuB,SAAA,YAAqB,OAAA;EACtG,mBAAA,CACE,EAAA,UACA,MAAA,EAAQ,aAAA,EACR,IAAA;IAAS,UAAA;IAA4B,SAAA;IAAoB,oBAAA,GAAuB,aAAA;EAAA,IAC/E,OAAA;EACH,wBAAA,CAAyB,EAAA,UAAY,WAAA,UAAqB,SAAA,YAAqB,OAAA;EAC/E,iBAAA,CAAkB,EAAA,UAAY,IAAA,EAAM,WAAA,EAAa,SAAA,YAAqB,OAAA;EACtE,0BAAA,CAA2B,EAAA,UAAY,MAAA,iBAAuB,SAAA,YAAqB,OAAA;EACnF,2BAAA,CAA4B,EAAA,UAAY,GAAA,iBAAoB,SAAA,YAAqB,OAAA;EACjF,yBAAA,CAA0B,EAAA,UAAY,IAAA,iBAAqB,SAAA,YAAqB,OAAA;EAChF,iBAAA,CAAkB,EAAA,UAAY,IAAA,UAAc,SAAA,WAAoB,OAAA;;EAEhE,qBAAA,CAAsB,YAAA,UAAsB,UAAA,WAAqB,OAAA;EACjE,aAAA,CAAc,EAAA,WAAa,OAAA;EApFZ;EAsFf,oBAAA,CAAqB,EAAA,WAAa,OAAA;EAMlC,kBAAA,CAAmB,SAAA,WAAoB,OAAA;EACvC,WAAA,IAAe,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,IAAA;EAAA;EA1F3C;EA4FA,SAAA,CAAU,IAAA,WAAe,OAAA;EACzB,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,gBAAA,CAAiB,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACpD,kBAAA,CAAmB,aAAA,UAAuB,WAAA,UAAqB,KAAA,WAAgB,OAAA;EAC/E,iBAAA,CAAkB,SAAA,WAAoB,OAAA;EACtC,0BAAA,CAA2B,SAAA,WAAoB,OAAA;EAtFhC;EAwFf,eAAA,CAAgB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EAC7D,2BAAA,CAA4B,SAAA,WAAoB,OAAA;EAtFvC;EA6FT,YAAA,CAAa,KAAA,WAAgB,OAAA;EAC7B,qBAAA,CAAsB,SAAA,WAAoB,OAAA;EAC1C,QAAA,CAAS,KAAA,UAAe,SAAA,WAAoB,OAAA;EAC5C,WAAA,CAAY,KAAA,WAAgB,OAAA;EAC5B,sBAAA,CAAuB,SAAA,WAAoB,OAAA;EA3EhC;EA6EX,kBAAA,CAAmB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EA5Ee;EA8E/E,aAAA,CAAc,KAAA,UAAe,WAAA,WAAsB,OAAA;EA7EgC;EA+EnF,YAAA,IAAgB,OAAA,CAAQ,KAAA;IAAQ,KAAA;IAAe,IAAA;IAAc,SAAA;EAAA;EAM7D,cAAA,CAAe,EAAA,WAAa,OAAA,CAAQ,OAAA;EACpC,kBAAA,CAAmB,SAAA,UAAmB,MAAA,WAAiB,OAAA,CAAQ,OAAA;EAC/D,0BAAA,CAA2B,SAAA,WAAoB,OAAA,CAAQ,OAAA;EACvD,mBAAA,CAAoB,SAAA,WAAoB,OAAA;EACxC,sBAAA,CAAuB,SAAA,UAAmB,IAAA,GAAO,6BAAA,GAAgC,OAAA,CAAQ,OAAA;EAnFd;EAqF3E,YAAA,CAAa,IAAA,GAAO,mBAAA,GAAsB,OAAA,CAAQ,kBAAA;EAClD,qBAAA,CAAsB,SAAA,UAAmB,QAAA,WAAmB,OAAA;IAAU,EAAA;EAAA;EACtE,kBAAA,CAAmB,SAAA,UAAmB,MAAA,WAAiB,OAAA;EACvD,aAAA,CAAc,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,OAAA;EAnFK;EAqF/C,qBAAA,CAAsB,KAAA,EAAO,UAAA,GAAa,OAAA;EAC1C,iBAAA,CAAkB,EAAA,UAAY,KAAA;IAAS,IAAA;IAAe,KAAA;IAAgB,QAAA;EAAA,IAAsB,OAAA;EAC5F,mBAAA,CAAoB,EAAA,UAAY,MAAA,UAAgB,IAAA;IAAS,QAAA;EAAA,IAAsB,OAAA;EAC/E,qBAAA,CAAsB,EAAA,UAAY,QAAA,WAAmB,OAAA;EAxEO;EA0E5D,mBAAA,CAAoB,EAAA,UAAY,MAAA,EAAQ,aAAA,EAAe,IAAA;IAAS,QAAA;EAAA,IAAsB,OAAA;EACtF,oBAAA,CAAqB,EAAA,UAAY,SAAA,UAAmB,IAAA;IAAS,MAAA;EAAA,IAAoB,OAAA;EACjF,aAAA,CAAc,EAAA,WAAa,OAAA;EAnEwD;EAqEnF,qBAAA,CAAsB,MAAA,UAAgB,MAAA,WAAiB,OAAA;EACvD,uBAAA,CAAwB,SAAA,WAAoB,OAAA;EAnEoB;EAqEhE,aAAA,IAAiB,OAAA;EACjB,wBAAA,CAAyB,SAAA,WAAoB,OAAA;EAC7C,6BAAA,IAAiC,OAAA;EAMjC,iBAAA,CAAkB,SAAA,WAAoB,OAAA;EACtC,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,gBAAA,CAAiB,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACpD,kBAAA,CAAmB,aAAA,UAAuB,WAAA,UAAqB,KAAA,WAAgB,OAAA;EAC/E,kBAAA,CAAmB,SAAA,WAAoB,OAAA;EAMvC,OAAA,CAAQ,KAAA;IAAS,SAAA;IAAmB,eAAA;IAAyB,QAAA,EAAU,QAAA;IAAU,SAAA;EAAA,IAAsB,OAAA;EACvG,mBAAA,CAAoB,SAAA,WAAoB,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,iBAAA;EAAA;EACpE,mBAAA,CAAoB,SAAA,WAAoB,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,UAAA;EAAA;EACpE,UAAA,CAAW,SAAA,UAAmB,eAAA,WAA0B,OAAA;EACxD,UAAA,CAAW,EAAA,WAAa,OAAA;EACxB,2BAAA,CAA4B,SAAA,WAAoB,OAAA;EA9Ce;EAgD/D,8BAAA,CAA+B,SAAA,WAAoB,OAAA;EACnD,YAAA,CAAa,EAAA,UAAY,eAAA,WAA0B,OAAA;EACnD,iBAAA,CAAkB,EAAA,UAAY,SAAA,WAAoB,OAAA;EAhDV;EAkDxC,mBAAA,CAAoB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACjE,oBAAA,CAAqB,SAAA,WAAoB,OAAA;EAlDwC;EAoDjF,yBAAA,CAA0B,SAAA,WAAoB,OAAA;EAM9C,mBAAA,CAAoB,KAAA,EAAO,qBAAA,GAAwB,OAAA;EACnD,6BAAA,CAA8B,SAAA,WAAoB,OAAA;EAxDU;EA0D5D,2BAAA,CAA4B,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACzE,2BAAA,CAA4B,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACzE,8BAAA,CAA+B,SAAA,WAAoB,OAAA;EAMnD,gBAAA,CAAiB,QAAA,UAAkB,QAAA,WAAmB,OAAA,CAAQ,SAAA;EAC9D,iBAAA,CAAkB,IAAA,EAAM,SAAA,GAAY,OAAA;AAAA;;;;;;;AA3TtC;;;;;AACA;;;;;AAEA;;;;;;;;;;;;iBC6FgB,gBAAA,CACd,OAAA,UACA,SAAA,GAAY,GAAA;;;;;;iBAoCE,OAAA,CAAQ,KAAA;AAAA,UAgBd,aAAA;EACR,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;AAAA;;;;;;iBAcc,oBAAA,CACd,QAAA,WACC,aAAA;AAAA,UAiCc,eAAA;EACf,gBAAA;EACA,eAAA;EACA,gBAAA;EACA,MAAA;AAAA;;;;;;;;;;;iBAaoB,eAAA,CACpB,OAAA,EAAS,eAAA,EACT,YAAA,YACC,OAAA,CAAQ,eAAA;;;UC5KM,SAAA;EHpDL;EGsDV,IAAA;;EAEA,IAAA;;EAEA,WAAA;AAAA;;;;AF5DF;;;;;AACA;;;iBE6MgB,eAAA,CACd,WAAA,UACA,IAAA,UACA,WAAA;;AF/MF;;;iBEqRgB,aAAA,CACd,WAAA;EACG,IAAA;EAAc,UAAA;EAAoB,MAAA;AAAA;;;AFpRvC;;;;;;;;iBEiTgB,kBAAA,CAAmB,UAAA,aAAuB,SAAA;;;;AHhU1D;;;;;;UIJiB,KAAA;EACf,IAAA;EACA,SAAA;EACA,OAAA;EACA,IAAA;AAAA;AAAA,UAGe,YAAA;EJKf;EIHA,SAAA;EJKA;EIHA,OAAA;AAAA;;;;;iBAUc,cAAA,CAAe,IAAA;AAAA,iBAiLf,aAAA,CAAc,OAAA,UAAiB,IAAA,GAAO,YAAA,GAAe,KAAA;;;;AJlMrE;;;;;;;;;;;;;;iBKagB,UAAA,CACd,YAAA;;;;ALdF;;UMViB,WAAA;EACf,cAAA;EACA,aAAA;EACA,YAAA;AAAA;;;UCOe,YAAA;EACf,SAAA;EACA,WAAA;EACA,IAAA;EACA,SAAA;EACA,OAAA;EACA,OAAA;EACA,KAAA;EACA,IAAA;EACA,MAAA;EACA,SAAA;EACA,cAAA;EACA,OAAA;AAAA;AAAA,UAGe,aAAA;;EAEf,UAAA;ENRqB;EMUrB,OAAA;ENVqB;EMYrB,KAAA;ENXU;EMaV,UAAA;;EAEA,QAAA;AAAA;AAAA,iBA0Cc,aAAA,CAAc,KAAA;;;;;iBA8BR,aAAA,CACpB,OAAA,EAAS,YAAA,IACT,QAAA,EAAU,eAAA,GACT,OAAA,CAAQ,YAAA;;;;;;;iBC5EK,sBAAA,CAAuB,KAAA;AAAA,UAoCtB,aAAA;EPnDL;EOqDV,IAAA;;;;APpDF;;EO0DE,aAAA;AAAA;;APzDF;;;;;AACA;;;iBOoEsB,aAAA,CACpB,KAAA,UACA,OAAA,EAAS,YAAA,IACT,IAAA,GAAO,aAAA,GACN,OAAA,CAAQ,YAAA"}
+{"version":3,"file":"index.d.mts","names":[],"sources":["../src/registry/merge.ts","../src/storage/registry-interface.ts","../src/registry/migrate.ts","../src/registry/pai-marker.ts","../src/memory/chunker.ts","../src/memory/indexer/helpers.ts","../src/memory/indexer/types.ts","../src/memory/search.ts","../src/memory/reranker.ts"],"mappings":";;AAcA;;;;;;;;;;;;UAAiB,SAAA;EACf,MAAA;EACA,QAAA;EACA,MAAA;EACA,QAAA;EAQU;EANV,QAAA;IAAY,EAAA;IAAY,IAAA;IAAc,EAAA;EAAA;EACtC,IAAA;EACA,OAAA;EACA,WAAA;EACA,KAAA;ECAU;EDEV,UAAA;AAAA;;;KCHU,WAAA;AAAA,KACA,aAAA;AAAA,KACA,aAAA;AAAA,KACA,QAAA;AAAA,KACA,iBAAA;AAAA,UAEK,OAAA;EACf,EAAA;EACA,IAAA;EACA,YAAA;EACA,SAAA;EACA,WAAA;EACA,IAAA,EAAM,WAAA;EACN,MAAA,EAAQ,aAAA;EACR,SAAA;EACA,aAAA;EACA,gBAAA;EACA,cAAA;EACA,UAAA;EACA,UAAA;EACA,WAAA;AAAA;AAAA,UAGe,uBAAA,SAAgC,OAAA;EAC/C,aAAA;EACA,WAAA;AAAA;AAAA,UAGe,OAAA;EACf,EAAA;EACA,UAAA;EACA,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;EACA,MAAA,EAAQ,aAAA;EACR,iBAAA;EACA,WAAA;EACA,UAAA;EACA,SAAA;AAAA;AAAA,UAGe,kBAAA,SAA2B,OAAA;EAC1C,YAAA;EACA,YAAA;AAAA;AAAA,UAOe,UAAA;EACf,IAAA;EACA,WAAA;EACA,QAAA;EACA,UAAA;EACA,IAAA,GAAO,WAAA;EACP,MAAA,GAAS,aAAA;EACT,SAAA;EACA,SAAA;AAAA;;UAIe,uBAAA;EACf,QAAA;EACA,WAAA;EACA,QAAA;EACA,UAAA;EACA,SAAA;EACA,SAAA;AAAA;AAAA,UAGe,UAAA;EACf,SAAA;EACA,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;EACA,MAAA,GAAS,aAAA;EACT,SAAA;AAAA;AAAA,UAGe,qBAAA;EACf,SAAA;EACA,SAAA;EACA,OAAA,EAAS,iBAAA;EACT,YAAA;EACA,UAAA;EACA,SAAA;AAAA;AAAA,UAGe,mBAAA;EACf,MAAA,GAAS,aAAA;EAnDM;EAqDf,eAAA;EACA,OAAA;EACA,OAAA;EACA,KAAA;AAAA;AAAA,UAGe,+BAAA;EACf,eAAA;AAAA;AAAA,UAGe,4BAAA;EACf,MAAA,GAAS,aAAA;EACT,KAAA;EACA,OAAA;AAAA;AAAA,UAGe,wBAAA;EAzDf;EA2DA,cAAA;AAAA;AAAA,UAGe,mBAAA;EACf,SAAA;EACA,MAAA,GAAS,aAAA;EACT,KAAA;AAAA;AAAA,UAGe,6BAAA;EACf,OAAA;EACA,KAAA;AAAA;AAAA,UAOe,eAAA;EAAA,SACN,WAAA;EAET,KAAA,IAAS,OAAA;EArET;;;;;EA4EA,aAAA,IAAiB,OAAA;EAMjB,cAAA,CAAe,EAAA,WAAa,OAAA,CAAQ,OAAA;EA3ErB;EA6Ef,gBAAA,CACE,IAAA,UACA,IAAA;IAAS,eAAA;IAA2B,SAAA;EAAA,IACnC,OAAA,CAAQ,OAAA;EACX,iBAAA,CACE,KAAA,UACA,IAAA;IAAS,eAAA;EAAA,IACR,OAAA,CAAQ,OAAA;EACX,oBAAA,CAAqB,QAAA,UAAkB,IAAA;IAAS,SAAA;EAAA,IAAuB,OAAA,CAAQ,OAAA;EAC/E,sBAAA,CAAuB,UAAA,UAAoB,IAAA;IAAS,SAAA;EAAA,IAAuB,OAAA,CAAQ,OAAA;EA9E1E;EAgFT,sBAAA,CAAuB,GAAA,WAAc,OAAA,CAAQ,OAAA;EAC7C,YAAA,CAAa,IAAA,GAAO,mBAAA,GAAsB,OAAA,CAAQ,OAAA;;EAElD,4BAAA,CAA6B,IAAA,GAAO,+BAAA,GAAkC,OAAA,CAAQ,OAAA;EAC9E,4BAAA,CAA6B,IAAA,GAAO,4BAAA,GAA+B,OAAA,CAAQ,uBAAA;EA/E3E;EAiFA,iBAAA,CAAkB,IAAA,GAAO,wBAAA,GAA2B,OAAA,CAClD,KAAA,CAAM,uBAAA;IAA4B,IAAA;EAAA;EAEpC,cAAA,CAAe,KAAA,UAAe,KAAA,YAAiB,OAAA,CAAQ,OAAA;EACvD,aAAA,CAAc,IAAA;IAAS,MAAA,GAAS,aAAA;EAAA,IAAkB,OAAA;EAClD,6BAAA,IAAiC,OAAA;EACjC,kBAAA,CAAmB,QAAA,WAAmB,OAAA;;EAEtC,gCAAA,CACE,gBAAA,UACA,IAAA,UACA,KAAA,YACC,OAAA,CAAQ,KAAA;IAAQ,IAAA;IAAc,SAAA;IAAmB,aAAA;EAAA;EAMpD,aAAA,CAAc,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,OAAA;EAC1C,0BAAA,CAA2B,KAAA,EAAO,uBAAA,GAA0B,OAAA;IAAU,EAAA;IAAY,IAAA;IAAc,OAAA;EAAA;EAChG,iBAAA,CAAkB,EAAA,UAAY,KAAA;IAAS,QAAA;IAAmB,UAAA;EAAA,GAAuB,SAAA,YAAqB,OAAA;EACtG,mBAAA,CACE,EAAA,UACA,MAAA,EAAQ,aAAA,EACR,IAAA;IAAS,UAAA;IAA4B,SAAA;IAAoB,oBAAA,GAAuB,aAAA;EAAA,IAC/E,OAAA;EACH,wBAAA,CAAyB,EAAA,UAAY,WAAA,UAAqB,SAAA,YAAqB,OAAA;EAC/E,iBAAA,CAAkB,EAAA,UAAY,IAAA,EAAM,WAAA,EAAa,SAAA,YAAqB,OAAA;EACtE,0BAAA,CAA2B,EAAA,UAAY,MAAA,iBAAuB,SAAA,YAAqB,OAAA;EACnF,2BAAA,CAA4B,EAAA,UAAY,GAAA,iBAAoB,SAAA,YAAqB,OAAA;EACjF,yBAAA,CAA0B,EAAA,UAAY,IAAA,iBAAqB,SAAA,YAAqB,OAAA;EAChF,iBAAA,CAAkB,EAAA,UAAY,IAAA,UAAc,SAAA,WAAoB,OAAA;;EAEhE,qBAAA,CAAsB,YAAA,UAAsB,UAAA,WAAqB,OAAA;EACjE,aAAA,CAAc,EAAA,WAAa,OAAA;EApFZ;EAsFf,oBAAA,CAAqB,EAAA,WAAa,OAAA;EAMlC,kBAAA,CAAmB,SAAA,WAAoB,OAAA;EACvC,WAAA,IAAe,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,IAAA;EAAA;EA1F3C;EA4FA,SAAA,CAAU,IAAA,WAAe,OAAA;EACzB,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,gBAAA,CAAiB,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACpD,kBAAA,CAAmB,aAAA,UAAuB,WAAA,UAAqB,KAAA,WAAgB,OAAA;EAC/E,iBAAA,CAAkB,SAAA,WAAoB,OAAA;EACtC,0BAAA,CAA2B,SAAA,WAAoB,OAAA;EAtFhC;EAwFf,eAAA,CAAgB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EAC7D,2BAAA,CAA4B,SAAA,WAAoB,OAAA;EAtFvC;EA6FT,YAAA,CAAa,KAAA,WAAgB,OAAA;EAC7B,qBAAA,CAAsB,SAAA,WAAoB,OAAA;EAC1C,QAAA,CAAS,KAAA,UAAe,SAAA,WAAoB,OAAA;EAC5C,WAAA,CAAY,KAAA,WAAgB,OAAA;EAC5B,sBAAA,CAAuB,SAAA,WAAoB,OAAA;EA3EhC;EA6EX,kBAAA,CAAmB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EA5Ee;EA8E/E,aAAA,CAAc,KAAA,UAAe,WAAA,WAAsB,OAAA;EA7EgC;EA+EnF,YAAA,IAAgB,OAAA,CAAQ,KAAA;IAAQ,KAAA;IAAe,IAAA;IAAc,SAAA;EAAA;EAM7D,cAAA,CAAe,EAAA,WAAa,OAAA,CAAQ,OAAA;EACpC,kBAAA,CAAmB,SAAA,UAAmB,MAAA,WAAiB,OAAA,CAAQ,OAAA;EAC/D,0BAAA,CAA2B,SAAA,WAAoB,OAAA,CAAQ,OAAA;EACvD,mBAAA,CAAoB,SAAA,WAAoB,OAAA;EACxC,sBAAA,CAAuB,SAAA,UAAmB,IAAA,GAAO,6BAAA,GAAgC,OAAA,CAAQ,OAAA;EAnFd;EAqF3E,YAAA,CAAa,IAAA,GAAO,mBAAA,GAAsB,OAAA,CAAQ,kBAAA;EAClD,qBAAA,CAAsB,SAAA,UAAmB,QAAA,WAAmB,OAAA;IAAU,EAAA;EAAA;EACtE,kBAAA,CAAmB,SAAA,UAAmB,MAAA,WAAiB,OAAA;EACvD,aAAA,CAAc,KAAA,EAAO,UAAA,GAAa,OAAA,CAAQ,OAAA;EAnFK;EAqF/C,qBAAA,CAAsB,KAAA,EAAO,UAAA,GAAa,OAAA;EAC1C,iBAAA,CAAkB,EAAA,UAAY,KAAA;IAAS,IAAA;IAAe,KAAA;IAAgB,QAAA;EAAA,IAAsB,OAAA;EAC5F,mBAAA,CAAoB,EAAA,UAAY,MAAA,UAAgB,IAAA;IAAS,QAAA;EAAA,IAAsB,OAAA;EAC/E,qBAAA,CAAsB,EAAA,UAAY,QAAA,WAAmB,OAAA;EAxEO;EA0E5D,mBAAA,CAAoB,EAAA,UAAY,MAAA,EAAQ,aAAA,EAAe,IAAA;IAAS,QAAA;EAAA,IAAsB,OAAA;EACtF,oBAAA,CAAqB,EAAA,UAAY,SAAA,UAAmB,IAAA;IAAS,MAAA;EAAA,IAAoB,OAAA;EACjF,aAAA,CAAc,EAAA,WAAa,OAAA;EAnEwD;EAqEnF,qBAAA,CAAsB,MAAA,UAAgB,MAAA,WAAiB,OAAA;EACvD,uBAAA,CAAwB,SAAA,WAAoB,OAAA;EAnEoB;EAqEhE,aAAA,IAAiB,OAAA;EACjB,wBAAA,CAAyB,SAAA,WAAoB,OAAA;EAC7C,6BAAA,IAAiC,OAAA;EAMjC,iBAAA,CAAkB,SAAA,WAAoB,OAAA;EACtC,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,aAAA,CAAc,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACjD,gBAAA,CAAiB,SAAA,UAAmB,KAAA,WAAgB,OAAA;EACpD,kBAAA,CAAmB,aAAA,UAAuB,WAAA,UAAqB,KAAA,WAAgB,OAAA;EAC/E,kBAAA,CAAmB,SAAA,WAAoB,OAAA;EAMvC,OAAA,CAAQ,KAAA;IAAS,SAAA;IAAmB,eAAA;IAAyB,QAAA,EAAU,QAAA;IAAU,SAAA;EAAA,IAAsB,OAAA;EACvG,mBAAA,CAAoB,SAAA,WAAoB,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,iBAAA;EAAA;EACpE,mBAAA,CAAoB,SAAA,WAAoB,OAAA,CAAQ,KAAA;IAAQ,EAAA;IAAY,UAAA;EAAA;EACpE,UAAA,CAAW,SAAA,UAAmB,eAAA,WAA0B,OAAA;EACxD,UAAA,CAAW,EAAA,WAAa,OAAA;EACxB,2BAAA,CAA4B,SAAA,WAAoB,OAAA;EA9Ce;EAgD/D,8BAAA,CAA+B,SAAA,WAAoB,OAAA;EACnD,YAAA,CAAa,EAAA,UAAY,eAAA,WAA0B,OAAA;EACnD,iBAAA,CAAkB,EAAA,UAAY,SAAA,WAAoB,OAAA;EAhDV;EAkDxC,mBAAA,CAAoB,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACjE,oBAAA,CAAqB,SAAA,WAAoB,OAAA;EAlDwC;EAoDjF,yBAAA,CAA0B,SAAA,WAAoB,OAAA;EAM9C,mBAAA,CAAoB,KAAA,EAAO,qBAAA,GAAwB,OAAA;EACnD,6BAAA,CAA8B,SAAA,WAAoB,OAAA;EAxDU;EA0D5D,2BAAA,CAA4B,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACzE,2BAAA,CAA4B,aAAA,UAAuB,WAAA,WAAsB,OAAA;EACzE,8BAAA,CAA+B,SAAA,WAAoB,OAAA;EAMnD,gBAAA,CAAiB,QAAA,UAAkB,QAAA,WAAmB,OAAA,CAAQ,SAAA;EAC9D,iBAAA,CAAkB,IAAA,EAAM,SAAA,GAAY,OAAA;AAAA;;;;;;;AA3TtC;;;;;AACA;;;;;AAEA;;;;;;;;;;;;iBC6FgB,gBAAA,CACd,OAAA,UACA,SAAA,GAAY,GAAA;;;;;;iBAoCE,OAAA,CAAQ,KAAA;AAAA,UAgBd,aAAA;EACR,MAAA;EACA,IAAA;EACA,IAAA;EACA,KAAA;EACA,QAAA;AAAA;;;;;;iBAcc,oBAAA,CACd,QAAA,WACC,aAAA;AAAA,UAiCc,eAAA;EACf,gBAAA;EACA,eAAA;EACA,gBAAA;EACA,MAAA;AAAA;;;;;;;;;;;iBAaoB,eAAA,CACpB,OAAA,EAAS,eAAA,EACT,YAAA,YACC,OAAA,CAAQ,eAAA;;;UC5KM,SAAA;EHpDL;EGsDV,IAAA;;EAEA,IAAA;;EAEA,WAAA;AAAA;;;;AF5DF;;;;;AACA;;;iBE6MgB,eAAA,CACd,WAAA,UACA,IAAA,UACA,WAAA;;AF/MF;;;iBEqRgB,aAAA,CACd,WAAA;EACG,IAAA;EAAc,UAAA;EAAoB,MAAA;AAAA;;;AFpRvC;;;;;;;;iBEiTgB,kBAAA,CAAmB,UAAA,aAAuB,SAAA;;;UC5TzC,KAAA;EACf,IAAA;EACA,SAAA;EACA,OAAA;EACA,IAAA;EJEA;EIAA,WAAA;AAAA;AAAA,UAGe,YAAA;;EAEf,SAAA;;EAEA,OAAA;AAAA;;;;AHPF;iBGiBgB,cAAA,CAAe,IAAA;AAAA,UAWd,OAAA;EACf,KAAA;EACA,KAAA;EACA,IAAA;AAAA;;;;AH7BF;iBGoCgB,aAAA,CAAc,KAAA,aAAkB,OAAA;AAAA,UAgC/B,WAAA;EACf,KAAA;EACA,KAAA;EACA,SAAA;EACA,OAAA;EACA,MAAA;EACA,QAAA,EAAU,WAAA;AAAA;AHvEZ;;;;AAAA,iBG8EgB,YAAA,CAAa,OAAA,WAAkB,WAAA;AAAA,iBA6M/B,aAAA,CAAc,OAAA,UAAiB,IAAA,GAAO,YAAA,GAAe,KAAA;;;;AJ1SrE;;;;;;;;;;;;;;iBKagB,UAAA,CACd,YAAA;;;;ALdF;;UMViB,WAAA;EACf,cAAA;EACA,aAAA;EACA,YAAA;AAAA;;;UCOe,YAAA;EACf,SAAA;EACA,WAAA;EACA,IAAA;EACA,SAAA;EACA,OAAA;EACA,OAAA;EACA,KAAA;EACA,IAAA;EACA,MAAA;EACA,SAAA;EACA,cAAA;EACA,OAAA;AAAA;AAAA,UAGe,aAAA;;EAEf,UAAA;ENRqB;EMUrB,OAAA;ENVqB;EMYrB,KAAA;ENXU;EMaV,UAAA;;EAEA,QAAA;AAAA;AAAA,iBA0Cc,aAAA,CAAc,KAAA;;;;;iBA8BR,aAAA,CACpB,OAAA,EAAS,YAAA,IACT,QAAA,EAAU,eAAA,GACT,OAAA,CAAQ,YAAA;;;;;;;iBC5EK,sBAAA,CAAuB,KAAA;AAAA,UAoCtB,aAAA;EPnDL;EOqDV,IAAA;;;;APpDF;;EO0DE,aAAA;AAAA;;APzDF;;;;;AACA;;;iBOoEsB,aAAA,CACpB,KAAA,UACA,OAAA,EAAS,YAAA,IACT,IAAA,GAAO,aAAA,GACN,OAAA,CAAQ,YAAA"}

package/dist/index.mjs

@@ -1,8 +1,9 @@
 import "./utils-C9HsYDpO.mjs";
 import { a as slugify, i as parseSessionFilename, n as decodeEncodedDir, r as migrateFromJson } from "./migrate-BD7D8EEh.mjs";
 import { n as ensurePaiMarker, r as readPaiMarker, t as discoverPaiMarkers } from "./pai-marker-D1MMswkz.mjs";
-import { l as chunkMarkdown, r as detectTier, u as estimateTokens } from "./helpers-Dj-B314s.mjs";
-import { i as populateSlugs, n as buildFtsQuery } from "./search-BaTbyWjK.mjs";
-import { n as rerankResults, t as configureRerankerModel } from "./reranker-CRVawoEh.mjs";
+import { a as parseHeadings, n as chunkMarkdown, r as estimateTokens, t as buildOutline } from "./chunker-BH4i-F2b.mjs";
+import { r as detectTier } from "./helpers-BRCJg0G3.mjs";
+import { i as populateSlugs, n as buildFtsQuery } from "./search-BOSphCJ1.mjs";
+import { n as rerankResults, t as configureRerankerModel } from "./reranker-DKv80KO5.mjs";
 
-export { buildFtsQuery, chunkMarkdown, configureRerankerModel, decodeEncodedDir, detectTier, discoverPaiMarkers, ensurePaiMarker, estimateTokens, migrateFromJson, parseSessionFilename, populateSlugs, readPaiMarker, rerankResults, slugify };
+export { buildFtsQuery, buildOutline, chunkMarkdown, configureRerankerModel, decodeEncodedDir, detectTier, discoverPaiMarkers, ensurePaiMarker, estimateTokens, migrateFromJson, parseHeadings, parseSessionFilename, populateSlugs, readPaiMarker, rerankResults, slugify };

package/dist/indexer-backend-Cnc7Tf5C.mjs

@@ -0,0 +1,5 @@
+import { a as parseSessionTitleChunk } from "./helpers-BRCJg0G3.mjs";
+import { i as indexProjectWithBackend, n as indexAllWithBackend, r as indexFileWithBackend, t as embedChunksWithBackend } from "./async-CNn36gm4.mjs";
+import "./indexer-backend-isSLg6yE.mjs";
+
+export { embedChunksWithBackend };

package/dist/{ipc-client-Dasm515c.mjs → ipc-client-D16Xw6Uo.mjs}

@@ -1,4 +1,4 @@
-import { i as paiSocketPath } from "./runtime-paths-BRwDeBEg.mjs";
+import { i as paiSocketPath } from "./runtime-paths-CHTg3ywb.mjs";
 import { randomUUID } from "node:crypto";
 import { connect } from "node:net";
 
@@ -155,4 +155,4 @@ var PaiClient = class {
 
 //#endregion
 export { PaiClient as t };
-//# sourceMappingURL=ipc-client-Dasm515c.mjs.map
+//# sourceMappingURL=ipc-client-D16Xw6Uo.mjs.map

package/dist/{ipc-client-Dasm515c.mjs.map → ipc-client-D16Xw6Uo.mjs.map}

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

package/dist/{kg-entity-Cj8Q6YmU.mjs → kg-entity-COTUj1ZC.mjs}

@@ -26,4 +26,4 @@ function entityContentId(name, tenantId = "default") {
 
 //#endregion
 export { entityContentId as t };
-//# sourceMappingURL=kg-entity-Cj8Q6YmU.mjs.map
+//# sourceMappingURL=kg-entity-COTUj1ZC.mjs.map

package/dist/{kg-entity-Cj8Q6YmU.mjs.map → kg-entity-COTUj1ZC.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"kg-entity-Cj8Q6YmU.mjs","names":[],"sources":["../src/memory/kg-entity.ts"],"sourcesContent":["/**\n * kg-entity.ts — Entity content-addressing with multi-tenant support.\n *\n * Provides UUID5-style deterministic content hashes for KG entities and edges,\n * ensuring that the same entity name always maps to the same ID within a tenant.\n * This enables idempotent upserts and stable foreign keys for kg_triples.\n *\n * Multi-tenant support: each tenant namespace gets its own entity ID space.\n * The default tenant is \"default\" for single-user deployments.\n */\n\nimport { createHash } from \"node:crypto\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgEntity {\n  entity_id: string;\n  tenant_id: string;\n  name: string;\n  type: string;\n  description?: string;\n  first_seen?: number;\n  last_seen?: number;\n  mention_count: number;\n  feedback_weight: number;\n}\n\nexport interface KgEntityUpsertParams {\n  name: string;\n  type?: string;\n  description?: string;\n  tenantId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Content addressing\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a deterministic entity ID (UUID5-style) for a given name and tenant.\n *\n * The ID is a hex digest derived from \"tenant_id:name\" so the same entity\n * always receives the same ID within a tenant namespace.\n *\n * @param name      Entity name (case-preserved)\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function entityContentId(name: string, tenantId = \"default\"): string {\n  return createHash(\"sha256\")\n    .update(`entity:${tenantId}:${name}`)\n    .digest(\"hex\")\n    .slice(0, 32); // 128-bit hex string — UUID5-compatible length\n}\n\n/**\n * Generate a deterministic edge ID for a (source, relation, target) triple\n * within a tenant namespace.\n *\n * @param source    Source entity name\n * @param relation  Relation/predicate verb phrase\n * @param target    Target entity name\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function edgeContentId(\n  source: string,\n  relation: string,\n  target: string,\n  tenantId = \"default\"\n): string {\n  return createHash(\"sha256\")\n    .update(`edge:${tenantId}:${source}:${relation}:${target}`)\n    .digest(\"hex\")\n    .slice(0, 32);\n}\n\n// SQLite's kg_entities CRUD (upsertKgEntity/findKgEntity/listKgEntities/\n// updateEntityFeedbackWeight) lives in storage/sqlite/kg-entity.ts —\n// PostgresBackend implements the same operations inline against its own\n// pool, so there is no cross-backend function to share here.\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAiDA,SAAgB,gBAAgB,MAAc,WAAW,WAAmB;AAC1E,QAAO,WAAW,SAAS,CACxB,OAAO,UAAU,SAAS,GAAG,OAAO,CACpC,OAAO,MAAM,CACb,MAAM,GAAG,GAAG"}
+{"version":3,"file":"kg-entity-COTUj1ZC.mjs","names":[],"sources":["../src/memory/kg-entity.ts"],"sourcesContent":["/**\n * kg-entity.ts — Entity content-addressing with multi-tenant support.\n *\n * Provides UUID5-style deterministic content hashes for KG entities and edges,\n * ensuring that the same entity name always maps to the same ID within a tenant.\n * This enables idempotent upserts and stable foreign keys for kg_triples.\n *\n * Multi-tenant support: each tenant namespace gets its own entity ID space.\n * The default tenant is \"default\" for single-user deployments.\n */\n\nimport { createHash } from \"node:crypto\";\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\nexport interface KgEntity {\n  entity_id: string;\n  tenant_id: string;\n  name: string;\n  type: string;\n  description?: string;\n  first_seen?: number;\n  last_seen?: number;\n  mention_count: number;\n  feedback_weight: number;\n}\n\nexport interface KgEntityUpsertParams {\n  name: string;\n  type?: string;\n  description?: string;\n  tenantId?: string;\n}\n\n// ---------------------------------------------------------------------------\n// Content addressing\n// ---------------------------------------------------------------------------\n\n/**\n * Generate a deterministic entity ID (UUID5-style) for a given name and tenant.\n *\n * The ID is a hex digest derived from \"tenant_id:name\" so the same entity\n * always receives the same ID within a tenant namespace.\n *\n * @param name      Entity name (case-preserved)\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function entityContentId(name: string, tenantId = \"default\"): string {\n  return createHash(\"sha256\")\n    .update(`entity:${tenantId}:${name}`)\n    .digest(\"hex\")\n    .slice(0, 32); // 128-bit hex string — UUID5-compatible length\n}\n\n/**\n * Generate a deterministic edge ID for a (source, relation, target) triple\n * within a tenant namespace.\n *\n * @param source    Source entity name\n * @param relation  Relation/predicate verb phrase\n * @param target    Target entity name\n * @param tenantId  Tenant namespace (default: \"default\")\n */\nexport function edgeContentId(\n  source: string,\n  relation: string,\n  target: string,\n  tenantId = \"default\"\n): string {\n  return createHash(\"sha256\")\n    .update(`edge:${tenantId}:${source}:${relation}:${target}`)\n    .digest(\"hex\")\n    .slice(0, 32);\n}\n\n// SQLite's kg_entities CRUD (upsertKgEntity/findKgEntity/listKgEntities/\n// updateEntityFeedbackWeight) lives in storage/sqlite/kg-entity.ts —\n// PostgresBackend implements the same operations inline against its own\n// pool, so there is no cross-backend function to share here.\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAiDA,SAAgB,gBAAgB,MAAc,WAAW,WAAmB;AAC1E,QAAO,WAAW,SAAS,CACxB,OAAO,UAAU,SAAS,GAAG,OAAO,CACpC,OAAO,MAAM,CACb,MAAM,GAAG,GAAG"}

package/dist/{latent-ideas-BRy6HNwg.mjs → latent-ideas-ByvMjVcb.mjs}

@@ -1,6 +1,6 @@
-import { n as TITLE_STOP_WORDS } from "./stop-words-ClCwO8mZ.mjs";
-import "./embeddings-DfrYNIng.mjs";
-import { t as zettelThemes } from "./themes-B2v7RNnA.mjs";
+import { n as TITLE_STOP_WORDS } from "./stop-words-BdQuaE9K.mjs";
+import "./embeddings-BbNVXa_0.mjs";
+import { t as zettelThemes } from "./themes-BgqahYVM.mjs";
 import { mkdirSync, writeFileSync } from "node:fs";
 import { dirname, join } from "node:path";
 
@@ -188,4 +188,4 @@ function handleIdeaMaterialize(params, vaultPath) {
 
 //#endregion
 export { handleGraphLatentIdeas, handleIdeaMaterialize };
-//# sourceMappingURL=latent-ideas-BRy6HNwg.mjs.map
+//# sourceMappingURL=latent-ideas-ByvMjVcb.mjs.map

package/dist/{latent-ideas-BRy6HNwg.mjs.map → latent-ideas-ByvMjVcb.mjs.map}

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

package/dist/{link-boost-BptbAPuv.mjs → link-boost-UiE-uooT.mjs}

@@ -31,4 +31,4 @@ function applyLinkBoost(results, edges, opts) {
 
 //#endregion
 export { applyLinkBoost };
-//# sourceMappingURL=link-boost-BptbAPuv.mjs.map
+//# sourceMappingURL=link-boost-UiE-uooT.mjs.map

package/dist/{link-boost-BptbAPuv.mjs.map → link-boost-UiE-uooT.mjs.map}

@@ -1 +1 @@
-{"version":3,"file":"link-boost-BptbAPuv.mjs","names":[],"sources":["../src/memory/link-boost.ts"],"sourcesContent":["/**\n * Rank search results by how the corpus links to them, not only by similarity.\n *\n * Why this exists: the store holds 33,709 wikilinks that are *facts* — one note\n * pointing at another, written by a person — alongside 2.4M chunks whose only\n * ranking signal is embedding similarity. Similarity answers \"what reads like\n * the query\". It cannot answer \"which of these is the one the others refer\n * back to\", which is usually the note worth reading first.\n *\n * The boost is deliberately query-local: it counts links *between the results\n * themselves*, not global popularity. A note linked by many other notes that\n * also match the query is a hub for that question. A note linked by half the\n * vault is merely popular, which is not the same thing and would flatten every\n * ranking toward the same few index pages.\n *\n * Links cost nothing to maintain — no embedding pass, no model call — so this\n * signal stays correct while the embedding backlog drains, and works for chunks\n * that have no embedding at all.\n */\n\nimport type { SearchResult } from \"./search.js\";\n\n/** A directed link between two note paths, as stored in vault_links. */\nexport interface LinkEdge {\n  sourcePath: string;\n  targetPath: string;\n}\n\nexport interface LinkBoostOptions {\n  /**\n   * How much the boost may move a result, as a fraction of its current score.\n   * 0.25 means the most-linked result gains 25%. Kept modest by default: the\n   * link graph is a supporting signal, and a note nobody links to can still be\n   * the right answer.\n   */\n  weight?: number;\n}\n\n/**\n * Re-rank results by inbound links *from other results in the same set*.\n *\n * Returns a new array, sorted by the adjusted score. Input is not mutated.\n * Results whose paths carry no inbound links are unchanged, so a corpus with\n * no links at all is a no-op rather than a distortion.\n */\nexport function applyLinkBoost(\n  results: SearchResult[],\n  edges: LinkEdge[],\n  opts?: LinkBoostOptions,\n): SearchResult[] {\n  const weight = opts?.weight ?? 0.25;\n  if (results.length === 0 || edges.length === 0 || weight === 0) {\n    return [...results];\n  }\n\n  // Only links whose BOTH ends are in the result set count. An edge pointing\n  // out of the set says nothing about the relative rank of results inside it.\n  const paths = new Set(results.map((r) => r.path));\n  const inbound = new Map<string, number>();\n  for (const e of edges) {\n    if (e.sourcePath === e.targetPath) continue;      // self-links are noise\n    if (!paths.has(e.sourcePath) || !paths.has(e.targetPath)) continue;\n    inbound.set(e.targetPath, (inbound.get(e.targetPath) ?? 0) + 1);\n  }\n  if (inbound.size === 0) return [...results];\n\n  // Normalise against the most-linked result so the boost is bounded by\n  // `weight` regardless of corpus size. Without this, a densely linked project\n  // would swamp similarity entirely while a sparse one would see no effect.\n  const maxInbound = Math.max(...inbound.values());\n\n  return results\n    .map((r) => {\n      const links = inbound.get(r.path) ?? 0;\n      if (links === 0) return { ...r };\n      const factor = 1 + weight * (links / maxInbound);\n      return { ...r, score: r.score * factor };\n    })\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":";;;;;;;;AA6CA,SAAgB,eACd,SACA,OACA,MACgB;CAChB,MAAM,SAAS,MAAM,UAAU;AAC/B,KAAI,QAAQ,WAAW,KAAK,MAAM,WAAW,KAAK,WAAW,EAC3D,QAAO,CAAC,GAAG,QAAQ;CAKrB,MAAM,QAAQ,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,KAAK,CAAC;CACjD,MAAM,0BAAU,IAAI,KAAqB;AACzC,MAAK,MAAM,KAAK,OAAO;AACrB,MAAI,EAAE,eAAe,EAAE,WAAY;AACnC,MAAI,CAAC,MAAM,IAAI,EAAE,WAAW,IAAI,CAAC,MAAM,IAAI,EAAE,WAAW,CAAE;AAC1D,UAAQ,IAAI,EAAE,aAAa,QAAQ,IAAI,EAAE,WAAW,IAAI,KAAK,EAAE;;AAEjE,KAAI,QAAQ,SAAS,EAAG,QAAO,CAAC,GAAG,QAAQ;CAK3C,MAAM,aAAa,KAAK,IAAI,GAAG,QAAQ,QAAQ,CAAC;AAEhD,QAAO,QACJ,KAAK,MAAM;EACV,MAAM,QAAQ,QAAQ,IAAI,EAAE,KAAK,IAAI;AACrC,MAAI,UAAU,EAAG,QAAO,EAAE,GAAG,GAAG;EAChC,MAAM,SAAS,IAAI,UAAU,QAAQ;AACrC,SAAO;GAAE,GAAG;GAAG,OAAO,EAAE,QAAQ;GAAQ;GACxC,CACD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM"}
+{"version":3,"file":"link-boost-UiE-uooT.mjs","names":[],"sources":["../src/memory/link-boost.ts"],"sourcesContent":["/**\n * Rank search results by how the corpus links to them, not only by similarity.\n *\n * Why this exists: the store holds 33,709 wikilinks that are *facts* — one note\n * pointing at another, written by a person — alongside 2.4M chunks whose only\n * ranking signal is embedding similarity. Similarity answers \"what reads like\n * the query\". It cannot answer \"which of these is the one the others refer\n * back to\", which is usually the note worth reading first.\n *\n * The boost is deliberately query-local: it counts links *between the results\n * themselves*, not global popularity. A note linked by many other notes that\n * also match the query is a hub for that question. A note linked by half the\n * vault is merely popular, which is not the same thing and would flatten every\n * ranking toward the same few index pages.\n *\n * Links cost nothing to maintain — no embedding pass, no model call — so this\n * signal stays correct while the embedding backlog drains, and works for chunks\n * that have no embedding at all.\n */\n\nimport type { SearchResult } from \"./search.js\";\n\n/** A directed link between two note paths, as stored in vault_links. */\nexport interface LinkEdge {\n  sourcePath: string;\n  targetPath: string;\n}\n\nexport interface LinkBoostOptions {\n  /**\n   * How much the boost may move a result, as a fraction of its current score.\n   * 0.25 means the most-linked result gains 25%. Kept modest by default: the\n   * link graph is a supporting signal, and a note nobody links to can still be\n   * the right answer.\n   */\n  weight?: number;\n}\n\n/**\n * Re-rank results by inbound links *from other results in the same set*.\n *\n * Returns a new array, sorted by the adjusted score. Input is not mutated.\n * Results whose paths carry no inbound links are unchanged, so a corpus with\n * no links at all is a no-op rather than a distortion.\n */\nexport function applyLinkBoost(\n  results: SearchResult[],\n  edges: LinkEdge[],\n  opts?: LinkBoostOptions,\n): SearchResult[] {\n  const weight = opts?.weight ?? 0.25;\n  if (results.length === 0 || edges.length === 0 || weight === 0) {\n    return [...results];\n  }\n\n  // Only links whose BOTH ends are in the result set count. An edge pointing\n  // out of the set says nothing about the relative rank of results inside it.\n  const paths = new Set(results.map((r) => r.path));\n  const inbound = new Map<string, number>();\n  for (const e of edges) {\n    if (e.sourcePath === e.targetPath) continue;      // self-links are noise\n    if (!paths.has(e.sourcePath) || !paths.has(e.targetPath)) continue;\n    inbound.set(e.targetPath, (inbound.get(e.targetPath) ?? 0) + 1);\n  }\n  if (inbound.size === 0) return [...results];\n\n  // Normalise against the most-linked result so the boost is bounded by\n  // `weight` regardless of corpus size. Without this, a densely linked project\n  // would swamp similarity entirely while a sparse one would see no effect.\n  const maxInbound = Math.max(...inbound.values());\n\n  return results\n    .map((r) => {\n      const links = inbound.get(r.path) ?? 0;\n      if (links === 0) return { ...r };\n      const factor = 1 + weight * (links / maxInbound);\n      return { ...r, score: r.score * factor };\n    })\n    .sort((a, b) => b.score - a.score);\n}\n"],"mappings":";;;;;;;;AA6CA,SAAgB,eACd,SACA,OACA,MACgB;CAChB,MAAM,SAAS,MAAM,UAAU;AAC/B,KAAI,QAAQ,WAAW,KAAK,MAAM,WAAW,KAAK,WAAW,EAC3D,QAAO,CAAC,GAAG,QAAQ;CAKrB,MAAM,QAAQ,IAAI,IAAI,QAAQ,KAAK,MAAM,EAAE,KAAK,CAAC;CACjD,MAAM,0BAAU,IAAI,KAAqB;AACzC,MAAK,MAAM,KAAK,OAAO;AACrB,MAAI,EAAE,eAAe,EAAE,WAAY;AACnC,MAAI,CAAC,MAAM,IAAI,EAAE,WAAW,IAAI,CAAC,MAAM,IAAI,EAAE,WAAW,CAAE;AAC1D,UAAQ,IAAI,EAAE,aAAa,QAAQ,IAAI,EAAE,WAAW,IAAI,KAAK,EAAE;;AAEjE,KAAI,QAAQ,SAAS,EAAG,QAAO,CAAC,GAAG,QAAQ;CAK3C,MAAM,aAAa,KAAK,IAAI,GAAG,QAAQ,QAAQ,CAAC;AAEhD,QAAO,QACJ,KAAK,MAAM;EACV,MAAM,QAAQ,QAAQ,IAAI,EAAE,KAAK,IAAI;AACrC,MAAI,UAAU,EAAG,QAAO,EAAE,GAAG,GAAG;EAChC,MAAM,SAAS,IAAI,UAAU,QAAQ;AACrC,SAAO;GAAE,GAAG;GAAG,OAAO,EAAE,QAAQ;GAAQ;GACxC,CACD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,MAAM"}

package/dist/{main-resolver-BIft_FVF.mjs → main-resolver-CDe7DCso.mjs}

@@ -1,7 +1,7 @@
 import { _ as warn, c as ok, g as smartDecodeDir, i as err, n as dim, o as header, u as renderTable } from "./utils-C9HsYDpO.mjs";
-import { a as paiHomePath, o as resolvePaiFile, r as migratePaiFile } from "./pai-home-CeOIYltV.mjs";
-import { E as readWorkersSection, V as stripModelVariant, n as claudeCommand, t as buildRunEnv } from "./run-env-BE5xyCwy.mjs";
-import { a as switchToSession, n as fetchLiveSessions } from "./aibroker-client-BK1h--W_.mjs";
+import { a as paiHomePath, o as resolvePaiFile, r as migratePaiFile } from "./pai-home-Cm9rcJgX.mjs";
+import { E as readWorkersSection, V as stripModelVariant, n as claudeCommand, t as buildRunEnv } from "./run-env-BHWnXqle.mjs";
+import { a as switchToSession, n as fetchLiveSessions } from "./aibroker-client-C5Fw7DNz.mjs";
 import { closeSync, copyFileSync, createReadStream, existsSync, fstatSync, linkSync, mkdirSync, openSync, readFileSync, readSync, readdirSync, realpathSync, renameSync, statSync, writeFileSync } from "node:fs";
 import { homedir } from "node:os";
 import { basename, join } from "node:path";
@@ -67,7 +67,7 @@ function buildClcInfoMap() {
 /** Build encoded_dir → root_path map from PAI registry (authoritative cwd). */
 async function buildRegistryRootPathMap() {
 	try {
-		const { getRegistryBackend } = await import("./factory-UO9_DFMN.mjs");
+		const { getRegistryBackend } = await import("./factory-CaswxuJ0.mjs");
 		const projects = await (await getRegistryBackend()).listProjects();
 		const map = /* @__PURE__ */ new Map();
 		for (const p of projects) if (p.encoded_dir) map.set(p.encoded_dir, p.root_path);
@@ -1825,7 +1825,7 @@ async function openMatch(entry, allSessions, dryRun, resume, auto) {
 }
 async function getRegisteredProjects(all = false) {
 	try {
-		const { getRegistryBackend } = await import("./factory-UO9_DFMN.mjs");
+		const { getRegistryBackend } = await import("./factory-CaswxuJ0.mjs");
 		return await (await getRegistryBackend()).listProjectsWithSessionStats(all ? {} : { status: "active" });
 	} catch {
 		return [];
@@ -2008,4 +2008,4 @@ async function cmdMain(query, pickN, opts) {
 
 //#endregion
 export { resolveSessionByNameOrId as _, buildDeduped as a, hasConversation as c, providerResumePlan as d, restoreTopLevel as f, migrateSessionScanCache as g, fmtAge as h, resumeTargetFor as i, launchInDir as l, printExitDir as m, resolveSessionDir as n, normalizeName as o, resumeArgvText as p, resumeCandidateFor as r, renderDedupedSessions as s, cmdMain as t, launchPrompt as u, scanCacheFilePath as v, scanSessions as y };
-//# sourceMappingURL=main-resolver-BIft_FVF.mjs.map
+//# sourceMappingURL=main-resolver-CDe7DCso.mjs.map