@theokit/sdk 4.37.2 → 4.39.0

package/dist/chunk-4F7JQZOX.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/memory/index-schema.ts","../src/internal/memory/index-db.ts","../src/internal/memory/lance-index.ts","../src/internal/memory/memory-index.ts","../src/internal/memory/lance-memory-adapter.ts","../src/internal/memory/index-manager-dispatch.ts","../src/internal/memory/types.ts","../src/internal/memory/storage/markdown-store.ts","../src/internal/memory/storage/session-summary-writer.ts","../src/internal/memory/storage/session-loader.ts","../src/internal/memory/storage/wiki-loader.ts","../src/internal/memory/index-manager-helpers.ts","../src/internal/memory/sqlite-vec-loader.ts","../src/internal/memory/storage/chunk-markdown.ts","../src/internal/memory/vec-index.ts","../src/internal/memory/index-manager.ts"],"names":["join","resolvePath","mkdir","readdir","relativeToRoot","createHash","readFile","stat"],"mappings":";;;;;;;;;;;;;;AAgBO,IAAM,iBAAA,GAA2C;AAAA,EACtD,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAQA,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EASA,CAAA;AAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAKA,CAAA;AAAA;AAAA,MAAA,CAAA;AAAA,EAGA,CAAA;AAAA;AAAA,MAAA,CAAA;AAAA,EAGA,CAAA;AAAA;AAAA;AAAA,IAAA,CAAA;AAAA,EAIA,CAAA,gEAAA;AACF,CAAA;AAOO,IAAM,iBAAA,GAA2C;AAAA,EACtD,2BAAA;AAAA,EACA;AACF,CAAA;;;ACrBA,eAAsB,aAAa,IAAA,EAAwC;AACzE,EAAA,OAAO,mBAAA,CAA8B;AAAA,IACnC,UAAU,IAAA,CAAK,QAAA;AAAA,IACf,KAAA,EAAO,cAAA;AAAA,IACP,gBAAgB,IAAA,CAAK,cAAA;AAAA,IACrB,MAAA,EAAQ,CAAC,EAAA,KAAO;AAEd,MAAA,KAAA,MAAW,MAAA,IAAU,iBAAA,EAAmB,EAAA,CAAG,IAAA,CAAK,MAAM,CAAA;AACtD,MAAA,KAAA,MAAW,IAAA,IAAQ,iBAAA,EAAmB,EAAA,CAAG,IAAA,CAAK,IAAI,CAAA;AAAA,IACpD;AAAA,GACD,CAAA;AACH;AAEO,SAAS,iBAAiB,GAAA,EAAqB;AACpD,EAAA,OAAO,IAAA,CAAK,GAAA,EAAK,UAAA,EAAY,QAAA,EAAU,UAAU,eAAe,CAAA;AAClE;AC0CA,SAAS,YAAA,GAA4B;AACnC,EAAA,IAAI;AACF,IAAA,MAAM,CAAA,GAAI,aAAA,CAAc,MAAA,CAAA,IAAA,CAAY,GAAG,CAAA;AACvC,IAAA,OAAO,EAAE,kBAAkB,CAAA;AAAA,EAC7B,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,+KAAA;AAAA,MAEA,EAAE,IAAA,EAAM,2BAAA,EAA6B,KAAA;AAAM,KAC7C;AAAA,EACF;AACF;AAQO,IAAM,UAAA,GAAN,MAAM,WAAA,CAAW;AAAA,EACd,WAAA,CACW,KAAA,EACA,SAAA,EACA,YAAA,EACjB;AAHiB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AACA,IAAA,IAAA,CAAA,YAAA,GAAA,YAAA;AAAA,EAChB;AAAA,EAHgB,KAAA;AAAA,EACA,SAAA;AAAA,EACA,YAAA;AAAA,EAGnB,aAAa,KAAK,IAAA,EAA6C;AAC7D,IAAA,MAAM,QAAQ,YAAA,EAAa;AAC3B,IAAA,MAAM,WAAA,GAAc,KAAK,WAAA,IAAeA,IAAAA,CAAK,KAAK,GAAA,EAAK,UAAA,EAAY,UAAU,OAAO,CAAA;AACpF,IAAA,SAAA,CAAU,WAAA,EAAa,EAAE,SAAA,EAAW,IAAA,EAAM,CAAA;AAC1C,IAAA,MAAM,IAAA,GAAO,MAAM,KAAA,CAAM,OAAA,CAAQ,WAAW,CAAA;AAC5C,IAAA,MAAM,GAAA,GAAM,KAAK,SAAA,CAAU,SAAA;AAC3B,IAAA,MAAM,SAAA,GAAY,OAAA;AAClB,IAAA,MAAM,QAAA,GAAW,MAAM,IAAA,CAAK,UAAA,EAAW;AACvC,IAAA,IAAI,KAAA;AACJ,IAAA,IAAI,QAAA,CAAS,QAAA,CAAS,SAAS,CAAA,EAAG;AAChC,MAAA,KAAA,GAAQ,MAAM,IAAA,CAAK,SAAA,CAAU,SAAS,CAAA;AAKtC,MAAA,MAAM,MAAA,GAAS,MAAM,KAAA,CAAM,MAAA,EAAO;AAClC,MAAA,MAAM,QAAA,GAAW,OAAO,MAAA,CAAO,IAAA,CAAK,CAAC,CAAA,KAAM,CAAA,CAAE,SAAS,WAAW,CAAA;AACjE,MAAA,MAAM,WAAA,GAAc,QAAA,EAAU,IAAA,EAAM,QAAA,IAAY,UAAU,IAAA,EAAM,SAAA;AAChE,MAAA,IAAI,OAAO,WAAA,KAAgB,QAAA,IAAY,WAAA,KAAgB,GAAA,EAAK;AAC1D,QAAA,MAAM,IAAI,kBAAA;AAAA,UACR,CAAA,yDAAA,EAA4D,WAAW,CAAA,sCAAA,EAAyC,GAAG,CAAA,+FAAA,CAAA;AAAA,UACnH,EAAE,MAAM,8BAAA;AAA+B,SACzC;AAAA,MACF;AAAA,IACF,CAAA,MAAO;AAGL,MAAA,MAAM,SAAA,GAA6B;AAAA,QACjC,EAAA,EAAI,eAAA;AAAA,QACJ,IAAA,EAAM,EAAA;AAAA,QACN,MAAA,EAAQ,QAAA;AAAA,QACR,WAAW,IAAI,KAAA,CAAM,GAAG,CAAA,CAAE,KAAK,CAAC,CAAA;AAAA,QAChC,SAAA,EAAW,eAAA;AAAA,QACX,KAAA,EAAO,eAAA;AAAA,QACP,OAAA,EAAS,eAAA;AAAA,QACT,SAAA,EAAW;AAAA,OACb;AACA,MAAA,KAAA,GAAQ,MAAM,IAAA,CAAK,WAAA,CAAY,SAAA,EAAW,CAAC,SAAS,CAAC,CAAA;AACrD,MAAA,MAAM,KAAA,CAAM,OAAO,6BAA6B,CAAA;AAAA,IAClD;AACA,IAAA,OAAO,IAAI,WAAA,CAAW,KAAA,EAAO,IAAA,CAAK,WAAW,GAAG,CAAA;AAAA,EAClD;AAAA,EAEA,MAAM,SAAS,KAAA,EAAyE;AACtF,IAAA,IAAI,KAAA,CAAM,WAAW,CAAA,EAAG;AACxB,IAAA,MAAM,QAAQ,KAAA,CAAM,GAAA,CAAI,CAAC,CAAA,KAAM,EAAE,IAAI,CAAA;AACrC,IAAA,MAAM,UAAA,GAAa,MAAM,IAAA,CAAK,SAAA,CAAU,MAAM,KAAK,CAAA;AACnD,IAAA,MAAM,IAAA,GAA0B,KAAA,CAAM,GAAA,CAAI,CAAC,GAAG,CAAA,MAAO;AAAA,MACnD,GAAG,CAAA;AAAA,MACH,SAAA,EAAW,UAAA,CAAW,CAAC,CAAA,IAAK,IAAI,MAAM,IAAA,CAAK,YAAY,CAAA,CAAE,IAAA,CAAK,CAAC;AAAA,KACjE,CAAE,CAAA;AACF,IAAA,MAAM,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,IAAI,CAAA;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAM,MAAA,CAAO,KAAA,EAAe,IAAA,EAAqD;AAC/E,IAAA,MAAM,CAAC,SAAS,CAAA,GAAI,MAAM,KAAK,SAAA,CAAU,KAAA,CAAM,CAAC,KAAK,CAAC,CAAA;AACtD,IAAA,IAAI,SAAA,KAAc,MAAA,EAAW,OAAO,EAAC;AAQrC,IAAA,MAAM,aAAuB,CAAC,CAAA,aAAA,EAAgB,eAAe,IAAA,CAAK,SAAS,CAAC,CAAA,CAAA,CAAG,CAAA;AAC/E,IAAA,IAAI,IAAA,CAAK,UAAU,MAAA,EAAW;AAC5B,MAAA,UAAA,CAAW,KAAK,CAAA,SAAA,EAAY,cAAA,CAAe,IAAA,CAAK,KAAK,CAAC,CAAA,CAAA,CAAG,CAAA;AAAA,IAC3D;AACA,IAAA,IAAI,CAAA,GAAI,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,SAAS,EAAE,KAAA,CAAM,UAAA,CAAW,IAAA,CAAK,OAAO,CAAC,CAAA;AACnE,IAAA,IAAI,KAAK,KAAA,KAAU,MAAA,MAAe,CAAA,CAAE,KAAA,CAAM,KAAK,KAAK,CAAA;AACpD,IAAA,MAAM,OAAA,GAAU,MAAM,CAAA,CAAE,OAAA,EAAQ;AAChC,IAAA,OAAO,QACJ,MAAA,CAAO,CAAC,CAAA,KAAM,IAAA,CAAK,YAAY,MAAA,IAAa,IAAA,CAAK,OAAA,CAAQ,QAAA,CAAS,EAAE,MAAM,CAAC,CAAA,CAC3E,GAAA,CAAI,CAAC,CAAA,MAAO;AAAA,MACX,IAAI,CAAA,CAAE,EAAA;AAAA,MACN,MAAM,CAAA,CAAE,IAAA;AAAA,MACR,QAAQ,CAAA,CAAE,MAAA;AAAA,MACV,WAAW,CAAA,CAAE,SAAA;AAAA,MACb,OAAO,CAAA,CAAE,KAAA;AAAA,MACT,QAAQ,CAAA,CAAE,OAAA;AAAA;AAAA,MAEV,KAAA,EAAO,CAAA,IAAK,CAAA,IAAK,CAAA,CAAE,SAAA,IAAa,CAAA,CAAA;AAAA,KAClC,CAAE,CAAA;AAAA,EACN;AAAA,EAEA,MAAM,WAAW,SAAA,EAAoC;AAKnD,IAAA,OAAO,IAAA,CAAK,MAAM,SAAA,EAAU;AAAA,EAC9B;AAAA,EAEA,MAAM,YAAY,GAAA,EAA2C;AAC3D,IAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG;AAKtB,IAAA,MAAM,OAAA,GAAU,GAAA,CAAI,GAAA,CAAI,CAAC,OAAO,CAAA,CAAA,EAAI,EAAA,CAAG,OAAA,CAAQ,IAAA,EAAM,IAAI,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AACxE,IAAA,MAAM,IAAA,CAAK,KAAA,CAAM,MAAA,CAAO,CAAA,OAAA,EAAU,OAAO,CAAA,CAAA,CAAG,CAAA;AAAA,EAC9C;AAAA,EAEA,MAAM,KAAA,GAAuB;AAAA,EAE7B;AACF;AAsBA,SAAS,eAAe,KAAA,EAAuB;AAE7C,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,UAAA,CAAW,CAAC,CAAA;AAC/B,IAAA,IAAI,SAAS,CAAA,IAAS,IAAA,IAAQ,KAAQ,IAAA,IAAQ,EAAA,IAAS,SAAS,GAAA,EAAM;AACpE,MAAA,MAAM,IAAI,kBAAA;AAAA,QACR,2DAA2D,CAAC,CAAA,IAAA,EAAO,IAAA,CAAK,QAAA,CAAS,EAAE,CAAC,CAAA,0CAAA,CAAA;AAAA,QAEpF,EAAE,MAAM,uBAAA;AAAwB,OAClC;AAAA,IACF;AAAA,EACF;AAEA,EAAA,OAAO,MAAM,OAAA,CAAQ,KAAA,EAAO,MAAM,CAAA,CAAE,OAAA,CAAQ,MAAM,IAAI,CAAA;AACxD;AAwBO,SAAS,iBAAiB,GAAA,EAAqB;AACpD,EAAA,OAAOA,IAAAA,CAAK,GAAA,EAAK,UAAA,EAAY,QAAA,EAAU,OAAO,CAAA;AAChD;;;AClQO,SAAS,kBAAA,CAAmB,OAAA,GAAyB,EAAC,EAG3D;AACA,EAAA,OAAO;AAAA,IACL,YAAY,IAAA,CAAK,GAAA,CAAI,CAAA,EAAG,OAAA,CAAQ,cAAc,EAAE,CAAA;AAAA,IAChD,QAAA,EAAU,QAAQ,QAAA,IAAY;AAAA,GAChC;AACF;;;ACNA,IAAM,iBAAA,GAAoB,SAAA;AAG1B,IAAM,iBAAA,GAAgC,OAAO,MAAA,CAAO;AAAA,EAClD,YAAA,EAAc,CAAA;AAAA,EACd,YAAA,EAAc,CAAA;AAAA,EACd,aAAA,EAAe,CAAA;AAAA,EACf,cAAA,EAAgB;AAClB,CAAC,CAAA;AAEM,IAAM,qBAAN,MAAgD;AAAA,EACrD,YAA6B,KAAA,EAAmB;AAAnB,IAAA,IAAA,CAAA,KAAA,GAAA,KAAA;AAAA,EAAoB;AAAA,EAApB,KAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAM7B,MAAM,IAAA,GAA4B;AAChC,IAAA,OAAO,iBAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAE3D,IAAA,MAAM,SAAA,GAAY,MAAM,IAAA,CAAK,KAAA,CAAM,OAAO,KAAA,EAAO;AAAA,MAC/C,SAAA,EAAW,iBAAA;AAAA,MACX,OAAO,UAAA,GAAa,CAAA;AAAA,MACpB,GAAI,QAAQ,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,EAAS,OAAA,CAAQ,OAAA,EAAQ,GAAI;AAAC,KACrE,CAAA;AACD,IAAA,OAAO,UACJ,MAAA,CAAO,CAAC,MAAM,CAAA,CAAE,KAAA,IAAS,QAAQ,CAAA,CACjC,KAAA,CAAM,CAAA,EAAG,UAAU,EACnB,GAAA,CAAI,CAAC,MAAM,iBAAA,CAAkB,CAAA,EAAG,KAAK,CAAC,CAAA;AAAA,EAC3C;AAAA,EAEA,MAAA,GAAsB;AAIpB,IAAA,OAAO;AAAA,MACL,OAAA,EAAS,QAAA;AAAA,MACT,YAAA,EAAc,CAAA;AAAA,MACd,aAAA,EAAe;AAAA,KACjB;AAAA,EACF;AAAA,EAEA,MAAM,KAAA,GAAuB;AAC3B,IAAA,MAAM,IAAA,CAAK,MAAM,KAAA,EAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,MAAA,GAAqB;AACnB,IAAA,OAAO,IAAA,CAAK,KAAA;AAAA,EACd;AACF,CAAA;AAcA,SAAS,iBAAA,CACP,KACA,KAAA,EACiB;AACjB,EAAA,MAAM,YAAY,KAAA,KAAU,MAAA,GAAY,wBAAwB,KAAA,EAAO,GAAA,CAAI,IAAI,CAAA,GAAI,CAAA;AACnF,EAAA,MAAM,cAAc,GAAA,CAAI,KAAA;AAExB,EAAA,MAAM,QAAA,GAAW,GAAA,GAAM,WAAA,GAAc,GAAA,GAAM,SAAA;AAC3C,EAAA,OAAO;AAAA,IACL,MAAM,GAAA,CAAI,EAAA;AAAA,IACV,SAAA,EAAW,CAAA;AAAA,IACX,OAAA,EAAS,CAAA;AAAA,IACT,KAAA,EAAO,QAAA;AAAA,IACP,SAAA;AAAA,IACA,WAAA;AAAA,IACA,OAAA,EAAS,GAAA,CAAI,IAAA,CAAK,KAAA,CAAM,GAAG,GAAG,CAAA;AAAA,IAC9B,QAAQ,GAAA,CAAI,MAAA;AAAA,IACZ,UAAU,GAAA,CAAI;AAAA,GAChB;AACF;AAQA,SAAS,uBAAA,CAAwB,OAAe,IAAA,EAAsB;AACpE,EAAA,MAAM,UAAA,GAAa,KAAA,CAChB,WAAA,EAAY,CACZ,KAAA,CAAM,KAAK,CAAA,CACX,MAAA,CAAO,CAAC,CAAA,KAAM,CAAA,CAAE,MAAA,GAAS,CAAC,CAAA;AAC7B,EAAA,IAAI,UAAA,CAAW,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AACpC,EAAA,MAAM,SAAA,GAAY,KAAK,WAAA,EAAY;AACnC,EAAA,MAAM,OAAA,GAAU,WAAW,MAAA,CAAO,CAAC,SAAS,SAAA,CAAU,QAAA,CAAS,IAAI,CAAC,CAAA,CAAE,MAAA;AACtE,EAAA,OAAO,UAAU,UAAA,CAAW,MAAA;AAC9B;;;ACvIO,IAAM,cAAA,GAA2C,CAAC,YAAA,EAAc,OAAO,CAAA;AAOvE,SAAS,mBAAmB,OAAA,EAAmD;AACpF,EAAA,IAAI,CAAC,cAAA,CAAe,QAAA,CAAS,OAAwB,CAAA,EAAG;AACtD,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,2BAA2B,OAAO,CAAA,iBAAA,EAAoB,cAAA,CAAe,IAAA,CAAK,IAAI,CAAC,CAAA,CAAA,CAAA;AAAA,MAC/E,EAAE,MAAM,wBAAA;AAAyB,KACnC;AAAA,EACF;AACF;AAQA,eAAsB,eAAe,IAAA,EAA8C;AACjF,EAAA,IAAI,IAAA,CAAK,cAAc,MAAA,EAAW;AAChC,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,gKAAA;AAAA,MACA,EAAE,MAAM,0BAAA;AAA2B,KACrC;AAAA,EACF;AACA,EAAA,MAAM,KAAA,GAAQ,MAAM,UAAA,CAAW,IAAA,CAAK;AAAA,IAClC,KAAK,IAAA,CAAK,GAAA;AAAA,IACV,WAAW,IAAA,CAAK,SAAA;AAAA,IAChB,GAAI,KAAK,QAAA,KAAa,MAAA,GAAY,EAAE,WAAA,EAAa,IAAA,CAAK,QAAA,EAAS,GAAI;AAAC,GACrE,CAAA;AACD,EAAA,OAAO,IAAI,mBAAmB,KAAK,CAAA;AACrC;ACfO,SAAS,oBAAA,CAAqB,KAAa,MAAA,EAA8B;AAK9E,EAAA,IAAI,MAAA,CAAO,cAAc,MAAA,EAAW;AAClC,IAAA,OAAOC,OAAA,CAAY,GAAA,EAAK,MAAA,CAAO,SAAS,CAAA;AAAA,EAC1C;AACA,EAAA,MAAM,SAAA,GAAY,kBAAA,CAAmB,MAAA,CAAO,SAAA,IAAa,SAAS,CAAA;AAClE,EAAA,MAAM,KAAA,GAAQ,mBAAmB,MAAA,CAAO,KAAA,IAAS,SAAS,EAAE,MAAA,EAAQ,IAAI,CAAA;AACxE,EAAA,MAAM,MAAA,GAAS,kBAAA,CAAmB,MAAA,CAAO,MAAA,IAAU,SAAS,CAAA;AAC5D,EAAA,OAAO,YAAA,CAAa,KAAK,UAAA,EAAY,QAAA,EAAU,WAAW,CAAA,EAAG,KAAK,CAAA,CAAA,EAAI,MAAM,CAAA,KAAA,CAAO,CAAA;AACrF;;;ACvBA,IAAM,gBAAA,GACJ,2FAAA;AACF,IAAM,aAAA,GAAgB,UAAA;AAEf,SAAS,UAAU,GAAA,EAAqB;AAC7C,EAAA,OAAOD,IAAAA,CAAK,GAAA,EAAK,UAAA,EAAY,QAAQ,CAAA;AACvC;AAEO,SAAS,aAAa,GAAA,EAAqB;AAChD,EAAA,OAAOA,IAAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,WAAW,CAAA;AACzC;AAEO,SAAS,SAAS,GAAA,EAAqB;AAC5C,EAAA,OAAOA,IAAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,OAAO,CAAA;AACrC;AAGA,eAAsB,sBAAsB,GAAA,EAAoC;AAC9E,EAAA,IAAI,GAAA;AACJ,EAAA,IAAI;AACF,IAAA,GAAA,GAAM,MAAM,QAAA,CAAS,YAAA,CAAa,GAAG,GAAG,MAAM,CAAA;AAAA,EAChD,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,OAAO,kBAAkB,GAAG,CAAA;AAC9B;AAGO,SAAS,oBAAA,CAAqB,KAAa,IAAA,EAAiC;AACjF,EAAA,OAAO,YAAA,CAAa,SAAA,CAAU,GAAG,CAAA,EAAG,YAAY;AAC9C,IAAA,MAAM,IAAA,GAAO,aAAa,GAAG,CAAA;AAC7B,IAAA,IAAI,GAAA,GAAM,EAAA;AACV,IAAA,IAAI;AACF,MAAA,GAAA,GAAM,MAAM,QAAA,CAAS,IAAA,EAAM,MAAM,CAAA;AAAA,IACnC,CAAA,CAAA,MAAQ;AACN,MAAA,GAAA,GAAM,EAAA;AAAA,IACR;AACA,IAAA,MAAM,SAAA,GAAY,aAAA,CAAc,IAAA,CAAK,IAAI,CAAA;AACzC,IAAA,MAAM,IAAA,GAAO,gBAAA,CAAiB,GAAA,EAAK,SAAS,CAAA;AAC5C,IAAA,MAAM,MAAM,SAAA,CAAU,GAAG,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAC/C,IAAA,MAAM,iBAAA,CAAkB,MAAM,IAAI,CAAA;AAAA,EACpC,CAAC,CAAA;AACH;AAmBA,SAAS,kBAAkB,GAAA,EAA2B;AACpD,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA;AACrC,EAAA,IAAI,GAAA,KAAQ,EAAA,EAAI,OAAO,EAAC;AACxB,EAAA,MAAM,IAAA,GAAO,GAAA,CAAI,KAAA,CAAM,GAAA,GAAM,cAAc,MAAM,CAAA;AAEjD,EAAA,MAAM,WAAA,GAAc,IAAA,CAAK,MAAA,CAAO,YAAY,CAAA;AAC5C,EAAA,MAAM,QAAQ,WAAA,KAAgB,EAAA,GAAK,OAAO,IAAA,CAAK,KAAA,CAAM,GAAG,WAAW,CAAA;AACnE,EAAA,OAAO,KAAA,CACJ,KAAA,CAAM,IAAI,CAAA,CACV,GAAA,CAAI,CAAC,IAAA,KAAS,IAAA,CAAK,IAAA,EAAM,CAAA,CACzB,MAAA,CAAO,CAAC,IAAA,KAAS,IAAA,CAAK,UAAA,CAAW,IAAI,CAAC,CAAA,CACtC,GAAA,CAAI,CAAC,IAAA,MAAU,EAAE,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,CAAC,CAAA,CAAE,IAAA,IAAO,CAAE,CAAA;AACnD;AAEA,SAAS,gBAAA,CAAiB,KAAa,IAAA,EAAsB;AAC3D,EAAA,MAAM,MAAA,GAAS,KAAK,IAAI,CAAA,CAAA;AACxB,EAAA,IAAI,GAAA,CAAI,WAAW,CAAA,EAAG;AACpB,IAAA,OAAO,GAAG,gBAAgB;AAAA,EAAK,aAAa;;AAAA,EAAO,MAAM;AAAA,CAAA;AAAA,EAC3D;AACA,EAAA,MAAM,GAAA,GAAM,GAAA,CAAI,OAAA,CAAQ,aAAa,CAAA;AACrC,EAAA,IAAI,QAAQ,EAAA,EAAI;AAEd,IAAA,MAAM,GAAA,GAAM,GAAA,CAAI,QAAA,CAAS,IAAI,IAAI,EAAA,GAAK,IAAA;AACtC,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,EAAG,GAAG;AAAA,EAAK,aAAa;;AAAA,EAAO,MAAM;AAAA,CAAA;AAAA,EACpD;AAEA,EAAA,MAAM,KAAA,GAAQ,MAAM,aAAA,CAAc,MAAA;AAClC,EAAA,MAAM,cAAc,GAAA,CAAI,KAAA,CAAM,KAAK,CAAA,CAAE,OAAO,YAAY,CAAA;AACxD,EAAA,IAAI,gBAAgB,EAAA,EAAI;AACtB,IAAA,MAAM,QAAA,GAAW,GAAA,CAAI,QAAA,CAAS,IAAI,IAAI,EAAA,GAAK,IAAA;AAC3C,IAAA,OAAO,CAAA,EAAG,GAAG,CAAA,EAAG,QAAQ,GAAG,MAAM;AAAA,CAAA;AAAA,EACnC;AACA,EAAA,MAAM,WAAW,KAAA,GAAQ,WAAA;AACzB,EAAA,OAAO,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,CAAA,EAAG,QAAQ,CAAC;AAAA,EAAK,MAAM,CAAA,EAAG,GAAA,CAAI,KAAA,CAAM,QAAQ,CAAC,CAAA,CAAA;AACnE;AAGA,eAAsB,SAAA,CAAU,KAAa,MAAA,EAA6C;AACxF,EAAA,IAAI,CAAC,MAAA,CAAO,OAAA,EAAS,OAAO,EAAC;AAC7B,EAAA,OAAO,sBAAsB,GAAG,CAAA;AAClC;AAEA,eAAsB,UAAA,CACpB,GAAA,EACA,MAAA,EACA,IAAA,EACe;AACf,EAAA,IAAI,CAAC,OAAO,OAAA,EAAS;AACrB,EAAA,MAAM,oBAAA,CAAqB,KAAK,IAAI,CAAA;AACtC;ACrGA,IAAM,cAAA,GAAiB,GAAA;AAEhB,SAAS,YAAY,GAAA,EAAqB;AAC/C,EAAA,OAAOA,IAAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,UAAU,CAAA;AACxC;AAEO,SAAS,kBAAA,CAAmB,KAAa,KAAA,EAAuB;AAIrE,EAAA,OAAOA,IAAAA,CAAK,WAAA,CAAY,GAAG,CAAA,EAAG,CAAA,EAAG,iBAAA,CAAkB,KAAA,EAAO,EAAE,MAAA,EAAQ,GAAA,EAAK,CAAC,CAAA,GAAA,CAAK,CAAA;AACjF;AAEA,SAAS,SAAS,IAAA,EAAsB;AACtC,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,cAAA,EAAgB,OAAO,IAAA;AAC1C,EAAA,OAAO,CAAA,EAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,cAAc,CAAC,CAAA,MAAA,CAAA;AACzC;AASA,eAAsB,oBAAoB,KAAA,EAA2C;AACnF,EAAA,IAAI,KAAA,CAAM,WAAW,UAAA,EAAY;AACjC,EAAA,MAAM,IAAA,GAAO,kBAAA,CAAmB,KAAA,CAAM,GAAA,EAAK,MAAM,KAAK,CAAA;AACtD,EAAA,MAAME,KAAAA,CAAM,YAAY,KAAA,CAAM,GAAG,GAAG,EAAE,SAAA,EAAW,MAAM,CAAA;AAEvD,EAAA,MAAM,QAAA,GAAW,aAAA,CAAc,QAAA,CAAS,KAAA,CAAM,QAAQ,CAAC,CAAA;AACvD,EAAA,MAAM,aAAA,GAAgB,aAAA,CAAc,QAAA,CAAS,KAAA,CAAM,aAAa,CAAC,CAAA;AACjE,EAAA,MAAM,MAAM,IAAI,IAAA,CAAK,KAAA,CAAM,EAAE,EAAE,WAAA,EAAY;AAE3C,EAAA,MAAM,IAAA,GAAO;AAAA,IACX,KAAA;AAAA,IACA,CAAA,OAAA,EAAU,MAAM,KAAK,CAAA,CAAA;AAAA,IACrB,CAAA,SAAA,EAAY,MAAM,OAAO,CAAA,CAAA;AAAA,IACzB,OAAO,GAAG,CAAA,CAAA;AAAA,IACV,CAAA,QAAA,EAAW,MAAM,MAAM,CAAA,CAAA;AAAA,IACvB,KAAA;AAAA,IACA,EAAA;AAAA,IACA,SAAA;AAAA,IACA,EAAA;AAAA,IACA,QAAA;AAAA,IACA,EAAA;AAAA,IACA,cAAA;AAAA,IACA,EAAA;AAAA,IACA,aAAA;AAAA,IACA;AAAA,GACF,CAAE,KAAK,IAAI,CAAA;AAEX,EAAA,MAAM,iBAAA,CAAkB,MAAM,IAAI,CAAA;AACpC;;;AC/DA,eAAsB,qBAAqB,GAAA,EAAqC;AAC9E,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI;AACF,IAAA,OAAA,GAAU,MAAMC,OAAAA,CAAQ,WAAA,CAAY,GAAG,CAAC,CAAA;AAAA,EAC1C,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,QAAA,CAAS,KAAK,CAAC,CAAA,CACvC,GAAA,CAAI,CAAC,KAAA,KAAU;AACd,IAAA,MAAM,YAAA,GAAeH,IAAAA,CAAK,WAAA,CAAY,GAAG,GAAG,KAAK,CAAA;AACjD,IAAA,OAAO;AAAA,MACL,YAAA;AAAA,MACA,OAAA,EAAS,cAAA,CAAe,IAAA,EAAM,YAAY;AAAA,KAC5C;AAAA,EACF,CAAC,CAAA;AACL;AAEA,SAAS,cAAA,CAAe,MAAc,YAAA,EAA8B;AAClE,EAAA,IAAI,YAAA,CAAa,UAAA,CAAW,CAAA,EAAG,IAAI,CAAA,CAAA,CAAG,CAAA,EAAG,OAAO,YAAA,CAAa,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClF,EAAA,OAAO,YAAA;AACT;ACxBO,SAAS,QAAQ,GAAA,EAAqB;AAC3C,EAAA,OAAOA,IAAAA,CAAK,SAAA,CAAU,GAAG,CAAA,EAAG,MAAM,CAAA;AACpC;AAEA,eAAsB,kBAAkB,GAAA,EAAkC;AACxE,EAAA,IAAI,OAAA;AACJ,EAAA,IAAI;AACF,IAAA,OAAA,GAAU,MAAMG,OAAAA,CAAQ,OAAA,CAAQ,GAAG,CAAC,CAAA;AAAA,EACtC,CAAA,CAAA,MAAQ;AACN,IAAA,OAAO,EAAC;AAAA,EACV;AACA,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,OAAO,OAAA,CACJ,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,CAAM,QAAA,CAAS,KAAK,CAAC,CAAA,CACvC,GAAA,CAAI,CAAC,KAAA,MAAW;AAAA,IACf,YAAA,EAAcH,IAAAA,CAAK,OAAA,CAAQ,GAAG,GAAG,KAAK,CAAA;AAAA,IACtC,OAAA,EAASA,IAAAA,CAAK,MAAA,EAAQ,KAAK;AAAA,GAC7B,CAAE,CAAA,CACD,GAAA,CAAI,CAAC,IAAA,MAAU;AAAA,IACd,cAAc,IAAA,CAAK,YAAA;AAAA,IACnB,OAAA,EAASI,eAAAA,CAAe,IAAA,EAAM,IAAA,CAAK,YAAY;AAAA,GACjD,CAAE,CAAA;AACN;AAEA,SAASA,eAAAA,CAAe,MAAc,YAAA,EAA8B;AAGlE,EAAA,IAAI,YAAA,CAAa,UAAA,CAAW,CAAA,EAAG,IAAI,CAAA,CAAA,CAAG,CAAA,EAAG,OAAO,YAAA,CAAa,KAAA,CAAM,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClF,EAAA,OAAO,YAAA;AACT;;;AC9BO,SAAS,eAAe,OAAA,EAAuC;AACpE,EAAA,MAAM,YAAA,GAAe,QAAQ,YAAA,IAAgB,GAAA;AAC7C,EAAA,MAAM,UAAA,GAAa,QAAQ,UAAA,IAAc,GAAA;AACzC,EAAA,MAAM,KAAA,GAAQ,eAAe,UAAA,IAAc,CAAA;AAC3C,EAAA,OAAO,EAAE,YAAA,EAAc,UAAA,EAAY,KAAA,EAAM;AAC3C;AAGO,SAAS,WAAA,CACd,GAAA,EACA,WAAA,EACA,OAAA,EACiB;AACjB,EAAA,MAAM,KAAA,GAAA,CACH,cAAc,OAAA,CAAQ,YAAA,GAAe,IAAI,SAAA,GAAY,OAAA,CAAQ,cAAc,OAAA,CAAQ,KAAA;AACtF,EAAA,OAAO;AAAA,IACL,MAAM,GAAA,CAAI,IAAA;AAAA,IACV,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,KAAA;AAAA,IACA,WAAW,GAAA,CAAI,SAAA;AAAA,IACf,SAAS,GAAA,CAAI,OAAA;AAAA,IACb,QAAQ,GAAA,CAAI,MAAA;AAAA,IACZ,UAAU,GAAA,CAAI,QAAA;AAAA,IACd,GAAI,WAAA,GAAc,CAAA,GAAI,EAAE,WAAA,KAAgB;AAAC,GAC3C;AACF;AAYA,eAAsB,qBAAqB,GAAA,EAAwC;AACjF,EAAA,MAAM,IAAA,GAAO,UAAU,GAAG,CAAA;AAC1B,EAAA,MAAM,UAA4B,EAAC;AAEnC,EAAA,IAAI;AACF,IAAA,MAAM,IAAA,CAAK,YAAA,CAAa,GAAG,CAAC,CAAA;AAC5B,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,YAAA,EAAc,aAAa,GAAG,CAAA;AAAA,MAC9B,OAAA,EAAS,QAAA,CAAS,IAAA,EAAM,YAAA,CAAa,GAAG,CAAC,CAAA;AAAA,MACzC,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH,CAAA,CAAA,MAAQ;AAAA,EAER;AAEA,EAAA,IAAI;AACF,IAAA,MAAM,OAAA,GAAU,MAAMD,OAAAA,CAAQ,QAAA,CAAS,GAAG,CAAC,CAAA;AAC3C,IAAA,KAAA,MAAW,SAAS,OAAA,EAAS;AAC3B,MAAA,IAAI,CAAC,KAAA,CAAM,QAAA,CAAS,KAAK,CAAA,EAAG;AAC5B,MAAA,MAAM,GAAA,GAAMH,IAAAA,CAAK,QAAA,CAAS,GAAG,GAAG,KAAK,CAAA;AACrC,MAAA,OAAA,CAAQ,IAAA,CAAK,EAAE,YAAA,EAAc,GAAA,EAAK,OAAA,EAAS,QAAA,CAAS,IAAA,EAAM,GAAG,CAAA,EAAG,MAAA,EAAQ,QAAA,EAAU,CAAA;AAAA,IACpF;AAAA,EACF,CAAA,CAAA,MAAQ;AAAA,EAER;AAEA,EAAA,MAAM,SAAA,GAAY,MAAM,iBAAA,CAAkB,GAAG,CAAA;AAC7C,EAAA,KAAA,MAAW,QAAQ,SAAA,EAAW;AAC5B,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,cAAc,IAAA,CAAK,YAAA;AAAA,MACnB,SAAS,IAAA,CAAK,OAAA;AAAA,MACd,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;AAEA,EAAA,MAAM,YAAA,GAAe,MAAM,oBAAA,CAAqB,GAAG,CAAA;AACnD,EAAA,KAAA,MAAW,WAAW,YAAA,EAAc;AAClC,IAAA,OAAA,CAAQ,IAAA,CAAK;AAAA,MACX,cAAc,OAAA,CAAQ,YAAA;AAAA,MACtB,SAAS,OAAA,CAAQ,OAAA;AAAA,MACjB,MAAA,EAAQ;AAAA,KACT,CAAA;AAAA,EACH;AACA,EAAA,OAAO,OAAA;AACT;AAKO,SAAS,OAAO,IAAA,EAAsB;AAC3C,EAAA,OAAO,WAAW,QAAQ,CAAA,CAAE,OAAO,IAAI,CAAA,CAAE,OAAO,KAAK,CAAA;AACvD;AAGO,SAAS,gBAAgB,IAAA,EAAsB;AACpD,EAAA,MAAM,GAAA,GAAM,GAAA;AACZ,EAAA,OAAO,IAAA,CAAK,UAAU,GAAA,GAAM,IAAA,GAAO,GAAG,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,GAAG,CAAC,CAAA,MAAA,CAAA;AAC1D;;;ACtGA,eAAsB,uBAAuB,EAAA,EAA6B;AACxE,EAAA,IAAI;AACF,IAAA,MAAM,GAAA,GAAM,MAAM,OAAO,YAAY,CAAA;AACrC,IAAA,MAAM,SAAU,GAAA,CAAyC,IAAA;AACzD,IAAA,IAAI,OAAO,WAAW,UAAA,EAAY;AAChC,MAAA,MAAM,IAAI,MAAM,4CAA4C,CAAA;AAAA,IAC9D;AACA,IAAA,MAAA,CAAO,EAAE,CAAA;AAAA,EACX,SAAS,KAAA,EAAO;AACd,IAAA,MAAM,UAAU,KAAA,YAAiB,KAAA,GAAQ,KAAA,CAAM,OAAA,GAAU,OAAO,KAAK,CAAA;AACrE,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,wHAAwH,OAAO,CAAA,CAAA;AAAA,MAC/H,EAAE,IAAA,EAAM,wBAAA,EAA0B,KAAA;AAAM,KAC1C;AAAA,EACF;AACF;ACEA,IAAM,UAAA,GAAa,uBAAA;AASZ,SAAS,aAAA,CAAc,IAAA,EAAc,OAAA,GAAgC,EAAC,EAAkB;AAC7F,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,IAAY,GAAA;AACrC,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC/B,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,IAAI,CAAA;AAC7B,EAAA,MAAM,GAAA,GAAwB,EAAE,MAAA,EAAQ,EAAC,EAAG,KAAA,EAAO,EAAC,EAAG,KAAA,EAAO,CAAA,EAAG,OAAA,EAAS,MAAA,EAAU;AACpF,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,CAAC,CAAA,IAAK,EAAA;AACzB,IAAA,MAAM,aAAa,CAAA,GAAI,CAAA;AACvB,IAAA,WAAA,CAAY,GAAA,EAAK,IAAA,EAAM,UAAA,EAAY,QAAQ,CAAA;AAAA,EAC7C;AACA,EAAA,gBAAA,CAAiB,GAAA,EAAK,KAAA,CAAM,MAAA,EAAQ,QAAQ,CAAA;AAC5C,EAAA,OAAO,GAAA,CAAI,MAAA;AACb;AAEA,SAAS,WAAA,CACP,GAAA,EACA,IAAA,EACA,UAAA,EACA,QAAA,EACM;AACN,EAAA,MAAM,YAAA,GAAe,UAAA,CAAW,IAAA,CAAK,IAAI,CAAA;AACzC,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA;AACvC,EAAA,IAAI,YAAA,KAAiB,IAAA,IAAQ,GAAA,CAAI,KAAA,CAAM,SAAS,CAAA,EAAG;AACjD,IAAA,gBAAA,CAAiB,GAAA,EAAK,UAAA,GAAa,CAAA,EAAG,QAAQ,CAAA;AAAA,EAChD;AACA,EAAA,IAAI,YAAA,KAAiB,IAAA,EAAM,GAAA,CAAI,OAAA,GAAU,aAAa,CAAC,CAAA;AACvD,EAAA,GAAA,CAAI,KAAA,CAAM,KAAK,IAAI,CAAA;AACnB,EAAA,IAAI,OAAA,IAAW,GAAA,CAAI,KAAA,CAAM,MAAA,GAAS,CAAA,EAAG;AACnC,IAAA,MAAM,MAAA,GAAS,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AAClC,IAAA,IAAI,MAAA,CAAO,MAAK,CAAE,MAAA,GAAS,GAAG,gBAAA,CAAiB,GAAA,EAAK,YAAY,QAAQ,CAAA;AAAA,EAC1E;AACF;AAEA,SAAS,gBAAA,CAAiB,GAAA,EAAuB,gBAAA,EAA0B,QAAA,EAAwB;AACjG,EAAA,IAAI,GAAA,CAAI,KAAA,CAAM,MAAA,KAAW,CAAA,EAAG;AAC5B,EAAA,MAAM,SAAA,GAAY,GAAA,CAAI,KAAA,CAAM,IAAA,CAAK,IAAI,CAAA;AACrC,EAAA,IAAI,SAAA,CAAU,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,EAAG;AACjC,IAAA,GAAA,CAAI,QAAQ,EAAC;AACb,IAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AAC/B,IAAA;AAAA,EACF;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,QAAA,EAAU;AAC/B,IAAA,mBAAA,CAAoB,IAAI,MAAA,EAAQ,SAAA,EAAW,IAAI,KAAA,EAAO,GAAA,CAAI,SAAS,QAAQ,CAAA;AAAA,EAC7E,CAAA,MAAO;AACL,IAAA,GAAA,CAAI,MAAA,CAAO,KAAK,UAAA,CAAW,SAAA,EAAW,IAAI,KAAA,EAAO,gBAAA,EAAkB,GAAA,CAAI,OAAO,CAAC,CAAA;AAAA,EACjF;AACA,EAAA,GAAA,CAAI,QAAQ,EAAC;AACb,EAAA,GAAA,CAAI,QAAQ,gBAAA,GAAmB,CAAA;AACjC;AAEA,SAAS,UAAA,CACP,IAAA,EACA,SAAA,EACA,OAAA,EACA,OAAA,EACa;AACb,EAAA,OAAO;AAAA,IACL,SAAA;AAAA,IACA,OAAA;AAAA,IACA,IAAA;AAAA,IACA,IAAA,EAAMK,WAAW,QAAQ,CAAA,CAAE,OAAO,IAAI,CAAA,CAAE,OAAO,KAAK,CAAA;AAAA,IACpD,GAAI,OAAA,KAAY,MAAA,GAAY,EAAE,OAAA,KAAY;AAAC,GAC7C;AACF;AAEA,SAAS,mBAAA,CACP,MAAA,EACA,IAAA,EACA,SAAA,EACA,SACA,QAAA,EACM;AACN,EAAA,IAAI,SAAA,GAAY,IAAA;AAChB,EAAA,IAAI,UAAA,GAAa,SAAA;AACjB,EAAA,OAAO,SAAA,CAAU,SAAS,QAAA,EAAU;AAClC,IAAA,MAAM,OAAA,GAAU,qBAAA,CAAsB,SAAA,EAAW,QAAQ,CAAA;AACzD,IAAA,MAAM,KAAA,GAAQ,SAAA,CAAU,KAAA,CAAM,CAAA,EAAG,OAAO,CAAA;AACxC,IAAA,MAAM,UAAA,GAAa,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACrC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,KAAA,EAAO,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAC/E,IAAA,SAAA,GAAY,UAAU,KAAA,CAAM,OAAO,CAAA,CAAE,OAAA,CAAQ,QAAQ,EAAE,CAAA;AACvD,IAAA,UAAA,IAAc,UAAA,GAAa,CAAA;AAAA,EAC7B;AACA,EAAA,IAAI,SAAA,CAAU,SAAS,CAAA,EAAG;AACxB,IAAA,MAAM,UAAA,GAAa,SAAA,CAAU,KAAA,CAAM,IAAI,CAAA,CAAE,MAAA;AACzC,IAAA,MAAA,CAAO,IAAA,CAAK,WAAW,SAAA,EAAW,UAAA,EAAY,aAAa,UAAA,GAAa,CAAA,EAAG,OAAO,CAAC,CAAA;AAAA,EACrF;AACF;AAOA,SAAS,qBAAA,CAAsB,MAAc,QAAA,EAA0B;AACrE,EAAA,IAAI,IAAA,CAAK,MAAA,IAAU,QAAA,EAAU,OAAO,IAAA,CAAK,MAAA;AAEzC,EAAA,KAAA,IAAS,CAAA,GAAI,UAAU,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA,EAAG,QAAA,GAAW,GAAG,CAAA,EAAG,CAAA,EAAA,EAAK;AAC3D,IAAA,IAAI,KAAK,IAAA,CAAK,IAAA,CAAK,CAAC,CAAA,IAAK,GAAG,GAAG,OAAO,CAAA;AAAA,EACxC;AAEA,EAAA,OAAO,QAAA;AACT;;;AC7HO,IAAM,oBAAA,GAAuB,sBAAA;AAC7B,IAAM,cAAA,GAAiB,iBAAA;AACvB,IAAM,kBAAA,GAAqB,qBAAA;AAQ3B,SAAS,sBAAsB,EAAA,EAA6C;AACjF,EAAA,MAAM,GAAA,GAAM,CAAC,GAAA,KAAoC;AAC/C,IAAA,MAAM,MAAM,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,GAAG,CAAA;AACtE,IAAA,OAAO,GAAA,KAAQ,MAAA,GAAY,MAAA,CAAO,GAAA,CAAI,KAAK,CAAA,GAAI,MAAA;AAAA,EACjD,CAAA;AACA,EAAA,MAAM,UAAA,GAAa,IAAI,oBAAoB,CAAA;AAC3C,EAAA,MAAM,KAAA,GAAQ,IAAI,cAAc,CAAA;AAChC,EAAA,MAAM,MAAA,GAAS,IAAI,kBAAkB,CAAA;AACrC,EAAA,IAAI,eAAe,MAAA,IAAa,KAAA,KAAU,MAAA,IAAa,MAAA,KAAW,QAAW,OAAO,MAAA;AACpF,EAAA,MAAM,SAAA,GAAY,OAAO,MAAM,CAAA;AAC/B,EAAA,IAAI,CAAC,MAAA,CAAO,QAAA,CAAS,SAAS,CAAA,IAAK,SAAA,IAAa,GAAG,OAAO,MAAA;AAC1D,EAAA,OAAO,EAAE,UAAA,EAAY,KAAA,EAAO,SAAA,EAAU;AACxC;AAEO,SAAS,sBAAA,CAAuB,IAAc,QAAA,EAAmC;AACtF,EAAA,MAAM,OAAO,EAAA,CAAG,OAAA;AAAA,IACd;AAAA,GACF;AACA,EAAA,IAAA,CAAK,GAAA,CAAI,oBAAA,EAAsB,QAAA,CAAS,UAAU,CAAA;AAClD,EAAA,IAAA,CAAK,GAAA,CAAI,cAAA,EAAgB,QAAA,CAAS,KAAK,CAAA;AACvC,EAAA,IAAA,CAAK,GAAA,CAAI,kBAAA,EAAoB,MAAA,CAAO,QAAA,CAAS,SAAS,CAAC,CAAA;AACzD;AAEO,SAAS,eAAA,CAAgB,GAAsB,CAAA,EAA+B;AACnF,EAAA,OAAO,CAAA,CAAE,UAAA,KAAe,CAAA,CAAE,UAAA,IAAc,CAAA,CAAE,UAAU,CAAA,CAAE,KAAA,IAAS,CAAA,CAAE,SAAA,KAAc,CAAA,CAAE,SAAA;AACnF;AAEO,SAAS,gBAAgB,EAAA,EAAoB;AAClD,EAAA,EAAA,CAAG,KAAK,iCAAiC,CAAA;AAC3C;AAEO,SAAS,iBAAA,CAAkB,IAAc,SAAA,EAAyB;AACvE,EAAA,EAAA,CAAG,IAAA,CAAK,CAAA;AAAA;AAAA,cAAA,EAEM,SAAS,CAAA;AAAA,GAAA,CACrB,CAAA;AACJ;AAGO,SAAS,WAAW,GAAA,EAAoC;AAC7D,EAAA,MAAM,GAAA,GAAM,IAAI,YAAA,CAAa,GAAA,CAAI,MAAM,CAAA;AACvC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,GAAA,CAAI,MAAA,EAAQ,CAAA,EAAA,EAAK,GAAA,CAAI,CAAC,CAAA,GAAI,GAAA,CAAI,CAAC,CAAA,IAAK,CAAA;AACxD,EAAA,OAAO,MAAA,CAAO,IAAA,CAAK,GAAA,CAAI,MAAM,CAAA;AAC/B;AAEO,SAAS,eAAA,CAAgB,EAAA,EAAc,OAAA,EAAiB,GAAA,EAAkC;AAI/F,EAAA,MAAM,EAAA,GAAK,OAAO,OAAO,CAAA;AACzB,EAAA,EAAA,CAAG,OAAA,CAAQ,2CAA2C,CAAA,CAAE,GAAA,CAAI,EAAE,CAAA;AAC9D,EAAA,EAAA,CAAG,QAAQ,sDAAsD,CAAA,CAAE,IAAI,EAAA,EAAI,UAAA,CAAW,GAAG,CAAC,CAAA;AAC5F;AAOO,SAAS,YAAA,CACd,EAAA,EACA,KAAA,EACA,CAAA,EACgB;AAGhB,EAAA,MAAM,OAAO,EAAA,CACV,OAAA;AAAA,IACC,CAAA;AAAA;AAAA,wBAAA;AAAA,IAID,GAAA,CAAI,UAAA,CAAW,KAAK,CAAA,EAAG,MAAA,CAAO,CAAC,CAAC,CAAA;AACnC,EAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAG,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,QAAQ,GAAE,CAAE,CAAA;AAC/F;AAQA,eAAsB,mBAAmB,IAAA,EAAqC;AAC5E,EAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CACf,OAAA;AAAA,IACC,CAAA;AAAA;AAAA;AAAA,wCAAA;AAAA,IAKD,GAAA,EAAI;AACP,EAAA,IAAI,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG,OAAO,CAAA;AAC9B,EAAA,MAAM,aAAa,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,MAAS,EAAE,EAAA,EAAI,MAAA,CAAO,GAAA,CAAI,EAAE,GAAG,IAAA,EAAM,MAAA,CAAO,IAAI,IAAA,IAAQ,EAAE,GAAE,CAAE,CAAA;AAC3F,EAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,OAAA,CAAQ,KAAA,CAAM,UAAA,CAAW,GAAA,CAAI,CAAC,CAAA,KAAM,CAAA,CAAE,IAAI,CAAC,CAAA;AACtE,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,UAAA,CAAW,QAAQ,CAAA,EAAA,EAAK;AAC1C,IAAA,MAAM,GAAA,GAAM,WAAW,CAAC,CAAA;AACxB,IAAA,MAAM,MAAA,GAAS,QAAQ,CAAC,CAAA;AACxB,IAAA,IAAI,GAAA,KAAQ,MAAA,IAAa,MAAA,KAAW,MAAA,EAAW;AAC/C,IAAA,eAAA,CAAgB,IAAA,CAAK,EAAA,EAAI,GAAA,CAAI,EAAA,EAAI,MAAM,CAAA;AAAA,EACzC;AACA,EAAA,OAAO,UAAA,CAAW,MAAA;AACpB;;;ACtGA,IAAM,gBAAA,GAAmB,IAAI,iBAAA,CAAkB,GAAI,CAAA;AA2C5C,IAAM,YAAA,GAAN,MAAM,aAAA,CAAoC;AAAA,EAIvC,WAAA,CACW,GAAA,EACA,EAAA,EACA,SAAA,EACjB;AAHiB,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AACA,IAAA,IAAA,CAAA,EAAA,GAAA,EAAA;AACA,IAAA,IAAA,CAAA,SAAA,GAAA,SAAA;AAAA,EAChB;AAAA,EAHgB,GAAA;AAAA,EACA,EAAA;AAAA,EACA,SAAA;AAAA,EANX,UAAA;AAAA,EACA,WAAA,GAAc,KAAA;AAAA,EAiBtB,aAAa,KAAK,IAAA,EAA8C;AAC9D,IAAA,MAAM,OAAA,GAAU,KAAK,OAAA,IAAW,YAAA;AAChC,IAAA,kBAAA,CAAmB,OAAO,CAAA;AAC1B,IAAA,IAAI,OAAA,KAAY,OAAA,EAAS,OAAO,MAAM,eAAe,IAAI,CAAA;AACzD,IAAA,OAAO,MAAM,aAAA,CAAa,kBAAA,CAAmB,IAAI,CAAA;AAAA,EACnD;AAAA;AAAA,EAGA,aAAqB,mBAAmB,IAAA,EAA+C;AACrF,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,QAAA,IAAY,gBAAA,CAAiB,KAAK,GAAG,CAAA;AAC3D,IAAA,MAAM,EAAA,GAAK,MAAM,YAAA,CAAa,EAAE,UAAU,CAAA;AAC1C,IAAA,MAAM,UAAU,IAAI,aAAA,CAAa,KAAK,GAAA,EAAK,EAAA,EAAI,KAAK,SAAS,CAAA;AAC7D,IAAA,IAAI,KAAK,SAAA,KAAc,MAAA,QAAiB,OAAA,CAAQ,iBAAA,CAAkB,KAAK,SAAS,CAAA;AAChF,IAAA,OAAO,OAAA;AAAA,EACT;AAAA,EAEA,MAAc,kBAAkB,OAAA,EAA0C;AACxE,IAAA,MAAM,sBAAA,CAAuB,KAAK,EAAE,CAAA;AACpC,IAAA,MAAM,eAAA,GAAkB;AAAA,MACtB,YAAY,OAAA,CAAQ,EAAA;AAAA,MACpB,OAAO,OAAA,CAAQ,KAAA;AAAA,MACf,WAAW,OAAA,CAAQ;AAAA,KACrB;AACA,IAAA,MAAM,SAAA,GAAY,qBAAA,CAAsB,IAAA,CAAK,EAAE,CAAA;AAC/C,IAAA,IAAI,cAAc,MAAA,IAAa,CAAC,eAAA,CAAgB,SAAA,EAAW,eAAe,CAAA,EAAG;AAG3E,MAAA,eAAA,CAAgB,KAAK,EAAE,CAAA;AAAA,IACzB;AACA,IAAA,iBAAA,CAAkB,IAAA,CAAK,EAAA,EAAI,OAAA,CAAQ,SAAS,CAAA;AAC5C,IAAA,sBAAA,CAAuB,IAAA,CAAK,IAAI,eAAe,CAAA;AAC/C,IAAA,IAAA,CAAK,WAAA,GAAc,IAAA;AAAA,EACrB;AAAA;AAAA,EAGA,MAAM,IAAA,GAKH;AACD,IAAA,MAAM,KAAA,GAAQ,MAAM,oBAAA,CAAqB,IAAA,CAAK,GAAG,CAAA;AACjD,IAAA,IAAI,YAAA,GAAe,CAAA;AACnB,IAAA,IAAI,aAAA,GAAgB,CAAA;AACpB,IAAA,MAAM,cAAA,GAAiB,KAAK,cAAA,EAAe;AAC3C,IAAA,KAAA,MAAW,SAAS,KAAA,EAAO;AACzB,MAAA,MAAM,GAAA,GAAM,MAAMC,QAAAA,CAAS,KAAA,CAAM,cAAc,MAAM,CAAA;AACrD,MAAA,MAAM,IAAA,GAAO,OAAO,GAAG,CAAA;AACvB,MAAA,MAAM,QAAA,GAAW,cAAA,CAAe,GAAA,CAAI,KAAA,CAAM,YAAY,CAAA;AACtD,MAAA,IAAI,QAAA,KAAa,MAAA,IAAa,QAAA,CAAS,IAAA,KAAS,IAAA,EAAM;AACtD,MAAA,MAAM,KAAA,GAAQ,MAAMC,IAAAA,CAAK,KAAA,CAAM,YAAY,CAAA;AAC3C,MAAA,MAAM,SAAS,IAAA,CAAK,UAAA;AAAA,QAClB,KAAA,CAAM,YAAA;AAAA,QACN,KAAA,CAAM,OAAA;AAAA,QACN,IAAA;AAAA,QACA,KAAA,CAAM,OAAA;AAAA,QACN,KAAA,CAAM;AAAA,OACR;AACA,MAAA,IAAA,CAAK,oBAAoB,MAAM,CAAA;AAC/B,MAAA,MAAM,MAAA,GAAS,cAAc,GAAG,CAAA;AAChC,MAAA,KAAA,MAAW,SAAS,MAAA,EAAQ;AAC1B,QAAA,IAAA,CAAK,WAAA,CAAY,QAAQ,KAAA,CAAM,SAAA,EAAW,MAAM,OAAA,EAAS,KAAA,CAAM,IAAA,EAAM,KAAA,CAAM,IAAI,CAAA;AAAA,MACjF;AACA,MAAA,YAAA,IAAgB,CAAA;AAChB,MAAA,aAAA,IAAiB,MAAA,CAAO,MAAA;AAAA,IAC1B;AACA,IAAA,IAAI,cAAA,GAAiB,CAAA;AACrB,IAAA,IAAI,IAAA,CAAK,WAAA,IAAe,IAAA,CAAK,SAAA,KAAc,MAAA,EAAW;AACpD,MAAA,cAAA,GAAiB,MAAM,mBAAmB,EAAE,EAAA,EAAI,KAAK,EAAA,EAAI,OAAA,EAAS,IAAA,CAAK,SAAA,EAAW,CAAA;AAAA,IACpF;AACA,IAAA,IAAA,CAAK,UAAA,GAAa,KAAK,GAAA,EAAI;AAC3B,IAAA,OAAO,EAAE,YAAA,EAAc,KAAA,CAAM,MAAA,EAAQ,YAAA,EAAc,eAAe,cAAA,EAAe;AAAA,EACnF;AAAA,EAEA,MAAM,MAAA,CAAO,KAAA,EAAe,OAAA,GAAyB,EAAC,EAA+B;AACnF,IAAA,IAAI,MAAM,IAAA,EAAK,CAAE,MAAA,KAAW,CAAA,SAAU,EAAC;AACvC,IAAA,MAAM,EAAE,UAAA,EAAY,QAAA,EAAS,GAAI,mBAAmB,OAAO,CAAA;AAC3D,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,SAAA,CAAU,KAAA,EAAO,aAAa,CAAC,CAAA;AACrD,IAAA,MAAM,iBAAiB,MAAM,IAAA,CAAK,gBAAA,CAAiB,KAAA,EAAO,aAAa,CAAC,CAAA;AACxE,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,mBAAA,CAAoB,QAAA,EAAU,gBAAgB,OAAO,CAAA;AAC3E,IAAA,OAAO,QAAA,CACJ,OAAO,CAAC,CAAA,KAAM,EAAE,KAAA,IAAS,QAAQ,CAAA,CACjC,MAAA,CAAO,CAAC,CAAA,KAAM,QAAQ,OAAA,KAAY,MAAA,IAAa,OAAA,CAAQ,OAAA,CAAQ,QAAA,CAAS,CAAA,CAAE,MAAM,CAAC,CAAA,CACjF,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA;AAAA,EACxB;AAAA,EAEA,MAAA,GAAsB;AACpB,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,iCAAiC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACjF,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI,IAAK,EAAE,CAAA,EAAG,CAAA,EAAE;AACnF,IAAA,MAAM,MAAA,GAAsB;AAAA,MAC1B,OAAA,EAAS,IAAA,CAAK,WAAA,GAAc,QAAA,GAAW,UAAA;AAAA,MACvC,YAAA,EAAc,MAAA,CAAO,KAAA,CAAM,CAAA,IAAK,CAAC,CAAA;AAAA,MACjC,aAAA,EAAe,MAAA,CAAO,MAAA,CAAO,CAAA,IAAK,CAAC;AAAA,KACrC;AACA,IAAA,IAAI,IAAA,CAAK,UAAA,KAAe,MAAA,EAAW,MAAA,CAAO,aAAa,IAAA,CAAK,UAAA;AAC5D,IAAA,OAAO,MAAA;AAAA,EACT;AAAA;AAAA,EAIQ,SAAA,CAAU,OAAe,KAAA,EAA6D;AAG5F,IAAA,MAAM,SAAA,GAAY,kBAAkB,KAAK,CAAA;AACzC,IAAA,IAAI,SAAA,CAAU,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AACpC,IAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CAAG,OAAA;AAAA,MACnB,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAAA;AAAA,KASF;AACA,IAAA,IAAI,OAAuC,EAAC;AAC5C,IAAA,IAAI;AACF,MAAA,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,SAAA,EAAW,KAAK,CAAA;AAAA,IAClC,CAAA,CAAA,MAAQ;AAKN,MAAA,OAAO,IAAA,CAAK,kBAAA,CAAmB,KAAA,EAAO,KAAK,CAAA;AAAA,IAC7C;AACA,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AACvC,MAAA,MAAM,SAAA,GAAY,IAAA,GAAO,CAAA,GAAI,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,IAAI,CAAA,CAAA,GAAK,CAAA,IAAK,CAAA,GAAI,IAAA,CAAA;AACjE,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,SAAA;AAAA,QACP,SAAA;AAAA,QACA,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA;AAAA;AAAA,QAGzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQQ,kBAAA,CACN,OACA,KAAA,EAC8C;AAC9C,IAAA,MAAM,OAAA,GAAU,CAAA,CAAA,EAAI,KAAA,CAAM,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAA,CAAE,OAAA,CAAQ,IAAA,EAAM,KAAK,CAAC,CAAA,CAAA,CAAA;AACnE,IAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CAAG,OAAA;AAAA,MACnB,CAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cAAA;AAAA,KAOF;AACA,IAAA,MAAM,IAAA,GAAO,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,KAAK,CAAA;AACpC,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,EAAE,CAAA;AACtC,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,OAAO;AAAA,QACL,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,GAAA;AAAA;AAAA,QACP,SAAA,EAAW,GAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA,CAAA;AAAA,QACzC,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE;AAAA,OACxB;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA,EAEA,MAAc,gBAAA,CACZ,KAAA,EACA,KAAA,EACiE;AACjE,IAAA,IAAI,CAAC,KAAK,WAAA,IAAe,IAAA,CAAK,cAAc,MAAA,EAAW,2BAAW,GAAA,EAAI;AAMtE,IAAA,MAAM,QAAA,GAAWF,WAAW,QAAQ,CAAA,CAAE,OAAO,KAAK,CAAA,CAAE,OAAO,KAAK,CAAA;AAChE,IAAA,MAAM,MAAA,GAAS,gBAAA,CAAiB,GAAA,CAAI,QAAQ,CAAA;AAC5C,IAAA,MAAM,QAAA,GAAW,MAAA,IAAA,CAAW,MAAM,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,KAAK,CAAC,CAAA,EAAG,CAAC,CAAA;AAClE,IAAA,IAAI,QAAA,KAAa,MAAA,EAAW,uBAAO,IAAI,GAAA,EAAI;AAC3C,IAAA,IAAI,MAAA,KAAW,MAAA,EAAW,gBAAA,CAAiB,GAAA,CAAI,UAAU,QAAQ,CAAA;AACjE,IAAA,MAAM,IAAA,GAAO,YAAA,CAAa,IAAA,CAAK,EAAA,EAAI,UAAU,KAAK,CAAA;AAElD,IAAA,MAAM,GAAA,uBAAU,GAAA,EAAqC;AACrD,IAAA,KAAA,MAAW,OAAO,IAAA,EAAM;AACtB,MAAA,MAAM,QAAQ,CAAA,IAAK,CAAA,GAAI,KAAK,GAAA,CAAI,CAAA,EAAG,IAAI,QAAQ,CAAA,CAAA;AAC/C,MAAA,GAAA,CAAI,IAAI,GAAA,CAAI,QAAA,EAAU,EAAE,WAAA,EAAa,OAAO,CAAA;AAAA,IAC9C;AACA,IAAA,OAAO,GAAA;AAAA,EACT;AAAA,EAEQ,mBAAA,CACN,QAAA,EACA,cAAA,EACA,OAAA,EACmB;AACnB,IAAA,MAAM,OAAA,GAAU,eAAe,OAAO,CAAA;AACtC,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,SAAA,CAAU,QAAA,EAAU,cAAc,CAAA;AACtD,IAAA,MAAM,WAAW,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,CAAA,CAAE,GAAA;AAAA,MAAI,CAAC,GAAA,KACzC,WAAA,CAAY,GAAA,EAAK,cAAA,CAAe,GAAA,CAAI,GAAA,CAAI,OAAO,CAAA,EAAG,WAAA,IAAe,CAAA,EAAG,OAAO;AAAA,KAC7E;AACA,IAAA,OAAO,QAAA,CAAS,KAAK,CAAC,CAAA,EAAG,MAAM,CAAA,CAAE,KAAA,GAAQ,EAAE,KAAK,CAAA;AAAA,EAClD;AAAA,EAEQ,SAAA,CACN,UACA,cAAA,EACoD;AACpD,IAAA,MAAM,MAAA,uBAAa,GAAA,EAAmD;AACtE,IAAA,KAAA,MAAW,OAAO,QAAA,EAAU,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,SAAS,GAAG,CAAA;AACvD,IAAA,MAAM,UAAA,GAAa,CAAC,GAAG,cAAA,CAAe,MAAM,CAAA,CAAE,MAAA,CAAO,CAAC,EAAA,KAAO,CAAC,MAAA,CAAO,GAAA,CAAI,EAAE,CAAC,CAAA;AAC5E,IAAA,IAAI,UAAA,CAAW,SAAS,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,GAAA,IAAO,IAAA,CAAK,gBAAA,CAAiB,UAAU,CAAA,EAAG;AACnD,QAAA,MAAA,CAAO,GAAA,CAAI,GAAA,CAAI,OAAA,EAAS,EAAE,GAAG,KAAK,KAAA,EAAO,CAAA,EAAG,SAAA,EAAW,CAAA,EAAG,CAAA;AAAA,MAC5D;AAAA,IACF;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAAA,EAEQ,iBACN,GAAA,EAC8C;AAC9C,IAAA,IAAI,GAAA,CAAI,MAAA,KAAW,CAAA,EAAG,OAAO,EAAC;AAC9B,IAAA,MAAM,eAAe,GAAA,CAAI,GAAA,CAAI,MAAM,GAAG,CAAA,CAAE,KAAK,GAAG,CAAA;AAChD,IAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CACf,OAAA;AAAA,MACC,CAAA;AAAA;AAAA;AAAA;AAAA,6BAAA,EAIuB,YAAY,CAAA,CAAA;AAAA,KACrC,CACC,GAAA,CAAI,GAAG,GAAG,CAAA;AACb,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,CAAC,GAAA,KAAQ;AACvB,MAAA,MAAM,SAAA,GAAY,MAAA,CAAO,GAAA,CAAI,UAAA,IAAc,CAAC,CAAA;AAC5C,MAAA,MAAM,OAAA,GAAU,MAAA,CAAO,GAAA,CAAI,QAAA,IAAY,CAAC,CAAA;AACxC,MAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,QAAQ,CAAA;AAChC,MAAA,OAAO;AAAA,QACL,OAAA,EAAS,MAAA,CAAO,GAAA,CAAI,EAAE,CAAA;AAAA,QACtB,IAAA;AAAA,QACA,SAAA;AAAA,QACA,OAAA;AAAA,QACA,KAAA,EAAO,CAAA;AAAA,QACP,SAAA,EAAW,CAAA;AAAA,QACX,SAAS,eAAA,CAAgB,MAAA,CAAO,GAAA,CAAI,IAAA,IAAQ,EAAE,CAAC,CAAA;AAAA,QAC/C,MAAA,EAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA;AAAA,QACzB,UAAU,CAAA,EAAG,IAAI,CAAA,CAAA,EAAI,SAAS,IAAI,OAAO,CAAA;AAAA,OAC3C;AAAA,IACF,CAAC,CAAA;AAAA,EACH;AAAA;AAAA,EAIQ,cAAA,GAA4D;AAClE,IAAA,MAAM,OAAO,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,kCAAkC,EAAE,GAAA,EAAI;AAKrE,IAAA,OAAO,IAAI,GAAA,CAAI,IAAA,CAAK,IAAI,CAAC,GAAA,KAAQ,CAAC,GAAA,CAAI,IAAA,EAAM,EAAE,EAAA,EAAI,IAAI,EAAA,EAAI,IAAA,EAAM,IAAI,IAAA,EAAM,CAAC,CAAC,CAAA;AAAA,EAC9E;AAAA,EAEQ,WACN,OAAA,EACA,OAAA,EACA,IAAA,EACA,OAAA,EACA,SAAyC,QAAA,EACjC;AACR,IAAA,MAAM,IAAA,GAAO,KAAK,EAAA,CAAG,OAAA;AAAA,MACnB,CAAA;AAAA;AAAA,mBAAA;AAAA,KAGF;AACA,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,GAAA,CAAI,OAAA,EAAS,OAAA,EAAS,KAAK,KAAA,CAAM,OAAO,CAAA,EAAG,IAAA,EAAM,MAAM,CAAA;AACxE,IAAA,OAAO,GAAA,CAAI,EAAA;AAAA,EACb;AAAA,EAEQ,oBAAoB,MAAA,EAAsB;AAChD,IAAA,IAAA,CAAK,EAAA,CAAG,OAAA,CAAQ,sCAAsC,CAAA,CAAE,IAAI,MAAM,CAAA;AAAA,EACpE;AAAA,EAEQ,WAAA,CACN,MAAA,EACA,SAAA,EACA,OAAA,EACA,MACA,IAAA,EACM;AACN,IAAA,IAAA,CAAK,EAAA,CACF,OAAA;AAAA,MACC;AAAA,MAED,GAAA,CAAI,MAAA,EAAQ,SAAA,EAAW,OAAA,EAAS,MAAM,IAAI,CAAA;AAAA,EAC/C;AAAA,EAEA,KAAA,GAAc;AACZ,IAAA,IAAA,CAAK,GAAG,KAAA,EAAM;AAAA,EAChB;AACF","file":"chunk-4F7JQZOX.js","sourcesContent":["/**\n * SQLite schema for the memory index.\n *\n * Tables:\n *   - files      — one row per indexed markdown file (path, mtime, hash).\n *   - chunks     — one row per chunk produced by `chunkMarkdown`.\n *   - chunks_fts — FTS5 virtual table mirroring chunks.text for BM25 search.\n *   - meta       — key/value store; persists the active embedding identity\n *                  (provider id, model, dimension) so we detect when the\n *                  index was built against a different embedding setup.\n *   - embeddings — sqlite-vec virtual table holding the chunk vectors\n *                  (created on demand by `vec-index.ts`).\n *\n * @internal\n */\n\nexport const SCHEMA_STATEMENTS: ReadonlyArray<string> = [\n  `CREATE TABLE IF NOT EXISTS files (\n     id INTEGER PRIMARY KEY AUTOINCREMENT,\n     path TEXT UNIQUE NOT NULL,\n     rel_path TEXT NOT NULL,\n     mtime INTEGER NOT NULL,\n     hash TEXT NOT NULL,\n     source TEXT NOT NULL DEFAULT 'memory'\n   )`,\n  `CREATE TABLE IF NOT EXISTS chunks (\n     id INTEGER PRIMARY KEY AUTOINCREMENT,\n     file_id INTEGER NOT NULL REFERENCES files(id) ON DELETE CASCADE,\n     start_line INTEGER NOT NULL,\n     end_line INTEGER NOT NULL,\n     text TEXT NOT NULL,\n     hash TEXT NOT NULL,\n     session_key TEXT\n   )`,\n  `CREATE VIRTUAL TABLE IF NOT EXISTS chunks_fts USING fts5(\n     text,\n     content='chunks',\n     content_rowid='id'\n   )`,\n  `CREATE TRIGGER IF NOT EXISTS chunks_fts_insert AFTER INSERT ON chunks BEGIN\n     INSERT INTO chunks_fts(rowid, text) VALUES (new.id, new.text);\n   END`,\n  `CREATE TRIGGER IF NOT EXISTS chunks_fts_delete AFTER DELETE ON chunks BEGIN\n     INSERT INTO chunks_fts(chunks_fts, rowid, text) VALUES ('delete', old.id, old.text);\n   END`,\n  `CREATE TABLE IF NOT EXISTS meta (\n     key TEXT PRIMARY KEY,\n     value TEXT\n   )`,\n  `CREATE INDEX IF NOT EXISTS idx_chunks_file_id ON chunks(file_id)`,\n];\n\n/**\n * Non-WAL pragmas. WAL is applied separately via\n * `applyWalWithFallback` (T4.2, ADR D63) so NFS/SMB users get a graceful\n * DELETE fallback instead of crashing.\n */\nexport const PRAGMA_STATEMENTS: ReadonlyArray<string> = [\n  \"PRAGMA synchronous=NORMAL\",\n  \"PRAGMA foreign_keys=ON\",\n];\n","import { join } from \"node:path\";\n\nimport { openSqliteResilient } from \"../persistence/sqlite-open.js\";\nimport { PRAGMA_STATEMENTS, SCHEMA_STATEMENTS } from \"./index-schema.js\";\n\n/**\n * Memory index DB handle + opener.\n *\n * M0-5 (plan m0-foundation-expose-primitives): the driver-load + WAL +\n * corruption-recovery (EC-7) plumbing is now the shared `openSqliteResilient`\n * primitive in `internal/persistence`; this module only declares the memory\n * schema application (PRAGMA + SCHEMA) via its `onOpen` callback.\n *\n * @internal\n */\n\nexport interface MemoryDb {\n  exec(sql: string): void;\n  prepare(sql: string): {\n    run(...args: unknown[]): { changes: number; lastInsertRowid: number | bigint };\n    get(...args: unknown[]): Record<string, unknown> | undefined;\n    all(...args: unknown[]): Array<Record<string, unknown>>;\n  };\n  /** SQLite `pragma()` access (used by `applyWalWithFallback`). */\n  pragma(statement: string, options?: { simple?: boolean }): unknown;\n  close(): void;\n  /** Load a SQLite loadable extension at the given path (used by sqlite-vec). */\n  loadExtension(path: string): void;\n}\n\nexport interface OpenDbOptions {\n  filePath: string;\n  /**\n   * When true and opening fails with a corruption error, rename the file aside\n   * and create a fresh DB. Default true.\n   */\n  recoverCorrupt?: boolean;\n}\n\nexport async function openMemoryDb(opts: OpenDbOptions): Promise<MemoryDb> {\n  return openSqliteResilient<MemoryDb>({\n    filePath: opts.filePath,\n    label: \"memory-index\",\n    recoverCorrupt: opts.recoverCorrupt,\n    onOpen: (db) => {\n      // PRAGMA + SCHEMA run after WAL is applied (handled by openSqliteResilient).\n      for (const pragma of PRAGMA_STATEMENTS) db.exec(pragma);\n      for (const stmt of SCHEMA_STATEMENTS) db.exec(stmt);\n    },\n  });\n}\n\nexport function defaultIndexPath(cwd: string): string {\n  return join(cwd, \".theokit\", \"memory\", \".index\", \"memory.sqlite\");\n}\n","import { existsSync, mkdirSync } from \"node:fs\";\nimport { createRequire } from \"node:module\";\nimport { join } from \"node:path\";\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport type { EmbeddingRuntime } from \"./embedding-adapter.js\";\n\n/**\n * LanceDB-backed memory index (ADR D43). Implements the same logical\n * interface as `IndexManager` but stores embeddings in Lance's columnar\n * vector-aware file format — scalable to 100k+ facts.\n *\n * Opt-in via `Memory.create({ index: { backend: \"lance\" } })`. SQLite\n * remains the default; this code path only activates when explicitly\n * requested AND `@lancedb/lancedb` is installed.\n *\n * EC-1 MUST FIX: filters use Lance structured filter API (object form) —\n * NEVER string interpolation. SQL injection via namespace is impossible.\n *\n * EC-8: embedding dimension is validated when opening an existing table.\n *\n * @internal\n */\n\ninterface LanceModule {\n  connect: (uri: string) => Promise<LanceConnection>;\n}\n\ninterface LanceConnection {\n  openTable: (name: string) => Promise<LanceTable>;\n  createTable: (name: string, data: ReadonlyArray<LanceFactRecord>) => Promise<LanceTable>;\n  tableNames: () => Promise<string[]>;\n}\n\ninterface LanceTable {\n  add: (rows: ReadonlyArray<LanceFactRecord>) => Promise<void>;\n  search: (vector: ReadonlyArray<number>) => LanceQuery;\n  delete: (predicate: string) => Promise<void>;\n  countRows: () => Promise<number>;\n  // EC-8: schema introspection for dimension check.\n  schema: () => Promise<{\n    fields: ReadonlyArray<{\n      name: string;\n      // Lance 0.30 returns Apache Arrow Field. FixedSizeList type has\n      // `listSize`, not `fixedSize`. typeId=16 = FixedSizeList in Arrow.\n      type: { listSize?: number; fixedSize?: number };\n    }>;\n  }>;\n}\n\ninterface LanceQuery {\n  where: (filter: string | Record<string, unknown>) => LanceQuery;\n  limit: (n: number) => LanceQuery;\n  toArray: () => Promise<ReadonlyArray<LanceFactRecord & { _distance?: number }>>;\n}\n\nexport interface LanceFactRecord {\n  id: string;\n  text: string;\n  source: \"memory\" | \"sessions\" | \"wiki\";\n  embedding: ReadonlyArray<number>;\n  namespace: string;\n  scope: string;\n  user_id: string;\n  timestamp: number;\n}\n\nexport interface OpenLanceOptions {\n  cwd: string;\n  embedding: EmbeddingRuntime;\n  /** Override storage location. Default: `<cwd>/.theokit/memory/lance/`. */\n  storagePath?: string;\n}\n\nexport interface LanceSearchOptions {\n  namespace: string;\n  scope?: string;\n  limit?: number;\n  sources?: ReadonlyArray<\"memory\" | \"sessions\" | \"wiki\">;\n}\n\nexport interface LanceSearchHit {\n  id: string;\n  text: string;\n  source: \"memory\" | \"sessions\" | \"wiki\";\n  namespace: string;\n  scope: string;\n  userId: string;\n  score: number;\n}\n\n/**\n * Lazily load `@lancedb/lancedb`. Throws typed error when absent.\n *\n * @internal\n */\nfunction requireLance(): LanceModule {\n  try {\n    const r = createRequire(import.meta.url);\n    return r(\"@lancedb/lancedb\") as LanceModule;\n  } catch (cause) {\n    throw new ConfigurationError(\n      \"Lance backend selected but `@lancedb/lancedb` is not installed. \" +\n        'Install with: `pnpm add @lancedb/lancedb`. SQLite remains available as the default (omit `backend: \"lance\"`).',\n      { code: \"lance_backend_unavailable\", cause },\n    );\n  }\n}\n\n/**\n * Lance-backed memory index. Public API mirrors the SQLite one logically:\n * `addFacts`, `search`, `countFacts`, `removeFacts`, `close`.\n *\n * @internal\n */\nexport class LanceIndex {\n  private constructor(\n    private readonly table: LanceTable,\n    private readonly embedding: EmbeddingRuntime,\n    private readonly embeddingDim: number,\n  ) {}\n\n  static async open(opts: OpenLanceOptions): Promise<LanceIndex> {\n    const lance = requireLance();\n    const storagePath = opts.storagePath ?? join(opts.cwd, \".theokit\", \"memory\", \"lance\");\n    mkdirSync(storagePath, { recursive: true });\n    const conn = await lance.connect(storagePath);\n    const dim = opts.embedding.dimension;\n    const tableName = \"facts\";\n    const existing = await conn.tableNames();\n    let table: LanceTable;\n    if (existing.includes(tableName)) {\n      table = await conn.openTable(tableName);\n      // EC-8: validate embedding dimension matches what's in storage.\n      // Lance 0.30 uses Apache Arrow FixedSizeList type — the size lives\n      // in `type.listSize` (older API used `fixedSize`; we read both for\n      // forward/backward safety).\n      const schema = await table.schema();\n      const embField = schema.fields.find((f) => f.name === \"embedding\");\n      const existingDim = embField?.type?.listSize ?? embField?.type?.fixedSize;\n      if (typeof existingDim === \"number\" && existingDim !== dim) {\n        throw new ConfigurationError(\n          `Embedding dimension mismatch in Lance index: storage has ${existingDim}-dim vectors, current provider yields ${dim}-dim. Run \\`theokit-migrate-memory\\` after switching providers, or use a different storagePath.`,\n          { code: \"embedding_dimension_mismatch\" },\n        );\n      }\n    } else {\n      // Create with one bootstrap record. Lance requires an initial row to\n      // infer schema; we delete the bootstrap immediately.\n      const bootstrap: LanceFactRecord = {\n        id: \"__bootstrap__\",\n        text: \"\",\n        source: \"memory\",\n        embedding: new Array(dim).fill(0),\n        namespace: \"__bootstrap__\",\n        scope: \"__bootstrap__\",\n        user_id: \"__bootstrap__\",\n        timestamp: 0,\n      };\n      table = await conn.createTable(tableName, [bootstrap]);\n      await table.delete(\"namespace = '__bootstrap__'\");\n    }\n    return new LanceIndex(table, opts.embedding, dim);\n  }\n\n  async addFacts(facts: ReadonlyArray<Omit<LanceFactRecord, \"embedding\">>): Promise<void> {\n    if (facts.length === 0) return;\n    const texts = facts.map((f) => f.text);\n    const embeddings = await this.embedding.embed(texts);\n    const rows: LanceFactRecord[] = facts.map((f, i) => ({\n      ...f,\n      embedding: embeddings[i] ?? new Array(this.embeddingDim).fill(0),\n    }));\n    await this.table.add(rows);\n  }\n\n  /**\n   * Search facts by semantic similarity. EC-1: filters use Lance's\n   * structured object filter — NEVER string interpolation.\n   */\n  async search(query: string, opts: LanceSearchOptions): Promise<LanceSearchHit[]> {\n    const [embedding] = await this.embedding.embed([query]);\n    if (embedding === undefined) return [];\n    // EC-1 (lancedb-backend-ship-v1-1 integration test caught this 2026-05-31):\n    // Lance 0.30.0's `.where()` accepts SQL STRING only, NOT object filter —\n    // contrary to D43's original assumption. We build the SQL string with\n    // single-quote escaping (`'` → `''`) to neutralize injection. This is\n    // the standard SQL string-literal escape; bind parameters are not\n    // supported in Lance's predicate API. Backed by integration test\n    // `injection attempt in namespace does not break filter` (test 7).\n    const predicates: string[] = [`namespace = '${escapeSqlValue(opts.namespace)}'`];\n    if (opts.scope !== undefined) {\n      predicates.push(`scope = '${escapeSqlValue(opts.scope)}'`);\n    }\n    let q = this.table.search(embedding).where(predicates.join(\" AND \"));\n    if (opts.limit !== undefined) q = q.limit(opts.limit);\n    const results = await q.toArray();\n    return results\n      .filter((r) => opts.sources === undefined || opts.sources.includes(r.source))\n      .map((r) => ({\n        id: r.id,\n        text: r.text,\n        source: r.source,\n        namespace: r.namespace,\n        scope: r.scope,\n        userId: r.user_id,\n        // Lower _distance = better match; normalize to 0..1 (1=best).\n        score: 1 / (1 + (r._distance ?? 1)),\n      }));\n  }\n\n  async countFacts(namespace: string): Promise<number> {\n    // Total count, regardless of namespace, used by migration validation.\n    // For per-namespace count, callers can do a where() + countRows() if\n    // Lance supports it; v1.2 ships with global count only.\n    void namespace;\n    return this.table.countRows();\n  }\n\n  async removeFacts(ids: ReadonlyArray<string>): Promise<void> {\n    if (ids.length === 0) return;\n    // Build a parameterized-style delete predicate. Lance's delete still\n    // takes a string predicate, so we explicitly quote-escape each id —\n    // ids in our system are content-hashed (alphanumeric), so the risk\n    // is low, but we belt-and-suspenders.\n    const escaped = ids.map((id) => `'${id.replace(/'/g, \"''\")}'`).join(\", \");\n    await this.table.delete(`id IN (${escaped})`);\n  }\n\n  async close(): Promise<void> {\n    // Lance auto-closes on GC; no explicit shutdown needed.\n  }\n}\n\n/**\n * Escape a value for safe SQL string interpolation in Lance predicates.\n * Lance does not support bind parameters — string-quote escape is the\n * only injection-safe option. Standard SQL: replace single quotes with\n * doubled single quotes.\n *\n * @internal\n */\n/**\n * T5.2 — Harden SQL value escaping for Lance `.where()` predicates.\n *\n * Pre-T5.2 this only escaped single quotes (`'` → `''`). T5.2 adds:\n * - NUL byte rejection (NUL truncates the string in some SQL engines)\n * - C0 control char rejection (prevents invisible payload injection)\n * - Backslash escaping (`\\` → `\\\\` — some engines interpret `\\'` as\n *   a single-quote escape, bypassing the `''` defense)\n *\n * Throws `ConfigurationError` on NUL/control to surface the attack\n * honestly rather than silently corrupting the query.\n */\nfunction escapeSqlValue(value: string): string {\n  // Reject NUL + C0/DEL control chars (T5.5 pattern adapted for SQL).\n  for (let i = 0; i < value.length; i++) {\n    const code = value.charCodeAt(i);\n    if (code === 0x00 || (code >= 0x01 && code <= 0x1f) || code === 0x7f) {\n      throw new ConfigurationError(\n        `SQL filter value contains control character at position ${i} (0x${code.toString(16)}). ` +\n          \"This may indicate an injection attempt.\",\n        { code: \"sql_injection_blocked\" },\n      );\n    }\n  }\n  // Escape both single-quote and backslash.\n  return value.replace(/\\\\/g, \"\\\\\\\\\").replace(/'/g, \"''\");\n}\n\n/**\n * Test helper for {@link LanceIndex}: indicates whether the Lance module\n * is loadable in the current environment. Allows tests to gracefully skip\n * when the optional dep is absent.\n *\n * @internal\n */\nexport function isLanceAvailable(): boolean {\n  try {\n    const r = createRequire(import.meta.url);\n    r(\"@lancedb/lancedb\");\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/**\n * Test helper: re-export the storage path computation.\n *\n * @internal\n */\nexport function lanceStoragePath(cwd: string): string {\n  return join(cwd, \".theokit\", \"memory\", \"lance\");\n}\n\nvoid existsSync; // imported but only used conditionally via mkdirSync\n","/**\n * Common `MemoryIndex` interface shared between the SQLite-backed\n * `IndexManager` (default) and the Lance-backed adapter (ADR D43, shipped\n * v1.4.0 via lancedb-backend-ship-v1-1 plan).\n *\n * Consumers (`local-agent-memory.ts`, `active-memory.ts`, `tools.ts`,\n * `runActiveMemory`) only ever call `sync()`, `search()`, `status()`,\n * `close()` — the union of those four methods is the portable surface.\n *\n * Why a separate file (vs declaring inline in `index-manager.ts`)? D43\n * promised \"extrair interface abstrata `MemoryIndex` em\n * `internal/memory/index-interface.ts`\". Keeping the contract physically\n * separated from one of its implementations preserves OCP — future\n * backends (Qdrant, PGVector) can land without touching IndexManager.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\n\n// Re-export consumer-facing shapes for stable internal import paths.\nexport type { IndexStatus, MemorySearchHit, SearchOptions };\n\nexport interface SyncResult {\n  filesScanned: number;\n  filesUpdated: number;\n  chunksWritten: number;\n  chunksEmbedded: number;\n}\n\n/**\n * Common search-options parser used by both `IndexManager.search` and\n * `LanceMemoryAdapter.search`. Returns the normalized cap + minimum-score\n * floor — eliminates jscpd duplication while keeping per-backend search\n * logic distinct.\n */\nexport function parseSearchOptions(options: SearchOptions = {}): {\n  maxResults: number;\n  minScore: number;\n} {\n  return {\n    maxResults: Math.max(1, options.maxResults ?? 10),\n    minScore: options.minScore ?? 0,\n  };\n}\n\nexport interface MemoryIndex {\n  /**\n   * Walk the memory corpus + reindex changed files. Lance backend has no\n   * markdown corpus to walk — its adapter returns zero counts (no-op) and\n   * relies on explicit `addFact` calls instead.\n   */\n  sync(): Promise<SyncResult>;\n\n  /**\n   * Semantic + textual search over the indexed corpus. Both backends\n   * return the same `MemorySearchHit[]` shape; Lance leaves `textScore`\n   * undefined (vector-only — no FTS5 layer).\n   */\n  search(query: string, options?: SearchOptions): Promise<MemorySearchHit[]>;\n\n  /** Snapshot of the index health (backend type + counts). */\n  status(): IndexStatus;\n\n  /** Release native handles. Idempotent. */\n  close(): Promise<void> | void;\n}\n","/**\n * `LanceMemoryAdapter` — wraps `LanceIndex` to expose the common\n * `MemoryIndex` interface (sync/search/status/close) so consumers of\n * `IndexManager.open({ backend: \"lance\" })` get a drop-in replacement\n * for the SQLite-backed `IndexManager`.\n *\n * Semantic deltas vs SQLite (documented so callers know what to expect):\n *\n *  - `sync()` is a NO-OP. Lance is a pure vector store — there is no\n *    markdown corpus to crawl. Returns zero counts. Consumers writing\n *    facts use `LanceIndex.addFacts` directly (exposed via the index\n *    object returned to advanced callers).\n *  - `search()` performs vector-only retrieval. `MemorySearchHit.textScore`\n *    is undefined (no FTS5 layer); `vectorScore === score`.\n *  - `status()` reports `backend: \"hybrid\"` only when an embedding runtime\n *    is wired (always the case for Lance — embedding is required at open).\n *    `chunksIndexed` reflects total Lance row count; `filesIndexed` is 0\n *    because Lance does not track file provenance per-row.\n *\n * Ships with the lancedb-backend-ship-v1-1 plan (close D12, supersede via\n * D43). v1.4.0 of `@theokit/sdk`.\n *\n * @internal\n */\n\nimport type { IndexStatus, MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\nimport type { LanceIndex } from \"./lance-index.js\";\nimport { type MemoryIndex, parseSearchOptions, type SyncResult } from \"./memory-index.js\";\n\n/**\n * Default namespace used when consumers call `search()` without specifying\n * one. The SQLite `IndexManager` does not surface namespace in its public\n * `search()` signature either — both backends therefore behave consistently\n * under the \"single-workspace, single-namespace\" assumption that v1.4 ships.\n *\n * v1.5 candidate: surface `namespace` in `SearchOptions` (additive — no\n * breaking change) so multi-tenant Lance consumers can scope queries.\n */\nconst DEFAULT_NAMESPACE = \"default\";\n\n/** Empty sync result — Lance has no corpus to walk. */\nconst EMPTY_SYNC_RESULT: SyncResult = Object.freeze({\n  filesScanned: 0,\n  filesUpdated: 0,\n  chunksWritten: 0,\n  chunksEmbedded: 0,\n});\n\nexport class LanceMemoryAdapter implements MemoryIndex {\n  constructor(private readonly inner: LanceIndex) {}\n\n  /**\n   * No-op for Lance — see file header. Returns zero counts so callers'\n   * existing logging (`filesScanned: X`) does not break.\n   */\n  async sync(): Promise<SyncResult> {\n    return EMPTY_SYNC_RESULT;\n  }\n\n  // jscpd:ignore-start — search signature + early-out is idiomatic\n  // overlap with IndexManager.search; further factoring would hurt\n  // readability (the bodies diverge sharply right after).\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    // jscpd:ignore-end\n    const lanceHits = await this.inner.search(query, {\n      namespace: DEFAULT_NAMESPACE,\n      limit: maxResults * 2,\n      ...(options.sources !== undefined ? { sources: options.sources } : {}),\n    });\n    return lanceHits\n      .filter((h) => h.score >= minScore)\n      .slice(0, maxResults)\n      .map((h) => translateLanceHit(h, query));\n  }\n\n  status(): IndexStatus {\n    // chunksIndexed via a synchronous best-effort — Lance API is async so\n    // we surface zero here and document that consumers needing exact counts\n    // should call `inner.countFacts()` directly.\n    return {\n      backend: \"hybrid\",\n      filesIndexed: 0,\n      chunksIndexed: 0,\n    };\n  }\n\n  async close(): Promise<void> {\n    await this.inner.close();\n  }\n\n  /**\n   * Escape hatch for advanced callers (migration tool, benchmark script)\n   * that need direct access to addFacts/countFacts/removeFacts.\n   */\n  unwrap(): LanceIndex {\n    return this.inner;\n  }\n}\n\n/**\n * Translate `LanceSearchHit` to `MemorySearchHit`. Field mapping:\n *\n *   - `id` → `path` (Lance has no file-system provenance; use opaque id)\n *   - `text` → `snippet` (truncated to 200 chars matching IndexManager convention)\n *   - `score` → combined (0.7 × vectorScore + 0.3 × textScore)\n *   - `vectorScore` → from Lance's distance metric\n *   - `textScore` → T4.5 client-side term-overlap ratio (removes ADR D43 vector-only caveat)\n *   - `source` → `source`\n *   - synthetic `startLine: 0, endLine: 0` (Lance has no line info)\n *   - synthetic `citation: id` (no path:line citation available)\n */\nfunction translateLanceHit(\n  hit: { id: string; text: string; source: \"memory\" | \"sessions\" | \"wiki\"; score: number },\n  query?: string,\n): MemorySearchHit {\n  const textScore = query !== undefined ? computeTermOverlapScore(query, hit.text) : 0;\n  const vectorScore = hit.score;\n  // Hybrid combination: 70% vector (semantic) + 30% text (lexical).\n  const combined = 0.7 * vectorScore + 0.3 * textScore;\n  return {\n    path: hit.id,\n    startLine: 0,\n    endLine: 0,\n    score: combined,\n    textScore,\n    vectorScore,\n    snippet: hit.text.slice(0, 200),\n    source: hit.source,\n    citation: hit.id,\n  };\n}\n\n/**\n * T4.5 — Client-side term-overlap score for Lance hybrid search.\n * Counts what fraction of query terms appear in the text (case-insensitive).\n * Simple but effective for re-ranking vector hits by lexical relevance.\n * Returns 0..1 where 1 = all query terms present.\n */\nfunction computeTermOverlapScore(query: string, text: string): number {\n  const queryTerms = query\n    .toLowerCase()\n    .split(/\\s+/)\n    .filter((t) => t.length > 1);\n  if (queryTerms.length === 0) return 0;\n  const textLower = text.toLowerCase();\n  const matched = queryTerms.filter((term) => textLower.includes(term)).length;\n  return matched / queryTerms.length;\n}\n","/**\n * Dispatch helpers for `IndexManager.open`. Extracted to keep\n * `index-manager.ts` under the G8 400-LoC budget (lancedb-backend-ship-v1-1).\n *\n * @internal\n */\n\nimport { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryBackend, OpenIndexOptions } from \"./index-manager-contract.js\";\nimport { LanceIndex } from \"./lance-index.js\";\nimport { LanceMemoryAdapter } from \"./lance-memory-adapter.js\";\nimport type { MemoryIndex } from \"./memory-index.js\";\n\n/** Valid backend identifiers — runtime guard against TS-narrowing escapes (EC-1). */\nexport const VALID_BACKENDS: readonly MemoryBackend[] = [\"sqlite-vec\", \"lance\"];\n\n/**\n * EC-1: runtime guard for `opts.backend`. TS union is compile-time only;\n * consumers passing JS `as any` typos must hit a typed error, not silent\n * SQLite fallback.\n */\nexport function assertValidBackend(backend: string): asserts backend is MemoryBackend {\n  if (!VALID_BACKENDS.includes(backend as MemoryBackend)) {\n    throw new ConfigurationError(\n      `Invalid memory backend \"${backend}\". Valid values: ${VALID_BACKENDS.join(\", \")}.`,\n      { code: \"invalid_memory_backend\" },\n    );\n  }\n}\n\n/**\n * Lance-path open. Throws `lance_requires_embedding` when no embedding\n * runtime is provided (Lance is vector-only — no FTS fallback).\n * Surfaces `lance_backend_unavailable` from LanceIndex.open when peer\n * dep is absent.\n */\nexport async function openLanceIndex(opts: OpenIndexOptions): Promise<MemoryIndex> {\n  if (opts.embedding === undefined) {\n    throw new ConfigurationError(\n      \"Lance backend requires an embedding runtime. Pass `embedding: { provider, model, apiKey }` in Memory.create options (or omit `backend` to use SQLite default).\",\n      { code: \"lance_requires_embedding\" },\n    );\n  }\n  const lance = await LanceIndex.open({\n    cwd: opts.cwd,\n    embedding: opts.embedding,\n    ...(opts.filePath !== undefined ? { storagePath: opts.filePath } : {}),\n  });\n  return new LanceMemoryAdapter(lance);\n}\n","/**\n * Public memory types (used by runtime + storage + migration + future index).\n *\n * Leaf module — only depends on `node:path` — so neither `runtime/memory-store.ts`\n * nor `internal/memory/markdown-store.ts` introduces a dependency cycle.\n *\n * @internal\n */\nimport { resolve as resolvePath } from \"node:path\";\n\nimport { safePathJoin, sanitizeIdentifier } from \"../security/path-guard.js\";\n\nexport interface MemoryConfig {\n  enabled: boolean;\n  namespace?: string;\n  userId?: string;\n  scope?: \"agent\" | \"user\" | \"team\";\n  storePath?: string;\n}\n\nexport interface MemoryFact {\n  text: string;\n}\n\n// `redactSecrets` is now re-exported from the canonical security module\n// (ADR D68). Pre-T0.2 it was a 3-pattern local fn; consolidated to avoid\n// drift with the central 12-pattern list.\nexport { redactSecrets } from \"../security/index.js\";\n\n/**\n * Resolve the legacy JSON memory path used pre-ADR-D8 (kept for migration\n * helpers + tests). Centralized here so `migration.ts` and the legacy-aware\n * `runtime/memory-store.ts` don't duplicate the path logic (jscpd cleanup).\n */\nexport function legacyMemoryJsonPath(cwd: string, config: MemoryConfig): string {\n  // ADRs D79-D81: storePath is programmatic (trusted); namespace/scope/userId\n  // are user-shaped and pass sanitizeIdentifier. EC-7 (edge-case review):\n  // realistic userIds (UUIDs, hash IDs, \"default\") pass; \"user@example.com\"\n  // and similar need to be normalized by the caller before passing.\n  if (config.storePath !== undefined) {\n    return resolvePath(cwd, config.storePath);\n  }\n  const namespace = sanitizeIdentifier(config.namespace ?? \"default\");\n  const scope = sanitizeIdentifier(config.scope ?? \"agent\", { maxLen: 16 });\n  const userId = sanitizeIdentifier(config.userId ?? \"default\");\n  return safePathJoin(cwd, \".theokit\", \"memory\", namespace, `${scope}-${userId}.json`);\n}\n\n/**\n * A semantically meaningful slice of a markdown memory file, produced by\n * `chunkMarkdown`. Each chunk carries stable line numbers + a content hash\n * used downstream by the embedding cache.\n *\n * Mirrors peer-project's `MemoryChunk` shape\n * (`referencia/peer-project/packages/memory-host-sdk/src/host/engine-storage.ts`).\n *\n * @internal\n */\nexport interface MemoryChunk {\n  /** 1-indexed starting line in the source file. */\n  startLine: number;\n  /** 1-indexed ending line (inclusive). */\n  endLine: number;\n  /** Slice of markdown source text. */\n  text: string;\n  /** sha256 of `text`; stable across runs for identical inputs. */\n  hash: string;\n  /** Optional nearest heading text (without the `#` markers). */\n  heading?: string;\n}\n\n/**\n * Result of `reader.readFile`. Contains the bounded slice plus truncation\n * + provenance info.\n *\n * Mirrors peer-project's `MemoryReadResult` shape.\n *\n * @internal\n */\nexport interface MemoryReadResult {\n  path: string;\n  /** Requested starting line (1-indexed, defaults to 1). */\n  from: number;\n  /** Number of lines actually returned (may be less than `lines` near EOF). */\n  linesReturned: number;\n  /** Total lines in the file (after the read). */\n  totalLines: number;\n  /** True when fewer lines were returned than the requested `lines` AND EOF was hit. */\n  truncated: boolean;\n  /** Lines past the returned slice that remain in the file. */\n  remainingLines: number;\n  /** Slice text (joined with `\\n`). */\n  text: string;\n}\n\n/**\n * Lightweight reference to a markdown file in the memory corpus.\n *\n * Mirrors peer-project's `MemoryFileEntry`.\n *\n * @internal\n */\nexport interface MemoryFileEntry {\n  /** Absolute path on disk. */\n  path: string;\n  /** Path relative to the memory root (e.g. \"MEMORY.md\", \"notes/foo.md\"). */\n  relPath: string;\n  /** ms-since-epoch mtime. */\n  mtime: number;\n  /** sha256 of the file content; recomputed on each read. */\n  hash: string;\n}\n","import { mkdir, readdir, readFile } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { replaceFileAtomic } from \"../../persistence/atomic-write.js\";\nimport { withCwdMutex } from \"../../persistence/cwd-mutex.js\";\nimport { type MemoryConfig, type MemoryFact, redactSecrets } from \"../types.js\";\n\n/**\n * Markdown-first memory storage (ADR D1 of memory-system-peer-project-parity).\n *\n * Layout:\n *   .theokit/memory/\n *   ├── MEMORY.md          # facts under `## Facts`\n *   └── notes/\n *       └── <slug>.md      # per-topic notes\n *\n * All writes go through `replaceFileAtomic` + a per-cwd mutex (EC-4 of the\n * edge-case review) so concurrent `appendFact` calls within the same process\n * serialize. Multi-process safety is NOT provided.\n *\n * @internal\n */\n\nconst MEMORY_MD_HEADER =\n  \"# Memory\\n\\n> Auto-managed by @theokit/sdk. Edit freely — the SDK reads from here.\\n\";\nconst FACTS_HEADING = \"## Facts\";\n\nexport function memoryDir(cwd: string): string {\n  return join(cwd, \".theokit\", \"memory\");\n}\n\nexport function memoryMdPath(cwd: string): string {\n  return join(memoryDir(cwd), \"MEMORY.md\");\n}\n\nexport function notesDir(cwd: string): string {\n  return join(memoryDir(cwd), \"notes\");\n}\n\n/** Read facts from `MEMORY.md`'s `## Facts` section. Returns `[]` when missing. */\nexport async function readFactsFromMarkdown(cwd: string): Promise<MemoryFact[]> {\n  let raw: string;\n  try {\n    raw = await readFile(memoryMdPath(cwd), \"utf8\");\n  } catch {\n    return [];\n  }\n  return parseFactsSection(raw);\n}\n\n/** Append a fact to `MEMORY.md ## Facts`. Creates the section if missing. Atomic + serialized. */\nexport function appendFactToMarkdown(cwd: string, fact: MemoryFact): Promise<void> {\n  return withCwdMutex(memoryDir(cwd), async () => {\n    const path = memoryMdPath(cwd);\n    let raw = \"\";\n    try {\n      raw = await readFile(path, \"utf8\");\n    } catch {\n      raw = \"\";\n    }\n    const sanitized = redactSecrets(fact.text);\n    const next = insertFactBullet(raw, sanitized);\n    await mkdir(memoryDir(cwd), { recursive: true });\n    await replaceFileAtomic(path, next);\n  });\n}\n\nexport interface NoteFile {\n  slug: string;\n  path: string;\n}\n\nexport async function listNotes(cwd: string): Promise<NoteFile[]> {\n  let entries: string[] = [];\n  try {\n    entries = await readdir(notesDir(cwd));\n  } catch {\n    return [];\n  }\n  return entries\n    .filter((name) => name.endsWith(\".md\"))\n    .map((name) => ({ slug: name.replace(/\\.md$/, \"\"), path: join(notesDir(cwd), name) }));\n}\n\nfunction parseFactsSection(raw: string): MemoryFact[] {\n  const idx = raw.indexOf(FACTS_HEADING);\n  if (idx === -1) return [];\n  const tail = raw.slice(idx + FACTS_HEADING.length);\n  // Stop at the next top-level or h2 heading.\n  const nextHeading = tail.search(/\\n#{1,2}\\s/);\n  const block = nextHeading === -1 ? tail : tail.slice(0, nextHeading);\n  return block\n    .split(\"\\n\")\n    .map((line) => line.trim())\n    .filter((line) => line.startsWith(\"- \"))\n    .map((line) => ({ text: line.slice(2).trim() }));\n}\n\nfunction insertFactBullet(raw: string, fact: string): string {\n  const bullet = `- ${fact}`;\n  if (raw.length === 0) {\n    return `${MEMORY_MD_HEADER}\\n${FACTS_HEADING}\\n\\n${bullet}\\n`;\n  }\n  const idx = raw.indexOf(FACTS_HEADING);\n  if (idx === -1) {\n    // Append a new ## Facts section, preserving prior content (EC-5).\n    const sep = raw.endsWith(\"\\n\") ? \"\" : \"\\n\";\n    return `${raw}${sep}\\n${FACTS_HEADING}\\n\\n${bullet}\\n`;\n  }\n  // Find end of the facts block (next h2/h1 heading) and insert before it.\n  const after = idx + FACTS_HEADING.length;\n  const nextHeading = raw.slice(after).search(/\\n#{1,2}\\s/);\n  if (nextHeading === -1) {\n    const trailing = raw.endsWith(\"\\n\") ? \"\" : \"\\n\";\n    return `${raw}${trailing}${bullet}\\n`;\n  }\n  const insertAt = after + nextHeading;\n  return `${raw.slice(0, insertAt)}\\n${bullet}${raw.slice(insertAt)}`;\n}\n\n/** Configuration-aware accessors honoring the existing MemoryConfig contract. */\nexport async function readFacts(cwd: string, config: MemoryConfig): Promise<MemoryFact[]> {\n  if (!config.enabled) return [];\n  return readFactsFromMarkdown(cwd);\n}\n\nexport async function appendFact(\n  cwd: string,\n  config: MemoryConfig,\n  fact: MemoryFact,\n): Promise<void> {\n  if (!config.enabled) return;\n  await appendFactToMarkdown(cwd, fact);\n}\n","import { mkdir } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { replaceFileAtomic } from \"../../persistence/atomic-write.js\";\nimport { safeFilenameForId } from \"../../security/path-guard.js\";\nimport { redactSecrets } from \"../types.js\";\nimport { memoryDir } from \"./markdown-store.js\";\n\n/**\n * Per-run session summary writer (ADR D20).\n *\n * After every finished run, write a markdown summary to\n * `.theokit/memory/sessions/<runId>.md`. IndexManager picks these up with\n * `source=\"sessions\"` so `memory_search({ corpus: \"sessions\" })` can recall\n * past conversations.\n *\n * EC-9: only `status === \"finished\"` runs trigger a write. Cancelled/errored\n * runs would otherwise pollute the recall corpus with partial transcripts.\n *\n * @internal\n */\n\nexport interface SessionSummaryInput {\n  cwd: string;\n  runId: string;\n  agentId: string;\n  userText: string;\n  assistantText: string;\n  status: \"finished\" | \"running\" | \"error\" | \"cancelled\";\n  at: number;\n}\n\nconst MAX_TURN_CHARS = 2000;\n\nexport function sessionsDir(cwd: string): string {\n  return join(memoryDir(cwd), \"sessions\");\n}\n\nexport function sessionSummaryPath(cwd: string, runId: string): string {\n  // M0-4: total id->filename helper. UUID runIds (the production case, from\n  // randomUUID) pass through to the identical name; non-conforming ids get a\n  // deterministic sha256 token instead of the old lossy replace-collapse.\n  return join(sessionsDir(cwd), `${safeFilenameForId(runId, { maxLen: 128 })}.md`);\n}\n\nfunction truncate(text: string): string {\n  if (text.length <= MAX_TURN_CHARS) return text;\n  return `${text.slice(0, MAX_TURN_CHARS)}…`;\n}\n\n/**\n * Write a session summary file. EC-9: a non-finished status returns early\n * without touching disk. Secrets in both user and assistant text are\n * redacted via the shared `redactSecrets` pattern.\n *\n * @internal\n */\nexport async function writeSessionSummary(input: SessionSummaryInput): Promise<void> {\n  if (input.status !== \"finished\") return;\n  const path = sessionSummaryPath(input.cwd, input.runId);\n  await mkdir(sessionsDir(input.cwd), { recursive: true });\n\n  const safeUser = redactSecrets(truncate(input.userText));\n  const safeAssistant = redactSecrets(truncate(input.assistantText));\n  const iso = new Date(input.at).toISOString();\n\n  const body = [\n    \"---\",\n    `runId: ${input.runId}`,\n    `agentId: ${input.agentId}`,\n    `at: ${iso}`,\n    `status: ${input.status}`,\n    \"---\",\n    \"\",\n    \"## User\",\n    \"\",\n    safeUser,\n    \"\",\n    \"## Assistant\",\n    \"\",\n    safeAssistant,\n    \"\",\n  ].join(\"\\n\");\n\n  await replaceFileAtomic(path, body);\n}\n","import { readdir } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { memoryDir } from \"./markdown-store.js\";\nimport { sessionsDir } from \"./session-summary-writer.js\";\n\n/**\n * Session summary discovery (ADR D20).\n *\n * Mirrors `wiki-loader.ts:discoverWikiFiles`: scans\n * `.theokit/memory/sessions/*.md` and returns `MemoryFileEntry`-shaped\n * records. IndexManager tags each chunk with `source=\"sessions\"` so\n * `memory_search({ corpus: \"sessions\" })` filters them in.\n *\n * @internal\n */\n\nexport interface SessionFile {\n  absolutePath: string;\n  relPath: string;\n}\n\nexport async function discoverSessionFiles(cwd: string): Promise<SessionFile[]> {\n  let entries: string[];\n  try {\n    entries = await readdir(sessionsDir(cwd));\n  } catch {\n    return [];\n  }\n  const root = memoryDir(cwd);\n  return entries\n    .filter((entry) => entry.endsWith(\".md\"))\n    .map((entry) => {\n      const absolutePath = join(sessionsDir(cwd), entry);\n      return {\n        absolutePath,\n        relPath: relativeToRoot(root, absolutePath),\n      };\n    });\n}\n\nfunction relativeToRoot(root: string, absolutePath: string): string {\n  if (absolutePath.startsWith(`${root}/`)) return absolutePath.slice(root.length + 1);\n  return absolutePath;\n}\n","import { readdir } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { memoryDir } from \"./markdown-store.js\";\n\n/**\n * Wiki supplement discovery (ADR Phase 10 of memory-system-peer-project-parity).\n *\n * Wiki files live under `.theokit/memory/wiki/*.md`. They are READ-ONLY —\n * the SDK never writes here. Each indexed chunk carries `source=\"wiki\"` so\n * `memory_search { corpus: \"wiki\" }` and `corpus: \"all\"` can scope hits.\n *\n * @internal\n */\n\nexport interface WikiFile {\n  absolutePath: string;\n  relPath: string;\n}\n\nexport function wikiDir(cwd: string): string {\n  return join(memoryDir(cwd), \"wiki\");\n}\n\nexport async function discoverWikiFiles(cwd: string): Promise<WikiFile[]> {\n  let entries: string[];\n  try {\n    entries = await readdir(wikiDir(cwd));\n  } catch {\n    return [];\n  }\n  const root = memoryDir(cwd);\n  return entries\n    .filter((entry) => entry.endsWith(\".md\"))\n    .map((entry) => ({\n      absolutePath: join(wikiDir(cwd), entry),\n      relPath: join(\"wiki\", entry),\n    }))\n    .map((file) => ({\n      absolutePath: file.absolutePath,\n      relPath: relativeToRoot(root, file.absolutePath),\n    }));\n}\n\nfunction relativeToRoot(root: string, absolutePath: string): string {\n  // memory root is e.g. /tmp/x/.theokit/memory; wiki file is /tmp/x/.theokit/memory/wiki/foo.md\n  // Strip the root + \"/\" prefix to get \"wiki/foo.md\".\n  if (absolutePath.startsWith(`${root}/`)) return absolutePath.slice(root.length + 1);\n  return absolutePath;\n}\n","import { createHash } from \"node:crypto\";\nimport { readdir, stat } from \"node:fs/promises\";\nimport { join, relative } from \"node:path\";\n\nimport type { MemorySearchHit, SearchOptions } from \"./index-manager-contract.js\";\nimport { memoryDir, memoryMdPath, notesDir } from \"./storage/markdown-store.js\";\nimport { discoverSessionFiles } from \"./storage/session-loader.js\";\nimport { discoverWikiFiles } from \"./storage/wiki-loader.js\";\n\n// ───── hybrid scoring helpers ─────────────────────────────────────────\n\n/** @internal */\nexport interface HybridWeights {\n  vectorWeight: number;\n  textWeight: number;\n  total: number;\n}\n\n/** @internal */\nexport function resolveWeights(options: SearchOptions): HybridWeights {\n  const vectorWeight = options.vectorWeight ?? 0.6;\n  const textWeight = options.textWeight ?? 0.4;\n  const total = vectorWeight + textWeight || 1;\n  return { vectorWeight, textWeight, total };\n}\n\n/** @internal */\nexport function blendScores(\n  hit: MemorySearchHit & { chunkId: number },\n  vectorScore: number,\n  weights: HybridWeights,\n): MemorySearchHit {\n  const score =\n    (vectorScore * weights.vectorWeight + hit.textScore * weights.textWeight) / weights.total;\n  return {\n    path: hit.path,\n    startLine: hit.startLine,\n    endLine: hit.endLine,\n    score,\n    textScore: hit.textScore,\n    snippet: hit.snippet,\n    source: hit.source,\n    citation: hit.citation,\n    ...(vectorScore > 0 ? { vectorScore } : {}),\n  };\n}\n\n// ───── file discovery ─────────────────────────────────────────────────\n\n/** @internal */\nexport interface DiscoveredFile {\n  absolutePath: string;\n  relPath: string;\n  source: \"memory\" | \"wiki\" | \"sessions\";\n}\n\n/** @internal */\nexport async function collectMarkdownFiles(cwd: string): Promise<DiscoveredFile[]> {\n  const root = memoryDir(cwd);\n  const results: DiscoveredFile[] = [];\n  // MEMORY.md\n  try {\n    await stat(memoryMdPath(cwd));\n    results.push({\n      absolutePath: memoryMdPath(cwd),\n      relPath: relative(root, memoryMdPath(cwd)),\n      source: \"memory\",\n    });\n  } catch {\n    // skip\n  }\n  // notes/*.md\n  try {\n    const entries = await readdir(notesDir(cwd));\n    for (const entry of entries) {\n      if (!entry.endsWith(\".md\")) continue;\n      const abs = join(notesDir(cwd), entry);\n      results.push({ absolutePath: abs, relPath: relative(root, abs), source: \"memory\" });\n    }\n  } catch {\n    // notes dir doesn't exist yet — that's fine\n  }\n  // wiki/*.md (Phase 10 — read-only supplements)\n  const wikiFiles = await discoverWikiFiles(cwd);\n  for (const wiki of wikiFiles) {\n    results.push({\n      absolutePath: wiki.absolutePath,\n      relPath: wiki.relPath,\n      source: \"wiki\",\n    });\n  }\n  // sessions/*.md (ADR D20 — per-run summaries for corpus=\"sessions\" recall)\n  const sessionFiles = await discoverSessionFiles(cwd);\n  for (const session of sessionFiles) {\n    results.push({\n      absolutePath: session.absolutePath,\n      relPath: session.relPath,\n      source: \"sessions\",\n    });\n  }\n  return results;\n}\n\n// ───── misc helpers ───────────────────────────────────────────────────\n\n/** @internal */\nexport function sha256(text: string): string {\n  return createHash(\"sha256\").update(text).digest(\"hex\");\n}\n\n/** @internal */\nexport function truncateSnippet(text: string): string {\n  const max = 500;\n  return text.length <= max ? text : `${text.slice(0, max)}…`;\n}\n","import { ConfigurationError } from \"../../errors.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Load the `sqlite-vec` extension into an opened SQLite connection.\n *\n * Wraps the native `load(db)` call from the `sqlite-vec` npm package with a\n * typed error path (EC-8 of the edge-case review) so callers see a\n * `sqlite_vec_unavailable` ConfigurationError instead of a raw native error.\n *\n * @internal\n */\nexport async function loadSqliteVecExtension(db: MemoryDb): Promise<void> {\n  try {\n    const mod = await import(\"sqlite-vec\");\n    const loadFn = (mod as { load?: (db: unknown) => void }).load;\n    if (typeof loadFn !== \"function\") {\n      throw new Error(\"sqlite-vec module exposes no `load` export\");\n    }\n    loadFn(db);\n  } catch (cause) {\n    const message = cause instanceof Error ? cause.message : String(cause);\n    throw new ConfigurationError(\n      `sqlite-vec extension unavailable. Install \\`sqlite-vec\\` and ensure the native binary matches your Node + OS. Cause: ${message}`,\n      { code: \"sqlite_vec_unavailable\", cause },\n    );\n  }\n}\n\n/** Check whether sqlite-vec is loaded by running a tiny version query. */\nexport function isSqliteVecLoaded(db: MemoryDb): boolean {\n  try {\n    const row = db.prepare(\"SELECT vec_version() as v\").get();\n    return row !== undefined && row.v !== undefined;\n  } catch {\n    return false;\n  }\n}\n","import { createHash } from \"node:crypto\";\n\nimport type { MemoryChunk } from \"../types.js\";\n\n/**\n * Split a markdown document into semantically meaningful chunks (ADR D1 of\n * memory-system-peer-project-parity).\n *\n * Algorithm:\n *   1. Walk lines tracking the current heading (latest `^#+ ` line).\n *   2. Split chunks at the next heading boundary AND on blank-line paragraph\n *      boundaries.\n *   3. If a single paragraph exceeds `maxChars`, split it at the nearest\n *      whitespace ≤ maxChars (word-aligned per edge-case review EC-6) —\n *      never mid-word.\n *\n * Mirrors peer-project's `chunkMarkdown` from\n * `packages/memory-host-sdk/src/host/chunk-markdown.ts`.\n *\n * @internal\n */\n\nexport interface ChunkMarkdownOptions {\n  /** Maximum chars per chunk. Default 800. */\n  maxChars?: number;\n  /** Minimum chars per chunk (avoids splintering tiny lines). Default 80. */\n  minChars?: number;\n}\n\nconst HEADING_RE = /^(#{1,6})\\s+(.+?)\\s*$/;\n\ninterface ChunkAccumulator {\n  chunks: MemoryChunk[];\n  lines: string[];\n  start: number;\n  heading: string | undefined;\n}\n\nexport function chunkMarkdown(text: string, options: ChunkMarkdownOptions = {}): MemoryChunk[] {\n  const maxChars = options.maxChars ?? 800;\n  if (text.length === 0) return [];\n  const lines = text.split(\"\\n\");\n  const acc: ChunkAccumulator = { chunks: [], lines: [], start: 1, heading: undefined };\n  for (let i = 0; i < lines.length; i++) {\n    const line = lines[i] ?? \"\";\n    const lineNumber = i + 1;\n    processLine(acc, line, lineNumber, maxChars);\n  }\n  flushAccumulator(acc, lines.length, maxChars);\n  return acc.chunks;\n}\n\nfunction processLine(\n  acc: ChunkAccumulator,\n  line: string,\n  lineNumber: number,\n  maxChars: number,\n): void {\n  const headingMatch = HEADING_RE.exec(line);\n  const isBlank = line.trim().length === 0;\n  if (headingMatch !== null && acc.lines.length > 0) {\n    flushAccumulator(acc, lineNumber - 1, maxChars);\n  }\n  if (headingMatch !== null) acc.heading = headingMatch[2];\n  acc.lines.push(line);\n  if (isBlank && acc.lines.length > 1) {\n    const joined = acc.lines.join(\"\\n\");\n    if (joined.trim().length > 0) flushAccumulator(acc, lineNumber, maxChars);\n  }\n}\n\nfunction flushAccumulator(acc: ChunkAccumulator, endLineExclusive: number, maxChars: number): void {\n  if (acc.lines.length === 0) return;\n  const chunkText = acc.lines.join(\"\\n\");\n  if (chunkText.trim().length === 0) {\n    acc.lines = [];\n    acc.start = endLineExclusive + 1;\n    return;\n  }\n  if (chunkText.length > maxChars) {\n    pushOversizedSlices(acc.chunks, chunkText, acc.start, acc.heading, maxChars);\n  } else {\n    acc.chunks.push(buildChunk(chunkText, acc.start, endLineExclusive, acc.heading));\n  }\n  acc.lines = [];\n  acc.start = endLineExclusive + 1;\n}\n\nfunction buildChunk(\n  text: string,\n  startLine: number,\n  endLine: number,\n  heading: string | undefined,\n): MemoryChunk {\n  return {\n    startLine,\n    endLine,\n    text,\n    hash: createHash(\"sha256\").update(text).digest(\"hex\"),\n    ...(heading !== undefined ? { heading } : {}),\n  };\n}\n\nfunction pushOversizedSlices(\n  chunks: MemoryChunk[],\n  text: string,\n  startLine: number,\n  heading: string | undefined,\n  maxChars: number,\n): void {\n  let remaining = text;\n  let lineCursor = startLine;\n  while (remaining.length > maxChars) {\n    const splitAt = findWordBoundarySplit(remaining, maxChars);\n    const slice = remaining.slice(0, splitAt);\n    const sliceLines = slice.split(\"\\n\").length;\n    chunks.push(buildChunk(slice, lineCursor, lineCursor + sliceLines - 1, heading));\n    remaining = remaining.slice(splitAt).replace(/^\\s+/, \"\");\n    lineCursor += sliceLines - 1;\n  }\n  if (remaining.length > 0) {\n    const sliceLines = remaining.split(\"\\n\").length;\n    chunks.push(buildChunk(remaining, lineCursor, lineCursor + sliceLines - 1, heading));\n  }\n}\n\n/**\n * Find a split point ≤ maxChars that lands on a whitespace boundary so we\n * don't slice a word in half. Falls back to maxChars if no whitespace is\n * within range (very rare — a single token > maxChars).\n */\nfunction findWordBoundarySplit(text: string, maxChars: number): number {\n  if (text.length <= maxChars) return text.length;\n  // Walk backward from maxChars looking for whitespace.\n  for (let i = maxChars; i > Math.max(0, maxChars - 200); i--) {\n    if (/\\s/.test(text[i] ?? \"x\")) return i;\n  }\n  // No whitespace within 200 chars of the cap — accept a hard split.\n  return maxChars;\n}\n","import type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport type { MemoryDb } from \"./index-db.js\";\n\n/**\n * Vector index helpers (ADR D2 + D4 of memory-system-peer-project-parity).\n *\n * Embeddings live in `embeddings(chunk_id, vec)` — a `vec0` virtual table\n * provided by the sqlite-vec extension. Embedding identity (providerId +\n * model + dimension) lives in the `meta` table; mismatches force a full\n * re-embed sweep (EC-1).\n *\n * @internal\n */\n\nexport const META_KEY_PROVIDER_ID = \"embedding.providerId\";\nexport const META_KEY_MODEL = \"embedding.model\";\nexport const META_KEY_DIMENSION = \"embedding.dimension\";\n\nexport interface EmbeddingIdentity {\n  providerId: string;\n  model: string;\n  dimension: number;\n}\n\nexport function readEmbeddingIdentity(db: MemoryDb): EmbeddingIdentity | undefined {\n  const get = (key: string): string | undefined => {\n    const row = db.prepare(\"SELECT value FROM meta WHERE key = ?\").get(key);\n    return row !== undefined ? String(row.value) : undefined;\n  };\n  const providerId = get(META_KEY_PROVIDER_ID);\n  const model = get(META_KEY_MODEL);\n  const dimRaw = get(META_KEY_DIMENSION);\n  if (providerId === undefined || model === undefined || dimRaw === undefined) return undefined;\n  const dimension = Number(dimRaw);\n  if (!Number.isFinite(dimension) || dimension <= 0) return undefined;\n  return { providerId, model, dimension };\n}\n\nexport function writeEmbeddingIdentity(db: MemoryDb, identity: EmbeddingIdentity): void {\n  const stmt = db.prepare(\n    \"INSERT INTO meta (key, value) VALUES (?, ?) ON CONFLICT(key) DO UPDATE SET value = excluded.value\",\n  );\n  stmt.run(META_KEY_PROVIDER_ID, identity.providerId);\n  stmt.run(META_KEY_MODEL, identity.model);\n  stmt.run(META_KEY_DIMENSION, String(identity.dimension));\n}\n\nexport function identityMatches(a: EmbeddingIdentity, b: EmbeddingIdentity): boolean {\n  return a.providerId === b.providerId && a.model === b.model && a.dimension === b.dimension;\n}\n\nexport function dropVectorIndex(db: MemoryDb): void {\n  db.exec(\"DROP TABLE IF EXISTS embeddings\");\n}\n\nexport function createVectorIndex(db: MemoryDb, dimension: number): void {\n  db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS embeddings USING vec0(\n    chunk_id INTEGER PRIMARY KEY,\n    vec FLOAT[${dimension}]\n  )`);\n}\n\n/** Pack a Float32Array into a Buffer suitable for sqlite-vec BLOB binding. */\nexport function packVector(vec: ReadonlyArray<number>): Buffer {\n  const f32 = new Float32Array(vec.length);\n  for (let i = 0; i < vec.length; i++) f32[i] = vec[i] ?? 0;\n  return Buffer.from(f32.buffer);\n}\n\nexport function upsertEmbedding(db: MemoryDb, chunkId: number, vec: ReadonlyArray<number>): void {\n  // sqlite-vec vec0 virtual tables don't support UPSERT — emulate via\n  // DELETE-then-INSERT. vec0 REJECTS JS Number for chunk_id columns; it\n  // requires BigInt binding. Verified via repro against vec0 v0.1.9.\n  const id = BigInt(chunkId);\n  db.prepare(\"DELETE FROM embeddings WHERE chunk_id = ?\").run(id);\n  db.prepare(\"INSERT INTO embeddings (chunk_id, vec) VALUES (?, ?)\").run(id, packVector(vec));\n}\n\nexport interface VectorHitRow {\n  chunk_id: number;\n  distance: number;\n}\n\nexport function vectorSearch(\n  db: MemoryDb,\n  query: ReadonlyArray<number>,\n  k: number,\n): VectorHitRow[] {\n  // sqlite-vec returns distance (lower = closer). Use KNN syntax. k needs\n  // a BigInt-typed binding too.\n  const rows = db\n    .prepare(\n      `SELECT chunk_id, distance FROM embeddings\n       WHERE vec MATCH ? AND k = ?\n       ORDER BY distance`,\n    )\n    .all(packVector(query), BigInt(k));\n  return rows.map((row) => ({ chunk_id: Number(row.chunk_id), distance: Number(row.distance) }));\n}\n\nexport interface EmbedAllArgs {\n  db: MemoryDb;\n  runtime: EmbeddingRuntime;\n}\n\n/** Embed every chunk that doesn't yet have a vector. */\nexport async function embedMissingChunks(args: EmbedAllArgs): Promise<number> {\n  const rows = args.db\n    .prepare(\n      `SELECT chunks.id as id, chunks.text as text\n       FROM chunks\n       LEFT JOIN embeddings ON embeddings.chunk_id = chunks.id\n       WHERE embeddings.chunk_id IS NULL`,\n    )\n    .all();\n  if (rows.length === 0) return 0;\n  const normalized = rows.map((row) => ({ id: Number(row.id), text: String(row.text ?? \"\") }));\n  const vectors = await args.runtime.embed(normalized.map((r) => r.text));\n  for (let i = 0; i < normalized.length; i++) {\n    const row = normalized[i];\n    const vector = vectors[i];\n    if (row === undefined || vector === undefined) continue;\n    upsertEmbedding(args.db, row.id, vector);\n  }\n  return normalized.length;\n}\n","import { createHash } from \"node:crypto\";\nimport { readFile, stat } from \"node:fs/promises\";\n\nimport { sanitizeFts5Query } from \"../persistence/fts5-sanitize.js\";\nimport type { EmbeddingRuntime } from \"./embedding-adapter.js\";\nimport { LruEmbeddingCache } from \"./embedding-cache.js\";\nimport { defaultIndexPath, type MemoryDb, openMemoryDb } from \"./index-db.js\";\nimport { assertValidBackend, openLanceIndex } from \"./index-manager-dispatch.js\";\nimport {\n  blendScores,\n  collectMarkdownFiles,\n  resolveWeights,\n  sha256,\n  truncateSnippet,\n} from \"./index-manager-helpers.js\";\nimport { type MemoryIndex, parseSearchOptions } from \"./memory-index.js\";\nimport { loadSqliteVecExtension } from \"./sqlite-vec-loader.js\";\nimport { chunkMarkdown } from \"./storage/chunk-markdown.js\";\n\n// T4.1 — query-vector LRU cache (DR4 finding #1). Keyed by\n// sha256(query); caches the embedding vector so repeated search\n// queries skip the HTTP round-trip (p99 1.5-3s → ~0ms on hit).\n// Process-wide singleton with bounded capacity (default 2000 queries).\nconst queryVectorCache = new LruEmbeddingCache(2000);\n\nimport {\n  createVectorIndex,\n  dropVectorIndex,\n  embedMissingChunks,\n  identityMatches,\n  readEmbeddingIdentity,\n  vectorSearch,\n  writeEmbeddingIdentity,\n} from \"./vec-index.js\";\n\n/**\n * Memory index manager (ADR D2). FTS5-only at Phase 3; vector index lands in\n * Phase 5.\n *\n * Lifecycle:\n *   const idx = await IndexManager.open({ cwd });\n *   await idx.sync();\n *   const hits = await idx.search(\"query\");\n *   idx.close();\n *\n * @internal\n */\n\n// T2.1 / ADR D433 — these types now live in `index-manager-contract.ts`\n// to break the 3-cycle memory cluster. Re-exported here for back-compat\n// with downstream importers that historically pulled from this file.\nexport type {\n  IndexStatus,\n  MemoryBackend,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nimport type {\n  IndexStatus,\n  MemorySearchHit,\n  OpenIndexOptions,\n  SearchOptions,\n} from \"./index-manager-contract.js\";\n\nexport class IndexManager implements MemoryIndex {\n  private lastSyncMs: number | undefined;\n  private vectorReady = false;\n\n  private constructor(\n    private readonly cwd: string,\n    private readonly db: MemoryDb,\n    private readonly embedding: EmbeddingRuntime | undefined,\n  ) {}\n\n  /**\n   * Open a memory index. Dispatches to SQLite (default) or Lance (opt-in\n   * via `backend: \"lance\"`). See `openLanceInternal` for Lance-specific\n   * preconditions + typed errors.\n   */\n  static async open(opts: OpenIndexOptions & { backend: \"lance\" }): Promise<MemoryIndex>;\n  static async open(\n    opts: Omit<OpenIndexOptions, \"backend\"> | (OpenIndexOptions & { backend?: \"sqlite-vec\" }),\n  ): Promise<IndexManager>;\n  static async open(opts: OpenIndexOptions): Promise<MemoryIndex> {\n    const backend = opts.backend ?? \"sqlite-vec\";\n    assertValidBackend(backend);\n    if (backend === \"lance\") return await openLanceIndex(opts);\n    return await IndexManager.openSqliteInternal(opts);\n  }\n\n  /** Internal SQLite-path open. Renamed from previous public `open`. */\n  private static async openSqliteInternal(opts: OpenIndexOptions): Promise<IndexManager> {\n    const filePath = opts.filePath ?? defaultIndexPath(opts.cwd);\n    const db = await openMemoryDb({ filePath });\n    const manager = new IndexManager(opts.cwd, db, opts.embedding);\n    if (opts.embedding !== undefined) await manager.initVectorBackend(opts.embedding);\n    return manager;\n  }\n\n  private async initVectorBackend(runtime: EmbeddingRuntime): Promise<void> {\n    await loadSqliteVecExtension(this.db);\n    const currentIdentity = {\n      providerId: runtime.id,\n      model: runtime.model,\n      dimension: runtime.dimension,\n    };\n    const persisted = readEmbeddingIdentity(this.db);\n    if (persisted !== undefined && !identityMatches(persisted, currentIdentity)) {\n      // EC-1: dimension/model/provider changed — drop the vector index and\n      // force a full re-embed on next sync.\n      dropVectorIndex(this.db);\n    }\n    createVectorIndex(this.db, runtime.dimension);\n    writeEmbeddingIdentity(this.db, currentIdentity);\n    this.vectorReady = true;\n  }\n\n  /** Walk the memory corpus + (re)index changed files. */\n  async sync(): Promise<{\n    filesScanned: number;\n    filesUpdated: number;\n    chunksWritten: number;\n    chunksEmbedded: number;\n  }> {\n    const files = await collectMarkdownFiles(this.cwd);\n    let filesUpdated = 0;\n    let chunksWritten = 0;\n    const existingByPath = this.loadFilesIndex();\n    for (const entry of files) {\n      const raw = await readFile(entry.absolutePath, \"utf8\");\n      const hash = sha256(raw);\n      const existing = existingByPath.get(entry.absolutePath);\n      if (existing !== undefined && existing.hash === hash) continue;\n      const stats = await stat(entry.absolutePath);\n      const fileId = this.upsertFile(\n        entry.absolutePath,\n        entry.relPath,\n        hash,\n        stats.mtimeMs,\n        entry.source,\n      );\n      this.deleteChunksForFile(fileId);\n      const chunks = chunkMarkdown(raw);\n      for (const chunk of chunks) {\n        this.insertChunk(fileId, chunk.startLine, chunk.endLine, chunk.text, chunk.hash);\n      }\n      filesUpdated += 1;\n      chunksWritten += chunks.length;\n    }\n    let chunksEmbedded = 0;\n    if (this.vectorReady && this.embedding !== undefined) {\n      chunksEmbedded = await embedMissingChunks({ db: this.db, runtime: this.embedding });\n    }\n    this.lastSyncMs = Date.now();\n    return { filesScanned: files.length, filesUpdated, chunksWritten, chunksEmbedded };\n  }\n\n  async search(query: string, options: SearchOptions = {}): Promise<MemorySearchHit[]> {\n    if (query.trim().length === 0) return [];\n    const { maxResults, minScore } = parseSearchOptions(options);\n    const textHits = this.ftsSearch(query, maxResults * 2);\n    const vectorHitsById = await this.vectorSearchById(query, maxResults * 2);\n    const combined = this.combineHybridScores(textHits, vectorHitsById, options);\n    return combined\n      .filter((h) => h.score >= minScore)\n      .filter((h) => options.sources === undefined || options.sources.includes(h.source))\n      .slice(0, maxResults);\n  }\n\n  status(): IndexStatus {\n    const files = this.db.prepare(\"SELECT COUNT(*) as n FROM files\").get() ?? { n: 0 };\n    const chunks = this.db.prepare(\"SELECT COUNT(*) as n FROM chunks\").get() ?? { n: 0 };\n    const status: IndexStatus = {\n      backend: this.vectorReady ? \"hybrid\" : \"fts-only\",\n      filesIndexed: Number(files.n ?? 0),\n      chunksIndexed: Number(chunks.n ?? 0),\n    };\n    if (this.lastSyncMs !== undefined) status.lastSyncMs = this.lastSyncMs;\n    return status;\n  }\n\n  // ───── search internals ──────────────────────────────────────────────\n\n  private ftsSearch(query: string, limit: number): Array<MemorySearchHit & { chunkId: number }> {\n    // EC-3: short-circuit when sanitizer reduces input to empty string.\n    // Calling `MATCH ''` would error inside FTS5 on some SQLite versions.\n    const sanitized = sanitizeFts5Query(query);\n    if (sanitized.length === 0) return [];\n    const stmt = this.db.prepare(\n      `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n              chunks.start_line as start_line, chunks.end_line as end_line,\n              chunks.text as text, bm25(chunks_fts) as bm25_score\n       FROM chunks_fts\n       JOIN chunks ON chunks_fts.rowid = chunks.id\n       JOIN files  ON chunks.file_id = files.id\n       WHERE chunks_fts MATCH ?\n       ORDER BY bm25_score\n       LIMIT ?`,\n    );\n    let rows: Array<Record<string, unknown>> = [];\n    try {\n      rows = stmt.all(sanitized, limit);\n    } catch {\n      // T4.8 — CJK fallback: FTS5's default tokenizer chokes on CJK\n      // characters (no word boundaries). Instead of returning empty,\n      // fall back to a LIKE search which handles CJK correctly (slower\n      // but correct). ADR D64 documents the trigram-routing deferral.\n      return this.likeSearchFallback(query, limit);\n    }\n    return rows.map((row) => {\n      const bm25 = Number(row.bm25_score ?? 0);\n      const textScore = bm25 < 0 ? 1 / (1 + Math.abs(bm25)) : 1 / (1 + bm25);\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: textScore,\n        textScore,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        // sneak the chunk id through for the hybrid join below\n        // (cast away later)\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  /**\n   * T4.8 — LIKE-based fallback for CJK and other scripts that FTS5's\n   * default tokenizer cannot segment. Slower than FTS5 (full table scan)\n   * but correct for any Unicode input. Returns the same shape as\n   * `ftsSearch` so callers are unaware of the fallback.\n   */\n  private likeSearchFallback(\n    query: string,\n    limit: number,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    const pattern = `%${query.replace(/%/g, \"\\\\%\").replace(/_/g, \"\\\\_\")}%`;\n    const stmt = this.db.prepare(\n      `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n              chunks.start_line as start_line, chunks.end_line as end_line,\n              chunks.text as text\n       FROM chunks\n       JOIN files ON chunks.file_id = files.id\n       WHERE chunks.text LIKE ? ESCAPE '\\\\'\n       LIMIT ?`,\n    );\n    const rows = stmt.all(pattern, limit) as Array<Record<string, unknown>>;\n    return rows.map((row) => {\n      const path = String(row.rel_path ?? \"\");\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      return {\n        path,\n        startLine,\n        endLine,\n        score: 0.5, // LIKE has no relevance score — use a neutral midpoint\n        textScore: 0.5,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n        chunkId: Number(row.id),\n      } as MemorySearchHit & { chunkId: number };\n    });\n  }\n\n  private async vectorSearchById(\n    query: string,\n    limit: number,\n  ): Promise<Map<number, { vectorScore: number; snippet?: string }>> {\n    if (!this.vectorReady || this.embedding === undefined) return new Map();\n    // T4.1 — query-vector LRU cache. The embed call is the p99 hottest\n    // path (1.5-3s per hit). Cache by sha256(query) so repeated queries\n    // skip the HTTP round-trip entirely. The embedding cache (T4.4\n    // globalEmbeddingCache) catches text-level dedup; this catches the\n    // query-level search-result dedup on top.\n    const cacheKey = createHash(\"sha256\").update(query).digest(\"hex\");\n    const cached = queryVectorCache.get(cacheKey);\n    const queryVec = cached ?? (await this.embedding.embed([query]))[0];\n    if (queryVec === undefined) return new Map();\n    if (cached === undefined) queryVectorCache.set(cacheKey, queryVec);\n    const rows = vectorSearch(this.db, queryVec, limit);\n    // sqlite-vec distance: lower = closer. Normalize to 0..1 with higher = better.\n    const out = new Map<number, { vectorScore: number }>();\n    for (const row of rows) {\n      const score = 1 / (1 + Math.max(0, row.distance));\n      out.set(row.chunk_id, { vectorScore: score });\n    }\n    return out;\n  }\n\n  private combineHybridScores(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n    options: SearchOptions,\n  ): MemorySearchHit[] {\n    const weights = resolveWeights(options);\n    const merged = this.mergeHits(textHits, vectorHitsById);\n    const combined = [...merged.values()].map((hit) =>\n      blendScores(hit, vectorHitsById.get(hit.chunkId)?.vectorScore ?? 0, weights),\n    );\n    return combined.sort((a, b) => b.score - a.score);\n  }\n\n  private mergeHits(\n    textHits: Array<MemorySearchHit & { chunkId: number }>,\n    vectorHitsById: Map<number, { vectorScore: number }>,\n  ): Map<number, MemorySearchHit & { chunkId: number }> {\n    const merged = new Map<number, MemorySearchHit & { chunkId: number }>();\n    for (const hit of textHits) merged.set(hit.chunkId, hit);\n    const missingIds = [...vectorHitsById.keys()].filter((id) => !merged.has(id));\n    if (missingIds.length > 0) {\n      for (const hit of this.fetchChunksByIds(missingIds)) {\n        merged.set(hit.chunkId, { ...hit, score: 0, textScore: 0 });\n      }\n    }\n    return merged;\n  }\n\n  private fetchChunksByIds(\n    ids: ReadonlyArray<number>,\n  ): Array<MemorySearchHit & { chunkId: number }> {\n    if (ids.length === 0) return [];\n    const placeholders = ids.map(() => \"?\").join(\",\");\n    const rows = this.db\n      .prepare(\n        `SELECT chunks.id as id, files.rel_path as rel_path, files.source as source,\n                chunks.start_line as start_line, chunks.end_line as end_line,\n                chunks.text as text\n         FROM chunks JOIN files ON chunks.file_id = files.id\n         WHERE chunks.id IN (${placeholders})`,\n      )\n      .all(...ids);\n    return rows.map((row) => {\n      const startLine = Number(row.start_line ?? 0);\n      const endLine = Number(row.end_line ?? 0);\n      const path = String(row.rel_path);\n      return {\n        chunkId: Number(row.id),\n        path,\n        startLine,\n        endLine,\n        score: 0,\n        textScore: 0,\n        snippet: truncateSnippet(String(row.text ?? \"\")),\n        source: String(row.source) as \"memory\" | \"sessions\" | \"wiki\",\n        citation: `${path}:${startLine}-${endLine}`,\n      };\n    });\n  }\n\n  // ───── persistence helpers ─────────────────────────────────────────\n\n  private loadFilesIndex(): Map<string, { id: number; hash: string }> {\n    const rows = this.db.prepare(\"SELECT id, path, hash FROM files\").all() as Array<{\n      id: number;\n      path: string;\n      hash: string;\n    }>;\n    return new Map(rows.map((row) => [row.path, { id: row.id, hash: row.hash }]));\n  }\n\n  private upsertFile(\n    absPath: string,\n    relPath: string,\n    hash: string,\n    mtimeMs: number,\n    source: \"memory\" | \"wiki\" | \"sessions\" = \"memory\",\n  ): number {\n    const stmt = this.db.prepare(\n      `INSERT INTO files (path, rel_path, mtime, hash, source) VALUES (?, ?, ?, ?, ?)\n       ON CONFLICT(path) DO UPDATE SET hash = excluded.hash, mtime = excluded.mtime, source = excluded.source\n       RETURNING id`,\n    );\n    const row = stmt.get(absPath, relPath, Math.floor(mtimeMs), hash, source) as { id: number };\n    return row.id;\n  }\n\n  private deleteChunksForFile(fileId: number): void {\n    this.db.prepare(\"DELETE FROM chunks WHERE file_id = ?\").run(fileId);\n  }\n\n  private insertChunk(\n    fileId: number,\n    startLine: number,\n    endLine: number,\n    text: string,\n    hash: string,\n  ): void {\n    this.db\n      .prepare(\n        \"INSERT INTO chunks (file_id, start_line, end_line, text, hash) VALUES (?, ?, ?, ?, ?)\",\n      )\n      .run(fileId, startLine, endLine, text, hash);\n  }\n\n  close(): void {\n    this.db.close();\n  }\n}\n\n// Replaced by `sanitizeFts5Query` from `internal/persistence/fts5-sanitize.ts`\n// (T5.2, ADR D64). The new sanitizer is the 6-step port of Hermes'\n// `_sanitize_fts5_query` and handles hyphens/dots/underscores correctly\n// without quoting every token.\n"]}

