causantic 0.2.0

package/dist/retrieval/context-assembler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"context-assembler.js","sourceRoot":"","sources":["../../src/retrieval/context-assembler.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,YAAY,EAAkB,MAAM,2BAA2B,CAAC;AACzE,OAAO,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAY,gBAAgB,EAAE,aAAa,EAAiB,MAAM,gBAAgB,CAAC;AAE1F,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAC3D,OAAO,EAAE,OAAO,EAAmB,MAAM,UAAU,CAAC;AACpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,MAAM,GAAG,GAAG,YAAY,CAAC,mBAAmB,CAAC,CAAC;AAmE9C;;GAEG;AACH,IAAI,cAAc,GAAoB,IAAI,CAAC;AAE3C;;GAEG;AACH,KAAK,UAAU,WAAW;IACxB,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,QAAQ,EAAE,CAAC;QAChC,MAAM,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,IAAI,kBAAkB,GAAwB,IAAI,CAAC;AAEnD;;GAEG;AACH,SAAS,eAAe;IACtB,IAAI,CAAC,kBAAkB,EAAE,CAAC;QACxB,kBAAkB,GAAG,IAAI,YAAY,EAAE,CAAC;IAC1C,CAAC;IACD,OAAO,kBAAkB,CAAC;AAC5B,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,OAAyB;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAE3B,MAAM,EACJ,KAAK,EACL,gBAAgB,EAChB,WAAW,EACX,aAAa,EACb,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,EACtB,SAAS,GAAG,MAAM,CAAC,oBAAoB,EACvC,IAAI,EACJ,KAAK,GAAG,MAAM,EACd,iBAAiB,GAAG,EAAE,EACtB,SAAS,GAAG,KAAK,EACjB,YAAY,GAAG,KAAK,GACrB,GAAG,OAAO,CAAC;IAEZ,MAAM,EAAE,YAAY,EAAE,gBAAgB,EAAE,GAAG,MAAM,CAAC;IAElD,oEAAoE;IACpE,MAAM,oBAAoB,GAAG,WAAW;QACtC,CAAC,OAAO,aAAa,KAAK,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAElE,8EAA8E;IAC9E,MAAM,cAAc,GAAG,oBAAoB,CAAC,CAAC,CAAC,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAElG,iBAAiB;IACjB,MAAM,QAAQ,GAAG,MAAM,WAAW,EAAE,CAAC;IACrC,MAAM,WAAW,GAAG,MAAM,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,iBAAiB;IAExE,sDAAsD;IACtD,MAAM,mBAAmB,GAAG,aAAa;QACvC,CAAC,CAAC,WAAW,CAAC,eAAe,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,iBAAiB,CAAC;QACtF,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;IAEjE,IAAI,cAAc,GAAyC,EAAE,CAAC;IAC9D,IAAI,CAAC;QACH,MAAM,YAAY,GAAG,eAAe,EAAE,CAAC;QACvC,cAAc,GAAG,aAAa;YAC5B,CAAC,CAAC,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,YAAY,CAAC,kBAAkB,CAAC;YACrF,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,kBAAkB,CAAC,CAAC;IAClE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,sFAAsF;QACtF,GAAG,CAAC,IAAI,CAAC,yDAAyD,EAAE;YAClE,KAAK,EAAG,KAAe,CAAC,OAAO;SAChC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAG,MAAM,mBAAmB,CAAC;IAE1C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxD,OAAO;YACL,IAAI,EAAE,EAAE;YACR,UAAU,EAAE,CAAC;YACb,MAAM,EAAE,EAAE;YACV,eAAe,EAAE,CAAC;YAClB,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;YAClC,YAAY,EAAE,CAAC;SAChB,CAAC;IACJ,CAAC;IAED,oDAAoD;IACpD,MAAM,WAAW,GAAiB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAClD,OAAO,EAAE,CAAC,CAAC,EAAE;QACb,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;QAClC,MAAM,EAAE,QAAiB;KAC1B,CAAC,CAAC,CAAC;IAEJ,MAAM,YAAY,GAAiB,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1D,OAAO,EAAE,CAAC,CAAC,EAAE;QACb,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,MAAM,EAAE,SAAkB;KAC3B,CAAC,CAAC,CAAC;IAEJ,MAAM,YAAY,GAAG,OAAO,CAC1B;QACE,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,CAAC,YAAY,EAAE;QACzD,GAAG,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;YACzB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,YAAY,CAAC,aAAa,EAAE,CAAC;YAC/D,CAAC,CAAC,EAAE,CAAC;KACR,EACD,YAAY,CAAC,IAAI,CAClB,CAAC;IAEF,4DAA4D;IAC5D,MAAM,eAAe,GAAG,YAAY;QAClC,CAAC,CAAC,YAAY;QACd,CAAC,CAAC,iBAAiB,CAAC,YAAY,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IAIrE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAChD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,2EAA2E;IAC3E,MAAM,SAAS,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC;IAE9D,IAAI,WAAW,CAAC;IAChB,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,WAAW,GAAG,MAAM,CAAC,YAAY,CAAC;IACpC,CAAC;SAAM,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;QAC7B,WAAW,GAAG,MAAM,CAAC,eAAe,CAAC;IACvC,CAAC;SAAM,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;QAC5B,WAAW,GAAG,MAAM,CAAC,cAAc,CAAC;IACtC,CAAC;SAAM,CAAC;QACN,WAAW,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC;IACpF,CAAC;IAED,mFAAmF;IACnF,IAAI,eAAgC,CAAC;IACrC,IAAI,SAAS,EAAE,CAAC;QACd,eAAe,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAC/C,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEvD,eAAe,GAAG,MAAM,gBAAgB,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,EAAE;YAC1E,SAAS;YACT,WAAW;YACX,cAAc;SACf,CAAC,CAAC;QAEH,4CAA4C;QAC5C,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;YACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/B,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,+DAA+D;IAC/D,MAAM,SAAS,GAAoB,EAAE,CAAC;IACtC,IAAI,iBAAiB,GAAG,CAAC,CAAC;IAE1B,+BAA+B;IAC/B,MAAM,aAAa,GAAG,IAAI,GAAG,EAAyB,CAAC;IACvD,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;QACxC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,uDAAuD;IACvD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;QACnC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC;QAEhD,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACnD,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC,mBAAmB,CAAC;YACzD,iBAAiB,EAAE,CAAC;QACtB,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,oCAAoC;IACpC,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,MAAM,MAAM,GAAG,aAAa,CAAC,SAAS,CAAC,CAAC;IAExC,6CAA6C;IAC7C,IAAI,gBAAgB,EAAE,CAAC;QACrB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,KAAK,IAAI,KAAK,CAAC,SAAS,KAAK,gBAAgB,EAAE,CAAC;gBAClD,EAAE,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,gCAAgC;YACpD,CAAC;QACH,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAED,mCAAmC;IACnC,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IAErE,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,UAAU,EAAE,SAAS,CAAC,UAAU;QAChC,MAAM,EAAE,SAAS,CAAC,cAAc;QAChC,eAAe,EAAE,MAAM,CAAC,MAAM;QAC9B,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS;QAClC,YAAY,EAAE,iBAAiB;KAChC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAC3B,MAAuB,EACvB,SAAiB,EACjB,SAAmE;IAYnE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,cAAc,GAMf,EAAE,CAAC;IACR,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK;YAAE,SAAS;QAErB,MAAM,WAAW,GAAG,KAAK,CAAC,YAAY,IAAI,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAE3E,iDAAiD;QACjD,IAAI,WAAW,GAAG,WAAW,GAAG,SAAS,EAAE,CAAC;YAC1C,iCAAiC;YACjC,MAAM,eAAe,GAAG,SAAS,GAAG,WAAW,CAAC;YAChD,IAAI,eAAe,GAAG,GAAG,EAAE,CAAC;gBAC1B,MAAM,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;gBAChE,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9D,WAAW,IAAI,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBAC5C,cAAc,CAAC,IAAI,CAAC;oBAClB,EAAE,EAAE,KAAK,CAAC,EAAE;oBACZ,WAAW,EAAE,KAAK,CAAC,WAAW;oBAC9B,MAAM,EAAE,EAAE,CAAC,MAAM;oBACjB,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,KAAK;oBACxC,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;iBACjC,CAAC,CAAC;YACL,CAAC;YACD,MAAM;QACR,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,WAAW,IAAI,WAAW,CAAC;QAC3B,cAAc,CAAC,IAAI,CAAC;YAClB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,MAAM,EAAE,EAAE,CAAC,MAAM;YACjB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YAChF,MAAM,EAAE,SAAS,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;SACjC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC;QAC/B,UAAU,EAAE,WAAW;QACvB,cAAc;KACf,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,KAAkB,EAAE,OAAe,EAAE,MAAc;IAC/E,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,kBAAkB,EAAE,CAAC;IAC5D,MAAM,SAAS,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAE5C,OAAO,aAAa,KAAK,CAAC,WAAW,YAAY,IAAI,iBAAiB,SAAS,OAAO,OAAO,EAAE,CAAC;AAClG,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,OAAe,EAAE,SAAiB;IACvD,oCAAoC;IACpC,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC;IAE/B,IAAI,OAAO,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,qCAAqC;IACrC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC7C,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAElD,IAAI,WAAW,GAAG,QAAQ,GAAG,GAAG,EAAE,CAAC;QACjC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,GAAG,oBAAoB,CAAC;IAChE,CAAC;IAED,OAAO,SAAS,GAAG,kBAAkB,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAC1B,KAAa,EACb,UAAqC,EAAE;IAEvC,OAAO,eAAe,CAAC;QACrB,KAAK;QACL,IAAI,EAAE,QAAQ;QACd,GAAG,OAAO;KACX,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAC3B,KAAa,EACb,UAAqC,EAAE;IAEvC,OAAO,eAAe,CAAC;QACrB,KAAK,EAAE,KAAK;QACZ,IAAI,EAAE,SAAS;QACf,GAAG,OAAO;KACX,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,OAAO,CAC3B,OAAe,EACf,UAAqC,EAAE;IAEvC,OAAO,eAAe,CAAC;QACrB,KAAK,EAAE,OAAO;QACd,IAAI,EAAE,SAAS;QACf,GAAG,OAAO;KACX,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB;IACpC,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,cAAc,CAAC,OAAO,EAAE,CAAC;QAC/B,cAAc,GAAG,IAAI,CAAC;IACxB,CAAC;AACH,CAAC"}

