@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/dist/feature-libraries/sequence-field/rebase.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rebase.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/rebase.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAqE;AAErE,qCAA0E;AAQ1E,sDAM2B;AAC3B,mCAqBiB;AACjB,mCAeiB;AACjB,uDAAoD;AACpD,uDAQ2B;AAC3B,2CAAwC;AAGxC;;;;;;;;;;;;;;GAcG;AACH,SAAgB,MAAM,CACrB,MAA8B,EAC9B,IAA0C,EAC1C,WAA2C,EAC3C,KAAkB,EAClB,OAA0B,EAC1B,gBAAwC,EACxC,qBAAyC,mCAAkB,CAAC,KAAK;IAEjE,OAAO,cAAc,CACpB,MAAM,EACN,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,QAAQ,EACb,gBAAgB,EAChB,WAAW,EACX,KAAK,EACL,OAAuC,EACvC,kBAAkB,CAClB,CAAC;AACH,CAAC;AAnBD,wBAmBC;AAQD,SAAS,cAAc,CACtB,YAAmC,EACnC,YAAmC,EACnC,YAAqC,EACrC,QAAgC,EAChC,WAA2C,EAC3C,KAAkB,EAClB,WAAuD,EACvD,kBAAsC;IAEtC,MAAM,YAAY,GAAwB,EAAE,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,WAAW,CAC5B,YAAY,EACZ,YAAY,EACZ,YAAY,EACZ,QAAQ,EACR,KAAK,EACL,WAAW,CACX,CAAC;IAEF,wIAAwI;IACxI,gFAAgF;IAChF,uFAAuF;IACvF,MAAM,iBAAiB,GAAkB,EAAE,CAAC;IAE5C,oIAAoI;IACpI,MAAM,YAAY,GAAG,IAAI,GAAG,EAA0B,CAAC;IACvD,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE;QACxB,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACpD,MAAM,WAAW,GAAG,UAAU,CAC7B,QAAQ,EACR,QAAQ,EACR,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,WAAW,EACX,kBAAkB,CAClB,CAAC;QAEF,IAAI,IAAA,wBAAgB,EAAC,QAAQ,CAAC,IAAI,IAAA,6BAAqB,EAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,CAAC,EAAE;YAC1F,gGAAgG;YAChG,kGAAkG;YAClG,MAAM,QAAQ,GAAG,IAAA,uBAAe,EAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YACpE,IAAA,mBAAM,EACL,QAAQ,KAAK,SAAS,EACtB,KAAK,CAAC,sDAAsD,CAC5D,CAAC;YACF,IAAA,mBAAM,EAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;YACtF,MAAM,WAAW,GAAG,IAAA,yBAAkB,EAAC,YAAY,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACxE,UAAU,CAAC,WAAW,EAAE;gBACvB,EAAE,EAAE,QAAQ,CAAC,OAAO;gBACpB,KAAK,EAAE,QAAQ,CAAC,KAAK;aACrB,CAAC,CAAC;YAEH,sBAAsB,CACrB,iBAAiB,EACjB,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,OAAO,EAChB,QAAQ,CAAC,KAAK,EACd,QAAQ,CACR,CAAC;YAEF,IAAA,mBAAM,EACL,IAAA,0BAAkB,EAAC,WAAW,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,EAC5E,KAAK,CAAC,iFAAiF,CACvF,CAAC;YAEF,iFAAiF;YACjF,yGAAyG;YACzG,0GAA0G;YAC1G,0GAA0G;YAC1G,8EAA8E;YAC9E,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;gBAC1B,YAAY;gBACZ,gGAAgG;gBAChG,kGAAkG;gBAClG,iGAAiG;gBACjG,+CAA+C;gBAC/C,oGAAoG;gBACpG,+FAA+F;gBAC/F,+CAA+C;gBAC/C,oBAAoB,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;aAC/C;SACD;QAED,IAAI,IAAA,0BAAkB,EAAC,WAAW,CAAC,EAAE;YACpC,aAAa,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SAC1D;QACD,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC/B,kBAAkB,CACjB,iBAAiB,EACjB,YAAY,EACZ,QAAQ,EACR,YAAY,EACZ,WAAW,EACX,QAAQ,CACR,CAAC;KACF;IAED,OAAO,aAAa,CAAC,YAAY,CAAC,CAAC;AACpC,CAAC;AAED,SAAS,aAAa,CAAI,KAAgB;IACzC,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAK,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACzB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;KACnB;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED,SAAS,UAAU,CAAC,MAAkB;IACrC,QAAQ,MAAM,CAAC,IAAI,EAAE;QACpB,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS;YACb,OAAO,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC;QACxC,KAAK,iBAAiB;YACrB,OAAO,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC;YACC,OAAO,KAAK,CAAC;KACd;AACF,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAC9B,IAAa,EACb,QAA8B,EAC9B,QAAgC;IAEhC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;IAC1B,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxD,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC7E,CAAC;AAED,MAAM,WAAW;IAIhB,YACC,YAAqC,EACrC,SAAuB,EACvB,QAAsB,EACL,QAAgC,EACjD,KAAkB,EACD,WAA+B;QAF/B,aAAQ,GAAR,QAAQ,CAAwB;QAEhC,gBAAW,GAAX,WAAW,CAAoB;QAEhD,IAAI,CAAC,SAAS,GAAG,IAAI,qBAAS,CAAC,SAAS,EAAE,YAAY,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACnF,IAAI,CAAC,QAAQ,GAAG,IAAI,qBAAS,CAAC,QAAQ,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC/E,CAAC;IAEM,OAAO;QACb,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;IAC5D,CAAC;IAEM,GAAG;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACrC,IAAA,mBAAM,EACL,CAAC,CAAC,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,CAAC,EAClD,KAAK,CAAC,iCAAiC,CACvC,CAAC;QAEF,IAAI,QAAQ,KAAK,SAAS,EAAE;YAC3B,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;YAChD,OAAO;gBACN,QAAQ,EAAE,sBAAsB,CAAC,eAAe,EAAE,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC;gBAC3E,OAAO,EAAE,eAAe;aACxB,CAAC;SACF;aAAM,IAAI,OAAO,KAAK,SAAS,EAAE;YACjC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC1B;aAAM,IAAI,IAAA,0BAAkB,EAAC,QAAQ,CAAC,IAAI,IAAA,0BAAkB,EAAC,OAAO,CAAC,EAAE;YACvE,MAAM,GAAG,GAAG,oBAAoB,CAC/B,IAAI,CAAC,SAAS,CAAC,QAAQ,EACvB,QAAQ,EACR,OAAO,EACP,IAAI,CAAC,QAAQ,CACb,CAAC;YACF,IAAI,GAAG,GAAG,CAAC,EAAE;gBACZ,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;aAC9B;iBAAM,IAAI,GAAG,GAAG,CAAC,EAAE;gBACnB,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;gBACvD,OAAO;oBACN,OAAO,EAAE,eAAe;oBACxB,QAAQ,EAAE,sBAAsB,CAAC,eAAe,EAAE,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC;iBAC3E,CAAC;aACF;iBAAM;gBACN,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;aAC1B;SACD;aAAM,IAAI,IAAA,0BAAkB,EAAC,OAAO,CAAC,EAAE;YACvC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;SACzB;aAAM,IAAI,IAAA,0BAAkB,EAAC,QAAQ,CAAC,EAAE;YACxC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC1B;aAAM;YACN,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC1B;IACF,CAAC;IAEO,WAAW,CAAC,MAAe;QAClC,MAAM,QAAQ,GACb,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QAEtF,MAAM,SAAS,GAAG,wBAAwB,CACzC,IAAI,CAAC,WAAW,EAChB,QAAQ,EACR,IAAI,CAAC,SAAS,CAAC,QAAQ,CACvB,CAAC;QACF,MAAM,OAAO,GACZ,SAAS,KAAK,SAAS;YACtB,CAAC,CAAC,UAAU,CACV,SAAS,EACT,IAAA,sBAAc,EAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,SAAS,CAAC,CAC3D;YACH,CAAC,CAAC,sBAAsB,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAE7E,OAAO;YACN,QAAQ;YACR,OAAO;SACP,CAAC;IACH,CAAC;IAEO,UAAU;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QACxC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,sBAAsB,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;IACzF,CAAC;IAEO,WAAW;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QACrC,IAAA,mBAAM,EACL,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,EAC/C,KAAK,CAAC,+DAA+D,CACrE,CAAC;QACF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,wBAAwB,CACzC,IAAI,CAAC,WAAW,EAChB,aAAa,EACb,IAAI,CAAC,SAAS,CAAC,QAAQ,CACvB,CAAC;QACF,OAAO;YACN,QAAQ,EAAE,aAAa;YACvB,OAAO,EAAE,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,EAAE,SAAS,CAAC;SACpF,CAAC;IACH,CAAC;CACD;AAED,SAAS,SAAS,CAAI,OAAgB,EAAE,SAAkB;IACzD,IAAI,IAAA,0BAAQ,EAAC,OAAO,CAAC,IAAI,IAAA,2BAAS,EAAC,SAAS,CAAC,EAAE;QAC9C,MAAM,SAAS,GAAY;YAC1B,IAAI,EAAE,QAAQ;YACd,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,EAAE,EAAE,OAAO,CAAC,EAAE;SACd,CAAC;QACF,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,EAAE;YACnC,SAAS,CAAC,MAAM,GAAG,IAAA,mBAAW,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC;SACjD;QACD,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;SACxC;QACD,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS,EAAE;YACpC,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;KACjB;IACD,wGAAwG;IACxG,0EAA0E;IAC1E,IAAA,mBAAM,EAAC,KAAK,EAAE,KAAK,CAAC,mDAAmD,CAAC,CAAC;AAC1E,CAAC;AAWD,SAAS,UAAU,CAClB,QAA2B,EAC3B,QAA2B,EAC3B,YAAqC,EACrC,QAAgC,EAChC,WAA2C,EAC3C,WAAyC,EACzC,kBAAsC;IAEtC,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAA,iBAAS,EAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;IACjF,OAAO,qBAAqB,CAC3B,WAAW,EACX,QAAQ,EACR,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,kBAAkB,CAClB,CAAC;AACH,CAAC;AAED,SAAS,qBAAqB,CAC7B,QAA2B,EAC3B,QAA2B,EAC3B,YAAqC,EACrC,QAAgC,EAChC,WAAyC,EACzC,kBAAsC;IAEtC,IAAI,WAA8B,CAAC;IACnC,IAAI,IAAA,gBAAQ,EAAC,QAAQ,CAAC,EAAE;QACvB,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE;YAClC,0DAA0D;YAC1D,OAAO,QAAQ,CAAC,MAAM,CAAC;SACvB;QACD,IAAA,mBAAM,EACL,CAAC,IAAA,mBAAW,EAAC,QAAQ,CAAC,EACtB,KAAK,CAAC,oEAAoE,CAC1E,CAAC;QACF,MAAM,UAAU,GAAG,IAAA,yBAAiB,EAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QAEvE,IAAI,IAAA,2BAAS,EAAC,QAAQ,CAAC,EAAE;YACxB,IAAA,mBAAM,EAAC,IAAA,4BAAU,EAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,mCAAmC,CAAC,CAAC;YACxE,IAAA,mBAAM,EACL,CAAC,IAAA,mBAAW,EAAC,QAAQ,CAAC,EACtB,KAAK,CAAC,mDAAmD,CACzD,CAAC;YACF,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,sBAAsB,CAAC,QAAQ,CAAC,CAAC;YAC9D,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,KAAK,SAAS,EAAE;gBAC5D,cAAc,CACb,IAAA,sBAAc,EAAC,EAAE,GAAG,OAAO,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,QAAQ,CAAC,OAAO,CAAC,EACvE,WAAW,EACX,IAAA,mBAAW,EAAC,QAAQ,EAAE,YAAY,CAAC,EACnC,QAAQ,CAAC,KAAK,CACd,CAAC;aACF;YACD,WAAW,GAAG,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;SAC5D;aAAM;YACN,WAAW,GAAG,QAAQ,CAAC;SACvB;QACD,WAAW,GAAG,gBAAgB,CAAC,WAAW,EAAE,IAAA,mBAAW,EAAC,UAAU,CAAC,CAAC,CAAC;KACrE;SAAM,IAAI,IAAA,sBAAc,EAAC,QAAQ,CAAC,EAAE;QACpC,WAAW,GAAG,IAAA,+BAAuB,EAAC,QAAQ,CAAC;YAC9C,CAAC,CAAC,IAAA,sBAAc,EAAC,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,QAAQ,CAAC,OAAO,CAAC;YACjF,CAAC,CAAC,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;KACnC;SAAM,IAAI,IAAA,+BAAuB,EAAC,QAAQ,CAAC,EAAE;QAC7C,IAAA,mBAAM,EACL,QAAQ,CAAC,MAAM,KAAK,SAAS,EAC7B,KAAK,CAAC,sDAAsD,CAC5D,CAAC;QACF,MAAM,eAAe,GAAG,qBAAqB,CAC5C,QAAQ,EACR,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,IAAA,mBAAW,EAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EACnF,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,kBAAkB,CAClB,CAAC;QACF,WAAW,GAAG,qBAAqB,CAClC,eAAe,EACf,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,KAAK,EAAE,EAC7C,YAAY,EACZ,QAAQ,EACR,WAAW,EACX,kBAAkB,CAClB,CAAC;KACF;SAAM;QACN,WAAW,GAAG,QAAQ,CAAC;KACvB;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,IAAgB;IAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;IACvB,QAAQ,IAAI,EAAE;QACb,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS;YACb,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC1B,KAAK,iBAAiB;YACrB,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QACvD,KAAK,QAAQ;YACZ,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC1B,KAAK,oBAAY;YAChB,OAAO,EAAE,CAAC;QACX,KAAK,QAAQ,CAAC,CAAC;YACd,MAAM,OAAO,GAAY;gBACxB,IAAI,EAAE,SAAS;gBACf,EAAE,EAAE,IAAI,CAAC,EAAE;aACX,CAAC;YACF,MAAM,OAAO,GAAW;gBACvB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,IAAI,CAAC,EAAE;aACX,CAAC;YACF,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;gBAChC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;aACjC;YACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC;SAC5B;QACD;YACC,IAAA,4BAAe,EAAC,IAAI,CAAC,CAAC;KACvB;AACF,CAAC;AAED,yEAAyE;AACzE,SAAS,cAAc,CACtB,IAAa,EACb,WAA+B,EAC/B,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAgB,EACvC,KAAa;IAEb,MAAM,MAAM,GAAG,IAAA,+BAAa,EAC3B,WAAW,EACX,iCAAgB,CAAC,WAAW,EAC5B,QAAQ,EACR,EAAE,EACF,KAAK,EACL,KAAK,CACL,CAAC;IACF,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,EAAE;QAC1B,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,IAAA,iBAAS,EAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,MAAM,SAAS,GACd,MAAM,CAAC,KAAK,KAAK,SAAS;YACzB,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE;YACvC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QACzB,IAAA,+BAAa,EACZ,WAAW,EACX,iCAAgB,CAAC,WAAW,EAC5B,QAAQ,EACR,EAAE,EACF,MAAM,CAAC,MAAM,EACb,SAAS,CACT,CAAC;QACF,cAAc,CACb,KAAK,EACL,WAAW,EACX,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAA,YAAK,EAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,EAChD,KAAK,GAAG,MAAM,CAAC,MAAM,CACrB,CAAC;KACF;SAAM;QACN,MAAM,SAAS,GACd,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC;QACzF,IAAA,+BAAa,EAAC,WAAW,EAAE,iCAAgB,CAAC,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;KACzF;AACF,CAAC;AAED,SAAS,gBAAgB,CACxB,QAA2B,EAC3B,QAA2B,EAC3B,WAA2C;IAE3C,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC;IACpC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC;IAEpC,IAAI,IAAA,wBAAgB,EAAC,QAAQ,CAAC,IAAI,CAAC,IAAA,4BAAU,EAAC,QAAQ,CAAC,EAAE;QACxD,OAAO,IAAA,sBAAc,EACpB,QAAQ,EACR,WAAW,CAAC,UAAU,EAAE,UAAU,EAAE,mCAAkB,CAAC,IAAI,CAAC,CAC5D,CAAC;KACF;SAAM,IAAI,IAAA,sBAAc,EAAC,QAAQ,CAAC,IAAI,CAAC,IAAA,4BAAU,EAAC,QAAQ,CAAC,EAAE;QAC7D,OAAO,IAAA,sBAAc,EACpB,QAAQ,EACR,WAAW,CAAC,UAAU,EAAE,UAAU,EAAE,mCAAkB,CAAC,KAAK,CAAC,CAC7D,CAAC;KACF;IAED,OAAO,IAAA,sBAAc,EAAC,QAAQ,EAAE,WAAW,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,gBAAgB,CAAI,IAAa,EAAE,MAAoB;IAC/D,IAAA,mBAAM,EAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;IAC5E,OAAO,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,UAAU,CAA8B,IAAW,EAAE,MAA0B;IACvF,MAAM,OAAO,GAAG,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC;IACpC,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,OAAO,OAAO,CAAC,MAAM,CAAC;KACtB;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,SAAS,wBAAwB,CAChC,WAA+B,EAC/B,QAAiB,EACjB,YAAqC;IAErC,IAAI,IAAA,0BAAQ,EAAC,QAAQ,CAAC,EAAE;QACvB,OAAO,YAAY,CAClB,WAAW,EACX,QAAQ,CAAC,QAAQ,IAAI,YAAY,EACjC,QAAQ,CAAC,EAAE,EACX,QAAQ,CAAC,KAAK,CACd,CAAC;KACF;SAAM,IAAI,IAAA,+BAAuB,EAAC,QAAQ,CAAC,IAAI,IAAA,0BAAQ,EAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;QAC1E,OAAO,YAAY,CAClB,WAAW,EACX,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,YAAY,EACxC,QAAQ,CAAC,MAAM,CAAC,EAAE,EAClB,QAAQ,CAAC,KAAK,CACd,CAAC;KACF;SAAM;QACN,OAAO,SAAS,CAAC;KACjB;AACF,CAAC;AAED,wFAAwF;AACxF,gHAAgH;AAChH,wCAAwC;AACxC,yEAAyE;AACzE,SAAS,YAAY,CACpB,WAA+B,EAC/B,QAAiC,EACjC,EAAU,EACV,KAAa;IAEb,MAAM,MAAM,GAAG,IAAA,+BAAa,EAAC,WAAW,EAAE,iCAAgB,CAAC,WAAW,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;IAC7F,IAAA,mBAAM,EAAC,MAAM,CAAC,MAAM,KAAK,KAAK,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;IAElF,IAAI,MAAM,CAAC,KAAK,EAAE,SAAS,KAAK,SAAS,EAAE;QAC1C,MAAM,SAAS,GAAG,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,OAAO,SAAS,CAAC,SAAS,CAAC;QAC3B,IAAA,+BAAa,EACZ,WAAW,EACX,iCAAgB,CAAC,WAAW,EAC5B,QAAQ,EACR,EAAE,EACF,KAAK,EACL,SAAS,EACT,KAAK,CACL,CAAC;QAEF,IAAI,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,KAAK,KAAK,EAAE;YAC3C,OAAO,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC;SAC9B;QACD,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,IAAA,iBAAS,EAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACjE,OAAO,KAAK,CAAC;KACb;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAkBD,SAAS,aAAa,CACrB,MAAc,EACd,YAAyC,EACzC,QAAgC;IAEhC,MAAM,aAAa,GAAG,QAAQ;SAC5B,gBAAgB,EAAE;SAClB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,6BAAY,EAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAA,WAAI,EAAC,6BAA6B,CAAC,CAAC,CAAC;IAE/E,mBAAmB,CAAC,MAAM,EAAE,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;IAEpD,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE;QAC7D,IAAI,oBAAoB,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE;YAC9D,MAAM,SAAS,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,UAAU,IAAI,QAAQ,CAAC;YACxE,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE;gBAChC,eAAe,CAAC,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;aACvE;SACD;KACD;AACF,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgC,EAAE,QAAqB;IAChF,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,OAAO,KAAK,CAAC;KACb;IAED,oFAAoF;IACpF,OAAO,CAAC,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,kBAAkB,CAC1B,UAAyB,EACzB,YAAyC,EACzC,QAAuB,EACvB,YAAqC,EACrC,WAA0B,EAC1B,QAAgC;IAEhC,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACrF,MAAM,mBAAmB,GAAG,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACrF,KAAK,MAAM,QAAQ,IAAI,YAAY,CAAC,IAAI,EAAE,EAAE;QAC3C,MAAM,aAAa,GAAG,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3D,2DAA2D;QAC3D,IACC,aAAa,GAAG,CAAC,QAAQ;YACzB,mBAAmB,IAAI,aAAa;YACpC,aAAa,GAAG,mBAAmB,EAClC;YACD,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SAC9B;KACD;IAED,UAAU,CAAC,IAAI,CAAC;QACf,MAAM,EAAE,WAAW,CAAC,MAAM;QAC1B,0BAA0B,EAAE,mBAAmB;QAC/C,yBAAyB,EAAE,mBAAmB,GAAG,CAAC;KAClD,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,sBAAsB,CAC9B,QAAgC,EAChC,QAAuB,EACvB,YAAqC;IAErC,IAAI,CAAC,IAAA,0BAAkB,EAAC,QAAQ,CAAC,EAAE;QAClC,OAAO,CAAC,QAAQ,CAAC;KACjB;IAED,IAAI,IAAA,sBAAc,EAAC,QAAQ,CAAC,EAAE;QAC7B,IAAA,mBAAM,EAAC,IAAA,gBAAQ,EAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,sCAAsC,CAAC,CAAC;QACzE,OAAO,gBAAgB,CACtB,QAAQ,EACR,QAAQ,CAAC,QAAQ,IAAI,YAAY,IAAI,IAAA,WAAI,EAAC,yBAAyB,CAAC,CACpE,CAAC;KACF;IAED,IAAI,IAAA,+BAAuB,EAAC,QAAQ,CAAC,EAAE;QACtC,OAAO,gBAAgB,CACtB,QAAQ,EACR,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,YAAY,IAAI,IAAA,WAAI,EAAC,yBAAyB,CAAC,CAC3E,CAAC;KACF;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,sBAAsB,CAC9B,QAAgC,EAChC,QAAuB,EACvB,YAAqC;IAErC,IAAI,CAAC,IAAA,2BAAmB,EAAC,QAAQ,CAAC,EAAE;QACnC,OAAO,QAAQ,CAAC;KAChB;IAED,IAAI,IAAA,wBAAgB,EAAC,QAAQ,CAAC,EAAE;QAC/B,IAAA,mBAAM,EAAC,IAAA,gBAAQ,EAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QAC1E,OAAO,gBAAgB,CACtB,QAAQ,EACR,QAAQ,CAAC,QAAQ,IAAI,YAAY,IAAI,IAAA,WAAI,EAAC,yBAAyB,CAAC,CACpE,CAAC;KACF;IAED,IAAI,IAAA,+BAAuB,EAAC,QAAQ,CAAC,EAAE;QACtC,OAAO,gBAAgB,CACtB,QAAQ,EACR,QAAQ,CAAC,MAAM,CAAC,QAAQ,IAAI,YAAY,IAAI,IAAA,WAAI,EAAC,yBAAyB,CAAC,CAC3E,CAAC;KACF;IAED,OAAO,CAAC,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,sBAAsB,CAC9B,UAAyB,EACzB,QAAqB,EACrB,EAAoB,EACpB,KAAa,EACb,QAAgC;IAEhC,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC;IAC7D,MAAM,SAAS,GAAG,UAAU,IAAI,QAAQ,CAAC;IACzC,MAAM,cAAc,GAAG,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IAC7D,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAChD,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,IACC,KAAK,CAAC,0BAA0B,IAAI,cAAc;YAClD,cAAc,IAAI,KAAK,CAAC,yBAAyB,EAChD;YACD,2EAA2E;YAC3E,gDAAgD;YAChD,OAAO;SACP;QAED,sFAAsF;QACtF,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE;YAC/B,SAAS;SACT;QAED,IAAI,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE;YACpE,eAAe,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;SACvD;KACD;AACF,CAAC;AAED,SAAS,eAAe,CACvB,aAAyB,EACzB,QAAqB,EACrB,EAAoB,EACpB,KAAa,EACb,MAAc;IAEd,IAAI,aAAa,CAAC,OAAO,KAAK,SAAS,EAAE;QACxC,aAAa,CAAC,OAAO,GAAG,EAAE,CAAC;KAC3B;IAED,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;QACrC,MAAM,SAAS,GAAG,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC1E,IAAI,SAAS,CAAC,QAAQ,KAAK,QAAQ,IAAK,SAAS,CAAC,EAAa,GAAG,SAAS,CAAC,KAAK,KAAK,EAAE,EAAE;YACzF,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,KAAK,EAAE;gBACzC,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG;oBACzD,GAAG,SAAS;oBACZ,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,KAAK;oBAC9B,MAAM,EAAE,SAAS,CAAC,MAAM,GAAG,MAAM;iBACjC,CAAC;gBACF,OAAO;aACP;iBAAM,IAAI,MAAM,KAAK,CAAC,EAAE;gBACxB,aAAa,CAAC,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG;oBACzD,GAAG,SAAS;oBACZ,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,KAAK;iBAC9B,CAAC;gBACF,OAAO;aACP;SACD;KACD;IAED,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AAC7D,CAAC;AAED,SAAS,mBAAmB,CAAC,aAAyB,EAAE,iBAAmC;IAC1F,IAAI,aAAa,CAAC,OAAO,KAAK,SAAS,EAAE;QACxC,OAAO;KACP;IAED,aAAa,CAAC,OAAO,GAAG,aAAa,CAAC,OAAO,CAAC,MAAM,CACnD,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CACjD,CAAC;IACF,IAAI,aAAa,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;QACvC,OAAO,aAAa,CAAC,OAAO,CAAC;KAC7B;AACF,CAAC;AAED,SAAS,UAAU,CAAC,cAAyB,EAAE,KAAc;IAC5D,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;QAC9B,MAAM,SAAS,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,IAAK,SAAS,CAAC,EAAa,GAAG,SAAS,CAAC,KAAK,KAAK,KAAK,CAAC,EAAE,EAAE;YAC5D,SAAS,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC;YAC/B,OAAO;SACP;KACD;IAED,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAmB,EAAE,aAAwB;IAC1E,IAAA,mBAAM,EACL,IAAI,CAAC,MAAM,KAAK,SAAS,EACzB,KAAK,CAAC,wDAAwD,CAC9D,CAAC;IACF,IAAA,mBAAM,EAAC,IAAI,CAAC,MAAM,CAAC,aAAa,KAAK,SAAS,EAAE,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAChG,IAAI,CAAC,MAAM,CAAC,aAAa,GAAG,aAAa,CAAC;AAC3C,CAAC;AAED,SAAS,oBAAoB,CAC5B,YAAqC,EACrC,cAA2B,EAC3B,QAAgC;IAEhC,IAAI,YAAY,KAAK,SAAS,EAAE;QAC/B,+FAA+F;QAC/F,qGAAqG;QACrG,qEAAqE;QACrE,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACnE,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,cAAc,CAAC,EAAE,UAAU,CAAC;IACnE,MAAM,eAAe,GAAG,UAAU,IAAI,cAAc,CAAC;IACrD,MAAM,mBAAmB,GAAG,gBAAgB,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;IACxE,IAAI,mBAAmB,KAAK,SAAS,EAAE;QACtC,mFAAmF;QACnF,6GAA6G;QAC7G,qDAAqD;QACrD,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,UAAU,GAAG,UAAU,KAAK,SAAS,CAAC;IAC5C,OAAO,UAAU;QAChB,CAAC,CAAC,mBAAmB,GAAG,iBAAiB;QACzC,CAAC,CAAC,mBAAmB,GAAG,iBAAiB,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,oBAAoB,CAC5B,YAAqC,EACrC,QAAqC,EACrC,OAAoC,EACpC,QAAgC;IAEhC,MAAM,MAAM,GAAG,IAAA,sBAAc,EAAC,QAAQ,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC;IAClC,IAAA,mBAAM,EAAC,MAAM,EAAE,QAAQ,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;IACjF,MAAM,KAAK,GAAG,IAAA,sBAAc,EAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC3D,IAAA,mBAAM,EAAC,KAAK,KAAK,SAAS,EAAE,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC;IAChC,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,EAAE;QAC9D,MAAM,GAAG,GAAG,IAAA,oCAA4B,EAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QACvF,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,GAAG,CAAC;SACX;KACD;IAED,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,MAAM,MAAM,GAAG,IAAA,4BAAoB,EAClC,MAAM,CAAC,OAAO,EACd,KAAK,CAAC,QAAQ,EACd,KAAK,CAAC,OAAO,EACb,SAAS,CACT,CAAC;QACF,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;SACvC;QAED,MAAM,SAAS,GAAG,IAAA,4BAAoB,EACrC,KAAK,CAAC,OAAO,EACb,MAAM,CAAC,QAAQ,EACf,MAAM,CAAC,OAAO,EACd,UAAU,CACV,CAAC;QACF,IAAI,SAAS,KAAK,SAAS,EAAE;YAC5B,OAAO,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;SAC7C;KACD;IAED,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,MAAM,GAAG,GAAG,IAAA,uBAAe,EAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,CAAC,EAAE;YACd,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;SACjC;QAED,MAAM,IAAI,GAAG,4BAA4B,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,IAAI,KAAK,CAAC,EAAE;YACf,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;SAClC;KACD;IAED,mHAAmH;IACnH,0DAA0D;IAC1D,qIAAqI;IACrI,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,EAAE;QACjC,2FAA2F;QAC3F,sEAAsE;QACtE,OAAO,QAAQ,CAAC;KAChB;IAED,MAAM,iBAAiB,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC7D,MAAM,gBAAgB,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAE3D,IAAI,gBAAgB,KAAK,SAAS,IAAI,iBAAiB,KAAK,SAAS,EAAE;QACtE,OAAO,gBAAgB,GAAG,iBAAiB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;KACnE;IAED,IAAI,gBAAgB,KAAK,SAAS,EAAE;QACnC,OAAO,QAAQ,CAAC;KAChB;IAED,IAAI,iBAAiB,KAAK,SAAS,EAAE;QACpC,OAAO,CAAC,QAAQ,CAAC;KACjB;IAED,8EAA8E;IAC9E,+GAA+G;IAC/G,OAAO,CAAC,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,4BAA4B,CACpC,QAAoC,EACpC,QAAoC,EACpC,QAAgC;IAEhC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAC;IACrD,KAAK,MAAM,KAAK,IAAI,QAAQ,IAAI,EAAE,EAAE;QACnC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;KACnC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAC;IACrD,KAAK,MAAM,KAAK,IAAI,QAAQ,IAAI,EAAE,EAAE;QACnC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;KACnC;IAED,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,IAAI,EAAE,EAAE;QACtC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC1B,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACzB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;SACzB;KACD;IAED,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE;QACrC,mFAAmF;QACnF,wEAAwE;QACxE,wDAAwD;QACxD,gDAAgD;QAChD,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;YAChE,OAAO,CAAC,CAAC,CAAC;SACV;KACD;IAED,6EAA6E;IAC7E,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE;QACrC,mFAAmF;QACnF,wEAAwE;QACxE,wDAAwD;QACxD,gDAAgD;QAChD,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;YAChE,OAAO,CAAC,CAAC;SACT;KACD;IAED,OAAO,CAAC,CAAC;AACV,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, unreachableCase } from \"@fluidframework/core-utils\";\nimport { StableId } from \"@fluidframework/runtime-definitions\";\nimport { IdAllocator, brand, fail, getOrAddEmptyToMap } from \"../../util\";\nimport {\n\tChangeAtomId,\n\tChangesetLocalId,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\tTaggedChange,\n} from \"../../core\";\nimport {\n\tCrossFieldManager,\n\tCrossFieldTarget,\n\tNodeExistenceState,\n\tRebaseRevisionMetadata,\n\tgetIntention,\n} from \"../modular-schema\";\nimport {\n\tisDetach,\n\tcloneMark,\n\tareInputCellsEmpty,\n\tmarkEmptiesCells,\n\tmarkFillsCells,\n\tgetOffsetInCellRange,\n\tcompareLineages,\n\twithNodeChange,\n\tcloneCellId,\n\tareOutputCellsEmpty,\n\tisNewAttach,\n\tgetInputCellId,\n\tisAttachAndDetachEffect,\n\tgetOutputCellId,\n\tgetEndpoint,\n\tsplitMark,\n\tisAttach,\n\tgetDetachOutputId,\n\tisImpactfulCellRename,\n\tcompareCellsFromSameRevision,\n} from \"./utils\";\nimport {\n\tChangeset,\n\tMark,\n\tMarkList,\n\tNoopMark,\n\tMoveId,\n\tNoopMarkType,\n\tHasLineage,\n\tIdRange,\n\tCellMark,\n\tCellId,\n\tMarkEffect,\n\tMoveOut,\n\tMoveIn,\n\tLineageEvent,\n} from \"./types\";\nimport { MarkListFactory } from \"./markListFactory\";\nimport {\n\tgetMoveEffect,\n\tsetMoveEffect,\n\tisMoveMark,\n\tMoveEffect,\n\tMoveEffectTable,\n\tisMoveOut,\n\tisMoveIn,\n} from \"./moveEffectTable\";\nimport { MarkQueue } from \"./markQueue\";\nimport { EmptyInputCellMark } from \"./helperTypes\";\n\n/**\n * Rebases `change` over `base` assuming they both apply to the same initial state.\n * @param change - The changeset to rebase.\n * @param base - The changeset to rebase over.\n * @returns A changeset that performs the changes in `change` but does so assuming `base` has been applied first.\n *\n * WARNING! This implementation is incomplete:\n * - Some marks that affect existing content are removed instead of marked as conflicted when rebased over the deletion\n * of that content. This prevents us from then reinstating the mark when rebasing over the revive.\n * - Tombs are not added when rebasing an insert over a gap that is immediately left of deleted content.\n * This prevents us from being able to accurately track the position of the insert.\n * - Tiebreak ordering is not respected.\n * - Support for moves is not implemented.\n * - Support for slices is not implemented.\n */\nexport function rebase<TNodeChange>(\n\tchange: Changeset<TNodeChange>,\n\tbase: TaggedChange<Changeset<TNodeChange>>,\n\trebaseChild: NodeChangeRebaser<TNodeChange>,\n\tgenId: IdAllocator,\n\tmanager: CrossFieldManager,\n\trevisionMetadata: RebaseRevisionMetadata,\n\tnodeExistenceState: NodeExistenceState = NodeExistenceState.Alive,\n): Changeset<TNodeChange> {\n\treturn rebaseMarkList(\n\t\tchange,\n\t\tbase.change,\n\t\tbase.revision,\n\t\trevisionMetadata,\n\t\trebaseChild,\n\t\tgenId,\n\t\tmanager as MoveEffectTable<TNodeChange>,\n\t\tnodeExistenceState,\n\t);\n}\n\nexport type NodeChangeRebaser<TNodeChange> = (\n\tchange: TNodeChange | undefined,\n\tbaseChange: TNodeChange | undefined,\n\tstateChange?: NodeExistenceState,\n) => TNodeChange | undefined;\n\nfunction rebaseMarkList<TNodeChange>(\n\tcurrMarkList: MarkList<TNodeChange>,\n\tbaseMarkList: MarkList<TNodeChange>,\n\tbaseRevision: RevisionTag | undefined,\n\tmetadata: RebaseRevisionMetadata,\n\trebaseChild: NodeChangeRebaser<TNodeChange>,\n\tgenId: IdAllocator,\n\tmoveEffects: CrossFieldManager<MoveEffect<TNodeChange>>,\n\tnodeExistenceState: NodeExistenceState,\n): MarkList<TNodeChange> {\n\tconst rebasedMarks: Mark<TNodeChange>[] = [];\n\tconst queue = new RebaseQueue(\n\t\tbaseRevision,\n\t\tbaseMarkList,\n\t\tcurrMarkList,\n\t\tmetadata,\n\t\tgenId,\n\t\tmoveEffects,\n\t);\n\n\t// Each mark with empty input cells in `currMarkList` should have a lineage event added for all adjacent detaches in the base changeset.\n\t// At the time we process an attach we don't know about detaches of later nodes,\n\t// so we record marks which should have their lineage updated if we encounter a detach.\n\tconst rebasedCellBlocks: CellBlockList = [];\n\n\t// For each revision, stores a list of IDs of detaches encountered in the base changeset which are adjacent to the current position.\n\tconst detachBlocks = new Map<RevisionTag, IdRange[]>();\n\twhile (!queue.isEmpty()) {\n\t\tconst { baseMark, newMark: currMark } = queue.pop();\n\t\tconst rebasedMark = rebaseMark(\n\t\t\tcurrMark,\n\t\t\tbaseMark,\n\t\t\tbaseRevision,\n\t\t\tmetadata,\n\t\t\trebaseChild,\n\t\t\tmoveEffects,\n\t\t\tnodeExistenceState,\n\t\t);\n\n\t\tif (markEmptiesCells(baseMark) || isImpactfulCellRename(baseMark, baseRevision, metadata)) {\n\t\t\t// Note that we want the revision in the detach ID to be the actual revision, not the intention.\n\t\t\t// We don't pass a `RevisionMetadataSource` to `getOutputCellId` so that we get the true revision.\n\t\t\tconst detachId = getOutputCellId(baseMark, baseRevision, undefined);\n\t\t\tassert(\n\t\t\t\tdetachId !== undefined,\n\t\t\t\t0x816 /* Mark which empties cells should have a detach ID */,\n\t\t\t);\n\t\t\tassert(detachId.revision !== undefined, 0x74a /* Detach ID should have a revision */);\n\t\t\tconst detachBlock = getOrAddEmptyToMap(detachBlocks, detachId.revision);\n\t\t\taddIdRange(detachBlock, {\n\t\t\t\tid: detachId.localId,\n\t\t\t\tcount: baseMark.count,\n\t\t\t});\n\n\t\t\taddLineageToRecipients(\n\t\t\t\trebasedCellBlocks,\n\t\t\t\tdetachId.revision,\n\t\t\t\tdetachId.localId,\n\t\t\t\tbaseMark.count,\n\t\t\t\tmetadata,\n\t\t\t);\n\n\t\t\tassert(\n\t\t\t\tareInputCellsEmpty(rebasedMark) && rebasedMark.cellId.revision !== undefined,\n\t\t\t\t0x817 /* Mark should have empty input cells after rebasing over a cell-emptying mark */,\n\t\t\t);\n\n\t\t\t// A re-detach sports a cell ID with the adjacent cells from the original detach.\n\t\t\t// Marks that are rebased over such a re-detach will adopt this cell ID as-is and do not need to have the\n\t\t\t// adjacent cells be updated. Moreover, the base changeset may not have all the detaches from the original\n\t\t\t// detach revision, so using such re-detach marks to compile the list of adjacent cells would run the risk\n\t\t\t// of ending up with incomplete adjacent cell information in the rebased mark.\n\t\t\tif (!isRedetach(baseMark)) {\n\t\t\t\t// BUG#6604:\n\t\t\t\t// We track blocks of adjacent cells for rollbacks separately from that of the original revision\n\t\t\t\t// that they are a rollback of, but all rebased marks use the original revision in their `CellId`.\n\t\t\t\t// This means we assign adjacent cells information for the rollback to a `CellId` that advertises\n\t\t\t\t// itself as being about the original revision.\n\t\t\t\t// This could lead to a situation where we try to compare two cells and fail to order them correctly\n\t\t\t\t// because one sports adjacent cells information for the original revision and the other sports\n\t\t\t\t// adjacent cells information for the rollback.\n\t\t\t\tsetMarkAdjacentCells(rebasedMark, detachBlock);\n\t\t\t}\n\t\t}\n\n\t\tif (areInputCellsEmpty(rebasedMark)) {\n\t\t\thandleLineage(rebasedMark.cellId, detachBlocks, metadata);\n\t\t}\n\t\trebasedMarks.push(rebasedMark);\n\t\tupdateLineageState(\n\t\t\trebasedCellBlocks,\n\t\t\tdetachBlocks,\n\t\t\tbaseMark,\n\t\t\tbaseRevision,\n\t\t\trebasedMark,\n\t\t\tmetadata,\n\t\t);\n\t}\n\n\treturn mergeMarkList(rebasedMarks);\n}\n\nfunction mergeMarkList<T>(marks: Mark<T>[]): Mark<T>[] {\n\tconst factory = new MarkListFactory<T>();\n\tfor (const mark of marks) {\n\t\tfactory.push(mark);\n\t}\n\n\treturn factory.list;\n}\n\nfunction isRedetach(effect: MarkEffect): boolean {\n\tswitch (effect.type) {\n\t\tcase \"Delete\":\n\t\tcase \"MoveOut\":\n\t\t\treturn effect.redetachId !== undefined;\n\t\tcase \"AttachAndDetach\":\n\t\t\treturn isRedetach(effect.detach);\n\t\tdefault:\n\t\t\treturn false;\n\t}\n}\n\n/**\n * Generates a NoOp mark that targets the same cells as the input mark.\n * @param mark - The mark the NoOp should target.\n * @param revision - The revision, if available.\n * @returns A NoOp mark that targets the same cells as the input mark.\n */\nfunction generateNoOpWithCellId<T>(\n\tmark: Mark<T>,\n\trevision: StableId | undefined,\n\tmetadata: RevisionMetadataSource,\n): CellMark<NoopMark, T> {\n\tconst length = mark.count;\n\tconst cellId = getInputCellId(mark, revision, metadata);\n\treturn cellId === undefined ? { count: length } : { count: length, cellId };\n}\n\nclass RebaseQueue<T> {\n\tprivate readonly baseMarks: MarkQueue<T>;\n\tprivate readonly newMarks: MarkQueue<T>;\n\n\tpublic constructor(\n\t\tbaseRevision: RevisionTag | undefined,\n\t\tbaseMarks: Changeset<T>,\n\t\tnewMarks: Changeset<T>,\n\t\tprivate readonly metadata: RevisionMetadataSource,\n\t\tgenId: IdAllocator,\n\t\tprivate readonly moveEffects: MoveEffectTable<T>,\n\t) {\n\t\tthis.baseMarks = new MarkQueue(baseMarks, baseRevision, moveEffects, false, genId);\n\t\tthis.newMarks = new MarkQueue(newMarks, undefined, moveEffects, false, genId);\n\t}\n\n\tpublic isEmpty(): boolean {\n\t\treturn this.baseMarks.isEmpty() && this.newMarks.isEmpty();\n\t}\n\n\tpublic pop(): RebaseMarks<T> {\n\t\tconst baseMark = this.baseMarks.peek();\n\t\tconst newMark = this.newMarks.peek();\n\t\tassert(\n\t\t\t!(baseMark === undefined && newMark === undefined),\n\t\t\t0x722 /* Cannot pop from empty queue */,\n\t\t);\n\n\t\tif (baseMark === undefined) {\n\t\t\tconst dequeuedNewMark = this.newMarks.dequeue();\n\t\t\treturn {\n\t\t\t\tbaseMark: generateNoOpWithCellId(dequeuedNewMark, undefined, this.metadata),\n\t\t\t\tnewMark: dequeuedNewMark,\n\t\t\t};\n\t\t} else if (newMark === undefined) {\n\t\t\treturn this.dequeueBase();\n\t\t} else if (areInputCellsEmpty(baseMark) && areInputCellsEmpty(newMark)) {\n\t\t\tconst cmp = compareCellPositions(\n\t\t\t\tthis.baseMarks.revision,\n\t\t\t\tbaseMark,\n\t\t\t\tnewMark,\n\t\t\t\tthis.metadata,\n\t\t\t);\n\t\t\tif (cmp < 0) {\n\t\t\t\treturn this.dequeueBase(-cmp);\n\t\t\t} else if (cmp > 0) {\n\t\t\t\tconst dequeuedNewMark = this.newMarks.dequeueUpTo(cmp);\n\t\t\t\treturn {\n\t\t\t\t\tnewMark: dequeuedNewMark,\n\t\t\t\t\tbaseMark: generateNoOpWithCellId(dequeuedNewMark, undefined, this.metadata),\n\t\t\t\t};\n\t\t\t} else {\n\t\t\t\treturn this.dequeueBoth();\n\t\t\t}\n\t\t} else if (areInputCellsEmpty(newMark)) {\n\t\t\treturn this.dequeueNew();\n\t\t} else if (areInputCellsEmpty(baseMark)) {\n\t\t\treturn this.dequeueBase();\n\t\t} else {\n\t\t\treturn this.dequeueBoth();\n\t\t}\n\t}\n\n\tprivate dequeueBase(length?: number): RebaseMarks<T> {\n\t\tconst baseMark =\n\t\t\tlength !== undefined ? this.baseMarks.dequeueUpTo(length) : this.baseMarks.dequeue();\n\n\t\tconst movedMark = getMovedMarkFromBaseMark(\n\t\t\tthis.moveEffects,\n\t\t\tbaseMark,\n\t\t\tthis.baseMarks.revision,\n\t\t);\n\t\tconst newMark =\n\t\t\tmovedMark !== undefined\n\t\t\t\t? withCellId(\n\t\t\t\t\t\tmovedMark,\n\t\t\t\t\t\tgetInputCellId(baseMark, this.baseMarks.revision, undefined),\n\t\t\t\t  )\n\t\t\t\t: generateNoOpWithCellId(baseMark, this.baseMarks.revision, this.metadata);\n\n\t\treturn {\n\t\t\tbaseMark,\n\t\t\tnewMark,\n\t\t};\n\t}\n\n\tprivate dequeueNew(): RebaseMarks<T> {\n\t\tconst newMark = this.newMarks.dequeue();\n\t\treturn { newMark, baseMark: generateNoOpWithCellId(newMark, undefined, this.metadata) };\n\t}\n\n\tprivate dequeueBoth(): RebaseMarks<T> {\n\t\tconst baseMark = this.baseMarks.peek();\n\t\tconst newMark = this.newMarks.peek();\n\t\tassert(\n\t\t\tbaseMark !== undefined && newMark !== undefined,\n\t\t\t0x69c /* Cannot dequeue both unless both mark queues are non-empty */,\n\t\t);\n\t\tconst length = Math.min(newMark.count, baseMark.count);\n\t\tconst sizedBaseMark = this.baseMarks.dequeueUpTo(length);\n\t\tconst sizedNewMark = this.newMarks.dequeueUpTo(length);\n\t\tconst movedMark = getMovedMarkFromBaseMark(\n\t\t\tthis.moveEffects,\n\t\t\tsizedBaseMark,\n\t\t\tthis.baseMarks.revision,\n\t\t);\n\t\treturn {\n\t\t\tbaseMark: sizedBaseMark,\n\t\t\tnewMark: movedMark === undefined ? sizedNewMark : fuseMarks(sizedNewMark, movedMark),\n\t\t};\n\t}\n}\n\nfunction fuseMarks<T>(newMark: Mark<T>, movedMark: Mark<T>): Mark<T> {\n\tif (isMoveIn(newMark) && isMoveOut(movedMark)) {\n\t\tconst fusedMark: Mark<T> = {\n\t\t\ttype: \"Insert\",\n\t\t\tcount: newMark.count,\n\t\t\tid: newMark.id,\n\t\t};\n\t\tif (movedMark.cellId !== undefined) {\n\t\t\tfusedMark.cellId = cloneCellId(movedMark.cellId);\n\t\t}\n\t\tif (movedMark.revision !== undefined) {\n\t\t\tfusedMark.revision = movedMark.revision;\n\t\t}\n\t\tif (movedMark.changes !== undefined) {\n\t\t\tfusedMark.changes = movedMark.changes;\n\t\t}\n\t\treturn fusedMark;\n\t}\n\t// The only case we expect for two marks from the same changeset to overlap is when one is a move source\n\t// and the other is a move destination bringing the nodes back into place.\n\tassert(false, 0x818 /* Unexpected combination of moved and new marks */);\n}\n\n/**\n * Represents the marks rebasing should process next.\n * If `baseMark` and `newMark` are both defined, then they are `SizedMark`s covering the same range of nodes.\n */\ninterface RebaseMarks<T> {\n\tbaseMark: Mark<T>;\n\tnewMark: Mark<T>;\n}\n\nfunction rebaseMark<TNodeChange>(\n\tcurrMark: Mark<TNodeChange>,\n\tbaseMark: Mark<TNodeChange>,\n\tbaseRevision: RevisionTag | undefined,\n\tmetadata: RevisionMetadataSource,\n\trebaseChild: NodeChangeRebaser<TNodeChange>,\n\tmoveEffects: MoveEffectTable<TNodeChange>,\n\tnodeExistenceState: NodeExistenceState,\n): Mark<TNodeChange> {\n\tconst rebasedMark = rebaseNodeChange(cloneMark(currMark), baseMark, rebaseChild);\n\treturn rebaseMarkIgnoreChild(\n\t\trebasedMark,\n\t\tbaseMark,\n\t\tbaseRevision,\n\t\tmetadata,\n\t\tmoveEffects,\n\t\tnodeExistenceState,\n\t);\n}\n\nfunction rebaseMarkIgnoreChild<TNodeChange>(\n\tcurrMark: Mark<TNodeChange>,\n\tbaseMark: Mark<TNodeChange>,\n\tbaseRevision: RevisionTag | undefined,\n\tmetadata: RevisionMetadataSource,\n\tmoveEffects: MoveEffectTable<TNodeChange>,\n\tnodeExistenceState: NodeExistenceState,\n): Mark<TNodeChange> {\n\tlet rebasedMark: Mark<TNodeChange>;\n\tif (isDetach(baseMark)) {\n\t\tif (baseMark.cellId !== undefined) {\n\t\t\t// Detaches on empty cells have an implicit revive effect.\n\t\t\tdelete currMark.cellId;\n\t\t}\n\t\tassert(\n\t\t\t!isNewAttach(currMark),\n\t\t\t0x69d /* A new attach should not be rebased over its cell being emptied */,\n\t\t);\n\t\tconst baseCellId = getDetachOutputId(baseMark, baseRevision, metadata);\n\n\t\tif (isMoveOut(baseMark)) {\n\t\t\tassert(isMoveMark(baseMark), 0x6f0 /* Only move marks have move IDs */);\n\t\t\tassert(\n\t\t\t\t!isNewAttach(currMark),\n\t\t\t\t0x819 /* New attaches should not be rebased over moves */,\n\t\t\t);\n\t\t\tconst { remains, follows } = separateEffectsForMove(currMark);\n\t\t\tif (follows !== undefined || currMark.changes !== undefined) {\n\t\t\t\tsendMarkToDest(\n\t\t\t\t\twithNodeChange({ ...follows, count: baseMark.count }, currMark.changes),\n\t\t\t\t\tmoveEffects,\n\t\t\t\t\tgetEndpoint(baseMark, baseRevision),\n\t\t\t\t\tbaseMark.count,\n\t\t\t\t);\n\t\t\t}\n\t\t\trebasedMark = { ...(remains ?? {}), count: baseMark.count };\n\t\t} else {\n\t\t\trebasedMark = currMark;\n\t\t}\n\t\trebasedMark = makeDetachedMark(rebasedMark, cloneCellId(baseCellId));\n\t} else if (markFillsCells(baseMark)) {\n\t\trebasedMark = isAttachAndDetachEffect(currMark)\n\t\t\t? withNodeChange({ ...currMark.detach, count: currMark.count }, currMark.changes)\n\t\t\t: withCellId(currMark, undefined);\n\t} else if (isAttachAndDetachEffect(baseMark)) {\n\t\tassert(\n\t\t\tbaseMark.cellId !== undefined,\n\t\t\t0x81a /* AttachAndDetach mark should target an empty cell */,\n\t\t);\n\t\tconst halfRebasedMark = rebaseMarkIgnoreChild(\n\t\t\tcurrMark,\n\t\t\t{ ...baseMark.attach, cellId: cloneCellId(baseMark.cellId), count: baseMark.count },\n\t\t\tbaseRevision,\n\t\t\tmetadata,\n\t\t\tmoveEffects,\n\t\t\tnodeExistenceState,\n\t\t);\n\t\trebasedMark = rebaseMarkIgnoreChild(\n\t\t\thalfRebasedMark,\n\t\t\t{ ...baseMark.detach, count: baseMark.count },\n\t\t\tbaseRevision,\n\t\t\tmetadata,\n\t\t\tmoveEffects,\n\t\t\tnodeExistenceState,\n\t\t);\n\t} else {\n\t\trebasedMark = currMark;\n\t}\n\treturn rebasedMark;\n}\n\n/**\n * @returns A pair of marks that represent the effects which should remain in place in the face of concurrent move,\n * and the effects that should be sent to the move destination.\n */\nfunction separateEffectsForMove(mark: MarkEffect): { remains?: MarkEffect; follows?: MarkEffect } {\n\tconst type = mark.type;\n\tswitch (type) {\n\t\tcase \"Delete\":\n\t\tcase \"MoveOut\":\n\t\t\treturn { follows: mark };\n\t\tcase \"AttachAndDetach\":\n\t\t\treturn { follows: mark.detach, remains: mark.attach };\n\t\tcase \"MoveIn\":\n\t\t\treturn { remains: mark };\n\t\tcase NoopMarkType:\n\t\t\treturn {};\n\t\tcase \"Insert\": {\n\t\t\tconst follows: MoveOut = {\n\t\t\t\ttype: \"MoveOut\",\n\t\t\t\tid: mark.id,\n\t\t\t};\n\t\t\tconst remains: MoveIn = {\n\t\t\t\ttype: \"MoveIn\",\n\t\t\t\tid: mark.id,\n\t\t\t};\n\t\t\tif (mark.revision !== undefined) {\n\t\t\t\tfollows.revision = mark.revision;\n\t\t\t\tremains.revision = mark.revision;\n\t\t\t}\n\t\t\treturn { remains, follows };\n\t\t}\n\t\tdefault:\n\t\t\tunreachableCase(type);\n\t}\n}\n\n// TODO: Reduce the duplication between this and other MoveEffect helpers\nfunction sendMarkToDest<T>(\n\tmark: Mark<T>,\n\tmoveEffects: MoveEffectTable<T>,\n\t{ revision, localId: id }: ChangeAtomId,\n\tcount: number,\n) {\n\tconst effect = getMoveEffect(\n\t\tmoveEffects,\n\t\tCrossFieldTarget.Destination,\n\t\trevision,\n\t\tid,\n\t\tcount,\n\t\tfalse,\n\t);\n\tif (effect.length < count) {\n\t\tconst [mark1, mark2] = splitMark(mark, effect.length);\n\t\tconst newEffect =\n\t\t\teffect.value !== undefined\n\t\t\t\t? { ...effect.value, movedMark: mark1 }\n\t\t\t\t: { movedMark: mark1 };\n\t\tsetMoveEffect(\n\t\t\tmoveEffects,\n\t\t\tCrossFieldTarget.Destination,\n\t\t\trevision,\n\t\t\tid,\n\t\t\teffect.length,\n\t\t\tnewEffect,\n\t\t);\n\t\tsendMarkToDest(\n\t\t\tmark2,\n\t\t\tmoveEffects,\n\t\t\t{ revision, localId: brand(id + effect.length) },\n\t\t\tcount - effect.length,\n\t\t);\n\t} else {\n\t\tconst newEffect =\n\t\t\teffect.value !== undefined ? { ...effect.value, movedMark: mark } : { movedMark: mark };\n\t\tsetMoveEffect(moveEffects, CrossFieldTarget.Destination, revision, id, count, newEffect);\n\t}\n}\n\nfunction rebaseNodeChange<TNodeChange>(\n\tcurrMark: Mark<TNodeChange>,\n\tbaseMark: Mark<TNodeChange>,\n\tnodeRebaser: NodeChangeRebaser<TNodeChange>,\n): Mark<TNodeChange> {\n\tconst baseChange = baseMark.changes;\n\tconst currChange = currMark.changes;\n\n\tif (markEmptiesCells(baseMark) && !isMoveMark(baseMark)) {\n\t\treturn withNodeChange(\n\t\t\tcurrMark,\n\t\t\tnodeRebaser(currChange, baseChange, NodeExistenceState.Dead),\n\t\t);\n\t} else if (markFillsCells(baseMark) && !isMoveMark(baseMark)) {\n\t\treturn withNodeChange(\n\t\t\tcurrMark,\n\t\t\tnodeRebaser(currChange, baseChange, NodeExistenceState.Alive),\n\t\t);\n\t}\n\n\treturn withNodeChange(currMark, nodeRebaser(currChange, baseChange));\n}\n\nfunction makeDetachedMark<T>(mark: Mark<T>, cellId: ChangeAtomId): Mark<T> {\n\tassert(mark.cellId === undefined, 0x69f /* Expected mark to be attached */);\n\treturn { ...mark, cellId };\n}\n\nfunction withCellId<TMark extends Mark<unknown>>(mark: TMark, cellId: CellId | undefined): TMark {\n\tconst newMark = { ...mark, cellId };\n\tif (cellId === undefined) {\n\t\tdelete newMark.cellId;\n\t}\n\treturn newMark;\n}\n\nfunction getMovedMarkFromBaseMark<T>(\n\tmoveEffects: MoveEffectTable<T>,\n\tbaseMark: Mark<T>,\n\tbaseRevision: RevisionTag | undefined,\n): Mark<T> | undefined {\n\tif (isMoveIn(baseMark)) {\n\t\treturn getMovedMark(\n\t\t\tmoveEffects,\n\t\t\tbaseMark.revision ?? baseRevision,\n\t\t\tbaseMark.id,\n\t\t\tbaseMark.count,\n\t\t);\n\t} else if (isAttachAndDetachEffect(baseMark) && isMoveIn(baseMark.attach)) {\n\t\treturn getMovedMark(\n\t\t\tmoveEffects,\n\t\t\tbaseMark.attach.revision ?? baseRevision,\n\t\t\tbaseMark.attach.id,\n\t\t\tbaseMark.count,\n\t\t);\n\t} else {\n\t\treturn undefined;\n\t}\n}\n\n// It is expected that the range from `id` to `id + count - 1` has the same move effect.\n// The call sites to this function are making queries about a mark which has already been split by a `MarkQueue`\n// to match the ranges in `moveEffects`.\n// TODO: Reduce the duplication between this and other MoveEffect helpers\nfunction getMovedMark<T>(\n\tmoveEffects: MoveEffectTable<T>,\n\trevision: RevisionTag | undefined,\n\tid: MoveId,\n\tcount: number,\n): Mark<T> | undefined {\n\tconst effect = getMoveEffect(moveEffects, CrossFieldTarget.Destination, revision, id, count);\n\tassert(effect.length === count, 0x6f3 /* Expected effect to cover entire mark */);\n\n\tif (effect.value?.movedMark !== undefined) {\n\t\tconst newEffect = { ...effect.value };\n\t\tdelete newEffect.movedMark;\n\t\tsetMoveEffect(\n\t\t\tmoveEffects,\n\t\t\tCrossFieldTarget.Destination,\n\t\t\trevision,\n\t\t\tid,\n\t\t\tcount,\n\t\t\tnewEffect,\n\t\t\tfalse,\n\t\t);\n\n\t\tif (effect.value.movedMark.count === count) {\n\t\t\treturn effect.value.movedMark;\n\t\t}\n\t\tconst [mark1, _mark2] = splitMark(effect.value.movedMark, count);\n\t\treturn mark1;\n\t}\n\n\treturn undefined;\n}\n\ntype CellBlockList = CellBlock[];\n\ninterface CellBlock {\n\treadonly cellId: CellId | undefined;\n\n\t// The index of the oldest revision where this cell is full in its output context.\n\t// May be -Infinity if the cell was full in the input context of the base changeset,\n\t// or +Infinity if the cell was empty for all revisions in the base changeset.\n\treadonly firstAttachedRevisionIndex: number;\n\n\t// The index of the newest revision where this cell is full in its output context.\n\t// May be -Infinity if the cell was empty for all revisions in the base changeset,\n\t// or +Infinity if the cell is full in the output context of the base changeset.\n\treadonly lastAttachedRevisionIndex: number;\n}\n\nfunction handleLineage(\n\tcellId: CellId,\n\tdetachBlocks: Map<RevisionTag, IdRange[]>,\n\tmetadata: RebaseRevisionMetadata,\n) {\n\tconst baseRevisions = metadata\n\t\t.getBaseRevisions()\n\t\t.map((r) => getIntention(r, metadata) ?? fail(\"Intention should be defined\"));\n\n\tremoveLineageEvents(cellId, new Set(baseRevisions));\n\n\tfor (const [revision, detachBlock] of detachBlocks.entries()) {\n\t\tif (shouldReceiveLineage(cellId.revision, revision, metadata)) {\n\t\t\tconst intention = metadata.tryGetInfo(revision)?.rollbackOf ?? revision;\n\t\t\tfor (const entry of detachBlock) {\n\t\t\t\taddLineageEntry(cellId, intention, entry.id, entry.count, entry.count);\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction getRevisionIndex(metadata: RevisionMetadataSource, revision: RevisionTag): number {\n\tconst index = metadata.getIndex(revision);\n\tif (index !== undefined) {\n\t\treturn index;\n\t}\n\n\t// This revision is not in the changesets being handled and must be older than them.\n\treturn -Infinity;\n}\n\nfunction updateLineageState(\n\tcellBlocks: CellBlockList,\n\tdetachBlocks: Map<RevisionTag, IdRange[]>,\n\tbaseMark: Mark<unknown>,\n\tbaseRevision: RevisionTag | undefined,\n\trebasedMark: Mark<unknown>,\n\tmetadata: RevisionMetadataSource,\n) {\n\tconst attachRevisionIndex = getAttachRevisionIndex(metadata, baseMark, baseRevision);\n\tconst detachRevisionIndex = getDetachRevisionIndex(metadata, baseMark, baseRevision);\n\tfor (const revision of detachBlocks.keys()) {\n\t\tconst revisionIndex = getRevisionIndex(metadata, revision);\n\t\t// revisionIndex can be -Infinity if it is from a re-detach\n\t\tif (\n\t\t\trevisionIndex > -Infinity &&\n\t\t\tattachRevisionIndex <= revisionIndex &&\n\t\t\trevisionIndex < detachRevisionIndex\n\t\t) {\n\t\t\tdetachBlocks.delete(revision);\n\t\t}\n\t}\n\n\tcellBlocks.push({\n\t\tcellId: rebasedMark.cellId,\n\t\tfirstAttachedRevisionIndex: attachRevisionIndex,\n\t\tlastAttachedRevisionIndex: detachRevisionIndex - 1,\n\t});\n}\n\nfunction getAttachRevisionIndex(\n\tmetadata: RevisionMetadataSource,\n\tbaseMark: Mark<unknown>,\n\tbaseRevision: RevisionTag | undefined,\n): number {\n\tif (!areInputCellsEmpty(baseMark)) {\n\t\treturn -Infinity;\n\t}\n\n\tif (markFillsCells(baseMark)) {\n\t\tassert(isAttach(baseMark), 0x81b /* Only attach marks can fill cells */);\n\t\treturn getRevisionIndex(\n\t\t\tmetadata,\n\t\t\tbaseMark.revision ?? baseRevision ?? fail(\"Mark must have revision\"),\n\t\t);\n\t}\n\n\tif (isAttachAndDetachEffect(baseMark)) {\n\t\treturn getRevisionIndex(\n\t\t\tmetadata,\n\t\t\tbaseMark.attach.revision ?? baseRevision ?? fail(\"Mark must have revision\"),\n\t\t);\n\t}\n\n\treturn Infinity;\n}\n\nfunction getDetachRevisionIndex(\n\tmetadata: RevisionMetadataSource,\n\tbaseMark: Mark<unknown>,\n\tbaseRevision: RevisionTag | undefined,\n): number {\n\tif (!areOutputCellsEmpty(baseMark)) {\n\t\treturn Infinity;\n\t}\n\n\tif (markEmptiesCells(baseMark)) {\n\t\tassert(isDetach(baseMark), 0x81c /* Only detach marks can empty cells */);\n\t\treturn getRevisionIndex(\n\t\t\tmetadata,\n\t\t\tbaseMark.revision ?? baseRevision ?? fail(\"Mark must have revision\"),\n\t\t);\n\t}\n\n\tif (isAttachAndDetachEffect(baseMark)) {\n\t\treturn getRevisionIndex(\n\t\t\tmetadata,\n\t\t\tbaseMark.detach.revision ?? baseRevision ?? fail(\"Mark must have revision\"),\n\t\t);\n\t}\n\n\treturn -Infinity;\n}\n\nfunction addLineageToRecipients(\n\tcellBlocks: CellBlockList,\n\trevision: RevisionTag,\n\tid: ChangesetLocalId,\n\tcount: number,\n\tmetadata: RebaseRevisionMetadata,\n) {\n\tconst rollbackOf = metadata.tryGetInfo(revision)?.rollbackOf;\n\tconst intention = rollbackOf ?? revision;\n\tconst intentionIndex = getRevisionIndex(metadata, intention);\n\tfor (let i = cellBlocks.length - 1; i >= 0; i--) {\n\t\tconst entry = cellBlocks[i];\n\t\tif (\n\t\t\tentry.firstAttachedRevisionIndex <= intentionIndex &&\n\t\t\tintentionIndex <= entry.lastAttachedRevisionIndex\n\t\t) {\n\t\t\t// These cells were full in this revision, so cells earlier in the sequence\n\t\t\t// do not need to know about this lineage event.\n\t\t\treturn;\n\t\t}\n\n\t\t// We only add lineage to cells which were detached before the lineage event occurred.\n\t\tif (entry.cellId === undefined) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (shouldReceiveLineage(entry.cellId.revision, revision, metadata)) {\n\t\t\taddLineageEntry(entry.cellId, intention, id, count, 0);\n\t\t}\n\t}\n}\n\nfunction addLineageEntry(\n\tlineageHolder: HasLineage,\n\trevision: RevisionTag,\n\tid: ChangesetLocalId,\n\tcount: number,\n\toffset: number,\n) {\n\tif (lineageHolder.lineage === undefined) {\n\t\tlineageHolder.lineage = [];\n\t}\n\n\tif (lineageHolder.lineage.length > 0) {\n\t\tconst lastEntry = lineageHolder.lineage[lineageHolder.lineage.length - 1];\n\t\tif (lastEntry.revision === revision && (lastEntry.id as number) + lastEntry.count === id) {\n\t\t\tif (lastEntry.offset === lastEntry.count) {\n\t\t\t\tlineageHolder.lineage[lineageHolder.lineage.length - 1] = {\n\t\t\t\t\t...lastEntry,\n\t\t\t\t\tcount: lastEntry.count + count,\n\t\t\t\t\toffset: lastEntry.offset + offset,\n\t\t\t\t};\n\t\t\t\treturn;\n\t\t\t} else if (offset === 0) {\n\t\t\t\tlineageHolder.lineage[lineageHolder.lineage.length - 1] = {\n\t\t\t\t\t...lastEntry,\n\t\t\t\t\tcount: lastEntry.count + count,\n\t\t\t\t};\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t}\n\n\tlineageHolder.lineage.push({ revision, id, count, offset });\n}\n\nfunction removeLineageEvents(lineageHolder: HasLineage, revisionsToRemove: Set<RevisionTag>) {\n\tif (lineageHolder.lineage === undefined) {\n\t\treturn;\n\t}\n\n\tlineageHolder.lineage = lineageHolder.lineage.filter(\n\t\t(event) => !revisionsToRemove.has(event.revision),\n\t);\n\tif (lineageHolder.lineage.length === 0) {\n\t\tdelete lineageHolder.lineage;\n\t}\n}\n\nfunction addIdRange(lineageEntries: IdRange[], range: IdRange): void {\n\tif (lineageEntries.length > 0) {\n\t\tconst lastEntry = lineageEntries[lineageEntries.length - 1];\n\t\tif ((lastEntry.id as number) + lastEntry.count === range.id) {\n\t\t\tlastEntry.count += range.count;\n\t\t\treturn;\n\t\t}\n\t}\n\n\tlineageEntries.push(range);\n}\n\nfunction setMarkAdjacentCells(mark: Mark<unknown>, adjacentCells: IdRange[]): void {\n\tassert(\n\t\tmark.cellId !== undefined,\n\t\t0x74d /* Can only set adjacent cells on a mark with cell ID */,\n\t);\n\tassert(mark.cellId.adjacentCells === undefined, 0x74e /* Should not overwrite adjacentCells */);\n\tmark.cellId.adjacentCells = adjacentCells;\n}\n\nfunction shouldReceiveLineage(\n\tcellRevision: RevisionTag | undefined,\n\tdetachRevision: RevisionTag,\n\tmetadata: RevisionMetadataSource,\n): boolean {\n\tif (cellRevision === undefined) {\n\t\t// An undefined cell revision means that the cell was created by the changeset we are rebasing.\n\t\t// Since this cell was been empty for all base revisions, it should receive lineage from all of them.\n\t\t// TODO: This cell does not need lineage from roll-forward revisions.\n\t\treturn true;\n\t}\n\n\tconst cellRevisionIndex = getRevisionIndex(metadata, cellRevision);\n\tconst rollbackOf = metadata.tryGetInfo(detachRevision)?.rollbackOf;\n\tconst detachIntention = rollbackOf ?? detachRevision;\n\tconst detachRevisionIndex = getRevisionIndex(metadata, detachIntention);\n\tif (detachRevisionIndex === undefined) {\n\t\t// This case means that these cells are being \"re-detached\" through a `redetachId`.\n\t\t// We could use the revision of the re-detach to determine whether or not this cell needs this lineage entry.\n\t\t// But to be conservative we always add lineage here.\n\t\treturn true;\n\t}\n\n\tconst isRollback = rollbackOf !== undefined;\n\treturn isRollback\n\t\t? detachRevisionIndex < cellRevisionIndex\n\t\t: detachRevisionIndex > cellRevisionIndex;\n}\n\n/**\n * Returns a number N which encodes how the cells of the two marks are aligned.\n * - If N is zero, then the first cell of `baseMark` is the same as the first cell of `newMark`.\n * - If N is positive, then the first N cells of `newMark` (or all its cells if N is greater than its length)\n * are before the first cell of `baseMark`.\n * - If N is negative, then the first N cells of `baseMark` (or all its cells if N is greater than its length)\n * are before the first cell of `newMark`.\n */\nfunction compareCellPositions(\n\tbaseRevision: RevisionTag | undefined,\n\tbaseMark: EmptyInputCellMark<unknown>,\n\tnewMark: EmptyInputCellMark<unknown>,\n\tmetadata: RevisionMetadataSource,\n): number {\n\tconst baseId = getInputCellId(baseMark, baseRevision, metadata);\n\tconst baseLength = baseMark.count;\n\tassert(baseId?.revision !== undefined, 0x6a0 /* baseMark should have cell ID */);\n\tconst newId = getInputCellId(newMark, undefined, metadata);\n\tassert(newId !== undefined, 0x85a /* newMark should have cell ID */);\n\tconst newLength = newMark.count;\n\tif (newId !== undefined && baseId.revision === newId.revision) {\n\t\tconst cmp = compareCellsFromSameRevision(baseId, baseMark.count, newId, newMark.count);\n\t\tif (cmp !== undefined) {\n\t\t\treturn cmp;\n\t\t}\n\t}\n\n\tif (newId !== undefined) {\n\t\tconst offset = getOffsetInCellRange(\n\t\t\tbaseId.lineage,\n\t\t\tnewId.revision,\n\t\t\tnewId.localId,\n\t\t\tnewLength,\n\t\t);\n\t\tif (offset !== undefined) {\n\t\t\treturn offset > 0 ? offset : -Infinity;\n\t\t}\n\n\t\tconst newOffset = getOffsetInCellRange(\n\t\t\tnewId.lineage,\n\t\t\tbaseId.revision,\n\t\t\tbaseId.localId,\n\t\t\tbaseLength,\n\t\t);\n\t\tif (newOffset !== undefined) {\n\t\t\treturn newOffset > 0 ? -newOffset : Infinity;\n\t\t}\n\t}\n\n\tif (newId !== undefined) {\n\t\tconst cmp = compareLineages(baseId, newId);\n\t\tif (cmp !== 0) {\n\t\t\treturn Math.sign(cmp) * Infinity;\n\t\t}\n\n\t\tconst cmp2 = compareMissingLineageEntries(baseId.lineage, newId.lineage, metadata);\n\t\tif (cmp2 !== 0) {\n\t\t\treturn Math.sign(cmp2) * Infinity;\n\t\t}\n\t}\n\n\t// Both cells must never have been filled (in their common history), otherwise they would have some common lineage.\n\t// A new attach targets a cell that has never been filled.\n\t// A mark can also target a cell which was initially filled on another branch, but which has never been filled on the current branch.\n\tif (newId.revision === undefined) {\n\t\t// An undefined revision must mean that the cell was created on the branch we are rebasing.\n\t\t// Since it is newer than the `baseMark`'s cell, it should come first.\n\t\treturn Infinity;\n\t}\n\n\tconst baseRevisionIndex = metadata.getIndex(baseId.revision);\n\tconst newRevisionIndex = metadata.getIndex(newId.revision);\n\n\tif (newRevisionIndex !== undefined && baseRevisionIndex !== undefined) {\n\t\treturn newRevisionIndex > baseRevisionIndex ? Infinity : -Infinity;\n\t}\n\n\tif (newRevisionIndex !== undefined) {\n\t\treturn Infinity;\n\t}\n\n\tif (baseRevisionIndex !== undefined) {\n\t\treturn -Infinity;\n\t}\n\n\t// `newMark` points to cells which were emptied before `baseMark` was created.\n\t// We use `baseMark`'s tiebreak policy as if `newMark`'s cells were created concurrently and before `baseMark`.\n\treturn -Infinity;\n}\n\nfunction compareMissingLineageEntries(\n\tlineage1: LineageEvent[] | undefined,\n\tlineage2: LineageEvent[] | undefined,\n\tmetadata: RevisionMetadataSource,\n): number {\n\tconst events1 = new Map<RevisionTag, LineageEvent>();\n\tfor (const event of lineage1 ?? []) {\n\t\tevents1.set(event.revision, event);\n\t}\n\n\tconst events2 = new Map<RevisionTag, LineageEvent>();\n\tfor (const event of lineage2 ?? []) {\n\t\tevents2.set(event.revision, event);\n\t}\n\n\tfor (const revision of events1.keys()) {\n\t\tif (events2.has(revision)) {\n\t\t\tevents1.delete(revision);\n\t\t\tevents2.delete(revision);\n\t\t}\n\t}\n\n\tfor (const event of events2.values()) {\n\t\t// We've found a cell C that was emptied before the cell1 started tracking lineage.\n\t\t// The cell1 should come before any such cell, so if cell2 comes after C\n\t\t// then we know that cell1 should come before the cell2.\n\t\t// TODO: Account for the cell1's tiebreak policy\n\t\tif (!metadata.hasRollback(event.revision) && event.offset !== 0) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\n\t// cell1Events now contains only revisions which were not in cell2's lineage.\n\tfor (const event of events1.values()) {\n\t\t// We've found a cell C that was emptied before the cell2 started tracking lineage.\n\t\t// The cell2 should come before any such cell, so if cell1 comes after C\n\t\t// then we know that cell2 should come before the cell1.\n\t\t// TODO: Account for the cell2's tiebreak policy\n\t\tif (!metadata.hasRollback(event.revision) && event.offset !== 0) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\treturn 0;\n}\n"]}

