npm - @fgv/ts-agent-memory - Versions diffs - 5.1.0-47 → 5.1.0-49 - Mend

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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (376) hide show

package/dist/test/unit/retrieve/retrievers.test.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"retrievers.test.js","sourceRoot":"","sources":["../../../../src/test/unit/retrieve/retrievers.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAAU,IAAI,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EACL,eAAe,EAWf,WAAW,EAEX,gBAAgB,EAChB,uBAAuB,EACvB,iBAAiB,EACjB,yBAAyB,EAEzB,YAAY,EACZ,iBAAiB,EACjB,0BAA0B,EAC1B,YAAY,EACZ,eAAe,EACf,WAAW,EACX,cAAc,EACf,MAAM,gBAAgB,CAAC;AAExB,qEAAqE;AACrE,SAAS,EAAE,CAAC,EAAU,EAAE,QAAgB,WAAW;IACjD,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAYD,SAAS,SAAS,CAAC,IAAiB;;IAClC,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,iBAAiB;aACxB,OAAO,+BACN,EAAE,EAAE,IAAI,CAAC,EAAE,EACX,QAAQ,EAAE,IAAI,CAAC,EAAE,EACjB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,WAAW,EAC9B,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,EAAE,EACrB,KAAK,EAAE,EAAE,EACT,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,MAAA,IAAI,CAAC,OAAO,mCAAI,CAAC,EAC1B,GAAG,EAAE,MAAA,IAAI,CAAC,GAAG,mCAAI,CAAC,EAClB,WAAW,EAAE,GAAG,IACb,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KACvD,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAC/B;aACD,OAAO,EAAE;QACZ,IAAI,EAAE,QAAQ,IAAI,CAAC,EAAE,EAAE;KACxB,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,CAAC,MAAA,IAAI,CAAC,KAAK,mCAAI,WAAW,CAAmB,EAAE,MAAM,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,UAAU,CAAC,KAAiC;IACnD,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,GAAG,CAAC,OAA8C;IACzD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAY,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,SAAS,GAAS,WAAmB,CAAC;AAE5C,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG;YACb,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC;QAEF,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC9D,MAAM,CAAC,0BAA0B,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;YAC1E,MAAM,CAAC,0BAA0B,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CACtE,2DAA2D,CAC5D,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACzE,MAAM,CAAC,0BAA0B,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAChE,0DAA0D,CAC3D,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,0BAA0B,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CACjF,qCAAqC,CACtC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAChF,MAAM,CAAC,0BAA0B,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAC1E,4DAA4D,CAC7D,CAAC;YACF,MAAM,CAAC,0BAA0B,CAAC,EAAE,UAAU,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAC5E,0BAA0B,CAC3B,CAAC;YACF,MAAM,CAAC,0BAA0B,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC;QACjG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACzE,MAAM,CACJ,0BAA0B,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,kCAAO,MAAM,KAAE,qBAAqB,EAAE,IAAI,IAAG,CAC9F,CAAC,SAAS,EAAE,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;aAChE,OAAO,EAAE;aACT,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAExB,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACzD,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACvD,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC7C,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iFAAiF,EAAE,GAAG,EAAE;YAC3F,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAClE,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC5D,wEAAwE;YACxE,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,GAAG,EAAE;YAClF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrE,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACvE,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxD,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uDAAuD,EAAE,GAAG,EAAE;YACjE,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;YAC7B,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;QAClE,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAC/B,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;SACzB,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;YAClG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,KAAK,IAAI,EAAE;QAC/C,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAC/B,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE;YAChC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE;YAChC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE;SACjC,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;YAClG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;QACvE,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YAC5E,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YAC5E,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YACxE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;SACxE,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,CACJ,MAAM,CAAC,CAAC,QAAQ,CAAC;YACf,KAAK,EAAE,WAA6B;YACpC,IAAI,EAAE,SAAS;YACf,GAAG,EAAE,GAAU;YACf,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,KAAM,MAAmB;YACzD,KAAK,EAAE,CAAC;SACT,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;YACvE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAC/B,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;SACzB,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACxD,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACvD,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACvE,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,0CAA0C,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACvE,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,0BAA0B,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IACxE,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IACxE,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IACxE,MAAM,QAAQ,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;IAErE,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACrC,MAAM,CACJ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;iBACT,KAAK,EAAE;iBACP,IAAI,CAAC,WAAW,CAAC;iBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC7B,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACnE,2FAA2F;YAC3F,MAAM,CACJ,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;iBACf,KAAK,EAAE;iBACP,IAAI,CAAC,WAAW,CAAC;iBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC7B,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3B,yDAAyD;YACzD,MAAM,CACJ,CAAC,EAAE,EAAE,QAAQ,CAAC;iBACX,KAAK,EAAE;iBACP,IAAI,CAAC,WAAW,CAAC;iBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC7B,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,GAAG,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;YACzE,oDAAoD;YACpD,MAAM,CACJ,CAAC,GAAG,EAAE,EAAE,CAAC;iBACN,KAAK,EAAE;iBACP,IAAI,CAAC,WAAW,CAAC;iBACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC7B,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACnE,MAAM,CAAC,eAAe,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC/C,MAAM,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,IAAI,CAAC;QACZ,CAAC,kBAAkB,EAAE,CAAC,KAAkB,EAAoB,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACxG,CAAC,cAAc,EAAE,CAAC,KAAkB,EAAoB,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QAChG;YACE,2BAA2B;YAC3B,CAAC,KAAkB,EAAoB,EAAE,CAAC,yBAAyB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE;SAC5F;KACF,CAAC,CAAC,mBAAmB,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE;QACrC,sEAAsE;QACtE,MAAM,IAAI,GACR,IAAI,KAAK,cAAc;YACrB,CAAC,CAAC,EAAE,GAAG,EAAE,GAAU,EAAE;YACrB,CAAC,CAAC,IAAI,KAAK,2BAA2B;gBACtC,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE;gBACxB,CAAC,CAAC,EAAE,CAAC;QAET,SAAS,YAAY;YACnB,OAAO,UAAU,CAAC;gBAChB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACvD,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACvD,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;gBACvD,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;aAC/C,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,uDAAuD,EAAE,KAAK,IAAI,EAAE;YACvE,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,iCAAM,IAAI,KAAE,OAAO,EAAE,MAAM,IAAG,CAAC,CAAC,mBAAmB,CACxE,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;YAC3D,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,mBAAM,IAAI,EAAG,CAAC,CAAC,mBAAmB,CACvD,CAAC,OAA8C,EAAE,EAAE;gBACjD,uEAAuE;gBACvE,qEAAqE;gBACrE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACrD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/B,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,iCAAM,IAAI,KAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,IAAG,CAAC,CAAC,mBAAmB,CAC7F,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;QACrF,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;YACvD,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;YACvD,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE;SACxD,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,EAAE,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,EAChF,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAU,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACrF,CAAC,OAA8C,EAAE,EAAE;YACjD,kFAAkF;YAClF,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kFAAkF,EAAE,KAAK,IAAI,EAAE;QAClG,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;YAChC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE;SACjC,CAAC,CAAC;QACH,MAAM,WAAW,GAAiB;YAChC,GAAG,EAAE,CAAC,CAAc,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAChE,MAAM,EAAE,CAAC,CAAc,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvD,KAAK,EAAE,GAAG,EAAE,CACV,OAAO,CAAC,OAAO,CACb,OAAO,CAAC;gBACN,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;gBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;aAChC,CAAC,CACH;SACJ,CAAC;QACF,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW;gBACX,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACrE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,yFAAyF;QACzF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC9E,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,SAAS,kBAAkB;QACzB,OAAO,gBAAgB,CAAC,MAAM,CAC5B,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,EAAE;YAC5C,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE;YACvC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE;YACxC,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,OAAO,EAAE,EAAE,EAAE;SAC7C,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,oEAAoE,EAAE,KAAK,IAAI,EAAE;YACpF,MAAM,CAAC,MAAM,kBAAkB,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACjE,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACrE,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iDAAiD,EAAE,KAAK,IAAI,EAAE;YACjE,MAAM,CACJ,MAAM,kBAAkB,EAAE,CAAC,QAAQ,CAAC;gBAClC,KAAK,EAAE,CAAC,WAAW,EAAE,OAAO,CAAmC;aAChE,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBACvE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;YAC/E,MAAM,CAAC,MAAM,kBAAkB,EAAE,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;YAChF,wEAAwE;YACxE,MAAM,CACJ,MAAM,kBAAkB,EAAE,CAAC,QAAQ,CAAC;gBAClC,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,CAAC,WAAW,EAAE,MAAM,CAAmC;aAC/D,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;gBACvE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YACH,0EAA0E;YAC1E,MAAM,CACJ,MAAM,kBAAkB,EAAE,CAAC,QAAQ,CAAC;gBAClC,IAAI,EAAE,SAAS;gBACf,KAAK,EAAE,CAAC,MAAM,EAAE,OAAO,CAAmC;aAC3D,CAAC,CACH,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,SAAS,OAAO;YACd,OAAO,gBAAgB,CAAC,MAAM,CAC5B,UAAU,CAAC;gBACT,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;gBACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;aACzB,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACd,CAAC;QAED,IAAI,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;YACtF,iCAAiC;YACjC,MAAM,CAAC,MAAM,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC3E,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;YAC1D,MAAM,CAAC,MAAM,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAChE,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;YAC7D,MAAM,CAAC,MAAM,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iEAAiE,EAAE,KAAK,IAAI,EAAE;YACjF,MAAM,CAAC,MAAM,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC5E,CAAC,OAA8C,EAAE,EAAE;gBACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC3C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,qFAAqF;AACrF,MAAM,kBAAkB;IAGtB,YAAmB,YAA0C;QAC3D,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;IACnC,CAAC;IACM,QAAQ,CAAC,KAAmB;QACjC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;QACvB,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;CACF;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAC3B,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YACrC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YAC1C,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;SACtC,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAU,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC/D,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;QACrE,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAChF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACvD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAChF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAU,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,2BAA2B,CAAC,CAAC;IACvG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IACzC,IAAI,CAAC,0DAA0D,EAAE,KAAK,IAAI,EAAE;QAC1E,MAAM,CAAC,GAAG,yBAAyB,CAAC,MAAM,CACxC,UAAU,CAAC;YACT,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE;YAC7B,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE;YAC7B,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE;SAC9B,CAAC,CACH,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CACJ,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAE,GAAG,CAAC,QAAQ,CAAC,EAAa,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CACtF,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;YACvE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QAC3E,MAAM,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAChF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,MAAM,eAAe;IAKnB,YAAmB,IAAoC,EAAE,YAAqB,KAAK;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACM,GAAG,CAAC,CAAc;QACvB,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IACM,MAAM,CAAC,CAAc;QAC1B,OAAO,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACM,KAAK,CAAC,QAAsB,EAAE,IAAY;QAC/C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9F,CAAC;CACF;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,MAAM,OAAO,GAAG,GAAkC,EAAE,CAClD,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1D,IAAI,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACzE,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACxE,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE;SACvE,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,KAAK,IAAI,EAAE;QAChF,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACnF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CACrD,2DAA2D,CAC5D,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;QAC/E,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACnF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,KAAK,IAAI,EAAE;QACrD,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACnF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,yCAAyC,CAAC,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mDAAmD,EAAE,KAAK,IAAI,EAAE;QACnE,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;SACzB,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;iBAChC,CAAC;gBACF,UAAU,EAAE,OAAO;aACpB;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC7D,CAAC,OAA8C,EAAE,EAAE;YACjD,uDAAuD;YACvD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+DAA+D,EAAE,KAAK,IAAI,EAAE;QAC/E,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE;SACzB,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE;oBACnC,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;iBAChC,CAAC;gBACF,UAAU,EAAE,OAAO;aACpB;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,GAAU,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC9E,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+FAA+F,EAAE,KAAK,IAAI,EAAE;QAC/G,4EAA4E;QAC5E,6EAA6E;QAC7E,+EAA+E;QAC/E,yDAAyD;QACzD,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE;YACnD,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,EAAE;SACpD,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK;YACL,OAAO,EAAE;gBACP,yEAAyE;gBACzE,0DAA0D;gBAC1D,WAAW,EAAE,IAAI,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;gBAClF,UAAU,EAAE,OAAO;aACpB;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC7D,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC9C,wEAAwE;YACxE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qEAAqE,EAAE,KAAK,IAAI,EAAE;QACrF,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,eAAe,CAAC;YACtC,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;YAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;YAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;SAChC,CAAC,CAAC;QACH,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACvG,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAChF,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;QACF,uFAAuF;QACvF,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,KAAK,IAAI,EAAE;QAC7D,MAAM,WAAW,GAAG,IAAI,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE;SAC9C,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACxD,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;QACtD,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC;gBACpC,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;aAC1D;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,yCAAyC,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE,EAAE,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE;SAC7E,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,2CAA2C,CAAC,CAAC;IACtG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+EAA+E,EAAE,KAAK,IAAI,EAAE;QAC/F,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC;gBACpC,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;aAChE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,6CAA6C,CAAC,CAAC;IACxG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;QACtE,8EAA8E;QAC9E,MAAM,cAAc,GAAiB;YACnC,GAAG,EAAE,CAAC,CAAc,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAChE,MAAM,EAAE,CAAC,CAAc,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACvD,KAAK,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;SACxD,CAAC;QACF,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAChC,OAAO,EAAE,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,EAAE,OAAO,EAAE;SAC9D,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,uCAAuC,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,QAAQ,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG;YAChB,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM;YAC1C,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM;YAC1C,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM;SAC3C,CAAC;QACF,+EAA+E;QAC/E,yEAAyE;QACzE,MAAM,CACJ,QAAQ,CAAC,KAAK,CAAC;YACb,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACP,CAAC,CACH,CAAC,mBAAmB,CAAC,CAAC,OAA8C,EAAE,EAAE;YACvE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,QAAQ,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC;QACrD,MAAM,CAAC,GAAG,SAAS,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QACpD,iFAAiF;QACjF,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC5D,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,SAAS,KAAK;QACZ,OAAO;YACL,KAAK,EAAE,UAAU,CAAC;gBAChB,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;gBACrC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;gBACrC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;aACtC,CAAC;SACH,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC3C,MAAM,QAAQ,GAAG,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;QAC5D,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,qCAAqC,CAAC,CAAC;IACjG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC7D,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACxC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,CAAC;gBACpC,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACnE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,QAAQ,CAAC,EACnB,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;YAClC,sBAAsB,EAAE,IAAI;YAC5B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,KAAK,IAAI,EAAE;QAC3D,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,GAAG,CAAC,EACd,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,0EAA0E;QAC1E,6EAA6E;QAC7E,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,GAAG,EAAE,GAAU,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACpE,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACvD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;QAC5E,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACxC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;gBACnE,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACnE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,QAAQ,CAAC,EACnB,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,+EAA+E;QAC/E,wEAAwE;QACxE,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAClE,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;;QAC3E,MAAM,SAAS,GAAG,IAAI,kBAAkB,CAAC;YACvC,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,IAAI;SAC5B,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,IAAI,kBAAkB,CAAC;YACxC,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,SAAS,EAAE,UAAU,CAAC,EACvB,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,mEAAmE;QACnE,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAC1E,4EAA4E;QAC5E,MAAM,CAAC,MAAA,SAAS,CAAC,SAAS,0CAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,MAAA,SAAS,CAAC,SAAS,0CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAA,UAAU,CAAC,SAAS,0CAAE,QAAQ,CAAC,CAAC,aAAa,EAAE,CAAC;QACvD,MAAM,CAAC,MAAA,UAAU,CAAC,SAAS,0CAAE,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;QACxF,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACvG,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,2BAA2B,CAAC,CAAC;IAC3F,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;QAC7E,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACxC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC1C,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACnE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACxG,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;QAC3F,2EAA2E;QAC3E,0EAA0E;QAC1E,wEAAwE;QACxE,6EAA6E;QAC7E,oDAAoD;QACpD,MAAM,KAAK,GAAG,UAAU,CAAC;YACvB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;YACxB,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE;SACzB,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAC;YACxC,KAAK;YACL,OAAO,EAAE;gBACP,WAAW,EAAE,IAAI,eAAe,CAAC;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;oBAC/B,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE;iBAChC,CAAC;gBACF,UAAU,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACnE;SACF,CAAC,CAAC,OAAO,EAAE,CAAC;QACb,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,QAAQ,CAAC,EACnB,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;QACZ,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC5E,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;QAC5D,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACvG,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC7D,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;QAClE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAAC;QAC1B,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QACzD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACvG,2EAA2E;QAC3E,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACxE,CAAC,OAA8C,EAAE,EAAE;YACjD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,CAAC,CACF,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mEAAmE,EAAE,KAAK,IAAI,EAAE;;QACnF,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAC;YACnC,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACrG,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACnE,MAAM,CAAC,MAAA,KAAK,CAAC,SAAS,0CAAE,MAAM,CAAC,CAAC,aAAa,EAAE,CAAC;QAChD,MAAM,CAAC,MAAA,KAAK,CAAC,SAAS,0CAAE,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;;QACtF,MAAM,KAAK,GAAG,IAAI,kBAAkB,CAAC;YACnC,sBAAsB,EAAE,KAAK;YAC7B,qBAAqB,EAAE,KAAK;YAC5B,qBAAqB,EAAE,KAAK;SAC7B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACrG,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC,WAAW,CAAmC,EAAE,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACtG,MAAM,CAAC,MAAA,KAAK,CAAC,SAAS,0CAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Result, fail, succeed } from '@fgv/ts-utils';\nimport {\n HybridRetriever,\n IEdgeTarget,\n IIndexedMemoryRecord,\n IMemoryQuery,\n IMemoryRecord,\n IMemoryRetriever,\n IMemoryRetrieverCapabilities,\n IVectorIndex,\n IVectorQueryHit,\n Kind,\n MemoryId,\n MemoryIndex,\n MemoryScopeKey,\n RecencyRetriever,\n ScoreUnionMergeStrategy,\n SemanticRetriever,\n StructuredFilterRetriever,\n Tag,\n TagRetriever,\n envelopeConverter,\n guardRetrieverCapabilities,\n limitRecords,\n orderingCompare,\n rankCompare,\n recencyCompare\n} from '../../../index';\n\n/** A scope-qualified link-traversal seed for the retriever tests. */\nfunction et(id: string, scope: string = 'knowledge'): IEdgeTarget {\n return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\ninterface IRecordSpec {\n readonly id: string;\n readonly scope?: string;\n readonly kind?: string;\n readonly tags?: ReadonlyArray<string>;\n readonly updated?: number;\n readonly seq?: number;\n readonly rank?: number;\n}\n\nfunction makeEntry(spec: IRecordSpec): IIndexedMemoryRecord {\n const record: IMemoryRecord<unknown> = {\n envelope: envelopeConverter\n .convert({\n id: spec.id,\n entityId: spec.id,\n kind: spec.kind ?? 'knowledge',\n tags: spec.tags ?? [],\n links: [],\n created: 0,\n updated: spec.updated ?? 0,\n seq: spec.seq ?? 0,\n contentHash: 'h',\n ...(spec.rank !== undefined ? { rank: spec.rank } : {}),\n provenance: { source: 'agent' }\n })\n .orThrow(),\n body: `body-${spec.id}`\n };\n return { scope: (spec.scope ?? 'knowledge') as MemoryScopeKey, record };\n}\n\nfunction buildIndex(specs: ReadonlyArray<IRecordSpec>): MemoryIndex {\n const index = MemoryIndex.create().orThrow();\n index.rebuild(specs.map(makeEntry)).orThrow();\n return index;\n}\n\nfunction ids(records: ReadonlyArray<IMemoryRecord<unknown>>): ReadonlyArray<string> {\n return records.map((r) => r.envelope.id as string);\n}\n\nconst knowledge: Kind = 'knowledge' as Kind;\n\ndescribe('retrieve helpers', () => {\n describe('guardRetrieverCapabilities', () => {\n const noCaps = {\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n };\n\n test('passes when no unsupported capability is requested', () => {\n expect(guardRetrieverCapabilities({}, noCaps)).toSucceed();\n });\n\n test('fails loudly when semantic recall is requested but unsupported', () => {\n expect(guardRetrieverCapabilities({ semantic: 'q' }, noCaps)).toFailWith(\n /semantic recall requires a vector index; none configured/i\n );\n });\n\n test('fails loudly when an as-of query is requested but unsupported', () => {\n expect(guardRetrieverCapabilities({ asOf: 5 }, noCaps)).toFailWith(\n /temporal query requires temporal index; none configured/i\n );\n });\n\n test('names the kind in the temporal failure when present', () => {\n expect(guardRetrieverCapabilities({ asOf: 5, kind: knowledge }, noCaps)).toFailWith(\n /none configured for kind knowledge/i\n );\n });\n\n test('fails loudly when a link-traversal axis is requested but unsupported', () => {\n expect(guardRetrieverCapabilities({ linkedTo: et('x') }, noCaps)).toFailWith(\n /link traversal requires a backlink index; none configured/i\n );\n expect(guardRetrieverCapabilities({ linkedFrom: et('x') }, noCaps)).toFailWith(\n /link traversal requires/i\n );\n expect(guardRetrieverCapabilities({ hops: 2 }, noCaps)).toFailWith(/link traversal requires/i);\n });\n\n test('passes a link-traversal axis when the capability is supported', () => {\n expect(\n guardRetrieverCapabilities({ linkedTo: et('x') }, { ...noCaps, supportsLinkTraversal: true })\n ).toSucceed();\n });\n });\n\n describe('limitRecords', () => {\n const records = buildIndex([{ id: 'a' }, { id: 'b' }, { id: 'c' }])\n .entries()\n .map((e) => e.record);\n\n test('returns all records when no limit is supplied', () => {\n expect(limitRecords(records)).toHaveLength(3);\n });\n\n test('truncates to the top-N for a positive limit', () => {\n expect(limitRecords(records, 2)).toHaveLength(2);\n });\n\n test('returns an empty array for a zero or negative limit', () => {\n expect(limitRecords(records, 0)).toEqual([]);\n expect(limitRecords(records, -1)).toEqual([]);\n });\n\n test('an absent offset is a no-op (byte-identical to today) — same reference returned', () => {\n expect(limitRecords(records, undefined, undefined)).toBe(records);\n expect(limitRecords(records, 2, undefined)).toHaveLength(2);\n // A non-positive offset is guarded like a non-positive limit — no skip.\n expect(limitRecords(records, undefined, 0)).toBe(records);\n expect(ids(limitRecords(records, undefined, -5))).toEqual(['a', 'b', 'c']);\n });\n\n test('offset skips after ordering; { offset, limit } is a stable page window', () => {\n expect(ids(limitRecords(records, undefined, 1))).toEqual(['b', 'c']);\n expect(ids(limitRecords(records, 1, 1))).toEqual(['b']);\n expect(ids(limitRecords(records, 2, 1))).toEqual(['b', 'c']);\n });\n\n test('an offset past the end yields an empty page (never a throw)', () => {\n expect(limitRecords(records, undefined, 3)).toEqual([]);\n expect(limitRecords(records, 5, 99)).toEqual([]);\n });\n\n test('a non-positive limit still wins over an offset window', () => {\n expect(limitRecords(records, 0, 1)).toEqual([]);\n });\n });\n});\n\ndescribe('RecencyRetriever', () => {\n test('reports all-false capabilities', () => {\n const r = RecencyRetriever.create(buildIndex([])).orThrow();\n expect(r.capabilities).toEqual({\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n });\n });\n\n test('returns every record most-recently-updated first', async () => {\n const r = RecencyRetriever.create(\n buildIndex([\n { id: 'a', updated: 10 },\n { id: 'b', updated: 30 },\n { id: 'c', updated: 20 }\n ])\n ).orThrow();\n expect(await r.retrieve({})).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c', 'a']);\n });\n });\n\n test('breaks ties on seq descending', async () => {\n const r = RecencyRetriever.create(\n buildIndex([\n { id: 'a', updated: 10, seq: 1 },\n { id: 'b', updated: 10, seq: 3 },\n { id: 'c', updated: 10, seq: 2 }\n ])\n ).orThrow();\n expect(await r.retrieve({})).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c', 'a']);\n });\n });\n\n test('honors scope, kind, tag, predicate, and limit filters', async () => {\n const index = buildIndex([\n { id: 'a', scope: 'knowledge', kind: 'knowledge', tags: ['x'], updated: 50 },\n { id: 'b', scope: 'knowledge', kind: 'knowledge', tags: ['y'], updated: 40 },\n { id: 'c', scope: 'other', kind: 'knowledge', tags: ['x'], updated: 60 },\n { id: 'd', scope: 'knowledge', kind: 'note', tags: ['x'], updated: 70 }\n ]);\n const r = RecencyRetriever.create(index).orThrow();\n expect(\n await r.retrieve({\n scope: 'knowledge' as MemoryScopeKey,\n kind: knowledge,\n tag: 'x' as Tag,\n filter: (rec) => rec.envelope.id !== ('skip' as MemoryId),\n limit: 5\n })\n ).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['a']);\n });\n });\n\n test('limit truncates to the top-N after ordering', async () => {\n const r = RecencyRetriever.create(\n buildIndex([\n { id: 'a', updated: 10 },\n { id: 'b', updated: 30 },\n { id: 'c', updated: 20 }\n ])\n ).orThrow();\n expect(await r.retrieve({ limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c']);\n }\n );\n });\n\n test('degrades loudly on a semantic request', async () => {\n const r = RecencyRetriever.create(buildIndex([{ id: 'a' }])).orThrow();\n expect(await r.retrieve({ semantic: 'hello' })).toFailWith(/semantic recall requires a vector index/i);\n });\n\n test('degrades loudly on a link-traversal request', async () => {\n const r = RecencyRetriever.create(buildIndex([{ id: 'a' }])).orThrow();\n expect(await r.retrieve({ linkedTo: et('a') })).toFailWith(/link traversal requires/i);\n });\n});\n\ndescribe('orderBy: rank axis', () => {\n const a1 = makeEntry({ id: 'a', rank: 1, updated: 100, seq: 1 }).record;\n const b3 = makeEntry({ id: 'b', rank: 3, updated: 100, seq: 2 }).record;\n const c2 = makeEntry({ id: 'c', rank: 2, updated: 100, seq: 3 }).record;\n const unranked = makeEntry({ id: 'z', updated: 999, seq: 4 }).record;\n\n describe('rankCompare', () => {\n test('orders by rank descending', () => {\n expect(\n [a1, b3, c2]\n .slice()\n .sort(rankCompare)\n .map((r) => r.envelope.id)\n ).toEqual(['b', 'c', 'a']);\n });\n\n test('places an absent-rank record last regardless of recency', () => {\n // `unranked` has the newest `updated`, but an absent rank sorts after every ranked record.\n expect(\n [unranked, a1, b3]\n .slice()\n .sort(rankCompare)\n .map((r) => r.envelope.id)\n ).toEqual(['b', 'a', 'z']);\n // Symmetric: absent on the left side of the compare too.\n expect(\n [a1, unranked]\n .slice()\n .sort(rankCompare)\n .map((r) => r.envelope.id)\n ).toEqual(['a', 'z']);\n });\n\n test('breaks an equal-rank tie by recency', () => {\n const b3b = makeEntry({ id: 'b2', rank: 3, updated: 50, seq: 9 }).record;\n // Equal rank 3 → newer `updated` (b3 at 100) first.\n expect(\n [b3b, b3]\n .slice()\n .sort(rankCompare)\n .map((r) => r.envelope.id)\n ).toEqual(['b', 'b2']);\n });\n });\n\n describe('orderingCompare', () => {\n test(\"returns recencyCompare for absent orderBy and 'recency'\", () => {\n expect(orderingCompare()).toBe(recencyCompare);\n expect(orderingCompare('recency')).toBe(recencyCompare);\n });\n\n test(\"returns rankCompare for 'rank'\", () => {\n expect(orderingCompare('rank')).toBe(rankCompare);\n });\n });\n\n describe.each([\n ['RecencyRetriever', (index: MemoryIndex): IMemoryRetriever => RecencyRetriever.create(index).orThrow()],\n ['TagRetriever', (index: MemoryIndex): IMemoryRetriever => TagRetriever.create(index).orThrow()],\n [\n 'StructuredFilterRetriever',\n (index: MemoryIndex): IMemoryRetriever => StructuredFilterRetriever.create(index).orThrow()\n ]\n ])('%s honors orderBy', (name, make) => {\n // Tag / structured-filter need their axis present to return anything.\n const axis: IMemoryQuery =\n name === 'TagRetriever'\n ? { tag: 'x' as Tag }\n : name === 'StructuredFilterRetriever'\n ? { filter: () => true }\n : {};\n\n function orderedIndex(): MemoryIndex {\n return buildIndex([\n { id: 'a', rank: 1, tags: ['x'], updated: 100, seq: 1 },\n { id: 'b', rank: 3, tags: ['x'], updated: 100, seq: 2 },\n { id: 'c', rank: 2, tags: ['x'], updated: 100, seq: 3 },\n { id: 'z', tags: ['x'], updated: 999, seq: 4 }\n ]);\n }\n\n test(\"orderBy 'rank' orders by rank descending, absent last\", async () => {\n const r = make(orderedIndex());\n expect(await r.retrieve({ ...axis, orderBy: 'rank' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c', 'a', 'z']);\n }\n );\n });\n\n test('orderBy absent is unchanged recency order', async () => {\n const r = make(orderedIndex());\n expect(await r.retrieve({ ...axis })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n // `z` has the newest `updated`; the rest tie on `updated` and break by\n // seq descending (c=3, b=2, a=1) — recency order regardless of rank.\n expect(ids(records)).toEqual(['z', 'c', 'b', 'a']);\n }\n );\n });\n\n test('rank ordering composes with { limit, offset } for a bounded top-M page', async () => {\n const r = make(orderedIndex());\n expect(await r.retrieve({ ...axis, orderBy: 'rank', limit: 1, offset: 1 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['c']);\n }\n );\n });\n });\n\n test(\"HybridRetriever re-orders the merged set by rank for orderBy 'rank'\", async () => {\n const index = buildIndex([\n { id: 'a', rank: 1, tags: ['x'], updated: 100, seq: 1 },\n { id: 'b', rank: 3, tags: ['x'], updated: 100, seq: 2 },\n { id: 'c', rank: 2, tags: ['x'], updated: 100, seq: 3 }\n ]);\n const hybrid = HybridRetriever.create(\n [RecencyRetriever.create(index).orThrow(), TagRetriever.create(index).orThrow()],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n expect(await hybrid.retrieve({ tag: 'x' as Tag, orderBy: 'rank' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n // All three score 2 (surfaced by both children); orderBy rank re-sorts the merge.\n expect(ids(records)).toEqual(['b', 'c', 'a']);\n }\n );\n });\n\n test(\"SemanticRetriever preserves vector-similarity order regardless of orderBy 'rank'\", async () => {\n const index = buildIndex([\n { id: 'a', rank: 9, updated: 1 },\n { id: 'b', rank: 1, updated: 1 }\n ]);\n const vectorIndex: IVectorIndex = {\n add: (t: IEdgeTarget) => Promise.resolve(succeed(`ref-${t.id}`)),\n remove: (t: IEdgeTarget) => Promise.resolve(succeed(t)),\n query: () =>\n Promise.resolve(\n succeed([\n { target: et('b'), score: 0.9 },\n { target: et('a'), score: 0.5 }\n ])\n )\n };\n const r = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex,\n embedQuery: () => Promise.resolve(succeed(Float32Array.from([0.1])))\n }\n }).orThrow();\n // Even though `a` has the higher rank, semantic keeps the similarity order (b before a).\n expect(await r.retrieve({ semantic: 'q', orderBy: 'rank' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'a']);\n }\n );\n });\n});\n\ndescribe('query axes: kinds (kind-set) and offset', () => {\n function multiKindRetriever(): RecencyRetriever {\n return RecencyRetriever.create(\n buildIndex([\n { id: 'k1', kind: 'knowledge', updated: 40 },\n { id: 'n1', kind: 'note', updated: 30 },\n { id: 'e1', kind: 'event', updated: 20 },\n { id: 'k2', kind: 'knowledge', updated: 10 }\n ])\n ).orThrow();\n }\n\n describe('kinds', () => {\n test(\"an absent kinds axis imposes no kind constraint (today's behavior)\", async () => {\n expect(await multiKindRetriever().retrieve({})).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect([...ids(records)].sort()).toEqual(['e1', 'k1', 'k2', 'n1']);\n }\n );\n });\n\n test('restricts to records in ANY of the listed kinds', async () => {\n expect(\n await multiKindRetriever().retrieve({\n kinds: ['knowledge', 'event'] as unknown as ReadonlyArray<Kind>\n })\n ).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect([...ids(records)].sort()).toEqual(['e1', 'k1', 'k2']);\n });\n });\n\n test('an explicit empty kinds array matches NOTHING (not match-all)', async () => {\n expect(await multiKindRetriever().retrieve({ kinds: [] })).toSucceedWith([]);\n });\n\n test('kind and kinds compose as AND (kind must be a member of kinds)', async () => {\n // kind=knowledge AND kinds includes knowledge → knowledge records only.\n expect(\n await multiKindRetriever().retrieve({\n kind: knowledge,\n kinds: ['knowledge', 'note'] as unknown as ReadonlyArray<Kind>\n })\n ).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect([...ids(records)].sort()).toEqual(['k1', 'k2']);\n });\n // kind=knowledge but kinds excludes knowledge → nothing can satisfy both.\n expect(\n await multiKindRetriever().retrieve({\n kind: knowledge,\n kinds: ['note', 'event'] as unknown as ReadonlyArray<Kind>\n })\n ).toSucceedWith([]);\n });\n });\n\n describe('offset', () => {\n function ordered(): RecencyRetriever {\n return RecencyRetriever.create(\n buildIndex([\n { id: 'a', updated: 10 },\n { id: 'b', updated: 40 },\n { id: 'c', updated: 30 },\n { id: 'd', updated: 20 }\n ])\n ).orThrow();\n }\n\n test('skips after ordering, forming a stable { offset, limit } page window', async () => {\n // Recency order is [b, c, d, a].\n expect(await ordered().retrieve({ offset: 1, limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['c', 'd']);\n }\n );\n });\n\n test('an absent offset is unchanged from today', async () => {\n expect(await ordered().retrieve({ limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c']);\n }\n );\n });\n\n test('an offset past the end yields an empty page', async () => {\n expect(await ordered().retrieve({ offset: 99 })).toSucceedWith([]);\n });\n\n test('a negative offset does not slip into slice (treated as no skip)', async () => {\n expect(await ordered().retrieve({ offset: -3, limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c']);\n }\n );\n });\n });\n});\n\n/** A retriever with configurable capabilities that records the query it received. */\nclass RecordingRetriever implements IMemoryRetriever {\n public lastQuery: IMemoryQuery | undefined;\n public readonly capabilities: IMemoryRetrieverCapabilities;\n public constructor(capabilities: IMemoryRetrieverCapabilities) {\n this.capabilities = capabilities;\n }\n public retrieve(query: IMemoryQuery): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n this.lastQuery = query;\n return Promise.resolve(succeed([]));\n }\n}\n\ndescribe('TagRetriever', () => {\n test('returns records carrying the tag, recency-ordered', async () => {\n const r = TagRetriever.create(\n buildIndex([\n { id: 'a', tags: ['x'], updated: 10 },\n { id: 'b', tags: ['x', 'y'], updated: 30 },\n { id: 'c', tags: ['y'], updated: 20 }\n ])\n ).orThrow();\n expect(await r.retrieve({ tag: 'x' as Tag })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'a']);\n }\n );\n });\n\n test('returns empty (not failure) when no tag is supplied', async () => {\n const r = TagRetriever.create(buildIndex([{ id: 'a', tags: ['x'] }])).orThrow();\n expect(await r.retrieve({})).toSucceedWith([]);\n });\n\n test('degrades loudly on a semantic request', async () => {\n const r = TagRetriever.create(buildIndex([{ id: 'a', tags: ['x'] }])).orThrow();\n expect(await r.retrieve({ tag: 'x' as Tag, semantic: 'q' })).toFailWith(/semantic recall requires/i);\n });\n});\n\ndescribe('StructuredFilterRetriever', () => {\n test('applies the predicate over the scope/kind/tag pre-filter', async () => {\n const r = StructuredFilterRetriever.create(\n buildIndex([\n { id: 'keep-1', updated: 10 },\n { id: 'drop-1', updated: 30 },\n { id: 'keep-2', updated: 20 }\n ])\n ).orThrow();\n expect(\n await r.retrieve({ filter: (rec) => (rec.envelope.id as string).startsWith('keep') })\n ).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['keep-2', 'keep-1']);\n });\n });\n\n test('returns empty (not failure) when no predicate is supplied', async () => {\n const r = StructuredFilterRetriever.create(buildIndex([{ id: 'a' }])).orThrow();\n expect(await r.retrieve({})).toSucceedWith([]);\n });\n});\n\n/** A scripted in-memory vector index returning canned hits. */\nclass FakeVectorIndex implements IVectorIndex {\n private readonly _hits: ReadonlyArray<IVectorQueryHit>;\n private readonly _failQuery: boolean;\n /** The `topK` the most recent `query` call received — asserts forwarding. */\n public lastTopK: number | undefined;\n public constructor(hits: ReadonlyArray<IVectorQueryHit>, failQuery: boolean = false) {\n this._hits = hits;\n this._failQuery = failQuery;\n }\n public add(t: IEdgeTarget): Promise<Result<string>> {\n return Promise.resolve(succeed(`ref-${t.id}`));\n }\n public remove(t: IEdgeTarget): Promise<Result<IEdgeTarget>> {\n return Promise.resolve(succeed(t));\n }\n public query(__vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n this.lastTopK = topK;\n return Promise.resolve(this._failQuery ? fail('vector backend down') : succeed(this._hits));\n }\n}\n\ndescribe('SemanticRetriever', () => {\n const okEmbed = (): Promise<Result<Float32Array>> =>\n Promise.resolve(succeed(Float32Array.from([0.1, 0.2])));\n\n test('reports supportsSemanticRecall=false when no backend is wired', () => {\n const r = SemanticRetriever.create({ index: buildIndex([]) }).orThrow();\n expect(r.capabilities.supportsSemanticRecall).toBe(false);\n });\n\n test('reports supportsSemanticRecall=true when a backend is wired', () => {\n const r = SemanticRetriever.create({\n index: buildIndex([]),\n backend: { vectorIndex: new FakeVectorIndex([]), embedQuery: okEmbed }\n }).orThrow();\n expect(r.capabilities.supportsSemanticRecall).toBe(true);\n });\n\n test('degrades loudly on a semantic request when no backend is wired', async () => {\n const r = SemanticRetriever.create({ index: buildIndex([{ id: 'a' }]) }).orThrow();\n expect(await r.retrieve({ semantic: 'hi' })).toFailWith(\n /semantic recall requires a vector index; none configured/i\n );\n });\n\n test('returns empty (not failure) when no semantic term is supplied', async () => {\n const r = SemanticRetriever.create({ index: buildIndex([{ id: 'a' }]) }).orThrow();\n expect(await r.retrieve({})).toSucceedWith([]);\n });\n\n test('degrades loudly on an as-of request', async () => {\n const r = SemanticRetriever.create({ index: buildIndex([{ id: 'a' }]) }).orThrow();\n expect(await r.retrieve({ asOf: 5 })).toFailWith(/temporal query requires temporal index/i);\n });\n\n test('resolves vector hits back to records in hit order', async () => {\n const index = buildIndex([\n { id: 'a', updated: 1 },\n { id: 'b', updated: 99 },\n { id: 'c', updated: 50 }\n ]);\n const r = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([\n { target: et('b'), score: 0.9 },\n { target: et('a'), score: 0.5 }\n ]),\n embedQuery: okEmbed\n }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n // Hit order preserved (b before a), NOT recency order.\n expect(ids(records)).toEqual(['b', 'a']);\n }\n );\n });\n\n test('drops hits not present in the index and applies query filters', async () => {\n const index = buildIndex([\n { id: 'a', tags: ['x'] },\n { id: 'b', tags: ['y'] }\n ]);\n const r = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([\n { target: et('gone'), score: 0.99 },\n { target: et('b'), score: 0.8 },\n { target: et('a'), score: 0.7 }\n ]),\n embedQuery: okEmbed\n }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q', tag: 'x' as Tag })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['a']);\n }\n );\n });\n\n test('resolves a hit to the correctly-scoped record when two records share an id stem across scopes', async () => {\n // Two records with the identical stem `turn-3` under different scopes — the\n // exact same-stem-across-scopes collision the scope-qualified hit fixes. The\n // retriever must re-resolve each hit through its full `(scope, id)` key, not a\n // bare id (which would ambiguously match either record).\n const index = buildIndex([\n { id: 'turn-3', scope: 'conv-a', tags: ['from-a'] },\n { id: 'turn-3', scope: 'conv-b', tags: ['from-b'] }\n ]);\n const r = SemanticRetriever.create({\n index,\n backend: {\n // The vector backend scored the conv-b record; the retriever must return\n // exactly that record, never the same-stem conv-a record.\n vectorIndex: new FakeVectorIndex([{ target: et('turn-3', 'conv-b'), score: 0.9 }]),\n embedQuery: okEmbed\n }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(records).toHaveLength(1);\n expect(records[0].envelope.id).toBe('turn-3');\n // The tag proves it is the conv-b record, not the same-stem conv-a one.\n expect(records[0].envelope.tags).toEqual(['from-b']);\n }\n );\n });\n\n test('forwards topK to the vector index and applies the post-filter limit', async () => {\n const index = buildIndex([{ id: 'a' }, { id: 'b' }, { id: 'c' }]);\n const vectorIndex = new FakeVectorIndex([\n { target: et('a'), score: 0.9 },\n { target: et('b'), score: 0.8 },\n { target: et('c'), score: 0.7 }\n ]);\n const r = SemanticRetriever.create({ index, backend: { vectorIndex, embedQuery: okEmbed } }).orThrow();\n expect(await r.retrieve({ semantic: 'q', topK: 2, limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['a', 'b']);\n }\n );\n // The retriever must forward the caller's topK to the vector backend, not its default.\n expect(vectorIndex.lastTopK).toBe(2);\n });\n\n test('defaults topK to 10 when the query omits it', async () => {\n const vectorIndex = new FakeVectorIndex([{ target: et('a'), score: 0.9 }]);\n const r = SemanticRetriever.create({\n index: buildIndex([{ id: 'a' }]),\n backend: { vectorIndex, embedQuery: okEmbed }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toSucceed();\n expect(vectorIndex.lastTopK).toBe(10);\n });\n\n test('fails loudly when the embedder fails', async () => {\n const r = SemanticRetriever.create({\n index: buildIndex([{ id: 'a' }]),\n backend: {\n vectorIndex: new FakeVectorIndex([]),\n embedQuery: () => Promise.resolve(fail('no embed model'))\n }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toFailWith(/query embedding failed: no embed model/i);\n });\n\n test('fails loudly when the vector backend fails', async () => {\n const r = SemanticRetriever.create({\n index: buildIndex([{ id: 'a' }]),\n backend: { vectorIndex: new FakeVectorIndex([], true), embedQuery: okEmbed }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toFailWith(/vector query failed: vector backend down/i);\n });\n\n test('normalizes a rejecting embedder into a Failure (never escapes as a rejection)', async () => {\n const r = SemanticRetriever.create({\n index: buildIndex([{ id: 'a' }]),\n backend: {\n vectorIndex: new FakeVectorIndex([]),\n embedQuery: () => Promise.reject(new Error('embedder blew up'))\n }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toFailWith(/query embedding failed: .*embedder blew up/i);\n });\n\n test('normalizes a rejecting vector backend into a Failure', async () => {\n // A vector index whose `query` rejects (throws) rather than returning a fail.\n const rejectingIndex: IVectorIndex = {\n add: (t: IEdgeTarget) => Promise.resolve(succeed(`ref-${t.id}`)),\n remove: (t: IEdgeTarget) => Promise.resolve(succeed(t)),\n query: () => Promise.reject(new Error('socket hangup'))\n };\n const r = SemanticRetriever.create({\n index: buildIndex([{ id: 'a' }]),\n backend: { vectorIndex: rejectingIndex, embedQuery: okEmbed }\n }).orThrow();\n expect(await r.retrieve({ semantic: 'q' })).toFailWith(/vector query failed: .*socket hangup/i);\n });\n});\n\ndescribe('ScoreUnionMergeStrategy', () => {\n test('unions, dedupes by id, and scores by retriever count', () => {\n const strategy = ScoreUnionMergeStrategy.create().orThrow();\n const [a, b, c] = [\n makeEntry({ id: 'a', updated: 10 }).record,\n makeEntry({ id: 'b', updated: 30 }).record,\n makeEntry({ id: 'c', updated: 20 }).record\n ];\n // 'b' appears in two sets (score 2); 'a' and 'c' in one each (score 1) — among\n // score-1 records, recency breaks the tie (c.updated 20 > a.updated 10).\n expect(\n strategy.merge([\n [a, b],\n [b, c]\n ])\n ).toSucceedAndSatisfy((records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'c', 'a']);\n });\n });\n\n test('counts an id at most once per result set', () => {\n const strategy = ScoreUnionMergeStrategy.create().orThrow();\n const a = makeEntry({ id: 'a', updated: 10 }).record;\n const b = makeEntry({ id: 'b', updated: 5 }).record;\n // 'a' twice in one set still scores 1; 'b' in two sets scores 2 → b ranks first.\n expect(strategy.merge([[a, a], [b], [b]])).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['b', 'a']);\n }\n );\n });\n});\n\ndescribe('HybridRetriever', () => {\n function build(): { index: MemoryIndex } {\n return {\n index: buildIndex([\n { id: 'a', tags: ['x'], updated: 10 },\n { id: 'b', tags: ['y'], updated: 30 },\n { id: 'c', tags: ['x'], updated: 20 }\n ])\n };\n }\n\n test('requires at least one retriever', () => {\n const strategy = ScoreUnionMergeStrategy.create().orThrow();\n expect(HybridRetriever.create([], strategy)).toFailWith(/at least one retriever is required/i);\n });\n\n test('capabilities are the union of composed retrievers', () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const semantic = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([]),\n embedQuery: () => Promise.resolve(succeed(Float32Array.from([1])))\n }\n }).orThrow();\n const hybrid = HybridRetriever.create(\n [recency, semantic],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n expect(hybrid.capabilities).toEqual({\n supportsSemanticRecall: true,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n });\n });\n\n test('merges the results of composed retrievers', async () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const tag = TagRetriever.create(index).orThrow();\n const hybrid = HybridRetriever.create(\n [recency, tag],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n // recency returns a,b,c (with tag x filter: a,c); tag x returns a,c. Both\n // surface a & c (score 2), b absent. Use tag:x so recency also filters to x.\n expect(await hybrid.retrieve({ tag: 'x' as Tag })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect([...ids(records)].sort()).toEqual(['a', 'c']);\n }\n );\n });\n\n test('routes a semantic query only to the semantic-capable child', async () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const semantic = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([{ target: et('b'), score: 0.9 }]),\n embedQuery: () => Promise.resolve(succeed(Float32Array.from([1])))\n }\n }).orThrow();\n const hybrid = HybridRetriever.create(\n [recency, semantic],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n // recency (no semantic support) gets the semantic field stripped → returns all\n // three; semantic returns just b. b therefore scores 2 and ranks first.\n expect(await hybrid.retrieve({ semantic: 'q' })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(records[0].envelope.id).toBe('b');\n expect([...ids(records)].sort()).toEqual(['a', 'b', 'c']);\n }\n );\n });\n\n test('routes link-traversal axes only to the link-capable child', async () => {\n const linkChild = new RecordingRetriever({\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: true\n });\n const plainChild = new RecordingRetriever({\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n });\n const hybrid = HybridRetriever.create(\n [linkChild, plainChild],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n expect(hybrid.capabilities.supportsLinkTraversal).toBe(true);\n // Union supports link traversal, so the hybrid does NOT loud-fail.\n expect(await hybrid.retrieve({ linkedTo: et('a'), hops: 2 })).toSucceed();\n // The link-capable child keeps the axes; the plain child has them stripped.\n expect(linkChild.lastQuery?.linkedTo).toEqual(et('a'));\n expect(linkChild.lastQuery?.hops).toBe(2);\n expect(plainChild.lastQuery?.linkedTo).toBeUndefined();\n expect(plainChild.lastQuery?.hops).toBeUndefined();\n });\n\n test('degrades loudly when its union does not support a requested capability', async () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const hybrid = HybridRetriever.create([recency], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n expect(await hybrid.retrieve({ semantic: 'q' })).toFailWith(/semantic recall requires/i);\n });\n\n test('propagates a child failure rather than dropping it silently', async () => {\n const { index } = build();\n const semantic = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([], true),\n embedQuery: () => Promise.resolve(succeed(Float32Array.from([1])))\n }\n }).orThrow();\n const hybrid = HybridRetriever.create([semantic], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n expect(await hybrid.retrieve({ semantic: 'q' })).toFailWith(/vector query failed/i);\n });\n\n test('does not pre-truncate child result sets: limit is applied only post-merge', async () => {\n // Recency full order is [d,c,b,a]; semantic surfaces [d,a]. With a correct\n // (post-merge-only) limit, the merge sees BOTH full sets, so d and a each\n // score 2 and the limit-2 result is [d,a]. If the limit leaked into the\n // children, recency would pre-truncate to [d,c] and the result would wrongly\n // be [d,c] — a never reaching the merge to score 2.\n const index = buildIndex([\n { id: 'a', updated: 10 },\n { id: 'b', updated: 20 },\n { id: 'c', updated: 30 },\n { id: 'd', updated: 40 }\n ]);\n const recency = RecencyRetriever.create(index).orThrow();\n const semantic = SemanticRetriever.create({\n index,\n backend: {\n vectorIndex: new FakeVectorIndex([\n { target: et('d'), score: 0.9 },\n { target: et('a'), score: 0.8 }\n ]),\n embedQuery: () => Promise.resolve(succeed(Float32Array.from([1])))\n }\n }).orThrow();\n const hybrid = HybridRetriever.create(\n [recency, semantic],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n expect(await hybrid.retrieve({ semantic: 'q', limit: 2 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['d', 'a']);\n }\n );\n });\n\n test('applies the hybrid-level limit after merge', async () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const hybrid = HybridRetriever.create([recency], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n expect(await hybrid.retrieve({ limit: 1 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(records).toHaveLength(1);\n expect(records[0].envelope.id).toBe('b');\n }\n );\n });\n\n test('applies the { offset, limit } window after merge', async () => {\n const { index } = build();\n const recency = RecencyRetriever.create(index).orThrow();\n const hybrid = HybridRetriever.create([recency], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n // Merged recency order is [b(30), c(20), a(10)]; offset 1 + limit 1 → [c].\n expect(await hybrid.retrieve({ offset: 1, limit: 1 })).toSucceedAndSatisfy(\n (records: ReadonlyArray<IMemoryRecord<unknown>>) => {\n expect(ids(records)).toEqual(['c']);\n }\n );\n });\n\n test('strips offset from child queries (offset is a post-merge concern)', async () => {\n const child = new RecordingRetriever({\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n });\n const hybrid = HybridRetriever.create([child], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n expect(await hybrid.retrieve({ offset: 2, limit: 3 })).toSucceed();\n expect(child.lastQuery?.offset).toBeUndefined();\n expect(child.lastQuery?.limit).toBeUndefined();\n });\n\n test('passes the kinds axis through to children (a shared pre-filter axis)', async () => {\n const child = new RecordingRetriever({\n supportsSemanticRecall: false,\n supportsTemporalQuery: false,\n supportsLinkTraversal: false\n });\n const hybrid = HybridRetriever.create([child], ScoreUnionMergeStrategy.create().orThrow()).orThrow();\n expect(await hybrid.retrieve({ kinds: ['knowledge'] as unknown as ReadonlyArray<Kind> })).toSucceed();\n expect(child.lastQuery?.kinds).toEqual(['knowledge']);\n });\n});\n"]}