package/dist/retrieval/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Retrieval system exports.
+ */
+export { traverse, traverseMultiple, resolveChunks, dedupeAndRank } from './traverser.js';
+export type { TraversalOptions } from './traverser.js';
+export { assembleContext, recall, explain, predict, disposeRetrieval, } from './context-assembler.js';
+export type { RetrievalMode, RetrievalRange, RetrievalRequest, RetrievalResponse } from './context-assembler.js';
+export { fuseRRF } from './rrf.js';
+export type { RankedItem, RRFSource } from './rrf.js';
+export { expandViaClusters } from './cluster-expander.js';
+export type { ClusterExpansionConfig } from './cluster-expander.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/retrieval/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/retrieval/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAC1F,YAAY,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAGvD,OAAO,EACL,eAAe,EACf,MAAM,EACN,OAAO,EACP,OAAO,EACP,gBAAgB,GACjB,MAAM,wBAAwB,CAAC;AAChC,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAGjH,OAAO,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AACnC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAGtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,YAAY,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC"}

package/dist/retrieval/index.js

@@ -0,0 +1,12 @@
+/**
+ * Retrieval system exports.
+ */
+// Traverser
+export { traverse, traverseMultiple, resolveChunks, dedupeAndRank } from './traverser.js';
+// Context assembler
+export { assembleContext, recall, explain, predict, disposeRetrieval, } from './context-assembler.js';
+// Reciprocal Rank Fusion
+export { fuseRRF } from './rrf.js';
+// Cluster expansion
+export { expandViaClusters } from './cluster-expander.js';
+//# sourceMappingURL=index.js.map

