@earendil-works/chord 1.5.0 → 1.5.1

package/dist/cell.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cell.js","sourceRoot":"","sources":["../src/cell.ts"],"names":[],"mappings":"AACA,OAAO,EAAc,aAAa,EAAyC,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAC3G,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACzD,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAW1C,IAAI,QAAQ,GAAG,CAAC,CAAC;AAEjB,gGAAgG;AAChG,MAAM,MAAM;IACF,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IACxC,OAAO,GAAG,IAAI,GAAG,EAAkC,CAAC;IACpD,OAAO,CAA2B;IAE3C,YAAY,MAAgC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,SAAS,CAAC,QAA4B,EAAE,OAAU;QACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9B,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED,MAAM,CAAC,QAAwC,EAAE,OAAU;QAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACvD,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,KAAoB;QACxB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,OAAO,CAAC,GAAG,EAAE;YACZ,KAAK,MAAM,QAAQ,IAAI,MAAM;gBAAE,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC3F,KAAK,MAAM,QAAQ,IAAI,MAAM;gBAAE,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;oBAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAClG,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,CAAI,QAA4B,EAAE,KAAQ;QAC9C,IAAI,CAAC;YACJ,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;IACF,CAAC;CACD;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,SAAS,GAAkB,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAQlE,wFAAwF;AACxF,MAAM,UAAU,WAAW,CAAC,KAAc;IACzC,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClE,OAAQ,KAA8C,CAAC,SAAS,CAAC,CAAC;AACnE,CAAC;AAED,6DAA6D;AAC7D,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,OAA0B,EAAe,EAAE,CACrE,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,EAA0B,EAAE,CAAC,SAAS,EAAE,QAAQ,KAAK,KAAK,CAAC,CAAC;AAE5G,iGAAiG;AACjG,MAAM,OAAgB,MAAM;IAClB,GAAG,CAAS;IACZ,GAAG,GAAG,EAAE,QAAQ,CAAC;IACjB,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,sGAAsG;IACtG,OAAO,GAAsB,EAAE,CAAC;IACb,OAAO,CAAgB;IACvB,MAAM,CAAY;IAErC,YAAY,GAAW,EAAE,OAAsB;QAC9C,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1C,CAAC;IAID,SAAS,CAAC,QAA4B;QACrC,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,QAAwC;QAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED,2CAA2C;IAC3C,QAAQ,CAAC,KAAc;QACtB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG;YAAE,OAAO;QAC9B,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,UAAU,EAAE;YAAE,WAAW,CAAC,OAAO,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;QACjG,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAAE,WAAW,CAAC,OAAO,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;IAC7F,CAAC;IAES,UAAU;QACnB,OAAO,EAAE,CAAC;IACX,CAAC;CACD;AAOD,SAAS,KAAK,CAAC,GAAkB,EAAE,KAAc;IAChD,MAAM,MAAM,GAAS,EAAE,CAAC;IACxB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,GAAG,EAAE,KAAkB,CAAC,CAAC,CAAC;QAC5E,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACf,KAAK,GAAG;gBACP,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM;YACP,KAAK,GAAG;gBACP,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM;YACP;gBACC,0CAA0C;gBAC1C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;oBAAE,OAAO,CAAC,CAAC,GAAG,EAAE,KAAkB,CAAC,CAAC,CAAC;gBAC1D,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG;oBAAE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,IAAiD,CAAC,CAAC,CAAC;;oBACpF,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAiD,EAAE,EAAE,CAAC,CAAC,CAAC,CAAO,CAAC,CAAC;QAC5F,CAAC;IACF,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,8GAA8G;AAC9G,MAAM,OAAO,IAAQ,SAAQ,MAAS;IACrC,gFAAgF;IAChF,MAAM,CAAS;IACf,QAAQ,CAAkB;IACjB,MAAM,CAAa;IAC5B,oGAAoG;IACpG,YAAY,CAAU;IAEtB;;;OAGG;IACH,YACC,GAAW,EACX,MAAc,EACd,OAA0C,EAC1C,KAAiB,EACjB,OAAsB;QAEtB,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACpB,IAAI,OAAO,KAAK,SAAS;YAAE,WAAW,CAAC,OAAO,EAAE,0BAA0B,GAAG,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACxG,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAS,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,KAAK,IAAI,IAAI,CAAM,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,OAAO,KAAK,SAAS,CAAC;IAC3C,CAAC;IAED,uHAAuH;IACvH,UAAU,CAAC,KAAQ;QAClB,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC;QACnF,WAAW,CAAC,OAAO,EAAE,0BAA0B,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC/E,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAS,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;IAC1B,CAAC;IAEkB,UAAU;QAC5B,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,KAAK;QACR,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,MAAM,QAAQ,CAAC,SAAS,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9B,CAAC;IAQD,MAAM,CAAC,GAAQ,EAAE,EAAgC;QAChD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,MAAM,QAAQ,CAAC,SAAS,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC;QAC3C,IAAI,QAA2C,CAAC;QAChD,IAAI,CAAC;YACJ,MAAM,KAAK,GAAG,MAAM,CAAC,KAAsB,CAAC;YAC5C,MAAM,MAAM,GAAY,EAAE,CAAC,KAAK,CAAC,CAAa,CAAC,CAAC;YAChD,IAAI,MAAM,YAAY,OAAO;gBAAE,MAAM,IAAI,SAAS,CAAC,2CAA2C,CAAC,CAAC;YAChG,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,MAAM,KAAK,KAAK,CAAC,CAAC;oBAAE,WAAW,CAAC,OAAO,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACvF,KAAK,CAAC,CAAC,GAAG,MAAkB,CAAC;YAC9B,CAAC;YACD,QAAQ,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;QAC7B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,MAAM,KAAK,CAAC;QACb,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,GAAQ,EAAE,KAAQ,EAAE,OAAO,GAAgC,EAAE;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,MAAM,QAAQ,CAAC,SAAS,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,aAAa,CAAC,MAAmB,EAAE,KAAkB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACtF,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IAC7E,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAQ,EAAE,MAAc;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IAED,gHAAgH;IAChH,QAAQ,CACP,QAAuD,EACvD,IAAqB,EACrB,QAAQ,GAAG,IAAI,EACf,GAAmB;QAEnB,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACjD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC9B,OAAO;QACR,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/B,IAAI,UAA0C,CAAC;QAC/C,IAAI,CAAC;YACJ,IAAI,QAAQ;gBAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACnC,UAAU,GAAG,iBAAiB,CAAC,IAAuB,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1E,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,MAAM,KAAK,CAAC;QACb,CAAC;QACD,gBAAgB,CAAC,GAAG,EAAE;YACrB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC9B,MAAM,SAAS,GAAG,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACzF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;YACvF,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,UAAU;gBAAE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;IACJ,CAAC;CACD;AAED,0GAA0G;AAC1G,SAAS,eAAe,CAAC,CAAU,EAAE,CAAU;IAC9C,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACxG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACxD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAK,CAA6B,CAAC,GAAG,CAAC,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;IAC/G,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,sGAAsG;AACtG,SAAS,iBAAiB,CAAC,OAAwB,EAAE,KAAc,EAAE,QAAQ,GAAG,IAAI;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,KAAK,GAAG,CAAC,MAAuB,EAAQ,EAAE;QAC/C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACzC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,KAAK,CAAC,OAAO,CAAC,CAAC;QAChB,CAAC;IACF,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,CAAC;IACf,MAAM,MAAM,GAAG,IAAI,GAAG,CAA6B,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,MAAM,GAAG,IAAI,GAAG,EAA6B,CAAC;IACpD,KAAK,MAAM,OAAO,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAClE,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QACnG,IAAI,QAAQ;YAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC1B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAKD,MAAM,UAAU,GAAG,CAAC,KAAc,EAA8B,EAAE,CACjE,KAAK,KAAK,IAAI;IACd,OAAO,KAAK,KAAK,QAAQ;IACzB,OAAQ,KAA2B,CAAC,SAAS,KAAK,UAAU;IAC5D,OAAO,IAAI,KAAK,CAAC;AAElB;;;GAGG;AACH,MAAM,OAAO,OAAW,SAAQ,MAAS;IAC/B,OAAO,CAA+B;IACtC,GAAG,CAAkC;IAC9C,MAAM,CAAI;IACV,SAAS,GAAmB,EAAE,CAAC;IAE/B,YAAY,GAAW,EAAE,OAAgB,EAAE,EAAmC,EAAE,OAAsB;QACrG,KAAK,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACrC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;gBAAE,MAAM,IAAI,SAAS,CAAC,UAAU,GAAG,6BAA6B,CAAC,CAAC;YACzF,OAAO,MAAM,CAAC;QACf,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,SAAc,CAAC;IAC9B,CAAC;IAED,IAAI,KAAK;QACR,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,gGAAgG;IAChG,IAAI,CAAC,SAAS,CAAC;QACd,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC3C,OAAO;YACN,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC;SACpG,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,WAA2C;QACjD,IAAI,CAAC,MAAM,GAAG,WAAW,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7G,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACnC,IAAI,MAAM,YAAY,MAAM;gBAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,IAAwB,CAAC,CAAC;;gBACzE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QAClE,CAAC;IACF,CAAC;IAED,MAAM;QACL,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAChC,IAAI,MAAM,YAAY,MAAM;gBAAE,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,IAAwB,CAAC,CAAC;QAClF,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,WAAW,EAAE,CAAC;IACnE,CAAC;IAED,OAAO,CAAC,IAA4C;QACnD,MAAM,MAAM,GAAY,IAAI,CAAC,GAAG,CAAC,GAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAa,CAAC,CAAC;QACzE,IAAI,MAAM,YAAY,OAAO;YAAE,MAAM,IAAI,SAAS,CAAC,UAAU,IAAI,CAAC,GAAG,0BAA0B,CAAC,CAAC;QACjG,OAAO,MAAW,CAAC;IACpB,CAAC;IAED,iHAAiH;IACjH,OAAO;QACN,IAAI,CAAC;YACJ,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACpD,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAwB,EAAE,IAAI,CAAC,CAAC;YACrE,gBAAgB,CAAC,GAAG,EAAE;gBACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACnB,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,UAAU;oBAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACnE,CAAC,CAAC,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;IACF,CAAC;IAED,OAAO,CAAC,IAAO;QACd,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,MAAM,GAAG,GACR,MAAM,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YACzC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,IAAI,IAAI,CAAc,CAAC,CAAC;YACtC,CAAC,CAAC,aAAa,CAAC,MAAmB,EAAE,IAAiB,CAAC,CAAC;QAC1D,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IACzE,CAAC;CACD;AAED,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAAc,EAA6C,EAAE,CAAC,KAAK,YAAY,MAAM,CAAC;AAE/G,8DAA8D;AAC9D,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAc,EAAE,CAAC,IAAI,UAAU,CAAC,WAAW,EAAE,GAAG,IAAI,eAAe,CAAC,CAAC","sourcesContent":["import type { Schema } from \"@earendil-works/pi-schema\";\nimport { type Draft, diffRevisions, type JsonValue, type Op, type Tracker, track } from \"./delta/index.ts\";\nimport { ChordError } from \"./errors.ts\";\nimport { enqueue, holdPublications } from \"./publish.ts\";\nimport { assertValid } from \"./schema.ts\";\nimport type { Ctx, Readable, StateEvent } from \"./types.ts\";\n\nexport interface SourceOptions {\n\treadonly dev: boolean;\n\treadonly report: (error: unknown) => void;\n}\n\n/** Checks that `ctx` may write an object's cells now; throws otherwise. */\nexport type WriteGuard = (ctx: Ctx) => void;\n\nlet sequence = 0;\n\n/** Fans out values and delta events; listener errors are reported, not thrown to the writer. */\nclass Fanout<T> {\n\treadonly #values = new Set<(value: T) => void>();\n\treadonly #events = new Set<(event: StateEvent<T>) => void>();\n\treadonly #report: (error: unknown) => void;\n\n\tconstructor(report: (error: unknown) => void) {\n\t\tthis.#report = report;\n\t}\n\n\tsubscribe(listener: (value: T) => void, current: T): () => void {\n\t\tthis.#values.add(listener);\n\t\tthis.#call(listener, current);\n\t\treturn () => this.#values.delete(listener);\n\t}\n\n\tevents(listener: (event: StateEvent<T>) => void, current: T): () => void {\n\t\tthis.#events.add(listener);\n\t\tthis.#call(listener, { type: \"snap\", value: current });\n\t\treturn () => this.#events.delete(listener);\n\t}\n\n\t/**\n\t * Queues delivery to the listeners subscribed now. A listener that subscribes later already got this revision in\n\t * its snapshot; one that unsubscribes before delivery is skipped.\n\t */\n\temit(event: StateEvent<T>): void {\n\t\tconst events = [...this.#events];\n\t\tconst values = [...this.#values];\n\t\tenqueue(() => {\n\t\t\tfor (const listener of events) if (this.#events.has(listener)) this.#call(listener, event);\n\t\t\tfor (const listener of values) if (this.#values.has(listener)) this.#call(listener, event.value);\n\t\t});\n\t}\n\n\t#call<V>(listener: (value: V) => void, value: V): void {\n\t\ttry {\n\t\t\tlistener(value);\n\t\t} catch (error) {\n\t\t\tthis.#report(error);\n\t\t}\n\t}\n}\n\n/**\n * Whether a state source has its value (entry 8): a remote reference's member before its first snapshot has none, and\n * neither has anything derived from or forwarding it. Sources without this symbol always have their value.\n */\nexport const HYDRATION: unique symbol = Symbol(\"chord.hydration\");\n\nexport interface Hydration {\n\treadonly hydrated: boolean;\n\t/** Resolves once hydrated; rejects if the source ends first. */\n\twhenHydrated(): Promise<void>;\n}\n\n/** The hydration of a readable, or undefined for a source that always has its value. */\nexport function hydrationOf(value: unknown): Hydration | undefined {\n\tif (value === null || typeof value !== \"object\") return undefined;\n\treturn (value as { readonly [HYDRATION]?: Hydration })[HYDRATION];\n}\n\n/** The hydrations of `sources` that are not hydrated yet. */\nexport const unhydrated = (sources: Iterable<unknown>): Hydration[] =>\n\t[...sources].map(hydrationOf).filter((hydration): hydration is Hydration => hydration?.hydrated === false);\n\n/** An object-owned state source (cell or derivation). Writes recompute dependents atomically. */\nexport abstract class Source<T> implements Readable<T> {\n\treadonly key: string;\n\treadonly seq = ++sequence;\n\treadonly dependents = new Set<Derived<unknown>>();\n\t/** Schemas of remote state members currently exposing this source (checked per write in dev mode). */\n\tschemas: readonly Schema[] = [];\n\tprotected readonly options: SourceOptions;\n\tprotected readonly fanout: Fanout<T>;\n\n\tconstructor(key: string, options: SourceOptions) {\n\t\tthis.key = key;\n\t\tthis.options = options;\n\t\tthis.fanout = new Fanout(options.report);\n\t}\n\n\tabstract get value(): T;\n\n\tsubscribe(listener: (value: T) => void): () => void {\n\t\treturn this.fanout.subscribe(listener, this.value);\n\t}\n\n\tevents(listener: (event: StateEvent<T>) => void): () => void {\n\t\treturn this.fanout.events(listener, this.value);\n\t}\n\n\t/** Per-write validation, dev mode only. */\n\tvalidate(value: unknown): void {\n\t\tif (!this.options.dev) return;\n\t\tfor (const schema of this.ownSchemas()) assertValid(\"state\", `state ${this.key}`, schema, value);\n\t\tfor (const schema of this.schemas) assertValid(\"state\", `state ${this.key}`, schema, value);\n\t}\n\n\tprotected ownSchemas(): readonly Schema[] {\n\t\treturn [];\n\t}\n}\n\n/** The tracker tracks containers, so a cell tracks `{ v: value }` and strips the box from published ops. */\ninterface Box<T> {\n\tv: T;\n}\n\nfunction unbox(ops: readonly Op[], value: unknown): Op[] {\n\tconst result: Op[] = [];\n\tfor (const op of ops) {\n\t\tif (op[0] === \"r\" || op[1].length === 0) return [[\"r\", value as JsonValue]];\n\t\tconst path = op[1].slice(1);\n\t\tswitch (op[0]) {\n\t\t\tcase \"p\":\n\t\t\t\tresult.push([\"p\", path, op[2], op[3], op[4]]);\n\t\t\t\tbreak;\n\t\t\tcase \"m\":\n\t\t\t\tresult.push([\"m\", path, op[2]]);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\t// s/d/a/t on the value itself replace it.\n\t\t\t\tif (path.length === 0) return [[\"r\", value as JsonValue]];\n\t\t\t\tif (op[0] === \"d\") result.push([\"d\", path as [string | number, ...(string | number)[]]]);\n\t\t\t\telse result.push([op[0], path as [string | number, ...(string | number)[]], op[2]] as Op);\n\t\t}\n\t}\n\treturn result;\n}\n\n/** A state cell holding any JSON value, validated against its schema at creation and (dev mode) on writes. */\nexport class Cell<T> extends Source<T> {\n\t/** Replaced at a reload commit that changes the schema (state-version bump). */\n\tschema: Schema;\n\t#tracker: Tracker<Box<T>>;\n\treadonly #guard: WriteGuard;\n\t/** False until `initialize` for a cell declared with `init`: reads and writes throw `not_ready`. */\n\t#initialized: boolean;\n\n\t/**\n\t * `initial` is always validated against `schema`; ownership moves to the cell. Without `initial`, the cell has no\n\t * value until `initialize` (a cell declared with `init`, filled before its object goes live).\n\t */\n\tconstructor(\n\t\tkey: string,\n\t\tschema: Schema,\n\t\tinitial: { readonly value: T } | undefined,\n\t\tguard: WriteGuard,\n\t\toptions: SourceOptions,\n\t) {\n\t\tsuper(key, options);\n\t\tif (initial !== undefined) assertValid(\"state\", `initial value of state ${key}`, schema, initial.value);\n\t\tthis.schema = schema;\n\t\tthis.#tracker = track<Box<T>>({ v: (initial?.value ?? null) as T });\n\t\tthis.#guard = guard;\n\t\tthis.#initialized = initial !== undefined;\n\t}\n\n\t/** Sets the first value of a cell declared with `init` (validated; ownership moves to the cell). Publishes nothing. */\n\tinitialize(value: T): void {\n\t\tif (this.#initialized) throw new Error(`state ${this.key} is already initialized`);\n\t\tassertValid(\"state\", `initial value of state ${this.key}`, this.schema, value);\n\t\tthis.#tracker = track<Box<T>>({ v: value });\n\t\tthis.#initialized = true;\n\t}\n\n\tprotected override ownSchemas(): readonly Schema[] {\n\t\treturn [this.schema];\n\t}\n\n\tget value(): T {\n\t\tif (!this.#initialized) throw notReady(`state ${this.key} (its init has not run)`);\n\t\treturn this.#tracker.value.v;\n\t}\n\n\t/**\n\t * Mutates a draft (only mutated paths are published), or returns a new value (`n => n + 1`). A returned value is\n\t * always validated against the schema. The draft is unusable after `fn` returns.\n\t */\n\tchange(ctx: Ctx, fn: (draft: Draft<T>) => T): void;\n\tchange(ctx: Ctx, fn: (draft: Draft<T>) => void): void;\n\tchange(ctx: Ctx, fn: (draft: Draft<T>) => unknown): void {\n\t\tthis.#guard(ctx);\n\t\tif (!this.#initialized) throw notReady(`state ${this.key} (its init has not run)`);\n\t\tconst change = this.#tracker.beginChange();\n\t\tlet prepared: ReturnType<typeof change.prepare>;\n\t\ttry {\n\t\t\tconst draft = change.state as Draft<Box<T>>;\n\t\t\tconst result: unknown = fn(draft.v as Draft<T>);\n\t\t\tif (result instanceof Promise) throw new TypeError(\"cell.change callbacks must be synchronous\");\n\t\t\tif (result !== undefined) {\n\t\t\t\tif (result !== draft.v) assertValid(\"state\", `state ${this.key}`, this.schema, result);\n\t\t\t\tdraft.v = result as Draft<T>;\n\t\t\t}\n\t\t\tprepared = change.prepare();\n\t\t} catch (error) {\n\t\t\tchange.abort();\n\t\t\tthrow error;\n\t\t}\n\t\tthis.#publish(prepared, \"ops\");\n\t}\n\n\t/**\n\t * Replaces the whole value. Ownership of `value` moves to the cell: never mutate it afterwards.\n\t *\n\t * Subscribers get a structural diff (`diffRevisions`) when `diff` is true, or by default when the new value shares\n\t * containers with the old one (a new immutable revision of the same state, e.g. mirrored from another store);\n\t * otherwise a single `r` op. The resulting value is the same either way; only the ops differ.\n\t */\n\treplace(ctx: Ctx, value: T, options: { readonly diff?: boolean } = {}): void {\n\t\tthis.#guard(ctx);\n\t\tif (!this.#initialized) throw notReady(`state ${this.key} (its init has not run)`);\n\t\tconst before = this.value;\n\t\tconst diff = options.diff ?? sharesStructure(before, value);\n\t\tconst ops = diff ? diffRevisions(before as JsonValue, value as JsonValue) : undefined;\n\t\tthis.#publish(this.#tracker.prepareReplace({ v: value }), \"ops\", true, ops);\n\t}\n\n\t/**\n\t * Installs a migrated value and its schema (reload commit). The caller validated the value and the derivations\n\t * over it against every schema that will apply, so nothing is checked here. Subscribers receive a reset.\n\t */\n\treset(value: T, schema: Schema): void {\n\t\tthis.schema = schema;\n\t\tthis.#publish(this.#tracker.prepareReplace({ v: value }), \"reset\", false);\n\t}\n\n\t/** Adopts this revision and every derived one, then queues all notifications (cell first, then derivations). */\n\t#publish(\n\t\tprepared: ReturnType<Tracker<Box<T>>[\"prepareReplace\"]>,\n\t\ttype: \"ops\" | \"reset\",\n\t\tvalidate = true,\n\t\tops?: readonly Op[],\n\t): void {\n\t\tif (prepared.ops.length === 0 && type === \"ops\") {\n\t\t\tthis.#tracker.adopt(prepared);\n\t\t\treturn;\n\t\t}\n\t\tconst value = prepared.value.v;\n\t\tlet candidates: Map<Derived<unknown>, unknown>;\n\t\ttry {\n\t\t\tif (validate) this.validate(value);\n\t\t\tcandidates = computeDependents(this as Source<unknown>, value, validate);\n\t\t} catch (error) {\n\t\t\tprepared.abort();\n\t\t\tthrow error;\n\t\t}\n\t\tholdPublications(() => {\n\t\t\tthis.#tracker.adopt(prepared);\n\t\t\tconst published = ops !== undefined && ops.length > 0 ? ops : unbox(prepared.ops, value);\n\t\t\tthis.fanout.emit(type === \"reset\" ? { type, value } : { type, ops: published, value });\n\t\t\tfor (const [derived, next] of candidates) derived.install(next);\n\t\t});\n\t}\n}\n\n/** True if `b` reuses at least one container of `a` at the same key: a new revision of the same state. */\nfunction sharesStructure(a: unknown, b: unknown): boolean {\n\tif (a === null || b === null || typeof a !== \"object\" || typeof b !== \"object\" || a === b) return false;\n\tif (Array.isArray(a) !== Array.isArray(b)) return false;\n\tfor (const [key, child] of Object.entries(b)) {\n\t\tif (child !== null && typeof child === \"object\" && (a as Record<string, unknown>)[key] === child) return true;\n\t}\n\treturn false;\n}\n\n/** Recomputes every transitive dependent of `changed` against candidate values and validates them. */\nfunction computeDependents(changed: Source<unknown>, value: unknown, validate = true): Map<Derived<unknown>, unknown> {\n\tconst pending = new Set<Derived<unknown>>();\n\tconst visit = (source: Source<unknown>): void => {\n\t\tfor (const derived of source.dependents) {\n\t\t\tif (pending.has(derived)) continue;\n\t\t\tpending.add(derived);\n\t\t\tvisit(derived);\n\t\t}\n\t};\n\tvisit(changed);\n\tconst values = new Map<Readable<unknown>, unknown>([[changed, value]]);\n\tconst result = new Map<Derived<unknown>, unknown>();\n\tfor (const derived of [...pending].sort((a, b) => a.seq - b.seq)) {\n\t\tconst next = derived.compute((source) => (values.has(source) ? values.get(source) : source.value));\n\t\tif (validate) derived.validate(next);\n\t\tvalues.set(derived, next);\n\t\tresult.set(derived, next);\n\t}\n\treturn result;\n}\n\nexport type Sources = readonly Readable<unknown>[];\nexport type SourceValues<S extends Sources> = { [K in keyof S]: S[K] extends Readable<infer T> ? T : never };\n\nconst isReadable = (value: unknown): value is Readable<unknown> =>\n\tvalue !== null &&\n\ttypeof value === \"object\" &&\n\ttypeof (value as Readable<unknown>).subscribe === \"function\" &&\n\t\"value\" in value;\n\n/**\n * A synchronous derivation. Sources are object cells/derivations (recomputed atomically with the write) or other\n * readables such as reference state members (recomputed when they publish). Subscribers receive diffs.\n */\nexport class Derived<T> extends Source<T> {\n\treadonly sources: readonly Readable<unknown>[];\n\treadonly #fn: (...values: never[]) => unknown;\n\t#value: T;\n\t#external: (() => void)[] = [];\n\n\tconstructor(key: string, sources: Sources, fn: (...values: never[]) => unknown, options: SourceOptions) {\n\t\tsuper(key, options);\n\t\tthis.sources = sources.map((source) => {\n\t\t\tif (!isReadable(source)) throw new TypeError(`derive ${key}: sources must be readables`);\n\t\t\treturn source;\n\t\t});\n\t\tthis.#fn = fn;\n\t\tthis.#value = undefined as T;\n\t}\n\n\tget value(): T {\n\t\treturn this.#value;\n\t}\n\n\t/** Hydrated once every source is (a derivation over a remote member waits for its snapshot). */\n\tget [HYDRATION](): Hydration | undefined {\n\t\tconst pending = unhydrated(this.sources);\n\t\tif (pending.length === 0) return undefined;\n\t\treturn {\n\t\t\thydrated: false,\n\t\t\twhenHydrated: () => Promise.all(pending.map((hydration) => hydration.whenHydrated())).then(() => {}),\n\t\t};\n\t}\n\n\t/**\n\t * Computes the first value (or takes it from `precomputed`, a reload's validated dry run) and starts following\n\t * the sources (at install, never inside a factory).\n\t */\n\tattach(precomputed?: ReadonlyMap<unknown, unknown>): void {\n\t\tthis.#value = precomputed?.has(this) ? (precomputed.get(this) as T) : this.compute((source) => source.value);\n\t\tfor (const source of this.sources) {\n\t\t\tif (source instanceof Source) source.dependents.add(this as Derived<unknown>);\n\t\t\telse this.#external.push(source.subscribe(() => this.refresh()));\n\t\t}\n\t}\n\n\tdetach(): void {\n\t\tfor (const source of this.sources)\n\t\t\tif (source instanceof Source) source.dependents.delete(this as Derived<unknown>);\n\t\tfor (const unsubscribe of this.#external.splice(0)) unsubscribe();\n\t}\n\n\tcompute(read: (source: Readable<unknown>) => unknown): T {\n\t\tconst result: unknown = this.#fn(...(this.sources.map(read) as never[]));\n\t\tif (result instanceof Promise) throw new TypeError(`derive ${this.key}: fn must be synchronous`);\n\t\treturn result as T;\n\t}\n\n\t/** Recomputes and republishes, including dependents. Errors are reported (the source write already happened). */\n\trefresh(): void {\n\t\ttry {\n\t\t\tconst next = this.compute((source) => source.value);\n\t\t\tconst dependents = computeDependents(this as Derived<unknown>, next);\n\t\t\tholdPublications(() => {\n\t\t\t\tthis.install(next);\n\t\t\t\tfor (const [derived, value] of dependents) derived.install(value);\n\t\t\t});\n\t\t} catch (error) {\n\t\t\tthis.options.report(error);\n\t\t}\n\t}\n\n\tinstall(next: T): void {\n\t\tconst before = this.#value;\n\t\tthis.#value = next;\n\t\tconst ops: Op[] =\n\t\t\tbefore === undefined || next === undefined\n\t\t\t\t? [[\"r\", (next ?? null) as JsonValue]]\n\t\t\t\t: diffRevisions(before as JsonValue, next as JsonValue);\n\t\tif (ops.length > 0) this.fanout.emit({ type: \"ops\", ops, value: next });\n\t}\n}\n\nexport const isSource = (value: unknown): value is Cell<unknown> | Derived<unknown> => value instanceof Source;\n\n/** Thrown by placeholders used before activation finished. */\nexport const notReady = (what: string): ChordError => new ChordError(\"not_ready\", `${what} is not ready`);\n"]}

