@smthrs/sync 0.0.0-stage → 1.0.0-rc.4

package/dist/esm/BranchPresence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BranchPresence.js","sourceRoot":"","sources":["../../src/BranchPresence.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAA;AACrC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,EAGL,MAAM,EAEN,WAAW,EAEX,aAAa,EAEd,MAAM,qBAAqB,CAAA;AAC5B,OAAO,KAAK,WAAW,MAAM,kBAAkB,CAAA;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAA;AACzD,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAoC1C;;;;;GAKG;AACH,MAAM,OAAO,cAAe,SAAQ,OAAO,CAAC,OAAO,EAA2B,CAAC,6BAA6B,CAAC;CAAG;AAEhH,MAAM,WAAW,GAAG,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,gCAAgC,EAAE,CAAC,CAAA;AAErG;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAA;AAEpC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,YAA8B,EAAE,EAAW,EAAE,CACpE,cAAc,CAAC,EAAE,CAAC;IAChB,QAAQ,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACxC,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACrC,IAAI,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;IACpC,UAAU,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;IAC3C,OAAO,EAAE,MAAM,CAAC,KAAK;IACrB,OAAO,EAAE,cAAc;IACvB,GAAG,SAAS;CACb,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,SAAS,GAAgC,KAAK,CAAC,OAAO,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,CAAA;AAgD/F,MAAM,aAAa,GAAG,CAAC,aAA4B,EAAa,EAAE,CAChE,IAAI,SAAS,CAAC;IACZ,IAAI,EAAE,cAAc;IACpB,OAAO,EAAE,eAAe,aAAa,sCAAsC;CAC5E,CAAC,CAAA;AAUJ;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAEzC;;;;;;;;;;;;;GAaG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAEzC,MAAM,QAAQ,GAAa;IACzB,OAAO,EAAE,cAAc;IACvB,eAAe,EAAE,sBAAsB;IACvC,eAAe,EAAE,sBAAsB;IACvC,YAAY,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;CAC1C,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,CACxB,UAA2B,EAAE,EAC+B,EAAE,CAC9D,MAAM,CAAC,OAAO,CACZ,MAAM,CAAC,GAAG,CAAC;IACT,OAAO,EAAE,WAAW,CAAC,wCAAwC,EAAE,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC;IACjG,eAAe,EAAE,WAAW,CAC1B,gDAAgD,EAChD,OAAO,CAAC,eAAe,EACvB,QAAQ,CAAC,eAAe,CACzB;IACD,eAAe,EAAE,WAAW,CAC1B,gDAAgD,EAChD,OAAO,CAAC,eAAe,EACvB,QAAQ,CAAC,eAAe,CACzB;CACF,CAAC,EACF,CAAC,QAAQ,EAAE,EAAE,CAAC,YAAY,CAAC,EAAE,GAAG,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC,CACzG,CAAA;AAEH,qDAAqD;AACrD,MAAM,YAAY,GAAG,CACnB,EAAE,eAAe,EAAE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAY,EACb,EAAE,CAC1D,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAA;IAClD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,WAAW,CAAA;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAA+B,CAAA;IACrD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAW,eAAe,CAAC,CAAA;IAEhE,MAAM,MAAM,GAAG,CAAC,QAAkB,EAAE,KAAa,EAAE,EAAE;QACnD,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACnC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAA;QAC1C,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;YAC3C,IAAI,IAAI,CAAC,WAAW,CAAC,gBAAgB,IAAI,KAAK;gBAAE,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;QAC9E,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;YACvB,OAAO,SAAS,CAAA;QAClB,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC,CAAA;IAED,oEAAoE;IACpE,0EAA0E;IAC1E,oEAAoE;IACpE,IAAI,WAAW,GAAG,MAAM,CAAC,IAAI,EAAE,CAAA;IAC/B,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,EAAE;QAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,CAAA;YAC/B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,WAAW,GAAG,MAAM,CAAC,IAAI,EAAE,CAAA;gBAC3B,MAAK;YACP,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC,CAAA;IAED,MAAM,OAAO,GAAG,CAAC,OAA6D,EAAE,EAAE,CAChF,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,CAAA;IAClE,MAAM,SAAS,GAAG,CAAC,KAAwC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAA;IAC9E,MAAM,MAAM,GAAG,CAAC,WAAwB,EAAe,EAAE,CACvD,IAAI,WAAW,CAAC;QACd,GAAG,WAAW;QACd,GAAG,CAAC,WAAW,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACnF,MAAM,EAAE,WAAW,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;KAC5E,CAAC,CAAA;IAEJ;;;;;OAKG;IACH,MAAM,IAAI,GAAG,CAAC,QAAkB,EAAE,KAAa,EAAsB,EAAE;QACrE,KAAK,CAAC,KAAK,CAAC,CAAA;QACZ,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QACtC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,EAAE,CAAA;QACnC,0EAA0E;QAC1E,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAC1F,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACxC,CAAA;IACH,CAAC,CAAA;IAED;;;;;;;;OAQG;IACH,MAAM,YAAY,GAAG,CAAC,OAAsB,EAAiB,EAAE,CAAC,CAAC;QAC/D,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,QAAQ,EAAE,OAAO,CAAC,QAAQ;KAC3B,CAAC,CAAA;IACF,MAAM,WAAW,GAAG,CAAC,OAAqB,EAAgB,EAAE,CAAC,CAAC;QAC5D,GAAG,YAAY,CAAC,OAAO,CAAC;QACxB,aAAa,EAAE,OAAO,CAAC,aAAa;QACpC,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;KAC7E,CAAC,CAAA;IACF,MAAM,kBAAkB,GAAG,CAAC,OAAqB,EAAE,EAAE;QACnD,MAAM,cAAc,GAAY,OAAO,CAAC,MAAM,CAAA;QAC9C,MAAM,MAAM,GAAkE,cAAc,KAAK,IAAI;YACnG,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,OAAO,cAAc,KAAK,QAAQ;gBACpC,CAAC,CAAC,EAAE,MAAM,EAAG,cAAyB,CAAC,MAAM,EAAE,MAAM,EAAG,cAAyB,CAAC,MAAM,EAAE;gBAC1F,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,CAAA;QAC5C,OAAO;YACL,GAAG,WAAW,CAAC,OAAO,CAAC;YACvB,WAAW,EAAE,OAAO,CAAC,WAAW;YAChC,MAAM;YACN,GAAG,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;YAC7D,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3E,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzE,GAAG,CAAC,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,OAAO,CAAC,UAAU,EAAE,CAAC;YAC/E,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;YAC5E,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;YAC1D,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;SACjE,CAAA;IACH,CAAC,CAAA;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,EAAE,CAAC,yBAAyB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAsB;QACpF,MAAM,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAA;QAC7C,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC;YAChC,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,aAAa,EAAE,QAAQ,CAAC,aAAa;SACtC,CAAC,CAAA;QACF,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE;YACtD,QAAQ,EAAE,QAAQ,CAAC,QAAQ;YAC3B,MAAM,EAAE,OAAO;SAChB,CAAC,CAAA;QACF,qEAAqE;QACrE,uEAAuE;QACvE,oEAAoE;QACpE,gEAAgE;QAChE,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,gDAAgD,EAAE,CAAC,CACtG,CAAA;QACH,CAAC;QACD,IAAI,QAAQ,CAAC,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9E,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,2BAA2B,EAAE,CAAC,CAAC,CAAA;QAC7G,CAAC;QACD,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS,IAAI,QAAQ,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAC,CAAA;QAC5G,CAAC;QACD,IAAI,MAAM,GAAkB,IAAI,CAAA;QAChC,IAAI,QAAQ,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;YAC7B,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAA;YAC1C,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,sCAAsC,EAAE,CAAC,CAC5F,CAAA;YACH,CAAC;YACD,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9E,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC,EAAE,IAAI,EAAE,iBAAiB,EAAE,OAAO,EAAE,sDAAsD,EAAE,CAAC,CAC5G,CAAA;YACH,CAAC;YACD,MAAM,GAAG,IAAI,MAAM,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;QACzC,CAAC;QACD,MAAM,YAAY,GAAG,EAAE,GAAG,QAAQ,EAAE,MAAM,EAAE,CAAA;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAA;QAC5C,wEAAwE;QACxE,sEAAsE;QACtE,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QAClC,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,EAAgB,CAAA;QAC3E,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAA;QAC9C,sEAAsE;QACtE,sEAAsE;QACtE,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAC7D,IAAI,CAAC,WAAW,CAAC,aAAa,KAAK,YAAY,CAAC,aAAa,IAAI,IAAI,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY,CAC3G,CAAA;QACD,IAAI,YAAY,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC;YACtF,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAA;QACtE,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,IAAI,eAAe,EAAE,CAAC;YACzD,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CACvB,IAAI,SAAS,CAAC;gBACZ,IAAI,EAAE,cAAc;gBACpB,OAAO,EAAE,UAAU,YAAY,CAAC,QAAQ,kBAAkB,eAAe,eAAe;aACzF,CAAC,CACH,CAAA;QACH,CAAC;QACD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC;YAClC,QAAQ,EAAE,YAAY,CAAC,QAAQ;YAC/B,aAAa,EAAE,YAAY,CAAC,aAAa;YACzC,WAAW,EAAE,YAAY,CAAC,WAAW;YACrC,MAAM,EAAE,YAAY,CAAC,MAAM;YAC3B,GAAG,CAAC,YAAY,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,YAAY,CAAC,SAAS,EAAE,CAAC;YACtF,GAAG,CAAC,YAAY,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,CAAC;YACvE,GAAG,CAAC,YAAY,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,CAAC;YAC1E,GAAG,CAAC,YAAY,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,YAAY,CAAC,QAAQ,EAAE,CAAC;YACnF,GAAG,CAAC,YAAY,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,YAAY,CAAC,UAAU,EAAE,CAAC;YACzF,GAAG,CAAC,YAAY,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,YAAY,CAAC,SAAS,EAAE,CAAC;YACtF,GAAG,CAAC,YAAY,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,GAAG,EAAE,CAAC;YACpE,GAAG,CAAC,YAAY,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,CAAC;YAC1E,gBAAgB,EAAE,KAAK,GAAG,OAAO;SAClC,CAAC,CAAA;QACF,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAA;QACrF,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;QACzC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAA;QACrD,OAAO,MAAM,CAAC,WAAW,CAAC,CAAA;IAC5B,CAAC,CAAC,CAAA;IAEF,MAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAsB;QAC9E,MAAM,OAAO,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAA;QACrC,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAA;QACvG,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAA;QACvG,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;QACvE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,OAAO,CAAC,SAAS,KAAK,SAAS;gBAC1C,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,KAAK,OAAO,CAAC,aAAa,CAAC;qBACzF,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC;gBACtB,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAA;YACtB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBAC5B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC;oBACpE,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAA;gBACjE,CAAC;YACH,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,IAAI;gBAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;YAC1C,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;gBAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACxD,CAAC;QACD,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAA;IAClD,CAAC,CAAC,CAAA;IAEF,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,qBAAqB,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAuB;QAC7E,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACtC,KAAK,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAA;QACjE,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;QACvF,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAA;IAC/D,CAAC,CAAC,CAAA;IAEF,MAAM,UAAU,GAAG,MAAM,CAAC,EAAE,CAAC,2BAA2B,CAAC,CAAC,QAAQ,CAAC,EAAC,QAAuB;QACzF,MAAM,OAAO,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAA;QACtC,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;QACvF,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAA;QAC5C,IAAI,KAAK,GAAG,WAAW,GAAG,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAAE,OAAO,SAAkB,CAAA;QACxG,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAgB,CAAC,CAAC,CAAC,SAAkB,CAAA;IAC3F,CAAC,CAAC,CAAA;IAEF,OAAO,cAAc,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,CAAA;AAC/G,CAAC,CAAC,CAAA;AAEJ;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAgE,KAAK,CAAC,MAAM,CAC5F,cAAc,EACd,YAAY,CAAC,QAAQ,CAAC,CACvB,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,OAAwB,EACyC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,OAAO,CAAC,CAAC,CAAA","sourcesContent":["/**\n * Ephemeral presence and cursors for one shared branch.\n *\n * Presence is deliberately NOT journalled. A roster is a lease table: every\n * announcement extends a lease, and a participant that stops announcing —\n * because the tab closed, the network dropped, or the process died — ages out\n * without anyone reporting the disconnect. Writing presence to the journal\n * would make \"who was looking at this\" part of the durable, replayable history\n * of a run, which is both unbounded and wrong: replaying a branch must not\n * resurrect a stranger's caret.\n *\n * Every operation authorizes through {@link BranchShare}, so a capability for\n * one branch can neither read nor write another branch's roster. A live\n * participant is bound to the capability that announced it: announcing or\n * leaving under that `participantId` with any other capability is refused\n * with `unauthorized` until the lease lapses.\n *\n * @since 0.1.0\n */\n\nimport * as Clock from \"effect/Clock\"\nimport * as Context from \"effect/Context\"\nimport * as Effect from \"effect/Effect\"\nimport * as Layer from \"effect/Layer\"\nimport * as PubSub from \"effect/PubSub\"\nimport * as Schema from \"effect/Schema\"\nimport * as Stream from \"effect/Stream\"\nimport {\n  type Announcement,\n  type BranchId,\n  Cursor,\n  type LeaveRequest,\n  Participant,\n  type ParticipantId,\n  PresenceWhere,\n  type RosterRequest\n} from \"./BranchProtocol.ts\"\nimport * as BranchShare from \"./BranchShare.ts\"\nimport { positiveInt } from \"./internal/PolicyOptions.ts\"\nimport { SyncError } from \"./SyncError.ts\"\n\n/**\n * Ephemeral branch presence operations.\n *\n * @category models\n * @since 0.1.0\n */\nexport interface Service {\n  readonly announce: (announcement: Announcement) => Effect.Effect<Participant, SyncError>\n  readonly leave: (request: LeaveRequest) => Effect.Effect<void, SyncError>\n  /**\n   * One branch's live roster, as a fresh array of detached participants and\n   * cursors. Reading drops expired leases and advances a cross-branch sweep.\n   */\n  readonly list: (request: RosterRequest) => Effect.Effect<ReadonlyArray<Participant>, SyncError>\n  /**\n   * Returns `unknown` for one lease after host startup or while a required\n   * heartbeat source is unavailable; otherwise reports `present` or `empty`.\n   *\n   * @since 1.0.0\n   */\n  readonly presenceOn: (request: RosterRequest) => Effect.Effect<\"unknown\" | \"present\" | \"empty\", SyncError>\n  readonly changes: Stream.Stream<BranchId>\n  /**\n   * How long one announcement keeps a participant on the roster, in\n   * milliseconds.\n   *\n   * A lease lapses without anyone reporting it, and nothing publishes on\n   * `changes` when it does, so a watcher cannot learn of the last\n   * participant's departure from the change feed alone. It re-lists on this\n   * cadence capped at one second, bounding how long an expired lease stays visible.\n   */\n  readonly leaseMs: number\n}\n\n/**\n * The branch presence registry.\n *\n * @category services\n * @since 0.1.0\n */\nexport class BranchPresence extends Context.Service<BranchPresence, Service>()(\"@smthrs/sync/BranchPresence\") {}\n\nconst unavailable = new SyncError({ code: \"unsupported\", message: \"Branch presence is unavailable\" })\n\n/**\n * The lease {@link makeNoop} reports. It holds no one, so the value only has\n * to be a positive number a watcher can build a re-list cadence from.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const defaultLeaseMs = 30_000\n\n/**\n * Constructs an unavailable presence registry.\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const makeNoop = (overrides: Partial<Service> = {}): Service =>\n  BranchPresence.of({\n    announce: () => Effect.fail(unavailable),\n    leave: () => Effect.fail(unavailable),\n    list: () => Effect.fail(unavailable),\n    presenceOn: () => Effect.succeed(\"unknown\"),\n    changes: Stream.empty,\n    leaseMs: defaultLeaseMs,\n    ...overrides\n  })\n\n/**\n * Provides an unavailable presence registry.\n *\n * @category layers\n * @since 0.1.0\n */\nexport const layerNoop: Layer.Layer<BranchPresence> = Layer.succeed(BranchPresence, makeNoop())\n\n/**\n * The policy one presence registry runs under. Every field defaults, and\n * {@link makeMemory} and {@link layerWith} validate what a caller supplies.\n *\n * @category models\n * @since 0.1.0\n */\nexport interface PresenceOptions {\n  /**\n   * How long an announcement keeps a participant on the roster, in\n   * milliseconds. Defaults to {@link defaultLeaseMs}.\n   */\n  readonly leaseMs?: number | undefined\n  /**\n   * Roster changes a stalled {@link Service.changes} subscriber may fall\n   * behind by. Defaults to {@link defaultChangesCapacity}.\n   */\n  readonly changesCapacity?: number | undefined\n  /**\n   * Participants one branch may hold at once. Defaults to\n   * {@link defaultMaxParticipants}.\n   */\n  readonly maxParticipants?: number | undefined\n  /**\n   * Host readiness, including authorization, revocation, bridge and session\n   * sources. Defaults to unavailable.\n   *\n   * @since 1.0.0\n   */\n  readonly sourcesReady?: ((branchId: BranchId) => Effect.Effect<boolean>) | undefined\n}\n\n/**\n * One roster slot: the participant, and the capability that announced it.\n *\n * `participantId` is chosen by the client, so it proves nothing on its own.\n * The slot is bound to the verified `capabilityId` of its first live\n * announcement, and only that capability may refresh or leave it until the\n * lease lapses. Without the binding any write link on the branch could\n * rename, move the caret of, or evict another link's participant.\n */\ninterface Seat {\n  readonly participant: Participant\n  readonly capabilityId: string\n}\n\nconst heldByAnother = (participantId: ParticipantId): SyncError =>\n  new SyncError({\n    code: \"unauthorized\",\n    message: `Participant ${participantId} is held by another share capability`\n  })\n\n/** The resolved, already-validated presence policy. */\ninterface Resolved {\n  readonly leaseMs: number\n  readonly changesCapacity: number\n  readonly maxParticipants: number\n  readonly sourcesReady: (branchId: BranchId) => Effect.Effect<boolean>\n}\n\n/**\n * Roster changes a stalled {@link Service.changes} subscriber may fall behind\n * by before the oldest are dropped.\n *\n * Presence is a lease table, and `changes` only says that some branch's roster\n * moved: a follower answers it with `list`. Holding an unbounded backlog for a\n * subscriber that has stopped pulling would let one abandoned watcher retain\n * every announcement the process has seen since. A subscriber that falls\n * further behind than this bound loses the oldest notifications and re-lists;\n * because every notification is answered by a fresh `list`, dropping one never\n * loses roster state.\n *\n * @category constants\n * @since 0.1.0\n */\nexport const defaultChangesCapacity = 256\n\n/**\n * Participants one branch may hold at once.\n *\n * A roster is unbounded fan-out in two directions: it is walked on every\n * `list`, and `Branch.Roster` returns it whole, which no frame ceiling covers.\n * Nothing caps how many distinct `participantId`s one write capability may\n * announce, so without this a single share link could pin an arbitrary number\n * of `Participant` objects until their leases expired. Two hundred and fifty\n * six is far above any real collaborative session; a further announce is\n * refused with `backpressure`.\n *\n * @category constants\n * @since 1.0.0-rc.0\n */\nexport const defaultMaxParticipants = 256\n\nconst defaults: Resolved = {\n  leaseMs: defaultLeaseMs,\n  changesCapacity: defaultChangesCapacity,\n  maxParticipants: defaultMaxParticipants,\n  sourcesReady: () => Effect.succeed(false)\n}\n\n/**\n * Constructs the in-memory, lease-expiring presence registry.\n *\n * Announcing requires write access: a read-only share link may watch the\n * roster but never appears on it, so a shared read link cannot be used to\n * impersonate a collaborator. A live participant belongs to the capability\n * that announced it, so another write link can neither overwrite nor evict it.\n * Holders of one link share its `capabilityId` and stay indistinguishable.\n *\n * The roster is keyed by branch and then by participant, so listing one branch\n * costs that branch plus a bounded sweep of other branches, and no two\n * branches can share a slot. One flat key built by concatenation collided\n * for valid branded ids, which let one announcement overwrite another branch's\n * participant.\n *\n * The change feed slides at {@link defaultChangesCapacity}: announcing never\n * waits on a stalled watcher, and never grows the process on its behalf.\n *\n * Fails with `invalid_request` when an option is not a positive safe integer.\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const makeMemory = (\n  options: PresenceOptions = {}\n): Effect.Effect<Service, SyncError, BranchShare.BranchShare> =>\n  Effect.flatMap(\n    Effect.all({\n      leaseMs: positiveInt(\"BranchPresence.PresenceOptions.leaseMs\", options.leaseMs, defaults.leaseMs),\n      changesCapacity: positiveInt(\n        \"BranchPresence.PresenceOptions.changesCapacity\",\n        options.changesCapacity,\n        defaults.changesCapacity\n      ),\n      maxParticipants: positiveInt(\n        \"BranchPresence.PresenceOptions.maxParticipants\",\n        options.maxParticipants,\n        defaults.maxParticipants\n      )\n    }),\n    (resolved) => makeResolved({ ...resolved, sourcesReady: options.sourcesReady ?? defaults.sourcesReady })\n  )\n\n/** The registry over an already-validated policy. */\nconst makeResolved = (\n  { changesCapacity, leaseMs, maxParticipants, sourcesReady }: Resolved\n): Effect.Effect<Service, never, BranchShare.BranchShare> =>\n  Effect.gen(function*() {\n    const startedAtMs = yield* Clock.currentTimeMillis\n    const share = yield* BranchShare.BranchShare\n    const roster = new Map<BranchId, Map<string, Seat>>()\n    const changes = yield* PubSub.sliding<BranchId>(changesCapacity)\n\n    const expire = (branchId: BranchId, nowMs: number) => {\n      const branch = roster.get(branchId)\n      if (branch === undefined) return undefined\n      for (const [participantId, seat] of branch) {\n        if (seat.participant.leaseExpiresAtMs <= nowMs) branch.delete(participantId)\n      }\n      if (branch.size === 0) {\n        roster.delete(branchId)\n        return undefined\n      }\n      return branch\n    }\n\n    // Each announce/list advances through at most 16 branch maps. Their\n    // participant counts are capped, so unrelated activity reclaims abandoned\n    // rosters without scanning the entire registry in a single request.\n    let sweepCursor = roster.keys()\n    const sweep = (nowMs: number) => {\n      for (let index = 0; index < 16; index++) {\n        const next = sweepCursor.next()\n        if (next.done) {\n          sweepCursor = roster.keys()\n          break\n        }\n        expire(next.value, nowMs)\n      }\n    }\n\n    const seatKey = (request: { participantId: ParticipantId; sessionId?: string }) =>\n      JSON.stringify([request.participantId, request.sessionId ?? \"\"])\n    const copyWhere = (where: NonNullable<Participant[\"where\"]>) => ({ ...where })\n    const detach = (participant: Participant): Participant =>\n      new Participant({\n        ...participant,\n        ...(participant.where === undefined ? {} : { where: copyWhere(participant.where) }),\n        cursor: participant.cursor === null ? null : new Cursor(participant.cursor)\n      })\n\n    /**\n     * Drop this branch's expired leases and advance cleanup of other branches.\n     * Abandoned maps are reclaimed as announce/list calls advance the sweep;\n     * an idle registry keeps them until activity resumes. Results are detached\n     * from storage, including each participant's cursor.\n     */\n    const live = (branchId: BranchId, nowMs: number): Array<Participant> => {\n      sweep(nowMs)\n      const branch = expire(branchId, nowMs)\n      if (branch === undefined) return []\n      // Map entries have distinct seat keys, so compared seats cannot be equal.\n      return Array.from(branch.values(), (seat) => detach(seat.participant)).sort((left, right) =>\n        seatKey(left) < seatKey(right) ? -1 : 1\n      )\n    }\n\n    /**\n     * Copy a request out of the caller's object before the first await.\n     *\n     * `share.verify` awaits Web Crypto between authorizing `branchId` and the\n     * roster access that follows. The request objects are plain structs the\n     * in-process caller still holds, so reading them again after the await let\n     * a caller move `branchId` (or the participant identity) onto a branch the\n     * capability never authorized. Matches the claim snapshot in `BranchShare`.\n     */\n    const detachRoster = (request: RosterRequest): RosterRequest => ({\n      capability: request.capability,\n      branchId: request.branchId\n    })\n    const detachLeave = (request: LeaveRequest): LeaveRequest => ({\n      ...detachRoster(request),\n      participantId: request.participantId,\n      ...(request.sessionId === undefined ? {} : { sessionId: request.sessionId })\n    })\n    const detachAnnouncement = (request: Announcement) => {\n      const suppliedCursor: unknown = request.cursor\n      const cursor: { readonly cardId: unknown; readonly offset: unknown } | null = suppliedCursor === null\n        ? null\n        : typeof suppliedCursor === \"object\"\n        ? { cardId: (suppliedCursor as Cursor).cardId, offset: (suppliedCursor as Cursor).offset }\n        : { cardId: undefined, offset: undefined }\n      return {\n        ...detachLeave(request),\n        displayName: request.displayName,\n        cursor,\n        ...(request.kind === undefined ? {} : { kind: request.kind }),\n        ...(request.where === undefined ? {} : { where: copyWhere(request.where) }),\n        ...(request.watching === undefined ? {} : { watching: request.watching }),\n        ...(request.for_member === undefined ? {} : { for_member: request.for_member }),\n        ...(request.agentKind === undefined ? {} : { agentKind: request.agentKind }),\n        ...(request.via === undefined ? {} : { via: request.via }),\n        ...(request.runId === undefined ? {} : { runId: request.runId })\n      }\n    }\n\n    const announce = Effect.fn(\"BranchPresence.announce\")(function*(supplied: Announcement) {\n      const detached = detachAnnouncement(supplied)\n      yield* Effect.annotateCurrentSpan({\n        branchId: detached.branchId,\n        participantId: detached.participantId\n      })\n      const claims = yield* share.verify(detached.capability, {\n        branchId: detached.branchId,\n        access: \"write\"\n      })\n      // The wire schema IS `Announcement`, so a remote caller cannot reach\n      // here with an empty name. An in-process caller can, and `Participant`\n      // requires a `NonEmptyString`: without this the constructor threw a\n      // defect out of an operation whose type promises a `SyncError`.\n      if (detached.displayName.length === 0) {\n        return yield* Effect.fail(\n          new SyncError({ code: \"invalid_request\", message: \"A participant's display name must not be empty\" })\n        )\n      }\n      if (detached.where !== undefined && !Schema.is(PresenceWhere)(detached.where)) {\n        return yield* Effect.fail(new SyncError({ code: \"invalid_request\", message: \"Invalid presence location\" }))\n      }\n      if (detached.sessionId !== undefined && detached.sessionId.length === 0) {\n        return yield* Effect.fail(new SyncError({ code: \"invalid_request\", message: \"Invalid presence session\" }))\n      }\n      let cursor: Cursor | null = null\n      if (detached.cursor !== null) {\n        const { cardId, offset } = detached.cursor\n        if (typeof cardId !== \"string\" || cardId.length === 0) {\n          return yield* Effect.fail(\n            new SyncError({ code: \"invalid_request\", message: \"A cursor's card ID must not be empty\" })\n          )\n        }\n        if (typeof offset !== \"number\" || !Number.isSafeInteger(offset) || offset < 0) {\n          return yield* Effect.fail(\n            new SyncError({ code: \"invalid_request\", message: \"A cursor's offset must be a nonnegative safe integer\" })\n          )\n        }\n        cursor = new Cursor({ cardId, offset })\n      }\n      const announcement = { ...detached, cursor }\n      const nowMs = yield* Clock.currentTimeMillis\n      // Run-out leases are dropped before the cap is judged, so a branch that\n      // has simply been busy over time is never refused for a stale roster.\n      live(announcement.branchId, nowMs)\n      const branch = roster.get(announcement.branchId) ?? new Map<string, Seat>()\n      const held = branch.get(seatKey(announcement))\n      // A session suffix must not bypass the existing participant ownership\n      // fence. The host may bind multiple sessions to one actor capability.\n      const foreignActor = Array.from(branch.values()).some((seat) =>\n        seat.participant.participantId === announcement.participantId && seat.capabilityId !== claims.capabilityId\n      )\n      if (foreignActor || (held !== undefined && held.capabilityId !== claims.capabilityId)) {\n        return yield* Effect.fail(heldByAnother(announcement.participantId))\n      }\n      if (held === undefined && branch.size >= maxParticipants) {\n        return yield* Effect.fail(\n          new SyncError({\n            code: \"backpressure\",\n            message: `Branch ${announcement.branchId} already holds ${maxParticipants} participants`\n          })\n        )\n      }\n      const participant = new Participant({\n        branchId: announcement.branchId,\n        participantId: announcement.participantId,\n        displayName: announcement.displayName,\n        cursor: announcement.cursor,\n        ...(announcement.sessionId === undefined ? {} : { sessionId: announcement.sessionId }),\n        ...(announcement.kind === undefined ? {} : { kind: announcement.kind }),\n        ...(announcement.where === undefined ? {} : { where: announcement.where }),\n        ...(announcement.watching === undefined ? {} : { watching: announcement.watching }),\n        ...(announcement.for_member === undefined ? {} : { for_member: announcement.for_member }),\n        ...(announcement.agentKind === undefined ? {} : { agentKind: announcement.agentKind }),\n        ...(announcement.via === undefined ? {} : { via: announcement.via }),\n        ...(announcement.runId === undefined ? {} : { runId: announcement.runId }),\n        leaseExpiresAtMs: nowMs + leaseMs\n      })\n      branch.set(seatKey(announcement), { participant, capabilityId: claims.capabilityId })\n      roster.set(announcement.branchId, branch)\n      yield* PubSub.publish(changes, announcement.branchId)\n      return detach(participant)\n    })\n\n    const leave = Effect.fn(\"BranchPresence.leave\")(function*(supplied: LeaveRequest) {\n      const request = detachLeave(supplied)\n      yield* Effect.annotateCurrentSpan({ branchId: request.branchId, participantId: request.participantId })\n      const claims = yield* share.verify(request.capability, { branchId: request.branchId, access: \"write\" })\n      const branch = expire(request.branchId, yield* Clock.currentTimeMillis)\n      if (branch !== undefined) {\n        const keys = request.sessionId === undefined\n          ? [...branch].filter(([, seat]) => seat.participant.participantId === request.participantId)\n            .map(([key]) => key)\n          : [seatKey(request)]\n        for (const key of keys) {\n          const held = branch.get(key)\n          if (held !== undefined && held.capabilityId !== claims.capabilityId) {\n            return yield* Effect.fail(heldByAnother(request.participantId))\n          }\n        }\n        for (const key of keys) branch.delete(key)\n        if (branch.size === 0) roster.delete(request.branchId)\n      }\n      yield* PubSub.publish(changes, request.branchId)\n    })\n\n    const list = Effect.fn(\"BranchPresence.list\")(function*(supplied: RosterRequest) {\n      const request = detachRoster(supplied)\n      yield* Effect.annotateCurrentSpan({ branchId: request.branchId })\n      yield* share.verify(request.capability, { branchId: request.branchId, access: \"read\" })\n      return live(request.branchId, yield* Clock.currentTimeMillis)\n    })\n\n    const presenceOn = Effect.fn(\"BranchPresence.presenceOn\")(function*(supplied: RosterRequest) {\n      const request = detachRoster(supplied)\n      yield* share.verify(request.capability, { branchId: request.branchId, access: \"read\" })\n      const nowMs = yield* Clock.currentTimeMillis\n      if (nowMs - startedAtMs < leaseMs || !(yield* sourcesReady(request.branchId))) return \"unknown\" as const\n      return live(request.branchId, nowMs).length === 0 ? \"empty\" as const : \"present\" as const\n    })\n\n    return BranchPresence.of({ announce, leave, list, presenceOn, changes: Stream.fromPubSub(changes), leaseMs })\n  })\n\n/**\n * Provides the in-memory, lease-expiring presence registry under the default\n * policy, which is valid by construction and so cannot fail.\n *\n * @category layers\n * @since 0.1.0\n */\nexport const layer: Layer.Layer<BranchPresence, never, BranchShare.BranchShare> = Layer.effect(\n  BranchPresence,\n  makeResolved(defaults)\n)\n\n/**\n * Provides the in-memory, lease-expiring presence registry under an explicit\n * policy. Fails with `invalid_request` when an option is not a positive safe\n * integer, so a bad policy fails the composition rather than an announcement.\n *\n * @category layers\n * @since 1.0.0-rc.0\n */\nexport const layerWith = (\n  options: PresenceOptions\n): Layer.Layer<BranchPresence, SyncError, BranchShare.BranchShare> => Layer.effect(BranchPresence, makeMemory(options))\n"]}