package/dist/retrieval/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/retrieval/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,YAAY;AACZ,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAG1F,oBAAoB;AACpB,OAAO,EACL,eAAe,EACf,MAAM,EACN,OAAO,EACP,OAAO,EACP,gBAAgB,GACjB,MAAM,wBAAwB,CAAC;AAGhC,yBAAyB;AACzB,OAAO,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAGnC,oBAAoB;AACpB,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC"}

package/dist/retrieval/rrf.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Reciprocal Rank Fusion (RRF) for combining ranked lists from different retrieval sources.
+ *
+ * Merges results from vector search, keyword search, and cluster expansion
+ * into a single ranked list using the formula:
+ *   score(chunk) = Sum(weight_i / (k + rank_i))
+ */
+export interface RankedItem {
+    chunkId: string;
+    score: number;
+    source?: 'vector' | 'keyword' | 'cluster' | 'graph';
+}
+export interface RRFSource {
+    items: RankedItem[];
+    weight: number;
+}
+/**
+ * Fuse multiple ranked lists using Reciprocal Rank Fusion.
+ *
+ * @param sources - Ranked lists with weights
+ * @param k - RRF constant (default: 60). Higher values reduce the impact of high-ranked items.
+ * @returns Merged list sorted by fused score descending, deduplicated by chunkId
+ */
+export declare function fuseRRF(sources: RRFSource[], k?: number): RankedItem[];
+//# sourceMappingURL=rrf.d.ts.map

package/dist/retrieval/rrf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rrf.d.ts","sourceRoot":"","sources":["../../src/retrieval/rrf.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,OAAO,CAAC;CACrD;AAED,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,MAAM,EAAE,MAAM,CAAC;CAChB;AAID;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,GAAE,MAAkB,GAAG,UAAU,EAAE,CAyCjF"}

package/dist/retrieval/rrf.js

@@ -0,0 +1,56 @@
+/**
+ * Reciprocal Rank Fusion (RRF) for combining ranked lists from different retrieval sources.
+ *
+ * Merges results from vector search, keyword search, and cluster expansion
+ * into a single ranked list using the formula:
+ *   score(chunk) = Sum(weight_i / (k + rank_i))
+ */
+const DEFAULT_K = 60;
+/**
+ * Fuse multiple ranked lists using Reciprocal Rank Fusion.
+ *
+ * @param sources - Ranked lists with weights
+ * @param k - RRF constant (default: 60). Higher values reduce the impact of high-ranked items.
+ * @returns Merged list sorted by fused score descending, deduplicated by chunkId
+ */
+export function fuseRRF(sources, k = DEFAULT_K) {
+    if (sources.length === 0)
+        return [];
+    // Map: chunkId → { fusedScore, sources[] }
+    const scoreMap = new Map();
+    for (const source of sources) {
+        for (let rank = 0; rank < source.items.length; rank++) {
+            const item = source.items[rank];
+            const rrfScore = source.weight / (k + rank + 1); // rank is 0-based, formula uses 1-based
+            const existing = scoreMap.get(item.chunkId);
+            if (existing) {
+                existing.score += rrfScore;
+                if (item.source)
+                    existing.sources.add(item.source);
+            }
+            else {
+                const sources = new Set();
+                if (item.source)
+                    sources.add(item.source);
+                scoreMap.set(item.chunkId, { score: rrfScore, sources });
+            }
+        }
+    }
+    // Convert to array and sort by fused score descending
+    const results = [];
+    for (const [chunkId, { score, sources }] of scoreMap) {
+        // Pick the first source as the primary one (vector > keyword > cluster > graph)
+        const priority = ['vector', 'keyword', 'cluster', 'graph'];
+        let bestSource = undefined;
+        for (const p of priority) {
+            if (sources.has(p)) {
+                bestSource = p;
+                break;
+            }
+        }
+        results.push({ chunkId, score, source: bestSource });
+    }
+    results.sort((a, b) => b.score - a.score);
+    return results;
+}
+//# sourceMappingURL=rrf.js.map

