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

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

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerCorrectness.test.js","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerCorrectness.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,cAAc,EAAE,MAAM,sCAAsC,CAAC;AAEtE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACpE,OAAO,EAAE,wBAAwB,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAC;AAC3E,OAAO,EAAE,eAAe,EAAE,4BAA4B,EAAE,MAAM,2BAA2B,CAAC;AAC1F,OAAO,EAAE,aAAa,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE9E,MAAM,cAAc,GAAc,GAAgB,CAAC;AACnD,MAAM,KAAK,GAAc,GAAgB,CAAC;AAC1C,MAAM,KAAK,GAAc,GAAgB,CAAC;AAE1C,MAAM,UAAU,eAAe;IAC9B,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;YAC3B,mBAAmB,CAClB,qEAAqE,EACrE;gBACC,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,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBACvB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;aACvB,CACD,CAAC;YAEF,mBAAmB,CAAC,+DAA+D,EAAE;gBACpF,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,KAAK,EAAE;aACvB,CAAC,CAAC;YAEH,mBAAmB,CAClB,mEAAmE,EACnE;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,KAAK,EAAE;gBACvB,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;aACvB,CACD,CAAC;YAEF,mBAAmB,CAAC,8DAA8D,EAAE;gBACnF,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,CAAC,CAAC;YAEH,mBAAmB,CAAC,wDAAwD,EAAE;gBAC7E,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,CAAC,CAAC;YAEH,mBAAmB,CAClB,kEAAkE,EAClE;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;aAC7C,CACD,CAAC;YAEF,mBAAmB,CAAC,4DAA4D,EAAE;gBACjF,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,CAAC,CAAC;YAEH,mBAAmB,CAAC,kDAAkD,EAAE;gBACvE,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,CAAC,CAAC;YAEH,mBAAmB,CAAC,8CAA8C,EAAE;gBACnE,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,CAAC,CAAC;YAEH,mBAAmB,CAAC,6CAA6C,EAAE;gBAClE,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,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,CAAC,CAAC;YAEH,mBAAmB,CAAC,mCAAmC,EAAE;gBACxD,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;oBACC,GAAG,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,GAAG,EAAE,CAAC;oBACN,IAAI,EAAE,KAAK;oBACX,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBACvC;gBACD;oBACC,GAAG,EAAE,CAAC;oBACN,IAAI,EAAE,MAAM;oBACZ,GAAG,EAAE,CAAC;oBACN,IAAI,EAAE,KAAK;oBACX,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;iBACvC;gBACD,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,KAAK,EAAE;gBACvB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE;aACjE,CAAC,CAAC;YAEH,mBAAmB,CAAC,wDAAwD,EAAE;gBAC7E,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE;gBACxB,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACxE,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACxE,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,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBAC/E,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBAC/E,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,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;gBACxE,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,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE;aACjE,CAAC,CAAC;YAEH,mBAAmB,CAAC,2DAA2D,EAAE;gBAChF,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,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;gBAC9C,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE;aAC9C,CAAC,CAAC;YAEH,mBAAmB,CAAC,gDAAgD,EAAE;gBACrE,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,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,CAAC,CAAC;YAEH,mBAAmB;YAClB,wGAAwG;YACxG,2EAA2E,EAC3E;gBACC,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC7C,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,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;gBAC7C,EAAE,GAAG,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE;aAC7C,CACD,CAAC;YAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;gBAC/B,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;oBAC/E,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;wBAC7B,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,CAAC,EACzB,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CACZ,CAAC;qBACF;oBAED,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;oBACnD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;wBAC9B,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,CAAC,EACzB,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CACZ,CAAC;qBACF;oBAED,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;oBACnD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;oBACtE,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,OAAO,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,kBAAkB,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;oBAClD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;oBAChC,6IAA6I;oBAC7I,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,gDAAgD;oBAChD,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzE,+CAA+C;oBAC/C,gJAAgJ;oBAChJ,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EACjC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,kDAAkD;oBAClD,yFAAyF;oBACzF,sHAAsH;oBACtH,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1E,gEAAgE;oBAChE,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpC,wHAAwH;oBACxH,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,oEAAoE;oBACpE,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;oBAC7B,qJAAqJ;oBACrJ,+DAA+D;oBAC/D,6GAA6G;oBAC7G,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChF,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,2GAA2G,EAAE,GAAG,EAAE;oBACpH,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAChC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EACjC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,wGAAwG,EAAE,GAAG,EAAE;oBACjH,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAChC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,OAAO,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtD,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;oBAC/E,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,OAAO,CAAC,kBAAkB,CACzB,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAChC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACxC,OAAO,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtD,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACjC,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9B,IAAI,CAAC,OAAO,EAAE,CAAC;oBACf,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAC9B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;oBAChE,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAEjC,sEAAsE;oBACtE,yBAAyB;oBACzB,yBAAyB;oBACzB,sBAAsB;oBAEtB,kIAAkI;oBAClI,qEAAqE;oBACrE,gBAAgB;oBAChB,0BAA0B;oBAC1B,sBAAsB;oBAEtB,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,wHAAwH;oBACxH,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAEjC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBACxB,kEAAkE;oBAClE,yBAAyB;oBACzB,kCAAkC;oBAClC,wCAAwC;oBACxC,qBAAqB;oBACrB,8BAA8B;oBAC9B,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE9B,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;oBACtC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;oBACtC,+FAA+F;oBAC/F,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;oBACnE,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzE,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7E,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAEvC,sEAAsE;oBACtE,mCAAmC;oBACnC,8BAA8B;oBAC9B,8BAA8B;oBAC9B,yFAAyF;oBAEzF,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,4HAA4H;oBAC5H,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAEvC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;oBACtC,6EAA6E;oBAC7E,mCAAmC;oBACnC,oCAAoC;oBACpC,8BAA8B;oBAC9B,sCAAsC;oBACtC,+BAA+B;oBAC/B,gCAAgC;oBAChC,0BAA0B;oBAC1B,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAEpC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;oBACtC,6EAA6E;oBAC7E,+BAA+B;oBAC/B,wCAAwC;oBACxC,2CAA2C;oBAC3C,sBAAsB;oBACtB,+BAA+B;oBAC/B,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,8EAA8E,EAAE,GAAG,EAAE;oBACvF,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzE,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1E,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7E,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpC,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;oBAC7B,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChF,OAAO,CAAC,kBAAkB,CACzB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAClC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EACrC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EACxC,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAC3C,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC1C,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC/C,eAAe,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrC,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;oBAClF,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC;wBAChD,sBAAsB,EAAE,KAAK;qBAC7B,CAAC,CAAC;oBACH,MAAM,EAAE,WAAW,EAAE,GAAG,wBAAwB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;oBAEtE,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE/C,gDAAgD;oBAChD,IAAI,OAAO,GAAwC,OAAO,CAAC,YAAY,EAAE,CAAC;oBAC1E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAEjD,WAAW,EAAE,CAAC;gBACf,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;oBACjF,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC;wBAChD,sBAAsB,EAAE,KAAK;qBAC7B,CAAC,CAAC;oBACH,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,GAAG,wBAAwB,CAC1D,OAAO,CAAC,WAAW,CACnB,CAAC;oBAEF,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBACjD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAExD,mDAAmD;oBACnD,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;oBACvB,OAAO,CAAC,4BAA4B,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAE/C,iEAAiE;oBACjE,IAAI,OAAO,GAAwC,OAAO,CAAC,YAAY,EAAE,CAAC;oBAC1E,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;oBACzB,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;oBAC9B,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBAEpD,WAAW,EAAE,CAAC;gBACf,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;gBACzD,0FAA0F;gBAC1F,+CAA+C;gBAC/C,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;gBACrD,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;gBACnC,OAAO,CAAC,eAAe,CAAC;oBACvB,KAAK,EAAE;wBACN;4BACC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;4BACjC,QAAQ;4BACR,SAAS,EAAE,GAAgB;4BAC3B,cAAc,EAAE,KAAK,CAAC,CAAC,CAAC;yBACxB;qBACD;oBACD,iBAAiB,EAAE,IAAI,GAAG,EAAE;iBAC5B,CAAC,CAAC;gBACH,OAAO,CAAC,kBAAkB,CACzB;oBACC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBACpC,QAAQ,EAAE,eAAe,EAAE;oBAC3B,SAAS,EAAE,GAAgB;iBAC3B,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;gBACF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;YACrE,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;gBAChC,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;oBACnE,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;oBAErD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;oBACvD,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;oBAEvD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpD,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;oBAE/C,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;oBACzE,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;gBACjD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;oBACjF,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC,EAAE,CAAC,CAAC;oBACrD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;oBAChD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACjD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACpD,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;oBACzC,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;oBAE9D,sEAAsE;oBACtE,iBAAiB;oBACjB,qBAAqB;oBACrB,yBAAyB;oBACzB,qCAAqC;oBAErC,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBAEvD,uEAAuE;oBACvE,6BAA6B;oBAC7B,8BAA8B;oBAC9B,0BAA0B;oBAC1B,sBAAsB;oBACtB,kBAAkB;oBAElB,MAAM,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;oBACzE,MAAM,CAAC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;oBAEhD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC9C,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;oBACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;oBACvC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,CAAC;oBAEvC,6EAA6E;oBAC7E,sCAAsC;oBACtC,KAAK,CAAC,OAAO,EAAE,CAAC;oBAChB,yCAAyC;oBACzC,KAAK,CAAC,OAAO,EAAE,CAAC;oBAChB,yCAAyC;oBACzC,KAAK,CAAC,OAAO,EAAE,CAAC;oBAChB,4CAA4C;oBAC5C,KAAK,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;gBAClD,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;oBACrC,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC;wBAChD,OAAO,EAAE,IAAI,iBAAiB,EAAE;qBAChC,CAAC,CAAC;oBACH,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;gBACH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;oBAC3C,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC;wBAChD,OAAO,EAAE,IAAI,iBAAiB,EAAE;qBAChC,CAAC,CAAC;oBACH,MAAM,oBAAoB,GAAG,eAAe,EAAE,CAAC;oBAC/C,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;oBACxE,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,eAAe,EAAE,CAAC,CAAC;oBACrE,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,eAAe,EAAE,CAAC,CAAC;oBACrE,OAAO,CAAC,kBAAkB,CACzB;wBACC,MAAM,EAAE,UAAU,CAAC,WAAW;wBAC9B,QAAQ,EAAE,eAAe,EAAE;wBAC3B,SAAS,EAAE,KAAK;qBAChB,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB;wBACC,MAAM,EAAE,UAAU,CAAC,WAAW;wBAC9B,QAAQ,EAAE,oBAAoB;wBAC9B,SAAS,EAAE,OAAO,CAAC,cAAc;qBACjC,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;gBACH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;oBACxC,MAAM,EAAE,OAAO,EAAE,GAAG,4BAA4B,CAAC;wBAChD,OAAO,EAAE,IAAI,iBAAiB,EAAE;qBAChC,CAAC,CAAC;oBACH,MAAM,oBAAoB,GAAG,eAAe,EAAE,CAAC;oBAC/C,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,oBAAoB,CAAC,CAAC;oBACxE,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,eAAe,EAAE,CAAC,CAAC;oBACrE,OAAO,CAAC,kBAAkB,CACzB;wBACC,MAAM,EAAE,UAAU,CAAC,WAAW;wBAC9B,QAAQ,EAAE,oBAAoB;wBAC9B,SAAS,EAAE,OAAO,CAAC,cAAc;qBACjC,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB;wBACC,MAAM,EAAE,UAAU,CAAC,WAAW;wBAC9B,QAAQ,EAAE,eAAe,EAAE;wBAC3B,SAAS,EAAE,KAAK;qBAChB,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,OAAO,CAAC,kBAAkB,CACzB;wBACC,MAAM,EAAE,UAAU,CAAC,WAAW;wBAC9B,QAAQ,EAAE,eAAe,EAAE;wBAC3B,SAAS,EAAE,KAAK;qBAChB,EACD,KAAK,CAAC,CAAC,CAAC,EACR,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;oBACF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH;;;;;;;;WAQG;QACH,cAAc,CAAC,0BAA0B,EAAE,UAAU,EAAE,QAAQ,EAAE;YAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,IAAI,QAAQ,EAAE;gBACb,IAAI,CAAC,OAAO,CAAC,KAAM,CAAC,CAAC;aACrB;YAED,MAAM,KAAK,GAAgB,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAc,CAAC,CAAC;YACnF,MAAM,IAAI,GAAG;gBACZ,QAAQ,EAAE,SAAS,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;gBACvC,GAAG,EAAE,CAAC;gBACN,QAAQ,EAAE,CAAC;aACX,CAAC;YACF,EAAE,CAAC,OAAO,SAAS,cAAc,SAAS,QAAQ,EAAE,GAAG,EAAE;gBACxD,KAAK,MAAM,QAAQ,IAAI,aAAa,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE;oBACjE,qEAAqE;oBACrE,mFAAmF;oBACnF,yBAAyB;oBACzB,iBAAiB;oBACjB,6BAA6B;oBAC7B,0DAA0D;oBAC1D,mCAAmC;oBACnC,6BAA6B;oBAC7B,MAAM;oBACN,6BAA6B;oBAC7B,MAAM;oBACN,eAAe;oBACf,wBAAwB;oBACxB,mBAAmB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;iBACzC;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CACxB,OAIC,EACD,eAAkC,EAAE,EACpC,YAA+B,EAAE;IAEjC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAC5C,UAAU,CAAC,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC,EACxC,eAAe,EAAE,CACjB,CAAC;IACF,OAAO;QACN,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,SAAS,EAAE,cAAc;KACzB,CAAC;AACH,CAAC;AAED,SAAS,UAAU,CAClB,IAAiC,EACjC,eAAkC,EAAE,EACpC,YAA+B,EAAE;IAEjC,OAAO;QACN,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,YAAY,EAAE,SAAS,CAAC;QAChD,QAAQ,EAAE,eAAe,EAAE;QAC3B,SAAS,EAAE,IAAI;KACf,CAAC;AACH,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 { describeStress } from \"@fluid-private/stochastic-test-utils\";\nimport { ChangeFamily, ChangeFamilyEditor, GraphCommit } from \"../../../core/index.js\";\nimport { brand, makeArray } from \"../../../util/index.js\";\nimport { Commit, EditManager } from \"../../../shared-tree-core/index.js\";\nimport { TestChange, NoOpChangeRebaser } from \"../../testChange.js\";\nimport { createTestUndoRedoStacks, mintRevisionTag } from \"../../utils.js\";\nimport { checkChangeList, testChangeEditManagerFactory } from \"./editManagerTestUtils.js\";\nimport { buildScenario, runUnitTestScenario } from \"./editManagerScenario.js\";\n\nconst localSessionId: SessionId = \"0\" as SessionId;\nconst peer1: SessionId = \"1\" as SessionId;\nconst peer2: SessionId = \"2\" as SessionId;\n\nexport function testCorrectness() {\n\tdescribe(\"Correctness\", () => {\n\t\tdescribe(\"Unit Tests\", () => {\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Can handle non-concurrent local changes being sequenced immediately\",\n\t\t\t\t[\n\t\t\t\t\t{ seq: 1, type: \"Push\" },\n\t\t\t\t\t{ seq: 1, type: \"Ack\" },\n\t\t\t\t\t{ seq: 2, type: \"Push\" },\n\t\t\t\t\t{ seq: 2, type: \"Ack\" },\n\t\t\t\t\t{ seq: 3, type: \"Push\" },\n\t\t\t\t\t{ seq: 3, type: \"Ack\" },\n\t\t\t\t],\n\t\t\t);\n\n\t\t\trunUnitTestScenario(\"Can handle non-concurrent local changes being sequenced later\", [\n\t\t\t\t{ seq: 1, type: \"Push\" },\n\t\t\t\t{ seq: 2, type: \"Push\" },\n\t\t\t\t{ seq: 3, type: \"Push\" },\n\t\t\t\t{ seq: 1, type: \"Ack\" },\n\t\t\t\t{ seq: 2, type: \"Ack\" },\n\t\t\t\t{ seq: 3, type: \"Ack\" },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Can handle non-concurrent local changes partially sequenced later\",\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: 1, type: \"Ack\" },\n\t\t\t\t\t{ seq: 3, type: \"Push\" },\n\t\t\t\t\t{ seq: 2, type: \"Ack\" },\n\t\t\t\t\t{ seq: 3, type: \"Ack\" },\n\t\t\t\t],\n\t\t\t);\n\n\t\t\trunUnitTestScenario(\"Can handle non-concurrent peer changes sequenced immediately\", [\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 1, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer1 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can handle non-concurrent peer changes sequenced later\", [\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\n\t\t\t\t\"Can handle non-concurrent peer changes partially sequenced later\",\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: 1, from: peer1 },\n\t\t\t\t],\n\t\t\t);\n\n\t\t\trunUnitTestScenario(\"Can rebase a single peer change over multiple peer changes\", [\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 1, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer1 },\n\t\t\t\t{ seq: 4, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase multiple non-interleaved peer changes\", [\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 1, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer1 },\n\t\t\t\t{ seq: 4, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t\t{ seq: 5, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t\t{ seq: 6, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase multiple interleaved peer changes\", [\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 1, from: peer1 },\n\t\t\t\t{ seq: 4, type: \"Pull\", ref: 2, from: peer1 },\n\t\t\t\t{ seq: 5, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t\t{ seq: 6, type: \"Pull\", ref: 0, from: peer2 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase peer changes over a local change\", [\n\t\t\t\t{ seq: 1, type: \"Push\" },\n\t\t\t\t{ seq: 1, type: \"Ack\" },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase multiple local changes\", [\n\t\t\t\t{ seq: 3, type: \"Push\" },\n\t\t\t\t{ seq: 4, type: \"Push\" },\n\t\t\t\t{ seq: 5, type: \"Push\" },\n\t\t\t\t{\n\t\t\t\t\tseq: 1,\n\t\t\t\t\ttype: \"Pull\",\n\t\t\t\t\tref: 0,\n\t\t\t\t\tfrom: peer1,\n\t\t\t\t\texpectedDelta: [-5, -4, -3, 1, 3, 4, 5],\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tseq: 2,\n\t\t\t\t\ttype: \"Pull\",\n\t\t\t\t\tref: 1,\n\t\t\t\t\tfrom: peer1,\n\t\t\t\t\texpectedDelta: [-5, -4, -3, 2, 3, 4, 5],\n\t\t\t\t},\n\t\t\t\t{ seq: 3, type: \"Ack\" },\n\t\t\t\t{ seq: 4, type: \"Ack\" },\n\t\t\t\t{ seq: 5, type: \"Ack\" },\n\t\t\t\t{ seq: 6, type: \"Pull\", ref: 2, from: peer1, expectedDelta: [6] },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase multiple interleaved peer and local changes\", [\n\t\t\t\t{ seq: 3, type: \"Push\" },\n\t\t\t\t{ seq: 1, type: \"Pull\", ref: 0, from: peer1, expectedDelta: [-3, 1, 3] },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer2, expectedDelta: [-3, 2, 3] },\n\t\t\t\t{ seq: 6, type: \"Push\" },\n\t\t\t\t{ seq: 8, type: \"Push\" },\n\t\t\t\t{ seq: 3, type: \"Ack\" },\n\t\t\t\t{ seq: 4, type: \"Pull\", ref: 1, from: peer1, expectedDelta: [-8, -6, 4, 6, 8] },\n\t\t\t\t{ seq: 5, type: \"Pull\", ref: 2, from: peer1, expectedDelta: [-8, -6, 5, 6, 8] },\n\t\t\t\t{ seq: 6, type: \"Ack\" },\n\t\t\t\t{ seq: 7, type: \"Pull\", ref: 0, from: peer2, expectedDelta: [-8, 7, 8] },\n\t\t\t\t{ seq: 8, type: \"Ack\" },\n\t\t\t\t{ seq: 9, type: \"Pull\", ref: 0, from: peer2, expectedDelta: [9] },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can handle ref numbers to operations that are not commits\", [\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 4, type: \"Pull\", ref: 1, from: peer2 },\n\t\t\t\t{ seq: 6, type: \"Pull\", ref: 3, from: peer1 },\n\t\t\t\t{ seq: 8, type: \"Pull\", ref: 3, from: peer1 },\n\t\t\t\t{ seq: 10, type: \"Pull\", ref: 1, from: peer2 },\n\t\t\t\t{ seq: 12, type: \"Pull\", ref: 1, from: peer2 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\"Can rebase changes from a peer that catches up\", [\n\t\t\t\t{ seq: 1, type: \"Push\" },\n\t\t\t\t{ seq: 4, type: \"Push\" },\n\t\t\t\t{ seq: 1, type: \"Ack\" },\n\t\t\t\t{ seq: 2, type: \"Pull\", ref: 0, from: peer1 },\n\t\t\t\t{ seq: 3, type: \"Pull\", ref: 2, from: peer1 },\n\t\t\t]);\n\n\t\t\trunUnitTestScenario(\n\t\t\t\t// See the test \"Rebases peer branches during trunk eviction\" for a more detailed analysis of this case.\n\t\t\t\t\"Can handle changes from a lagging peer which catches up after a local ack\",\n\t\t\t\t[\n\t\t\t\t\t{ seq: 1, type: \"Pull\", from: peer1, ref: 0 },\n\t\t\t\t\t{ seq: 2, type: \"Push\" },\n\t\t\t\t\t{ seq: 2, type: \"Ack\" },\n\t\t\t\t\t{ seq: 3, type: \"Pull\", from: peer1, ref: 0 },\n\t\t\t\t\t{ seq: 4, type: \"Pull\", from: peer1, ref: 3 },\n\t\t\t\t],\n\t\t\t);\n\n\t\t\tdescribe(\"Trunk eviction\", () => {\n\t\t\t\tit(\"Evicts trunk commits according to a provided minimum sequence number\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tfor (let i = 1; i <= 10; ++i) {\n\t\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t\tapplyLocalCommit(manager),\n\t\t\t\t\t\t\tbrand(i),\n\t\t\t\t\t\t\tbrand(i - 1),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 10);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(5));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 5);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(10));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 0);\n\t\t\t\t\tfor (let i = 11; i <= 20; ++i) {\n\t\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t\tapplyLocalCommit(manager),\n\t\t\t\t\t\t\tbrand(i),\n\t\t\t\t\t\t\tbrand(i - 1),\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 10);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(15));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 5);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(20));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 0);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts trunk commits at exactly the minimum sequence number\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tmanager.addSequencedChange(applyLocalCommit(manager), brand(1), brand(0));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 1);\n\t\t\t\t\tmanager.addSequencedChange(applyLocalCommit(manager), brand(2), brand(1));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 2);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(1));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 1);\n\t\t\t\t\tmanager.addSequencedChange(applyLocalCommit(manager), brand(3), brand(2));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 2);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(3));\n\t\t\t\t\tassert.equal(manager.getTrunkChanges().length, 0);\n\t\t\t\t});\n\n\t\t\t\tit(\"Rebases peer branches\", () => {\n\t\t\t\t\t// This is a regression test that ensures peer branches are rebased up to at least the new tail of the trunk after trunk commits are evicted.\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\t// First, we receive a commit from a peer (\"1\").\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [], 1), brand(1), brand(0));\n\t\t\t\t\t// We then submit and ack a local commit (\"2\").\n\t\t\t\t\t// This prevents an upcoming rebase of the peer branch from hitting an eager fast-path that keeps the branch caught up to the head of the trunk.\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tapplyLocalCommit(manager, [1], 2),\n\t\t\t\t\t\tbrand(2),\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t);\n\t\t\t\t\t// We receive a second commit from the peer (\"3\").\n\t\t\t\t\t// Based on the ref seq number, we know that the peer is lagging \"behind\" by two commits,\n\t\t\t\t\t// i.e. it has sent a second op without receiving its first op (\"1\") or the local op (\"2\") that we applied just above.\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1], 3), brand(3), brand(0));\n\t\t\t\t\t// Our trunk should have all the commits we've sequenced so far.\n\t\t\t\t\tcheckChangeList(manager, [1, 2, 3]);\n\t\t\t\t\t// Suppose that the peer catches up, and we are informed of the new minimum sequence number via some means (e.g. an op).\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(3));\n\t\t\t\t\t// Eviction ocurred, so we now expect the trunk to be fully evicted.\n\t\t\t\t\tcheckChangeList(manager, []);\n\t\t\t\t\t// We also expect our copy of the peer's local branch to be updated even though we have not received any new commits from that peer since commit \"3\".\n\t\t\t\t\t// We can check this by receiving another commit from our peer.\n\t\t\t\t\t// We'll fail when trying to rebase if the branch was not already updated and is referencing evicted commits.\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1, 2, 3], 4), brand(4), brand(3));\n\t\t\t\t\tcheckChangeList(manager, [4]);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts properly when the minimum sequence number advances past the trunk (and there are no local commits)\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tapplyLocalCommit(manager, [], 1),\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(2));\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tapplyLocalCommit(manager, [1], 2),\n\t\t\t\t\t\tbrand(3),\n\t\t\t\t\t\tbrand(2),\n\t\t\t\t\t);\n\t\t\t\t\tcheckChangeList(manager, [2]);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts properly when the minimum sequence number advances past the trunk (and there are local commits)\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tapplyLocalCommit(manager, [], 1),\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tconst local = applyLocalCommit(manager, [1], 2);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(2));\n\t\t\t\t\tmanager.addSequencedChange(local, brand(3), brand(2));\n\t\t\t\t\tcheckChangeList(manager, [2]);\n\t\t\t\t});\n\n\t\t\t\tit(\"Delays eviction of a branch base commit until the branch is disposed\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tapplyLocalCommit(manager, [], 1),\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tconst local = applyLocalCommit(manager, [1], 2);\n\t\t\t\t\tconst fork = manager.localBranch.fork();\n\t\t\t\t\tmanager.addSequencedChange(local, brand(2), brand(1));\n\t\t\t\t\tcheckChangeList(manager, [1, 2]);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(2));\n\t\t\t\t\tcheckChangeList(manager, [2]);\n\t\t\t\t\tfork.dispose();\n\t\t\t\t\tcheckChangeList(manager, []);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts after the oldest branch rebases (fast-forward)\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tconst local1 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst fork1 = manager.localBranch.fork();\n\t\t\t\t\tmanager.addSequencedChange(local1, brand(1), brand(0));\n\t\t\t\t\tconst local2 = applyLocalCommit(manager, [1], 2);\n\t\t\t\t\tconst fork2 = manager.localBranch.fork();\n\t\t\t\t\tmanager.addSequencedChange(local2, brand(2), brand(1));\n\t\t\t\t\tcheckChangeList(manager, [1, 2]);\n\n\t\t\t\t\t// The code above defines the following relationships between commits:\n\t\t\t\t\t//   (r)─(1)─(2) <- local\n\t\t\t\t\t//     |   └─(2) <- fork2\n\t\t\t\t\t//     └─(1)  <- fork1\n\n\t\t\t\t\t// However, commits 1 and 2 are sequenced as-is (i.e., without rebasing), which leads to those commits becoming part of the trunk.\n\t\t\t\t\t// This leads to fork1 and fork2 being fast-forwarded onto the trunk:\n\t\t\t\t\t//   (r)─(1)─(2)\n\t\t\t\t\t//         |   └─ <- fork2\n\t\t\t\t\t//         └─ <- fork1\n\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(2));\n\t\t\t\t\t// Advancing the minimum sequence number does not evict any commits because fork1 branches off of the trunk at commit 1.\n\t\t\t\t\tcheckChangeList(manager, [1, 2]);\n\n\t\t\t\t\tfork1.rebaseOnto(fork2);\n\t\t\t\t\t// Rebasing fork1 onto fork2 leads to the following configuration:\n\t\t\t\t\t//   (r)─(1)─(2) <- local\n\t\t\t\t\t//             └─ <- fork1 & fork2\n\t\t\t\t\t// This allows the eviction of commit 1.\n\t\t\t\t\t//   (r)─(2) <- local\n\t\t\t\t\t//         └─ <- fork1 & fork2\n\t\t\t\t\tcheckChangeList(manager, [2]);\n\n\t\t\t\t\tfork1.rebaseOnto(manager.localBranch);\n\t\t\t\t\tfork2.rebaseOnto(manager.localBranch);\n\t\t\t\t\t// Rebasing the forks onto the local branch has no effect because they were already at the tip.\n\t\t\t\t\tcheckChangeList(manager, [2]);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts after the oldest branch rebases (no fast-forward)\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tconst local1 = applyLocalCommit(manager, [], 2);\n\t\t\t\t\tconst fork1 = manager.localBranch.fork();\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [], 1), brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(local1, brand(2), brand(0));\n\t\t\t\t\tconst local2 = applyLocalCommit(manager, [1, 2], 4);\n\t\t\t\t\tconst fork2 = manager.localBranch.fork();\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1, 2], 3), brand(3), brand(2));\n\t\t\t\t\tmanager.addSequencedChange(local2, brand(4), brand(2));\n\t\t\t\t\tcheckChangeList(manager, [1, 2, 3, 4]);\n\n\t\t\t\t\t// The code above defines the following relationships between commits:\n\t\t\t\t\t//   (r)─(1)─(2')─(3)─(4') <- local\n\t\t\t\t\t//     |        └─(4) <- fork2\n\t\t\t\t\t//     └─(2)          <- fork1\n\t\t\t\t\t// The peer commits (1 and 3) prevent the forks from being fast-forwarded onto the trunk.\n\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(4));\n\t\t\t\t\t// Advancing the minimum sequence number does not evict any commits because fork1 branches off of the trunk before commit 1.\n\t\t\t\t\tcheckChangeList(manager, [1, 2, 3, 4]);\n\n\t\t\t\t\tfork1.rebaseOnto(manager.localBranch);\n\t\t\t\t\t// Rebasing fork1 onto the local branch leads to the following configuration:\n\t\t\t\t\t//   (r)─(1)─(2')─(3)─(4') <- local\n\t\t\t\t\t//              |        └─ <- fork1\n\t\t\t\t\t//              └─(4) <- fork2\n\t\t\t\t\t// This allows commit 1 to be evicted:\n\t\t\t\t\t//   (r)─(2')─(3)─(4') <- local\n\t\t\t\t\t//          |        └─ <- fork1\n\t\t\t\t\t//          └─(4) <- fork2\n\t\t\t\t\tcheckChangeList(manager, [2, 3, 4]);\n\n\t\t\t\t\tfork2.rebaseOnto(manager.localBranch);\n\t\t\t\t\t// Rebasing fork2 onto the local branch leads to the following configuration:\n\t\t\t\t\t//   (r)─(2')─(3)─(4') <- local\n\t\t\t\t\t//                   └─ <- fork1 & fork2\n\t\t\t\t\t// This allows commit 2' & 3 to be evicted:\n\t\t\t\t\t//   (r)─(4') <- local\n\t\t\t\t\t//          └─ <- fork1 & fork2\n\t\t\t\t\tcheckChangeList(manager, [4]);\n\t\t\t\t});\n\n\t\t\t\tit(\"Evicts properly when changes come in batches having the same sequence number\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [], 1), brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1], 2), brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1, 2], 3), brand(1), brand(0));\n\t\t\t\t\tcheckChangeList(manager, [1, 2, 3]);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(2));\n\t\t\t\t\tcheckChangeList(manager, []);\n\t\t\t\t\tmanager.addSequencedChange(peerCommit(peer1, [1, 2, 3], 4), brand(4), brand(1));\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tpeerCommit(peer1, [1, 2, 3, 4], 5),\n\t\t\t\t\t\tbrand(4),\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tpeerCommit(peer2, [1, 2, 3, 4, 5], 6),\n\t\t\t\t\t\tbrand(5),\n\t\t\t\t\t\tbrand(4),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tpeerCommit(peer2, [1, 2, 3, 4, 5, 6], 7),\n\t\t\t\t\t\tbrand(5),\n\t\t\t\t\t\tbrand(4),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\tpeerCommit(peer2, [1, 2, 3, 4, 5, 6, 7], 8),\n\t\t\t\t\t\tbrand(5),\n\t\t\t\t\t\tbrand(4),\n\t\t\t\t\t);\n\t\t\t\t\tcheckChangeList(manager, [4, 5, 6, 7, 8]);\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(4));\n\t\t\t\t\tcheckChangeList(manager, [6, 7, 8]);\n\t\t\t\t});\n\n\t\t\t\tit(\"does not evict commits including and after the oldest revertible commit\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({\n\t\t\t\t\t\tautoDiscardRevertibles: false,\n\t\t\t\t\t});\n\t\t\t\t\tconst { unsubscribe } = createTestUndoRedoStacks(manager.localBranch);\n\n\t\t\t\t\tconst commit1 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit2 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit3 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit4 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tmanager.addSequencedChange(commit1, brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit2, brand(2), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit3, brand(3), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit4, brand(4), brand(0));\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(4));\n\n\t\t\t\t\t// check that commits are all still in the trunk\n\t\t\t\t\tlet current: GraphCommit<TestChange> | undefined = manager.getTrunkHead();\n\t\t\t\t\tassert.equal(current.revision, commit4.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.equal(current.revision, commit3.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.equal(current.revision, commit2.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.equal(current.revision, commit1.revision);\n\n\t\t\t\t\tunsubscribe();\n\t\t\t\t});\n\n\t\t\t\tit(\"advances the oldest revertible commit when that revertible is disposed\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({\n\t\t\t\t\t\tautoDiscardRevertibles: false,\n\t\t\t\t\t});\n\t\t\t\t\tconst { undoStack, unsubscribe } = createTestUndoRedoStacks(\n\t\t\t\t\t\tmanager.localBranch,\n\t\t\t\t\t);\n\n\t\t\t\t\tconst commit1 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit2 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit3 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst commit4 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tmanager.addSequencedChange(commit1, brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit2, brand(2), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit3, brand(3), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(commit4, brand(4), brand(0));\n\n\t\t\t\t\t// discard the oldest revertible and trim the trunk\n\t\t\t\t\tundoStack[0].discard();\n\t\t\t\t\tmanager.advanceMinimumSequenceNumber(brand(4));\n\n\t\t\t\t\t// check that all commits except the first are still in the trunk\n\t\t\t\t\tlet current: GraphCommit<TestChange> | undefined = manager.getTrunkHead();\n\t\t\t\t\tassert.equal(current.revision, commit4.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.equal(current.revision, commit3.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.equal(current.revision, commit2.revision);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t\tassert(current !== undefined);\n\t\t\t\t\tassert.notEqual(current.revision, commit1.revision);\n\n\t\t\t\t\tunsubscribe();\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit(\"Updates local branch when loading from summary\", () => {\n\t\t\t\t// This regression tests ensures that the local branch is rebased to the head of the trunk\n\t\t\t\t// when the trunk is modified by a summary load\n\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\tconst revision = mintRevisionTag();\n\t\t\t\tmanager.loadSummaryData({\n\t\t\t\t\ttrunk: [\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.mint([0], [1]),\n\t\t\t\t\t\t\trevision,\n\t\t\t\t\t\t\tsessionId: \"0\" as SessionId,\n\t\t\t\t\t\t\tsequenceNumber: brand(1),\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\tpeerLocalBranches: new Map(),\n\t\t\t\t});\n\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t{\n\t\t\t\t\t\tchange: TestChange.mint([0, 1], [2]),\n\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\tsessionId: \"1\" as SessionId,\n\t\t\t\t\t},\n\t\t\t\t\tbrand(2),\n\t\t\t\t\tbrand(1),\n\t\t\t\t);\n\t\t\t\tassert.equal(manager.localBranch.getHead(), manager.getTrunkHead());\n\t\t\t});\n\n\t\t\tdescribe(\"fast-forwarding\", () => {\n\t\t\t\tit(\"supports fast-forwarding of local commits onto the trunk\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tconst local1 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst local2 = applyLocalCommit(manager, [1], 2);\n\t\t\t\t\tconst [commit1, commit2] = manager.getLocalCommits();\n\n\t\t\t\t\tmanager.addSequencedChange(local1, brand(1), brand(0));\n\t\t\t\t\tassert.deepEqual([commit1], manager.getTrunkCommits());\n\t\t\t\t\tassert.deepEqual([commit2], manager.getLocalCommits());\n\n\t\t\t\t\tconst local3 = applyLocalCommit(manager, [1, 2], 3);\n\t\t\t\t\tconst [_, commit3] = manager.getLocalCommits();\n\n\t\t\t\t\tmanager.addSequencedChange(local2, brand(2), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(local3, brand(3), brand(1));\n\t\t\t\t\tassert.deepEqual([commit1, commit2, commit3], manager.getTrunkCommits());\n\t\t\t\t\tassert.deepEqual([], manager.getLocalCommits());\n\t\t\t\t});\n\n\t\t\t\tit(\"local branches do not prevent and are not perturbed by fast-forwarding\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({});\n\t\t\t\t\tconst forkA = manager.localBranch.fork();\n\t\t\t\t\tconst local1 = applyLocalCommit(manager, [], 1);\n\t\t\t\t\tconst forkB = manager.localBranch.fork();\n\t\t\t\t\tconst local2 = applyLocalCommit(manager, [1], 2);\n\t\t\t\t\tconst forkC = manager.localBranch.fork();\n\t\t\t\t\tconst local3 = applyLocalCommit(manager, [1, 2], 3);\n\t\t\t\t\tconst forkD = manager.localBranch.fork();\n\t\t\t\t\tconst [commit1, commit2, commit3] = manager.getLocalCommits();\n\n\t\t\t\t\t// The code above defines the following relationships between commits:\n\t\t\t\t\t//   (r) <- forkA\n\t\t\t\t\t//     └─(1) <- forkB\n\t\t\t\t\t//         └─(2) <- forkC\n\t\t\t\t\t//             └─(3) <- forkD & local\n\n\t\t\t\t\tmanager.addSequencedChange(local1, brand(1), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(local2, brand(2), brand(0));\n\t\t\t\t\tmanager.addSequencedChange(local3, brand(3), brand(0));\n\n\t\t\t\t\t// Because of fast-forwarding, we should now be in the following state:\n\t\t\t\t\t//   (r)─(1)─(2)─(3) <- local\n\t\t\t\t\t//     |   |   |   └─ <- forkD\n\t\t\t\t\t//     |   |   └─ <- forkC\n\t\t\t\t\t//     |   └─ <- forkB\n\t\t\t\t\t//     └─ <- forkA\n\n\t\t\t\t\tassert.deepEqual([commit1, commit2, commit3], manager.getTrunkCommits());\n\t\t\t\t\tassert.deepEqual([], manager.getLocalCommits());\n\n\t\t\t\t\tassert.equal(forkA.getHead(), commit1.parent);\n\t\t\t\t\tassert.equal(forkB.getHead(), commit1);\n\t\t\t\t\tassert.equal(forkC.getHead(), commit2);\n\t\t\t\t\tassert.equal(forkD.getHead(), commit3);\n\n\t\t\t\t\t// Test the disposal of the forks in an order that exercises different cases:\n\t\t\t\t\t// A fork with earlier and later forks\n\t\t\t\t\tforkB.dispose();\n\t\t\t\t\t// A fork with later but no earlier forks\n\t\t\t\t\tforkA.dispose();\n\t\t\t\t\t// A fork with earlier but no later forks\n\t\t\t\t\tforkD.dispose();\n\t\t\t\t\t// A fork with no earlier and no later forks\n\t\t\t\t\tforkC.dispose();\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tdescribe(\"Reports correct max branch length\", () => {\n\t\t\t\tit(\"When there are no branches\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({\n\t\t\t\t\t\trebaser: new NoOpChangeRebaser(),\n\t\t\t\t\t});\n\t\t\t\t\tassert.equal(manager.getLongestBranchLength(), 0);\n\t\t\t\t});\n\t\t\t\tit(\"When the local branch is longest\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({\n\t\t\t\t\t\trebaser: new NoOpChangeRebaser(),\n\t\t\t\t\t});\n\t\t\t\t\tconst sequencedLocalChange = mintRevisionTag();\n\t\t\t\t\tmanager.localBranch.apply(TestChange.emptyChange, sequencedLocalChange);\n\t\t\t\t\tmanager.localBranch.apply(TestChange.emptyChange, mintRevisionTag());\n\t\t\t\t\tmanager.localBranch.apply(TestChange.emptyChange, mintRevisionTag());\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\t\tsessionId: peer1,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\trevision: sequencedLocalChange,\n\t\t\t\t\t\t\tsessionId: manager.localSessionId,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbrand(2),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tassert.equal(manager.getLongestBranchLength(), 2);\n\t\t\t\t});\n\t\t\t\tit(\"When a peer branch is longest\", () => {\n\t\t\t\t\tconst { manager } = testChangeEditManagerFactory({\n\t\t\t\t\t\trebaser: new NoOpChangeRebaser(),\n\t\t\t\t\t});\n\t\t\t\t\tconst sequencedLocalChange = mintRevisionTag();\n\t\t\t\t\tmanager.localBranch.apply(TestChange.emptyChange, sequencedLocalChange);\n\t\t\t\t\tmanager.localBranch.apply(TestChange.emptyChange, mintRevisionTag());\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\trevision: sequencedLocalChange,\n\t\t\t\t\t\t\tsessionId: manager.localSessionId,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbrand(1),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\t\tsessionId: peer1,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbrand(2),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tmanager.addSequencedChange(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tchange: TestChange.emptyChange,\n\t\t\t\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\t\t\t\tsessionId: peer1,\n\t\t\t\t\t\t},\n\t\t\t\t\t\tbrand(3),\n\t\t\t\t\t\tbrand(0),\n\t\t\t\t\t);\n\t\t\t\t\tassert.equal(manager.getLongestBranchLength(), 2);\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\n\t\t/**\n\t\t * This test case effectively tests most of the scenarios covered by the other test cases.\n\t\t * Despite that, it's good to keep the other tests cases for the following reasons:\n\t\t *\n\t\t * - They are easier to read and debug.\n\t\t *\n\t\t * - They help diagnose issues with the more complicated exhaustive test (e.g., if one of the above tests fails,\n\t\t * but this one doesn't, then there might be something wrong with this test).\n\t\t */\n\t\tdescribeStress(\"Combinatorial exhaustive\", function ({ isStress }) {\n\t\t\tconst NUM_STEPS = isStress ? 5 : 4;\n\t\t\tconst NUM_PEERS = isStress ? 3 : 2;\n\t\t\tif (isStress) {\n\t\t\t\tthis.timeout(60_000);\n\t\t\t}\n\n\t\t\tconst peers: SessionId[] = makeArray(NUM_PEERS, (i) => String(i + 1) as SessionId);\n\t\t\tconst meta = {\n\t\t\t\tpeerRefs: makeArray(NUM_PEERS, () => 0),\n\t\t\t\tseq: 0,\n\t\t\t\tinFlight: 0,\n\t\t\t};\n\t\t\tit(`for ${NUM_PEERS} peers and ${NUM_STEPS} steps`, () => {\n\t\t\t\tfor (const scenario of buildScenario([], meta, peers, NUM_STEPS)) {\n\t\t\t\t\t// Uncomment the code below to log the titles of generated scenarios.\n\t\t\t\t\t// This is helpful for creating a unit test out of a generated scenario that fails.\n\t\t\t\t\t// const title = scenario\n\t\t\t\t\t// \t.map((s) => {\n\t\t\t\t\t// \t\tif (s.type === \"Pull\") {\n\t\t\t\t\t// \t\t\treturn `Pull(${s.seq}) from:${s.from} ref:${s.ref}`;\n\t\t\t\t\t// \t\t} else if (s.type === \"Ack\") {\n\t\t\t\t\t// \t\t\treturn `Ack(${s.seq})`;\n\t\t\t\t\t// \t\t}\n\t\t\t\t\t// \t\treturn `Push(${s.seq})`;\n\t\t\t\t\t// \t})\n\t\t\t\t\t// \t.join(\"|\");\n\t\t\t\t\t// console.debug(title);\n\t\t\t\t\trunUnitTestScenario(undefined, scenario);\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t});\n}\n\nfunction applyLocalCommit(\n\tmanager: EditManager<\n\t\tChangeFamilyEditor,\n\t\tTestChange,\n\t\tChangeFamily<ChangeFamilyEditor, TestChange>\n\t>,\n\tinputContext: readonly number[] = [],\n\tintention: number | number[] = [],\n): Commit<TestChange> {\n\tconst [_, commit] = manager.localBranch.apply(\n\t\tTestChange.mint(inputContext, intention),\n\t\tmintRevisionTag(),\n\t);\n\treturn {\n\t\tchange: commit.change,\n\t\trevision: commit.revision,\n\t\tsessionId: localSessionId,\n\t};\n}\n\nfunction peerCommit(\n\tpeer: typeof peer1 | typeof peer2,\n\tinputContext: readonly number[] = [],\n\tintention: number | number[] = [],\n): Commit<TestChange> {\n\treturn {\n\t\tchange: TestChange.mint(inputContext, intention),\n\t\trevision: mintRevisionTag(),\n\t\tsessionId: peer,\n\t};\n}\n"]}

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

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export declare function testPerf(): void;
-//# sourceMappingURL=editManagerPerf.test.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerPerf.test.d.ts","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerPerf.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAwBH,wBAAgB,QAAQ,SAqevB"}

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

