@fgv/ts-agent-memory 5.1.0-36

package/lib/test/unit/types/writePolicy.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"writePolicy.test.js","sourceRoot":"","sources":["../../../../src/test/unit/types/writePolicy.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,mDAUiC;AAOjC,SAAS,UAAU,CAAC,SAAoC,EAAE,IAAc;IACtE,MAAM,QAAQ,mBACZ,EAAE,EAAE,eAA2B,EAC/B,QAAQ,EAAE,eAA2B,EACrC,IAAI,EAAE,WAAmB,EACzB,IAAI,EAAE,CAAC,MAAM,CAAU,EACvB,KAAK,EAAE,EAAE,EACT,OAAO,EAAE,IAAI,EACb,OAAO,EAAE,IAAI,EACb,GAAG,EAAE,CAAC,EACN,WAAW,EAAE,QAAQ,EACrB,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAiB,IAC3C,SAAS,CACb,CAAC;IACF,OAAO;QACL,QAAQ;QACR,IAAI,EAAE,IAAI,aAAJ,IAAI,cAAJ,IAAI,GAAK,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAqB;KACvE,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAI,MAA0B,CAAC;IAE/B,UAAU,CAAC,GAAG,EAAE;QACd,MAAM,GAAG,0BAAkB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC5F,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACpD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;YAC7E,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;gBAC7E,QAAQ,EAAE,QAAQ;aACnB,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACrC,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;YAC7E,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,SAAS,CAAU,EAAE,CAAC,CAAC;YACpE,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACvF,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,UAAU,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAiB,EAAE,CAAC,CAAC;YAC/F,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,UAAU,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACxF,CAAC,OAAO,EAAE,EAAE;gBACV,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAChG,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACvD,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC9F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qFAAqF,EAAE,GAAG,EAAE;YAC/F,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC3F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,aAAa,EAAE,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iFAAiF,EAAE,GAAG,EAAE;YAC3F,MAAM,QAAQ,GAAG,UAAU,EAAE,CAAC,CAAC,kBAAkB;YACjD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,aAAa,EAAE,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,GAAG,EAAE;YACpF,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC;YACpD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAClG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,QAAQ,EAAE,CAAC;YACnD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,MAAM,QAAQ,GAAG,UAAU,EAAE,CAAC;YAC9B,MAAM,CACJ,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,CAC3F,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAChC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC5C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACnE,MAAM,QAAQ,GAAG,UAAU,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC1F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBACxD,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAChD,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC5C,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,QAAQ,GAAG,UAAU,EAAE,CAAC;YAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAC7D,2CAA2C,CAC5C,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,MAAM,YAAY,GAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;IAEpG,kEAAkE;IAClE,SAAS,YAAY,CAAC,EAAU,EAAE,OAAe,EAAE,IAAc;QAC/D,OAAO,UAAU,CACf;YACE,EAAE,EAAE,EAAc;YAClB,QAAQ,EAAE,EAAc;YACxB,IAAI,EAAE,iBAAyB;YAC/B,OAAO;YACP,OAAO,EAAE,OAAO;SACjB,EACD,IAAI,CACL,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,+EAA+E,EAAE,GAAG,EAAE;QACzF,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QACpG,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,IAAI,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC7D,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACrF,MAAM,MAAM,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;YACjG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QAChG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACrD,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpG,MAAM,MAAM,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;YACtE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QAChG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8EAA8E,EAAE,GAAG,EAAE;YACxF,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpG,4EAA4E;YAC5E,MAAM,MAAM,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,EAAE,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;YACpG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC;gBACvE,QAAQ,EAAE,aAAa;gBACvB,KAAK,EAAE,CAAC,QAAoB,CAAC;aAC9B,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC/E,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YACpG,MAAM,MAAM,GAAG;gBACb,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC1B,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC1B,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC1B,YAAY,CAAC,QAAQ,EAAE,EAAE,CAAC;aAC3B,CAAC;YACF,8EAA8E;YAC9E,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC;gBACvE,QAAQ,EAAE,aAAa;gBACvB,KAAK,EAAE,CAAC,QAAoB,EAAE,QAAoB,EAAE,QAAoB,CAAC;aAC1E,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAI,MAA2B,CAAC;QAEhC,UAAU,CAAC,GAAG,EAAE;YACd,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;QAChG,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACvE,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CACxF,CAAC,OAAO,EAAE,EAAE;gBACV,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAChE,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAChE,MAAM,QAAQ,GAAG,UAAU,CAAC;gBAC1B,EAAE,EAAE,QAAoB;gBACxB,IAAI,EAAE,iBAAyB;gBAC/B,IAAI,EAAE,CAAC,OAAO,EAAE,SAAS,CAAU;aACpC,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBACxF,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YACnD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACvD,MAAM,QAAQ,GAAG,UAAU,CAAC;gBAC1B,EAAE,EAAE,QAAoB;gBACxB,IAAI,EAAE,iBAAyB;gBAC/B,YAAY,EAAE,OAAO;aACtB,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC9F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACtD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2EAA2E,EAAE,GAAG,EAAE;YACrF,MAAM,QAAQ,GAAG,UAAU,CAAC;gBAC1B,EAAE,EAAE,QAAoB;gBACxB,IAAI,EAAE,iBAAyB;gBAC/B,YAAY,EAAE,OAAO;aACtB,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC3F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,aAAa,EAAE,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAC7D,2CAA2C,CAC5C,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,mEAAmE;YACnE,yCAAyC;YACzC,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YAChG,MAAM,QAAQ,GAAG,UAAU,CACzB;gBACE,EAAE,EAAE,QAAoB;gBACxB,IAAI,EAAE,iBAAyB;gBAC/B,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,cAAuB,EAAE,MAAM,EAAE,OAAmB,EAAE,CAAC;aACxE,EACD,EAAE,OAAO,EAAE,KAAK,EAAE,CACnB,CAAC;YACF,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAC7F,CAAC,OAAO,EAAE,EAAE;gBACV,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;gBACpF,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;YACjD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8DAA8D,EAAE,GAAG,EAAE;YACxE,uEAAuE;YACvE,wEAAwE;YACxE,MAAM,QAAQ,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YAClG,MAAM,QAAQ,GAAG,UAAU,CACzB,EAAE,EAAE,EAAE,QAAoB,EAAE,IAAI,EAAE,iBAAyB,EAAE,IAAI,EAAE,CAAC,KAAK,CAAU,EAAE,EACrF,EAAE,OAAO,EAAE,SAAS,EAAE,CACvB,CAAC;YACF,MAAM,CACJ,QAAQ,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,CAChF,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAChC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC/C,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YACvD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iFAAiF,EAAE,GAAG,EAAE;YAC3F,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;YAC7D,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC/F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,aAAa,EAAE,CAAC;YACxD,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uEAAuE,EAAE,GAAG,EAAE;YACjF,MAAM,MAAM,GAAG,2BAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,aAAa,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC;YAChG,MAAM,QAAQ,GAAG,UAAU,CAAC;gBAC1B,EAAE,EAAE,QAAoB;gBACxB,IAAI,EAAE,iBAAyB;gBAC/B,YAAY,EAAE,UAAU;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,OAAO,EAAE,EAAE;gBAC/F,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzD,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  EntityId,\n  IMemoryEnvelope,\n  IMemoryRecord,\n  IProvenance,\n  Kind,\n  KnowledgeLwwPolicy,\n  MemoryCapCullPolicy,\n  MemoryId,\n  Tag\n} from '../../../packlets/types';\n\ninterface IKnowledgeBody {\n  readonly title: string;\n  readonly text: string;\n}\n\nfunction makeRecord(overrides?: Partial<IMemoryEnvelope>, body?: unknown): IMemoryRecord<unknown> {\n  const envelope: IMemoryEnvelope = {\n    id: 'intro-to-rust' as MemoryId,\n    entityId: 'intro-to-rust' as EntityId,\n    kind: 'knowledge' as Kind,\n    tags: ['rust'] as Tag[],\n    links: [],\n    created: 1000,\n    updated: 1000,\n    seq: 1,\n    contentHash: 'hash-1',\n    provenance: { source: 'agent' } as IProvenance,\n    ...overrides\n  };\n  return {\n    envelope,\n    body: body ?? ({ title: 'Intro', text: 'original' } as IKnowledgeBody)\n  };\n}\n\ndescribe('KnowledgeLwwPolicy', () => {\n  let policy: KnowledgeLwwPolicy;\n\n  beforeEach(() => {\n    policy = KnowledgeLwwPolicy.create().orThrow();\n  });\n\n  test('create succeeds and exposes the knowledge mutable surface', () => {\n    expect(policy.mutableFields).toEqual(['body', 'tags', 'links', 'provenance', 'embeddingRef']);\n  });\n\n  test('declares content-scoped dedup (knowledge collapses identical content across ids)', () => {\n    expect(policy.dedupScope).toBe('content');\n  });\n\n  describe('admit', () => {\n    test('always accepts (last-write-wins, no cap)', () => {\n      expect(policy.admit(makeRecord(), [])).toSucceedWith({ decision: 'accept' });\n      expect(policy.admit(makeRecord(), [makeRecord(), makeRecord()])).toSucceedWith({\n        decision: 'accept'\n      });\n    });\n  });\n\n  describe('applyUpdate', () => {\n    test('deep-merges a body change', () => {\n      const existing = makeRecord(undefined, { title: 'Intro', text: 'original' });\n      expect(policy.applyUpdate(existing, { body: { text: 'revised' } })).toSucceedAndSatisfy((updated) => {\n        expect(updated.body).toEqual({ title: 'Intro', text: 'revised' });\n      });\n    });\n\n    test('replaces arrays wholesale (RFC-7386 array semantics)', () => {\n      const existing = makeRecord({ tags: ['rust', 'systems'] as Tag[] });\n      expect(policy.applyUpdate(existing, { tags: ['rust'] })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.tags).toEqual(['rust']);\n      });\n    });\n\n    test('deep-merges provenance and preserves untouched keys', () => {\n      const existing = makeRecord({ provenance: { source: 'agent', by: 'curator' } as IProvenance });\n      expect(policy.applyUpdate(existing, { provenance: { model: 'gpt' } })).toSucceedAndSatisfy(\n        (updated) => {\n          expect(updated.envelope.provenance).toEqual({ source: 'agent', by: 'curator', model: 'gpt' });\n        }\n      );\n    });\n\n    test('sets embeddingRef when present in the patch', () => {\n      const existing = makeRecord({ embeddingRef: 'vec-1' });\n      expect(policy.applyUpdate(existing, { embeddingRef: 'vec-2' })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBe('vec-2');\n      });\n    });\n\n    test('clears embeddingRef (to absent) when the patch deletes it (null = delete, RFC-7386)', () => {\n      const existing = makeRecord({ embeddingRef: 'vec-1' });\n      expect(policy.applyUpdate(existing, { embeddingRef: null })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBeUndefined();\n      });\n    });\n\n    test('preserves an absent embeddingRef as absent on an unrelated update (hash-stable)', () => {\n      const existing = makeRecord(); // no embeddingRef\n      expect(policy.applyUpdate(existing, { body: { text: 'revised' } })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBeUndefined();\n      });\n    });\n\n    test('preserves an explicit null embeddingRef when the patch does not touch it', () => {\n      const existing = makeRecord({ embeddingRef: null });\n      expect(policy.applyUpdate(existing, { body: { text: 'revised' } })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBeNull();\n      });\n    });\n\n    test('ignores patch keys outside the mutable surface', () => {\n      const existing = makeRecord();\n      expect(\n        policy.applyUpdate(existing, { id: 'tampered', created: 9999, body: { text: 'revised' } })\n      ).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.id).toBe('intro-to-rust');\n        expect(updated.envelope.created).toBe(1000);\n        expect(updated.body).toEqual({ title: 'Intro', text: 'revised' });\n      });\n    });\n\n    test('preserves identity and transaction-time envelope fields', () => {\n      const existing = makeRecord();\n      expect(policy.applyUpdate(existing, { tags: ['updated'] })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.id).toBe('intro-to-rust');\n        expect(updated.envelope.entityId).toBe('intro-to-rust');\n        expect(updated.envelope.kind).toBe('knowledge');\n        expect(updated.envelope.created).toBe(1000);\n        expect(updated.envelope.seq).toBe(1);\n        expect(updated.envelope.contentHash).toBe('hash-1');\n      });\n    });\n\n    test('fails when a patch deletes a required mutable field', () => {\n      const existing = makeRecord();\n      expect(policy.applyUpdate(existing, { body: null })).toFailWith(\n        /may not delete required field\\(s\\): body/i\n      );\n    });\n  });\n});\n\ndescribe('MemoryCapCullPolicy', () => {\n  const memoryFields: ReadonlyArray<string> = ['body', 'tags', 'links', 'provenance', 'embeddingRef'];\n\n  /** Build a memory record with a distinct id and creation time. */\n  function memoryRecord(id: string, created: number, body?: unknown): IMemoryRecord<unknown> {\n    return makeRecord(\n      {\n        id: id as MemoryId,\n        entityId: id as EntityId,\n        kind: 'summarized-turn' as Kind,\n        created,\n        updated: created\n      },\n      body\n    );\n  }\n\n  test('create succeeds and exposes the supplied mutable surface + entity dedup scope', () => {\n    const policy = MemoryCapCullPolicy.create({ maxRecords: 3, mutableFields: memoryFields }).orThrow();\n    expect(policy.mutableFields).toEqual(memoryFields);\n    expect(policy.dedupScope).toBe('entity');\n  });\n\n  describe('admit', () => {\n    test('accepts unconditionally when no cap is configured', () => {\n      const policy = MemoryCapCullPolicy.create({ mutableFields: memoryFields }).orThrow();\n      const cohort = [memoryRecord('turn-0', 1), memoryRecord('turn-1', 2), memoryRecord('turn-2', 3)];\n      expect(policy.admit(memoryRecord('turn-3', 4), cohort)).toSucceedWith({ decision: 'accept' });\n    });\n\n    test('accepts while the cohort is below the cap', () => {\n      const policy = MemoryCapCullPolicy.create({ maxRecords: 3, mutableFields: memoryFields }).orThrow();\n      const cohort = [memoryRecord('turn-0', 1), memoryRecord('turn-1', 2)];\n      expect(policy.admit(memoryRecord('turn-2', 3), cohort)).toSucceedWith({ decision: 'accept' });\n    });\n\n    test('culls the single oldest (by created ascending) when the cohort is at the cap', () => {\n      const policy = MemoryCapCullPolicy.create({ maxRecords: 3, mutableFields: memoryFields }).orThrow();\n      // Deliberately out of created order to prove the sort, not the input order.\n      const cohort = [memoryRecord('turn-c', 30), memoryRecord('turn-a', 10), memoryRecord('turn-b', 20)];\n      expect(policy.admit(memoryRecord('turn-new', 40), cohort)).toSucceedWith({\n        decision: 'cull-oldest',\n        evict: ['turn-a' as MemoryId]\n      });\n    });\n\n    test('culls enough oldest records to land exactly at the cap when over it', () => {\n      const policy = MemoryCapCullPolicy.create({ maxRecords: 2, mutableFields: memoryFields }).orThrow();\n      const cohort = [\n        memoryRecord('turn-a', 10),\n        memoryRecord('turn-b', 20),\n        memoryRecord('turn-c', 30),\n        memoryRecord('turn-d', 40)\n      ];\n      // cohort 4, cap 2 → evict 4 - 2 + 1 = 3 oldest, leaving 1 + the incoming = 2.\n      expect(policy.admit(memoryRecord('turn-new', 50), cohort)).toSucceedWith({\n        decision: 'cull-oldest',\n        evict: ['turn-a' as MemoryId, 'turn-b' as MemoryId, 'turn-c' as MemoryId]\n      });\n    });\n  });\n\n  describe('applyUpdate', () => {\n    let policy: MemoryCapCullPolicy;\n\n    beforeEach(() => {\n      policy = MemoryCapCullPolicy.create({ maxRecords: 5, mutableFields: memoryFields }).orThrow();\n    });\n\n    test('deep-merges a body change over the declared mutable surface', () => {\n      const existing = memoryRecord('turn-0', 1, { summary: 'first draft', turn: 0 });\n      expect(policy.applyUpdate(existing, { body: { summary: 'revised' } })).toSucceedAndSatisfy(\n        (updated) => {\n          expect(updated.body).toEqual({ summary: 'revised', turn: 0 });\n        }\n      );\n    });\n\n    test('replaces arrays wholesale (RFC-7386 array semantics)', () => {\n      const existing = makeRecord({\n        id: 'turn-0' as MemoryId,\n        kind: 'summarized-turn' as Kind,\n        tags: ['draft', 'pending'] as Tag[]\n      });\n      expect(policy.applyUpdate(existing, { tags: ['final'] })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.tags).toEqual(['final']);\n      });\n    });\n\n    test('sets embeddingRef when present in the patch', () => {\n      const existing = makeRecord({\n        id: 'turn-0' as MemoryId,\n        kind: 'summarized-turn' as Kind,\n        embeddingRef: 'vec-1'\n      });\n      expect(policy.applyUpdate(existing, { embeddingRef: 'vec-2' })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBe('vec-2');\n      });\n    });\n\n    test('clears embeddingRef (to absent) when the patch deletes it (null = delete)', () => {\n      const existing = makeRecord({\n        id: 'turn-0' as MemoryId,\n        kind: 'summarized-turn' as Kind,\n        embeddingRef: 'vec-1'\n      });\n      expect(policy.applyUpdate(existing, { embeddingRef: null })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBeUndefined();\n      });\n    });\n\n    test('fails when a patch deletes a required mutable field', () => {\n      const existing = memoryRecord('turn-0', 1);\n      expect(policy.applyUpdate(existing, { tags: null })).toFailWith(\n        /may not delete required field\\(s\\): tags/i\n      );\n    });\n\n    test('preserves a field that is not declared mutable', () => {\n      // mutableFields omits 'links', so a links patch is ignored and the\n      // existing links are preserved verbatim.\n      const narrow = MemoryCapCullPolicy.create({ maxRecords: 5, mutableFields: ['body'] }).orThrow();\n      const existing = makeRecord(\n        {\n          id: 'turn-0' as MemoryId,\n          kind: 'summarized-turn' as Kind,\n          links: [{ type: 'derived-from' as never, target: 'doc-1' as MemoryId }]\n        },\n        { summary: 'old' }\n      );\n      expect(narrow.applyUpdate(existing, { body: { summary: 'x' }, links: [] })).toSucceedAndSatisfy(\n        (updated) => {\n          expect(updated.envelope.links).toEqual([{ type: 'derived-from', target: 'doc-1' }]);\n          expect(updated.body).toEqual({ summary: 'x' });\n        }\n      );\n    });\n\n    test('preserves the body when body is not a declared mutable field', () => {\n      // mutableFields is tags-only: a body patch is ignored and the existing\n      // body is preserved verbatim (the `else existing.body` rebuild branch).\n      const tagsOnly = MemoryCapCullPolicy.create({ maxRecords: 5, mutableFields: ['tags'] }).orThrow();\n      const existing = makeRecord(\n        { id: 'turn-0' as MemoryId, kind: 'summarized-turn' as Kind, tags: ['old'] as Tag[] },\n        { summary: 'keep me' }\n      );\n      expect(\n        tagsOnly.applyUpdate(existing, { tags: ['new'], body: { summary: 'ignored' } })\n      ).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.tags).toEqual(['new']);\n        expect(updated.body).toEqual({ summary: 'keep me' });\n      });\n    });\n\n    test('preserves an absent embeddingRef as absent on an unrelated update (hash-stable)', () => {\n      const existing = memoryRecord('turn-0', 1, { summary: 's' });\n      expect(policy.applyUpdate(existing, { body: { summary: 't' } })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBeUndefined();\n      });\n    });\n\n    test('preserves embeddingRef when it is not in the declared mutable surface', () => {\n      const narrow = MemoryCapCullPolicy.create({ maxRecords: 5, mutableFields: ['body'] }).orThrow();\n      const existing = makeRecord({\n        id: 'turn-0' as MemoryId,\n        kind: 'summarized-turn' as Kind,\n        embeddingRef: 'vec-keep'\n      });\n      expect(narrow.applyUpdate(existing, { body: { summary: 'x' } })).toSucceedAndSatisfy((updated) => {\n        expect(updated.envelope.embeddingRef).toBe('vec-keep');\n      });\n    });\n  });\n});\n"]}