package/dist/retrieval/rrf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rrf.js","sourceRoot":"","sources":["../../src/retrieval/rrf.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAaH,MAAM,SAAS,GAAG,EAAE,CAAC;AAErB;;;;;;GAMG;AACH,MAAM,UAAU,OAAO,CAAC,OAAoB,EAAE,IAAY,SAAS;IACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAmD,CAAC;IAE5E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACtD,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,wCAAwC;YAEzF,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC;gBAC3B,IAAI,IAAI,CAAC,MAAM;oBAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;gBAClC,IAAI,IAAI,CAAC,MAAM;oBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,KAAK,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;QACrD,gFAAgF;QAChF,MAAM,QAAQ,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC3D,IAAI,UAAU,GAAyB,SAAS,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,UAAU,GAAG,CAAyB,CAAC;gBACvC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1C,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/retrieval/session-reconstructor.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Session context reconstruction.
+ *
+ * Pure chronological SQLite queries — bypasses the vector/keyword/RRF pipeline.
+ * Rebuilds session context by time range with token budgeting.
+ */
+import type { SessionInfo } from '../storage/chunk-store.js';
+import type { StoredChunk } from '../storage/types.js';
+/**
+ * Request to reconstruct session context.
+ */
+export interface ReconstructRequest {
+    /** Project slug (required) */
+    project: string;
+    /** Specific session ID */
+    sessionId?: string;
+    /** Start of time window (ISO 8601) */
+    from?: string;
+    /** End of time window (ISO 8601) */
+    to?: string;
+    /** Look back N days from now */
+    daysBack?: number;
+    /** Get the session before the current one */
+    previousSession?: boolean;
+    /** Current session ID (required when previousSession is true) */
+    currentSessionId?: string;
+    /** Token budget (defaults to mcpMaxResponseTokens) */
+    maxTokens?: number;
+    /** When truncating, keep newest chunks (default: true) */
+    keepNewest?: boolean;
+}
+/**
+ * A chunk in the reconstruction result.
+ */
+export interface ReconstructChunk {
+    id: string;
+    sessionId: string;
+    content: string;
+    startTime: string;
+    approxTokens: number;
+}
+/**
+ * Result of session reconstruction.
+ */
+export interface ReconstructResult {
+    chunks: ReconstructChunk[];
+    sessions: SessionInfo[];
+    totalTokens: number;
+    truncated: boolean;
+    timeRange: {
+        from: string;
+        to: string;
+    };
+}
+/**
+ * Resolve the time window from a ReconstructRequest into concrete from/to ISO dates.
+ */
+export declare function resolveTimeWindow(req: ReconstructRequest): {
+    from: string;
+    to: string;
+    sessionId?: string;
+};
+/**
+ * Apply token budget to a list of chunks.
+ * Returns the subset that fits within the budget.
+ */
+export declare function applyTokenBudget(chunks: StoredChunk[], maxTokens: number, keepNewest: boolean): {
+    kept: StoredChunk[];
+    truncated: boolean;
+};
+/**
+ * Format reconstruction result as text with session boundary markers.
+ */
+export declare function formatReconstruction(result: ReconstructResult): string;
+/**
+ * Reconstruct session context for a project.
+ */
+export declare function reconstructSession(req: ReconstructRequest): ReconstructResult;
+//# sourceMappingURL=session-reconstructor.d.ts.map

package/dist/retrieval/session-reconstructor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"session-reconstructor.d.ts","sourceRoot":"","sources":["../../src/retrieval/session-reconstructor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAQH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,8BAA8B;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,0BAA0B;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,oCAAoC;IACpC,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,gCAAgC;IAChC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,6CAA6C;IAC7C,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,iEAAiE;IACjE,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,0DAA0D;IAC1D,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,OAAO,CAAC;IACnB,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC;CACzC;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,kBAAkB,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,CAmC3G;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,WAAW,EAAE,EACrB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,OAAO,GAClB;IAAE,IAAI,EAAE,WAAW,EAAE,CAAC;IAAC,SAAS,EAAE,OAAO,CAAA;CAAE,CA2B7C;AAiBD;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,iBAAiB,GAAG,MAAM,CAmCtE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,GAAG,EAAE,kBAAkB,GAAG,iBAAiB,CA+D7E"}

package/dist/retrieval/session-reconstructor.js

