npm - @fluidframework/tree - Versions diffs - 2.0.0-dev-rc.1.0.0.224419 - Mend

@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (2212) hide show

package/dist/shared-tree-core/branch.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"branch.js","sourceRoot":"","sources":["../../src/shared-tree-core/branch.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,kCAoBiB;AACjB,sCAAwD;AACxD,kCAA+B;AAC/B,yDAAsD;AAmCtD;;GAEG;AACH,SAAgB,oBAAoB,CACnC,MAA6D;IAE7D,uHAAuH;IACvH,oGAAoG;IACpG,2DAA2D;IAC3D,IAAI,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;QACzE,OAAO,QAAQ,CAAC;KAChB;IAED,iGAAiG;IACjG,0FAA0F;IAC1F,EAAE;IACF,+DAA+D;IAC/D,gEAAgE;IAChE,EAAE;IACF,uEAAuE;IACvE,IACC,MAAM,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC;QAClC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,QAAQ,EAClE;QACD,OAAO,QAAQ,CAAC;KAChB;IAED,OAAO,mBAAmB,CAAC;AAC5B,CAAC;AAzBD,oDAyBC;AAwCD;;GAEG;AACH,MAAa,gBAA8D,SAAQ,qBAElF;IAOA;;;;OAIG;IACH,YACS,IAA0B,EAClB,YAA4C;QAE5D,KAAK,EAAE,CAAC;QAHA,SAAI,GAAJ,IAAI,CAAsB;QAClB,iBAAY,GAAZ,YAAY,CAAgC;QAZ7D,uDAAuD;QACtC,gBAAW,GAAG,IAAI,GAAG,EAAc,CAAC;QACpC,uBAAkB,GAAG,IAAI,GAAG,EAAqC,CAAC;QAClE,iBAAY,GAAG,IAAI,mCAAgB,EAAE,CAAC;QAC/C,aAAQ,GAAG,KAAK,CAAC;QAWxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,EAAE,CACtD,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAA,sBAAe,GAAE,CAAC,CACrC,CAAC;IACH,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,IAA0B;QACxC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAA,mBAAM,EAAC,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAChF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACI,KAAK,CACX,MAAe,EACf,QAAqB;QAErB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,qBAAc,CAAC,OAAO,CAAC,CAAC;IACnE,CAAC;IAEO,WAAW,CAClB,MAAe,EACf,QAAqB,EACrB,cAA8B;QAE9B,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,MAAM,OAAO,GAAG,IAAA,iBAAU,EAAC,IAAI,CAAC,IAAI,EAAE;YACrC,QAAQ;YACR,MAAM;SACN,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,IAAA,gBAAS,EAAC,MAAM,EAAE,QAAQ,CAAC;YACnC,UAAU,EAAE,CAAC,OAAO,CAAC;SACZ,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,gEAAgE;QAChE,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC;SAChF;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,OAAO;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACI,gBAAgB;QACtB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAsC,CAAC;QAC5D,MAAM,qBAAqB,GAAmB,EAAE,CAAC;QACjD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;YACzD,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChB,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;YAC/C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;YACxC,qBAAqB,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;YAC9D,iBAAiB,EAAE,CAAC;QACrB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAChC,CAAC;IAED;;;;;;OAMG;IACI,iBAAiB;QAGvB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;QAE9B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACzB,OAAO,SAAS,CAAC;SACjB;QAED,gFAAgF;QAChF,uFAAuF;QACvF,MAAM,gBAAgB,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC;QACxF,4EAA4E;QAC5E,MAAM,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC3E,MAAM,QAAQ,GAAG,IAAA,sBAAe,GAAE,CAAC;QAEnC,MAAM,OAAO,GAAG,IAAA,iBAAU,EAAC,WAAW,EAAE;YACvC,QAAQ;YACR,MAAM,EAAE,cAAc;SACtB,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,SAAS;YACf,MAAM,EAAE,SAAS;YACjB,cAAc,EAAE,OAAO;YACvB,UAAU,EAAE,CAAC,OAAO,CAAC;SACZ,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,6DAA6D;QAC7D,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,qBAAc,CAAC,OAAO,CAAC,CAAC,CAAC;SACxF;QAED,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,gBAAgB;QAItB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,eAAe,EAAE,CAAC;QAE9B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;YACzB,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;SACvB;QAED,MAAM,QAAQ,GAA4B,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACpE,QAAQ,CAAC,IAAI,CAAC,IAAA,yBAAkB,EAAC,OAAO,EAAE,IAAA,sBAAe,GAAE,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;SACnF;QACD,MAAM,MAAM,GACX,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAE/E,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAA,qBAAc,EAAC,MAAM,CAAC;YACjE,cAAc,EAAE,OAAO;SACd,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACI,aAAa;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,CAAC;IACrC,CAAC;IAEO,cAAc;QACrB,MAAM,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,CAAC;QAClD,MAAM,OAAO,GAA2B,EAAE,CAAC;QAC3C,MAAM,WAAW,GAAG,IAAA,mBAAY,EAAC,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,aAAa,CAAC,CAAC;QAC5F,IAAA,mBAAM,EACL,WAAW,KAAK,SAAS,EACzB,KAAK,CAAC,+DAA+D,CACrE,CAAC;QACF,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAC/B,CAAC;IAEM,iBAAiB;QACvB,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC;IACvC,CAAC;IAED;;;OAGG;IACI,sBAAsB,CAAC,MAA4B;QACzD,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE;YAC/D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;SACrD;IACF,CAAC;IAEO,wBAAwB,CAC/B,MAA4B,EAC5B,IAAoB;QAEpB,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACrD,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,MAAM,UAAU,GAAG;YAClB,IAAI;YACJ,MAAM,EAAE;gBACP,qFAAqF;gBACrF,OAAO,EAAE,IAAI;aACb;YACD,MAAM,EAAE,GAAG,EAAE;gBACZ,IAAI,SAAS,EAAE;oBACd,IAAA,WAAI,EAAC,uCAAuC,CAAC,CAAC;iBAC9C;gBACD,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACxD,IAAI,YAAY,KAAK,SAAS,EAAE;oBAC/B,UAAU,CAAC,OAAO,EAAE,CAAC;oBACrB,OAAO,mBAAY,CAAC,OAAO,CAAC;iBAC5B;gBACD,OAAO,mBAAY,CAAC,OAAO,CAAC;YAC7B,CAAC;YACD,OAAO,EAAE,GAAG,EAAE;gBACb,IAAI,SAAS,EAAE;oBACd,IAAA,WAAI,EAAC,uCAAuC,CAAC,CAAC;iBAC9C;gBACD,+CAA+C;gBAC/C,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACpC,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAChD,OAAO,oBAAa,CAAC,OAAO,CAAC;YAC9B,CAAC;SACD,CAAC;QACF,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACjC,OAAO,UAAU,CAAC;IACnB,CAAC;IAEO,MAAM,CACb,QAAqB,EACrB,cAA8B;QAE9B,IAAA,mBAAM,EAAC,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,KAAK,CAAC,mDAAmD,CAAC,CAAC;QAEzF,MAAM,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAA,mBAAM,EAAC,MAAM,KAAK,SAAS,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;QAE/E,IAAI,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,IAAA,gBAAS,EAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAEzF,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;QAClC,wFAAwF;QACxF,IAAI,QAAQ,KAAK,UAAU,CAAC,QAAQ,EAAE;YACrC,MAAM,iBAAiB,GAA2B,EAAE,CAAC;YACrD,MAAM,QAAQ,GAAG,IAAA,yBAAkB,EAAC,CAAC,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC,CAAC;YAC/E,IAAA,mBAAM,EACL,QAAQ,KAAK,MAAM,EACnB,KAAK,CAAC,8DAA8D,CACpE,CAAC;YACF,MAAM,GAAG,IAAA,8BAAuB,EAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;SACvF;QAED,OAAO,IAAI,CAAC,WAAW,CACtB,MAAM,EACN,IAAA,sBAAe,GAAE,EACjB,cAAc,KAAK,qBAAc,CAAC,OAAO,IAAI,cAAc,KAAK,qBAAc,CAAC,IAAI;YAClF,CAAC,CAAC,qBAAc,CAAC,IAAI;YACrB,CAAC,CAAC,qBAAc,CAAC,IAAI,CACtB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACI,IAAI;QACV,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAChE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;;;;OAWG;IACI,UAAU,CAChB,MAA0C,EAC1C,IAAI,GAAG,MAAM,CAAC,OAAO,EAAE;QAEvB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAEzB,2CAA2C;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,SAAS,CAAC;SACjB;QAED,sEAAsE;QACtE,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC;QAChD,MAAM,EAAE,oBAAoB,EAAE,aAAa,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;QAEvE,kFAAkF;QAClF,iGAAiG;QACjG,uGAAuG;QACvG,wEAAwE;QACxE,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE;YACzC,IAAI,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;SAC1C;QAED,MAAM,UAAU,GAAG,aAAa,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QACvD,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,SAAS;YACf,IAAI,MAAM;gBACT,MAAM,MAAM,GAAG,YAAY,CAAC,YAAY,CAAC;gBACzC,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAA,qBAAc,EAAC,MAAM,CAAC,CAAC;YAClE,CAAC;YACD,cAAc,EAAE,oBAAoB;YACpC,UAAU;SACD,CAAC;QACX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;QAE1B,mDAAmD;QACnD,aAAa,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;YAChC,IAAI,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;;;;OASG;IACI,KAAK,CACX,MAA0C;QAE1C,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAC3B,IAAA,mBAAM,EACL,CAAC,MAAM,CAAC,aAAa,EAAE,EACvB,KAAK,CAAC,+DAA+D,CACrE,CAAC;QAEF,2CAA2C;QAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,SAAS,CAAC;SACjB;QAED,wCAAwC;QACxC,MAAM,aAAa,GAAG,YAAY,CAAC,OAAO,CAAC,aAAa,CAAC;QACzD,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QAChE,MAAM,YAAY,GAAG,IAAA,qBAAc,EAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,QAAQ;YACd,IAAI,MAAM;gBACT,OAAO,YAAY,CAAC;YACrB,CAAC;YACD,UAAU,EAAE,aAAa;SAChB,CAAC;QAEX,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,aAAa,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QACtC,OAAO,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAChC,CAAC;IAED,+EAA+E;IACvE,YAAY,CACnB,MAA0C,EAC1C,IAAwC,EACxC,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE;QAErB,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;QACxB,IAAI,IAAI,KAAK,IAAI,EAAE;YAClB,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,YAAY,GAAG,IAAA,mBAAY,EAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzF,IAAI,IAAI,CAAC,IAAI,KAAK,YAAY,CAAC,aAAa,EAAE;YAC7C,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;;OAOG;IACI,OAAO;QACb,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClB,OAAO;SACP;QAED,OAAO,IAAI,CAAC,aAAa,EAAE,EAAE;YAC5B,IAAI,CAAC,gBAAgB,EAAE,CAAC;SACxB;QAED,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QAE/D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,CAAC;IAEO,iBAAiB;QACxB,IAAA,mBAAM,EAAC,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;IACxD,CAAC;CACD;AAtcD,4CAscC;AAED;;;;;;;GAOG;AACH,SAAgB,gBAAgB,CAC/B,QAAW,EACX,MAAyB;IAEzB,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,CAAC,IAAI,CACR,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;QAC5B,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,CAAC;IACd,CAAC,CAAC,CACF,CAAC;IACF,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAC3C,CAAC;AAZD,4CAYC","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 {\n\tChangeFamily,\n\tChangeFamilyEditor,\n\tfindAncestor,\n\tGraphCommit,\n\tmintCommit,\n\tmintRevisionTag,\n\ttagChange,\n\tTaggedChange,\n\trebaseBranch,\n\tRevisionTag,\n\tfindCommonAncestor,\n\tmakeAnonChange,\n\tRevertible,\n\tRevertibleKind,\n\tRevertResult,\n\tDiscardResult,\n\tBranchRebaseResult,\n\trebaseChangeOverChanges,\n\ttagRollbackInverse,\n} from \"../core\";\nimport { EventEmitter, ISubscribable } from \"../events\";\nimport { fail } from \"../util\";\nimport { TransactionStack } from \"./transactionStack\";\n\n/**\n * Describes a change to a `SharedTreeBranch`. Various operations can mutate the head of the branch;\n * this change format describes each in terms of the \"removed commits\" (all commits which were present\n * on the branch before the operation but are no longer present after) and the \"new commits\" (all\n * commits which are present on the branch after the operation that were not present before). Each of\n * the following event types also provides a `change` which contains the net change to the branch\n * (or is undefined if there was no net change):\n * * Append - when one or more commits are appended to the head of the branch, for example via\n * a change applied by the branch's editor, or as a result of merging another branch into this one\n * * Remove - when one or more commits are removed from the head of the branch. This occurs\n * when a transaction is aborted and all commits pending in that transaction are removed.\n * * Replace - when an operation simultaneously removes and appends commits. For example, when this\n * branch is rebased and some commits are removed and replaced with rebased versions, or when a\n * transaction completes and all pending commits are replaced with a single squash commit.\n */\nexport type SharedTreeBranchChange<TChange> =\n\t| {\n\t\t\ttype: \"append\";\n\t\t\tchange: TaggedChange<TChange>;\n\t\t\tnewCommits: readonly GraphCommit<TChange>[];\n\t }\n\t| {\n\t\t\ttype: \"remove\";\n\t\t\tchange: TaggedChange<TChange> | undefined;\n\t\t\tremovedCommits: readonly GraphCommit<TChange>[];\n\t }\n\t| {\n\t\t\ttype: \"replace\";\n\t\t\tchange: TaggedChange<TChange> | undefined;\n\t\t\tremovedCommits: readonly GraphCommit<TChange>[];\n\t\t\tnewCommits: readonly GraphCommit<TChange>[];\n\t };\n\n/**\n * Returns the operation that caused the given {@link SharedTreeBranchChange}.\n */\nexport function getChangeReplaceType(\n\tchange: SharedTreeBranchChange<unknown> & { type: \"replace\" },\n): \"transactionCommit\" | \"rebase\" {\n\t// The \"replace\" variant of the change event is emitted by two operations: committing a transaction and doing a rebase.\n\t// Committing a transaction will always remove one or more commits (the commits that were squashed),\n\t// and will add exactly one new commit (the squash commit).\n\tif (change.removedCommits.length === 0 || change.newCommits.length !== 1) {\n\t\treturn \"rebase\";\n\t}\n\n\t// There is only one case in which a rebase both removes commits and adds exactly one new commit.\n\t// This occurs when there is exactly one divergent, but equivalent, commit on each branch:\n\t//\n\t// A ─ B (branch X)\t -- rebase Y onto X --> A ─ B (branch X)\n\t// └─ B' (branch Y) └─ (branch Y)\n\t//\n\t// B' is removed and replaced by B because both have the same revision.\n\tif (\n\t\tchange.removedCommits.length === 1 &&\n\t\tchange.removedCommits[0].revision === change.newCommits[0].revision\n\t) {\n\t\treturn \"rebase\";\n\t}\n\n\treturn \"transactionCommit\";\n}\n\n/**\n * The events emitted by a `SharedTreeBranch`\n */\nexport interface SharedTreeBranchEvents<TEditor extends ChangeFamilyEditor, TChange> {\n\t/**\n\t * Fired just before the head of this branch changes.\n\t * @param change - the change to this branch's state and commits\n\t */\n\tbeforeChange(change: SharedTreeBranchChange<TChange>): void;\n\n\t/**\n\t * Fired just after the head of this branch changes.\n\t * @param change - the change to this branch's state and commits\n\t */\n\tafterChange(change: SharedTreeBranchChange<TChange>): void;\n\n\t/**\n\t * Fired when a revertible change is made to this branch.\n\t */\n\trevertible(type: Revertible): void;\n\n\t/**\n\t * Fired when a revertible made on this branch is disposed.\n\t */\n\trevertibleDispose(revision: RevisionTag): void;\n\n\t/**\n\t * Fired when this branch forks\n\t * @param fork - the new branch that forked off of this branch\n\t */\n\tfork(fork: SharedTreeBranch<TEditor, TChange>): void;\n\n\t/**\n\t * Fired after this branch is disposed\n\t */\n\tdispose(): void;\n}\n\n/**\n * A branch of changes that can be applied to a SharedTree.\n */\nexport class SharedTreeBranch<TEditor extends ChangeFamilyEditor, TChange> extends EventEmitter<\n\tSharedTreeBranchEvents<TEditor, TChange>\n> {\n\tpublic readonly editor: TEditor;\n\t// set of revertibles maintained for automatic disposal\n\tprivate readonly revertibles = new Set<Revertible>();\n\tprivate readonly _revertibleCommits = new Map<RevisionTag, GraphCommit<TChange>>();\n\tprivate readonly transactions = new TransactionStack();\n\tprivate disposed = false;\n\t/**\n\t * Construct a new branch.\n\t * @param head - the head of the branch\n\t * @param changeFamily - determines the set of changes that this branch can commit\n\t */\n\tpublic constructor(\n\t\tprivate head: GraphCommit<TChange>,\n\t\tpublic readonly changeFamily: ChangeFamily<TEditor, TChange>,\n\t) {\n\t\tsuper();\n\t\tthis.editor = this.changeFamily.buildEditor((change) =>\n\t\t\tthis.apply(change, mintRevisionTag()),\n\t\t);\n\t}\n\n\t/**\n\t * Sets the head of this branch. Emits no change events.\n\t */\n\tpublic setHead(head: GraphCommit<TChange>): void {\n\t\tthis.assertNotDisposed();\n\t\tassert(!this.isTransacting(), 0x685 /* Cannot set head during a transaction */);\n\t\tthis.head = head;\n\t}\n\n\t/**\n\t * Apply a change to this branch.\n\t * @param change - the change to apply\n\t * @param revision - the revision of the new head commit of the branch that contains `change`\n\t * @returns the change that was applied and the new head commit of the branch\n\t */\n\tpublic apply(\n\t\tchange: TChange,\n\t\trevision: RevisionTag,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] {\n\t\treturn this.applyChange(change, revision, RevertibleKind.Default);\n\t}\n\n\tprivate applyChange(\n\t\tchange: TChange,\n\t\trevision: RevisionTag,\n\t\trevertibleKind: RevertibleKind,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] {\n\t\tthis.assertNotDisposed();\n\n\t\tconst newHead = mintCommit(this.head, {\n\t\t\trevision,\n\t\t\tchange,\n\t\t});\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"append\",\n\t\t\tchange: tagChange(change, revision),\n\t\t\tnewCommits: [newHead],\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newHead;\n\n\t\t// If this is not part of a transaction, emit a revertible event\n\t\tif (!this.isTransacting()) {\n\t\t\tthis.emit(\"revertible\", this.makeSharedTreeRevertible(newHead, revertibleKind));\n\t\t}\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, newHead];\n\t}\n\n\t/**\n\t * @returns the commit at the head of this branch.\n\t */\n\tpublic getHead(): GraphCommit<TChange> {\n\t\treturn this.head;\n\t}\n\n\t/**\n\t * Begin a transaction on this branch. If the transaction is committed via {@link commitTransaction},\n\t * all commits made since this call will be squashed into a single head commit.\n\t * @param repairStore - the repair store associated with this transaction\n\t */\n\tpublic startTransaction(): void {\n\t\tthis.assertNotDisposed();\n\t\tconst forks = new Set<SharedTreeBranch<TEditor, TChange>>();\n\t\tconst onDisposeUnSubscribes: (() => void)[] = [];\n\t\tconst onForkUnSubscribe = onForkTransitive(this, (fork) => {\n\t\t\tforks.add(fork);\n\t\t\tonDisposeUnSubscribes.push(fork.on(\"dispose\", () => forks.delete(fork)));\n\t\t});\n\t\tthis.transactions.push(this.head.revision, () => {\n\t\t\tforks.forEach((fork) => fork.dispose());\n\t\t\tonDisposeUnSubscribes.forEach((unsubscribe) => unsubscribe());\n\t\t\tonForkUnSubscribe();\n\t\t});\n\t\tthis.editor.enterTransaction();\n\t}\n\n\t/**\n\t * Commit the current transaction. There must be a transaction in progress that was begun via {@link startTransaction}.\n\t * If there are commits in the current transaction, they will be squashed into a new single head commit.\n\t * @returns the commits that were squashed and the new squash commit if a squash occurred, otherwise `undefined`.\n\t * @remarks If the transaction had no changes applied during its lifetime, then no squash occurs (i.e. this method is a no-op).\n\t * Even if the transaction contained only one change, it will still be replaced with an (equivalent) squash change.\n\t */\n\tpublic commitTransaction():\n\t\t| [squashedCommits: GraphCommit<TChange>[], newCommit: GraphCommit<TChange>]\n\t\t| undefined {\n\t\tthis.assertNotDisposed();\n\t\tconst [startCommit, commits] = this.popTransaction();\n\t\tthis.editor.exitTransaction();\n\n\t\tif (commits.length === 0) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// Anonymize the commits from this transaction by stripping their revision tags.\n\t\t// Otherwise, the change rebaser will record their tags and those tags no longer exist.\n\t\tconst anonymousCommits = commits.map(({ change }) => ({ change, revision: undefined }));\n\t\t// Squash the changes and make the squash commit the new head of this branch\n\t\tconst squashedChange = this.changeFamily.rebaser.compose(anonymousCommits);\n\t\tconst revision = mintRevisionTag();\n\n\t\tconst newHead = mintCommit(startCommit, {\n\t\t\trevision,\n\t\t\tchange: squashedChange,\n\t\t});\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"replace\",\n\t\t\tchange: undefined,\n\t\t\tremovedCommits: commits,\n\t\t\tnewCommits: [newHead],\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newHead;\n\n\t\t// If this transaction is not nested, emit a revertible event\n\t\tif (!this.isTransacting()) {\n\t\t\tthis.emit(\"revertible\", this.makeSharedTreeRevertible(newHead, RevertibleKind.Default));\n\t\t}\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [commits, newHead];\n\t}\n\n\t/**\n\t * Cancel the current transaction. There must be a transaction in progress that was begun via\n\t * {@link startTransaction}. All commits made during the transaction will be removed.\n\t * @returns the change to this branch resulting in the removal of the commits, and a list of the\n\t * commits that were removed.\n\t */\n\tpublic abortTransaction(): [\n\t\tchange: TChange | undefined,\n\t\tabortedCommits: GraphCommit<TChange>[],\n\t] {\n\t\tthis.assertNotDisposed();\n\t\tconst [startCommit, commits] = this.popTransaction();\n\t\tthis.editor.exitTransaction();\n\n\t\tif (commits.length === 0) {\n\t\t\treturn [undefined, []];\n\t\t}\n\n\t\tconst inverses: TaggedChange<TChange>[] = [];\n\t\tfor (let i = commits.length - 1; i >= 0; i--) {\n\t\t\tconst inverse = this.changeFamily.rebaser.invert(commits[i], false);\n\t\t\tinverses.push(tagRollbackInverse(inverse, mintRevisionTag(), commits[i].revision));\n\t\t}\n\t\tconst change =\n\t\t\tinverses.length > 0 ? this.changeFamily.rebaser.compose(inverses) : undefined;\n\n\t\tconst changeEvent = {\n\t\t\ttype: \"remove\",\n\t\t\tchange: change === undefined ? undefined : makeAnonChange(change),\n\t\t\tremovedCommits: commits,\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = startCommit;\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, commits];\n\t}\n\n\t/**\n\t * True iff this branch is in the middle of a transaction that was begin via {@link startTransaction}\n\t */\n\tpublic isTransacting(): boolean {\n\t\treturn this.transactions.size !== 0;\n\t}\n\n\tprivate popTransaction(): [GraphCommit<TChange>, GraphCommit<TChange>[]] {\n\t\tconst { startRevision } = this.transactions.pop();\n\t\tconst commits: GraphCommit<TChange>[] = [];\n\t\tconst startCommit = findAncestor([this.head, commits], (c) => c.revision === startRevision);\n\t\tassert(\n\t\t\tstartCommit !== undefined,\n\t\t\t0x593 /* Expected branch to be ahead of transaction start revision */,\n\t\t);\n\t\treturn [startCommit, commits];\n\t}\n\n\tpublic revertibleCommits(): IterableIterator<RevisionTag> {\n\t\treturn this._revertibleCommits.keys();\n\t}\n\n\t/**\n\t * Associate a revertible with a new commit of the same revision.\n\t * This is applicable when a commit is replaced by a rebase or a local commit is sequenced.\n\t */\n\tpublic updateRevertibleCommit(commit: GraphCommit<TChange>) {\n\t\tif (this._revertibleCommits.get(commit.revision) !== undefined) {\n\t\t\tthis._revertibleCommits.set(commit.revision, commit);\n\t\t}\n\t}\n\n\tprivate makeSharedTreeRevertible(\n\t\tcommit: GraphCommit<TChange>,\n\t\tkind: RevertibleKind,\n\t): Revertible {\n\t\tthis._revertibleCommits.set(commit.revision, commit);\n\t\tlet discarded = false;\n\t\tconst revertible = {\n\t\t\tkind,\n\t\t\torigin: {\n\t\t\t\t// This is currently always the case, but we may want to support reverting remote ops\n\t\t\t\tisLocal: true,\n\t\t\t},\n\t\t\trevert: () => {\n\t\t\t\tif (discarded) {\n\t\t\t\t\tfail(\"revertible has already been discarded\");\n\t\t\t\t}\n\t\t\t\tconst revertCommit = this.revert(commit.revision, kind);\n\t\t\t\tif (revertCommit !== undefined) {\n\t\t\t\t\trevertible.discard();\n\t\t\t\t\treturn RevertResult.Success;\n\t\t\t\t}\n\t\t\t\treturn RevertResult.Failure;\n\t\t\t},\n\t\t\tdiscard: () => {\n\t\t\t\tif (discarded) {\n\t\t\t\t\tfail(\"revertible has already been discarded\");\n\t\t\t\t}\n\t\t\t\t// TODO: delete the repair data from the forest\n\t\t\t\tthis._revertibleCommits.delete(commit.revision);\n\t\t\t\tthis.revertibles.delete(revertible);\n\t\t\t\tdiscarded = true;\n\t\t\t\tthis.emit(\"revertibleDispose\", commit.revision);\n\t\t\t\treturn DiscardResult.Success;\n\t\t\t},\n\t\t};\n\t\tthis.revertibles.add(revertible);\n\t\treturn revertible;\n\t}\n\n\tprivate revert(\n\t\trevision: RevisionTag,\n\t\trevertibleKind: RevertibleKind,\n\t): [change: TChange, newCommit: GraphCommit<TChange>] | undefined {\n\t\tassert(!this.isTransacting(), 0x7cb /* Undo is not yet supported during transactions */);\n\n\t\tconst commit = this._revertibleCommits.get(revision);\n\t\tassert(commit !== undefined, 0x7cc /* expected to find a revertible commit */);\n\n\t\tlet change = this.changeFamily.rebaser.invert(tagChange(commit.change, revision), false);\n\n\t\tconst headCommit = this.getHead();\n\t\t// Rebase the inverted change onto any commits that occurred after the undoable commits.\n\t\tif (revision !== headCommit.revision) {\n\t\t\tconst pathAfterUndoable: GraphCommit<TChange>[] = [];\n\t\t\tconst ancestor = findCommonAncestor([commit], [headCommit, pathAfterUndoable]);\n\t\t\tassert(\n\t\t\t\tancestor === commit,\n\t\t\t\t0x677 /* The head commit should be based off the undoable commit. */,\n\t\t\t);\n\t\t\tchange = rebaseChangeOverChanges(this.changeFamily.rebaser, change, pathAfterUndoable);\n\t\t}\n\n\t\treturn this.applyChange(\n\t\t\tchange,\n\t\t\tmintRevisionTag(),\n\t\t\trevertibleKind === RevertibleKind.Default || revertibleKind === RevertibleKind.Redo\n\t\t\t\t? RevertibleKind.Undo\n\t\t\t\t: RevertibleKind.Redo,\n\t\t);\n\t}\n\n\t/**\n\t * Spawn a new branch that is based off of the current state of this branch.\n\t * Changes made to the new branch will not be applied to this branch until the new branch is merged back in.\n\t *\n\t * @remarks Forks created during a transaction will be disposed when the transaction ends.\n\t */\n\tpublic fork(): SharedTreeBranch<TEditor, TChange> {\n\t\tthis.assertNotDisposed();\n\t\tconst fork = new SharedTreeBranch(this.head, this.changeFamily);\n\t\tthis.emit(\"fork\", fork);\n\t\treturn fork;\n\t}\n\n\t/**\n\t * Rebase the changes that have been applied to this branch over divergent changes in the given branch.\n\t * After this operation completes, this branch will be based off of `branch`.\n\t *\n\t * @remarks\n\t * This operation can change the relative ordering between revertible commits therefore, the revertible event\n\t * is not emitted during this operation.\n\t *\n\t * @param branch - the branch to rebase onto\n\t * @param upTo - the furthest commit on `branch` over which to rebase (inclusive). Defaults to the head commit of `branch`.\n\t * @returns the result of the rebase or undefined if nothing changed\n\t */\n\tpublic rebaseOnto(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t\tupTo = branch.getHead(),\n\t): BranchRebaseResult<TChange> | undefined {\n\t\tthis.assertNotDisposed();\n\n\t\t// Rebase this branch onto the given branch\n\t\tconst rebaseResult = this.rebaseBranch(this, branch, upTo);\n\t\tif (rebaseResult === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// The net change to this branch is provided by the `rebaseBranch` API\n\t\tconst { newSourceHead, commits } = rebaseResult;\n\t\tconst { deletedSourceCommits, targetCommits, sourceCommits } = commits;\n\n\t\t// It's possible that the target branch already contained some of the commits that\n\t\t// were on this branch. When that's the case, we adopt the commit objects from the target branch.\n\t\t// Because of that, we need to make sure that any revertibles that were based on the old commit objects\n\t\t// now point to the new object that were adopted from the target branch.\n\t\tfor (const targetCommit of targetCommits) {\n\t\t\tthis.updateRevertibleCommit(targetCommit);\n\t\t}\n\n\t\tconst newCommits = targetCommits.concat(sourceCommits);\n\t\tconst changeEvent = {\n\t\t\ttype: \"replace\",\n\t\t\tget change() {\n\t\t\t\tconst change = rebaseResult.sourceChange;\n\t\t\t\treturn change === undefined ? undefined : makeAnonChange(change);\n\t\t\t},\n\t\t\tremovedCommits: deletedSourceCommits,\n\t\t\tnewCommits,\n\t\t} as const;\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = newSourceHead;\n\n\t\t// update revertible commits that have been rebased\n\t\tsourceCommits.forEach((commit) => {\n\t\t\tthis.updateRevertibleCommit(commit);\n\t\t});\n\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn rebaseResult;\n\t}\n\n\t/**\n\t * Apply all the divergent changes on the given branch to this branch.\n\t *\n\t * @remarks\n\t * Revertible events are emitted for new local commits merged into this branch.\n\t *\n\t * @param branch - the branch to merge into this branch\n\t * @returns the net change to this branch and the commits that were added to this branch by the merge,\n\t * or undefined if nothing changed\n\t */\n\tpublic merge(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t): [change: TChange, newCommits: GraphCommit<TChange>[]] | undefined {\n\t\tthis.assertNotDisposed();\n\t\tbranch.assertNotDisposed();\n\t\tassert(\n\t\t\t!branch.isTransacting(),\n\t\t\t0x597 /* Branch may not be merged while transaction is in progress */,\n\t\t);\n\n\t\t// Rebase the given branch onto this branch\n\t\tconst rebaseResult = this.rebaseBranch(branch, this);\n\t\tif (rebaseResult === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\t// Compute the net change to this branch\n\t\tconst sourceCommits = rebaseResult.commits.sourceCommits;\n\t\tconst change = this.changeFamily.rebaser.compose(sourceCommits);\n\t\tconst taggedChange = makeAnonChange(change);\n\t\tconst changeEvent = {\n\t\t\ttype: \"append\",\n\t\t\tget change(): TaggedChange<TChange> {\n\t\t\t\treturn taggedChange;\n\t\t\t},\n\t\t\tnewCommits: sourceCommits,\n\t\t} as const;\n\n\t\tthis.emit(\"beforeChange\", changeEvent);\n\t\tthis.head = rebaseResult.newSourceHead;\n\t\tthis.emit(\"afterChange\", changeEvent);\n\t\treturn [change, sourceCommits];\n\t}\n\n\t/** Rebase `branchHead` onto `onto`, but return undefined if nothing changed */\n\tprivate rebaseBranch(\n\t\tbranch: SharedTreeBranch<TEditor, TChange>,\n\t\tonto: SharedTreeBranch<TEditor, TChange>,\n\t\tupTo = onto.getHead(),\n\t) {\n\t\tconst { head } = branch;\n\t\tif (head === upTo) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst rebaseResult = rebaseBranch(this.changeFamily.rebaser, head, upTo, onto.getHead());\n\t\tif (this.head === rebaseResult.newSourceHead) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn rebaseResult;\n\t}\n\n\t/**\n\t * Dispose this branch, freezing its state.\n\t *\n\t * @remarks\n\t * Attempts to further mutate the branch will error.\n\t * Any transactions in progress will be aborted.\n\t * Calling dispose more than once has no effect.\n\t */\n\tpublic dispose(): void {\n\t\tif (this.disposed) {\n\t\t\treturn;\n\t\t}\n\n\t\twhile (this.isTransacting()) {\n\t\t\tthis.abortTransaction();\n\t\t}\n\n\t\tthis.revertibles.forEach((revertible) => revertible.discard());\n\n\t\tthis.disposed = true;\n\t\tthis.emit(\"dispose\");\n\t}\n\n\tprivate assertNotDisposed(): void {\n\t\tassert(!this.disposed, 0x66e /* Branch is disposed */);\n\t}\n}\n\n/**\n * Registers an event listener that fires when the given forkable object forks.\n * The listener will also fire when any of those forks fork, and when those forks of forks fork, and so on.\n * @param forkable - an object that emits an event when it is forked\n * @param onFork - the fork event listener\n * @returns a function which when called will deregister all registrations (including transitive) created by this function.\n * The deregister function has undefined behavior if called more than once.\n */\nexport function onForkTransitive<T extends ISubscribable<{ fork: (t: T) => void }>>(\n\tforkable: T,\n\tonFork: (fork: T) => void,\n): () => void {\n\tconst offs: (() => void)[] = [];\n\toffs.push(\n\t\tforkable.on(\"fork\", (fork) => {\n\t\t\toffs.push(onForkTransitive(fork, onFork));\n\t\t\tonFork(fork);\n\t\t}),\n\t);\n\treturn () => offs.forEach((off) => off());\n}\n"]}