package/dist/esm/BranchProjection.d.ts

@@ -0,0 +1,179 @@
+/**
+ * The branch document projection: journal entries folded into what two people
+ * looking at the same branch must agree on.
+ *
+ * The fold is order-independent over the canonical entry set, which is what
+ * makes convergence a property rather than a hope: any two clients that have
+ * applied the same set of entries hold the same state, regardless of the
+ * order their transports delivered frames in or how many times a frame
+ * arrived.
+ *
+ * Three guards do all the work, and each is a production invariant:
+ *
+ * - entries from another branch's run are ignored, so a mis-routed frame can
+ *   never leak into a projection;
+ * - an entry already folded — the cursor tip redelivered, or a command id
+ *   already applied — is ignored, so an at-least-once transport cannot
+ *   double-apply a user action and a reconnect replays no side effects;
+ * - an entry below the cursor whose command was never applied is folded into
+ *   its canonical `seq` position, so out-of-order delivery converges on the
+ *   same document instead of permanently dropping the late entry.
+ *
+ * @since 0.1.0
+ */
+import * as JournalEvent from "@smthrs/journal/JournalEvent";
+import * as Schema from "effect/Schema";
+import { BranchId } from "./BranchProtocol.ts";
+/**
+ * One collaborative chat message in the branch timeline.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const Message: Schema.Struct<{
+    readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+    readonly commandId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/CommandId">;
+    readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+    /** The verified share capability that submitted the message. */
+    readonly capabilityId: Schema.String;
+    readonly text: Schema.String;
+}>;
+/**
+ * The value form of {@link Message}.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type Message = typeof Message.Type;
+/**
+ * One command applied to the branch document.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const AppliedCommand: Schema.Struct<{
+    readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+    readonly commandId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/CommandId">;
+    readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+    /** The verified share capability that submitted the command. */
+    readonly capabilityId: Schema.String;
+    readonly name: Schema.NonEmptyString;
+    readonly args: Schema.String;
+    readonly target: Schema.String;
+}>;
+/**
+ * The value form of {@link AppliedCommand}.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type AppliedCommand = typeof AppliedCommand.Type;
+/**
+ * The current winning value of one durably edited shared field.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const Field: Schema.Struct<{
+    readonly target: Schema.NonEmptyString;
+    readonly value: Schema.String;
+    readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+    readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+    /** The verified share capability that wrote the winning value. */
+    readonly capabilityId: Schema.String;
+}>;
+/**
+ * The value form of {@link Field}.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type Field = typeof Field.Type;
+/**
+ * The projected state of one branch document.
+ *
+ * `seq` is the highest journal sequence folded in and is exactly the cursor a
+ * client resumes from.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export declare const State: Schema.Struct<{
+    readonly branchId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/BranchId">;
+    readonly seq: Schema.Int;
+    readonly messages: Schema.$Array<Schema.Struct<{
+        readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+        readonly commandId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/CommandId">;
+        readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+        /** The verified share capability that submitted the message. */
+        readonly capabilityId: Schema.String;
+        readonly text: Schema.String;
+    }>>;
+    readonly commands: Schema.$Array<Schema.Struct<{
+        readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+        readonly commandId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/CommandId">;
+        readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+        /** The verified share capability that submitted the command. */
+        readonly capabilityId: Schema.String;
+        readonly name: Schema.NonEmptyString;
+        readonly args: Schema.String;
+        readonly target: Schema.String;
+    }>>;
+    readonly fields: Schema.$Array<Schema.Struct<{
+        readonly target: Schema.NonEmptyString;
+        readonly value: Schema.String;
+        readonly seq: Schema.brand<Schema.Int, "@smthrs/journal/JournalEvent/Seq">;
+        readonly participantId: Schema.brand<Schema.NonEmptyString, "@smthrs/sync/BranchProtocol/ParticipantId">;
+        /** The verified share capability that wrote the winning value. */
+        readonly capabilityId: Schema.String;
+    }>>;
+}>;
+/**
+ * The value form of {@link State}.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export type State = typeof State.Type;
+/**
+ * The empty projection of a branch, whose cursor is "nothing applied".
+ *
+ * @category constructors
+ * @since 0.1.0
+ */
+export declare const empty: (branchId: BranchId) => State;
+/**
+ * The conflict policy for two durable edits of the same field.
+ *
+ * Highest canonical sequence wins. Within a branch the sequence is a total
+ * order assigned by the journal, so this is already decisive; the
+ * lexicographic `participantId` tie-break exists so the policy stays total if
+ * a future deployment ever merges two sequence domains. It is deliberately not
+ * wall-clock based — client clocks disagree, and a merge rule that depends on
+ * them is not deterministic.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export declare const resolveField: (existing: Field | undefined, candidate: Field) => Field;
+/**
+ * Folds one journal entry into a branch projection.
+ *
+ * Redelivery and out-of-order delivery are told apart by identity, not by
+ * position: the cursor tip redelivered and a command id already applied are
+ * no-ops, while a below-cursor entry never applied is folded into canonical
+ * order. Non-command entries only raise the cursor, so re-applying one is
+ * idempotent by construction.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export declare const apply: (state: State, entry: JournalEvent.Entry) => State;
+/**
+ * Folds a whole entry stream into a branch projection.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export declare const project: (branchId: BranchId, entries: Iterable<JournalEvent.Entry>) => State;
+//# sourceMappingURL=BranchProjection.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"BranchProjection.d.ts","sourceRoot":"","sources":["../../src/BranchProjection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,KAAK,YAAY,MAAM,8BAA8B,CAAA;AAG5D,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,EACL,QAAQ,EAOT,MAAM,qBAAqB,CAAA;AAE5B;;;;;GAKG;AACH,eAAO,MAAM,OAAO;;;;IAIlB,gEAAgE;;;EAGhE,CAAA;AACF;;;;;GAKG;AACH,MAAM,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,IAAI,CAAA;AAEzC;;;;;GAKG;AACH,eAAO,MAAM,cAAc;;;;IAIzB,gEAAgE;;;;;EAKhE,CAAA;AACF;;;;;GAKG;AACH,MAAM,MAAM,cAAc,GAAG,OAAO,cAAc,CAAC,IAAI,CAAA;AAEvD;;;;;GAKG;AACH,eAAO,MAAM,KAAK;;;;;IAKhB,kEAAkE;;EAElE,CAAA;AACF;;;;;GAKG;AACH,MAAM,MAAM,KAAK,GAAG,OAAO,KAAK,CAAC,IAAI,CAAA;AAErC;;;;;;;;GAQG;AACH,eAAO,MAAM,KAAK;;;;;;;QAnEhB,gEAAgE;;;;;;;;QAsBhE,gEAAgE;;;;;;;;;;;QAyBhE,kEAAkE;;;EA0BlE,CAAA;AACF;;;;;GAKG;AACH,MAAM,MAAM,KAAK,GAAG,OAAO,KAAK,CAAC,IAAI,CAAA;AAErC;;;;;GAKG;AACH,eAAO,MAAM,KAAK,GAAI,UAAU,QAAQ,KAAG,KAMzC,CAAA;AAEF;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,YAAY,GAAI,UAAU,KAAK,GAAG,SAAS,EAAE,WAAW,KAAK,KAAG,KAI5E,CAAA;AAwCD;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,KAAK,GAAI,OAAO,KAAK,EAAE,OAAO,YAAY,CAAC,KAAK,KAAG,KAuC/D,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,OAAO,GAAI,UAAU,QAAQ,EAAE,SAAS,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,KAAG,KA+CnF,CAAA"}

package/dist/esm/BranchProjection.js

@@ -0,0 +1,269 @@
+/**
+ * The branch document projection: journal entries folded into what two people
+ * looking at the same branch must agree on.
+ *
+ * The fold is order-independent over the canonical entry set, which is what
+ * makes convergence a property rather than a hope: any two clients that have
+ * applied the same set of entries hold the same state, regardless of the
+ * order their transports delivered frames in or how many times a frame
+ * arrived.
+ *
+ * Three guards do all the work, and each is a production invariant:
+ *
+ * - entries from another branch's run are ignored, so a mis-routed frame can
+ *   never leak into a projection;
+ * - an entry already folded — the cursor tip redelivered, or a command id
+ *   already applied — is ignored, so an at-least-once transport cannot
+ *   double-apply a user action and a reconnect replays no side effects;
+ * - an entry below the cursor whose command was never applied is folded into
+ *   its canonical `seq` position, so out-of-order delivery converges on the
+ *   same document instead of permanently dropping the late entry.
+ *
+ * @since 0.1.0
+ */
+import * as JournalEvent from "@smthrs/journal/JournalEvent";
+import * as HashSet from "effect/HashSet";
+import * as Option from "effect/Option";
+import * as Schema from "effect/Schema";
+import { BranchId, branchRunId, CommandEvent, CommandEventPayload, CommandId, ParticipantId, SayCommand } from "./BranchProtocol.js";
+/**
+ * One collaborative chat message in the branch timeline.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const Message = Schema.Struct({
+    seq: JournalEvent.Seq,
+    commandId: CommandId,
+    participantId: ParticipantId,
+    /** The verified share capability that submitted the message. */
+    capabilityId: Schema.String,
+    text: Schema.String
+});
+/**
+ * One command applied to the branch document.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const AppliedCommand = Schema.Struct({
+    seq: JournalEvent.Seq,
+    commandId: CommandId,
+    participantId: ParticipantId,
+    /** The verified share capability that submitted the command. */
+    capabilityId: Schema.String,
+    name: Schema.NonEmptyString,
+    args: Schema.String,
+    target: Schema.String
+});
+/**
+ * The current winning value of one durably edited shared field.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const Field = Schema.Struct({
+    target: Schema.NonEmptyString,
+    value: Schema.String,
+    seq: JournalEvent.Seq,
+    participantId: ParticipantId,
+    /** The verified share capability that wrote the winning value. */
+    capabilityId: Schema.String
+});
+/**
+ * The projected state of one branch document.
+ *
+ * `seq` is the highest journal sequence folded in and is exactly the cursor a
+ * client resumes from.
+ *
+ * @category models
+ * @since 0.1.0
+ */
+export const State = Schema.Struct({
+    branchId: BranchId,
+    seq: Schema.Int.check(Schema.isGreaterThanOrEqualTo(-1)),
+    messages: Schema.Array(Message),
+    commands: Schema.Array(AppliedCommand),
+    fields: Schema.Array(Field)
+});
+/**
+ * The empty projection of a branch, whose cursor is "nothing applied".
+ *
+ * @category constructors
+ * @since 0.1.0
+ */
+export const empty = (branchId) => ({
+    branchId,
+    seq: -1,
+    messages: [],
+    commands: [],
+    fields: []
+});
+/**
+ * The conflict policy for two durable edits of the same field.
+ *
+ * Highest canonical sequence wins. Within a branch the sequence is a total
+ * order assigned by the journal, so this is already decisive; the
+ * lexicographic `participantId` tie-break exists so the policy stays total if
+ * a future deployment ever merges two sequence domains. It is deliberately not
+ * wall-clock based — client clocks disagree, and a merge rule that depends on
+ * them is not deterministic.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export const resolveField = (existing, candidate) => {
+    if (existing === undefined)
+        return candidate;
+    if (candidate.seq !== existing.seq)
+        return candidate.seq > existing.seq ? candidate : existing;
+    return candidate.participantId > existing.participantId ? candidate : existing;
+};
+/**
+ * Inserts one item into a sequence-ordered array at its canonical position.
+ *
+ * Canonical sequences are unique within a run, so an equal-sequence collision
+ * is unrepresentable here: dedup happens before insertion.
+ */
+const insertBySeq = (items, item) => {
+    const last = items[items.length - 1];
+    if (last === undefined || last.seq <= item.seq)
+        return [...items, item];
+    let low = 0;
+    let high = items.length;
+    while (low < high) {
+        const middle = Math.floor((low + high) / 2);
+        if (items[middle].seq <= item.seq)
+            low = middle + 1;
+        else
+            high = middle;
+    }
+    const result = items.slice();
+    result.splice(low, 0, item);
+    return result;
+};
+// Cache by the immutable command array so cursor-only updates share the index.
+// Persistent sets let independent continuations share history without changing
+// an older state's deduplication. Restored states build their index on first use.
+const commandIds = new WeakMap();
+const indexCommands = (commands) => {
+    const cached = commandIds.get(commands);
+    if (cached !== undefined)
+        return cached;
+    const index = HashSet.fromIterable(commands.map((command) => command.commandId));
+    commandIds.set(commands, index);
+    return index;
+};
+const decodeCommand = Schema.decodeUnknownOption(CommandEventPayload);
+/**
+ * Folds one journal entry into a branch projection.
+ *
+ * Redelivery and out-of-order delivery are told apart by identity, not by
+ * position: the cursor tip redelivered and a command id already applied are
+ * no-ops, while a below-cursor entry never applied is folded into canonical
+ * order. Non-command entries only raise the cursor, so re-applying one is
+ * idempotent by construction.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export const apply = (state, entry) => {
+    if (entry.runId !== branchRunId(state.branchId) || entry.seq === state.seq)
+        return state;
+    const advanced = entry.seq < state.seq ? state : { ...state, seq: entry.seq };
+    if (entry.eventType !== CommandEvent)
+        return advanced;
+    const decoded = decodeCommand(entry.payload);
+    if (Option.isNone(decoded))
+        return advanced;
+    const commandSubmission = decoded.value;
+    const ids = indexCommands(state.commands);
+    if (HashSet.has(ids, commandSubmission.commandId))
+        return advanced;
+    const command = { ...commandSubmission, seq: entry.seq };
+    const messages = commandSubmission.name === SayCommand
+        ? insertBySeq(state.messages, {
+            seq: entry.seq,
+            commandId: commandSubmission.commandId,
+            participantId: commandSubmission.participantId,
+            capabilityId: commandSubmission.capabilityId,
+            text: commandSubmission.args
+        })
+        : state.messages;
+    const fields = commandSubmission.target === ""
+        ? state.fields
+        : (() => {
+            const candidate = {
+                target: commandSubmission.target,
+                value: commandSubmission.args,
+                seq: entry.seq,
+                participantId: commandSubmission.participantId,
+                capabilityId: commandSubmission.capabilityId
+            };
+            const winner = resolveField(state.fields.find((field) => field.target === commandSubmission.target), candidate);
+            return [...state.fields.filter((field) => field.target !== commandSubmission.target), winner]
+                .sort((left, right) => left.target < right.target ? -1 : 1);
+        })();
+    const commands = insertBySeq(state.commands, command);
+    commandIds.set(commands, HashSet.add(ids, command.commandId));
+    return { ...advanced, messages, commands, fields };
+};
+/**
+ * Folds a whole entry stream into a branch projection.
+ *
+ * @category combinators
+ * @since 0.1.0
+ */
+export const project = (branchId, entries) => {
+    const runId = branchRunId(branchId);
+    let seq = -1;
+    const ids = new Set();
+    const commands = [];
+    const messages = [];
+    const fields = new Map();
+    for (const entry of entries) {
+        if (entry.runId !== runId || entry.seq === seq)
+            continue;
+        seq = Math.max(seq, entry.seq);
+        if (entry.eventType !== CommandEvent)
+            continue;
+        const decoded = decodeCommand(entry.payload);
+        if (Option.isNone(decoded))
+            continue;
+        const submission = decoded.value;
+        if (ids.has(submission.commandId))
+            continue;
+        ids.add(submission.commandId);
+        commands.push({ ...submission, seq: entry.seq });
+        if (submission.name === SayCommand) {
+            messages.push({
+                seq: entry.seq,
+                commandId: submission.commandId,
+                participantId: submission.participantId,
+                capabilityId: submission.capabilityId,
+                text: submission.args
+            });
+        }
+        if (submission.target !== "") {
+            const candidate = {
+                target: submission.target,
+                value: submission.args,
+                seq: entry.seq,
+                participantId: submission.participantId,
+                capabilityId: submission.capabilityId
+            };
+            fields.set(submission.target, resolveField(fields.get(submission.target), candidate));
+        }
+    }
+    commands.sort((left, right) => left.seq - right.seq);
+    messages.sort((left, right) => left.seq - right.seq);
+    commandIds.set(commands, HashSet.fromIterable(ids));
+    return {
+        branchId,
+        seq,
+        commands,
+        messages,
+        fields: Array.from(fields.values()).sort((left, right) => left.target < right.target ? -1 : 1)
+    };
+};
+//# sourceMappingURL=BranchProjection.js.map