@@ -0,0 +1,173 @@
+/**
+ * Session context reconstruction.
+ *
+ * Pure chronological SQLite queries — bypasses the vector/keyword/RRF pipeline.
+ * Rebuilds session context by time range with token budgeting.
+ */
+import { getConfig } from '../config/memory-config.js';
+import { getChunksByTimeRange, getPreviousSession, } from '../storage/chunk-store.js';
+/**
+ * Resolve the time window from a ReconstructRequest into concrete from/to ISO dates.
+ */
+export function resolveTimeWindow(req) {
+    if (req.previousSession) {
+        if (!req.currentSessionId) {
+            throw new Error('currentSessionId is required when previousSession is true');
+        }
+        const prev = getPreviousSession(req.project, req.currentSessionId);
+        if (!prev) {
+            return { from: '', to: '', sessionId: undefined };
+        }
+        return {
+            from: prev.firstChunkTime,
+            to: new Date(new Date(prev.lastChunkTime).getTime() + 1).toISOString(),
+            sessionId: prev.sessionId,
+        };
+    }
+    if (req.sessionId) {
+        // For a specific session, use a wide time window and filter by sessionId
+        return { from: '1970-01-01T00:00:00Z', to: '9999-12-31T23:59:59Z', sessionId: req.sessionId };
+    }
+    if (req.daysBack !== null && req.daysBack !== undefined) {
+        const to = new Date().toISOString();
+        const from = new Date(Date.now() - req.daysBack * 24 * 60 * 60 * 1000).toISOString();
+        return { from, to };
+    }
+    if (req.from || req.to) {
+        return {
+            from: req.from ?? '1970-01-01T00:00:00Z',
+            to: req.to ?? '9999-12-31T23:59:59Z',
+        };
+    }
+    throw new Error('Must specify one of: sessionId, from/to, daysBack, or previousSession');
+}
+/**
+ * Apply token budget to a list of chunks.
+ * Returns the subset that fits within the budget.
+ */
+export function applyTokenBudget(chunks, maxTokens, keepNewest) {
+    let totalTokens = 0;
+    for (const c of chunks) {
+        totalTokens += c.approxTokens;
+    }
+    if (totalTokens <= maxTokens) {
+        return { kept: chunks, truncated: false };
+    }
+    // Walk from the preferred end and collect until budget exhausted
+    const ordered = keepNewest ? [...chunks].reverse() : [...chunks];
+    const kept = [];
+    let budget = maxTokens;
+    for (const chunk of ordered) {
+        if (chunk.approxTokens > budget)
+            break;
+        kept.push(chunk);
+        budget -= chunk.approxTokens;
+    }
+    // Restore chronological order
+    if (keepNewest) {
+        kept.reverse();
+    }
+    return { kept, truncated: true };
+}
+/**
+ * Format a date for display in session headers.
+ */
+function formatDate(iso) {
+    const d = new Date(iso);
+    return d.toLocaleDateString('en-US', {
+        month: 'short',
+        day: 'numeric',
+    }) + ', ' + d.toLocaleTimeString('en-US', {
+        hour: 'numeric',
+        minute: '2-digit',
+        hour12: true,
+    });
+}
+/**
+ * Format reconstruction result as text with session boundary markers.
+ */
+export function formatReconstruction(result) {
+    if (result.chunks.length === 0) {
+        return 'No session data found for the specified time range.';
+    }
+    const lines = [];
+    let currentSessionId = '';
+    // Group chunks by session and add headers
+    for (const chunk of result.chunks) {
+        if (chunk.sessionId !== currentSessionId) {
+            currentSessionId = chunk.sessionId;
+            const session = result.sessions.find((s) => s.sessionId === currentSessionId);
+            if (session) {
+                const startStr = formatDate(session.firstChunkTime);
+                const endStr = formatDate(session.lastChunkTime);
+                lines.push(`=== Session ${session.sessionId.slice(0, 8)} (${startStr} – ${endStr}) ===`);
+            }
+        }
+        lines.push(chunk.content);
+        lines.push('---');
+    }
+    // Remove trailing separator
+    if (lines[lines.length - 1] === '---') {
+        lines.pop();
+    }
+    let header = `Reconstructed ${result.chunks.length} chunks from ${result.sessions.length} session(s) (${result.totalTokens} tokens)`;
+    if (result.truncated) {
+        header += ' [truncated to fit token budget]';
+    }
+    header += '\n\n';
+    return header + lines.join('\n');
+}
+/**
+ * Reconstruct session context for a project.
+ */
+export function reconstructSession(req) {
+    const config = getConfig();
+    const maxTokens = req.maxTokens ?? config.mcpMaxResponseTokens;
+    const keepNewest = req.keepNewest ?? true;
+    const window = resolveTimeWindow(req);
+    // Handle case where no previous session was found
+    if (!window.from && !window.to) {
+        return {
+            chunks: [],
+            sessions: [],
+            totalTokens: 0,
+            truncated: false,
+            timeRange: { from: '', to: '' },
+        };
+    }
+    const rawChunks = getChunksByTimeRange(req.project, window.from, window.to, window.sessionId ? { sessionId: window.sessionId } : undefined);
+    const { kept, truncated } = applyTokenBudget(rawChunks, maxTokens, keepNewest);
+    // Build session summaries from the kept chunks
+    const sessionMap = new Map();
+    for (const chunk of kept) {
+        const entry = sessionMap.get(chunk.sessionId) ?? { chunks: [] };
+        entry.chunks.push(chunk);
+        sessionMap.set(chunk.sessionId, entry);
+    }
+    const sessions = [];
+    for (const [sessionId, { chunks }] of sessionMap) {
+        sessions.push({
+            sessionId,
+            firstChunkTime: chunks[0].startTime,
+            lastChunkTime: chunks[chunks.length - 1].endTime,
+            chunkCount: chunks.length,
+            totalTokens: chunks.reduce((sum, c) => sum + c.approxTokens, 0),
+        });
+    }
+    const resultChunks = kept.map((c) => ({
+        id: c.id,
+        sessionId: c.sessionId,
+        content: c.content,
+        startTime: c.startTime,
+        approxTokens: c.approxTokens,
+    }));
+    const totalTokens = kept.reduce((sum, c) => sum + c.approxTokens, 0);
+    return {
+        chunks: resultChunks,
+        sessions,
+        totalTokens,
+        truncated,
+        timeRange: { from: window.from, to: window.to },
+    };
+}
+//# sourceMappingURL=session-reconstructor.js.map

