@fgv/ts-agent-memory 5.1.0-36

package/lib/packlets/store/fileTreeMemoryStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fileTreeMemoryStore.js","sourceRoot":"","sources":["../../../src/packlets/store/fileTreeMemoryStore.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAiF;AACjF,oDAA6C;AAC7C,oCAekB;AAClB,8CAA0G;AAC1G,oCAA2E;AAQ3E,mDAA6D;AAE7D,sDAAsD;AACtD,MAAM,qBAAqB,GAAW,KAAK,CAAC;AA8J5C;;;;;;;;;;;GAWG;AACH,MAAa,mBAAmB;IA8C9B,YAAoB,MAAuB;QACzC,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC;QAC3C,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,aAAa,CAAC;QAC3C,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,eAAI,CAAC,eAAe,EAAE,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,WAAW,CAAC;QACvC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,MAAwC;QAC3D,OAAO,0BAAkB,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,aAAa,EAAE,EAAE,CAC7D,mBAAW,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;;YACvC,MAAM,KAAK,GAAwB,IAAI,mBAAmB,CAAC;gBACzD,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ;gBACzB,aAAa,EAAE,MAAA,MAAM,CAAC,aAAa,mCAAI,IAAI,GAAG,EAAsB;gBACpE,MAAM,EAAE,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,GAAG,EAAwB;gBACxD,YAAY,EAAE,MAAM,CAAC,YAAY;gBACjC,aAAa;gBACb,aAAa,EAAE,MAAA,MAAM,CAAC,aAAa,mCAAI,0CAA0B;gBACjE,KAAK,EAAE,MAAA,MAAM,CAAC,KAAK,mCAAI,IAAI,CAAC,GAAG;gBAC/B,KAAK;gBACL,SAAS,EAAE,MAAA,MAAM,CAAC,SAAS,mCAAI,EAAE;gBACjC,MAAM,EAAE,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,kBAAO,CAAC,UAAU,EAAE;gBACjD,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,KAAK,EAAE,MAAM,CAAC,KAAK;aACpB,CAAC,CAAC;YACH,OAAO,KAAK,CAAC,aAAa,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED,qCAAqC;IAC9B,KAAK,CAAC,GAAG,CAAC,IAAU,EAAE,QAAkB;;QAC7C,MAAM,MAAM,GAA+C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAClG,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;YACxC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,OAAO,IAAA,eAAI,EAAC,eAAe,QAAQ,gDAAgD,CAAC,CAAC;YACvF,CAAC;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACnD,CAAC,CAAC,CACH,CAAC;QACF,MAAM,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE;YAClD,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACnD,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAA,MAAM,CAAC,KAAK,0CAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS;YAC9D,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;SACvD,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,yCAAyC;IAClC,KAAK,CAAC,OAAO,CAClB,KAAqB,EACrB,EAAY;QAEZ,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,sCAAsC;IAC/B,KAAK,CAAC,IAAI,CAAC,MAA+B;QAC/C,MAAM,OAAO,GAA6B,IAAI,CAAC,MAAM;aAClD,OAAO,EAAE;aACT,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YAChB,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,KAAK,MAAK,SAAS,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,EAAE,CAAC;gBAChE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,IAAI,MAAK,SAAS,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC7E,OAAO,KAAK,CAAC;YACf,CAAC;YACD,IAAI,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,GAAG,MAAK,SAAS,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBAClF,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;aACD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChC,OAAO,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,qCAAqC;IAC9B,KAAK,CAAC,GAAG,CAAC,MAA8B;QAC7C,MAAM,MAAM,GAAwB,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACvF,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE;YACnF,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACnD,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;YAC7E,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,UAAU;YACtC,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;SACvD,CAAC,CAAC;QACH,sEAAsE;QACtE,uEAAuE;QACvE,uEAAuE;QACvE,yEAAyE;QACzE,mEAAmE;QACnE,0CAA0C;QAC1C,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBAC7C,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE;oBACpF,OAAO,EAAE,SAAS;oBAClB,EAAE,EAAE,SAAS;iBACd,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,wCAAwC;IACjC,KAAK,CAAC,MAAM,CAAC,IAAU,EAAE,QAAkB;QAChD,MAAM,MAAM,GAAqB,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC/F,MAAM,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE;YACpD,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;YACnD,EAAE,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;YACjD,KAAK,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;SACvD,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACK,QAAQ,CAAI,IAA8B;QAChD,MAAM,MAAM,GAAuB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,IAAI,CAC3B,GAAG,EAAE,CAAC,SAAS,EACf,GAAG,EAAE,CAAC,SAAS,CAChB,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,gBAAgB,CAC5B,KAA6B,EAC7B,IAAU,EACV,QAAkB,EAClB,OAKC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,OAAO;QACT,CAAC;QACD,MAAM,MAAM,GAA6B;YACvC,GAAG,EAAE,EAAE,IAAI,CAAC,eAAe;YAC3B,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE;YACxB,KAAK;YACL,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC;YAC5C,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,IAAI;YACJ,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,UAAU,EAAE,OAAO,CAAC,UAAU;SAC/B,CAAC;QACF,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACvC,IAAI,QAAQ,CAAC,aAAa,KAAK,IAAI,EAAE,CAAC;gBACpC,wEAAwE;gBACxE,kEAAkE;gBAClE,sEAAsE;gBACtE,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;YAC7D,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,+EAA+E;IACvE,KAAK,CAAC,YAAY,CAAC,QAAyB,EAAE,MAAgC;QACpF,IAAI,CAAC;YACH,MAAM,QAAQ,GAAoB,MAAM,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACjE,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,cAAc,CAAC,uCAAuC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,CAAC,sCAAsC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,cAAc,CAAC,OAAe;QACpC,IAAI,CAAC;YACH,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7B,CAAC;QAAC,WAAM,CAAC;YACP,0DAA0D;QAC5D,CAAC;IACH,CAAC;IAED,qFAAqF;IAC7E,gBAAgB,CAAC,IAAU,EAAE,QAAkB;QACrD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;aACxB,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAC5C,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACxC,SAAS,EAAE,CAAC;IACjB,CAAC;IAEO,KAAK,CAAC,UAAU,CAAC,MAA8B;QACrD,MAAM,QAAQ,GAAoB,MAAM,CAAC,QAAQ,CAAC;QAClD,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO,IAAA,eAAI,EACT,eAAe,QAAQ,CAAC,EAAE,uDAAuD,OAAO,MAAM,CAAC,IAAI,GAAG,CACvG,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAW,MAAM,CAAC,IAAI,CAAC;QACjC,4EAA4E;QAC5E,4EAA4E;QAC5E,uEAAuE;QACvE,qEAAqE;QACrE,OAAO,IAAI,CAAC,SAAS;aAClB,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;aAC5B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,QAAQ,CAAC,EAAE,oBAAoB,GAAG,EAAE,CAAC;aAC7E,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;aAC9C,SAAS,CACR,CAAC,KAAK,EAAiC,EAAE,CACvC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAiC,EAAE;YAChF,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,OAAO,IAAA,eAAI,EAAC,eAAe,QAAQ,CAAC,QAAQ,gDAAgD,CAAC,CAAC;YAChG,CAAC;YACD,IAAI,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChC,OAAO,IAAA,eAAI,EACT,4BAA4B,QAAQ,CAAC,EAAE,wCAAwC,IAAI,CAAC,MAAM,GAAG,CAC9F,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAC/E,IAAA,kBAAO,EAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAC1D,CAAC;QACJ,CAAC,CAAC,CACL;aACA,aAAa,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC1B,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,CAClF,CAAC;IACN,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,cAAc,CAC1B,MAA8B,EAC9B,IAAY,EACZ,KAAqB,EACrB,MAAc,EACd,IAAY;;QAEZ,MAAM,MAAM,GAAiB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnE,MAAM,UAAU,GAAe,MAAA,MAAM,CAAC,UAAU,mCAAI,2BAAmB,CAAC;QACxE,uEAAuE;QACvE,gBAAgB;QAChB,2EAA2E;QAC3E,uEAAuE;QACvE,8EAA8E;QAC9E,8EAA8E;QAC9E,2EAA2E;QAC3E,oEAAoE;QACpE,qBAAqB;QACrB,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAuC,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC3F,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,OAAO,IAAA,kBAAO,EAAC,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,aAAa,CAAC,CAAC,QAAQ,EAAE,EAAE;YAChE,IAAI,UAAU,KAAK,QAAQ,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,CAAC,WAAW,KAAK,IAAI,EAAE,CAAC;gBAChG,0EAA0E;gBAC1E,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACrE,CAAC;YACD,0EAA0E;YAC1E,2EAA2E;YAC3E,4EAA4E;YAC5E,uEAAuE;YACvE,qEAAqE;YACrE,4EAA4E;YAC5E,mEAAmE;YACnE,MAAM,MAAM,GAA0C,IAAI,CAAC,gBAAgB,CACzE,KAAK,EACL,MAAM,CAAC,QAAQ,CAAC,IAAI,EACpB,MAAM,CACP,CAAC;YACF,OAAO,MAAM;iBACV,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC;iBACrB,aAAa,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC1B,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAChF,CAAC;QACN,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACK,KAAK,CAAC,WAAW,CACvB,MAA8B,EAC9B,IAAY,EACZ,KAAqB,EACrB,MAAc,EACd,IAAY,EACZ,MAAoB,EACpB,QAA4C,EAC5C,QAA2B;QAE3B,IAAI,QAAQ,CAAC,QAAQ,KAAK,QAAQ,EAAE,CAAC;YACnC,OAAO,IAAA,eAAI,EAAC,mCAAmC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,CAAC;aAC3D,aAAa,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACnD,SAAS,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;aACzE,aAAa,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE;YACjC,0EAA0E;YAC1E,kDAAkD;YAClD,wEAAwE;YACxE,2EAA2E;YAC3E,8DAA8D;YAC9D,oEAAoE;YACpE,MAAM,OAAO,GAA4B,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC/E,MAAM,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;YAC1C,OAAO,IAAA,kBAAO,EAAC,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;;;;;OAWG;IACK,KAAK,CAAC,aAAa,CAAC,KAA4B;QACtD,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjE,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,WAAW,GAAiB,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,KAAK,GAAmB,IAAI,CAAC,MAAM,CAAC;QAC1C,MAAM,QAAQ,GAAyB,MAAM,IAAI,CAAC,YAAY,CAC5D,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,EAClB,cAAc,KAAK,CAAC,QAAQ,CAAC,EAAE,GAAG,CACnC,CAAC;QACF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;YACzB,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,KAAK,GAAmB,MAAM,IAAI,CAAC,YAAY,CACnD,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,EACxD,mBAAmB,KAAK,CAAC,QAAQ,CAAC,EAAE,GAAG,CACxC,CAAC;QACF,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;YACtB,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,QAAQ,kCAAO,KAAK,CAAC,QAAQ,KAAE,YAAY,EAAE,KAAK,CAAC,KAAK,GAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IACnG,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CAAC,QAA2B,EAAE,KAAqB;QACxE,IAAI,QAAQ,CAAC,QAAQ,KAAK,aAAa,EAAE,CAAC;YACxC,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,OAAO,GAAe,EAAE,CAAC;QAC/B,KAAK,MAAM,EAAE,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,MAAM,GAAqB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACxD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,cAAc,CACjB,wCAAwC,EAAE,2EAA2E,MAAM,CAAC,OAAO,EAAE,CACtI,CAAC;YACJ,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gFAAgF;IACxE,KAAK,CAAC,qBAAqB,CAAC,OAAgC;QAClE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,YAAY,CAAI,EAA4B,EAAE,KAAa;QACvE,IAAI,MAAiB,CAAC;QACtB,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,EAAE,EAAE,CAAC;QACtB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,GAAG,IAAA,eAAI,EAAC,GAAG,KAAK,WAAW,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QACD,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC,cAAc,CACjB,WAAW,KAAK,yDAAyD,MAAM,CAAC,OAAO,EAAE,CAC1F,CAAC;QACJ,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACK,KAAK,CAAC,uBAAuB,CAAC,EAAY;QAChD,IAAI,IAAI,CAAC,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACjE,OAAO;QACT,CAAC;QACD,MAAM,WAAW,GAAiB,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,uBAAuB,EAAE,GAAG,CAAC,CAAC;IACtF,CAAC;IAED;;;;;;;;;;OAUG;IACK,YAAY,CAClB,QAAgC,EAChC,IAAY,EACZ,QAA4C,EAC5C,MAAoB,EACpB,IAAY;QAEZ,MAAM,GAAG,GAAW,IAAI,CAAC,MAAM,EAAE,CAAC;QAClC,MAAM,GAAG,GAAW,EAAE,IAAI,CAAC,IAAI,CAAC;QAChC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,OAAO,IAAA,kBAAO,EAAC;gBACb,QAAQ,kCAAO,QAAQ,CAAC,QAAQ,KAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,EAAE,IAAI,GAAE;gBACtF,IAAI;aACL,CAAC,CAAC;QACL,CAAC;QACD,MAAM,KAAK,GAA4B,IAAI,CAAC,oBAAoB,CAAC,QAAQ,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QACjG,OAAO,MAAM;aACV,WAAW,CAAC,QAAQ,EAAE,KAAK,CAAC;aAC5B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,eAAe,QAAQ,CAAC,QAAQ,CAAC,EAAE,qBAAqB,GAAG,EAAE,CAAC;aACvF,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;YACrB,IAAI,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACrC,OAAO,IAAA,eAAI,EACT,eAAe,QAAQ,CAAC,QAAQ,CAAC,EAAE,yCAAyC,OAAO,OAAO,CAAC,IAAI,GAAG,CACnG,CAAC;YACJ,CAAC;YACD,MAAM,SAAS,GAAW,OAAO,CAAC,IAAI,CAAC;YACvC,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,CAC1F,CAAC,SAAS,EAAE,EAAE,CACZ,IAAA,kBAAO,EAAC;gBACN,QAAQ,kCACH,OAAO,CAAC,QAAQ,KACnB,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAClC,OAAO,EAAE,GAAG,EACZ,GAAG,EACH,WAAW,EAAE,SAAS,GACvB;gBACD,IAAI,EAAE,SAAS;aAChB,CAAC,CACL,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC;IAED,wEAAwE;IAChE,QAAQ,CACd,MAA6B,EAC7B,KAAqB,EACrB,MAAc;QAEd,OAAO,IAAA,gCAAmB,EAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,CAAC;aACrD,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;aACvD,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;aAC5D,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC,CAAC;IACtC,CAAC;IAEO,KAAK,CAAC,aAAa,CAAC,IAAU,EAAE,QAAkB;QACxD,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;aACxB,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAC5C,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE;YACtB,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,eAAI,EAAW,kBAAkB,QAAQ,gDAAgD,CAAC,CAC3F,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,aAAa,CAAC,CAAC,QAAQ,EAAE,EAAE;gBAC1E,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,eAAI,EAAW,kBAAkB,QAAQ,oBAAoB,CAAC,CAAC,CAAC;gBACzF,CAAC;gBACD,uEAAuE;gBACvE,mEAAmE;gBACnE,qCAAqC;gBACrC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC;qBAC7C,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;qBACrF,aAAa,CAAC,KAAK,IAAI,EAAE;oBACxB,MAAM,IAAI,CAAC,uBAAuB,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACzD,OAAO,IAAA,kBAAO,EAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACvC,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACP,CAAC;IAED,gFAAgF;IACxE,MAAM,CAAC,KAAqB,EAAE,EAAY;QAChD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YACxD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,IAAA,eAAI,EAAC,6BAA6B,EAAE,eAAe,KAAK,cAAc,CAAC,CAAC;YACjF,CAAC;YACD,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC;iBAC/B,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;iBACzE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,uEAAuE;IAC/D,oBAAoB,CAC1B,MAA8B,EAC9B,aAAoC;QAEpC,MAAM,KAAK,GAA4B,EAAE,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,MAAM,QAAQ,GACZ,mBAAmB,CAAC,sBAAsB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAY,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACxC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;oBACxB,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;gBACvB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;OAOG;IACK,gBAAgB,CACtB,KAAqB,EACrB,IAAU,EACV,MAAc;QAEd,OAAO,IAAI,CAAC,MAAM;aACf,OAAO,EAAE;aACT,MAAM,CACL,CAAC,KAAK,EAAE,EAAE,CACR,KAAK,CAAC,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,MAAM,CACtG;aACA,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,0EAA0E;IAClE,kBAAkB,CAAC,KAAqB,EAAE,IAAY;QAC5D,MAAM,KAAK,GAAqC,IAAI,CAAC,MAAM;aACxD,OAAO,EAAE;aACT,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC;QACxF,OAAO,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAC;IACvB,CAAC;IAEO,YAAY,CAAC,IAAU,EAAE,IAAY,EAAE,KAA+B;QAC5E,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;IACzD,CAAC;IAEO,SAAS,CAAC,IAAU;;QAC1B,MAAM,KAAK,GAA+B,MAAA,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,IAAI,CAAC,aAAa,CAAC;QACvF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,OAAO,IAAA,eAAI,EAAC,0CAA0C,IAAI,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAEO,UAAU,CAAC,IAAU;;QAC3B,OAAO,MAAA,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,IAAI,CAAC,cAAc,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACK,WAAW,CAAC,KAAqB,EAAE,MAAc;QACvD,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YACzD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;YAC5B,CAAC;YACD,OAAO,QAAQ,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;gBACnD,MAAM,UAAU,GAAW,GAAG,MAAM,GAAG,qBAAqB,EAAE,CAAC;gBAC/D,MAAM,IAAI,GAA2C,QAAQ,CAAC,IAAI,CAChE,CAAC,CAAC,EAAmC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,CACnF,CAAC;gBACF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;gBAC5B,CAAC;gBACD,OAAO,IAAI;qBACR,cAAc,EAAE;qBAChB,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAA,4BAAe,EAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;qBACxD,SAAS,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;YAChF,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED,gFAAgF;IACxE,aAAa,CACnB,KAAqB,EACrB,IAAgC,EAChC,MAA8B;QAE9B,IAAI,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,OAAO,IAAA,eAAI,EACT,gBAAgB,IAAI,CAAC,YAAY,mBAAmB,MAAM,CAAC,QAAQ,CAAC,EAAE,mCAAmC,IAAI,CAAC,QAAQ,GAAG,CAC1H,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;aACxC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;aACjE,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,gBAAgB,IAAI,CAAC,YAAY,MAAM,GAAG,EAAE,CAAC;aACtE,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,MAAM,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,KAAqB;QAC5C,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;YACtD,MAAM,QAAQ,GAAa,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1E,OAAO,QAAQ,CAAC,MAAM,CACpB,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CACf,GAAG,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;gBACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;oBAC1B,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,CAAC;gBAC5B,CAAC;gBACD,OAAO,OAAO;qBACX,WAAW,EAAE;qBACb,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACtB,IAAA,kBAAO,EACL,QAAQ,CAAC,IAAI,CACX,CAAC,CAAC,EAAwC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CAC1F,CACF,CACF,CAAC;YACN,CAAC,CAAC,EACJ,IAAA,kBAAO,EAAC,IAAI,CAAC,KAAK,CAAC,CACpB,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,sEAAsE;IAC9D,eAAe,CAAC,KAAqB;QAC3C,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE;YACtD,MAAM,QAAQ,GAAa,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1E,OAAO,QAAQ,CAAC,MAAM,CACpB,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CACf,GAAG,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CACxB,OAAO,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;gBAC3C,MAAM,QAAQ,GAAsC,QAAQ,CAAC,IAAI,CAC/D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,CACpD,CAAC;gBACF,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAC3B,OAAO,OAAO,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;gBAC/C,CAAC;gBACD,+JAA+J;gBAC/J,IAAI,CAAC,uBAAQ,CAAC,sBAAsB,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/C,OAAO,IAAA,eAAI,EAAC,GAAG,QAAQ,CAAC,YAAY,4BAA4B,CAAC,CAAC;gBACpE,CAAC;gBACD,OAAO,IAAA,kBAAO,EAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC,CAAC,CACH,EACH,IAAA,kBAAO,EAAC,IAAI,CAAC,KAAK,CAAC,CACpB,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,oEAAoE;IAC5D,UAAU,CAAC,KAAqB,EAAE,MAAc,EAAE,GAAW;QACnE,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACxD,QAAQ,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC5C,MAAM,QAAQ,GAAW,GAAG,MAAM,GAAG,qBAAqB,EAAE,CAAC;YAC7D,MAAM,QAAQ,GAAsC,QAAQ,CAAC,IAAI,CAC/D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAChD,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,QAAQ,CAAC,eAAe,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;YAChF,CAAC;YACD,oGAAoG;YACpG,IAAI,CAAC,uBAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1C,OAAO,IAAA,eAAI,EAAC,GAAG,QAAQ,CAAC,YAAY,uBAAuB,CAAC,CAAC;YAC/D,CAAC;YACD,OAAO,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,KAAqB,EAAE,MAAc;QACvD,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YACzD,0FAA0F;YAC1F,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,OAAO,IAAA,eAAI,EAAC,yBAAyB,KAAK,aAAa,CAAC,CAAC;YAC3D,CAAC;YACD,MAAM,QAAQ,GAAW,GAAG,MAAM,GAAG,qBAAqB,EAAE,CAAC;YAC7D,OAAO,QAAQ,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;gBACnD,MAAM,IAAI,GAAsC,QAAQ,CAAC,IAAI,CAC3D,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAChD,CAAC;gBACF,qFAAqF;gBACrF,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;oBACvB,OAAO,IAAA,eAAI,EAAC,wBAAwB,QAAQ,yBAAyB,KAAK,GAAG,CAAC,CAAC;gBACjF,CAAC;gBACD,oGAAoG;gBACpG,IAAI,CAAC,uBAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtC,OAAO,IAAA,eAAI,EAAC,GAAG,IAAI,CAAC,YAAY,uBAAuB,CAAC,CAAC;gBAC3D,CAAC;gBACD,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACK,aAAa;QACnB,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CAChE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE;YAC1C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC1C,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBACxC,CAAC;YACH,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED,kFAAkF;IAC1E,eAAe,CACrB,GAAoC,EACpC,aAAoC;QAEpC,OAAO,GAAG,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE;YAC9C,MAAM,OAAO,GAAkD,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;gBACpF,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;oBAC/B,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,GAAG,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;gBACrE,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC9E,uEAAuE;oBACvE,0DAA0D;oBAC1D,OAAO,IAAA,kBAAO,EAAsC,EAAE,CAAC,CAAC;gBAC1D,CAAC;gBACD,MAAM,KAAK,GAAmB,aAAa,CAAC,IAAI,CAAC,GAAG,CAAmB,CAAC;gBACxE,OAAO,KAAK;qBACT,cAAc,EAAE;qBAChB,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAA,4BAAe,EAAC,GAAG,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;qBACxD,SAAS,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;qBAC3E,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CACtB,IAAA,kBAAO,EAAsC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAC5E,CAAC;YACN,CAAC,CAAC,CAAC;YACH,OAAO,IAAA,qBAAU,EAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,QAAQ,EAAE,EAAE,CAChD,IAAA,kBAAO,EAAsC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAC9D,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;;AAl2BH,kDAm2BC;AAv0BC;;;;;;GAMG;AACqB,0CAAsB,GAG1C,IAAI,GAAG,CAAsD;IAC/D,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IACvB,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;IAChC,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC;IAClC,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC;IAC5C,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC;CACjD,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Hash, Logging, Result, fail, mapResults, succeed } from '@fgv/ts-utils';\nimport { FileTree } from '@fgv/ts-json-base';\nimport {\n  AdmissionDecision,\n  DEFAULT_DEDUP_SCOPE,\n  DedupScope,\n  EntityId,\n  IIdentityCodec,\n  IMemoryEnvelope,\n  IMemoryRecord,\n  IProvenance,\n  IWritePolicy,\n  Kind,\n  KnowledgeLwwPolicy,\n  MemoryId,\n  MemoryScopeKey,\n  Tag\n} from '../types';\nimport { IBodyConverterRegistry as IRegistry, parseMemoryFile, serializeMemoryFile } from '../converters';\nimport { IIndexedMemoryRecord, IMemoryIndex, MemoryIndex } from '../index';\nimport {\n  IMemoryObservationRecord,\n  IMemoryObserver,\n  MemoryObservationOutcome,\n  MemoryObservationPhase\n} from '../observe';\nimport { IVectorIndex, MemoryEmbedder } from '../vector';\nimport { defaultMemoryScopeEncoding } from './scopeEncoding';\n\n/** The on-disk extension for a memory record file. */\nconst MEMORY_FILE_EXTENSION: string = '.md';\n\n/**\n * Filter for {@link IMemoryStore.list}. All present fields are ANDed together.\n * @public\n */\nexport interface IMemoryStoreListFilter {\n  /** Restrict to records in this scope. */\n  readonly scope?: MemoryScopeKey;\n  /** Restrict to records of this kind. */\n  readonly kind?: Kind;\n  /** Restrict to records carrying this tag (exact match). */\n  readonly tag?: Tag;\n  /**\n   * For temporal kinds: return only records valid at this epoch ms. No-op in\n   * B1 (no temporal kinds wired).\n   */\n  readonly asOf?: number;\n}\n\n/**\n * The writable, FileTree-backed, content-hash-deduped memory store.\n * @public\n */\nexport interface IMemoryStore {\n  /**\n   * Keyed read by entity id. Resolves `entityId` to a storage address via the\n   * registered {@link IIdentityCodec} for `kind`. Returns `undefined` when no\n   * record exists.\n   */\n  get(kind: Kind, entityId: EntityId): Promise<Result<IMemoryRecord<unknown> | undefined>>;\n\n  /**\n   * Direct read by `(scope, MemoryId)`. Returns `undefined` when not found.\n   */\n  getById(scope: MemoryScopeKey, id: MemoryId): Promise<Result<IMemoryRecord<unknown> | undefined>>;\n\n  /**\n   * List records, filtered in-memory over the derived index.\n   */\n  list(filter?: IMemoryStoreListFilter): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>>;\n\n  /**\n   * Write a record. Validates the body, computes a content hash, deduplicates\n   * (scope-wide, before policy), applies the kind's {@link IWritePolicy}, stamps\n   * transaction-time metadata (`created` / `updated` / `seq` / `contentHash`),\n   * writes the file, and patches the index. Returns the written record — or the\n   * existing record unchanged on a dedup no-op.\n   */\n  put(record: IMemoryRecord<unknown>): Promise<Result<IMemoryRecord<unknown>>>;\n\n  /**\n   * Delete a record by `(kind, entityId)`. Non-temporal kinds physically delete\n   * the file. Returns the {@link MemoryId} of the deleted record.\n   */\n  delete(kind: Kind, entityId: EntityId): Promise<Result<MemoryId>>;\n}\n\n/**\n * Parameters for {@link FileTreeMemoryStore.create}.\n * @public\n */\nexport interface IFileTreeMemoryStoreCreateParams {\n  /** Root directory under which scope-encoded sub-trees live. Must be mutable. */\n  readonly root: FileTree.IMutableFileTreeDirectoryItem;\n  /** Per-kind body converter registry. Gates every body on write and read. */\n  readonly registry: IRegistry;\n  /** Per-kind write policies. Kinds without an entry use a default LWW policy. */\n  readonly writePolicies?: ReadonlyMap<Kind, IWritePolicy>;\n  /** Per-kind identity codecs. */\n  readonly codecs?: ReadonlyMap<Kind, IIdentityCodec>;\n  /** Default codec for kinds without an explicit entry. */\n  readonly defaultCodec?: IIdentityCodec;\n  /** Scope encoding. Defaults to {@link defaultMemoryScopeEncoding}. */\n  readonly scopeEncoding?: (scope: MemoryScopeKey) => Result<string>;\n  /**\n   * Transaction-time clock. Defaults to `Date.now`. Injectable so tests can\n   * make `created` / `updated` deterministic. Also stamps observation\n   * `timestamp`s.\n   */\n  readonly clock?: () => number;\n  /**\n   * Optional observers fired once per public `get` / `put` / `delete` call.\n   * Purely additive — when absent, no observation records are produced and the\n   * store behaves exactly as it did without this parameter. Observer errors\n   * never affect the store operation (swallowed, logged to {@link\n   * IFileTreeMemoryStoreCreateParams.logger | logger} at `warn`).\n   */\n  readonly observers?: ReadonlyArray<IMemoryObserver>;\n  /**\n   * Diagnostic logger for swallowed observer failures. Defaults to a\n   * `Logging.NoOpLogger`.\n   */\n  readonly logger?: Logging.ILogger;\n  /**\n   * Optional vector index for semantic recall. Wired together with\n   * {@link IFileTreeMemoryStoreCreateParams.embed | embed}: when both are present\n   * the store embeds each written record and maintains the index on\n   * `put` / `delete` / cap-cull eviction. Absent (or `embed` absent) → no\n   * embedding work happens and the store behaves exactly as it does without this\n   * parameter (the additive, zero-overhead-when-unwired default — mirrors the\n   * observer hook).\n   */\n  readonly vectorIndex?: IVectorIndex;\n  /**\n   * Optional embedder applied to each record on write, wired together with\n   * {@link IFileTreeMemoryStoreCreateParams.vectorIndex | vectorIndex}. The\n   * consumer supplies it (e.g. `callProviderEmbedding` or in-process\n   * transformers); the store never calls an embedding provider directly, so the\n   * core stays embedder-agnostic. Embedding/index maintenance is **best-effort**:\n   * a failed (or throwing) `embed` / `add` / `remove` is logged at `warn` via\n   * {@link IFileTreeMemoryStoreCreateParams.logger | logger} and the record\n   * operation still succeeds — the vector index is a derived view that a later\n   * `rebuild` reconciles, so a vector failure never fails an authoritative write.\n   */\n  readonly embed?: MemoryEmbedder;\n}\n\n/**\n * The internal outcome of a locked `put`: the written (or existing, on a\n * dedup no-op) record plus the {@link MemoryId}s evicted by a `cull-oldest`\n * admission decision. The eviction file-deletes and index patches happen\n * inside the write-lock; the `evicted` ids are surfaced so the public `put`\n * can fire one `'delete'` observation per evicted record AFTER the lock\n * releases — consistent with the post-op firing of the other observation\n * hooks, and avoiding observer re-entrancy into the still-held write-lock.\n */\ninterface IPutOutcome {\n  readonly record: IMemoryRecord<unknown>;\n  readonly evicted: ReadonlyArray<MemoryId>;\n}\n\n/**\n * The resolved storage address + content hash for a put, produced by the\n * synchronous prefix of `_putLocked` and handed to the async write tail.\n */\ninterface IResolvedWriteAddress {\n  readonly scope: MemoryScopeKey;\n  readonly idStem: string;\n  readonly hash: string;\n}\n\ninterface IInternalParams {\n  readonly root: FileTree.IMutableFileTreeDirectoryItem;\n  readonly registry: IRegistry;\n  readonly writePolicies: ReadonlyMap<Kind, IWritePolicy>;\n  readonly codecs: ReadonlyMap<Kind, IIdentityCodec>;\n  readonly defaultCodec?: IIdentityCodec;\n  readonly defaultPolicy: IWritePolicy;\n  readonly scopeEncoding: (scope: MemoryScopeKey) => Result<string>;\n  readonly clock: () => number;\n  readonly index: IMemoryIndex;\n  readonly observers: ReadonlyArray<IMemoryObserver>;\n  readonly logger: Logging.ILogger;\n  readonly vectorIndex?: IVectorIndex;\n  readonly embed?: MemoryEmbedder;\n}\n\n/**\n * Flat-layout, FileTree-backed {@link IMemoryStore}. The FileTree is the source\n * of truth; the {@link IMemoryIndex} is a derived in-memory view patched on\n * every write. Concurrent writes are serialized through a per-instance async\n * write-lock so the index and the on-disk files never interleave.\n *\n * @remarks\n * B1 supports flat (non-versioned) layout only and string (markdown) bodies.\n * A codec reporting `isVersioned: true`, or a non-string body, fails loudly —\n * the versioned/temporal write path is a fast-follow.\n * @public\n */\nexport class FileTreeMemoryStore implements IMemoryStore {\n  private readonly _root: FileTree.IMutableFileTreeDirectoryItem;\n  private readonly _registry: IRegistry;\n  private readonly _writePolicies: ReadonlyMap<Kind, IWritePolicy>;\n  private readonly _codecs: ReadonlyMap<Kind, IIdentityCodec>;\n  private readonly _defaultCodec: IIdentityCodec | undefined;\n  private readonly _defaultPolicy: IWritePolicy;\n  private readonly _scopeEncoding: (scope: MemoryScopeKey) => Result<string>;\n  private readonly _clock: () => number;\n  private readonly _index: IMemoryIndex;\n  private readonly _hasher: Hash.Crc32Normalizer;\n  private readonly _observers: ReadonlyArray<IMemoryObserver>;\n  private readonly _logger: Logging.ILogger;\n  private readonly _vectorIndex: IVectorIndex | undefined;\n  private readonly _embed: MemoryEmbedder | undefined;\n\n  /** Monotonic write counter; incremented inside the write-lock on each put. */\n  private _seq: number;\n  /**\n   * Monotonic observation-sequence counter. A distinct authority from `_seq`\n   * (the envelope write counter): it numbers the audit stream so a single\n   * {@link MemoryObservationStore} fed by this store sees strictly increasing\n   * `seq`, satisfying the ring buffer's cursor contract.\n   */\n  private _observationSeq: number;\n  /** Tail of the write-lock promise chain that serializes mutating ops. */\n  private _writeTail: Promise<unknown>;\n\n  /**\n   * The record-level mutable-field vocabulary: maps a declared mutable field\n   * name to its canonical location on a record. Used to project an incoming\n   * record into a merge-patch on update. B1 ships the knowledge-LWW surface\n   * (body + envelope metadata); body-internal mutable fields (Phase-C cap-cull)\n   * extend this map.\n   */\n  private static readonly _mutableFieldAccessors: ReadonlyMap<\n    string,\n    (record: IMemoryRecord<unknown>) => unknown\n  > = new Map<string, (record: IMemoryRecord<unknown>) => unknown>([\n    ['body', (r) => r.body],\n    ['tags', (r) => r.envelope.tags],\n    ['links', (r) => r.envelope.links],\n    ['provenance', (r) => r.envelope.provenance],\n    ['embeddingRef', (r) => r.envelope.embeddingRef]\n  ]);\n\n  private constructor(params: IInternalParams) {\n    this._root = params.root;\n    this._registry = params.registry;\n    this._writePolicies = params.writePolicies;\n    this._codecs = params.codecs;\n    this._defaultCodec = params.defaultCodec;\n    this._defaultPolicy = params.defaultPolicy;\n    this._scopeEncoding = params.scopeEncoding;\n    this._clock = params.clock;\n    this._index = params.index;\n    this._hasher = new Hash.Crc32Normalizer();\n    this._observers = params.observers;\n    this._logger = params.logger;\n    this._vectorIndex = params.vectorIndex;\n    this._embed = params.embed;\n    this._seq = 0;\n    this._observationSeq = 0;\n    this._writeTail = Promise.resolve();\n  }\n\n  /**\n   * Family-convention factory. Builds the derived index and a default LWW\n   * policy, then performs an initial FileTree walk so an existing vault is\n   * indexed (and the `seq` counter resumes past the highest persisted `seq`).\n   */\n  public static create(params: IFileTreeMemoryStoreCreateParams): Result<FileTreeMemoryStore> {\n    return KnowledgeLwwPolicy.create().onSuccess((defaultPolicy) =>\n      MemoryIndex.create().onSuccess((index) => {\n        const store: FileTreeMemoryStore = new FileTreeMemoryStore({\n          root: params.root,\n          registry: params.registry,\n          writePolicies: params.writePolicies ?? new Map<Kind, IWritePolicy>(),\n          codecs: params.codecs ?? new Map<Kind, IIdentityCodec>(),\n          defaultCodec: params.defaultCodec,\n          defaultPolicy,\n          scopeEncoding: params.scopeEncoding ?? defaultMemoryScopeEncoding,\n          clock: params.clock ?? Date.now,\n          index,\n          observers: params.observers ?? [],\n          logger: params.logger ?? new Logging.NoOpLogger(),\n          vectorIndex: params.vectorIndex,\n          embed: params.embed\n        });\n        return store._initialIndex().onSuccess(() => succeed(store));\n      })\n    );\n  }\n\n  /** {@inheritDoc IMemoryStore.get} */\n  public async get(kind: Kind, entityId: EntityId): Promise<Result<IMemoryRecord<unknown> | undefined>> {\n    const result: Result<IMemoryRecord<unknown> | undefined> = this._codecFor(kind).onSuccess((codec) =>\n      codec.encode(entityId).onSuccess((addr) => {\n        if (addr.isVersioned) {\n          return fail(`memory get '${entityId}': versioned/temporal layout not yet supported`);\n        }\n        return this._readRecord(addr.scope, addr.idStem);\n      })\n    );\n    await this._fireObservation('read', kind, entityId, {\n      outcome: result.isSuccess() ? 'success' : 'failure',\n      id: result.isSuccess() ? result.value?.envelope.id : undefined,\n      error: result.isFailure() ? result.message : undefined\n    });\n    return result;\n  }\n\n  /** {@inheritDoc IMemoryStore.getById} */\n  public async getById(\n    scope: MemoryScopeKey,\n    id: MemoryId\n  ): Promise<Result<IMemoryRecord<unknown> | undefined>> {\n    return this._readRecord(scope, id);\n  }\n\n  /** {@inheritDoc IMemoryStore.list} */\n  public async list(filter?: IMemoryStoreListFilter): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    const matches: IMemoryRecord<unknown>[] = this._index\n      .entries()\n      .filter((entry) => {\n        if (filter?.scope !== undefined && entry.scope !== filter.scope) {\n          return false;\n        }\n        if (filter?.kind !== undefined && entry.record.envelope.kind !== filter.kind) {\n          return false;\n        }\n        if (filter?.tag !== undefined && !entry.record.envelope.tags.includes(filter.tag)) {\n          return false;\n        }\n        return true;\n      })\n      .map((entry) => entry.record);\n    return succeed(matches);\n  }\n\n  /** {@inheritDoc IMemoryStore.put} */\n  public async put(record: IMemoryRecord<unknown>): Promise<Result<IMemoryRecord<unknown>>> {\n    const result: Result<IPutOutcome> = await this._enqueue(() => this._putLocked(record));\n    await this._fireObservation('write', record.envelope.kind, record.envelope.entityId, {\n      outcome: result.isSuccess() ? 'success' : 'failure',\n      id: result.isSuccess() ? result.value.record.envelope.id : record.envelope.id,\n      provenance: record.envelope.provenance,\n      error: result.isFailure() ? result.message : undefined\n    });\n    // Fire one `'delete'` observation per record evicted by cap-cull. The\n    // evicted records are always in the same `(scope, kind)` cohort as the\n    // incoming record, so resolving the scope from the incoming `entityId`\n    // yields the evicted record's scope; the observation records the evicted\n    // record's own `id`. A no-op / first-write / reject path yields no\n    // evictions, so this loop is empty there.\n    if (result.isSuccess()) {\n      for (const evictedId of result.value.evicted) {\n        await this._fireObservation('delete', record.envelope.kind, record.envelope.entityId, {\n          outcome: 'success',\n          id: evictedId\n        });\n      }\n    }\n    return result.onSuccess((outcome) => succeed(outcome.record));\n  }\n\n  /** {@inheritDoc IMemoryStore.delete} */\n  public async delete(kind: Kind, entityId: EntityId): Promise<Result<MemoryId>> {\n    const result: Result<MemoryId> = await this._enqueue(() => this._deleteLocked(kind, entityId));\n    await this._fireObservation('delete', kind, entityId, {\n      outcome: result.isSuccess() ? 'success' : 'failure',\n      id: result.isSuccess() ? result.value : undefined,\n      error: result.isFailure() ? result.message : undefined\n    });\n    return result;\n  }\n\n  /**\n   * Serialize a mutating task behind the write-lock. Tasks run in submission\n   * order; a failed task does not break the chain for subsequent ones.\n   */\n  private _enqueue<T>(task: () => Promise<Result<T>>): Promise<Result<T>> {\n    const result: Promise<Result<T>> = this._writeTail.then(task);\n    this._writeTail = result.then(\n      () => undefined,\n      () => undefined\n    );\n    return result;\n  }\n\n  /**\n   * Build and fan out one observation record for a completed op. A no-op when no\n   * observers are wired (the additive-default path pays nothing). The store is\n   * the seq authority — it mints `seq` / `timestamp` so every observer sees the\n   * same record. The scope is resolved best-effort via the codec.\n   */\n  private async _fireObservation(\n    phase: MemoryObservationPhase,\n    kind: Kind,\n    entityId: EntityId,\n    details: {\n      readonly outcome: MemoryObservationOutcome;\n      readonly id?: MemoryId;\n      readonly provenance?: IProvenance;\n      readonly error?: string;\n    }\n  ): Promise<void> {\n    if (this._observers.length === 0) {\n      return;\n    }\n    const record: IMemoryObservationRecord = {\n      seq: ++this._observationSeq,\n      timestamp: this._clock(),\n      phase,\n      scope: this._scopeBestEffort(kind, entityId),\n      id: details.id,\n      kind,\n      outcome: details.outcome,\n      error: details.error,\n      provenance: details.provenance\n    };\n    const awaited: Promise<void>[] = [];\n    for (const observer of this._observers) {\n      if (observer.fireAndForget === true) {\n        // Intentionally not awaited: a fire-and-forget observer must not extend\n        // the store op's latency. `_safeObserve` swallows internally; the\n        // `.catch` keeps the detached promise from being flagged as floating.\n        this._safeObserve(observer, record).catch(() => undefined);\n      } else {\n        awaited.push(this._safeObserve(observer, record));\n      }\n    }\n    await Promise.all(awaited);\n  }\n\n  /** Invoke one observer, swallowing any failure or throw (logged at `warn`). */\n  private async _safeObserve(observer: IMemoryObserver, record: IMemoryObservationRecord): Promise<void> {\n    try {\n      const observed: Result<unknown> = await observer.observe(record);\n      if (observed.isFailure()) {\n        this._warnSwallowed(`memory observer failed (swallowed): ${observed.message}`);\n      }\n    } catch (error) {\n      this._warnSwallowed(`memory observer threw (swallowed): ${String(error)}`);\n    }\n  }\n\n  /**\n   * Log a swallowed-issue warning (observer failure or best-effort vector\n   * maintenance), tolerating a logger that itself throws — diagnostic logging\n   * must never make a store op reject.\n   */\n  private _warnSwallowed(message: string): void {\n    try {\n      this._logger.warn(message);\n    } catch {\n      // Diagnostic logging must not affect the store operation.\n    }\n  }\n\n  /** Resolve a scope for an observation, best-effort (undefined when unresolvable). */\n  private _scopeBestEffort(kind: Kind, entityId: EntityId): MemoryScopeKey | undefined {\n    return this._codecFor(kind)\n      .onSuccess((codec) => codec.encode(entityId))\n      .onSuccess((addr) => succeed(addr.scope))\n      .orDefault();\n  }\n\n  private async _putLocked(record: IMemoryRecord<unknown>): Promise<Result<IPutOutcome>> {\n    const envelope: IMemoryEnvelope = record.envelope;\n    if (typeof record.body !== 'string') {\n      return fail(\n        `memory put '${envelope.id}': only string (markdown) bodies are supported (got ${typeof record.body})`\n      );\n    }\n    const body: string = record.body;\n    // Resolve the synchronous prefix (body validation → codec address → content\n    // hash) into a small descriptor, then bridge to the async write tail (which\n    // embeds on write). Keeping the sync prefix intact preserves the exact\n    // dedup/policy ordering of the original; only the embed step is new.\n    return this._registry\n      .convert(envelope.kind, body)\n      .withErrorFormat((msg) => `memory put '${envelope.id}': invalid body: ${msg}`)\n      .onSuccess(() => this._codecFor(envelope.kind))\n      .onSuccess(\n        (codec): Result<IResolvedWriteAddress> =>\n          codec.encode(envelope.entityId).onSuccess((addr): Result<IResolvedWriteAddress> => {\n            if (addr.isVersioned) {\n              return fail(`memory put '${envelope.entityId}': versioned/temporal layout not yet supported`);\n            }\n            if (envelope.id !== addr.idStem) {\n              return fail(\n                `memory put: envelope id '${envelope.id}' does not match codec-derived stem '${addr.idStem}'`\n              );\n            }\n            return this._contentHash(envelope.kind, body, envelope.links).onSuccess((hash) =>\n              succeed({ scope: addr.scope, idStem: addr.idStem, hash })\n            );\n          })\n      )\n      .thenOnSuccess((resolved) =>\n        this._writeResolved(record, body, resolved.scope, resolved.idStem, resolved.hash)\n      );\n  }\n\n  /**\n   * Run dedup → policy → stamp → embed → write for a resolved address and content\n   * hash. Async because the embed-on-write hook (when wired) does a network call\n   * or in-process inference; the whole chain runs inside the write-lock so the\n   * vector index, the on-disk file, and the derived index never interleave.\n   */\n  private async _writeResolved(\n    record: IMemoryRecord<unknown>,\n    body: string,\n    scope: MemoryScopeKey,\n    idStem: string,\n    hash: string\n  ): Promise<Result<IPutOutcome>> {\n    const policy: IWritePolicy = this._policyFor(record.envelope.kind);\n    const dedupScope: DedupScope = policy.dedupScope ?? DEFAULT_DEDUP_SCOPE;\n    // Content-hash dedup runs BEFORE policy. Its granularity is the kind's\n    // `dedupScope`:\n    //   - 'content': an identical { kind, body, links } triple ANYWHERE in the\n    //     scope (even under a different id) is a no-op (knowledge family).\n    //   - 'entity' (default): only an identical re-put of the SAME id is a no-op;\n    //     two distinct entities with identical content never collapse (experience\n    //     families). The same-id check is folded into the `_readRecord` below.\n    // (Tags / provenance are metadata and are NOT part of the hash; see\n    // design-lock §2.5.)\n    if (dedupScope === 'content') {\n      const duplicate: IMemoryRecord<unknown> | undefined = this._findByContentHash(scope, hash);\n      if (duplicate !== undefined) {\n        return succeed({ record: duplicate, evicted: [] });\n      }\n    }\n    return this._readRecord(scope, idStem).thenOnSuccess((existing) => {\n      if (dedupScope === 'entity' && existing !== undefined && existing.envelope.contentHash === hash) {\n        // Entity-scoped dedup: an identical re-put of the same entity is a no-op.\n        return Promise.resolve(succeed({ record: existing, evicted: [] }));\n      }\n      // The admission cohort is the set of records the policy's cap applies to:\n      // every record in this scope of this kind EXCEPT the target id. On a first\n      // write the post-write count is `cohort.length + 1`; on an update the prior\n      // same-id record is excluded so the count is still `cohort.length + 1`\n      // (a replace, not a grow). The same-id `existing` record is threaded\n      // separately into `_buildRecord` for the merge-patch. Knowledge LWW ignores\n      // this argument, so its behavior is unchanged by the wider cohort.\n      const cohort: ReadonlyArray<IMemoryRecord<unknown>> = this._admissionCohort(\n        scope,\n        record.envelope.kind,\n        idStem\n      );\n      return policy\n        .admit(record, cohort)\n        .thenOnSuccess((decision) =>\n          this._admitWrite(record, body, scope, idStem, hash, policy, existing, decision)\n        );\n    });\n  }\n\n  /**\n   * Build → embed → persist → evict for an admitted write.\n   *\n   * The durable record store is authoritative; the vector index is a **derived,\n   * rebuildable** view, so vector maintenance is **best-effort** — a failed embed\n   * or `add` is logged and the durable write still succeeds (the index can be\n   * rebuilt via {@link InMemoryCosineIndex.rebuild}). Only genuine record-store\n   * failures (body/codec/policy, persist, file eviction) fail the `put`.\n   *\n   * Ordering: the embed + `add` run immediately before the single `_persist` so\n   * the index-returned `embeddingRef` lands in one durable write (a post-persist\n   * stamp would need a second write whose failure path is effectively untestable).\n   * Build and persist the replacement BEFORE evicting the cull-oldest cohort, so a\n   * later eviction failure never loses data with nothing written in its place.\n   */\n  private async _admitWrite(\n    record: IMemoryRecord<unknown>,\n    body: string,\n    scope: MemoryScopeKey,\n    idStem: string,\n    hash: string,\n    policy: IWritePolicy,\n    existing: IMemoryRecord<unknown> | undefined,\n    decision: AdmissionDecision\n  ): Promise<Result<IPutOutcome>> {\n    if (decision.decision === 'reject') {\n      return fail(`memory put: rejected by policy: ${decision.reason}`);\n    }\n    return this._buildRecord(record, body, existing, policy, hash)\n      .thenOnSuccess((built) => this._embedOnWrite(built))\n      .onSuccess((embeddedBuilt) => this._persist(embeddedBuilt, scope, idStem))\n      .thenOnSuccess(async (persisted) => {\n        // Everything after the authoritative `_persist` commit is best-effort and\n        // never turns a committed write into a `Failure`:\n        //   - a cull-oldest eviction that fails is logged (the per-(scope,kind)\n        //     cap may be transiently exceeded; the next write's admission restores\n        //     it), and only the successfully-evicted ids flow onward;\n        //   - vector pruning of the evicted cohort is likewise best-effort.\n        const evicted: ReadonlyArray<MemoryId> = this._applyEvictions(decision, scope);\n        await this._removeEvictedVectors(evicted);\n        return succeed({ record: persisted, evicted });\n      });\n  }\n\n  /**\n   * Best-effort embed-on-write. When a vector index AND an embedder are wired,\n   * embeds the built record, `add`s the vector (replace semantics handle a same-id\n   * re-embed — no explicit remove), and stamps the returned `embeddingRef`. A\n   * failure (returned `fail` OR a thrown/rejected hook) is logged and the\n   * unembedded record is returned unchanged — the put still persists, and the\n   * derived index is reconciled by a later `rebuild`. A pass-through no-op when\n   * unwired (byte-identical record).\n   *\n   * Always succeeds (`Result` is the chain's shape, never a vector-induced\n   * failure).\n   */\n  private async _embedOnWrite(built: IMemoryRecord<string>): Promise<Result<IMemoryRecord<string>>> {\n    if (this._vectorIndex === undefined || this._embed === undefined) {\n      return succeed(built);\n    }\n    const vectorIndex: IVectorIndex = this._vectorIndex;\n    const embed: MemoryEmbedder = this._embed;\n    const embedded: Result<Float32Array> = await this._tryVectorOp(\n      () => embed(built),\n      `embedding '${built.envelope.id}'`\n    );\n    if (embedded.isFailure()) {\n      return succeed(built);\n    }\n    const added: Result<string> = await this._tryVectorOp(\n      () => vectorIndex.add(built.envelope.id, embedded.value),\n      `vector add for '${built.envelope.id}'`\n    );\n    if (added.isFailure()) {\n      return succeed(built);\n    }\n    return succeed({ envelope: { ...built.envelope, embeddingRef: added.value }, body: built.body });\n  }\n\n  /**\n   * Evict the records named by a `cull-oldest` decision, best-effort. Runs only\n   * after the authoritative `_persist`, so a failed eviction is logged (never\n   * fatal) and the cap self-corrects on the next admission. Returns the ids that\n   * were actually evicted (so observations / vector pruning cover only those).\n   * `accept` / `reject` decisions evict nothing.\n   */\n  private _applyEvictions(decision: AdmissionDecision, scope: MemoryScopeKey): ReadonlyArray<MemoryId> {\n    if (decision.decision !== 'cull-oldest') {\n      return [];\n    }\n    const evicted: MemoryId[] = [];\n    for (const id of decision.evict) {\n      const result: Result<MemoryId> = this._evict(scope, id);\n      if (result.isSuccess()) {\n        evicted.push(result.value);\n      } else {\n        this._warnSwallowed(\n          `memory put: best-effort eviction of '${id}' failed (cap may be transiently exceeded; restored on the next write): ${result.message}`\n        );\n      }\n    }\n    return evicted;\n  }\n\n  /** Best-effort vector removal for each evicted record (never fails the put). */\n  private async _removeEvictedVectors(evicted: ReadonlyArray<MemoryId>): Promise<void> {\n    for (const id of evicted) {\n      await this._removeVectorBestEffort(id);\n    }\n  }\n\n  /**\n   * Run a consumer-supplied vector hook, normalizing a thrown/rejected hook into a\n   * `Failure` and logging any failure at `warn`. Best-effort: the caller proceeds\n   * regardless, since the index is rebuildable.\n   */\n  private async _tryVectorOp<T>(op: () => Promise<Result<T>>, label: string): Promise<Result<T>> {\n    let result: Result<T>;\n    try {\n      result = await op();\n    } catch (err) {\n      result = fail(`${label} threw: ${String(err)}`);\n    }\n    if (result.isFailure()) {\n      this._warnSwallowed(\n        `memory: ${label} failed (best-effort; vector index left for rebuild): ${result.message}`\n      );\n    }\n    return result;\n  }\n\n  /**\n   * Best-effort vector removal. A no-op unless the full vector lifecycle is wired\n   * (both an index AND an embedder), so an unwired store does no vector work and\n   * behaves byte-identically. Failures are logged, never surfaced — a committed\n   * delete/eviction must not fail because a derived index could not be pruned.\n   */\n  private async _removeVectorBestEffort(id: MemoryId): Promise<void> {\n    if (this._vectorIndex === undefined || this._embed === undefined) {\n      return;\n    }\n    const vectorIndex: IVectorIndex = this._vectorIndex;\n    await this._tryVectorOp(() => vectorIndex.remove(id), `vector removal for '${id}'`);\n  }\n\n  /**\n   * Build the record to persist. On a first write the incoming envelope is the\n   * base (final content equals the incoming content, so the dedup `hash` is\n   * reused). On an update the incoming record's mutable fields are projected into\n   * a merge-patch and the policy's `applyUpdate` merges them over the existing\n   * record (preserving `created`); the persisted body and `contentHash` are then\n   * taken from the policy's actual output, so a body-transforming policy is never\n   * bypassed and the stored hash always matches the stored `{ kind, body, links }`.\n   * The store stamps the transaction-time metadata it owns\n   * (`created` / `updated` / `seq` / `contentHash`).\n   */\n  private _buildRecord(\n    incoming: IMemoryRecord<unknown>,\n    body: string,\n    existing: IMemoryRecord<unknown> | undefined,\n    policy: IWritePolicy,\n    hash: string\n  ): Result<IMemoryRecord<string>> {\n    const now: number = this._clock();\n    const seq: number = ++this._seq;\n    if (existing === undefined) {\n      return succeed({\n        envelope: { ...incoming.envelope, created: now, updated: now, seq, contentHash: hash },\n        body\n      });\n    }\n    const patch: Record<string, unknown> = this._projectMutablePatch(incoming, policy.mutableFields);\n    return policy\n      .applyUpdate(existing, patch)\n      .withErrorFormat((msg) => `memory put '${incoming.envelope.id}': update failed: ${msg}`)\n      .onSuccess((updated) => {\n        if (typeof updated.body !== 'string') {\n          return fail(\n            `memory put '${incoming.envelope.id}': policy returned a non-string body (${typeof updated.body})`\n          );\n        }\n        const finalBody: string = updated.body;\n        return this._contentHash(updated.envelope.kind, finalBody, updated.envelope.links).onSuccess(\n          (finalHash) =>\n            succeed({\n              envelope: {\n                ...updated.envelope,\n                created: existing.envelope.created,\n                updated: now,\n                seq,\n                contentHash: finalHash\n              },\n              body: finalBody\n            })\n        );\n      });\n  }\n\n  /** Serialize and write a fully-stamped record, then patch the index. */\n  private _persist(\n    record: IMemoryRecord<string>,\n    scope: MemoryScopeKey,\n    idStem: string\n  ): Result<IMemoryRecord<unknown>> {\n    return serializeMemoryFile(record.envelope, record.body)\n      .onSuccess((raw) => this._writeFile(scope, idStem, raw))\n      .onSuccess(() => this._index.patch('put', { scope, record }))\n      .onSuccess(() => succeed(record));\n  }\n\n  private async _deleteLocked(kind: Kind, entityId: EntityId): Promise<Result<MemoryId>> {\n    return this._codecFor(kind)\n      .onSuccess((codec) => codec.encode(entityId))\n      .thenOnSuccess((addr) => {\n        if (addr.isVersioned) {\n          return Promise.resolve(\n            fail<MemoryId>(`memory delete '${entityId}': versioned/temporal layout not yet supported`)\n          );\n        }\n        return this._readRecord(addr.scope, addr.idStem).thenOnSuccess((existing) => {\n          if (existing === undefined) {\n            return Promise.resolve(fail<MemoryId>(`memory delete '${entityId}': no record found`));\n          }\n          // Delete the record file + index entry (authoritative), then prune the\n          // vector best-effort: a committed delete must not fail because the\n          // derived index could not be pruned.\n          return this._deleteFile(addr.scope, addr.idStem)\n            .onSuccess(() => this._index.patch('delete', { scope: addr.scope, record: existing }))\n            .thenOnSuccess(async () => {\n              await this._removeVectorBestEffort(existing.envelope.id);\n              return succeed(existing.envelope.id);\n            });\n        });\n      });\n  }\n\n  /** Evict (physically delete) a single record file by id, patching the index. */\n  private _evict(scope: MemoryScopeKey, id: MemoryId): Result<MemoryId> {\n    return this._readRecord(scope, id).onSuccess((existing) => {\n      if (existing === undefined) {\n        return fail(`memory put: cannot evict '${id}' in scope '${scope}': not found`);\n      }\n      return this._deleteFile(scope, id)\n        .onSuccess(() => this._index.patch('delete', { scope, record: existing }))\n        .onSuccess(() => succeed(id));\n    });\n  }\n\n  /** Project the incoming record's mutable fields into a merge-patch. */\n  private _projectMutablePatch(\n    record: IMemoryRecord<unknown>,\n    mutableFields: ReadonlyArray<string>\n  ): Record<string, unknown> {\n    const patch: Record<string, unknown> = {};\n    for (const field of mutableFields) {\n      const accessor: ((record: IMemoryRecord<unknown>) => unknown) | undefined =\n        FileTreeMemoryStore._mutableFieldAccessors.get(field);\n      if (accessor !== undefined) {\n        const value: unknown = accessor(record);\n        if (value !== undefined) {\n          patch[field] = value;\n        }\n      }\n    }\n    return patch;\n  }\n\n  /**\n   * The admission cohort for a write: every indexed record in `scope` of `kind`\n   * except the one at `idStem` (the record being written or updated). This is\n   * the set a per-kind cap (e.g. {@link MemoryCapCullPolicy}) counts against, so\n   * a bounded-ring policy can keep a per-scope/per-kind family within\n   * `maxRecords`. Excluding the target id makes the post-write count uniform\n   * across first-writes and updates.\n   */\n  private _admissionCohort(\n    scope: MemoryScopeKey,\n    kind: Kind,\n    idStem: string\n  ): ReadonlyArray<IMemoryRecord<unknown>> {\n    return this._index\n      .entries()\n      .filter(\n        (entry) =>\n          entry.scope === scope && entry.record.envelope.kind === kind && entry.record.envelope.id !== idStem\n      )\n      .map((entry) => entry.record);\n  }\n\n  /** Find a record in `scope` whose `contentHash` equals `hash`, if any. */\n  private _findByContentHash(scope: MemoryScopeKey, hash: string): IMemoryRecord<unknown> | undefined {\n    const match: IIndexedMemoryRecord | undefined = this._index\n      .entries()\n      .find((entry) => entry.scope === scope && entry.record.envelope.contentHash === hash);\n    return match?.record;\n  }\n\n  private _contentHash(kind: Kind, body: string, links: IMemoryEnvelope['links']): Result<string> {\n    return this._hasher.computeHash({ kind, body, links });\n  }\n\n  private _codecFor(kind: Kind): Result<IIdentityCodec> {\n    const codec: IIdentityCodec | undefined = this._codecs.get(kind) ?? this._defaultCodec;\n    if (codec === undefined) {\n      return fail(`no identity codec registered for kind '${kind}'`);\n    }\n    return succeed(codec);\n  }\n\n  private _policyFor(kind: Kind): IWritePolicy {\n    return this._writePolicies.get(kind) ?? this._defaultPolicy;\n  }\n\n  /**\n   * Read and validate the record at `<scope>/<idStem>.md`, returning `undefined`\n   * when the scope directory or file is absent. Verifies the on-disk id ↔\n   * filename round-trip on every load.\n   */\n  private _readRecord(scope: MemoryScopeKey, idStem: string): Result<IMemoryRecord<unknown> | undefined> {\n    return this._resolveScopeDir(scope).onSuccess((scopeDir) => {\n      if (scopeDir === undefined) {\n        return succeed(undefined);\n      }\n      return scopeDir.getChildren().onSuccess((children) => {\n        const targetName: string = `${idStem}${MEMORY_FILE_EXTENSION}`;\n        const file: FileTree.IFileTreeFileItem | undefined = children.find(\n          (c): c is FileTree.IFileTreeFileItem => c.type === 'file' && c.name === targetName\n        );\n        if (file === undefined) {\n          return succeed(undefined);\n        }\n        return file\n          .getRawContents()\n          .onSuccess((raw) => parseMemoryFile(raw, this._registry))\n          .onSuccess((parsedRecord) => this._verifyLoaded(scope, file, parsedRecord));\n      });\n    });\n  }\n\n  /** Enforce `envelope.id === filename stem` and the codec round-trip on load. */\n  private _verifyLoaded(\n    scope: MemoryScopeKey,\n    file: FileTree.IFileTreeFileItem,\n    record: IMemoryRecord<unknown>\n  ): Result<IMemoryRecord<unknown>> {\n    if (record.envelope.id !== file.baseName) {\n      return fail(\n        `memory file '${file.absolutePath}': envelope id '${record.envelope.id}' does not match filename stem '${file.baseName}'`\n      );\n    }\n    return this._codecFor(record.envelope.kind)\n      .onSuccess((codec) => codec.verifyRoundTrip(scope, file.baseName))\n      .withErrorFormat((msg) => `memory file '${file.absolutePath}': ${msg}`)\n      .onSuccess(() => succeed(record));\n  }\n\n  /**\n   * Resolve the directory for a scope, returning `undefined` when it does not\n   * exist. Navigation only — does not create. Folds the path segments through\n   * `getChildren` so an absent segment short-circuits to `undefined`.\n   */\n  private _resolveScopeDir(scope: MemoryScopeKey): Result<FileTree.IFileTreeDirectoryItem | undefined> {\n    return this._scopeEncoding(scope).onSuccess((encoded) => {\n      const segments: string[] = encoded.split('/').filter((s) => s.length > 0);\n      return segments.reduce<Result<FileTree.IFileTreeDirectoryItem | undefined>>(\n        (acc, segment) =>\n          acc.onSuccess((current) => {\n            if (current === undefined) {\n              return succeed(undefined);\n            }\n            return current\n              .getChildren()\n              .onSuccess((children) =>\n                succeed(\n                  children.find(\n                    (c): c is FileTree.IFileTreeDirectoryItem => c.type === 'directory' && c.name === segment\n                  )\n                )\n              );\n          }),\n        succeed(this._root)\n      );\n    });\n  }\n\n  /** Ensure the scope directory exists, creating segments as needed. */\n  private _ensureScopeDir(scope: MemoryScopeKey): Result<FileTree.IMutableFileTreeDirectoryItem> {\n    return this._scopeEncoding(scope).onSuccess((encoded) => {\n      const segments: string[] = encoded.split('/').filter((s) => s.length > 0);\n      return segments.reduce<Result<FileTree.IMutableFileTreeDirectoryItem>>(\n        (acc, segment) =>\n          acc.onSuccess((current) =>\n            current.getChildren().onSuccess((children) => {\n              const existing: FileTree.FileTreeItem | undefined = children.find(\n                (c) => c.type === 'directory' && c.name === segment\n              );\n              if (existing === undefined) {\n                return current.createChildDirectory(segment);\n              }\n              /* c8 ignore next 3 -- defensive: a child of a mutable in-memory/fs tree is itself mutable; the guard protects against a read-only adapter handed in as root */\n              if (!FileTree.isMutableDirectoryItem(existing)) {\n                return fail(`${existing.absolutePath}: directory is not mutable`);\n              }\n              return succeed(existing);\n            })\n          ),\n        succeed(this._root)\n      );\n    });\n  }\n\n  /** Write (create or overwrite) `<scope>/<idStem>.md` with `raw`. */\n  private _writeFile(scope: MemoryScopeKey, idStem: string, raw: string): Result<true> {\n    return this._ensureScopeDir(scope).onSuccess((scopeDir) =>\n      scopeDir.getChildren().onSuccess((children) => {\n        const fileName: string = `${idStem}${MEMORY_FILE_EXTENSION}`;\n        const existing: FileTree.FileTreeItem | undefined = children.find(\n          (c) => c.type === 'file' && c.name === fileName\n        );\n        if (existing === undefined) {\n          return scopeDir.createChildFile(fileName, raw).onSuccess(() => succeed(true));\n        }\n        /* c8 ignore next 3 -- defensive: a file in a mutable tree is mutable; guards a read-only adapter */\n        if (!FileTree.isMutableFileItem(existing)) {\n          return fail(`${existing.absolutePath}: file is not mutable`);\n        }\n        return existing.setRawContents(raw).onSuccess(() => succeed(true));\n      })\n    );\n  }\n\n  /**\n   * Physically delete `<scope>/<idStem>.md`. The scope-missing and file-missing\n   * guards are unreachable through the callers (`delete` / `_evict` both read the\n   * record first, so the directory and file exist) but are kept so a future\n   * direct caller degrades loudly rather than silently.\n   */\n  private _deleteFile(scope: MemoryScopeKey, idStem: string): Result<true> {\n    return this._resolveScopeDir(scope).onSuccess((scopeDir) => {\n      /* c8 ignore next 3 -- unreachable: callers read the record (hence the scope dir) first */\n      if (scopeDir === undefined) {\n        return fail(`memory delete: scope '${scope}' not found`);\n      }\n      const fileName: string = `${idStem}${MEMORY_FILE_EXTENSION}`;\n      return scopeDir.getChildren().onSuccess((children) => {\n        const file: FileTree.FileTreeItem | undefined = children.find(\n          (c) => c.type === 'file' && c.name === fileName\n        );\n        /* c8 ignore next 3 -- unreachable: callers read the record (hence the file) first */\n        if (file === undefined) {\n          return fail(`memory delete: file '${fileName}' not found in scope '${scope}'`);\n        }\n        /* c8 ignore next 3 -- defensive: a file in a mutable tree is mutable; guards a read-only adapter */\n        if (!FileTree.isMutableFileItem(file)) {\n          return fail(`${file.absolutePath}: file is not mutable`);\n        }\n        return file.delete().onSuccess(() => succeed(true));\n      });\n    });\n  }\n\n  /**\n   * Walk the FileTree once and rebuild the index. Also resumes the `seq`\n   * counter past the highest persisted `seq` so new writes stay monotonic.\n   */\n  private _initialIndex(): Result<true> {\n    return this._collectEntries(this._root, []).onSuccess((entries) =>\n      this._index.rebuild(entries).onSuccess(() => {\n        for (const entry of entries) {\n          if (entry.record.envelope.seq > this._seq) {\n            this._seq = entry.record.envelope.seq;\n          }\n        }\n        return succeed(true);\n      })\n    );\n  }\n\n  /** Recursively collect every `.md` record under `dir` (scope = path segments). */\n  private _collectEntries(\n    dir: FileTree.IFileTreeDirectoryItem,\n    scopeSegments: ReadonlyArray<string>\n  ): Result<ReadonlyArray<IIndexedMemoryRecord>> {\n    return dir.getChildren().onSuccess((children) => {\n      const results: Result<ReadonlyArray<IIndexedMemoryRecord>>[] = children.map((child) => {\n        if (child.type === 'directory') {\n          return this._collectEntries(child, [...scopeSegments, child.name]);\n        }\n        if (!child.name.endsWith(MEMORY_FILE_EXTENSION) || scopeSegments.length === 0) {\n          // Skip non-record files and any record-shaped file sitting at the root\n          // (records always live under at least one scope segment).\n          return succeed<ReadonlyArray<IIndexedMemoryRecord>>([]);\n        }\n        const scope: MemoryScopeKey = scopeSegments.join('/') as MemoryScopeKey;\n        return child\n          .getRawContents()\n          .onSuccess((raw) => parseMemoryFile(raw, this._registry))\n          .onSuccess((parsedRecord) => this._verifyLoaded(scope, child, parsedRecord))\n          .onSuccess((verified) =>\n            succeed<ReadonlyArray<IIndexedMemoryRecord>>([{ scope, record: verified }])\n          );\n      });\n      return mapResults(results).onSuccess((perChild) =>\n        succeed<ReadonlyArray<IIndexedMemoryRecord>>(perChild.flat())\n      );\n    });\n  }\n}\n"]}

package/lib/packlets/store/index.d.ts

@@ -0,0 +1,3 @@
+export * from './fileTreeMemoryStore';
+export * from './scopeEncoding';
+//# sourceMappingURL=index.d.ts.map

package/lib/packlets/store/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/packlets/store/index.ts"],"names":[],"mappings":"AAKA,cAAc,uBAAuB,CAAC;AACtC,cAAc,iBAAiB,CAAC"}

package/lib/packlets/store/index.js

@@ -0,0 +1,23 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./fileTreeMemoryStore"), exports);
+__exportStar(require("./scopeEncoding"), exports);
+//# sourceMappingURL=index.js.map

package/lib/packlets/store/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/packlets/store/index.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;AAEH,wDAAsC;AACtC,kDAAgC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nexport * from './fileTreeMemoryStore';\nexport * from './scopeEncoding';\n"]}

package/lib/packlets/store/scopeEncoding.d.ts

@@ -0,0 +1,19 @@
+import { Result } from '@fgv/ts-utils';
+import { MemoryScopeKey } from '../types';
+/**
+ * Encode a {@link MemoryScopeKey} to its on-disk directory path. The scope may
+ * be multi-segment (`/`-separated) — each component is validated independently
+ * against the POSIX portable filename set (via
+ * {@link assertPortableFilenameStem}), then rejoined with `/`.
+ *
+ * @remarks
+ * This is the day-one multi-segment scope resolver design-lock §9.1 calls for:
+ * the knowledge scope is the single segment `knowledge`, while the Phase-C MTM
+ * scope `conversations/<conversationId>` is two segments. Validating each
+ * segment independently (rather than the whole path as one stem, which the
+ * `ts-prompt-assist` default encoding does) keeps the Phase-C codec additive —
+ * no scope-encoding change is needed when MTM ships.
+ * @public
+ */
+export declare function defaultMemoryScopeEncoding(scope: MemoryScopeKey): Result<string>;
+//# sourceMappingURL=scopeEncoding.d.ts.map

package/lib/packlets/store/scopeEncoding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scopeEncoding.d.ts","sourceRoot":"","sources":["../../../src/packlets/store/scopeEncoding.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAA6B,MAAM,eAAe,CAAC;AAClE,OAAO,EAAE,cAAc,EAA8B,MAAM,UAAU,CAAC;AAEtE;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC,CAYhF"}

package/lib/packlets/store/scopeEncoding.js

@@ -0,0 +1,34 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultMemoryScopeEncoding = defaultMemoryScopeEncoding;
+const ts_utils_1 = require("@fgv/ts-utils");
+const types_1 = require("../types");
+/**
+ * Encode a {@link MemoryScopeKey} to its on-disk directory path. The scope may
+ * be multi-segment (`/`-separated) — each component is validated independently
+ * against the POSIX portable filename set (via
+ * {@link assertPortableFilenameStem}), then rejoined with `/`.
+ *
+ * @remarks
+ * This is the day-one multi-segment scope resolver design-lock §9.1 calls for:
+ * the knowledge scope is the single segment `knowledge`, while the Phase-C MTM
+ * scope `conversations/<conversationId>` is two segments. Validating each
+ * segment independently (rather than the whole path as one stem, which the
+ * `ts-prompt-assist` default encoding does) keeps the Phase-C codec additive —
+ * no scope-encoding change is needed when MTM ships.
+ * @public
+ */
+function defaultMemoryScopeEncoding(scope) {
+    // `''.split('/')` yields `['']`, never `[]`, so a single empty-segment check
+    // covers the empty-scope case too.
+    const segments = scope.split('/');
+    if (segments.some((s) => s.length === 0)) {
+        return (0, ts_utils_1.fail)(`scope '${scope}': must not contain empty path segments`);
+    }
+    return (0, ts_utils_1.mapResults)(segments.map((segment) => (0, types_1.assertPortableFilenameStem)(segment).withErrorFormat((msg) => `scope '${scope}': ${msg}`))).onSuccess((validated) => (0, ts_utils_1.succeed)(validated.join('/')));
+}
+//# sourceMappingURL=scopeEncoding.js.map

package/lib/packlets/store/scopeEncoding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scopeEncoding.js","sourceRoot":"","sources":["../../../src/packlets/store/scopeEncoding.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAoBH,gEAYC;AA9BD,4CAAkE;AAClE,oCAAsE;AAEtE;;;;;;;;;;;;;;GAcG;AACH,SAAgB,0BAA0B,CAAC,KAAqB;IAC9D,6EAA6E;IAC7E,mCAAmC;IACnC,MAAM,QAAQ,GAAa,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC5C,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QACzC,OAAO,IAAA,eAAI,EAAC,UAAU,KAAK,yCAAyC,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,IAAA,qBAAU,EACf,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CACvB,IAAA,kCAA0B,EAAC,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,UAAU,KAAK,MAAM,GAAG,EAAE,CAAC,CACzF,CACF,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, fail, mapResults, succeed } from '@fgv/ts-utils';\nimport { MemoryScopeKey, assertPortableFilenameStem } from '../types';\n\n/**\n * Encode a {@link MemoryScopeKey} to its on-disk directory path. The scope may\n * be multi-segment (`/`-separated) — each component is validated independently\n * against the POSIX portable filename set (via\n * {@link assertPortableFilenameStem}), then rejoined with `/`.\n *\n * @remarks\n * This is the day-one multi-segment scope resolver design-lock §9.1 calls for:\n * the knowledge scope is the single segment `knowledge`, while the Phase-C MTM\n * scope `conversations/<conversationId>` is two segments. Validating each\n * segment independently (rather than the whole path as one stem, which the\n * `ts-prompt-assist` default encoding does) keeps the Phase-C codec additive —\n * no scope-encoding change is needed when MTM ships.\n * @public\n */\nexport function defaultMemoryScopeEncoding(scope: MemoryScopeKey): Result<string> {\n  // `''.split('/')` yields `['']`, never `[]`, so a single empty-segment check\n  // covers the empty-scope case too.\n  const segments: string[] = scope.split('/');\n  if (segments.some((s) => s.length === 0)) {\n    return fail(`scope '${scope}': must not contain empty path segments`);\n  }\n  return mapResults(\n    segments.map((segment) =>\n      assertPortableFilenameStem(segment).withErrorFormat((msg) => `scope '${scope}': ${msg}`)\n    )\n  ).onSuccess((validated) => succeed(validated.join('/')));\n}\n"]}

package/lib/packlets/types/envelope.d.ts

@@ -0,0 +1,119 @@
+import { EntityId, Kind, LinkType, MemoryId, Tag } from './ids';
+/**
+ * Origin of a provenance attribution. Open vocabulary: the three named
+ * sources are conventional, but the `(string & {})` arm admits any other
+ * source string without resignature.
+ * @public
+ */
+export type ProvenanceSource = 'agent' | 'host-ingest' | 'human' | (string & {});
+/**
+ * Structured provenance for a record or an edge. Never a flat enum — the
+ * `[key: string]: unknown` index signature lets a consumer attach an opaque
+ * domain payload (e.g. PersonAIlity's sentiment / epistemic blocks) without
+ * changing this interface, while still satisfying the no-`any` rule.
+ * @public
+ */
+export interface IProvenance {
+    /** Where the attribution came from. */
+    readonly source: ProvenanceSource;
+    /** Optional human or agent identifier responsible for the write. */
+    readonly by?: string;
+    /** Optional model identifier, when a model produced the content. */
+    readonly model?: string;
+    /** Optional confidence in `[0, 1]`. */
+    readonly confidence?: number;
+    /** Back-link to the source experience record. Enables the cross-kind provenance spine. */
+    readonly derivedFrom?: MemoryId;
+    /** Opaque extension payload — consumer-owned, never interpreted by the store. */
+    readonly [key: string]: unknown;
+}
+/**
+ * An attributed link between two records. Carries the relation type, the
+ * target id, and optional confidence / provenance / world-truth validity.
+ * Replaces bare string references (e.g. PersonAIlity's `IMtmRef` becomes an
+ * `IEdge` with `type: LinkType('mtm-ref')`).
+ * @public
+ */
+export interface IEdge {
+    /** Open-vocabulary relation type. */
+    readonly type: LinkType;
+    /** The linked-to record. */
+    readonly target: MemoryId;
+    /** Optional confidence in `[0, 1]`. */
+    readonly confidence?: number;
+    /** Optional structured provenance for the link itself. */
+    readonly provenance?: IProvenance;
+    /** World-truth validity start (epoch ms). Present only on temporal edges. */
+    readonly valid_at?: number;
+    /**
+     * World-truth validity end (epoch ms). `null` = still valid; absent = no
+     * temporal extent.
+     */
+    readonly invalid_at?: number | null;
+}
+/**
+ * Optional bi-temporal validity block on an envelope. Present only on
+ * temporal kinds; absent = zero cost for atemporal kinds.
+ * @public
+ */
+export interface ITemporalBlock {
+    /** World-truth validity start (epoch ms). */
+    readonly valid_at?: number;
+    /** World-truth validity end (epoch ms). `null` = still valid. */
+    readonly invalid_at?: number | null;
+}
+/**
+ * The invariant identity + transaction-time envelope carried by every memory
+ * record, independent of the per-kind body.
+ * @public
+ */
+export interface IMemoryEnvelope {
+    /** Stable file-stem identifier. MUST equal the on-disk filename stem. */
+    readonly id: MemoryId;
+    /** Consumer-supplied domain key. Equals {@link IMemoryEnvelope.id | id} for non-temporal kinds. */
+    readonly entityId: EntityId;
+    /** Consumer-registered kind; dispatches the body Converter. */
+    readonly kind: Kind;
+    /** Open-vocabulary tags. */
+    readonly tags: ReadonlyArray<Tag>;
+    /** Attributed outbound edges. */
+    readonly links: ReadonlyArray<IEdge>;
+    /** Epoch ms of the first write. Immutable after creation. */
+    readonly created: number;
+    /** Epoch ms of the most recent write. */
+    readonly updated: number;
+    /**
+     * Monotonic write counter within the store instance, assigned by the store
+     * on every successful put. Enables stable cursor paging over observation
+     * records without a full walk.
+     */
+    readonly seq: number;
+    /**
+     * Content hash over the canonical `{ kind, body, links }`. The dedup key:
+     * an exact match is a no-op upsert that returns the existing record.
+     */
+    readonly contentHash: string;
+    /** Structured provenance (never a flat enum). */
+    readonly provenance: IProvenance;
+    /** Bi-temporal validity. Present only on temporal kinds. */
+    readonly temporal?: ITemporalBlock;
+    /**
+     * Vector-index entry reference, set by the vector index on write. `null` =
+     * not embedded; absent = same as `null` (backwards-compat seam).
+     */
+    readonly embeddingRef?: string | null;
+}
+/**
+ * A complete memory record: the invariant {@link IMemoryEnvelope} plus the
+ * typed, per-kind body. The store's public surface uses
+ * `IMemoryRecord<unknown>`; consumers narrow `TBody` by checking
+ * `envelope.kind` and validating through the registered Converter.
+ * @public
+ */
+export interface IMemoryRecord<TBody = unknown> {
+    /** The invariant identity + transaction-time envelope. */
+    readonly envelope: IMemoryEnvelope;
+    /** The per-kind, Converter-validated body. */
+    readonly body: TBody;
+}
+//# sourceMappingURL=envelope.d.ts.map

package/lib/packlets/types/envelope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"envelope.d.ts","sourceRoot":"","sources":["../../../src/packlets/types/envelope.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAEhE;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,aAAa,GAAG,OAAO,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAEjF;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,uCAAuC;IACvC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAClC,oEAAoE;IACpE,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACrB,oEAAoE;IACpE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,uCAAuC;IACvC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,0FAA0F;IAC1F,QAAQ,CAAC,WAAW,CAAC,EAAE,QAAQ,CAAC;IAChC,iFAAiF;IACjF,QAAQ,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACjC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,KAAK;IACpB,qCAAqC;IACrC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,4BAA4B;IAC5B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,uCAAuC;IACvC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC;IAC7B,0DAA0D;IAC1D,QAAQ,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC;IAClC,6EAA6E;IAC7E,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B;;;OAGG;IAEH,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,6CAA6C;IAC7C,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,iEAAiE;IAEjE,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACrC;AAED;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAE9B,yEAAyE;IACzE,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,mGAAmG;IACnG,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,+DAA+D;IAC/D,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IACpB,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC;IAClC,iCAAiC;IACjC,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC;IAGrC,6DAA6D;IAC7D,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,yCAAyC;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB;;;;OAIG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB;;;OAGG;IACH,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,iDAAiD;IACjD,QAAQ,CAAC,UAAU,EAAE,WAAW,CAAC;IAGjC,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,CAAC,EAAE,cAAc,CAAC;IAEnC;;;OAGG;IAEH,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACvC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,KAAK,GAAG,OAAO;IAC5C,0DAA0D;IAC1D,QAAQ,CAAC,QAAQ,EAAE,eAAe,CAAC;IACnC,8CAA8C;IAC9C,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;CACtB"}

package/lib/packlets/types/envelope.js

@@ -0,0 +1,7 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=envelope.js.map

package/lib/packlets/types/envelope.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"envelope.js","sourceRoot":"","sources":["../../../src/packlets/types/envelope.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { EntityId, Kind, LinkType, MemoryId, Tag } from './ids';\n\n/**\n * Origin of a provenance attribution. Open vocabulary: the three named\n * sources are conventional, but the `(string & {})` arm admits any other\n * source string without resignature.\n * @public\n */\nexport type ProvenanceSource = 'agent' | 'host-ingest' | 'human' | (string & {});\n\n/**\n * Structured provenance for a record or an edge. Never a flat enum — the\n * `[key: string]: unknown` index signature lets a consumer attach an opaque\n * domain payload (e.g. PersonAIlity's sentiment / epistemic blocks) without\n * changing this interface, while still satisfying the no-`any` rule.\n * @public\n */\nexport interface IProvenance {\n  /** Where the attribution came from. */\n  readonly source: ProvenanceSource;\n  /** Optional human or agent identifier responsible for the write. */\n  readonly by?: string;\n  /** Optional model identifier, when a model produced the content. */\n  readonly model?: string;\n  /** Optional confidence in `[0, 1]`. */\n  readonly confidence?: number;\n  /** Back-link to the source experience record. Enables the cross-kind provenance spine. */\n  readonly derivedFrom?: MemoryId;\n  /** Opaque extension payload — consumer-owned, never interpreted by the store. */\n  readonly [key: string]: unknown;\n}\n\n/**\n * An attributed link between two records. Carries the relation type, the\n * target id, and optional confidence / provenance / world-truth validity.\n * Replaces bare string references (e.g. PersonAIlity's `IMtmRef` becomes an\n * `IEdge` with `type: LinkType('mtm-ref')`).\n * @public\n */\nexport interface IEdge {\n  /** Open-vocabulary relation type. */\n  readonly type: LinkType;\n  /** The linked-to record. */\n  readonly target: MemoryId;\n  /** Optional confidence in `[0, 1]`. */\n  readonly confidence?: number;\n  /** Optional structured provenance for the link itself. */\n  readonly provenance?: IProvenance;\n  /** World-truth validity start (epoch ms). Present only on temporal edges. */\n  readonly valid_at?: number;\n  /**\n   * World-truth validity end (epoch ms). `null` = still valid; absent = no\n   * temporal extent.\n   */\n  // eslint-disable-next-line @rushstack/no-new-null -- null is a meaningful value here (still-valid) distinct from absent (no temporal extent); design-lock §2.3\n  readonly invalid_at?: number | null;\n}\n\n/**\n * Optional bi-temporal validity block on an envelope. Present only on\n * temporal kinds; absent = zero cost for atemporal kinds.\n * @public\n */\nexport interface ITemporalBlock {\n  /** World-truth validity start (epoch ms). */\n  readonly valid_at?: number;\n  /** World-truth validity end (epoch ms). `null` = still valid. */\n  // eslint-disable-next-line @rushstack/no-new-null -- null is a meaningful value here (still-valid) distinct from absent; design-lock §2.4\n  readonly invalid_at?: number | null;\n}\n\n/**\n * The invariant identity + transaction-time envelope carried by every memory\n * record, independent of the per-kind body.\n * @public\n */\nexport interface IMemoryEnvelope {\n  // --- Core identity ---\n  /** Stable file-stem identifier. MUST equal the on-disk filename stem. */\n  readonly id: MemoryId;\n  /** Consumer-supplied domain key. Equals {@link IMemoryEnvelope.id | id} for non-temporal kinds. */\n  readonly entityId: EntityId;\n  /** Consumer-registered kind; dispatches the body Converter. */\n  readonly kind: Kind;\n  /** Open-vocabulary tags. */\n  readonly tags: ReadonlyArray<Tag>;\n  /** Attributed outbound edges. */\n  readonly links: ReadonlyArray<IEdge>;\n\n  // --- Transaction-time metadata (always present) ---\n  /** Epoch ms of the first write. Immutable after creation. */\n  readonly created: number;\n  /** Epoch ms of the most recent write. */\n  readonly updated: number;\n  /**\n   * Monotonic write counter within the store instance, assigned by the store\n   * on every successful put. Enables stable cursor paging over observation\n   * records without a full walk.\n   */\n  readonly seq: number;\n  /**\n   * Content hash over the canonical `{ kind, body, links }`. The dedup key:\n   * an exact match is a no-op upsert that returns the existing record.\n   */\n  readonly contentHash: string;\n  /** Structured provenance (never a flat enum). */\n  readonly provenance: IProvenance;\n\n  // --- Optional temporal block ---\n  /** Bi-temporal validity. Present only on temporal kinds. */\n  readonly temporal?: ITemporalBlock;\n\n  /**\n   * Vector-index entry reference, set by the vector index on write. `null` =\n   * not embedded; absent = same as `null` (backwards-compat seam).\n   */\n  // eslint-disable-next-line @rushstack/no-new-null -- null is the explicit \"not embedded\" sentinel distinct from absent (backwards-compat seam); design-lock §2.5\n  readonly embeddingRef?: string | null;\n}\n\n/**\n * A complete memory record: the invariant {@link IMemoryEnvelope} plus the\n * typed, per-kind body. The store's public surface uses\n * `IMemoryRecord<unknown>`; consumers narrow `TBody` by checking\n * `envelope.kind` and validating through the registered Converter.\n * @public\n */\nexport interface IMemoryRecord<TBody = unknown> {\n  /** The invariant identity + transaction-time envelope. */\n  readonly envelope: IMemoryEnvelope;\n  /** The per-kind, Converter-validated body. */\n  readonly body: TBody;\n}\n"]}

