@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

package/lib/test/Summary.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Summary.tests.js","sourceRoot":"","sources":["../../src/test/Summary.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AACzD,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAC1B,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAE,MAAM,EAAoB,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,iCAAiC,EAAE,MAAM,kBAAkB,CAAC;AAErE,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EACN,aAAa,EACb,eAAe,EAGf,WAAW,GACX,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAC;AAElE,OAAO,EAAE,WAAW,EAAE,oBAAoB,EAAqB,MAAM,6BAA6B,CAAC;AACnG,OAAO,EAAE,4BAA4B,EAA6B,MAAM,yBAAyB,CAAC;AAClG,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACjE,OAAO,EACN,6BAA6B,EAC7B,iBAAiB,EACjB,8BAA8B,EAC9B,qBAAqB,GACrB,MAAM,2BAA2B,CAAC;AAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,EAAE,eAAe,CAAC,CAAC;AAE/D,wHAAwH;AACxH,MAAM,UAAU,cAAc,CAAC,UAAsB;IACpD,MAAM,IAAI,GAAG,IAAI,wBAAwB,CAAC,UAAU,CAAC,cAAc,EAAE,EAAE,UAAU,CAAC,CAAC;IAEnF,SAAS,SAAS,CAAC,OAAiB;QACnC,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,UAAU,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;IACtF,CAAC;IAED;;;;;;;;;;OAUG;IAEH,MAAM,WAAW,GAAG,CAAC,CAAC;IACtB,MAAM,cAAc,GAAG,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACjC,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IAEjC,SAAS,CAAC;QACT,MAAM,CAAC,KAAK,CACX;YACC;gBACC,UAAU,EAAE,GAAG;gBACf,UAAU,EAAE,GAAG;gBACf,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL;4BACC,UAAU,EAAE,GAAG;4BACf,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE;4BAChC,OAAO,EAAE,SAAS;yBAClB;qBACD;iBACD;aACD;SACD,EACD,WAAW,CACX;QACD,MAAM,CAAC,KAAK,CACX;YACC;gBACC,UAAU,EAAE,MAAM;gBAClB,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE;gBAChC,MAAM,EAAE;oBACP,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;oBAC5C,KAAK,EAAE;wBACN,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE,EAAE;wBACrD,WAAW;wBACX,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE;qBACpC;iBACD;aACD;SACD,EACD,cAAc,CACd;QACD,MAAM,CAAC,MAAM,CACZ,cAAc,EACd,WAAW,CAAC,SAAS,CAAC;YACrB,KAAK,EAAE,MAAoB;YAC3B,MAAM,EAAE,UAAU,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC;SAC1D,CAAC,CACF;KACD,CAAC,CAAC;IAEH;;;;;;;;OAQG;IAEH,SAAS,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,SAAS,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC7B,SAAS,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;KACvC;AACF,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,qBAAqB,CAAC,WAAwB,EAAE,gBAAyB;IAC9F,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,MAAM,8BAA8B,CAAC;QACzE,WAAW;QACX,gBAAgB;QAChB,gBAAgB,EAAE,gBAAgB;KAClC,CAAC,CAAC;IAEH,IAAI,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;QACvC,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,sCAAmD,EAAE,eAAe,CAAC,CAAC;QAC5G,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC;QACrE,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAClD,MAAM,sCAAsC,GAAsB;YACjE,OAAO,EAAE,WAAW,CAAC,MAAM;YAC3B,WAAW,EAAE,gBAAgB;gBAC5B,CAAC,CAAC;oBACA,QAAQ,CAAC,qBAAqB,CAAC,WAAW,CAAC,UAAU,CAAC;oBACtD,UAAU,CAAC,kBAAkB,CAAC,OAAO,CAAC,eAAe,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;iBAC7E;gBACH,CAAC,CAAC,SAAS;YACZ,WAAW,EAAE;gBACZ,OAAO,EAAE,EAAE;gBACX,UAAU,EAAE,EAAE;aACd;YACD,YAAY,EAAE,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC;YAC1C,eAAe,EAAE,QAAQ,CAAC,eAAe,EAAE;SAC3C,CAAC;QAEF,IAAI,CAAC,WAAW,CAAC,sCAAsC,CAAC,CAAC;KACzD;IAED,cAAc,CAAC,IAAI,CAAC,CAAC;IAErB,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;IAC9C,OAAO,IAAI,CAAC;AACb,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAa;IAC5C,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,qGAAqG;QACrG,MAAM,cAAc,GAAG,IAAI,mBAAmB,EAAE,CAAC;QAEjD,MAAM,EACL,4BAA4B,EAC5B,0BAA0B,EAC1B,4BAA4B,EAC5B,4BAA4B,EAC5B,0BAA0B,EAC1B,wBAAwB,EACxB,SAAS,GACT,GAAG,oBAAoB,EAAE,CAAC;QAE3B,6GAA6G;QAC7G,8GAA8G;QAC9G,0CAA0C;QAC1C,MAAM,WAAW,GAAgC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACvE,MAAM,KAAK,GAAsB,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CACzD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC,CAC1D,CAAC;QAEF,8EAA8E;QAC9E,EAAE,CAAC,IAAI,CAAC,oBAAoB,EAAE,KAAK,IAAI,EAAE;YACxC,MAAM,oBAAoB,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;YACnC,MAAM,YAAY,GAA0C,KAAK,EAAE,OAAO,EAAE,EAAE,CAC7E,8BAA8B,iBAAG,WAAW,EAAE,WAAW,CAAC,MAAM,IAAK,OAAO,EAAG,CAAC;YAEjF,MAAM,uBAAuB,GAAG,KAAK,EAAE,gBAAyB,EAAuB,EAAE,CACxF,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YAE7D,EAAE,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;gBACrF,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;gBAEzD,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;gBACtD,YAAY,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;gBACjE,MAAM,CAAC,qBAAqB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAC1D,qBAAqB,CAAC,YAAY,CAAC,WAAW,CAAC,CAC/C,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,oCAAoC,EAAE,KAAK,IAAI,EAAE;gBACnD,MAAM,IAAI,GAAG,MAAM,uBAAuB,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,OAAO,GAA8C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;gBACpG,MAAM,eAAe,GAA4B,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBACxF,kIAAkI;gBAClI,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,eAAe,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpE,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;YAChD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;gBAChD,MAAM,IAAI,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAC7D,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,CACxC,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;gBACzC,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;oBAClD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,CAAC;oBACvD,uEAAuE;oBACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtC,qEAAqE;oBACrE,MAAM,gBAAgB,GAAG,CAAC,MAAM,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;oBAC9E,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/E,YAAY,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;oBAC3C,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;oBAC/C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACzD,MAAM,YAAY,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,CAAC;oBACzD,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAClD,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;gBACrC,EAAE,CAAC,aAAa,EAAE,KAAK,IAAI,EAAE;oBAC5B,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACzD,iFAAiF;oBACjF,2BAA2B;oBAC3B,qEAAqE;oBACrE,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;oBAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC;oBACjE,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBACnD,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;gBAChD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;gBACzD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBACpC,MAAM,OAAO,GAAG,WAAW,CAAC,4BAA4B,EAAE,cAAc,CAAC,CAAC;gBAC1E,MAAM,aAAa,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;gBACpD,MAAM,qBAAqB,GAAsB;oBAChD,aAAa,EAAE,WAAW,CAAC,MAAM;oBACjC,WAAW,EAAE,SAAS;iBACtB,CAAC;gBACF,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;YAC7D,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;YACnC,MAAM,YAAY,GAA0C,KAAK,EAAE,OAAO,EAAE,EAAE,CAC7E,8BAA8B,iBAAG,WAAW,EAAE,WAAW,CAAC,MAAM,IAAK,OAAO,EAAG,CAAC;YAEjF,MAAM,uBAAuB,GAAG,KAAK,EAAE,gBAAyB,EAAuB,EAAE,CACxF,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;YAE7D,EAAE,CAAC,oCAAoC,EAAE,KAAK,IAAI,EAAE;;gBACnD,MAAM,IAAI,GAAG,MAAM,uBAAuB,CAAC,KAAK,CAAC,CAAC;gBAClD,MAAM,OAAO,GAAwC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;gBAC9F,MAAM,eAAe,GAAsB,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;gBAClF,kIAAkI;gBAClI,aAAa,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,aAAa,OAAC,eAAe,CAAC,WAAW,0CAAE,OAAO,CAAC,CAAC,EAAE,CAAC;gBACvG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;gBAChD,MAAM,IAAI,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAC7D,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,CACxC,CAAC;gBACF,MAAM,CAAC,MAAM,4BAA4B,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAC7E,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;gBACzC,EAAE,CAAC,mCAAmC,EAAE,KAAK,IAAI,EAAE;oBAClD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/C,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,CAAC;oBACvD,uEAAuE;oBACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtC,qEAAqE;oBACrE,MAAM,gBAAgB,GAAG,CAAC,MAAM,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;oBAC9E,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,gBAAgB,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/E,YAAY,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;oBAC3C,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC;gBACzD,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,gCAAgC,EAAE,KAAK,IAAI,EAAE;oBAC/C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;oBAC/C,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACzD,MAAM,YAAY,GAAG,MAAM,uBAAuB,CAAC,KAAK,CAAC,CAAC;oBAC1D,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAClD,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;gBAC1C,EAAE,CAAC,aAAa,EAAE,KAAK,IAAI,EAAE;oBAC5B,MAAM,YAAY,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,CAAC;oBACzD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACzD,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;oBACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAC7D,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,CACxC,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,gBAAgB,EAAE,KAAK,IAAI,EAAE;oBAC/B,MAAM,EAAE,IAAI,EAAE,kBAAkB,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBAC5D,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACzD,kEAAkE;oBAClE,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;oBAC9C,MAAM,YAAY,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,CAAC;oBACzD,MAAM,sBAAsB,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;oBACjD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAC7D,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,CACpC,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,6DAA6D,EAAE,KAAK,IAAI,EAAE;oBAC5E,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,MAAM,8BAA8B,CAAC;wBACvF,WAAW,EAAE,WAAW,CAAC,MAAM;qBAC/B,CAAC,CAAC;oBACH,cAAc,CAAC,YAAY,CAAC,CAAC;oBAC7B,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM,8BAA8B,CAAC;wBAC3D,WAAW,EAAE,WAAW,CAAC,MAAM;wBAC/B,kBAAkB;qBAClB,CAAC,CAAC;oBACH,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;oBAC9C,MAAM,sBAAsB,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBACjD,MAAM,sBAAsB,CAAC,IAAI,EAAE,MAAM,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;gBAC3F,CAAC,CAAC,CAAC;gBAEH,EAAE,CAAC,sEAAsE,EAAE,KAAK,IAAI,EAAE;oBACrF,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBAEzD,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;oBACtD,YAAY,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;oBACjE,MAAM,CACL,iCAAiC,CAChC,IAAI,CAAC,WAAW,EAChB,IAAI,EACJ,YAAY,CAAC,WAAW,EACxB,YAAY,CACZ,CACD,CAAC;gBACH,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iCAAiC,EAAE,KAAK,IAAI,EAAE;gBAChD,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,YAAY,CAAC,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,qBAAqB,CAAC,4BAA4B,CAAC,CAAC;gBACzD,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;gBACpC,MAAM,OAAO,GAAG,WAAW,CAAC,4BAA4B,EAAE,cAAc,CAAC,CAAC;gBAC1E,MAAM,aAAa,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;gBACpD,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,aAAa,CAAC,CAAC;gBACzD,MAAM,qBAAqB,GAAsB;oBAChD,aAAa,EAAE,WAAW,CAAC,MAAM;oBACjC,WAAW,EAAE,SAAS;oBACtB,mBAAmB,EAAE,WAAW;oBAChC,cAAc;oBACb,4FAA4F;oBAC5F,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,aAAa,CAAC,GAAG,aAAa,GAAG,aAAa;wBACjF,WAAW,KAAK,CAAC;wBAChB,CAAC,CAAC,WAAW,GAAG,CAAC;wBACjB,CAAC,CAAC,WAAW;iBACf,CAAC;gBACF,MAAM,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;YAC7D,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,SAAkB,EAAE,OAAgB;IAChE,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;AAC5B,CAAC;AAED,KAAK,UAAU,sBAAsB,CACpC,WAAuB,EACvB,WAAuB,EACvB,cAAc,GAAG,IAAI;IAErB,IACC,CAAC,iCAAiC,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,EAC7G;QACD,MAAM,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;KAClD;IAED,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE;QAC1D,MAAM,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;KACrD;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClD,MAAM,SAAS,GAAG,CAAI,GAAM,EAAK,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAM,CAAC;QAEzE,MAAM,KAAK,GAAG,SAAS,CACtB,cAAc,CAAC,MAAM,WAAW,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CACxE,WAAW,CAAC,qBAAqB,CAAC,EAAE,CAAC,CACrC,CACD,CAAC;QACF,MAAM,KAAK,GAAG,SAAS,CACtB,cAAc,CAAC,MAAM,WAAW,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CACxE,WAAW,CAAC,qBAAqB,CAAC,EAAE,CAAC,CACrC,CACD,CAAC;QACF,IAAI,cAAc,EAAE;YACnB,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,qCAAqC,CAAC,GAAG,CAAC,CAAC;SAC9E;aAAM;YACN,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,uCAAuC,CAAC,GAAG,CAAC,CAAC;SAChG;KACD;AACF,CAAC;AAED,SAAS,oBAAoB;IAS5B,MAAM,4BAA4B,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,MAAM,CAAC,CAAC;IACpG,MAAM,0BAA0B,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7G,MAAM,4BAA4B,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,iCAAiC,CAAC,EAAE,MAAM,CAAC,CAAC;IACjH,MAAM,4BAA4B,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,MAAM,CAAC,CAAC;IACpG,MAAM,0BAA0B,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7G,MAAM,wBAAwB,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,4BAA4B,CAAC,EAAE,MAAM,CAAC,CAAC;IACxG,MAAM,SAAS,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,CAAC,EAAE,MAAM,CAAC,CAAC;IAE/E,OAAO;QACN,4BAA4B;QAC5B,0BAA0B;QAC1B,4BAA4B;QAC5B,4BAA4B;QAC5B,0BAA0B;QAC1B,wBAAwB;QACxB,SAAS;KACT,CAAC;AACH,CAAC;AAED,KAAK,UAAU,oBAAoB;IAClC,IAAI;QACH,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;KACzB;IAAC,WAAM;QACP,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;KACxB;IAED,MAAM,qBAAqB,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACpF,MAAM,mBAAmB,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACnF,MAAM,qBAAqB,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACpF,MAAM,mBAAmB,GAAG,MAAM,qBAAqB,CAAC,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEnF,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,qBAAqB,CAAC,qBAAqB,EAAE,CAAC,CAAC;IACvG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,mBAAmB,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAChH,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,oBAAoB,CAAC,EAAE,qBAAqB,CAAC,qBAAqB,EAAE,CAAC,CAAC;IACvG,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,+BAA+B,CAAC,EAAE,mBAAmB,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAEhH,MAAM,KAAK,GAAG,MAAM,4BAA4B,CAAC,qBAAqB,CAAC,CAAC;IACxE,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzB,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,kBAAkB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IAE7E,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,kBAAkB,EAAE,GAAG,MAAM,8BAA8B,CAAC;QACvF,WAAW,EAAE,WAAW,CAAC,MAAM;QAC/B,gBAAgB,EAAE,IAAI;KACtB,CAAC,CAAC;IACH,YAAY,CAAC,WAAW,CAAC,qBAAqB,CAAC,WAAW,EAAE,CAAC,CAAC;IAC9D,MAAM,kBAAkB,CAAC,kBAAkB,EAAE,CAAC;IAC9C,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,4BAA4B,CAAC,EAAE,YAAY,CAAC,qBAAqB,EAAE,CAAC,CAAC;AACvG,CAAC;AAED,2EAA2E;AAC3E,MAAM,wBAAwB;IAM7B,YAAmC,WAAwB,EAAmB,UAAsB;QAAjE,gBAAW,GAAX,WAAW,CAAa;QAAmB,eAAU,GAAV,UAAU,CAAY;QAH5F,gBAAW,GAAG,CAAC,CAAC;QAIvB,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;YAC5C,MAAM,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC,cAAc,KAAK,wBAAwB,CAAC,SAAS,CAAC,CAAC;SACxG;aAAM;YACN,MAAM,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC,cAAc,KAAK,wBAAwB,CAAC,SAAS,CAAC,CAAC;YACxG,IAAI,CAAC,oBAAoB,GAAG,IAAI,YAAY,CAAC,wBAAwB,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC;SAClG;IACF,CAAC;IAEM,aAAa;QACnB,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,wBAAwB,CAAC,aAAa,CAAW,CAAC;IAC9F,CAAC;IAEM,aAAa;QACnB,IAAI,IAAI,CAAC,WAAW,KAAK,WAAW,CAAC,MAAM,EAAE;YAC5C,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;SAC9D;aAAM;YACN,OAAO,IAAI,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC;SACxC;IACF,CAAC;IAEO,eAAe;QACtB,MAAM,CAAC,IAAI,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,IAAI,CAAC,oBAAoB,CAAC,oBAAoB,EAAE,CAAa,CAAC;IAC3G,CAAC;;AA7BsB,kCAAS,GAAG,sCAAmD,CAAC;AAC/D,sCAAa,GAAG,sCAAsC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport * as fs from 'fs';\nimport { join } from 'path';\nimport { IsoBuffer } from '@fluidframework/common-utils';\nimport { expect } from 'chai';\nimport { v5 } from 'uuid';\nimport { Change, StablePlace, StableRange } from '../ChangeTypes';\nimport { assert, RecursiveMutable } from '../Common';\nimport { areRevisionViewsSemanticallyEqual } from '../EditUtilities';\nimport { EditId, NodeId, SessionId, StableId, TraitLabel } from '../Identifiers';\nimport { initialTree } from '../InitialTree';\nimport {\n\teditsPerChunk,\n\treservedIdCount,\n\tSharedTreeSummary,\n\tSharedTreeSummary_0_0_2,\n\tWriteFormat,\n} from '../persisted-types';\nimport { getChangeNodeFromView } from '../SerializationUtilities';\nimport { SharedTree } from '../SharedTree';\nimport { deserialize, getSummaryStatistics, SummaryStatistics } from '../SummaryBackCompatibility';\nimport { getUploadedEditChunkContents, UploadedEditChunkContents } from '../SummaryTestUtilities';\nimport { IdCompressor } from '../id-compressor';\nimport { convertEditIds } from '../IdConversion';\nimport { MutableStringInterner } from '../StringInterner';\nimport { sequencedIdNormalizer } from '../NodeIdUtilities';\nimport { expectDefined } from './utilities/TestCommon';\nimport { TestFluidSerializer } from './utilities/TestSerializer';\nimport {\n\tgetIdNormalizerFromSharedTree,\n\tmakeNodeIdContext,\n\tsetUpLocalServerTestSharedTree,\n\ttestDocumentsPathBase,\n} from './utilities/TestUtilities';\n\nconst directory = join(testDocumentsPathBase, 'summary-tests');\n\n/** Applies a smattering of interesting edits to the given shared tree in an attempt to cover a variety of use cases  */\nexport function applyTestEdits(sharedTree: SharedTree): void {\n\tconst uuid = new DeterministicIdGenerator(sharedTree.getWriteFormat(), sharedTree);\n\n\tfunction applyEdit(changes: Change[]): void {\n\t\tconst internalChanges = changes.map((c) => sharedTree.internalizeChange(c));\n\t\tsharedTree.applyEditInternal({ id: uuid.getNextEditId(), changes: internalChanges });\n\t}\n\n\t/**\n\t * Build a tree that looks like the following:\n\t *\n\t *          ROOT\n\t *            |   'root'\n\t *         [root]\n\t * 'left'  /    \\  'right'\n\t *       [A]    [B, C, D]\n\t *                  | 'leaf'\n\t *                 [E('payload')]\n\t */\n\n\tconst cDetachedId = 0;\n\tconst rootDetachedId = 1;\n\tconst aId = uuid.getNextNodeId();\n\tconst cId = uuid.getNextNodeId();\n\tconst dId = uuid.getNextNodeId();\n\n\tapplyEdit([\n\t\tChange.build(\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\tdefinition: 'C',\n\t\t\t\t\tidentifier: cId,\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\tleaf: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tdefinition: 'E',\n\t\t\t\t\t\t\t\tidentifier: uuid.getNextNodeId(),\n\t\t\t\t\t\t\t\tpayload: 'payload',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t],\n\t\t\tcDetachedId\n\t\t),\n\t\tChange.build(\n\t\t\t[\n\t\t\t\t{\n\t\t\t\t\tdefinition: 'Root',\n\t\t\t\t\tidentifier: uuid.getNextNodeId(),\n\t\t\t\t\ttraits: {\n\t\t\t\t\t\tleft: [{ definition: 'A', identifier: aId }],\n\t\t\t\t\t\tright: [\n\t\t\t\t\t\t\t{ definition: 'B', identifier: uuid.getNextNodeId() },\n\t\t\t\t\t\t\tcDetachedId,\n\t\t\t\t\t\t\t{ definition: 'D', identifier: dId },\n\t\t\t\t\t\t],\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t],\n\t\t\trootDetachedId\n\t\t),\n\t\tChange.insert(\n\t\t\trootDetachedId,\n\t\t\tStablePlace.atStartOf({\n\t\t\t\tlabel: 'root' as TraitLabel,\n\t\t\t\tparent: sharedTree.convertToNodeId(initialTree.identifier),\n\t\t\t})\n\t\t),\n\t]);\n\n\t/**\n\t * Edit the tree\n\t *\n\t * 1. Move C after A\n\t * 2. Delete D\n\t * 3.\n\t * ...\n\t * 102. Set the payload of A to _i_ for all _i_ in 0...100\n\t */\n\n\tapplyEdit([...Change.move(StableRange.only(cId), StablePlace.after(aId))]);\n\tapplyEdit([Change.delete(StableRange.only(dId))]);\n\tfor (let i = 0; i < 100; i++) {\n\t\tapplyEdit([Change.setPayload(aId, i)]);\n\t}\n}\n\nexport async function createSummaryTestTree(writeFormat: WriteFormat, summarizeHistory: boolean): Promise<SharedTree> {\n\tconst { tree, testObjectProvider } = await setUpLocalServerTestSharedTree({\n\t\twriteFormat,\n\t\tsummarizeHistory,\n\t\tuploadEditChunks: summarizeHistory,\n\t});\n\n\tif (writeFormat === WriteFormat.v0_1_1) {\n\t\tconst idCompressor = new IdCompressor('968bee41-bcf7-46d2-8035-6eb163b76c4c' as SessionId, reservedIdCount);\n\t\tconst interner = new MutableStringInterner([initialTree.definition]);\n\t\tconst context = makeNodeIdContext(idCompressor);\n\t\tconst normalizer = sequencedIdNormalizer(context);\n\t\tconst sharedTreeSummaryWithConstantSessionId: SharedTreeSummary = {\n\t\t\tversion: WriteFormat.v0_1_1,\n\t\t\tcurrentTree: summarizeHistory\n\t\t\t\t? [\n\t\t\t\t\t\tinterner.getOrCreateInternedId(initialTree.definition),\n\t\t\t\t\t\tnormalizer.normalizeToOpSpace(context.convertToNodeId(initialTree.identifier)),\n\t\t\t\t  ]\n\t\t\t\t: undefined,\n\t\t\teditHistory: {\n\t\t\t\teditIds: [],\n\t\t\t\teditChunks: [],\n\t\t\t},\n\t\t\tidCompressor: idCompressor.serialize(true),\n\t\t\tinternedStrings: interner.getSerializable(),\n\t\t};\n\n\t\ttree.loadSummary(sharedTreeSummaryWithConstantSessionId);\n\t}\n\n\tapplyTestEdits(tree);\n\n\tawait testObjectProvider.ensureSynchronized();\n\treturn tree;\n}\n\nexport function runSummaryTests(title: string): void {\n\tdescribe(title, () => {\n\t\t// Note: this test serializer doesn't handle blobs properly (it just uses JSON.stringify/JSON.parse).\n\t\tconst testSerializer = new TestFluidSerializer();\n\n\t\tconst {\n\t\t\tsummaryFileWithHistory_0_0_2,\n\t\t\tsummaryFileNoHistory_0_0_2,\n\t\t\tsummaryFileEmptyTraits_0_0_2,\n\t\t\tsummaryFileWithHistory_0_1_1,\n\t\t\tsummaryFileNoHistory_0_1_1,\n\t\t\tsummaryFileUpgrade_0_1_1,\n\t\t\tblobsFile,\n\t\t} = loadSummaryTestFiles();\n\n\t\t// Note: Fluid setup gives stable `absolutePath`s for these blobs across sessions. If that were not the case,\n\t\t// this test suite would need to build some kind of map from the blob info saved on disk to the `IFluidHandle`\n\t\t// list returned by uploading these blobs.\n\t\tconst blobsParsed: UploadedEditChunkContents[] = JSON.parse(blobsFile);\n\t\tconst blobs: ArrayBufferLike[] = blobsParsed.map((blob) =>\n\t\t\tIsoBuffer.from(JSON.stringify(blob.chunkContents), 'utf8')\n\t\t);\n\n\t\t// Re-enable this test for an easy way to write the test summary files to disk\n\t\tit.skip('save files to disk', async () => {\n\t\t\tawait makeSummaryTestFiles();\n\t\t});\n\n\t\tdescribe('0.0.2 write format', () => {\n\t\t\tconst setUp002Tree: typeof setUpLocalServerTestSharedTree = async (options) =>\n\t\t\t\tsetUpLocalServerTestSharedTree({ writeFormat: WriteFormat.v0_0_2, ...options });\n\n\t\t\tconst setUp002SummaryTestTree = async (summarizeHistory: boolean): Promise<SharedTree> =>\n\t\t\t\tcreateSummaryTestTree(WriteFormat.v0_0_2, summarizeHistory);\n\n\t\t\tit('Normalizes a denormalized summary containing nodes with empty traits', async () => {\n\t\t\t\tconst { tree } = await setUp002Tree({});\n\t\t\t\ttree.loadSerializedSummary(summaryFileEmptyTraits_0_0_2);\n\n\t\t\t\tconst { tree: expectedTree } = await setUp002Tree({});\n\t\t\t\texpectedTree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\texpect(getChangeNodeFromView(tree.currentView)).deep.equals(\n\t\t\t\t\tgetChangeNodeFromView(expectedTree.currentView)\n\t\t\t\t);\n\t\t\t});\n\n\t\t\tit('writes 0.0.2 files without history', async () => {\n\t\t\t\tconst tree = await setUp002SummaryTestTree(false);\n\t\t\t\tconst summary: RecursiveMutable<SharedTreeSummary_0_0_2> = JSON.parse(tree.saveSerializedSummary());\n\t\t\t\tconst expectedSummary: SharedTreeSummary_0_0_2 = JSON.parse(summaryFileNoHistory_0_0_2);\n\t\t\t\t// The edit ID of the single \"no history edit\" is generated randomly. Replace it with the baseline edit for the sake of this test.\n\t\t\t\tsummary.sequencedEdits[0].id = expectedSummary.sequencedEdits[0].id;\n\t\t\t\texpect(summary).to.deep.equal(expectedSummary);\n\t\t\t});\n\n\t\t\tit('writes 0.0.2 files with history', async () => {\n\t\t\t\tconst tree = await setUp002SummaryTestTree(true);\n\t\t\t\texpect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(\n\t\t\t\t\tJSON.parse(summaryFileWithHistory_0_0_2)\n\t\t\t\t);\n\t\t\t});\n\n\t\t\tdescribe('reading the same version', () => {\n\t\t\t\tit('reads 0.0.2 files without history', async () => {\n\t\t\t\t\tconst { tree } = await setUp002Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileNoHistory_0_0_2);\n\t\t\t\t\t// Tree should have exactly one edit, as all \"no history\" summaries do.\n\t\t\t\t\texpect(tree.edits.length).to.equal(1);\n\t\t\t\t\t// Load a baseline tree's own summary with no history to compare with\n\t\t\t\t\tconst summaryNoHistory = (await setUp002SummaryTestTree(false)).saveSummary();\n\t\t\t\t\tconst { tree: expectedTree } = await setUp002Tree({ summarizeHistory: false });\n\t\t\t\t\texpectedTree.loadSummary(summaryNoHistory);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree, false);\n\t\t\t\t});\n\n\t\t\t\tit('reads 0.0.2 files with history', async () => {\n\t\t\t\t\tconst { tree } = await setUp002Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\t\tconst expectedTree = await setUp002SummaryTestTree(true);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tdescribe('reading next version', () => {\n\t\t\t\tit('reads 0.1.1', async () => {\n\t\t\t\t\tconst { tree } = await setUp002Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_1_1);\n\t\t\t\t\t// TODO: There may need to be a testObjectProvider synchronization here to upload\n\t\t\t\t\t// blobs from this summary.\n\t\t\t\t\t// We should also look at how this test asserts behavior w.r.t blobs.\n\t\t\t\t\tconst newSummary = JSON.parse(tree.saveSerializedSummary());\n\t\t\t\t\tconst expectedSummary = JSON.parse(summaryFileWithHistory_0_1_1);\n\t\t\t\t\texpect(newSummary).to.deep.equal(expectedSummary);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit('gives correct SummaryStatistics', async () => {\n\t\t\t\tconst { tree } = await setUp002Tree({});\n\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\tconst editCount = tree.edits.length;\n\t\t\t\tconst summary = deserialize(summaryFileWithHistory_0_0_2, testSerializer);\n\t\t\t\tconst telemetryInfo = getSummaryStatistics(summary);\n\t\t\t\tconst expectedTelemetryInfo: SummaryStatistics = {\n\t\t\t\t\tformatVersion: WriteFormat.v0_0_2,\n\t\t\t\t\thistorySize: editCount,\n\t\t\t\t};\n\t\t\t\texpect(telemetryInfo).to.deep.equals(expectedTelemetryInfo);\n\t\t\t});\n\t\t});\n\n\t\tdescribe('0.1.1 write format', () => {\n\t\t\tconst setUp011Tree: typeof setUpLocalServerTestSharedTree = async (options) =>\n\t\t\t\tsetUpLocalServerTestSharedTree({ writeFormat: WriteFormat.v0_1_1, ...options });\n\n\t\t\tconst setUp011SummaryTestTree = async (summarizeHistory: boolean): Promise<SharedTree> =>\n\t\t\t\tcreateSummaryTestTree(WriteFormat.v0_1_1, summarizeHistory);\n\n\t\t\tit('writes 0.1.1 files without history', async () => {\n\t\t\t\tconst tree = await setUp011SummaryTestTree(false);\n\t\t\t\tconst summary: RecursiveMutable<SharedTreeSummary> = JSON.parse(tree.saveSerializedSummary());\n\t\t\t\tconst expectedSummary: SharedTreeSummary = JSON.parse(summaryFileNoHistory_0_1_1);\n\t\t\t\t// The edit ID of the single \"no history edit\" is generated randomly. Replace it with the baseline edit for the sake of this test.\n\t\t\t\texpectDefined(summary.editHistory).editIds[0] = expectDefined(expectedSummary.editHistory?.editIds[0]);\n\t\t\t\texpect(summary).to.deep.equal(expectedSummary);\n\t\t\t\texpect(await getUploadedEditChunkContents(tree)).to.deep.equal([]);\n\t\t\t});\n\n\t\t\tit('writes 0.1.1 files with history', async () => {\n\t\t\t\tconst tree = await setUp011SummaryTestTree(true);\n\t\t\t\texpect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(\n\t\t\t\t\tJSON.parse(summaryFileWithHistory_0_1_1)\n\t\t\t\t);\n\t\t\t\texpect(await getUploadedEditChunkContents(tree)).to.deep.equal(blobsParsed);\n\t\t\t});\n\n\t\t\tdescribe('reading the same version', () => {\n\t\t\t\tit('reads 0.1.1 files without history', async () => {\n\t\t\t\t\tconst { tree } = await setUp011Tree({ blobs });\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileNoHistory_0_1_1);\n\t\t\t\t\t// Tree should have exactly one edit, as all \"no history\" summaries do.\n\t\t\t\t\texpect(tree.edits.length).to.equal(1);\n\t\t\t\t\t// Load a baseline tree's own summary with no history to compare with\n\t\t\t\t\tconst summaryNoHistory = (await setUp011SummaryTestTree(false)).saveSummary();\n\t\t\t\t\tconst { tree: expectedTree } = await setUp011Tree({ summarizeHistory: false });\n\t\t\t\t\texpectedTree.loadSummary(summaryNoHistory);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree, false);\n\t\t\t\t});\n\n\t\t\t\tit('reads 0.1.1 files with history', async () => {\n\t\t\t\t\tconst { tree } = await setUp011Tree({ blobs });\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_1_1);\n\t\t\t\t\tconst expectedTree = await setUp011SummaryTestTree(false);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tdescribe('reading previous versions', () => {\n\t\t\t\tit('reads 0.0.2', async () => {\n\t\t\t\t\tconst expectedTree = await setUp011SummaryTestTree(true);\n\t\t\t\t\tconst { tree } = await setUp011Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree);\n\t\t\t\t\texpect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(\n\t\t\t\t\t\tJSON.parse(summaryFileWithHistory_0_0_2)\n\t\t\t\t\t);\n\t\t\t\t});\n\n\t\t\t\tit('upgrades 0.0.2', async () => {\n\t\t\t\t\tconst { tree, testObjectProvider } = await setUp011Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\t\t// Synchronize to give a chance for the update op to be sequenced.\n\t\t\t\t\tawait testObjectProvider.ensureSynchronized();\n\t\t\t\t\tconst expectedTree = await setUp011SummaryTestTree(true);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, expectedTree);\n\t\t\t\t\texpect(JSON.parse(tree.saveSerializedSummary())).to.deep.equal(\n\t\t\t\t\t\tJSON.parse(summaryFileUpgrade_0_1_1)\n\t\t\t\t\t);\n\t\t\t\t});\n\n\t\t\t\tit('upgrades 0.0.2 that has several stale ops that it resubmits', async () => {\n\t\t\t\t\tconst { tree: resubmitTree, testObjectProvider } = await setUpLocalServerTestSharedTree({\n\t\t\t\t\t\twriteFormat: WriteFormat.v0_0_2,\n\t\t\t\t\t});\n\t\t\t\t\tapplyTestEdits(resubmitTree);\n\t\t\t\t\tconst { tree: tree } = await setUpLocalServerTestSharedTree({\n\t\t\t\t\t\twriteFormat: WriteFormat.v0_1_1,\n\t\t\t\t\t\ttestObjectProvider,\n\t\t\t\t\t});\n\t\t\t\t\tawait testObjectProvider.ensureSynchronized();\n\t\t\t\t\tawait expectSharedTreesEqual(resubmitTree, tree);\n\t\t\t\t\tawait expectSharedTreesEqual(tree, await createSummaryTestTree(WriteFormat.v0_1_1, true));\n\t\t\t\t});\n\n\t\t\t\tit('Normalizes a denormalized summary containing nodes with empty traits', async () => {\n\t\t\t\t\tconst { tree } = await setUp011Tree({});\n\t\t\t\t\ttree.loadSerializedSummary(summaryFileEmptyTraits_0_0_2);\n\n\t\t\t\t\tconst { tree: expectedTree } = await setUp011Tree({});\n\t\t\t\t\texpectedTree.loadSerializedSummary(summaryFileWithHistory_0_0_2);\n\t\t\t\t\texpect(\n\t\t\t\t\t\tareRevisionViewsSemanticallyEqual(\n\t\t\t\t\t\t\ttree.currentView,\n\t\t\t\t\t\t\ttree,\n\t\t\t\t\t\t\texpectedTree.currentView,\n\t\t\t\t\t\t\texpectedTree\n\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\t\t});\n\t\t\t});\n\n\t\t\tit('gives correct SummaryStatistics', async () => {\n\t\t\t\tconst { tree } = await setUp011Tree({});\n\t\t\t\ttree.loadSerializedSummary(summaryFileWithHistory_0_1_1);\n\t\t\t\tconst editCount = tree.edits.length;\n\t\t\t\tconst summary = deserialize(summaryFileWithHistory_0_1_1, testSerializer);\n\t\t\t\tconst telemetryInfo = getSummaryStatistics(summary);\n\t\t\t\tconst totalChunks = Math.ceil(editCount / editsPerChunk);\n\t\t\t\tconst expectedTelemetryInfo: SummaryStatistics = {\n\t\t\t\t\tformatVersion: WriteFormat.v0_1_1,\n\t\t\t\t\thistorySize: editCount,\n\t\t\t\t\ttotalNumberOfChunks: totalChunks,\n\t\t\t\t\tuploadedChunks:\n\t\t\t\t\t\t// If the last chunk is bigger than the number of edits per chunk, it has also been uploaded\n\t\t\t\t\t\teditCount - Math.floor(editCount / editsPerChunk) * editsPerChunk < editsPerChunk &&\n\t\t\t\t\t\ttotalChunks !== 0\n\t\t\t\t\t\t\t? totalChunks - 1\n\t\t\t\t\t\t\t: totalChunks,\n\t\t\t\t};\n\t\t\t\texpect(telemetryInfo).to.deep.equals(expectedTelemetryInfo);\n\t\t\t});\n\t\t});\n\t});\n}\n\nexport function expectAssert(condition: unknown, message?: string): asserts condition {\n\texpect(condition, message);\n}\n\nasync function expectSharedTreesEqual(\n\tsharedTreeA: SharedTree,\n\tsharedTreeB: SharedTree,\n\tcompareEditIds = true\n): Promise<void> {\n\tif (\n\t\t!areRevisionViewsSemanticallyEqual(sharedTreeA.currentView, sharedTreeA, sharedTreeB.currentView, sharedTreeB)\n\t) {\n\t\texpect.fail('trees have different current views');\n\t}\n\n\tif (sharedTreeA.edits.length !== sharedTreeB.edits.length) {\n\t\texpect.fail('trees have different amounts of edits');\n\t}\n\n\tfor (let i = 0; i < sharedTreeA.edits.length; i++) {\n\t\tconst roundTrip = <T>(obj: T): T => JSON.parse(JSON.stringify(obj)) as T;\n\n\t\tconst editA = roundTrip(\n\t\t\tconvertEditIds(await sharedTreeA.editsInternal.getEditAtIndex(i), (id) =>\n\t\t\t\tsharedTreeA.convertToStableNodeId(id)\n\t\t\t)\n\t\t);\n\t\tconst editB = roundTrip(\n\t\t\tconvertEditIds(await sharedTreeB.editsInternal.getEditAtIndex(i), (id) =>\n\t\t\t\tsharedTreeB.convertToStableNodeId(id)\n\t\t\t)\n\t\t);\n\t\tif (compareEditIds) {\n\t\t\texpect(editA).to.deep.equal(editB, `trees have different edits (index ${i})`);\n\t\t} else {\n\t\t\texpect(editA.changes).to.deep.equal(editB.changes, `edits have different changes (index ${i})`);\n\t\t}\n\t}\n}\n\nfunction loadSummaryTestFiles(): {\n\tsummaryFileWithHistory_0_0_2: string;\n\tsummaryFileNoHistory_0_0_2: string;\n\tsummaryFileEmptyTraits_0_0_2: string;\n\tsummaryFileWithHistory_0_1_1: string;\n\tsummaryFileNoHistory_0_1_1: string;\n\tsummaryFileUpgrade_0_1_1: string;\n\tblobsFile: string;\n} {\n\tconst summaryFileWithHistory_0_0_2 = fs.readFileSync(join(directory, 'summary-0-0-2.json'), 'utf8');\n\tconst summaryFileNoHistory_0_0_2 = fs.readFileSync(join(directory, 'summary-no-history-0-0-2.json'), 'utf8');\n\tconst summaryFileEmptyTraits_0_0_2 = fs.readFileSync(join(directory, 'summary-empty-traits-0-0-2.json'), 'utf8');\n\tconst summaryFileWithHistory_0_1_1 = fs.readFileSync(join(directory, 'summary-0-1-1.json'), 'utf8');\n\tconst summaryFileNoHistory_0_1_1 = fs.readFileSync(join(directory, 'summary-no-history-0-1-1.json'), 'utf8');\n\tconst summaryFileUpgrade_0_1_1 = fs.readFileSync(join(directory, 'summary-upgrade-0-1-1.json'), 'utf8');\n\tconst blobsFile = fs.readFileSync(join(directory, 'blobs-0-1-1.json'), 'utf8');\n\n\treturn {\n\t\tsummaryFileWithHistory_0_0_2,\n\t\tsummaryFileNoHistory_0_0_2,\n\t\tsummaryFileEmptyTraits_0_0_2,\n\t\tsummaryFileWithHistory_0_1_1,\n\t\tsummaryFileNoHistory_0_1_1,\n\t\tsummaryFileUpgrade_0_1_1,\n\t\tblobsFile,\n\t};\n}\n\nasync function makeSummaryTestFiles(): Promise<void> {\n\ttry {\n\t\tfs.accessSync(directory);\n\t} catch {\n\t\tfs.mkdirSync(directory);\n\t}\n\n\tconst treeWithHistory_0_0_2 = await createSummaryTestTree(WriteFormat.v0_0_2, true);\n\tconst treeNoHistory_0_0_2 = await createSummaryTestTree(WriteFormat.v0_0_2, false);\n\tconst treeWithHistory_0_1_1 = await createSummaryTestTree(WriteFormat.v0_1_1, true);\n\tconst treeNoHistory_0_1_1 = await createSummaryTestTree(WriteFormat.v0_1_1, false);\n\n\tfs.writeFileSync(join(directory, `summary-0-0-2.json`), treeWithHistory_0_0_2.saveSerializedSummary());\n\tfs.writeFileSync(join(directory, `summary-no-history-0-0-2.json`), treeNoHistory_0_0_2.saveSerializedSummary());\n\tfs.writeFileSync(join(directory, `summary-0-1-1.json`), treeWithHistory_0_1_1.saveSerializedSummary());\n\tfs.writeFileSync(join(directory, `summary-no-history-0-1-1.json`), treeNoHistory_0_1_1.saveSerializedSummary());\n\n\tconst blobs = await getUploadedEditChunkContents(treeWithHistory_0_1_1);\n\tassert(blobs.length > 0);\n\tfs.writeFileSync(join(directory, `blobs-0-1-1.json`), JSON.stringify(blobs));\n\n\tconst { tree: upgradedTree, testObjectProvider } = await setUpLocalServerTestSharedTree({\n\t\twriteFormat: WriteFormat.v0_1_1,\n\t\tsummarizeHistory: true,\n\t});\n\tupgradedTree.loadSummary(treeWithHistory_0_0_2.saveSummary());\n\tawait testObjectProvider.ensureSynchronized();\n\tfs.writeFileSync(join(directory, `summary-upgrade-0-1-1.json`), upgradedTree.saveSerializedSummary());\n}\n\n/** Every instance of this class generates the same sequence of v5 UUIDs */\nclass DeterministicIdGenerator {\n\tpublic static readonly sessionId = '968bee41-bcf7-46d2-8035-6eb163b76c4c' as SessionId;\n\tprivate static readonly uuidNamespace = '44864298-500e-4cf8-9f44-a249e5b3a286';\n\tprivate editIdCount = 0;\n\tprivate readonly constantIdCompressor?: IdCompressor;\n\n\tpublic constructor(public readonly writeFormat: WriteFormat, private readonly sharedTree: SharedTree) {\n\t\tif (this.writeFormat === WriteFormat.v0_1_1) {\n\t\t\tassert(getIdNormalizerFromSharedTree(sharedTree).localSessionId === DeterministicIdGenerator.sessionId);\n\t\t} else {\n\t\t\tassert(getIdNormalizerFromSharedTree(sharedTree).localSessionId !== DeterministicIdGenerator.sessionId);\n\t\t\tthis.constantIdCompressor = new IdCompressor(DeterministicIdGenerator.sessionId, reservedIdCount);\n\t\t}\n\t}\n\n\tpublic getNextEditId(): EditId {\n\t\treturn v5((this.editIdCount++).toString(), DeterministicIdGenerator.uuidNamespace) as EditId;\n\t}\n\n\tpublic getNextNodeId(): NodeId {\n\t\tif (this.writeFormat === WriteFormat.v0_0_2) {\n\t\t\treturn this.sharedTree.generateNodeId(this.getNextStableId());\n\t\t} else {\n\t\t\treturn this.sharedTree.generateNodeId();\n\t\t}\n\t}\n\n\tprivate getNextStableId(): StableId {\n\t\tassert(this.constantIdCompressor !== undefined);\n\t\treturn this.constantIdCompressor.decompress(this.constantIdCompressor.generateCompressedId()) as StableId;\n\t}\n}\n"]}

package/lib/test/Transaction.tests.js

@@ -3,342 +3,88 @@
  * Licensed under the MIT License.
  */
 import { expect } from 'chai';
-import { v4 as uuidv4 } from 'uuid';
-import { EditStatus } from '../generic';
-import { Transaction, Change, ChangeType, ConstraintEffect, Insert, StableRange, StablePlace } from '../default-edits';
-import { Side } from '../Snapshot';
-import { makeEmptyNode, testTrait, left, leftTraitLocation, right, rightTraitLocation, leftTraitLabel, rightTraitLabel, simpleTreeSnapshotWithValidation, initialSnapshotWithValidation, initialSnapshot, } from './utilities/TestUtilities';
+import { EditStatus, WriteFormat } from '../persisted-types';
+import { Change, StablePlace, StableRange } from '../ChangeTypes';
+import { Transaction } from '../Transaction';
+import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';
 describe('Transaction', () => {
-    describe('Constraints', () => {
-        it('can be met', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-        });
-        const nonExistentNode = '57dd2fc4-72fa-471c-9f37-70010d31b59c';
-        const invalidStableRange = {
-            start: { side: Side.After, referenceSibling: nonExistentNode },
-            end: { side: Side.Before },
-        };
-        it('can be unmet', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: invalidStableRange,
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-            });
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('effect can apply anyway', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: invalidStableRange,
-                effect: ConstraintEffect.ValidRetry,
-                type: ChangeType.Constraint,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-        });
-        it('length can be met', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                length: 0,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-        });
-        it('length can be unmet', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                length: 1,
-            });
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('parent can be met', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                parentNode: initialSnapshot.root,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-        });
-        it('parent can be unmet', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                parentNode: nonExistentNode,
-            });
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('label can be met', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                label: testTrait.label,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-        });
-        it('label can be unmet', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                toConstrain: StableRange.all(testTrait),
-                effect: ConstraintEffect.InvalidAndDiscard,
-                type: ChangeType.Constraint,
-                label: '7969ee2e-5418-43db-929a-4e9a23c5499d',
-            });
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
+    function createTestTransaction() {
+        const { tree } = setUpTestSharedTree({ writeFormat: WriteFormat.v0_1_1 });
+        const testTree = setUpTestTree(tree);
+        return { tree, testTree, transaction: new Transaction(tree) };
+    }
+    function createValidChange(testTree) {
+        return Change.delete(StableRange.only(testTree.left));
+    }
+    function createInvalidChange(testTree) {
+        return Change.delete(StableRange.only(testTree.generateNodeId()));
+    }
+    function createMalformedChange(testTree) {
+        return Change.insert(Number.NaN, StablePlace.after(testTree.left));
+    }
+    it('can apply an edit to the tree', () => {
+        const { tree, testTree, transaction } = createTestTransaction();
+        const editCountBefore = tree.edits.length;
+        transaction.apply(createValidChange(testTree));
+        transaction.closeAndCommit();
+        expect(tree.edits.length).to.equal(editCountBefore + 1);
+        expect(tree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(0);
     });
-    describe('SetValue', () => {
-        it('can be invalid', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                nodeToModify: '7969ee2e-5418-43db-929a-4e9a23c5499d',
-                payload: {},
-                type: ChangeType.SetValue,
-            });
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('can change payload', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            const payload = { foo: {} };
-            transaction.applyChange({
-                nodeToModify: initialSnapshot.root,
-                payload,
-                type: ChangeType.SetValue,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-            expect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).deep.equals(payload);
-        });
-        // 'null' is not included here since it means clear the payload in setValue.
-        for (const payload of [0, '', [], {}]) {
-            it(`can set payload to ${JSON.stringify(payload)}`, () => {
-                const transaction = new Transaction(initialSnapshotWithValidation);
-                transaction.applyChange({
-                    nodeToModify: initialSnapshot.root,
-                    payload,
-                    type: ChangeType.SetValue,
-                });
-                expect(transaction.status).equals(EditStatus.Applied);
-                expect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).equals(payload);
-            });
-        }
-        it('can clear an unset payload', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange(Change.clearPayload(initialSnapshot.root));
-            expect(transaction.status).equals(EditStatus.Applied);
-            expect({}.hasOwnProperty.call(transaction.view.getSnapshotNode(initialSnapshot.root), 'payload')).false;
-            expect({}.hasOwnProperty.call(transaction.view.getChangeNode(initialSnapshot.root), 'payload')).false;
-        });
-        it('can clear a set payload', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            transaction.applyChange({
-                nodeToModify: initialSnapshot.root,
-                payload: {},
-                type: ChangeType.SetValue,
-            });
-            expect(transaction.status).equals(EditStatus.Applied);
-            expect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).not.undefined;
-            transaction.applyChange(Change.clearPayload(initialSnapshot.root));
-            expect(transaction.status).equals(EditStatus.Applied);
-            expect({}.hasOwnProperty.call(transaction.view.getSnapshotNode(initialSnapshot.root), 'payload')).false;
-            expect({}.hasOwnProperty.call(transaction.view.getChangeNode(initialSnapshot.root), 'payload')).false;
-        });
+    it('has correct edit status when applied', () => {
+        const { testTree, transaction } = createTestTransaction();
+        expect(transaction.apply(createValidChange(testTree))).to.equal(EditStatus.Applied);
+        expect(transaction.status).to.equal(EditStatus.Applied);
+        transaction.closeAndCommit();
     });