package/dist/test/unit/retrieve/temporalRetrievers.test.js DELETED Viewed

@@ -1,182 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-import '@fgv/ts-utils-jest';
-import { AsOfRetriever, CurrentValidRetriever, HistoryRetriever, HybridRetriever, MemoryIndex, RecencyRetriever, ScoreUnionMergeStrategy, envelopeConverter } from '../../../index';
-const factKind = 'fact';
-function versionEntry(spec) {
-    var _a;
-    const temporal = { valid_at: spec.validAt };
-    if (spec.invalidAt !== undefined) {
-        temporal.invalid_at = spec.invalidAt;
-    }
-    const record = {
-        envelope: envelopeConverter
-            .convert({
-            id: `${spec.entityId}-v${spec.seq}`,
-            entityId: spec.entityId,
-            kind: (_a = spec.kind) !== null && _a !== void 0 ? _a : 'fact',
-            tags: [],
-            links: [],
-            created: spec.validAt,
-            updated: spec.validAt,
-            seq: spec.seq,
-            contentHash: `h-${spec.entityId}-${spec.seq}`,
-            provenance: { source: 'agent' },
-            temporal
-        })
-            .orThrow(),
-        body: `${spec.entityId} v${spec.seq}`
-    };
-    return { scope: `facts/entities/${spec.entityId}`, record };
-}
-/** A flat (non-temporal) entry, to prove the temporal retrievers ignore it. */
-function flatEntry(id) {
-    const record = {
-        envelope: envelopeConverter
-            .convert({
-            id,
-            entityId: id,
-            kind: 'knowledge',
-            tags: [],
-            links: [],
-            created: 0,
-            updated: 0,
-            seq: 0,
-            contentHash: `h-${id}`,
-            provenance: { source: 'agent' }
-        })
-            .orThrow(),
-        body: id
-    };
-    return { scope: 'knowledge', record };
-}
-function ids(records) {
-    return records.map((r) => r.envelope.id);
-}
-// fact-1: v1 [100,200), v2 [200,∞) current. fact-2: v1 [150,∞) current. Plus a flat doc.
-function buildIndex() {
-    const index = MemoryIndex.create().orThrow();
-    index
-        .rebuild([
-        versionEntry({ entityId: 'fact-1', seq: 1, validAt: 100, invalidAt: 200 }),
-        versionEntry({ entityId: 'fact-1', seq: 2, validAt: 200 }),
-        versionEntry({ entityId: 'fact-2', seq: 3, validAt: 150 }),
-        flatEntry('doc-a')
-    ])
-        .orThrow();
-    return index;
-}
-describe('temporal retrievers', () => {
-    const index = buildIndex();
-    describe('CurrentValidRetriever', () => {
-        const retriever = CurrentValidRetriever.create(index).orThrow();
-        test('declares supportsTemporalQuery', () => {
-            expect(retriever.capabilities.supportsTemporalQuery).toBe(true);
-        });
-        test('returns the current version per temporal entity, ignoring flat records', async () => {
-            expect(await retriever.retrieve({})).toSucceedAndSatisfy((records) => {
-                expect(ids(records).sort()).toEqual(['fact-1-v2', 'fact-2-v3']);
-            });
-        });
-        test('honors scope / kind pre-filter and limit', async () => {
-            expect(await retriever.retrieve({ kind: factKind, limit: 1 })).toSucceedAndSatisfy((records) => {
-                expect(records).toHaveLength(1);
-            });
-        });
-    });
-    describe('AsOfRetriever', () => {
-        const retriever = AsOfRetriever.create(index).orThrow();
-        test('empty when no asOf axis is supplied', async () => {
-            expect(await retriever.retrieve({})).toSucceedWith([]);
-        });
-        test('returns the version valid at asOf per entity', async () => {
-            expect(await retriever.retrieve({ asOf: 150 })).toSucceedAndSatisfy((records) => {
-                // fact-1 v1 valid at 150; fact-2 v1 valid at 150.
-                expect(ids(records).sort()).toEqual(['fact-1-v1', 'fact-2-v3']);
-            });
-            expect(await retriever.retrieve({ asOf: 250 })).toSucceedAndSatisfy((records) => {
-                expect(ids(records).sort()).toEqual(['fact-1-v2', 'fact-2-v3']);
-            });
-            expect(await retriever.retrieve({ asOf: 50 })).toSucceedWith([]);
-        });
-    });
-    describe('HistoryRetriever', () => {
-        const retriever = HistoryRetriever.create(index).orThrow();
-        test('returns all versions ascending by valid_at', async () => {
-            expect(await retriever.retrieve({ kind: factKind })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['fact-1-v1', 'fact-2-v3', 'fact-1-v2']);
-            });
-        });
-        test('applies the limit after ordering', async () => {
-            expect(await retriever.retrieve({ kind: factKind, limit: 2 })).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['fact-1-v1', 'fact-2-v3']);
-            });
-        });
-        test('orders by created when a version has no valid_at', async () => {
-            const idx = MemoryIndex.create().orThrow();
-            const noValidAt = {
-                scope: 'facts/entities/nv',
-                record: {
-                    envelope: envelopeConverter
-                        .convert({
-                        id: 'nv-v1',
-                        entityId: 'nv',
-                        kind: 'fact',
-                        tags: [],
-                        links: [],
-                        created: 700,
-                        updated: 700,
-                        seq: 1,
-                        contentHash: 'h',
-                        provenance: { source: 'agent' },
-                        temporal: {}
-                    })
-                        .orThrow(),
-                    body: 'nv'
-                }
-            };
-            idx.rebuild([noValidAt, versionEntry({ entityId: 'early', seq: 2, validAt: 100 })]).orThrow();
-            const r = HistoryRetriever.create(idx).orThrow();
-            // `nv` has no valid_at → its start defaults to created (700), after early (100).
-            expect(await r.retrieve({})).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['early-v2', 'nv-v1']);
-            });
-        });
-        test('breaks an equal-valid_at tie by ascending seq', async () => {
-            // Two versions of one entity sharing a valid_at — the seq tiebreak orders them.
-            const tieIndex = MemoryIndex.create().orThrow();
-            tieIndex
-                .rebuild([
-                versionEntry({ entityId: 'tie', seq: 5, validAt: 500, invalidAt: 500 }),
-                versionEntry({ entityId: 'tie', seq: 4, validAt: 500 })
-            ])
-                .orThrow();
-            const tieRetriever = HistoryRetriever.create(tieIndex).orThrow();
-            expect(await tieRetriever.retrieve({})).toSucceedAndSatisfy((records) => {
-                expect(ids(records)).toEqual(['tie-v4', 'tie-v5']);
-            });
-        });
-    });
-    describe('loud-degrade + Hybrid composite', () => {
-        test('a non-temporal retriever loud-degrades on an asOf query', async () => {
-            const recency = RecencyRetriever.create(index).orThrow();
-            expect(await recency.retrieve({ asOf: 150 })).toFailWith(/temporal query requires temporal index/i);
-        });
-        test('a Hybrid of [Recency, AsOf] lights up temporal recall via the temporal child', async () => {
-            const recency = RecencyRetriever.create(index).orThrow();
-            const asOf = AsOfRetriever.create(index).orThrow();
-            const hybrid = HybridRetriever.create([recency, asOf], ScoreUnionMergeStrategy.create().orThrow()).orThrow();
-            // The union supports temporal query, so the guard passes; Recency gets asOf
-            // stripped (returns everything), AsOf returns the valid-at versions.
-            expect(hybrid.capabilities.supportsTemporalQuery).toBe(true);
-            expect(await hybrid.retrieve({ asOf: 250, kind: factKind })).toSucceedAndSatisfy((records) => {
-                // fact-1-v2 is surfaced by BOTH (recency all + asOf), so it ranks first.
-                expect(ids(records)[0]).toBe('fact-1-v2');
-                expect(ids(records)).toContain('fact-2-v3');
-            });
-        });
-    });
-});
-//# sourceMappingURL=temporalRetrievers.test.js.map

