@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/shared-tree-core/edit-manager/editManagerPerf.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerPerf.test.js","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerPerf.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAG1C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EACN,UAAU,EACV,4BAA4B,EAC5B,4BAA4B,EAC5B,iBAAiB,GACjB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EACN,4BAA4B,EAC5B,sCAAsC,EACtC,8BAA8B,EAC9B,6BAA6B,GAC7B,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,MAAM,KAAK,GAAc,GAAgB,CAAC;AAC1C,MAAM,KAAK,GAAc,GAAgB,CAAC;AAE1C,MAAM,UAAU,QAAQ;IACvB,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QACrB,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;YAC3C,mBAAmB,CAClB,qEAAqE,EACrE;gBACC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;aAC7C,EACD,IAAI,4BAA4B,EAAE,CAClC,CAAC;YACF,mBAAmB,CAClB,kHAAkH,EAClH;gBACC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBACvB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBACvB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,EACD,IAAI,4BAA4B,CAC/B,CAAC,MAAkB,EAAE,IAA8B,EAAW,EAAE;gBAC/D,6CAA6C;gBAC7C,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACb,CAAC,CACD,CACD,CAAC;YACF,mBAAmB,CAClB,wHAAwH,EACxH;gBACC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;aAC7C,EACD,IAAI,4BAA4B,CAC/B,CAAC,MAAkB,EAAE,IAA8B,EAAW,EAAE;gBAC/D,6CAA6C;gBAC7C,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9C,OAAO,IAAI,CAAC;YACb,CAAC,CACD,CACD,CAAC;QACH,CAAC,CAAC,CAAC;QAOH,MAAM,SAAS,GAAe;YAC7B,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE;YAC1C,EAAE,gBAAgB,EAAE,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE;YAC3C,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE;YAC3C,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE;SAC1C,CAAC;QAEF,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;YACtC,KAAK,MAAM,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,IAAI,SAAS,EAAE;gBACnE,+DAA+D;gBAC/D,2DAA2D;gBAC3D,kDAAkD;gBAClD,2DAA2D;gBAC3D,oCAAoC;gBACpC,2DAA2D;gBAC3D,8CAA8C;gBAC9C,8DAA8D;gBAC9D,0DAA0D;gBAC1D,sBAAsB;gBACtB,oCAAoC;gBACpC,0EAA0E;gBAC1E,QAAQ;gBACR,oCAAoC;gBACpC,uEAAuE;gBACvE,sBAAsB;gBACtB,oCAAoC;gBACpC,EAAE,CAAC,UAAU,CAAC,uBAAuB,CAAC,gBAAgB,EAAE,GAAG,EAAE;oBAC5D,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;oBACxC,MAAM,OAAO,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;oBAClE,MAAM,GAAG,GAAG,8BAA8B,CACzC,CAAC,EACD,CAAC,EACD,OAAO,EACP,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,EAC5B,IAAI,CACJ,CAAC;oBACF,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;oBACzB,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,GAAG,EAAE,CAAC;oBACN,MAAM,MAAM,GAAG;wBACd,OAAO,EAAE,OAAO,CAAC,YAAY;wBAC7B,QAAQ,EAAE,OAAO,CAAC,aAAa;wBAC/B,QAAQ,EAAE,OAAO,CAAC,aAAa;qBAC/B,CAAC;oBACF,MAAM,QAAQ,GAAG;wBAChB,6DAA6D;wBAC7D,2EAA2E;wBAC3E,iDAAiD;wBACjD,2BAA2B;wBAC3B,yDAAyD;wBACzD,+CAA+C;wBAC/C,yCAAyC;wBACzC,iDAAiD;wBACjD,uBAAuB;wBACvB,OAAO,EAAE,CAAC,GAAG,CAAC;wBACd,6DAA6D;wBAC7D,sDAAsD;wBACtD,wCAAwC;wBACxC,iDAAiD;wBACjD,QAAQ,EAAE,CAAC,GAAG,CAAC;wBACf,6DAA6D;wBAC7D,qCAAqC;wBACrC,4DAA4D;wBAC5D,yCAAyC;wBACzC,oCAAoC;wBACpC,iDAAiD;wBACjD,+DAA+D;wBAC/D,8CAA8C;wBAC9C,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;qBACzB,CAAC;oBACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACpC,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAClE,KAAK,MAAM,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,IAAI,SAAS,EAAE;gBACnE,+DAA+D;gBAC/D,2DAA2D;gBAC3D,8CAA8C;gBAC9C,8DAA8D;gBAC9D,oCAAoC;gBACpC,0DAA0D;gBAC1D,kDAAkD;gBAClD,0DAA0D;gBAC1D,0DAA0D;gBAC1D,sBAAsB;gBACtB,oCAAoC;gBACpC,0EAA0E;gBAC1E,sBAAsB;gBACtB,SAAS;gBACT,uEAAuE;gBACvE,oCAAoC;gBACpC,qCAAqC;gBACrC,EAAE,CAAC,UAAU,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,GAAG,EAAE;oBAC3D,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;oBACxC,MAAM,OAAO,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;oBAClE,MAAM,GAAG,GAAG,6BAA6B,CACxC,CAAC,EACD,CAAC,EACD,OAAO,EACP,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,EAC5B,IAAI,CACJ,CAAC;oBACF,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;oBACzB,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,GAAG,EAAE,CAAC;oBACN,MAAM,MAAM,GAAG;wBACd,OAAO,EAAE,OAAO,CAAC,YAAY;wBAC7B,QAAQ,EAAE,OAAO,CAAC,aAAa;wBAC/B,QAAQ,EAAE,OAAO,CAAC,aAAa;qBAC/B,CAAC;oBACF,MAAM,QAAQ,GAAG;wBAChB,iEAAiE;wBACjE,gDAAgD;wBAChD,gEAAgE;wBAChE,kEAAkE;wBAClE,4EAA4E;wBAC5E,yDAAyD;wBACzD,0DAA0D;wBAC1D,0CAA0C;wBAC1C,yBAAyB;wBACzB,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACxB,iEAAiE;wBACjE,wCAAwC;wBACxC,wCAAwC;wBACxC,0DAA0D;wBAC1D,mCAAmC;wBACnC,2FAA2F;wBAC3F,sCAAsC;wBACtC,QAAQ,EAAE,CAAC,GAAG,CAAC;wBACf,gEAAgE;wBAChE,yCAAyC;wBACzC,iDAAiD;wBACjD,oDAAoD;wBACpD,oFAAoF;wBACpF,QAAQ,EAAE,CAAC;qBACX,CAAC;oBACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACpC,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,qEAAqE,EAAE,GAAG,EAAE;YACpF,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE;gBACnC,+DAA+D;gBAC/D,2DAA2D;gBAC3D,8CAA8C;gBAC9C,8DAA8D;gBAC9D,oCAAoC;gBACpC,0DAA0D;gBAC1D,8CAA8C;gBAC9C,6DAA6D;gBAC7D,0DAA0D;gBAC1D,6BAA6B;gBAC7B,gDAAgD;gBAChD,uCAAuC;gBACvC,kCAAkC;gBAClC,0EAA0E;gBAC1E,6BAA6B;gBAC7B,SAAS;gBACT,uEAAuE;gBACvE,gDAAgD;gBAChD,iDAAiD;gBACjD,EAAE,CAAC,OAAO,SAAS,qBAAqB,SAAS,gBAAgB,EAAE,GAAG,EAAE;oBACvE,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;oBACxC,MAAM,OAAO,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;oBAClE,MAAM,GAAG,GAAG,sCAAsC,CACjD,SAAS,EACT,OAAO,EACP,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,EAC5B,IAAI,CACJ,CAAC;oBACF,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;oBACzB,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;oBAC1B,GAAG,EAAE,CAAC;oBACN,MAAM,MAAM,GAAG;wBACd,OAAO,EAAE,OAAO,CAAC,YAAY;wBAC7B,QAAQ,EAAE,OAAO,CAAC,aAAa;wBAC/B,QAAQ,EAAE,OAAO,CAAC,aAAa;qBAC/B,CAAC;oBACF,MAAM,CAAC,GAAG,SAAS,CAAC;oBACpB,MAAM,CAAC,GAAG,SAAS,CAAC;oBACpB,MAAM,QAAQ,GAAG;wBAChB,0EAA0E;wBAC1E,mEAAmE;wBACnE,2DAA2D;wBAC3D,6EAA6E;wBAC7E,mDAAmD;wBACnD,6BAA6B;wBAC7B,2DAA2D;wBAC3D,iDAAiD;wBACjD,qFAAqF;wBACrF,0DAA0D;wBAC1D,kCAAkC;wBAClC,wCAAwC;wBACxC,iEAAiE;wBACjE,gDAAgD;wBAChD,gEAAgE;wBAChE,4EAA4E;wBAC5E,4EAA4E;wBAC5E,wDAAwD;wBACxD,0DAA0D;wBAC1D,uCAAuC;wBACvC,yCAAyC;wBACzC,qCAAqC;wBACrC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBACxB,0EAA0E;wBAC1E,yDAAyD;wBACzD,oDAAoD;wBACpD,mCAAmC;wBACnC,oCAAoC;wBACpC,iEAAiE;wBACjE,4DAA4D;wBAC5D,oDAAoD;wBACpD,mCAAmC;wBACnC,oCAAoC;wBACpC,qBAAqB;wBACrB,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;wBACrB,0EAA0E;wBAC1E,qCAAqC;wBACrC,gEAAgE;wBAChE,qCAAqC;wBACrC,2CAA2C;wBAC3C,sCAAsC;wBACtC,mDAAmD;wBACnD,sEAAsE;wBACtE,+DAA+D;wBAC/D,iEAAiE;wBACjE,mCAAmC;wBACnC,mCAAmC;wBACnC,kCAAkC;wBAClC,kFAAkF;wBAClF,wCAAwC;wBACxC,uDAAuD;wBACvD,kDAAkD;wBAClD,qCAAqC;wBACrC,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC;qBAClC,CAAC;oBACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBACpC,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAClE,QAAQ,CAAC,0FAA0F,EAAE,GAAG,EAAE;gBACzG,KAAK,MAAM,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,IAAI,SAAS,EAAE;oBACnE,+DAA+D;oBAC/D,2DAA2D;oBAC3D,8CAA8C;oBAC9C,8DAA8D;oBAC9D,0DAA0D;oBAC1D,kDAAkD;oBAClD,0DAA0D;oBAC1D,oCAAoC;oBACpC,2DAA2D;oBAC3D,0DAA0D;oBAC1D,sBAAsB;oBACtB,yCAAyC;oBACzC,oCAAoC;oBACpC,0EAA0E;oBAC1E,oCAAoC;oBACpC,oCAAoC;oBACpC,uEAAuE;oBACvE,yCAAyC;oBACzC,0CAA0C;oBAC1C,EAAE,CAAC,oCAAoC,CAAC,uBAAuB,CAAC,gBAAgB,EAAE,GAAG,EAAE;wBACtF,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;wBACxC,MAAM,OAAO,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;wBAClE,6BAA6B,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;wBAC3E,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;wBACzB,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;wBAC1B,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;wBAC1B,OAAO,CAAC,kBAAkB,CACzB;4BACC,MAAM,EAAE,UAAU,CAAC,WAAW;4BAC9B,QAAQ,EAAE,eAAe,EAAE;4BAC3B,SAAS,EAAE,MAAmB;yBAC9B,EACD,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAChB,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;wBACF,MAAM,MAAM,GAAG;4BACd,OAAO,EAAE,OAAO,CAAC,YAAY;4BAC7B,QAAQ,EAAE,OAAO,CAAC,aAAa;4BAC/B,QAAQ,EAAE,OAAO,CAAC,aAAa;yBAC/B,CAAC;wBACF,MAAM,QAAQ,GAAG;4BAChB,uEAAuE;4BACvE,4DAA4D;4BAC5D,wCAAwC;4BACxC,kDAAkD;4BAClD,yDAAyD;4BACzD,wCAAwC;4BACxC,OAAO,EAAE,CAAC;4BACV,uEAAuE;4BACvE,4DAA4D;4BAC5D,yCAAyC;4BACzC,uCAAuC;4BACvC,wCAAwC;4BACxC,qCAAqC;4BACrC,QAAQ,EAAE,CAAC;4BACX,qFAAqF;4BACrF,yBAAyB;4BACzB,4DAA4D;4BAC5D,yCAAyC;4BACzC,oCAAoC;4BACpC,iDAAiD;4BACjD,4DAA4D;4BAC5D,gDAAgD;4BAChD,sDAAsD;4BACtD,+BAA+B;4BAC/B,oFAAoF;4BACpF,qBAAqB;4BACrB,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;yBACvB,CAAC;wBACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;oBACpC,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,gHAAgH,EAAE,GAAG,EAAE;gBAC/H,KAAK,MAAM,EAAE,gBAAgB,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,IAAI,SAAS,EAAE;oBACnE,+DAA+D;oBAC/D,2DAA2D;oBAC3D,8CAA8C;oBAC9C,8DAA8D;oBAC9D,4DAA4D;oBAC5D,0DAA0D;oBAC1D,kDAAkD;oBAClD,0DAA0D;oBAC1D,oCAAoC;oBACpC,2DAA2D;oBAC3D,0DAA0D;oBAC1D,2BAA2B;oBAC3B,8CAA8C;oBAC9C,yCAAyC;oBACzC,0EAA0E;oBAC1E,2BAA2B;oBAC3B,yCAAyC;oBACzC,uEAAuE;oBACvE,8CAA8C;oBAC9C,0CAA0C;oBAC1C,EAAE,CAAC,oCAAoC,CAAC,uBAAuB,CAAC,kBAAkB,EAAE,GAAG,EAAE;wBACxF,MAAM,OAAO,GAAG,IAAI,iBAAiB,EAAE,CAAC;wBACxC,MAAM,OAAO,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC;wBAClE,6BAA6B,CAC5B,CAAC,EACD,CAAC,GAAG,CAAC,EACL,OAAO,EACP,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW,CAC5B,CAAC;wBACF,OAAO,CAAC,YAAY,GAAG,CAAC,CAAC;wBACzB,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;wBAC1B,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC;wBAC1B,OAAO,CAAC,kBAAkB,CACzB;4BACC,MAAM,EAAE,UAAU,CAAC,WAAW;4BAC9B,QAAQ,EAAE,eAAe,EAAE;4BAC3B,SAAS,EAAE,MAAmB;yBAC9B,EACD,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAChB,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;wBACF,MAAM,MAAM,GAAG;4BACd,OAAO,EAAE,OAAO,CAAC,YAAY;4BAC7B,QAAQ,EAAE,OAAO,CAAC,aAAa;4BAC/B,QAAQ,EAAE,OAAO,CAAC,aAAa;yBAC/B,CAAC;wBACF,MAAM,QAAQ,GAAG;4BAChB,uEAAuE;4BACvE,4DAA4D;4BAC5D,6EAA6E;4BAC7E,mDAAmD;4BACnD,4BAA4B;4BAC5B,2DAA2D;4BAC3D,iDAAiD;4BACjD,iDAAiD;4BACjD,0BAA0B;4BAC1B,yBAAyB;4BACzB,mDAAmD;4BACnD,uCAAuC;4BACvC,2CAA2C;4BAC3C,uEAAuE;4BACvE,uCAAuC;4BACvC,oCAAoC;4BACpC,qCAAqC;4BACrC,OAAO,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;4BAClB,uCAAuC;4BACvC,iBAAiB;4BACjB,0CAA0C;4BAC1C,sCAAsC;4BACtC,4BAA4B;4BAC5B,kDAAkD;4BAClD,iBAAiB;4BACjB,0CAA0C;4BAC1C,uCAAuC;4BACvC,4BAA4B;4BAC5B,qBAAqB;4BACrB,QAAQ,EAAE,CAAC,GAAG,CAAC;4BACf,qFAAqF;4BACrF,yBAAyB;4BACzB,4DAA4D;4BAC5D,yCAAyC;4BACzC,oCAAoC;4BACpC,iDAAiD;4BACjD,4DAA4D;4BAC5D,gDAAgD;4BAChD,wCAAwC;4BACxC,kBAAkB;4BAClB,oCAAoC;4BACpC,kCAAkC;4BAClC,oFAAoF;4BACpF,qBAAqB;4BACrB,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;yBACvB,CAAC;wBACF,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;oBACpC,CAAC,CAAC,CAAC;iBACH;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { SessionId } from \"@fluidframework/id-compressor\";\nimport { TaggedChange } from \"../../../core/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport {\n\tTestChange,\n\tUnrebasableTestChangeRebaser,\n\tConstrainedTestChangeRebaser,\n\tNoOpChangeRebaser,\n} from \"../../testChange.js\";\nimport { mintRevisionTag } from \"../../utils.js\";\nimport {\n\ttestChangeEditManagerFactory,\n\trebaseAdvancingPeerEditsOverTrunkEdits,\n\trebaseLocalEditsOverTrunkEdits,\n\trebasePeerEditsOverTrunkEdits,\n} from \"./editManagerTestUtils.js\";\nimport { runUnitTestScenario } from \"./editManagerScenario.js\";\n\nconst peer1: SessionId = \"1\" as SessionId;\nconst peer2: SessionId = \"2\" as SessionId;\n\nexport function testPerf() {\n\tdescribe(\"Perf\", () => {\n\t\tdescribe(\"Avoids unnecessary rebases\", () => {\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Sequenced changes that are based on the trunk should not be rebased\",\n\t\t\t\t[\n\t\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t\t{ seq: 3, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t\t{ seq: 4, type: \"Pull\", ref: 3, from: peer2 },\n\t\t\t\t\t{ seq: 5, type: \"Pull\", ref: 4, from: peer2 },\n\t\t\t\t\t{ seq: 6, type: \"Pull\", ref: 5, from: peer1 },\n\t\t\t\t\t{ seq: 7, type: \"Pull\", ref: 5, from: peer1 },\n\t\t\t\t],\n\t\t\t\tnew UnrebasableTestChangeRebaser(),\n\t\t\t);\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Sequenced local changes should not be rebased over prior local changes if those earlier changes were not rebased\",\n\t\t\t\t[\n\t\t\t\t\t{ seq: 1, type: \"Push\" },\n\t\t\t\t\t{ seq: 2, type: \"Push\" },\n\t\t\t\t\t{ seq: 4, type: \"Push\" },\n\t\t\t\t\t{ seq: 1, type: \"Ack\" },\n\t\t\t\t\t{ seq: 2, type: \"Ack\" },\n\t\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer2 },\n\t\t\t\t\t{ seq: 4, type: \"Ack\" },\n\t\t\t\t],\n\t\t\t\tnew ConstrainedTestChangeRebaser(\n\t\t\t\t\t(change: TestChange, over: TaggedChange<TestChange>): boolean => {\n\t\t\t\t\t\t// This is the only rebase that should happen\n\t\t\t\t\t\tassert.deepEqual(change.intentions, [4]);\n\t\t\t\t\t\tassert.deepEqual(over.change.intentions, [3]);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t);\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Sequenced peer changes should not be rebased over changes from the same peer if those earlier changes were not rebased\",\n\t\t\t\t[\n\t\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer2 },\n\t\t\t\t\t{ seq: 4, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t],\n\t\t\t\tnew ConstrainedTestChangeRebaser(\n\t\t\t\t\t(change: TestChange, over: TaggedChange<TestChange>): boolean => {\n\t\t\t\t\t\t// This is the only rebase that should happen\n\t\t\t\t\t\tassert.deepEqual(change.intentions, [4]);\n\t\t\t\t\t\tassert.deepEqual(over.change.intentions, [3]);\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t},\n\t\t\t\t),\n\t\t\t);\n\t\t});\n\n\t\tinterface Scenario {\n\t\t\treadonly rebasedEditCount: number;\n\t\t\treadonly trunkEditCount: number;\n\t\t}\n\n\t\tconst scenarios: Scenario[] = [\n\t\t\t{ rebasedEditCount: 1, trunkEditCount: 1 },\n\t\t\t{ rebasedEditCount: 10, trunkEditCount: 1 },\n\t\t\t{ rebasedEditCount: 1, trunkEditCount: 10 },\n\t\t\t{ rebasedEditCount: 7, trunkEditCount: 3 },\n\t\t];\n\n\t\tdescribe(\"Local commit rebasing\", () => {\n\t\t\tfor (const { rebasedEditCount: L, trunkEditCount: T } of scenarios) {\n\t\t\t\t// This test simulates the following inputs to the EditManager:\n\t\t\t\t//   - Add local edit L1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(not incrementing the ref seq# for each L)\n\t\t\t\t//   - Add local edit Lc with a ref seq# pointing to edit 0\n\t\t\t\t//   => we start measuring from here\n\t\t\t\t//   - Add trunk edit T1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(incrementing the ref seq# for each T)\n\t\t\t\t//   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1\n\t\t\t\t// This defines the following relationships between edits:\n\t\t\t\t//   (0)─(T1)─...─(Tc)\n\t\t\t\t//     └───────────────(L1)─...─(Lc)\n\t\t\t\t// Before we start measuring, the EditManager has the following structure:\n\t\t\t\t//   (0)\n\t\t\t\t//     └───────────────(L1)─...─(Lc)\n\t\t\t\t// By the end of the test, the EditManager has the following structure:\n\t\t\t\t//   (0)─(T1)─...─(Tc)\n\t\t\t\t//                   └─(L1)─...─(Lc)\n\t\t\t\tit(`Rebase ${L} local commits over ${T} trunk commits`, () => {\n\t\t\t\t\tconst rebaser = new NoOpChangeRebaser();\n\t\t\t\t\tconst manager = testChangeEditManagerFactory({ rebaser }).manager;\n\t\t\t\t\tconst run = rebaseLocalEditsOverTrunkEdits(\n\t\t\t\t\t\tL,\n\t\t\t\t\t\tT,\n\t\t\t\t\t\tmanager,\n\t\t\t\t\t\t() => TestChange.emptyChange,\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t);\n\t\t\t\t\trebaser.rebasedCount = 0;\n\t\t\t\t\trebaser.invertedCount = 0;\n\t\t\t\t\trebaser.composedCount = 0;\n\t\t\t\t\trun();\n\t\t\t\t\tconst actual = {\n\t\t\t\t\t\trebased: rebaser.rebasedCount,\n\t\t\t\t\t\tinverted: rebaser.invertedCount,\n\t\t\t\t\t\tcomposed: rebaser.composedCount,\n\t\t\t\t\t};\n\t\t\t\t\tconst expected = {\n\t\t\t\t\t\t// As part of rebasing the local branch over the trunk edits,\n\t\t\t\t\t\t//   the Ith local edit on the branch is rebased over the composition of...\n\t\t\t\t\t\t//     - the inverse of each local edit before it\n\t\t\t\t\t\t//     - the new trunk edit\n\t\t\t\t\t\t//     - the rebased version of each local edit before it\n\t\t\t\t\t\t//   This adds up to 1 rebase for the Ith edit.\n\t\t\t\t\t\t//   Summing over all L edits gives us: L\n\t\t\t\t\t\t// Summing over all T branch rebases gives us: TL\n\t\t\t\t\t\t// Which simplifies to:\n\t\t\t\t\t\trebased: T * L,\n\t\t\t\t\t\t// As part of rebasing the local branch over the trunk edits,\n\t\t\t\t\t\t//   the Ith local edit on the branch is inverted once\n\t\t\t\t\t\t//   Summing over all L edits gives us L\n\t\t\t\t\t\t// Summing over all T branch rebases gives us: TL\n\t\t\t\t\t\tinverted: T * L,\n\t\t\t\t\t\t// As part of rebasing the local branch over the trunk edits,\n\t\t\t\t\t\t//   we compose the new trunk edit: 1\n\t\t\t\t\t\t//   then for the Ith local edit on the branch we compose...\n\t\t\t\t\t\t//     - the inverse of the local edit: 1\n\t\t\t\t\t\t//     - the previous composition: 1\n\t\t\t\t\t\t//     - the rebased version of the local edit: 1\n\t\t\t\t\t\t//   This adds up to 3L + 1 changes composed per branch rebase.\n\t\t\t\t\t\t// Summing over all T branch rebases gives us:\n\t\t\t\t\t\tcomposed: T * (3 * L + 1),\n\t\t\t\t\t};\n\t\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe(\"Peer commit rebasing for peer with fixed seq ref#\", () => {\n\t\t\tfor (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {\n\t\t\t\t// This test simulates the following inputs to the EditManager:\n\t\t\t\t//   - Add trunk edit T1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(incrementing the ref seq# for each T)\n\t\t\t\t//   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1\n\t\t\t\t//   => we start measuring from here\n\t\t\t\t//   - Add peer edit P1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(not incrementing the ref seq# for each P)\n\t\t\t\t//   - Add peer edit Pc with a ref seq# pointing to edit 0\n\t\t\t\t// This defines the following relationships between edits:\n\t\t\t\t//   (0)─(T1)─...─(Tc)\n\t\t\t\t//     └───────────────(P1)─...─(Pc)\n\t\t\t\t// Before we start measuring, the EditManager has the following structure:\n\t\t\t\t//   (0)─(T1)─...─(Tc)\n\t\t\t\t//     └─\n\t\t\t\t// By the end of the test, the EditManager has the following structure:\n\t\t\t\t//   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)\n\t\t\t\t//                                 └─\n\t\t\t\tit(`Rebase ${P} peer commits over ${T} trunk commits`, () => {\n\t\t\t\t\tconst rebaser = new NoOpChangeRebaser();\n\t\t\t\t\tconst manager = testChangeEditManagerFactory({ rebaser }).manager;\n\t\t\t\t\tconst run = rebasePeerEditsOverTrunkEdits(\n\t\t\t\t\t\tP,\n\t\t\t\t\t\tT,\n\t\t\t\t\t\tmanager,\n\t\t\t\t\t\t() => TestChange.emptyChange,\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t);\n\t\t\t\t\trebaser.rebasedCount = 0;\n\t\t\t\t\trebaser.invertedCount = 0;\n\t\t\t\t\trebaser.composedCount = 0;\n\t\t\t\t\trun();\n\t\t\t\t\tconst actual = {\n\t\t\t\t\t\trebased: rebaser.rebasedCount,\n\t\t\t\t\t\tinverted: rebaser.invertedCount,\n\t\t\t\t\t\tcomposed: rebaser.composedCount,\n\t\t\t\t\t};\n\t\t\t\t\tconst expected = {\n\t\t\t\t\t\t// As part of rebasing the new peer edit to the tip of the trunk,\n\t\t\t\t\t\t//   For the Ith peer edit, we rebase it over...\n\t\t\t\t\t\t//     - the inverse of the peer edits on the peer branch: I - 1\n\t\t\t\t\t\t//     - the trunk edits that were not contributed by that peer: T\n\t\t\t\t\t\t//     - the the rebased version of the peer edits (now on the trunk): I - 1\n\t\t\t\t\t\t//   This adds up to T + 2I - 2 rebases for the Ith edit.\n\t\t\t\t\t\t//   Summing over all P edits transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   Which gives us: PT + 2P(P + 1)/2 - 2P\n\t\t\t\t\t\t//   Which simplifies to:\n\t\t\t\t\t\trebased: P * (T + P - 1),\n\t\t\t\t\t\t// As part of rebasing the new peer edit to the tip of the trunk,\n\t\t\t\t\t\t//   For the Ith peer edit, we invert...\n\t\t\t\t\t\t//     - each peer edit before it: I - 1\n\t\t\t\t\t\t//   Summing over all P edits transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   Which gives us: P(P + 1)/2 - 1\n\t\t\t\t\t\t//   However, we cache the inverse of each change, so overall we only invert once each peer\n\t\t\t\t\t\t//   edit that has peer edit after it.\n\t\t\t\t\t\tinverted: P - 1,\n\t\t\t\t\t\t// As part of rebasing the local branch edit over the peer edit,\n\t\t\t\t\t\t//   For the Ith peer edit, we compose...\n\t\t\t\t\t\t//     - the rebased version of that peer edit: 1\n\t\t\t\t\t\t//   Summing over all P edits transforms gives us: P\n\t\t\t\t\t\t// Note: this composition is only needed to bake the RevisionTag into the changeset.\n\t\t\t\t\t\tcomposed: P,\n\t\t\t\t\t};\n\t\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe(\"Peer commit rebasing for peer with advancing (but not tip) seq ref#\", () => {\n\t\t\tfor (const editCount of [1, 2, 10]) {\n\t\t\t\t// This test simulates the following inputs to the EditManager:\n\t\t\t\t//   - Add trunk edit T1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(incrementing the ref seq# for each T)\n\t\t\t\t//   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1\n\t\t\t\t//   => we start measuring from here\n\t\t\t\t//   - Add peer edit P1 with a ref seq# pointing to edit 0\n\t\t\t\t//   ...(incrementing the ref seq# for each P)\n\t\t\t\t//   - Add peer edit Pc with a ref seq# pointing to edit Tc-1\n\t\t\t\t// This defines the following relationships between edits:\n\t\t\t\t//   (0)─(T1)─...─(Tc─1)─(Tc)\n\t\t\t\t//     |    |          └──────(P1)─(P2)─...─(Pc)\n\t\t\t\t//     |    └─────────────────(P1)─(P2)\n\t\t\t\t//     └──────────────────────(P1)\n\t\t\t\t// Before we start measuring, the EditManager has the following structure:\n\t\t\t\t//   (0)─(T1)─...─(Tc─1)─(Tc)\n\t\t\t\t//     └─\n\t\t\t\t// By the end of the test, the EditManager has the following structure:\n\t\t\t\t//   (0)─(T1)─...─(Tc─1)─(Tc)─(P1)─(P2)─...─(Pc)\n\t\t\t\t//                                             └─\n\t\t\t\tit(`for ${editCount} peer commits and ${editCount} trunk commits`, () => {\n\t\t\t\t\tconst rebaser = new NoOpChangeRebaser();\n\t\t\t\t\tconst manager = testChangeEditManagerFactory({ rebaser }).manager;\n\t\t\t\t\tconst run = rebaseAdvancingPeerEditsOverTrunkEdits(\n\t\t\t\t\t\teditCount,\n\t\t\t\t\t\tmanager,\n\t\t\t\t\t\t() => TestChange.emptyChange,\n\t\t\t\t\t\ttrue,\n\t\t\t\t\t);\n\t\t\t\t\trebaser.rebasedCount = 0;\n\t\t\t\t\trebaser.invertedCount = 0;\n\t\t\t\t\trebaser.composedCount = 0;\n\t\t\t\t\trun();\n\t\t\t\t\tconst actual = {\n\t\t\t\t\t\trebased: rebaser.rebasedCount,\n\t\t\t\t\t\tinverted: rebaser.invertedCount,\n\t\t\t\t\t\tcomposed: rebaser.composedCount,\n\t\t\t\t\t};\n\t\t\t\t\tconst P = editCount;\n\t\t\t\t\tconst T = editCount;\n\t\t\t\t\tconst expected = {\n\t\t\t\t\t\t// As part of rebasing the peer branch that contains the prior peer edits,\n\t\t\t\t\t\t//   we rebase all edits on the branch over the one new trunk edit.\n\t\t\t\t\t\t//   For the Ith peer edit there are I - 1 edits to rebase.\n\t\t\t\t\t\t//     the Kth local edit on the branch is rebased over the composition of...\n\t\t\t\t\t\t//       - the inverse of each local edit before it\n\t\t\t\t\t\t//       - the new trunk edit\n\t\t\t\t\t\t//       - the rebased version of each local edit before it\n\t\t\t\t\t\t//     This adds up to 1 rebase for the Kth edit.\n\t\t\t\t\t\t//     Summing over all I - 1 edits gives us I - 1 rebases for the Ith branch rebase.\n\t\t\t\t\t\t//   Summing over all P edits transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   This gives us: P(P + 1)/2 - P\n\t\t\t\t\t\t//   Which simplifies to: (P² + P)/2 - P\n\t\t\t\t\t\t// As part of rebasing the new peer edit to the tip of the trunk,\n\t\t\t\t\t\t//   For the Ith peer edit, we rebase it over...\n\t\t\t\t\t\t//     - the inverse of the peer edits on the peer branch: I - 1\n\t\t\t\t\t\t//     - the trunk edits that were not contributed by that peer: T - (I - 1)\n\t\t\t\t\t\t//     - the the rebased version of the peer edits (now on the trunk): I - 1\n\t\t\t\t\t\t//   This adds up to I - 1 + T rebases for the Ith edit.\n\t\t\t\t\t\t//   Summing over all P edits transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   This gives us: P(P + 1)/2 - P + PT\n\t\t\t\t\t\t//   Which simplifies to: (P² - P)/2 + PT\n\t\t\t\t\t\t// Adding both terms and simplifying:\n\t\t\t\t\t\trebased: P * (P + T - 1),\n\t\t\t\t\t\t// As part of rebasing the peer branch that contains the prior peer edits,\n\t\t\t\t\t\t//   For the Ith peer edit there are I-1 edits to invert.\n\t\t\t\t\t\t//   Summing over all P transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   Which gives us: P(P + 1)/2 - P\n\t\t\t\t\t\t//   Which simplifies to: P(P - 1)/2\n\t\t\t\t\t\t// As part of rebasing the new peer edit to the tip of the trunk,\n\t\t\t\t\t\t//   For the Ith peer edit, there are I - 1 edits to invert.\n\t\t\t\t\t\t//   Summing over all P transforms I into P(P + 1)/2\n\t\t\t\t\t\t//   Which gives us: P(P + 1)/2 - P\n\t\t\t\t\t\t//   Which simplifies to: P(P - 1)/2\n\t\t\t\t\t\t// Adding both terms:\n\t\t\t\t\t\tinverted: (P - 1) * P,\n\t\t\t\t\t\t// As part of rebasing the peer branch that contains the prior peer edits,\n\t\t\t\t\t\t//   we compose the new trunk edit: 1\n\t\t\t\t\t\t//   then for the Ith peer edit there are I - 1 edits to rebase.\n\t\t\t\t\t\t//     for each of them we compose...\n\t\t\t\t\t\t//       - the inverse of the local edit: 1\n\t\t\t\t\t\t//       - the previous composition: 1\n\t\t\t\t\t\t//       - the rebased version of the local edit: 1\n\t\t\t\t\t\t//     This adds up to 3I - 3 peer changes composed per branch rebase.\n\t\t\t\t\t\t//   This adds up to 3I - 2 changes composed per branch rebase.\n\t\t\t\t\t\t// Summing over all P branch rebases transforms I into P(P + 1)/2\n\t\t\t\t\t\t// Which gives us: 3P(P + 1)/2 - 2P\n\t\t\t\t\t\t// Which simplifies to: (3P² - P)/2\n\t\t\t\t\t\t// Which gives us: (3P² - P)/2 - 1\n\t\t\t\t\t\t// From that, we have to subtract 1 for the first branch rebase, which is skipped.\n\t\t\t\t\t\t// As part of updating the local branch,\n\t\t\t\t\t\t//   for the Ith peer edit we compose that peer edit: 1\n\t\t\t\t\t\t//   Summing over all P branch rebases gives us: P\n\t\t\t\t\t\t// Adding both terms and simplifying:\n\t\t\t\t\t\tcomposed: (3 * P ** 2 + P) / 2 - 1,\n\t\t\t\t\t};\n\t\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe(\"Single peer commit on top of existing peer branch\", () => {\n\t\t\tdescribe(\"with peer commit ref# to the trunk edit that the existing peer branch should rebase over\", () => {\n\t\t\t\tfor (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {\n\t\t\t\t\t// This test simulates the following inputs to the EditManager:\n\t\t\t\t\t//   - Add trunk edit T1 with a ref seq# pointing to edit 0\n\t\t\t\t\t//   ...(incrementing the ref seq# for each T)\n\t\t\t\t\t//   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1\n\t\t\t\t\t//   - Add peer edit P1 with a ref seq# pointing to edit 0\n\t\t\t\t\t//   ...(not incrementing the ref seq# for each P)\n\t\t\t\t\t//   - Add peer edit Pc with a ref seq# pointing to edit 0\n\t\t\t\t\t//   => we start measuring from here\n\t\t\t\t\t//   - Add peer edit P+ with a ref seq# pointing to edit Tc\n\t\t\t\t\t// This defines the following relationships between edits:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)\n\t\t\t\t\t//     |             └─(P1)─...─(Pc)─(P+)\n\t\t\t\t\t//     └───────────────(P1)─...─(Pc)\n\t\t\t\t\t// Before we start measuring, the EditManager has the following structure:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)\n\t\t\t\t\t//     └───────────────(P1)─...─(Pc)\n\t\t\t\t\t// By the end of the test, the EditManager has the following structure:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)─(P+)\n\t\t\t\t\t//                                      └─\n\t\t\t\t\tit(`For an existing peer branch with ${P} commits unaware of ${T} trunk commits`, () => {\n\t\t\t\t\t\tconst rebaser = new NoOpChangeRebaser();\n\t\t\t\t\t\tconst manager = testChangeEditManagerFactory({ rebaser }).manager;\n\t\t\t\t\t\trebasePeerEditsOverTrunkEdits(P, T, manager, () => TestChange.emptyChange);\n\t\t\t\t\t\trebaser.rebasedCount = 0;\n\t\t\t\t\t\trebaser.invertedCount = 0;\n\t\t\t\t\t\trebaser.composedCount = 0;\n\t\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\t\t\tsessionId: \"peer\" as SessionId,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tbrand(T + P + 1),\n\t\t\t\t\t\t\tbrand(T),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tconst actual = {\n\t\t\t\t\t\t\trebased: rebaser.rebasedCount,\n\t\t\t\t\t\t\tinverted: rebaser.invertedCount,\n\t\t\t\t\t\t\tcomposed: rebaser.composedCount,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tconst expected = {\n\t\t\t\t\t\t\t// As part of rebasing the peer branch that contains the phase-1 edits,\n\t\t\t\t\t\t\t//   we realize that the trunk already contains those edits.\n\t\t\t\t\t\t\t//   They therefore undergo no rebasing.\n\t\t\t\t\t\t\t// As part of rebasing P+ to the tip of the trunk,\n\t\t\t\t\t\t\t//   we realize that it is based on the tip of the trunk.\n\t\t\t\t\t\t\t//   It therefore undergoes no rebasing.\n\t\t\t\t\t\t\trebased: 0,\n\t\t\t\t\t\t\t// As part of rebasing the peer branch that contains the phase-1 edits,\n\t\t\t\t\t\t\t//   we realize that the trunk already contains those edits.\n\t\t\t\t\t\t\t//   They therefore undergo no inverting.\n\t\t\t\t\t\t\t// As part of rebasing P+, we invert...\n\t\t\t\t\t\t\t//   - each of the phase-1 peer edits: P\n\t\t\t\t\t\t\t// Adding both terms and simplifying:\n\t\t\t\t\t\t\tinverted: P,\n\t\t\t\t\t\t\t// As part of rebasing the peer branch that contains the phase-1 edits, we compose...\n\t\t\t\t\t\t\t//   - the trunk edits: T\n\t\t\t\t\t\t\t//   then for the Ith local edit on the branch we compose...\n\t\t\t\t\t\t\t//     - the inverse of the local edit: 1\n\t\t\t\t\t\t\t//     - the previous composition: 1\n\t\t\t\t\t\t\t//     - the rebased version of the local edit: 1\n\t\t\t\t\t\t\t//   This adds up to 3 edits composed per edit on the branch\n\t\t\t\t\t\t\t// Summing for all P edit, this gives us: T + 3P\n\t\t\t\t\t\t\t// As part of rebasing the local branch, we compose...\n\t\t\t\t\t\t\t//   - the phase-2 peer edit: 1\n\t\t\t\t\t\t\t// Note: this composition is only needed to bake the RevisionTag into the changeset.\n\t\t\t\t\t\t\t// Adding both terms:\n\t\t\t\t\t\t\tcomposed: T + 3 * P + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\n\t\t\tdescribe(\"with peer commit ref# to the trunk edit before the trunk edit that the existing peer branch should rebase over\", () => {\n\t\t\t\tfor (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {\n\t\t\t\t\t// This test simulates the following inputs to the EditManager:\n\t\t\t\t\t//   - Add trunk edit T1 with a ref seq# pointing to edit 0\n\t\t\t\t\t//   ...(incrementing the ref seq# for each T)\n\t\t\t\t\t//   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1\n\t\t\t\t\t//   - Add trunk edit T+ with a ref seq# pointing to edit Tc\n\t\t\t\t\t//   - Add peer edit P1 with a ref seq# pointing to edit 0\n\t\t\t\t\t//   ...(not incrementing the ref seq# for each P)\n\t\t\t\t\t//   - Add peer edit Pc with a ref seq# pointing to edit 0\n\t\t\t\t\t//   => we start measuring from here\n\t\t\t\t\t//   - Add peer edit P+ with a ref seq# pointing to edit Tc\n\t\t\t\t\t// This defines the following relationships between edits:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)─(T+)\n\t\t\t\t\t//     |             └──────(P1)─...─(Pc)─(P+)\n\t\t\t\t\t//     └────────────────────(P1)─...─(Pc)\n\t\t\t\t\t// Before we start measuring, the EditManager has the following structure:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)─(T+)\n\t\t\t\t\t//     └────────────────────(P1)─...─(Pc)\n\t\t\t\t\t// By the end of the test, the EditManager has the following structure:\n\t\t\t\t\t//   (0)─(T1)─...─(Tc)─(T+)─(P1)─...─(Pc)─(P+)\n\t\t\t\t\t//                   └──(P1)─...─(Pc)─(P+)\n\t\t\t\t\tit(`For an existing peer branch with ${P} commits unaware of ${T}+1 trunk commits`, () => {\n\t\t\t\t\t\tconst rebaser = new NoOpChangeRebaser();\n\t\t\t\t\t\tconst manager = testChangeEditManagerFactory({ rebaser }).manager;\n\t\t\t\t\t\trebasePeerEditsOverTrunkEdits(\n\t\t\t\t\t\t\tP,\n\t\t\t\t\t\t\tT + 1,\n\t\t\t\t\t\t\tmanager,\n\t\t\t\t\t\t\t() => TestChange.emptyChange,\n\t\t\t\t\t\t);\n\t\t\t\t\t\trebaser.rebasedCount = 0;\n\t\t\t\t\t\trebaser.invertedCount = 0;\n\t\t\t\t\t\trebaser.composedCount = 0;\n\t\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\t\t\tsessionId: \"peer\" as SessionId,\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tbrand(T + P + 2),\n\t\t\t\t\t\t\tbrand(T),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tconst actual = {\n\t\t\t\t\t\t\trebased: rebaser.rebasedCount,\n\t\t\t\t\t\t\tinverted: rebaser.invertedCount,\n\t\t\t\t\t\t\tcomposed: rebaser.composedCount,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tconst expected = {\n\t\t\t\t\t\t\t// As part of rebasing the peer branch that contains the phase-1 edits,\n\t\t\t\t\t\t\t//   we rebase all P edits on the branch over T trunk edits.\n\t\t\t\t\t\t\t//     The Ith local edit on the branch is rebased over the composition of...\n\t\t\t\t\t\t\t//       - the inverse of each local edit before it\n\t\t\t\t\t\t\t//       - the T trunk edits\n\t\t\t\t\t\t\t//       - the rebased version of each local edit before it\n\t\t\t\t\t\t\t//     This adds up to 1 rebase for the Ith edit.\n\t\t\t\t\t\t\t//   Summing over all P edits gives us P rebases.\n\t\t\t\t\t\t\t// As part of rebasing P+,\n\t\t\t\t\t\t\t//   we rebase it over...\n\t\t\t\t\t\t\t//     - the inverse of each peer edit before it: P\n\t\t\t\t\t\t\t//       (these are based on commit Tc)\n\t\t\t\t\t\t\t//     - the one remaining trunk edit T+: 1\n\t\t\t\t\t\t\t//     - each peer fully rebased version of each peer edit before it: P\n\t\t\t\t\t\t\t//       (these are based on commit T+)\n\t\t\t\t\t\t\t//   This adds up to 2P + 1 rebases.\n\t\t\t\t\t\t\t// Adding both terms and simplifying:\n\t\t\t\t\t\t\trebased: 3 * P + 1,\n\t\t\t\t\t\t\t// As part of rebasing the peer branch,\n\t\t\t\t\t\t\t//   we invert...\n\t\t\t\t\t\t\t//     - each of the phase-1 peer edits: P\n\t\t\t\t\t\t\t//       (these are based on commit 0)\n\t\t\t\t\t\t\t//   This adds up P inverts.\n\t\t\t\t\t\t\t// As part of rebasing P+ to the tip of the trunk,\n\t\t\t\t\t\t\t//   we invert...\n\t\t\t\t\t\t\t//     - each of the phase-1 peer edits: P\n\t\t\t\t\t\t\t//       (these are based on commit Tc)\n\t\t\t\t\t\t\t//   This adds up P inverts.\n\t\t\t\t\t\t\t// Adding both terms:\n\t\t\t\t\t\t\tinverted: 2 * P,\n\t\t\t\t\t\t\t// As part of rebasing the peer branch that contains the phase-1 edits, we compose...\n\t\t\t\t\t\t\t//   - the trunk edits: T\n\t\t\t\t\t\t\t//   then for the Ith local edit on the branch we compose...\n\t\t\t\t\t\t\t//     - the inverse of the local edit: 1\n\t\t\t\t\t\t\t//     - the previous composition: 1\n\t\t\t\t\t\t\t//     - the rebased version of the local edit: 1\n\t\t\t\t\t\t\t//   This adds up to 3 edits composed per edit on the branch\n\t\t\t\t\t\t\t// Summing for all P edit, this gives us: T + 3P\n\t\t\t\t\t\t\t// As part of rebasing the local branch,\n\t\t\t\t\t\t\t//   we compose...\n\t\t\t\t\t\t\t//     - the phase-2 peer edit P+: 1\n\t\t\t\t\t\t\t//   This adds up 1 edit composed.\n\t\t\t\t\t\t\t// Note: this composition is only needed to bake the RevisionTag into the changeset.\n\t\t\t\t\t\t\t// Adding both terms:\n\t\t\t\t\t\t\tcomposed: T + 3 * P + 1,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t});\n}\n"]}