package/dist/cluster.d.ts

@@ -1,27 +0,0 @@
-import type { Connection } from "./connection.ts";
-import type { HostImpl, PluginRef } from "./host.ts";
-import { type ReloadOptions, type ReloadReport } from "./reload.ts";
-import { type Frame } from "./wire.ts";
-export declare function runClusterReload(host: HostImpl, plugins: readonly PluginRef[], options: ReloadOptions): Promise<ReloadReport>;
-/**
- * Brings a child that connected behind this host's code version up to it: a reload of the child's modules (the ones
- * cluster reloads gave its name) to this host's current code version, prepared, voted and committed like a cluster
- * reload. Until then the child is fenced: nothing is routed to it. The child's old code is never relabeled as a newer
- * code version.
- */
-export declare function reconcileChild(host: HostImpl, connection: Connection): Promise<void>;
-/**
- * The child side: prepare and vote, then wait for the server's commit or abort. An abort or a lost parent link can
- * arrive at any point: while loading modules, while preparing (pending opens close themselves when they complete),
- * or after the vote. The operation is unwound once its pending work settles, and the reload slot is freed.
- */
-export declare class ChildReloads {
-    #private;
-    constructor(host: HostImpl);
-    handle(connection: Connection, frame: Extract<Frame, {
-        t: "prepare" | "commit" | "abort";
-    }>): void;
-    /** The parent link died: nobody will commit, so roll back (now, or once pending work settles). */
-    parentLost(): void;
-}
-//# sourceMappingURL=cluster.d.ts.map