package/dist/test/unit/retrieve/temporalRetrievers.test.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"temporalRetrievers.test.js","sourceRoot":"","sources":["../../../../src/test/unit/retrieve/temporalRetrievers.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EACL,aAAa,EACb,qBAAqB,EACrB,gBAAgB,EAChB,eAAe,EAIf,WAAW,EAEX,gBAAgB,EAChB,uBAAuB,EACvB,iBAAiB,EAClB,MAAM,gBAAgB,CAAC;AAExB,MAAM,QAAQ,GAAS,MAAc,CAAC;AAWtC,SAAS,YAAY,CAAC,IAAkB;;IACtC,MAAM,QAAQ,GAA4B,EAAE,QAAQ,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;IACrE,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;QACjC,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC;IACvC,CAAC;IACD,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,iBAAiB;aACxB,OAAO,CAAC;YACP,EAAE,EAAE,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE;YACnC,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,IAAI,EAAE,MAAA,IAAI,CAAC,IAAI,mCAAI,MAAM;YACzB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,WAAW,EAAE,KAAK,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,EAAE;YAC7C,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;YAC/B,QAAQ;SACT,CAAC;aACD,OAAO,EAAE;QACZ,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,GAAG,EAAE;KACtC,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,kBAAkB,IAAI,CAAC,QAAQ,EAAoB,EAAE,MAAM,EAAE,CAAC;AAChF,CAAC;AAED,+EAA+E;AAC/E,SAAS,SAAS,CAAC,EAAU;IAC3B,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,iBAAiB;aACxB,OAAO,CAAC;YACP,EAAE;YACF,QAAQ,EAAE,EAAE;YACZ,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,CAAC;YACV,OAAO,EAAE,CAAC;YACV,GAAG,EAAE,CAAC;YACN,WAAW,EAAE,KAAK,EAAE,EAAE;YACtB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;SAChC,CAAC;aACD,OAAO,EAAE;QACZ,IAAI,EAAE,EAAE;KACT,CAAC;IACF,OAAO,EAAE,KAAK,EAAE,WAA6B,EAAE,MAAM,EAAE,CAAC;AAC1D,CAAC;AAED,SAAS,GAAG,CAAC,OAA8C;IACzD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAY,CAAC,CAAC;AACrD,CAAC;AAED,yFAAyF;AACzF,SAAS,UAAU;IACjB,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IAC7C,KAAK;SACF,OAAO,CAAC;QACP,YAAY,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;QAC1E,YAAY,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC1D,YAAY,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;QAC1D,SAAS,CAAC,OAAO,CAAC;KACnB,CAAC;SACD,OAAO,EAAE,CAAC;IACb,OAAO,KAAK,CAAC;AACf,CAAC;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,MAAM,KAAK,GAAgB,UAAU,EAAE,CAAC;IAExC,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACrC,MAAM,SAAS,GAAG,qBAAqB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QAEhE,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACnE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0CAA0C,EAAE,KAAK,IAAI,EAAE;YAC1D,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC7F,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC7B,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QAExD,IAAI,CAAC,qCAAqC,EAAE,KAAK,IAAI,EAAE;YACrD,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8CAA8C,EAAE,KAAK,IAAI,EAAE;YAC9D,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC9E,kDAAkD;gBAClD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC9E,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,MAAM,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;QAE3D,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACnF,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;YACxE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,KAAK,IAAI,EAAE;YAClD,MAAM,CAAC,MAAM,SAAS,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC7F,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;YAC3D,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;YAClE,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAC3C,MAAM,SAAS,GAAyB;gBACtC,KAAK,EAAE,mBAAqC;gBAC5C,MAAM,EAAE;oBACN,QAAQ,EAAE,iBAAiB;yBACxB,OAAO,CAAC;wBACP,EAAE,EAAE,OAAO;wBACX,QAAQ,EAAE,IAAI;wBACd,IAAI,EAAE,MAAM;wBACZ,IAAI,EAAE,EAAE;wBACR,KAAK,EAAE,EAAE;wBACT,OAAO,EAAE,GAAG;wBACZ,OAAO,EAAE,GAAG;wBACZ,GAAG,EAAE,CAAC;wBACN,WAAW,EAAE,GAAG;wBAChB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;wBAC/B,QAAQ,EAAE,EAAE;qBACb,CAAC;yBACD,OAAO,EAAE;oBACZ,IAAI,EAAE,IAAI;iBACX;aACF,CAAC;YACF,GAAG,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,YAAY,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC9F,MAAM,CAAC,GAAG,gBAAgB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;YACjD,iFAAiF;YACjF,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC3D,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,+CAA+C,EAAE,KAAK,IAAI,EAAE;YAC/D,gFAAgF;YAChF,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YAChD,QAAQ;iBACL,OAAO,CAAC;gBACP,YAAY,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;gBACvE,YAAY,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;aACxD,CAAC;iBACD,OAAO,EAAE,CAAC;YACb,MAAM,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;YACjE,MAAM,CAAC,MAAM,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACtE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;YACrD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC/C,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACzE,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACzD,MAAM,CAAC,MAAM,OAAO,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,yCAAyC,CAAC,CAAC;QACtG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8EAA8E,EAAE,KAAK,IAAI,EAAE;YAC9F,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACzD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,OAAO,EAAE,IAAI,CAAC,EACf,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAC3C,CAAC,OAAO,EAAE,CAAC;YACZ,4EAA4E;YAC5E,qEAAqE;YACrE,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,qBAAqB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7D,MAAM,CAAC,MAAM,MAAM,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC3F,yEAAyE;gBACzE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAC1C,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport {\n AsOfRetriever,\n CurrentValidRetriever,\n HistoryRetriever,\n HybridRetriever,\n IIndexedMemoryRecord,\n IMemoryRecord,\n Kind,\n MemoryIndex,\n MemoryScopeKey,\n RecencyRetriever,\n ScoreUnionMergeStrategy,\n envelopeConverter\n} from '../../../index';\n\nconst factKind: Kind = 'fact' as Kind;\n\ninterface IVersionSpec {\n readonly entityId: string;\n readonly seq: number;\n readonly validAt: number;\n // eslint-disable-next-line @rushstack/no-new-null -- invalid_at null is the meaningful still-valid sentinel\n readonly invalidAt?: number | null;\n readonly kind?: string;\n}\n\nfunction versionEntry(spec: IVersionSpec): IIndexedMemoryRecord {\n const temporal: Record<string, unknown> = { valid_at: spec.validAt };\n if (spec.invalidAt !== undefined) {\n temporal.invalid_at = spec.invalidAt;\n }\n const record: IMemoryRecord<unknown> = {\n envelope: envelopeConverter\n .convert({\n id: `${spec.entityId}-v${spec.seq}`,\n entityId: spec.entityId,\n kind: spec.kind ?? 'fact',\n tags: [],\n links: [],\n created: spec.validAt,\n updated: spec.validAt,\n seq: spec.seq,\n contentHash: `h-${spec.entityId}-${spec.seq}`,\n provenance: { source: 'agent' },\n temporal\n })\n .orThrow(),\n body: `${spec.entityId} v${spec.seq}`\n };\n return { scope: `facts/entities/${spec.entityId}` as MemoryScopeKey, record };\n}\n\n/** A flat (non-temporal) entry, to prove the temporal retrievers ignore it. */\nfunction flatEntry(id: string): IIndexedMemoryRecord {\n const record: IMemoryRecord<unknown> = {\n envelope: envelopeConverter\n .convert({\n id,\n entityId: id,\n kind: 'knowledge',\n tags: [],\n links: [],\n created: 0,\n updated: 0,\n seq: 0,\n contentHash: `h-${id}`,\n provenance: { source: 'agent' }\n })\n .orThrow(),\n body: id\n };\n return { scope: 'knowledge' as MemoryScopeKey, record };\n}\n\nfunction ids(records: ReadonlyArray<IMemoryRecord<unknown>>): string[] {\n return records.map((r) => r.envelope.id as string);\n}\n\n// fact-1: v1 [100,200), v2 [200,∞) current. fact-2: v1 [150,∞) current. Plus a flat doc.\nfunction buildIndex(): MemoryIndex {\n const index = MemoryIndex.create().orThrow();\n index\n .rebuild([\n versionEntry({ entityId: 'fact-1', seq: 1, validAt: 100, invalidAt: 200 }),\n versionEntry({ entityId: 'fact-1', seq: 2, validAt: 200 }),\n versionEntry({ entityId: 'fact-2', seq: 3, validAt: 150 }),\n flatEntry('doc-a')\n ])\n .orThrow();\n return index;\n}\n\ndescribe('temporal retrievers', () => {\n const index: MemoryIndex = buildIndex();\n\n describe('CurrentValidRetriever', () => {\n const retriever = CurrentValidRetriever.create(index).orThrow();\n\n test('declares supportsTemporalQuery', () => {\n expect(retriever.capabilities.supportsTemporalQuery).toBe(true);\n });\n\n test('returns the current version per temporal entity, ignoring flat records', async () => {\n expect(await retriever.retrieve({})).toSucceedAndSatisfy((records) => {\n expect(ids(records).sort()).toEqual(['fact-1-v2', 'fact-2-v3']);\n });\n });\n\n test('honors scope / kind pre-filter and limit', async () => {\n expect(await retriever.retrieve({ kind: factKind, limit: 1 })).toSucceedAndSatisfy((records) => {\n expect(records).toHaveLength(1);\n });\n });\n });\n\n describe('AsOfRetriever', () => {\n const retriever = AsOfRetriever.create(index).orThrow();\n\n test('empty when no asOf axis is supplied', async () => {\n expect(await retriever.retrieve({})).toSucceedWith([]);\n });\n\n test('returns the version valid at asOf per entity', async () => {\n expect(await retriever.retrieve({ asOf: 150 })).toSucceedAndSatisfy((records) => {\n // fact-1 v1 valid at 150; fact-2 v1 valid at 150.\n expect(ids(records).sort()).toEqual(['fact-1-v1', 'fact-2-v3']);\n });\n expect(await retriever.retrieve({ asOf: 250 })).toSucceedAndSatisfy((records) => {\n expect(ids(records).sort()).toEqual(['fact-1-v2', 'fact-2-v3']);\n });\n expect(await retriever.retrieve({ asOf: 50 })).toSucceedWith([]);\n });\n });\n\n describe('HistoryRetriever', () => {\n const retriever = HistoryRetriever.create(index).orThrow();\n\n test('returns all versions ascending by valid_at', async () => {\n expect(await retriever.retrieve({ kind: factKind })).toSucceedAndSatisfy((records) => {\n expect(ids(records)).toEqual(['fact-1-v1', 'fact-2-v3', 'fact-1-v2']);\n });\n });\n\n test('applies the limit after ordering', async () => {\n expect(await retriever.retrieve({ kind: factKind, limit: 2 })).toSucceedAndSatisfy((records) => {\n expect(ids(records)).toEqual(['fact-1-v1', 'fact-2-v3']);\n });\n });\n\n test('orders by created when a version has no valid_at', async () => {\n const idx = MemoryIndex.create().orThrow();\n const noValidAt: IIndexedMemoryRecord = {\n scope: 'facts/entities/nv' as MemoryScopeKey,\n record: {\n envelope: envelopeConverter\n .convert({\n id: 'nv-v1',\n entityId: 'nv',\n kind: 'fact',\n tags: [],\n links: [],\n created: 700,\n updated: 700,\n seq: 1,\n contentHash: 'h',\n provenance: { source: 'agent' },\n temporal: {}\n })\n .orThrow(),\n body: 'nv'\n }\n };\n idx.rebuild([noValidAt, versionEntry({ entityId: 'early', seq: 2, validAt: 100 })]).orThrow();\n const r = HistoryRetriever.create(idx).orThrow();\n // `nv` has no valid_at → its start defaults to created (700), after early (100).\n expect(await r.retrieve({})).toSucceedAndSatisfy((records) => {\n expect(ids(records)).toEqual(['early-v2', 'nv-v1']);\n });\n });\n\n test('breaks an equal-valid_at tie by ascending seq', async () => {\n // Two versions of one entity sharing a valid_at — the seq tiebreak orders them.\n const tieIndex = MemoryIndex.create().orThrow();\n tieIndex\n .rebuild([\n versionEntry({ entityId: 'tie', seq: 5, validAt: 500, invalidAt: 500 }),\n versionEntry({ entityId: 'tie', seq: 4, validAt: 500 })\n ])\n .orThrow();\n const tieRetriever = HistoryRetriever.create(tieIndex).orThrow();\n expect(await tieRetriever.retrieve({})).toSucceedAndSatisfy((records) => {\n expect(ids(records)).toEqual(['tie-v4', 'tie-v5']);\n });\n });\n });\n\n describe('loud-degrade + Hybrid composite', () => {\n test('a non-temporal retriever loud-degrades on an asOf query', async () => {\n const recency = RecencyRetriever.create(index).orThrow();\n expect(await recency.retrieve({ asOf: 150 })).toFailWith(/temporal query requires temporal index/i);\n });\n\n test('a Hybrid of [Recency, AsOf] lights up temporal recall via the temporal child', async () => {\n const recency = RecencyRetriever.create(index).orThrow();\n const asOf = AsOfRetriever.create(index).orThrow();\n const hybrid = HybridRetriever.create(\n [recency, asOf],\n ScoreUnionMergeStrategy.create().orThrow()\n ).orThrow();\n // The union supports temporal query, so the guard passes; Recency gets asOf\n // stripped (returns everything), AsOf returns the valid-at versions.\n expect(hybrid.capabilities.supportsTemporalQuery).toBe(true);\n expect(await hybrid.retrieve({ asOf: 250, kind: factKind })).toSucceedAndSatisfy((records) => {\n // fact-1-v2 is surfaced by BOTH (recency all + asOf), so it ranks first.\n expect(ids(records)[0]).toBe('fact-1-v2');\n expect(ids(records)).toContain('fact-2-v3');\n });\n });\n });\n});\n"]}