package/dist/esm/BranchProjection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BranchProjection.js","sourceRoot":"","sources":["../../src/BranchProjection.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,KAAK,YAAY,MAAM,8BAA8B,CAAA;AAC5D,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAA;AACzC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAA;AACvC,OAAO,EACL,QAAQ,EACR,WAAW,EACX,YAAY,EACZ,mBAAmB,EACnB,SAAS,EACT,aAAa,EACb,UAAU,EACX,MAAM,qBAAqB,CAAA;AAE5B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;IACnC,GAAG,EAAE,YAAY,CAAC,GAAG;IACrB,SAAS,EAAE,SAAS;IACpB,aAAa,EAAE,aAAa;IAC5B,gEAAgE;IAChE,YAAY,EAAE,MAAM,CAAC,MAAM;IAC3B,IAAI,EAAE,MAAM,CAAC,MAAM;CACpB,CAAC,CAAA;AASF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;IAC1C,GAAG,EAAE,YAAY,CAAC,GAAG;IACrB,SAAS,EAAE,SAAS;IACpB,aAAa,EAAE,aAAa;IAC5B,gEAAgE;IAChE,YAAY,EAAE,MAAM,CAAC,MAAM;IAC3B,IAAI,EAAE,MAAM,CAAC,cAAc;IAC3B,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM;CACtB,CAAC,CAAA;AASF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IACjC,MAAM,EAAE,MAAM,CAAC,cAAc;IAC7B,KAAK,EAAE,MAAM,CAAC,MAAM;IACpB,GAAG,EAAE,YAAY,CAAC,GAAG;IACrB,aAAa,EAAE,aAAa;IAC5B,kEAAkE;IAClE,YAAY,EAAE,MAAM,CAAC,MAAM;CAC5B,CAAC,CAAA;AASF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;IACjC,QAAQ,EAAE,QAAQ;IAClB,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC;IACtC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;CAC5B,CAAC,CAAA;AASF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,QAAkB,EAAS,EAAE,CAAC,CAAC;IACnD,QAAQ;IACR,GAAG,EAAE,CAAC,CAAC;IACP,QAAQ,EAAE,EAAE;IACZ,QAAQ,EAAE,EAAE;IACZ,MAAM,EAAE,EAAE;CACX,CAAC,CAAA;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,QAA2B,EAAE,SAAgB,EAAS,EAAE;IACnF,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,SAAS,CAAA;IAC5C,IAAI,SAAS,CAAC,GAAG,KAAK,QAAQ,CAAC,GAAG;QAAE,OAAO,SAAS,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAA;IAC9F,OAAO,SAAS,CAAC,aAAa,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAA;AAChF,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,WAAW,GAAG,CAClB,KAA0B,EAC1B,IAAU,EACG,EAAE;IACf,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACpC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG;QAAE,OAAO,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAA;IACvE,IAAI,GAAG,GAAG,CAAC,CAAA;IACX,IAAI,IAAI,GAAG,KAAK,CAAC,MAAM,CAAA;IACvB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3C,IAAI,KAAK,CAAC,MAAM,CAAE,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG;YAAE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAA;;YAC/C,IAAI,GAAG,MAAM,CAAA;IACpB,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAA;IAC5B,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;IAC3B,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED,+EAA+E;AAC/E,+EAA+E;AAC/E,kFAAkF;AAClF,MAAM,UAAU,GAAG,IAAI,OAAO,EAA6D,CAAA;AAC3F,MAAM,aAAa,GAAG,CAAC,QAAuC,EAA8B,EAAE;IAC5F,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IACvC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAA;IACvC,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAA;IAChF,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;IAC/B,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,MAAM,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAA;AAErE;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,KAAY,EAAE,KAAyB,EAAS,EAAE;IACtE,IAAI,KAAK,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG;QAAE,OAAO,KAAK,CAAA;IACxF,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;IAC7E,IAAI,KAAK,CAAC,SAAS,KAAK,YAAY;QAAE,OAAO,QAAQ,CAAA;IACrD,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;IAC5C,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;QAAE,OAAO,QAAQ,CAAA;IAC3C,MAAM,iBAAiB,GAAG,OAAO,CAAC,KAAK,CAAA;IACvC,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;IACzC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,iBAAiB,CAAC,SAAS,CAAC;QAAE,OAAO,QAAQ,CAAA;IAClE,MAAM,OAAO,GAAmB,EAAE,GAAG,iBAAiB,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAA;IACxE,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,KAAK,UAAU;QACpD,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE;YAC5B,GAAG,EAAE,KAAK,CAAC,GAAG;YACd,SAAS,EAAE,iBAAiB,CAAC,SAAS;YACtC,aAAa,EAAE,iBAAiB,CAAC,aAAa;YAC9C,YAAY,EAAE,iBAAiB,CAAC,YAAY;YAC5C,IAAI,EAAE,iBAAiB,CAAC,IAAI;SAC7B,CAAC;QACF,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAA;IAClB,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,KAAK,EAAE;QAC5C,CAAC,CAAC,KAAK,CAAC,MAAM;QACd,CAAC,CAAC,CAAC,GAAG,EAAE;YACN,MAAM,SAAS,GAAU;gBACvB,MAAM,EAAE,iBAAiB,CAAC,MAAM;gBAChC,KAAK,EAAE,iBAAiB,CAAC,IAAI;gBAC7B,GAAG,EAAE,KAAK,CAAC,GAAG;gBACd,aAAa,EAAE,iBAAiB,CAAC,aAAa;gBAC9C,YAAY,EAAE,iBAAiB,CAAC,YAAY;aAC7C,CAAA;YACD,MAAM,MAAM,GAAG,YAAY,CACzB,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,iBAAiB,CAAC,MAAM,CAAC,EACvE,SAAS,CACV,CAAA;YACD,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,iBAAiB,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;iBAC1F,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC/D,CAAC,CAAC,EAAE,CAAA;IACN,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;IACrD,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAA;IAC7D,OAAO,EAAE,GAAG,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAA;AACpD,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,QAAkB,EAAE,OAAqC,EAAS,EAAE;IAC1F,MAAM,KAAK,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAA;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAA;IACZ,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAA;IAChC,MAAM,QAAQ,GAA0B,EAAE,CAAA;IAC1C,MAAM,QAAQ,GAAmB,EAAE,CAAA;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiB,CAAA;IACvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,GAAG,KAAK,GAAG;YAAE,SAAQ;QACxD,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAA;QAC9B,IAAI,KAAK,CAAC,SAAS,KAAK,YAAY;YAAE,SAAQ;QAC9C,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAA;QAC5C,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;YAAE,SAAQ;QACpC,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,CAAA;QAChC,IAAI,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC;YAAE,SAAQ;QAC3C,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,CAAA;QAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,UAAU,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAA;QAChD,IAAI,UAAU,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACnC,QAAQ,CAAC,IAAI,CAAC;gBACZ,GAAG,EAAE,KAAK,CAAC,GAAG;gBACd,SAAS,EAAE,UAAU,CAAC,SAAS;gBAC/B,aAAa,EAAE,UAAU,CAAC,aAAa;gBACvC,YAAY,EAAE,UAAU,CAAC,YAAY;gBACrC,IAAI,EAAE,UAAU,CAAC,IAAI;aACtB,CAAC,CAAA;QACJ,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,KAAK,EAAE,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAU;gBACvB,MAAM,EAAE,UAAU,CAAC,MAAM;gBACzB,KAAK,EAAE,UAAU,CAAC,IAAI;gBACtB,GAAG,EAAE,KAAK,CAAC,GAAG;gBACd,aAAa,EAAE,UAAU,CAAC,aAAa;gBACvC,YAAY,EAAE,UAAU,CAAC,YAAY;aACtC,CAAA;YACD,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,EAAE,YAAY,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC,CAAA;QACvF,CAAC;IACH,CAAC;IACD,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IACpD,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IACpD,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAA;IACnD,OAAO;QACL,QAAQ;QACR,GAAG;QACH,QAAQ;QACR,QAAQ;QACR,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAC/F,CAAA;AACH,CAAC,CAAA","sourcesContent":["/**\n * The branch document projection: journal entries folded into what two people\n * looking at the same branch must agree on.\n *\n * The fold is order-independent over the canonical entry set, which is what\n * makes convergence a property rather than a hope: any two clients that have\n * applied the same set of entries hold the same state, regardless of the\n * order their transports delivered frames in or how many times a frame\n * arrived.\n *\n * Three guards do all the work, and each is a production invariant:\n *\n * - entries from another branch's run are ignored, so a mis-routed frame can\n *   never leak into a projection;\n * - an entry already folded — the cursor tip redelivered, or a command id\n *   already applied — is ignored, so an at-least-once transport cannot\n *   double-apply a user action and a reconnect replays no side effects;\n * - an entry below the cursor whose command was never applied is folded into\n *   its canonical `seq` position, so out-of-order delivery converges on the\n *   same document instead of permanently dropping the late entry.\n *\n * @since 0.1.0\n */\n\nimport * as JournalEvent from \"@smthrs/journal/JournalEvent\"\nimport * as HashSet from \"effect/HashSet\"\nimport * as Option from \"effect/Option\"\nimport * as Schema from \"effect/Schema\"\nimport {\n  BranchId,\n  branchRunId,\n  CommandEvent,\n  CommandEventPayload,\n  CommandId,\n  ParticipantId,\n  SayCommand\n} from \"./BranchProtocol.ts\"\n\n/**\n * One collaborative chat message in the branch timeline.\n *\n * @category models\n * @since 0.1.0\n */\nexport const Message = Schema.Struct({\n  seq: JournalEvent.Seq,\n  commandId: CommandId,\n  participantId: ParticipantId,\n  /** The verified share capability that submitted the message. */\n  capabilityId: Schema.String,\n  text: Schema.String\n})\n/**\n * The value form of {@link Message}.\n *\n * @category models\n * @since 0.1.0\n */\nexport type Message = typeof Message.Type\n\n/**\n * One command applied to the branch document.\n *\n * @category models\n * @since 0.1.0\n */\nexport const AppliedCommand = Schema.Struct({\n  seq: JournalEvent.Seq,\n  commandId: CommandId,\n  participantId: ParticipantId,\n  /** The verified share capability that submitted the command. */\n  capabilityId: Schema.String,\n  name: Schema.NonEmptyString,\n  args: Schema.String,\n  target: Schema.String\n})\n/**\n * The value form of {@link AppliedCommand}.\n *\n * @category models\n * @since 0.1.0\n */\nexport type AppliedCommand = typeof AppliedCommand.Type\n\n/**\n * The current winning value of one durably edited shared field.\n *\n * @category models\n * @since 0.1.0\n */\nexport const Field = Schema.Struct({\n  target: Schema.NonEmptyString,\n  value: Schema.String,\n  seq: JournalEvent.Seq,\n  participantId: ParticipantId,\n  /** The verified share capability that wrote the winning value. */\n  capabilityId: Schema.String\n})\n/**\n * The value form of {@link Field}.\n *\n * @category models\n * @since 0.1.0\n */\nexport type Field = typeof Field.Type\n\n/**\n * The projected state of one branch document.\n *\n * `seq` is the highest journal sequence folded in and is exactly the cursor a\n * client resumes from.\n *\n * @category models\n * @since 0.1.0\n */\nexport const State = Schema.Struct({\n  branchId: BranchId,\n  seq: Schema.Int.check(Schema.isGreaterThanOrEqualTo(-1)),\n  messages: Schema.Array(Message),\n  commands: Schema.Array(AppliedCommand),\n  fields: Schema.Array(Field)\n})\n/**\n * The value form of {@link State}.\n *\n * @category models\n * @since 0.1.0\n */\nexport type State = typeof State.Type\n\n/**\n * The empty projection of a branch, whose cursor is \"nothing applied\".\n *\n * @category constructors\n * @since 0.1.0\n */\nexport const empty = (branchId: BranchId): State => ({\n  branchId,\n  seq: -1,\n  messages: [],\n  commands: [],\n  fields: []\n})\n\n/**\n * The conflict policy for two durable edits of the same field.\n *\n * Highest canonical sequence wins. Within a branch the sequence is a total\n * order assigned by the journal, so this is already decisive; the\n * lexicographic `participantId` tie-break exists so the policy stays total if\n * a future deployment ever merges two sequence domains. It is deliberately not\n * wall-clock based — client clocks disagree, and a merge rule that depends on\n * them is not deterministic.\n *\n * @category combinators\n * @since 0.1.0\n */\nexport const resolveField = (existing: Field | undefined, candidate: Field): Field => {\n  if (existing === undefined) return candidate\n  if (candidate.seq !== existing.seq) return candidate.seq > existing.seq ? candidate : existing\n  return candidate.participantId > existing.participantId ? candidate : existing\n}\n\n/**\n * Inserts one item into a sequence-ordered array at its canonical position.\n *\n * Canonical sequences are unique within a run, so an equal-sequence collision\n * is unrepresentable here: dedup happens before insertion.\n */\nconst insertBySeq = <Item extends { readonly seq: JournalEvent.Seq }>(\n  items: ReadonlyArray<Item>,\n  item: Item\n): Array<Item> => {\n  const last = items[items.length - 1]\n  if (last === undefined || last.seq <= item.seq) return [...items, item]\n  let low = 0\n  let high = items.length\n  while (low < high) {\n    const middle = Math.floor((low + high) / 2)\n    if (items[middle]!.seq <= item.seq) low = middle + 1\n    else high = middle\n  }\n  const result = items.slice()\n  result.splice(low, 0, item)\n  return result\n}\n\n// Cache by the immutable command array so cursor-only updates share the index.\n// Persistent sets let independent continuations share history without changing\n// an older state's deduplication. Restored states build their index on first use.\nconst commandIds = new WeakMap<ReadonlyArray<AppliedCommand>, HashSet.HashSet<CommandId>>()\nconst indexCommands = (commands: ReadonlyArray<AppliedCommand>): HashSet.HashSet<CommandId> => {\n  const cached = commandIds.get(commands)\n  if (cached !== undefined) return cached\n  const index = HashSet.fromIterable(commands.map((command) => command.commandId))\n  commandIds.set(commands, index)\n  return index\n}\n\nconst decodeCommand = Schema.decodeUnknownOption(CommandEventPayload)\n\n/**\n * Folds one journal entry into a branch projection.\n *\n * Redelivery and out-of-order delivery are told apart by identity, not by\n * position: the cursor tip redelivered and a command id already applied are\n * no-ops, while a below-cursor entry never applied is folded into canonical\n * order. Non-command entries only raise the cursor, so re-applying one is\n * idempotent by construction.\n *\n * @category combinators\n * @since 0.1.0\n */\nexport const apply = (state: State, entry: JournalEvent.Entry): State => {\n  if (entry.runId !== branchRunId(state.branchId) || entry.seq === state.seq) return state\n  const advanced = entry.seq < state.seq ? state : { ...state, seq: entry.seq }\n  if (entry.eventType !== CommandEvent) return advanced\n  const decoded = decodeCommand(entry.payload)\n  if (Option.isNone(decoded)) return advanced\n  const commandSubmission = decoded.value\n  const ids = indexCommands(state.commands)\n  if (HashSet.has(ids, commandSubmission.commandId)) return advanced\n  const command: AppliedCommand = { ...commandSubmission, seq: entry.seq }\n  const messages = commandSubmission.name === SayCommand\n    ? insertBySeq(state.messages, {\n      seq: entry.seq,\n      commandId: commandSubmission.commandId,\n      participantId: commandSubmission.participantId,\n      capabilityId: commandSubmission.capabilityId,\n      text: commandSubmission.args\n    })\n    : state.messages\n  const fields = commandSubmission.target === \"\"\n    ? state.fields\n    : (() => {\n      const candidate: Field = {\n        target: commandSubmission.target,\n        value: commandSubmission.args,\n        seq: entry.seq,\n        participantId: commandSubmission.participantId,\n        capabilityId: commandSubmission.capabilityId\n      }\n      const winner = resolveField(\n        state.fields.find((field) => field.target === commandSubmission.target),\n        candidate\n      )\n      return [...state.fields.filter((field) => field.target !== commandSubmission.target), winner]\n        .sort((left, right) => left.target < right.target ? -1 : 1)\n    })()\n  const commands = insertBySeq(state.commands, command)\n  commandIds.set(commands, HashSet.add(ids, command.commandId))\n  return { ...advanced, messages, commands, fields }\n}\n\n/**\n * Folds a whole entry stream into a branch projection.\n *\n * @category combinators\n * @since 0.1.0\n */\nexport const project = (branchId: BranchId, entries: Iterable<JournalEvent.Entry>): State => {\n  const runId = branchRunId(branchId)\n  let seq = -1\n  const ids = new Set<CommandId>()\n  const commands: Array<AppliedCommand> = []\n  const messages: Array<Message> = []\n  const fields = new Map<string, Field>()\n  for (const entry of entries) {\n    if (entry.runId !== runId || entry.seq === seq) continue\n    seq = Math.max(seq, entry.seq)\n    if (entry.eventType !== CommandEvent) continue\n    const decoded = decodeCommand(entry.payload)\n    if (Option.isNone(decoded)) continue\n    const submission = decoded.value\n    if (ids.has(submission.commandId)) continue\n    ids.add(submission.commandId)\n    commands.push({ ...submission, seq: entry.seq })\n    if (submission.name === SayCommand) {\n      messages.push({\n        seq: entry.seq,\n        commandId: submission.commandId,\n        participantId: submission.participantId,\n        capabilityId: submission.capabilityId,\n        text: submission.args\n      })\n    }\n    if (submission.target !== \"\") {\n      const candidate: Field = {\n        target: submission.target,\n        value: submission.args,\n        seq: entry.seq,\n        participantId: submission.participantId,\n        capabilityId: submission.capabilityId\n      }\n      fields.set(submission.target, resolveField(fields.get(submission.target), candidate))\n    }\n  }\n  commands.sort((left, right) => left.seq - right.seq)\n  messages.sort((left, right) => left.seq - right.seq)\n  commandIds.set(commands, HashSet.fromIterable(ids))\n  return {\n    branchId,\n    seq,\n    commands,\n    messages,\n    fields: Array.from(fields.values()).sort((left, right) => left.target < right.target ? -1 : 1)\n  }\n}\n"]}