package/dist/feature-libraries/sequence-field/relevantRemovedRoots.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { DeltaDetachedNodeId, TaggedChange } from "../../core";
+import { Changeset } from "./types";
+export type RelevantRemovedRootsFromTChild<TChild> = (child: TChild) => Iterable<DeltaDetachedNodeId>;
+export declare function relevantRemovedRoots<TChild>({ change, revision }: TaggedChange<Changeset<TChild>>, relevantRemovedRootsFromChild: RelevantRemovedRootsFromTChild<TChild>): Iterable<DeltaDetachedNodeId>;
+//# sourceMappingURL=relevantRemovedRoots.d.ts.map

package/dist/feature-libraries/sequence-field/relevantRemovedRoots.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relevantRemovedRoots.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/relevantRemovedRoots.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,mBAAmB,EAAE,YAAY,EAAkB,MAAM,YAAY,CAAC;AAE/E,OAAO,EAAE,SAAS,EAAQ,MAAM,SAAS,CAAC;AAG1C,MAAM,MAAM,8BAA8B,CAAC,MAAM,IAAI,CACpD,KAAK,EAAE,MAAM,KACT,QAAQ,CAAC,mBAAmB,CAAC,CAAC;AAEnC,wBAAiB,oBAAoB,CAAC,MAAM,EAC3C,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EACrD,6BAA6B,EAAE,8BAA8B,CAAC,MAAM,CAAC,GACnE,QAAQ,CAAC,mBAAmB,CAAC,CAgB/B"}

