@framers/agentos 0.15.55 → 0.15.57

package/dist/cognition/memory/io/facade/types.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../../src/cognition/memory/io/facade/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAC5E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AAM1E;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD;;;;;;GAMG;AACH,MAAM,WAAW,2BAA2B;IAC1C;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,GAAG,UAAU,GAAG,QAAQ,CAAC;IAE1C;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAI5B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAE3B;;;OAGG;IACH,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAElC;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAMD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,GAAG,UAAU,GAAG,cAAc,GAAG,QAAQ,CAAC;IAEjE;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAMD;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,UAAU,CAAC;IAEvE;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,oDAAoD;IACpD,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,CAAC,EAAE,eAAe,CAAC;IAE7B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5C;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB,6CAA6C;IAC7C,aAAa,CAAC,EAAE,2BAA2B,CAAC;IAE5C,8EAA8E;IAC9E,SAAS,CAAC,EAAE,eAAe,CAAC;CAC7B;AAMD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAEhB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,MAAM,CAAC,EAAE,qBAAqB,CAAC;CAChC;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IAEnB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IAEnB;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAE1C;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;CAC1E;AAMD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB;;OAEG;IACH,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAE/C;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;CACvB;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,EAAE,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAErD;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAE5B;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAC;CAChC;AAMD;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,iCAAiC;IACjC,EAAE,EAAE,MAAM,CAAC;IAEX;;;OAGG;IACH,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;IAExC;;;;;;;;;OASG;IACH,OAAO,EAAE,eAAe,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;CACzE;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;;;OAUG;IACH,OAAO,EAAE,kBAAkB,EAAE,CAAC;CAC/B;AAMD;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,GAAG,KAAK,CAAC;IAElF;;;;;;;;OAQG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAMD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAMD;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;;;;;;;OAQG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAMD;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IAErB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAE7B;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IAEjC;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEtC;;OAEG;IACH,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEvC;;OAEG;IACH,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAMD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,mEAAmE;IACnE,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,sCAAsC;IACtC,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,kCAAkC;IAClC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wDAAwD;IACxD,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,mCAAmC;IACnC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wCAAwC;IACxC,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,+DAA+D;IAC/D,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IAEd;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;OAEG;IACH,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,QAAQ,EAAE,gBAAgB,CAAC;IAE3B;;OAEG;IACH,MAAM,CAAC,EAAE,aAAa,EAAE,CAAC;IAEzB;;;OAGG;IACH,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAE1B;;OAEG;IACH,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAE1B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;CAChB"}
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../../../src/cognition/memory/io/facade/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,gCAAgC,CAAC;AAC5E,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AAM1E;;;GAGG;AACH,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;;OAIG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD;;;;;;GAMG;AACH,MAAM,WAAW,2BAA2B;IAC1C;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,OAAO,GAAG,UAAU,GAAG,QAAQ,CAAC;IAE1C;;;;;OAKG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;;OAIG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IAExB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAI5B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;OAIG;IACH,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAE3B;;;OAGG;IACH,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAElC;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAMD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,GAAG,UAAU,GAAG,cAAc,GAAG,QAAQ,CAAC;IAEjE;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB;;;;OAIG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IAExB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IAErB;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IAEzB;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAMD;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,MAAM,GAAG,UAAU,CAAC;IAEvE;;;;OAIG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,oDAAoD;IACpD,YAAY,CAAC,EAAE,MAAM,CAAC;IAEtB,sEAAsE;IACtE,UAAU,CAAC,EAAE,eAAe,CAAC;IAE7B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IAE5C;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB;;;;OAIG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;IAEhB,6CAA6C;IAC7C,aAAa,CAAC,EAAE,2BAA2B,CAAC;IAE5C,8EAA8E;IAC9E,SAAS,CAAC,EAAE,eAAe,CAAC;CAC7B;AAMD;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;;;;OAMG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;IAEhB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IAEpB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd;;OAEG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IAErB;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,MAAM,CAAC,EAAE,qBAAqB,CAAC;CAChC;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IAEnB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IAEnB;;;;;;OAMG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAE1C;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,KAAK,IAAI,CAAC;CAC1E;AAMD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,SAAS,EAAE,MAAM,EAAE,CAAC;IAEpB;;OAEG;IACH,MAAM,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAE/C;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;IAEtB;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC;CACvB;AAMD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,EAAE,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,UAAU,CAAC;IAErD;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,OAAO,CAAC;IAE5B;;;;OAIG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAC;CAChC;AAMD;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,iCAAiC;IACjC,EAAE,EAAE,MAAM,CAAC;IAEX;;;OAGG;IACH,KAAK,EAAE,OAAO,GAAG,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;IAExC;;;;;;;;;OASG;IACH,OAAO,EAAE,eAAe,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;CACzE;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;;;;;;OAUG;IACH,OAAO,EAAE,kBAAkB,EAAE,CAAC;CAC/B;AAMD;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B;;;;;;;;;;;;;;;OAeG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,MAAM,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,GAAG,KAAK,CAAC;IAElF;;;;;;;;;;OAUG;IACH,KAAK,CAAC,EAAE,OAAO,CAAC;CACjB;AAMD;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B;;;;;OAKG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;;;OAKG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;;OAGG;IACH,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAMD;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC;IAEf;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,SAAS,EAAE,MAAM,CAAC;IAElB;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;;;;;;;OAQG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;CAC7B;AAMD;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,YAAY,EAAE,MAAM,CAAC;IAErB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,oBAAoB,EAAE,MAAM,CAAC;IAE7B;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;OAEG;IACH,UAAU,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,iBAAiB,EAAE,MAAM,GAAG,IAAI,CAAC;IAEjC;;OAEG;IACH,aAAa,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEtC;;OAEG;IACH,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAEvC;;OAEG;IACH,iBAAiB,EAAE,MAAM,CAAC;CAC3B;AAMD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B;;;OAGG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAgB;IAC/B,mEAAmE;IACnE,KAAK,CAAC,EAAE,MAAM,CAAC;IAEf,sCAAsC;IACtC,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,kCAAkC;IAClC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wDAAwD;IACxD,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;IAElB,mCAAmC;IACnC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wCAAwC;IACxC,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB,8DAA8D;IAC9D,MAAM,CAAC,EAAE,MAAM,CAAC;IAEhB,+DAA+D;IAC/D,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC;CACxB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAa;IAC5B;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,KAAK,EAAE,MAAM,CAAC;IAEd;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAC;IAEb;;;OAGG;IACH,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;OAGG;IACH,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,OAAO,EAAE,MAAM,EAAE,CAAC;IAElB;;OAEG;IACH,IAAI,EAAE,MAAM,EAAE,EAAE,CAAC;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IAEjB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;CACrB;AAED;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAEhB;;OAEG;IACH,QAAQ,EAAE,gBAAgB,CAAC;IAE3B;;OAEG;IACH,MAAM,CAAC,EAAE,aAAa,EAAE,CAAC;IAEzB;;;OAGG;IACH,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAE1B;;OAEG;IACH,MAAM,CAAC,EAAE,cAAc,EAAE,CAAC;IAE1B;;;OAGG;IACH,MAAM,EAAE,MAAM,CAAC;CAChB"}