package/lib/test/shared-tree-core/edit-manager/editManagerScenario.d.ts

@@ -1,80 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SessionId } from "@fluidframework/id-compressor";
-import { ChangeRebaser, ChangeFamilyEditor } from "../../../core/index.js";
-import { TestChangeFamily, TestChange } from "../../testChange.js";
-import { EditManager } from "../../../shared-tree-core/index.js";
-export type TestEditManager = EditManager<ChangeFamilyEditor, TestChange, TestChangeFamily>;
-/**
- * Represents the minting and sending of a new local change.
- */
-interface UnitTestPushStep {
-    type: "Push";
-    /**
-     * The future sequence number of the change being pushed.
-     * This information is derived by the `runUnitTestScenario` function, but can be explicitly
-     * provided to make tests easier to read and debug.
-     */
-    seq?: number;
-}
-/**
- * Represents the sequencing of a local change.
- */
-interface UnitTestAckStep {
-    type: "Ack";
-    /**
-     * The sequence number for this change.
-     * Should match the sequence number of the oldest `UnitTestPushStep`
-     * for which there is no `UnitTestAckStep` step.
-     */
-    seq: number;
-}
-/**
- * Represents the reception of a (sequenced) peer change
- */
-interface UnitTestPullStep {
-    type: "Pull";
-    /**
-     * The sequence number for this change.
-     */
-    seq: number;
-    /**
-     * The sequence number of the latest change that the issuer of this change knew about
-     * at the time they issued this change.
-     */
-    ref: number;
-    /**
-     * The ID of the peer that issued the change.
-     */
-    from: SessionId;
-    /**
-     * The delta which should be produced by the `EditManager` when it receives this change.
-     * This information is derived by the `runUnitTestScenario` function, but can be explicitly
-     * provided to make tests easier to read and debug.
-     */
-    expectedDelta?: number[];
-}
-type UnitTestScenarioStep = UnitTestPushStep | UnitTestAckStep | UnitTestPullStep;
-/**
- * State needed by the scenario builder.
- */
-interface ScenarioBuilderState {
-    /**
-     * The ref number of the last commit made by each peer (0 for peers that have made no commits).
-     */
-    peerRefs: number[];
-    /**
-     * The ref number of the last commit made by each peer (0 for peers that have made no commits).
-     */
-    seq: number;
-    /**
-     * The number of local changes that have yet to be acked.
-     */
-    inFlight: number;
-}
-export declare function buildScenario(scenario: UnitTestScenarioStep[], meta: ScenarioBuilderState, peers: readonly SessionId[], stepCount: number): Generator<readonly UnitTestScenarioStep[]>;
-export declare function runUnitTestScenario(title: string | undefined, steps: readonly UnitTestScenarioStep[], rebaser?: ChangeRebaser<TestChange>): void;
-export {};
-//# sourceMappingURL=editManagerScenario.d.ts.map