package/dist/{chunk-JNIWFCKI.js → chunk-4JSZYSGW.js}

@@ -1,4 +1,4 @@
-import { ConfigurationError, isTransientError } from './chunk-CD73YHEH.js';
+import { ConfigurationError, isTransientError } from './chunk-SG5ZWT6C.js';
 
 // src/internal/runtime/retry/with-retry.ts
 function defaultSleep(ms, signal) {
@@ -65,5 +65,5 @@ var Retry = class {
 };
 
 export { Retry };
-//# sourceMappingURL=chunk-JNIWFCKI.js.map
-//# sourceMappingURL=chunk-JNIWFCKI.js.map
+//# sourceMappingURL=chunk-4JSZYSGW.js.map
+//# sourceMappingURL=chunk-4JSZYSGW.js.map

package/dist/{chunk-JNIWFCKI.js.map → chunk-4JSZYSGW.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/internal/runtime/retry/with-retry.ts","../src/retry.ts"],"names":[],"mappings":";;;AAkCA,SAAS,YAAA,CAAa,IAAY,MAAA,EAAqC;AACrE,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,EAAS,MAAA,KAAW;AAC5C,IAAA,IAAI,QAAQ,OAAA,EAAS;AACnB,MAAA,MAAA,CAAO,MAAA,CAAO,kBAAkB,KAAA,GAAQ,MAAA,CAAO,SAAS,IAAI,KAAA,CAAM,oBAAoB,CAAC,CAAA;AACvF,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,EAAQ,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC5C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,SAAS,OAAA,GAAgB;AACvB,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,MAAA,CAAO,MAAA,EAAQ,kBAAkB,KAAA,GAAQ,MAAA,CAAO,SAAS,IAAI,KAAA,CAAM,oBAAoB,CAAC,CAAA;AAAA,IAC1F;AACA,IAAA,MAAA,EAAQ,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC3D,CAAC,CAAA;AACH;AAaA,SAAS,oBAAoB,OAAA,EAAuC;AAClE,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,CAAA;AACpC,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,OAAO,CAAA,IAAK,UAAU,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,0DAA0D,OAAO,CAAA,CAAA;AAAA,MACjE,EAAE,MAAM,sBAAA;AAAuB,KACjC;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,WAAA,EAAa,SAAS,WAAA,IAAe,gBAAA;AAAA,IACrC,cAAA,EAAgB,SAAS,cAAA,IAAkB,GAAA;AAAA,IAC3C,UAAA,EAAY,SAAS,UAAA,IAAc,GAAA;AAAA,IACnC,iBAAA,EAAmB,SAAS,iBAAA,IAAqB,CAAA;AAAA,IACjD,GAAA,EAAK,OAAA,EAAS,GAAA,IAAO,IAAA,CAAK,MAAA;AAAA,IAC1B,KAAA,EAAO,SAAS,KAAA,IAAS,YAAA;AAAA,IACzB,QAAQ,OAAA,EAAS;AAAA,GACnB;AACF;AAGA,SAAS,SAAA,CAAU,KAAoB,OAAA,EAAyB;AAC9D,EAAA,MAAM,OAAA,GAAU,KAAK,GAAA,CAAI,GAAA,CAAI,YAAY,GAAA,CAAI,cAAA,GAAiB,GAAA,CAAI,iBAAA,IAAqB,OAAO,CAAA;AAC9F,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,KAAQ,OAAO,CAAA;AACvC;AAWA,eAAsB,SAAA,CAAa,IAAsB,OAAA,EAAoC;AAC3F,EAAA,MAAM,GAAA,GAAM,oBAAoB,OAAO,CAAA;AACvC,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,WAAS;AACP,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,EAAA,EAAG;AAAA,IAClB,SAAS,GAAA,EAAK;AACZ,MAAA,IAAI,OAAA,IAAW,IAAI,OAAA,IAAW,CAAC,IAAI,WAAA,CAAY,GAAG,GAAG,MAAM,GAAA;AAC3D,MAAA,MAAM,IAAI,KAAA,CAAM,SAAA,CAAU,KAAK,OAAO,CAAA,EAAG,IAAI,MAAM,CAAA;AACnD,MAAA,OAAA,IAAW,CAAA;AAAA,IACb;AAAA,EACF;AACF;;;AC3FO,IAAM,QAAN,MAAY;AAAA,EACT,WAAA,GAAc;AAAA,EAAC;AAAA,EACvB,OAAO,MAAA,CAAU,EAAA,EAAsB,OAAA,EAAoC;AACzE,IAAA,OAAO,SAAA,CAAU,IAAI,OAAO,CAAA;AAAA,EAC9B;AACF","file":"chunk-JNIWFCKI.js","sourcesContent":["/**\n * Generic retry wrapper (plan m0-foundation-expose-primitives, M0-3).\n *\n * Exponential backoff with full jitter, deterministically testable via an\n * injectable `sleep` and `rng` (no real timers in unit tests, per the repo\n * testing rule). The default `isRetryable` predicate is {@link isTransientError}\n * so SDK errors retry exactly as the SDK classifies them. The workflow-internal\n * `withRetry` (RetryPolicy-coupled) is intentionally separate (ADR-M0-3).\n *\n * @internal — public via `@theokit/sdk/retry`\n */\n\nimport { ConfigurationError, isTransientError } from \"../../../errors.js\";\n\n/** Options for {@link withRetry}. All fields optional; sensible defaults applied. */\nexport interface RetryOptions {\n  /** Number of retries after the first attempt (total attempts = retries + 1). Default 3. */\n  retries?: number;\n  /** Predicate deciding whether a thrown error is worth retrying. Default {@link isTransientError}. */\n  isRetryable?: (err: unknown) => boolean;\n  /** Base backoff in ms for the first retry. Default 100. */\n  initialDelayMs?: number;\n  /** Upper bound for a single backoff sleep. Default 30_000. */\n  maxDelayMs?: number;\n  /** Exponential multiplier applied per retry. Default 2. */\n  backoffMultiplier?: number;\n  /** [0, 1) source for full-jitter. Default `Math.random`. Inject for deterministic tests. */\n  rng?: () => number;\n  /** Sleep function. Default a `setTimeout`-based abortable sleep. Inject for deterministic tests. */\n  sleep?: (ms: number, signal?: AbortSignal) => Promise<void>;\n  /** Abort signal; once aborted, the abortable default sleep rejects and the loop stops. */\n  signal?: AbortSignal;\n}\n\nfunction defaultSleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason instanceof Error ? signal.reason : new Error(\"withRetry: aborted\"));\n      return;\n    }\n    const timer = setTimeout(() => {\n      signal?.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    function onAbort(): void {\n      clearTimeout(timer);\n      reject(signal?.reason instanceof Error ? signal.reason : new Error(\"withRetry: aborted\"));\n    }\n    signal?.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n\ninterface ResolvedRetry {\n  retries: number;\n  isRetryable: (err: unknown) => boolean;\n  initialDelayMs: number;\n  maxDelayMs: number;\n  backoffMultiplier: number;\n  rng: () => number;\n  sleep: (ms: number, signal?: AbortSignal) => Promise<void>;\n  signal?: AbortSignal;\n}\n\nfunction resolveRetryOptions(options?: RetryOptions): ResolvedRetry {\n  const retries = options?.retries ?? 3;\n  if (!Number.isInteger(retries) || retries < 0) {\n    throw new ConfigurationError(\n      `withRetry: retries must be a non-negative integer, got ${retries}`,\n      { code: \"invalid_retry_config\" },\n    );\n  }\n  return {\n    retries,\n    isRetryable: options?.isRetryable ?? isTransientError,\n    initialDelayMs: options?.initialDelayMs ?? 100,\n    maxDelayMs: options?.maxDelayMs ?? 30_000,\n    backoffMultiplier: options?.backoffMultiplier ?? 2,\n    rng: options?.rng ?? Math.random,\n    sleep: options?.sleep ?? defaultSleep,\n    signal: options?.signal,\n  };\n}\n\n/** Full-jitter backoff for the given (0-indexed) retry attempt. */\nfunction backoffMs(cfg: ResolvedRetry, attempt: number): number {\n  const ceiling = Math.min(cfg.maxDelayMs, cfg.initialDelayMs * cfg.backoffMultiplier ** attempt);\n  return Math.floor(cfg.rng() * ceiling);\n}\n\n/**\n * Run `fn`, retrying transient failures with exponential backoff + full jitter.\n *\n * @returns the resolved value of the first successful `fn()` call\n * @throws the last error when retries are exhausted or the error is not retryable\n *\n * @example\n *   const data = await withRetry(() => fetchJson(url)); // retries rate-limit/network\n */\nexport async function withRetry<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\n  const cfg = resolveRetryOptions(options);\n  let attempt = 0;\n  for (;;) {\n    try {\n      return await fn();\n    } catch (err) {\n      if (attempt >= cfg.retries || !cfg.isRetryable(err)) throw err;\n      await cfg.sleep(backoffMs(cfg, attempt), cfg.signal);\n      attempt += 1;\n    }\n  }\n}\n","/**\n * Public generic retry primitive (plan m0-foundation-expose-primitives, M0-3).\n *\n * Split into its own top-level module so `tsup` builds a dedicated\n * `@theokit/sdk/retry` sub-path entry, mirroring the `path-safety` pattern.\n * The default retry predicate is `isTransientError`, so retries follow the\n * SDK's own error classification.\n */\n\nimport { type RetryOptions, withRetry } from \"./internal/runtime/retry/with-retry.js\";\n\nexport type { RetryOptions };\n\n/**\n * SE36 — `Retry.create` replaces `withRetry` (ADR 0015 / ADR-P2). NOTE: `withRetry` is an\n * EXECUTOR, not a constructor — `Retry.create(fn, opts)` RUNS `fn` with retry and resolves to\n * its result (`Promise<T>`), not a `Retry` instance. The `.create` name is the uniformity\n * mandate; the executor semantics are the documented, accepted awkwardness. @public\n */\nexport class Retry {\n  private constructor() {}\n  static create<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\n    return withRetry(fn, options);\n  }\n}\n"]}
+{"version":3,"sources":["../src/internal/runtime/retry/with-retry.ts","../src/retry.ts"],"names":[],"mappings":";;;AAkCA,SAAS,YAAA,CAAa,IAAY,MAAA,EAAqC;AACrE,EAAA,OAAO,IAAI,OAAA,CAAc,CAAC,OAAA,EAAS,MAAA,KAAW;AAC5C,IAAA,IAAI,QAAQ,OAAA,EAAS;AACnB,MAAA,MAAA,CAAO,MAAA,CAAO,kBAAkB,KAAA,GAAQ,MAAA,CAAO,SAAS,IAAI,KAAA,CAAM,oBAAoB,CAAC,CAAA;AACvF,MAAA;AAAA,IACF;AACA,IAAA,MAAM,KAAA,GAAQ,WAAW,MAAM;AAC7B,MAAA,MAAA,EAAQ,mBAAA,CAAoB,SAAS,OAAO,CAAA;AAC5C,MAAA,OAAA,EAAQ;AAAA,IACV,GAAG,EAAE,CAAA;AACL,IAAA,SAAS,OAAA,GAAgB;AACvB,MAAA,YAAA,CAAa,KAAK,CAAA;AAClB,MAAA,MAAA,CAAO,MAAA,EAAQ,kBAAkB,KAAA,GAAQ,MAAA,CAAO,SAAS,IAAI,KAAA,CAAM,oBAAoB,CAAC,CAAA;AAAA,IAC1F;AACA,IAAA,MAAA,EAAQ,iBAAiB,OAAA,EAAS,OAAA,EAAS,EAAE,IAAA,EAAM,MAAM,CAAA;AAAA,EAC3D,CAAC,CAAA;AACH;AAaA,SAAS,oBAAoB,OAAA,EAAuC;AAClE,EAAA,MAAM,OAAA,GAAU,SAAS,OAAA,IAAW,CAAA;AACpC,EAAA,IAAI,CAAC,MAAA,CAAO,SAAA,CAAU,OAAO,CAAA,IAAK,UAAU,CAAA,EAAG;AAC7C,IAAA,MAAM,IAAI,kBAAA;AAAA,MACR,0DAA0D,OAAO,CAAA,CAAA;AAAA,MACjE,EAAE,MAAM,sBAAA;AAAuB,KACjC;AAAA,EACF;AACA,EAAA,OAAO;AAAA,IACL,OAAA;AAAA,IACA,WAAA,EAAa,SAAS,WAAA,IAAe,gBAAA;AAAA,IACrC,cAAA,EAAgB,SAAS,cAAA,IAAkB,GAAA;AAAA,IAC3C,UAAA,EAAY,SAAS,UAAA,IAAc,GAAA;AAAA,IACnC,iBAAA,EAAmB,SAAS,iBAAA,IAAqB,CAAA;AAAA,IACjD,GAAA,EAAK,OAAA,EAAS,GAAA,IAAO,IAAA,CAAK,MAAA;AAAA,IAC1B,KAAA,EAAO,SAAS,KAAA,IAAS,YAAA;AAAA,IACzB,QAAQ,OAAA,EAAS;AAAA,GACnB;AACF;AAGA,SAAS,SAAA,CAAU,KAAoB,OAAA,EAAyB;AAC9D,EAAA,MAAM,OAAA,GAAU,KAAK,GAAA,CAAI,GAAA,CAAI,YAAY,GAAA,CAAI,cAAA,GAAiB,GAAA,CAAI,iBAAA,IAAqB,OAAO,CAAA;AAC9F,EAAA,OAAO,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,GAAA,KAAQ,OAAO,CAAA;AACvC;AAWA,eAAsB,SAAA,CAAa,IAAsB,OAAA,EAAoC;AAC3F,EAAA,MAAM,GAAA,GAAM,oBAAoB,OAAO,CAAA;AACvC,EAAA,IAAI,OAAA,GAAU,CAAA;AACd,EAAA,WAAS;AACP,IAAA,IAAI;AACF,MAAA,OAAO,MAAM,EAAA,EAAG;AAAA,IAClB,SAAS,GAAA,EAAK;AACZ,MAAA,IAAI,OAAA,IAAW,IAAI,OAAA,IAAW,CAAC,IAAI,WAAA,CAAY,GAAG,GAAG,MAAM,GAAA;AAC3D,MAAA,MAAM,IAAI,KAAA,CAAM,SAAA,CAAU,KAAK,OAAO,CAAA,EAAG,IAAI,MAAM,CAAA;AACnD,MAAA,OAAA,IAAW,CAAA;AAAA,IACb;AAAA,EACF;AACF;;;AC3FO,IAAM,QAAN,MAAY;AAAA,EACT,WAAA,GAAc;AAAA,EAAC;AAAA,EACvB,OAAO,MAAA,CAAU,EAAA,EAAsB,OAAA,EAAoC;AACzE,IAAA,OAAO,SAAA,CAAU,IAAI,OAAO,CAAA;AAAA,EAC9B;AACF","file":"chunk-4JSZYSGW.js","sourcesContent":["/**\n * Generic retry wrapper (plan m0-foundation-expose-primitives, M0-3).\n *\n * Exponential backoff with full jitter, deterministically testable via an\n * injectable `sleep` and `rng` (no real timers in unit tests, per the repo\n * testing rule). The default `isRetryable` predicate is {@link isTransientError}\n * so SDK errors retry exactly as the SDK classifies them. The workflow-internal\n * `withRetry` (RetryPolicy-coupled) is intentionally separate (ADR-M0-3).\n *\n * @internal — public via `@theokit/sdk/retry`\n */\n\nimport { ConfigurationError, isTransientError } from \"../../../errors.js\";\n\n/** Options for {@link withRetry}. All fields optional; sensible defaults applied. */\nexport interface RetryOptions {\n  /** Number of retries after the first attempt (total attempts = retries + 1). Default 3. */\n  retries?: number;\n  /** Predicate deciding whether a thrown error is worth retrying. Default {@link isTransientError}. */\n  isRetryable?: (err: unknown) => boolean;\n  /** Base backoff in ms for the first retry. Default 100. */\n  initialDelayMs?: number;\n  /** Upper bound for a single backoff sleep. Default 30_000. */\n  maxDelayMs?: number;\n  /** Exponential multiplier applied per retry. Default 2. */\n  backoffMultiplier?: number;\n  /** [0, 1) source for full-jitter. Default `Math.random`. Inject for deterministic tests. */\n  rng?: () => number;\n  /** Sleep function. Default a `setTimeout`-based abortable sleep. Inject for deterministic tests. */\n  sleep?: (ms: number, signal?: AbortSignal) => Promise<void>;\n  /** Abort signal; once aborted, the abortable default sleep rejects and the loop stops. */\n  signal?: AbortSignal;\n}\n\nfunction defaultSleep(ms: number, signal?: AbortSignal): Promise<void> {\n  return new Promise<void>((resolve, reject) => {\n    if (signal?.aborted) {\n      reject(signal.reason instanceof Error ? signal.reason : new Error(\"withRetry: aborted\"));\n      return;\n    }\n    const timer = setTimeout(() => {\n      signal?.removeEventListener(\"abort\", onAbort);\n      resolve();\n    }, ms);\n    function onAbort(): void {\n      clearTimeout(timer);\n      reject(signal?.reason instanceof Error ? signal.reason : new Error(\"withRetry: aborted\"));\n    }\n    signal?.addEventListener(\"abort\", onAbort, { once: true });\n  });\n}\n\ninterface ResolvedRetry {\n  retries: number;\n  isRetryable: (err: unknown) => boolean;\n  initialDelayMs: number;\n  maxDelayMs: number;\n  backoffMultiplier: number;\n  rng: () => number;\n  sleep: (ms: number, signal?: AbortSignal) => Promise<void>;\n  signal?: AbortSignal;\n}\n\nfunction resolveRetryOptions(options?: RetryOptions): ResolvedRetry {\n  const retries = options?.retries ?? 3;\n  if (!Number.isInteger(retries) || retries < 0) {\n    throw new ConfigurationError(\n      `withRetry: retries must be a non-negative integer, got ${retries}`,\n      { code: \"invalid_retry_config\" },\n    );\n  }\n  return {\n    retries,\n    isRetryable: options?.isRetryable ?? isTransientError,\n    initialDelayMs: options?.initialDelayMs ?? 100,\n    maxDelayMs: options?.maxDelayMs ?? 30_000,\n    backoffMultiplier: options?.backoffMultiplier ?? 2,\n    rng: options?.rng ?? Math.random,\n    sleep: options?.sleep ?? defaultSleep,\n    signal: options?.signal,\n  };\n}\n\n/** Full-jitter backoff for the given (0-indexed) retry attempt. */\nfunction backoffMs(cfg: ResolvedRetry, attempt: number): number {\n  const ceiling = Math.min(cfg.maxDelayMs, cfg.initialDelayMs * cfg.backoffMultiplier ** attempt);\n  return Math.floor(cfg.rng() * ceiling);\n}\n\n/**\n * Run `fn`, retrying transient failures with exponential backoff + full jitter.\n *\n * @returns the resolved value of the first successful `fn()` call\n * @throws the last error when retries are exhausted or the error is not retryable\n *\n * @example\n *   const data = await withRetry(() => fetchJson(url)); // retries rate-limit/network\n */\nexport async function withRetry<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\n  const cfg = resolveRetryOptions(options);\n  let attempt = 0;\n  for (;;) {\n    try {\n      return await fn();\n    } catch (err) {\n      if (attempt >= cfg.retries || !cfg.isRetryable(err)) throw err;\n      await cfg.sleep(backoffMs(cfg, attempt), cfg.signal);\n      attempt += 1;\n    }\n  }\n}\n","/**\n * Public generic retry primitive (plan m0-foundation-expose-primitives, M0-3).\n *\n * Split into its own top-level module so `tsup` builds a dedicated\n * `@theokit/sdk/retry` sub-path entry, mirroring the `path-safety` pattern.\n * The default retry predicate is `isTransientError`, so retries follow the\n * SDK's own error classification.\n */\n\nimport { type RetryOptions, withRetry } from \"./internal/runtime/retry/with-retry.js\";\n\nexport type { RetryOptions };\n\n/**\n * SE36 — `Retry.create` replaces `withRetry` (ADR 0015 / ADR-P2). NOTE: `withRetry` is an\n * EXECUTOR, not a constructor — `Retry.create(fn, opts)` RUNS `fn` with retry and resolves to\n * its result (`Promise<T>`), not a `Retry` instance. The `.create` name is the uniformity\n * mandate; the executor semantics are the documented, accepted awkwardness. @public\n */\nexport class Retry {\n  private constructor() {}\n  static create<T>(fn: () => Promise<T>, options?: RetryOptions): Promise<T> {\n    return withRetry(fn, options);\n  }\n}\n"]}