-    describe('Insert', () => {
-        const buildId = 0;
-        const builtNodeId = uuidv4();
-        const newNode = makeEmptyNode(builtNodeId);
-        it('can be malformed', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            transaction.applyChange(Change.build([newNode], buildId));
-            transaction.applyChange(Change.insert(
-            // Non-existent detached id
-            1, { referenceSibling: initialSnapshot.root, side: Side.After }));
-            expect(transaction.status).equals(EditStatus.Malformed);
-        });
-        it('can be invalid', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            transaction.applyChange(Change.build([newNode], buildId));
-            transaction.applyChange(Change.insert(buildId, 
-            // Arbitrary id not present in the tree
-            { referenceSibling: '7969ee2e-5418-43db-929a-4e9a23c5499d', side: Side.After }));
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        [Side.Before, Side.After].forEach((side) => {
-            it(`can insert a node at the ${side === Side.After ? 'beginning' : 'end'} of a trait`, () => {
-                const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-                transaction.applyChanges(Insert.create([newNode], side === Side.After
-                    ? StablePlace.atStartOf(leftTraitLocation)
-                    : StablePlace.atEndOf(leftTraitLocation)));
-                expect(transaction.view.getTrait(leftTraitLocation)).deep.equals(side === Side.After ? [builtNodeId, left.identifier] : [left.identifier, builtNodeId]);
-            });
-            it(`can insert a node ${side === Side.Before ? 'before' : 'after'} another node`, () => {
-                const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-                transaction.applyChanges(Insert.create([newNode], { referenceSibling: left.identifier, side }));
-                expect(transaction.view.getTrait(leftTraitLocation)).deep.equals(side === Side.Before ? [builtNodeId, left.identifier] : [left.identifier, builtNodeId]);
-            });
-        });
+    it('has correct edit status when invalid', () => {
+        const { testTree, transaction } = createTestTransaction();
+        expect(transaction.apply(createInvalidChange(testTree))).to.equal(EditStatus.Invalid);
+        expect(transaction.status).to.equal(EditStatus.Invalid);
+        transaction.closeAndCommit();
     });
-    describe('Build', () => {
-        it('can be malformed due to detached ID collision', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            // Apply two Build_s with the same detached id
-            transaction.applyChange(Change.build([makeEmptyNode()], 0));
-            expect(transaction.status).equals(EditStatus.Applied);
-            transaction.applyChange(Change.build([makeEmptyNode()], 0));
-            expect(transaction.status).equals(EditStatus.Malformed);
-        });
-        it('can be malformed due to duplicate node identifiers', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            // Build two nodes with the same identifier, one of them nested
-            const newNode = makeEmptyNode();
-            transaction.applyChange(Change.build([
-                newNode,
-                Object.assign(Object.assign({}, makeEmptyNode()), { traits: { [leftTraitLabel]: [Object.assign(Object.assign({}, makeEmptyNode()), { identifier: newNode.identifier })] } }),
-            ], 0));
-            expect(transaction.status).equals(EditStatus.Malformed);
-        });
-        it('can be invalid', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            // Build two nodes with the same identifier
-            const identifier = uuidv4();
-            transaction.applyChange(Change.build([makeEmptyNode(identifier)], 0));
-            expect(transaction.status).equals(EditStatus.Applied);
-            transaction.applyChange(Change.build([makeEmptyNode(identifier)], 1));
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('can build a detached node', () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            const identifier = uuidv4();
-            const newNode = makeEmptyNode(identifier);
-            transaction.applyChange(Change.build([newNode], 0));
-            expect(transaction.status).equals(EditStatus.Applied);
-            expect(transaction.view.hasNode(identifier)).is.true;
-            expect(transaction.view.getParentSnapshotNode(identifier)).is.undefined;
-            expect(transaction.view.getChangeNode(identifier)).deep.equals(newNode);
-        });
-        it("is malformed if detached node id doesn't exist", () => {
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            const detachedSequenceId = 0;
-            transaction.applyChange({
-                destination: 1,
-                source: [detachedSequenceId],
-                type: ChangeType.Build,
-            });
-            expect(transaction.status).equals(EditStatus.Malformed);
-        });
-        it('can build a node with an explicit empty trait', () => {
-            // Forest should strip off the empty trait
-            const nodeWithEmpty = makeEmptyNode();
-            const traits = new Map();
-            const emptyTrait = [];
-            traits.set(leftTraitLabel, emptyTrait);
-            const transaction = new Transaction(initialSnapshotWithValidation);
-            const detachedSequenceId = 0;
-            transaction.applyChange(Change.build([nodeWithEmpty], detachedSequenceId));
-            expect(transaction.status).equals(EditStatus.Applied);
-            const snapshotNodeWithEmpty = transaction.view.getSnapshotNode(nodeWithEmpty.identifier);
-            expect(snapshotNodeWithEmpty.traits.size).to.equal(0);
-        });
+    it('has correct edit status when malformed', () => {
+        const { testTree, transaction } = createTestTransaction();
+        expect(transaction.apply(createMalformedChange(testTree))).to.equal(EditStatus.Malformed);
+        expect(transaction.status).to.equal(EditStatus.Malformed);
+        transaction.closeAndCommit();
     });
-    describe('Detach', () => {
-        it('can be malformed', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            // Supplied StableRange is malformed
-            transaction.applyChange(Change.detach({
-                start: { referenceTrait: leftTraitLocation, referenceSibling: left.identifier, side: Side.Before },
-                end: StablePlace.after(right),
-            }));
-            expect(transaction.status).equals(EditStatus.Malformed);
-        });
-        it('can be invalid', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            // Start place is before end place
-            transaction.applyChange(Change.detach({
-                start: StablePlace.atEndOf(leftTraitLocation),
-                end: StablePlace.atStartOf(leftTraitLocation),
-            }));
-            expect(transaction.status).equals(EditStatus.Invalid);
-        });
-        it('can delete a node', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            transaction.applyChange(Change.detach(StableRange.only(left)));
-            expect(transaction.view.hasNode(left.identifier)).is.false;
-        });
+    it('can apply multiple changes at once', () => {
+        const { tree, testTree, transaction } = createTestTransaction();
+        transaction.apply(Change.move(StableRange.only(testTree.left), StablePlace.after(testTree.right)));
+        transaction.closeAndCommit();
+        expect(tree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(0);
+        expect(tree.currentView.getTrait(testTree.right.traitLocation).length).to.equal(2);
     });
-    describe('Composite changes', () => {
-        it('can form a node move', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            const detachedId = 0;
-            transaction.applyChange(Change.detach(StableRange.only(left), detachedId));
-            transaction.applyChange(Change.insert(detachedId, StablePlace.after(right)));
-            expect(transaction.view.getTrait(leftTraitLocation)).deep.equals([]);
-            expect(transaction.view.getTrait(rightTraitLocation)).deep.equals([right.identifier, left.identifier]);
-        });
-        it('can form a wrap insert', () => {
-            // A wrap insert is an edit that inserts a new node between a subtree and its parent atomically.
-            // Ex: given A -> B -> C, a wrap insert of D around B would produce A -> D -> B -> C
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            const leftNodeDetachedId = 0;
-            const parentDetachedId = 1;
-            transaction.applyChange(Change.detach(StableRange.only(left), leftNodeDetachedId));
-            // This is node D, from the example
-            const wrappingParentId = uuidv4();
-            const wrappingTraitLabel = 'wrapTrait';
-            transaction.applyChange(Change.build([
-                Object.assign(Object.assign({}, makeEmptyNode(wrappingParentId)), { traits: { [wrappingTraitLabel]: [leftNodeDetachedId] } }),
-            ], parentDetachedId));
-            transaction.applyChange(Change.insert(parentDetachedId, StablePlace.atStartOf(leftTraitLocation)));
-            const leftTrait = transaction.view.getTrait(leftTraitLocation);
-            expect(leftTrait).deep.equals([wrappingParentId]);
-            const wrappingTrait = transaction.view.getTrait({ parent: wrappingParentId, label: wrappingTraitLabel });
-            expect(wrappingTrait).deep.equals([left.identifier]);
-        });
-        it('can build and insert a tree that contains detached subtrees', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            const leftNodeDetachedId = 0;
-            const rightNodeDetachedId = 1;
-            const detachedIdSubtree = 2;
-            transaction.applyChange(Change.detach(StableRange.only(left), leftNodeDetachedId));
-            transaction.applyChange(Change.detach(StableRange.only(right), rightNodeDetachedId));
-            const detachedSubtree = Object.assign(Object.assign({}, makeEmptyNode()), { traits: {
-                    [leftTraitLabel]: [leftNodeDetachedId],
-                    [rightTraitLabel]: [rightNodeDetachedId],
-                } });
-            transaction.applyChange(Change.build([detachedSubtree], detachedIdSubtree));
-            transaction.applyChange(Change.insert(detachedIdSubtree, StablePlace.atStartOf(leftTraitLocation)));
-            expect(transaction.view.getTrait(rightTraitLocation)).deep.equals([]);
-            expect(transaction.view.getTrait(leftTraitLocation)).deep.equals([detachedSubtree.identifier]);
-            const insertedSubtree = transaction.view.getChangeNode(detachedSubtree.identifier);
-            expect(insertedSubtree.traits).deep.equals({
-                [leftTraitLabel]: [left],
-                [rightTraitLabel]: [right],
-            });
-        });
-        it('can build and insert a tree with the same identity as that of a detached subtree', () => {
-            const transaction = new Transaction(simpleTreeSnapshotWithValidation);
-            transaction.applyChange(Change.detach(StableRange.only(left)));
-            const idOfDetachedNodeToInsert = 1;
-            expect(transaction.view.getTrait(leftTraitLocation)).deep.equals([]);
-            transaction.applyChange(Change.build([makeEmptyNode(left.identifier)], idOfDetachedNodeToInsert));
-            transaction.applyChange(Change.insert(idOfDetachedNodeToInsert, StablePlace.atStartOf(leftTraitLocation)));
-            expect(transaction.view.getTrait(leftTraitLocation)).deep.equals([left.identifier]);
-        });
+    it('does not apply empty edits', () => {
+        const { tree, transaction } = createTestTransaction();
+        const editCountBefore = tree.edits.length;
+        transaction.apply([]);
+        transaction.closeAndCommit();
+        expect(tree.edits.length).to.equal(editCountBefore);
+    });
+    it('does not apply a batch of changes if any of them fail', () => {
+        const { testTree, transaction } = createTestTransaction();
+        const change = createValidChange(testTree);
+        expect(transaction.apply(change, change)).to.equal(EditStatus.Invalid); // Second change is invalid
+        expect(transaction.status).to.equal(EditStatus.Invalid);
+        transaction.closeAndCommit();
+    });
+    it('is open when created', () => {
+        const { transaction } = createTestTransaction();
+        expect(transaction.isOpen).to.be.true;
+    });
+    it('closes when a change fails to apply', () => {
+        const { testTree, transaction } = createTestTransaction();
+        transaction.apply(createInvalidChange(testTree));
+        expect(transaction.isOpen).to.be.false;
+    });
+    it('closes when an edit is applied', () => {
+        const { testTree, transaction } = createTestTransaction();
+        expect(transaction.isOpen).to.be.true;
+        transaction.apply(createValidChange(testTree));
+        expect(transaction.isOpen).to.be.true;
+        transaction.closeAndCommit();
+        expect(transaction.isOpen).to.be.false;
     });
 });
 //# sourceMappingURL=Transaction.tests.js.map