package/dist/feature-libraries/sequence-field/relevantRemovedRoots.js

@@ -0,0 +1,50 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.relevantRemovedRoots = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const core_1 = require("../../core");
+const deltaUtils_1 = require("../deltaUtils");
+const utils_1 = require("./utils");
+function* relevantRemovedRoots({ change, revision }, relevantRemovedRootsFromChild) {
+    for (const mark of change) {
+        if (refersToRelevantRemovedRoots(mark)) {
+            (0, core_utils_1.assert)(mark.cellId !== undefined, 0x81d /* marks referring to removed trees must have an assigned cell ID */);
+            const nodeId = (0, deltaUtils_1.nodeIdFromChangeAtom)(mark.cellId, revision);
+            for (let i = 0; i < mark.count; i += 1) {
+                yield (0, core_1.offsetDetachId)(nodeId, i);
+            }
+        }
+        if (mark.changes !== undefined) {
+            yield* relevantRemovedRootsFromChild(mark.changes);
+        }
+    }
+}
+exports.relevantRemovedRoots = relevantRemovedRoots;
+function refersToRelevantRemovedRoots(mark) {
+    if (mark.cellId !== undefined) {
+        const effect = (0, utils_1.isAttachAndDetachEffect)(mark) ? mark.attach : mark;
+        if ((0, utils_1.isInsert)(effect)) {
+            // This tree is being inserted or restored.
+            return true;
+        }
+        else if ((0, utils_1.isDetachOfRemovedNodes)(mark)) {
+            // This removed tree is being restored as part of a detach.
+            return true;
+        }
+        if (mark.changes !== undefined) {
+            // This removed tree is being edited.
+            // Note: there is a possibility that the child changes only affect a distant descendant
+            // which may have been removed from this (removed) subtree. In such a case, this tree is not truly
+            // relevant, but including it is the conservative thing to do.
+            // In the future, we may represent changes to removed trees using the ID of the lowest removed
+            // ancestor, which would allow us to avoid including such trees when they truly are not needed.
+            return true;
+        }
+    }
+    return false;
+}
+//# sourceMappingURL=relevantRemovedRoots.js.map