package/dist/cluster.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"cluster.d.ts","sourceRoot":"","sources":["../src/cluster.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAElD,OAAO,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAuC,KAAK,aAAa,EAAE,KAAK,YAAY,EAAe,MAAM,aAAa,CAAC;AACtH,OAAO,EAAE,KAAK,KAAK,EAAe,MAAM,WAAW,CAAC;AAkCpD,wBAAsB,gBAAgB,CACrC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,OAAO,EAAE,aAAa,GACpB,OAAO,CAAC,YAAY,CAAC,CAwEvB;AAED;;;;;GAKG;AACH,wBAAsB,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAmC1F;AAUD;;;;GAIG;AACH,qBAAa,YAAY;;IAIxB,YAAY,IAAI,EAAE,QAAQ,EAEzB;IAED,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE;QAAE,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAA;KAAE,CAAC,GAAG,IAAI,CAyBjG;IAED,kGAAkG;IAClG,UAAU,IAAI,IAAI,CAEjB;CAwCD"}

package/dist/cluster.js

@@ -1,230 +0,0 @@
-import { ChordError } from "./errors.js";
-import { beginReload, endReload, reloadError } from "./reload.js";
-import { toWireError } from "./wire.js";
-// Cross-host reload, coordinated by the server (the host without a parent):
-//   server: prepare itself and send `prepare` to every synced child host; collect votes
-//   all ok: the server installs its new code version, sends `commit` to every child, and only then starts what may make
-// new-code-version calls (tasks, listener and registry callbacks). Links are FIFO, so a child commits before it
-//           can receive any frame of a root started in the new code version.
-//   any failure or missed vote deadline: `abort` everywhere; each host rolls back to where it was.
-// Clients (browsers) are not participants: they see shape/reset pushes, or `upgrade_required`.
-// A child that connects behind the server's code version is fenced and reconciled with the same protocol.
-let reloadSeq = 0;
-const modulesFor = (remote, hostName) => {
-    let best;
-    for (const entry of Object.entries(remote ?? {})) {
-        if (hostName?.startsWith(entry[0]) && (best === undefined || entry[0].length > best[0].length))
-            best = entry;
-    }
-    return [...(best?.[1] ?? [])];
-};
-/** A vote, or its rejection after `deadline` milliseconds. */
-function awaitVote(connection, id, deadline) {
-    let timer;
-    const vote = new Promise((resolve, reject) => {
-        connection.votes.set(id, { resolve, reject });
-        timer = setTimeout(() => {
-            connection.votes.delete(id);
-            reject(new ChordError("aborted", `votes missing after ${deadline} ms`, { reason: "vote_deadline" }));
-        }, deadline);
-    });
-    return vote.finally(() => clearTimeout(timer));
-}
-export async function runClusterReload(host, plugins, options) {
-    // Participants are the children in step now. Fenced children (behind, being reconciled) reconcile to the new code
-    // version afterwards; a child whose hello arrives while the reload runs is synced or reconciled once it ends
-    // (`HostImpl.peerHello`).
-    const synced = [...host.connections].filter((connection) => connection.role === "downstream" && connection.peer.kind === "host" && connection.open && connection.synced);
-    const codeVersion = host.peekNextCodeVersion();
-    const reload = await beginReload(host, plugins, options, codeVersion);
-    try {
-        // Retire first: its `retire` frames reach every child before `prepare` (FIFO), so a child never retires a code
-        // version this host still runs roots of.
-        await reload.waitForRetirement();
-        const participants = synced.filter((connection) => connection.open);
-        const id = ++reloadSeq;
-        const deadline = options.voteDeadline ?? (options.gateDeadline ?? 5000) + (options.retireDeadline ?? 5000) + 5000;
-        const votes = participants.map((connection) => {
-            const name = connection.name ?? "child";
-            const vote = awaitVote(connection, id, deadline);
-            connection.send({
-                t: "prepare",
-                reload: id,
-                codeVersion,
-                plugins: modulesFor(options.remote, name),
-                options: {
-                    remove: modulesFor(options.remoteRemove, name),
-                    gateDeadline: options.gateDeadline,
-                    retireDeadline: options.retireDeadline,
-                },
-            });
-            return vote.then((report) => [name, report], (error) => {
-                const cause = reloadError(error);
-                throw new ChordError(cause.code, `${name}: ${cause.message}`, { cause, reason: cause.reason });
-            });
-        });
-        let local = false;
-        const results = await Promise.allSettled([
-            reload.prepare().then(() => {
-                local = true;
-            }),
-            ...votes,
-        ]);
-        const failed = results.find((result) => result.status === "rejected");
-        if (failed !== undefined) {
-            for (const connection of participants) {
-                connection.votes.delete(id);
-                connection.send({ t: "abort", reload: id });
-            }
-            if (local)
-                await reload.rollback();
-            throw failed.reason;
-        }
-        const report = reload.commit(() => {
-            for (const connection of participants) {
-                connection.send({ t: "commit", reload: id });
-                connection.peerCodeVersion = codeVersion;
-            }
-        });
-        host.rememberRemoteModules(options.remote, options.remoteRemove);
-        const children = {};
-        for (const result of results.slice(1)) {
-            if (result.status !== "fulfilled")
-                continue;
-            const [name, child] = result.value;
-            if (child !== undefined)
-                children[name] = child;
-        }
-        return { ...report, children };
-    }
-    finally {
-        endReload(host);
-    }
-}
-/**
- * Brings a child that connected behind this host's code version up to it: a reload of the child's modules (the ones
- * cluster reloads gave its name) to this host's current code version, prepared, voted and committed like a cluster
- * reload. Until then the child is fenced: nothing is routed to it. The child's old code is never relabeled as a newer
- * code version.
- */
-export async function reconcileChild(host, connection) {
-    for (;;) {
-        if (!connection.open)
-            return;
-        // Not during a reload of this host: the child is not one of its participants, so whatever it would be synced to
-        // now may be superseded by that reload's commit. Recheck once it ended.
-        if (host.reloading) {
-            await host.whenReloadEnded();
-            continue;
-        }
-        const codeVersion = host.current.id;
-        if (connection.peerCodeVersion === codeVersion) {
-            connection.markSynced(codeVersion);
-            host.announceRetired(connection);
-            return;
-        }
-        // Before `prepare`: the child's prepare first retires its previous code version, which waits for this permission.
-        host.announceRetired(connection);
-        const id = ++reloadSeq;
-        const vote = awaitVote(connection, id, 30_000);
-        connection.send({
-            t: "prepare",
-            reload: id,
-            codeVersion,
-            plugins: modulesFor(host.remoteModules, connection.name),
-            options: { remove: modulesFor(host.remoteRemoved, connection.name) },
-        });
-        await vote;
-        if (host.current.id !== codeVersion) {
-            // This host moved on meanwhile: abort and try again with the newer code version.
-            connection.send({ t: "abort", reload: id });
-            continue;
-        }
-        connection.send({ t: "commit", reload: id });
-        connection.peerCodeVersion = codeVersion;
-    }
-}
-/**
- * The child side: prepare and vote, then wait for the server's commit or abort. An abort or a lost parent link can
- * arrive at any point: while loading modules, while preparing (pending opens close themselves when they complete),
- * or after the vote. The operation is unwound once its pending work settles, and the reload slot is freed.
- */
-export class ChildReloads {
-    #host;
-    #operation;
-    constructor(host) {
-        this.#host = host;
-    }
-    handle(connection, frame) {
-        if (frame.t === "prepare") {
-            if (this.#operation !== undefined) {
-                const error = new ChordError("unavailable", "a reload is already running", { reason: "reload_running" });
-                connection.send({ t: "vote", reload: frame.reload, error: toWireError(error) });
-                return;
-            }
-            const operation = { id: frame.reload, reload: undefined, state: "loading", cancelled: false };
-            this.#operation = operation;
-            this.#run(operation, connection, frame).catch((error) => this.#host.report(error));
-            return;
-        }
-        const operation = this.#operation;
-        if (operation === undefined || operation.id !== frame.reload)
-            return;
-        if (frame.t === "abort") {
-            this.#cancel(operation);
-            return;
-        }
-        if (operation.state !== "prepared")
-            return;
-        this.#operation = undefined;
-        try {
-            operation.reload?.commit();
-        }
-        finally {
-            endReload(this.#host);
-        }
-    }
-    /** The parent link died: nobody will commit, so roll back (now, or once pending work settles). */
-    parentLost() {
-        if (this.#operation !== undefined)
-            this.#cancel(this.#operation);
-    }
-    #cancel(operation) {
-        operation.cancelled = true;
-        if (operation.state !== "prepared") {
-            // Loading or preparing: make prepare fail now; #run unwinds when it settles.
-            operation.reload?.rollback().catch((error) => this.#host.report(error));
-            return;
-        }
-        this.#operation = undefined;
-        operation.reload
-            ?.rollback()
-            .catch((error) => this.#host.report(error))
-            .finally(() => endReload(this.#host));
-    }
-    async #run(operation, connection, frame) {
-        const cancelled = () => new ChordError("aborted", "reload aborted by the server", { reason: "aborted" });
-        try {
-            operation.reload = await beginReload(this.#host, frame.plugins, frame.options, frame.codeVersion);
-            if (operation.cancelled)
-                throw cancelled();
-            operation.state = "preparing";
-            await operation.reload.prepare();
-            if (operation.cancelled)
-                throw cancelled();
-            operation.state = "prepared";
-            connection.send({ t: "vote", reload: frame.reload, report: operation.reload.summary() });
-        }
-        catch (error) {
-            if (operation.reload !== undefined) {
-                await operation.reload.rollback().catch((cleanup) => this.#host.report(cleanup));
-                endReload(this.#host);
-            }
-            if (this.#operation === operation)
-                this.#operation = undefined;
-            if (!operation.cancelled)
-                connection.send({ t: "vote", reload: frame.reload, error: toWireError(error) });
-        }
-    }
-}
-//# sourceMappingURL=cluster.js.map

package/dist/cluster.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cluster.js","sourceRoot":"","sources":["../src/cluster.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,WAAW,EAAE,SAAS,EAAsD,WAAW,EAAE,MAAM,aAAa,CAAC;AACtH,OAAO,EAAc,WAAW,EAAE,MAAM,WAAW,CAAC;AAEpD,4EAA4E;AAC5E,wFAAwF;AACxF,wHAAwH;AACxH,gHAAgH;AAChH,6EAA6E;AAC7E,mGAAmG;AACnG,+FAA+F;AAC/F,0GAA0G;AAE1G,IAAI,SAAS,GAAG,CAAC,CAAC;AAElB,MAAM,UAAU,GAAG,CAAC,MAA+B,EAAE,QAA4B,EAAY,EAAE;IAC9F,IAAI,IAA6C,CAAC;IAClD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;QAClD,IAAI,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,IAAI,GAAG,KAAK,CAAC;IAC9G,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC,CAAC;AAEF,8DAA8D;AAC9D,SAAS,SAAS,CAAC,UAAsB,EAAE,EAAU,EAAE,QAAgB;IACtE,IAAI,KAAgD,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,OAAO,CAAU,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;QACrD,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9C,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YACvB,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,uBAAuB,QAAQ,KAAK,EAAE,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC;QACtG,CAAC,EAAE,QAAQ,CAAC,CAAC;IACd,CAAC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACrC,IAAc,EACd,OAA6B,EAC7B,OAAsB;IAEtB,kHAAkH;IAClH,6GAA6G;IAC7G,0BAA0B;IAC1B,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,CAC1C,CAAC,UAAU,EAAE,EAAE,CACd,UAAU,CAAC,IAAI,KAAK,YAAY,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,MAAM,CAC5G,CAAC;IACF,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;IACtE,IAAI,CAAC;QACJ,+GAA+G;QAC/G,yCAAyC;QACzC,MAAM,MAAM,CAAC,iBAAiB,EAAE,CAAC;QACjC,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACpE,MAAM,EAAE,GAAG,EAAE,SAAS,CAAC;QACvB,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,IAAI,CAAC,OAAO,CAAC,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;QAClH,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE;YAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,IAAI,OAAO,CAAC;YACxC,MAAM,IAAI,GAAG,SAAS,CAAC,UAAU,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACjD,UAAU,CAAC,IAAI,CAAC;gBACf,CAAC,EAAE,SAAS;gBACZ,MAAM,EAAE,EAAE;gBACV,WAAW;gBACX,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC;gBACzC,OAAO,EAAE;oBACR,MAAM,EAAE,UAAU,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC;oBAC9C,YAAY,EAAE,OAAO,CAAC,YAAY;oBAClC,cAAc,EAAE,OAAO,CAAC,cAAc;iBACtC;aACD,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,IAAI,CACf,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,MAAkC,CAAU,EAC/D,CAAC,KAAc,EAAE,EAAE;gBAClB,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC;gBACjC,MAAM,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,IAAI,KAAK,KAAK,CAAC,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;YAChG,CAAC,CACD,CAAC;QACH,CAAC,CAAC,CAAC;QACH,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC;YACxC,MAAM,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;gBAC1B,KAAK,GAAG,IAAI,CAAC;YACd,CAAC,CAAC;YACF,GAAG,KAAK;SACR,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC;QACtE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;gBACvC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YAC7C,CAAC;YACD,IAAI,KAAK;gBAAE,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,MAAM,CAAC,MAAM,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE;YACjC,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;gBACvC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;gBAC7C,UAAU,CAAC,eAAe,GAAG,WAAW,CAAC;YAC1C,CAAC;QACF,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAClD,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,MAAM,KAAK,WAAW;gBAAE,SAAS;YAC5C,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,MAAM,CAAC,KAAoD,CAAC;YAClF,IAAI,KAAK,KAAK,SAAS;gBAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;QACjD,CAAC;QACD,OAAO,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,CAAC;IAChC,CAAC;YAAS,CAAC;QACV,SAAS,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;AACF,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAAc,EAAE,UAAsB;IAC1E,SAAS,CAAC;QACT,IAAI,CAAC,UAAU,CAAC,IAAI;YAAE,OAAO;QAC7B,gHAAgH;QAChH,wEAAwE;QACxE,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC;YAC7B,SAAS;QACV,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACpC,IAAI,UAAU,CAAC,eAAe,KAAK,WAAW,EAAE,CAAC;YAChD,UAAU,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YACnC,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACjC,OAAO;QACR,CAAC;QACD,kHAAkH;QAClH,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,SAAS,CAAC;QACvB,MAAM,IAAI,GAAG,SAAS,CAAC,UAAU,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;QAC/C,UAAU,CAAC,IAAI,CAAC;YACf,CAAC,EAAE,SAAS;YACZ,MAAM,EAAE,EAAE;YACV,WAAW;YACX,OAAO,EAAE,UAAU,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,IAAI,CAAC;YACxD,OAAO,EAAE,EAAE,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE;SACpE,CAAC,CAAC;QACH,MAAM,IAAI,CAAC;QACX,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,KAAK,WAAW,EAAE,CAAC;YACrC,iFAAiF;YACjF,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5C,SAAS;QACV,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7C,UAAU,CAAC,eAAe,GAAG,WAAW,CAAC;IAC1C,CAAC;AACF,CAAC;AAUD;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACf,KAAK,CAAW;IACzB,UAAU,CAA6B;IAEvC,YAAY,IAAc;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,MAAM,CAAC,UAAsB,EAAE,KAA4D;QAC1F,IAAI,KAAK,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;gBACnC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,aAAa,EAAE,6BAA6B,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAC,CAAC;gBACzG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAChF,OAAO;YACR,CAAC;YACD,MAAM,SAAS,GAAmB,EAAE,EAAE,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC9G,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5F,OAAO;QACR,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO;QACrE,IAAI,KAAK,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,OAAO;QACR,CAAC;QACD,IAAI,SAAS,CAAC,KAAK,KAAK,UAAU;YAAE,OAAO;QAC3C,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC;YACJ,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC;QAC5B,CAAC;gBAAS,CAAC;YACV,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;IACF,CAAC;IAED,kGAAkG;IAClG,UAAU;QACT,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,CAAC,SAAyB;QAChC,SAAS,CAAC,SAAS,GAAG,IAAI,CAAC;QAC3B,IAAI,SAAS,CAAC,KAAK,KAAK,UAAU,EAAE,CAAC;YACpC,6EAA6E;YAC7E,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACjF,OAAO;QACR,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,SAAS,CAAC,MAAM;YACf,EAAE,QAAQ,EAAE;aACX,KAAK,CAAC,CAAC,KAAc,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;aACnD,OAAO,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,IAAI,CACT,SAAyB,EACzB,UAAsB,EACtB,KAAuC;QAEvC,MAAM,SAAS,GAAG,GAAe,EAAE,CAClC,IAAI,UAAU,CAAC,SAAS,EAAE,8BAA8B,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;QAClF,IAAI,CAAC;YACJ,SAAS,CAAC,MAAM,GAAG,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,WAAW,CAAC,CAAC;YAClG,IAAI,SAAS,CAAC,SAAS;gBAAE,MAAM,SAAS,EAAE,CAAC;YAC3C,SAAS,CAAC,KAAK,GAAG,WAAW,CAAC;YAC9B,MAAM,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,SAAS,CAAC,SAAS;gBAAE,MAAM,SAAS,EAAE,CAAC;YAC3C,SAAS,CAAC,KAAK,GAAG,UAAU,CAAC;YAC7B,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC1F,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBACpC,MAAM,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC,OAAgB,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC1F,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS;gBAAE,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;YAC/D,IAAI,CAAC,SAAS,CAAC,SAAS;gBAAE,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC3G,CAAC;IACF,CAAC;CACD","sourcesContent":["import type { Connection } from \"./connection.ts\";\nimport { ChordError } from \"./errors.ts\";\nimport type { HostImpl, PluginRef } from \"./host.ts\";\nimport { beginReload, endReload, type Reload, type ReloadOptions, type ReloadReport, reloadError } from \"./reload.ts\";\nimport { type Frame, toWireError } from \"./wire.ts\";\n\n// Cross-host reload, coordinated by the server (the host without a parent):\n//   server: prepare itself and send `prepare` to every synced child host; collect votes\n//   all ok: the server installs its new code version, sends `commit` to every child, and only then starts what may make\n// new-code-version calls (tasks, listener and registry callbacks). Links are FIFO, so a child commits before it\n//           can receive any frame of a root started in the new code version.\n//   any failure or missed vote deadline: `abort` everywhere; each host rolls back to where it was.\n// Clients (browsers) are not participants: they see shape/reset pushes, or `upgrade_required`.\n// A child that connects behind the server's code version is fenced and reconciled with the same protocol.\n\nlet reloadSeq = 0;\n\nconst modulesFor = (remote: ReloadOptions[\"remote\"], hostName: string | undefined): string[] => {\n\tlet best: [string, readonly string[]] | undefined;\n\tfor (const entry of Object.entries(remote ?? {})) {\n\t\tif (hostName?.startsWith(entry[0]) && (best === undefined || entry[0].length > best[0].length)) best = entry;\n\t}\n\treturn [...(best?.[1] ?? [])];\n};\n\n/** A vote, or its rejection after `deadline` milliseconds. */\nfunction awaitVote(connection: Connection, id: number, deadline: number): Promise<unknown> {\n\tlet timer: ReturnType<typeof setTimeout> | undefined;\n\tconst vote = new Promise<unknown>((resolve, reject) => {\n\t\tconnection.votes.set(id, { resolve, reject });\n\t\ttimer = setTimeout(() => {\n\t\t\tconnection.votes.delete(id);\n\t\t\treject(new ChordError(\"aborted\", `votes missing after ${deadline} ms`, { reason: \"vote_deadline\" }));\n\t\t}, deadline);\n\t});\n\treturn vote.finally(() => clearTimeout(timer));\n}\n\nexport async function runClusterReload(\n\thost: HostImpl,\n\tplugins: readonly PluginRef[],\n\toptions: ReloadOptions,\n): Promise<ReloadReport> {\n\t// Participants are the children in step now. Fenced children (behind, being reconciled) reconcile to the new code\n\t// version afterwards; a child whose hello arrives while the reload runs is synced or reconciled once it ends\n\t// (`HostImpl.peerHello`).\n\tconst synced = [...host.connections].filter(\n\t\t(connection) =>\n\t\t\tconnection.role === \"downstream\" && connection.peer.kind === \"host\" && connection.open && connection.synced,\n\t);\n\tconst codeVersion = host.peekNextCodeVersion();\n\tconst reload = await beginReload(host, plugins, options, codeVersion);\n\ttry {\n\t\t// Retire first: its `retire` frames reach every child before `prepare` (FIFO), so a child never retires a code\n\t\t// version this host still runs roots of.\n\t\tawait reload.waitForRetirement();\n\t\tconst participants = synced.filter((connection) => connection.open);\n\t\tconst id = ++reloadSeq;\n\t\tconst deadline = options.voteDeadline ?? (options.gateDeadline ?? 5000) + (options.retireDeadline ?? 5000) + 5000;\n\t\tconst votes = participants.map((connection) => {\n\t\t\tconst name = connection.name ?? \"child\";\n\t\t\tconst vote = awaitVote(connection, id, deadline);\n\t\t\tconnection.send({\n\t\t\t\tt: \"prepare\",\n\t\t\t\treload: id,\n\t\t\t\tcodeVersion,\n\t\t\t\tplugins: modulesFor(options.remote, name),\n\t\t\t\toptions: {\n\t\t\t\t\tremove: modulesFor(options.remoteRemove, name),\n\t\t\t\t\tgateDeadline: options.gateDeadline,\n\t\t\t\t\tretireDeadline: options.retireDeadline,\n\t\t\t\t},\n\t\t\t});\n\t\t\treturn vote.then(\n\t\t\t\t(report) => [name, report as ReloadReport | undefined] as const,\n\t\t\t\t(error: unknown) => {\n\t\t\t\t\tconst cause = reloadError(error);\n\t\t\t\t\tthrow new ChordError(cause.code, `${name}: ${cause.message}`, { cause, reason: cause.reason });\n\t\t\t\t},\n\t\t\t);\n\t\t});\n\t\tlet local = false;\n\t\tconst results = await Promise.allSettled([\n\t\t\treload.prepare().then(() => {\n\t\t\t\tlocal = true;\n\t\t\t}),\n\t\t\t...votes,\n\t\t]);\n\t\tconst failed = results.find((result) => result.status === \"rejected\");\n\t\tif (failed !== undefined) {\n\t\t\tfor (const connection of participants) {\n\t\t\t\tconnection.votes.delete(id);\n\t\t\t\tconnection.send({ t: \"abort\", reload: id });\n\t\t\t}\n\t\t\tif (local) await reload.rollback();\n\t\t\tthrow failed.reason;\n\t\t}\n\t\tconst report = reload.commit(() => {\n\t\t\tfor (const connection of participants) {\n\t\t\t\tconnection.send({ t: \"commit\", reload: id });\n\t\t\t\tconnection.peerCodeVersion = codeVersion;\n\t\t\t}\n\t\t});\n\t\thost.rememberRemoteModules(options.remote, options.remoteRemove);\n\t\tconst children: Record<string, ReloadReport> = {};\n\t\tfor (const result of results.slice(1)) {\n\t\t\tif (result.status !== \"fulfilled\") continue;\n\t\t\tconst [name, child] = result.value as readonly [string, ReloadReport | undefined];\n\t\t\tif (child !== undefined) children[name] = child;\n\t\t}\n\t\treturn { ...report, children };\n\t} finally {\n\t\tendReload(host);\n\t}\n}\n\n/**\n * Brings a child that connected behind this host's code version up to it: a reload of the child's modules (the ones\n * cluster reloads gave its name) to this host's current code version, prepared, voted and committed like a cluster\n * reload. Until then the child is fenced: nothing is routed to it. The child's old code is never relabeled as a newer\n * code version.\n */\nexport async function reconcileChild(host: HostImpl, connection: Connection): Promise<void> {\n\tfor (;;) {\n\t\tif (!connection.open) return;\n\t\t// Not during a reload of this host: the child is not one of its participants, so whatever it would be synced to\n\t\t// now may be superseded by that reload's commit. Recheck once it ended.\n\t\tif (host.reloading) {\n\t\t\tawait host.whenReloadEnded();\n\t\t\tcontinue;\n\t\t}\n\t\tconst codeVersion = host.current.id;\n\t\tif (connection.peerCodeVersion === codeVersion) {\n\t\t\tconnection.markSynced(codeVersion);\n\t\t\thost.announceRetired(connection);\n\t\t\treturn;\n\t\t}\n\t\t// Before `prepare`: the child's prepare first retires its previous code version, which waits for this permission.\n\t\thost.announceRetired(connection);\n\t\tconst id = ++reloadSeq;\n\t\tconst vote = awaitVote(connection, id, 30_000);\n\t\tconnection.send({\n\t\t\tt: \"prepare\",\n\t\t\treload: id,\n\t\t\tcodeVersion,\n\t\t\tplugins: modulesFor(host.remoteModules, connection.name),\n\t\t\toptions: { remove: modulesFor(host.remoteRemoved, connection.name) },\n\t\t});\n\t\tawait vote;\n\t\tif (host.current.id !== codeVersion) {\n\t\t\t// This host moved on meanwhile: abort and try again with the newer code version.\n\t\t\tconnection.send({ t: \"abort\", reload: id });\n\t\t\tcontinue;\n\t\t}\n\t\tconnection.send({ t: \"commit\", reload: id });\n\t\tconnection.peerCodeVersion = codeVersion;\n\t}\n}\n\n/** One prepare the child received, registered before its first await so an abort or disconnect is never lost. */\ninterface ChildOperation {\n\treadonly id: number;\n\treload: Reload | undefined;\n\tstate: \"loading\" | \"preparing\" | \"prepared\";\n\tcancelled: boolean;\n}\n\n/**\n * The child side: prepare and vote, then wait for the server's commit or abort. An abort or a lost parent link can\n * arrive at any point: while loading modules, while preparing (pending opens close themselves when they complete),\n * or after the vote. The operation is unwound once its pending work settles, and the reload slot is freed.\n */\nexport class ChildReloads {\n\treadonly #host: HostImpl;\n\t#operation: ChildOperation | undefined;\n\n\tconstructor(host: HostImpl) {\n\t\tthis.#host = host;\n\t}\n\n\thandle(connection: Connection, frame: Extract<Frame, { t: \"prepare\" | \"commit\" | \"abort\" }>): void {\n\t\tif (frame.t === \"prepare\") {\n\t\t\tif (this.#operation !== undefined) {\n\t\t\t\tconst error = new ChordError(\"unavailable\", \"a reload is already running\", { reason: \"reload_running\" });\n\t\t\t\tconnection.send({ t: \"vote\", reload: frame.reload, error: toWireError(error) });\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst operation: ChildOperation = { id: frame.reload, reload: undefined, state: \"loading\", cancelled: false };\n\t\t\tthis.#operation = operation;\n\t\t\tthis.#run(operation, connection, frame).catch((error: unknown) => this.#host.report(error));\n\t\t\treturn;\n\t\t}\n\t\tconst operation = this.#operation;\n\t\tif (operation === undefined || operation.id !== frame.reload) return;\n\t\tif (frame.t === \"abort\") {\n\t\t\tthis.#cancel(operation);\n\t\t\treturn;\n\t\t}\n\t\tif (operation.state !== \"prepared\") return;\n\t\tthis.#operation = undefined;\n\t\ttry {\n\t\t\toperation.reload?.commit();\n\t\t} finally {\n\t\t\tendReload(this.#host);\n\t\t}\n\t}\n\n\t/** The parent link died: nobody will commit, so roll back (now, or once pending work settles). */\n\tparentLost(): void {\n\t\tif (this.#operation !== undefined) this.#cancel(this.#operation);\n\t}\n\n\t#cancel(operation: ChildOperation): void {\n\t\toperation.cancelled = true;\n\t\tif (operation.state !== \"prepared\") {\n\t\t\t// Loading or preparing: make prepare fail now; #run unwinds when it settles.\n\t\t\toperation.reload?.rollback().catch((error: unknown) => this.#host.report(error));\n\t\t\treturn;\n\t\t}\n\t\tthis.#operation = undefined;\n\t\toperation.reload\n\t\t\t?.rollback()\n\t\t\t.catch((error: unknown) => this.#host.report(error))\n\t\t\t.finally(() => endReload(this.#host));\n\t}\n\n\tasync #run(\n\t\toperation: ChildOperation,\n\t\tconnection: Connection,\n\t\tframe: Extract<Frame, { t: \"prepare\" }>,\n\t): Promise<void> {\n\t\tconst cancelled = (): ChordError =>\n\t\t\tnew ChordError(\"aborted\", \"reload aborted by the server\", { reason: \"aborted\" });\n\t\ttry {\n\t\t\toperation.reload = await beginReload(this.#host, frame.plugins, frame.options, frame.codeVersion);\n\t\t\tif (operation.cancelled) throw cancelled();\n\t\t\toperation.state = \"preparing\";\n\t\t\tawait operation.reload.prepare();\n\t\t\tif (operation.cancelled) throw cancelled();\n\t\t\toperation.state = \"prepared\";\n\t\t\tconnection.send({ t: \"vote\", reload: frame.reload, report: operation.reload.summary() });\n\t\t} catch (error) {\n\t\t\tif (operation.reload !== undefined) {\n\t\t\t\tawait operation.reload.rollback().catch((cleanup: unknown) => this.#host.report(cleanup));\n\t\t\t\tendReload(this.#host);\n\t\t\t}\n\t\t\tif (this.#operation === operation) this.#operation = undefined;\n\t\t\tif (!operation.cancelled) connection.send({ t: \"vote\", reload: frame.reload, error: toWireError(error) });\n\t\t}\n\t}\n}\n"]}

package/dist/connection.d.ts

@@ -1,270 +0,0 @@
-import { type Encoder } from "./delta/index.ts";
-import type { HostImpl } from "./host.ts";
-import { type Link } from "./link.ts";
-import { RefImpl } from "./object.ts";
-import type { RemoteBinding, RemoteChannel } from "./remote.ts";
-import type { StateEvent } from "./types.ts";
-import { type Frame, type RootRef } from "./wire.ts";
-export interface LinkOptions {
-    /** Milliseconds between pings (default 15000). */
-    readonly pingInterval?: number;
-    /** Close the link when nothing arrived for this long (default 45000). Everything held through it is released. */
-    readonly pingTimeout?: number;
-    /**
-     * Unacknowledged frame bytes (JSON text length) beyond which state frames wait for the peer (default 256 KiB). Only
-     * applies when both ends acknowledge frames and the link reports sizes; `Infinity` never holds state back.
-     */
-    readonly window?: number;
-    /**
-     * Bytes of state ops that may wait for the peer on this link (default 4 windows). Beyond, the oldest waiting streams
-     * are replaced by their current value (a reset), so memory stays bounded however long the peer stalls.
-     */
-    readonly pendingCap?: number;
-    /**
-     * The peer speaks another link protocol version (`peer`: undefined if it did not say): the link closes, and should
-     * not be reconnected with the same code. A browser reloads its page, for instance.
-     */
-    readonly onProtocolMismatch?: (versions: {
-        readonly local: number;
-        readonly peer: number | undefined;
-    }) => void;
-}
-type StateFrame = Extract<Frame, {
-    t: "state";
-}>;
-/**
- * How a waiting stream recovers when its ops must be dropped: the provider resends the current value as a reset at
- * flush; a relay (which has no value) asks downstream for one.
- */
-type Overflow = {
-    readonly resend: () => void;
-} | {
-    readonly resync: () => void;
-};
-export interface AcceptOptions<P = unknown> extends LinkOptions {
-    /** The principal of whatever connects, from the app's authenticator. Every request on the link acts as it. */
-    readonly principal: P;
-    /**
-     * What the peer is, decided here and never by its `hello`: `client` (default; a browser: no roots, no code versions,
-     * not a reload participant, not addressable) or `host` (a child host; needs `name`).
-     */
-    readonly kind?: "host" | "client";
-    /** A child host's name: its hello must match, and it is reachable `at` this name. */
-    readonly name?: string;
-    /** On `invalidatePrincipal`: a new principal keeps the link, `undefined` closes it (default: close). */
-    restamp?(principal: P): P | undefined;
-    /**
-     * Calls the peer may have in progress on this link (default: no limit). Further ones never run: they are answered
-     * at once with `unavailable` (reason `too_many_calls`), and the link stays open.
-     */
-    readonly maxCalls?: number;
-}
-export interface Peer {
-    readonly kind: "host" | "client";
-    /** Configured (downstream hosts) or announced by the trusted parent (upstream). */
-    readonly name: string | undefined;
-}
-/** A state member's stream to the consumer: its subscription and delta encoder. */
-interface Feed {
-    unsubscribe: () => void;
-    encoder: Encoder;
-    /** Events that arrived while a unit or reset was being built (replayed after it is sent). */
-    buffer: StateEvent<unknown>[] | undefined;
-}
-/** A hold the peer made on this host and serves locally. */
-interface ServedLocal {
-    readonly kind: "local";
-    readonly id: number;
-    readonly ref: RefImpl;
-    readonly principal: unknown;
-    /** The client connection it comes from (see `Frame` hold `origin`); undefined for a host's own holds. */
-    readonly origin: string | undefined;
-    /** The consumer wants state (hold without `state: false`, or `sub`). */
-    wantsState: boolean;
-    /** The consumer had values before (re-hold): its first unit waits for the window like any other. */
-    readonly again: boolean;
-    /** A unit was sent. */
-    unitSent: boolean;
-    /** The members whose snapshot the consumer has, with their streams. */
-    readonly feeds: Map<string, Feed>;
-}
-/** A hold the peer made on this host: served locally or relayed to another link. */
-type Served = ServedLocal | {
-    readonly kind: "relay";
-    readonly relay: RelayRef;
-};
-type Pending = {
-    readonly resolve: (value: unknown) => void;
-    readonly reject: (error: unknown) => void;
-};
-/**
- * A hold relayed from an origin link to a downstream link. It owns everything done through it: state and calls queued
- * while the route resolves, and the downstream twins once forwarded. `close` undoes all of it exactly once (cancels
- * calls downstream, drops what waits for the origin, releases the downstream hold, rejects waiters).
- */
-export declare class RelayRef {
-    #private;
-    readonly origin: Connection;
-    readonly frame: Extract<Frame, {
-        t: "hold";
-    }>;
-    readonly principal: unknown;
-    /** The client connection the hold comes from (forwarded downstream); undefined for a host's own holds. */
-    readonly originTag: string | undefined;
-    /** The origin's authorization generation when the hold arrived; a revocation bumps it. */
-    readonly generation: number;
-    down: Connection | undefined;
-    downId: number;
-    closed: boolean;
-    /** The origin wants state (forwarded as `state: false`, `sub`, `unsub`). */
-    stateWanted: boolean;
-    /** The members of the first unit, still to forward past the origin's window. */
-    urgent: Set<string> | undefined;
-    /** Members whose ops this relay dropped: downstream ops are ignored until their reset arrives. */
-    readonly awaiting: Set<string>;
-    readonly calls: Map<number, RelayCall>;
-    constructor(origin: Connection, frame: Extract<Frame, {
-        t: "hold";
-    }>, principal: unknown, originTag: string | undefined);
-    get originId(): number;
-    get client(): boolean;
-    /** Still authorized as it was when it arrived. */
-    get current(): boolean;
-    /** The downstream connection once the route resolved; rejects if the relay closes first. */
-    ready(): Promise<Connection>;
-    /** Forwards the hold to `down`. */
-    open(down: Connection): void;
-    /** The origin starts or stops the hold's state. */
-    wantState(wanted: boolean): void;
-    /**
-     * The origin could not keep up and dropped what waited for member `m` (or asked for it again): ask downstream for a
-     * reset, and ignore its ops until the reset arrives.
-     */
-    resync(m: string): void;
-    /** A shape from downstream: forwarded at once; the members of the first unit then skip the origin's window. */
-    shape(frame: Extract<Frame, {
-        t: "shape";
-    }>): void;
-    /** A state frame from downstream. */
-    state(frame: StateFrame): void;
-    /**
-     * Closes the relay. `releaseDown`: the downstream hold is still there (origin released, disconnected, or was
-     * revoked): cancel its calls and release it. `notify`: tell the origin the hold is gone.
-     */
-    close(error: unknown, options: {
-        readonly releaseDown: boolean;
-        readonly notify: boolean;
-    }): void;
-}
-/** One relayed call: settles once, by result, cancellation or the relay closing; removes both mappings. */
-export declare class RelayCall {
-    #private;
-    readonly relay: RelayRef;
-    readonly originId: number;
-    readonly downId: number;
-    constructor(relay: RelayRef, originId: number, downId: number, pending: Pending);
-    finish(error: unknown, value?: unknown): void;
-    /** Cancels downstream (when the downstream hold still exists) and settles with `error`. */
-    cancel(error: unknown, forward: boolean): void;
-}
-/**
- * One end of a link on a host: consumer of remote references, provider for the peer's holds, and relay.
- *
- * State
- * -----
- *
- * A hold implies the state of its variant (unless it says `state: false`). The provider answers with a unit: the shape,
- * then a snapshot of each state member the consumer does not have yet (`shape.state` lists them), then the members'
- * ops and resets. A reload or a variant change sends another unit with the members that are new; members that left the
- * variant stop. The consumer applies a shape once its snapshots are here (`RemoteBinding`).
- *
- * Flow control
- * ------------
- *
- * Problem: state is pushed as fast as it changes, but a peer may read slowly (a phone behind a relay), and a relay may
- * hide that: Cloudflare forwards to browsers without backpressure. Everything sent then queues in front of the next
- * call result. Example: a browser opens three long transcripts (500 KiB of snapshots each) over a 5 Mbit/s path; a
- * result sent next waits 2.4 s, and the snapshot of a transcript the user already left is still sent in full.
- *
- * Solution: the peer acknowledges what it processed (`ack`, a cumulative frame count), and the sender counts the sizes
- * of the frames not yet acknowledged. While they exceed the window, state waits here in slots, flushed in creation
- * order as acknowledgements come:
- * - a member's stream has one slot: ops are appended (encoded batches of one stream may be concatenated, see
- *   `encoder`), a snapshot, reset or error replaces it;
- * - a hold's unit has one slot, built lazily from the current values when it is sent, so a newer unit merges into it;
- *   while it waits, the members it introduces have no stream yet.
- *
- * The first unit of a hold that is not a re-hold (`again`) is sent at once, past the window: a `get` waits for it, and
- * must not wait behind other holds' state. Results, shapes, gone, reload control and pings are sent at once too: they
- * are bounded by the requests the peer makes. Hence the one ordering exception of a link: while state waits, a result
- * can arrive before state changes made before it. Frames of one stream stay in order.
- *
- * Waiting ops are capped per link (`pendingCap`): beyond, the oldest streams are replaced by their current value (a
- * reset built at flush), or, on a relay, by a reset asked of the provider (`resync`), so memory stays bounded however
- * long the peer stalls. The window bounds what is unacknowledged when a frame is sent, so one frame (a large snapshot)
- * may exceed it. Both hellos must announce `acks`; with an older peer nothing is acknowledged and nothing waits. Links
- * that do not report sizes (IPC) never fill the window.
- */
-export declare class Connection implements RemoteChannel {
-    #private;
-    readonly host: HostImpl;
-    readonly link: Link;
-    /** `upstream`: the link to this host's parent. `downstream`: a link this host accepted. */
-    readonly role: "upstream" | "downstream";
-    readonly peer: Peer;
-    /** A client connection's opaque id: holds that come over it (directly or relayed) carry it as their `origin`. */
-    readonly originId: string | undefined;
-    principal: unknown;
-    readonly restamp: ((principal: unknown) => unknown | undefined) | undefined;
-    /** Bumped when the stamped principal is revoked or re-stamped: relays from before are refused. */
-    generation: number;
-    /** The code version a downstream host peer runs (from its hello, then from commits). */
-    peerCodeVersion: number | undefined;
-    /** A downstream host peer is usable once it runs this host's current code version (see `HostImpl.peerHello`). */
-    synced: boolean;
-    /** Code versions this child announced while behind this host (fenced): this host never ran them. */
-    readonly fencedCodeVersions: Set<number>;
-    readonly remotes: Map<number, RemoteBinding>;
-    readonly calls: Map<number, Pending>;
-    readonly served: Map<number, Served>;
-    readonly incoming: Map<number, AbortController>;
-    readonly relayedRefs: Map<number, RelayRef>;
-    readonly relayedCalls: Map<number, RelayCall>;
-    /** Reload votes awaited from this (child) peer. */
-    readonly votes: Map<number, Pending>;
-    constructor(host: HostImpl, link: Link, config: {
-        readonly role: "upstream" | "downstream";
-        readonly principal: unknown;
-        readonly peer: Peer;
-        readonly originId?: string;
-        readonly restamp?: (principal: unknown) => unknown | undefined;
-        readonly maxCalls?: number;
-    } & LinkOptions);
-    get open(): boolean;
-    /** The peer's name: configured for downstream hosts, announced by the parent upstream. */
-    get name(): string | undefined;
-    send(frame: Frame): void;
-    /** Sends a state frame, or keeps it waiting (see the class comment). */
-    sendState(frame: StateFrame, overflow: Overflow): void;
-    /** Forgets what waits for a stream that ended. */
-    dropState(hold: number, m: string): void;
-    /** Forgets everything that waits for a hold (released, closed, or its state stopped). */
-    dropHoldState(hold: number): void;
-    /** What waits for the peer: slots and bytes of ops (for tests and diagnostics). */
-    get waiting(): {
-        readonly slots: number;
-        readonly bytes: number;
-    };
-    nextId(): number;
-    /** Resolves once the peer is usable (a host peer runs this host's code version); rejects if the link closes first. */
-    whenSynced(): Promise<void>;
-    markSynced(codeVersion: number): void;
-    /** Revokes the stamped principal: relays made under it close at once (also those still resolving a route). */
-    revoke(next: unknown | undefined): void;
-    hold(binding: RemoteBinding, again: boolean): number;
-    release(id: number): void;
-    wantState(hold: number, wanted: boolean): void;
-    call(hold: number, member: string, args: unknown, root: RootRef | undefined, signal: AbortSignal): Promise<unknown>;
-}
-export {};
-//# sourceMappingURL=connection.d.ts.map