package/lib/packlets/types/filenameSafety.d.ts

@@ -0,0 +1,16 @@
+import { Result } from '@fgv/ts-utils';
+/**
+ * Validates a single filename stem against the POSIX portable filename set
+ * (`[A-Za-z0-9._-]`), rejecting a leading or trailing `.` and reserved Windows
+ * device names. This is the cross-platform filename-stem contract for the
+ * package: {@link MemoryId} values, the concrete {@link IIdentityCodec}
+ * implementations, and the store's `verifyFilenameId` all gate on it.
+ *
+ * @remarks
+ * A trailing `.` is rejected because Windows silently strips trailing dots from
+ * filenames, so such a stem would not round-trip verbatim through the file
+ * layer even though it is otherwise portable-set-valid.
+ * @public
+ */
+export declare function assertPortableFilenameStem(stem: string): Result<string>;
+//# sourceMappingURL=filenameSafety.d.ts.map

package/lib/packlets/types/filenameSafety.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filenameSafety.d.ts","sourceRoot":"","sources":["../../../src/packlets/types/filenameSafety.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AAkBtD;;;;;;;;;;;;GAYG;AACH,wBAAgB,0BAA0B,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAoBvE"}

package/lib/packlets/types/filenameSafety.js

@@ -0,0 +1,55 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.assertPortableFilenameStem = assertPortableFilenameStem;
+const ts_utils_1 = require("@fgv/ts-utils");
+/**
+ * Reserved Windows device basenames. Includes `COM0..9` and `LPT0..9` — the
+ * 0-suffixed variants were added in Windows 11 / Server 2022. Matched
+ * case-insensitively against the basename (text before the first `.`).
+ */
+const RESERVED_WIN_DEVICES = new Set([
+    'CON',
+    'PRN',
+    'AUX',
+    'NUL',
+    ...Array.from({ length: 10 }, (__v, i) => `COM${i}`),
+    ...Array.from({ length: 10 }, (__v, i) => `LPT${i}`)
+]);
+const PORTABLE_FILENAME_RE = /^[A-Za-z0-9._-]+$/;
+/**
+ * Validates a single filename stem against the POSIX portable filename set
+ * (`[A-Za-z0-9._-]`), rejecting a leading or trailing `.` and reserved Windows
+ * device names. This is the cross-platform filename-stem contract for the
+ * package: {@link MemoryId} values, the concrete {@link IIdentityCodec}
+ * implementations, and the store's `verifyFilenameId` all gate on it.
+ *
+ * @remarks
+ * A trailing `.` is rejected because Windows silently strips trailing dots from
+ * filenames, so such a stem would not round-trip verbatim through the file
+ * layer even though it is otherwise portable-set-valid.
+ * @public
+ */
+function assertPortableFilenameStem(stem) {
+    if (stem.length === 0) {
+        return (0, ts_utils_1.fail)('idStem: must be a non-empty string');
+    }
+    if (stem.startsWith('.')) {
+        return (0, ts_utils_1.fail)(`idStem '${stem}': may not begin with '.'`);
+    }
+    if (stem.endsWith('.')) {
+        return (0, ts_utils_1.fail)(`idStem '${stem}': may not end with '.' (Windows strips trailing dots)`);
+    }
+    if (!PORTABLE_FILENAME_RE.test(stem)) {
+        return (0, ts_utils_1.fail)(`idStem '${stem}': contains characters outside the POSIX portable filename set ([A-Za-z0-9._-])`);
+    }
+    const basename = stem.split('.')[0];
+    if (RESERVED_WIN_DEVICES.has(basename.toUpperCase())) {
+        return (0, ts_utils_1.fail)(`idStem '${stem}': basename '${basename}' matches a reserved Windows device name`);
+    }
+    return (0, ts_utils_1.succeed)(stem);
+}
+//# sourceMappingURL=filenameSafety.js.map