@@ -1,442 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { brand } from "../../../util/index.js";
-import { TestChange, UnrebasableTestChangeRebaser, ConstrainedTestChangeRebaser, NoOpChangeRebaser, } from "../../testChange.js";
-import { mintRevisionTag } from "../../utils.js";
-import { testChangeEditManagerFactory, rebaseAdvancingPeerEditsOverTrunkEdits, rebaseLocalEditsOverTrunkEdits, rebasePeerEditsOverTrunkEdits, } from "./editManagerTestUtils.js";
-import { runUnitTestScenario } from "./editManagerScenario.js";
-const peer1 = "1";
-const peer2 = "2";
-export function testPerf() {
-    describe("Perf", () => {
-        describe("Avoids unnecessary rebases", () => {
-            runUnitTestScenario("Sequenced changes that are based on the trunk should not be rebased", [
-                { seq: 1, type: "Pull", ref: 0, from: peer1 },
-                { seq: 2, type: "Pull", ref: 0, from: peer1 },
-                { seq: 3, type: "Pull", ref: 0, from: peer1 },
-                { seq: 4, type: "Pull", ref: 3, from: peer2 },
-                { seq: 5, type: "Pull", ref: 4, from: peer2 },
-                { seq: 6, type: "Pull", ref: 5, from: peer1 },
-                { seq: 7, type: "Pull", ref: 5, from: peer1 },
-            ], new UnrebasableTestChangeRebaser());
-            runUnitTestScenario("Sequenced local changes should not be rebased over prior local changes if those earlier changes were not rebased", [
-                { seq: 1, type: "Push" },
-                { seq: 2, type: "Push" },
-                { seq: 4, type: "Push" },
-                { seq: 1, type: "Ack" },
-                { seq: 2, type: "Ack" },
-                { seq: 3, type: "Pull", ref: 2, from: peer2 },
-                { seq: 4, type: "Ack" },
-            ], new ConstrainedTestChangeRebaser((change, over) => {
-                // This is the only rebase that should happen
-                assert.deepEqual(change.intentions, [4]);
-                assert.deepEqual(over.change.intentions, [3]);
-                return true;
-            }));
-            runUnitTestScenario("Sequenced peer changes should not be rebased over changes from the same peer if those earlier changes were not rebased", [
-                { seq: 1, type: "Pull", ref: 0, from: peer1 },
-                { seq: 2, type: "Pull", ref: 0, from: peer1 },
-                { seq: 3, type: "Pull", ref: 2, from: peer2 },
-                { seq: 4, type: "Pull", ref: 0, from: peer1 },
-            ], new ConstrainedTestChangeRebaser((change, over) => {
-                // This is the only rebase that should happen
-                assert.deepEqual(change.intentions, [4]);
-                assert.deepEqual(over.change.intentions, [3]);
-                return true;
-            }));
-        });
-        const scenarios = [
-            { rebasedEditCount: 1, trunkEditCount: 1 },
-            { rebasedEditCount: 10, trunkEditCount: 1 },
-            { rebasedEditCount: 1, trunkEditCount: 10 },
-            { rebasedEditCount: 7, trunkEditCount: 3 },
-        ];
-        describe("Local commit rebasing", () => {
-            for (const { rebasedEditCount: L, trunkEditCount: T } of scenarios) {
-                // This test simulates the following inputs to the EditManager:
-                //   - Add local edit L1 with a ref seq# pointing to edit 0
-                //   ...(not incrementing the ref seq# for each L)
-                //   - Add local edit Lc with a ref seq# pointing to edit 0
-                //   => we start measuring from here
-                //   - Add trunk edit T1 with a ref seq# pointing to edit 0
-                //   ...(incrementing the ref seq# for each T)
-                //   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1
-                // This defines the following relationships between edits:
-                //   (0)─(T1)─...─(Tc)
-                //     └───────────────(L1)─...─(Lc)
-                // Before we start measuring, the EditManager has the following structure:
-                //   (0)
-                //     └───────────────(L1)─...─(Lc)
-                // By the end of the test, the EditManager has the following structure:
-                //   (0)─(T1)─...─(Tc)
-                //                   └─(L1)─...─(Lc)
-                it(`Rebase ${L} local commits over ${T} trunk commits`, () => {
-                    const rebaser = new NoOpChangeRebaser();
-                    const manager = testChangeEditManagerFactory({ rebaser }).manager;
-                    const run = rebaseLocalEditsOverTrunkEdits(L, T, manager, () => TestChange.emptyChange, true);
-                    rebaser.rebasedCount = 0;
-                    rebaser.invertedCount = 0;
-                    rebaser.composedCount = 0;
-                    run();
-                    const actual = {
-                        rebased: rebaser.rebasedCount,
-                        inverted: rebaser.invertedCount,
-                        composed: rebaser.composedCount,
-                    };
-                    const expected = {
-                        // As part of rebasing the local branch over the trunk edits,
-                        //   the Ith local edit on the branch is rebased over the composition of...
-                        //     - the inverse of each local edit before it
-                        //     - the new trunk edit
-                        //     - the rebased version of each local edit before it
-                        //   This adds up to 1 rebase for the Ith edit.
-                        //   Summing over all L edits gives us: L
-                        // Summing over all T branch rebases gives us: TL
-                        // Which simplifies to:
-                        rebased: T * L,
-                        // As part of rebasing the local branch over the trunk edits,
-                        //   the Ith local edit on the branch is inverted once
-                        //   Summing over all L edits gives us L
-                        // Summing over all T branch rebases gives us: TL
-                        inverted: T * L,
-                        // As part of rebasing the local branch over the trunk edits,
-                        //   we compose the new trunk edit: 1
-                        //   then for the Ith local edit on the branch we compose...
-                        //     - the inverse of the local edit: 1
-                        //     - the previous composition: 1
-                        //     - the rebased version of the local edit: 1
-                        //   This adds up to 3L + 1 changes composed per branch rebase.
-                        // Summing over all T branch rebases gives us:
-                        composed: T * (3 * L + 1),
-                    };
-                    assert.deepEqual(actual, expected);
-                });
-            }
-        });
-        describe("Peer commit rebasing for peer with fixed seq ref#", () => {
-            for (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {
-                // This test simulates the following inputs to the EditManager:
-                //   - Add trunk edit T1 with a ref seq# pointing to edit 0
-                //   ...(incrementing the ref seq# for each T)
-                //   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1
-                //   => we start measuring from here
-                //   - Add peer edit P1 with a ref seq# pointing to edit 0
-                //   ...(not incrementing the ref seq# for each P)
-                //   - Add peer edit Pc with a ref seq# pointing to edit 0
-                // This defines the following relationships between edits:
-                //   (0)─(T1)─...─(Tc)
-                //     └───────────────(P1)─...─(Pc)
-                // Before we start measuring, the EditManager has the following structure:
-                //   (0)─(T1)─...─(Tc)
-                //     └─
-                // By the end of the test, the EditManager has the following structure:
-                //   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)
-                //                                 └─
-                it(`Rebase ${P} peer commits over ${T} trunk commits`, () => {
-                    const rebaser = new NoOpChangeRebaser();
-                    const manager = testChangeEditManagerFactory({ rebaser }).manager;
-                    const run = rebasePeerEditsOverTrunkEdits(P, T, manager, () => TestChange.emptyChange, true);
-                    rebaser.rebasedCount = 0;
-                    rebaser.invertedCount = 0;
-                    rebaser.composedCount = 0;
-                    run();
-                    const actual = {
-                        rebased: rebaser.rebasedCount,
-                        inverted: rebaser.invertedCount,
-                        composed: rebaser.composedCount,
-                    };
-                    const expected = {
-                        // As part of rebasing the new peer edit to the tip of the trunk,
-                        //   For the Ith peer edit, we rebase it over...
-                        //     - the inverse of the peer edits on the peer branch: I - 1
-                        //     - the trunk edits that were not contributed by that peer: T
-                        //     - the the rebased version of the peer edits (now on the trunk): I - 1
-                        //   This adds up to T + 2I - 2 rebases for the Ith edit.
-                        //   Summing over all P edits transforms I into P(P + 1)/2
-                        //   Which gives us: PT + 2P(P + 1)/2 - 2P
-                        //   Which simplifies to:
-                        rebased: P * (T + P - 1),
-                        // As part of rebasing the new peer edit to the tip of the trunk,
-                        //   For the Ith peer edit, we invert...
-                        //     - each peer edit before it: I - 1
-                        //   Summing over all P edits transforms I into P(P + 1)/2
-                        //   Which gives us: P(P + 1)/2 - 1
-                        //   However, we cache the inverse of each change, so overall we only invert once each peer
-                        //   edit that has peer edit after it.
-                        inverted: P - 1,
-                        // As part of rebasing the local branch edit over the peer edit,
-                        //   For the Ith peer edit, we compose...
-                        //     - the rebased version of that peer edit: 1
-                        //   Summing over all P edits transforms gives us: P
-                        // Note: this composition is only needed to bake the RevisionTag into the changeset.
-                        composed: P,
-                    };
-                    assert.deepEqual(actual, expected);
-                });
-            }
-        });
-        describe("Peer commit rebasing for peer with advancing (but not tip) seq ref#", () => {
-            for (const editCount of [1, 2, 10]) {
-                // This test simulates the following inputs to the EditManager:
-                //   - Add trunk edit T1 with a ref seq# pointing to edit 0
-                //   ...(incrementing the ref seq# for each T)
-                //   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1
-                //   => we start measuring from here
-                //   - Add peer edit P1 with a ref seq# pointing to edit 0
-                //   ...(incrementing the ref seq# for each P)
-                //   - Add peer edit Pc with a ref seq# pointing to edit Tc-1
-                // This defines the following relationships between edits:
-                //   (0)─(T1)─...─(Tc─1)─(Tc)
-                //     |    |          └──────(P1)─(P2)─...─(Pc)
-                //     |    └─────────────────(P1)─(P2)
-                //     └──────────────────────(P1)
-                // Before we start measuring, the EditManager has the following structure:
-                //   (0)─(T1)─...─(Tc─1)─(Tc)
-                //     └─
-                // By the end of the test, the EditManager has the following structure:
-                //   (0)─(T1)─...─(Tc─1)─(Tc)─(P1)─(P2)─...─(Pc)
-                //                                             └─
-                it(`for ${editCount} peer commits and ${editCount} trunk commits`, () => {
-                    const rebaser = new NoOpChangeRebaser();
-                    const manager = testChangeEditManagerFactory({ rebaser }).manager;
-                    const run = rebaseAdvancingPeerEditsOverTrunkEdits(editCount, manager, () => TestChange.emptyChange, true);
-                    rebaser.rebasedCount = 0;
-                    rebaser.invertedCount = 0;
-                    rebaser.composedCount = 0;
-                    run();
-                    const actual = {
-                        rebased: rebaser.rebasedCount,
-                        inverted: rebaser.invertedCount,
-                        composed: rebaser.composedCount,
-                    };
-                    const P = editCount;
-                    const T = editCount;
-                    const expected = {
-                        // As part of rebasing the peer branch that contains the prior peer edits,
-                        //   we rebase all edits on the branch over the one new trunk edit.
-                        //   For the Ith peer edit there are I - 1 edits to rebase.
-                        //     the Kth local edit on the branch is rebased over the composition of...
-                        //       - the inverse of each local edit before it
-                        //       - the new trunk edit
-                        //       - the rebased version of each local edit before it
-                        //     This adds up to 1 rebase for the Kth edit.
-                        //     Summing over all I - 1 edits gives us I - 1 rebases for the Ith branch rebase.
-                        //   Summing over all P edits transforms I into P(P + 1)/2
-                        //   This gives us: P(P + 1)/2 - P
-                        //   Which simplifies to: (P² + P)/2 - P
-                        // As part of rebasing the new peer edit to the tip of the trunk,
-                        //   For the Ith peer edit, we rebase it over...
-                        //     - the inverse of the peer edits on the peer branch: I - 1
-                        //     - the trunk edits that were not contributed by that peer: T - (I - 1)
-                        //     - the the rebased version of the peer edits (now on the trunk): I - 1
-                        //   This adds up to I - 1 + T rebases for the Ith edit.
-                        //   Summing over all P edits transforms I into P(P + 1)/2
-                        //   This gives us: P(P + 1)/2 - P + PT
-                        //   Which simplifies to: (P² - P)/2 + PT
-                        // Adding both terms and simplifying:
-                        rebased: P * (P + T - 1),
-                        // As part of rebasing the peer branch that contains the prior peer edits,
-                        //   For the Ith peer edit there are I-1 edits to invert.
-                        //   Summing over all P transforms I into P(P + 1)/2
-                        //   Which gives us: P(P + 1)/2 - P
-                        //   Which simplifies to: P(P - 1)/2
-                        // As part of rebasing the new peer edit to the tip of the trunk,
-                        //   For the Ith peer edit, there are I - 1 edits to invert.
-                        //   Summing over all P transforms I into P(P + 1)/2
-                        //   Which gives us: P(P + 1)/2 - P
-                        //   Which simplifies to: P(P - 1)/2
-                        // Adding both terms:
-                        inverted: (P - 1) * P,
-                        // As part of rebasing the peer branch that contains the prior peer edits,
-                        //   we compose the new trunk edit: 1
-                        //   then for the Ith peer edit there are I - 1 edits to rebase.
-                        //     for each of them we compose...
-                        //       - the inverse of the local edit: 1
-                        //       - the previous composition: 1
-                        //       - the rebased version of the local edit: 1
-                        //     This adds up to 3I - 3 peer changes composed per branch rebase.
-                        //   This adds up to 3I - 2 changes composed per branch rebase.
-                        // Summing over all P branch rebases transforms I into P(P + 1)/2
-                        // Which gives us: 3P(P + 1)/2 - 2P
-                        // Which simplifies to: (3P² - P)/2
-                        // Which gives us: (3P² - P)/2 - 1
-                        // From that, we have to subtract 1 for the first branch rebase, which is skipped.
-                        // As part of updating the local branch,
-                        //   for the Ith peer edit we compose that peer edit: 1
-                        //   Summing over all P branch rebases gives us: P
-                        // Adding both terms and simplifying:
-                        composed: (3 * P ** 2 + P) / 2 - 1,
-                    };
-                    assert.deepEqual(actual, expected);
-                });
-            }
-        });
-        describe("Single peer commit on top of existing peer branch", () => {
-            describe("with peer commit ref# to the trunk edit that the existing peer branch should rebase over", () => {
-                for (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {
-                    // This test simulates the following inputs to the EditManager:
-                    //   - Add trunk edit T1 with a ref seq# pointing to edit 0
-                    //   ...(incrementing the ref seq# for each T)
-                    //   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1
-                    //   - Add peer edit P1 with a ref seq# pointing to edit 0
-                    //   ...(not incrementing the ref seq# for each P)
-                    //   - Add peer edit Pc with a ref seq# pointing to edit 0
-                    //   => we start measuring from here
-                    //   - Add peer edit P+ with a ref seq# pointing to edit Tc
-                    // This defines the following relationships between edits:
-                    //   (0)─(T1)─...─(Tc)
-                    //     |             └─(P1)─...─(Pc)─(P+)
-                    //     └───────────────(P1)─...─(Pc)
-                    // Before we start measuring, the EditManager has the following structure:
-                    //   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)
-                    //     └───────────────(P1)─...─(Pc)
-                    // By the end of the test, the EditManager has the following structure:
-                    //   (0)─(T1)─...─(Tc)─(P1)─...─(Pc)─(P+)
-                    //                                      └─
-                    it(`For an existing peer branch with ${P} commits unaware of ${T} trunk commits`, () => {
-                        const rebaser = new NoOpChangeRebaser();
-                        const manager = testChangeEditManagerFactory({ rebaser }).manager;
-                        rebasePeerEditsOverTrunkEdits(P, T, manager, () => TestChange.emptyChange);
-                        rebaser.rebasedCount = 0;
-                        rebaser.invertedCount = 0;
-                        rebaser.composedCount = 0;
-                        manager.addSequencedChange({
-                            change: TestChange.emptyChange,
-                            revision: mintRevisionTag(),
-                            sessionId: "peer",
-                        }, brand(T + P + 1), brand(T));
-                        const actual = {
-                            rebased: rebaser.rebasedCount,
-                            inverted: rebaser.invertedCount,
-                            composed: rebaser.composedCount,
-                        };
-                        const expected = {
-                            // As part of rebasing the peer branch that contains the phase-1 edits,
-                            //   we realize that the trunk already contains those edits.
-                            //   They therefore undergo no rebasing.
-                            // As part of rebasing P+ to the tip of the trunk,
-                            //   we realize that it is based on the tip of the trunk.
-                            //   It therefore undergoes no rebasing.
-                            rebased: 0,
-                            // As part of rebasing the peer branch that contains the phase-1 edits,
-                            //   we realize that the trunk already contains those edits.
-                            //   They therefore undergo no inverting.
-                            // As part of rebasing P+, we invert...
-                            //   - each of the phase-1 peer edits: P
-                            // Adding both terms and simplifying:
-                            inverted: P,
-                            // As part of rebasing the peer branch that contains the phase-1 edits, we compose...
-                            //   - the trunk edits: T
-                            //   then for the Ith local edit on the branch we compose...
-                            //     - the inverse of the local edit: 1
-                            //     - the previous composition: 1
-                            //     - the rebased version of the local edit: 1
-                            //   This adds up to 3 edits composed per edit on the branch
-                            // Summing for all P edit, this gives us: T + 3P
-                            // As part of rebasing the local branch, we compose...
-                            //   - the phase-2 peer edit: 1
-                            // Note: this composition is only needed to bake the RevisionTag into the changeset.
-                            // Adding both terms:
-                            composed: T + 3 * P + 1,
-                        };
-                        assert.deepEqual(actual, expected);
-                    });
-                }
-            });
-            describe("with peer commit ref# to the trunk edit before the trunk edit that the existing peer branch should rebase over", () => {
-                for (const { rebasedEditCount: P, trunkEditCount: T } of scenarios) {
-                    // This test simulates the following inputs to the EditManager:
-                    //   - Add trunk edit T1 with a ref seq# pointing to edit 0
-                    //   ...(incrementing the ref seq# for each T)
-                    //   - Add trunk edit Tc with a ref seq# pointing to edit Tc-1
-                    //   - Add trunk edit T+ with a ref seq# pointing to edit Tc
-                    //   - Add peer edit P1 with a ref seq# pointing to edit 0
-                    //   ...(not incrementing the ref seq# for each P)
-                    //   - Add peer edit Pc with a ref seq# pointing to edit 0
-                    //   => we start measuring from here
-                    //   - Add peer edit P+ with a ref seq# pointing to edit Tc
-                    // This defines the following relationships between edits:
-                    //   (0)─(T1)─...─(Tc)─(T+)
-                    //     |             └──────(P1)─...─(Pc)─(P+)
-                    //     └────────────────────(P1)─...─(Pc)
-                    // Before we start measuring, the EditManager has the following structure:
-                    //   (0)─(T1)─...─(Tc)─(T+)
-                    //     └────────────────────(P1)─...─(Pc)
-                    // By the end of the test, the EditManager has the following structure:
-                    //   (0)─(T1)─...─(Tc)─(T+)─(P1)─...─(Pc)─(P+)
-                    //                   └──(P1)─...─(Pc)─(P+)
-                    it(`For an existing peer branch with ${P} commits unaware of ${T}+1 trunk commits`, () => {
-                        const rebaser = new NoOpChangeRebaser();
-                        const manager = testChangeEditManagerFactory({ rebaser }).manager;
-                        rebasePeerEditsOverTrunkEdits(P, T + 1, manager, () => TestChange.emptyChange);
-                        rebaser.rebasedCount = 0;
-                        rebaser.invertedCount = 0;
-                        rebaser.composedCount = 0;
-                        manager.addSequencedChange({
-                            change: TestChange.emptyChange,
-                            revision: mintRevisionTag(),
-                            sessionId: "peer",
-                        }, brand(T + P + 2), brand(T));
-                        const actual = {
-                            rebased: rebaser.rebasedCount,
-                            inverted: rebaser.invertedCount,
-                            composed: rebaser.composedCount,
-                        };
-                        const expected = {
-                            // As part of rebasing the peer branch that contains the phase-1 edits,
-                            //   we rebase all P edits on the branch over T trunk edits.
-                            //     The Ith local edit on the branch is rebased over the composition of...
-                            //       - the inverse of each local edit before it
-                            //       - the T trunk edits
-                            //       - the rebased version of each local edit before it
-                            //     This adds up to 1 rebase for the Ith edit.
-                            //   Summing over all P edits gives us P rebases.
-                            // As part of rebasing P+,
-                            //   we rebase it over...
-                            //     - the inverse of each peer edit before it: P
-                            //       (these are based on commit Tc)
-                            //     - the one remaining trunk edit T+: 1
-                            //     - each peer fully rebased version of each peer edit before it: P
-                            //       (these are based on commit T+)
-                            //   This adds up to 2P + 1 rebases.
-                            // Adding both terms and simplifying:
-                            rebased: 3 * P + 1,
-                            // As part of rebasing the peer branch,
-                            //   we invert...
-                            //     - each of the phase-1 peer edits: P
-                            //       (these are based on commit 0)
-                            //   This adds up P inverts.
-                            // As part of rebasing P+ to the tip of the trunk,
-                            //   we invert...
-                            //     - each of the phase-1 peer edits: P
-                            //       (these are based on commit Tc)
-                            //   This adds up P inverts.
-                            // Adding both terms:
-                            inverted: 2 * P,
-                            // As part of rebasing the peer branch that contains the phase-1 edits, we compose...
-                            //   - the trunk edits: T
-                            //   then for the Ith local edit on the branch we compose...
-                            //     - the inverse of the local edit: 1
-                            //     - the previous composition: 1
-                            //     - the rebased version of the local edit: 1
-                            //   This adds up to 3 edits composed per edit on the branch
-                            // Summing for all P edit, this gives us: T + 3P
-                            // As part of rebasing the local branch,
-                            //   we compose...
-                            //     - the phase-2 peer edit P+: 1
-                            //   This adds up 1 edit composed.
-                            // Note: this composition is only needed to bake the RevisionTag into the changeset.
-                            // Adding both terms:
-                            composed: T + 3 * P + 1,
-                        };
-                        assert.deepEqual(actual, expected);
-                    });
-                }
-            });
-        });
-    });
-}
-//# sourceMappingURL=editManagerPerf.test.js.map