package/lib/test/shared-tree-core/edit-manager/editManagerScenario.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerScenario.d.ts","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerScenario.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,kBAAkB,EAAc,MAAM,wBAAwB,CAAC;AACvF,OAAO,EAAE,gBAAgB,EAAE,UAAU,EAAW,MAAM,qBAAqB,CAAC;AAC5E,OAAO,EAAU,WAAW,EAAa,MAAM,oCAAoC,CAAC;AAQpF,MAAM,MAAM,eAAe,GAAG,WAAW,CAAC,kBAAkB,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC;AAE5F;;GAEG;AACH,UAAU,gBAAgB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb;;;;OAIG;IACH,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;GAEG;AACH,UAAU,eAAe;IACxB,IAAI,EAAE,KAAK,CAAC;IACZ;;;;OAIG;IACH,GAAG,EAAE,MAAM,CAAC;CACZ;AAED;;GAEG;AACH,UAAU,gBAAgB;IACzB,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;;OAGG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,IAAI,EAAE,SAAS,CAAC;IAChB;;;;OAIG;IACH,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,KAAK,oBAAoB,GAAG,gBAAgB,GAAG,eAAe,GAAG,gBAAgB,CAAC;AAClF;;GAEG;AACH,UAAU,oBAAoB;IAC7B;;OAEG;IACH,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB;;OAEG;IACH,GAAG,EAAE,MAAM,CAAC;IACZ;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;CACjB;AASD,wBAAiB,aAAa,CAC7B,QAAQ,EAAE,oBAAoB,EAAE,EAChC,IAAI,EAAE,oBAAoB,EAC1B,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,SAAS,EAAE,MAAM,GACf,SAAS,CAAC,SAAS,oBAAoB,EAAE,CAAC,CA0C5C;AAED,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,KAAK,EAAE,SAAS,oBAAoB,EAAE,EACtC,OAAO,CAAC,EAAE,aAAa,CAAC,UAAU,CAAC,GACjC,IAAI,CAoPN"}