package/dist/feature-libraries/sequence-field/relevantRemovedRoots.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relevantRemovedRoots.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/relevantRemovedRoots.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,qCAA+E;AAC/E,8CAAqD;AAErD,mCAAoF;AAMpF,QAAe,CAAC,CAAC,oBAAoB,CACpC,EAAE,MAAM,EAAE,QAAQ,EAAmC,EACrD,6BAAqE;IAErE,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;QAC1B,IAAI,4BAA4B,CAAC,IAAI,CAAC,EAAE;YACvC,IAAA,mBAAM,EACL,IAAI,CAAC,MAAM,KAAK,SAAS,EACzB,KAAK,CAAC,oEAAoE,CAC1E,CAAC;YACF,MAAM,MAAM,GAAG,IAAA,iCAAoB,EAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE;gBACvC,MAAM,IAAA,qBAAc,EAAC,MAAM,EAAE,CAAC,CAAC,CAAC;aAChC;SACD;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;YAC/B,KAAK,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACnD;KACD;AACF,CAAC;AAnBD,oDAmBC;AAED,SAAS,4BAA4B,CAAS,IAAkB;IAC/D,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;QAC9B,MAAM,MAAM,GAAG,IAAA,+BAAuB,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;QAClE,IAAI,IAAA,gBAAQ,EAAC,MAAM,CAAC,EAAE;YACrB,2CAA2C;YAC3C,OAAO,IAAI,CAAC;SACZ;aAAM,IAAI,IAAA,8BAAsB,EAAC,IAAI,CAAC,EAAE;YACxC,2DAA2D;YAC3D,OAAO,IAAI,CAAC;SACZ;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;YAC/B,qCAAqC;YACrC,uFAAuF;YACvF,kGAAkG;YAClG,8DAA8D;YAC9D,8FAA8F;YAC9F,+FAA+F;YAC/F,OAAO,IAAI,CAAC;SACZ;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { DeltaDetachedNodeId, TaggedChange, offsetDetachId } from \"../../core\";\nimport { nodeIdFromChangeAtom } from \"../deltaUtils\";\nimport { Changeset, Mark } from \"./types\";\nimport { isInsert, isDetachOfRemovedNodes, isAttachAndDetachEffect } from \"./utils\";\n\nexport type RelevantRemovedRootsFromTChild<TChild> = (\n\tchild: TChild,\n) => Iterable<DeltaDetachedNodeId>;\n\nexport function* relevantRemovedRoots<TChild>(\n\t{ change, revision }: TaggedChange<Changeset<TChild>>,\n\trelevantRemovedRootsFromChild: RelevantRemovedRootsFromTChild<TChild>,\n): Iterable<DeltaDetachedNodeId> {\n\tfor (const mark of change) {\n\t\tif (refersToRelevantRemovedRoots(mark)) {\n\t\t\tassert(\n\t\t\t\tmark.cellId !== undefined,\n\t\t\t\t0x81d /* marks referring to removed trees must have an assigned cell ID */,\n\t\t\t);\n\t\t\tconst nodeId = nodeIdFromChangeAtom(mark.cellId, revision);\n\t\t\tfor (let i = 0; i < mark.count; i += 1) {\n\t\t\t\tyield offsetDetachId(nodeId, i);\n\t\t\t}\n\t\t}\n\t\tif (mark.changes !== undefined) {\n\t\t\tyield* relevantRemovedRootsFromChild(mark.changes);\n\t\t}\n\t}\n}\n\nfunction refersToRelevantRemovedRoots<TChild>(mark: Mark<TChild>): boolean {\n\tif (mark.cellId !== undefined) {\n\t\tconst effect = isAttachAndDetachEffect(mark) ? mark.attach : mark;\n\t\tif (isInsert(effect)) {\n\t\t\t// This tree is being inserted or restored.\n\t\t\treturn true;\n\t\t} else if (isDetachOfRemovedNodes(mark)) {\n\t\t\t// This removed tree is being restored as part of a detach.\n\t\t\treturn true;\n\t\t}\n\t\tif (mark.changes !== undefined) {\n\t\t\t// This removed tree is being edited.\n\t\t\t// Note: there is a possibility that the child changes only affect a distant descendant\n\t\t\t// which may have been removed from this (removed) subtree. In such a case, this tree is not truly\n\t\t\t// relevant, but including it is the conservative thing to do.\n\t\t\t// In the future, we may represent changes to removed trees using the ID of the lowest removed\n\t\t\t// ancestor, which would allow us to avoid including such trees when they truly are not needed.\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n"]}