package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts

@@ -0,0 +1,2 @@
+import '@fgv/ts-utils-jest';
+//# sourceMappingURL=inMemoryCosineIndex.test.d.ts.map

package/lib/test/unit/vector/inMemoryCosineIndex.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryCosineIndex.test.d.ts","sourceRoot":"","sources":["../../../../src/test/unit/vector/inMemoryCosineIndex.test.ts"],"names":[],"mappings":"AAKA,OAAO,oBAAoB,CAAC"}

package/lib/test/unit/vector/inMemoryCosineIndex.test.js

@@ -0,0 +1,194 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+require("@fgv/ts-utils-jest");
+const ts_utils_1 = require("@fgv/ts-utils");
+const index_1 = require("../../../index");
+/** A trivial record carrying just the id + a marker body, for rebuild tests. */
+function record(id, body = `body-${id}`) {
+    return {
+        // The cosine index only reads `envelope.id`; a minimal envelope suffices.
+        envelope: { id: id },
+        body
+    };
+}
+/** A scripted record source for `rebuild`. */
+class FakeSource {
+    constructor(result) {
+        this._result = result;
+    }
+    list() {
+        return Promise.resolve(this._result);
+    }
+}
+describe('InMemoryCosineIndex', () => {
+    describe('add', () => {
+        test('returns the id as the embedding ref and tracks size', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(index.size).toBe(0);
+            expect(await index.add('a', Float32Array.from([1, 0]))).toSucceedWith('a');
+            expect(index.size).toBe(1);
+        });
+        test('replaces the vector on a same-id add', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(await index.add('a', Float32Array.from([1, 0]))).toSucceed();
+            expect(await index.add('a', Float32Array.from([0, 1]))).toSucceed();
+            expect(index.size).toBe(1);
+            // The query now matches the replacement vector ([0,1]) not the original.
+            expect(await index.query(Float32Array.from([0, 1]), 1)).toSucceedAndSatisfy((hits) => {
+                expect(hits[0].score).toBeCloseTo(1);
+            });
+        });
+        test('fails loudly on an empty vector', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(await index.add('a', new Float32Array(0))).toFailWith(/empty vector/i);
+        });
+        test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            const buffer = Float32Array.from([1, 0]);
+            (await index.add('a', buffer)).orThrow();
+            // Mutate the caller's buffer after the add; the stored vector must be unaffected.
+            buffer[0] = 0;
+            buffer[1] = 1;
+            expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy((hits) => {
+                // Still maximally similar to [1,0] — proves the index kept its own copy.
+                expect(hits[0].score).toBeCloseTo(1);
+            });
+        });
+        test('fails loudly on a dimension mismatch against the established dimension', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(await index.add('a', Float32Array.from([1, 0]))).toSucceed();
+            expect(await index.add('b', Float32Array.from([1, 0, 0]))).toFailWith(/dimension 3 does not match index dimension 2/i);
+        });
+    });
+    describe('query', () => {
+        async function seeded() {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            (await index.add('a', Float32Array.from([1, 0]))).orThrow();
+            (await index.add('b', Float32Array.from([0, 1]))).orThrow();
+            (await index.add('c', Float32Array.from([1, 1]))).orThrow();
+            return index;
+        }
+        test('returns hits in descending cosine-similarity order', async () => {
+            const index = await seeded();
+            expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy((hits) => {
+                expect(hits.map((h) => h.id)).toEqual(['a', 'c', 'b']);
+                expect(hits[0].score).toBeCloseTo(1);
+                expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));
+                expect(hits[2].score).toBeCloseTo(0);
+            });
+        });
+        test('truncates to topK', async () => {
+            const index = await seeded();
+            expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
+                expect(hits.map((h) => h.id)).toEqual(['a', 'c']);
+            });
+        });
+        test('returns empty for a non-positive topK', async () => {
+            const index = await seeded();
+            expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);
+            expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);
+        });
+        test('returns empty when the index is empty (no dimension check)', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);
+        });
+        test('fails loudly on a query-dimension mismatch', async () => {
+            const index = await seeded();
+            expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(/query dimension 3 does not match index dimension 2/i);
+        });
+        test('scores a degenerate (zero-magnitude) stored vector as 0 rather than NaN', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            (await index.add('zero', Float32Array.from([0, 0]))).orThrow();
+            (await index.add('unit', Float32Array.from([1, 0]))).orThrow();
+            expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy((hits) => {
+                expect(hits.map((h) => h.id)).toEqual(['unit', 'zero']);
+                expect(hits[1].score).toBe(0);
+            });
+        });
+        test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            (await index.add('unit', Float32Array.from([1, 0]))).orThrow();
+            expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy((hits) => {
+                expect(hits[0].score).toBe(0);
+            });
+        });
+    });
+    describe('remove', () => {
+        test('removes a vector and is reflected in subsequent queries', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            (await index.add('a', Float32Array.from([1, 0]))).orThrow();
+            (await index.add('b', Float32Array.from([0, 1]))).orThrow();
+            expect(await index.remove('a')).toSucceedWith('a');
+            expect(index.size).toBe(1);
+            expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy((hits) => {
+                expect(hits.map((h) => h.id)).toEqual(['b']);
+            });
+        });
+        test('is idempotent — removing an absent id still succeeds', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            expect(await index.remove('missing')).toSucceedWith('missing');
+        });
+    });
+    describe('rebuild', () => {
+        const embed = (r) => {
+            // Deterministic: encode the id's first char code into a 2-vector.
+            const code = r.envelope.id.charCodeAt(0);
+            return Promise.resolve((0, ts_utils_1.succeed)(Float32Array.from([code, 1])));
+        };
+        test('re-embeds every record from the source and reports the count', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            const source = new FakeSource((0, ts_utils_1.succeed)([record('a'), record('b'), record('c')]));
+            expect(await index.rebuild(source, embed)).toSucceedWith(3);
+            expect(index.size).toBe(3);
+            expect(await index.query(Float32Array.from([99, 1]), 1)).toSucceedAndSatisfy((hits) => {
+                // 'c' = char code 99, the closest to the query vector.
+                expect(hits[0].id).toBe('c');
+            });
+        });
+        test('clears prior contents and re-establishes the dimension', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            // Seed a 3-dim vector, then rebuild with a 2-dim embedder.
+            (await index.add('old', Float32Array.from([1, 2, 3]))).orThrow();
+            const source = new FakeSource((0, ts_utils_1.succeed)([record('a')]));
+            expect(await index.rebuild(source, embed)).toSucceedWith(1);
+            expect(index.size).toBe(1);
+            // The 2-dim query now succeeds (dimension was reset by rebuild).
+            expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();
+        });
+        test('fails loudly when the source list fails', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            // Seed an entry so the reset-before-list rollback is observable, not just "stayed empty".
+            (await index.add('seed', Float32Array.from([1, 1]))).orThrow();
+            const source = new FakeSource((0, ts_utils_1.fail)('disk gone'));
+            expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);
+            expect(index.size).toBe(0);
+        });
+        test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            // Seed an existing entry so the rollback (not merely "stayed empty") is observable.
+            (await index.add('seed', Float32Array.from([1, 1]))).orThrow();
+            // First record embeds fine, the second fails — so a naive impl would leave
+            // record 'a' indexed; the rollback must clear it.
+            let calls = 0;
+            const flakyEmbed = (r) => {
+                calls += 1;
+                return Promise.resolve(calls === 1 ? (0, ts_utils_1.succeed)(Float32Array.from([1, 1])) : (0, ts_utils_1.fail)('no model'));
+            };
+            const source = new FakeSource((0, ts_utils_1.succeed)([record('a'), record('b')]));
+            expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'b' failed: no model/i);
+            expect(index.size).toBe(0);
+        });
+        test('fails loudly and rolls back to empty when adding an embedded vector fails', async () => {
+            const index = index_1.InMemoryCosineIndex.create().orThrow();
+            const source = new FakeSource((0, ts_utils_1.succeed)([record('a')]));
+            const emptyEmbed = () => Promise.resolve((0, ts_utils_1.succeed)(new Float32Array(0)));
+            expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty vector/i);
+            expect(index.size).toBe(0);
+        });
+    });
+});
+//# sourceMappingURL=inMemoryCosineIndex.test.js.map