package/dist/shared-tree-core/editManager.d.ts ADDED Viewed

@@ -0,0 +1,126 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { RecursiveReadonly } from "../util";
+import { ChangeFamily, ChangeFamilyEditor, GraphCommit, RevisionTag, SessionId } from "../core";
+import { SharedTreeBranch } from "./branch";
+import { Commit, SeqNumber, SequencedCommit, SummarySessionBranch } from "./editManagerFormat";
+export declare const minimumPossibleSequenceNumber: SeqNumber;
+/**
+ * Represents a local branch of a document and interprets the effect on the document of adding sequenced changes,
+ * which were based on a given session's branch, to the document history
+ */
+export declare class EditManager<TEditor extends ChangeFamilyEditor, TChangeset, TChangeFamily extends ChangeFamily<TEditor, TChangeset>> {
+    readonly changeFamily: TChangeFamily;
+    readonly localSessionId: SessionId;
+    /** The "trunk" branch. The trunk represents the list of received sequenced changes. */
+    private readonly trunk;
+    /**
+     * Records extra data associated with commits in the {@link trunk}.
+     * This does not include an entry for the {@link trunkBase}.
+     */
+    private readonly trunkMetadata;
+    /**
+     * A map from a sequence id to the commit in the {@link trunk} which has that sequence id.
+     * This also includes an entry for the {@link trunkBase} which always has the lowest key in the map.
+     */
+    private readonly sequenceMap;
+    /**
+     * Branches are maintained to represent the local change list that the issuing client had
+     * at the time of submitting the latest known edit on the branch.
+     * This means the head commit of each branch is always in its original (non-rebased) form.
+     */
+    private readonly peerLocalBranches;
+    /**
+     * This branch holds the changes made by this client which have not yet been confirmed as sequenced changes.
+     */
+    readonly localBranch: SharedTreeBranch<TEditor, TChangeset>;
+    /**
+     * Tracks where on the trunk all registered branches are based. Each key is the sequence id of a commit on
+     * the trunk, and the value is the set of all branches who have that commit as their common ancestor with the trunk.
+     */
+    private readonly trunkBranches;
+    /**
+     * The sequence number of the newest commit on the trunk that has been received by all peers.
+     * Defaults to {@link minimumPossibleSequenceNumber} if no commits have been received.
+     *
+     * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+     */
+    private minimumSequenceNumber;
+    /**
+     * The sequence ID corresponding to the oldest revertible commit owned by the local branch. This is used
+     * to prevent the trunk from trimming this commit or commits after it as they're needed for undo.
+     */
+    private _oldestRevertibleSequenceId?;
+    /**
+     * A special commit that is a "base" (tail) of the trunk, though not part of the trunk itself.
+     * This makes it possible to model the trunk in the same way as any other branch (it branches off of a base commit)
+     * which allows it to use branching APIs to interact with the other branches.
+     * Each time trunk eviction occurs, the most recent evicted commit becomes the new `trunkBase`.
+     */
+    private trunkBase;
+    /**
+     * @param changeFamily - the change family of changes on the trunk and local branch
+     * @param localSessionId - the id of the local session that will be used for local commits
+     */
+    constructor(changeFamily: TChangeFamily, localSessionId: SessionId);
+    /**
+     * Make the given branch known to the `EditManager`. The `EditManager` will ensure that all registered
+     * branches remain usable even as the minimum sequence number advances.
+     */
+    private registerBranch;
+    /**
+     * Returns the sequence id of the oldest sequenced revertible commit on the local branch.
+     *
+     * TODO: may be more performant to maintain the oldest revertible on the branches themselves
+     * this should be tested and revisited once branches are supported
+     */
+    private getOldestRevertibleSequenceId;
+    private onRevertibleDisposed;
+    /**
+     * Advances the minimum sequence number, and removes all commits from the trunk which lie outside the collaboration window.
+     * @param minimumSequenceNumber - the sequence number of the newest commit that all peers (including this one) have received and applied to their trunks.
+     *
+     * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+     */
+    advanceMinimumSequenceNumber(minimumSequenceNumber: SeqNumber): void;
+    /**
+     * Examines the latest known minimum sequence number and the trunk bases of any registered branches to determine
+     * if any commits on the trunk are unreferenced and unneeded for future computation; those found are evicted from the trunk.
+     * @returns the number of commits that were removed from the trunk
+     */
+    private trimTrunk;
+    isEmpty(): boolean;
+    getSummaryData(): SummaryData<TChangeset>;
+    loadSummaryData(data: SummaryData<TChangeset>): void;
+    getTrunkChanges(): readonly RecursiveReadonly<TChangeset>[];
+    getTrunkHead(): GraphCommit<TChangeset>;
+    getLocalChanges(): readonly RecursiveReadonly<TChangeset>[];
+    /**
+     * @returns The length of the longest branch maintained by this EditManager.
+     * This may be the length of a peer branch or the local branch.
+     * The length is counted from the lowest common ancestor with the trunk such that a fully sequenced branch would
+     * have length zero.
+     */
+    getLongestBranchLength(): number;
+    addSequencedChange(newCommit: Commit<TChangeset>, sequenceNumber: SeqNumber, referenceSequenceNumber: SeqNumber): void;
+    findLocalCommit(revision: RevisionTag): [commit: GraphCommit<TChangeset>, commitsAfter: GraphCommit<TChangeset>[]];
+    private pushToTrunk;
+    /**
+     * Finds the most recent trunk commit that was sequenced at or before the given point.
+     * @param searchBy - the sequence number or the sequence id to search for
+     * @remarks Fails if there is no eligible commit.
+     * @returns the closest commit and its sequence id
+     */
+    private getClosestTrunkCommit;
+    private getBatch;
+}
+/**
+ * The in-memory data that summaries contain
+ */
+export interface SummaryData<TChangeset> {
+    readonly trunk: readonly SequencedCommit<TChangeset>[];
+    readonly branches: ReadonlyMap<SessionId, SummarySessionBranch<TChangeset>>;
+}
+//# sourceMappingURL=editManager.d.ts.map