package/dist/feature-libraries/sequence-field/sequenceFieldChangeHandler.d.ts

@@ -0,0 +1,10 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldChangeHandler } from "../modular-schema";
+import { Changeset } from "./types";
+import { SequenceFieldEditor } from "./sequenceFieldEditor";
+export type SequenceFieldChangeHandler = FieldChangeHandler<Changeset, SequenceFieldEditor>;
+export declare const sequenceFieldChangeHandler: SequenceFieldChangeHandler;
+//# sourceMappingURL=sequenceFieldChangeHandler.d.ts.map

package/dist/feature-libraries/sequence-field/sequenceFieldChangeHandler.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldChangeHandler.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldChangeHandler.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAGpC,OAAO,EAAE,mBAAmB,EAAuB,MAAM,uBAAuB,CAAC;AAKjF,MAAM,MAAM,0BAA0B,GAAG,kBAAkB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;AAE5F,eAAO,MAAM,0BAA0B,EAAE,0BAOxC,CAAC"}

package/dist/feature-libraries/sequence-field/sequenceFieldChangeHandler.js

@@ -0,0 +1,22 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceFieldChangeHandler = void 0;
+const sequenceFieldChangeRebaser_1 = require("./sequenceFieldChangeRebaser");
+const sequenceFieldCodecs_1 = require("./sequenceFieldCodecs");
+const sequenceFieldEditor_1 = require("./sequenceFieldEditor");
+const sequenceFieldToDelta_1 = require("./sequenceFieldToDelta");
+const utils_1 = require("./utils");
+const relevantRemovedRoots_1 = require("./relevantRemovedRoots");
+exports.sequenceFieldChangeHandler = {
+    rebaser: sequenceFieldChangeRebaser_1.sequenceFieldChangeRebaser,
+    codecsFactory: sequenceFieldCodecs_1.sequenceFieldChangeCodecFactory,
+    editor: sequenceFieldEditor_1.sequenceFieldEditor,
+    intoDelta: sequenceFieldToDelta_1.sequenceFieldToDelta,
+    relevantRemovedRoots: relevantRemovedRoots_1.relevantRemovedRoots,
+    isEmpty: utils_1.isEmpty,
+};
+//# sourceMappingURL=sequenceFieldChangeHandler.js.map