package/lib/test/shared-tree-core/edit-manager/editManagerScenario.js

@@ -1,267 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { fail, strict as assert } from "assert";
-import { unreachableCase } from "@fluidframework/core-utils";
-import { emptyDelta } from "../../../core/index.js";
-import { TestChange, asDelta } from "../../testChange.js";
-import { brand, clone } from "../../../util/index.js";
-import { mintRevisionTag } from "../../utils.js";
-import { addSequencedChange, checkChangeList, testChangeEditManagerFactory, } from "./editManagerTestUtils.js";
-const localSessionId = "0";
-export function* buildScenario(scenario, meta, peers, stepCount) {
-    if (scenario.length >= stepCount) {
-        yield scenario;
-    }
-    else {
-        // Push
-        meta.inFlight += 1;
-        scenario.push({ type: "Push" });
-        for (const built of buildScenario(scenario, meta, peers, stepCount)) {
-            yield built;
-        }
-        scenario.pop();
-        meta.inFlight -= 1;
-        // Ack (if there are any local changes)
-        if (meta.inFlight > 0) {
-            meta.inFlight -= 1;
-            meta.seq += 1;
-            scenario.push({ type: "Ack", seq: meta.seq });
-            for (const built of buildScenario(scenario, meta, peers, stepCount)) {
-                yield built;
-            }
-            scenario.pop();
-            meta.seq -= 1;
-            meta.inFlight += 1;
-        }
-        // Pull
-        meta.seq += 1;
-        for (let iPeer = 0; iPeer < peers.length; ++iPeer) {
-            const prevRef = meta.peerRefs[iPeer];
-            for (let ref = prevRef; ref < meta.seq; ++ref) {
-                meta.peerRefs[iPeer] = ref;
-                scenario.push({ type: "Pull", seq: meta.seq, ref, from: peers[iPeer] });
-                for (const built of buildScenario(scenario, meta, peers, stepCount)) {
-                    yield built;
-                }
-                scenario.pop();
-            }
-            meta.peerRefs[iPeer] = prevRef;
-        }
-        meta.seq -= 1;
-    }
-}
-export function runUnitTestScenario(title, steps, rebaser) {
-    const run = (advanceMinimumSequenceNumber) => {
-        const { manager } = testChangeEditManagerFactory({ rebaser });
-        /**
-         * An `EditManager` that is kept up to date with all sequenced edits.
-         * Used as a source of summary data to spin-up `joiners`.
-         * This `EditManager` never has local changes.
-         */
-        const summarizer = testChangeEditManagerFactory({
-            rebaser,
-            sessionId: "Summarizer",
-        }).manager;
-        /**
-         * A set of `EditManager`s spun-up based on summaries produced by `summarizer`.
-         * One such joiner is produced after every sequenced edit (i.e., after every "Ack" or "Pull" step).
-         * These are kept up to date with all sequenced edits.
-         * Used to check that summarization works properly.
-         */
-        const joiners = [];
-        /**
-         * Local helper to update all the state that is dependent on the sequencing of new edits.
-         */
-        const recordSequencedEdit = (commit) => {
-            trunk.push(commit.seqNumber);
-            summarizer.addSequencedChange(commit, commit.seqNumber, commit.refNumber);
-            for (const j of joiners) {
-                j.addSequencedChange(commit, commit.seqNumber, commit.refNumber);
-            }
-        };
-        /**
-         * Ordered list of local commits that have not yet been sequenced (i.e., `pushed - acked`)
-         */
-        const localCommits = [];
-        /**
-         * Ordered list of intentions that the manager has been made aware of (i.e., `pushed ⋃ pulled`).
-         */
-        let knownToLocal = [];
-        /**
-         * Ordered list of intentions that have been sequenced (i.e., `acked ⋃ pulled`)
-         */
-        const trunk = [];
-        /**
-         * The sequence number of the most recent sequenced commit that the manager is aware of
-         */
-        let localRef = 0;
-        /**
-         * The greatest sequence number that could have been received by all peers at the time when the local
-         * session is made aware of the given sequence number.
-         */
-        const computeMinimumSequenceNumber = (sequenceNumber) => {
-            if (advanceMinimumSequenceNumber) {
-                // Find all non-local peers participating in this scenario by scanning the scenario steps
-                const activePeers = steps
-                    .filter((s) => s.type === "Pull")
-                    .map((s) => s.from);
-                // For each peer, find its next step and extract the ref number.
-                // The min of all these ref numbers for all peers is the highest possible min sequence number across those peers.
-                const minPeerRef = activePeers
-                    .map((peer) => steps
-                    .filter((s) => s.type === "Pull" && s.from === peer)
-                    .find((s) => s.seq > sequenceNumber)?.ref ??
-                    Number.POSITIVE_INFINITY)
-                    .reduce((p, c) => Math.min(p, c), Number.POSITIVE_INFINITY);
-                // Compute the true min sequence number by including our local session's last seen sequence number as well.
-                return Math.min(sequenceNumber, minPeerRef);
-            }
-            return 0;
-        };
-        /**
-         * The sequence number of the last sequenced in the scenario.
-         */
-        const finalSequencedEdit = [...steps].reverse().find((s) => s.type !== "Push")?.seq ?? 0;
-        /**
-         * The Ack steps of the scenario
-         */
-        const acks = steps.filter((s) => s.type === "Ack");
-        /**
-         * Index of the "Ack" step in `acks` that matches the next encountered "Push" step
-         */
-        let iNextAck = 0;
-        for (const step of steps) {
-            const minimumSequenceNumber = computeMinimumSequenceNumber(step.type === "Push" ? localRef : step.seq);
-            const type = step.type;
-            switch (type) {
-                case "Push": {
-                    let seq = step.seq;
-                    if (seq === undefined) {
-                        seq =
-                            iNextAck < acks.length
-                                ? acks[iNextAck].seq
-                                : // If the pushed edit is never Ack-ed, assign the next available sequence number to it.
-                                    finalSequencedEdit + 1 + iNextAck - acks.length;
-                    }
-                    iNextAck += 1;
-                    const changeset = TestChange.mint(knownToLocal, seq);
-                    const revision = mintRevisionTag();
-                    const commit = {
-                        revision,
-                        sessionId: localSessionId,
-                        seqNumber: brand(seq),
-                        refNumber: brand(localRef),
-                        change: changeset,
-                    };
-                    localCommits.push(commit);
-                    knownToLocal.push(seq);
-                    // Local changes should always lead to a delta that is equivalent to the local change.
-                    manager.localBranch.apply(changeset, revision);
-                    assert.deepEqual(asDelta(manager.localBranch.getHead().change.intentions), asDelta([seq]));
-                    break;
-                }
-                case "Ack": {
-                    const seq = step.seq;
-                    const commit = localCommits.shift();
-                    if (commit === undefined) {
-                        fail("Invalid test scenario: no local commit to acknowledge");
-                    }
-                    if (commit.seqNumber !== seq) {
-                        fail("Invalid test scenario: acknowledged commit does not mach oldest local change");
-                    }
-                    const delta = addSequencedChange(manager, commit, commit.seqNumber, commit.refNumber);
-                    // Acknowledged (i.e., sequenced) local changes should always lead to an empty delta.
-                    assert.deepEqual(delta, emptyDelta);
-                    localRef = commit.seqNumber;
-                    manager.advanceMinimumSequenceNumber(brand(minimumSequenceNumber));
-                    recordSequencedEdit(commit);
-                    break;
-                }
-                case "Pull": {
-                    const seq = step.seq;
-                    /**
-                     * Filter that includes changes that were on the trunk of the issuer of this commit.
-                     */
-                    const peerTrunkChangesFilter = (s) => s.type !== "Push" && s.seq <= step.ref;
-                    /**
-                     * Filter that includes changes that were local to the issuer of this commit.
-                     */
-                    const peerLocalChangesFilter = (s) => s.type === "Pull" &&
-                        s.seq > step.ref &&
-                        s.seq < step.seq &&
-                        s.from === step.from;
-                    /**
-                     * Changes that were known to the peer at the time it authored this commit.
-                     */
-                    const knownToPeer = [
-                        ...steps.filter(peerTrunkChangesFilter),
-                        ...steps.filter(peerLocalChangesFilter),
-                    ].map((s) => s.seq ?? fail("Sequenced changes must all have a seq number"));
-                    const commit = {
-                        revision: mintRevisionTag(),
-                        sessionId: step.from,
-                        seqNumber: brand(seq),
-                        refNumber: brand(step.ref),
-                        change: TestChange.mint(knownToPeer, seq),
-                    };
-                    /**
-                     * Ordered list of intentions for local changes
-                     */
-                    const localIntentions = localCommits.map((c) => c.seqNumber);
-                    // When a peer commit is received we expect the update to be equivalent to the
-                    // retraction of any local changes, followed by the peer changes, followed by the
-                    // updated version of the local changes.
-                    const expected = [
-                        ...localIntentions.map((i) => -i).reverse(),
-                        seq,
-                        ...localIntentions,
-                    ];
-                    const delta = addSequencedChange(manager, commit, commit.seqNumber, commit.refNumber);
-                    assert.deepEqual(delta, asDelta(expected));
-                    if (step.expectedDelta !== undefined) {
-                        // Verify that the test case was annotated with the right expectations.
-                        assert.deepEqual(step.expectedDelta, expected);
-                    }
-                    recordSequencedEdit(commit);
-                    knownToLocal = [...trunk, ...localCommits.map((c) => c.seqNumber)];
-                    localRef = commit.seqNumber;
-                    manager.advanceMinimumSequenceNumber(brand(minimumSequenceNumber));
-                    break;
-                }
-                default:
-                    unreachableCase(type);
-            }
-            // The exposed trunk and local changes should reflect what is known to the local client
-            checkChangeList(manager, knownToLocal.filter(
-            // Only expect changes which have not been dropped by trunk eviction
-            (i) => i > minimumSequenceNumber));
-            checkChangeList(summarizer, trunk);
-            // Spin-up a new joiner whenever a summary client would have a different state.
-            // This assumes summary clients have no local changes, which may change in the future.
-            if (step.type !== "Push") {
-                const joiner = testChangeEditManagerFactory({
-                    rebaser,
-                    sessionId: `Join${joiners.length}`,
-                }).manager;
-                const summary = clone(summarizer.getSummaryData());
-                joiner.loadSummaryData(summary);
-                joiners.push(joiner);
-            }
-            // Verify that clients spun-up based on summaries are able to interpret new edits properly
-            for (const j of joiners) {
-                checkChangeList(j, trunk);
-            }
-        }
-    };
-    if (title !== undefined) {
-        // Run two versions of the scenario, one where the minimum sequence number is advanced and one where it is not
-        it(title, () => run(false));
-        it(`${title} (while advancing the min seq number)`, () => run(true));
-    }
-    else {
-        run(true);
-    }
-}
-//# sourceMappingURL=editManagerScenario.js.map