package/dist/shared-tree-core/editManager.d.ts.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"editManager.d.ts","sourceRoot":"","sources":["../../src/shared-tree-core/editManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAkD,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAC5F,OAAO,EAEN,YAAY,EACZ,kBAAkB,EAGlB,WAAW,EAGX,WAAW,EACX,SAAS,EACT,MAAM,SAAS,CAAC;AACjB,OAAO,EAA0C,gBAAgB,EAAE,MAAM,UAAU,CAAC;AACpF,OAAO,EACN,MAAM,EACN,SAAS,EAKT,eAAe,EACf,oBAAoB,EAGpB,MAAM,qBAAqB,CAAC;AAE7B,eAAO,MAAM,6BAA6B,EAAE,SAA0C,CAAC;AAKvF;;;GAGG;AAEH,qBAAa,WAAW,CACvB,OAAO,SAAS,kBAAkB,EAClC,UAAU,EACV,aAAa,SAAS,YAAY,CAAC,OAAO,EAAE,UAAU,CAAC;aAwEtC,YAAY,EAAE,aAAa;aAE3B,cAAc,EAAE,SAAS;IAxE1C,uFAAuF;IACvF,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;IAE9D;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAG1B;IACJ;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,WAAW,CAG1B;IAEF;;;;OAIG;IAEH,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CACvB;IAEX;;OAEG;IACH,SAAgB,WAAW,EAAE,gBAAgB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IAEnE;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,aAAa,CAGK;IAEnC;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB,CAAiC;IAE9D;;;OAGG;IACH,OAAO,CAAC,2BAA2B,CAAC,CAAa;IAEjD;;;;;OAKG;IACH,OAAO,CAAC,SAAS,CAA0B;IAE3C;;;OAGG;gBAEc,YAAY,EAAE,aAAa,EAE3B,cAAc,EAAE,SAAS;IAkB1C;;;OAGG;IACH,OAAO,CAAC,cAAc;IA+CtB;;;;;OAKG;IACH,OAAO,CAAC,6BAA6B;IAmBrC,OAAO,CAAC,oBAAoB;IAe5B;;;;;OAKG;IACI,4BAA4B,CAAC,qBAAqB,EAAE,SAAS,GAAG,IAAI;IAc3E;;;;OAIG;IACH,OAAO,CAAC,SAAS;IAoGV,OAAO,IAAI,OAAO;IASlB,cAAc,IAAI,WAAW,CAAC,UAAU,CAAC;IAwDzC,eAAe,CAAC,IAAI,EAAE,WAAW,CAAC,UAAU,CAAC,GAAG,IAAI;IA6CpD,eAAe,IAAI,SAAS,iBAAiB,CAAC,UAAU,CAAC,EAAE;IAI3D,YAAY,IAAI,WAAW,CAAC,UAAU,CAAC;IAIvC,eAAe,IAAI,SAAS,iBAAiB,CAAC,UAAU,CAAC,EAAE;IAMlE;;;;;OAKG;IACI,sBAAsB,IAAI,MAAM;IAahC,kBAAkB,CACxB,SAAS,EAAE,MAAM,CAAC,UAAU,CAAC,EAC7B,cAAc,EAAE,SAAS,EACzB,uBAAuB,EAAE,SAAS,GAChC,IAAI;IAuEA,eAAe,CACrB,QAAQ,EAAE,WAAW,GACnB,CAAC,MAAM,EAAE,WAAW,CAAC,UAAU,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC;IAU7E,OAAO,CAAC,WAAW;IASnB;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAqB7B,OAAO,CAAC,QAAQ;CAUhB;AAED;;GAEG;AACH,MAAM,WAAW,WAAW,CAAC,UAAU;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC;IACvD,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,SAAS,EAAE,oBAAoB,CAAC,UAAU,CAAC,CAAC,CAAC;CAC5E"}