package/dist/feature-libraries/sequence-field/sequenceFieldChangeHandler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldChangeHandler.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldChangeHandler.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAIH,6EAA0E;AAC1E,+DAAwE;AACxE,+DAAiF;AACjF,iEAA8D;AAC9D,mCAAkC;AAClC,iEAA8D;AAIjD,QAAA,0BAA0B,GAA+B;IACrE,OAAO,EAAE,uDAA0B;IACnC,aAAa,EAAE,qDAA+B;IAC9C,MAAM,EAAE,yCAAmB;IAC3B,SAAS,EAAE,2CAAoB;IAC/B,oBAAoB,EAApB,2CAAoB;IACpB,OAAO,EAAP,eAAO;CACP,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { FieldChangeHandler } from \"../modular-schema\";\nimport { Changeset } from \"./types\";\nimport { sequenceFieldChangeRebaser } from \"./sequenceFieldChangeRebaser\";\nimport { sequenceFieldChangeCodecFactory } from \"./sequenceFieldCodecs\";\nimport { SequenceFieldEditor, sequenceFieldEditor } from \"./sequenceFieldEditor\";\nimport { sequenceFieldToDelta } from \"./sequenceFieldToDelta\";\nimport { isEmpty } from \"./utils\";\nimport { relevantRemovedRoots } from \"./relevantRemovedRoots\";\n\nexport type SequenceFieldChangeHandler = FieldChangeHandler<Changeset, SequenceFieldEditor>;\n\nexport const sequenceFieldChangeHandler: SequenceFieldChangeHandler = {\n\trebaser: sequenceFieldChangeRebaser,\n\tcodecsFactory: sequenceFieldChangeCodecFactory,\n\teditor: sequenceFieldEditor,\n\tintoDelta: sequenceFieldToDelta,\n\trelevantRemovedRoots,\n\tisEmpty,\n};\n"]}

package/dist/feature-libraries/sequence-field/sequenceFieldChangeRebaser.d.ts

@@ -0,0 +1,19 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FieldChangeRebaser } from "../modular-schema";
+import { amendCompose, compose } from "./compose";
+import { Changeset } from "./types";
+import { invert } from "./invert";
+import { rebase } from "./rebase";
+import { prune } from "./prune";
+export type SequenceChangeRebaser = FieldChangeRebaser<Changeset>;
+export declare const sequenceFieldChangeRebaser: {
+    compose: typeof compose;
+    amendCompose: typeof amendCompose;
+    invert: typeof invert;
+    rebase: typeof rebase;
+    prune: typeof prune;
+};
+//# sourceMappingURL=sequenceFieldChangeRebaser.d.ts.map

package/dist/feature-libraries/sequence-field/sequenceFieldChangeRebaser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldChangeRebaser.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldChangeRebaser.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC,MAAM,MAAM,qBAAqB,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC;AAElE,eAAO,MAAM,0BAA0B;;;;;;CAMtC,CAAC"}

package/dist/feature-libraries/sequence-field/sequenceFieldChangeRebaser.js

@@ -0,0 +1,19 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceFieldChangeRebaser = void 0;
+const compose_1 = require("./compose");
+const invert_1 = require("./invert");
+const rebase_1 = require("./rebase");
+const prune_1 = require("./prune");
+exports.sequenceFieldChangeRebaser = {
+    compose: compose_1.compose,
+    amendCompose: compose_1.amendCompose,
+    invert: invert_1.invert,
+    rebase: rebase_1.rebase,
+    prune: prune_1.prune,
+};
+//# sourceMappingURL=sequenceFieldChangeRebaser.js.map

package/dist/feature-libraries/sequence-field/sequenceFieldChangeRebaser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldChangeRebaser.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldChangeRebaser.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,uCAAkD;AAElD,qCAAkC;AAClC,qCAAkC;AAClC,mCAAgC;AAInB,QAAA,0BAA0B,GAAG;IACzC,OAAO,EAAP,iBAAO;IACP,YAAY,EAAZ,sBAAY;IACZ,MAAM,EAAN,eAAM;IACN,MAAM,EAAN,eAAM;IACN,KAAK,EAAL,aAAK;CACL,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { FieldChangeRebaser } from \"../modular-schema\";\nimport { amendCompose, compose } from \"./compose\";\nimport { Changeset } from \"./types\";\nimport { invert } from \"./invert\";\nimport { rebase } from \"./rebase\";\nimport { prune } from \"./prune\";\n\nexport type SequenceChangeRebaser = FieldChangeRebaser<Changeset>;\n\nexport const sequenceFieldChangeRebaser = {\n\tcompose,\n\tamendCompose,\n\tinvert,\n\trebase,\n\tprune,\n};\n"]}

package/dist/feature-libraries/sequence-field/sequenceFieldCodecs.d.ts

@@ -0,0 +1,10 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { JsonCompatibleReadOnly } from "../../util";
+import { IJsonCodec } from "../../codec";
+import { EncodedRevisionTag, RevisionTag } from "../../core";
+import { Changeset } from "./types";
+export declare const sequenceFieldChangeCodecFactory: <TNodeChange>(childCodec: IJsonCodec<TNodeChange, JsonCompatibleReadOnly, JsonCompatibleReadOnly>, revisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>) => import("../../codec").ICodecFamily<Changeset<TNodeChange>>;
+//# sourceMappingURL=sequenceFieldCodecs.d.ts.map