package/dist/test/unit/store/antagonistTemporalBoundary.test.js DELETED Viewed

@@ -1,120 +0,0 @@
-/*
- * Copyright (c) 2026 Erik Fortune
- * SPDX-License-Identifier: MIT
- */
-/**
- * Antagonist torture tests — bi-temporal / two-clock boundary math (target class
- * 2), complementing `temporalCodec.test.ts` (which already covers the
- * `invalid_at`-exclusive boundary and the future-dated-supersede no-gap case).
- * This file targets two remaining gaps: the `valid_at`-inclusive boundary, and
- * an out-of-order sequence of `valid_at` writes.
- */
-import '@fgv/ts-utils-jest';
-import { Converters } from '@fgv/ts-utils';
-import { FileTree } from '@fgv/ts-json-base';
-import { BodyConverterRegistry, FileTreeMemoryStore, TemporalIdentityCodec, TemporalVersionedPolicy, envelopeConverter, isVersionValidAt } from '../../../index';
-const factKind = 'fact';
-const factScope = 'facts/entities/fact-1';
-function mutableRoot() {
-    const tree = FileTree.inMemory([], { mutable: true }).orThrow();
-    const root = tree.getDirectory('/').orThrow();
-    if (!FileTree.isMutableDirectoryItem(root)) {
-        throw new Error('expected a mutable root directory');
-    }
-    return root;
-}
-function registry() {
-    const reg = BodyConverterRegistry.create().orThrow();
-    reg.register(factKind, Converters.string);
-    return reg;
-}
-const codecs = new Map([
-    [factKind, TemporalIdentityCodec.create('facts').orThrow()]
-]);
-const policies = new Map([
-    [factKind, TemporalVersionedPolicy.create().orThrow()]
-]);
-function factRecordAt(entityId, body, validAt) {
-    return {
-        envelope: Object.assign({ id: entityId, entityId: entityId, kind: factKind, tags: [], links: [], created: 0, updated: 0, seq: 0, contentHash: '', provenance: { source: 'agent' } }, (validAt !== undefined ? { temporal: { valid_at: validAt } } : {})),
-        body
-    };
-}
-describe('antagonist — isVersionValidAt: valid_at is INCLUSIVE (start-boundary parity with the exclusive end)', () => {
-    // Wrong impl this catches: a `>` (strict) comparison for the start boundary
-    // instead of `<=`, which would incorrectly exclude the instant a version FIRST
-    // became valid — an asymmetry with the already-tested exclusive end boundary.
-    test('a version is valid AT its own valid_at instant, not just strictly after it', () => {
-        const v1 = {
-            envelope: envelopeConverter
-                .convert({
-                id: 'fact-1-v1',
-                entityId: 'fact-1',
-                kind: 'fact',
-                tags: [],
-                links: [],
-                created: 100,
-                updated: 100,
-                seq: 1,
-                contentHash: 'h1',
-                provenance: { source: 'agent' },
-                temporal: { valid_at: 100, invalid_at: 200 }
-            })
-                .orThrow(),
-            body: 'v1'
-        };
-        expect(isVersionValidAt(v1, 99)).toBe(false); // strictly before
-        expect(isVersionValidAt(v1, 100)).toBe(true); // AT valid_at — inclusive start
-        expect(isVersionValidAt(v1, 199)).toBe(true); // just before invalid_at
-        expect(isVersionValidAt(v1, 200)).toBe(false); // AT invalid_at — exclusive end
-    });
-});
-describe('antagonist — out-of-order valid_at sequence (no gap/overlap regardless of write order)', () => {
-    let clockValue;
-    const clock = () => clockValue;
-    function createStore() {
-        return FileTreeMemoryStore.create({
-            root: mutableRoot(),
-            registry: registry(),
-            codecs,
-            writePolicies: policies,
-            clock
-        }).orThrow();
-    }
-    // Wrong impl this catches: an implementation that assumes valid_at is
-    // monotonically increasing with seq (e.g. sorts by valid_at instead of seq for
-    // "current" resolution), which breaks the moment a caller backdates a SECOND
-    // time after an earlier future-dated write.
-    test('two consecutive backdated writes still close each prior interval at the NEW valid_at, not now', async () => {
-        const store = createStore();
-        clockValue = 1000;
-        // v1: valid_at defaults to transaction time (1000).
-        expect(await store.put(factRecordAt('fact-1', 'blue'))).toSucceed();
-        clockValue = 2000;
-        // v2: backdated BEHIND v1's own valid_at (500 < 1000) — a correction asserting
-        // "actually, this was already true starting at t=500".
-        expect(await store.put(factRecordAt('fact-1', 'grey', 500))).toSucceedAndSatisfy((put) => {
-            expect(put.envelope.temporal).toEqual({ valid_at: 500 });
-        });
-        // v1's interval must close at v2's valid_at (500), not the transaction time (2000).
-        expect(await store.getById(factScope, 'fact-1-v1')).toSucceedAndSatisfy((v1) => {
-            expect(v1 === null || v1 === void 0 ? void 0 : v1.envelope.temporal).toEqual({ valid_at: 1000, invalid_at: 500 });
-        });
-        clockValue = 3000;
-        // v3: backdated again, even further behind (100 < 500) — a SECOND correction.
-        expect(await store.put(factRecordAt('fact-1', 'black', 100))).toSucceedAndSatisfy((put) => {
-            expect(put.envelope.temporal).toEqual({ valid_at: 100 });
-        });
-        // v2's interval must close at v3's valid_at (100), not the transaction time (3000).
-        expect(await store.getById(factScope, 'fact-1-v2')).toSucceedAndSatisfy((v2) => {
-            expect(v2 === null || v2 === void 0 ? void 0 : v2.envelope.temporal).toEqual({ valid_at: 500, invalid_at: 100 });
-        });
-        // `selectCurrentVersion` still resolves the newest write by `seq` (v3),
-        // regardless of `valid_at` no longer being seq-monotonic.
-        expect(await store.get(factKind, 'fact-1')).toSucceedAndSatisfy((cur) => {
-            expect(cur === null || cur === void 0 ? void 0 : cur.envelope.id).toBe('fact-1-v3');
-            expect(cur === null || cur === void 0 ? void 0 : cur.body).toBe('black');
-        });
-    });
-});
-//# sourceMappingURL=antagonistTemporalBoundary.test.js.map