package/dist/shared-tree-core/editManager.js ADDED Viewed

@@ -0,0 +1,435 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EditManager = exports.minimumPossibleSequenceNumber = void 0;
+const sorted_btree_1 = __importDefault(require("sorted-btree"));
+const core_utils_1 = require("@fluidframework/core-utils");
+const util_1 = require("../util");
+const core_1 = require("../core");
+const branch_1 = require("./branch");
+const editManagerFormat_1 = require("./editManagerFormat");
+exports.minimumPossibleSequenceNumber = (0, util_1.brand)(Number.MIN_SAFE_INTEGER);
+const minimumPossibleSequenceId = {
+    sequenceNumber: exports.minimumPossibleSequenceNumber,
+};
+/**
+ * Represents a local branch of a document and interprets the effect on the document of adding sequenced changes,
+ * which were based on a given session's branch, to the document history
+ */
+// TODO: Try to reduce this to a single type parameter
+class EditManager {
+    /**
+     * @param changeFamily - the change family of changes on the trunk and local branch
+     * @param localSessionId - the id of the local session that will be used for local commits
+     */
+    constructor(changeFamily,
+    // TODO: Change this type to be the Session ID type provided by the IdCompressor when available.
+    localSessionId) {
+        this.changeFamily = changeFamily;
+        this.localSessionId = localSessionId;
+        /**
+         * Records extra data associated with commits in the {@link trunk}.
+         * This does not include an entry for the {@link trunkBase}.
+         */
+        this.trunkMetadata = new Map();
+        /**
+         * A map from a sequence id to the commit in the {@link trunk} which has that sequence id.
+         * This also includes an entry for the {@link trunkBase} which always has the lowest key in the map.
+         */
+        this.sequenceMap = new sorted_btree_1.default(undefined, editManagerFormat_1.sequenceIdComparator);
+        /**
+         * Branches are maintained to represent the local change list that the issuing client had
+         * at the time of submitting the latest known edit on the branch.
+         * This means the head commit of each branch is always in its original (non-rebased) form.
+         */
+        // TODO:#4593: Add test to ensure that peer branches are never initialized with a repairDataStoreProvider
+        this.peerLocalBranches = new Map();
+        /**
+         * Tracks where on the trunk all registered branches are based. Each key is the sequence id of a commit on
+         * the trunk, and the value is the set of all branches who have that commit as their common ancestor with the trunk.
+         */
+        this.trunkBranches = new sorted_btree_1.default(undefined, editManagerFormat_1.sequenceIdComparator);
+        /**
+         * The sequence number of the newest commit on the trunk that has been received by all peers.
+         * Defaults to {@link minimumPossibleSequenceNumber} if no commits have been received.
+         *
+         * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+         */
+        this.minimumSequenceNumber = exports.minimumPossibleSequenceNumber;
+        this.trunkBase = {
+            revision: (0, core_1.assertIsRevisionTag)("00000000-0000-4000-8000-000000000000"),
+            change: changeFamily.rebaser.compose([]),
+        };
+        this.sequenceMap.set(minimumPossibleSequenceId, this.trunkBase);
+        this.trunk = new branch_1.SharedTreeBranch(this.trunkBase, changeFamily);
+        this.localBranch = new branch_1.SharedTreeBranch(this.trunk.getHead(), changeFamily);
+        this.localBranch.on("revertibleDispose", this.onRevertibleDisposed());
+        // Track all forks of the local branch for purposes of trunk eviction. Unlike the local branch, they have
+        // an unknown lifetime and rebase frequency, so we can not make any assumptions about which trunk commits
+        // they require and therefore we monitor them explicitly.
+        (0, branch_1.onForkTransitive)(this.localBranch, (fork) => this.registerBranch(fork));
+    }
+    /**
+     * Make the given branch known to the `EditManager`. The `EditManager` will ensure that all registered
+     * branches remain usable even as the minimum sequence number advances.
+     */
+    registerBranch(branch) {
+        const trackBranch = (b) => {
+            const trunkCommit = (0, core_1.findCommonAncestor)(this.trunk.getHead(), b.getHead()) ??
+                (0, util_1.fail)("Expected branch to be related to trunk");
+            const sequenceId = this.trunkMetadata.get(trunkCommit.revision)?.sequenceId ??
+                minimumPossibleSequenceId;
+            const branches = (0, util_1.getOrCreate)(this.trunkBranches, sequenceId, () => new Set());
+            (0, core_utils_1.assert)(!branches.has(b), 0x670 /* Branch was registered more than once */);
+            branches.add(b);
+            return sequenceId;
+        };
+        const untrackBranch = (b, sequenceId) => {
+            const branches = this.trunkBranches.get(sequenceId) ?? (0, util_1.fail)("Expected branch to be tracked");
+            (0, core_utils_1.assert)(branches.delete(b), 0x671 /* Expected branch to be tracked */);
+            if (branches.size === 0) {
+                this.trunkBranches.delete(sequenceId);
+            }
+        };
+        // Record the sequence id of the branch's base commit on the trunk
+        const trunkBase = { sequenceId: trackBranch(branch) };
+        // Whenever the branch is rebased, update our record of its base trunk commit
+        const offRebase = branch.on("afterChange", (args) => {
+            if (args.type === "replace" && (0, branch_1.getChangeReplaceType)(args) === "rebase") {
+                untrackBranch(branch, trunkBase.sequenceId);
+                trunkBase.sequenceId = trackBranch(branch);
+                this.trimTrunk();
+            }
+        });
+        // When the branch is disposed, update our branch set and trim the trunk
+        const offDispose = branch.on("dispose", () => {
+            untrackBranch(branch, trunkBase.sequenceId);
+            this.trimTrunk();
+            offRebase();
+            offDispose();
+        });
+    }
+    /**
+     * Returns the sequence id of the oldest sequenced revertible commit on the local branch.
+     *
+     * TODO: may be more performant to maintain the oldest revertible on the branches themselves
+     * this should be tested and revisited once branches are supported
+     */
+    getOldestRevertibleSequenceId() {
+        if (this._oldestRevertibleSequenceId === undefined) {
+            let oldest;
+            for (const revision of this.localBranch.revertibleCommits()) {
+                if (oldest === undefined) {
+                    oldest = this.trunkMetadata.get(revision)?.sequenceId;
+                }
+                else {
+                    const current = this.trunkMetadata.get(revision)?.sequenceId;
+                    if (current !== undefined) {
+                        oldest = (0, editManagerFormat_1.minSequenceId)(oldest, current);
+                    }
+                }
+            }
+            this._oldestRevertibleSequenceId = oldest;
+        }
+        return this._oldestRevertibleSequenceId;
+    }
+    onRevertibleDisposed() {
+        return (revision) => {
+            const metadata = this.trunkMetadata.get(revision);
+            // if this revision hasn't been sequenced, it won't be evicted
+            if (metadata !== undefined) {
+                const { sequenceId: id } = metadata;
+                // if this revision corresponds with the current oldest revertible sequence id, replace it with the new oldest
+                if (id === this._oldestRevertibleSequenceId) {
+                    this._oldestRevertibleSequenceId = undefined;
+                }
+            }
+        };
+    }
+    /**
+     * Advances the minimum sequence number, and removes all commits from the trunk which lie outside the collaboration window.
+     * @param minimumSequenceNumber - the sequence number of the newest commit that all peers (including this one) have received and applied to their trunks.
+     *
+     * @remarks If there are more than one commit with the same sequence number we assume this refers to the last commit in the batch.
+     */
+    advanceMinimumSequenceNumber(minimumSequenceNumber) {
+        if (minimumSequenceNumber === this.minimumSequenceNumber) {
+            return;
+        }
+        (0, core_utils_1.assert)(minimumSequenceNumber > this.minimumSequenceNumber, 0x476 /* number must be larger or equal to current minimumSequenceNumber. */);
+        this.minimumSequenceNumber = minimumSequenceNumber;
+        this.trimTrunk();
+    }
+    /**
+     * Examines the latest known minimum sequence number and the trunk bases of any registered branches to determine
+     * if any commits on the trunk are unreferenced and unneeded for future computation; those found are evicted from the trunk.
+     * @returns the number of commits that were removed from the trunk
+     */
+    trimTrunk() {
+        /** The sequence id of the oldest commit on the trunk that will be retained */
+        let trunkTailSequenceId = {
+            sequenceNumber: this.minimumSequenceNumber,
+            indexInBatch: Number.POSITIVE_INFINITY,
+        };
+        // If there are any outstanding registered branches, get the one that is the oldest (has the "most behind" trunk base)
+        const minimumBranchBaseSequenceId = this.trunkBranches.minKey();
+        if (minimumBranchBaseSequenceId !== undefined) {
+            // If that branch is behind the minimum sequence id, we only want to evict commits older than it,
+            // even if those commits are behind the minimum sequence id
+            const sequenceIdBeforeMinimumBranchBase = (0, editManagerFormat_1.decrementSequenceId)(minimumBranchBaseSequenceId);
+            trunkTailSequenceId = (0, editManagerFormat_1.minSequenceId)(trunkTailSequenceId, sequenceIdBeforeMinimumBranchBase);
+        }
+        // TODO get the oldest revertible sequence id from all registered branches, not just the local branch
+        const oldestRevertibleSequenceId = this.getOldestRevertibleSequenceId();
+        if (oldestRevertibleSequenceId !== undefined) {
+            // use a smaller sequence number so that the oldest revertible is not trimmed
+            const sequenceIdBeforeOldestRevertible = (0, editManagerFormat_1.decrementSequenceId)(oldestRevertibleSequenceId);
+            trunkTailSequenceId = (0, editManagerFormat_1.minSequenceId)(trunkTailSequenceId, sequenceIdBeforeOldestRevertible);
+        }
+        const [sequenceId, latestEvicted] = this.getClosestTrunkCommit((0, editManagerFormat_1.maxSequenceId)(trunkTailSequenceId, this.sequenceMap.minKey() ?? minimumPossibleSequenceId));
+        // Don't do any work if the commit found by the search is already the tail of the trunk
+        if (latestEvicted !== this.trunkBase) {
+            // The minimum sequence number informs us that all peer branches are at least caught up to the tail commit,
+            // so rebase them accordingly. This is necessary to prevent peer branches from referencing any evicted commits.
+            for (const [, branch] of this.peerLocalBranches) {
+                branch.rebaseOnto(this.trunk, latestEvicted);
+            }
+            // This mutation is a performance hack. If commits are truly immutable, then changing the trunk's tail requires
+            // regenerating the entire commit graph. Instead, we can simply chop off the tail like this if we're certain
+            // that there are no outstanding references to any of the commits being removed (other than the references via
+            // the trunk). The peer branches have been rebased to the head of the trunk, the local branch is already rebased
+            // to the head of the trunk, and all other branches are tracked by `trunkBranches` and known to be ahead of or at
+            // `newTrunkBase`. Therefore, no branches should have unique references to any of the commits being evicted here.
+            // We mutate the most recent of the evicted commits to become the new trunk base. That way, any other commits that
+            // have parent pointers to the latest evicted commit will stay linked, even though that it is no longer part of the trunk.
+            const newTrunkBase = latestEvicted;
+            // The metadata for new trunk base revision needs to be deleted before modifying it.
+            this.trunkMetadata.delete(newTrunkBase.revision);
+            // Copying the revision of the old trunk base into the new trunk base means we don't need to write out the original
+            // revision to summaries. All clients agree that the trunk base always has the same hardcoded revision.
+            newTrunkBase.revision = this.trunkBase.revision;
+            // Overwriting the change is not strictly necessary, but done here for consistency (so all trunk bases are deeply equal).
+            newTrunkBase.change = this.trunkBase.change;
+            // Dropping the parent field removes (transitively) all references to the evicted commits so they can be garbage collected.
+            delete newTrunkBase.parent;
+            this.trunkBase = newTrunkBase;
+            // Update any state that is derived from trunk commits
+            this.sequenceMap.editRange(minimumPossibleSequenceId, sequenceId, true, (s, { revision }) => {
+                // Cleanup look-aside data for each evicted commit
+                this.trunkMetadata.delete(revision);
+                // Delete all evicted commits from `sequenceMap` except for the latest one, which is the new `trunkBase`
+                if ((0, editManagerFormat_1.equalSequenceIds)(s, sequenceId)) {
+                    (0, core_utils_1.assert)(revision === newTrunkBase.revision, 0x729 /* Expected last evicted commit to be new trunk base */);
+                }
+                else {
+                    return { delete: true };
+                }
+            });
+            const trunkSize = getPathFromBase(this.trunk.getHead(), this.trunkBase).length;
+            (0, core_utils_1.assert)(this.sequenceMap.size === trunkSize + 1, 0x744 /* The size of the sequenceMap must have one element more than the trunk */);
+            (0, core_utils_1.assert)(this.trunkMetadata.size === trunkSize, 0x745 /* The size of the trunkMetadata must be the same as the trunk */);
+        }
+    }
+    isEmpty() {
+        return (this.trunk.getHead() === this.trunkBase &&
+            this.peerLocalBranches.size === 0 &&
+            this.localBranch.getHead() === this.trunk.getHead() &&
+            this.minimumSequenceNumber === exports.minimumPossibleSequenceNumber);
+    }
+    getSummaryData() {
+        // The assert below is acceptable at present because summarization only ever occurs on a client with no
+        // local/in-flight changes.
+        // In the future we may wish to relax this constraint. For that to work, the current implementation of
+        // `EditManager` would have to be amended in one of two ways:
+        // A) Changes made by the local session should be represented by a branch in `EditManager.branches`.
+        // B) The contents of such a branch should be computed on demand based on the trunk.
+        // Note that option (A) would be a simple change to `addSequencedChange` whereas (B) would likely require
+        // rebasing trunk changes over the inverse of trunk changes.
+        (0, core_utils_1.assert)(this.localBranch.getHead() === this.trunk.getHead(), 0x428 /* Clients with local changes cannot be used to generate summaries */);
+        const trunk = getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => {
+            const metadata = this.trunkMetadata.get(c.revision) ?? (0, util_1.fail)("Expected metadata for trunk commit");
+            const commit = {
+                change: c.change,
+                revision: c.revision,
+                sequenceNumber: metadata.sequenceId.sequenceNumber,
+                sessionId: metadata.sessionId,
+            };
+            if (metadata.sequenceId.indexInBatch !== undefined) {
+                commit.indexInBatch = metadata.sequenceId.indexInBatch;
+            }
+            return commit;
+        });
+        const branches = new Map((0, util_1.mapIterable)(this.peerLocalBranches.entries(), ([sessionId, branch]) => {
+            const branchPath = [];
+            const ancestor = (0, core_1.findCommonAncestor)([branch.getHead(), branchPath], this.trunk.getHead()) ??
+                (0, util_1.fail)("Expected branch to be based on trunk");
+            return [
+                sessionId,
+                {
+                    base: ancestor.revision,
+                    commits: branchPath.map((c) => {
+                        const commit = {
+                            change: c.change,
+                            revision: c.revision,
+                            sessionId,
+                        };
+                        return commit;
+                    }),
+                },
+            ];
+        }));
+        return { trunk, branches };
+    }
+    loadSummaryData(data) {
+        (0, core_utils_1.assert)(this.isEmpty(), 0x68a /* Attempted to load from summary after edit manager was already mutated */);
+        // Record the tags of each trunk commit as we generate the trunk so they can be looked up quickly
+        // when hydrating the peer branches below
+        const trunkRevisionCache = new Map();
+        trunkRevisionCache.set(this.trunkBase.revision, this.trunkBase);
+        this.trunk.setHead(data.trunk.reduce((base, c) => {
+            const sequenceId = c.indexInBatch === undefined
+                ? {
+                    sequenceNumber: c.sequenceNumber,
+                }
+                : {
+                    sequenceNumber: c.sequenceNumber,
+                    indexInBatch: c.indexInBatch,
+                };
+            const commit = (0, core_1.mintCommit)(base, c);
+            this.sequenceMap.set(sequenceId, commit);
+            this.trunkMetadata.set(c.revision, {
+                sequenceId,
+                sessionId: c.sessionId,
+            });
+            trunkRevisionCache.set(c.revision, commit);
+            return commit;
+        }, this.trunkBase));
+        this.localBranch.setHead(this.trunk.getHead());
+        for (const [sessionId, branch] of data.branches) {
+            const commit = trunkRevisionCache.get(branch.base) ??
+                (0, util_1.fail)("Expected summary branch to be based off of a revision in the trunk");
+            this.peerLocalBranches.set(sessionId, new branch_1.SharedTreeBranch(branch.commits.reduce(core_1.mintCommit, commit), this.changeFamily));
+        }
+    }
+    getTrunkChanges() {
+        return getPathFromBase(this.trunk.getHead(), this.trunkBase).map((c) => c.change);
+    }
+    getTrunkHead() {
+        return this.trunk.getHead();
+    }
+    getLocalChanges() {
+        return getPathFromBase(this.localBranch.getHead(), this.trunk.getHead()).map((c) => c.change);
+    }
+    /**
+     * @returns The length of the longest branch maintained by this EditManager.
+     * This may be the length of a peer branch or the local branch.
+     * The length is counted from the lowest common ancestor with the trunk such that a fully sequenced branch would
+     * have length zero.
+     */
+    getLongestBranchLength() {
+        let max = 0;
+        const trunkHead = this.trunk.getHead();
+        for (const branch of this.peerLocalBranches.values()) {
+            const branchPath = getPathFromBase(branch.getHead(), trunkHead);
+            if (branchPath.length > max) {
+                max = branchPath.length;
+            }
+        }
+        const localPath = getPathFromBase(this.localBranch.getHead(), trunkHead);
+        return Math.max(max, localPath.length);
+    }
+    addSequencedChange(newCommit, sequenceNumber, referenceSequenceNumber) {
+        (0, core_utils_1.assert)(sequenceNumber > this.minimumSequenceNumber, 0x713 /* Expected change sequence number to exceed the last known minimum sequence number */);
+        const commitsSequenceNumber = this.getBatch(sequenceNumber);
+        const sequenceId = commitsSequenceNumber.length === 0
+            ? {
+                sequenceNumber,
+            }
+            : {
+                sequenceNumber,
+                indexInBatch: commitsSequenceNumber.length,
+            };
+        if (newCommit.sessionId === this.localSessionId) {
+            const [firstLocalCommit] = getPathFromBase(this.localBranch.getHead(), this.trunk.getHead());
+            (0, core_utils_1.assert)(firstLocalCommit !== undefined, 0x6b5 /* Received a sequenced change from the local session despite having no local changes */);
+            // The first local branch commit is already rebased over the trunk, so we can push it directly to the trunk.
+            this.pushToTrunk(sequenceId, { ...firstLocalCommit, sessionId: this.localSessionId }, true);
+            this.localBranch.rebaseOnto(this.trunk);
+            return;
+        }
+        // Get the revision that the remote change is based on
+        const [, baseRevisionInTrunk] = this.getClosestTrunkCommit(referenceSequenceNumber);
+        // Rebase that branch over the part of the trunk up to the base revision
+        // This will be a no-op if the sending client has not advanced since the last time we received an edit from it
+        const peerLocalBranch = (0, util_1.getOrCreate)(this.peerLocalBranches, newCommit.sessionId, () => new branch_1.SharedTreeBranch(baseRevisionInTrunk, this.changeFamily));
+        peerLocalBranch.rebaseOnto(this.trunk, baseRevisionInTrunk);
+        if (peerLocalBranch.getHead() === this.trunk.getHead()) {
+            // If the branch is fully caught up and empty after being rebased, then push to the trunk directly
+            this.pushToTrunk(sequenceId, newCommit);
+            peerLocalBranch.setHead(this.trunk.getHead());
+        }
+        else {
+            // Otherwise, rebase the change over the trunk and append it, and append the original change to the peer branch.
+            const newChangeFullyRebased = (0, core_1.rebaseChange)(this.changeFamily.rebaser, newCommit.change, peerLocalBranch.getHead(), this.trunk.getHead());
+            peerLocalBranch.apply(newCommit.change, newCommit.revision);
+            this.pushToTrunk(sequenceId, {
+                ...newCommit,
+                change: newChangeFullyRebased,
+            });
+        }
+        this.localBranch.rebaseOnto(this.trunk);
+    }
+    findLocalCommit(revision) {
+        const commits = [];
+        const commit = (0, core_1.findAncestor)([this.localBranch.getHead(), commits], (c) => c.revision === revision);
+        (0, core_utils_1.assert)(commit !== undefined, 0x599 /* Expected local branch to contain revision */);
+        return [commit, commits];
+    }
+    pushToTrunk(sequenceId, commit, local = false) {
+        const mintedCommit = (0, core_1.mintCommit)(this.trunk.getHead(), commit);
+        this.trunk.setHead(mintedCommit);
+        this.localBranch.updateRevertibleCommit(mintedCommit);
+        const trunkHead = this.trunk.getHead();
+        this.sequenceMap.set(sequenceId, trunkHead);
+        this.trunkMetadata.set(trunkHead.revision, { sequenceId, sessionId: commit.sessionId });
+    }
+    getClosestTrunkCommit(searchBy) {
+        const sequenceId = typeof searchBy === "number"
+            ? {
+                // This is to make sure that the correct commit is selected in this 2 scenarios:
+                // 1) The commit is unique for that sequence number
+                // 2) There are more than one commit for the same sequence number, in this case we need to select the last one.
+                sequenceNumber: searchBy,
+                indexInBatch: Number.POSITIVE_INFINITY,
+            }
+            : searchBy;
+        const commit = this.sequenceMap.getPairOrNextLower(sequenceId);
+        (0, core_utils_1.assert)(commit !== undefined, 0x746 /* sequence id has been evicted */);
+        return commit;
+    }
+    getBatch(sequenceNumber) {
+        const startSequenceId = {
+            sequenceNumber,
+        };
+        const endSequenceId = {
+            sequenceNumber: (0, util_1.brand)(sequenceNumber + 1),
+        };
+        return this.sequenceMap.getRange(startSequenceId, endSequenceId, false);
+    }
+}
+exports.EditManager = EditManager;
+/**
+ * @returns the path from the base of a branch to its head
+ */
+function getPathFromBase(branchHead, baseBranchHead) {
+    const path = [];
+    (0, core_utils_1.assert)((0, core_1.findCommonAncestor)([branchHead, path], baseBranchHead) !== undefined, 0x573 /* Expected branches to be related */);
+    return path;
+}
+//# sourceMappingURL=editManager.js.map