@smthrs/harness 0.0.0-stage → 1.0.0-rc.3

package/dist/esm/Supervisor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Supervisor.js","sourceRoot":"","sources":["../../src/Supervisor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8DG;AAEH,OAAO,KAAK,UAAU,MAAM,0BAA0B,CAAA;AAEtD,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AAEvC,OAAO,KAAK,KAAK,MAAM,qBAAqB,CAAA;AAC5C,OAAO,EAAE,kBAAkB,EAAE,MAAM,kCAAkC,CAAA;AACrE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAA;AAC3D,OAAO,KAAK,SAAS,MAAM,gBAAgB,CAAA;AAE3C;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,IAAI,CAAA;AAE9B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAA;AAE7B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAA;AAE9B;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,KAAK,CAAA;AAEjC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAA;AAE9B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,GAAG,CAAA;AAE9B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAA;AAE5B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,GAAG,CAAA;AAE5B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAA;AAUhE;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAU,CAAA;AAEzD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,eAAe,EAAE,YAAY,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC,CAAA;AAUrG;;;;;GAKG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,YAAY,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,WAAW,CAAU,CAAA;AAU7F;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IACjC,KAAK,EAAE,kBAAkB;IACzB,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,qCAAqC,EAAE,CAAC;IACpF,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,kDAAkD,EAAE,CAAC;IAClG,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,0CAA0C,EAAE,CAAC;IAC5F,UAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;IACnF,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,0CAA0C,EAAE,CAAC;CAC9F,CAAC,CAAA;AAUF;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IACnC,KAAK,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,2CAA2C,EAAE,CAAC;IAChG,SAAS,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,qCAAqC,EAAE,CAAC;IAC9F,cAAc,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,yCAAyC,EAAE,CAAC;IACvG,YAAY,EAAE,kBAAkB,CAAC,QAAQ,CAAC;QACxC,WAAW,EAAE,8EAA8E;KAC5F,CAAC;IACF,SAAS,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mCAAmC,EAAE,CAAC;IAC5F,eAAe,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,8CAA8C,EAAE,CAAC;IAC7G,SAAS,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,+DAA+D,EAAE,CAAC;IACpH,KAAK,EAAE,kBAAkB,CAAC,QAAQ,CAAC;QACjC,WAAW,EAAE,kEAAkE;KAChF,CAAC;IACF,SAAS,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,iCAAiC,EAAE,CAAC;IAC1F,aAAa,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mDAAmD,EAAE,CAAC;IAChH,kBAAkB,EAAE,kBAAkB,CAAC,QAAQ,CAAC;QAC9C,WAAW,EAAE,oDAAoD;KAClE,CAAC;IACF,WAAW,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,yCAAyC,EAAE,CAAC;IACpG,YAAY,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,6BAA6B,EAAE,CAAC;IACzF,gBAAgB,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,2CAA2C,EAAE,CAAC;IAC3G,cAAc,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,yCAAyC,EAAE,CAAC;IACvG,iBAAiB,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,kDAAkD,EAAE,CAAC;IACnH,YAAY,EAAE,kBAAkB,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,8CAA8C,EAAE,CAAC;IAC1G,iBAAiB,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mDAAmD,EAAE,CAAC;CACjH,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,GAAG,EAAE,MAAM,CAAC,MAAM;IAClB,IAAI,EAAE,MAAM,CAAC,MAAM;CACpB,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,EAAE,CAAA;AAE5B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,GAAG,CAAA;AAE7B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,CAAA;AAE7B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IACjC,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mDAAmD,EAAE,CAAC;IACzG,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,oCAAoC,EAAE,CAAC;CACpF,CAAC,CAAA;AAUF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,WAAmB,EAAE,IAAY,EAAS,EAAE,CAAC,CAAC;IAChF,IAAI;IACJ,WAAW,EAAE,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,UAAU,EAAE,SAAS,CAAC,EAAE,wBAAwB,IAAI,EAAE,CAAC;IAC1G,IAAI;CACL,CAAC,CAAA;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;IACpC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mCAAmC,EAAE,CAAC;IAClF,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,iCAAiC,EAAE,CAAC;IACxF,OAAO,EAAE,OAAO;IAChB,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC;QACnC,WAAW,EAAE,qEAAqE;KACnF,CAAC;IACF,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,mCAAmC,EAAE,CAAC;IAClG,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,EAAE,uCAAuC,EAAE,CAAC;CAChG,CAAC,CAAA;AAUF;;;;;GAKG;AACH,MAAM,cAAc,GAAG;IACrB,SAAS,EAAE,UAAU,CAAC,OAAO,CAAC;QAC5B,YAAY,EACV,0OAA0O;QAC5O,QAAQ,EAAE;YACR,IAAI,EACF,wLAAwL;YAC1L,KAAK,EACH,0HAA0H;SAC7H;KACF,CAAC;IACF,SAAS,EAAE,UAAU,CAAC,OAAO,CAAC;QAC5B,YAAY,EACV,uGAAuG;QACzG,QAAQ,EAAE;YACR,IAAI,EAAE,gEAAgE;YACtE,KAAK,EAAE,wFAAwF;SAChG;KACF,CAAC;IACF,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC;QAC1B,YAAY,EACV,gLAAgL;QAClL,QAAQ,EAAE;YACR,IAAI,EACF,kHAAkH;YACpH,KAAK,EAAE,qFAAqF;SAC7F;KACF,CAAC;IACF,gBAAgB,EAAE,UAAU,CAAC,OAAO,CAAC;QACnC,YAAY,EACV,+KAA+K;QACjL,QAAQ,EAAE;YACR,IAAI,EAAE,sGAAsG;YAC5G,KAAK,EAAE,oEAAoE;SAC5E;KACF,CAAC;IACF,kBAAkB,EAAE,UAAU,CAAC,OAAO,CAAC;QACrC,YAAY,EACV,+KAA+K;QACjL,QAAQ,EAAE;YACR,IAAI,EAAE,yFAAyF;YAC/F,KAAK,EAAE,0FAA0F;SAClG;KACF,CAAC;IACF,UAAU,EAAE,UAAU,CAAC,KAAK,CAAC;QAC3B,YAAY,EACV,oOAAoO;QACtO,QAAQ,EAAE,MAAM;KACjB,CAAC;IACF,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC;QACxB,YAAY,EACV,8KAA8K;QAChL,QAAQ,EAAE,MAAM;KACjB,CAAC;IACF,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC;QACvB,YAAY,EACV,wNAAwN;QAC1N,QAAQ,EAAE,MAAM;KACjB,CAAC;IACF,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC;QACzB,YAAY,EACV,kLAAkL;QACpL,QAAQ,EAAE,MAAM;KACjB,CAAC;IACF,SAAS,EAAE,UAAU,CAAC,KAAK,CAAC;QAC1B,YAAY,EACV,8MAA8M;QAChN,QAAQ,EAAE,MAAM;KACjB,CAAC;IACF,UAAU,EAAE,UAAU,CAAC,MAAM,CAAC;QAC5B,YAAY,EACV,4GAA4G;QAC9G,QAAQ,EAAE;YACR,IAAI,EAAE,+BAA+B;YACrC,aAAa,EAAE,oFAAoF;YACnG,UAAU,EAAE,0EAA0E;YACtF,KAAK,EAAE,yDAAyD;YAChE,YAAY,EAAE,4EAA4E;SAC3F;KACF,CAAC;CACM,CAAA;AAEV;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,UAAU,CAAA;AAUvC,MAAM,OAAO,GAAG,CAAC,KAAuB,EAAE,EAAE,CAC1C,UAAU,CAAC,IAAI,CAAC,iBAAiB,EAAE;IACjC,WAAW,EACT,wMAAwM;IAC1M,KAAK,EAAE,QAAQ;IACf,SAAS,EAAE,EAAE,GAAG,cAAc,EAAE,GAAG,KAAK,EAAE;CAC3C,CAAC,CAAA;AAEJ,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2F,CAAA;AAEhH;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAuB,EAA8B,EAAE;IACnF,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAmC,CAAA;IACtE,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACzB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAA;IAC3F,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAA;IAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;IAC/B,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,aAAa,CAAC,EAAE,CAAC,CAAA;AA6B3C;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,QAAkB,EAAE,KAAuB,EAA8C,EAAE,CAC9G,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,QAAQ,CAAC,CAAA;IAChF,MAAM,GAAG,GAAG,OAAsD,CAAA;IAClE,wEAAwE;IACxE,+DAA+D;IAC/D,MAAM,IAAI,GAAG,CAAC,EAAU,EAAU,EAAE,CAAE,GAAG,CAAC,EAAE,CAA8B,CAAC,WAAW,CAAA;IACtF,OAAO;QACL,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,WAAW;QACxC,QAAQ,EAAE,OAAO,CAAC,SAAS,CAAC,WAAW;QACvC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,WAAW;QACpC,eAAe,EAAE,OAAO,CAAC,gBAAgB,CAAC,WAAW;QACrD,iBAAiB,EAAE,OAAO,CAAC,kBAAkB,CAAC,WAAW;QACzD,QAAQ,EAAE;YACR,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,KAAK;YACpC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK;YAC9B,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,KAAK;YAC5B,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,KAAK;YAChC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,KAAK;SACnC;QACD,SAAS,EAAE,OAAO,CAAC,UAAU,CAAC,KAAK;QACnC,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxG,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,GAAG,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5D,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE;KACxG,CAAA;AACH,CAAC,CAAC,CAAA;AAmCJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,UAAU,GAAW;IAChC,KAAK,EAAE,KAAK;IACZ,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAChC,QAAQ,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI;CAC5B,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,OAAO,CAAC,SAAS,CAAS,mCAAmC,EAAE;IACnF,YAAY,EAAE,GAAG,EAAE,CAAC,UAAU;CAC/B,CAAC,CAAA;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,SAAS,EAAE,CAAC,OAAoB,EAAW,EAAE,CAAC,OAAO,CAAC,SAAS,IAAI,WAAW;IAC9E,UAAU,EAAE,CAAC,OAAoB,EAAW,EAAE,CAAC,OAAO,CAAC,QAAQ,IAAI,WAAW;IAC9E,OAAO,EAAE,CAAC,OAAoB,EAAW,EAAE,CAAC,OAAO,CAAC,OAAO,IAAI,SAAS;IACxE,gBAAgB,EAAE,CAAC,OAAoB,EAAW,EAAE,CAAC,OAAO,CAAC,eAAe,IAAI,SAAS;IACzF,kBAAkB,EAAE,CAAC,OAAoB,EAAW,EAAE,CAAC,OAAO,CAAC,iBAAiB,IAAI,SAAS;CACrF,CAAA;AAkBV;;;;;GAKG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,OAAoB,EAA0B,EAAE,CACvE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAoB,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAA;AAErF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,kBAAkB,EAAE,oBAAoB,CAAU,CAAA;AAUlF,MAAM,SAAS,GAAG,CAAC,OAAgB,EAA6B,EAAE,CAC/D,eAA0C,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;AAE/D;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,OAAoB,EAAW,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAA;AAEnH;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,OAAoB,EAAiC,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;AAEvH;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,QAAkB,EAAE,OAAgB,EAAU,EAAE;IACpE,MAAM,EAAE,OAAO,EAAE,GAAG,QAAQ,CAAA;IAC5B,MAAM,IAAI,GAAqD;QAC7D,SAAS,EAAE,+BAA+B,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;QACzE,UAAU,EAAE,qCAAqC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;QAC/E,OAAO,EAAE,yCAAyC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;KAChF,CAAA;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACvF,MAAM,QAAQ,GAAkB,EAAE,CAAA;IAClC,IAAI,OAAO,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;QAC9B,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,aAAa,SAAS,OAAO,CAAC,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,wBAAwB,CAAC,CAAA;IAChH,CAAC;IACD,IAAI,OAAO,CAAC,kBAAkB,GAAG,CAAC,EAAE,CAAC;QACnC,QAAQ,CAAC,IAAI,CACX,GAAG,OAAO,CAAC,kBAAkB,iBAC3B,OAAO,CAAC,kBAAkB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAC1C,2BAA2B,CAC5B,CAAA;IACH,CAAC;IACD,IAAI,OAAO,CAAC,YAAY,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,YAAY,4CAA4C,CAAC,CAAA;IAChH,IAAI,OAAO,CAAC,cAAc,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,cAAc,qCAAqC,CAAC,CAAA;IAC7G,IAAI,OAAO,CAAC,WAAW,GAAG,CAAC;QAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,WAAW,OAAO,OAAO,CAAC,YAAY,eAAe,CAAC,CAAA;IAC5G,QAAQ,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,SAAS,SAAS,OAAO,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,wBAAwB,CAAC,CAAA;IACtG,4EAA4E;IAC5E,gFAAgF;IAChF,OAAO,4CAA4C,QAAQ,CAAC,MAAM,CAAC,MAAM,0BAA0B,OAAO,CAAC,KAAK,cAC9G,KAAK,CAAC,IAAI,CAAC,IAAI,CACjB,uBAAuB,OAAO,CAAC,KAAK,KAClC,QAAQ,CAAC,IAAI,CAAC,IAAI,CACpB,wOAAwO,CAAA;AAC1O,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAAa,EAAU,EAAE,CAAC,mCAAmC,GAAG,CAAC,GAAG,OAAO,GAAG,CAAC,IAAI,EAAE,CAAA;AAEpH;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,UAAU,EAAE,SAAS,CAAC,CAAA;AAE5F;;;;;GAKG;AACH,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAU,EAAE;IAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAA;IAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,CAAA;IACjD,OAAO,IAAI,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,2BAA2B,IAAI,EAAE,CAAA;AACrF,CAAC,CAAA;AAED,MAAM,UAAU,GAAG,mEAAmE,CAAA;AAEtF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAA","sourcesContent":["/**\n * The reading Jev takes of a run while it is still running.\n *\n * Every other control in this package reads a completion, or reads one fact\n * the harness measured: a tree that never moved, a check that was narrowed, a\n * frame that repeated itself. Each is exact, each fires late, and each is\n * silent about the run between its brakes. A run that edits the wrong file\n * for twenty frames, re-runs one failing check after every edit and never\n * once claims to be done trips none of them until its budget is gone.\n *\n * So this module asks Jev about the run's *shape* rather than its sentence.\n * One classifier, `supervisor/turn`, over a {@link Snapshot} the controller\n * assembles from what it already holds: the task, the newest frames, and the\n * counts the deterministic controls keep — read-only streak, repeat streak,\n * mutations, checks run and failing, unanswered failures, demands spent. It\n * re-derives none of them. Beside the run's state it carries the skills it has\n * not called, the flows it has, and whether it can call `jev`. One Jev call per\n * snapshot answers every question at once.\n *\n * Eleven questions are fixed. Five are about the run: whether it is\n * thrashing, whether it is still on the task, whether its evidence is\n * suspect, and whether it carries outdated or irrelevant context. Five are\n * operational states a person would recognise in a colleague, each scored\n * `none`, `mild` or `strong` against evidence the snapshot names, and\n * `needs_help` is the one word a person is shown. The five about the run are\n * the {@link triggers}: any one past its threshold crosses. Each monitor the\n * host arms may add one boolean of its own, under {@link monitorPrefix}.\n *\n * Rows recalled from {@link Memory} are not asked about here. Beside each\n * reading, the supervisor asks `Relevance` which of up to\n * {@link recalledLimit} rows, none already shown to the run, are unnecessary\n * for the task; the rest are shown at the next boundary as\n * {@link recalledInsert} renders them, and a row is shown to a run once.\n *\n * It is a supervisor and not a brake: nothing here ends a run, refuses a\n * completion, or decides anything on the cell loop's hot path. `CellTurn`\n * offers each frame's snapshot to a one-slot sliding queue and continues; a\n * forked fiber takes the newest snapshot, asks, journals what came back, and\n * hands the monitors' values and any recalled rows to the *next* turn boundary,\n * which decides there what the run is told. A reading that arrives after the boundary it was for is\n * journaled and never delivered, and a snapshot the fiber never reached is\n * dropped: the run is never told something about a frame two frames gone.\n *\n * It never falls back. A snapshot Jev could not read is journaled as\n * {@link AgentEvent.SupervisorUnjudged} with the transport's own reason; it\n * nudges nothing, and is never counted as a reading that\n * found the run calm or on target. A host with no judge (`unconfigured`) is\n * journaled once per streak rather than every frame; each reading still asks,\n * so a judge connected mid-run is used at once. Nothing here is a default value: every\n * level and every word on the settled event came back from the transport.\n *\n * What a reading says is delivered wherever the host holds a real judge\n * (`CellTurn.Input.judged`), and only through a monitor that crossed and\n * passed its gates; the text of the legacy nudge is {@link nudge}, which the\n * `supervisor` lint monitor says. The offline replay of archived journals\n * (`evals/swebench/lib/jev-replay.mjs`, which scores {@link triggers} itself\n * rather than a copy of it) measures their precision. The verdict is\n * journaled whenever an `Evaluator` is bound. The supervisor writes no\n * memory: a run's transcript is mined once, at run end, by `@smthrs/agent`'s\n * `MemoryMine`.\n *\n * @since 1.0.0-rc.0\n */\n\nimport * as Classifier from \"@smthrs/model/Classifier\"\nimport type * as Evaluator from \"@smthrs/model/Evaluator\"\nimport * as Context from \"effect/Context\"\nimport * as Effect from \"effect/Effect\"\nimport * as Schema from \"effect/Schema\"\nimport type * as AgentEvent from \"./AgentEvent.ts\"\nimport * as elide from \"./internal/elide.ts\"\nimport { NonNegativeSafeInt } from \"./internal/nonNegativeSafeInt.ts\"\nimport { untrustedData } from \"./internal/untrustedData.ts\"\nimport * as Judgement from \"./Judgement.ts\"\n\n/**\n * The most of one frame's cell, prose or prints the snapshot carries, in\n * UTF-8 bytes. The head of a cell and the tail of its prints: a cell states\n * its plan first and a runner states its verdict last.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const frameBytes = 1024\n\n/**\n * How many of the newest frames a snapshot carries.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const recentFrames = 3\n\n/**\n * The most rows one reading recalls from {@link Memory}.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const recalledLimit = 6\n\n/**\n * How long a run that ends with a reading in flight waits for it to settle\n * and journal, in milliseconds. A reading still unanswered then is interrupted\n * and journaled `supervisor-unjudged` with reason `interrupted`; the run never\n * waits longer than this for its supervisor.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const closeGraceMs = 1_500\n\n/**\n * At or above this probability of `thrashing`, the reading crosses.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const thrashingAt = 0.5\n\n/**\n * At or below this probability of `on_target`, the reading crosses.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const offTargetAt = 0.5\n\n/**\n * At or above this probability of `suspect`, the reading crosses.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const suspectAt = 0.5\n\n/**\n * At or above this probability of `outdated_context` or\n * `irrelevant_context`, a judged run compacts at its next frame.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const contextAt = 0.5\n\n/**\n * The three rungs every operational-state question is scored on.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Level = Schema.Literals([\"none\", \"mild\", \"strong\"])\n\n/**\n * The decoded form of {@link Level}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Level = typeof Level.Type\n\n/**\n * The rungs as the score question declares them, in order.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const levels = [\"none\", \"mild\", \"strong\"] as const\n\n/**\n * The one word a person is shown about a run.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Help = Schema.Literals([\"none\", \"clarification\", \"permission\", \"stuck\", \"risky_action\"])\n\n/**\n * The decoded form of {@link Help}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Help = typeof Help.Type\n\n/**\n * The five operational states, in the order they are asked and journaled.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const emotions = [\"frustrated\", \"anxious\", \"scared\", \"confused\", \"confident\"] as const\n\n/**\n * One of {@link emotions}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Emotion = typeof emotions[number]\n\n/**\n * One recent frame as the snapshot carries it: the cell the model wrote, the\n * prose around it, what the cell printed, and how it ended.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Frame = Schema.Struct({\n  frame: NonNegativeSafeInt,\n  cell: Schema.String.annotate({ description: \"The cell the model wrote, head kept\" }),\n  prose: Schema.String.annotate({ description: \"What the model wrote outside the cell, head kept\" }),\n  printed: Schema.String.annotate({ description: \"What the cell printed, newest bytes kept\" }),\n  transition: Schema.Literals([\"continue\", \"complete\", \"park\", \"raised\", \"rejected\"]),\n  mutated: Schema.Boolean.annotate({ description: \"Whether this frame changed the workspace\" })\n})\n\n/**\n * The decoded form of {@link Frame}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Frame = typeof Frame.Type\n\n/**\n * The counts the deterministic controls keep, handed over as they stand.\n *\n * Every field is read off `CellTurn.State` or the frame's accounting and none\n * is re-derived here: the supervisor is a reader of the harness's evidence,\n * not a second measurer of it.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Signals = Schema.Struct({\n  frame: NonNegativeSafeInt.annotate({ description: \"The frame just closed, counting from zero\" }),\n  maxFrames: NonNegativeSafeInt.annotate({ description: \"The frame budget; zero is unbounded\" }),\n  readOnlyFrames: NonNegativeSafeInt.annotate({ description: \"Consecutive frames that changed nothing\" }),\n  repeatFrames: NonNegativeSafeInt.annotate({\n    description: \"Consecutive frames that issued only calls already issued and changed nothing\"\n  }),\n  mutations: NonNegativeSafeInt.annotate({ description: \"Frames that changed the workspace\" }),\n  remoteMutations: NonNegativeSafeInt.annotate({ description: \"Writes recorded on trees the host cannot see\" }),\n  treeMoved: Schema.Boolean.annotate({ description: \"Whether the workspace differs from the tree the run opened on\" }),\n  paths: NonNegativeSafeInt.annotate({\n    description: \"Paths the closing workspace measurement covered; zero unmeasured\"\n  }),\n  checksRun: NonNegativeSafeInt.annotate({ description: \"Distinct checks the run has run\" }),\n  checksFailing: NonNegativeSafeInt.annotate({ description: \"Of those, how many last reported a failing status\" }),\n  failuresUnanswered: NonNegativeSafeInt.annotate({\n    description: \"Failing checks no later passing check has answered\"\n  }),\n  callsFailed: NonNegativeSafeInt.annotate({ description: \"Settled calls in the ledger that failed\" }),\n  callsSettled: NonNegativeSafeInt.annotate({ description: \"Settled calls in the ledger\" }),\n  narrowingDemands: NonNegativeSafeInt.annotate({ description: \"Completions bounced for narrowed evidence\" }),\n  unmovedDemands: NonNegativeSafeInt.annotate({ description: \"Completions bounced for an unmoved tree\" }),\n  unresolvedDemands: NonNegativeSafeInt.annotate({ description: \"Completions bounced for a stepped-around failure\" }),\n  claimDemands: NonNegativeSafeInt.annotate({ description: \"Completions bounced for an unsupported claim\" }),\n  sufficiencyStated: Schema.Boolean.annotate({ description: \"Whether the run was told its evidence is complete\" })\n})\n\n/**\n * The decoded form of {@link Signals}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Signals = typeof Signals.Type\n\n/**\n * One row recalled from memory.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Recalled = Schema.Struct({\n  key: Schema.String,\n  text: Schema.String\n})\n\n/**\n * The decoded form of {@link Recalled}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Recalled = typeof Recalled.Type\n\n/**\n * The most skills one snapshot offers.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const skillLimit = 12\n\n/**\n * The most of one skill's description a snapshot carries, in UTF-8 bytes.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const skillBytes = 256\n\n/**\n * The most distinct flow names {@link Snapshot} `called` carries.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const calledLimit = 64\n\n/**\n * One skill the run could read and has neither called nor read.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Skill = Schema.Struct({\n  name: Schema.String,\n  description: Schema.String.annotate({ description: \"The description's head, wrapped as untrusted data\" }),\n  path: Schema.String.annotate({ description: \"Where the skill's Markdown body is\" })\n})\n\n/**\n * The decoded form of {@link Skill}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Skill = typeof Skill.Type\n\n/**\n * One skill as a snapshot offers it: its description's head within\n * {@link skillBytes}, wrapped as untrusted data.\n *\n * @category constructors\n * @since 1.0.0-rc.0\n */\nexport const skill = (name: string, description: string, path: string): Skill => ({\n  name,\n  description: untrustedData(elide.head(description, skillBytes, \"clipped\"), `description of skill ${name}`),\n  path\n})\n\n/**\n * Everything one supervisor reading is a reading of.\n *\n * @category schemas\n * @since 1.0.0-rc.0\n */\nexport const Snapshot = Schema.Struct({\n  task: Schema.String.annotate({ description: \"The task, as the person stated it\" }),\n  frames: Schema.Array(Frame).annotate({ description: \"The newest frames, oldest first\" }),\n  signals: Signals,\n  skills: Schema.Array(Skill).annotate({\n    description: \"Skills the run could read and has neither called nor read, by index\"\n  }),\n  called: Schema.Array(Schema.String).annotate({ description: \"Distinct flows the run has called\" }),\n  jevAvailable: Schema.Boolean.annotate({ description: \"Whether the run can call the jev flow\" })\n})\n\n/**\n * The decoded form of {@link Snapshot}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Snapshot = typeof Snapshot.Type\n\n/**\n * The fixed questions, asked of every snapshot.\n *\n * Each criterion names the evidence it reads, so a reading is answerable from\n * the snapshot and never from what the transport imagines the repository holds.\n */\nconst fixedQuestions = {\n  thrashing: Classifier.boolean({\n    instructions:\n      \"Is the run going in circles rather than converging? Compare the newest frames with each other and with signals.checksFailing, signals.failuresUnanswered, signals.readOnlyFrames and signals.repeatFrames. Any one sign below is enough.\",\n    criteria: {\n      true:\n        \"a check fails again after an edit meant to fix it, an edit is redone or reverted, or the newest frames re-read or re-run what earlier frames already saw without learning anything new\",\n      false:\n        \"the newest frames learn something new or make progress: a failing check now passes, or a new cause is found and acted on\"\n    }\n  }),\n  on_target: Classifier.boolean({\n    instructions:\n      \"Is the run still working on the task as stated? Read the task and the newest frames' cells and prose.\",\n    criteria: {\n      true: \"the newest frames read, edit or check the thing the task names\",\n      false: \"the newest frames work on something the task does not ask for, or have drifted from it\"\n    }\n  }),\n  suspect: Classifier.boolean({\n    instructions:\n      \"Is the run's evidence suspect? Read the newest frames for tests edited to pass, edits to a file the task does not concern, or prose claiming a result no printed output shows.\",\n    criteria: {\n      true:\n        \"a test was changed rather than the code under test, the wrong file was edited, or a claim has no check behind it\",\n      false: \"edits are to the code the task names and every claim has a printed result behind it\"\n    }\n  }),\n  outdated_context: Classifier.boolean({\n    instructions:\n      \"Do the newest frames show earlier context that is now factually wrong or stale? Judge only evidence visible in the task and frames; do not assume unseen history is outdated.\",\n    criteria: {\n      true: \"a later observation explicitly contradicts an earlier assumption or file state in the visible frames\",\n      false: \"no visible contradiction, or the earlier context is still accurate\"\n    }\n  }),\n  irrelevant_context: Classifier.boolean({\n    instructions:\n      \"Do the newest frames show earlier context that is accurate but no longer useful for the task? Do not treat the task, a reusable PRD, or decisions still needed as irrelevant.\",\n    criteria: {\n      true: \"the visible frames explicitly move away from earlier work that will not be needed again\",\n      false: \"the earlier work may still be needed, or the visible frames do not establish irrelevance\"\n    }\n  }),\n  frustrated: Classifier.score({\n    instructions:\n      \"How frustrated is the run: the same check failing repeatedly, edits reverted, attempts not converging? Read signals.checksFailing, signals.failuresUnanswered, signals.repeatFrames, signals.readOnlyFrames and the newest frames.\",\n    criteria: levels\n  }),\n  anxious: Classifier.score({\n    instructions:\n      \"How anxious is the run: its own prose hedges or expresses uncertainty while the evidence is thin? Read the frames' prose against signals.checksRun and signals.callsSettled.\",\n    criteria: levels\n  }),\n  scared: Classifier.score({\n    instructions:\n      \"How scared should a person be: is the run taking or considering a destructive, irreversible or out-of-scope action, or hitting permission or sandbox refusals? Read the newest frames' cells, prints and failed calls.\",\n    criteria: levels\n  }),\n  confused: Classifier.score({\n    instructions:\n      \"How confused is the run: the task is ambiguous or contradicted by the repository, and the run keeps switching interpretations or files? Read the task against the newest frames.\",\n    criteria: levels\n  }),\n  confident: Classifier.score({\n    instructions:\n      \"How confident should a person be that the work converges on the task: checks pass and each frame builds on the last? Read signals.checksRun, signals.checksFailing, signals.mutations and the newest frames.\",\n    criteria: levels\n  }),\n  needs_help: Classifier.choice({\n    instructions:\n      \"What, if anything, does the run need from a person right now? Read the states above and the newest frames.\",\n    criteria: {\n      none: \"nothing; the run can carry on\",\n      clarification: \"the task is ambiguous or contradicted and a person must say which reading is meant\",\n      permission: \"the run is blocked on a permission or sandbox refusal a person can grant\",\n      stuck: \"the run is not converging and a person should intervene\",\n      risky_action: \"the run is about to do something destructive, irreversible or out of scope\"\n    }\n  })\n} as const\n\n/**\n * The prefix of every question a monitor adds to a reading; the rest of the\n * id is the monitor's own.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const monitorPrefix = \"monitor_\"\n\n/**\n * The questions a snapshot's monitors add, by `monitor_<id>`.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type MonitorQuestions = Readonly<Record<`${typeof monitorPrefix}${string}`, Classifier.BooleanQuestion>>\n\nconst declare = (extra: MonitorQuestions) =>\n  Classifier.make(\"supervisor/turn\", {\n    description:\n      \"Read one running agent's newest frames and the counts its harness keeps: whether it is thrashing, on the task and honest; its operational state in five scored words; and what it needs from a person.\",\n    state: Snapshot,\n    questions: { ...fixedQuestions, ...extra }\n  })\n\nconst cache = new Map<string, { readonly extra: MonitorQuestions; readonly made: ReturnType<typeof declare> }>()\n\n/**\n * The classifier for a snapshot with these monitor questions.\n *\n * The fixed questions are the same for every snapshot and the monitors' follow\n * them, so a snapshot with no monitor questions asks the eleven fixed\n * questions and no others. Declared once per set of monitor ids, and again\n * when a monitor id asks a different question, because the digest is the\n * canonical hash of the questions and the journal names it.\n *\n * @category classifiers\n * @since 1.0.0-rc.0\n */\nexport const classifierFor = (extra: MonitorQuestions): ReturnType<typeof declare> => {\n  const ids = Object.keys(extra).sort() as Array<keyof MonitorQuestions>\n  const key = ids.join(\",\")\n  const held = cache.get(key)\n  if (held !== undefined && ids.every((id) => held.extra[id] === extra[id])) return held.made\n  const made = declare(extra)\n  cache.set(key, { extra, made })\n  return made\n}\n\n/**\n * The classifier over a bare snapshot: the eleven fixed questions and no\n * monitor booleans. Its id is the id every shape shares.\n *\n * @category classifiers\n * @since 1.0.0-rc.0\n */\nexport const classifier = classifierFor({})\n\n/**\n * What one evaluation came back with, decoded.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport interface Reading {\n  readonly thrashing: number\n  readonly onTarget: number\n  readonly suspect: number\n  readonly outdatedContext: number\n  readonly irrelevantContext: number\n  readonly emotions: Readonly<Record<Emotion, Level>>\n  readonly needsHelp: Help\n  /** The probability of each monitor question asked, by monitor id. */\n  readonly monitors: Readonly<Record<string, number>>\n  readonly latencyMs: number\n  readonly usage?: Evaluator.Usage | undefined\n  /** What was asked and what came back, for `decision-settled`. */\n  readonly asked: {\n    readonly digest: string\n    readonly questions: Classifier.Questions\n    readonly state: Schema.Json\n    readonly answers: Readonly<Record<string, AgentEvent.DecisionAnswer>>\n  }\n}\n\n/**\n * Asks Jev about one snapshot, and the monitor questions `extra` adds.\n *\n * Fails, typed, whenever an answer could not be obtained: no evaluator bound,\n * a transport refusal, a deadline, an answer that does not decode. There is\n * no reading of a snapshot Jev did not read.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const read = (snapshot: Snapshot, extra: MonitorQuestions): Effect.Effect<Reading, Judgement.Unjudged> =>\n  Effect.gen(function*() {\n    const { answers, asked } = yield* Judgement.read(classifierFor(extra), snapshot)\n    const all = answers as Readonly<Record<string, Classifier.Answer>>\n    // Every declared question is answered or the decode above failed, and a\n    // monitor question is declared exactly for the ids read below.\n    const bool = (id: string): number => (all[id] as Classifier.BooleanAnswer).probability\n    return {\n      thrashing: answers.thrashing.probability,\n      onTarget: answers.on_target.probability,\n      suspect: answers.suspect.probability,\n      outdatedContext: answers.outdated_context.probability,\n      irrelevantContext: answers.irrelevant_context.probability,\n      emotions: {\n        frustrated: answers.frustrated.label,\n        anxious: answers.anxious.label,\n        scared: answers.scared.label,\n        confused: answers.confused.label,\n        confident: answers.confident.label\n      },\n      needsHelp: answers.needs_help.value,\n      monitors: Object.fromEntries(Object.keys(extra).map((id) => [id.slice(monitorPrefix.length), bool(id)])),\n      latencyMs: asked.latencyMs,\n      ...(asked.usage === undefined ? {} : { usage: asked.usage }),\n      asked: { digest: asked.digest, questions: asked.questions, state: asked.state, answers: asked.answers }\n    }\n  })\n\n/**\n * The memory a supervisor reads rows from, and the run-end transcript miner\n * writes accepted facts to.\n *\n * A port, so this package needs no memory store: the production composition\n * adapts `@smthrs/memory` to it, and a test binds a recording double. The\n * default is {@link memoryNone}, which recalls nothing and writes nothing.\n *\n * @category services\n * @since 1.0.0-rc.0\n */\nexport interface Memory {\n  /** Whether anything is behind this port; false is the default. */\n  readonly bound: boolean\n  /** Rows relevant to the query, most relevant first, bounded by the caller. */\n  readonly recall: (query: string, limit: number) => Effect.Effect<ReadonlyArray<Recalled>, MemoryFailure>\n  /**\n   * Writes one accepted fact. A store that refuses it fails typed, and the\n   * writer journals `supervisor-memory-failed` and carries on.\n   */\n  readonly remember: (text: string) => Effect.Effect<void, MemoryFailure>\n}\n\n/**\n * What a {@link Memory} fails with: the store's own account, safe to journal.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport interface MemoryFailure {\n  readonly detail: string\n}\n\n/**\n * A memory with nothing behind it.\n *\n * @category constructors\n * @since 1.0.0-rc.0\n */\nexport const memoryNone: Memory = {\n  bound: false,\n  recall: () => Effect.succeed([]),\n  remember: () => Effect.void\n}\n\n/**\n * The {@link Memory} reference, defaulting to {@link memoryNone}.\n *\n * @category services\n * @since 1.0.0-rc.0\n */\nexport const Memory = Context.Reference<Memory>(\"@smthrs/harness/Supervisor/Memory\", {\n  defaultValue: () => memoryNone\n})\n\n/**\n * The five triggers a reading fires, by name, each with the inequality that\n * fires it. The one rule: the `supervisor` lint monitor crosses on it,\n * {@link nudge} names from it, {@link compacting} reads its context triggers,\n * and the offline replay scores it, so they cannot drift apart.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const triggers = {\n  thrashing: (reading: Triggerable): boolean => reading.thrashing >= thrashingAt,\n  off_target: (reading: Triggerable): boolean => reading.onTarget <= offTargetAt,\n  suspect: (reading: Triggerable): boolean => reading.suspect >= suspectAt,\n  outdated_context: (reading: Triggerable): boolean => reading.outdatedContext >= contextAt,\n  irrelevant_context: (reading: Triggerable): boolean => reading.irrelevantContext >= contextAt\n} as const\n\n/**\n * The fields of a {@link Reading} the triggers read.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Triggerable = Pick<Reading, \"thrashing\" | \"onTarget\" | \"suspect\" | \"outdatedContext\" | \"irrelevantContext\">\n\n/**\n * One of {@link triggers}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type Trigger = keyof typeof triggers\n\n/**\n * The triggers one reading fires, in declaration order.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const triggered = (reading: Triggerable): ReadonlyArray<Trigger> =>\n  (Object.keys(triggers) as Array<Trigger>).filter((name) => triggers[name](reading))\n\n/**\n * The triggers that compact the run's context instead of nudging it.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const contextTriggers = [\"outdated_context\", \"irrelevant_context\"] as const\n\n/**\n * One of {@link contextTriggers}.\n *\n * @category models\n * @since 1.0.0-rc.0\n */\nexport type ContextTrigger = typeof contextTriggers[number]\n\nconst isContext = (trigger: Trigger): trigger is ContextTrigger =>\n  (contextTriggers as ReadonlyArray<Trigger>).includes(trigger)\n\n/**\n * Whether one reading crosses: any trigger but a context one fires. A context\n * trigger compacts the run's context at the next frame instead; see\n * {@link compacting}.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const crosses = (reading: Triggerable): boolean => triggered(reading).some((trigger) => !isContext(trigger))\n\n/**\n * The context triggers one reading fires, in declaration order: why a judged\n * run that is sent this reading compacts at its next frame.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const compacting = (reading: Triggerable): ReadonlyArray<ContextTrigger> => triggered(reading).filter(isContext)\n\n/**\n * The nudge a crossed reading puts in front of the run, naming its evidence.\n *\n * Concise on purpose, and built from counts rather than from the model's\n * prose: what the run is told is what the harness measured, and the reading's\n * probabilities say only which measurements to name.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const nudge = (snapshot: Snapshot, reading: Reading): string => {\n  const { signals } = snapshot\n  const said: Record<Exclude<Trigger, ContextTrigger>, string> = {\n    thrashing: `repeating itself (thrashing ${reading.thrashing.toFixed(2)})`,\n    off_target: `drifting from the task (on target ${reading.onTarget.toFixed(2)})`,\n    suspect: `standing on suspect evidence (suspect ${reading.suspect.toFixed(2)})`\n  }\n  const found = triggered(reading).flatMap((name) => isContext(name) ? [] : [said[name]])\n  const evidence: Array<string> = []\n  if (signals.checksFailing > 0) {\n    evidence.push(`${signals.checksFailing} check${signals.checksFailing === 1 ? \"\" : \"s\"} last reported failing`)\n  }\n  if (signals.failuresUnanswered > 0) {\n    evidence.push(\n      `${signals.failuresUnanswered} failing check${\n        signals.failuresUnanswered === 1 ? \"\" : \"s\"\n      } never answered by a pass`\n    )\n  }\n  if (signals.repeatFrames > 0) evidence.push(`${signals.repeatFrames} consecutive frames repeated earlier calls`)\n  if (signals.readOnlyFrames > 0) evidence.push(`${signals.readOnlyFrames} consecutive frames changed nothing`)\n  if (signals.callsFailed > 0) evidence.push(`${signals.callsFailed} of ${signals.callsSettled} calls failed`)\n  evidence.push(`${signals.mutations} frame${signals.mutations === 1 ? \"\" : \"s\"} changed the workspace`)\n  // The counts are the ones the run held when frame N closed; by the time the\n  // run reads this it has written at least one frame more, so the frame is named.\n  return `Supervisor: a reading of this run's last ${snapshot.frames.length} frames, through frame ${signals.frame}, finds it ${\n    found.join(\", \")\n  }. Evidence at frame ${signals.frame}: ${\n    evidence.join(\"; \")\n  }. Before the next call, state in one sentence which mechanism you now believe is wrong and which single call would show it; then make that call. Do not re-run a check over an unchanged tree, and do not edit a test to make it pass.`\n}\n\n/**\n * Renders one recalled row as the run reads it.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const recalledInsert = (row: Recalled): string => `From memory of this repository (${row.key}):\\n${row.text}`\n\n/**\n * The head of a frame's cell or prose, bounded by {@link frameBytes}.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const head = (text: string): string => elide.head(text.trim(), frameBytes, \"clipped\")\n\n/**\n * The newest {@link frameBytes} of a frame's prints.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const tail = (text: string): string => {\n  const trimmed = text.trim()\n  const kept = elide.tailSlice(trimmed, frameBytes)\n  return kept.length === trimmed.length ? trimmed : `[… older bytes elided]\\n${kept}`\n}\n\nconst fencedCell = /```(?:cell|typescript|ts|javascript|js)[^\\n]*\\n[\\s\\S]*?(?:```|$)/g\n\n/**\n * What the model wrote around its cell: the reply with every fenced cell\n * removed. The anxiety question reads it, and so does the run-end\n * transcript miner.\n *\n * @category conversions\n * @since 1.0.0-rc.0\n */\nexport const prose = (text: string): string => text.replace(fencedCell, \"\").trim()\n"]}