package/lib/test/Transaction.tests.js.map

@@ -1 +1 @@
-{"version":3,"file":"Transaction.tests.js","sourceRoot":"","sources":["../../src/test/Transaction.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AAEpC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACvH,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AACnC,OAAO,EACN,aAAa,EACb,SAAS,EACT,IAAI,EACJ,iBAAiB,EACjB,KAAK,EACL,kBAAkB,EAClB,cAAc,EACd,eAAe,EACf,gCAAgC,EAChC,6BAA6B,EAC7B,eAAe,GACf,MAAM,2BAA2B,CAAC;AAEnC,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;aAC3B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,MAAM,eAAe,GAAG,sCAAgD,CAAC;QACzE,MAAM,kBAAkB,GAAgB;YACvC,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE;YAC9D,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;SAC1B,CAAC;QACF,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,kBAAkB;gBAC/B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;aAC3B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,kBAAkB;gBAC/B,MAAM,EAAE,gBAAgB,CAAC,UAAU;gBACnC,IAAI,EAAE,UAAU,CAAC,UAAU;aAC3B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,MAAM,EAAE,CAAC;aACT,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,MAAM,EAAE,CAAC;aACT,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,UAAU,EAAE,eAAe,CAAC,IAAI;aAChC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,UAAU,EAAE,eAAe;aAC3B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,KAAK,EAAE,SAAS,CAAC,KAAK;aACtB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC;gBACvC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,UAAU,CAAC,UAAU;gBAC3B,KAAK,EAAE,sCAAoD;aAC3D,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,sCAAgD;gBAC9D,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,UAAU,CAAC,QAAQ;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,eAAe,CAAC,IAAI;gBAClC,OAAO;gBACP,IAAI,EAAE,UAAU,CAAC,QAAQ;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7F,CAAC,CAAC,CAAC;QAEH,4EAA4E;QAC5E,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YACtC,EAAE,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACxD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;gBACnE,WAAW,CAAC,WAAW,CAAC;oBACvB,YAAY,EAAE,eAAe,CAAC,IAAI;oBAClC,OAAO;oBACP,IAAI,EAAE,UAAU,CAAC,QAAQ;iBACzB,CAAC,CAAC;gBACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACxF,CAAC,CAAC,CAAC;SACH;QAED,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YACxG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QACvG,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,eAAe,CAAC,IAAI;gBAClC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,UAAU,CAAC,QAAQ;aACzB,CAAC,CAAC;YAEH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;YACrF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YACxG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;QACvG,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,MAAM,OAAO,GAAG,CAAuB,CAAC;QACxC,MAAM,WAAW,GAAG,MAAM,EAAY,CAAC;QACvC,MAAM,OAAO,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;QAC3C,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAC1D,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,MAAM;YACZ,2BAA2B;YAC3B,CAAuB,EACvB,EAAE,gBAAgB,EAAE,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAC5D,CACD,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAC1D,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,MAAM,CACZ,OAAO;YACP,uCAAuC;YACvC,EAAE,gBAAgB,EAAE,sCAAgD,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CACxF,CACD,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1C,EAAE,CAAC,4BAA4B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,GAAG,EAAE;gBAC3F,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;gBACtE,WAAW,CAAC,YAAY,CACvB,MAAM,CAAC,MAAM,CACZ,CAAC,OAAO,CAAC,EACT,IAAI,KAAK,IAAI,CAAC,KAAK;oBAClB,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC;oBAC1C,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,CACzC,CACD,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAC/D,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,CACrF,CAAC;YACH,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,qBAAqB,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAe,EAAE,GAAG,EAAE;gBACtF,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;gBACtE,WAAW,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;gBAChG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAC/D,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,WAAW,CAAC,CACtF,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,8CAA8C;YAC9C,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,+DAA+D;YAC/D,MAAM,OAAO,GAAG,aAAa,EAAE,CAAC;YAChC,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,KAAK,CACX;gBACC,OAAO;gDAEH,aAAa,EAAE,KAClB,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,iCAAM,aAAa,EAAE,KAAE,UAAU,EAAE,OAAO,CAAC,UAAU,IAAG,EAAE;aAEvF,EACD,CAAuB,CACvB,CACD,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,2CAA2C;YAC3C,MAAM,UAAU,GAAG,MAAM,EAAY,CAAC;YACtC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAC5F,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAC5F,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,MAAM,UAAU,GAAG,MAAM,EAAY,CAAC;YACtC,MAAM,OAAO,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC;YAC1C,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YACrD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;YACxE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACzD,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,CAAuB;gBACpC,MAAM,EAAE,CAAC,kBAAkB,CAAC;gBAC5B,IAAI,EAAE,UAAU,CAAC,KAAK;aACtB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,0CAA0C;YAC1C,MAAM,aAAa,GAAG,aAAa,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;YAEvC,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,6BAA6B,CAAC,CAAC;YACnE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC3E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,qBAAqB,GAAG,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACzF,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,oCAAoC;YACpC,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,MAAM,CAAC;gBACb,KAAK,EAAE,EAAE,cAAc,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBAClG,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC;aAC7B,CAAC,CACF,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,kCAAkC;YAClC,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,MAAM,CAAC;gBACb,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC;gBAC7C,GAAG,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC;aAC7C,CAAC,CACF,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;QAC5D,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;YAC3E,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7E,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACxG,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,gGAAgG;YAChG,oFAAoF;YACpF,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,gBAAgB,GAAG,CAAuB,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YACnF,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,MAAM,EAAY,CAAC;YAC5C,MAAM,kBAAkB,GAAG,WAAyB,CAAC;YACrD,WAAW,CAAC,WAAW,CACtB,MAAM,CAAC,KAAK,CACX;gDAEK,aAAa,CAAC,gBAAgB,CAAC,KAClC,MAAM,EAAE,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE;aAEvD,EACD,gBAAgB,CAChB,CACD,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACnG,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;YAC/D,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,gBAAgB,EAAE,KAAK,EAAE,kBAAkB,EAAE,CAAC,CAAC;YACzG,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACtE,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,mBAAmB,GAAG,CAAuB,CAAC;YACpD,MAAM,iBAAiB,GAAG,CAAuB,CAAC;YAClD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YACnF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,CAAC,CAAC;YAErF,MAAM,eAAe,mCACjB,aAAa,EAAE,KAClB,MAAM,EAAE;oBACP,CAAC,cAAc,CAAC,EAAE,CAAC,kBAAkB,CAAC;oBACtC,CAAC,eAAe,CAAC,EAAE,CAAC,mBAAmB,CAAC;iBACxC,GACD,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;YAC5E,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,iBAAiB,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACpG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACtE,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC;YAC/F,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;YACnF,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC1C,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,CAAC;gBACxB,CAAC,eAAe,CAAC,EAAE,CAAC,KAAK,CAAC;aAC1B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;YAC3F,MAAM,WAAW,GAAG,IAAI,WAAW,CAAC,gCAAgC,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/D,MAAM,wBAAwB,GAAG,CAAuB,CAAC;YACzD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,wBAAwB,CAAC,CAAC,CAAC;YAClG,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,wBAAwB,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAC3G,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACrF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { v4 as uuidv4 } from 'uuid';\nimport { DetachedSequenceId, NodeId, TraitLabel } from '../Identifiers';\nimport { EditStatus } from '../generic';\nimport { Transaction, Change, ChangeType, ConstraintEffect, Insert, StableRange, StablePlace } from '../default-edits';\nimport { Side } from '../Snapshot';\nimport {\n\tmakeEmptyNode,\n\ttestTrait,\n\tleft,\n\tleftTraitLocation,\n\tright,\n\trightTraitLocation,\n\tleftTraitLabel,\n\trightTraitLabel,\n\tsimpleTreeSnapshotWithValidation,\n\tinitialSnapshotWithValidation,\n\tinitialSnapshot,\n} from './utilities/TestUtilities';\n\ndescribe('Transaction', () => {\n\tdescribe('Constraints', () => {\n\t\tit('can be met', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tconst nonExistentNode = '57dd2fc4-72fa-471c-9f37-70010d31b59c' as NodeId;\n\t\tconst invalidStableRange: StableRange = {\n\t\t\tstart: { side: Side.After, referenceSibling: nonExistentNode },\n\t\t\tend: { side: Side.Before },\n\t\t};\n\t\tit('can be unmet', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: invalidStableRange,\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\tit('effect can apply anyway', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: invalidStableRange,\n\t\t\t\teffect: ConstraintEffect.ValidRetry,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be met', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tlength: 0,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be unmet', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tlength: 1,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\tit('parent can be met', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tparentNode: initialSnapshot.root,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('parent can be unmet', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tparentNode: nonExistentNode,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\tit('label can be met', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tlabel: testTrait.label,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('label can be unmet', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: StableRange.all(testTrait),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeType.Constraint,\n\t\t\t\tlabel: '7969ee2e-5418-43db-929a-4e9a23c5499d' as TraitLabel, // Arbitrary label not equal to testTrait.label\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t});\n\n\tdescribe('SetValue', () => {\n\t\tit('can be invalid', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: '7969ee2e-5418-43db-929a-4e9a23c5499d' as NodeId, // Arbitrary id not equal to initialSnapshot.root\n\t\t\t\tpayload: {}, // Arbitrary payload.\n\t\t\t\ttype: ChangeType.SetValue,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\n\t\tit('can change payload', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\tconst payload = { foo: {} };\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: initialSnapshot.root,\n\t\t\t\tpayload, // Arbitrary payload.\n\t\t\t\ttype: ChangeType.SetValue,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).deep.equals(payload);\n\t\t});\n\n\t\t// 'null' is not included here since it means clear the payload in setValue.\n\t\tfor (const payload of [0, '', [], {}]) {\n\t\t\tit(`can set payload to ${JSON.stringify(payload)}`, () => {\n\t\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\t\ttransaction.applyChange({\n\t\t\t\t\tnodeToModify: initialSnapshot.root,\n\t\t\t\t\tpayload,\n\t\t\t\t\ttype: ChangeType.SetValue,\n\t\t\t\t});\n\t\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\t\texpect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).equals(payload);\n\t\t\t});\n\t\t}\n\n\t\tit('can clear an unset payload', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange(Change.clearPayload(initialSnapshot.root));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getSnapshotNode(initialSnapshot.root), 'payload')).false;\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getChangeNode(initialSnapshot.root), 'payload')).false;\n\t\t});\n\n\t\tit('can clear a set payload', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: initialSnapshot.root,\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeType.SetValue,\n\t\t\t});\n\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getSnapshotNode(initialSnapshot.root).payload).not.undefined;\n\t\t\ttransaction.applyChange(Change.clearPayload(initialSnapshot.root));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getSnapshotNode(initialSnapshot.root), 'payload')).false;\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getChangeNode(initialSnapshot.root), 'payload')).false;\n\t\t});\n\t});\n\n\tdescribe('Insert', () => {\n\t\tconst buildId = 0 as DetachedSequenceId;\n\t\tconst builtNodeId = uuidv4() as NodeId;\n\t\tconst newNode = makeEmptyNode(builtNodeId);\n\t\tit('can be malformed', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\ttransaction.applyChange(Change.build([newNode], buildId));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.insert(\n\t\t\t\t\t// Non-existent detached id\n\t\t\t\t\t1 as DetachedSequenceId,\n\t\t\t\t\t{ referenceSibling: initialSnapshot.root, side: Side.After }\n\t\t\t\t)\n\t\t\t);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t});\n\t\tit('can be invalid', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\ttransaction.applyChange(Change.build([newNode], buildId));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.insert(\n\t\t\t\t\tbuildId,\n\t\t\t\t\t// Arbitrary id not present in the tree\n\t\t\t\t\t{ referenceSibling: '7969ee2e-5418-43db-929a-4e9a23c5499d' as NodeId, side: Side.After }\n\t\t\t\t)\n\t\t\t);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\t[Side.Before, Side.After].forEach((side) => {\n\t\t\tit(`can insert a node at the ${side === Side.After ? 'beginning' : 'end'} of a trait`, () => {\n\t\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tInsert.create(\n\t\t\t\t\t\t[newNode],\n\t\t\t\t\t\tside === Side.After\n\t\t\t\t\t\t\t? StablePlace.atStartOf(leftTraitLocation)\n\t\t\t\t\t\t\t: StablePlace.atEndOf(leftTraitLocation)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals(\n\t\t\t\t\tside === Side.After ? [builtNodeId, left.identifier] : [left.identifier, builtNodeId]\n\t\t\t\t);\n\t\t\t});\n\t\t\tit(`can insert a node ${side === Side.Before ? 'before' : 'after'} another node`, () => {\n\t\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\t\ttransaction.applyChanges(Insert.create([newNode], { referenceSibling: left.identifier, side }));\n\t\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals(\n\t\t\t\t\tside === Side.Before ? [builtNodeId, left.identifier] : [left.identifier, builtNodeId]\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Build', () => {\n\t\tit('can be malformed due to detached ID collision', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\t// Apply two Build_s with the same detached id\n\t\t\ttransaction.applyChange(Change.build([makeEmptyNode()], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\ttransaction.applyChange(Change.build([makeEmptyNode()], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t});\n\t\tit('can be malformed due to duplicate node identifiers', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\t// Build two nodes with the same identifier, one of them nested\n\t\t\tconst newNode = makeEmptyNode();\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.build(\n\t\t\t\t\t[\n\t\t\t\t\t\tnewNode,\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...makeEmptyNode(),\n\t\t\t\t\t\t\ttraits: { [leftTraitLabel]: [{ ...makeEmptyNode(), identifier: newNode.identifier }] },\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\t0 as DetachedSequenceId\n\t\t\t\t)\n\t\t\t);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t});\n\t\tit('can be invalid', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\t// Build two nodes with the same identifier\n\t\t\tconst identifier = uuidv4() as NodeId;\n\t\t\ttransaction.applyChange(Change.build([makeEmptyNode(identifier)], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\ttransaction.applyChange(Change.build([makeEmptyNode(identifier)], 1 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\tit('can build a detached node', () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\tconst identifier = uuidv4() as NodeId;\n\t\t\tconst newNode = makeEmptyNode(identifier);\n\t\t\ttransaction.applyChange(Change.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.hasNode(identifier)).is.true;\n\t\t\texpect(transaction.view.getParentSnapshotNode(identifier)).is.undefined;\n\t\t\texpect(transaction.view.getChangeNode(identifier)).deep.equals(newNode);\n\t\t});\n\t\tit(\"is malformed if detached node id doesn't exist\", () => {\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange({\n\t\t\t\tdestination: 1 as DetachedSequenceId,\n\t\t\t\tsource: [detachedSequenceId],\n\t\t\t\ttype: ChangeType.Build,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t});\n\t\tit('can build a node with an explicit empty trait', () => {\n\t\t\t// Forest should strip off the empty trait\n\t\t\tconst nodeWithEmpty = makeEmptyNode();\n\t\t\tconst traits = new Map<TraitLabel, NodeId[]>();\n\t\t\tconst emptyTrait: NodeId[] = [];\n\t\t\ttraits.set(leftTraitLabel, emptyTrait);\n\n\t\t\tconst transaction = new Transaction(initialSnapshotWithValidation);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(Change.build([nodeWithEmpty], detachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst snapshotNodeWithEmpty = transaction.view.getSnapshotNode(nodeWithEmpty.identifier);\n\t\t\texpect(snapshotNodeWithEmpty.traits.size).to.equal(0);\n\t\t});\n\t});\n\n\tdescribe('Detach', () => {\n\t\tit('can be malformed', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.detach({\n\t\t\t\t\tstart: { referenceTrait: leftTraitLocation, referenceSibling: left.identifier, side: Side.Before },\n\t\t\t\t\tend: StablePlace.after(right),\n\t\t\t\t})\n\t\t\t);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t});\n\t\tit('can be invalid', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\t// Start place is before end place\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.detach({\n\t\t\t\t\tstart: StablePlace.atEndOf(leftTraitLocation),\n\t\t\t\t\tend: StablePlace.atStartOf(leftTraitLocation),\n\t\t\t\t})\n\t\t\t);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t});\n\t\tit('can delete a node', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(left)));\n\t\t\texpect(transaction.view.hasNode(left.identifier)).is.false;\n\t\t});\n\t});\n\n\tdescribe('Composite changes', () => {\n\t\tit('can form a node move', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(left), detachedId));\n\t\t\ttransaction.applyChange(Change.insert(detachedId, StablePlace.after(right)));\n\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(rightTraitLocation)).deep.equals([right.identifier, left.identifier]);\n\t\t});\n\t\tit('can form a wrap insert', () => {\n\t\t\t// A wrap insert is an edit that inserts a new node between a subtree and its parent atomically.\n\t\t\t// Ex: given A -> B -> C, a wrap insert of D around B would produce A -> D -> B -> C\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst parentDetachedId = 1 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(left), leftNodeDetachedId));\n\t\t\t// This is node D, from the example\n\t\t\tconst wrappingParentId = uuidv4() as NodeId;\n\t\t\tconst wrappingTraitLabel = 'wrapTrait' as TraitLabel;\n\t\t\ttransaction.applyChange(\n\t\t\t\tChange.build(\n\t\t\t\t\t[\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...makeEmptyNode(wrappingParentId),\n\t\t\t\t\t\t\ttraits: { [wrappingTraitLabel]: [leftNodeDetachedId] }, // Re-parent left under new node\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\tparentDetachedId\n\t\t\t\t)\n\t\t\t);\n\t\t\ttransaction.applyChange(Change.insert(parentDetachedId, StablePlace.atStartOf(leftTraitLocation)));\n\t\t\tconst leftTrait = transaction.view.getTrait(leftTraitLocation);\n\t\t\texpect(leftTrait).deep.equals([wrappingParentId]);\n\t\t\tconst wrappingTrait = transaction.view.getTrait({ parent: wrappingParentId, label: wrappingTraitLabel });\n\t\t\texpect(wrappingTrait).deep.equals([left.identifier]);\n\t\t});\n\t\tit('can build and insert a tree that contains detached subtrees', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst rightNodeDetachedId = 1 as DetachedSequenceId;\n\t\t\tconst detachedIdSubtree = 2 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(left), leftNodeDetachedId));\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(right), rightNodeDetachedId));\n\n\t\t\tconst detachedSubtree = {\n\t\t\t\t...makeEmptyNode(),\n\t\t\t\ttraits: {\n\t\t\t\t\t[leftTraitLabel]: [leftNodeDetachedId],\n\t\t\t\t\t[rightTraitLabel]: [rightNodeDetachedId],\n\t\t\t\t},\n\t\t\t};\n\t\t\ttransaction.applyChange(Change.build([detachedSubtree], detachedIdSubtree));\n\t\t\ttransaction.applyChange(Change.insert(detachedIdSubtree, StablePlace.atStartOf(leftTraitLocation)));\n\t\t\texpect(transaction.view.getTrait(rightTraitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals([detachedSubtree.identifier]);\n\t\t\tconst insertedSubtree = transaction.view.getChangeNode(detachedSubtree.identifier);\n\t\t\texpect(insertedSubtree.traits).deep.equals({\n\t\t\t\t[leftTraitLabel]: [left],\n\t\t\t\t[rightTraitLabel]: [right],\n\t\t\t});\n\t\t});\n\t\tit('can build and insert a tree with the same identity as that of a detached subtree', () => {\n\t\t\tconst transaction = new Transaction(simpleTreeSnapshotWithValidation);\n\t\t\ttransaction.applyChange(Change.detach(StableRange.only(left)));\n\t\t\tconst idOfDetachedNodeToInsert = 1 as DetachedSequenceId;\n\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals([]);\n\t\t\ttransaction.applyChange(Change.build([makeEmptyNode(left.identifier)], idOfDetachedNodeToInsert));\n\t\t\ttransaction.applyChange(Change.insert(idOfDetachedNodeToInsert, StablePlace.atStartOf(leftTraitLocation)));\n\t\t\texpect(transaction.view.getTrait(leftTraitLocation)).deep.equals([left.identifier]);\n\t\t});\n\t});\n});\n"]}
+{"version":3,"file":"Transaction.tests.js","sourceRoot":"","sources":["../../src/test/Transaction.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAG7C,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE/E,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,SAAS,qBAAqB;QAC7B,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,CAAC,EAAE,WAAW,EAAE,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QAC1E,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;IAC/D,CAAC;IAED,SAAS,iBAAiB,CAAC,QAAkB;QAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IAED,SAAS,mBAAmB,CAAC,QAAkB;QAC9C,OAAO,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,SAAS,qBAAqB,CAAC,QAAkB;QAChD,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACpE,CAAC;IAED,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAChE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1C,WAAW,CAAC,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/C,WAAW,CAAC,cAAc,EAAE,CAAC;QAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACpF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxD,WAAW,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACtF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxD,WAAW,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC1F,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC1D,WAAW,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAChE,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnG,WAAW,CAAC,cAAc,EAAE,CAAC;QAC7B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClF,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QACtD,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC1C,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtB,WAAW,CAAC,cAAc,EAAE,CAAC;QAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAChE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,2BAA2B;QACnG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxD,WAAW,CAAC,cAAc,EAAE,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,WAAW,CAAC,KAAK,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,GAAG,qBAAqB,EAAE,CAAC;QAC1D,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtC,WAAW,CAAC,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtC,WAAW,CAAC,cAAc,EAAE,CAAC;QAC7B,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { EditStatus, WriteFormat } from '../persisted-types';\nimport { Change, StablePlace, StableRange } from '../ChangeTypes';\nimport { Transaction } from '../Transaction';\nimport { SharedTree } from '../SharedTree';\nimport { TestTree } from './utilities/TestNode';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities';\n\ndescribe('Transaction', () => {\n\tfunction createTestTransaction(): { tree: SharedTree; testTree: TestTree; transaction: Transaction } {\n\t\tconst { tree } = setUpTestSharedTree({ writeFormat: WriteFormat.v0_1_1 });\n\t\tconst testTree = setUpTestTree(tree);\n\t\treturn { tree, testTree, transaction: new Transaction(tree) };\n\t}\n\n\tfunction createValidChange(testTree: TestTree): Change {\n\t\treturn Change.delete(StableRange.only(testTree.left));\n\t}\n\n\tfunction createInvalidChange(testTree: TestTree): Change {\n\t\treturn Change.delete(StableRange.only(testTree.generateNodeId()));\n\t}\n\n\tfunction createMalformedChange(testTree: TestTree): Change {\n\t\treturn Change.insert(Number.NaN, StablePlace.after(testTree.left));\n\t}\n\n\tit('can apply an edit to the tree', () => {\n\t\tconst { tree, testTree, transaction } = createTestTransaction();\n\t\tconst editCountBefore = tree.edits.length;\n\t\ttransaction.apply(createValidChange(testTree));\n\t\ttransaction.closeAndCommit();\n\t\texpect(tree.edits.length).to.equal(editCountBefore + 1);\n\t\texpect(tree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(0);\n\t});\n\n\tit('has correct edit status when applied', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\texpect(transaction.apply(createValidChange(testTree))).to.equal(EditStatus.Applied);\n\t\texpect(transaction.status).to.equal(EditStatus.Applied);\n\t\ttransaction.closeAndCommit();\n\t});\n\n\tit('has correct edit status when invalid', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\texpect(transaction.apply(createInvalidChange(testTree))).to.equal(EditStatus.Invalid);\n\t\texpect(transaction.status).to.equal(EditStatus.Invalid);\n\t\ttransaction.closeAndCommit();\n\t});\n\n\tit('has correct edit status when malformed', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\texpect(transaction.apply(createMalformedChange(testTree))).to.equal(EditStatus.Malformed);\n\t\texpect(transaction.status).to.equal(EditStatus.Malformed);\n\t\ttransaction.closeAndCommit();\n\t});\n\n\tit('can apply multiple changes at once', () => {\n\t\tconst { tree, testTree, transaction } = createTestTransaction();\n\t\ttransaction.apply(Change.move(StableRange.only(testTree.left), StablePlace.after(testTree.right)));\n\t\ttransaction.closeAndCommit();\n\t\texpect(tree.currentView.getTrait(testTree.left.traitLocation).length).to.equal(0);\n\t\texpect(tree.currentView.getTrait(testTree.right.traitLocation).length).to.equal(2);\n\t});\n\n\tit('does not apply empty edits', () => {\n\t\tconst { tree, transaction } = createTestTransaction();\n\t\tconst editCountBefore = tree.edits.length;\n\t\ttransaction.apply([]);\n\t\ttransaction.closeAndCommit();\n\t\texpect(tree.edits.length).to.equal(editCountBefore);\n\t});\n\n\tit('does not apply a batch of changes if any of them fail', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\tconst change = createValidChange(testTree);\n\t\texpect(transaction.apply(change, change)).to.equal(EditStatus.Invalid); // Second change is invalid\n\t\texpect(transaction.status).to.equal(EditStatus.Invalid);\n\t\ttransaction.closeAndCommit();\n\t});\n\n\tit('is open when created', () => {\n\t\tconst { transaction } = createTestTransaction();\n\t\texpect(transaction.isOpen).to.be.true;\n\t});\n\n\tit('closes when a change fails to apply', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\ttransaction.apply(createInvalidChange(testTree));\n\t\texpect(transaction.isOpen).to.be.false;\n\t});\n\n\tit('closes when an edit is applied', () => {\n\t\tconst { testTree, transaction } = createTestTransaction();\n\t\texpect(transaction.isOpen).to.be.true;\n\t\ttransaction.apply(createValidChange(testTree));\n\t\texpect(transaction.isOpen).to.be.true;\n\t\ttransaction.closeAndCommit();\n\t\texpect(transaction.isOpen).to.be.false;\n\t});\n});\n"]}