@fgv/ts-agent-memory 5.1.0-49 → 5.1.0-50

package/lib/packlets/ingest/orchestrator.js.map

@@ -1 +1 @@
-{"version":3,"file":"orchestrator.js","sourceRoot":"","sources":["../../../src/packlets/ingest/orchestrator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAiF;AACjF,oCAkBkB;AAIlB,6CAA+D;AAoB/D;;;GAGG;AACU,QAAA,6BAA6B,GAAW,aAAa,CAAC;AAEnE;;;;GAIG;AACU,QAAA,qBAAqB,GAAa,aAAyB,CAAC;AAEzE;;;;;GAKG;AACU,QAAA,4BAA4B,GAAW,IAAI,CAAC;AAEzD;;;GAGG;AACU,QAAA,wBAAwB,GAAW,CAAC,CAAC;AAsHlD;;;GAGG;AACH,MAAa,wBAAwB;IAenC,YAAoB,MAA6C;;QAC/D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,GAAG,EAAwB,CAAC;QAChE,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC;QACrC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,kBAAkB,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACnD,IAAI,CAAC,WAAW;YACd,MAAM,CAAC,cAAc,KAAK,SAAS,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS;gBACnG,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,cAAc,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE;gBAC3F,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,CAAC,oBAAoB,GAAG,MAAA,MAAM,CAAC,mBAAmB,mCAAI,oCAA4B,CAAC;QACvF,IAAI,CAAC,eAAe,GAAG,MAAA,MAAM,CAAC,cAAc,mCAAI,gCAAwB,CAAC;QACzE,IAAI,CAAC,WAAW,GAAG,MAAA,MAAM,CAAC,UAAU,mCAAI,QAAQ,CAAC;QACjD,IAAI,CAAC,OAAO,GAAG,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,kBAAO,CAAC,UAAU,EAAE,CAAC;QACzD,IAAI,CAAC,OAAO,GAAG,IAAI,eAAI,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,MAA6C;QAChE,OAAO,IAAA,kBAAO,EAAC,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,yDAAyD;IAClD,KAAK,CAAC,UAAU,CAAC,IAAiB;QACvC,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aAChC,aAAa,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;aACtE,aAAa,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,0DAA0D;IACnD,KAAK,CAAC,WAAW,CACtB,KAAiC;QAEjC,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAA8B,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;gBACvB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,gFAAgF;IACxE,KAAK,CAAC,SAAS,CAAC,IAAiB;QACvC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,aAAa,CAAC,CAAC;IAC/F,CAAC;IAED,+EAA+E;IACvE,KAAK,CAAC,QAAQ,CACpB,IAAiB,EACjB,cAAqC;QAErC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,cAAc,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC;IAC5G,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,kBAAkB,CAC9B,IAAiB,EACjB,UAA2C;QAE3C,8EAA8E;QAC9E,wBAAwB;QACxB,MAAM,cAAc,GAAkD,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC/F,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,gCAAgC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,MAAM,QAAQ,GAA0C,cAAc,CAAC,KAAK,CAAC;QAC7E,8EAA8E;QAC9E,4EAA4E;QAC5E,8EAA8E;QAC9E,qEAAqE;QACrE,MAAM,YAAY,GAAyC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACxF,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;YAC7B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,MAAM,MAAM,GAAiC,YAAY,CAAC,KAAK,CAAC;QAChE,MAAM,KAAK,GAAgD,IAAI,GAAG,CAChE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CACxD,CAAC;QAEF,+DAA+D;QAC/D,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,UAAU,GAA2B,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvG,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAED,wEAAwE;QACxE,MAAM,aAAa,GAAqB,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,CAAC,CAAC;QACxG,MAAM,WAAW,GAA0C,MAAM,IAAI,CAAC,OAAO,CAC3E,IAAI,EACJ,aAAa,EACb,wBAAwB,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAClD,MAAM,EACN,KAAK,CACN,CAAC;QACF,IAAI,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC;YAC5B,OAAO,IAAA,eAAI,EAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,KAAK,GAAkC,WAAW,CAAC,KAAK,CAAC;QAE/D,sDAAsD;QACtD,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAkC,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC5F,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBACxB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,uFAAuF;IAC/E,KAAK,CAAC,cAAc,CAC1B,IAAiB,EACjB,SAA2B,EAC3B,QAA+C,EAC/C,KAAkD;QAElD,MAAM,IAAI,GAAS,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC3C,sFAAsF;QACtF,MAAM,UAAU,GAAmB,IAAI,CAAC,SAAS;aAC9C,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC;aAC7B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,IAAI,CAAC,EAAE,+BAA+B,IAAI,iBAAiB,GAAG,EAAE,CAAC;aACrG,SAAS,CAAC,GAAG,EAAE,CAAC,wBAAwB,CAAC,aAAa,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QAC5E,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,IAAI,GAAW,UAAU,CAAC,KAAK,CAAC;QAEtC,MAAM,UAAU,GAAiC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACzG,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,IAAI,GAAyB,UAAU,CAAC,KAAK,CAAC;QAEpD,OAAO,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CACtG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAC7D,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,gBAAgB,CACtB,IAAiB,EACjB,SAA2B,EAC3B,IAA0B,EAC1B,OAA0B,EAC1B,KAAkD;QAElD,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC9B,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/D,IAAA,kBAAO,EAAC;gBACN,SAAS;gBACT,YAAY,EAAE,IAAI;gBAClB,aAAa,EAAE,SAAS,CAAC,QAAQ,CAAC,QAAQ;gBAC1C,KAAK;gBACL,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;gBAC3C,OAAO;aACR,CAAC,CACH,CAAC;QACJ,CAAC;QACD,6EAA6E;QAC7E,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,MAAM,GAAuC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5F,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,MAAM,OAAO,CAAC,OAAO,YAAY,wBAAwB,CAAC,aAAa,CACvF,OAAO,CAAC,MAAM,CACf,+BAA+B,CACjC,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrD,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,MAAM,OAAO,CAAC,OAAO,YAAY,wBAAwB,CAAC,aAAa,CACvF,OAAO,CAAC,MAAM,CACf,cAAc,MAAM,CAAC,QAAQ,CAAC,IAAI,gCAAgC,SAAS,CAAC,QAAQ,CAAC,IAAI,GAAG,CAC9F,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,CAAC,OAAO,KAAK,YAAY,EAAE,CAAC;YACrC,6EAA6E;YAC7E,oEAAoE;YACpE,MAAM,cAAc,GAAa,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC1D,4EAA4E;YAC5E,0EAA0E;YAC1E,8EAA8E;YAC9E,6EAA6E;YAC7E,oDAAoD;YACpD,OAAO,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CACzF,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC9D,IAAA,kBAAO,EAAC;gBACN,SAAS;gBACT,YAAY,EAAE,UAAU;gBACxB,aAAa,EAAE,cAAc;gBAC7B,KAAK;gBACL,SAAS,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;gBACjD,OAAO;gBACP,WAAW,EAAE,MAAM;aACpB,CAAC,CACH,CACF,CAAC;QACJ,CAAC;QACD,qEAAqE;QACrE,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/D,IAAA,kBAAO,EAAC;YACN,SAAS;YACT,YAAY,EAAE,IAAI;YAClB,aAAa,EAAE,SAAS,CAAC,QAAQ,CAAC,QAAQ;YAC1C,KAAK;YACL,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;YAC3C,OAAO;SACR,CAAC,CACH,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,eAAe,CAC3B,SAA2B,EAC3B,IAAU,EACV,IAAY,EACZ,IAA0B,EAC1B,QAA+C,EAC/C,KAAkD;QAElD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE;YACtF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,yEAAyE;gBACzE,4EAA4E;gBAC5E,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;YAC1F,CAAC;YACD,MAAM,MAAM,GAAkC,IAAI,CAAC,WAAW,CAAC;YAC/D,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,2EAA2E;gBAC3E,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED,4DAA4D;IACpD,KAAK,CAAC,qBAAqB,CACjC,SAA2B,EAC3B,IAA0B,EAC1B,IAAY,EACZ,MAAyB,EACzB,KAAkD;QAElD,OAAO,wBAAwB,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa,CAC5F,CAAC,WAAW,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CACjG,CAAC;IACJ,CAAC;IAED,iFAAiF;IACzE,KAAK,CAAC,6BAA6B,CACzC,SAA2B,EAC3B,IAA0B,EAC1B,MAAyB,EACzB,KAAkD,EAClD,WAAmC;QAEnC,MAAM,QAAQ,GAAqC,MAAM,IAAI,CAAC,QAAQ,CACpE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,EAC/B,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,oBAAoB,CAC3D,CAAC;QACF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;YACzB,OAAO,IAAA,eAAI,EAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,8EAA8E;QAC9E,+EAA+E;QAC/E,yEAAyE;QACzE,mEAAmE;QACnE,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACjC,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,2EAA2E;QAC3E,4EAA4E;QAC5E,MAAM,MAAM,GAAiB,QAAQ,CAAC,KAAK,CAAC;QAC5C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CACjC,GAAG,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,EAC5D,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,qBAAqB,CAC5D,CAAC;QACF,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;YACxB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,OAAO,GAAiC,EAAE,CAAC;QACjD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAChC,4EAA4E;YAC5E,6EAA6E;YAC7E,4EAA4E;YAC5E,0EAA0E;YAC1E,0EAA0E;YAC1E,8EAA8E;YAC9E,wEAAwE;YACxE,MAAM,MAAM,GAAY,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC;YACzF,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,oBAAoB,IAAI,MAAM,EAAE,CAAC;gBACpD,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAuC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACxF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAClB,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,EACjD,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,YAAY,CACnD,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;OAqBG;IACK,eAAe,CACrB,IAAU,EACV,IAAY,EACZ,IAA0B,EAC1B,QAA+C;QAE/C,MAAM,UAAU,GAAe,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/D,8EAA8E;QAC9E,0EAA0E;QAC1E,0EAA0E;QAC1E,2EAA2E;QAC3E,uDAAuD;QACvD,MAAM,MAAM,GAA0C,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YAC/E,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAA,wBAAgB,EAAC,MAAM,CAAC,IAAI,CAAC,IAAA,wBAAgB,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC7F,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,UAAU,GAAqC,IAAI,CAAC,eAAe,CACvE,MAAM,CAAC,QAAQ,CAAC,QAAQ,EACxB,MAAM,CAAC,QAAQ,CAAC,IAAI,CACrB,CAAC,SAAS,EAAE,CAAC;YACd,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAClD,IAAA,qBAAU,EACR,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACpB,wBAAwB,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CAC1E,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,EAAE,CACvE,IAAA,kBAAO,EAAC,EAAE,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,CACpD,CACF,CACF,CACF,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,WAAC,OAAA,IAAA,kBAAO,EAAC,MAAA,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,0CAAE,EAAE,CAAC,CAAA,EAAA,CAAC,CAC9E,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,iBAAiB,CAAC,MAA8B;QAC7D,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO,IAAA,eAAI,EACT,0BAA0B,MAAM,CAAC,QAAQ,CAAC,EAAE,gCAAgC,OAAO,MAAM,CAAC,IAAI,GAAG,CAClG,CAAC;QACJ,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,0EAA0E;IAClE,SAAS,CAAC,IAAU,EAAE,IAAY;QACxC,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,+GAA+G;IACvG,KAAK,CAAC,OAAO,CACnB,IAAiB,EACjB,aAA4C,EAC5C,SAA2C,EAC3C,MAAoC,EACpC,KAAkD;QAElD,MAAM,kBAAkB,GAAyB,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC5E,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,EAAE,EAAE,IAAI,CAAC,SAAS;SACnB,CAAC,CAAC,CAAC;QACJ,MAAM,QAAQ,GAA0C,MAAM,IAAI,CAAC,QAAQ,CACzE,GAAG,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,kBAAkB,EAAE,CAAC,EAC9E,WAAW,IAAI,CAAC,EAAE,WAAW,CAC9B,CAAC;QACF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;YACzB,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,0EAA0E;QAC1E,6EAA6E;QAC7E,uEAAuE;QACvE,MAAM,KAAK,GAAkC,wBAAwB,CAAC,cAAc,CAClF,QAAQ,CAAC,KAAK,EACd,SAAS,CACV,CAAC;QACF,8EAA8E;QAC9E,2EAA2E;QAC3E,iBAAiB;QACjB,MAAM,MAAM,GAAwB,IAAI,GAAG,CACzC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAC3D,CAAC;QACF,MAAM,UAAU,GAAiB,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACjF,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YAClC,MAAM,KAAK,GAAiB,IAAA,2BAAc,EACxC,wBAAwB,CAAC,cAAc,CAAC,MAAM,CAAC,EAC/C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CACnF,CAAC;YACF,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;gBACtB,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACK,MAAM,CAAC,kBAAkB,CAAC,KAAoC;QACpE,MAAM,SAAS,GAA6B,IAAI,GAAG,EAAuB,CAAC;QAC3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;gBAC5C,SAAS,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,MAAM,CAAC,cAAc,CAC3B,KAAoC,EACpC,SAA2C;QAE3C,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACrB,MAAM,EAAE,GAA4B,SAAS,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAChF,OAAO,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAM,CAAC,KAAE,IAAI,kCAAO,CAAC,CAAC,IAAI,KAAE,MAAM,EAAE,EAAE,MAAI,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,cAAc,CACpB,IAAiB,EACjB,KAAoC,EACpC,MAA2B,EAC3B,KAAkD;QAElD,OAAO,IAAA,qBAAU,EACf,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC5C,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,mBAAmB,wBAAwB,CAAC,aAAa,CACzE,IAAI,CAAC,MAAM,CACZ,oCAAoC,CACtC,CAAC;YACJ,CAAC;YACD,MAAM,SAAS,GAAW,IAAA,qBAAa,EAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;gBACjE,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,mBAAmB,wBAAwB,CAAC,aAAa,CACzE,IAAI,CAAC,IAAI,CAAC,MAAM,CACjB,kEAAkE,CACpE,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CACH,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,uFAAuF;IAC/E,KAAK,CAAC,cAAc,CAC1B,IAAiB,EACjB,IAAoB,EACpB,QAAuC;QAEvC,MAAM,MAAM,GAAW,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,OAAO,GAAkC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC;QAC1G,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;YAC5C,4EAA4E;YAC5E,0EAA0E;YAC1E,OAAO,IAAA,kBAAO,EAAC;gBACb,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,UAAU,EAAE,IAAI,CAAC,OAAO;gBACxB,WAAW,EAAE,SAAS;gBACtB,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBAC1B,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAC3E,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;aAC5B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,IAAI,CAAC,EAAE,oBAAoB,GAAG,EAAE,CAAC;aACrE,SAAS,CAAC,CAAC,SAAS,EAAE,EAAE;YACvB,MAAM,WAAW,GAAsB,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YACpG,MAAM,SAAS,GACb,IAAI,CAAC,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,6BAAqB,CAAC;gBACzF,CAAC,CAAC,oBAAoB;gBACtB,CAAC,CAAC,SAAS,CAAC;YAChB,OAAO,IAAA,kBAAO,kBACZ,SAAS,EAAE,IAAI,CAAC,SAAS,EACzB,UAAU,EAAE,IAAI,CAAC,OAAO,EACxB,WAAW,EACX,EAAE,EAAE,SAAS,CAAC,QAAQ,CAAC,EAAE,EACzB,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,OAAO,IACX,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACjD,CAAC;QACL,CAAC,CAAC,CACL,CAAC;IACJ,CAAC;IAED,+FAA+F;IACvF,YAAY,CAClB,IAAiB,EACjB,IAAoB,EACpB,OAAsC;QAEtC,MAAM,IAAI,GACR,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;QAC1B,+EAA+E;QAC/E,+EAA+E;QAC/E,2EAA2E;QAC3E,uCAAuC;QACvC,MAAM,MAAM,GAAuC,IAAI,CAAC,WAAW,CAAC;QACpE,MAAM,UAAU,GAAyB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,MAAM,SAAS,GAAuB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvF,MAAM,eAAe,GAAgB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QACxG,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;QACzE,gFAAgF;QAChF,4EAA4E;QAC5E,gFAAgF;QAChF,mEAAmE;QACnE,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,UAAU,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;YAClG,MAAM,UAAU,+DAIX,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,GAC7C,IAAI,CAAC,UAAU,KAClB,MAAM,EAAE,qCAA6B,KAClC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACvE,CAAC;YACF,MAAM,QAAQ,mCACT,IAAI,KACP,EAAE,EACF,QAAQ,EAAE,IAAI,CAAC,aAAa,EAC5B,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,EAAE,EACf,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,CAAC,EACV,UAAU,EACV,IAAI,EAAE,wBAAwB,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,EAC/D,KAAK,GACN,CAAC;YACF,OAAO,IAAA,kBAAO,EAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED,6EAA6E;IACrE,MAAM,CAAC,UAAU,CAAC,KAAyB,EAAE,QAA4B;QAC/E,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAU,CAAC;QAC5C,MAAM,GAAG,GAAU,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,0FAA0F;IAClF,WAAW,CAAC,KAA2B;QAC7C,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAU,CAAC;QAC5C,MAAM,OAAO,GAAY,EAAE,CAAC;QAC5B,OAAO,IAAA,qBAAU,EACf,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACjB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;YAC/C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,GAAG,CAAC,CAAC;QACtB,CAAC,CAAC,CACH,CACF,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,oFAAoF;IAC5E,eAAe,CAAC,QAAkB,EAAE,IAAU;;QACpD,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,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,yGAAyG;IACjG,KAAK,CAAC,QAAQ,CAAI,EAA4B,EAAE,KAAa;QACnE,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAW,GAAG,KAAK,WAAW,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,cAAc,CAAC,MAAoC;QAChE,MAAM,KAAK,GAAsB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,aAAa,CACnB,OAA8C;QAE9C,OAAO,IAAA,qBAAU,EACf,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACrB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;aACjE,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,2CAA2C,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;aAClG,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CACpG,CACF,CAAC;IACJ,CAAC;IAED,8FAA8F;IACtF,MAAM,CAAC,aAAa,CAAC,MAAmB;QAC9C,OAAO,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;IACxC,CAAC;IAED,oFAAoF;IAC5E,MAAM,CAAC,kBAAkB,CAC/B,SAA2B,EAC3B,MAAc,EACd,IAAY;QAEZ,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YACvD,MAAM,QAAQ,mCACT,SAAS,CAAC,QAAQ,KACrB,EAAE,EACF,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,EAAE,EACf,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,CAAC,GACX,CAAC;YACF,OAAO,IAAA,kBAAO,EAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,uFAAuF;IAC/E,MAAM,CAAC,aAAa,CAAC,IAAiB,EAAE,SAA2B;QACzE,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvC,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,+BAChB,SAAS,CAAC,QAAQ,CAAC,IACrB,2BAA2B,OAAO,SAAS,CAAC,IAAI,GAAG,CACpD,CAAC;QACJ,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;CACF;AA9wBD,4DA8wBC","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 {\n  Convert,\n  DedupScope,\n  EntityId,\n  IEdge,\n  IEdgeTarget,\n  IIdentityCodec,\n  IIdentityCodecResult,\n  IMemoryEnvelope,\n  IMemoryRecord,\n  IProvenance,\n  Kind,\n  LinkType,\n  MemoryId,\n  Tag,\n  edgeTargetKey,\n  isTemporalRecord,\n  isVersionCurrent\n} from '../types';\nimport { IBodyConverterRegistry } from '../converters';\nimport { IMemoryStore } from '../store';\nimport { IVectorIndex, MemoryEmbedder } from '../vector';\nimport { ICycleGuardEdge, assertNoCycles } from './cycleGuard';\nimport {\n  IEntityResolver,\n  IFactExtractor,\n  IMemoryClassifier,\n  IRelationCandidate,\n  IRelationExtractor\n} from './hostStages';\nimport {\n  ICandidateEdge,\n  ICandidateRecord,\n  IEntityResolutionCandidate,\n  IIngestItem,\n  IIngestItemResult,\n  IIngestedRecordResult,\n  IMemoryClassification,\n  IngestDisposition,\n  ResolutionVerdict\n} from './model';\n\n/**\n * The provenance source stamped on every record the ingest pipeline writes.\n * @public\n */\nexport const HOST_INGEST_PROVENANCE_SOURCE: string = 'host-ingest';\n\n/**\n * The link type whose presence on a temporal-kind candidate fires the\n * contradicts→temporal-versioned interlock.\n * @public\n */\nexport const CONTRADICTS_LINK_TYPE: LinkType = 'contradicts' as LinkType;\n\n/**\n * The default stage-4 layer-2 cosine similarity threshold (design note §2). A\n * near-duplicate candidate is surfaced to the {@link IEntityResolver} only when\n * its nearest neighbor scores `>= 0.85`.\n * @public\n */\nexport const DEFAULT_SIMILARITY_THRESHOLD: number = 0.85;\n\n/**\n * The default top-K for stage-4 layer-2 similarity candidate generation.\n * @public\n */\nexport const DEFAULT_SIMILARITY_TOP_K: number = 5;\n\n/**\n * How the write-time cycle guard behaves: `'reject'` (default — a cycle-inducing\n * edge fails the ingest) or `'off'` (no acyclicity constraint, for deployments\n * whose link graphs are legitimately cyclic — e.g. mutual associative links).\n * @public\n */\nexport type CycleGuardMode = 'reject' | 'off';\n\n/**\n * The fgv-owned six-stage ingest orchestrator. Composes the host's staged\n * classify / extract / (optional) resolve / relate machinery around fgv's owned\n * validation boundary, dedup, edge + cycle safety, provenance stamping, and the\n * contradicts→temporal interlock.\n * @public\n */\nexport interface IMemoryIngestOrchestrator {\n  /**\n   * Ingest a SINGLE item end-to-end (the first-class per-turn streaming path).\n   */\n  ingestItem(item: IIngestItem): Promise<Result<IIngestItemResult>>;\n\n  /**\n   * Ingest a batch of items. A convenience loop over {@link\n   * IMemoryIngestOrchestrator.ingestItem | ingestItem} — items are processed in\n   * order and the first failure aborts the batch.\n   */\n  ingestBatch(items: ReadonlyArray<IIngestItem>): Promise<Result<ReadonlyArray<IIngestItemResult>>>;\n}\n\n/**\n * Parameters for {@link MemoryIngestOrchestrator.create}.\n * @public\n */\nexport interface IMemoryIngestOrchestratorCreateParams {\n  /** The store every write bottoms out in (stage 6). */\n  readonly store: IMemoryStore;\n  /** Per-kind body converter registry — the stage-3 typed validation boundary. */\n  readonly registry: IBodyConverterRegistry;\n  /** Per-kind identity codecs (maps a candidate `entityId` to its storage address). */\n  readonly codecs?: ReadonlyMap<Kind, IIdentityCodec>;\n  /** Default identity codec for kinds without an explicit entry. */\n  readonly defaultCodec?: IIdentityCodec;\n  /** Stage 2 — the host's classifier. */\n  readonly classifier: IMemoryClassifier;\n  /** Stage 3 — the host's fact extractor. */\n  readonly extractor: IFactExtractor;\n  /** Stage 5 — the host's relation extractor. */\n  readonly relationExtractor: IRelationExtractor;\n  /**\n   * Stage 4 (optional, OQ-13) — the host's entity resolver. Absent → stage-4\n   * dedup is exact-`{ kind, body }`-hash only (the deterministic-identity path).\n   */\n  readonly entityResolver?: IEntityResolver;\n  /**\n   * Optional vector index for stage-4 layer-2 similarity candidate-gen. Wired\n   * together with {@link IMemoryIngestOrchestratorCreateParams.embed | embed} AND\n   * {@link IMemoryIngestOrchestratorCreateParams.entityResolver | entityResolver};\n   * absent (or either co-requisite absent) → layer-2 is skipped and dedup is\n   * exact-only.\n   */\n  readonly vectorIndex?: IVectorIndex;\n  /** Optional embedder used to embed a candidate for layer-2 similarity search. */\n  readonly embed?: MemoryEmbedder;\n  /**\n   * Stage-4 layer-2 cosine threshold. Defaults to {@link\n   * DEFAULT_SIMILARITY_THRESHOLD} (`0.85`).\n   */\n  readonly similarityThreshold?: number;\n  /**\n   * Stage-4 layer-2 top-K. Defaults to {@link DEFAULT_SIMILARITY_TOP_K} (`5`).\n   */\n  readonly similarityTopK?: number;\n  /** Write-time cycle guard mode. Defaults to `'reject'`. */\n  readonly cycleGuard?: CycleGuardMode;\n  /** Diagnostic logger (defaults to a no-op). */\n  readonly logger?: Logging.ILogger;\n}\n\n/** The fully-wired stage-4 layer-2 dependencies (present only when all three are supplied). */\ninterface ISimilarityWiring {\n  readonly resolver: IEntityResolver;\n  readonly vectorIndex: IVectorIndex;\n  readonly embed: MemoryEmbedder;\n}\n\n/** A snapshot record paired with its resolved scope-qualified `(scope, id)` address. */\ninterface IScopedRecord {\n  readonly address: IEdgeTarget;\n  readonly record: IMemoryRecord<unknown>;\n}\n\n/** Internal per-candidate plan threaded through the pipeline. */\ninterface ICandidatePlan {\n  readonly candidate: ICandidateRecord;\n  /** The write target's storage address (re-addressed to the target for merge-into). */\n  readonly writeAddress: IIdentityCodecResult;\n  /** The write target's entity id (re-addressed for merge-into). */\n  readonly writeEntityId: EntityId;\n  /** The reference id used in stage-5 edges (the write target's `idStem`). */\n  readonly refId: MemoryId;\n  /**\n   * The scope-qualified reference used in stage-5 edges: the write target's\n   * `(scope, idStem)`. Stage-5 sources / dedup all key on this scoped address so\n   * two candidates that share a stem across scopes never collide.\n   */\n  readonly refTarget: IEdgeTarget;\n  /** The resolution verdict; carries the target id on its target-bearing arms. */\n  readonly verdict: ResolutionVerdict;\n  /**\n   * The pre-ingest target record for a `merge-into` write — its existing\n   * `tags` / `links` / `provenance` are UNIONed with the candidate's at stage 6\n   * so a wholesale-replace merge never wipes them.\n   */\n  readonly mergeTarget?: IMemoryRecord<unknown>;\n}\n\n/**\n * Default {@link IMemoryIngestOrchestrator}.\n * @public\n */\nexport class MemoryIngestOrchestrator implements IMemoryIngestOrchestrator {\n  private readonly _store: IMemoryStore;\n  private readonly _registry: IBodyConverterRegistry;\n  private readonly _codecs: ReadonlyMap<Kind, IIdentityCodec>;\n  private readonly _defaultCodec: IIdentityCodec | undefined;\n  private readonly _classifier: IMemoryClassifier;\n  private readonly _extractor: IFactExtractor;\n  private readonly _relationExtractor: IRelationExtractor;\n  private readonly _similarity: ISimilarityWiring | undefined;\n  private readonly _similarityThreshold: number;\n  private readonly _similarityTopK: number;\n  private readonly _cycleGuard: CycleGuardMode;\n  private readonly _logger: Logging.ILogger;\n  private readonly _hasher: Hash.Crc32Normalizer;\n\n  private constructor(params: IMemoryIngestOrchestratorCreateParams) {\n    this._store = params.store;\n    this._registry = params.registry;\n    this._codecs = params.codecs ?? new Map<Kind, IIdentityCodec>();\n    this._defaultCodec = params.defaultCodec;\n    this._classifier = params.classifier;\n    this._extractor = params.extractor;\n    this._relationExtractor = params.relationExtractor;\n    this._similarity =\n      params.entityResolver !== undefined && params.vectorIndex !== undefined && params.embed !== undefined\n        ? { resolver: params.entityResolver, vectorIndex: params.vectorIndex, embed: params.embed }\n        : undefined;\n    this._similarityThreshold = params.similarityThreshold ?? DEFAULT_SIMILARITY_THRESHOLD;\n    this._similarityTopK = params.similarityTopK ?? DEFAULT_SIMILARITY_TOP_K;\n    this._cycleGuard = params.cycleGuard ?? 'reject';\n    this._logger = params.logger ?? new Logging.NoOpLogger();\n    this._hasher = new Hash.Crc32Normalizer();\n  }\n\n  /** Family-convention factory. */\n  public static create(params: IMemoryIngestOrchestratorCreateParams): Result<MemoryIngestOrchestrator> {\n    return succeed(new MemoryIngestOrchestrator(params));\n  }\n\n  /** {@inheritDoc IMemoryIngestOrchestrator.ingestItem} */\n  public async ingestItem(item: IIngestItem): Promise<Result<IIngestItemResult>> {\n    return (await this._classify(item))\n      .thenOnSuccess((classification) => this._extract(item, classification))\n      .thenOnSuccess((candidates) => this._processCandidates(item, candidates));\n  }\n\n  /** {@inheritDoc IMemoryIngestOrchestrator.ingestBatch} */\n  public async ingestBatch(\n    items: ReadonlyArray<IIngestItem>\n  ): Promise<Result<ReadonlyArray<IIngestItemResult>>> {\n    const results: IIngestItemResult[] = [];\n    for (const item of items) {\n      const result: Result<IIngestItemResult> = await this.ingestItem(item);\n      if (result.isFailure()) {\n        return fail(result.message);\n      }\n      results.push(result.value);\n    }\n    return succeed(results);\n  }\n\n  /** Stage 2 — classify (host), normalizing a rejected promise into a Failure. */\n  private async _classify(item: IIngestItem): Promise<Result<IMemoryClassification>> {\n    return this._capture(() => this._classifier.classify(item), `ingest '${item.id}': classify`);\n  }\n\n  /** Stage 3 — extract (host), normalizing a rejected promise into a Failure. */\n  private async _extract(\n    item: IIngestItem,\n    classification: IMemoryClassification\n  ): Promise<Result<ReadonlyArray<ICandidateRecord>>> {\n    return this._capture(() => this._extractor.extract(item, classification), `ingest '${item.id}': extract`);\n  }\n\n  /**\n   * Stages 3b-6 over the extracted candidates: validate bodies, resolve/dedup\n   * (stage 4), relate + cycle guard (stage 5), and load-with-provenance (stage 6).\n   */\n  private async _processCandidates(\n    item: IIngestItem,\n    candidates: ReadonlyArray<ICandidateRecord>\n  ): Promise<Result<IIngestItemResult>> {\n    // Snapshot the store once; stage-4 resolution and the cycle guard reason over\n    // the pre-ingest state.\n    const snapshotResult: Result<ReadonlyArray<IMemoryRecord<unknown>>> = await this._store.list();\n    if (snapshotResult.isFailure()) {\n      return fail(`ingest '${item.id}': failed to snapshot store: ${snapshotResult.message}`);\n    }\n    const snapshot: ReadonlyArray<IMemoryRecord<unknown>> = snapshotResult.value;\n    // Resolve every snapshot record's scope-qualified address ONCE, then index it\n    // by the canonical scoped key. The single `byKey` view drives BOTH the edge\n    // path (validation + cycle guard) AND the verdict/similarity target lookups —\n    // so a filename stem reused across scopes never aliases on any path.\n    const scopedResult: Result<ReadonlyArray<IScopedRecord>> = this._scopeRecords(snapshot);\n    if (scopedResult.isFailure()) {\n      return fail(`ingest '${item.id}': ${scopedResult.message}`);\n    }\n    const scoped: ReadonlyArray<IScopedRecord> = scopedResult.value;\n    const byKey: ReadonlyMap<string, IMemoryRecord<unknown>> = new Map<string, IMemoryRecord<unknown>>(\n      scoped.map((s) => [edgeTargetKey(s.address), s.record])\n    );\n\n    // Stage 3b + 4: validate each body and resolve a verdict/plan.\n    const plans: ICandidatePlan[] = [];\n    for (const candidate of candidates) {\n      const planResult: Result<ICandidatePlan> = await this._planCandidate(item, candidate, snapshot, byKey);\n      if (planResult.isFailure()) {\n        return fail(planResult.message);\n      }\n      plans.push(planResult.value);\n    }\n\n    // Stage 5: relate over the writable candidates, validate + cycle-guard.\n    const writablePlans: ICandidatePlan[] = plans.filter((plan) => plan.verdict.verdict !== 'duplicate-of');\n    const edgesResult: Result<ReadonlyArray<ICandidateEdge>> = await this._relate(\n      item,\n      writablePlans,\n      MemoryIngestOrchestrator._collapseRedirects(plans),\n      scoped,\n      byKey\n    );\n    if (edgesResult.isFailure()) {\n      return fail(edgesResult.message);\n    }\n    const edges: ReadonlyArray<ICandidateEdge> = edgesResult.value;\n\n    // Stage 6: load-with-provenance, in extraction order.\n    const records: IIngestedRecordResult[] = [];\n    for (const plan of plans) {\n      const outcome: Result<IIngestedRecordResult> = await this._loadCandidate(item, plan, edges);\n      if (outcome.isFailure()) {\n        return fail(outcome.message);\n      }\n      records.push(outcome.value);\n    }\n    return succeed({ item, records });\n  }\n\n  /** Stage 3b + 4 for one candidate: validate body, resolve address, resolve verdict. */\n  private async _planCandidate(\n    item: IIngestItem,\n    candidate: ICandidateRecord,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ICandidatePlan>> {\n    const kind: Kind = candidate.envelope.kind;\n    // Stage 3b: the typed validation boundary — no unchecked host body reaches the store.\n    const bodyResult: Result<string> = this._registry\n      .convert(kind, candidate.body)\n      .withErrorFormat((msg) => `ingest '${item.id}': candidate body for kind '${kind}' is invalid: ${msg}`)\n      .onSuccess(() => MemoryIngestOrchestrator._asStringBody(item, candidate));\n    if (bodyResult.isFailure()) {\n      return fail(bodyResult.message);\n    }\n    const body: string = bodyResult.value;\n\n    const addrResult: Result<IIdentityCodecResult> = this._resolveAddress(candidate.envelope.entityId, kind);\n    if (addrResult.isFailure()) {\n      return fail(`ingest '${item.id}': ${addrResult.message}`);\n    }\n    const addr: IIdentityCodecResult = addrResult.value;\n\n    return (await this._resolveVerdict(candidate, kind, body, addr, snapshot, byKey)).onSuccess((verdict) =>\n      this._planFromVerdict(item, candidate, addr, verdict, byKey)\n    );\n  }\n\n  /**\n   * Turn a resolved verdict into a candidate plan. A `new` verdict writes under the\n   * candidate's own address. Every TARGET-bearing verdict\n   * (`duplicate-of` / `supersede` / `merge-into`) is validated uniformly: the\n   * target must be a real store record (fgv owns validation — a non-compliant host\n   * resolver never smuggles a bogus id through) AND its kind must equal the\n   * candidate's kind (a cross-kind target would write to the wrong scope). Only\n   * `merge-into` re-addresses the write to the target's entity.\n   */\n  private _planFromVerdict(\n    item: IIngestItem,\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    verdict: ResolutionVerdict,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Result<ICandidatePlan> {\n    if (verdict.verdict === 'new') {\n      return Convert.memoryId.convert(addr.idStem).onSuccess((refId) =>\n        succeed({\n          candidate,\n          writeAddress: addr,\n          writeEntityId: candidate.envelope.entityId,\n          refId,\n          refTarget: { scope: addr.scope, id: refId },\n          verdict\n        })\n      );\n    }\n    // duplicate-of | supersede | merge-into: the target must exist and share the\n    // candidate's kind. Lookup is on the canonical scoped key, so a stem reused\n    // across scopes binds only the record the verdict actually named.\n    const target: IMemoryRecord<unknown> | undefined = byKey.get(edgeTargetKey(verdict.target));\n    if (target === undefined) {\n      return fail(\n        `ingest '${item.id}': ${verdict.verdict} target '${MemoryIngestOrchestrator._formatTarget(\n          verdict.target\n        )}' does not exist in the store`\n      );\n    }\n    if (target.envelope.kind !== candidate.envelope.kind) {\n      return fail(\n        `ingest '${item.id}': ${verdict.verdict} target '${MemoryIngestOrchestrator._formatTarget(\n          verdict.target\n        )}' is kind '${target.envelope.kind}' but the candidate is kind '${candidate.envelope.kind}'`\n      );\n    }\n    if (verdict.verdict === 'merge-into') {\n      // Re-address the write to the target's entity, carrying the target record so\n      // stage 6 can UNION its existing tags/links (never overwrite them).\n      const targetEntityId: EntityId = target.envelope.entityId;\n      // The merge target is a snapshot record, and `_scopeRecords` already proved\n      // every snapshot record's address resolves before planning runs — so this\n      // re-resolve (needed for the full codec result: scope + idStem + isVersioned)\n      // cannot fail. No error-context wrap is warranted; a failure here would be a\n      // logic contradiction, not a user-facing condition.\n      return this._resolveAddress(targetEntityId, target.envelope.kind).onSuccess((targetAddr) =>\n        Convert.memoryId.convert(targetAddr.idStem).onSuccess((refId) =>\n          succeed({\n            candidate,\n            writeAddress: targetAddr,\n            writeEntityId: targetEntityId,\n            refId,\n            refTarget: { scope: targetAddr.scope, id: refId },\n            verdict,\n            mergeTarget: target\n          })\n        )\n      );\n    }\n    // duplicate-of | supersede: write under the candidate's own address.\n    return Convert.memoryId.convert(addr.idStem).onSuccess((refId) =>\n      succeed({\n        candidate,\n        writeAddress: addr,\n        writeEntityId: candidate.envelope.entityId,\n        refId,\n        refTarget: { scope: addr.scope, id: refId },\n        verdict\n      })\n    );\n  }\n\n  /**\n   * Stage 4 — resolve a dedup verdict. Layer 1: an exact `{ kind, body }` match in\n   * the candidate's scope is a `duplicate-of`, at the granularity the kind's\n   * {@link DedupScope} declares — scope-wide for `'content'`, restricted to the\n   * candidate's own entity for `'entity'` (design note §1). Layer 2 (only when\n   * a resolver + vector index + embedder are all wired): embed the candidate,\n   * surface over-threshold neighbors, and dispatch to the {@link IEntityResolver}.\n   * Otherwise the verdict is `new` (the exact-only fall-back path).\n   */\n  private async _resolveVerdict(\n    candidate: ICandidateRecord,\n    kind: Kind,\n    body: string,\n    addr: IIdentityCodecResult,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ResolutionVerdict>> {\n    return this._findExactMatch(kind, body, addr, snapshot).thenOnSuccess(async (matchId) => {\n      if (matchId !== undefined) {\n        // The exact-match cohort is filtered to `addr.scope`, so the match lives\n        // under that scope — its scope-qualified target is `(addr.scope, matchId)`.\n        return succeed({ verdict: 'duplicate-of', target: { scope: addr.scope, id: matchId } });\n      }\n      const layer2: ISimilarityWiring | undefined = this._similarity;\n      if (layer2 === undefined) {\n        // No layer-2: exact-only fall-back (the deterministic-identity host path).\n        return succeed({ verdict: 'new' });\n      }\n      return this._resolveViaSimilarity(candidate, addr, body, layer2, byKey);\n    });\n  }\n\n  /** Layer-2 similarity candidate-gen + resolver dispatch. */\n  private async _resolveViaSimilarity(\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    body: string,\n    wiring: ISimilarityWiring,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ResolutionVerdict>> {\n    return MemoryIngestOrchestrator._provisionalRecord(candidate, addr.idStem, body).thenOnSuccess(\n      (provisional) => this._resolveViaSimilarityEmbedded(candidate, addr, wiring, byKey, provisional)\n    );\n  }\n\n  /** Layer-2 continuation once the candidate has a provisional record to embed. */\n  private async _resolveViaSimilarityEmbedded(\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    wiring: ISimilarityWiring,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>,\n    provisional: IMemoryRecord<unknown>\n  ): Promise<Result<ResolutionVerdict>> {\n    const embedded: Result<Float32Array | undefined> = await this._capture(\n      () => wiring.embed(provisional),\n      `ingest '${candidate.envelope.entityId}': embed candidate`\n    );\n    if (embedded.isFailure()) {\n      return fail(embedded.message);\n    }\n    // The embedder deliberately declined this candidate, so there is no vector to\n    // search with and layer-2 similarity dedup cannot run for it. That is the same\n    // position as a search that found nothing similar — `'new'` — and not an\n    // error: declining to embed a kind must not make it un-ingestable.\n    if (embedded.value === undefined) {\n      return succeed({ verdict: 'new' });\n    }\n    // Hoisted: the `undefined` check above does not narrow across the callback\n    // boundary below, and a local keeps the non-null assertion out of the code.\n    const vector: Float32Array = embedded.value;\n    const queried = await this._capture(\n      () => wiring.vectorIndex.query(vector, this._similarityTopK),\n      `ingest '${candidate.envelope.entityId}': similarity query`\n    );\n    if (queried.isFailure()) {\n      return fail(queried.message);\n    }\n    const similar: IEntityResolutionCandidate[] = [];\n    for (const hit of queried.value) {\n      // Skip below-threshold hits and the candidate's OWN scope-qualified address\n      // (a re-ingest of the same entity must not dedup against its prior version).\n      // Both the scope AND the id must match to be \"self\" — a same-stem record in\n      // another scope is a legitimate distinct neighbor. This field-equality is\n      // exactly equivalent to comparing `edgeTargetKey(hit.target)` against the\n      // candidate's own key (edgeTargetKey is pure and injective on `(scope, id)`),\n      // so this one site reads the components directly rather than re-keying.\n      const isSelf: boolean = hit.target.scope === addr.scope && hit.target.id === addr.idStem;\n      if (hit.score < this._similarityThreshold || isSelf) {\n        continue;\n      }\n      const record: IMemoryRecord<unknown> | undefined = byKey.get(edgeTargetKey(hit.target));\n      if (record !== undefined) {\n        similar.push({ target: hit.target, record, score: hit.score });\n      }\n    }\n    if (similar.length === 0) {\n      return succeed({ verdict: 'new' });\n    }\n    return this._capture(\n      () => wiring.resolver.resolve(candidate, similar),\n      `ingest '${candidate.envelope.entityId}': resolve`\n    );\n  }\n\n  /**\n   * Find an existing record whose `{ kind, body }` hash matches the candidate's\n   * (layer-1 exact dedup, design note §1). Invalidated temporal versions are\n   * excluded — only a live (non-temporal or current) record deduplicates a\n   * candidate.\n   *\n   * @remarks\n   * The cohort's granularity is the kind's DECLARED {@link DedupScope}, read\n   * through {@link IMemoryStore.dedupScopeFor} so this layer and the store's own\n   * write path can never disagree:\n   *\n   * - `'content'` — every live same-kind record in the candidate's scope,\n   *   regardless of entity. A cross-id body collision IS a duplicate (the\n   *   knowledge family; unchanged behavior).\n   * - `'entity'` — only records at the candidate's OWN entity address. Two\n   *   distinct entities with byte-identical bodies never collapse into one\n   *   another, which is what the declaration has always meant on the direct-put\n   *   path and now means here too.\n   *\n   * The same-id collapse itself remains the store's job — this layer only decides\n   * whether a cross-id body collision is eligible to be a `duplicate-of` at all.\n   */\n  private _findExactMatch(\n    kind: Kind,\n    body: string,\n    addr: IIdentityCodecResult,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>\n  ): Result<MemoryId | undefined> {\n    const dedupScope: DedupScope = this._store.dedupScopeFor(kind);\n    // Same-kind, same-scope, LIVE (non-temporal or current) records are the exact\n    // cohort, narrowed to the candidate's own entity address under `'entity'`\n    // granularity. `_resolveAddress(...).orDefault()` collapses an unresolved\n    // codec to `undefined` — a non-matching address — with no explicit failure\n    // branch, exactly as the scope-only filter did before.\n    const cohort: ReadonlyArray<IMemoryRecord<unknown>> = snapshot.filter((record) => {\n      if (record.envelope.kind !== kind || (isTemporalRecord(record) && !isVersionCurrent(record))) {\n        return false;\n      }\n      const recordAddr: IIdentityCodecResult | undefined = this._resolveAddress(\n        record.envelope.entityId,\n        record.envelope.kind\n      ).orDefault();\n      if (recordAddr === undefined || recordAddr.scope !== addr.scope) {\n        return false;\n      }\n      return dedupScope === 'content' || recordAddr.idStem === addr.idStem;\n    });\n    return this._exactKey(kind, body).onSuccess((key) =>\n      mapResults(\n        cohort.map((record) =>\n          MemoryIngestOrchestrator._recordBodyString(record).onSuccess((recordBody) =>\n            this._exactKey(record.envelope.kind, recordBody).onSuccess((recordKey) =>\n              succeed({ id: record.envelope.id, key: recordKey })\n            )\n          )\n        )\n      ).onSuccess((keyed) => succeed(keyed.find((entry) => entry.key === key)?.id))\n    );\n  }\n\n  /**\n   * The body of a persisted record, required to be a string (the store persists\n   * only string bodies). Fails loudly rather than blind-casting an `unknown` body\n   * into the exact-dedup hash — a non-string existing body is a store-integrity\n   * fault, surfaced with context, not a silent miscompute.\n   */\n  private static _recordBodyString(record: IMemoryRecord<unknown>): Result<string> {\n    if (typeof record.body !== 'string') {\n      return fail(\n        `ingest: stored record '${record.envelope.id}' has a non-string body (got ${typeof record.body})`\n      );\n    }\n    return succeed(record.body);\n  }\n\n  /** The stage-4 exact-dedup key over `{ kind, body }` (design note §1). */\n  private _exactKey(kind: Kind, body: string): Result<string> {\n    return this._hasher.computeHash({ kind, body });\n  }\n\n  /** Stage 5 — relate (host), redirect collapsed targets, validate edges, and run the write-time cycle guard. */\n  private async _relate(\n    item: IIngestItem,\n    writablePlans: ReadonlyArray<ICandidatePlan>,\n    redirects: ReadonlyMap<string, IEdgeTarget>,\n    scoped: ReadonlyArray<IScopedRecord>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ReadonlyArray<ICandidateEdge>>> {\n    const relationCandidates: IRelationCandidate[] = writablePlans.map((plan) => ({\n      candidate: plan.candidate,\n      id: plan.refTarget\n    }));\n    const proposed: Result<ReadonlyArray<ICandidateEdge>> = await this._capture(\n      () => this._relationExtractor.relate({ item, candidates: relationCandidates }),\n      `ingest '${item.id}': relate`\n    );\n    if (proposed.isFailure()) {\n      return proposed;\n    }\n    // Redirect BEFORE validation and BEFORE the cycle guard: an edge naming a\n    // collapsed candidate must be judged — and persisted — against the record it\n    // collapsed into, not against the address that no longer gets written.\n    const edges: ReadonlyArray<ICandidateEdge> = MemoryIngestOrchestrator._redirectEdges(\n      proposed.value,\n      redirects\n    );\n    // refIds and the existing-record view (`byKey`, shared with the verdict path)\n    // both key on the canonical scoped address, so a stem reused across scopes\n    // never aliases.\n    const refIds: ReadonlySet<string> = new Set<string>(\n      writablePlans.map((plan) => edgeTargetKey(plan.refTarget))\n    );\n    const validation: Result<true> = this._validateEdges(item, edges, refIds, byKey);\n    if (validation.isFailure()) {\n      return fail(validation.message);\n    }\n    if (this._cycleGuard === 'reject') {\n      const guard: Result<true> = assertNoCycles(\n        MemoryIngestOrchestrator._existingEdges(scoped),\n        edges.map((e) => ({ source: e.source, target: e.edge.target, type: e.edge.type }))\n      );\n      if (guard.isFailure()) {\n        return fail(`ingest '${item.id}': ${guard.message}`);\n      }\n    }\n    return succeed(edges);\n  }\n\n  /**\n   * The stage-5 edge-target redirect map for this pass: every `duplicate-of`\n   * candidate's OWN scoped address, mapped to the address of the record its\n   * verdict collapsed it into (design note §3).\n   *\n   * @remarks\n   * A `duplicate-of` verdict means \"this candidate IS that record\". The candidate\n   * is therefore not written, and its address never becomes a live reference — so\n   * a sibling edge built against it in the same pass would resolve to neither a\n   * written candidate nor an existing record and would fail the WHOLE ingest item.\n   * That is a second-order hazard of collapsing, not a defect in the edge: the\n   * host related two candidates it was correctly told about, and one of them\n   * turned out to already exist.\n   *\n   * Redirecting is the honest repair, and it is independent of {@link DedupScope}\n   * — it applies equally to a `'content'` kind, where the collapse is exactly\n   * right and the ingest still must not fail.\n   *\n   * The map cannot chain: {@link MemoryIngestOrchestrator._planFromVerdict}\n   * requires every target-bearing verdict's target to already exist in the store\n   * snapshot, so a redirect destination is always a persisted record and never\n   * another collapsed candidate. One pass is sufficient by construction.\n   */\n  private static _collapseRedirects(plans: ReadonlyArray<ICandidatePlan>): ReadonlyMap<string, IEdgeTarget> {\n    const redirects: Map<string, IEdgeTarget> = new Map<string, IEdgeTarget>();\n    for (const plan of plans) {\n      if (plan.verdict.verdict === 'duplicate-of') {\n        redirects.set(edgeTargetKey(plan.refTarget), plan.verdict.target);\n      }\n    }\n    return redirects;\n  }\n\n  /**\n   * Rewrite each edge whose TARGET names a collapsed candidate to point at the\n   * record that candidate collapsed into.\n   *\n   * @remarks\n   * Only the target is redirected. An edge whose SOURCE is a collapsed candidate\n   * stays untouched and is still rejected by {@link\n   * MemoryIngestOrchestrator._validateEdges}: sources are the records an edge is\n   * written ONTO, a collapsed candidate is never written, and the relation\n   * extractor is only ever offered writable candidates as edge sources in the\n   * first place. Silently relocating such an edge onto an existing record would\n   * attribute a link the host never asked for — the loud failure is correct there.\n   */\n  private static _redirectEdges(\n    edges: ReadonlyArray<ICandidateEdge>,\n    redirects: ReadonlyMap<string, IEdgeTarget>\n  ): ReadonlyArray<ICandidateEdge> {\n    if (redirects.size === 0) {\n      return edges;\n    }\n    return edges.map((e) => {\n      const to: IEdgeTarget | undefined = redirects.get(edgeTargetKey(e.edge.target));\n      return to === undefined ? e : { ...e, edge: { ...e.edge, target: to } };\n    });\n  }\n\n  /**\n   * Validate stage-5 edges: each `source` must be a candidate being written; each\n   * `target` must resolve to a sibling candidate or an existing store record. All\n   * matching is on the canonical scope-qualified address.\n   */\n  private _validateEdges(\n    item: IIngestItem,\n    edges: ReadonlyArray<ICandidateEdge>,\n    refIds: ReadonlySet<string>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Result<true> {\n    return mapResults(\n      edges.map((edge) => {\n        if (!refIds.has(edgeTargetKey(edge.source))) {\n          return fail(\n            `ingest '${item.id}': edge source '${MemoryIngestOrchestrator._formatTarget(\n              edge.source\n            )}' is not a candidate being written`\n          );\n        }\n        const targetKey: string = edgeTargetKey(edge.edge.target);\n        if (!refIds.has(targetKey) && byKey.get(targetKey) === undefined) {\n          return fail(\n            `ingest '${item.id}': edge target '${MemoryIngestOrchestrator._formatTarget(\n              edge.edge.target\n            )}' resolves to neither a sibling candidate nor an existing record`\n          );\n        }\n        return succeed(true);\n      })\n    ).onSuccess(() => succeed(true));\n  }\n\n  /** Stage 6 — stamp provenance + edges, admit through the store, record the outcome. */\n  private async _loadCandidate(\n    item: IIngestItem,\n    plan: ICandidatePlan,\n    allEdges: ReadonlyArray<ICandidateEdge>\n  ): Promise<Result<IIngestedRecordResult>> {\n    const refKey: string = edgeTargetKey(plan.refTarget);\n    const myEdges: ReadonlyArray<ICandidateEdge> = allEdges.filter((e) => edgeTargetKey(e.source) === refKey);\n    if (plan.verdict.verdict === 'duplicate-of') {\n      // No write: the existing target satisfied the candidate. The target id is a\n      // typed field of the narrowed `duplicate-of` verdict — no cast, no guard.\n      return succeed({\n        candidate: plan.candidate,\n        resolution: plan.verdict,\n        disposition: 'deduped',\n        id: plan.verdict.target.id,\n        edges: myEdges\n      });\n    }\n    return this._buildRecord(item, plan, myEdges).thenOnSuccess(async (record) =>\n      (await this._store.put(record))\n        .withErrorFormat((msg) => `ingest '${item.id}': write failed: ${msg}`)\n        .onSuccess((persisted) => {\n          const disposition: IngestDisposition = plan.verdict.verdict === 'merge-into' ? 'merged' : 'written';\n          const interlock: 'temporal-versioned' | undefined =\n            plan.writeAddress.isVersioned && myEdges.some((e) => e.edge.type === CONTRADICTS_LINK_TYPE)\n              ? 'temporal-versioned'\n              : undefined;\n          return succeed({\n            candidate: plan.candidate,\n            resolution: plan.verdict,\n            disposition,\n            id: persisted.envelope.id,\n            record: persisted,\n            edges: myEdges,\n            ...(interlock !== undefined ? { interlock } : {})\n          });\n        })\n    );\n  }\n\n  /** Build the fully-stamped record to persist (provenance + edges + placeholder txn fields). */\n  private _buildRecord(\n    item: IIngestItem,\n    plan: ICandidatePlan,\n    myEdges: ReadonlyArray<ICandidateEdge>\n  ): Result<IMemoryRecord<unknown>> {\n    const base: Omit<IMemoryEnvelope, 'id' | 'seq' | 'contentHash' | 'created' | 'updated'> =\n      plan.candidate.envelope;\n    // For merge-into the store's `applyUpdate` REPLACES array fields wholesale, so\n    // the persisted envelope must already carry the UNION of the target's existing\n    // tags/links/provenance and the candidate's — otherwise the merge silently\n    // wipes the target's prior links/tags.\n    const target: IMemoryRecord<unknown> | undefined = plan.mergeTarget;\n    const priorLinks: ReadonlyArray<IEdge> = target !== undefined ? target.envelope.links : [];\n    const priorTags: ReadonlyArray<Tag> = target !== undefined ? target.envelope.tags : [];\n    const priorProvenance: IProvenance = target !== undefined ? target.envelope.provenance : { source: '' };\n    return Convert.memoryId.convert(plan.writeAddress.idStem).onSuccess((id) =>\n      // Dedup the combined links by canonical edge key: the target's prior links, the\n      // candidate's own links, and the stage-5 edges (two candidates that resolve\n      // merge-into the SAME target share a `refId` — hence the same `myEdges` — and a\n      // relation extractor may repeat an edge) each appear exactly once.\n      this._dedupEdges([...priorLinks, ...base.links, ...myEdges.map((e) => e.edge)]).onSuccess((links) => {\n        const provenance: IProvenance = {\n          // Preserve the target's provenance extension keys, overlay the candidate's,\n          // then stamp the host-ingest source + derivedFrom (target present only for\n          // merge-into; otherwise the seed is inert).\n          ...(target !== undefined ? priorProvenance : {}),\n          ...base.provenance,\n          source: HOST_INGEST_PROVENANCE_SOURCE,\n          ...(item.sourceId !== undefined ? { derivedFrom: item.sourceId } : {})\n        };\n        const envelope: IMemoryEnvelope = {\n          ...base,\n          id,\n          entityId: plan.writeEntityId,\n          seq: 0,\n          contentHash: '',\n          created: 0,\n          updated: 0,\n          provenance,\n          tags: MemoryIngestOrchestrator._unionTags(priorTags, base.tags),\n          links\n        };\n        return succeed({ envelope, body: plan.candidate.body });\n      })\n    );\n  }\n\n  /** Union two tag lists, de-duplicated, preserving first-occurrence order. */\n  private static _unionTags(prior: ReadonlyArray<Tag>, incoming: ReadonlyArray<Tag>): ReadonlyArray<Tag> {\n    const seen: Set<string> = new Set<string>();\n    const out: Tag[] = [];\n    for (const tag of [...prior, ...incoming]) {\n      if (!seen.has(tag)) {\n        seen.add(tag);\n        out.push(tag);\n      }\n    }\n    return out;\n  }\n\n  /** De-duplicate a link list by canonical edge hash, preserving first-occurrence order. */\n  private _dedupEdges(edges: ReadonlyArray<IEdge>): Result<ReadonlyArray<IEdge>> {\n    const seen: Set<string> = new Set<string>();\n    const deduped: IEdge[] = [];\n    return mapResults(\n      edges.map((edge) =>\n        this._hasher.computeHash(edge).onSuccess((key) => {\n          if (!seen.has(key)) {\n            seen.add(key);\n            deduped.push(edge);\n          }\n          return succeed(key);\n        })\n      )\n    ).onSuccess(() => succeed(deduped));\n  }\n\n  /** Resolve a `(kind, entityId)` to its storage address via the registered codec. */\n  private _resolveAddress(entityId: EntityId, kind: Kind): Result<IIdentityCodecResult> {\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 codec.encode(entityId);\n  }\n\n  /** Run a host hook, normalizing a thrown/rejected hook into a Failure (never throws across the seam). */\n  private async _capture<T>(op: () => Promise<Result<T>>, label: string): Promise<Result<T>> {\n    try {\n      return await op();\n    } catch (err) {\n      const message: string = `${label} threw: ${String(err)}`;\n      this._logger.warn(message);\n      return fail(message);\n    }\n  }\n\n  /**\n   * Every existing outbound edge in the snapshot, as cycle-guard edges. The\n   * source is the record's own scope-qualified address (already resolved by\n   * {@link MemoryIngestOrchestrator._scopeRecords}); the target is the edge's\n   * own scoped target. Both ends are scoped so the guard never conflates a stem\n   * shared across scopes into one graph node.\n   */\n  private static _existingEdges(scoped: ReadonlyArray<IScopedRecord>): ReadonlyArray<ICycleGuardEdge> {\n    const edges: ICycleGuardEdge[] = [];\n    for (const s of scoped) {\n      for (const edge of s.record.envelope.links) {\n        edges.push({ source: s.address, target: edge.target, type: edge.type });\n      }\n    }\n    return edges;\n  }\n\n  /**\n   * Resolve every snapshot record's scope-qualified `(scope, id)` address via its\n   * registered codec. Fails loudly if a record's kind has no resolvable codec —\n   * the edge path cannot place an un-scopeable record in the graph, and a missing\n   * codec for a stored kind is a real misconfiguration, not something to paper over.\n   */\n  private _scopeRecords(\n    records: ReadonlyArray<IMemoryRecord<unknown>>\n  ): Result<ReadonlyArray<IScopedRecord>> {\n    return mapResults(\n      records.map((record) =>\n        this._resolveAddress(record.envelope.entityId, record.envelope.kind)\n          .withErrorFormat((msg) => `cannot resolve scope for stored record '${record.envelope.id}': ${msg}`)\n          .onSuccess((addr) => succeed({ address: { scope: addr.scope, id: record.envelope.id }, record }))\n      )\n    );\n  }\n\n  /** Human-readable `scope/id` rendering of a scoped target for edge-validation diagnostics. */\n  private static _formatTarget(target: IEdgeTarget): string {\n    return `${target.scope}/${target.id}`;\n  }\n\n  /** A provisional record for embedding a candidate (placeholder txn-time fields). */\n  private static _provisionalRecord(\n    candidate: ICandidateRecord,\n    idStem: string,\n    body: string\n  ): Result<IMemoryRecord<unknown>> {\n    return Convert.memoryId.convert(idStem).onSuccess((id) => {\n      const envelope: IMemoryEnvelope = {\n        ...candidate.envelope,\n        id,\n        seq: 0,\n        contentHash: '',\n        created: 0,\n        updated: 0\n      };\n      return succeed({ envelope, body });\n    });\n  }\n\n  /** Require a candidate body to be a string (the store persists only string bodies). */\n  private static _asStringBody(item: IIngestItem, candidate: ICandidateRecord): Result<string> {\n    if (typeof candidate.body !== 'string') {\n      return fail(\n        `ingest '${item.id}': candidate body for kind '${\n          candidate.envelope.kind\n        }' must be a string (got ${typeof candidate.body})`\n      );\n    }\n    return succeed(candidate.body);\n  }\n}\n"]}
+{"version":3,"file":"orchestrator.js","sourceRoot":"","sources":["../../../src/packlets/ingest/orchestrator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAiF;AACjF,oCAkBkB;AAElB,oCAAyD;AAEzD,6CAA+D;AAoB/D;;;GAGG;AACU,QAAA,6BAA6B,GAAW,aAAa,CAAC;AAEnE;;;;GAIG;AACU,QAAA,qBAAqB,GAAa,aAAyB,CAAC;AAEzE;;;;;GAKG;AACU,QAAA,4BAA4B,GAAW,IAAI,CAAC;AAEzD;;;GAGG;AACU,QAAA,wBAAwB,GAAW,CAAC,CAAC;AAsHlD;;;GAGG;AACH,MAAa,wBAAwB;IAenC,YAAoB,MAA6C;;QAC/D,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,GAAG,EAAwB,CAAC;QAChE,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC;QACrC,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,kBAAkB,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACnD,IAAI,CAAC,WAAW;YACd,MAAM,CAAC,cAAc,KAAK,SAAS,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS;gBACnG,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,cAAc,EAAE,WAAW,EAAE,MAAM,CAAC,WAAW,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE;gBAC3F,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,CAAC,oBAAoB,GAAG,MAAA,MAAM,CAAC,mBAAmB,mCAAI,oCAA4B,CAAC;QACvF,IAAI,CAAC,eAAe,GAAG,MAAA,MAAM,CAAC,cAAc,mCAAI,gCAAwB,CAAC;QACzE,IAAI,CAAC,WAAW,GAAG,MAAA,MAAM,CAAC,UAAU,mCAAI,QAAQ,CAAC;QACjD,IAAI,CAAC,OAAO,GAAG,MAAA,MAAM,CAAC,MAAM,mCAAI,IAAI,kBAAO,CAAC,UAAU,EAAE,CAAC;QACzD,IAAI,CAAC,OAAO,GAAG,IAAI,eAAI,CAAC,eAAe,EAAE,CAAC;IAC5C,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,MAA6C;QAChE,OAAO,IAAA,kBAAO,EAAC,IAAI,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,yDAAyD;IAClD,KAAK,CAAC,UAAU,CAAC,IAAiB;QACvC,OAAO,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aAChC,aAAa,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;aACtE,aAAa,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,0DAA0D;IACnD,KAAK,CAAC,WAAW,CACtB,KAAiC;QAEjC,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAA8B,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACtE,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;gBACvB,OAAO,IAAA,eAAI,EAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED,gFAAgF;IACxE,KAAK,CAAC,SAAS,CAAC,IAAiB;QACvC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,aAAa,CAAC,CAAC;IAC/F,CAAC;IAED,+EAA+E;IACvE,KAAK,CAAC,QAAQ,CACpB,IAAiB,EACjB,cAAqC;QAErC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,cAAc,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,YAAY,CAAC,CAAC;IAC5G,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,kBAAkB,CAC9B,IAAiB,EACjB,UAA2C;QAE3C,8EAA8E;QAC9E,wBAAwB;QACxB,EAAE;QACF,uEAAuE;QACvE,6EAA6E;QAC7E,2EAA2E;QAC3E,4EAA4E;QAC5E,wEAAwE;QACxE,yEAAyE;QACzE,4EAA4E;QAC5E,8EAA8E;QAC9E,4EAA4E;QAC5E,sDAAsD;QACtD,MAAM,cAAc,GAAkD,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,CAC1F,IAAA,uBAAe,GAAE,CAClB,CAAC;QACF,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,CAAC;YAC/B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,gCAAgC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,MAAM,QAAQ,GAA0C,cAAc,CAAC,KAAK,CAAC;QAC7E,8EAA8E;QAC9E,4EAA4E;QAC5E,8EAA8E;QAC9E,qEAAqE;QACrE,MAAM,YAAY,GAAyC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACxF,IAAI,YAAY,CAAC,SAAS,EAAE,EAAE,CAAC;YAC7B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,MAAM,MAAM,GAAiC,YAAY,CAAC,KAAK,CAAC;QAChE,MAAM,KAAK,GAAgD,IAAI,GAAG,CAChE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CACxD,CAAC;QAEF,+DAA+D;QAC/D,MAAM,KAAK,GAAqB,EAAE,CAAC;QACnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,UAAU,GAA2B,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvG,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;gBAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAClC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QAC/B,CAAC;QAED,wEAAwE;QACxE,MAAM,aAAa,GAAqB,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,CAAC,CAAC;QACxG,MAAM,WAAW,GAA0C,MAAM,IAAI,CAAC,OAAO,CAC3E,IAAI,EACJ,aAAa,EACb,wBAAwB,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAClD,MAAM,EACN,KAAK,CACN,CAAC;QACF,IAAI,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC;YAC5B,OAAO,IAAA,eAAI,EAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACnC,CAAC;QACD,MAAM,KAAK,GAAkC,WAAW,CAAC,KAAK,CAAC;QAE/D,sDAAsD;QACtD,MAAM,OAAO,GAA4B,EAAE,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAkC,MAAM,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC5F,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;gBACxB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,uFAAuF;IAC/E,KAAK,CAAC,cAAc,CAC1B,IAAiB,EACjB,SAA2B,EAC3B,QAA+C,EAC/C,KAAkD;QAElD,MAAM,IAAI,GAAS,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC3C,sFAAsF;QACtF,MAAM,UAAU,GAAmB,IAAI,CAAC,SAAS;aAC9C,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,CAAC;aAC7B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,IAAI,CAAC,EAAE,+BAA+B,IAAI,iBAAiB,GAAG,EAAE,CAAC;aACrG,SAAS,CAAC,GAAG,EAAE,CAAC,wBAAwB,CAAC,aAAa,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QAC5E,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;QACD,MAAM,IAAI,GAAW,UAAU,CAAC,KAAK,CAAC;QAEtC,MAAM,UAAU,GAAiC,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QACzG,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,IAAI,GAAyB,UAAU,CAAC,KAAK,CAAC;QAEpD,OAAO,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,EAAE,CACtG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAC7D,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,gBAAgB,CACtB,IAAiB,EACjB,SAA2B,EAC3B,IAA0B,EAC1B,OAA0B,EAC1B,KAAkD;QAElD,IAAI,OAAO,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC9B,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/D,IAAA,kBAAO,EAAC;gBACN,SAAS;gBACT,YAAY,EAAE,IAAI;gBAClB,aAAa,EAAE,SAAS,CAAC,QAAQ,CAAC,QAAQ;gBAC1C,KAAK;gBACL,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;gBAC3C,OAAO;aACR,CAAC,CACH,CAAC;QACJ,CAAC;QACD,6EAA6E;QAC7E,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,MAAM,GAAuC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5F,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,MAAM,OAAO,CAAC,OAAO,YAAY,wBAAwB,CAAC,aAAa,CACvF,OAAO,CAAC,MAAM,CACf,+BAA+B,CACjC,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrD,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,MAAM,OAAO,CAAC,OAAO,YAAY,wBAAwB,CAAC,aAAa,CACvF,OAAO,CAAC,MAAM,CACf,cAAc,MAAM,CAAC,QAAQ,CAAC,IAAI,gCAAgC,SAAS,CAAC,QAAQ,CAAC,IAAI,GAAG,CAC9F,CAAC;QACJ,CAAC;QACD,IAAI,OAAO,CAAC,OAAO,KAAK,YAAY,EAAE,CAAC;YACrC,6EAA6E;YAC7E,oEAAoE;YACpE,MAAM,cAAc,GAAa,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC1D,4EAA4E;YAC5E,0EAA0E;YAC1E,8EAA8E;YAC9E,6EAA6E;YAC7E,oDAAoD;YACpD,OAAO,IAAI,CAAC,eAAe,CAAC,cAAc,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CACzF,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC9D,IAAA,kBAAO,EAAC;gBACN,SAAS;gBACT,YAAY,EAAE,UAAU;gBACxB,aAAa,EAAE,cAAc;gBAC7B,KAAK;gBACL,SAAS,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;gBACjD,OAAO;gBACP,WAAW,EAAE,MAAM;aACpB,CAAC,CACH,CACF,CAAC;QACJ,CAAC;QACD,qEAAqE;QACrE,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAC/D,IAAA,kBAAO,EAAC;YACN,SAAS;YACT,YAAY,EAAE,IAAI;YAClB,aAAa,EAAE,SAAS,CAAC,QAAQ,CAAC,QAAQ;YAC1C,KAAK;YACL,SAAS,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE;YAC3C,OAAO;SACR,CAAC,CACH,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,eAAe,CAC3B,SAA2B,EAC3B,IAAU,EACV,IAAY,EACZ,IAA0B,EAC1B,QAA+C,EAC/C,KAAkD;QAElD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE;YACtF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,yEAAyE;gBACzE,4EAA4E;gBAC5E,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC;YAC1F,CAAC;YACD,MAAM,MAAM,GAAkC,IAAI,CAAC,WAAW,CAAC;YAC/D,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,2EAA2E;gBAC3E,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED,4DAA4D;IACpD,KAAK,CAAC,qBAAqB,CACjC,SAA2B,EAC3B,IAA0B,EAC1B,IAAY,EACZ,MAAyB,EACzB,KAAkD;QAElD,OAAO,wBAAwB,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,aAAa,CAC5F,CAAC,WAAW,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,CACjG,CAAC;IACJ,CAAC;IAED,iFAAiF;IACzE,KAAK,CAAC,6BAA6B,CACzC,SAA2B,EAC3B,IAA0B,EAC1B,MAAyB,EACzB,KAAkD,EAClD,WAAmC;QAEnC,MAAM,QAAQ,GAAqC,MAAM,IAAI,CAAC,QAAQ,CACpE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,EAC/B,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,oBAAoB,CAC3D,CAAC;QACF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;YACzB,OAAO,IAAA,eAAI,EAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAChC,CAAC;QACD,8EAA8E;QAC9E,+EAA+E;QAC/E,yEAAyE;QACzE,mEAAmE;QACnE,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACjC,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,2EAA2E;QAC3E,4EAA4E;QAC5E,MAAM,MAAM,GAAiB,QAAQ,CAAC,KAAK,CAAC;QAC5C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,QAAQ,CACjC,GAAG,EAAE,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,EAC5D,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,qBAAqB,CAC5D,CAAC;QACF,IAAI,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC;YACxB,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,OAAO,GAAiC,EAAE,CAAC;QACjD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAChC,4EAA4E;YAC5E,6EAA6E;YAC7E,4EAA4E;YAC5E,0EAA0E;YAC1E,0EAA0E;YAC1E,8EAA8E;YAC9E,wEAAwE;YACxE,MAAM,MAAM,GAAY,GAAG,CAAC,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC;YACzF,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,oBAAoB,IAAI,MAAM,EAAE,CAAC;gBACpD,SAAS;YACX,CAAC;YACD,MAAM,MAAM,GAAuC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;YACxF,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC,QAAQ,CAClB,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,EACjD,WAAW,SAAS,CAAC,QAAQ,CAAC,QAAQ,YAAY,CACnD,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;OAqBG;IACK,eAAe,CACrB,IAAU,EACV,IAAY,EACZ,IAA0B,EAC1B,QAA+C;QAE/C,MAAM,UAAU,GAAe,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC/D,8EAA8E;QAC9E,0EAA0E;QAC1E,0EAA0E;QAC1E,2EAA2E;QAC3E,uDAAuD;QACvD,MAAM,MAAM,GAA0C,QAAQ,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YAC/E,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAA,wBAAgB,EAAC,MAAM,CAAC,IAAI,CAAC,IAAA,wBAAgB,EAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC7F,OAAO,KAAK,CAAC;YACf,CAAC;YACD,MAAM,UAAU,GAAqC,IAAI,CAAC,eAAe,CACvE,MAAM,CAAC,QAAQ,CAAC,QAAQ,EACxB,MAAM,CAAC,QAAQ,CAAC,IAAI,CACrB,CAAC,SAAS,EAAE,CAAC;YACd,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChE,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC;QACvE,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE,CAClD,IAAA,qBAAU,EACR,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACpB,wBAAwB,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,UAAU,EAAE,EAAE,CAC1E,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,SAAS,EAAE,EAAE,CACvE,IAAA,kBAAO,EAAC,EAAE,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,CACpD,CACF,CACF,CACF,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,WAAC,OAAA,IAAA,kBAAO,EAAC,MAAA,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,0CAAE,EAAE,CAAC,CAAA,EAAA,CAAC,CAC9E,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACK,MAAM,CAAC,iBAAiB,CAAC,MAA8B;QAC7D,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACpC,OAAO,IAAA,eAAI,EACT,0BAA0B,MAAM,CAAC,QAAQ,CAAC,EAAE,gCAAgC,OAAO,MAAM,CAAC,IAAI,GAAG,CAClG,CAAC;QACJ,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,0EAA0E;IAClE,SAAS,CAAC,IAAU,EAAE,IAAY;QACxC,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,+GAA+G;IACvG,KAAK,CAAC,OAAO,CACnB,IAAiB,EACjB,aAA4C,EAC5C,SAA2C,EAC3C,MAAoC,EACpC,KAAkD;QAElD,MAAM,kBAAkB,GAAyB,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAC5E,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,EAAE,EAAE,IAAI,CAAC,SAAS;SACnB,CAAC,CAAC,CAAC;QACJ,MAAM,QAAQ,GAA0C,MAAM,IAAI,CAAC,QAAQ,CACzE,GAAG,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,kBAAkB,EAAE,CAAC,EAC9E,WAAW,IAAI,CAAC,EAAE,WAAW,CAC9B,CAAC;QACF,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,CAAC;YACzB,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,0EAA0E;QAC1E,6EAA6E;QAC7E,uEAAuE;QACvE,MAAM,KAAK,GAAkC,wBAAwB,CAAC,cAAc,CAClF,QAAQ,CAAC,KAAK,EACd,SAAS,CACV,CAAC;QACF,8EAA8E;QAC9E,2EAA2E;QAC3E,iBAAiB;QACjB,MAAM,MAAM,GAAwB,IAAI,GAAG,CACzC,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAC3D,CAAC;QACF,MAAM,UAAU,GAAiB,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACjF,IAAI,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YAClC,MAAM,KAAK,GAAiB,IAAA,2BAAc,EACxC,wBAAwB,CAAC,cAAc,CAAC,MAAM,CAAC,EAC/C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CACnF,CAAC;YACF,IAAI,KAAK,CAAC,SAAS,EAAE,EAAE,CAAC;gBACtB,OAAO,IAAA,eAAI,EAAC,WAAW,IAAI,CAAC,EAAE,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACK,MAAM,CAAC,kBAAkB,CAAC,KAAoC;QACpE,MAAM,SAAS,GAA6B,IAAI,GAAG,EAAuB,CAAC;QAC3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;gBAC5C,SAAS,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,MAAM,CAAC,cAAc,CAC3B,KAAoC,EACpC,SAA2C;QAE3C,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACrB,MAAM,EAAE,GAA4B,SAAS,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAChF,OAAO,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAM,CAAC,KAAE,IAAI,kCAAO,CAAC,CAAC,IAAI,KAAE,MAAM,EAAE,EAAE,MAAI,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACK,cAAc,CACpB,IAAiB,EACjB,KAAoC,EACpC,MAA2B,EAC3B,KAAkD;QAElD,OAAO,IAAA,qBAAU,EACf,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACjB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC5C,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,mBAAmB,wBAAwB,CAAC,aAAa,CACzE,IAAI,CAAC,MAAM,CACZ,oCAAoC,CACtC,CAAC;YACJ,CAAC;YACD,MAAM,SAAS,GAAW,IAAA,qBAAa,EAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC1D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,SAAS,EAAE,CAAC;gBACjE,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,mBAAmB,wBAAwB,CAAC,aAAa,CACzE,IAAI,CAAC,IAAI,CAAC,MAAM,CACjB,kEAAkE,CACpE,CAAC;YACJ,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC;QACvB,CAAC,CAAC,CACH,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACnC,CAAC;IAED,uFAAuF;IAC/E,KAAK,CAAC,cAAc,CAC1B,IAAiB,EACjB,IAAoB,EACpB,QAAuC;QAEvC,MAAM,MAAM,GAAW,IAAA,qBAAa,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,OAAO,GAAkC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,qBAAa,EAAC,CAAC,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC;QAC1G,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,cAAc,EAAE,CAAC;YAC5C,4EAA4E;YAC5E,0EAA0E;YAC1E,OAAO,IAAA,kBAAO,EAAC;gBACb,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,UAAU,EAAE,IAAI,CAAC,OAAO;gBACxB,WAAW,EAAE,SAAS;gBACtB,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;gBAC1B,KAAK,EAAE,OAAO;aACf,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAC3E,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;aAC5B,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,WAAW,IAAI,CAAC,EAAE,oBAAoB,GAAG,EAAE,CAAC;aACrE,SAAS,CAAC,CAAC,SAAS,EAAE,EAAE;YACvB,MAAM,WAAW,GAAsB,IAAI,CAAC,OAAO,CAAC,OAAO,KAAK,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;YACpG,MAAM,SAAS,GACb,IAAI,CAAC,YAAY,CAAC,WAAW,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,6BAAqB,CAAC;gBACzF,CAAC,CAAC,oBAAoB;gBACtB,CAAC,CAAC,SAAS,CAAC;YAChB,OAAO,IAAA,kBAAO,kBACZ,SAAS,EAAE,IAAI,CAAC,SAAS,EACzB,UAAU,EAAE,IAAI,CAAC,OAAO,EACxB,WAAW,EACX,EAAE,EAAE,SAAS,CAAC,QAAQ,CAAC,EAAE,EACzB,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,OAAO,IACX,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EACjD,CAAC;QACL,CAAC,CAAC,CACL,CAAC;IACJ,CAAC;IAED,+FAA+F;IACvF,YAAY,CAClB,IAAiB,EACjB,IAAoB,EACpB,OAAsC;QAEtC,MAAM,IAAI,GACR,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;QAC1B,+EAA+E;QAC/E,+EAA+E;QAC/E,2EAA2E;QAC3E,uCAAuC;QACvC,MAAM,MAAM,GAAuC,IAAI,CAAC,WAAW,CAAC;QACpE,MAAM,UAAU,GAAyB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;QAC3F,MAAM,SAAS,GAAuB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACvF,MAAM,eAAe,GAAgB,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;QACxG,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;QACzE,gFAAgF;QAChF,4EAA4E;QAC5E,gFAAgF;QAChF,mEAAmE;QACnE,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,UAAU,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE;YAClG,MAAM,UAAU,+DAIX,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC,GAC7C,IAAI,CAAC,UAAU,KAClB,MAAM,EAAE,qCAA6B,KAClC,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACvE,CAAC;YACF,MAAM,QAAQ,mCACT,IAAI,KACP,EAAE,EACF,QAAQ,EAAE,IAAI,CAAC,aAAa,EAC5B,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,EAAE,EACf,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,CAAC,EACV,UAAU,EACV,IAAI,EAAE,wBAAwB,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,EAC/D,KAAK,GACN,CAAC;YACF,OAAO,IAAA,kBAAO,EAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1D,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;IAED,6EAA6E;IACrE,MAAM,CAAC,UAAU,CAAC,KAAyB,EAAE,QAA4B;QAC/E,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAU,CAAC;QAC5C,MAAM,GAAG,GAAU,EAAE,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,KAAK,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,0FAA0F;IAClF,WAAW,CAAC,KAA2B;QAC7C,MAAM,IAAI,GAAgB,IAAI,GAAG,EAAU,CAAC;QAC5C,MAAM,OAAO,GAAY,EAAE,CAAC;QAC5B,OAAO,IAAA,qBAAU,EACf,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACjB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;YAC/C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,OAAO,IAAA,kBAAO,EAAC,GAAG,CAAC,CAAC;QACtB,CAAC,CAAC,CACH,CACF,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAA,kBAAO,EAAC,OAAO,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,oFAAoF;IAC5E,eAAe,CAAC,QAAkB,EAAE,IAAU;;QACpD,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,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAChC,CAAC;IAED,yGAAyG;IACjG,KAAK,CAAC,QAAQ,CAAI,EAA4B,EAAE,KAAa;QACnE,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,OAAO,GAAW,GAAG,KAAK,WAAW,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACzD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3B,OAAO,IAAA,eAAI,EAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACK,MAAM,CAAC,cAAc,CAAC,MAAoC;QAChE,MAAM,KAAK,GAAsB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACK,aAAa,CACnB,OAA8C;QAE9C,OAAO,IAAA,qBAAU,EACf,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CACrB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;aACjE,eAAe,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,2CAA2C,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC;aAClG,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAA,kBAAO,EAAC,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CACpG,CACF,CAAC;IACJ,CAAC;IAED,8FAA8F;IACtF,MAAM,CAAC,aAAa,CAAC,MAAmB;QAC9C,OAAO,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;IACxC,CAAC;IAED,oFAAoF;IAC5E,MAAM,CAAC,kBAAkB,CAC/B,SAA2B,EAC3B,MAAc,EACd,IAAY;QAEZ,OAAO,eAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,EAAE;YACvD,MAAM,QAAQ,mCACT,SAAS,CAAC,QAAQ,KACrB,EAAE,EACF,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,EAAE,EACf,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,CAAC,GACX,CAAC;YACF,OAAO,IAAA,kBAAO,EAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,uFAAuF;IAC/E,MAAM,CAAC,aAAa,CAAC,IAAiB,EAAE,SAA2B;QACzE,IAAI,OAAO,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvC,OAAO,IAAA,eAAI,EACT,WAAW,IAAI,CAAC,EAAE,+BAChB,SAAS,CAAC,QAAQ,CAAC,IACrB,2BAA2B,OAAO,SAAS,CAAC,IAAI,GAAG,CACpD,CAAC;QACJ,CAAC;QACD,OAAO,IAAA,kBAAO,EAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;CACF;AA3xBD,4DA2xBC","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 {\n  Convert,\n  DedupScope,\n  EntityId,\n  IEdge,\n  IEdgeTarget,\n  IIdentityCodec,\n  IIdentityCodecResult,\n  IMemoryEnvelope,\n  IMemoryRecord,\n  IProvenance,\n  Kind,\n  LinkType,\n  MemoryId,\n  Tag,\n  edgeTargetKey,\n  isTemporalRecord,\n  isVersionCurrent\n} from '../types';\nimport { IBodyConverterRegistry } from '../converters';\nimport { IMemoryStore, scanEveryRecord } from '../store';\nimport { IVectorIndex, MemoryEmbedder } from '../vector';\nimport { ICycleGuardEdge, assertNoCycles } from './cycleGuard';\nimport {\n  IEntityResolver,\n  IFactExtractor,\n  IMemoryClassifier,\n  IRelationCandidate,\n  IRelationExtractor\n} from './hostStages';\nimport {\n  ICandidateEdge,\n  ICandidateRecord,\n  IEntityResolutionCandidate,\n  IIngestItem,\n  IIngestItemResult,\n  IIngestedRecordResult,\n  IMemoryClassification,\n  IngestDisposition,\n  ResolutionVerdict\n} from './model';\n\n/**\n * The provenance source stamped on every record the ingest pipeline writes.\n * @public\n */\nexport const HOST_INGEST_PROVENANCE_SOURCE: string = 'host-ingest';\n\n/**\n * The link type whose presence on a temporal-kind candidate fires the\n * contradicts→temporal-versioned interlock.\n * @public\n */\nexport const CONTRADICTS_LINK_TYPE: LinkType = 'contradicts' as LinkType;\n\n/**\n * The default stage-4 layer-2 cosine similarity threshold (design note §2). A\n * near-duplicate candidate is surfaced to the {@link IEntityResolver} only when\n * its nearest neighbor scores `>= 0.85`.\n * @public\n */\nexport const DEFAULT_SIMILARITY_THRESHOLD: number = 0.85;\n\n/**\n * The default top-K for stage-4 layer-2 similarity candidate generation.\n * @public\n */\nexport const DEFAULT_SIMILARITY_TOP_K: number = 5;\n\n/**\n * How the write-time cycle guard behaves: `'reject'` (default — a cycle-inducing\n * edge fails the ingest) or `'off'` (no acyclicity constraint, for deployments\n * whose link graphs are legitimately cyclic — e.g. mutual associative links).\n * @public\n */\nexport type CycleGuardMode = 'reject' | 'off';\n\n/**\n * The fgv-owned six-stage ingest orchestrator. Composes the host's staged\n * classify / extract / (optional) resolve / relate machinery around fgv's owned\n * validation boundary, dedup, edge + cycle safety, provenance stamping, and the\n * contradicts→temporal interlock.\n * @public\n */\nexport interface IMemoryIngestOrchestrator {\n  /**\n   * Ingest a SINGLE item end-to-end (the first-class per-turn streaming path).\n   */\n  ingestItem(item: IIngestItem): Promise<Result<IIngestItemResult>>;\n\n  /**\n   * Ingest a batch of items. A convenience loop over {@link\n   * IMemoryIngestOrchestrator.ingestItem | ingestItem} — items are processed in\n   * order and the first failure aborts the batch.\n   */\n  ingestBatch(items: ReadonlyArray<IIngestItem>): Promise<Result<ReadonlyArray<IIngestItemResult>>>;\n}\n\n/**\n * Parameters for {@link MemoryIngestOrchestrator.create}.\n * @public\n */\nexport interface IMemoryIngestOrchestratorCreateParams {\n  /** The store every write bottoms out in (stage 6). */\n  readonly store: IMemoryStore;\n  /** Per-kind body converter registry — the stage-3 typed validation boundary. */\n  readonly registry: IBodyConverterRegistry;\n  /** Per-kind identity codecs (maps a candidate `entityId` to its storage address). */\n  readonly codecs?: ReadonlyMap<Kind, IIdentityCodec>;\n  /** Default identity codec for kinds without an explicit entry. */\n  readonly defaultCodec?: IIdentityCodec;\n  /** Stage 2 — the host's classifier. */\n  readonly classifier: IMemoryClassifier;\n  /** Stage 3 — the host's fact extractor. */\n  readonly extractor: IFactExtractor;\n  /** Stage 5 — the host's relation extractor. */\n  readonly relationExtractor: IRelationExtractor;\n  /**\n   * Stage 4 (optional, OQ-13) — the host's entity resolver. Absent → stage-4\n   * dedup is exact-`{ kind, body }`-hash only (the deterministic-identity path).\n   */\n  readonly entityResolver?: IEntityResolver;\n  /**\n   * Optional vector index for stage-4 layer-2 similarity candidate-gen. Wired\n   * together with {@link IMemoryIngestOrchestratorCreateParams.embed | embed} AND\n   * {@link IMemoryIngestOrchestratorCreateParams.entityResolver | entityResolver};\n   * absent (or either co-requisite absent) → layer-2 is skipped and dedup is\n   * exact-only.\n   */\n  readonly vectorIndex?: IVectorIndex;\n  /** Optional embedder used to embed a candidate for layer-2 similarity search. */\n  readonly embed?: MemoryEmbedder;\n  /**\n   * Stage-4 layer-2 cosine threshold. Defaults to {@link\n   * DEFAULT_SIMILARITY_THRESHOLD} (`0.85`).\n   */\n  readonly similarityThreshold?: number;\n  /**\n   * Stage-4 layer-2 top-K. Defaults to {@link DEFAULT_SIMILARITY_TOP_K} (`5`).\n   */\n  readonly similarityTopK?: number;\n  /** Write-time cycle guard mode. Defaults to `'reject'`. */\n  readonly cycleGuard?: CycleGuardMode;\n  /** Diagnostic logger (defaults to a no-op). */\n  readonly logger?: Logging.ILogger;\n}\n\n/** The fully-wired stage-4 layer-2 dependencies (present only when all three are supplied). */\ninterface ISimilarityWiring {\n  readonly resolver: IEntityResolver;\n  readonly vectorIndex: IVectorIndex;\n  readonly embed: MemoryEmbedder;\n}\n\n/** A snapshot record paired with its resolved scope-qualified `(scope, id)` address. */\ninterface IScopedRecord {\n  readonly address: IEdgeTarget;\n  readonly record: IMemoryRecord<unknown>;\n}\n\n/** Internal per-candidate plan threaded through the pipeline. */\ninterface ICandidatePlan {\n  readonly candidate: ICandidateRecord;\n  /** The write target's storage address (re-addressed to the target for merge-into). */\n  readonly writeAddress: IIdentityCodecResult;\n  /** The write target's entity id (re-addressed for merge-into). */\n  readonly writeEntityId: EntityId;\n  /** The reference id used in stage-5 edges (the write target's `idStem`). */\n  readonly refId: MemoryId;\n  /**\n   * The scope-qualified reference used in stage-5 edges: the write target's\n   * `(scope, idStem)`. Stage-5 sources / dedup all key on this scoped address so\n   * two candidates that share a stem across scopes never collide.\n   */\n  readonly refTarget: IEdgeTarget;\n  /** The resolution verdict; carries the target id on its target-bearing arms. */\n  readonly verdict: ResolutionVerdict;\n  /**\n   * The pre-ingest target record for a `merge-into` write — its existing\n   * `tags` / `links` / `provenance` are UNIONed with the candidate's at stage 6\n   * so a wholesale-replace merge never wipes them.\n   */\n  readonly mergeTarget?: IMemoryRecord<unknown>;\n}\n\n/**\n * Default {@link IMemoryIngestOrchestrator}.\n * @public\n */\nexport class MemoryIngestOrchestrator implements IMemoryIngestOrchestrator {\n  private readonly _store: IMemoryStore;\n  private readonly _registry: IBodyConverterRegistry;\n  private readonly _codecs: ReadonlyMap<Kind, IIdentityCodec>;\n  private readonly _defaultCodec: IIdentityCodec | undefined;\n  private readonly _classifier: IMemoryClassifier;\n  private readonly _extractor: IFactExtractor;\n  private readonly _relationExtractor: IRelationExtractor;\n  private readonly _similarity: ISimilarityWiring | undefined;\n  private readonly _similarityThreshold: number;\n  private readonly _similarityTopK: number;\n  private readonly _cycleGuard: CycleGuardMode;\n  private readonly _logger: Logging.ILogger;\n  private readonly _hasher: Hash.Crc32Normalizer;\n\n  private constructor(params: IMemoryIngestOrchestratorCreateParams) {\n    this._store = params.store;\n    this._registry = params.registry;\n    this._codecs = params.codecs ?? new Map<Kind, IIdentityCodec>();\n    this._defaultCodec = params.defaultCodec;\n    this._classifier = params.classifier;\n    this._extractor = params.extractor;\n    this._relationExtractor = params.relationExtractor;\n    this._similarity =\n      params.entityResolver !== undefined && params.vectorIndex !== undefined && params.embed !== undefined\n        ? { resolver: params.entityResolver, vectorIndex: params.vectorIndex, embed: params.embed }\n        : undefined;\n    this._similarityThreshold = params.similarityThreshold ?? DEFAULT_SIMILARITY_THRESHOLD;\n    this._similarityTopK = params.similarityTopK ?? DEFAULT_SIMILARITY_TOP_K;\n    this._cycleGuard = params.cycleGuard ?? 'reject';\n    this._logger = params.logger ?? new Logging.NoOpLogger();\n    this._hasher = new Hash.Crc32Normalizer();\n  }\n\n  /** Family-convention factory. */\n  public static create(params: IMemoryIngestOrchestratorCreateParams): Result<MemoryIngestOrchestrator> {\n    return succeed(new MemoryIngestOrchestrator(params));\n  }\n\n  /** {@inheritDoc IMemoryIngestOrchestrator.ingestItem} */\n  public async ingestItem(item: IIngestItem): Promise<Result<IIngestItemResult>> {\n    return (await this._classify(item))\n      .thenOnSuccess((classification) => this._extract(item, classification))\n      .thenOnSuccess((candidates) => this._processCandidates(item, candidates));\n  }\n\n  /** {@inheritDoc IMemoryIngestOrchestrator.ingestBatch} */\n  public async ingestBatch(\n    items: ReadonlyArray<IIngestItem>\n  ): Promise<Result<ReadonlyArray<IIngestItemResult>>> {\n    const results: IIngestItemResult[] = [];\n    for (const item of items) {\n      const result: Result<IIngestItemResult> = await this.ingestItem(item);\n      if (result.isFailure()) {\n        return fail(result.message);\n      }\n      results.push(result.value);\n    }\n    return succeed(results);\n  }\n\n  /** Stage 2 — classify (host), normalizing a rejected promise into a Failure. */\n  private async _classify(item: IIngestItem): Promise<Result<IMemoryClassification>> {\n    return this._capture(() => this._classifier.classify(item), `ingest '${item.id}': classify`);\n  }\n\n  /** Stage 3 — extract (host), normalizing a rejected promise into a Failure. */\n  private async _extract(\n    item: IIngestItem,\n    classification: IMemoryClassification\n  ): Promise<Result<ReadonlyArray<ICandidateRecord>>> {\n    return this._capture(() => this._extractor.extract(item, classification), `ingest '${item.id}': extract`);\n  }\n\n  /**\n   * Stages 3b-6 over the extracted candidates: validate bodies, resolve/dedup\n   * (stage 4), relate + cycle guard (stage 5), and load-with-provenance (stage 6).\n   */\n  private async _processCandidates(\n    item: IIngestItem,\n    candidates: ReadonlyArray<ICandidateRecord>\n  ): Promise<Result<IIngestItemResult>> {\n    // Snapshot the store once; stage-4 resolution and the cycle guard reason over\n    // the pre-ingest state.\n    //\n    // DECLARED, not optimized. This reads every body in the vault on EVERY\n    // ingested item, and `scanEveryRecord()` is how the store now makes a caller\n    // say so out loud. Most of what the snapshot is used for downstream — edge\n    // target existence, the cycle guard's link walk, scoped-address keying — is\n    // envelope-only work that `listEntries()` would serve without reading a\n    // single file; only stage-4 layer-1's exact `{ kind, body }` match needs\n    // bodies, and it needs them for candidates rather than for the whole vault.\n    // Converting this is its own stream (`agent-memory-ingest-snapshot`), because\n    // it is on the write path with its own risk surface. Until then the cost is\n    // at least visible and greppable rather than implied.\n    const snapshotResult: Result<ReadonlyArray<IMemoryRecord<unknown>>> = await this._store.list(\n      scanEveryRecord()\n    );\n    if (snapshotResult.isFailure()) {\n      return fail(`ingest '${item.id}': failed to snapshot store: ${snapshotResult.message}`);\n    }\n    const snapshot: ReadonlyArray<IMemoryRecord<unknown>> = snapshotResult.value;\n    // Resolve every snapshot record's scope-qualified address ONCE, then index it\n    // by the canonical scoped key. The single `byKey` view drives BOTH the edge\n    // path (validation + cycle guard) AND the verdict/similarity target lookups —\n    // so a filename stem reused across scopes never aliases on any path.\n    const scopedResult: Result<ReadonlyArray<IScopedRecord>> = this._scopeRecords(snapshot);\n    if (scopedResult.isFailure()) {\n      return fail(`ingest '${item.id}': ${scopedResult.message}`);\n    }\n    const scoped: ReadonlyArray<IScopedRecord> = scopedResult.value;\n    const byKey: ReadonlyMap<string, IMemoryRecord<unknown>> = new Map<string, IMemoryRecord<unknown>>(\n      scoped.map((s) => [edgeTargetKey(s.address), s.record])\n    );\n\n    // Stage 3b + 4: validate each body and resolve a verdict/plan.\n    const plans: ICandidatePlan[] = [];\n    for (const candidate of candidates) {\n      const planResult: Result<ICandidatePlan> = await this._planCandidate(item, candidate, snapshot, byKey);\n      if (planResult.isFailure()) {\n        return fail(planResult.message);\n      }\n      plans.push(planResult.value);\n    }\n\n    // Stage 5: relate over the writable candidates, validate + cycle-guard.\n    const writablePlans: ICandidatePlan[] = plans.filter((plan) => plan.verdict.verdict !== 'duplicate-of');\n    const edgesResult: Result<ReadonlyArray<ICandidateEdge>> = await this._relate(\n      item,\n      writablePlans,\n      MemoryIngestOrchestrator._collapseRedirects(plans),\n      scoped,\n      byKey\n    );\n    if (edgesResult.isFailure()) {\n      return fail(edgesResult.message);\n    }\n    const edges: ReadonlyArray<ICandidateEdge> = edgesResult.value;\n\n    // Stage 6: load-with-provenance, in extraction order.\n    const records: IIngestedRecordResult[] = [];\n    for (const plan of plans) {\n      const outcome: Result<IIngestedRecordResult> = await this._loadCandidate(item, plan, edges);\n      if (outcome.isFailure()) {\n        return fail(outcome.message);\n      }\n      records.push(outcome.value);\n    }\n    return succeed({ item, records });\n  }\n\n  /** Stage 3b + 4 for one candidate: validate body, resolve address, resolve verdict. */\n  private async _planCandidate(\n    item: IIngestItem,\n    candidate: ICandidateRecord,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ICandidatePlan>> {\n    const kind: Kind = candidate.envelope.kind;\n    // Stage 3b: the typed validation boundary — no unchecked host body reaches the store.\n    const bodyResult: Result<string> = this._registry\n      .convert(kind, candidate.body)\n      .withErrorFormat((msg) => `ingest '${item.id}': candidate body for kind '${kind}' is invalid: ${msg}`)\n      .onSuccess(() => MemoryIngestOrchestrator._asStringBody(item, candidate));\n    if (bodyResult.isFailure()) {\n      return fail(bodyResult.message);\n    }\n    const body: string = bodyResult.value;\n\n    const addrResult: Result<IIdentityCodecResult> = this._resolveAddress(candidate.envelope.entityId, kind);\n    if (addrResult.isFailure()) {\n      return fail(`ingest '${item.id}': ${addrResult.message}`);\n    }\n    const addr: IIdentityCodecResult = addrResult.value;\n\n    return (await this._resolveVerdict(candidate, kind, body, addr, snapshot, byKey)).onSuccess((verdict) =>\n      this._planFromVerdict(item, candidate, addr, verdict, byKey)\n    );\n  }\n\n  /**\n   * Turn a resolved verdict into a candidate plan. A `new` verdict writes under the\n   * candidate's own address. Every TARGET-bearing verdict\n   * (`duplicate-of` / `supersede` / `merge-into`) is validated uniformly: the\n   * target must be a real store record (fgv owns validation — a non-compliant host\n   * resolver never smuggles a bogus id through) AND its kind must equal the\n   * candidate's kind (a cross-kind target would write to the wrong scope). Only\n   * `merge-into` re-addresses the write to the target's entity.\n   */\n  private _planFromVerdict(\n    item: IIngestItem,\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    verdict: ResolutionVerdict,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Result<ICandidatePlan> {\n    if (verdict.verdict === 'new') {\n      return Convert.memoryId.convert(addr.idStem).onSuccess((refId) =>\n        succeed({\n          candidate,\n          writeAddress: addr,\n          writeEntityId: candidate.envelope.entityId,\n          refId,\n          refTarget: { scope: addr.scope, id: refId },\n          verdict\n        })\n      );\n    }\n    // duplicate-of | supersede | merge-into: the target must exist and share the\n    // candidate's kind. Lookup is on the canonical scoped key, so a stem reused\n    // across scopes binds only the record the verdict actually named.\n    const target: IMemoryRecord<unknown> | undefined = byKey.get(edgeTargetKey(verdict.target));\n    if (target === undefined) {\n      return fail(\n        `ingest '${item.id}': ${verdict.verdict} target '${MemoryIngestOrchestrator._formatTarget(\n          verdict.target\n        )}' does not exist in the store`\n      );\n    }\n    if (target.envelope.kind !== candidate.envelope.kind) {\n      return fail(\n        `ingest '${item.id}': ${verdict.verdict} target '${MemoryIngestOrchestrator._formatTarget(\n          verdict.target\n        )}' is kind '${target.envelope.kind}' but the candidate is kind '${candidate.envelope.kind}'`\n      );\n    }\n    if (verdict.verdict === 'merge-into') {\n      // Re-address the write to the target's entity, carrying the target record so\n      // stage 6 can UNION its existing tags/links (never overwrite them).\n      const targetEntityId: EntityId = target.envelope.entityId;\n      // The merge target is a snapshot record, and `_scopeRecords` already proved\n      // every snapshot record's address resolves before planning runs — so this\n      // re-resolve (needed for the full codec result: scope + idStem + isVersioned)\n      // cannot fail. No error-context wrap is warranted; a failure here would be a\n      // logic contradiction, not a user-facing condition.\n      return this._resolveAddress(targetEntityId, target.envelope.kind).onSuccess((targetAddr) =>\n        Convert.memoryId.convert(targetAddr.idStem).onSuccess((refId) =>\n          succeed({\n            candidate,\n            writeAddress: targetAddr,\n            writeEntityId: targetEntityId,\n            refId,\n            refTarget: { scope: targetAddr.scope, id: refId },\n            verdict,\n            mergeTarget: target\n          })\n        )\n      );\n    }\n    // duplicate-of | supersede: write under the candidate's own address.\n    return Convert.memoryId.convert(addr.idStem).onSuccess((refId) =>\n      succeed({\n        candidate,\n        writeAddress: addr,\n        writeEntityId: candidate.envelope.entityId,\n        refId,\n        refTarget: { scope: addr.scope, id: refId },\n        verdict\n      })\n    );\n  }\n\n  /**\n   * Stage 4 — resolve a dedup verdict. Layer 1: an exact `{ kind, body }` match in\n   * the candidate's scope is a `duplicate-of`, at the granularity the kind's\n   * {@link DedupScope} declares — scope-wide for `'content'`, restricted to the\n   * candidate's own entity for `'entity'` (design note §1). Layer 2 (only when\n   * a resolver + vector index + embedder are all wired): embed the candidate,\n   * surface over-threshold neighbors, and dispatch to the {@link IEntityResolver}.\n   * Otherwise the verdict is `new` (the exact-only fall-back path).\n   */\n  private async _resolveVerdict(\n    candidate: ICandidateRecord,\n    kind: Kind,\n    body: string,\n    addr: IIdentityCodecResult,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ResolutionVerdict>> {\n    return this._findExactMatch(kind, body, addr, snapshot).thenOnSuccess(async (matchId) => {\n      if (matchId !== undefined) {\n        // The exact-match cohort is filtered to `addr.scope`, so the match lives\n        // under that scope — its scope-qualified target is `(addr.scope, matchId)`.\n        return succeed({ verdict: 'duplicate-of', target: { scope: addr.scope, id: matchId } });\n      }\n      const layer2: ISimilarityWiring | undefined = this._similarity;\n      if (layer2 === undefined) {\n        // No layer-2: exact-only fall-back (the deterministic-identity host path).\n        return succeed({ verdict: 'new' });\n      }\n      return this._resolveViaSimilarity(candidate, addr, body, layer2, byKey);\n    });\n  }\n\n  /** Layer-2 similarity candidate-gen + resolver dispatch. */\n  private async _resolveViaSimilarity(\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    body: string,\n    wiring: ISimilarityWiring,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ResolutionVerdict>> {\n    return MemoryIngestOrchestrator._provisionalRecord(candidate, addr.idStem, body).thenOnSuccess(\n      (provisional) => this._resolveViaSimilarityEmbedded(candidate, addr, wiring, byKey, provisional)\n    );\n  }\n\n  /** Layer-2 continuation once the candidate has a provisional record to embed. */\n  private async _resolveViaSimilarityEmbedded(\n    candidate: ICandidateRecord,\n    addr: IIdentityCodecResult,\n    wiring: ISimilarityWiring,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>,\n    provisional: IMemoryRecord<unknown>\n  ): Promise<Result<ResolutionVerdict>> {\n    const embedded: Result<Float32Array | undefined> = await this._capture(\n      () => wiring.embed(provisional),\n      `ingest '${candidate.envelope.entityId}': embed candidate`\n    );\n    if (embedded.isFailure()) {\n      return fail(embedded.message);\n    }\n    // The embedder deliberately declined this candidate, so there is no vector to\n    // search with and layer-2 similarity dedup cannot run for it. That is the same\n    // position as a search that found nothing similar — `'new'` — and not an\n    // error: declining to embed a kind must not make it un-ingestable.\n    if (embedded.value === undefined) {\n      return succeed({ verdict: 'new' });\n    }\n    // Hoisted: the `undefined` check above does not narrow across the callback\n    // boundary below, and a local keeps the non-null assertion out of the code.\n    const vector: Float32Array = embedded.value;\n    const queried = await this._capture(\n      () => wiring.vectorIndex.query(vector, this._similarityTopK),\n      `ingest '${candidate.envelope.entityId}': similarity query`\n    );\n    if (queried.isFailure()) {\n      return fail(queried.message);\n    }\n    const similar: IEntityResolutionCandidate[] = [];\n    for (const hit of queried.value) {\n      // Skip below-threshold hits and the candidate's OWN scope-qualified address\n      // (a re-ingest of the same entity must not dedup against its prior version).\n      // Both the scope AND the id must match to be \"self\" — a same-stem record in\n      // another scope is a legitimate distinct neighbor. This field-equality is\n      // exactly equivalent to comparing `edgeTargetKey(hit.target)` against the\n      // candidate's own key (edgeTargetKey is pure and injective on `(scope, id)`),\n      // so this one site reads the components directly rather than re-keying.\n      const isSelf: boolean = hit.target.scope === addr.scope && hit.target.id === addr.idStem;\n      if (hit.score < this._similarityThreshold || isSelf) {\n        continue;\n      }\n      const record: IMemoryRecord<unknown> | undefined = byKey.get(edgeTargetKey(hit.target));\n      if (record !== undefined) {\n        similar.push({ target: hit.target, record, score: hit.score });\n      }\n    }\n    if (similar.length === 0) {\n      return succeed({ verdict: 'new' });\n    }\n    return this._capture(\n      () => wiring.resolver.resolve(candidate, similar),\n      `ingest '${candidate.envelope.entityId}': resolve`\n    );\n  }\n\n  /**\n   * Find an existing record whose `{ kind, body }` hash matches the candidate's\n   * (layer-1 exact dedup, design note §1). Invalidated temporal versions are\n   * excluded — only a live (non-temporal or current) record deduplicates a\n   * candidate.\n   *\n   * @remarks\n   * The cohort's granularity is the kind's DECLARED {@link DedupScope}, read\n   * through {@link IMemoryStore.dedupScopeFor} so this layer and the store's own\n   * write path can never disagree:\n   *\n   * - `'content'` — every live same-kind record in the candidate's scope,\n   *   regardless of entity. A cross-id body collision IS a duplicate (the\n   *   knowledge family; unchanged behavior).\n   * - `'entity'` — only records at the candidate's OWN entity address. Two\n   *   distinct entities with byte-identical bodies never collapse into one\n   *   another, which is what the declaration has always meant on the direct-put\n   *   path and now means here too.\n   *\n   * The same-id collapse itself remains the store's job — this layer only decides\n   * whether a cross-id body collision is eligible to be a `duplicate-of` at all.\n   */\n  private _findExactMatch(\n    kind: Kind,\n    body: string,\n    addr: IIdentityCodecResult,\n    snapshot: ReadonlyArray<IMemoryRecord<unknown>>\n  ): Result<MemoryId | undefined> {\n    const dedupScope: DedupScope = this._store.dedupScopeFor(kind);\n    // Same-kind, same-scope, LIVE (non-temporal or current) records are the exact\n    // cohort, narrowed to the candidate's own entity address under `'entity'`\n    // granularity. `_resolveAddress(...).orDefault()` collapses an unresolved\n    // codec to `undefined` — a non-matching address — with no explicit failure\n    // branch, exactly as the scope-only filter did before.\n    const cohort: ReadonlyArray<IMemoryRecord<unknown>> = snapshot.filter((record) => {\n      if (record.envelope.kind !== kind || (isTemporalRecord(record) && !isVersionCurrent(record))) {\n        return false;\n      }\n      const recordAddr: IIdentityCodecResult | undefined = this._resolveAddress(\n        record.envelope.entityId,\n        record.envelope.kind\n      ).orDefault();\n      if (recordAddr === undefined || recordAddr.scope !== addr.scope) {\n        return false;\n      }\n      return dedupScope === 'content' || recordAddr.idStem === addr.idStem;\n    });\n    return this._exactKey(kind, body).onSuccess((key) =>\n      mapResults(\n        cohort.map((record) =>\n          MemoryIngestOrchestrator._recordBodyString(record).onSuccess((recordBody) =>\n            this._exactKey(record.envelope.kind, recordBody).onSuccess((recordKey) =>\n              succeed({ id: record.envelope.id, key: recordKey })\n            )\n          )\n        )\n      ).onSuccess((keyed) => succeed(keyed.find((entry) => entry.key === key)?.id))\n    );\n  }\n\n  /**\n   * The body of a persisted record, required to be a string (the store persists\n   * only string bodies). Fails loudly rather than blind-casting an `unknown` body\n   * into the exact-dedup hash — a non-string existing body is a store-integrity\n   * fault, surfaced with context, not a silent miscompute.\n   */\n  private static _recordBodyString(record: IMemoryRecord<unknown>): Result<string> {\n    if (typeof record.body !== 'string') {\n      return fail(\n        `ingest: stored record '${record.envelope.id}' has a non-string body (got ${typeof record.body})`\n      );\n    }\n    return succeed(record.body);\n  }\n\n  /** The stage-4 exact-dedup key over `{ kind, body }` (design note §1). */\n  private _exactKey(kind: Kind, body: string): Result<string> {\n    return this._hasher.computeHash({ kind, body });\n  }\n\n  /** Stage 5 — relate (host), redirect collapsed targets, validate edges, and run the write-time cycle guard. */\n  private async _relate(\n    item: IIngestItem,\n    writablePlans: ReadonlyArray<ICandidatePlan>,\n    redirects: ReadonlyMap<string, IEdgeTarget>,\n    scoped: ReadonlyArray<IScopedRecord>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Promise<Result<ReadonlyArray<ICandidateEdge>>> {\n    const relationCandidates: IRelationCandidate[] = writablePlans.map((plan) => ({\n      candidate: plan.candidate,\n      id: plan.refTarget\n    }));\n    const proposed: Result<ReadonlyArray<ICandidateEdge>> = await this._capture(\n      () => this._relationExtractor.relate({ item, candidates: relationCandidates }),\n      `ingest '${item.id}': relate`\n    );\n    if (proposed.isFailure()) {\n      return proposed;\n    }\n    // Redirect BEFORE validation and BEFORE the cycle guard: an edge naming a\n    // collapsed candidate must be judged — and persisted — against the record it\n    // collapsed into, not against the address that no longer gets written.\n    const edges: ReadonlyArray<ICandidateEdge> = MemoryIngestOrchestrator._redirectEdges(\n      proposed.value,\n      redirects\n    );\n    // refIds and the existing-record view (`byKey`, shared with the verdict path)\n    // both key on the canonical scoped address, so a stem reused across scopes\n    // never aliases.\n    const refIds: ReadonlySet<string> = new Set<string>(\n      writablePlans.map((plan) => edgeTargetKey(plan.refTarget))\n    );\n    const validation: Result<true> = this._validateEdges(item, edges, refIds, byKey);\n    if (validation.isFailure()) {\n      return fail(validation.message);\n    }\n    if (this._cycleGuard === 'reject') {\n      const guard: Result<true> = assertNoCycles(\n        MemoryIngestOrchestrator._existingEdges(scoped),\n        edges.map((e) => ({ source: e.source, target: e.edge.target, type: e.edge.type }))\n      );\n      if (guard.isFailure()) {\n        return fail(`ingest '${item.id}': ${guard.message}`);\n      }\n    }\n    return succeed(edges);\n  }\n\n  /**\n   * The stage-5 edge-target redirect map for this pass: every `duplicate-of`\n   * candidate's OWN scoped address, mapped to the address of the record its\n   * verdict collapsed it into (design note §3).\n   *\n   * @remarks\n   * A `duplicate-of` verdict means \"this candidate IS that record\". The candidate\n   * is therefore not written, and its address never becomes a live reference — so\n   * a sibling edge built against it in the same pass would resolve to neither a\n   * written candidate nor an existing record and would fail the WHOLE ingest item.\n   * That is a second-order hazard of collapsing, not a defect in the edge: the\n   * host related two candidates it was correctly told about, and one of them\n   * turned out to already exist.\n   *\n   * Redirecting is the honest repair, and it is independent of {@link DedupScope}\n   * — it applies equally to a `'content'` kind, where the collapse is exactly\n   * right and the ingest still must not fail.\n   *\n   * The map cannot chain: {@link MemoryIngestOrchestrator._planFromVerdict}\n   * requires every target-bearing verdict's target to already exist in the store\n   * snapshot, so a redirect destination is always a persisted record and never\n   * another collapsed candidate. One pass is sufficient by construction.\n   */\n  private static _collapseRedirects(plans: ReadonlyArray<ICandidatePlan>): ReadonlyMap<string, IEdgeTarget> {\n    const redirects: Map<string, IEdgeTarget> = new Map<string, IEdgeTarget>();\n    for (const plan of plans) {\n      if (plan.verdict.verdict === 'duplicate-of') {\n        redirects.set(edgeTargetKey(plan.refTarget), plan.verdict.target);\n      }\n    }\n    return redirects;\n  }\n\n  /**\n   * Rewrite each edge whose TARGET names a collapsed candidate to point at the\n   * record that candidate collapsed into.\n   *\n   * @remarks\n   * Only the target is redirected. An edge whose SOURCE is a collapsed candidate\n   * stays untouched and is still rejected by {@link\n   * MemoryIngestOrchestrator._validateEdges}: sources are the records an edge is\n   * written ONTO, a collapsed candidate is never written, and the relation\n   * extractor is only ever offered writable candidates as edge sources in the\n   * first place. Silently relocating such an edge onto an existing record would\n   * attribute a link the host never asked for — the loud failure is correct there.\n   */\n  private static _redirectEdges(\n    edges: ReadonlyArray<ICandidateEdge>,\n    redirects: ReadonlyMap<string, IEdgeTarget>\n  ): ReadonlyArray<ICandidateEdge> {\n    if (redirects.size === 0) {\n      return edges;\n    }\n    return edges.map((e) => {\n      const to: IEdgeTarget | undefined = redirects.get(edgeTargetKey(e.edge.target));\n      return to === undefined ? e : { ...e, edge: { ...e.edge, target: to } };\n    });\n  }\n\n  /**\n   * Validate stage-5 edges: each `source` must be a candidate being written; each\n   * `target` must resolve to a sibling candidate or an existing store record. All\n   * matching is on the canonical scope-qualified address.\n   */\n  private _validateEdges(\n    item: IIngestItem,\n    edges: ReadonlyArray<ICandidateEdge>,\n    refIds: ReadonlySet<string>,\n    byKey: ReadonlyMap<string, IMemoryRecord<unknown>>\n  ): Result<true> {\n    return mapResults(\n      edges.map((edge) => {\n        if (!refIds.has(edgeTargetKey(edge.source))) {\n          return fail(\n            `ingest '${item.id}': edge source '${MemoryIngestOrchestrator._formatTarget(\n              edge.source\n            )}' is not a candidate being written`\n          );\n        }\n        const targetKey: string = edgeTargetKey(edge.edge.target);\n        if (!refIds.has(targetKey) && byKey.get(targetKey) === undefined) {\n          return fail(\n            `ingest '${item.id}': edge target '${MemoryIngestOrchestrator._formatTarget(\n              edge.edge.target\n            )}' resolves to neither a sibling candidate nor an existing record`\n          );\n        }\n        return succeed(true);\n      })\n    ).onSuccess(() => succeed(true));\n  }\n\n  /** Stage 6 — stamp provenance + edges, admit through the store, record the outcome. */\n  private async _loadCandidate(\n    item: IIngestItem,\n    plan: ICandidatePlan,\n    allEdges: ReadonlyArray<ICandidateEdge>\n  ): Promise<Result<IIngestedRecordResult>> {\n    const refKey: string = edgeTargetKey(plan.refTarget);\n    const myEdges: ReadonlyArray<ICandidateEdge> = allEdges.filter((e) => edgeTargetKey(e.source) === refKey);\n    if (plan.verdict.verdict === 'duplicate-of') {\n      // No write: the existing target satisfied the candidate. The target id is a\n      // typed field of the narrowed `duplicate-of` verdict — no cast, no guard.\n      return succeed({\n        candidate: plan.candidate,\n        resolution: plan.verdict,\n        disposition: 'deduped',\n        id: plan.verdict.target.id,\n        edges: myEdges\n      });\n    }\n    return this._buildRecord(item, plan, myEdges).thenOnSuccess(async (record) =>\n      (await this._store.put(record))\n        .withErrorFormat((msg) => `ingest '${item.id}': write failed: ${msg}`)\n        .onSuccess((persisted) => {\n          const disposition: IngestDisposition = plan.verdict.verdict === 'merge-into' ? 'merged' : 'written';\n          const interlock: 'temporal-versioned' | undefined =\n            plan.writeAddress.isVersioned && myEdges.some((e) => e.edge.type === CONTRADICTS_LINK_TYPE)\n              ? 'temporal-versioned'\n              : undefined;\n          return succeed({\n            candidate: plan.candidate,\n            resolution: plan.verdict,\n            disposition,\n            id: persisted.envelope.id,\n            record: persisted,\n            edges: myEdges,\n            ...(interlock !== undefined ? { interlock } : {})\n          });\n        })\n    );\n  }\n\n  /** Build the fully-stamped record to persist (provenance + edges + placeholder txn fields). */\n  private _buildRecord(\n    item: IIngestItem,\n    plan: ICandidatePlan,\n    myEdges: ReadonlyArray<ICandidateEdge>\n  ): Result<IMemoryRecord<unknown>> {\n    const base: Omit<IMemoryEnvelope, 'id' | 'seq' | 'contentHash' | 'created' | 'updated'> =\n      plan.candidate.envelope;\n    // For merge-into the store's `applyUpdate` REPLACES array fields wholesale, so\n    // the persisted envelope must already carry the UNION of the target's existing\n    // tags/links/provenance and the candidate's — otherwise the merge silently\n    // wipes the target's prior links/tags.\n    const target: IMemoryRecord<unknown> | undefined = plan.mergeTarget;\n    const priorLinks: ReadonlyArray<IEdge> = target !== undefined ? target.envelope.links : [];\n    const priorTags: ReadonlyArray<Tag> = target !== undefined ? target.envelope.tags : [];\n    const priorProvenance: IProvenance = target !== undefined ? target.envelope.provenance : { source: '' };\n    return Convert.memoryId.convert(plan.writeAddress.idStem).onSuccess((id) =>\n      // Dedup the combined links by canonical edge key: the target's prior links, the\n      // candidate's own links, and the stage-5 edges (two candidates that resolve\n      // merge-into the SAME target share a `refId` — hence the same `myEdges` — and a\n      // relation extractor may repeat an edge) each appear exactly once.\n      this._dedupEdges([...priorLinks, ...base.links, ...myEdges.map((e) => e.edge)]).onSuccess((links) => {\n        const provenance: IProvenance = {\n          // Preserve the target's provenance extension keys, overlay the candidate's,\n          // then stamp the host-ingest source + derivedFrom (target present only for\n          // merge-into; otherwise the seed is inert).\n          ...(target !== undefined ? priorProvenance : {}),\n          ...base.provenance,\n          source: HOST_INGEST_PROVENANCE_SOURCE,\n          ...(item.sourceId !== undefined ? { derivedFrom: item.sourceId } : {})\n        };\n        const envelope: IMemoryEnvelope = {\n          ...base,\n          id,\n          entityId: plan.writeEntityId,\n          seq: 0,\n          contentHash: '',\n          created: 0,\n          updated: 0,\n          provenance,\n          tags: MemoryIngestOrchestrator._unionTags(priorTags, base.tags),\n          links\n        };\n        return succeed({ envelope, body: plan.candidate.body });\n      })\n    );\n  }\n\n  /** Union two tag lists, de-duplicated, preserving first-occurrence order. */\n  private static _unionTags(prior: ReadonlyArray<Tag>, incoming: ReadonlyArray<Tag>): ReadonlyArray<Tag> {\n    const seen: Set<string> = new Set<string>();\n    const out: Tag[] = [];\n    for (const tag of [...prior, ...incoming]) {\n      if (!seen.has(tag)) {\n        seen.add(tag);\n        out.push(tag);\n      }\n    }\n    return out;\n  }\n\n  /** De-duplicate a link list by canonical edge hash, preserving first-occurrence order. */\n  private _dedupEdges(edges: ReadonlyArray<IEdge>): Result<ReadonlyArray<IEdge>> {\n    const seen: Set<string> = new Set<string>();\n    const deduped: IEdge[] = [];\n    return mapResults(\n      edges.map((edge) =>\n        this._hasher.computeHash(edge).onSuccess((key) => {\n          if (!seen.has(key)) {\n            seen.add(key);\n            deduped.push(edge);\n          }\n          return succeed(key);\n        })\n      )\n    ).onSuccess(() => succeed(deduped));\n  }\n\n  /** Resolve a `(kind, entityId)` to its storage address via the registered codec. */\n  private _resolveAddress(entityId: EntityId, kind: Kind): Result<IIdentityCodecResult> {\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 codec.encode(entityId);\n  }\n\n  /** Run a host hook, normalizing a thrown/rejected hook into a Failure (never throws across the seam). */\n  private async _capture<T>(op: () => Promise<Result<T>>, label: string): Promise<Result<T>> {\n    try {\n      return await op();\n    } catch (err) {\n      const message: string = `${label} threw: ${String(err)}`;\n      this._logger.warn(message);\n      return fail(message);\n    }\n  }\n\n  /**\n   * Every existing outbound edge in the snapshot, as cycle-guard edges. The\n   * source is the record's own scope-qualified address (already resolved by\n   * {@link MemoryIngestOrchestrator._scopeRecords}); the target is the edge's\n   * own scoped target. Both ends are scoped so the guard never conflates a stem\n   * shared across scopes into one graph node.\n   */\n  private static _existingEdges(scoped: ReadonlyArray<IScopedRecord>): ReadonlyArray<ICycleGuardEdge> {\n    const edges: ICycleGuardEdge[] = [];\n    for (const s of scoped) {\n      for (const edge of s.record.envelope.links) {\n        edges.push({ source: s.address, target: edge.target, type: edge.type });\n      }\n    }\n    return edges;\n  }\n\n  /**\n   * Resolve every snapshot record's scope-qualified `(scope, id)` address via its\n   * registered codec. Fails loudly if a record's kind has no resolvable codec —\n   * the edge path cannot place an un-scopeable record in the graph, and a missing\n   * codec for a stored kind is a real misconfiguration, not something to paper over.\n   */\n  private _scopeRecords(\n    records: ReadonlyArray<IMemoryRecord<unknown>>\n  ): Result<ReadonlyArray<IScopedRecord>> {\n    return mapResults(\n      records.map((record) =>\n        this._resolveAddress(record.envelope.entityId, record.envelope.kind)\n          .withErrorFormat((msg) => `cannot resolve scope for stored record '${record.envelope.id}': ${msg}`)\n          .onSuccess((addr) => succeed({ address: { scope: addr.scope, id: record.envelope.id }, record }))\n      )\n    );\n  }\n\n  /** Human-readable `scope/id` rendering of a scoped target for edge-validation diagnostics. */\n  private static _formatTarget(target: IEdgeTarget): string {\n    return `${target.scope}/${target.id}`;\n  }\n\n  /** A provisional record for embedding a candidate (placeholder txn-time fields). */\n  private static _provisionalRecord(\n    candidate: ICandidateRecord,\n    idStem: string,\n    body: string\n  ): Result<IMemoryRecord<unknown>> {\n    return Convert.memoryId.convert(idStem).onSuccess((id) => {\n      const envelope: IMemoryEnvelope = {\n        ...candidate.envelope,\n        id,\n        seq: 0,\n        contentHash: '',\n        created: 0,\n        updated: 0\n      };\n      return succeed({ envelope, body });\n    });\n  }\n\n  /** Require a candidate body to be a string (the store persists only string bodies). */\n  private static _asStringBody(item: IIngestItem, candidate: ICandidateRecord): Result<string> {\n    if (typeof candidate.body !== 'string') {\n      return fail(\n        `ingest '${item.id}': candidate body for kind '${\n          candidate.envelope.kind\n        }' must be a string (got ${typeof candidate.body})`\n      );\n    }\n    return succeed(candidate.body);\n  }\n}\n"]}