package/dist/esm/Tokens.d.ts

@@ -0,0 +1,86 @@
+/**
+ * Deterministic token accounting for context windows.
+ *
+ * @since 0.1.0
+ */
+import { Schema } from "effect";
+declare const Count_base: Schema.Class<Count, Schema.Struct<{
+    readonly value: Schema.Int;
+    readonly estimated: Schema.Boolean;
+}>, {}>;
+/**
+ * A token count, and whether it was estimated locally or reported by a
+ * provider. The flag travels with the number so a consumer never mistakes
+ * an approximation for billing data.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export declare class Count extends Count_base {
+}
+declare const Segment_base: Schema.Class<Segment, Schema.Struct<{
+    readonly digest: Schema.String;
+    readonly zone: Schema.Literals<readonly ["prefix", "tail"]>;
+    readonly tokens: typeof Count;
+}>, {}>;
+/**
+ * One segment's contribution to the accounting, keyed by its content
+ * digest so an unchanged segment keeps its count across turns.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export declare class Segment extends Segment_base {
+}
+declare const Accounting_base: Schema.Class<Accounting, Schema.Struct<{
+    readonly prefix: typeof Count;
+    readonly tail: typeof Count;
+    readonly total: typeof Count;
+    readonly bySegment: Schema.$Array<typeof Segment>;
+}>, {}>;
+/**
+ * The token totals of a whole context window, split by cache zone and
+ * broken down per segment.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export declare class Accounting extends Accounting_base {
+}
+/** A deterministic local approximation, not provider billing data.
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export type Estimator = (text: string) => number;
+/**
+ * Estimates tokens using four characters per token, with code punctuation and
+ * newline density accounting for the typically shorter tokens in source text.
+ *
+ * @category constructors
+ * @since 0.1.0
+ * @slop
+ */
+export declare const estimate: Estimator;
+/**
+ * Counts the tokens of `text`, defaulting to {@link estimate}. The result
+ * is always marked estimated.
+ *
+ * @category constructors
+ * @since 0.1.0
+ * @slop
+ */
+export declare const count: (text: string, estimator?: Estimator) => Count;
+/**
+ * Sums per-segment counts into one {@link Accounting}.
+ *
+ * @category combinators
+ * @since 0.1.0
+ * @slop
+ */
+export declare const combine: (segments: ReadonlyArray<Segment>) => Accounting;
+export {};
+//# sourceMappingURL=Tokens.d.ts.map