package/dist/feature-libraries/sequence-field/sequenceFieldCodecs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldCodecs.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldCodecs.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,sBAAsB,EAAiB,MAAM,YAAY,CAAC;AACnE,OAAO,EAAgC,UAAU,EAAmB,MAAM,aAAa,CAAC;AACxF,OAAO,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE7D,OAAO,EAIN,SAAS,EAST,MAAM,SAAS,CAAC;AAIjB,eAAO,MAAM,+BAA+B,uHAEzB,WAAW,WAAW,EAAE,kBAAkB,CAAC,+DACgC,CAAC"}

package/dist/feature-libraries/sequence-field/sequenceFieldCodecs.js

@@ -0,0 +1,239 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.sequenceFieldChangeCodecFactory = void 0;
+const core_utils_1 = require("@fluidframework/core-utils");
+const typebox_1 = require("@sinclair/typebox");
+const util_1 = require("../../util");
+const codec_1 = require("../../codec");
+const utils_1 = require("../utils");
+const types_1 = require("./types");
+const format_1 = require("./format");
+const utils_2 = require("./utils");
+const sequenceFieldChangeCodecFactory = (childCodec, revisionTagCodec) => (0, codec_1.makeCodecFamily)([[0, makeV0Codec(childCodec, revisionTagCodec)]]);
+exports.sequenceFieldChangeCodecFactory = sequenceFieldChangeCodecFactory;
+function makeV0Codec(childCodec, revisionTagCodec) {
+    const markEffectCodec = {
+        encode(effect) {
+            const type = effect.type;
+            switch (type) {
+                case "MoveIn":
+                    return {
+                        moveIn: {
+                            revision: effect.revision === undefined
+                                ? undefined
+                                : revisionTagCodec.encode(effect.revision),
+                            finalEndpoint: effect.finalEndpoint === undefined
+                                ? undefined
+                                : (0, utils_1.encodeChangeAtomId)(revisionTagCodec, effect.finalEndpoint),
+                            id: effect.id,
+                        },
+                    };
+                case "Insert":
+                    return {
+                        insert: {
+                            revision: effect.revision === undefined
+                                ? undefined
+                                : revisionTagCodec.encode(effect.revision),
+                            id: effect.id,
+                        },
+                    };
+                case "Delete":
+                    return {
+                        delete: {
+                            revision: effect.revision === undefined
+                                ? undefined
+                                : revisionTagCodec.encode(effect.revision),
+                            redetachId: effect.redetachId === undefined
+                                ? undefined
+                                : cellIdCodec.encode(effect.redetachId),
+                            id: effect.id,
+                        },
+                    };
+                case "MoveOut":
+                    return {
+                        moveOut: {
+                            revision: effect.revision === undefined
+                                ? undefined
+                                : revisionTagCodec.encode(effect.revision),
+                            finalEndpoint: effect.finalEndpoint === undefined
+                                ? undefined
+                                : (0, utils_1.encodeChangeAtomId)(revisionTagCodec, effect.finalEndpoint),
+                            redetachId: effect.redetachId === undefined
+                                ? undefined
+                                : cellIdCodec.encode(effect.redetachId),
+                            id: effect.id,
+                        },
+                    };
+                case "AttachAndDetach":
+                    return {
+                        attachAndDetach: {
+                            attach: markEffectCodec.encode(effect.attach),
+                            detach: markEffectCodec.encode(effect.detach),
+                        },
+                    };
+                case types_1.NoopMarkType:
+                    (0, util_1.fail)(`Mark type: ${type} should not be encoded.`);
+                default:
+                    (0, core_utils_1.unreachableCase)(type);
+            }
+        },
+        decode(encoded) {
+            return decoderLibrary.dispatch(encoded);
+        },
+    };
+    const decoderLibrary = new codec_1.DiscriminatedUnionDispatcher({
+        moveIn(encoded) {
+            const { id, finalEndpoint, revision } = encoded;
+            const mark = {
+                type: "MoveIn",
+                id,
+            };
+            if (revision !== undefined) {
+                mark.revision = revisionTagCodec.decode(revision);
+            }
+            if (finalEndpoint !== undefined) {
+                mark.finalEndpoint = (0, utils_1.decodeChangeAtomId)(revisionTagCodec, finalEndpoint);
+            }
+            return mark;
+        },
+        insert(encoded) {
+            const { id, revision } = encoded;
+            const mark = {
+                type: "Insert",
+                id,
+            };
+            if (revision !== undefined) {
+                mark.revision = revisionTagCodec.decode(revision);
+            }
+            return mark;
+        },
+        delete(encoded) {
+            const { id, revision, redetachId } = encoded;
+            const mark = {
+                type: "Delete",
+                id,
+            };
+            if (revision !== undefined) {
+                mark.revision = revisionTagCodec.decode(revision);
+            }
+            if (redetachId !== undefined) {
+                mark.redetachId = cellIdCodec.decode(redetachId);
+            }
+            return mark;
+        },
+        moveOut(encoded) {
+            const { id, finalEndpoint, redetachId, revision } = encoded;
+            const mark = {
+                type: "MoveOut",
+                id,
+            };
+            if (revision !== undefined) {
+                mark.revision = revisionTagCodec.decode(revision);
+            }
+            if (finalEndpoint !== undefined) {
+                mark.finalEndpoint = (0, utils_1.decodeChangeAtomId)(revisionTagCodec, finalEndpoint);
+            }
+            if (redetachId !== undefined) {
+                mark.redetachId = cellIdCodec.decode(redetachId);
+            }
+            return mark;
+        },
+        attachAndDetach(encoded) {
+            return {
+                type: "AttachAndDetach",
+                attach: decoderLibrary.dispatch(encoded.attach),
+                detach: decoderLibrary.dispatch(encoded.detach),
+            };
+        },
+    });
+    const cellIdCodec = {
+        encode: ({ localId, adjacentCells, lineage, revision }) => {
+            const encoded = {
+                localId,
+                adjacentCells: adjacentCells?.map(({ id, count }) => [id, count]),
+                // eslint-disable-next-line @typescript-eslint/no-shadow
+                lineage: lineage?.map(({ revision, id, count, offset }) => [
+                    revisionTagCodec.encode(revision),
+                    id,
+                    count,
+                    offset,
+                ]),
+                revision: revision === undefined ? revision : revisionTagCodec.encode(revision),
+            };
+            return encoded;
+        },
+        decode: ({ localId, adjacentCells, lineage, revision }) => {
+            // Note: this isn't inlined on decode so that round-tripping changes compare as deep-equal works,
+            // which is mostly just a convenience for tests. On encode, JSON.stringify() takes care of removing
+            // explicit undefined properties.
+            const decoded = {
+                localId,
+            };
+            if (revision !== undefined) {
+                decoded.revision = revisionTagCodec.decode(revision);
+            }
+            if (adjacentCells !== undefined) {
+                decoded.adjacentCells = adjacentCells.map(([id, count]) => ({
+                    id,
+                    count,
+                }));
+            }
+            if (lineage !== undefined) {
+                // eslint-disable-next-line @typescript-eslint/no-shadow
+                decoded.lineage = lineage.map(([revision, id, count, offset]) => ({
+                    revision: revisionTagCodec.decode(revision),
+                    id,
+                    count,
+                    offset,
+                }));
+            }
+            return decoded;
+        },
+    };
+    return {
+        encode: (changeset) => {
+            const jsonMarks = [];
+            for (const mark of changeset) {
+                const encodedMark = {
+                    count: mark.count,
+                };
+                if (!(0, utils_2.isNoopMark)(mark)) {
+                    encodedMark.effect = markEffectCodec.encode(mark);
+                }
+                if (mark.cellId !== undefined) {
+                    encodedMark.cellId = cellIdCodec.encode(mark.cellId);
+                }
+                if (mark.changes !== undefined) {
+                    encodedMark.changes = childCodec.encode(mark.changes);
+                }
+                jsonMarks.push(encodedMark);
+            }
+            return jsonMarks;
+        },
+        decode: (changeset) => {
+            const marks = [];
+            for (const mark of changeset) {
+                const decodedMark = {
+                    count: mark.count,
+                };
+                if (mark.effect !== undefined) {
+                    Object.assign(decodedMark, markEffectCodec.decode(mark.effect));
+                }
+                if (mark.cellId !== undefined) {
+                    decodedMark.cellId = cellIdCodec.decode(mark.cellId);
+                }
+                if (mark.changes !== undefined) {
+                    decodedMark.changes = childCodec.decode(mark.changes);
+                }
+                marks.push(decodedMark);
+            }
+            return marks;
+        },
+        encodedSchema: (0, format_1.Changeset)(childCodec.encodedSchema ?? typebox_1.Type.Any()),
+    };
+}
+//# sourceMappingURL=sequenceFieldCodecs.js.map