package/dist/{chunk-EEZ7CFMM.js → chunk-5KOW3GLE.js}

@@ -10,5 +10,5 @@ function invalidateSessionCache(cwd, agentId) {
 }
 
 export { hydratedKeys, invalidateSessionCache, sessions, transcriptKey };
-//# sourceMappingURL=chunk-EEZ7CFMM.js.map
-//# sourceMappingURL=chunk-EEZ7CFMM.js.map
+//# sourceMappingURL=chunk-5KOW3GLE.js.map
+//# sourceMappingURL=chunk-5KOW3GLE.js.map

package/dist/chunk-5KOW3GLE.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/session/session-cache.ts"],"names":[],"mappings":";AAgBO,IAAM,QAAA,uBAAe,GAAA;AACrB,IAAM,YAAA,uBAAmB,GAAA;AAGzB,SAAS,aAAA,CAAc,KAAa,OAAA,EAAyB;AAClE,EAAA,OAAO,CAAA,EAAG,GAAG,CAAA,EAAA,EAAK,OAAO,CAAA,CAAA;AAC3B;AAEO,SAAS,sBAAA,CAAuB,KAAa,OAAA,EAAuB;AACzE,EAAA,QAAA,CAAS,OAAO,OAAO,CAAA;AACvB,EAAA,YAAA,CAAa,MAAA,CAAO,aAAA,CAAc,GAAA,EAAK,OAAO,CAAC,CAAA;AACjD","file":"chunk-5KOW3GLE.js","sourcesContent":["import type { SessionMessage } from \"./session-types.js\";\n\n/**\n * The in-memory session cache — in a LEAF module, on purpose.\n *\n * O estado e o invalidador viviam em `agent-session.ts`, e `compact-session.ts` importava\n * `invalidateSessionCache` from there — while `agent-session.ts` imported `autoCompactIfNeeded`\n * back. The cycle was broken at runtime (the return edge is a dynamic `await import()`), but the detector\n * counts the dynamic edge, and counting a dynamic import as a cycle makes the gate impossible to satisfy\n * without abandoning the canonical cycle-breaking technique.\n *\n * This state's natural owner was never `agent-session.ts`: they are two process-wide maps that both\n * modules read. Extracting them into a leaf removes the cycle under ANY detector, with no tool\n * policy and without changing a line of behavior — the same `Map`/`Set` instances remain\n * the only ones in the process, because an ES module is a singleton.\n */\nexport const sessions = new Map<string, SessionMessage[]>();\nexport const hydratedKeys = new Set<string>();\n\n/** The per-(cwd, agentId) transcript key for cache/hydration bookkeeping. */\nexport function transcriptKey(cwd: string, agentId: string): string {\n  return `${cwd}::${agentId}`;\n}\n\nexport function invalidateSessionCache(cwd: string, agentId: string): void {\n  sessions.delete(agentId);\n  hydratedKeys.delete(transcriptKey(cwd, agentId));\n}\n"]}