package/lib/test/unit/vector/inMemoryCosineIndex.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inMemoryCosineIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/inMemoryCosineIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAsD;AACtD,0CAMwB;AAExB,gFAAgF;AAChF,SAAS,MAAM,CAAC,EAAU,EAAE,OAAe,QAAQ,EAAE,EAAE;IACrD,OAAO;QACL,0EAA0E;QAC1E,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAc,EAAwC;QACtE,IAAI;KACL,CAAC;AACJ,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU;IAEd,YAAmB,MAAqD;QACtE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACM,IAAI;QACT,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;CACF;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACnB,IAAI,CAAC,qDAAqD,EAAE,KAAK,IAAI,EAAE;YACrE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;YACvF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;YACtD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,yEAAyE;YACzE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;YACjD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;QAC5F,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2FAA2F,EAAE,KAAK,IAAI,EAAE;YAC3G,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACrD,kFAAkF;YAClF,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,yEAAyE;gBACzE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wEAAwE,EAAE,KAAK,IAAI,EAAE;YACxF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAC/E,+CAA+C,CAChD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,KAAK,UAAU,MAAM;YACnB,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;YACpE,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBACvD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACrC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mBAAmB,EAAE,KAAK,IAAI,EAAE;YACnC,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;YACvD,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;YAC1E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAC7E,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4DAA4D,EAAE,KAAK,IAAI,EAAE;YAC5E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4CAA4C,EAAE,KAAK,IAAI,EAAE;YAC5D,MAAM,KAAK,GAAG,MAAM,MAAM,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,CACnE,qDAAqD,CACtD,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;gBACxD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yEAAyE,EAAE,KAAK,IAAI,EAAE;YACzF,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChC,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACtB,IAAI,CAAC,yDAAyD,EAAE,KAAK,IAAI,EAAE;YACzE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxE,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,GAAe,CAAC,CAAC,CAAC,aAAa,CAAC,GAAe,CAAC,CAAC;YAC3E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CACzE,CAAC,IAAoC,EAAE,EAAE;gBACvC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sDAAsD,EAAE,KAAK,IAAI,EAAE;YACtE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,SAAqB,CAAC,CAAC,CAAC,aAAa,CAAC,SAAqB,CAAC,CAAC;QACzF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACvB,MAAM,KAAK,GAAG,CAAC,CAAyB,EAAiC,EAAE;YACzE,kEAAkE;YAClE,MAAM,IAAI,GAAY,CAAC,CAAC,QAAQ,CAAC,EAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7D,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC;QAEF,IAAI,CAAC,8DAA8D,EAAE,KAAK,IAAI,EAAE;YAC9E,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC1E,CAAC,IAAoC,EAAE,EAAE;gBACvC,uDAAuD;gBACvD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC,CACF,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wDAAwD,EAAE,KAAK,IAAI,EAAE;YACxE,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,2DAA2D;YAC3D,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,KAAiB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC7E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5D,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC3B,iEAAiE;YACjE,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yCAAyC,EAAE,KAAK,IAAI,EAAE;YACzD,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,0FAA0F;YAC1F,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,eAAI,EAAC,WAAW,CAAC,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,oCAAoC,CAAC,CAAC;YAC5F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0EAA0E,EAAE,KAAK,IAAI,EAAE;YAC1F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,oFAAoF;YACpF,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,MAAkB,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAC3E,2EAA2E;YAC3E,kDAAkD;YAClD,IAAI,KAAK,GAAW,CAAC,CAAC;YACtB,MAAM,UAAU,GAAG,CAAC,CAAyB,EAAiC,EAAE;gBAC9E,KAAK,IAAI,CAAC,CAAC;gBACX,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAA,kBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,eAAI,EAAC,UAAU,CAAC,CAAC,CAAC;YAC9F,CAAC,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,iCAAiC,CAAC,CAAC;YAC9F,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,2EAA2E,EAAE,KAAK,IAAI,EAAE;YAC3F,MAAM,KAAK,GAAG,2BAAmB,CAAC,MAAM,EAAE,CAAC,OAAO,EAAE,CAAC;YACrD,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,IAAA,kBAAO,EAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,MAAM,UAAU,GAAG,GAAkC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;YAC5E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,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 { Result, fail, succeed } from '@fgv/ts-utils';\nimport {\n  IMemoryRecord,\n  IMemoryRecordSource,\n  IVectorQueryHit,\n  InMemoryCosineIndex,\n  MemoryId\n} from '../../../index';\n\n/** A trivial record carrying just the id + a marker body, for rebuild tests. */\nfunction record(id: string, body: string = `body-${id}`): IMemoryRecord<unknown> {\n  return {\n    // The cosine index only reads `envelope.id`; a minimal envelope suffices.\n    envelope: { id: id as MemoryId } as IMemoryRecord<unknown>['envelope'],\n    body\n  };\n}\n\n/** A scripted record source for `rebuild`. */\nclass FakeSource implements IMemoryRecordSource {\n  private readonly _result: Result<ReadonlyArray<IMemoryRecord<unknown>>>;\n  public constructor(result: Result<ReadonlyArray<IMemoryRecord<unknown>>>) {\n    this._result = result;\n  }\n  public list(): Promise<Result<ReadonlyArray<IMemoryRecord<unknown>>>> {\n    return Promise.resolve(this._result);\n  }\n}\n\ndescribe('InMemoryCosineIndex', () => {\n  describe('add', () => {\n    test('returns the id as the embedding ref and tracks size', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(index.size).toBe(0);\n      expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceedWith('a');\n      expect(index.size).toBe(1);\n    });\n\n    test('replaces the vector on a same-id add', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceed();\n      expect(await index.add('a' as MemoryId, Float32Array.from([0, 1]))).toSucceed();\n      expect(index.size).toBe(1);\n      // The query now matches the replacement vector ([0,1]) not the original.\n      expect(await index.query(Float32Array.from([0, 1]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].score).toBeCloseTo(1);\n        }\n      );\n    });\n\n    test('fails loudly on an empty vector', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(await index.add('a' as MemoryId, new Float32Array(0))).toFailWith(/empty vector/i);\n    });\n\n    test('stores a defensive copy — mutating the caller buffer after add does not corrupt the index', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      const buffer = Float32Array.from([1, 0]);\n      (await index.add('a' as MemoryId, buffer)).orThrow();\n      // Mutate the caller's buffer after the add; the stored vector must be unaffected.\n      buffer[0] = 0;\n      buffer[1] = 1;\n      expect(await index.query(Float32Array.from([1, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          // Still maximally similar to [1,0] — proves the index kept its own copy.\n          expect(hits[0].score).toBeCloseTo(1);\n        }\n      );\n    });\n\n    test('fails loudly on a dimension mismatch against the established dimension', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(await index.add('a' as MemoryId, Float32Array.from([1, 0]))).toSucceed();\n      expect(await index.add('b' as MemoryId, Float32Array.from([1, 0, 0]))).toFailWith(\n        /dimension 3 does not match index dimension 2/i\n      );\n    });\n  });\n\n  describe('query', () => {\n    async function seeded(): Promise<InMemoryCosineIndex> {\n      const index = InMemoryCosineIndex.create().orThrow();\n      (await index.add('a' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n      (await index.add('b' as MemoryId, Float32Array.from([0, 1]))).orThrow();\n      (await index.add('c' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n      return index;\n    }\n\n    test('returns hits in descending cosine-similarity order', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 3)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.id)).toEqual(['a', 'c', 'b']);\n          expect(hits[0].score).toBeCloseTo(1);\n          expect(hits[1].score).toBeCloseTo(1 / Math.sqrt(2));\n          expect(hits[2].score).toBeCloseTo(0);\n        }\n      );\n    });\n\n    test('truncates to topK', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.id)).toEqual(['a', 'c']);\n        }\n      );\n    });\n\n    test('returns empty for a non-positive topK', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0]), 0)).toSucceedWith([]);\n      expect(await index.query(Float32Array.from([1, 0]), -1)).toSucceedWith([]);\n    });\n\n    test('returns empty when the index is empty (no dimension check)', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(await index.query(Float32Array.from([1, 2, 3, 4]), 5)).toSucceedWith([]);\n    });\n\n    test('fails loudly on a query-dimension mismatch', async () => {\n      const index = await seeded();\n      expect(await index.query(Float32Array.from([1, 0, 0]), 3)).toFailWith(\n        /query dimension 3 does not match index dimension 2/i\n      );\n    });\n\n    test('scores a degenerate (zero-magnitude) stored vector as 0 rather than NaN', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      (await index.add('zero' as MemoryId, Float32Array.from([0, 0]))).orThrow();\n      (await index.add('unit' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n      expect(await index.query(Float32Array.from([1, 0]), 2)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.id)).toEqual(['unit', 'zero']);\n          expect(hits[1].score).toBe(0);\n        }\n      );\n    });\n\n    test('scores against a degenerate (zero-magnitude) query as 0 rather than NaN', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      (await index.add('unit' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n      expect(await index.query(Float32Array.from([0, 0]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits[0].score).toBe(0);\n        }\n      );\n    });\n  });\n\n  describe('remove', () => {\n    test('removes a vector and is reflected in subsequent queries', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      (await index.add('a' as MemoryId, Float32Array.from([1, 0]))).orThrow();\n      (await index.add('b' as MemoryId, Float32Array.from([0, 1]))).orThrow();\n      expect(await index.remove('a' as MemoryId)).toSucceedWith('a' as MemoryId);\n      expect(index.size).toBe(1);\n      expect(await index.query(Float32Array.from([1, 0]), 5)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          expect(hits.map((h) => h.id)).toEqual(['b']);\n        }\n      );\n    });\n\n    test('is idempotent — removing an absent id still succeeds', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      expect(await index.remove('missing' as MemoryId)).toSucceedWith('missing' as MemoryId);\n    });\n  });\n\n  describe('rebuild', () => {\n    const embed = (r: IMemoryRecord<unknown>): Promise<Result<Float32Array>> => {\n      // Deterministic: encode the id's first char code into a 2-vector.\n      const code: number = (r.envelope.id as string).charCodeAt(0);\n      return Promise.resolve(succeed(Float32Array.from([code, 1])));\n    };\n\n    test('re-embeds every record from the source and reports the count', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      const source = new FakeSource(succeed([record('a'), record('b'), record('c')]));\n      expect(await index.rebuild(source, embed)).toSucceedWith(3);\n      expect(index.size).toBe(3);\n      expect(await index.query(Float32Array.from([99, 1]), 1)).toSucceedAndSatisfy(\n        (hits: ReadonlyArray<IVectorQueryHit>) => {\n          // 'c' = char code 99, the closest to the query vector.\n          expect(hits[0].id).toBe('c');\n        }\n      );\n    });\n\n    test('clears prior contents and re-establishes the dimension', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      // Seed a 3-dim vector, then rebuild with a 2-dim embedder.\n      (await index.add('old' as MemoryId, Float32Array.from([1, 2, 3]))).orThrow();\n      const source = new FakeSource(succeed([record('a')]));\n      expect(await index.rebuild(source, embed)).toSucceedWith(1);\n      expect(index.size).toBe(1);\n      // The 2-dim query now succeeds (dimension was reset by rebuild).\n      expect(await index.query(Float32Array.from([97, 1]), 1)).toSucceed();\n    });\n\n    test('fails loudly when the source list fails', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      // Seed an entry so the reset-before-list rollback is observable, not just \"stayed empty\".\n      (await index.add('seed' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n      const source = new FakeSource(fail('disk gone'));\n      expect(await index.rebuild(source, embed)).toFailWith(/failed to list records: disk gone/i);\n      expect(index.size).toBe(0);\n    });\n\n    test('fails loudly and rolls back to empty when an embedding fails mid-rebuild', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      // Seed an existing entry so the rollback (not merely \"stayed empty\") is observable.\n      (await index.add('seed' as MemoryId, Float32Array.from([1, 1]))).orThrow();\n      // First record embeds fine, the second fails — so a naive impl would leave\n      // record 'a' indexed; the rollback must clear it.\n      let calls: number = 0;\n      const flakyEmbed = (r: IMemoryRecord<unknown>): Promise<Result<Float32Array>> => {\n        calls += 1;\n        return Promise.resolve(calls === 1 ? succeed(Float32Array.from([1, 1])) : fail('no model'));\n      };\n      const source = new FakeSource(succeed([record('a'), record('b')]));\n      expect(await index.rebuild(source, flakyEmbed)).toFailWith(/embedding 'b' failed: no model/i);\n      expect(index.size).toBe(0);\n    });\n\n    test('fails loudly and rolls back to empty when adding an embedded vector fails', async () => {\n      const index = InMemoryCosineIndex.create().orThrow();\n      const source = new FakeSource(succeed([record('a')]));\n      const emptyEmbed = (): Promise<Result<Float32Array>> => Promise.resolve(succeed(new Float32Array(0)));\n      expect(await index.rebuild(source, emptyEmbed)).toFailWith(/empty vector/i);\n      expect(index.size).toBe(0);\n    });\n  });\n});\n"]}

package/lib/test/unit/vector/vectorIndex.test.d.ts

@@ -0,0 +1,2 @@
+import '@fgv/ts-utils-jest';
+//# sourceMappingURL=vectorIndex.test.d.ts.map

package/lib/test/unit/vector/vectorIndex.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectorIndex.test.d.ts","sourceRoot":"","sources":["../../../../src/test/unit/vector/vectorIndex.test.ts"],"names":[],"mappings":"AAKA,OAAO,oBAAoB,CAAC"}

package/lib/test/unit/vector/vectorIndex.test.js

@@ -0,0 +1,44 @@
+"use strict";
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+require("@fgv/ts-utils-jest");
+const ts_utils_1 = require("@fgv/ts-utils");
+/**
+ * A trivial conforming implementation, present to verify the {@link IVectorIndex}
+ * seam is usable end-to-end (the in-package cosine impl is a post-v1 fast-follow).
+ */
+class StubVectorIndex {
+    constructor() {
+        this._vectors = new Map();
+    }
+    add(id, vector) {
+        this._vectors.set(id, vector);
+        return Promise.resolve((0, ts_utils_1.succeed)(`ref-${id}`));
+    }
+    remove(id) {
+        this._vectors.delete(id);
+        return Promise.resolve((0, ts_utils_1.succeed)(id));
+    }
+    query(vector, topK) {
+        const hits = Array.from(this._vectors.keys())
+            .map((id) => ({ id, score: vector.length }))
+            .slice(0, topK);
+        return Promise.resolve((0, ts_utils_1.succeed)(hits));
+    }
+}
+describe('IVectorIndex seam', () => {
+    test('a conforming implementation supports add / query / remove', async () => {
+        const index = new StubVectorIndex();
+        expect(await index.add('a', Float32Array.from([1, 2, 3]))).toSucceedWith('ref-a');
+        expect(await index.add('b', Float32Array.from([4, 5, 6]))).toSucceedWith('ref-b');
+        expect(await index.query(Float32Array.from([0.1, 0.2]), 1)).toSucceedAndSatisfy((hits) => {
+            expect(hits).toHaveLength(1);
+            expect(hits[0].score).toBe(2);
+        });
+        expect(await index.remove('a')).toSucceedWith('a');
+    });
+});
+//# sourceMappingURL=vectorIndex.test.js.map

package/lib/test/unit/vector/vectorIndex.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vectorIndex.test.js","sourceRoot":"","sources":["../../../../src/test/unit/vector/vectorIndex.test.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,8BAA4B;AAC5B,4CAAgD;AAGhD;;;GAGG;AACH,MAAM,eAAe;IAArB;QACmB,aAAQ,GAAgC,IAAI,GAAG,EAAE,CAAC;IAkBrE,CAAC;IAhBQ,GAAG,CAAC,EAAY,EAAE,MAAoB;QAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC9B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,MAAM,CAAC,EAAY;QACxB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACzB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK,CAAC,MAAoB,EAAE,IAAY;QAC7C,MAAM,IAAI,GAAsB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;aAC7D,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;aAC3C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAA,kBAAO,EAAC,IAAI,CAAC,CAAC,CAAC;IACxC,CAAC;CACF;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,2DAA2D,EAAE,KAAK,IAAI,EAAE;QAC3E,MAAM,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QACpC,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC9F,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,CAAC,GAAe,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC9F,MAAM,CAAC,MAAM,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAC7E,CAAC,IAAoC,EAAE,EAAE;YACvC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC,CACF,CAAC;QACF,MAAM,CAAC,MAAM,KAAK,CAAC,MAAM,CAAC,GAAe,CAAC,CAAC,CAAC,aAAa,CAAC,GAAe,CAAC,CAAC;IAC7E,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, succeed } from '@fgv/ts-utils';\nimport { IVectorIndex, IVectorQueryHit, MemoryId } from '../../../index';\n\n/**\n * A trivial conforming implementation, present to verify the {@link IVectorIndex}\n * seam is usable end-to-end (the in-package cosine impl is a post-v1 fast-follow).\n */\nclass StubVectorIndex implements IVectorIndex {\n  private readonly _vectors: Map<MemoryId, Float32Array> = new Map();\n\n  public add(id: MemoryId, vector: Float32Array): Promise<Result<string>> {\n    this._vectors.set(id, vector);\n    return Promise.resolve(succeed(`ref-${id}`));\n  }\n\n  public remove(id: MemoryId): Promise<Result<MemoryId>> {\n    this._vectors.delete(id);\n    return Promise.resolve(succeed(id));\n  }\n\n  public query(vector: Float32Array, topK: number): Promise<Result<ReadonlyArray<IVectorQueryHit>>> {\n    const hits: IVectorQueryHit[] = Array.from(this._vectors.keys())\n      .map((id) => ({ id, score: vector.length }))\n      .slice(0, topK);\n    return Promise.resolve(succeed(hits));\n  }\n}\n\ndescribe('IVectorIndex seam', () => {\n  test('a conforming implementation supports add / query / remove', async () => {\n    const index = new StubVectorIndex();\n    expect(await index.add('a' as MemoryId, Float32Array.from([1, 2, 3]))).toSucceedWith('ref-a');\n    expect(await index.add('b' as MemoryId, Float32Array.from([4, 5, 6]))).toSucceedWith('ref-b');\n    expect(await index.query(Float32Array.from([0.1, 0.2]), 1)).toSucceedAndSatisfy(\n      (hits: ReadonlyArray<IVectorQueryHit>) => {\n        expect(hits).toHaveLength(1);\n        expect(hits[0].score).toBe(2);\n      }\n    );\n    expect(await index.remove('a' as MemoryId)).toSucceedWith('a' as MemoryId);\n  });\n});\n"]}

package/package.json

@@ -0,0 +1,81 @@
+{
+  "name": "@fgv/ts-agent-memory",
+  "version": "5.1.0-36",
+  "description": "FileTree-backed storage and retrieval substrate for agent memory and knowledge",
+  "main": "lib/index.js",
+  "types": "dist/ts-agent-memory.d.ts",
+  "exports": {
+    ".": {
+      "node": {
+        "import": "./lib/index.js",
+        "require": "./lib/index.js"
+      },
+      "default": "./lib/index.js",
+      "types": "./dist/ts-agent-memory.d.ts"
+    }
+  },
+  "scripts": {
+    "build": "heft build --clean",
+    "clean": "heft clean",
+    "test": "heft test --clean",
+    "test-handles": "jest --runInBand --detectOpenHandles",
+    "clean-jest": "jest --clear-cache",
+    "coverage": "jest --coverage",
+    "lint": "eslint src --ext .ts",
+    "fixlint": "eslint src --ext .ts --fix"
+  },
+  "sideEffects": false,
+  "keywords": [
+    "typescript",
+    "memory",
+    "knowledge",
+    "agent",
+    "filetree",
+    "vault"
+  ],
+  "author": "Erik Fortune",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/ErikFortune/fgv/issues"
+  },
+  "homepage": "https://github.com/ErikFortune/fgv/tree/main/libraries/ts-agent-memory#readme",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/ErikFortune/fgv.git"
+  },
+  "dependencies": {
+    "tslib": "^2.8.1",
+    "@fgv/ts-extras": "workspace:*",
+    "@fgv/ts-json": "workspace:*",
+    "@fgv/ts-json-base": "workspace:*",
+    "@fgv/ts-utils": "workspace:*"
+  },
+  "devDependencies": {
+    "@fgv/heft-dual-rig": "workspace:*",
+    "@fgv/ts-utils-jest": "workspace:*",
+    "@microsoft/api-extractor": "^7.55.2",
+    "@types/jest": "^29.5.14",
+    "@types/node": "^20.14.9",
+    "@typescript-eslint/eslint-plugin": "^8.52.0",
+    "@typescript-eslint/parser": "^8.52.0",
+    "eslint": "^9.39.2",
+    "eslint-config-prettier": "^10.1.8",
+    "eslint-plugin-import": "^2.32.0",
+    "eslint-plugin-node": "^11.1.0",
+    "eslint-plugin-prettier": "^5.5.4",
+    "eslint-plugin-promise": "^7.2.1",
+    "jest": "^29.7.0",
+    "prettier": "^3.7.4",
+    "rimraf": "^6.1.2",
+    "ts-jest": "^29.4.6",
+    "ts-node": "^10.9.2",
+    "typescript": "5.9.3",
+    "eslint-plugin-n": "^17.23.1",
+    "@rushstack/eslint-config": "4.6.4",
+    "@rushstack/heft": "1.2.7",
+    "@rushstack/heft-jest-plugin": "1.2.6",
+    "@rushstack/heft-node-rig": "2.11.27",
+    "@types/heft-jest": "1.0.6",
+    "eslint-plugin-tsdoc": "~0.5.2"
+  }
+}