package/dist/test/unit/store/antagonistTemporalBoundary.test.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"antagonistTemporalBoundary.test.js","sourceRoot":"","sources":["../../../../src/test/unit/store/antagonistTemporalBoundary.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;GAMG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EACL,qBAAqB,EAErB,mBAAmB,EAOnB,qBAAqB,EACrB,uBAAuB,EACvB,iBAAiB,EACjB,gBAAgB,EACjB,MAAM,gBAAgB,CAAC;AAExB,MAAM,QAAQ,GAAS,MAAc,CAAC;AACtC,MAAM,SAAS,GAAmB,uBAAyC,CAAC;AAE5E,SAAS,WAAW;IAClB,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;IAChE,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9C,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,QAAQ;IACf,MAAM,GAAG,GAAG,qBAAqB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IACrD,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAC1C,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,MAAM,GAAsC,IAAI,GAAG,CAAuB;IAC9E,CAAC,QAAQ,EAAE,qBAAqB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,CAAC;CAC5D,CAAC,CAAC;AACH,MAAM,QAAQ,GAAoC,IAAI,GAAG,CAAqB;IAC5E,CAAC,QAAQ,EAAE,uBAAuB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;CACvD,CAAC,CAAC;AAEH,SAAS,YAAY,CAAC,QAAgB,EAAE,IAAY,EAAE,OAAgB;IACpE,OAAO;QACL,QAAQ,kBACN,EAAE,EAAE,QAA+D,EACnE,QAAQ,EAAE,QAAoB,EAC9B,IAAI,EAAE,QAAQ,EACd,IAAI,EAAE,EAAE,EACR,KAAK,EAAE,EAAE,EACT,OAAO,EAAE,CAAC,EACV,OAAO,EAAE,CAAC,EACV,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,EAAE,EACf,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,IAC5B,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtE;QACD,IAAI;KACL,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,qGAAqG,EAAE,GAAG,EAAE;IACnH,4EAA4E;IAC5E,+EAA+E;IAC/E,8EAA8E;IAC9E,IAAI,CAAC,4EAA4E,EAAE,GAAG,EAAE;QACtF,MAAM,EAAE,GAAG;YACT,QAAQ,EAAE,iBAAiB;iBACxB,OAAO,CAAC;gBACP,EAAE,EAAE,WAAW;gBACf,QAAQ,EAAE,QAAQ;gBAClB,IAAI,EAAE,MAAM;gBACZ,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,EAAE;gBACT,OAAO,EAAE,GAAG;gBACZ,OAAO,EAAE,GAAG;gBACZ,GAAG,EAAE,CAAC;gBACN,WAAW,EAAE,IAAI;gBACjB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE;gBAC/B,QAAQ,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE;aAC7C,CAAC;iBACD,OAAO,EAAE;YACZ,IAAI,EAAE,IAAI;SACX,CAAC;QACF,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,kBAAkB;QAChE,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,gCAAgC;QAC9E,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,yBAAyB;QACvE,MAAM,CAAC,gBAAgB,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,gCAAgC;IACjF,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,wFAAwF,EAAE,GAAG,EAAE;IACtG,IAAI,UAAkB,CAAC;IACvB,MAAM,KAAK,GAAG,GAAW,EAAE,CAAC,UAAU,CAAC;IAEvC,SAAS,WAAW;QAClB,OAAO,mBAAmB,CAAC,MAAM,CAAC;YAChC,IAAI,EAAE,WAAW,EAAE;YACnB,QAAQ,EAAE,QAAQ,EAAE;YACpB,MAAM;YACN,aAAa,EAAE,QAAQ;YACvB,KAAK;SACN,CAAC,CAAC,OAAO,EAAE,CAAC;IACf,CAAC;IAED,sEAAsE;IACtE,+EAA+E;IAC/E,6EAA6E;IAC7E,4CAA4C;IAC5C,IAAI,CAAC,+FAA+F,EAAE,KAAK,IAAI,EAAE;QAC/G,MAAM,KAAK,GAAG,WAAW,EAAE,CAAC;QAC5B,UAAU,GAAG,IAAI,CAAC;QAClB,oDAAoD;QACpD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAEpE,UAAU,GAAG,IAAI,CAAC;QAClB,+EAA+E;QAC/E,uDAAuD;QACvD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAG,EAAE,EAAE;YACvF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QACH,oFAAoF;QACpF,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,WAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,EAAE,EAAE,EAAE;YACtF,MAAM,CAAC,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,UAAU,GAAG,IAAI,CAAC;QAClB,8EAA8E;QAC9E,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAG,EAAE,EAAE;YACxF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;QACH,oFAAoF;QACpF,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,WAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,EAAE,EAAE,EAAE;YACtF,MAAM,CAAC,EAAE,aAAF,EAAE,uBAAF,EAAE,CAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;QACH,wEAAwE;QACxE,0DAA0D;QAC1D,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAG,EAAE,EAAE;YAClF,MAAM,CAAC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC3C,MAAM,CAAC,GAAG,aAAH,GAAG,uBAAH,GAAG,CAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\n/**\n * Antagonist torture tests — bi-temporal / two-clock boundary math (target class\n * 2), complementing `temporalCodec.test.ts` (which already covers the\n * `invalid_at`-exclusive boundary and the future-dated-supersede no-gap case).\n * This file targets two remaining gaps: the `valid_at`-inclusive boundary, and\n * an out-of-order sequence of `valid_at` writes.\n */\n\nimport '@fgv/ts-utils-jest';\nimport { Converters } from '@fgv/ts-utils';\nimport { FileTree } from '@fgv/ts-json-base';\nimport {\n BodyConverterRegistry,\n EntityId,\n FileTreeMemoryStore,\n IBodyConverterRegistry,\n IIdentityCodec,\n IMemoryRecord,\n IWritePolicy,\n Kind,\n MemoryScopeKey,\n TemporalIdentityCodec,\n TemporalVersionedPolicy,\n envelopeConverter,\n isVersionValidAt\n} from '../../../index';\n\nconst factKind: Kind = 'fact' as Kind;\nconst factScope: MemoryScopeKey = 'facts/entities/fact-1' as MemoryScopeKey;\n\nfunction mutableRoot(): FileTree.IMutableFileTreeDirectoryItem {\n const tree = FileTree.inMemory([], { mutable: true }).orThrow();\n const root = tree.getDirectory('/').orThrow();\n if (!FileTree.isMutableDirectoryItem(root)) {\n throw new Error('expected a mutable root directory');\n }\n return root;\n}\n\nfunction registry(): IBodyConverterRegistry {\n const reg = BodyConverterRegistry.create().orThrow();\n reg.register(factKind, Converters.string);\n return reg;\n}\n\nconst codecs: ReadonlyMap<Kind, IIdentityCodec> = new Map<Kind, IIdentityCodec>([\n [factKind, TemporalIdentityCodec.create('facts').orThrow()]\n]);\nconst policies: ReadonlyMap<Kind, IWritePolicy> = new Map<Kind, IWritePolicy>([\n [factKind, TemporalVersionedPolicy.create().orThrow()]\n]);\n\nfunction factRecordAt(entityId: string, body: string, validAt?: number): IMemoryRecord<unknown> {\n return {\n envelope: {\n id: entityId as unknown as IMemoryRecord<unknown>['envelope']['id'],\n entityId: entityId as EntityId,\n kind: factKind,\n tags: [],\n links: [],\n created: 0,\n updated: 0,\n seq: 0,\n contentHash: '',\n provenance: { source: 'agent' },\n ...(validAt !== undefined ? { temporal: { valid_at: validAt } } : {})\n },\n body\n };\n}\n\ndescribe('antagonist — isVersionValidAt: valid_at is INCLUSIVE (start-boundary parity with the exclusive end)', () => {\n // Wrong impl this catches: a `>` (strict) comparison for the start boundary\n // instead of `<=`, which would incorrectly exclude the instant a version FIRST\n // became valid — an asymmetry with the already-tested exclusive end boundary.\n test('a version is valid AT its own valid_at instant, not just strictly after it', () => {\n const v1 = {\n envelope: envelopeConverter\n .convert({\n id: 'fact-1-v1',\n entityId: 'fact-1',\n kind: 'fact',\n tags: [],\n links: [],\n created: 100,\n updated: 100,\n seq: 1,\n contentHash: 'h1',\n provenance: { source: 'agent' },\n temporal: { valid_at: 100, invalid_at: 200 }\n })\n .orThrow(),\n body: 'v1'\n };\n expect(isVersionValidAt(v1, 99)).toBe(false); // strictly before\n expect(isVersionValidAt(v1, 100)).toBe(true); // AT valid_at — inclusive start\n expect(isVersionValidAt(v1, 199)).toBe(true); // just before invalid_at\n expect(isVersionValidAt(v1, 200)).toBe(false); // AT invalid_at — exclusive end\n });\n});\n\ndescribe('antagonist — out-of-order valid_at sequence (no gap/overlap regardless of write order)', () => {\n let clockValue: number;\n const clock = (): number => clockValue;\n\n function createStore(): FileTreeMemoryStore {\n return FileTreeMemoryStore.create({\n root: mutableRoot(),\n registry: registry(),\n codecs,\n writePolicies: policies,\n clock\n }).orThrow();\n }\n\n // Wrong impl this catches: an implementation that assumes valid_at is\n // monotonically increasing with seq (e.g. sorts by valid_at instead of seq for\n // \"current\" resolution), which breaks the moment a caller backdates a SECOND\n // time after an earlier future-dated write.\n test('two consecutive backdated writes still close each prior interval at the NEW valid_at, not now', async () => {\n const store = createStore();\n clockValue = 1000;\n // v1: valid_at defaults to transaction time (1000).\n expect(await store.put(factRecordAt('fact-1', 'blue'))).toSucceed();\n\n clockValue = 2000;\n // v2: backdated BEHIND v1's own valid_at (500 < 1000) — a correction asserting\n // \"actually, this was already true starting at t=500\".\n expect(await store.put(factRecordAt('fact-1', 'grey', 500))).toSucceedAndSatisfy((put) => {\n expect(put.envelope.temporal).toEqual({ valid_at: 500 });\n });\n // v1's interval must close at v2's valid_at (500), not the transaction time (2000).\n expect(await store.getById(factScope, 'fact-1-v1' as never)).toSucceedAndSatisfy((v1) => {\n expect(v1?.envelope.temporal).toEqual({ valid_at: 1000, invalid_at: 500 });\n });\n\n clockValue = 3000;\n // v3: backdated again, even further behind (100 < 500) — a SECOND correction.\n expect(await store.put(factRecordAt('fact-1', 'black', 100))).toSucceedAndSatisfy((put) => {\n expect(put.envelope.temporal).toEqual({ valid_at: 100 });\n });\n // v2's interval must close at v3's valid_at (100), not the transaction time (3000).\n expect(await store.getById(factScope, 'fact-1-v2' as never)).toSucceedAndSatisfy((v2) => {\n expect(v2?.envelope.temporal).toEqual({ valid_at: 500, invalid_at: 100 });\n });\n // `selectCurrentVersion` still resolves the newest write by `seq` (v3),\n // regardless of `valid_at` no longer being seq-monotonic.\n expect(await store.get(factKind, 'fact-1' as EntityId)).toSucceedAndSatisfy((cur) => {\n expect(cur?.envelope.id).toBe('fact-1-v3');\n expect(cur?.body).toBe('black');\n });\n });\n});\n"]}