package/dist/retrieval/session-reconstructor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"session-reconstructor.js","sourceRoot":"","sources":["../../src/retrieval/session-reconstructor.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AACvD,OAAO,EACL,oBAAoB,EAEpB,kBAAkB,GACnB,MAAM,2BAA2B,CAAC;AAkDnC;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAuB;IACvD,IAAI,GAAG,CAAC,eAAe,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC;YAC1B,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAC;QAC/E,CAAC;QACD,MAAM,IAAI,GAAG,kBAAkB,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;QACpD,CAAC;QACD,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,cAAc;YACzB,EAAE,EAAE,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE;YACtE,SAAS,EAAE,IAAI,CAAC,SAAS;SAC1B,CAAC;IACJ,CAAC;IAED,IAAI,GAAG,CAAC,SAAS,EAAE,CAAC;QAClB,yEAAyE;QACzE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,EAAE,EAAE,sBAAsB,EAAE,SAAS,EAAE,GAAG,CAAC,SAAS,EAAE,CAAC;IAChG,CAAC;IAED,IAAI,GAAG,CAAC,QAAQ,KAAK,IAAI,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;QACxD,MAAM,EAAE,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,QAAQ,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;QACrF,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IACtB,CAAC;IAED,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC;QACvB,OAAO;YACL,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,sBAAsB;YACxC,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,sBAAsB;SACrC,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAC;AAC3F,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAqB,EACrB,SAAiB,EACjB,UAAmB;IAEnB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,WAAW,IAAI,CAAC,CAAC,YAAY,CAAC;IAChC,CAAC;IAED,IAAI,WAAW,IAAI,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAC5C,CAAC;IAED,iEAAiE;IACjE,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IACjE,MAAM,IAAI,GAAkB,EAAE,CAAC;IAC/B,IAAI,MAAM,GAAG,SAAS,CAAC;IAEvB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,YAAY,GAAG,MAAM;YAAE,MAAM;QACvC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC;IAC/B,CAAC;IAED,8BAA8B;IAC9B,IAAI,UAAU,EAAE,CAAC;QACf,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,GAAW;IAC7B,MAAM,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC,kBAAkB,CAAC,OAAO,EAAE;QACnC,KAAK,EAAE,OAAO;QACd,GAAG,EAAE,SAAS;KACf,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,kBAAkB,CAAC,OAAO,EAAE;QACxC,IAAI,EAAE,SAAS;QACf,MAAM,EAAE,SAAS;QACjB,MAAM,EAAE,IAAI;KACb,CAAC,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAyB;IAC5D,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,qDAAqD,CAAC;IAC/D,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,gBAAgB,GAAG,EAAE,CAAC;IAE1B,0CAA0C;IAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,SAAS,KAAK,gBAAgB,EAAE,CAAC;YACzC,gBAAgB,GAAG,KAAK,CAAC,SAAS,CAAC;YACnC,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,gBAAgB,CAAC,CAAC;YAC9E,IAAI,OAAO,EAAE,CAAC;gBACZ,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;gBACpD,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;gBACjD,KAAK,CAAC,IAAI,CAAC,eAAe,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,QAAQ,MAAM,MAAM,OAAO,CAAC,CAAC;YAC3F,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpB,CAAC;IAED,4BAA4B;IAC5B,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;QACtC,KAAK,CAAC,GAAG,EAAE,CAAC;IACd,CAAC;IAED,IAAI,MAAM,GAAG,iBAAiB,MAAM,CAAC,MAAM,CAAC,MAAM,gBAAgB,MAAM,CAAC,QAAQ,CAAC,MAAM,gBAAgB,MAAM,CAAC,WAAW,UAAU,CAAC;IACrI,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;QACrB,MAAM,IAAI,kCAAkC,CAAC;IAC/C,CAAC;IACD,MAAM,IAAI,MAAM,CAAC;IAEjB,OAAO,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,GAAuB;IACxD,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,IAAI,MAAM,CAAC,oBAAoB,CAAC;IAC/D,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,IAAI,IAAI,CAAC;IAE1C,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAEtC,kDAAkD;IAClD,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;QAC/B,OAAO;YACL,MAAM,EAAE,EAAE;YACV,QAAQ,EAAE,EAAE;YACZ,WAAW,EAAE,CAAC;YACd,SAAS,EAAE,KAAK;YAChB,SAAS,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE;SAChC,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,oBAAoB,CACpC,GAAG,CAAC,OAAO,EACX,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,EAAE,EACT,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAC/D,CAAC;IAEF,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;IAE/E,+CAA+C;IAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAqC,CAAC;IAChE,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QAChE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS;YACT,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS;YACnC,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO;YAChD,UAAU,EAAE,MAAM,CAAC,MAAM;YACzB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;SAChE,CAAC,CAAC;IACL,CAAC;IAED,MAAM,YAAY,GAAuB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxD,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,YAAY,EAAE,CAAC,CAAC,YAAY;KAC7B,CAAC,CAAC,CAAC;IAEJ,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IAErE,OAAO;QACL,MAAM,EAAE,YAAY;QACpB,QAAQ;QACR,WAAW;QACX,SAAS;QACT,SAAS,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE;KAChD,CAAC;AACJ,CAAC"}