package/rush-logs/ts-agent-memory.build.cache.log

@@ -0,0 +1,3 @@
+Caching build output folders: dist, lib, temp, .rush/temp/operation/build
+Successfully set cache entry.
+Cache key: f6a88bfdd66517ccb98c2c7ae1be6e6fe9e15d38

package/rush-logs/ts-agent-memory.build.log

@@ -0,0 +1,9 @@
+Invoking: heft build --clean 
+ ---- build started ---- 
+[build:typescript] The TypeScript compiler version 5.9.3 is newer than the latest version that was tested with Heft (5.8); it may not work correctly.
+[build:typescript] Using TypeScript version 5.9.3
+[build:lint] Using ESLint version 9.39.4
+[build:api-extractor] Using API Extractor version 7.58.7
+[build:api-extractor] Analysis will use the bundled TypeScript version 5.9.3
+ ---- build finished (5.889s) ---- 
+-------------------- Finished (5.89s) --------------------

package/src/index.ts

@@ -0,0 +1,12 @@
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+
+export * from './packlets/types';
+export * from './packlets/converters';
+export * from './packlets/store';
+export * from './packlets/index';
+export * from './packlets/retrieve';
+export * from './packlets/observe';
+export * from './packlets/vector';

package/src/packlets/converters/bodyConverterRegistry.ts