package/lib/packlets/retrieve/linkTraversalRetriever.d.ts

@@ -1,7 +1,6 @@
 import { Result } from '@fgv/ts-utils';
 import { IMemoryRecord } from '../types';
-import { IMemoryIndex } from '../index';
-import { IMemoryQuery, IMemoryRetriever, IMemoryRetrieverCapabilities } from './retriever';
+import { IMemoryQuery, IMemoryRetriever, IMemoryRetrieverCapabilities, IRetrieverCreateParams } from './retriever';
 /**
  * The loud-degradation message returned when a link-traversal query supplies no
  * seed (`linkedFrom` / `linkedTo`).
@@ -32,22 +31,16 @@ export declare const LINK_TRAVERSAL_NO_SEED_MESSAGE: string;
  */
 export declare class LinkTraversalRetriever implements IMemoryRetriever {
     private readonly _index;
+    private readonly _resolver;
     private constructor();
     /** Family-convention factory. */
-    static create(index: IMemoryIndex): Result<LinkTraversalRetriever>;
+    static create(params: IRetrieverCreateParams): Result<LinkTraversalRetriever>;
     /** {@inheritDoc IMemoryRetriever.capabilities} */
     get capabilities(): IMemoryRetrieverCapabilities;
     /** {@inheritDoc IMemoryRetriever.retrieve} */
     retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>>;
     /** Run the bounded, cycle-safe BFS and post-filter the reached records. */
     private _traverse;
-    /**
-     * Group the index's entries by their scope-qualified {@link edgeTargetKey}
-     * `(scope, id)` composite. Each composite is the index's primary key, so it maps
-     * to exactly one entry — two records that reuse a filename stem across scopes
-     * (e.g. `turn-0` in two conversations) get distinct keys and never collide.
-     */
-    private _indexByKey;
     /** Outbound neighbors: the scope-qualified targets of every edge on the record at `node`. */
     private _outbound;
     /** Inbound neighbors: the scope-qualified sources whose edges point AT `node` (the backlinks). */

package/lib/packlets/retrieve/linkTraversalRetriever.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"linkTraversalRetriever.d.ts","sourceRoot":"","sources":["../../../src/packlets/retrieve/linkTraversalRetriever.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AACtD,OAAO,EAAe,aAAa,EAAiB,MAAM,UAAU,CAAC;AACrE,OAAO,EAAwB,YAAY,EAAE,MAAM,UAAU,CAAC;AAC9D,OAAO,EACL,YAAY,EACZ,gBAAgB,EAChB,4BAA4B,EAK7B,MAAM,aAAa,CAAC;AAYrB;;;;GAIG;AACH,eAAO,MAAM,8BAA8B,EAAE,MACiB,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,sBAAuB,YAAW,gBAAgB;IAC7D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IAEtC,OAAO;IAIP,iCAAiC;WACnB,MAAM,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAAC,sBAAsB,CAAC;IAIzE,kDAAkD;IAClD,IAAW,YAAY,IAAI,4BAA4B,CAEtD;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAM5F,2EAA2E;IAC3E,OAAO,CAAC,SAAS;IA4CjB;;;;;OAKG;IACH,OAAO,CAAC,WAAW;IAQnB,6FAA6F;IAC7F,OAAO,CAAC,SAAS;IAWjB,kGAAkG;IAClG,OAAO,CAAC,QAAQ;CAGjB"}
+{"version":3,"file":"linkTraversalRetriever.d.ts","sourceRoot":"","sources":["../../../src/packlets/retrieve/linkTraversalRetriever.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAiB,MAAM,eAAe,CAAC;AACtD,OAAO,EAAe,aAAa,EAAwC,MAAM,UAAU,CAAC;AAE5F,OAAO,EACL,YAAY,EACZ,gBAAgB,EAChB,4BAA4B,EAC5B,sBAAsB,EAKvB,MAAM,aAAa,CAAC;AAYrB;;;;GAIG;AACH,eAAO,MAAM,8BAA8B,EAAE,MACiB,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,sBAAuB,YAAW,gBAAgB;IAC7D,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAwB;IAElD,OAAO;IAKP,iCAAiC;WACnB,MAAM,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAAC,sBAAsB,CAAC;IAIpF,kDAAkD;IAClD,IAAW,YAAY,IAAI,4BAA4B,CAEtD;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAM5F,2EAA2E;IAC3E,OAAO,CAAC,SAAS;IA0CjB,6FAA6F;IAC7F,OAAO,CAAC,SAAS;IAWjB,kGAAkG;IAClG,OAAO,CAAC,QAAQ;CAGjB"}

package/lib/packlets/retrieve/linkTraversalRetriever.js

@@ -45,12 +45,13 @@ exports.LINK_TRAVERSAL_NO_SEED_MESSAGE = 'link traversal requires a seed id (lin
  * @public
  */
 class LinkTraversalRetriever {
-    constructor(index) {
-        this._index = index;
+    constructor(params) {
+        this._index = params.index;
+        this._resolver = params.resolver;
     }
     /** Family-convention factory. */
-    static create(index) {
-        return (0, ts_utils_1.succeed)(new LinkTraversalRetriever(index));
+    static create(params) {
+        return (0, ts_utils_1.succeed)(new LinkTraversalRetriever(params));
     }
     /** {@inheritDoc IMemoryRetriever.capabilities} */
     get capabilities() {
@@ -69,7 +70,6 @@ class LinkTraversalRetriever {
             return (0, ts_utils_1.fail)(exports.LINK_TRAVERSAL_NO_SEED_MESSAGE);
         }
         const hops = (_b = query.hops) !== null && _b !== void 0 ? _b : DEFAULT_HOPS;
-        const byKey = this._indexByKey();
         // The visited-set IS the cycle guard: nodes are canonicalized to their
         // `(scope, id)` string, so set membership is an exact identity check. The
         // seed is pre-marked so it is never re-added.
@@ -79,7 +79,7 @@ class LinkTraversalRetriever {
         for (let hop = 0; hop < hops && frontier.length > 0; hop++) {
             const next = [];
             for (const node of frontier) {
-                for (const neighbor of outbound ? this._outbound(node, byKey) : this._inbound(node)) {
+                for (const neighbor of outbound ? this._outbound(node) : this._inbound(node)) {
                     const neighborKey = (0, types_1.edgeTargetKey)(neighbor);
                     if (!visited.has(neighborKey)) {
                         visited.add(neighborKey);
@@ -92,36 +92,22 @@ class LinkTraversalRetriever {
         }
         const entries = [];
         for (const node of reached) {
-            const match = byKey.get((0, types_1.edgeTargetKey)(node));
+            const match = this._index.get(node);
             if (match !== undefined) {
                 entries.push(match);
             }
         }
         const ordered = entries
             .filter((entry) => (0, retriever_1.indexedRecordMatchesQuery)(entry, query))
-            .map((entry) => entry.record)
             .sort((0, retriever_1.orderingCompare)(query.orderBy));
-        return (0, ts_utils_1.succeed)((0, retriever_1.limitRecords)(ordered, query.limit, query.offset));
-    }
-    /**
-     * Group the index's entries by their scope-qualified {@link edgeTargetKey}
-     * `(scope, id)` composite. Each composite is the index's primary key, so it maps
-     * to exactly one entry — two records that reuse a filename stem across scopes
-     * (e.g. `turn-0` in two conversations) get distinct keys and never collide.
-     */
-    _indexByKey() {
-        const byKey = new Map();
-        for (const entry of this._index.entries()) {
-            byKey.set((0, types_1.edgeTargetKey)({ scope: entry.scope, id: entry.record.envelope.id }), entry);
-        }
-        return byKey;
+        return (0, retriever_1.materializePage)(ordered, query, this._resolver);
     }
     /** Outbound neighbors: the scope-qualified targets of every edge on the record at `node`. */
-    _outbound(node, byKey) {
+    _outbound(node) {
         const targets = [];
-        const match = byKey.get((0, types_1.edgeTargetKey)(node));
+        const match = this._index.get(node);
         if (match !== undefined) {
-            for (const edge of match.record.envelope.links) {
+            for (const edge of match.envelope.links) {
                 targets.push(edge.target);
             }
         }

package/lib/packlets/retrieve/linkTraversalRetriever.js.map

@@ -1 +1 @@
-{"version":3,"file":"linkTraversalRetriever.js","sourceRoot":"","sources":["../../../src/packlets/retrieve/linkTraversalRetriever.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAsD;AACtD,oCAAqE;AAErE,2CAQqB;AAErB,iFAAiF;AACjF,MAAM,2BAA2B,GAAiC;IAChE,sBAAsB,EAAE,KAAK;IAC7B,qBAAqB,EAAE,KAAK;IAC5B,qBAAqB,EAAE,IAAI;CAC5B,CAAC;AAEF,+DAA+D;AAC/D,MAAM,YAAY,GAAW,CAAC,CAAC;AAE/B;;;;GAIG;AACU,QAAA,8BAA8B,GACzC,4DAA4D,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,sBAAsB;IAGjC,YAAoB,KAAmB;QACrC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,KAAmB;QACtC,OAAO,IAAA,kBAAO,EAAC,IAAI,sBAAsB,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,kDAAkD;IAClD,IAAW,YAAY;QACrB,OAAO,2BAA2B,CAAC;IACrC,CAAC;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAmB;QACjC,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,sCAA0B,EAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAC5F,CAAC;IACJ,CAAC;IAED,2EAA2E;IACnE,SAAS,CAAC,KAAmB;;QACnC,MAAM,QAAQ,GAAY,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC;QACzD,MAAM,IAAI,GAA4B,MAAA,KAAK,CAAC,UAAU,mCAAI,KAAK,CAAC,QAAQ,CAAC;QACzE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,sCAA8B,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,IAAI,GAAW,MAAA,KAAK,CAAC,IAAI,mCAAI,YAAY,CAAC;QAChD,MAAM,KAAK,GAA8C,IAAI,CAAC,WAAW,EAAE,CAAC;QAE5E,uEAAuE;QACvE,0EAA0E;QAC1E,8CAA8C;QAC9C,MAAM,OAAO,GAAgB,IAAI,GAAG,CAAS,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,IAAI,QAAQ,GAAkB,CAAC,IAAI,CAAC,CAAC;QACrC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAC3D,MAAM,IAAI,GAAkB,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpF,MAAM,WAAW,GAAW,IAAA,qBAAa,EAAC,QAAQ,CAAC,CAAC;oBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBAC9B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;wBACzB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAqC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,CAAC,CAAC;YAC/E,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAA6B,OAAO;aAC9C,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,qCAAyB,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;aAC1D,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC;aAC5B,IAAI,CAAC,IAAA,2BAAe,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACxC,OAAO,IAAA,kBAAO,EAAC,IAAA,wBAAY,EAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACK,WAAW;QACjB,MAAM,KAAK,GAAsC,IAAI,GAAG,EAAgC,CAAC;QACzF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1C,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6FAA6F;IACrF,SAAS,CAAC,IAAiB,EAAE,KAAgD;QACnF,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,MAAM,KAAK,GAAqC,KAAK,CAAC,GAAG,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBAC/C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,kGAAkG;IAC1F,QAAQ,CAAC,IAAiB;QAChC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;CACF;AAnGD,wDAmGC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport { IEdgeTarget, IMemoryRecord, edgeTargetKey } from '../types';\nimport { IIndexedMemoryRecord, IMemoryIndex } from '../index';\nimport {\n  IMemoryQuery,\n  IMemoryRetriever,\n  IMemoryRetrieverCapabilities,\n  guardRetrieverCapabilities,\n  indexedRecordMatchesQuery,\n  limitRecords,\n  orderingCompare\n} from './retriever';\n\n/** The capabilities a link-traversal retriever exposes (link traversal only). */\nconst LINK_TRAVERSAL_CAPABILITIES: IMemoryRetrieverCapabilities = {\n  supportsSemanticRecall: false,\n  supportsTemporalQuery: false,\n  supportsLinkTraversal: true\n};\n\n/** Default BFS hop count when `query.hops` is not supplied. */\nconst DEFAULT_HOPS: number = 1;\n\n/**\n * The loud-degradation message returned when a link-traversal query supplies no\n * seed (`linkedFrom` / `linkedTo`).\n * @public\n */\nexport const LINK_TRAVERSAL_NO_SEED_MESSAGE: string =\n  'link traversal requires a seed id (linkedFrom or linkedTo)';\n\n/**\n * Breadth-first link-traversal retriever. From a scope-qualified\n * {@link IEdgeTarget} seed it walks the link graph up to `query.hops` levels and\n * returns the records reached (excluding the seed), recency-ordered and limited.\n *\n * @remarks\n * - **Direction.** `linkedFrom` walks OUTBOUND edges (each record's\n *   `envelope.links[].target`); `linkedTo` walks INBOUND edges (the index's\n *   `backlinks`). Exactly one is the seed; `linkedFrom` wins if both are set.\n * - **Scope-qualified nodes.** Every graph node is an {@link IEdgeTarget}\n *   `(scope, id)` pair, so following an edge to `turn-3` reaches ONLY the record\n *   in the edge's own scope — never a same-stem record in another scope.\n * - **Bound + cycle safety.** Traversal is bounded by `hops` (default `1` — a\n *   single hop) and a visited-set guard. Nodes are canonicalized to their\n *   `(scope, id)` string via {@link edgeTargetKey}, so a `Set<string>` visited-set\n *   is the exact, collision-free cycle key — no structural hashing (e.g.\n *   `Crc32Normalizer`) is needed. A self-loop or any multi-hop cycle terminates\n *   because a revisited node is never re-expanded.\n * - **Post-filter.** The scope / kind / tag / provenance-source / predicate axes of the query are\n *   applied to the reached records (the link axes are the traversal itself).\n * @public\n */\nexport class LinkTraversalRetriever implements IMemoryRetriever {\n  private readonly _index: IMemoryIndex;\n\n  private constructor(index: IMemoryIndex) {\n    this._index = index;\n  }\n\n  /** Family-convention factory. */\n  public static create(index: IMemoryIndex): Result<LinkTraversalRetriever> {\n    return succeed(new LinkTraversalRetriever(index));\n  }\n\n  /** {@inheritDoc IMemoryRetriever.capabilities} */\n  public get capabilities(): IMemoryRetrieverCapabilities {\n    return LINK_TRAVERSAL_CAPABILITIES;\n  }\n\n  /** {@inheritDoc IMemoryRetriever.retrieve} */\n  public retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    return Promise.resolve(\n      guardRetrieverCapabilities(query, this.capabilities).onSuccess(() => this._traverse(query))\n    );\n  }\n\n  /** Run the bounded, cycle-safe BFS and post-filter the reached records. */\n  private _traverse(query: IMemoryQuery): Result<ReadonlyArray<IMemoryRecord<unknown>>> {\n    const outbound: boolean = query.linkedFrom !== undefined;\n    const seed: IEdgeTarget | undefined = query.linkedFrom ?? query.linkedTo;\n    if (seed === undefined) {\n      return fail(LINK_TRAVERSAL_NO_SEED_MESSAGE);\n    }\n    const hops: number = query.hops ?? DEFAULT_HOPS;\n    const byKey: ReadonlyMap<string, IIndexedMemoryRecord> = this._indexByKey();\n\n    // The visited-set IS the cycle guard: nodes are canonicalized to their\n    // `(scope, id)` string, so set membership is an exact identity check. The\n    // seed is pre-marked so it is never re-added.\n    const visited: Set<string> = new Set<string>([edgeTargetKey(seed)]);\n    const reached: IEdgeTarget[] = [];\n    let frontier: IEdgeTarget[] = [seed];\n    for (let hop = 0; hop < hops && frontier.length > 0; hop++) {\n      const next: IEdgeTarget[] = [];\n      for (const node of frontier) {\n        for (const neighbor of outbound ? this._outbound(node, byKey) : this._inbound(node)) {\n          const neighborKey: string = edgeTargetKey(neighbor);\n          if (!visited.has(neighborKey)) {\n            visited.add(neighborKey);\n            reached.push(neighbor);\n            next.push(neighbor);\n          }\n        }\n      }\n      frontier = next;\n    }\n\n    const entries: IIndexedMemoryRecord[] = [];\n    for (const node of reached) {\n      const match: IIndexedMemoryRecord | undefined = byKey.get(edgeTargetKey(node));\n      if (match !== undefined) {\n        entries.push(match);\n      }\n    }\n    const ordered: IMemoryRecord<unknown>[] = entries\n      .filter((entry) => indexedRecordMatchesQuery(entry, query))\n      .map((entry) => entry.record)\n      .sort(orderingCompare(query.orderBy));\n    return succeed(limitRecords(ordered, query.limit, query.offset));\n  }\n\n  /**\n   * Group the index's entries by their scope-qualified {@link edgeTargetKey}\n   * `(scope, id)` composite. Each composite is the index's primary key, so it maps\n   * to exactly one entry — two records that reuse a filename stem across scopes\n   * (e.g. `turn-0` in two conversations) get distinct keys and never collide.\n   */\n  private _indexByKey(): ReadonlyMap<string, IIndexedMemoryRecord> {\n    const byKey: Map<string, IIndexedMemoryRecord> = new Map<string, IIndexedMemoryRecord>();\n    for (const entry of this._index.entries()) {\n      byKey.set(edgeTargetKey({ scope: entry.scope, id: entry.record.envelope.id }), entry);\n    }\n    return byKey;\n  }\n\n  /** Outbound neighbors: the scope-qualified targets of every edge on the record at `node`. */\n  private _outbound(node: IEdgeTarget, byKey: ReadonlyMap<string, IIndexedMemoryRecord>): IEdgeTarget[] {\n    const targets: IEdgeTarget[] = [];\n    const match: IIndexedMemoryRecord | undefined = byKey.get(edgeTargetKey(node));\n    if (match !== undefined) {\n      for (const edge of match.record.envelope.links) {\n        targets.push(edge.target);\n      }\n    }\n    return targets;\n  }\n\n  /** Inbound neighbors: the scope-qualified sources whose edges point AT `node` (the backlinks). */\n  private _inbound(node: IEdgeTarget): ReadonlyArray<IEdgeTarget> {\n    return this._index.backlinks(node);\n  }\n}\n"]}
+{"version":3,"file":"linkTraversalRetriever.js","sourceRoot":"","sources":["../../../src/packlets/retrieve/linkTraversalRetriever.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAsD;AACtD,oCAA4F;AAE5F,2CASqB;AAErB,iFAAiF;AACjF,MAAM,2BAA2B,GAAiC;IAChE,sBAAsB,EAAE,KAAK;IAC7B,qBAAqB,EAAE,KAAK;IAC5B,qBAAqB,EAAE,IAAI;CAC5B,CAAC;AAEF,+DAA+D;AAC/D,MAAM,YAAY,GAAW,CAAC,CAAC;AAE/B;;;;GAIG;AACU,QAAA,8BAA8B,GACzC,4DAA4D,CAAC;AAE/D;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,sBAAsB;IAIjC,YAAoB,MAA8B;QAChD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;IACnC,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,MAA8B;QACjD,OAAO,IAAA,kBAAO,EAAC,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,kDAAkD;IAClD,IAAW,YAAY;QACrB,OAAO,2BAA2B,CAAC;IACrC,CAAC;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAmB;QACjC,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,sCAA0B,EAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAC5F,CAAC;IACJ,CAAC;IAED,2EAA2E;IACnE,SAAS,CAAC,KAAmB;;QACnC,MAAM,QAAQ,GAAY,KAAK,CAAC,UAAU,KAAK,SAAS,CAAC;QACzD,MAAM,IAAI,GAA4B,MAAA,KAAK,CAAC,UAAU,mCAAI,KAAK,CAAC,QAAQ,CAAC;QACzE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAA,eAAI,EAAC,sCAA8B,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,IAAI,GAAW,MAAA,KAAK,CAAC,IAAI,mCAAI,YAAY,CAAC;QAEhD,uEAAuE;QACvE,0EAA0E;QAC1E,8CAA8C;QAC9C,MAAM,OAAO,GAAgB,IAAI,GAAG,CAAS,CAAC,IAAA,qBAAa,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,IAAI,QAAQ,GAAkB,CAAC,IAAI,CAAC,CAAC;QACrC,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;YAC3D,MAAM,IAAI,GAAkB,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,KAAK,MAAM,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC7E,MAAM,WAAW,GAAW,IAAA,qBAAa,EAAC,QAAQ,CAAC,CAAC;oBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;wBAC9B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;wBACzB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBACvB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACtB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,MAAM,OAAO,GAA0B,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAoC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAuC,OAAO;aACxD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAA,qCAAyB,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC;aAC1D,IAAI,CAAC,IAAA,2BAAe,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACxC,OAAO,IAAA,2BAAe,EAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACzD,CAAC;IAED,6FAA6F;IACrF,SAAS,CAAC,IAAiB;QACjC,MAAM,OAAO,GAAkB,EAAE,CAAC;QAClC,MAAM,KAAK,GAAoC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;gBACxC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,kGAAkG;IAC1F,QAAQ,CAAC,IAAiB;QAChC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;CACF;AArFD,wDAqFC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport { IEdgeTarget, IMemoryRecord, IMemoryRecordResolver, edgeTargetKey } from '../types';\nimport { IIndexedMemoryEntry, IMemoryIndex } from '../index';\nimport {\n  IMemoryQuery,\n  IMemoryRetriever,\n  IMemoryRetrieverCapabilities,\n  IRetrieverCreateParams,\n  guardRetrieverCapabilities,\n  indexedRecordMatchesQuery,\n  materializePage,\n  orderingCompare\n} from './retriever';\n\n/** The capabilities a link-traversal retriever exposes (link traversal only). */\nconst LINK_TRAVERSAL_CAPABILITIES: IMemoryRetrieverCapabilities = {\n  supportsSemanticRecall: false,\n  supportsTemporalQuery: false,\n  supportsLinkTraversal: true\n};\n\n/** Default BFS hop count when `query.hops` is not supplied. */\nconst DEFAULT_HOPS: number = 1;\n\n/**\n * The loud-degradation message returned when a link-traversal query supplies no\n * seed (`linkedFrom` / `linkedTo`).\n * @public\n */\nexport const LINK_TRAVERSAL_NO_SEED_MESSAGE: string =\n  'link traversal requires a seed id (linkedFrom or linkedTo)';\n\n/**\n * Breadth-first link-traversal retriever. From a scope-qualified\n * {@link IEdgeTarget} seed it walks the link graph up to `query.hops` levels and\n * returns the records reached (excluding the seed), recency-ordered and limited.\n *\n * @remarks\n * - **Direction.** `linkedFrom` walks OUTBOUND edges (each record's\n *   `envelope.links[].target`); `linkedTo` walks INBOUND edges (the index's\n *   `backlinks`). Exactly one is the seed; `linkedFrom` wins if both are set.\n * - **Scope-qualified nodes.** Every graph node is an {@link IEdgeTarget}\n *   `(scope, id)` pair, so following an edge to `turn-3` reaches ONLY the record\n *   in the edge's own scope — never a same-stem record in another scope.\n * - **Bound + cycle safety.** Traversal is bounded by `hops` (default `1` — a\n *   single hop) and a visited-set guard. Nodes are canonicalized to their\n *   `(scope, id)` string via {@link edgeTargetKey}, so a `Set<string>` visited-set\n *   is the exact, collision-free cycle key — no structural hashing (e.g.\n *   `Crc32Normalizer`) is needed. A self-loop or any multi-hop cycle terminates\n *   because a revisited node is never re-expanded.\n * - **Post-filter.** The scope / kind / tag / provenance-source / predicate axes of the query are\n *   applied to the reached records (the link axes are the traversal itself).\n * @public\n */\nexport class LinkTraversalRetriever implements IMemoryRetriever {\n  private readonly _index: IMemoryIndex;\n  private readonly _resolver: IMemoryRecordResolver;\n\n  private constructor(params: IRetrieverCreateParams) {\n    this._index = params.index;\n    this._resolver = params.resolver;\n  }\n\n  /** Family-convention factory. */\n  public static create(params: IRetrieverCreateParams): Result<LinkTraversalRetriever> {\n    return succeed(new LinkTraversalRetriever(params));\n  }\n\n  /** {@inheritDoc IMemoryRetriever.capabilities} */\n  public get capabilities(): IMemoryRetrieverCapabilities {\n    return LINK_TRAVERSAL_CAPABILITIES;\n  }\n\n  /** {@inheritDoc IMemoryRetriever.retrieve} */\n  public retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    return Promise.resolve(\n      guardRetrieverCapabilities(query, this.capabilities).onSuccess(() => this._traverse(query))\n    );\n  }\n\n  /** Run the bounded, cycle-safe BFS and post-filter the reached records. */\n  private _traverse(query: IMemoryQuery): Result<ReadonlyArray<IMemoryRecord<unknown>>> {\n    const outbound: boolean = query.linkedFrom !== undefined;\n    const seed: IEdgeTarget | undefined = query.linkedFrom ?? query.linkedTo;\n    if (seed === undefined) {\n      return fail(LINK_TRAVERSAL_NO_SEED_MESSAGE);\n    }\n    const hops: number = query.hops ?? DEFAULT_HOPS;\n\n    // The visited-set IS the cycle guard: nodes are canonicalized to their\n    // `(scope, id)` string, so set membership is an exact identity check. The\n    // seed is pre-marked so it is never re-added.\n    const visited: Set<string> = new Set<string>([edgeTargetKey(seed)]);\n    const reached: IEdgeTarget[] = [];\n    let frontier: IEdgeTarget[] = [seed];\n    for (let hop = 0; hop < hops && frontier.length > 0; hop++) {\n      const next: IEdgeTarget[] = [];\n      for (const node of frontier) {\n        for (const neighbor of outbound ? this._outbound(node) : this._inbound(node)) {\n          const neighborKey: string = edgeTargetKey(neighbor);\n          if (!visited.has(neighborKey)) {\n            visited.add(neighborKey);\n            reached.push(neighbor);\n            next.push(neighbor);\n          }\n        }\n      }\n      frontier = next;\n    }\n\n    const entries: IIndexedMemoryEntry[] = [];\n    for (const node of reached) {\n      const match: IIndexedMemoryEntry | undefined = this._index.get(node);\n      if (match !== undefined) {\n        entries.push(match);\n      }\n    }\n    const ordered: ReadonlyArray<IIndexedMemoryEntry> = entries\n      .filter((entry) => indexedRecordMatchesQuery(entry, query))\n      .sort(orderingCompare(query.orderBy));\n    return materializePage(ordered, query, this._resolver);\n  }\n\n  /** Outbound neighbors: the scope-qualified targets of every edge on the record at `node`. */\n  private _outbound(node: IEdgeTarget): IEdgeTarget[] {\n    const targets: IEdgeTarget[] = [];\n    const match: IIndexedMemoryEntry | undefined = this._index.get(node);\n    if (match !== undefined) {\n      for (const edge of match.envelope.links) {\n        targets.push(edge.target);\n      }\n    }\n    return targets;\n  }\n\n  /** Inbound neighbors: the scope-qualified sources whose edges point AT `node` (the backlinks). */\n  private _inbound(node: IEdgeTarget): ReadonlyArray<IEdgeTarget> {\n    return this._index.backlinks(node);\n  }\n}\n"]}

package/lib/packlets/retrieve/recencyRetriever.d.ts

@@ -1,7 +1,6 @@
 import { Result } from '@fgv/ts-utils';
 import { IMemoryRecord } from '../types';
-import { IMemoryIndex } from '../index';
-import { IMemoryQuery, IMemoryRetriever, IMemoryRetrieverCapabilities } from './retriever';
+import { IMemoryQuery, IMemoryRetriever, IMemoryRetrieverCapabilities, IRetrieverCreateParams } from './retriever';
 /**
  * Returns records matching the query's scope / kind / tag / provenance-source / predicate filters,
  * ordered most-recently-updated first. The universal v1 retriever — an empty
@@ -10,11 +9,12 @@ import { IMemoryQuery, IMemoryRetriever, IMemoryRetrieverCapabilities } from './
  */
 export declare class RecencyRetriever implements IMemoryRetriever {
     private readonly _index;
+    private readonly _resolver;
     private constructor();
     /** {@inheritDoc IMemoryRetriever.capabilities} */
     get capabilities(): IMemoryRetrieverCapabilities;
     /** Family-convention factory. */
-    static create(index: IMemoryIndex): Result<RecencyRetriever>;
+    static create(params: IRetrieverCreateParams): Result<RecencyRetriever>;
     /** {@inheritDoc IMemoryRetriever.retrieve} */
     retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>>;
 }

package/lib/packlets/retrieve/recencyRetriever.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"recencyRetriever.d.ts","sourceRoot":"","sources":["../../../src/packlets/retrieve/recencyRetriever.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAW,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,EACL,YAAY,EACZ,gBAAgB,EAChB,4BAA4B,EAM7B,MAAM,aAAa,CAAC;AAErB;;;;;GAKG;AACH,qBAAa,gBAAiB,YAAW,gBAAgB;IACvD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IAEtC,OAAO;IAIP,kDAAkD;IAClD,IAAW,YAAY,IAAI,4BAA4B,CAEtD;IAED,iCAAiC;WACnB,MAAM,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAInE,8CAA8C;IACvC,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CAU7F"}
+{"version":3,"file":"recencyRetriever.d.ts","sourceRoot":"","sources":["../../../src/packlets/retrieve/recencyRetriever.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,MAAM,EAAW,MAAM,eAAe,CAAC;AAChD,OAAO,EAAE,aAAa,EAAyB,MAAM,UAAU,CAAC;AAEhE,OAAO,EACL,YAAY,EACZ,gBAAgB,EAChB,4BAA4B,EAC5B,sBAAsB,EAIvB,MAAM,aAAa,CAAC;AAErB;;;;;GAKG;AACH,qBAAa,gBAAiB,YAAW,gBAAgB;IACvD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAe;IACtC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAwB;IAElD,OAAO;IAKP,kDAAkD;IAClD,IAAW,YAAY,IAAI,4BAA4B,CAEtD;IAED,iCAAiC;WACnB,MAAM,CAAC,MAAM,EAAE,sBAAsB,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAI9E,8CAA8C;IACvC,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;CAO7F"}

package/lib/packlets/retrieve/recencyRetriever.js

@@ -14,22 +14,22 @@ const retriever_1 = require("./retriever");
  * @public
  */
 class RecencyRetriever {
-    constructor(index) {
-        this._index = index;
+    constructor(params) {
+        this._index = params.index;
+        this._resolver = params.resolver;
     }
     /** {@inheritDoc IMemoryRetriever.capabilities} */
     get capabilities() {
         return retriever_1.NON_SEMANTIC_CAPABILITIES;
     }
     /** Family-convention factory. */
-    static create(index) {
-        return (0, ts_utils_1.succeed)(new RecencyRetriever(index));
+    static create(params) {
+        return (0, ts_utils_1.succeed)(new RecencyRetriever(params));
     }
     /** {@inheritDoc IMemoryRetriever.retrieve} */
     retrieve(query) {
         return Promise.resolve((0, retriever_1.guardRetrieverCapabilities)(query, this.capabilities).onSuccess(() => {
-            const ordered = (0, retriever_1.selectByQuery)(this._index.entries(), query).sort((0, retriever_1.orderingCompare)(query.orderBy));
-            return (0, ts_utils_1.succeed)((0, retriever_1.limitRecords)(ordered, query.limit, query.offset));
+            return (0, retriever_1.resolveQuery)(this._index.entries(), query, this._resolver);
         }));
     }
 }

package/lib/packlets/retrieve/recencyRetriever.js.map

@@ -1 +1 @@
-{"version":3,"file":"recencyRetriever.js","sourceRoot":"","sources":["../../../src/packlets/retrieve/recencyRetriever.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAgD;AAGhD,2CASqB;AAErB;;;;;GAKG;AACH,MAAa,gBAAgB;IAG3B,YAAoB,KAAmB;QACrC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAED,kDAAkD;IAClD,IAAW,YAAY;QACrB,OAAO,qCAAyB,CAAC;IACnC,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,KAAmB;QACtC,OAAO,IAAA,kBAAO,EAAC,IAAI,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAmB;QACjC,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,sCAA0B,EAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE;YAClE,MAAM,OAAO,GAA6B,IAAA,yBAAa,EAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,CAAC,IAAI,CACxF,IAAA,2BAAe,EAAC,KAAK,CAAC,OAAO,CAAC,CAC/B,CAAC;YACF,OAAO,IAAA,kBAAO,EAAC,IAAA,wBAAY,EAAC,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;CACF;AA5BD,4CA4BC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, succeed } from '@fgv/ts-utils';\nimport { IMemoryRecord } from '../types';\nimport { IMemoryIndex } from '../index';\nimport {\n  IMemoryQuery,\n  IMemoryRetriever,\n  IMemoryRetrieverCapabilities,\n  NON_SEMANTIC_CAPABILITIES,\n  guardRetrieverCapabilities,\n  limitRecords,\n  orderingCompare,\n  selectByQuery\n} from './retriever';\n\n/**\n * Returns records matching the query's scope / kind / tag / provenance-source / predicate filters,\n * ordered most-recently-updated first. The universal v1 retriever — an empty\n * query returns the whole vault in recency order.\n * @public\n */\nexport class RecencyRetriever implements IMemoryRetriever {\n  private readonly _index: IMemoryIndex;\n\n  private constructor(index: IMemoryIndex) {\n    this._index = index;\n  }\n\n  /** {@inheritDoc IMemoryRetriever.capabilities} */\n  public get capabilities(): IMemoryRetrieverCapabilities {\n    return NON_SEMANTIC_CAPABILITIES;\n  }\n\n  /** Family-convention factory. */\n  public static create(index: IMemoryIndex): Result<RecencyRetriever> {\n    return succeed(new RecencyRetriever(index));\n  }\n\n  /** {@inheritDoc IMemoryRetriever.retrieve} */\n  public retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    return Promise.resolve(\n      guardRetrieverCapabilities(query, this.capabilities).onSuccess(() => {\n        const ordered: IMemoryRecord<unknown>[] = selectByQuery(this._index.entries(), query).sort(\n          orderingCompare(query.orderBy)\n        );\n        return succeed(limitRecords(ordered, query.limit, query.offset));\n      })\n    );\n  }\n}\n"]}
+{"version":3,"file":"recencyRetriever.js","sourceRoot":"","sources":["../../../src/packlets/retrieve/recencyRetriever.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,4CAAgD;AAGhD,2CAQqB;AAErB;;;;;GAKG;AACH,MAAa,gBAAgB;IAI3B,YAAoB,MAA8B;QAChD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;IACnC,CAAC;IAED,kDAAkD;IAClD,IAAW,YAAY;QACrB,OAAO,qCAAyB,CAAC;IACnC,CAAC;IAED,iCAAiC;IAC1B,MAAM,CAAC,MAAM,CAAC,MAA8B;QACjD,OAAO,IAAA,kBAAO,EAAC,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,8CAA8C;IACvC,QAAQ,CAAC,KAAmB;QACjC,OAAO,OAAO,CAAC,OAAO,CACpB,IAAA,sCAA0B,EAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE;YAClE,OAAO,IAAA,wBAAY,EAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpE,CAAC,CAAC,CACH,CAAC;IACJ,CAAC;CACF;AA3BD,4CA2BC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport { Result, succeed } from '@fgv/ts-utils';\nimport { IMemoryRecord, IMemoryRecordResolver } from '../types';\nimport { IMemoryIndex } from '../index';\nimport {\n  IMemoryQuery,\n  IMemoryRetriever,\n  IMemoryRetrieverCapabilities,\n  IRetrieverCreateParams,\n  NON_SEMANTIC_CAPABILITIES,\n  guardRetrieverCapabilities,\n  resolveQuery\n} from './retriever';\n\n/**\n * Returns records matching the query's scope / kind / tag / provenance-source / predicate filters,\n * ordered most-recently-updated first. The universal v1 retriever — an empty\n * query returns the whole vault in recency order.\n * @public\n */\nexport class RecencyRetriever implements IMemoryRetriever {\n  private readonly _index: IMemoryIndex;\n  private readonly _resolver: IMemoryRecordResolver;\n\n  private constructor(params: IRetrieverCreateParams) {\n    this._index = params.index;\n    this._resolver = params.resolver;\n  }\n\n  /** {@inheritDoc IMemoryRetriever.capabilities} */\n  public get capabilities(): IMemoryRetrieverCapabilities {\n    return NON_SEMANTIC_CAPABILITIES;\n  }\n\n  /** Family-convention factory. */\n  public static create(params: IRetrieverCreateParams): Result<RecencyRetriever> {\n    return succeed(new RecencyRetriever(params));\n  }\n\n  /** {@inheritDoc IMemoryRetriever.retrieve} */\n  public retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    return Promise.resolve(\n      guardRetrieverCapabilities(query, this.capabilities).onSuccess(() => {\n        return resolveQuery(this._index.entries(), query, this._resolver);\n      })\n    );\n  }\n}\n"]}