package/lib/test/shared-tree-core/edit-manager/editManagerScenario.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerScenario.js","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerScenario.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE7D,OAAO,EAAqC,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACvF,OAAO,EAAoB,UAAU,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE5E,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AACjD,OAAO,EACN,kBAAkB,EAClB,eAAe,EACf,4BAA4B,GAC5B,MAAM,2BAA2B,CAAC;AA+EnC,MAAM,cAAc,GAAc,GAAgB,CAAC;AAEnD,MAAM,SAAS,CAAC,CAAC,aAAa,CAC7B,QAAgC,EAChC,IAA0B,EAC1B,KAA2B,EAC3B,SAAiB;IAEjB,IAAI,QAAQ,CAAC,MAAM,IAAI,SAAS,EAAE;QACjC,MAAM,QAAQ,CAAC;KACf;SAAM;QACN,OAAO;QACP,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;YACpE,MAAM,KAAK,CAAC;SACZ;QACD,QAAQ,CAAC,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QAEnB,uCAAuC;QACvC,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,EAAE;YACtB,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;YACnB,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACd,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;YAC9C,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;gBACpE,MAAM,KAAK,CAAC;aACZ;YACD,QAAQ,CAAC,GAAG,EAAE,CAAC;YACf,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;YACd,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;SACnB;QAED,OAAO;QACP,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACd,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE;YAClD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrC,KAAK,IAAI,GAAG,GAAG,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,EAAE;gBAC9C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;gBAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACxE,KAAK,MAAM,KAAK,IAAI,aAAa,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;oBACpE,MAAM,KAAK,CAAC;iBACZ;gBACD,QAAQ,CAAC,GAAG,EAAE,CAAC;aACf;YACD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC;SAC/B;QACD,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;KACd;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB,CAClC,KAAyB,EACzB,KAAsC,EACtC,OAAmC;IAEnC,MAAM,GAAG,GAAG,CAAC,4BAAqC,EAAE,EAAE;QACrD,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;QAC9D;;;;WAIG;QACH,MAAM,UAAU,GAAG,4BAA4B,CAAC;YAC/C,OAAO;YACP,SAAS,EAAE,YAAyB;SACpC,CAAC,CAAC,OAAO,CAAC;QACX;;;;;WAKG;QACH,MAAM,OAAO,GAAsB,EAAE,CAAC;QACtC;;WAEG;QACH,MAAM,mBAAmB,GAAG,CAAC,MAAkB,EAAQ,EAAE;YACxD,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC7B,UAAU,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAC1E,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;gBACxB,CAAC,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;aACjE;QACF,CAAC,CAAC;QACF;;WAEG;QACH,MAAM,YAAY,GAAiB,EAAE,CAAC;QACtC;;WAEG;QACH,IAAI,YAAY,GAAa,EAAE,CAAC;QAChC;;WAEG;QACH,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B;;WAEG;QACH,IAAI,QAAQ,GAAW,CAAC,CAAC;QACzB;;;WAGG;QACH,MAAM,4BAA4B,GAAG,CAAC,cAAsB,EAAE,EAAE;YAC/D,IAAI,4BAA4B,EAAE;gBACjC,yFAAyF;gBACzF,MAAM,WAAW,GAAG,KAAK;qBACvB,MAAM,CAAC,CAAC,CAAC,EAAyB,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;qBACvD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAErB,gEAAgE;gBAChE,iHAAiH;gBACjH,MAAM,UAAU,GAAG,WAAW;qBAC5B,GAAG,CACH,CAAC,IAAI,EAAE,EAAE,CACR,KAAK;qBACH,MAAM,CACN,CAAC,CAAC,EAAyB,EAAE,CAC5B,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CACrC;qBACA,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,cAAc,CAAC,EAAE,GAAG;oBAC1C,MAAM,CAAC,iBAAiB,CACzB;qBACA,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;gBAE7D,2GAA2G;gBAC3G,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;aAC5C;YAED,OAAO,CAAC,CAAC;QACV,CAAC,CAAC;QACF;;WAEG;QACH,MAAM,kBAAkB,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QACzF;;WAEG;QACH,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAA+B,CAAC;QACjF;;WAEG;QACH,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACzB,MAAM,qBAAqB,GAAG,4BAA4B,CACzD,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAC1C,CAAC;YACF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,QAAQ,IAAI,EAAE;gBACb,KAAK,MAAM,CAAC,CAAC;oBACZ,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBACnB,IAAI,GAAG,KAAK,SAAS,EAAE;wBACtB,GAAG;4BACF,QAAQ,GAAG,IAAI,CAAC,MAAM;gCACrB,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG;gCACpB,CAAC,CAAC,uFAAuF;oCACvF,kBAAkB,GAAG,CAAC,GAAG,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;qBACpD;oBACD,QAAQ,IAAI,CAAC,CAAC;oBACd,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,YAAY,EAAE,GAAG,CAAC,CAAC;oBACrD,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;oBACnC,MAAM,MAAM,GAAe;wBAC1B,QAAQ;wBACR,SAAS,EAAE,cAAc;wBACzB,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC;wBACrB,SAAS,EAAE,KAAK,CAAC,QAAQ,CAAC;wBAC1B,MAAM,EAAE,SAAS;qBACjB,CAAC;oBACF,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBAC1B,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACvB,sFAAsF;oBACtF,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAC/C,MAAM,CAAC,SAAS,CACf,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC,UAAU,CAAC,EACxD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CACd,CAAC;oBACF,MAAM;iBACN;gBACD,KAAK,KAAK,CAAC,CAAC;oBACX,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBACrB,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC;oBACpC,IAAI,MAAM,KAAK,SAAS,EAAE;wBACzB,IAAI,CAAC,uDAAuD,CAAC,CAAC;qBAC9D;oBACD,IAAI,MAAM,CAAC,SAAS,KAAK,GAAG,EAAE;wBAC7B,IAAI,CACH,8EAA8E,CAC9E,CAAC;qBACF;oBACD,MAAM,KAAK,GAAG,kBAAkB,CAC/B,OAAO,EACP,MAAM,EACN,MAAM,CAAC,SAAS,EAChB,MAAM,CAAC,SAAS,CAChB,CAAC;oBACF,qFAAqF;oBACrF,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBACpC,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC;oBAC5B,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,CAAC;oBACnE,mBAAmB,CAAC,MAAM,CAAC,CAAC;oBAC5B,MAAM;iBACN;gBACD,KAAK,MAAM,CAAC,CAAC;oBACZ,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;oBACrB;;uBAEG;oBACH,MAAM,sBAAsB,GAAG,CAAC,CAAuB,EAAE,EAAE,CAC1D,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;oBACxC;;uBAEG;oBACH,MAAM,sBAAsB,GAAG,CAAC,CAAuB,EAAE,EAAE,CAC1D,CAAC,CAAC,IAAI,KAAK,MAAM;wBACjB,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG;wBAChB,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG;wBAChB,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;oBACtB;;uBAEG;oBACH,MAAM,WAAW,GAAa;wBAC7B,GAAG,KAAK,CAAC,MAAM,CAAC,sBAAsB,CAAC;wBACvC,GAAG,KAAK,CAAC,MAAM,CAAC,sBAAsB,CAAC;qBACvC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,8CAA8C,CAAC,CAAC,CAAC;oBAC5E,MAAM,MAAM,GAAe;wBAC1B,QAAQ,EAAE,eAAe,EAAE;wBAC3B,SAAS,EAAE,IAAI,CAAC,IAAI;wBACpB,SAAS,EAAE,KAAK,CAAC,GAAG,CAAC;wBACrB,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC;wBAC1B,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC;qBACzC,CAAC;oBACF;;uBAEG;oBACH,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAC7D,8EAA8E;oBAC9E,iFAAiF;oBACjF,wCAAwC;oBACxC,MAAM,QAAQ,GAAG;wBAChB,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;wBAC3C,GAAG;wBACH,GAAG,eAAe;qBAClB,CAAC;oBACF,MAAM,KAAK,GAAG,kBAAkB,CAC/B,OAAO,EACP,MAAM,EACN,MAAM,CAAC,SAAS,EAChB,MAAM,CAAC,SAAS,CAChB,CAAC;oBACF,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAC3C,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,EAAE;wBACrC,uEAAuE;wBACvE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;qBAC/C;oBACD,mBAAmB,CAAC,MAAM,CAAC,CAAC;oBAC5B,YAAY,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACnE,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC;oBAC5B,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC,CAAC;oBACnE,MAAM;iBACN;gBACD;oBACC,eAAe,CAAC,IAAI,CAAC,CAAC;aACvB;YACD,uFAAuF;YACvF,eAAe,CACd,OAAO,EACP,YAAY,CAAC,MAAM;YAClB,oEAAoE;YACpE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAChC,CACD,CAAC;YACF,eAAe,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YAEnC,+EAA+E;YAC/E,sFAAsF;YACtF,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE;gBACzB,MAAM,MAAM,GAAG,4BAA4B,CAAC;oBAC3C,OAAO;oBACP,SAAS,EAAE,OAAO,OAAO,CAAC,MAAM,EAAe;iBAC/C,CAAC,CAAC,OAAO,CAAC;gBACX,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;gBACnD,MAAM,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;gBAChC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACrB;YAED,0FAA0F;YAC1F,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;gBACxB,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;aAC1B;SACD;IACF,CAAC,CAAC;IACF,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,8GAA8G;QAC9G,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5B,EAAE,CAAC,GAAG,KAAK,uCAAuC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;KACrE;SAAM;QACN,GAAG,CAAC,IAAI,CAAC,CAAC;KACV;AACF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { fail, strict as assert } from \"assert\";\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport { SessionId } from \"@fluidframework/id-compressor\";\nimport { ChangeRebaser, ChangeFamilyEditor, emptyDelta } from \"../../../core/index.js\";\nimport { TestChangeFamily, TestChange, asDelta } from \"../../testChange.js\";\nimport { Commit, EditManager, SeqNumber } from \"../../../shared-tree-core/index.js\";\nimport { brand, clone } from \"../../../util/index.js\";\nimport { mintRevisionTag } from \"../../utils.js\";\nimport {\n\taddSequencedChange,\n\tcheckChangeList,\n\ttestChangeEditManagerFactory,\n} from \"./editManagerTestUtils.js\";\nexport type TestEditManager = EditManager<ChangeFamilyEditor, TestChange, TestChangeFamily>;\n\n/**\n * Represents the minting and sending of a new local change.\n */\ninterface UnitTestPushStep {\n\ttype: \"Push\";\n\t/**\n\t * The future sequence number of the change being pushed.\n\t * This information is derived by the `runUnitTestScenario` function, but can be explicitly\n\t * provided to make tests easier to read and debug.\n\t */\n\tseq?: number;\n}\n\n/**\n * Represents the sequencing of a local change.\n */\ninterface UnitTestAckStep {\n\ttype: \"Ack\";\n\t/**\n\t * The sequence number for this change.\n\t * Should match the sequence number of the oldest `UnitTestPushStep`\n\t * for which there is no `UnitTestAckStep` step.\n\t */\n\tseq: number;\n}\n\n/**\n * Represents the reception of a (sequenced) peer change\n */\ninterface UnitTestPullStep {\n\ttype: \"Pull\";\n\t/**\n\t * The sequence number for this change.\n\t */\n\tseq: number;\n\t/**\n\t * The sequence number of the latest change that the issuer of this change knew about\n\t * at the time they issued this change.\n\t */\n\tref: number;\n\t/**\n\t * The ID of the peer that issued the change.\n\t */\n\tfrom: SessionId;\n\t/**\n\t * The delta which should be produced by the `EditManager` when it receives this change.\n\t * This information is derived by the `runUnitTestScenario` function, but can be explicitly\n\t * provided to make tests easier to read and debug.\n\t */\n\texpectedDelta?: number[];\n}\n\ntype UnitTestScenarioStep = UnitTestPushStep | UnitTestAckStep | UnitTestPullStep;\n/**\n * State needed by the scenario builder.\n */\ninterface ScenarioBuilderState {\n\t/**\n\t * The ref number of the last commit made by each peer (0 for peers that have made no commits).\n\t */\n\tpeerRefs: number[];\n\t/**\n\t * The ref number of the last commit made by each peer (0 for peers that have made no commits).\n\t */\n\tseq: number;\n\t/**\n\t * The number of local changes that have yet to be acked.\n\t */\n\tinFlight: number;\n}\n\ntype TestCommit = Commit<TestChange> & {\n\tseqNumber: SeqNumber;\n\trefNumber: SeqNumber;\n};\n\nconst localSessionId: SessionId = \"0\" as SessionId;\n\nexport function* buildScenario(\n\tscenario: UnitTestScenarioStep[],\n\tmeta: ScenarioBuilderState,\n\tpeers: readonly SessionId[],\n\tstepCount: number,\n): Generator<readonly UnitTestScenarioStep[]> {\n\tif (scenario.length >= stepCount) {\n\t\tyield scenario;\n\t} else {\n\t\t// Push\n\t\tmeta.inFlight += 1;\n\t\tscenario.push({ type: \"Push\" });\n\t\tfor (const built of buildScenario(scenario, meta, peers, stepCount)) {\n\t\t\tyield built;\n\t\t}\n\t\tscenario.pop();\n\t\tmeta.inFlight -= 1;\n\n\t\t// Ack (if there are any local changes)\n\t\tif (meta.inFlight > 0) {\n\t\t\tmeta.inFlight -= 1;\n\t\t\tmeta.seq += 1;\n\t\t\tscenario.push({ type: \"Ack\", seq: meta.seq });\n\t\t\tfor (const built of buildScenario(scenario, meta, peers, stepCount)) {\n\t\t\t\tyield built;\n\t\t\t}\n\t\t\tscenario.pop();\n\t\t\tmeta.seq -= 1;\n\t\t\tmeta.inFlight += 1;\n\t\t}\n\n\t\t// Pull\n\t\tmeta.seq += 1;\n\t\tfor (let iPeer = 0; iPeer < peers.length; ++iPeer) {\n\t\t\tconst prevRef = meta.peerRefs[iPeer];\n\t\t\tfor (let ref = prevRef; ref < meta.seq; ++ref) {\n\t\t\t\tmeta.peerRefs[iPeer] = ref;\n\t\t\t\tscenario.push({ type: \"Pull\", seq: meta.seq, ref, from: peers[iPeer] });\n\t\t\t\tfor (const built of buildScenario(scenario, meta, peers, stepCount)) {\n\t\t\t\t\tyield built;\n\t\t\t\t}\n\t\t\t\tscenario.pop();\n\t\t\t}\n\t\t\tmeta.peerRefs[iPeer] = prevRef;\n\t\t}\n\t\tmeta.seq -= 1;\n\t}\n}\n\nexport function runUnitTestScenario(\n\ttitle: string | undefined,\n\tsteps: readonly UnitTestScenarioStep[],\n\trebaser?: ChangeRebaser<TestChange>,\n): void {\n\tconst run = (advanceMinimumSequenceNumber: boolean) => {\n\t\tconst { manager } = testChangeEditManagerFactory({ rebaser });\n\t\t/**\n\t\t * An `EditManager` that is kept up to date with all sequenced edits.\n\t\t * Used as a source of summary data to spin-up `joiners`.\n\t\t * This `EditManager` never has local changes.\n\t\t */\n\t\tconst summarizer = testChangeEditManagerFactory({\n\t\t\trebaser,\n\t\t\tsessionId: \"Summarizer\" as SessionId,\n\t\t}).manager;\n\t\t/**\n\t\t * A set of `EditManager`s spun-up based on summaries produced by `summarizer`.\n\t\t * One such joiner is produced after every sequenced edit (i.e., after every \"Ack\" or \"Pull\" step).\n\t\t * These are kept up to date with all sequenced edits.\n\t\t * Used to check that summarization works properly.\n\t\t */\n\t\tconst joiners: TestEditManager[] = [];\n\t\t/**\n\t\t * Local helper to update all the state that is dependent on the sequencing of new edits.\n\t\t */\n\t\tconst recordSequencedEdit = (commit: TestCommit): void => {\n\t\t\ttrunk.push(commit.seqNumber);\n\t\t\tsummarizer.addSequencedChange(commit, commit.seqNumber, commit.refNumber);\n\t\t\tfor (const j of joiners) {\n\t\t\t\tj.addSequencedChange(commit, commit.seqNumber, commit.refNumber);\n\t\t\t}\n\t\t};\n\t\t/**\n\t\t * Ordered list of local commits that have not yet been sequenced (i.e., `pushed - acked`)\n\t\t */\n\t\tconst localCommits: TestCommit[] = [];\n\t\t/**\n\t\t * Ordered list of intentions that the manager has been made aware of (i.e., `pushed ⋃ pulled`).\n\t\t */\n\t\tlet knownToLocal: number[] = [];\n\t\t/**\n\t\t * Ordered list of intentions that have been sequenced (i.e., `acked ⋃ pulled`)\n\t\t */\n\t\tconst trunk: number[] = [];\n\t\t/**\n\t\t * The sequence number of the most recent sequenced commit that the manager is aware of\n\t\t */\n\t\tlet localRef: number = 0;\n\t\t/**\n\t\t * The greatest sequence number that could have been received by all peers at the time when the local\n\t\t * session is made aware of the given sequence number.\n\t\t */\n\t\tconst computeMinimumSequenceNumber = (sequenceNumber: number) => {\n\t\t\tif (advanceMinimumSequenceNumber) {\n\t\t\t\t// Find all non-local peers participating in this scenario by scanning the scenario steps\n\t\t\t\tconst activePeers = steps\n\t\t\t\t\t.filter((s): s is UnitTestPullStep => s.type === \"Pull\")\n\t\t\t\t\t.map((s) => s.from);\n\n\t\t\t\t// For each peer, find its next step and extract the ref number.\n\t\t\t\t// The min of all these ref numbers for all peers is the highest possible min sequence number across those peers.\n\t\t\t\tconst minPeerRef = activePeers\n\t\t\t\t\t.map(\n\t\t\t\t\t\t(peer) =>\n\t\t\t\t\t\t\tsteps\n\t\t\t\t\t\t\t\t.filter(\n\t\t\t\t\t\t\t\t\t(s): s is UnitTestPullStep =>\n\t\t\t\t\t\t\t\t\t\ts.type === \"Pull\" && s.from === peer,\n\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t.find((s) => s.seq > sequenceNumber)?.ref ??\n\t\t\t\t\t\t\tNumber.POSITIVE_INFINITY,\n\t\t\t\t\t)\n\t\t\t\t\t.reduce((p, c) => Math.min(p, c), Number.POSITIVE_INFINITY);\n\n\t\t\t\t// Compute the true min sequence number by including our local session's last seen sequence number as well.\n\t\t\t\treturn Math.min(sequenceNumber, minPeerRef);\n\t\t\t}\n\n\t\t\treturn 0;\n\t\t};\n\t\t/**\n\t\t * The sequence number of the last sequenced in the scenario.\n\t\t */\n\t\tconst finalSequencedEdit = [...steps].reverse().find((s) => s.type !== \"Push\")?.seq ?? 0;\n\t\t/**\n\t\t * The Ack steps of the scenario\n\t\t */\n\t\tconst acks = steps.filter((s) => s.type === \"Ack\") as readonly UnitTestAckStep[];\n\t\t/**\n\t\t * Index of the \"Ack\" step in `acks` that matches the next encountered \"Push\" step\n\t\t */\n\t\tlet iNextAck = 0;\n\t\tfor (const step of steps) {\n\t\t\tconst minimumSequenceNumber = computeMinimumSequenceNumber(\n\t\t\t\tstep.type === \"Push\" ? localRef : step.seq,\n\t\t\t);\n\t\t\tconst type = step.type;\n\t\t\tswitch (type) {\n\t\t\t\tcase \"Push\": {\n\t\t\t\t\tlet seq = step.seq;\n\t\t\t\t\tif (seq === undefined) {\n\t\t\t\t\t\tseq =\n\t\t\t\t\t\t\tiNextAck < acks.length\n\t\t\t\t\t\t\t\t? acks[iNextAck].seq\n\t\t\t\t\t\t\t\t: // If the pushed edit is never Ack-ed, assign the next available sequence number to it.\n\t\t\t\t\t\t\t\t  finalSequencedEdit + 1 + iNextAck - acks.length;\n\t\t\t\t\t}\n\t\t\t\t\tiNextAck += 1;\n\t\t\t\t\tconst changeset = TestChange.mint(knownToLocal, seq);\n\t\t\t\t\tconst revision = mintRevisionTag();\n\t\t\t\t\tconst commit: TestCommit = {\n\t\t\t\t\t\trevision,\n\t\t\t\t\t\tsessionId: localSessionId,\n\t\t\t\t\t\tseqNumber: brand(seq),\n\t\t\t\t\t\trefNumber: brand(localRef),\n\t\t\t\t\t\tchange: changeset,\n\t\t\t\t\t};\n\t\t\t\t\tlocalCommits.push(commit);\n\t\t\t\t\tknownToLocal.push(seq);\n\t\t\t\t\t// Local changes should always lead to a delta that is equivalent to the local change.\n\t\t\t\t\tmanager.localBranch.apply(changeset, revision);\n\t\t\t\t\tassert.deepEqual(\n\t\t\t\t\t\tasDelta(manager.localBranch.getHead().change.intentions),\n\t\t\t\t\t\tasDelta([seq]),\n\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"Ack\": {\n\t\t\t\t\tconst seq = step.seq;\n\t\t\t\t\tconst commit = localCommits.shift();\n\t\t\t\t\tif (commit === undefined) {\n\t\t\t\t\t\tfail(\"Invalid test scenario: no local commit to acknowledge\");\n\t\t\t\t\t}\n\t\t\t\t\tif (commit.seqNumber !== seq) {\n\t\t\t\t\t\tfail(\n\t\t\t\t\t\t\t\"Invalid test scenario: acknowledged commit does not mach oldest local change\",\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t\tconst delta = addSequencedChange(\n\t\t\t\t\t\tmanager,\n\t\t\t\t\t\tcommit,\n\t\t\t\t\t\tcommit.seqNumber,\n\t\t\t\t\t\tcommit.refNumber,\n\t\t\t\t\t);\n\t\t\t\t\t// Acknowledged (i.e., sequenced) local changes should always lead to an empty delta.\n\t\t\t\t\tassert.deepEqual(delta, emptyDelta);\n\t\t\t\t\tlocalRef = commit.seqNumber;\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(minimumSequenceNumber));\n\t\t\t\t\trecordSequencedEdit(commit);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"Pull\": {\n\t\t\t\t\tconst seq = step.seq;\n\t\t\t\t\t/**\n\t\t\t\t\t * Filter that includes changes that were on the trunk of the issuer of this commit.\n\t\t\t\t\t */\n\t\t\t\t\tconst peerTrunkChangesFilter = (s: UnitTestScenarioStep) =>\n\t\t\t\t\t\ts.type !== \"Push\" && s.seq <= step.ref;\n\t\t\t\t\t/**\n\t\t\t\t\t * Filter that includes changes that were local to the issuer of this commit.\n\t\t\t\t\t */\n\t\t\t\t\tconst peerLocalChangesFilter = (s: UnitTestScenarioStep) =>\n\t\t\t\t\t\ts.type === \"Pull\" &&\n\t\t\t\t\t\ts.seq > step.ref &&\n\t\t\t\t\t\ts.seq < step.seq &&\n\t\t\t\t\t\ts.from === step.from;\n\t\t\t\t\t/**\n\t\t\t\t\t * Changes that were known to the peer at the time it authored this commit.\n\t\t\t\t\t */\n\t\t\t\t\tconst knownToPeer: number[] = [\n\t\t\t\t\t\t...steps.filter(peerTrunkChangesFilter),\n\t\t\t\t\t\t...steps.filter(peerLocalChangesFilter),\n\t\t\t\t\t].map((s) => s.seq ?? fail(\"Sequenced changes must all have a seq number\"));\n\t\t\t\t\tconst commit: TestCommit = {\n\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\tsessionId: step.from,\n\t\t\t\t\t\tseqNumber: brand(seq),\n\t\t\t\t\t\trefNumber: brand(step.ref),\n\t\t\t\t\t\tchange: TestChange.mint(knownToPeer, seq),\n\t\t\t\t\t};\n\t\t\t\t\t/**\n\t\t\t\t\t * Ordered list of intentions for local changes\n\t\t\t\t\t */\n\t\t\t\t\tconst localIntentions = localCommits.map((c) => c.seqNumber);\n\t\t\t\t\t// When a peer commit is received we expect the update to be equivalent to the\n\t\t\t\t\t// retraction of any local changes, followed by the peer changes, followed by the\n\t\t\t\t\t// updated version of the local changes.\n\t\t\t\t\tconst expected = [\n\t\t\t\t\t\t...localIntentions.map((i) => -i).reverse(),\n\t\t\t\t\t\tseq,\n\t\t\t\t\t\t...localIntentions,\n\t\t\t\t\t];\n\t\t\t\t\tconst delta = addSequencedChange(\n\t\t\t\t\t\tmanager,\n\t\t\t\t\t\tcommit,\n\t\t\t\t\t\tcommit.seqNumber,\n\t\t\t\t\t\tcommit.refNumber,\n\t\t\t\t\t);\n\t\t\t\t\tassert.deepEqual(delta, asDelta(expected));\n\t\t\t\t\tif (step.expectedDelta !== undefined) {\n\t\t\t\t\t\t// Verify that the test case was annotated with the right expectations.\n\t\t\t\t\t\tassert.deepEqual(step.expectedDelta, expected);\n\t\t\t\t\t}\n\t\t\t\t\trecordSequencedEdit(commit);\n\t\t\t\t\tknownToLocal = [...trunk, ...localCommits.map((c) => c.seqNumber)];\n\t\t\t\t\tlocalRef = commit.seqNumber;\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(minimumSequenceNumber));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\tunreachableCase(type);\n\t\t\t}\n\t\t\t// The exposed trunk and local changes should reflect what is known to the local client\n\t\t\tcheckChangeList(\n\t\t\t\tmanager,\n\t\t\t\tknownToLocal.filter(\n\t\t\t\t\t// Only expect changes which have not been dropped by trunk eviction\n\t\t\t\t\t(i) => i > minimumSequenceNumber,\n\t\t\t\t),\n\t\t\t);\n\t\t\tcheckChangeList(summarizer, trunk);\n\n\t\t\t// Spin-up a new joiner whenever a summary client would have a different state.\n\t\t\t// This assumes summary clients have no local changes, which may change in the future.\n\t\t\tif (step.type !== \"Push\") {\n\t\t\t\tconst joiner = testChangeEditManagerFactory({\n\t\t\t\t\trebaser,\n\t\t\t\t\tsessionId: `Join${joiners.length}` as SessionId,\n\t\t\t\t}).manager;\n\t\t\t\tconst summary = clone(summarizer.getSummaryData());\n\t\t\t\tjoiner.loadSummaryData(summary);\n\t\t\t\tjoiners.push(joiner);\n\t\t\t}\n\n\t\t\t// Verify that clients spun-up based on summaries are able to interpret new edits properly\n\t\t\tfor (const j of joiners) {\n\t\t\t\tcheckChangeList(j, trunk);\n\t\t\t}\n\t\t}\n\t};\n\tif (title !== undefined) {\n\t\t// Run two versions of the scenario, one where the minimum sequence number is advanced and one where it is not\n\t\tit(title, () => run(false));\n\t\tit(`${title} (while advancing the min seq number)`, () => run(true));\n\t} else {\n\t\trun(true);\n\t}\n}\n"]}