package/dist/retrieval/traverser.d.ts

@@ -0,0 +1,66 @@
+/**
+ * Graph traversal with decay-weighted edges.
+ *
+ * Uses sum-product rules analogous to Feynman path integrals:
+ * - Product: Weights multiply along each path
+ * - Sum: Multiple paths to the same node accumulate
+ * - Convergence: Cycles naturally attenuate (no explicit detection needed)
+ *
+ * Since edge weights are in (0,1], path products decrease with length.
+ * The minWeight threshold prunes paths that have attenuated below relevance,
+ * which naturally handles cycle convergence.
+ */
+import type { DecayModelConfig } from '../core/decay-types.js';
+import type { WeightedChunk, TraversalResult, StoredChunk } from '../storage/types.js';
+import type { VectorClock } from '../temporal/vector-clock.js';
+/**
+ * Options for graph traversal.
+ * Direction-specific decay curves are automatically applied:
+ * - Backward: Linear (dies@10) for 4-20 hop range
+ * - Forward: Delayed linear (5h, dies@20) for 1-20 hop range
+ */
+export interface TraversalOptions {
+    /** Maximum traversal depth. Default: from config. */
+    maxDepth?: number;
+    /** Minimum weight threshold. Default: from config. */
+    minWeight?: number;
+    /** Time-based decay configuration (fallback for edges without vector clocks). */
+    decayConfig?: DecayModelConfig;
+    /** Traversal direction. Determines which decay curve is used. */
+    direction: 'backward' | 'forward';
+    /** Reference clock for vector clock-based decay (optional). */
+    referenceClock?: VectorClock;
+}
+/**
+ * Traverse the graph from a starting chunk using sum-product rules.
+ *
+ * Weights multiply along paths (product) and accumulate when multiple
+ * paths reach the same node (sum). Cycles are handled naturally by
+ * convergence — since weights are <1, cyclic paths attenuate geometrically
+ * and are pruned when they fall below minWeight.
+ *
+ * @param startChunkId - Starting chunk ID
+ * @param queryTime - Query time in milliseconds (for decay calculation)
+ * @param options - Traversal options
+ * @returns Traversal result with weighted chunks
+ */
+export declare function traverse(startChunkId: string, queryTime: number, options: TraversalOptions): Promise<TraversalResult>;
+/**
+ * Traverse from multiple starting points and merge results.
+ * Useful for starting from vector search results.
+ */
+export declare function traverseMultiple(startChunkIds: string[], startWeights: number[], queryTime: number, options: TraversalOptions): Promise<TraversalResult>;
+/**
+ * Get chunks with their content from traversal results.
+ */
+export declare function resolveChunks(traversalResult: TraversalResult): Array<{
+    chunk: StoredChunk;
+    weight: number;
+    depth: number;
+}>;
+/**
+ * Deduplicate and re-rank weighted chunks.
+ * Combines duplicate entries and applies additional scoring.
+ */
+export declare function dedupeAndRank(chunks: WeightedChunk[]): WeightedChunk[];
+//# sourceMappingURL=traverser.d.ts.map

package/dist/retrieval/traverser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverser.d.ts","sourceRoot":"","sources":["../../src/retrieval/traverser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAKH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,eAAe,EAAY,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACjG,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,qDAAqD;IACrD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iFAAiF;IACjF,WAAW,CAAC,EAAE,gBAAgB,CAAC;IAC/B,iEAAiE;IACjE,SAAS,EAAE,UAAU,GAAG,SAAS,CAAC;IAClC,+DAA+D;IAC/D,cAAc,CAAC,EAAE,WAAW,CAAC;CAC9B;AAED;;;;;;;;;;;;GAYG;AACH,wBAAsB,QAAQ,CAC5B,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,CAyE1B;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CACpC,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,EAAE,MAAM,EAAE,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,CA0C1B;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,eAAe,EAAE,eAAe,GAC/B,KAAK,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAe9D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,GAAG,aAAa,EAAE,CAmBtE"}

package/dist/retrieval/traverser.js