package/dist/feature-libraries/sequence-field/sequenceFieldCodecs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sequenceFieldCodecs.js","sourceRoot":"","sources":["../../../src/feature-libraries/sequence-field/sequenceFieldCodecs.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAA6D;AAC7D,+CAAqD;AACrD,qCAAmE;AACnE,uCAAwF;AAExF,oCAAkE;AAClE,mCAaiB;AACjB,qCAAiE;AACjE,mCAAqC;AAE9B,MAAM,+BAA+B,GAAG,CAC9C,UAAmC,EACnC,gBAA6D,EAC5D,EAAE,CAAC,IAAA,uBAAe,EAAyB,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,UAAU,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;AAHlF,QAAA,+BAA+B,mCAGmD;AAC/F,SAAS,WAAW,CACnB,UAAmC,EACnC,gBAA6D;IAE7D,MAAM,eAAe,GAA+C;QACnE,MAAM,CAAC,MAAkB;YACxB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;YACzB,QAAQ,IAAI,EAAE;gBACb,KAAK,QAAQ;oBACZ,OAAO;wBACN,MAAM,EAAE;4BACP,QAAQ,EACP,MAAM,CAAC,QAAQ,KAAK,SAAS;gCAC5B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;4BAC5C,aAAa,EACZ,MAAM,CAAC,aAAa,KAAK,SAAS;gCACjC,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,IAAA,0BAAkB,EAAC,gBAAgB,EAAE,MAAM,CAAC,aAAa,CAAC;4BAC9D,EAAE,EAAE,MAAM,CAAC,EAAE;yBACb;qBACD,CAAC;gBACH,KAAK,QAAQ;oBACZ,OAAO;wBACN,MAAM,EAAE;4BACP,QAAQ,EACP,MAAM,CAAC,QAAQ,KAAK,SAAS;gCAC5B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;4BAC5C,EAAE,EAAE,MAAM,CAAC,EAAE;yBACb;qBACD,CAAC;gBACH,KAAK,QAAQ;oBACZ,OAAO;wBACN,MAAM,EAAE;4BACP,QAAQ,EACP,MAAM,CAAC,QAAQ,KAAK,SAAS;gCAC5B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;4BAC5C,UAAU,EACT,MAAM,CAAC,UAAU,KAAK,SAAS;gCAC9B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;4BACzC,EAAE,EAAE,MAAM,CAAC,EAAE;yBACb;qBACD,CAAC;gBACH,KAAK,SAAS;oBACb,OAAO;wBACN,OAAO,EAAE;4BACR,QAAQ,EACP,MAAM,CAAC,QAAQ,KAAK,SAAS;gCAC5B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;4BAC5C,aAAa,EACZ,MAAM,CAAC,aAAa,KAAK,SAAS;gCACjC,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,IAAA,0BAAkB,EAAC,gBAAgB,EAAE,MAAM,CAAC,aAAa,CAAC;4BAC9D,UAAU,EACT,MAAM,CAAC,UAAU,KAAK,SAAS;gCAC9B,CAAC,CAAC,SAAS;gCACX,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC;4BACzC,EAAE,EAAE,MAAM,CAAC,EAAE;yBACb;qBACD,CAAC;gBACH,KAAK,iBAAiB;oBACrB,OAAO;wBACN,eAAe,EAAE;4BAChB,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAmB;4BAC/D,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAmB;yBAC/D;qBACD,CAAC;gBACH,KAAK,oBAAY;oBAChB,IAAA,WAAI,EAAC,cAAc,IAAI,yBAAyB,CAAC,CAAC;gBACnD;oBACC,IAAA,4BAAe,EAAC,IAAI,CAAC,CAAC;aACvB;QACF,CAAC;QACD,MAAM,CAAC,OAA2B;YACjC,OAAO,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACzC,CAAC;KACD,CAAC;IAEF,MAAM,cAAc,GAAG,IAAI,oCAA4B,CAIrD;QACD,MAAM,CAAC,OAAuB;YAC7B,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;YAChD,MAAM,IAAI,GAAW;gBACpB,IAAI,EAAE,QAAQ;gBACd,EAAE;aACF,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAClD;YACD,IAAI,aAAa,KAAK,SAAS,EAAE;gBAChC,IAAI,CAAC,aAAa,GAAG,IAAA,0BAAkB,EAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;aACzE;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,MAAM,CAAC,OAAuB;YAC7B,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;YACjC,MAAM,IAAI,GAAW;gBACpB,IAAI,EAAE,QAAQ;gBACd,EAAE;aACF,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAClD;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,MAAM,CAAC,OAAuB;YAC7B,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,OAAO,CAAC;YAC7C,MAAM,IAAI,GAAW;gBACpB,IAAI,EAAE,QAAQ;gBACd,EAAE;aACF,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAClD;YACD,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aACjD;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,OAAO,CAAC,OAAwB;YAC/B,MAAM,EAAE,EAAE,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC;YAC5D,MAAM,IAAI,GAAY;gBACrB,IAAI,EAAE,SAAS;gBACf,EAAE;aACF,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aAClD;YACD,IAAI,aAAa,KAAK,SAAS,EAAE;gBAChC,IAAI,CAAC,aAAa,GAAG,IAAA,0BAAkB,EAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;aACzE;YACD,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC7B,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;aACjD;YACD,OAAO,IAAI,CAAC;QACb,CAAC;QACD,eAAe,CAAC,OAAgC;YAC/C,OAAO;gBACN,IAAI,EAAE,iBAAiB;gBACvB,MAAM,EAAE,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAW;gBACzD,MAAM,EAAE,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAW;aACzD,CAAC;QACH,CAAC;KACD,CAAC,CAAC;IAEH,MAAM,WAAW,GAAuC;QACvD,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,QAAQ,EAAU,EAAkB,EAAE;YACjF,MAAM,OAAO,GAAmB;gBAC/B,OAAO;gBACP,aAAa,EAAE,aAAa,EAAE,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACjE,wDAAwD;gBACxD,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;oBAC1D,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC;oBACjC,EAAE;oBACF,KAAK;oBACL,MAAM;iBACN,CAAC;gBACF,QAAQ,EAAE,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC;aAC/E,CAAC;YACF,OAAO,OAAO,CAAC;QAChB,CAAC;QACD,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,QAAQ,EAAkB,EAAU,EAAE;YACjF,iGAAiG;YACjG,mGAAmG;YACnG,iCAAiC;YACjC,MAAM,OAAO,GAAoB;gBAChC,OAAO;aACP,CAAC;YACF,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,OAAO,CAAC,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;aACrD;YACD,IAAI,aAAa,KAAK,SAAS,EAAE;gBAChC,OAAO,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;oBAC3D,EAAE;oBACF,KAAK;iBACL,CAAC,CAAC,CAAC;aACJ;YACD,IAAI,OAAO,KAAK,SAAS,EAAE;gBAC1B,wDAAwD;gBACxD,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;oBACjE,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC;oBAC3C,EAAE;oBACF,KAAK;oBACL,MAAM;iBACN,CAAC,CAAC,CAAC;aACJ;YACD,OAAO,OAAO,CAAC;QAChB,CAAC;KACD,CAAC;IAQF,OAAO;QACN,MAAM,EAAE,CACP,SAAiC,EAC8B,EAAE;YACjE,MAAM,SAAS,GAAwC,EAAE,CAAC;YAC1D,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;gBAC7B,MAAM,WAAW,GAAmC;oBACnD,KAAK,EAAE,IAAI,CAAC,KAAK;iBACjB,CAAC;gBACF,IAAI,CAAC,IAAA,kBAAU,EAAC,IAAI,CAAC,EAAE;oBACtB,WAAW,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;iBAClD;gBACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;oBAC9B,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;iBACrD;gBACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;oBAC/B,WAAW,CAAC,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACtD;gBACD,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aAC5B;YACD,OAAO,SAAS,CAAC;QAClB,CAAC;QACD,MAAM,EAAE,CAAC,SAA8C,EAA0B,EAAE;YAClF,MAAM,KAAK,GAA2B,EAAE,CAAC;YACzC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;gBAC7B,MAAM,WAAW,GAAsB;oBACtC,KAAK,EAAE,IAAI,CAAC,KAAK;iBACjB,CAAC;gBAEF,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;oBAC9B,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;iBAChE;gBACD,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;oBAC9B,WAAW,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;iBACrD;gBACD,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE;oBAC/B,WAAW,CAAC,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;iBACtD;gBACD,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aACxB;YACD,OAAO,KAAK,CAAC;QACd,CAAC;QACD,aAAa,EAAE,IAAA,kBAAe,EAAC,UAAU,CAAC,aAAa,IAAI,cAAI,CAAC,GAAG,EAAE,CAAC;KACtE,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport { TAnySchema, Type } from \"@sinclair/typebox\";\nimport { JsonCompatibleReadOnly, Mutable, fail } from \"../../util\";\nimport { DiscriminatedUnionDispatcher, IJsonCodec, makeCodecFamily } from \"../../codec\";\nimport { EncodedRevisionTag, RevisionTag } from \"../../core\";\nimport { decodeChangeAtomId, encodeChangeAtomId } from \"../utils\";\nimport {\n\tAttach,\n\tAttachAndDetach,\n\tCellId,\n\tChangeset,\n\tDelete,\n\tDetach,\n\tInsert,\n\tMark,\n\tMarkEffect,\n\tMoveIn,\n\tMoveOut,\n\tNoopMarkType,\n} from \"./types\";\nimport { Changeset as ChangesetSchema, Encoded } from \"./format\";\nimport { isNoopMark } from \"./utils\";\n\nexport const sequenceFieldChangeCodecFactory = <TNodeChange>(\n\tchildCodec: IJsonCodec<TNodeChange>,\n\trevisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>,\n) => makeCodecFamily<Changeset<TNodeChange>>([[0, makeV0Codec(childCodec, revisionTagCodec)]]);\nfunction makeV0Codec<TNodeChange>(\n\tchildCodec: IJsonCodec<TNodeChange>,\n\trevisionTagCodec: IJsonCodec<RevisionTag, EncodedRevisionTag>,\n): IJsonCodec<Changeset<TNodeChange>> {\n\tconst markEffectCodec: IJsonCodec<MarkEffect, Encoded.MarkEffect> = {\n\t\tencode(effect: MarkEffect): Encoded.MarkEffect {\n\t\t\tconst type = effect.type;\n\t\t\tswitch (type) {\n\t\t\t\tcase \"MoveIn\":\n\t\t\t\t\treturn {\n\t\t\t\t\t\tmoveIn: {\n\t\t\t\t\t\t\trevision:\n\t\t\t\t\t\t\t\teffect.revision === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: revisionTagCodec.encode(effect.revision),\n\t\t\t\t\t\t\tfinalEndpoint:\n\t\t\t\t\t\t\t\teffect.finalEndpoint === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: encodeChangeAtomId(revisionTagCodec, effect.finalEndpoint),\n\t\t\t\t\t\t\tid: effect.id,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\t\t\t\tcase \"Insert\":\n\t\t\t\t\treturn {\n\t\t\t\t\t\tinsert: {\n\t\t\t\t\t\t\trevision:\n\t\t\t\t\t\t\t\teffect.revision === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: revisionTagCodec.encode(effect.revision),\n\t\t\t\t\t\t\tid: effect.id,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\t\t\t\tcase \"Delete\":\n\t\t\t\t\treturn {\n\t\t\t\t\t\tdelete: {\n\t\t\t\t\t\t\trevision:\n\t\t\t\t\t\t\t\teffect.revision === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: revisionTagCodec.encode(effect.revision),\n\t\t\t\t\t\t\tredetachId:\n\t\t\t\t\t\t\t\teffect.redetachId === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: cellIdCodec.encode(effect.redetachId),\n\t\t\t\t\t\t\tid: effect.id,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\t\t\t\tcase \"MoveOut\":\n\t\t\t\t\treturn {\n\t\t\t\t\t\tmoveOut: {\n\t\t\t\t\t\t\trevision:\n\t\t\t\t\t\t\t\teffect.revision === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: revisionTagCodec.encode(effect.revision),\n\t\t\t\t\t\t\tfinalEndpoint:\n\t\t\t\t\t\t\t\teffect.finalEndpoint === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: encodeChangeAtomId(revisionTagCodec, effect.finalEndpoint),\n\t\t\t\t\t\t\tredetachId:\n\t\t\t\t\t\t\t\teffect.redetachId === undefined\n\t\t\t\t\t\t\t\t\t? undefined\n\t\t\t\t\t\t\t\t\t: cellIdCodec.encode(effect.redetachId),\n\t\t\t\t\t\t\tid: effect.id,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\t\t\t\tcase \"AttachAndDetach\":\n\t\t\t\t\treturn {\n\t\t\t\t\t\tattachAndDetach: {\n\t\t\t\t\t\t\tattach: markEffectCodec.encode(effect.attach) as Encoded.Attach,\n\t\t\t\t\t\t\tdetach: markEffectCodec.encode(effect.detach) as Encoded.Detach,\n\t\t\t\t\t\t},\n\t\t\t\t\t};\n\t\t\t\tcase NoopMarkType:\n\t\t\t\t\tfail(`Mark type: ${type} should not be encoded.`);\n\t\t\t\tdefault:\n\t\t\t\t\tunreachableCase(type);\n\t\t\t}\n\t\t},\n\t\tdecode(encoded: Encoded.MarkEffect): MarkEffect {\n\t\t\treturn decoderLibrary.dispatch(encoded);\n\t\t},\n\t};\n\n\tconst decoderLibrary = new DiscriminatedUnionDispatcher<\n\t\tEncoded.MarkEffect,\n\t\t/* args */ [],\n\t\tMarkEffect\n\t>({\n\t\tmoveIn(encoded: Encoded.MoveIn): MoveIn {\n\t\t\tconst { id, finalEndpoint, revision } = encoded;\n\t\t\tconst mark: MoveIn = {\n\t\t\t\ttype: \"MoveIn\",\n\t\t\t\tid,\n\t\t\t};\n\t\t\tif (revision !== undefined) {\n\t\t\t\tmark.revision = revisionTagCodec.decode(revision);\n\t\t\t}\n\t\t\tif (finalEndpoint !== undefined) {\n\t\t\t\tmark.finalEndpoint = decodeChangeAtomId(revisionTagCodec, finalEndpoint);\n\t\t\t}\n\t\t\treturn mark;\n\t\t},\n\t\tinsert(encoded: Encoded.Insert): Insert {\n\t\t\tconst { id, revision } = encoded;\n\t\t\tconst mark: Insert = {\n\t\t\t\ttype: \"Insert\",\n\t\t\t\tid,\n\t\t\t};\n\t\t\tif (revision !== undefined) {\n\t\t\t\tmark.revision = revisionTagCodec.decode(revision);\n\t\t\t}\n\t\t\treturn mark;\n\t\t},\n\t\tdelete(encoded: Encoded.Delete): Delete {\n\t\t\tconst { id, revision, redetachId } = encoded;\n\t\t\tconst mark: Delete = {\n\t\t\t\ttype: \"Delete\",\n\t\t\t\tid,\n\t\t\t};\n\t\t\tif (revision !== undefined) {\n\t\t\t\tmark.revision = revisionTagCodec.decode(revision);\n\t\t\t}\n\t\t\tif (redetachId !== undefined) {\n\t\t\t\tmark.redetachId = cellIdCodec.decode(redetachId);\n\t\t\t}\n\t\t\treturn mark;\n\t\t},\n\t\tmoveOut(encoded: Encoded.MoveOut): MoveOut {\n\t\t\tconst { id, finalEndpoint, redetachId, revision } = encoded;\n\t\t\tconst mark: MoveOut = {\n\t\t\t\ttype: \"MoveOut\",\n\t\t\t\tid,\n\t\t\t};\n\t\t\tif (revision !== undefined) {\n\t\t\t\tmark.revision = revisionTagCodec.decode(revision);\n\t\t\t}\n\t\t\tif (finalEndpoint !== undefined) {\n\t\t\t\tmark.finalEndpoint = decodeChangeAtomId(revisionTagCodec, finalEndpoint);\n\t\t\t}\n\t\t\tif (redetachId !== undefined) {\n\t\t\t\tmark.redetachId = cellIdCodec.decode(redetachId);\n\t\t\t}\n\t\t\treturn mark;\n\t\t},\n\t\tattachAndDetach(encoded: Encoded.AttachAndDetach): AttachAndDetach {\n\t\t\treturn {\n\t\t\t\ttype: \"AttachAndDetach\",\n\t\t\t\tattach: decoderLibrary.dispatch(encoded.attach) as Attach,\n\t\t\t\tdetach: decoderLibrary.dispatch(encoded.detach) as Detach,\n\t\t\t};\n\t\t},\n\t});\n\n\tconst cellIdCodec: IJsonCodec<CellId, Encoded.CellId> = {\n\t\tencode: ({ localId, adjacentCells, lineage, revision }: CellId): Encoded.CellId => {\n\t\t\tconst encoded: Encoded.CellId = {\n\t\t\t\tlocalId,\n\t\t\t\tadjacentCells: adjacentCells?.map(({ id, count }) => [id, count]),\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-shadow\n\t\t\t\tlineage: lineage?.map(({ revision, id, count, offset }) => [\n\t\t\t\t\trevisionTagCodec.encode(revision),\n\t\t\t\t\tid,\n\t\t\t\t\tcount,\n\t\t\t\t\toffset,\n\t\t\t\t]),\n\t\t\t\trevision: revision === undefined ? revision : revisionTagCodec.encode(revision),\n\t\t\t};\n\t\t\treturn encoded;\n\t\t},\n\t\tdecode: ({ localId, adjacentCells, lineage, revision }: Encoded.CellId): CellId => {\n\t\t\t// Note: this isn't inlined on decode so that round-tripping changes compare as deep-equal works,\n\t\t\t// which is mostly just a convenience for tests. On encode, JSON.stringify() takes care of removing\n\t\t\t// explicit undefined properties.\n\t\t\tconst decoded: Mutable<CellId> = {\n\t\t\t\tlocalId,\n\t\t\t};\n\t\t\tif (revision !== undefined) {\n\t\t\t\tdecoded.revision = revisionTagCodec.decode(revision);\n\t\t\t}\n\t\t\tif (adjacentCells !== undefined) {\n\t\t\t\tdecoded.adjacentCells = adjacentCells.map(([id, count]) => ({\n\t\t\t\t\tid,\n\t\t\t\t\tcount,\n\t\t\t\t}));\n\t\t\t}\n\t\t\tif (lineage !== undefined) {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-shadow\n\t\t\t\tdecoded.lineage = lineage.map(([revision, id, count, offset]) => ({\n\t\t\t\t\trevision: revisionTagCodec.decode(revision),\n\t\t\t\t\tid,\n\t\t\t\t\tcount,\n\t\t\t\t\toffset,\n\t\t\t\t}));\n\t\t\t}\n\t\t\treturn decoded;\n\t\t},\n\t};\n\n\t/**\n\t * If we want to make the node change aspect of this codec more type-safe, we could adjust generics\n\t * to be in terms of the schema rather than the concrete type of the node change.\n\t */\n\ttype NodeChangeSchema = TAnySchema;\n\n\treturn {\n\t\tencode: (\n\t\t\tchangeset: Changeset<TNodeChange>,\n\t\t): JsonCompatibleReadOnly & Encoded.Changeset<NodeChangeSchema> => {\n\t\t\tconst jsonMarks: Encoded.Changeset<NodeChangeSchema> = [];\n\t\t\tfor (const mark of changeset) {\n\t\t\t\tconst encodedMark: Encoded.Mark<NodeChangeSchema> = {\n\t\t\t\t\tcount: mark.count,\n\t\t\t\t};\n\t\t\t\tif (!isNoopMark(mark)) {\n\t\t\t\t\tencodedMark.effect = markEffectCodec.encode(mark);\n\t\t\t\t}\n\t\t\t\tif (mark.cellId !== undefined) {\n\t\t\t\t\tencodedMark.cellId = cellIdCodec.encode(mark.cellId);\n\t\t\t\t}\n\t\t\t\tif (mark.changes !== undefined) {\n\t\t\t\t\tencodedMark.changes = childCodec.encode(mark.changes);\n\t\t\t\t}\n\t\t\t\tjsonMarks.push(encodedMark);\n\t\t\t}\n\t\t\treturn jsonMarks;\n\t\t},\n\t\tdecode: (changeset: Encoded.Changeset<NodeChangeSchema>): Changeset<TNodeChange> => {\n\t\t\tconst marks: Changeset<TNodeChange> = [];\n\t\t\tfor (const mark of changeset) {\n\t\t\t\tconst decodedMark: Mark<TNodeChange> = {\n\t\t\t\t\tcount: mark.count,\n\t\t\t\t};\n\n\t\t\t\tif (mark.effect !== undefined) {\n\t\t\t\t\tObject.assign(decodedMark, markEffectCodec.decode(mark.effect));\n\t\t\t\t}\n\t\t\t\tif (mark.cellId !== undefined) {\n\t\t\t\t\tdecodedMark.cellId = cellIdCodec.decode(mark.cellId);\n\t\t\t\t}\n\t\t\t\tif (mark.changes !== undefined) {\n\t\t\t\t\tdecodedMark.changes = childCodec.decode(mark.changes);\n\t\t\t\t}\n\t\t\t\tmarks.push(decodedMark);\n\t\t\t}\n\t\t\treturn marks;\n\t\t},\n\t\tencodedSchema: ChangesetSchema(childCodec.encodedSchema ?? Type.Any()),\n\t};\n}\n"]}