package/dist/esm/Tokens.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tokens.d.ts","sourceRoot":"","sources":["../../src/Tokens.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;;;;;AAE/B;;;;;;;;GAQG;AACH,qBAAa,KAAM,SAAQ,UAGzB;CAAG;;;;;;AAEL;;;;;;;GAOG;AACH,qBAAa,OAAQ,SAAQ,YAI3B;CAAG;;;;;;;AAEL;;;;;;;GAOG;AACH,qBAAa,UAAW,SAAQ,eAK9B;CAAG;AAEL;;;;GAIG;AACH,MAAM,MAAM,SAAS,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAA;AAEhD;;;;;;;GAOG;AACH,eAAO,MAAM,QAAQ,EAAE,SAKtB,CAAA;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,KAAK,GAAI,MAAM,MAAM,EAAE,YAAW,SAAoB,KAAG,KACU,CAAA;AAEhF;;;;;;GAMG;AACH,eAAO,MAAM,OAAO,GAAI,UAAU,aAAa,CAAC,OAAO,CAAC,KAAG,UAgB1D,CAAA"}

package/dist/esm/Tokens.js

@@ -0,0 +1,92 @@
+/**
+ * Deterministic token accounting for context windows.
+ *
+ * @since 0.1.0
+ */
+import { Schema } from "effect";
+/**
+ * A token count, and whether it was estimated locally or reported by a
+ * provider. The flag travels with the number so a consumer never mistakes
+ * an approximation for billing data.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export class Count extends Schema.Class("flows/harness/Tokens/Count")({
+    value: Schema.Int.check(Schema.isGreaterThanOrEqualTo(0)),
+    estimated: Schema.Boolean
+}) {
+}
+/**
+ * One segment's contribution to the accounting, keyed by its content
+ * digest so an unchanged segment keeps its count across turns.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export class Segment extends Schema.Class("flows/harness/Tokens/Segment")({
+    digest: Schema.String,
+    zone: Schema.Literals(["prefix", "tail"]),
+    tokens: Count
+}) {
+}
+/**
+ * The token totals of a whole context window, split by cache zone and
+ * broken down per segment.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export class Accounting extends Schema.Class("flows/harness/Tokens/Accounting")({
+    prefix: Count,
+    tail: Count,
+    total: Count,
+    bySegment: Schema.Array(Segment)
+}) {
+}
+/**
+ * Estimates tokens using four characters per token, with code punctuation and
+ * newline density accounting for the typically shorter tokens in source text.
+ *
+ * @category constructors
+ * @since 0.1.0
+ * @slop
+ */
+export const estimate = (text) => {
+    if (text.length === 0)
+        return 0;
+    const codeCharacters = (text.match(/[{}()[\];=<>`]/g) ?? []).length;
+    const newlines = (text.match(/\n/g) ?? []).length;
+    return Math.ceil((text.length + codeCharacters * 0.75 + newlines * 1.5) / 4);
+};
+/**
+ * Counts the tokens of `text`, defaulting to {@link estimate}. The result
+ * is always marked estimated.
+ *
+ * @category constructors
+ * @since 0.1.0
+ * @slop
+ */
+export const count = (text, estimator = estimate) => new Count({ value: Math.max(0, Math.ceil(estimator(text))), estimated: true });
+/**
+ * Sums per-segment counts into one {@link Accounting}.
+ *
+ * @category combinators
+ * @since 0.1.0
+ * @slop
+ */
+export const combine = (segments) => {
+    const prefix = segments.filter((segment) => segment.zone === "prefix").reduce((sum, segment) => sum + segment.tokens.value, 0);
+    const tail = segments.filter((segment) => segment.zone === "tail").reduce((sum, segment) => sum + segment.tokens.value, 0);
+    const estimated = segments.some((segment) => segment.tokens.estimated);
+    return new Accounting({
+        prefix: new Count({ value: prefix, estimated }),
+        tail: new Count({ value: tail, estimated }),
+        total: new Count({ value: prefix + tail, estimated }),
+        bySegment: segments
+    });
+};
+//# sourceMappingURL=Tokens.js.map

package/dist/esm/Tokens.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Tokens.js","sourceRoot":"","sources":["../../src/Tokens.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AAE/B;;;;;;;;GAQG;AACH,MAAM,OAAO,KAAM,SAAQ,MAAM,CAAC,KAAK,CAAQ,4BAA4B,CAAC,CAAC;IAC3E,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACzD,SAAS,EAAE,MAAM,CAAC,OAAO;CAC1B,CAAC;CAAG;AAEL;;;;;;;GAOG;AACH,MAAM,OAAO,OAAQ,SAAQ,MAAM,CAAC,KAAK,CAAU,8BAA8B,CAAC,CAAC;IACjF,MAAM,EAAE,MAAM,CAAC,MAAM;IACrB,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACzC,MAAM,EAAE,KAAK;CACd,CAAC;CAAG;AAEL;;;;;;;GAOG;AACH,MAAM,OAAO,UAAW,SAAQ,MAAM,CAAC,KAAK,CAAa,iCAAiC,CAAC,CAAC;IAC1F,MAAM,EAAE,KAAK;IACb,IAAI,EAAE,KAAK;IACX,KAAK,EAAE,KAAK;IACZ,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;CACjC,CAAC;CAAG;AASL;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAc,CAAC,IAAI,EAAE,EAAE;IAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAC/B,MAAM,cAAc,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;IACnE,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAA;IACjD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,cAAc,GAAG,IAAI,GAAG,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC9E,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,YAAuB,QAAQ,EAAS,EAAE,CAC5E,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;AAEhF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,QAAgC,EAAc,EAAE;IACtE,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,MAAM,CAC3E,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAC5C,CAAC,CACF,CAAA;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,MAAM,CACvE,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAC5C,CAAC,CACF,CAAA;IACD,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;IACtE,OAAO,IAAI,UAAU,CAAC;QACpB,MAAM,EAAE,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;QAC/C,IAAI,EAAE,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAC3C,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC;QACrD,SAAS,EAAE,QAAQ;KACpB,CAAC,CAAA;AACJ,CAAC,CAAA","sourcesContent":["/**\n * Deterministic token accounting for context windows.\n *\n * @since 0.1.0\n */\n\nimport { Schema } from \"effect\"\n\n/**\n * A token count, and whether it was estimated locally or reported by a\n * provider. The flag travels with the number so a consumer never mistakes\n * an approximation for billing data.\n *\n * @category models\n * @since 0.1.0\n * @slop\n */\nexport class Count extends Schema.Class<Count>(\"flows/harness/Tokens/Count\")({\n  value: Schema.Int.check(Schema.isGreaterThanOrEqualTo(0)),\n  estimated: Schema.Boolean\n}) {}\n\n/**\n * One segment's contribution to the accounting, keyed by its content\n * digest so an unchanged segment keeps its count across turns.\n *\n * @category models\n * @since 0.1.0\n * @slop\n */\nexport class Segment extends Schema.Class<Segment>(\"flows/harness/Tokens/Segment\")({\n  digest: Schema.String,\n  zone: Schema.Literals([\"prefix\", \"tail\"]),\n  tokens: Count\n}) {}\n\n/**\n * The token totals of a whole context window, split by cache zone and\n * broken down per segment.\n *\n * @category models\n * @since 0.1.0\n * @slop\n */\nexport class Accounting extends Schema.Class<Accounting>(\"flows/harness/Tokens/Accounting\")({\n  prefix: Count,\n  tail: Count,\n  total: Count,\n  bySegment: Schema.Array(Segment)\n}) {}\n\n/** A deterministic local approximation, not provider billing data.\n * @category models\n * @since 0.1.0\n * @slop\n */\nexport type Estimator = (text: string) => number\n\n/**\n * Estimates tokens using four characters per token, with code punctuation and\n * newline density accounting for the typically shorter tokens in source text.\n *\n * @category constructors\n * @since 0.1.0\n * @slop\n */\nexport const estimate: Estimator = (text) => {\n  if (text.length === 0) return 0\n  const codeCharacters = (text.match(/[{}()[\\];=<>`]/g) ?? []).length\n  const newlines = (text.match(/\\n/g) ?? []).length\n  return Math.ceil((text.length + codeCharacters * 0.75 + newlines * 1.5) / 4)\n}\n\n/**\n * Counts the tokens of `text`, defaulting to {@link estimate}. The result\n * is always marked estimated.\n *\n * @category constructors\n * @since 0.1.0\n * @slop\n */\nexport const count = (text: string, estimator: Estimator = estimate): Count =>\n  new Count({ value: Math.max(0, Math.ceil(estimator(text))), estimated: true })\n\n/**\n * Sums per-segment counts into one {@link Accounting}.\n *\n * @category combinators\n * @since 0.1.0\n * @slop\n */\nexport const combine = (segments: ReadonlyArray<Segment>): Accounting => {\n  const prefix = segments.filter((segment) => segment.zone === \"prefix\").reduce(\n    (sum, segment) => sum + segment.tokens.value,\n    0\n  )\n  const tail = segments.filter((segment) => segment.zone === \"tail\").reduce(\n    (sum, segment) => sum + segment.tokens.value,\n    0\n  )\n  const estimated = segments.some((segment) => segment.tokens.estimated)\n  return new Accounting({\n    prefix: new Count({ value: prefix, estimated }),\n    tail: new Count({ value: tail, estimated }),\n    total: new Count({ value: prefix + tail, estimated }),\n    bySegment: segments\n  })\n}\n"]}