@@ -0,0 +1,160 @@
+/**
+ * Graph traversal with decay-weighted edges.
+ *
+ * Uses sum-product rules analogous to Feynman path integrals:
+ * - Product: Weights multiply along each path
+ * - Sum: Multiple paths to the same node accumulate
+ * - Convergence: Cycles naturally attenuate (no explicit detection needed)
+ *
+ * Since edge weights are in (0,1], path products decrease with length.
+ * The minWeight threshold prunes paths that have attenuated below relevance,
+ * which naturally handles cycle convergence.
+ */
+import { getWeightedEdges } from '../storage/edge-store.js';
+import { getChunkById } from '../storage/chunk-store.js';
+import { getConfig } from '../config/memory-config.js';
+/**
+ * Traverse the graph from a starting chunk using sum-product rules.
+ *
+ * Weights multiply along paths (product) and accumulate when multiple
+ * paths reach the same node (sum). Cycles are handled naturally by
+ * convergence — since weights are <1, cyclic paths attenuate geometrically
+ * and are pruned when they fall below minWeight.
+ *
+ * @param startChunkId - Starting chunk ID
+ * @param queryTime - Query time in milliseconds (for decay calculation)
+ * @param options - Traversal options
+ * @returns Traversal result with weighted chunks
+ */
+export async function traverse(startChunkId, queryTime, options) {
+    const config = getConfig();
+    const { maxDepth = config.maxTraversalDepth, minWeight = config.minSignalThreshold, direction, referenceClock, } = options;
+    // Select time-based decay config as fallback (for edges without vector clocks)
+    const decayConfig = options.decayConfig ?? (direction === 'backward' ? config.shortRangeDecay : config.forwardDecay);
+    // Accumulate weights across all paths (sum rule)
+    const accumulatedWeights = new Map();
+    const minDepths = new Map();
+    let pathsExplored = 0;
+    async function visit(chunkId, depth, pathWeight) {
+        // Prune paths that have attenuated below threshold (convergence criterion)
+        // Since edge weights are <1, cyclic paths naturally attenuate until pruned
+        if (pathWeight < minWeight)
+            return;
+        if (depth > maxDepth)
+            return;
+        pathsExplored++;
+        // Accumulate this path's weight contribution (sum rule)
+        const existingWeight = accumulatedWeights.get(chunkId) ?? 0;
+        accumulatedWeights.set(chunkId, existingWeight + pathWeight);
+        // Track minimum depth for reporting
+        const existingDepth = minDepths.get(chunkId) ?? Infinity;
+        minDepths.set(chunkId, Math.min(existingDepth, depth));
+        // Get weighted edges from this chunk
+        const edges = getWeightedEdges(chunkId, queryTime, decayConfig, direction, referenceClock);
+        for (const edge of edges) {
+            // Compute new path weight (product rule)
+            const newWeight = pathWeight * edge.weight;
+            // Recursively visit — cycles naturally attenuate via weight products <1
+            await visit(edge.targetChunkId, depth + 1, newWeight);
+        }
+    }
+    // Start traversal from the given chunk
+    await visit(startChunkId, 0, 1.0);
+    // Convert accumulated weights to results
+    const results = [];
+    for (const [chunkId, weight] of accumulatedWeights) {
+        if (chunkId !== startChunkId) { // Exclude start node from results
+            results.push({
+                chunkId,
+                weight,
+                depth: minDepths.get(chunkId) ?? 0,
+            });
+        }
+    }
+    // Sort by weight descending
+    results.sort((a, b) => b.weight - a.weight);
+    return {
+        chunks: results,
+        visited: pathsExplored,
+    };
+}
+/**
+ * Traverse from multiple starting points and merge results.
+ * Useful for starting from vector search results.
+ */
+export async function traverseMultiple(startChunkIds, startWeights, queryTime, options) {
+    // Track all visited and accumulated weights
+    const globalWeights = new Map();
+    const globalDepths = new Map();
+    let totalVisited = 0;
+    for (let i = 0; i < startChunkIds.length; i++) {
+        const startId = startChunkIds[i];
+        const startWeight = startWeights[i] ?? 1.0;
+        // Adjust options with starting weight
+        const result = await traverse(startId, queryTime, options);
+        totalVisited += result.visited;
+        // Merge results, accumulating weights
+        for (const chunk of result.chunks) {
+            const scaledWeight = chunk.weight * startWeight;
+            const existingWeight = globalWeights.get(chunk.chunkId) ?? 0;
+            globalWeights.set(chunk.chunkId, existingWeight + scaledWeight);
+            // Keep minimum depth
+            const existingDepth = globalDepths.get(chunk.chunkId) ?? Infinity;
+            globalDepths.set(chunk.chunkId, Math.min(existingDepth, chunk.depth));
+        }
+    }
+    // Convert to array and sort
+    const chunks = [];
+    for (const [chunkId, weight] of globalWeights) {
+        chunks.push({
+            chunkId,
+            weight,
+            depth: globalDepths.get(chunkId) ?? 0,
+        });
+    }
+    chunks.sort((a, b) => b.weight - a.weight);
+    return {
+        chunks,
+        visited: totalVisited,
+    };
+}
+/**
+ * Get chunks with their content from traversal results.
+ */
+export function resolveChunks(traversalResult) {
+    const resolved = [];
+    for (const wc of traversalResult.chunks) {
+        const chunk = getChunkById(wc.chunkId);
+        if (chunk) {
+            resolved.push({
+                chunk,
+                weight: wc.weight,
+                depth: wc.depth,
+            });
+        }
+    }
+    return resolved;
+}
+/**
+ * Deduplicate and re-rank weighted chunks.
+ * Combines duplicate entries and applies additional scoring.
+ */
+export function dedupeAndRank(chunks) {
+    const byId = new Map();
+    for (const chunk of chunks) {
+        const existing = byId.get(chunk.chunkId);
+        if (existing) {
+            // Combine weights (sum with diminishing returns)
+            existing.weight = existing.weight + chunk.weight * 0.5;
+            // Keep minimum depth
+            existing.depth = Math.min(existing.depth, chunk.depth);
+        }
+        else {
+            byId.set(chunk.chunkId, { ...chunk });
+        }
+    }
+    const deduped = Array.from(byId.values());
+    deduped.sort((a, b) => b.weight - a.weight);
+    return deduped;
+}
+//# sourceMappingURL=traverser.js.map