package/dist/{chunk-6VP3XGEK.js → chunk-65ONFZWM.js}

@@ -1,5 +1,5 @@
-import { TheokitAgentError } from './chunk-CD73YHEH.js';
-import { redactSecrets } from './chunk-TAPQWDW2.js';
+import { TheokitAgentError } from './chunk-SG5ZWT6C.js';
+import { diag, redactSecrets } from './chunk-IVSD7L22.js';
 
 // src/internal/runtime/compression/compression-helpers.ts
 function selectCompressionWindow(messages, preserveLast = 6) {
@@ -71,8 +71,9 @@ async function runSummarize(summarize, head, template, failSafe) {
     return await summarize(head, template);
   } catch (err) {
     if (!failSafe) throw err;
-    console.warn(
-      `[compaction] summarizer failed \u2014 proceeding uncompacted: ${redactSecrets(err instanceof Error ? err.message : String(err))}`
+    diag(
+      `[compaction] summarizer failed \u2014 proceeding uncompacted: ${redactSecrets(err instanceof Error ? err.message : String(err))}
+`
     );
     return FAILSAFE_ABORT;
   }
@@ -128,16 +129,16 @@ var ContextWindowMarginError = class extends TheokitAgentError {
 };
 var CONTEXT_WINDOW_MARGIN = 0.95;
 var CONTEXT_WINDOW_FLOOR = 128e3;
-var TETO_ABSOLUTO_DE_JANELA = 1e7;
+var ABSOLUTE_CONTEXT_WINDOW_CAP = 1e7;
 function resolveEffectiveContextWindow(input) {
   if (!(input.margin > 0) || input.margin > 1) {
     throw new ContextWindowMarginError(input.margin);
   }
   const withMargin = (raw) => Math.floor(raw * input.margin);
   if (input.override !== void 0) {
-    const teto = input.catalog ?? TETO_ABSOLUTO_DE_JANELA;
-    const clamped = input.override > teto;
-    return { window: withMargin(clamped ? teto : input.override), source: "override", clamped };
+    const cap = input.catalog ?? ABSOLUTE_CONTEXT_WINDOW_CAP;
+    const clamped = input.override > cap;
+    return { window: withMargin(clamped ? cap : input.override), source: "override", clamped };
   }
   if (input.catalog !== void 0) {
     return { window: withMargin(input.catalog), source: "catalog", clamped: false };
@@ -151,6 +152,6 @@ function shouldCompact(input) {
   return input.estimated >= input.contextWindow - input.buffer - (input.maxOutput ?? 0);
 }
 
-export { CHECKPOINT_MARKER, CONTEXT_WINDOW_FLOOR, CONTEXT_WINDOW_MARGIN, ContextWindowMarginError, SUMMARY_TEMPLATE, TETO_ABSOLUTO_DE_JANELA, buildCheckpoint, compactTranscript, estimateTokens, filterFromLatestCheckpoint, isContextOverflowError, resolveEffectiveContextWindow, shouldCompact };
-//# sourceMappingURL=chunk-6VP3XGEK.js.map
-//# sourceMappingURL=chunk-6VP3XGEK.js.map
+export { ABSOLUTE_CONTEXT_WINDOW_CAP, CHECKPOINT_MARKER, CONTEXT_WINDOW_FLOOR, CONTEXT_WINDOW_MARGIN, ContextWindowMarginError, SUMMARY_TEMPLATE, buildCheckpoint, compactTranscript, estimateTokens, filterFromLatestCheckpoint, isContextOverflowError, resolveEffectiveContextWindow, shouldCompact };
+//# sourceMappingURL=chunk-65ONFZWM.js.map
+//# sourceMappingURL=chunk-65ONFZWM.js.map

package/dist/chunk-65ONFZWM.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/internal/runtime/compression/compression-helpers.ts","../src/compaction.ts"],"names":[],"mappings":";;;;AA0BO,SAAS,uBAAA,CACd,QAAA,EACA,YAAA,GAAe,CAAA,EACO;AACtB,EAAA,IAAI,QAAA,CAAS,UAAU,YAAA,EAAc;AACnC,IAAA,OAAO,EAAE,YAAY,EAAC,EAAG,YAAY,CAAC,GAAG,QAAQ,CAAA,EAAE;AAAA,EACrD;AACA,EAAA,OAAO;AAAA,IACL,UAAA,EAAY,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,CAAC,YAAY,CAAA;AAAA,IAC3C,UAAA,EAAY,QAAA,CAAS,KAAA,CAAM,CAAC,YAAY;AAAA,GAC1C;AACF;;;ACOO,IAAM,iBAAA,GAAoB;AAQ1B,IAAM,gBAAA,GAAmB,CAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA,4CAAA;AAwBhC,SAAS,aAAa,MAAA,EAAsB;AAC1C,EAAA,IAAI,WAAW,EAAA,EAAI;AACjB,IAAA,MAAM,IAAI,kBAAkB,qCAAA,EAAuC;AAAA,MACjE,IAAA,EAAM;AAAA,KACP,CAAA;AAAA,EACH;AACF;AAGA,SAAS,cAAA,CAAe,SAA8B,MAAA,EAAyB;AAC7E,EAAA,OAAO,QAAQ,IAAA,KAAS,QAAA,IAAY,CAAC,OAAA,CAAQ,OAAA,CAAQ,WAAW,MAAM,CAAA;AACxE;AAcA,SAAS,mBAAA,CACP,UACA,UAAA,EACgE;AAChE,EAAA,IAAI,GAAA,GAAM,CAAA;AACV,EAAA,IAAI,aAAa,QAAA,CAAS,MAAA;AAC1B,EAAA,KAAA,IAAS,IAAI,QAAA,CAAS,MAAA,GAAS,GAAG,CAAA,IAAK,CAAA,EAAG,KAAK,CAAA,EAAG;AAChD,IAAA,GAAA,IAAO,cAAA,CAAe,QAAA,CAAS,CAAC,CAAA,EAAG,WAAW,EAAE,CAAA;AAChD,IAAA,IAAI,GAAA,GAAM,UAAA,IAAc,CAAA,GAAI,QAAA,CAAS,SAAS,CAAA,EAAG;AAC/C,MAAA,UAAA,GAAa,CAAA,GAAI,CAAA;AACjB,MAAA;AAAA,IACF;AACA,IAAA,UAAA,GAAa,CAAA;AAAA,EACf;AACA,EAAA,OAAO,EAAE,IAAA,EAAM,QAAA,CAAS,KAAA,CAAM,CAAA,EAAG,UAAU,CAAA,EAAG,MAAA,EAAQ,QAAA,CAAS,KAAA,CAAM,UAAU,CAAA,EAAE;AACnF;AAGA,SAAS,aAAA,CACP,QAAA,EACA,UAAA,EACA,MAAA,EACiB;AACjB,EAAA,MAAM,aAAA,GAAgB,SAAS,MAAA,CAAO,CAAC,MAAM,cAAA,CAAe,CAAA,EAAG,MAAM,CAAC,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,SAAS,MAAA,CAAO,CAAC,MAAM,CAAC,cAAA,CAAe,CAAA,EAAG,MAAM,CAAC,CAAA;AAC9D,EAAA,MAAM,EAAE,UAAA,EAAY,UAAA,EAAW,GAAI,uBAAA,CAAwB,MAAM,UAAU,CAAA;AAC3E,EAAA,OAAO,EAAE,aAAA,EAAe,IAAA,EAAM,UAAA,EAAY,QAAQ,UAAA,EAAW;AAC/D;AAyBA,IAAM,cAAA,0BAAwB,gBAAgB,CAAA;AAG9C,eAAe,YAAA,CACb,SAAA,EACA,IAAA,EACA,QAAA,EACA,QAAA,EACsD;AACtD,EAAA,IAAI;AACF,IAAA,OAAO,MAAM,SAAA,CAAU,IAAA,EAAM,QAAQ,CAAA;AAAA,EACvC,SAAS,GAAA,EAAK;AACZ,IAAA,IAAI,CAAC,UAAU,MAAM,GAAA;AAOrB,IAAA,IAAA;AAAA,MACE,CAAA,8DAAA,EAA4D,cAAc,GAAA,YAAe,KAAA,GAAQ,IAAI,OAAA,GAAU,MAAA,CAAO,GAAG,CAAC,CAAC;AAAA;AAAA,KAC7H;AACA,IAAA,OAAO,cAAA;AAAA,EACT;AACF;AASA,eAAsB,iBAAA,CACpB,QAAA,EACA,OAAA,GAAoC,EAAC,EACL;AAChC,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,iBAAA;AACjC,EAAA,YAAA,CAAa,MAAM,CAAA;AACnB,EAAA,MAAM,KAAA,GACJ,QAAQ,UAAA,IAAc,IAAA,GAClB,EAAE,aAAA,EAAe,IAAI,GAAG,mBAAA,CAAoB,UAAU,OAAA,CAAQ,UAAU,GAAE,GAC1E,aAAA,CAAc,UAAU,OAAA,CAAQ,UAAA,IAAc,GAAG,MAAM,CAAA;AAC7D,EAAA,IAAI,KAAA,CAAM,IAAA,CAAK,MAAA,KAAW,CAAA,EAAG;AAC3B,IAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AAAA,EACrB;AACA,EAAA,IAAI,CAAC,QAAQ,SAAA,EAAW;AACtB,IAAA,OAAO,CAAC,GAAG,KAAA,CAAM,aAAA,EAAe,GAAG,MAAM,MAAM,CAAA;AAAA,EACjD;AACA,EAAA,MAAM,QAAA,GAAW,QAAQ,eAAA,IAAmB,gBAAA;AAC5C,EAAA,MAAM,UAAU,MAAM,YAAA;AAAA,IACpB,OAAA,CAAQ,SAAA;AAAA,IACR,KAAA,CAAM,IAAA;AAAA,IACN,QAAA;AAAA,IACA,QAAQ,QAAA,IAAY;AAAA,GACtB;AACA,EAAA,IAAI,YAAY,cAAA,EAAgB;AAC9B,IAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AAAA,EACrB;AACA,EAAA,OAAO,CAAC,GAAG,KAAA,CAAM,eAAe,OAAA,EAAS,GAAG,MAAM,MAAM,CAAA;AAC1D;AAMO,SAAS,eAAA,CACd,KAAA,EACA,MAAA,GAAiB,iBAAA,EACI;AACrB,EAAA,YAAA,CAAa,MAAM,CAAA;AACnB,EAAA,OAAO,EAAE,IAAA,EAAM,QAAA,EAAU,OAAA,EAAS,MAAA,IAAU,SAAS,EAAA,CAAA,EAAI;AAC3D;AAkBO,SAAS,0BAAA,CACd,QAAA,EACA,OAAA,GAAmC,EAAC,EACb;AACvB,EAAA,MAAM,MAAA,GAAS,QAAQ,MAAA,IAAU,iBAAA;AACjC,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,OAAA,KAAY,MAAA,GAAS,CAAA,GAAI,CAAA;AAChD,EAAA,KAAA,IAAS,IAAI,QAAA,CAAS,MAAA,GAAS,GAAG,CAAA,IAAK,CAAA,EAAG,KAAK,CAAA,EAAG;AAChD,IAAA,IAAI,SAAS,CAAC,CAAA,EAAG,OAAA,CAAQ,UAAA,CAAW,MAAM,CAAA,EAAG;AAC3C,MAAA,OAAO,QAAA,CAAS,KAAA,CAAM,CAAA,GAAI,MAAM,CAAA;AAAA,IAClC;AAAA,EACF;AACA,EAAA,OAAO,CAAC,GAAG,QAAQ,CAAA;AACrB;AAQO,SAAS,uBAAuB,GAAA,EAAuB;AAC5D,EAAA,OACE,eAAe,iBAAA,KACd,GAAA,CAAI,SAAS,kBAAA,IAAsB,GAAA,CAAI,UAAU,IAAA,KAAS,kBAAA,CAAA;AAE/D;AAOO,IAAM,wBAAA,GAAN,cAAuC,iBAAA,CAAkB;AAAA,EAC9D,YAAqB,MAAA,EAAgB;AACnC,IAAA,KAAA;AAAA,MACE,CAAA,6CAAA,EAAgD,MAAA,CAAO,MAAM,CAAC,CAAA,sFAAA,CAAA;AAAA,MAE9D,EAAE,MAAM,+BAAA;AAAgC,KAC1C;AALmB,IAAA,IAAA,CAAA,MAAA,GAAA,MAAA;AAAA,EAMrB;AAAA,EANqB,MAAA;AAOvB;AAUO,IAAM,qBAAA,GAAwB;AAgB9B,IAAM,oBAAA,GAAuB;AA6D7B,IAAM,2BAAA,GAA8B;AAEpC,SAAS,8BACd,KAAA,EACwB;AACxB,EAAA,IAAI,EAAE,KAAA,CAAM,MAAA,GAAS,CAAA,CAAA,IAAM,KAAA,CAAM,SAAS,CAAA,EAAG;AAC3C,IAAA,MAAM,IAAI,wBAAA,CAAyB,KAAA,CAAM,MAAM,CAAA;AAAA,EACjD;AAEA,EAAA,MAAM,aAAa,CAAC,GAAA,KAAwB,KAAK,KAAA,CAAM,GAAA,GAAM,MAAM,MAAM,CAAA;AAEzE,EAAA,IAAI,KAAA,CAAM,aAAa,MAAA,EAAW;AAYhC,IAAA,MAAM,GAAA,GAAM,MAAM,OAAA,IAAW,2BAAA;AAC7B,IAAA,MAAM,OAAA,GAAU,MAAM,QAAA,GAAW,GAAA;AACjC,IAAA,OAAO,EAAE,MAAA,EAAQ,UAAA,CAAW,OAAA,GAAU,GAAA,GAAM,MAAM,QAAQ,CAAA,EAAG,MAAA,EAAQ,UAAA,EAAY,OAAA,EAAQ;AAAA,EAC3F;AAEA,EAAA,IAAI,KAAA,CAAM,YAAY,MAAA,EAAW;AAC/B,IAAA,OAAO,EAAE,QAAQ,UAAA,CAAW,KAAA,CAAM,OAAO,CAAA,EAAG,MAAA,EAAQ,SAAA,EAAW,OAAA,EAAS,KAAA,EAAM;AAAA,EAChF;AAEA,EAAA,OAAO,EAAE,MAAA,EAAQ,UAAA,CAAW,KAAA,CAAM,KAAA,IAAS,CAAC,CAAA,EAAG,MAAA,EAAQ,UAAA,EAAY,OAAA,EAAS,KAAA,EAAM;AACpF;AAyBO,SAAS,eAAe,IAAA,EAAsB;AACnD,EAAA,OAAO,IAAA,CAAK,IAAA,CAAK,IAAA,CAAK,MAAA,GAAS,CAAC,CAAA;AAClC;AAUO,SAAS,cAAc,KAAA,EAAoC;AAChE,EAAA,OAAO,MAAM,SAAA,IAAa,KAAA,CAAM,gBAAgB,KAAA,CAAM,MAAA,IAAU,MAAM,SAAA,IAAa,CAAA,CAAA;AACrF","file":"chunk-65ONFZWM.js","sourcesContent":["/**\n * Compression helpers (T2.3, ADR D92).\n *\n * Scaffold for future compression LLM integration:\n *   - `selectCompressionWindow` — splits messages into compress/preserve halves\n *   - `assertCompressionReduced` — 10% reduction floor to detect \"compression placebo\"\n *\n * The compression LLM call itself is out of scope for this plan (requires\n * an auxiliary-model ADR). These helpers are used by `Agent.send` when a\n * future iteration adds compression.\n *\n * @internal\n */\n\nexport interface CompressionWindow<M> {\n  toCompress: M[];\n  toPreserve: M[];\n}\n\n/**\n * Split `messages` into the half to compress (older) and the half to\n * preserve verbatim (recent). When `messages.length <= preserveLast`,\n * everything is preserved.\n *\n * @internal\n */\nexport function selectCompressionWindow<M>(\n  messages: readonly M[],\n  preserveLast = 6,\n): CompressionWindow<M> {\n  if (messages.length <= preserveLast) {\n    return { toCompress: [], toPreserve: [...messages] };\n  }\n  return {\n    toCompress: messages.slice(0, -preserveLast),\n    toPreserve: messages.slice(-preserveLast),\n  };\n}\n\nexport interface CompressionCheck {\n  reduced: boolean;\n  reductionPct: number;\n  reason?: string;\n}\n\n/**\n * Check that compression actually reduced token count by at least `minPct`\n * (default 10%). Returns `{ reduced: false }` for spirals-in-formation\n * (compression LLM outputs that grow or barely shrink).\n *\n * @internal\n */\nexport function assertCompressionReduced(\n  before: number,\n  after: number,\n  minPct = 10,\n): CompressionCheck {\n  if (before <= 0) {\n    return { reduced: false, reductionPct: 0, reason: \"before count was zero\" };\n  }\n  const reductionPct = ((before - after) / before) * 100;\n  if (reductionPct >= minPct) {\n    return { reduced: true, reductionPct };\n  }\n  return {\n    reduced: false,\n    reductionPct,\n    reason: `compression reduced ${reductionPct.toFixed(1)}% (< ${minPct}% min). Spiral likely.`,\n  };\n}\n","/**\n * Public compaction / context-management helpers (M2-1, extended V3-3).\n *\n * Promotes the SDK's compaction capability to a public surface so consumers can\n * compact a transcript, mark/filter conversation checkpoints, and detect\n * context-overflow — without reaching into `internal/`.\n *\n * Two recent-window modes (V3-3):\n *  - `keepRecent` (turn-count, default) — keeps the last N turns verbatim and\n *    always preserves leading system PROMPTS; reuses the internal\n *    `selectCompressionWindow` (no second algorithm).\n *  - `keepTokens` (token-budget) — keeps the trailing turns whose accumulated\n *    `estimateTokens` fits the budget (theocode `splitTranscript` semantics). In\n *    this mode leading system prompts are NOT special-cased (D6).\n *\n * Summarization is delegated to a caller-supplied callback (which receives the\n * older window + the summary template). With `failSafe`, a thrown summarizer\n * returns the ORIGINAL transcript + a structured warn (compaction is an\n * optimization, never a cause of data loss); without it, the error propagates.\n *\n * Public from the `@theokit/sdk/compaction` sub-path.\n */\n\nimport { TheokitAgentError } from \"./errors.js\";\nimport { diag } from \"./internal/diagnostics.js\";\nimport { selectCompressionWindow } from \"./internal/runtime/compression/compression-helpers.js\";\nimport { redactSecrets } from \"./internal/security/redact.js\";\n\n/**\n * Minimal message shape for compaction/compression input. THE canonical public origin (leaf type —\n * rollup-plugin-dts cannot re-export types from internal modules into entry bundles; M42 lesson).\n *\n * @public\n */\nexport interface CompressibleMessage {\n  role: \"user\" | \"assistant\" | \"system\";\n  content: string;\n}\n\n/**\n * Sentinel prefix marking a conversation checkpoint turn. A visible, structured,\n * prose-unlikely token (no invisible/control bytes — safe to persist and to read\n * in source). Only {@link buildCheckpoint} should produce content beginning with it.\n */\nexport const CHECKPOINT_MARKER = \"[[theokit:checkpoint]] \";\n\n/**\n * The 7-section summary template handed to the `summarize` callback (theocode\n * parity shape). Every header is always present so the summarizer cannot silently\n * drop a category; the model is told to preserve file paths, commands, and error\n * text verbatim. Override per-call via {@link CompactTranscriptOptions.summaryTemplate}.\n */\nexport const SUMMARY_TEMPLATE = `Summarize the conversation so far into these sections (keep every header even if empty):\n\n## Goal\nWhat the user is ultimately trying to achieve.\n\n## Constraints\nHard requirements, conventions, and rules stated.\n\n## Progress\nWhat has been done so far.\n\n## Decisions\nChoices made and their rationale.\n\n## Next\nThe immediate next steps.\n\n## Critical\nAnything that MUST NOT be forgotten (preserve verbatim: error messages, exact values).\n\n## Files\nFile paths touched or referenced (verbatim).`;\n\n/** Reject an empty marker — it would match every turn via `startsWith(\"\")` (EC-3). */\nfunction assertMarker(marker: string): void {\n  if (marker === \"\") {\n    throw new TheokitAgentError(\"compaction marker must be non-empty\", {\n      code: \"invalid_argument\",\n    });\n  }\n}\n\n/** True for a real system prompt — a `system` turn that is NOT a checkpoint marker. */\nfunction isSystemPrompt(message: CompressibleMessage, marker: string): boolean {\n  return message.role === \"system\" && !message.content.startsWith(marker);\n}\n\n/** Carried split: leading system prompts (preserved), the older window, the verbatim tail. */\ninterface TranscriptSplit {\n  systemPrompts: CompressibleMessage[];\n  head: CompressibleMessage[];\n  recent: CompressibleMessage[];\n}\n\n/**\n * Token-budget split (theocode `splitTranscript`): walk from the END accumulating\n * `estimateTokens` until `keepTokens` is exceeded; everything older is the head.\n * Always keeps ≥ 1 recent turn. No system-prompt special-casing (D6).\n */\nfunction selectByTokenBudget(\n  messages: CompressibleMessage[],\n  keepTokens: number,\n): { head: CompressibleMessage[]; recent: CompressibleMessage[] } {\n  let acc = 0;\n  let splitIndex = messages.length;\n  for (let i = messages.length - 1; i >= 0; i -= 1) {\n    acc += estimateTokens(messages[i]?.content ?? \"\");\n    if (acc > keepTokens && i < messages.length - 1) {\n      splitIndex = i + 1;\n      break;\n    }\n    splitIndex = i;\n  }\n  return { head: messages.slice(0, splitIndex), recent: messages.slice(splitIndex) };\n}\n\n/** Turn-count split (M2): preserve leading system prompts; window the rest by `keepRecent`. */\nfunction splitByRecent(\n  messages: CompressibleMessage[],\n  keepRecent: number,\n  marker: string,\n): TranscriptSplit {\n  const systemPrompts = messages.filter((m) => isSystemPrompt(m, marker));\n  const rest = messages.filter((m) => !isSystemPrompt(m, marker));\n  const { toCompress, toPreserve } = selectCompressionWindow(rest, keepRecent);\n  return { systemPrompts, head: toCompress, recent: toPreserve };\n}\n\n/** Options for {@link compactTranscript}. */\nexport interface CompactTranscriptOptions {\n  /** Trailing turns preserved verbatim by COUNT (default 6). Ignored when `keepTokens` is set. */\n  keepRecent?: number;\n  /**\n   * Trailing turns preserved verbatim by TOKEN BUDGET (theocode mode). When set,\n   * takes precedence over `keepRecent` and disables system-prompt preservation (D6).\n   */\n  keepTokens?: number;\n  /** Checkpoint marker (default {@link CHECKPOINT_MARKER}). Must be non-empty. */\n  marker?: string;\n  /** Summary template passed to `summarize` (default {@link SUMMARY_TEMPLATE}). */\n  summaryTemplate?: string;\n  /** Summarize the older window into one turn; if omitted, the older window is dropped. */\n  summarize?: (older: CompressibleMessage[], template: string) => Promise<CompressibleMessage>;\n  /**\n   * When true, a thrown `summarize` returns the ORIGINAL transcript + a structured\n   * warn (compaction never loses data). Default false: the error propagates.\n   */\n  failSafe?: boolean;\n}\n\n/** Sentinel returned by {@link runSummarize} when fail-safe swallowed a throw. */\nconst FAILSAFE_ABORT = Symbol(\"failsafe-abort\");\n\n/** Run the summarizer; on throw, either propagate or (fail-safe) warn + signal abort. */\nasync function runSummarize(\n  summarize: NonNullable<CompactTranscriptOptions[\"summarize\"]>,\n  head: CompressibleMessage[],\n  template: string,\n  failSafe: boolean,\n): Promise<CompressibleMessage | typeof FAILSAFE_ABORT> {\n  try {\n    return await summarize(head, template);\n  } catch (err) {\n    if (!failSafe) throw err;\n    // Unbreakable Rule 8 — never fail silently. The breadcrumb points at the root\n    // cause when a summarizer fails every turn and context grows unchecked. The\n    // summarizer is caller-supplied, so its error text is routed through\n    // `redactSecrets` (ADR D68 — no unredacted output sink in src/).\n    // theokit#147 — through the interceptable channel. A summarizer failing every turn is exactly\n    // the breadcrumb a TUI host wants in its own panel, not smeared across its alternate screen.\n    diag(\n      `[compaction] summarizer failed — proceeding uncompacted: ${redactSecrets(err instanceof Error ? err.message : String(err))}\\n`,\n    );\n    return FAILSAFE_ABORT;\n  }\n}\n\n/**\n * Compact a transcript. In `keepRecent` mode (default) the last `keepRecent` turns\n * are kept verbatim and leading system PROMPTS preserved; in `keepTokens` mode the\n * trailing turns within the token budget are kept (no system special-casing, D6).\n * The older window is summarized (via `summarize`, receiving the template) or\n * dropped. Never mutates the input.\n */\nexport async function compactTranscript(\n  messages: CompressibleMessage[],\n  options: CompactTranscriptOptions = {},\n): Promise<CompressibleMessage[]> {\n  const marker = options.marker ?? CHECKPOINT_MARKER;\n  assertMarker(marker);\n  const split =\n    options.keepTokens != null\n      ? { systemPrompts: [], ...selectByTokenBudget(messages, options.keepTokens) }\n      : splitByRecent(messages, options.keepRecent ?? 6, marker);\n  if (split.head.length === 0) {\n    return [...messages];\n  }\n  if (!options.summarize) {\n    return [...split.systemPrompts, ...split.recent];\n  }\n  const template = options.summaryTemplate ?? SUMMARY_TEMPLATE;\n  const summary = await runSummarize(\n    options.summarize,\n    split.head,\n    template,\n    options.failSafe ?? false,\n  );\n  if (summary === FAILSAFE_ABORT) {\n    return [...messages];\n  }\n  return [...split.systemPrompts, summary, ...split.recent];\n}\n\n/**\n * Build a checkpoint marker turn (a `system` turn whose content starts with\n * `marker`, default {@link CHECKPOINT_MARKER}). `marker` must be non-empty.\n */\nexport function buildCheckpoint(\n  label?: string,\n  marker: string = CHECKPOINT_MARKER,\n): CompressibleMessage {\n  assertMarker(marker);\n  return { role: \"system\", content: marker + (label ?? \"\") };\n}\n\n/** Options for {@link filterFromLatestCheckpoint}. */\nexport interface FilterCheckpointOptions {\n  /** Marker to scan for (default {@link CHECKPOINT_MARKER}). */\n  marker?: string;\n  /**\n   * `'after'` (default, M2) returns turns AFTER the latest marker (exclusive);\n   * `'from'` (theocode) returns turns FROM the latest marker (inclusive).\n   */\n  include?: \"after\" | \"from\";\n}\n\n/**\n * Return the turns relative to the most recent checkpoint marker (all turns if\n * none). `include: 'after'` (default) excludes the checkpoint; `'from'` includes\n * it (the summary stands in for the pruned head). Never mutates the input.\n */\nexport function filterFromLatestCheckpoint(\n  messages: CompressibleMessage[],\n  options: FilterCheckpointOptions = {},\n): CompressibleMessage[] {\n  const marker = options.marker ?? CHECKPOINT_MARKER;\n  const offset = options.include === \"from\" ? 0 : 1;\n  for (let i = messages.length - 1; i >= 0; i -= 1) {\n    if (messages[i]?.content.startsWith(marker)) {\n      return messages.slice(i + offset);\n    }\n  }\n  return [...messages];\n}\n\n/**\n * True iff `err` is a {@link TheokitAgentError} (or subclass) reporting a\n * context-window-exceeded condition (the typed `context_too_long` code). Reads\n * both `code` (set by provider mappers) and `metadata.code` (the preferred field)\n * — never a brittle message regex.\n */\nexport function isContextOverflowError(err: unknown): boolean {\n  return (\n    err instanceof TheokitAgentError &&\n    (err.code === \"context_too_long\" || err.metadata?.code === \"context_too_long\")\n  );\n}\n\n/**\n * M77 — the margin is outside `(0, 1]`. Typed, because a margin > 1 would GROW the assumed window,\n * which is the unsafe direction: `shouldCompact` is monotonically decreasing in `contextWindow`, so\n * overestimating it makes the trigger fire too late and the context overflow.\n */\nexport class ContextWindowMarginError extends TheokitAgentError {\n  constructor(readonly margin: number) {\n    super(\n      `context-window margin must be in (0, 1], got ${String(margin)}. ` +\n        `A margin above 1 grows the assumed window and delays compaction past the real limit.`,\n      { code: \"invalid_context_window_margin\" },\n    );\n  }\n}\n\n/**\n * M77 — default safety margin on the context window.\n *\n * `0.95` is not a guess: it is the single reference's value. Codex ships\n * `effective_context_window_percent: 95` (`models-manager/src/model_info.rs:158`) and never budgets\n * against 100% of a window. Being MULTIPLICATIVE, it stays conservative at any window size, which a\n * fixed subtraction would not.\n */\nexport const CONTEXT_WINDOW_MARGIN = 0.95;\n\n/**\n * M77 — the floor used ONLY when neither the catalog nor the caller knows the window.\n *\n * Honest about its own weakness. This number has **one** source (the M77 milestone text); the search\n * for a second one failed, because the reference has no fallback at all — Codex returns `Option` and\n * its callers early-return (`core/src/session/turn_context.rs:213`, `core/src/compact_remote.rs:374`).\n *\n * It is conservative only UPWARD. For a model whose real window is larger, budgeting against 128k\n * compacts early — wasteful but safe. For a model whose real window is SMALLER (an 8k or 32k model\n * absent from the catalog), it compacts too late and the context still overflows. That residual risk\n * is real and is why {@link resolveEffectiveContextWindow} never lets this floor compete with a known\n * catalog value, and why the `compaction_fallback` event exists: a surface can show that the budget is\n * a guess instead of the user finding out when the provider rejects the request.\n */\nexport const CONTEXT_WINDOW_FLOOR = 128_000;\n\n/** Where the effective window came from — carried into the M77 structured event. */\nexport type ContextWindowSource = \"override\" | \"catalog\" | \"fallback\";\n\n/** Input to {@link resolveEffectiveContextWindow}. */\nexport interface EffectiveContextWindowInput {\n  /** Caller-supplied window, in tokens. Clamped by `catalog` when both are present. */\n  readonly override?: number | undefined;\n  /** The model's window from the catalog, in tokens. Absent when the model is unknown. */\n  readonly catalog?: number | undefined;\n  /** Safety margin in `(0, 1]`. Codex uses 0.95 (`model_info.rs:158`). */\n  readonly margin: number;\n  /** Conservative floor used ONLY when neither `override` nor `catalog` is available. */\n  readonly floor?: number | undefined;\n}\n\n/** Result of {@link resolveEffectiveContextWindow}. */\nexport interface EffectiveContextWindow {\n  /** The window to budget against, after clamp and margin. */\n  readonly window: number;\n  /** Which input won — `\"fallback\"` means neither override nor catalog was available. */\n  readonly source: ContextWindowSource;\n  /** `true` when an `override` above the catalog window was clamped down to it. */\n  readonly clamped: boolean;\n}\n\n/**\n * Resolve the window to budget against — the fail-SAFE replacement for reading the catalog directly.\n *\n * Today `post-run-lifecycle.ts` reads `getCatalogModelInfo(model)?.limit?.context` and, when that is\n * `undefined`, auto-compaction simply never fires. That is fail-OPEN: the context grows until the\n * provider rejects the request. (The comment there calls it \"fail-safe\" — M77 corrects it.)\n *\n * Three techniques, two of them borrowed from the single reference:\n *\n *  1. **Override, CLAMPED by the catalog** — Codex `models-manager/src/model_info.rs:26-31` lets\n *     config override the window but limits it with `context_window.min(max_context_window)`.\n *     Without the clamp, declaring 999k on a 200k model reopens the overflow through another door.\n *  2. **Multiplicative margin** — Codex `model_info.rs:158` (`effective_context_window_percent: 95`)\n *     never budgets against 100% of the window. Being multiplicative, it is conservative for ANY\n *     window size.\n *  3. **Floor, only when nothing is known** — deliberately NOT a blanket default. A fixed floor is\n *     conservative only upward: applied to a small model it would inflate the assumed window and\n *     reproduce the very fail-open this function exists to close. Hence the floor never competes\n *     with a known catalog value.\n *\n * Pure — no catalog lookup, no I/O. The caller supplies the numbers, mirroring `shouldCompact`.\n */\n/**\n * Absolute cap on a declared context window, applied when no catalog entry exists to compare against.\n *\n * **10M**, not 2M. The first version used 2M on the rationale that it sat \"comfortably above the\n * largest published window\" — adversarial review measured the opposite: Llama 4 Scout publishes\n * **10M**, and it arrives precisely via OpenRouter, the provider **without** a catalog, which is the\n * case this cap exists to cover. The user would have silently lost 80% of the declared window.\n *\n * The cap still serves what motivates it — one extra zero on 400k gives 4M, which passes; two zeros\n * give 40M, which does not. A limit that rejects legitimate configuration is worse than no limit,\n * because failing OPEN is visible when it happens and silently losing 80% is not.\n */\nexport const ABSOLUTE_CONTEXT_WINDOW_CAP = 10_000_000;\n\nexport function resolveEffectiveContextWindow(\n  input: EffectiveContextWindowInput,\n): EffectiveContextWindow {\n  if (!(input.margin > 0) || input.margin > 1) {\n    throw new ContextWindowMarginError(input.margin);\n  }\n\n  const withMargin = (raw: number): number => Math.floor(raw * input.margin);\n\n  if (input.override !== undefined) {\n    // The catalog is the preferred cap; without it the ABSOLUTE cap applies.\n    //\n    // M95 (adversarial review of M94) — the previous version clamped **only** when a catalog entry\n    // existed, and the whole reason the `contextWindow` key exists is the model that has NO entry\n    // (OpenRouter has zero). So the clamp was missing in exactly the case that justifies the\n    // feature, while the documentation — including an already-published CHANGELOG — stated without\n    // qualification that \"declaring 10M does not blow past the provider\".\n    //\n    // The concrete scenario is one extra zero: `context_window = 4000000`. The only guard was a\n    // `.positive().int()`, which sets no upper bound. The agent would never compact until the\n    // provider refused the turn — the silent fail-OPEN that M77 exists to prevent.\n    const cap = input.catalog ?? ABSOLUTE_CONTEXT_WINDOW_CAP;\n    const clamped = input.override > cap;\n    return { window: withMargin(clamped ? cap : input.override), source: \"override\", clamped };\n  }\n\n  if (input.catalog !== undefined) {\n    return { window: withMargin(input.catalog), source: \"catalog\", clamped: false };\n  }\n\n  return { window: withMargin(input.floor ?? 0), source: \"fallback\", clamped: false };\n}\n\n/** Input to {@link shouldCompact}: an estimate, the model's window, and reserved headroom. */\nexport interface ShouldCompactInput {\n  /** Estimated token count of the next request (e.g. from {@link estimateTokens}). */\n  readonly estimated: number;\n  /** The model's total context window, in tokens. */\n  readonly contextWindow: number;\n  /** Tokens to reserve as headroom (output + safety margin). */\n  readonly buffer: number;\n  /**\n   * Tokens reserved for the model's response generation, SEPARATE from `buffer`.\n   * Default 0 — omitting it preserves the legacy\n   * `estimated >= contextWindow - buffer` result.\n   */\n  readonly maxOutput?: number;\n}\n\n/**\n * Tokenizer-free token estimate via the conventional ~4-chars-per-token\n * heuristic: `ceil(text.length / 4)`. `\"\"` → 0; any non-empty text → ≥ 1.\n * A cheap PRE-CALL gate for {@link shouldCompact} — NOT exact tokenization\n * (a consumer needing exactness supplies their own tokenizer). Uses UTF-16\n * `.length` (code units), so multibyte text is approximate.\n */\nexport function estimateTokens(text: string): number {\n  return Math.ceil(text.length / 4);\n}\n\n/**\n * Decide BEFORE sending whether to compact: `true` when the `estimated` token\n * count leaves less than `buffer` headroom in the `contextWindow`\n * (`estimated >= contextWindow - buffer`). A `buffer >= contextWindow`\n * (non-positive threshold) always returns `true`. Pure — the caller supplies\n * the window (e.g. from `resolveModelCapabilities`), keeping this decoupled\n * from the per-model catalog.\n */\nexport function shouldCompact(input: ShouldCompactInput): boolean {\n  return input.estimated >= input.contextWindow - input.buffer - (input.maxOutput ?? 0);\n}\n"]}

package/dist/{chunk-CSZRJ4RE.js → chunk-6EEYRFJC.js}

@@ -1,6 +1,6 @@
-import { atomicWriteText } from './chunk-56OXYUZE.js';
-import { InvalidTaskIdError } from './chunk-CD73YHEH.js';
-import { diag } from './chunk-TAPQWDW2.js';
+import { atomicWriteText } from './chunk-KX7JV5KM.js';
+import { InvalidTaskIdError } from './chunk-SG5ZWT6C.js';
+import { diag } from './chunk-IVSD7L22.js';
 import { mkdirSync, readdirSync } from 'fs';
 import { readFile, unlink } from 'fs/promises';
 import { join } from 'path';
@@ -188,5 +188,5 @@ function getTaskStoreFor(options) {
 }
 
 export { InMemoryTaskStore, JsonFileTaskStore, getTaskStoreFor, isValidTaskId };
-//# sourceMappingURL=chunk-CSZRJ4RE.js.map
-//# sourceMappingURL=chunk-CSZRJ4RE.js.map
+//# sourceMappingURL=chunk-6EEYRFJC.js.map
+//# sourceMappingURL=chunk-6EEYRFJC.js.map

package/dist/{chunk-CSZRJ4RE.js.map → chunk-6EEYRFJC.js.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/types/task.ts","../src/internal/task/store.ts"],"names":[],"mappings":";;;;;;;;AA0IA,IAAM,eAAA,GAAkB,uBAAA;AAGxB,IAAM,iBAAA,GAAoB,CAAC,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AAUxC,SAAS,aAAA,CAAc,IAAY,aAAA,EAAiC;AACzE,EAAA,IAAI,CAAC,eAAA,CAAgB,IAAA,CAAK,EAAE,GAAG,OAAO,KAAA;AACtC,EAAA,IAAI,eAAe,OAAO,IAAA;AAC1B,EAAA,KAAA,MAAW,UAAU,iBAAA,EAAmB;AACtC,IAAA,IAAI,EAAA,CAAG,UAAA,CAAW,MAAM,CAAA,EAAG,OAAO,KAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA;AACT;ACzHA,IAAM,aAAA,GAAgB,GAAA;AACtB,IAAM,kBAAA,GAAqB,GAAA;AAkB3B,SAAS,sBAAsB,EAAA,EAAkB;AAC/C,EAAA,IAAI,CAAC,aAAA;AAAA,IAAc,EAAA;AAAA;AAAA,IAAwB;AAAA,GAAI,EAAG;AAChD,IAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,+BAAA,EAAkC,EAAE,IAAI,EAAE,CAAA;AAAA,EACzE;AACF;AAEA,SAAS,kBAAkB,CAAA,EAAmC;AAC5D,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,UAAA,EAAY,OAAO,CAAA,CAAE,UAAA;AACrC,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,OAAA,EAAS,OAAO,CAAA,CAAE,SAAA;AAClC,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,WAAA,EAAa,OAAO,CAAA,CAAE,WAAA;AACtC,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,WAAW,KAAA,EAA2B;AAC7C,EAAA,OAAO,KAAA,KAAU,UAAA,IAAc,KAAA,KAAU,OAAA,IAAW,KAAA,KAAU,WAAA;AAChE;AAEA,SAAS,YAAA,CAAa,GAAe,MAAA,EAA6B;AAChE,EAAA,IAAI,MAAA,CAAO,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AACvC,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,KAAK,IAAI,MAAA,CAAO,KAAA,GAAQ,CAAC,MAAA,CAAO,KAAK,CAAA;AACzE,EAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA;AAChC;AACA,SAAS,WAAA,CAAY,GAAe,MAAA,EAA6B;AAC/D,EAAA,IAAI,MAAA,CAAO,IAAA,KAAS,MAAA,EAAW,OAAO,IAAA;AACtC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,IAAI,IAAI,MAAA,CAAO,IAAA,GAAO,CAAC,MAAA,CAAO,IAAI,CAAA;AACrE,EAAA,OAAO,KAAA,CAAM,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA;AAC9B;AACA,SAAS,WAAA,CAAY,GAAe,MAAA,EAA6B;AAC/D,EAAA,IAAI,OAAO,cAAA,KAAmB,MAAA,IAAa,EAAE,WAAA,IAAe,MAAA,CAAO,gBAAgB,OAAO,KAAA;AAC1F,EAAA,IAAI,OAAO,eAAA,KAAoB,MAAA,IAAa,EAAE,WAAA,IAAe,MAAA,CAAO,iBAAiB,OAAO,KAAA;AAC5F,EAAA,OAAO,IAAA;AACT;AACA,SAAS,aAAA,CAAc,GAAe,MAAA,EAA6B;AACjE,EAAA,OAAO,YAAA,CAAa,CAAA,EAAG,MAAM,CAAA,IAAK,WAAA,CAAY,GAAG,MAAM,CAAA,IAAK,WAAA,CAAY,CAAA,EAAG,MAAM,CAAA;AACnF;AAEA,SAAS,WAAA,CAAY,QAA8B,MAAA,EAAkC;AACnF,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAA,IAAS,kBAAA;AAC9B,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,IAAI,aAAA,CAAc,CAAA,EAAG,MAAM,CAAA,EAAG;AAC5B,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAIO,IAAM,oBAAN,MAA6C;AAAA,EACjC,GAAA,uBAAU,GAAA,EAAwB;AAAA,EAEnD,MAAM,OAAO,MAAA,EAAmC;AAC9C,IAAA,qBAAA,CAAsB,OAAO,EAAE,CAAA;AAC/B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,EAAA,EAAI,MAAM,CAAA;AAAA,EAChC;AAAA,EAEA,MAAM,MAAA,CAAO,EAAA,EAAY,MAAA,EAAwE;AAC/F,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA;AAChC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAO,QAAQ,CAAA;AAC5B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,EAAA,EAA6C;AACrD,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA;AAAA,EACxB;AAAA,EAEA,MAAM,KAAK,MAAA,EAA2C;AACpD,IAAA,OAAO,WAAA,CAAY,IAAA,CAAK,GAAA,CAAI,MAAA,IAAU,MAAM,CAAA;AAAA,EAC9C;AAAA,EAEA,MAAM,OAAO,EAAA,EAA8B;AACzC,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA;AAAA,EAC3B;AAAA,EAEA,MAAM,uBAAuB,OAAA,EAAkC;AAC7D,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,CAAC,KAAK,IAAA,CAAK,GAAA,CAAI,SAAQ,EAAG;AACxC,MAAA,IAAI,CAAC,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAG;AAC1B,MAAA,MAAM,EAAA,GAAK,kBAAkB,CAAC,CAAA;AAC9B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,GAAK,OAAA,EAAS;AACpC,QAAA,IAAA,CAAK,GAAA,CAAI,OAAO,EAAE,CAAA;AAClB,QAAA,KAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAYO,IAAM,oBAAN,MAA6C;AAAA,EAClD,YAA6B,GAAA,EAAa;AAAb,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AAE3B,IAAA,IAAI;AACF,MAAA,SAAA,CAAU,GAAA,EAAK,EAAE,SAAA,EAAW,IAAA,EAAM,CAAA;AAAA,IACpC,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,MAAM,GAAA;AAAA,IAC9D;AAAA,EACF;AAAA,EAP6B,GAAA;AAAA,EASrB,SAAS,EAAA,EAAoB;AACnC,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,EAAK,CAAA,EAAG,EAAE,CAAA,KAAA,CAAO,CAAA;AAAA,EACpC;AAAA,EAEA,MAAM,OAAO,MAAA,EAAmC;AAC9C,IAAA,qBAAA,CAAsB,OAAO,EAAE,CAAA;AAC/B,IAAA,MAAM,eAAA,CAAgB,KAAK,QAAA,CAAS,MAAA,CAAO,EAAE,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,CAAA;AAAA,EACxE;AAAA,EAEA,MAAM,MAAA,CAAO,EAAA,EAAY,MAAA,EAAwE;AAC/F,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,MAAM,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAClC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAO,QAAQ,CAAA;AAC5B,IAAA,MAAM,eAAA,CAAgB,KAAK,QAAA,CAAS,EAAE,GAAG,IAAA,CAAK,SAAA,CAAU,IAAI,CAAC,CAAA;AAC7D,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,EAAA,EAA6C;AACrD,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,MAAM,MAAM,QAAA,CAAS,KAAK,QAAA,CAAS,EAAE,GAAG,MAAM,CAAA;AACpD,MAAA,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,IACvB,SAAS,GAAA,EAAK;AACZ,MAAA,MAAM,OAAQ,GAAA,CAA8B,IAAA;AAC5C,MAAA,IAAI,IAAA,KAAS,UAAU,OAAO,MAAA;AAE9B,MAAA,IAAA,CAAK,CAAA,4BAAA,EAA+B,EAAE,CAAA,EAAA,EAAM,GAAA,CAAc,OAAO;AAAA,CAAI,CAAA;AACrE,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,MAAA,EAA2C;AACpD,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,WAAA,CAAY,KAAK,GAAG,CAAA;AAAA,IAChC,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,OAAO,EAAC;AAC9D,MAAA,MAAM,GAAA;AAAA,IACR;AAEA,IAAA,MAAM,aAAa,OAAA,CAChB,MAAA,CAAO,CAAC,IAAA,KAAS,KAAK,QAAA,CAAS,OAAO,CAAA,IAAK,CAAC,KAAK,QAAA,CAAS,MAAM,CAAC,CAAA,CACjE,KAAA,CAAM,GAAG,aAAa,CAAA;AAEzB,IAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,GAAA;AAAA,MAC3B,UAAA,CAAW,GAAA,CAAI,OAAO,IAAA,KAAS;AAC7B,QAAA,MAAM,KAAK,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAC,QAAQ,MAAM,CAAA;AACxC,QAAA,IAAI,CAAC,aAAA,CAAc,EAAA,EAAI,IAAI,GAAG,OAAO,MAAA;AACrC,QAAA,OAAO,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,MACpB,CAAC;AAAA,KACH;AACA,IAAA,MAAM,UAAU,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAuB,MAAM,MAAS,CAAA;AACrE,IAAA,OAAO,WAAA,CAAY,SAAS,MAAM,CAAA;AAAA,EACpC;AAAA,EAEA,MAAM,OAAO,EAAA,EAA8B;AACzC,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,EAAE,CAAC,CAAA;AAC9B,MAAA,OAAO,IAAA;AAAA,IACT,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,OAAO,KAAA;AAC7D,MAAA,MAAM,GAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,uBAAuB,OAAA,EAAkC;AAC7D,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,IAAA,CAAK,EAAE,KAAA,EAAO,CAAC,UAAA,EAAY,OAAA,EAAS,WAAW,CAAA,EAAG,KAAA,EAAO,KAAK,CAAA;AACzF,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,MAAM,EAAA,GAAK,kBAAkB,CAAC,CAAA;AAC9B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,GAAK,OAAA,EAAS;AACpC,QAAA,IAAI,MAAM,IAAA,CAAK,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA,EAAG,KAAA,EAAA;AAAA,MAC/B;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAGO,SAAS,gBAAgB,OAAA,EAAsC;AACpE,EAAA,IAAI,OAAA,CAAQ,OAAA,KAAY,QAAA,EAAU,OAAO,IAAI,iBAAA,EAAkB;AAC/D,EAAA,OAAO,IAAI,iBAAA,CAAkB,OAAA,CAAQ,GAAG,CAAA;AAC1C","file":"chunk-CSZRJ4RE.js","sourcesContent":["/**\n * Public type contract for the Task observability registry (ADRs D361-D374).\n *\n * Tasks are an opt-in observability layer over async work in the SDK\n * (`Agent.send`, `Agent.batch`, `Workflow.run`, `Cron` fires). They have\n * a closed 5-state lifecycle (D362), discriminated events (D366), and a\n * pluggable store (D364). The `Task` facade in `task.ts` is the public\n * surface; consumers import these types from `@theokit/sdk`.\n *\n * @public\n */\n\n/**\n * Closed enum of the 5 lifecycle states (D362).\n *\n * Transitions are acyclic:\n *   queued → running → (finished | error | cancelled)\n *   queued → cancelled (direct, no run started)\n */\nexport type TaskState = \"queued\" | \"running\" | \"finished\" | \"error\" | \"cancelled\";\n\n/** Discriminator of the runtime that produced a task (D374). */\nexport type TaskKind = \"run\" | \"batch\" | \"workflow\" | \"cron\" | \"custom\";\n\n/** Discriminated union of task lifecycle events (D366). */\nexport type TaskEvent =\n  | {\n      readonly type: \"submitted\";\n      readonly taskId: string;\n      readonly kind: TaskKind;\n      readonly submittedAt: number;\n      readonly meta?: Record<string, unknown>;\n      /** D372 — flag set on the first yielded event when the ring buffer was at cap. */\n      readonly truncated?: boolean;\n    }\n  | { readonly type: \"started\"; readonly taskId: string; readonly startedAt: number }\n  | {\n      readonly type: \"progress\";\n      readonly taskId: string;\n      readonly at: number;\n      readonly payload: unknown;\n    }\n  | {\n      readonly type: \"finished\";\n      readonly taskId: string;\n      readonly finishedAt: number;\n      readonly result: unknown;\n    }\n  | {\n      readonly type: \"errored\";\n      readonly taskId: string;\n      readonly erroredAt: number;\n      readonly error: { readonly code: string; readonly message: string };\n    }\n  | {\n      readonly type: \"cancelled\";\n      readonly taskId: string;\n      readonly cancelledAt: number;\n      readonly reason?: string;\n    };\n\n/** Public read-only view of a task entry in the registry. */\nexport interface TaskHandle {\n  readonly id: string;\n  readonly kind: TaskKind;\n  readonly state: TaskState;\n  readonly submittedAt: number;\n  readonly startedAt?: number;\n  readonly finishedAt?: number;\n  readonly cancelledAt?: number;\n  readonly erroredAt?: number;\n  readonly result?: unknown;\n  readonly error?: { readonly code: string; readonly message: string };\n  readonly meta?: Record<string, unknown>;\n  /**\n   * EC-7 — cross-process best-effort cancel flag. Set by CLI\n   * `theokit tasks cancel` via JsonFileTaskStore. The owning process\n   * polls at checkpoints and honors via AbortController. Always\n   * `undefined` for in-process cancel paths (which go directly through\n   * AbortController).\n   */\n  readonly cancelRequested?: boolean;\n}\n\n/** Query filter for `Task.list`. */\nexport interface TaskFilter {\n  readonly state?: TaskState | readonly TaskState[];\n  readonly kind?: TaskKind | readonly TaskKind[];\n  readonly submittedAfter?: number;\n  readonly submittedBefore?: number;\n  /** Defaults to 100. JsonFileTaskStore hard-caps loaded entries at 256 (D364). */\n  readonly limit?: number;\n}\n\n/** Options for `Task.submit`. */\nexport interface TaskSubmitOptions {\n  /**\n   * Optional user-supplied ID. Must match grammar `^[a-z0-9][a-z0-9_-]*$`\n   * and MUST NOT start with the reserved prefixes `wf-` / `b-` / `cron-`\n   * (D368, EC-5). When omitted, `crypto.randomUUID()` is used.\n   */\n  readonly id?: string;\n  readonly meta?: Record<string, unknown>;\n  /**\n   * Optional caller-provided AbortSignal. If already aborted at submit\n   * time, the registry short-circuits to `cancelled` without acquiring\n   * a semaphore slot (EC-4).\n   */\n  readonly signal?: AbortSignal;\n  /**\n   * SE2 — an opt-in {@link import(\"./run-events.js\").RunEventSink}. The task's\n   * lifecycle is forwarded to it as typed `task_started` / `task_updated` /\n   * `task_completed` RunEvents, so a caller that spawned the task can observe it\n   * through the same `onRunEvent` channel as the rest of the run. Best-effort (a\n   * throwing sink never breaks the task). The dedicated `Task.subscribe(id)`\n   * channel is unaffected.\n   */\n  readonly onRunEvent?: import(\"./run-events.js\").RunEventSink;\n}\n\n/** Options shape for `TaskStore` factory (D364). */\nexport type TaskStoreOptions =\n  | { readonly backend: \"memory\" }\n  | { readonly backend: \"json\"; readonly dir: string };\n\n/** Result of `Task.cancel` (D365 — idempotent). */\nexport interface TaskCancelResult {\n  readonly cancelled: boolean;\n  readonly alreadyTerminal: boolean;\n}\n\n/**\n * Grammar for user-supplied task IDs (D368).\n * `crypto.randomUUID()` outputs do NOT match this (UUIDs have dashes\n * AND uppercase letters in their canonical form on some Node versions),\n * but the registry normalizes auto-generated IDs to lowercase before\n * insertion, so they pass the same regex.\n */\nconst TASK_ID_GRAMMAR = /^[a-z0-9][a-z0-9_-]*$/;\n\n/** Reserved prefixes for adapter-generated IDs (D368, EC-5). */\nconst RESERVED_PREFIXES = [\"wf-\", \"b-\", \"cron-\"] as const;\n\n/**\n * Validates a task ID against the public grammar + reserved prefixes.\n * Throws `InvalidTaskIdError` from `../errors.js` on rejection.\n *\n * Adapter callers (workflow/batch/cron) MUST set `allowReserved: true`\n * to register their own IDs; user-facing surfaces (`Task.submit`,\n * `agent.send({ task: { id } })`) leave it false.\n */\nexport function isValidTaskId(id: string, allowReserved: boolean): boolean {\n  if (!TASK_ID_GRAMMAR.test(id)) return false;\n  if (allowReserved) return true;\n  for (const prefix of RESERVED_PREFIXES) {\n    if (id.startsWith(prefix)) return false;\n  }\n  return true;\n}\n\n/** Re-exported for adapter implementations + tests. */\nexport const TASK_RESERVED_PREFIXES: readonly string[] = RESERVED_PREFIXES;\n","/**\n * `TaskStore` interface + 2 implementations (ADR D364).\n *\n *   - `InMemoryTaskStore` — default, transient, single-process.\n *   - `JsonFileTaskStore` — opt-in, one JSON file per task under a\n *     dedicated dir; single-process invariant (EC-15 documented).\n *\n * Edge cases absorbed:\n *   - EC-1: constructor auto-creates dir (mkdirSync recursive idempotent).\n *   - EC-2: every method validates the task id against the public\n *     grammar (D368) BEFORE doing any path I/O — path-traversal defense.\n *   - EC-6: `list()` returns `[]` on ENOENT (fresh install path).\n *   - EC-8: `list()` skips `.tmp.*` orphan files left by interrupted\n *     atomic writes.\n *   - EC-14 (DOCUMENT): `list()` JSDoc documents the 256-row hard cap\n *     and the `submittedBefore` paging idiom.\n *   - EC-15 (DOCUMENT): `JsonFileTaskStore` JSDoc documents the\n *     single-process invariant; v0.2 SQLite covers cross-process.\n *\n * @internal\n */\n\nimport { mkdirSync, readdirSync } from \"node:fs\";\nimport { readFile, unlink } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { InvalidTaskIdError } from \"../../errors.js\";\nimport {\n  isValidTaskId,\n  type TaskFilter,\n  type TaskHandle,\n  type TaskState,\n  type TaskStoreOptions,\n} from \"../../types/task.js\";\nimport { diag } from \"../diagnostics.js\";\nimport { atomicWriteText } from \"../persistence/atomic-write.js\";\n\nconst JSON_LOAD_CAP = 256;\nconst DEFAULT_LIST_LIMIT = 100;\n\n/** Storage interface used by `TaskRegistry`. */\nexport interface TaskStore {\n  insert(handle: TaskHandle): Promise<void>;\n  update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined>;\n  get(id: string): Promise<TaskHandle | undefined>;\n  /**\n   * Returns at most `filter.limit ?? 100` matching handles. JsonFile\n   * backend hard-caps loaded entries at 256 — callers needing larger\n   * pages must use `submittedBefore` to walk the timeline.\n   */\n  list(filter: TaskFilter): Promise<TaskHandle[]>;\n  delete(id: string): Promise<boolean>;\n  /** Removes terminal handles whose terminal-timestamp is older than `epochMs`. */\n  evictTerminalOlderThan(epochMs: number): Promise<number>;\n}\n\nfunction assertValidIdForStore(id: string): void {\n  if (!isValidTaskId(id, /* allowReserved */ true)) {\n    throw new InvalidTaskIdError(`store rejects invalid task id: ${id}`, id);\n  }\n}\n\nfunction terminalTimestamp(h: TaskHandle): number | undefined {\n  if (h.state === \"finished\") return h.finishedAt;\n  if (h.state === \"error\") return h.erroredAt;\n  if (h.state === \"cancelled\") return h.cancelledAt;\n  return undefined;\n}\n\nfunction isTerminal(state: TaskState): boolean {\n  return state === \"finished\" || state === \"error\" || state === \"cancelled\";\n}\n\nfunction matchesState(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.state === undefined) return true;\n  const states = Array.isArray(filter.state) ? filter.state : [filter.state];\n  return states.includes(h.state);\n}\nfunction matchesKind(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.kind === undefined) return true;\n  const kinds = Array.isArray(filter.kind) ? filter.kind : [filter.kind];\n  return kinds.includes(h.kind);\n}\nfunction matchesTime(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.submittedAfter !== undefined && h.submittedAt <= filter.submittedAfter) return false;\n  if (filter.submittedBefore !== undefined && h.submittedAt >= filter.submittedBefore) return false;\n  return true;\n}\nfunction matchesFilter(h: TaskHandle, filter: TaskFilter): boolean {\n  return matchesState(h, filter) && matchesKind(h, filter) && matchesTime(h, filter);\n}\n\nfunction applyFilter(values: Iterable<TaskHandle>, filter: TaskFilter): TaskHandle[] {\n  const limit = filter.limit ?? DEFAULT_LIST_LIMIT;\n  const out: TaskHandle[] = [];\n  for (const h of values) {\n    if (matchesFilter(h, filter)) {\n      out.push(h);\n      if (out.length >= limit) break;\n    }\n  }\n  return out;\n}\n\n/* ─── InMemory ─── */\n\nexport class InMemoryTaskStore implements TaskStore {\n  private readonly map = new Map<string, TaskHandle>();\n\n  async insert(handle: TaskHandle): Promise<void> {\n    assertValidIdForStore(handle.id);\n    this.map.set(handle.id, handle);\n  }\n\n  async update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    const existing = this.map.get(id);\n    if (existing === undefined) return undefined;\n    const next = mutate(existing);\n    this.map.set(id, next);\n    return next;\n  }\n\n  async get(id: string): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    return this.map.get(id);\n  }\n\n  async list(filter: TaskFilter): Promise<TaskHandle[]> {\n    return applyFilter(this.map.values(), filter);\n  }\n\n  async delete(id: string): Promise<boolean> {\n    assertValidIdForStore(id);\n    return this.map.delete(id);\n  }\n\n  async evictTerminalOlderThan(epochMs: number): Promise<number> {\n    let count = 0;\n    for (const [id, h] of this.map.entries()) {\n      if (!isTerminal(h.state)) continue;\n      const ts = terminalTimestamp(h);\n      if (ts !== undefined && ts < epochMs) {\n        this.map.delete(id);\n        count++;\n      }\n    }\n    return count;\n  }\n}\n\n/* ─── JsonFile (opt-in) ───\n *\n * IMPORTANT (EC-15): `JsonFileTaskStore` is **single-process**.\n * Concurrent writers from multiple Node processes against the same\n * directory may corrupt entries (atomic-write protects per-file, but\n * the `list()` scan + `update()` read-modify-write cycle is not\n * serialised across processes). Use only when the `TaskRegistry`\n * runs in exactly one process. v0.2 will add a SQLite backend with\n * the same interface for cross-process scenarios (D364 + D61).\n */\nexport class JsonFileTaskStore implements TaskStore {\n  constructor(private readonly dir: string) {\n    // EC-1: idempotent mkdir; ignore EEXIST.\n    try {\n      mkdirSync(dir, { recursive: true });\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code !== \"EEXIST\") throw err;\n    }\n  }\n\n  private filePath(id: string): string {\n    return join(this.dir, `${id}.json`);\n  }\n\n  async insert(handle: TaskHandle): Promise<void> {\n    assertValidIdForStore(handle.id);\n    await atomicWriteText(this.filePath(handle.id), JSON.stringify(handle));\n  }\n\n  async update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    const existing = await this.get(id);\n    if (existing === undefined) return undefined;\n    const next = mutate(existing);\n    await atomicWriteText(this.filePath(id), JSON.stringify(next));\n    return next;\n  }\n\n  async get(id: string): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    try {\n      const raw = await readFile(this.filePath(id), \"utf8\");\n      return JSON.parse(raw) as TaskHandle;\n    } catch (err) {\n      const code = (err as NodeJS.ErrnoException).code;\n      if (code === \"ENOENT\") return undefined;\n      // Corrupt JSON or other I/O error — log + degrade gracefully (D50/EC-7 cache pattern).\n      diag(`[task-store] failed to read ${id}: ${(err as Error).message}\\n`);\n      return undefined;\n    }\n  }\n\n  async list(filter: TaskFilter): Promise<TaskHandle[]> {\n    let entries: string[];\n    try {\n      entries = readdirSync(this.dir);\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === \"ENOENT\") return []; // EC-6\n      throw err;\n    }\n    // EC-8: skip orphan .tmp files left by interrupted atomic writes.\n    const candidates = entries\n      .filter((name) => name.endsWith(\".json\") && !name.includes(\".tmp\"))\n      .slice(0, JSON_LOAD_CAP);\n\n    const loaded = await Promise.all(\n      candidates.map(async (name) => {\n        const id = name.slice(0, -\".json\".length);\n        if (!isValidTaskId(id, true)) return undefined;\n        return this.get(id);\n      }),\n    );\n    const handles = loaded.filter((h): h is TaskHandle => h !== undefined);\n    return applyFilter(handles, filter);\n  }\n\n  async delete(id: string): Promise<boolean> {\n    assertValidIdForStore(id);\n    try {\n      await unlink(this.filePath(id));\n      return true;\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === \"ENOENT\") return false;\n      throw err;\n    }\n  }\n\n  async evictTerminalOlderThan(epochMs: number): Promise<number> {\n    const handles = await this.list({ state: [\"finished\", \"error\", \"cancelled\"], limit: 256 });\n    let count = 0;\n    for (const h of handles) {\n      const ts = terminalTimestamp(h);\n      if (ts !== undefined && ts < epochMs) {\n        if (await this.delete(h.id)) count++;\n      }\n    }\n    return count;\n  }\n}\n\n/** Factory used by `TaskRegistry.configure` (D364). */\nexport function getTaskStoreFor(options: TaskStoreOptions): TaskStore {\n  if (options.backend === \"memory\") return new InMemoryTaskStore();\n  return new JsonFileTaskStore(options.dir);\n}\n"]}
+{"version":3,"sources":["../src/types/task.ts","../src/internal/task/store.ts"],"names":[],"mappings":";;;;;;;;AA0IA,IAAM,eAAA,GAAkB,uBAAA;AAGxB,IAAM,iBAAA,GAAoB,CAAC,KAAA,EAAO,IAAA,EAAM,OAAO,CAAA;AAUxC,SAAS,aAAA,CAAc,IAAY,aAAA,EAAiC;AACzE,EAAA,IAAI,CAAC,eAAA,CAAgB,IAAA,CAAK,EAAE,GAAG,OAAO,KAAA;AACtC,EAAA,IAAI,eAAe,OAAO,IAAA;AAC1B,EAAA,KAAA,MAAW,UAAU,iBAAA,EAAmB;AACtC,IAAA,IAAI,EAAA,CAAG,UAAA,CAAW,MAAM,CAAA,EAAG,OAAO,KAAA;AAAA,EACpC;AACA,EAAA,OAAO,IAAA;AACT;ACzHA,IAAM,aAAA,GAAgB,GAAA;AACtB,IAAM,kBAAA,GAAqB,GAAA;AAkB3B,SAAS,sBAAsB,EAAA,EAAkB;AAC/C,EAAA,IAAI,CAAC,aAAA;AAAA,IAAc,EAAA;AAAA;AAAA,IAAwB;AAAA,GAAI,EAAG;AAChD,IAAA,MAAM,IAAI,kBAAA,CAAmB,CAAA,+BAAA,EAAkC,EAAE,IAAI,EAAE,CAAA;AAAA,EACzE;AACF;AAEA,SAAS,kBAAkB,CAAA,EAAmC;AAC5D,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,UAAA,EAAY,OAAO,CAAA,CAAE,UAAA;AACrC,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,OAAA,EAAS,OAAO,CAAA,CAAE,SAAA;AAClC,EAAA,IAAI,CAAA,CAAE,KAAA,KAAU,WAAA,EAAa,OAAO,CAAA,CAAE,WAAA;AACtC,EAAA,OAAO,MAAA;AACT;AAEA,SAAS,WAAW,KAAA,EAA2B;AAC7C,EAAA,OAAO,KAAA,KAAU,UAAA,IAAc,KAAA,KAAU,OAAA,IAAW,KAAA,KAAU,WAAA;AAChE;AAEA,SAAS,YAAA,CAAa,GAAe,MAAA,EAA6B;AAChE,EAAA,IAAI,MAAA,CAAO,KAAA,KAAU,MAAA,EAAW,OAAO,IAAA;AACvC,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,KAAK,IAAI,MAAA,CAAO,KAAA,GAAQ,CAAC,MAAA,CAAO,KAAK,CAAA;AACzE,EAAA,OAAO,MAAA,CAAO,QAAA,CAAS,CAAA,CAAE,KAAK,CAAA;AAChC;AACA,SAAS,WAAA,CAAY,GAAe,MAAA,EAA6B;AAC/D,EAAA,IAAI,MAAA,CAAO,IAAA,KAAS,MAAA,EAAW,OAAO,IAAA;AACtC,EAAA,MAAM,KAAA,GAAQ,KAAA,CAAM,OAAA,CAAQ,MAAA,CAAO,IAAI,IAAI,MAAA,CAAO,IAAA,GAAO,CAAC,MAAA,CAAO,IAAI,CAAA;AACrE,EAAA,OAAO,KAAA,CAAM,QAAA,CAAS,CAAA,CAAE,IAAI,CAAA;AAC9B;AACA,SAAS,WAAA,CAAY,GAAe,MAAA,EAA6B;AAC/D,EAAA,IAAI,OAAO,cAAA,KAAmB,MAAA,IAAa,EAAE,WAAA,IAAe,MAAA,CAAO,gBAAgB,OAAO,KAAA;AAC1F,EAAA,IAAI,OAAO,eAAA,KAAoB,MAAA,IAAa,EAAE,WAAA,IAAe,MAAA,CAAO,iBAAiB,OAAO,KAAA;AAC5F,EAAA,OAAO,IAAA;AACT;AACA,SAAS,aAAA,CAAc,GAAe,MAAA,EAA6B;AACjE,EAAA,OAAO,YAAA,CAAa,CAAA,EAAG,MAAM,CAAA,IAAK,WAAA,CAAY,GAAG,MAAM,CAAA,IAAK,WAAA,CAAY,CAAA,EAAG,MAAM,CAAA;AACnF;AAEA,SAAS,WAAA,CAAY,QAA8B,MAAA,EAAkC;AACnF,EAAA,MAAM,KAAA,GAAQ,OAAO,KAAA,IAAS,kBAAA;AAC9B,EAAA,MAAM,MAAoB,EAAC;AAC3B,EAAA,KAAA,MAAW,KAAK,MAAA,EAAQ;AACtB,IAAA,IAAI,aAAA,CAAc,CAAA,EAAG,MAAM,CAAA,EAAG;AAC5B,MAAA,GAAA,CAAI,KAAK,CAAC,CAAA;AACV,MAAA,IAAI,GAAA,CAAI,UAAU,KAAA,EAAO;AAAA,IAC3B;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;AAIO,IAAM,oBAAN,MAA6C;AAAA,EACjC,GAAA,uBAAU,GAAA,EAAwB;AAAA,EAEnD,MAAM,OAAO,MAAA,EAAmC;AAC9C,IAAA,qBAAA,CAAsB,OAAO,EAAE,CAAA;AAC/B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,MAAA,CAAO,EAAA,EAAI,MAAM,CAAA;AAAA,EAChC;AAAA,EAEA,MAAM,MAAA,CAAO,EAAA,EAAY,MAAA,EAAwE;AAC/F,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA;AAChC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAO,QAAQ,CAAA;AAC5B,IAAA,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAA,EAAI,IAAI,CAAA;AACrB,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,EAAA,EAA6C;AACrD,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,GAAA,CAAI,EAAE,CAAA;AAAA,EACxB;AAAA,EAEA,MAAM,KAAK,MAAA,EAA2C;AACpD,IAAA,OAAO,WAAA,CAAY,IAAA,CAAK,GAAA,CAAI,MAAA,IAAU,MAAM,CAAA;AAAA,EAC9C;AAAA,EAEA,MAAM,OAAO,EAAA,EAA8B;AACzC,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,OAAO,IAAA,CAAK,GAAA,CAAI,MAAA,CAAO,EAAE,CAAA;AAAA,EAC3B;AAAA,EAEA,MAAM,uBAAuB,OAAA,EAAkC;AAC7D,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,CAAC,EAAA,EAAI,CAAC,KAAK,IAAA,CAAK,GAAA,CAAI,SAAQ,EAAG;AACxC,MAAA,IAAI,CAAC,UAAA,CAAW,CAAA,CAAE,KAAK,CAAA,EAAG;AAC1B,MAAA,MAAM,EAAA,GAAK,kBAAkB,CAAC,CAAA;AAC9B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,GAAK,OAAA,EAAS;AACpC,QAAA,IAAA,CAAK,GAAA,CAAI,OAAO,EAAE,CAAA;AAClB,QAAA,KAAA,EAAA;AAAA,MACF;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAYO,IAAM,oBAAN,MAA6C;AAAA,EAClD,YAA6B,GAAA,EAAa;AAAb,IAAA,IAAA,CAAA,GAAA,GAAA,GAAA;AAE3B,IAAA,IAAI;AACF,MAAA,SAAA,CAAU,GAAA,EAAK,EAAE,SAAA,EAAW,IAAA,EAAM,CAAA;AAAA,IACpC,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,MAAM,GAAA;AAAA,IAC9D;AAAA,EACF;AAAA,EAP6B,GAAA;AAAA,EASrB,SAAS,EAAA,EAAoB;AACnC,IAAA,OAAO,IAAA,CAAK,IAAA,CAAK,GAAA,EAAK,CAAA,EAAG,EAAE,CAAA,KAAA,CAAO,CAAA;AAAA,EACpC;AAAA,EAEA,MAAM,OAAO,MAAA,EAAmC;AAC9C,IAAA,qBAAA,CAAsB,OAAO,EAAE,CAAA;AAC/B,IAAA,MAAM,eAAA,CAAgB,KAAK,QAAA,CAAS,MAAA,CAAO,EAAE,CAAA,EAAG,IAAA,CAAK,SAAA,CAAU,MAAM,CAAC,CAAA;AAAA,EACxE;AAAA,EAEA,MAAM,MAAA,CAAO,EAAA,EAAY,MAAA,EAAwE;AAC/F,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,MAAM,QAAA,GAAW,MAAM,IAAA,CAAK,GAAA,CAAI,EAAE,CAAA;AAClC,IAAA,IAAI,QAAA,KAAa,QAAW,OAAO,MAAA;AACnC,IAAA,MAAM,IAAA,GAAO,OAAO,QAAQ,CAAA;AAC5B,IAAA,MAAM,eAAA,CAAgB,KAAK,QAAA,CAAS,EAAE,GAAG,IAAA,CAAK,SAAA,CAAU,IAAI,CAAC,CAAA;AAC7D,IAAA,OAAO,IAAA;AAAA,EACT;AAAA,EAEA,MAAM,IAAI,EAAA,EAA6C;AACrD,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,MAAM,MAAM,QAAA,CAAS,KAAK,QAAA,CAAS,EAAE,GAAG,MAAM,CAAA;AACpD,MAAA,OAAO,IAAA,CAAK,MAAM,GAAG,CAAA;AAAA,IACvB,SAAS,GAAA,EAAK;AACZ,MAAA,MAAM,OAAQ,GAAA,CAA8B,IAAA;AAC5C,MAAA,IAAI,IAAA,KAAS,UAAU,OAAO,MAAA;AAE9B,MAAA,IAAA,CAAK,CAAA,4BAAA,EAA+B,EAAE,CAAA,EAAA,EAAM,GAAA,CAAc,OAAO;AAAA,CAAI,CAAA;AACrE,MAAA,OAAO,MAAA;AAAA,IACT;AAAA,EACF;AAAA,EAEA,MAAM,KAAK,MAAA,EAA2C;AACpD,IAAA,IAAI,OAAA;AACJ,IAAA,IAAI;AACF,MAAA,OAAA,GAAU,WAAA,CAAY,KAAK,GAAG,CAAA;AAAA,IAChC,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,OAAO,EAAC;AAC9D,MAAA,MAAM,GAAA;AAAA,IACR;AAEA,IAAA,MAAM,aAAa,OAAA,CAChB,MAAA,CAAO,CAAC,IAAA,KAAS,KAAK,QAAA,CAAS,OAAO,CAAA,IAAK,CAAC,KAAK,QAAA,CAAS,MAAM,CAAC,CAAA,CACjE,KAAA,CAAM,GAAG,aAAa,CAAA;AAEzB,IAAA,MAAM,MAAA,GAAS,MAAM,OAAA,CAAQ,GAAA;AAAA,MAC3B,UAAA,CAAW,GAAA,CAAI,OAAO,IAAA,KAAS;AAC7B,QAAA,MAAM,KAAK,IAAA,CAAK,KAAA,CAAM,CAAA,EAAG,CAAC,QAAQ,MAAM,CAAA;AACxC,QAAA,IAAI,CAAC,aAAA,CAAc,EAAA,EAAI,IAAI,GAAG,OAAO,MAAA;AACrC,QAAA,OAAO,IAAA,CAAK,IAAI,EAAE,CAAA;AAAA,MACpB,CAAC;AAAA,KACH;AACA,IAAA,MAAM,UAAU,MAAA,CAAO,MAAA,CAAO,CAAC,CAAA,KAAuB,MAAM,MAAS,CAAA;AACrE,IAAA,OAAO,WAAA,CAAY,SAAS,MAAM,CAAA;AAAA,EACpC;AAAA,EAEA,MAAM,OAAO,EAAA,EAA8B;AACzC,IAAA,qBAAA,CAAsB,EAAE,CAAA;AACxB,IAAA,IAAI;AACF,MAAA,MAAM,MAAA,CAAO,IAAA,CAAK,QAAA,CAAS,EAAE,CAAC,CAAA;AAC9B,MAAA,OAAO,IAAA;AAAA,IACT,SAAS,GAAA,EAAK;AACZ,MAAA,IAAK,GAAA,CAA8B,IAAA,KAAS,QAAA,EAAU,OAAO,KAAA;AAC7D,MAAA,MAAM,GAAA;AAAA,IACR;AAAA,EACF;AAAA,EAEA,MAAM,uBAAuB,OAAA,EAAkC;AAC7D,IAAA,MAAM,OAAA,GAAU,MAAM,IAAA,CAAK,IAAA,CAAK,EAAE,KAAA,EAAO,CAAC,UAAA,EAAY,OAAA,EAAS,WAAW,CAAA,EAAG,KAAA,EAAO,KAAK,CAAA;AACzF,IAAA,IAAI,KAAA,GAAQ,CAAA;AACZ,IAAA,KAAA,MAAW,KAAK,OAAA,EAAS;AACvB,MAAA,MAAM,EAAA,GAAK,kBAAkB,CAAC,CAAA;AAC9B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,EAAA,GAAK,OAAA,EAAS;AACpC,QAAA,IAAI,MAAM,IAAA,CAAK,MAAA,CAAO,CAAA,CAAE,EAAE,CAAA,EAAG,KAAA,EAAA;AAAA,MAC/B;AAAA,IACF;AACA,IAAA,OAAO,KAAA;AAAA,EACT;AACF;AAGO,SAAS,gBAAgB,OAAA,EAAsC;AACpE,EAAA,IAAI,OAAA,CAAQ,OAAA,KAAY,QAAA,EAAU,OAAO,IAAI,iBAAA,EAAkB;AAC/D,EAAA,OAAO,IAAI,iBAAA,CAAkB,OAAA,CAAQ,GAAG,CAAA;AAC1C","file":"chunk-6EEYRFJC.js","sourcesContent":["/**\n * Public type contract for the Task observability registry (ADRs D361-D374).\n *\n * Tasks are an opt-in observability layer over async work in the SDK\n * (`Agent.send`, `Agent.batch`, `Workflow.run`, `Cron` fires). They have\n * a closed 5-state lifecycle (D362), discriminated events (D366), and a\n * pluggable store (D364). The `Task` facade in `task.ts` is the public\n * surface; consumers import these types from `@theokit/sdk`.\n *\n * @public\n */\n\n/**\n * Closed enum of the 5 lifecycle states (D362).\n *\n * Transitions are acyclic:\n *   queued → running → (finished | error | cancelled)\n *   queued → cancelled (direct, no run started)\n */\nexport type TaskState = \"queued\" | \"running\" | \"finished\" | \"error\" | \"cancelled\";\n\n/** Discriminator of the runtime that produced a task (D374). */\nexport type TaskKind = \"run\" | \"batch\" | \"workflow\" | \"cron\" | \"custom\";\n\n/** Discriminated union of task lifecycle events (D366). */\nexport type TaskEvent =\n  | {\n      readonly type: \"submitted\";\n      readonly taskId: string;\n      readonly kind: TaskKind;\n      readonly submittedAt: number;\n      readonly meta?: Record<string, unknown>;\n      /** D372 — flag set on the first yielded event when the ring buffer was at cap. */\n      readonly truncated?: boolean;\n    }\n  | { readonly type: \"started\"; readonly taskId: string; readonly startedAt: number }\n  | {\n      readonly type: \"progress\";\n      readonly taskId: string;\n      readonly at: number;\n      readonly payload: unknown;\n    }\n  | {\n      readonly type: \"finished\";\n      readonly taskId: string;\n      readonly finishedAt: number;\n      readonly result: unknown;\n    }\n  | {\n      readonly type: \"errored\";\n      readonly taskId: string;\n      readonly erroredAt: number;\n      readonly error: { readonly code: string; readonly message: string };\n    }\n  | {\n      readonly type: \"cancelled\";\n      readonly taskId: string;\n      readonly cancelledAt: number;\n      readonly reason?: string;\n    };\n\n/** Public read-only view of a task entry in the registry. */\nexport interface TaskHandle {\n  readonly id: string;\n  readonly kind: TaskKind;\n  readonly state: TaskState;\n  readonly submittedAt: number;\n  readonly startedAt?: number;\n  readonly finishedAt?: number;\n  readonly cancelledAt?: number;\n  readonly erroredAt?: number;\n  readonly result?: unknown;\n  readonly error?: { readonly code: string; readonly message: string };\n  readonly meta?: Record<string, unknown>;\n  /**\n   * EC-7 — cross-process best-effort cancel flag. Set by CLI\n   * `theokit tasks cancel` via JsonFileTaskStore. The owning process\n   * polls at checkpoints and honors via AbortController. Always\n   * `undefined` for in-process cancel paths (which go directly through\n   * AbortController).\n   */\n  readonly cancelRequested?: boolean;\n}\n\n/** Query filter for `Task.list`. */\nexport interface TaskFilter {\n  readonly state?: TaskState | readonly TaskState[];\n  readonly kind?: TaskKind | readonly TaskKind[];\n  readonly submittedAfter?: number;\n  readonly submittedBefore?: number;\n  /** Defaults to 100. JsonFileTaskStore hard-caps loaded entries at 256 (D364). */\n  readonly limit?: number;\n}\n\n/** Options for `Task.submit`. */\nexport interface TaskSubmitOptions {\n  /**\n   * Optional user-supplied ID. Must match grammar `^[a-z0-9][a-z0-9_-]*$`\n   * and MUST NOT start with the reserved prefixes `wf-` / `b-` / `cron-`\n   * (D368, EC-5). When omitted, `crypto.randomUUID()` is used.\n   */\n  readonly id?: string;\n  readonly meta?: Record<string, unknown>;\n  /**\n   * Optional caller-provided AbortSignal. If already aborted at submit\n   * time, the registry short-circuits to `cancelled` without acquiring\n   * a semaphore slot (EC-4).\n   */\n  readonly signal?: AbortSignal;\n  /**\n   * SE2 — an opt-in {@link import(\"./run-events.js\").RunEventSink}. The task's\n   * lifecycle is forwarded to it as typed `task_started` / `task_updated` /\n   * `task_completed` RunEvents, so a caller that spawned the task can observe it\n   * through the same `onRunEvent` channel as the rest of the run. Best-effort (a\n   * throwing sink never breaks the task). The dedicated `Task.subscribe(id)`\n   * channel is unaffected.\n   */\n  readonly onRunEvent?: import(\"./run-events.js\").RunEventSink;\n}\n\n/** Options shape for `TaskStore` factory (D364). */\nexport type TaskStoreOptions =\n  | { readonly backend: \"memory\" }\n  | { readonly backend: \"json\"; readonly dir: string };\n\n/** Result of `Task.cancel` (D365 — idempotent). */\nexport interface TaskCancelResult {\n  readonly cancelled: boolean;\n  readonly alreadyTerminal: boolean;\n}\n\n/**\n * Grammar for user-supplied task IDs (D368).\n * `crypto.randomUUID()` outputs do NOT match this (UUIDs have dashes\n * AND uppercase letters in their canonical form on some Node versions),\n * but the registry normalizes auto-generated IDs to lowercase before\n * insertion, so they pass the same regex.\n */\nconst TASK_ID_GRAMMAR = /^[a-z0-9][a-z0-9_-]*$/;\n\n/** Reserved prefixes for adapter-generated IDs (D368, EC-5). */\nconst RESERVED_PREFIXES = [\"wf-\", \"b-\", \"cron-\"] as const;\n\n/**\n * Validates a task ID against the public grammar + reserved prefixes.\n * Throws `InvalidTaskIdError` from `../errors.js` on rejection.\n *\n * Adapter callers (workflow/batch/cron) MUST set `allowReserved: true`\n * to register their own IDs; user-facing surfaces (`Task.submit`,\n * `agent.send({ task: { id } })`) leave it false.\n */\nexport function isValidTaskId(id: string, allowReserved: boolean): boolean {\n  if (!TASK_ID_GRAMMAR.test(id)) return false;\n  if (allowReserved) return true;\n  for (const prefix of RESERVED_PREFIXES) {\n    if (id.startsWith(prefix)) return false;\n  }\n  return true;\n}\n\n/** Re-exported for adapter implementations + tests. */\nexport const TASK_RESERVED_PREFIXES: readonly string[] = RESERVED_PREFIXES;\n","/**\n * `TaskStore` interface + 2 implementations (ADR D364).\n *\n *   - `InMemoryTaskStore` — default, transient, single-process.\n *   - `JsonFileTaskStore` — opt-in, one JSON file per task under a\n *     dedicated dir; single-process invariant (EC-15 documented).\n *\n * Edge cases absorbed:\n *   - EC-1: constructor auto-creates dir (mkdirSync recursive idempotent).\n *   - EC-2: every method validates the task id against the public\n *     grammar (D368) BEFORE doing any path I/O — path-traversal defense.\n *   - EC-6: `list()` returns `[]` on ENOENT (fresh install path).\n *   - EC-8: `list()` skips `.tmp.*` orphan files left by interrupted\n *     atomic writes.\n *   - EC-14 (DOCUMENT): `list()` JSDoc documents the 256-row hard cap\n *     and the `submittedBefore` paging idiom.\n *   - EC-15 (DOCUMENT): `JsonFileTaskStore` JSDoc documents the\n *     single-process invariant; v0.2 SQLite covers cross-process.\n *\n * @internal\n */\n\nimport { mkdirSync, readdirSync } from \"node:fs\";\nimport { readFile, unlink } from \"node:fs/promises\";\nimport { join } from \"node:path\";\n\nimport { InvalidTaskIdError } from \"../../errors.js\";\nimport {\n  isValidTaskId,\n  type TaskFilter,\n  type TaskHandle,\n  type TaskState,\n  type TaskStoreOptions,\n} from \"../../types/task.js\";\nimport { diag } from \"../diagnostics.js\";\nimport { atomicWriteText } from \"../persistence/atomic-write.js\";\n\nconst JSON_LOAD_CAP = 256;\nconst DEFAULT_LIST_LIMIT = 100;\n\n/** Storage interface used by `TaskRegistry`. */\nexport interface TaskStore {\n  insert(handle: TaskHandle): Promise<void>;\n  update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined>;\n  get(id: string): Promise<TaskHandle | undefined>;\n  /**\n   * Returns at most `filter.limit ?? 100` matching handles. JsonFile\n   * backend hard-caps loaded entries at 256 — callers needing larger\n   * pages must use `submittedBefore` to walk the timeline.\n   */\n  list(filter: TaskFilter): Promise<TaskHandle[]>;\n  delete(id: string): Promise<boolean>;\n  /** Removes terminal handles whose terminal-timestamp is older than `epochMs`. */\n  evictTerminalOlderThan(epochMs: number): Promise<number>;\n}\n\nfunction assertValidIdForStore(id: string): void {\n  if (!isValidTaskId(id, /* allowReserved */ true)) {\n    throw new InvalidTaskIdError(`store rejects invalid task id: ${id}`, id);\n  }\n}\n\nfunction terminalTimestamp(h: TaskHandle): number | undefined {\n  if (h.state === \"finished\") return h.finishedAt;\n  if (h.state === \"error\") return h.erroredAt;\n  if (h.state === \"cancelled\") return h.cancelledAt;\n  return undefined;\n}\n\nfunction isTerminal(state: TaskState): boolean {\n  return state === \"finished\" || state === \"error\" || state === \"cancelled\";\n}\n\nfunction matchesState(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.state === undefined) return true;\n  const states = Array.isArray(filter.state) ? filter.state : [filter.state];\n  return states.includes(h.state);\n}\nfunction matchesKind(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.kind === undefined) return true;\n  const kinds = Array.isArray(filter.kind) ? filter.kind : [filter.kind];\n  return kinds.includes(h.kind);\n}\nfunction matchesTime(h: TaskHandle, filter: TaskFilter): boolean {\n  if (filter.submittedAfter !== undefined && h.submittedAt <= filter.submittedAfter) return false;\n  if (filter.submittedBefore !== undefined && h.submittedAt >= filter.submittedBefore) return false;\n  return true;\n}\nfunction matchesFilter(h: TaskHandle, filter: TaskFilter): boolean {\n  return matchesState(h, filter) && matchesKind(h, filter) && matchesTime(h, filter);\n}\n\nfunction applyFilter(values: Iterable<TaskHandle>, filter: TaskFilter): TaskHandle[] {\n  const limit = filter.limit ?? DEFAULT_LIST_LIMIT;\n  const out: TaskHandle[] = [];\n  for (const h of values) {\n    if (matchesFilter(h, filter)) {\n      out.push(h);\n      if (out.length >= limit) break;\n    }\n  }\n  return out;\n}\n\n/* ─── InMemory ─── */\n\nexport class InMemoryTaskStore implements TaskStore {\n  private readonly map = new Map<string, TaskHandle>();\n\n  async insert(handle: TaskHandle): Promise<void> {\n    assertValidIdForStore(handle.id);\n    this.map.set(handle.id, handle);\n  }\n\n  async update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    const existing = this.map.get(id);\n    if (existing === undefined) return undefined;\n    const next = mutate(existing);\n    this.map.set(id, next);\n    return next;\n  }\n\n  async get(id: string): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    return this.map.get(id);\n  }\n\n  async list(filter: TaskFilter): Promise<TaskHandle[]> {\n    return applyFilter(this.map.values(), filter);\n  }\n\n  async delete(id: string): Promise<boolean> {\n    assertValidIdForStore(id);\n    return this.map.delete(id);\n  }\n\n  async evictTerminalOlderThan(epochMs: number): Promise<number> {\n    let count = 0;\n    for (const [id, h] of this.map.entries()) {\n      if (!isTerminal(h.state)) continue;\n      const ts = terminalTimestamp(h);\n      if (ts !== undefined && ts < epochMs) {\n        this.map.delete(id);\n        count++;\n      }\n    }\n    return count;\n  }\n}\n\n/* ─── JsonFile (opt-in) ───\n *\n * IMPORTANT (EC-15): `JsonFileTaskStore` is **single-process**.\n * Concurrent writers from multiple Node processes against the same\n * directory may corrupt entries (atomic-write protects per-file, but\n * the `list()` scan + `update()` read-modify-write cycle is not\n * serialised across processes). Use only when the `TaskRegistry`\n * runs in exactly one process. v0.2 will add a SQLite backend with\n * the same interface for cross-process scenarios (D364 + D61).\n */\nexport class JsonFileTaskStore implements TaskStore {\n  constructor(private readonly dir: string) {\n    // EC-1: idempotent mkdir; ignore EEXIST.\n    try {\n      mkdirSync(dir, { recursive: true });\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code !== \"EEXIST\") throw err;\n    }\n  }\n\n  private filePath(id: string): string {\n    return join(this.dir, `${id}.json`);\n  }\n\n  async insert(handle: TaskHandle): Promise<void> {\n    assertValidIdForStore(handle.id);\n    await atomicWriteText(this.filePath(handle.id), JSON.stringify(handle));\n  }\n\n  async update(id: string, mutate: (h: TaskHandle) => TaskHandle): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    const existing = await this.get(id);\n    if (existing === undefined) return undefined;\n    const next = mutate(existing);\n    await atomicWriteText(this.filePath(id), JSON.stringify(next));\n    return next;\n  }\n\n  async get(id: string): Promise<TaskHandle | undefined> {\n    assertValidIdForStore(id);\n    try {\n      const raw = await readFile(this.filePath(id), \"utf8\");\n      return JSON.parse(raw) as TaskHandle;\n    } catch (err) {\n      const code = (err as NodeJS.ErrnoException).code;\n      if (code === \"ENOENT\") return undefined;\n      // Corrupt JSON or other I/O error — log + degrade gracefully (D50/EC-7 cache pattern).\n      diag(`[task-store] failed to read ${id}: ${(err as Error).message}\\n`);\n      return undefined;\n    }\n  }\n\n  async list(filter: TaskFilter): Promise<TaskHandle[]> {\n    let entries: string[];\n    try {\n      entries = readdirSync(this.dir);\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === \"ENOENT\") return []; // EC-6\n      throw err;\n    }\n    // EC-8: skip orphan .tmp files left by interrupted atomic writes.\n    const candidates = entries\n      .filter((name) => name.endsWith(\".json\") && !name.includes(\".tmp\"))\n      .slice(0, JSON_LOAD_CAP);\n\n    const loaded = await Promise.all(\n      candidates.map(async (name) => {\n        const id = name.slice(0, -\".json\".length);\n        if (!isValidTaskId(id, true)) return undefined;\n        return this.get(id);\n      }),\n    );\n    const handles = loaded.filter((h): h is TaskHandle => h !== undefined);\n    return applyFilter(handles, filter);\n  }\n\n  async delete(id: string): Promise<boolean> {\n    assertValidIdForStore(id);\n    try {\n      await unlink(this.filePath(id));\n      return true;\n    } catch (err) {\n      if ((err as NodeJS.ErrnoException).code === \"ENOENT\") return false;\n      throw err;\n    }\n  }\n\n  async evictTerminalOlderThan(epochMs: number): Promise<number> {\n    const handles = await this.list({ state: [\"finished\", \"error\", \"cancelled\"], limit: 256 });\n    let count = 0;\n    for (const h of handles) {\n      const ts = terminalTimestamp(h);\n      if (ts !== undefined && ts < epochMs) {\n        if (await this.delete(h.id)) count++;\n      }\n    }\n    return count;\n  }\n}\n\n/** Factory used by `TaskRegistry.configure` (D364). */\nexport function getTaskStoreFor(options: TaskStoreOptions): TaskStore {\n  if (options.backend === \"memory\") return new InMemoryTaskStore();\n  return new JsonFileTaskStore(options.dir);\n}\n"]}