package/dist/esm/Transcript.d.ts

@@ -0,0 +1,171 @@
+/**
+ * Transcript projection from durable journal entries.
+ *
+ * The transcript grows: what the model saw is what it said plus what the
+ * harness answered, in journal order. A `continue` used to be able to replace
+ * the whole projection with a list of messages the cell had written for its
+ * successor, and that branch is gone with the surface that produced it — a
+ * journal from those waves still decodes, and its `context` entries are simply
+ * not read.
+ *
+ * @since 0.1.0
+ */
+import type { JournalEvent } from "@smthrs/journal";
+import { ModelRequest } from "@smthrs/model";
+import { Result, Schema } from "effect";
+import * as AgentEvent from "./AgentEvent.ts";
+import type * as Cell from "./Cell.ts";
+import type * as EngineLike from "./EngineLike.ts";
+import { HarnessError } from "./HarnessError.ts";
+/**
+ * Journal and model-key format after summaries became user context.
+ *
+ * @category constants
+ * @since 1.0.0-rc.0
+ */
+export declare const journalVersion = 2;
+/**
+ * The event-type namespace a session journals its controller events under.
+ *
+ * Resume validation reads only the entries under this prefix, and the writer
+ * that produces them lives in another package, so the prefix is exported here
+ * rather than spelled twice: a writer types its event types as
+ * {@link ControlEventType} and a rename fails to compile instead of silently
+ * emptying the set {@link validateJournal} inspects.
+ *
+ * @category constants
+ * @since 1.0.0-rc.0
+ */
+export declare const controlEventPrefix = "control.agent.";
+/**
+ * An event type {@link validateJournal} validates.
+ *
+ * @category models
+ * @since 1.0.0-rc.0
+ */
+export type ControlEventType = `${typeof controlEventPrefix}${string}`;
+/**
+ * Refuses history whose replay could address different sealed model steps.
+ * Historical display projection is separate from permission to resume.
+ *
+ * @category validation
+ * @since 1.0.0-rc.0
+ */
+export declare const validateJournal: (entries: ReadonlyArray<JournalEvent.Entry>) => Result.Result<void, HarnessError>;
+/**
+ * Stable failures produced while projecting a durable transcript.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export declare const TranscriptErrorCode: Schema.Literals<readonly ["projection_failed"]>;
+/**
+ * Stable failures produced while projecting a durable transcript.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export type TranscriptErrorCode = typeof TranscriptErrorCode.Type;
+declare const TranscriptError_base: Schema.Class<TranscriptError, Schema.TaggedStruct<"flows/harness/TranscriptError", {
+    readonly code: Schema.Literals<readonly ["projection_failed"]>;
+    readonly message: Schema.String;
+    readonly cause: Schema.optional<Schema.Defect>;
+}>, import("effect/Cause").YieldableError>;
+/**
+ * Stable failures produced while projecting a durable transcript.
+ *
+ * @category errors
+ * @since 0.1.0
+ * @slop
+ */
+export declare class TranscriptError extends TranscriptError_base {
+}
+/**
+ * The kind and message of one projected transcript item.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export interface ProjectedMessage {
+    readonly kind: "transcript" | "summary" | "steering";
+    readonly message: ModelRequest.Message;
+}
+/**
+ * A projection with the compaction replacement identity, when one was recorded.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export interface ProjectedState {
+    readonly messages: ReadonlyArray<ProjectedMessage>;
+    readonly replaced?: string | undefined;
+    readonly cell: CellEvidence;
+}
+/**
+ * Schema-decoded cell evidence consumed while rebuilding a journal.
+ *
+ * @category models
+ * @since 0.1.0
+ * @slop
+ */
+export interface CellEvidence {
+    readonly produced: ReadonlyArray<Cell.Source>;
+    /**
+     * What each frame printed, in journal order.
+     *
+     * The print buffer is the whole of the context channel: it is what the NEXT
+     * model turn reads, and `AgentEvent.CellPrinted` is journaled rather than
+     * derived precisely so a projection can rebuild that window without
+     * re-running anything. It was missing from this decoder, so a transcript
+     * projected from a harness-native journal could not reconstruct what the
+     * model saw.
+     */
+    readonly printed: ReadonlyArray<AgentEvent.CellPrinted>;
+    readonly callsStarted: ReadonlyArray<Cell.Call>;
+    readonly callsSettled: ReadonlyArray<AgentEvent.CellCallSettled>;
+    readonly settled: ReadonlyArray<AgentEvent.CellSettled>;
+    readonly transitions: ReadonlyArray<Cell.Transition>;
+    readonly suspensions: ReadonlyArray<EngineLike.SuspendReason>;
+    readonly aborts: ReadonlyArray<string>;
+}
+/**
+ * Projects journal events into their model-visible transcript state as typed
+ * data, preserving malformed payload failures instead of throwing.
+ *
+ * This rebuilds turn structure, the settlement's own message, and every
+ * journaled controller demand. The controller also folds frame-local
+ * settled-call salvage and the memory-probe alert into failure notes. A raised
+ * cell's `bindingPathMiss` hint is live-only, so the projection rebuilds a
+ * shorter note exactly where that hint would name a missed binding.
+ *
+ * A terminal frame has the opposite skew: `observe` appends no observation
+ * once the frame budget is spent, while this projection rebuilds its journaled
+ * print and settlement. On a run whose last frame was terminal, it therefore
+ * over-reports by one trailing user turn. `AgentEvent.TurnClosed.outcome` is the
+ * journaled signal a future projection would key on to drop it: `"resolved"`
+ * on the terminal frame and `"continue"` otherwise.
+ *
+ * @category projections
+ * @since 0.1.0
+ * @slop
+ */
+export declare const projectStateResult: (entries: ReadonlyArray<JournalEvent.Entry>) => Result.Result<ProjectedState, TranscriptError>;
+/**
+ * Projects model-visible messages in canonical journal sequence order.
+ *
+ * @category projections
+ * @since 0.1.0
+ * @slop
+ */
+export declare const projectResult: (entries: ReadonlyArray<JournalEvent.Entry>) => Result.Result<ReadonlyArray<ModelRequest.Message>, TranscriptError>;
+/**
+ * Pure external-source decoders; never create executable journal identities.
+ * @since 1.0.0-rc.1
+ */
+export { decodeClaude, decodeCodex } from "./ExternalTranscript.ts";
+export type { Entry as ExternalEntry, Decoded as ExternalDecoded } from "./ExternalTranscript.ts";
+//# sourceMappingURL=Transcript.d.ts.map