package/dist/cognition/memory/io/importScope.d.ts

@@ -4,7 +4,11 @@
  * An importer files each trace under its scope and scope id and deduplicates inside that pair: a record whose text a
  * trace of another scope id holds (another tenant's, user's or session's) is imported, and a record whose text a trace
  * of its own scope and scope id holds is a duplicate, whichever writer stored that trace. The Markdown export writes
- * the same scope id into a trace's front matter, so a note carries it out of one brain and into another.
+ * the same scope id into a trace's front matter, so a note carries it out of one brain and into another. An importer
+ * whose source marks forgotten traces reads the source's live records before its forgotten ones, so a text the source
+ * holds both forgotten and live arrives live. A trace's memory-graph node comes in with its trace alone, under its
+ * trace's id, so a record merged into another trace leaves no node behind that stands for a trace the brain does not
+ * hold.
  *
  * @module memory/io/importScope
  */
@@ -29,7 +33,9 @@ export declare function importedScopeId(metadata: unknown, scopeIdColumn?: unkno
  * `import_hash` (an import stores it) or `content_hash` (`remember()`, `ingest()` and `memory_add` store it). A trace
  * the cognitive memory store wrote carries neither hash, and its text finds it. A trace the brain forgot counts as any
  * other, so an import does not bring it back: a forgotten row stays a record of what the brain let go, and a JSON or
- * SQLite export carries it, so leaving it out would add another forgotten copy at each import of such a file.
+ * SQLite export carries it, so leaving it out would add another forgotten copy at each import of such a file. An
+ * importer reads a source's live records before its forgotten ones (see {@link liveRecordsFirst}), so a forgotten trace
+ * the same import writes is never what makes a live record of its text a duplicate.
  *
  * @param brain - The brain the query runs on; its dialect reads the metadata.
  * @returns A parenthesised condition on `memory_traces` with the three placeholders {@link duplicateTraceParams}
@@ -44,4 +50,58 @@ export declare function duplicateTraceCondition(brain: Pick<Brain, 'features'>):
  * @returns The hash twice, then the text.
  */
 export declare function duplicateTraceParams(hash: string, content: string): [string, string, string];
+/**
+ * A source's trace records in the order an importer reads them: its live records, then its forgotten ones, each group
+ * in the source's order. A source can hold a forgotten and a live trace of one text in one scope and scope id:
+ * `forget()` and then `remember()` of the text leave them, and so does a consolidation merge of two traces of it. An
+ * export holds its rows in no set order. Read first, the live record is imported and the forgotten one is its
+ * duplicate, so the text arrives live; read the other way round, the live record would be the duplicate of the
+ * forgotten trace the same import had just written, and the text would arrive forgotten.
+ *
+ * @param records - The source's trace records, in its order.
+ * @param isForgotten - Whether a record is of a trace its source forgot.
+ * @returns The live records, then the forgotten ones.
+ */
+export declare function liveRecordsFirst<T>(records: readonly T[], isForgotten: (record: T) => boolean): T[];
+/**
+ * Whether a JSON or SQLite trace record is of a trace its source forgot: its `deleted` is present and not zero. A
+ * record whose `deleted` is absent or `null` is stored as live, as one whose `deleted` is `0` is.
+ *
+ * @param record - A trace record as its source holds it; a value that is not an object is not forgotten.
+ * @returns `true` when the record's `deleted` is present and not zero.
+ */
+export declare function isForgottenRecord(record: unknown): boolean;
+/**
+ * The `knowledge_nodes.type` of a memory-graph node (`SqlMemoryGraph`): the node of the trace whose id it carries as
+ * its own.
+ */
+export declare const MEMORY_GRAPH_NODE_TYPE = "memory_graph";
+/** How an import takes a memory-graph node its file holds (see {@link memoryGraphNodeImport}). */
+export type MemoryGraphNodeImport = {
+    action: 'write' | 'duplicate';
+    id: string;
+} | {
+    action: 'skip';
+};
+/**
+ * How an import takes a memory-graph node its file holds, the node of the trace whose id it carries. The node comes in
+ * with its trace alone and under that id. It is skipped, and so are the edges that name it, when the file holds its
+ * trace and the import did not write that trace, or match it as a duplicate, under that id (the record merged into a
+ * trace of another id, was written under a new id, or failed), or when the brain holds no trace of that id; written
+ * there, the node would stand for a trace the brain does not hold. A node the brain holds under that id is the
+ * record's duplicate, and the edges that name the record's node name it; a node of another type under that id makes
+ * the record's node a skip, as it cannot take that id. Otherwise the node is written under that id.
+ *
+ * A record merged into a trace of another id brings no node and no edges: the brain's node of that trace keeps its own
+ * edges, and the record merged is most often a forgotten one (see {@link liveRecordsFirst}), whose edges its source no
+ * longer reads.
+ *
+ * @param trx - The import's transaction.
+ * @param brainId - The brain the import writes.
+ * @param nodeId - The node record's id, which is its trace's id.
+ * @param unfiled - Whether the file holds the trace of an id that the import did not write, or match as a duplicate,
+ *   under that id.
+ * @returns `write` or `duplicate` with the id, or `skip`.
+ */
+export declare function memoryGraphNodeImport(trx: Pick<Brain, 'get'>, brainId: string, nodeId: unknown, unfiled: (traceId: string) => boolean): Promise<MemoryGraphNodeImport>;
 //# sourceMappingURL=importScope.d.ts.map

package/dist/cognition/memory/io/importScope.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"importScope.d.ts","sourceRoot":"","sources":["../../../../src/cognition/memory/io/importScope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AAEzD;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,MAAM,CASlF;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,MAAM,CAK9E;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAE5F"}
+{"version":3,"file":"importScope.d.ts","sourceRoot":"","sources":["../../../../src/cognition/memory/io/importScope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AAEzD;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,OAAO,GAAG,MAAM,CASlF;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,uBAAuB,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,MAAM,CAK9E;AAED;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAE5F;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,CAAC,MAAM,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE,CAKnG;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAI1D;AAED;;;GAGG;AACH,eAAO,MAAM,sBAAsB,iBAAiB,CAAC;AAErD,kGAAkG;AAClG,MAAM,MAAM,qBAAqB,GAAG;IAAE,MAAM,EAAE,OAAO,GAAG,WAAW,CAAC;IAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAAG;IAAE,MAAM,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvG;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAsB,qBAAqB,CACzC,GAAG,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EACvB,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,OAAO,GACpC,OAAO,CAAC,qBAAqB,CAAC,CAahC"}

package/dist/cognition/memory/io/importScope.js

@@ -4,7 +4,11 @@
  * An importer files each trace under its scope and scope id and deduplicates inside that pair: a record whose text a
  * trace of another scope id holds (another tenant's, user's or session's) is imported, and a record whose text a trace
  * of its own scope and scope id holds is a duplicate, whichever writer stored that trace. The Markdown export writes
- * the same scope id into a trace's front matter, so a note carries it out of one brain and into another.
+ * the same scope id into a trace's front matter, so a note carries it out of one brain and into another. An importer
+ * whose source marks forgotten traces reads the source's live records before its forgotten ones, so a text the source
+ * holds both forgotten and live arrives live. A trace's memory-graph node comes in with its trace alone, under its
+ * trace's id, so a record merged into another trace leaves no node behind that stands for a trace the brain does not
+ * hold.
  *
  * @module memory/io/importScope
  */
@@ -39,7 +43,9 @@ export function importedScopeId(metadata, scopeIdColumn) {
  * `import_hash` (an import stores it) or `content_hash` (`remember()`, `ingest()` and `memory_add` store it). A trace
  * the cognitive memory store wrote carries neither hash, and its text finds it. A trace the brain forgot counts as any
  * other, so an import does not bring it back: a forgotten row stays a record of what the brain let go, and a JSON or
- * SQLite export carries it, so leaving it out would add another forgotten copy at each import of such a file.
+ * SQLite export carries it, so leaving it out would add another forgotten copy at each import of such a file. An
+ * importer reads a source's live records before its forgotten ones (see {@link liveRecordsFirst}), so a forgotten trace
+ * the same import writes is never what makes a live record of its text a duplicate.
  *
  * @param brain - The brain the query runs on; its dialect reads the metadata.
  * @returns A parenthesised condition on `memory_traces` with the three placeholders {@link duplicateTraceParams}
@@ -61,4 +67,78 @@ export function duplicateTraceCondition(brain) {
 export function duplicateTraceParams(hash, content) {
     return [hash, hash, content];
 }
+/**
+ * A source's trace records in the order an importer reads them: its live records, then its forgotten ones, each group
+ * in the source's order. A source can hold a forgotten and a live trace of one text in one scope and scope id:
+ * `forget()` and then `remember()` of the text leave them, and so does a consolidation merge of two traces of it. An
+ * export holds its rows in no set order. Read first, the live record is imported and the forgotten one is its
+ * duplicate, so the text arrives live; read the other way round, the live record would be the duplicate of the
+ * forgotten trace the same import had just written, and the text would arrive forgotten.
+ *
+ * @param records - The source's trace records, in its order.
+ * @param isForgotten - Whether a record is of a trace its source forgot.
+ * @returns The live records, then the forgotten ones.
+ */
+export function liveRecordsFirst(records, isForgotten) {
+    const live = [];
+    const forgotten = [];
+    for (const record of records)
+        (isForgotten(record) ? forgotten : live).push(record);
+    return live.concat(forgotten);
+}
+/**
+ * Whether a JSON or SQLite trace record is of a trace its source forgot: its `deleted` is present and not zero. A
+ * record whose `deleted` is absent or `null` is stored as live, as one whose `deleted` is `0` is.
+ *
+ * @param record - A trace record as its source holds it; a value that is not an object is not forgotten.
+ * @returns `true` when the record's `deleted` is present and not zero.
+ */
+export function isForgottenRecord(record) {
+    if (typeof record !== 'object' || record === null)
+        return false;
+    const deleted = record.deleted;
+    return deleted !== undefined && deleted !== null && Number(deleted) !== 0;
+}
+/**
+ * The `knowledge_nodes.type` of a memory-graph node (`SqlMemoryGraph`): the node of the trace whose id it carries as
+ * its own.
+ */
+export const MEMORY_GRAPH_NODE_TYPE = 'memory_graph';
+/**
+ * How an import takes a memory-graph node its file holds, the node of the trace whose id it carries. The node comes in
+ * with its trace alone and under that id. It is skipped, and so are the edges that name it, when the file holds its
+ * trace and the import did not write that trace, or match it as a duplicate, under that id (the record merged into a
+ * trace of another id, was written under a new id, or failed), or when the brain holds no trace of that id; written
+ * there, the node would stand for a trace the brain does not hold. A node the brain holds under that id is the
+ * record's duplicate, and the edges that name the record's node name it; a node of another type under that id makes
+ * the record's node a skip, as it cannot take that id. Otherwise the node is written under that id.
+ *
+ * A record merged into a trace of another id brings no node and no edges: the brain's node of that trace keeps its own
+ * edges, and the record merged is most often a forgotten one (see {@link liveRecordsFirst}), whose edges its source no
+ * longer reads.
+ *
+ * @param trx - The import's transaction.
+ * @param brainId - The brain the import writes.
+ * @param nodeId - The node record's id, which is its trace's id.
+ * @param unfiled - Whether the file holds the trace of an id that the import did not write, or match as a duplicate,
+ *   under that id.
+ * @returns `write` or `duplicate` with the id, or `skip`.
+ */
+export async function memoryGraphNodeImport(trx, brainId, nodeId, unfiled) {
+    if (typeof nodeId !== 'string' || unfiled(nodeId))
+        return { action: 'skip' };
+    const trace = await trx.get('SELECT id FROM memory_traces WHERE brain_id = ? AND id = ? LIMIT 1', [
+        brainId,
+        nodeId,
+    ]);
+    if (!trace)
+        return { action: 'skip' };
+    const held = await trx.get('SELECT type FROM knowledge_nodes WHERE brain_id = ? AND id = ? LIMIT 1', [
+        brainId,
+        nodeId,
+    ]);
+    if (!held)
+        return { action: 'write', id: nodeId };
+    return held.type === MEMORY_GRAPH_NODE_TYPE ? { action: 'duplicate', id: nodeId } : { action: 'skip' };
+}
 //# sourceMappingURL=importScope.js.map

package/dist/cognition/memory/io/importScope.js.map

@@ -1 +1 @@
-{"version":3,"file":"importScope.js","sourceRoot":"","sources":["../../../../src/cognition/memory/io/importScope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAIH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAAC,QAAiB,EAAE,aAAuB;IACxE,MAAM,MAAM,GACV,QAAQ,KAAK,IAAI,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC3E,CAAC,CAAE,QAAoC;QACvC,CAAC,CAAC,SAAS,CAAC;IAChB,IAAI,OAAO,MAAM,EAAE,OAAO,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC;IAC/D,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,aAAa,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACzE,IAAI,MAAM;QAAE,MAAM,CAAC,OAAO,GAAG,aAAa,CAAC;IAC3C,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAA8B;IACpE,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC;IACnC,OAAO,IAAI,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC;mBAC1C,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC;8BACtC,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,OAAe;IAChE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAC/B,CAAC"}
+{"version":3,"file":"importScope.js","sourceRoot":"","sources":["../../../../src/cognition/memory/io/importScope.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAAC,QAAiB,EAAE,aAAuB;IACxE,MAAM,MAAM,GACV,QAAQ,KAAK,IAAI,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;QAC3E,CAAC,CAAE,QAAoC;QACvC,CAAC,CAAC,SAAS,CAAC;IAChB,IAAI,OAAO,MAAM,EAAE,OAAO,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC;IAC/D,IAAI,OAAO,aAAa,KAAK,QAAQ,IAAI,aAAa,KAAK,EAAE;QAAE,OAAO,EAAE,CAAC;IACzE,IAAI,MAAM;QAAE,MAAM,CAAC,OAAO,GAAG,aAAa,CAAC;IAC3C,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAA8B;IACpE,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC,QAAQ,CAAC;IACnC,OAAO,IAAI,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,eAAe,CAAC;mBAC1C,OAAO,CAAC,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC;8BACtC,CAAC;AAC/B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAY,EAAE,OAAe;IAChE,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAAI,OAAqB,EAAE,WAAmC;IAC5F,MAAM,IAAI,GAAQ,EAAE,CAAC;IACrB,MAAM,SAAS,GAAQ,EAAE,CAAC;IAC1B,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpF,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AAChC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,MAAe;IAC/C,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAChE,MAAM,OAAO,GAAI,MAAgC,CAAC,OAAO,CAAC;IAC1D,OAAO,OAAO,KAAK,SAAS,IAAI,OAAO,KAAK,IAAI,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;AAC5E,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,cAAc,CAAC;AAKrD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,GAAuB,EACvB,OAAe,EACf,MAAe,EACf,OAAqC;IAErC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC7E,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,GAAG,CAAiB,oEAAoE,EAAE;QAChH,OAAO;QACP,MAAM;KACP,CAAC,CAAC;IACH,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IACtC,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,GAAG,CAAmB,wEAAwE,EAAE;QACrH,OAAO;QACP,MAAM;KACP,CAAC,CAAC;IACH,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC;IAClD,OAAO,IAAI,CAAC,IAAI,KAAK,sBAAsB,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AACzG,CAAC"}

package/dist/orchestration/checkpoint/ICheckpointStore.d.ts

@@ -65,7 +65,9 @@ export interface Checkpoint {
     /**
      * Results recorded when this checkpoint was taken, keyed by node id: those of the
      * nodes in `visitedNodes` and, in the checkpoint of a run that a node interrupted,
-     * that node's. A node that failed records none, so a resume runs it again.
+     * that node's, as in the checkpoint saved before an expansion that came after a
+     * `write`, `external` or `human` node. A node that failed records none, so a
+     * resume runs it again.
      */
     nodeResults: Record<string, {
         /** The node's declared effect class. */
@@ -74,6 +76,16 @@ export interface Checkpoint {
         output: unknown;
         /** Wall-clock execution time in milliseconds. */
         durationMs: number;
+        /**
+         * The target the node picked itself, as a router, a guardrail that reroutes or
+         * the exit of a voice node does. A resume that marks the node complete with this
+         * result, as it does a `write`, `external` or `human` node such as a voice node,
+         * goes there rather than evaluating the node's edges. `routerNode()` and
+         * `guardrailNode()` build `pure` nodes, which a resume never marks complete from
+         * a recorded result: one the checkpoint does not list as completed runs again and
+         * picks its target anew.
+         */
+        routeTarget?: string;
     }>;
     /** Ordered list of node ids that had completed execution when this checkpoint was taken. */
     visitedNodes: string[];

package/dist/orchestration/checkpoint/ICheckpointStore.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ICheckpointStore.d.ts","sourceRoot":"","sources":["../../../src/orchestration/checkpoint/ICheckpointStore.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAGnG,YAAY,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAMzD;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,qEAAqE;IACrE,EAAE,EAAE,MAAM,CAAC;IACX,yDAAyD;IACzD,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,KAAK,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,KAAK,EAAE;QACL,8DAA8D;QAC9D,KAAK,EAAE,OAAO,CAAC;QACf,uEAAuE;QACvE,OAAO,EAAE,OAAO,CAAC;QACjB,+DAA+D;QAC/D,SAAS,EAAE,OAAO,CAAC;QACnB,8DAA8D;QAC9D,WAAW,EAAE,eAAe,CAAC;KAC9B,CAAC;IAEF;;;OAGG;IACH,cAAc,CAAC,EAAE;QACf,2EAA2E;QAC3E,KAAK,EAAE,KAAK,CAAC;YACX,4CAA4C;YAC5C,OAAO,EAAE,MAAM,CAAC;YAChB,oCAAoC;YACpC,OAAO,EAAE,MAAM,CAAC;YAChB,2CAA2C;YAC3C,QAAQ,EAAE,MAAM,CAAC;SAClB,CAAC,CAAC;QACH,mFAAmF;QACnF,aAAa,EAAE,KAAK,CAAC;YACnB,yDAAyD;YACzD,IAAI,EAAE,MAAM,CAAC;YACb,qCAAqC;YACrC,OAAO,EAAE,MAAM,CAAC;YAChB,gDAAgD;YAChD,KAAK,EAAE,MAAM,CAAC;SACf,CAAC,CAAC;KACJ,CAAC;IAEF;;;;OAIG;IACH,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE;QAC1B,wCAAwC;QACxC,WAAW,EAAE,WAAW,CAAC;QACzB,6CAA6C;QAC7C,MAAM,EAAE,OAAO,CAAC;QAChB,iDAAiD;QACjD,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;IAEH,4FAA4F;IAC5F,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IAExB,qFAAqF;IACrF,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAMD;;;;;;;GAOG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5C;;;;;OAKG;IACH,GAAG,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAEtD;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAEjE;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAElD;;;;;;;OAOG;IACH,IAAI,CACF,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC3C,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;OAMG;IACH,MAAM,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5C;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CAC/E"}
+{"version":3,"file":"ICheckpointStore.d.ts","sourceRoot":"","sources":["../../../src/orchestration/checkpoint/ICheckpointStore.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,eAAe,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAGnG,YAAY,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAMzD;;;;;;GAMG;AACH,MAAM,WAAW,UAAU;IACzB,qEAAqE;IACrE,EAAE,EAAE,MAAM,CAAC;IACX,yDAAyD;IACzD,OAAO,EAAE,MAAM,CAAC;IAChB,yDAAyD;IACzD,KAAK,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,MAAM,EAAE,MAAM,CAAC;IACf,iEAAiE;IACjE,SAAS,EAAE,MAAM,CAAC;IAElB;;;OAGG;IACH,KAAK,EAAE;QACL,8DAA8D;QAC9D,KAAK,EAAE,OAAO,CAAC;QACf,uEAAuE;QACvE,OAAO,EAAE,OAAO,CAAC;QACjB,+DAA+D;QAC/D,SAAS,EAAE,OAAO,CAAC;QACnB,8DAA8D;QAC9D,WAAW,EAAE,eAAe,CAAC;KAC9B,CAAC;IAEF;;;OAGG;IACH,cAAc,CAAC,EAAE;QACf,2EAA2E;QAC3E,KAAK,EAAE,KAAK,CAAC;YACX,4CAA4C;YAC5C,OAAO,EAAE,MAAM,CAAC;YAChB,oCAAoC;YACpC,OAAO,EAAE,MAAM,CAAC;YAChB,2CAA2C;YAC3C,QAAQ,EAAE,MAAM,CAAC;SAClB,CAAC,CAAC;QACH,mFAAmF;QACnF,aAAa,EAAE,KAAK,CAAC;YACnB,yDAAyD;YACzD,IAAI,EAAE,MAAM,CAAC;YACb,qCAAqC;YACrC,OAAO,EAAE,MAAM,CAAC;YAChB,gDAAgD;YAChD,KAAK,EAAE,MAAM,CAAC;SACf,CAAC,CAAC;KACJ,CAAC;IAEF;;;;;;OAMG;IACH,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE;QAC1B,wCAAwC;QACxC,WAAW,EAAE,WAAW,CAAC;QACzB,6CAA6C;QAC7C,MAAM,EAAE,OAAO,CAAC;QAChB,iDAAiD;QACjD,UAAU,EAAE,MAAM,CAAC;QACnB;;;;;;;;WAQG;QACH,WAAW,CAAC,EAAE,MAAM,CAAC;KACtB,CAAC,CAAC;IAEH,4FAA4F;IAC5F,YAAY,EAAE,MAAM,EAAE,CAAC;IAEvB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IAExB,qFAAqF;IACrF,YAAY,EAAE,MAAM,EAAE,CAAC;CACxB;AAMD;;;;;;;GAOG;AACH,MAAM,WAAW,gBAAgB;IAC/B;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5C;;;;;OAKG;IACH,GAAG,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAEtD;;;;;;;;;;;;OAYG;IACH,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAEjE;;;;;;OAMG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;IAElD;;;;;;;OAOG;IACH,IAAI,CACF,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GAC3C,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAC;IAEjC;;;;;;OAMG;IACH,MAAM,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAE5C;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CAC/E"}

package/dist/orchestration/runtime/GraphRuntime.d.ts

@@ -68,6 +68,17 @@ export interface GraphExpansionContext {
     nodeId: string;
     state: GraphState;
     request: GraphExpansionRequest;
+    /**
+     * The checkpoint the runtime saved after the node and before it handed any of
+     * this step's expansion requests to the handler. The node's edges are decided
+     * after the expansion, on the graph it leaves, so the checkpoint does not list
+     * the node in `visitedNodes`, and a resume from it routes the node once by its
+     * edges. A `write`, `external` or `human` node keeps its result and what it
+     * wrote, and a resume marks it complete with its recorded output; a `pure` or
+     * `read` node is saved as it was before it ran, and a resume runs it again.
+     * After a parallel batch, whose nodes' edges are decided before the expansion,
+     * the checkpoint lists every node of the batch.
+     */
     checkpointIdBefore?: string;
     completedNodes: string[];
     skippedNodes: string[];
@@ -142,8 +153,10 @@ export declare class GraphRuntime {
      * node of the batch runs to the end first, none of the batch's events is yielded,
      * and the error is the first in the order the nodes are declared; a node of the
      * batch counts as completed only once its edges are decided, so a node whose edges
-     * threw is in no checkpoint as completed. A resume by the `runId` of `run_start`
-     * continues from the last checkpoint the store saved.
+     * threw is in no checkpoint as completed. The checkpoint saved before an expansion
+     * does not list the node the expansion came after as completed either (see
+     * {@link GraphExpansionContext.checkpointIdBefore}). A resume by the `runId` of
+     * `run_start` continues from the last checkpoint the store saved.
      *
      * @param graph - Compiled execution graph to run.
      * @param input - Initial user-provided input; frozen into `GraphState.input`.
@@ -163,8 +176,9 @@ export declare class GraphRuntime {
      * evaluated on the restored state with the node's visit recorded
      * (`currentNodeId` names the node and `visitedNodes` lists it), as a node's
      * are after it runs, so the run follows the targets they pick and skips the
-     * others. A node that failed recorded no result and wrote nothing, so it runs
-     * again, from the state it ran on.
+     * others; a replayed node that picked its target itself, as the exit of a voice
+     * node does, goes to the target its recorded result names. A node that failed
+     * recorded no result and wrote nothing, so it runs again, from the state it ran on.
      *
      * @param graph - The same compiled graph that was originally invoked.
      * @param runOrCheckpointId - Either the original run id or an exact checkpoint id.

package/dist/orchestration/runtime/GraphRuntime.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"GraphRuntime.d.ts","sourceRoot":"","sources":["../../../src/orchestration/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAE,WAAW,EAAa,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEjG,OAAO,KAAK,EACV,UAAU,EACV,uBAAuB,EACvB,iBAAiB,EAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,gBAAgB,EAAc,MAAM,mCAAmC,CAAC;AAGtF,OAAO,EAAE,YAAY,EAA4B,MAAM,mBAAmB,CAAC;AAO3E;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,oDAAoD;IACpD,eAAe,EAAE,gBAAgB,CAAC;IAClC,iEAAiE;IACjE,YAAY,EAAE,YAAY,CAAC;IAC3B,6EAA6E;IAC7E,gBAAgB,CAAC,EAAE,qBAAqB,CAAC;IACzC,0EAA0E;IAC1E,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,eAAe,CAAC,EAAE;QAChB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC;YAAE,OAAO,CAAC,EAAE,KAAK,CAAC;gBAAE,EAAE,CAAC,EAAE,MAAM,CAAC;gBAAC,IAAI,CAAC,EAAE,MAAM,CAAA;aAAE,CAAC,CAAA;SAAE,CAAC,CAAC;KAC1G,CAAC;IACF;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxC;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,uBAAuB,CAAC;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,iBAAiB,CAAC;CAC3B;AAED,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,UAAU,CAAC;IAClB,OAAO,EAAE,qBAAqB,CAAC;IAC/B,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE;QAC1B,WAAW,EAAE,WAAW,CAAC;QACzB,MAAM,EAAE,OAAO,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,CAAC,EAAE,sBAAsB,CAAC;IAC/B,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACpC,MAAM,CAAC,OAAO,EAAE,qBAAqB,GAAG,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAC;CAC9E;AAwCD;;;;;;;;;;;;GAYG;AACH,qBAAa,YAAY;IAIX,OAAO,CAAC,QAAQ,CAAC,MAAM;IAHnC;;OAEG;gBAC0B,MAAM,EAAE,kBAAkB;IAMvD;;;;;;;;;;;OAWG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ7E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACI,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC;IA+qBxF;;;;;;;;;;;;;;;;;;;;OAoBG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAQxF;;;;;;;;;;;;;OAaG;IACI,YAAY,CACjB,KAAK,EAAE,sBAAsB,EAC7B,iBAAiB,EAAE,MAAM,GACxB,cAAc,CAAC,UAAU,CAAC;IAuB7B;;;;;;;;;;;;OAYG;YACY,sBAAsB;IAiQrC;;;;;;;;;;;OAWG;YACW,aAAa;IA4F3B;;;;;;;;;;;;;;OAcG;YACW,cAAc;IAgC5B,OAAO,CAAC,wBAAwB;IAWhC,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,qBAAqB;CAK9B"}
+{"version":3,"file":"GraphRuntime.d.ts","sourceRoot":"","sources":["../../../src/orchestration/runtime/GraphRuntime.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,EAAE,sBAAsB,EAAE,WAAW,EAAwB,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAE5G,OAAO,KAAK,EACV,UAAU,EACV,uBAAuB,EACvB,iBAAiB,EAClB,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EAAE,gBAAgB,EAAc,MAAM,mCAAmC,CAAC;AAGtF,OAAO,EAAE,YAAY,EAA4B,MAAM,mBAAmB,CAAC;AAO3E;;;;;GAKG;AACH,MAAM,WAAW,kBAAkB;IACjC,oDAAoD;IACpD,eAAe,EAAE,gBAAgB,CAAC;IAClC,iEAAiE;IACjE,YAAY,EAAE,YAAY,CAAC;IAC3B,6EAA6E;IAC7E,gBAAgB,CAAC,EAAE,qBAAqB,CAAC;IACzC,0EAA0E;IAC1E,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;;OAIG;IACH,eAAe,CAAC,EAAE;QAChB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC;YAAE,OAAO,CAAC,EAAE,KAAK,CAAC;gBAAE,EAAE,CAAC,EAAE,MAAM,CAAC;gBAAC,IAAI,CAAC,EAAE,MAAM,CAAA;aAAE,CAAC,CAAA;SAAE,CAAC,CAAC;KAC1G,CAAC;IACF;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxC;AAED,MAAM,WAAW,qBAAqB;IACpC,OAAO,EAAE,uBAAuB,CAAC;IACjC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,CAAC,EAAE,iBAAiB,CAAC;CAC3B;AAED,MAAM,WAAW,qBAAqB;IACpC,KAAK,EAAE,sBAAsB,CAAC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,UAAU,CAAC;IAClB,OAAO,EAAE,qBAAqB,CAAC;IAC/B;;;;;;;;;;OAUG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE;QAC1B,WAAW,EAAE,WAAW,CAAC;QACzB,MAAM,EAAE,OAAO,CAAC;QAChB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC,CAAC;CACJ;AAED,MAAM,WAAW,oBAAoB;IACnC,KAAK,CAAC,EAAE,sBAAsB,CAAC;IAC/B,MAAM,CAAC,EAAE,UAAU,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,qBAAqB;IACpC,MAAM,CAAC,OAAO,EAAE,qBAAqB,GAAG,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAC;CAC9E;AAwCD;;;;;;;;;;;;GAYG;AACH,qBAAa,YAAY;IAIX,OAAO,CAAC,QAAQ,CAAC,MAAM;IAHnC;;OAEG;gBAC0B,MAAM,EAAE,kBAAkB;IAMvD;;;;;;;;;;;OAWG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;IAQ7E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAoCG;IACI,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,OAAO,GAAG,cAAc,CAAC,UAAU,CAAC;IAorBxF;;;;;;;;;;;;;;;;;;;;;OAqBG;IACG,MAAM,CAAC,KAAK,EAAE,sBAAsB,EAAE,iBAAiB,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAQxF;;;;;;;;;;;;;OAaG;IACI,YAAY,CACjB,KAAK,EAAE,sBAAsB,EAC7B,iBAAiB,EAAE,MAAM,GACxB,cAAc,CAAC,UAAU,CAAC;IAuB7B;;;;;;;;;;;;OAYG;YACY,sBAAsB;IAsQrC;;;;;;;;;;;OAWG;YACW,aAAa;IA4F3B;;;;;;;;;;;;;;OAcG;YACW,cAAc;IAgC5B,OAAO,CAAC,wBAAwB;IAWhC,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,qBAAqB;CAK9B"}

package/dist/orchestration/runtime/GraphRuntime.js

@@ -113,8 +113,10 @@ export class GraphRuntime {
      * node of the batch runs to the end first, none of the batch's events is yielded,
      * and the error is the first in the order the nodes are declared; a node of the
      * batch counts as completed only once its edges are decided, so a node whose edges
-     * threw is in no checkpoint as completed. A resume by the `runId` of `run_start`
-     * continues from the last checkpoint the store saved.
+     * threw is in no checkpoint as completed. The checkpoint saved before an expansion
+     * does not list the node the expansion came after as completed either (see
+     * {@link GraphExpansionContext.checkpointIdBefore}). A resume by the `runId` of
+     * `run_start` continues from the last checkpoint the store saved.
      *
      * @param graph - Compiled execution graph to run.
      * @param input - Initial user-provided input; frozen into `GraphState.input`.
@@ -212,7 +214,7 @@ export class GraphRuntime {
                     // no result, so a resume executes it again.
                     const failed = !result.success && !result.interrupt;
                     if (!failed) {
-                        nodeResults[nodeId] = { effectClass: node.effectClass, output: result.output, durationMs };
+                        nodeResults[nodeId] = recordedResult(node, result, durationMs);
                     }
                     const scratchWrite = failed ? undefined : result.scratchUpdate;
                     if (scratchWrite) {
@@ -494,12 +496,10 @@ export class GraphRuntime {
                 // node again, whatever its effect class.
                 const failed = !result.success && !result.interrupt;
                 if (!failed) {
-                    nodeResults[nodeId] = {
-                        effectClass: node.effectClass,
-                        output: result.output,
-                        durationMs,
-                    };
+                    nodeResults[nodeId] = recordedResult(node, result, durationMs);
                 }
+                // The state the node ran on, for the checkpoint saved before an expansion.
+                const stateBeforeWrites = state;
                 // Apply state patches produced by the node.
                 if (result.scratchUpdate && !failed) {
                     state = stateManager.updateScratch(state, result.scratchUpdate);
@@ -586,7 +586,12 @@ export class GraphRuntime {
                     let checkpointIdBefore;
                     for (const request of expansionRequests) {
                         if (!checkpointIdBefore) {
-                            checkpointIdBefore = await this.saveCheckpoint(activeGraph, runId, nodeId, state, nodeResults, completedNodes, skippedNodes, []);
+                            // The node's edges are decided after the expansion, so this
+                            // checkpoint does not list it as completed: a resume from it
+                            // routes the node once, rather than making every target of its
+                            // edges ready.
+                            const beforeExpansion = checkpointBeforeExpansion(node, state, stateBeforeWrites, nodeResults, completedNodes);
+                            checkpointIdBefore = await this.saveCheckpoint(activeGraph, runId, nodeId, beforeExpansion.state, beforeExpansion.nodeResults, beforeExpansion.visitedNodes, skippedNodes, []);
                             state = this.attachCheckpointMetadata(state, checkpointIdBefore);
                             yield { type: 'checkpoint_saved', checkpointId: checkpointIdBefore, nodeId };
                             yield { type: 'mission:checkpoint_saved', checkpointId: checkpointIdBefore, nodeId };
@@ -658,8 +663,9 @@ export class GraphRuntime {
      * evaluated on the restored state with the node's visit recorded
      * (`currentNodeId` names the node and `visitedNodes` lists it), as a node's
      * are after it runs, so the run follows the targets they pick and skips the
-     * others. A node that failed recorded no result and wrote nothing, so it runs
-     * again, from the state it ran on.
+     * others; a replayed node that picked its target itself, as the exit of a voice
+     * node does, goes to the target its recorded result names. A node that failed
+     * recorded no result and wrote nothing, so it runs again, from the state it ran on.
      *
      * @param graph - The same compiled graph that was originally invoked.
      * @param runOrCheckpointId - Either the original run id or an exact checkpoint id.
@@ -745,10 +751,7 @@ export class GraphRuntime {
                 // Nodes with side-effects that were recorded are replayed from stored output
                 // to prevent duplicate writes/calls.
                 const recorded = checkpoint.nodeResults[nodeId];
-                if (recorded &&
-                    (recorded.effectClass === 'write' ||
-                        recorded.effectClass === 'external' ||
-                        recorded.effectClass === 'human')) {
+                if (recorded && REPLAYED_EFFECT_CLASSES.has(recorded.effectClass)) {
                     yield { type: 'node_end', nodeId, output: recorded.output, durationMs: recorded.durationMs };
                     // The node does not run again, but its edges still decide where the
                     // run goes, as after a node that runs: a condition reads the state
@@ -756,10 +759,11 @@ export class GraphRuntime {
                     // checkpoint it forked, and the targets the node does not pick are
                     // skipped. That state records the node's visit, as the state after
                     // a node runs does: `currentNodeId` names the node and
-                    // `visitedNodes` lists it.
+                    // `visitedNodes` lists it. A node that picked its target itself, as
+                    // a voice node's exit does, goes to the target its result recorded.
                     state = stateManager.recordNodeVisit(state, nodeId);
                     const replayedEdges = activeGraph.edges.filter(e => e.source === nodeId);
-                    const replayedTargets = await this.evaluateEdges(replayedEdges, state, { success: true, output: recorded.output });
+                    const replayedTargets = await this.evaluateEdges(replayedEdges, state, { success: true, output: recorded.output, routeTarget: recorded.routeTarget });
                     for (const potentialTarget of replayedEdges.map(e => e.target)) {
                         if (!replayedTargets.includes(potentialTarget) &&
                             !completedNodes.includes(potentialTarget) &&
@@ -800,8 +804,10 @@ export class GraphRuntime {
                 // result, so a later resume executes it again.
                 const failed = !result.success && !result.interrupt;
                 if (!failed) {
-                    nodeResults[nodeId] = { effectClass: node.effectClass, output: result.output, durationMs };
+                    nodeResults[nodeId] = recordedResult(node, result, durationMs);
                 }
+                // The state the node ran on, for the checkpoint saved before an expansion.
+                const stateBeforeWrites = state;
                 if (result.scratchUpdate && !failed)
                     state = stateManager.updateScratch(state, result.scratchUpdate);
                 if (result.artifactsUpdate && !failed) {
@@ -873,7 +879,12 @@ export class GraphRuntime {
                     let checkpointIdBefore;
                     for (const request of expansionRequests) {
                         if (!checkpointIdBefore) {
-                            checkpointIdBefore = await this.saveCheckpoint(activeGraph, runId, nodeId, state, nodeResults, completedNodes, skippedNodes, []);
+                            // The node's edges are decided after the expansion, so this
+                            // checkpoint does not list it as completed: a resume from it
+                            // routes the node once, rather than making every target of its
+                            // edges ready.
+                            const beforeExpansion = checkpointBeforeExpansion(node, state, stateBeforeWrites, nodeResults, completedNodes);
+                            checkpointIdBefore = await this.saveCheckpoint(activeGraph, runId, nodeId, beforeExpansion.state, beforeExpansion.nodeResults, beforeExpansion.visitedNodes, skippedNodes, []);
                             state = this.attachCheckpointMetadata(state, checkpointIdBefore);
                             yield { type: 'checkpoint_saved', checkpointId: checkpointIdBefore, nodeId };
                             yield { type: 'mission:checkpoint_saved', checkpointId: checkpointIdBefore, nodeId };
@@ -1141,6 +1152,60 @@ function resultsOf(nodeResults, nodeIds) {
         .filter((id) => Object.prototype.hasOwnProperty.call(nodeResults, id))
         .map((id) => [id, nodeResults[id]]));
 }
+/**
+ * The result the run records for a node that completed or interrupted, with the
+ * target the node picked itself, when it did, so that a resume that marks the
+ * node complete from it goes there.
+ *
+ * @param node       - The node that ran.
+ * @param result     - What its executor returned.
+ * @param durationMs - How long its last attempt took.
+ */
+function recordedResult(node, result, durationMs) {
+    return {
+        effectClass: node.effectClass,
+        output: result.output,
+        durationMs,
+        ...(result.routeTarget ? { routeTarget: result.routeTarget } : {}),
+    };
+}
+/**
+ * The effect classes of the nodes a resume marks complete with their recorded
+ * output instead of running them again: a `write` or `external` node would
+ * repeat what it did outside the graph, and a `human` node would ask again.
+ */
+const REPLAYED_EFFECT_CLASSES = new Set(['write', 'external', 'human']);
+/**
+ * What the checkpoint saved before an expansion holds for the node after which
+ * the runtime hands expansion requests to the handler.
+ *
+ * The node's edges are decided after the expansion, on the graph it leaves, and
+ * a node counts as completed once its edges are decided, so the checkpoint
+ * leaves the node out of `visitedNodes`: a resume from it routes the node once
+ * by its edges. A node a resume marks complete with its recorded output keeps
+ * its result and what it wrote, as in the checkpoint of a node that interrupts.
+ * Any other node is saved as it was before it ran, with neither its result nor
+ * its writes, so a resume runs it again on the state it ran on, where a reducer
+ * does not count its writes twice, and the expansion requests it makes then go
+ * to the handler.
+ *
+ * @param node            - The node the expansion requests came after.
+ * @param stateAfterNode  - The run's state after the node ran.
+ * @param stateBeforeNode - The state the node ran on.
+ * @param nodeResults     - The results recorded in the run, the node's included.
+ * @param completedNodes  - The nodes completed in the run, the node included.
+ */
+function checkpointBeforeExpansion(node, stateAfterNode, stateBeforeNode, nodeResults, completedNodes) {
+    const visitedNodes = completedNodes.filter((id) => id !== node.id);
+    if (REPLAYED_EFFECT_CLASSES.has(node.effectClass)) {
+        return { state: stateAfterNode, nodeResults, visitedNodes };
+    }
+    return {
+        state: stateBeforeNode,
+        nodeResults: Object.fromEntries(Object.entries(nodeResults).filter(([resultNodeId]) => resultNodeId !== node.id)),
+        visitedNodes,
+    };
+}
 /**
  * Promise-based sleep utility for retry backoff delays.
  *