@@ -0,0 +1,105 @@
+/*
+ * Copyright (c) 2026 Erik Fortune
+ * SPDX-License-Identifier: MIT
+ */
+
+import { Converter, Converters, Result, fail, succeed } from '@fgv/ts-utils';
+import { JsonSchema } from '@fgv/ts-json-base';
+import { Kind } from '../types';
+
+/**
+ * Registry of per-kind body Converters. Each memory {@link Kind} registers the
+ * validated shape of its body; the store dispatches an `unknown` body through
+ * the registered Converter on every write. Type-safe — no `any`.
+ * @public
+ */
+export interface IBodyConverterRegistry {
+  /**
+   * Register a Converter for a kind. Replaces any prior registration for the
+   * same kind.
+   */
+  register<T>(kind: Kind, converter: Converter<T>): void;
+
+  /**
+   * Register a `JsonSchema` validator (from `@fgv/ts-json-base`) for a kind —
+   * the schema IS a Validator. Replaces any prior registration for the same
+   * kind.
+   */
+  registerSchema<T>(kind: Kind, schema: JsonSchema.ISchemaValidator<T>): void;
+
+  /** Returns `true` if a converter is registered for the kind. */
+  has(kind: Kind): boolean;
+
+  /**
+   * Get the raw converter registered for a kind. Fails if the kind is
+   * unregistered. Exposed for implementors that need to re-validate a patched
+   * body (e.g. a temporal-versioned policy's `applyUpdate`).
+   */
+  getConverter(kind: Kind): Result<Converter<unknown>>;
+
+  /**
+   * Convert an `unknown` body value for the given kind. Fails with
+   * `no converter registered for kind '<k>'` when unregistered.
+   */
+  convert(kind: Kind, body: unknown): Result<unknown>;
+}
+
+/**
+ * Default in-memory {@link IBodyConverterRegistry}.
+ *
+ * @remarks
+ * Both `register` and `registerSchema` adapt the supplied converter/validator
+ * into a `Converter<unknown>` via `Converters.generic`, so the heterogeneous
+ * per-kind types are stored uniformly with no cast and no `any`. A
+ * `Converter<T>` is not structurally a `Converter<unknown>` (the `map` callback
+ * makes the type invariant), so the `generic` wrapper — whose callback returns
+ * `Result<T>` (assignable to `Result<unknown>`) — is the type-safe bridge.
+ * @public
+ */
+export class BodyConverterRegistry implements IBodyConverterRegistry {
+  private readonly _converters: Map<Kind, Converter<unknown>>;
+
+  private constructor() {
+    this._converters = new Map<Kind, Converter<unknown>>();
+  }
+
+  /** Family-convention factory. */
+  public static create(): Result<BodyConverterRegistry> {
+    return succeed(new BodyConverterRegistry());
+  }
+
+  /** {@inheritDoc IBodyConverterRegistry.register} */
+  public register<T>(kind: Kind, converter: Converter<T>): void {
+    this._converters.set(
+      kind,
+      Converters.generic<unknown>((from: unknown) => converter.convert(from))
+    );
+  }
+
+  /** {@inheritDoc IBodyConverterRegistry.registerSchema} */
+  public registerSchema<T>(kind: Kind, schema: JsonSchema.ISchemaValidator<T>): void {
+    this._converters.set(
+      kind,
+      Converters.generic<unknown>((from: unknown) => schema.convert(from))
+    );
+  }
+
+  /** {@inheritDoc IBodyConverterRegistry.has} */
+  public has(kind: Kind): boolean {
+    return this._converters.has(kind);
+  }
+
+  /** {@inheritDoc IBodyConverterRegistry.getConverter} */
+  public getConverter(kind: Kind): Result<Converter<unknown>> {
+    const converter: Converter<unknown> | undefined = this._converters.get(kind);
+    if (converter === undefined) {
+      return fail(`no converter registered for kind '${kind}'`);
+    }
+    return succeed(converter);
+  }
+
+  /** {@inheritDoc IBodyConverterRegistry.convert} */
+  public convert(kind: Kind, body: unknown): Result<unknown> {
+    return this.getConverter(kind).onSuccess((converter) => converter.convert(body));
+  }
+}