package/dist/esm/Transcript.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Transcript.d.ts","sourceRoot":"","sources":["../../src/Transcript.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAA;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAC5C,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACvC,OAAO,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAC7C,OAAO,KAAK,KAAK,IAAI,MAAM,WAAW,CAAA;AACtC,OAAO,KAAK,KAAK,UAAU,MAAM,iBAAiB,CAAA;AAElD,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAKhD;;;;;GAKG;AACH,eAAO,MAAM,cAAc,IAAI,CAAA;AAE/B;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,kBAAkB,mBAAmB,CAAA;AAElD;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,GAAG,OAAO,kBAAkB,GAAG,MAAM,EAAE,CAAA;AAEtE;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAC1B,SAAS,aAAa,CAAC,YAAY,CAAC,KAAK,CAAC,KACzC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,CAclC,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB,iDAAyC,CAAA;AAEzE;;;;;;GAMG;AACH,MAAM,MAAM,mBAAmB,GAAG,OAAO,mBAAmB,CAAC,IAAI,CAAA;;;;;;AAEjE;;;;;;GAMG;AACH,qBAAa,eAAgB,SAAQ,oBAInC;CAAG;AAGL;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,UAAU,CAAA;IACpD,QAAQ,CAAC,OAAO,EAAE,YAAY,CAAC,OAAO,CAAA;CACvC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,gBAAgB,CAAC,CAAA;IAClD,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACtC,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;CAC5B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC7C;;;;;;;;;OASG;IACH,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,WAAW,CAAC,CAAA;IACvD,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC/C,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC,UAAU,CAAC,eAAe,CAAC,CAAA;IAChE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC,UAAU,CAAC,WAAW,CAAC,CAAA;IACvD,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IACpD,QAAQ,CAAC,WAAW,EAAE,aAAa,CAAC,UAAU,CAAC,aAAa,CAAC,CAAA;IAC7D,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAA;CACvC;AA0DD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,eAAO,MAAM,kBAAkB,GAC7B,SAAS,aAAa,CAAC,YAAY,CAAC,KAAK,CAAC,KACzC,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,eAAe,CAwP/C,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,GACxB,SAAS,aAAa,CAAC,YAAY,CAAC,KAAK,CAAC,KACzC,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE,eAAe,CAC2B,CAAA;AAEhG;;;GAGG;AACH,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAA;AACnE,YAAY,EAAE,KAAK,IAAI,aAAa,EAAE,OAAO,IAAI,eAAe,EAAE,MAAM,yBAAyB,CAAA"}