package/lib/packlets/types/filenameSafety.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filenameSafety.js","sourceRoot":"","sources":["../../../src/packlets/types/filenameSafety.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAiCH,gEAoBC;AAnDD,4CAAsD;AAEtD;;;;GAIG;AACH,MAAM,oBAAoB,GAAwB,IAAI,GAAG,CAAS;IAChE,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;IACpD,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;CACrD,CAAC,CAAC;AAEH,MAAM,oBAAoB,GAAW,mBAAmB,CAAC;AAEzD;;;;;;;;;;;;GAYG;AACH,SAAgB,0BAA0B,CAAC,IAAY;IACrD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,OAAO,IAAA,eAAI,EAAC,oCAAoC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACzB,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,2BAA2B,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,wDAAwD,CAAC,CAAC;IACvF,CAAC;IACD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACrC,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,iFAAiF,CACjG,CAAC;IACJ,CAAC;IACD,MAAM,QAAQ,GAAW,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5C,IAAI,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;QACrD,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,gBAAgB,QAAQ,0CAA0C,CAAC,CAAC;IACjG,CAAC;IACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, fail, succeed } from '@fgv/ts-utils';\n\n/**\n * Reserved Windows device basenames. Includes `COM0..9` and `LPT0..9` — the\n * 0-suffixed variants were added in Windows 11 / Server 2022. Matched\n * case-insensitively against the basename (text before the first `.`).\n */\nconst RESERVED_WIN_DEVICES: ReadonlySet<string> = new Set<string>([\n  'CON',\n  'PRN',\n  'AUX',\n  'NUL',\n  ...Array.from({ length: 10 }, (__v, i) => `COM${i}`),\n  ...Array.from({ length: 10 }, (__v, i) => `LPT${i}`)\n]);\n\nconst PORTABLE_FILENAME_RE: RegExp = /^[A-Za-z0-9._-]+$/;\n\n/**\n * Validates a single filename stem against the POSIX portable filename set\n * (`[A-Za-z0-9._-]`), rejecting a leading or trailing `.` and reserved Windows\n * device names. This is the cross-platform filename-stem contract for the\n * package: {@link MemoryId} values, the concrete {@link IIdentityCodec}\n * implementations, and the store's `verifyFilenameId` all gate on it.\n *\n * @remarks\n * A trailing `.` is rejected because Windows silently strips trailing dots from\n * filenames, so such a stem would not round-trip verbatim through the file\n * layer even though it is otherwise portable-set-valid.\n * @public\n */\nexport function assertPortableFilenameStem(stem: string): Result<string> {\n  if (stem.length === 0) {\n    return fail('idStem: must be a non-empty string');\n  }\n  if (stem.startsWith('.')) {\n    return fail(`idStem '${stem}': may not begin with '.'`);\n  }\n  if (stem.endsWith('.')) {\n    return fail(`idStem '${stem}': may not end with '.' (Windows strips trailing dots)`);\n  }\n  if (!PORTABLE_FILENAME_RE.test(stem)) {\n    return fail(\n      `idStem '${stem}': contains characters outside the POSIX portable filename set ([A-Za-z0-9._-])`\n    );\n  }\n  const basename: string = stem.split('.')[0];\n  if (RESERVED_WIN_DEVICES.has(basename.toUpperCase())) {\n    return fail(`idStem '${stem}': basename '${basename}' matches a reserved Windows device name`);\n  }\n  return succeed(stem);\n}\n"]}