@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

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

@@ -1 +0,0 @@
-{"version":3,"file":"SharedTreeWithAnchors.tests.js","sourceRoot":"","sources":["../../src/test/SharedTreeWithAnchors.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAI9B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,gBAAgB,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACtF,OAAO,EACN,cAAc,EACd,cAAc,EACd,cAAc,EACd,YAAY,EACZ,WAAW,EACX,0BAA0B,EAC1B,WAAW,GAEX,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACN,aAAa,EACb,8BAA8B,EAC9B,cAAc,EACd,eAAe,EACf,yCAAyC,GACzC,MAAM,2BAA2B,CAAC;AACnC,OAAO,EAAE,4BAA4B,EAAE,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,eAAe,EAAE,MAAM,6CAA6C,CAAC;AAwE9E,MAAM,IAAI,GAAe,aAAa,CAAC,MAAgB,CAAC,CAAC;AACzD,MAAM,KAAK,GAAe,aAAa,CAAC,OAAiB,CAAC,CAAC;AAC3D,MAAM,MAAM,mCACR,aAAa,CAAC,QAAkB,CAAC,KACpC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,GAChE,CAAC;AACF,MAAM,WAAW,mCACb,aAAa,CAAC,MAAgB,CAAC,KAClC,MAAM,EAAE;QACP,gBAAgB,EAAE,CAAC,MAAM,CAAC;KAC1B,GACD,CAAC;AACF,MAAM,iBAAiB,GAAG;IACzB,MAAM,EAAE,MAAM,CAAC,UAAU;IACzB,KAAK,EAAE,cAAc;CACrB,CAAC;AACF,MAAM,kBAAkB,GAAG;IAC1B,MAAM,EAAE,MAAM,CAAC,UAAU;IACzB,KAAK,EAAE,eAAe;CACtB,CAAC;AAEF;;GAEG;AACH,MAAM,KAAK,GAAG,aAAa,CAAC,OAAiB,CAAC,CAAC;AAE/C;;;GAGG;AACH,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAoB,CAAC,CAAC;AAErD;;GAEG;AACH,MAAM,oBAAoB,GAAG,aAAa,CAAC,uBAAiC,CAAC,CAAC;AAE9E,MAAM,WAAW,GAAG;IACnB,WAAW;IACX,SAAS,EAAE,KAAK;IAChB,aAAa,EAAE,IAAI;IACnB,YAAY,EAAE,IAAI;CAClB,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACzB,EAAE,EAAE,sBAAsB;IAC1B,SAAS,EAAE,KAAK;IAChB,aAAa,EAAE,IAAI;IACnB,YAAY,EAAE,IAAI;CAClB,CAAC;AAEF,MAAM,gBAAgB,GAAG;IACxB,EAAE,EAAE,qBAAqB;IACzB,SAAS,EAAE,KAAK;IAChB,aAAa,EAAE,IAAI;IACnB,YAAY,EAAE,IAAI;CAClB,CAAC;AAEF,MAAM,iBAAiB,GAAG;IACzB,IAAI,EAAE,0BAA0B;IAChC,cAAc,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,0BAA0B,CAAC,WAAW,CAAC;IAChF,eAAe,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE;IAChD,MAAM,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,KAAK,CAAC,EAAE;IAC9D,QAAQ,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE;IAC3B,aAAa,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE;IAC9C,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,oBAAoB,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;CAC/D,CAAC;AAEF,MAAM,gBAAgB,mCAClB,iBAAiB,KACpB,IAAI,EAAE,yBAAyB,EAC/B,cAAc,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,0BAA0B,CAAC,WAAW,CAAC,EAC/E,eAAe,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,EAChD,MAAM,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,EAC9D,aAAa,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,EAC9C,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,oBAAoB,CAAC,EAAE,GAC/D,CAAC;AAEF,MAAM,gBAAgB,mCAClB,iBAAiB,KACpB,IAAI,EAAE,+BAA+B,EACrC,cAAc,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,EAAE,0BAA0B,CAAC,WAAW,CAAC,EAChG,MAAM,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAC5D,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,EACnC,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,EAAE,oBAAoB,EAAE,IAAI,CAAC,EAAE,GAC/D,CAAC;AAEF,MAAM,cAAc,mCAChB,gBAAgB,KACnB,IAAI,EAAE,6BAA6B,EACnC,cAAc,EAAE,WAAW,CAAC,OAAO,CAAC,iBAAiB,EAAE,0BAA0B,CAAC,WAAW,CAAC,EAC9F,MAAM,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAC5D,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,EACnC,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,oBAAoB,EAAE,QAAQ,CAAC,EAAE,GAC/D,CAAC;AAEF,MAAM,oBAAoB,mCACtB,iBAAiB,KACpB,IAAI,EAAE,6BAA6B,EACnC,cAAc,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,0BAA0B,CAAC,cAAc,CAAC,EACnF,QAAQ,EAAE,EAAE,SAAS,EAAE,CAAC,QAAQ,CAAC,EAAE,GACnC,CAAC;AAEF,MAAM,mBAAmB,mCACrB,gBAAgB,KACnB,IAAI,EAAE,4BAA4B,EAClC,cAAc,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,0BAA0B,CAAC,cAAc,CAAC,EAClF,QAAQ,EAAE,oBAAoB,CAAC,QAAQ,GACvC,CAAC;AAEF,MAAM,mBAAmB,mCACrB,gBAAgB,KACnB,IAAI,EAAE,kCAAkC,EACxC,cAAc,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,EAAE,0BAA0B,CAAC,cAAc,CAAC,GACnG,CAAC;AAEF,MAAM,iBAAiB,mCACnB,cAAc,KACjB,IAAI,EAAE,gCAAgC,EACtC,cAAc,EAAE,WAAW,CAAC,OAAO,CAAC,iBAAiB,EAAE,0BAA0B,CAAC,cAAc,CAAC,GACjG,CAAC;AAEF;;;GAGG;AACH,MAAM,WAAW,GAA0B;IAC1C,iBAAiB;IACjB,gBAAgB;IAChB,gBAAgB;IAChB,cAAc;IACd,oBAAoB;IACpB,mBAAmB;IACnB,mBAAmB;IACnB,iBAAiB;CACjB,CAAC;AAEF;;GAEG;AACH,MAAM,eAAe,GAAmB;IACvC;QACC,KAAK,EAAE,oCAAoC;QAC3C,UAAU,EAAE,iBAAiB;KAC7B;IACD;QACC,KAAK,EAAE,mDAAmD;QAC1D,UAAU,EAAE,QAAQ;QACpB,UAAU,EAAE,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;KAClF;IACD;QACC,KAAK,EAAE,sEAAsE;QAC7E,UAAU,EAAE,YAAY;QACxB,UAAU,EAAE;YACX,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;SAC3D;KACD;IACD;QACC,KAAK,EAAE,4DAA4D;QACnE,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,cAAc,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC;YAC/B,GAAG,EAAE,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC;SAC3C,CAAC;KACF;IACD;QACC,KAAK,EAAE,2DAA2D;QAClE,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,cAAc,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC;YAC/B,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;SAC5B,CAAC;KACF;IACD;QACC,KAAK,EAAE,2DAA2D;QAClE,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,cAAc,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC;YAC/C,GAAG,EAAE,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC;SAC3C,CAAC;KACF;IACD;QACC,KAAK,EAAE,0DAA0D;QACjE,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,cAAc,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC;YAC/C,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC;SAC5B,CAAC;KACF;IACD;QACC,KAAK,EAAE,gDAAgD;QACvD,UAAU,EAAE,cAAc;QAC1B,UAAU,EAAE,CAAC,IAA2B,EAAE,EAAE;YAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClE,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;YAClE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;YAC3E,OAAO,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC7F,CAAC;KACD;IACD;QACC,KAAK,EAAE,+DAA+D;QACtE,UAAU,EAAE,kBAAkB;QAC9B,UAAU,EAAE,CAAC,IAA2B,EAAE,EAAE;YAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClE,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,cAAc,CAAC,CAAC;YAClE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC;YAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;YAC5G,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;YAC1D,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,aAAa,CAAC,CAAC;YACnE,OAAO,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,aAAa,CAAC,CAAC,CAAC;QACrF,CAAC;KACD;IACD;QACC,KAAK,EAAE,uCAAuC;QAC9C,UAAU,EAAE,gBAAgB;QAC5B,UAAU,EAAE,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC3D;IACD;QACC,KAAK,EAAE,yDAAyD;QAChE,UAAU,EAAE,eAAe;QAC3B,UAAU,EAAE;YACX,aAAa;YACb,GAAG,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACzE,qBAAqB;YACrB,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,iBAAiB,EAAE,SAAS,EAAE,CAAC,CAAC;SACnG;KACD;IACD;QACC,KAAK,EAAE,2DAA2D;QAClE,UAAU,EAAE,eAAe;QAC3B,UAAU,EAAE;YACX,eAAe;YACf,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,qBAAqB;YACrB,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,iBAAiB,EAAE,SAAS,EAAE,CAAC,CAAC;SACnG;KACD;IACD;QACC,KAAK,EAAE,kCAAkC;QACzC,UAAU,EAAE,UAAU;QACtB,UAAU,EAAE,CAAC,CAAU,EAAE,UAAsB,EAAE,EAAE,CAClD,cAAc,CAAC,MAAM,CAAC,CAAC,oBAAoB,CAAC,EAAE,UAAU,CAAC,cAAc,CAAC;KACzE;CACD,CAAC;AAEF,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;QACjD,4BAA4B,CAAwB,uBAAuB,EAAE,8BAA8B,CAAC,CAAC;QAC7G,eAAe,CACd,oBAAoB,EACpB,8BAA8B,EAC9B,yCAAyC,CACzC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;QACnD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;QAC1E,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;QACxE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;QAC3E,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;QAChF,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,0BAA0B,CAAC,cAAc,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IAEH,qCAAqC;IACrC,0HAA0H;IAC1H,iFAAiF;IACjF,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE;YAC7C,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,GAAG,EAAE;gBACnC,2BAA2B,CAAC,cAAc,CAAC,UAAU,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;YACnF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,gGAAgG;IAChG,gHAAgH;IAChH,gHAAgH;IAChH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;YACjD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC5D,SAAS,CAAC,kBAAkB,EAAE,CAAC;YAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,kCAAkC;QAClC,yGAAyG;QACzG,0GAA0G;QAC1G,KAAK,MAAM,WAAW,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;YACxC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,mBAAmB,EAAE,GAAG,EAAE;gBAChE,kGAAkG;gBAClG,EAAE,CAAC,0EAA0E,EAAE,GAAG,EAAE;oBACnF,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;oBACjD,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;oBACrD,SAAS,CAAC,kBAAkB,EAAE,CAAC;oBAE/B,IAAI,WAAW,EAAE;wBAChB,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;4BACzB,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BAC7C,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;yBAC1D,CAAC,CAAC;qBACH;yBAAM;wBACN,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;wBAC5C,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC;qBACzD;oBAED,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9C,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;oBAC5C,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC3F,SAAS,CAAC,kBAAkB,EAAE,CAAC;oBAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC3E,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;SACH;QAED,6GAA6G;QAC7G,uHAAuH;QACvH,6CAA6C;QAC7C,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACxE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;YAEjD,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;gBACzB,6GAA6G;gBAC7G,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAC7C,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC;gBAC3E,8EAA8E;gBAC9E,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7C,CAAC,CAAC;YAEH,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,SAAS,CAAC,kBAAkB,EAAE,CAAC;YAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC,CAAC,CAAC;QAEH,6GAA6G;QAC7G,wHAAwH;QACxH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACpE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;YAEjD,4EAA4E;YAC5E,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;gBACzB,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,kBAAkB,CAAC,CAAC;gBAC3E,8EAA8E;gBAC9E,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7C,CAAC,CAAC;YAEH,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YACxD,SAAS,CAAC,kBAAkB,EAAE,CAAC;YAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC,CAAC,CAAC;QAEH,6HAA6H;QAC7H,8CAA8C;QAC9C,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;YAEjD,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;gBACzB,2GAA2G;gBAC3G,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;gBAC1D,6FAA6F;gBAC7F,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;aAC9D,CAAC,CAAC;YACH,SAAS,CAAC,kBAAkB,EAAE,CAAC;YAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,4HAA4H;QAC5H,wDAAwD;QACxD,KAAK,MAAM,WAAW,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE;YACxC,EAAE,CAAC,wFACF,WAAW,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,EACxC,EAAE,EAAE,GAAG,EAAE;gBACR,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,UAAU,EAAE,CAAC;gBACjD,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,8BAA8B,iBACrD,uBAAuB,EAAE,SAAS,IAC/B,gBAAgB,EAClB,CAAC;gBACH,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtD,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnD,SAAS,CAAC,kBAAkB,EAAE,CAAC;gBAC/B,6CAA6C;gBAE7C,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBAClD,6CAA6C;gBAC7C,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1B,uDAAuD;gBAEvD,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC;oBACzB,wEAAwE;oBACxE,cAAc,CAAC,MAAM,CACpB,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CACtF;oBACD,6GAA6G;oBAC7G,wDAAwD;oBACxD,6GAA6G;oBAC7G,4GAA4G;oBAC5G,sCAAsC;oBACtC,6GAA6G;oBAC7G,YAAY;oBACZ,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;iBACxE,CAAC,CAAC;gBACH,iEAAiE;gBAEjE,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;gBACxD,2EAA2E;gBAC3E,qGAAqG;gBACrG,sHAAsH;gBAEtH,SAAS,CAAC,kBAAkB,EAAE,CAAC;gBAC/B,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YACrF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH;;GAEG;AACH,SAAS,2BAA2B,CACnC,YAAsC,EACtC,eAAmC;IAEnC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE;QACrC,MAAM,OAAO,GAAG,uBAAuB,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,CAAC,UAAU,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;KACjD;AACF,CAAC;AAED;;;;GAIG;AACH,SAAS,uBAAuB,CAAC,UAAsB,EAAE,YAAsC;IAC9F,IAAI,UAAU,CAAC,YAAY,CAAC,KAAK,SAAS,EAAE;QAC3C,OAAO,UAAU,CAAC,YAAY,CAAY,CAAC;KAC3C;IACD,QAAQ,YAAY,EAAE;QACrB,KAAK,cAAc;YAClB,OAAO,uBAAuB,CAAC,UAAU,EAAE,iBAAiB,CAAC,CAAC;QAC/D,KAAK,kBAAkB;YACtB,OAAO,uBAAuB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QACxD,KAAK,YAAY;YAChB,OAAO,uBAAuB,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QACtD,KAAK,gBAAgB;YACpB,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC1C;YACC,IAAI,CAAC,2DAA2D,CAAC,CAAC;KACnE;AACF,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,UAAsB,EAAE,QAAiB,EAAE,eAAmC;IACjG,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE;QACxB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,8BAA8B,CAAC,WAAW,CAAC,CAAC;QAC7F,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,8BAA8B,iBACrD,uBAAuB,IACpB,iBAAiB,EACnB,CAAC;QACH,oBAAoB;QACpB,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;QAE7C,MAAM,iBAAiB,GACtB,eAAe,KAAK,SAAS;YAC5B,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,OAAO,eAAe,KAAK,UAAU;gBACvC,CAAC,CAAC,eAAe,CAAC,KAAK,EAAE,UAAU,CAAC;gBACpC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC;oBAChC,CAAC,CAAC,eAAe;oBACjB,CAAC,CAAC,CAAC,eAAiC,CAAC,CAAC;QAExC,uDAAuD;QACvD,IAAI,eAAe,EAAE;YACpB,KAAK,CAAC,MAAM,CAAC,YAAY,CAAC,iBAAiB,CAAC,CAAC;SAC7C;QAED,2CAA2C;QAC3C,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC;QAEzD,uBAAuB,CAAC,kBAAkB,EAAE,CAAC;QAE7C,wCAAwC;QACxC,mBAAmB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,KAA4B,EAAE,KAA4B,EAAE,QAAiB;;IACzG,MAAM,OAAO,GAAG,OAAC,QAAQ,CAAC,SAAS,mCAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9E,MAAM,QAAQ,GAAG,OAAC,QAAQ,CAAC,UAAU,mCAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjF,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAClE,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACpE,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AACrE,CAAC;AAED,SAAS,WAAW,CAAC,IAA2B,EAAE,QAAuB;IACxE,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC7F,CAAC;AAED,SAAS,UAAU;IAKlB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,uBAAuB,EAAE,SAAS,EAAE,GAAG,8BAA8B,CAAC,WAAW,CAAC,CAAC;IACxG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,8BAA8B,iBACrD,uBAAuB,EAAE,SAAS,IAC/B,iBAAiB,EACnB,CAAC;IACH,SAAS,CAAC,kBAAkB,EAAE,CAAC;IAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AACpC,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 { MockContainerRuntimeFactory } from '@fluidframework/test-runtime-utils';\nimport { NodeId } from '../Identifiers';\nimport { ChangeNode, TraitLocation } from '../generic';\nimport { StablePlace, StableRange, ConstraintEffect, revert } from '../default-edits';\nimport {\n\tAnchoredChange,\n\tAnchoredDelete,\n\tAnchoredInsert,\n\tAnchoredMove,\n\tPlaceAnchor,\n\tPlaceAnchorSemanticsChoice,\n\tRangeAnchor,\n\tSharedTreeWithAnchors,\n} from '../anchored-edits';\nimport { fail } from '../Common';\nimport {\n\tmakeEmptyNode,\n\tsetUpTestSharedTreeWithAnchors,\n\tleftTraitLabel,\n\trightTraitLabel,\n\tsetUpLocalServerTestSharedTreeWithAnchors,\n} from './utilities/TestUtilities';\nimport { runSharedTreeOperationsTests } from './utilities/SharedTreeTests';\nimport { runSummaryTests } from './utilities/SummaryFormatCompatibilityTests';\n\n/**\n * This file contains tests that verify the behavior or anchors by checking how they are resolved in the face of concurrent edits.\n * There are two batteries of tests:\n * - The first is defined by the cartesian product of a representative set of concurrent edits (see `insertScenarios`) and a variety of\n *   anchor types--each anchor type is associated with an instance of `AnchorCaseOutcomes` which describe how that anchor should respond to\n *   concurrent edits (see `anchorCases`).\n * - The second checks the behavior of a specific anchor in the face of more special/corner-case concurrent edits.\n */\n\n/**\n * The expected contents of the `parent` node's traits after a test.\n */\ninterface Outcome {\n\t/**\n\t * The expected contents of the left trait.\n\t * Defaults to [left].\n\t */\n\tleftTrait?: ChangeNode[];\n\t/**\n\t * The expected contents of the right trait.\n\t * Defaults to [right].\n\t */\n\trightTrait?: ChangeNode[];\n}\n\n/**\n * The expected contents of the `parent` node's traits for a given anchor after each scenario.\n * Each field represents an expected outcome for a different set of concurrent edits in `insertScenarios`.\n */\ninterface AnchorCaseOutcomes {\n\tonNoConcurrency: Outcome;\n\tonMove: Outcome;\n\tonTeleport?: Outcome;\n\tonDelete: Outcome;\n\tonUndoDelete?: Outcome;\n\tonUndoRedoDelete?: Outcome;\n\tonDeleteParent?: Outcome;\n\tonDroppedEdit: Outcome;\n\tonInsert: Outcome;\n}\n\n/**\n * An anchor with specific semantics and in a specific contexts.\n * Includes the expected outcome of inserting the `inserted` node at the given anchor for various test scenarios.\n */\ninterface AnchorCase extends AnchorCaseOutcomes {\n\tname: string;\n\tinsertionPlace: PlaceAnchor;\n}\n\n/**\n * The changes to apply concurrently to the change whose anchor is being tested.\n */\ntype ConcurrentChanges =\n\t| AnchoredChange\n\t| readonly AnchoredChange[]\n\t| ((tree: SharedTreeWithAnchors, anchorCase: AnchorCase) => AnchoredChange[]);\n\n/**\n * A scenario that an `AnchorCase` could be put through.\n */\ninterface TestScenario {\n\ttitle: string;\n\t/**\n\t * Where to find the expected outcome for this scenario on a given `AnchorCase`.\n\t */\n\toutcomeKey: keyof AnchorCaseOutcomes;\n\tconcurrent?: ConcurrentChanges;\n}\n\nconst left: ChangeNode = makeEmptyNode('left' as NodeId);\nconst right: ChangeNode = makeEmptyNode('right' as NodeId);\nconst parent: ChangeNode = {\n\t...makeEmptyNode('parent' as NodeId),\n\ttraits: { [leftTraitLabel]: [left], [rightTraitLabel]: [right] },\n};\nconst initialTree: ChangeNode = {\n\t...makeEmptyNode('root' as NodeId),\n\ttraits: {\n\t\tparentTraitLabel: [parent],\n\t},\n};\nconst leftTraitLocation = {\n\tparent: parent.identifier,\n\tlabel: leftTraitLabel,\n};\nconst rightTraitLocation = {\n\tparent: parent.identifier,\n\tlabel: rightTraitLabel,\n};\n\n/**\n * Used for tests that require more than the left and right nodes.\n */\nconst extra = makeEmptyNode('extra' as NodeId);\n\n/**\n * The node inserted by the change whose anchors are being tested.\n * Tests outcomes are decided based on where this node ends up (if present at all).\n */\nconst inserted = makeEmptyNode('inserted' as NodeId);\n\n/**\n * Used for tests cases where we check `inserted`'s final location with respect to another node that is concurrently inserted.\n */\nconst concurrentlyInserted = makeEmptyNode('concurrently inserted' as NodeId);\n\nconst treeOptions = {\n\tinitialTree,\n\tlocalMode: false,\n\tenableAnchors: true,\n\tallowInvalid: true,\n};\n\nconst secondTreeOptions = {\n\tid: 'secondTestSharedTree',\n\tlocalMode: false,\n\tenableAnchors: true,\n\tallowInvalid: true,\n};\n\nconst thirdTreeOptions = {\n\tid: 'thirdTestSharedTree',\n\tlocalMode: false,\n\tenableAnchors: true,\n\tallowInvalid: true,\n};\n\nconst boundToNodeBefore = {\n\tname: 'BoundToNode Before(left)',\n\tinsertionPlace: PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.BoundToNode),\n\tonNoConcurrency: { leftTrait: [inserted, left] },\n\tonMove: { leftTrait: [], rightTrait: [inserted, left, right] },\n\tonDelete: { leftTrait: [] },\n\tonDroppedEdit: { leftTrait: [inserted, left] },\n\tonInsert: { leftTrait: [concurrentlyInserted, inserted, left] },\n};\n\nconst boundToNodeAfter = {\n\t...boundToNodeBefore,\n\tname: 'BoundToNode After(left)',\n\tinsertionPlace: PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.BoundToNode),\n\tonNoConcurrency: { leftTrait: [left, inserted] },\n\tonMove: { leftTrait: [], rightTrait: [left, inserted, right] },\n\tonDroppedEdit: { leftTrait: [left, inserted] },\n\tonInsert: { leftTrait: [left, inserted, concurrentlyInserted] },\n};\n\nconst boundToNodeStart = {\n\t...boundToNodeBefore,\n\tname: 'BoundToNode Start(left trait)',\n\tinsertionPlace: PlaceAnchor.atStartOf(leftTraitLocation, PlaceAnchorSemanticsChoice.BoundToNode),\n\tonMove: { leftTrait: [inserted], rightTrait: [left, right] },\n\tonDelete: { leftTrait: [inserted] },\n\tonInsert: { leftTrait: [inserted, concurrentlyInserted, left] },\n};\n\nconst boundToNodeEnd = {\n\t...boundToNodeAfter,\n\tname: 'BoundToNode End(left trait)',\n\tinsertionPlace: PlaceAnchor.atEndOf(leftTraitLocation, PlaceAnchorSemanticsChoice.BoundToNode),\n\tonMove: { leftTrait: [inserted], rightTrait: [left, right] },\n\tonDelete: { leftTrait: [inserted] },\n\tonInsert: { leftTrait: [left, concurrentlyInserted, inserted] },\n};\n\nconst relativeToNodeBefore = {\n\t...boundToNodeBefore,\n\tname: 'RelativeToNode Before(left)',\n\tinsertionPlace: PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.RelativeToNode),\n\tonDelete: { leftTrait: [inserted] },\n};\n\nconst relativeToNodeAfter = {\n\t...boundToNodeAfter,\n\tname: 'RelativeToNode After(left)',\n\tinsertionPlace: PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.RelativeToNode),\n\tonDelete: relativeToNodeBefore.onDelete,\n};\n\nconst relativeToNodeStart = {\n\t...boundToNodeStart,\n\tname: 'RelativeToNode Start(left trait)',\n\tinsertionPlace: PlaceAnchor.atStartOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode),\n};\n\nconst relativeToNodeEnd = {\n\t...boundToNodeEnd,\n\tname: 'RelativeToNode End(left trait)',\n\tinsertionPlace: PlaceAnchor.atEndOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode),\n};\n\n/**\n * A representative set of possible anchors with a variety of semantics and in a variety of contexts.\n * Includes the expected outcome of inserting the `inserted` node at the given anchor for various test scenarios.\n */\nconst anchorCases: readonly AnchorCase[] = [\n\tboundToNodeBefore,\n\tboundToNodeAfter,\n\tboundToNodeStart,\n\tboundToNodeEnd,\n\trelativeToNodeBefore,\n\trelativeToNodeAfter,\n\trelativeToNodeStart,\n\trelativeToNodeEnd,\n];\n\n/**\n * A set of test scenario where `inserted` is inserted at a given anchor.\n */\nconst insertScenarios: TestScenario[] = [\n\t{\n\t\ttitle: 'when there are no concurrent edits',\n\t\toutcomeKey: 'onNoConcurrency',\n\t},\n\t{\n\t\ttitle: 'when target sibling is moved to a different trait',\n\t\toutcomeKey: 'onMove',\n\t\tconcurrent: AnchoredMove.create(StableRange.only(left), StablePlace.before(right)),\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted then re-inserted in a different trait',\n\t\toutcomeKey: 'onTeleport',\n\t\tconcurrent: [\n\t\t\tAnchoredDelete.create(StableRange.only(left)),\n\t\t\t...AnchoredInsert.create([left], StablePlace.before(right)),\n\t\t],\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted with (before, before) range',\n\t\toutcomeKey: 'onDelete',\n\t\tconcurrent: AnchoredDelete.create({\n\t\t\tstart: StablePlace.before(left),\n\t\t\tend: StablePlace.atEndOf(leftTraitLocation),\n\t\t}),\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted with (before, after) range',\n\t\toutcomeKey: 'onDelete',\n\t\tconcurrent: AnchoredDelete.create({\n\t\t\tstart: StablePlace.before(left),\n\t\t\tend: StablePlace.after(left),\n\t\t}),\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted with (after, before) range',\n\t\toutcomeKey: 'onDelete',\n\t\tconcurrent: AnchoredDelete.create({\n\t\t\tstart: StablePlace.atStartOf(leftTraitLocation),\n\t\t\tend: StablePlace.atEndOf(leftTraitLocation),\n\t\t}),\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted with (after, after) range',\n\t\toutcomeKey: 'onDelete',\n\t\tconcurrent: AnchoredDelete.create({\n\t\t\tstart: StablePlace.atStartOf(leftTraitLocation),\n\t\t\tend: StablePlace.after(left),\n\t\t}),\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted then un-deleted',\n\t\toutcomeKey: 'onUndoDelete',\n\t\tconcurrent: (tree: SharedTreeWithAnchors) => {\n\t\t\tconst deletionEditId = tree.editor.delete(StableRange.only(left));\n\t\t\tconst deletionEditIndex = tree.edits.getIndexOfId(deletionEditId);\n\t\t\tconst deletionEdit = tree.edits.getEditInSessionAtIndex(deletionEditIndex);\n\t\t\treturn revert(deletionEdit.changes, tree.logViewer.getSnapshotInSession(deletionEditIndex));\n\t\t},\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted then un-deleted and re-deleted',\n\t\toutcomeKey: 'onUndoRedoDelete',\n\t\tconcurrent: (tree: SharedTreeWithAnchors) => {\n\t\t\tconst deletionEditId = tree.editor.delete(StableRange.only(left));\n\t\t\tconst deletionEditIndex = tree.edits.getIndexOfId(deletionEditId);\n\t\t\tconst deletionEdit = tree.edits.getEditInSessionAtIndex(deletionEditIndex);\n\t\t\tconst undoEditId = tree.editor.revert(deletionEdit, tree.logViewer.getSnapshotInSession(deletionEditIndex));\n\t\t\tconst undoEditIndex = tree.edits.getIndexOfId(undoEditId);\n\t\t\tconst undoEdit = tree.edits.getEditInSessionAtIndex(undoEditIndex);\n\t\t\treturn revert(undoEdit.changes, tree.logViewer.getSnapshotInSession(undoEditIndex));\n\t\t},\n\t},\n\t{\n\t\ttitle: 'when target sibling parent is deleted',\n\t\toutcomeKey: 'onDeleteParent',\n\t\tconcurrent: AnchoredDelete.create(StableRange.only(parent)),\n\t},\n\t{\n\t\ttitle: 'when target sibling is moved in an edit that is dropped',\n\t\toutcomeKey: 'onDroppedEdit',\n\t\tconcurrent: [\n\t\t\t// Valid move\n\t\t\t...AnchoredMove.create(StableRange.only(left), StablePlace.before(right)),\n\t\t\t// Invalid constraint\n\t\t\tAnchoredChange.constraint(StableRange.only(left), ConstraintEffect.InvalidAndDiscard, undefined, 0),\n\t\t],\n\t},\n\t{\n\t\ttitle: 'when target sibling is deleted in an edit that is dropped',\n\t\toutcomeKey: 'onDroppedEdit',\n\t\tconcurrent: [\n\t\t\t// Valid delete\n\t\t\tAnchoredDelete.create(StableRange.only(left)),\n\t\t\t// Invalid constraint\n\t\t\tAnchoredChange.constraint(StableRange.only(left), ConstraintEffect.InvalidAndDiscard, undefined, 0),\n\t\t],\n\t},\n\t{\n\t\ttitle: 'when target place is inserted at',\n\t\toutcomeKey: 'onInsert',\n\t\tconcurrent: (_: unknown, anchorCase: AnchorCase) =>\n\t\t\tAnchoredInsert.create([concurrentlyInserted], anchorCase.insertionPlace),\n\t},\n];\n\ndescribe('SharedTreeWithAnchors', () => {\n\tdescribe('Fulfills the SharedTree contract', () => {\n\t\trunSharedTreeOperationsTests<SharedTreeWithAnchors>('SharedTree Operations', setUpTestSharedTreeWithAnchors);\n\t\trunSummaryTests<SharedTreeWithAnchors>(\n\t\t\t'SharedTree Summary',\n\t\t\tsetUpTestSharedTreeWithAnchors,\n\t\t\tsetUpLocalServerTestSharedTreeWithAnchors\n\t\t);\n\t});\n\n\tit('PlaceAnchor builders default to RelativeToNode semantics', () => {\n\t\tconst start = PlaceAnchor.atStartOf(leftTraitLocation);\n\t\tconst end = PlaceAnchor.atEndOf(leftTraitLocation);\n\t\tconst before = PlaceAnchor.before(left);\n\t\tconst after = PlaceAnchor.after(left);\n\t\texpect(start.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t\texpect(end.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t\texpect(before.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t\texpect(after.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t});\n\n\tit('RangeAnchor builders default to RelativeToNode semantics', () => {\n\t\tconst range = RangeAnchor.only(left);\n\t\texpect(range.start.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t\texpect(range.end.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);\n\t});\n\n\t// This is the main battery of tests.\n\t// These tests insert the `inserted` node at a given PlaceAnchor in different scenarios and check where that node ends up.\n\t// The scenarios cover the various ways concurrent change might affect an anchor.\n\tdescribe('Basic scenarios', () => {\n\t\tfor (const insertScenario of insertScenarios) {\n\t\t\tdescribe(insertScenario.title, () => {\n\t\t\t\tinsertTestsWithExtraChanges(insertScenario.outcomeKey, insertScenario.concurrent);\n\t\t\t});\n\t\t}\n\t});\n\n\t// These tests exercise special scenarios that the main battery of tests (above) does not cover.\n\t// They are mainly aimed at uncovering invalid assumptions that the anchor resolution implementation might make.\n\t// While these tests could be made exhaustive like the main battery, doing so would just add redundant coverage.\n\tdescribe(`Special scenarios`, () => {\n\t\tit('when target place is invalid', () => {\n\t\t\tconst { treeA, treeB, container } = setupTrees();\n\t\t\ttreeA.editor.insert(inserted, PlaceAnchor.before(inserted));\n\t\t\tcontainer.processAllMessages();\n\t\t\texpectChangedTraits(treeA, treeB, {});\n\t\t});\n\n\t\t// For each scenario we test with:\n\t\t//   groupInEdit=true:  the concurrent changes that introduced the conflict were applied in a single edit\n\t\t//   groupInEdit=false: the concurrent changes that introduced the conflict were applied in separate edits\n\t\tfor (const groupInEdit of [true, false]) {\n\t\t\tdescribe(groupInEdit ? 'In one edit' : 'In separate edits', () => {\n\t\t\t\t// These tests verify that re-anchoring works even when more than one place anchor needs updating.\n\t\t\t\tit('when target place and source range both need updating due to two deletes', () => {\n\t\t\t\t\tconst { treeA, treeB, container } = setupTrees();\n\t\t\t\t\ttreeA.editor.insert(extra, StablePlace.before(left));\n\t\t\t\t\tcontainer.processAllMessages();\n\n\t\t\t\t\tif (groupInEdit) {\n\t\t\t\t\t\ttreeB.editor.applyChanges([\n\t\t\t\t\t\t\tAnchoredDelete.create(RangeAnchor.only(left)),\n\t\t\t\t\t\t\tAnchoredDelete.create(RangeAnchor.all(rightTraitLocation)),\n\t\t\t\t\t\t]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\ttreeB.editor.delete(RangeAnchor.only(left));\n\t\t\t\t\t\ttreeB.editor.delete(RangeAnchor.all(rightTraitLocation));\n\t\t\t\t\t}\n\n\t\t\t\t\tconst beforeExtra = PlaceAnchor.before(extra);\n\t\t\t\t\tconst afterExtra = PlaceAnchor.after(extra);\n\t\t\t\t\ttreeA.editor.move(RangeAnchor.from(beforeExtra).to(afterExtra), PlaceAnchor.before(right));\n\t\t\t\t\tcontainer.processAllMessages();\n\t\t\t\t\texpectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [extra] });\n\t\t\t\t});\n\t\t\t});\n\t\t}\n\n\t\t// This test covers the scenario that yields different results depending on whether the front-biased approach\n\t\t// seeks backward to find the most recent offending change at the granularity of changes or at the granularity of edits\n\t\t// and then proceeds through changes forward.\n\t\tit('when target place is teleported then deleted in a single edit', () => {\n\t\t\tconst { treeA, treeB, container } = setupTrees();\n\n\t\t\ttreeB.editor.applyChanges([\n\t\t\t\t// The reanchor will happen on this change if seeking backward through edits and then forward through changes\n\t\t\t\tAnchoredDelete.create(RangeAnchor.only(left)),\n\t\t\t\t...AnchoredInsert.create([left], PlaceAnchor.atStartOf(rightTraitLocation)),\n\t\t\t\t// The reanchor will happen on this change if seeking backward through changes\n\t\t\t\tAnchoredDelete.create(RangeAnchor.only(left)),\n\t\t\t]);\n\n\t\t\ttreeA.editor.insert(inserted, PlaceAnchor.before(left));\n\t\t\tcontainer.processAllMessages();\n\t\t\texpectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted, right] });\n\t\t});\n\n\t\t// This test covers the scenario that yields different results depending on whether the front-biased approach\n\t\t// seeks backward to find the most recent offending change at the granularity of changes or at the granularity of edits.\n\t\tit('when target place is teleported then deleted across edits', () => {\n\t\t\tconst { treeA, treeB, container } = setupTrees();\n\n\t\t\t// The reanchor will happen on this change if seeking backward through edits\n\t\t\ttreeB.editor.delete(left);\n\t\t\ttreeB.editor.applyChanges([\n\t\t\t\t...AnchoredInsert.create([left], StablePlace.atStartOf(rightTraitLocation)),\n\t\t\t\t// The reanchor will happen on this change if seeking backward through changes\n\t\t\t\tAnchoredDelete.create(StableRange.only(left)),\n\t\t\t]);\n\n\t\t\ttreeA.editor.insert(inserted, PlaceAnchor.before(left));\n\t\t\tcontainer.processAllMessages();\n\t\t\texpectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted, right] });\n\t\t});\n\n\t\t// This test covers the scenario that yields different results depending on whether the changes of the edit being applied are\n\t\t// included in the reconciliation path or not.\n\t\tit('when target place is deleted by the edit being rebased', () => {\n\t\t\tconst { treeA, treeB, container } = setupTrees();\n\n\t\t\ttreeB.editor.move(left, PlaceAnchor.before(right));\n\t\t\ttreeA.editor.applyChanges([\n\t\t\t\t// The reanchor will happen on this change if changes for this edit are included in the reconciliation path\n\t\t\t\tAnchoredDelete.create(RangeAnchor.all(rightTraitLocation)),\n\t\t\t\t// This change will fail if changes for this edit are not included in the reconciliation path\n\t\t\t\t...AnchoredInsert.create([inserted], PlaceAnchor.before(left)),\n\t\t\t]);\n\t\t\tcontainer.processAllMessages();\n\t\t\texpectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted] });\n\t\t});\n\n\t\t// These tests cover the scenario that yields different results depending on whether the change application performed on the\n\t\t// reconciliation path is itself using anchor resolution\n\t\tfor (const extraChange of [false, true]) {\n\t\t\tit(`when target place resolution requires resolution of a different place in another edit${\n\t\t\t\textraChange ? ' (with extra change)' : ''\n\t\t\t}`, () => {\n\t\t\t\tconst { treeA, treeB, container } = setupTrees();\n\t\t\t\tconst { tree: treeC } = setUpTestSharedTreeWithAnchors({\n\t\t\t\t\tcontainerRuntimeFactory: container,\n\t\t\t\t\t...thirdTreeOptions,\n\t\t\t\t});\n\t\t\t\ttreeA.editor.insert(extra, StablePlace.before(right));\n\t\t\t\ttreeA.editor.move(left, StablePlace.before(extra));\n\t\t\t\tcontainer.processAllMessages();\n\t\t\t\t// State of right trait: [left, extra, right]\n\n\t\t\t\ttreeB.editor.move(left, StablePlace.after(extra));\n\t\t\t\t// State of right trait: [extra, left, right]\n\t\t\t\ttreeB.editor.delete(left);\n\t\t\t\t// State of right trait: [extra, left-tombstone, right]\n\n\t\t\t\ttreeC.editor.applyChanges([\n\t\t\t\t\t// Will be re-anchored to delete [right] instead of [left, extra, right]\n\t\t\t\t\tAnchoredDelete.create(\n\t\t\t\t\t\tRangeAnchor.from(PlaceAnchor.before(left)).to(StablePlace.atEndOf(rightTraitLocation))\n\t\t\t\t\t),\n\t\t\t\t\t// When present, the no-op change after the change of interest to ensures the anchor resolution uses resolved\n\t\t\t\t\t// changes in the reconciliation path (or derives them).\n\t\t\t\t\t// When not present, the above delete is the only change in the edit so there's a possibility that the anchor\n\t\t\t\t\t// resolution would use cached edit results (which reflect the resolved changes) and therefore don't require\n\t\t\t\t\t// the actual use of resolved changes.\n\t\t\t\t\t// We still want to test without this extra change to ensure that such a possibility, if leveraged, does work\n\t\t\t\t\t// properly.\n\t\t\t\t\t...(extraChange ? [AnchoredChange.clearPayload(parent.identifier)] : []),\n\t\t\t\t]);\n\t\t\t\t// State of right trait: [extra, left-tombstone, right-tombstone]\n\n\t\t\t\ttreeA.editor.insert(inserted, PlaceAnchor.after(right));\n\t\t\t\t// State of right trait: [extra, left-tombstone, right-tombstone, inserted]\n\t\t\t\t// Unless anchor resolution is not performed which case the edit will fail when it tries to apply the\n\t\t\t\t// \"delete everything before left\" edit because it will not take into account the resolved location for \"before left\".\n\n\t\t\t\tcontainer.processAllMessages();\n\t\t\t\texpectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [extra, inserted] });\n\t\t\t});\n\t\t}\n\t});\n});\n\n/**\n * Runs an insertion test scenario on all possible anchors.\n */\nfunction insertTestsWithExtraChanges(\n\toutcomeField: keyof AnchorCaseOutcomes,\n\tconcurrentSteps?: ConcurrentChanges\n): void {\n\tfor (const anchorCase of anchorCases) {\n\t\tconst outcome = outcomeFromCaseAndField(anchorCase, outcomeField);\n\t\tinsertTest(anchorCase, outcome, concurrentSteps);\n\t}\n}\n\n/**\n * Provides the expected outcome for a particular `AnchorCase` instance and scenario (described by its `outcomeField`)\n * This helps reduce cruft in the `AnchorCase` by providing general expectations (e.g., concurrently deleting a node and undoing the\n * deletion is expected, unless otherwise specified, to yield the same outcome as through no concurrent changes were made).\n */\nfunction outcomeFromCaseAndField(anchorCase: AnchorCase, outcomeField: keyof AnchorCaseOutcomes): Outcome {\n\tif (anchorCase[outcomeField] !== undefined) {\n\t\treturn anchorCase[outcomeField] as Outcome;\n\t}\n\tswitch (outcomeField) {\n\t\tcase 'onUndoDelete':\n\t\t\treturn outcomeFromCaseAndField(anchorCase, 'onNoConcurrency');\n\t\tcase 'onUndoRedoDelete':\n\t\t\treturn outcomeFromCaseAndField(anchorCase, 'onDelete');\n\t\tcase 'onTeleport':\n\t\t\treturn outcomeFromCaseAndField(anchorCase, 'onMove');\n\t\tcase 'onDeleteParent':\n\t\t\treturn { leftTrait: [], rightTrait: [] };\n\t\tdefault:\n\t\t\tfail('The expected outcome for this case has not been specified');\n\t}\n}\n\n/**\n * Runs the insertion test characterized by the anchor as which to insert, the expected outcome, and the concurrent changes to apply.\n */\nfunction insertTest(anchorCase: AnchorCase, expected: Outcome, concurrentSteps?: ConcurrentChanges): void {\n\tit(anchorCase.name, () => {\n\t\tconst { tree: treeA, containerRuntimeFactory } = setUpTestSharedTreeWithAnchors(treeOptions);\n\t\tconst { tree: treeB } = setUpTestSharedTreeWithAnchors({\n\t\t\tcontainerRuntimeFactory,\n\t\t\t...secondTreeOptions,\n\t\t});\n\t\t// Sync initial tree\n\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\tconst concurrentChanges =\n\t\t\tconcurrentSteps === undefined\n\t\t\t\t? []\n\t\t\t\t: typeof concurrentSteps === 'function'\n\t\t\t\t? concurrentSteps(treeB, anchorCase)\n\t\t\t\t: Array.isArray(concurrentSteps)\n\t\t\t\t? concurrentSteps\n\t\t\t\t: [concurrentSteps as AnchoredChange];\n\n\t\t// Perform the concurrent edit(s) to be sequenced first\n\t\tif (concurrentSteps) {\n\t\t\ttreeB.editor.applyChanges(concurrentChanges);\n\t\t}\n\n\t\t// Make the insertion at the anchored place\n\t\ttreeA.editor.insert(inserted, anchorCase.insertionPlace);\n\n\t\tcontainerRuntimeFactory.processAllMessages();\n\n\t\t// Test the outcome matches expectations\n\t\texpectChangedTraits(treeA, treeB, expected);\n\t});\n}\n\nfunction expectChangedTraits(treeA: SharedTreeWithAnchors, treeB: SharedTreeWithAnchors, expected: Outcome) {\n\tconst leftIds = (expected.leftTrait ?? [left]).map((node) => node.identifier);\n\tconst rightIds = (expected.rightTrait ?? [right]).map((node) => node.identifier);\n\texpect(tryGetTrait(treeA, leftTraitLocation)).deep.equal(leftIds);\n\texpect(tryGetTrait(treeB, leftTraitLocation)).deep.equal(leftIds);\n\texpect(tryGetTrait(treeA, rightTraitLocation)).deep.equal(rightIds);\n\texpect(tryGetTrait(treeB, rightTraitLocation)).deep.equal(rightIds);\n}\n\nfunction tryGetTrait(tree: SharedTreeWithAnchors, location: TraitLocation): readonly NodeId[] {\n\treturn tree.currentView.hasNode(location.parent) ? tree.currentView.getTrait(location) : [];\n}\n\nfunction setupTrees(): {\n\ttreeA: SharedTreeWithAnchors;\n\ttreeB: SharedTreeWithAnchors;\n\tcontainer: MockContainerRuntimeFactory;\n} {\n\tconst { tree: treeA, containerRuntimeFactory: container } = setUpTestSharedTreeWithAnchors(treeOptions);\n\tconst { tree: treeB } = setUpTestSharedTreeWithAnchors({\n\t\tcontainerRuntimeFactory: container,\n\t\t...secondTreeOptions,\n\t});\n\tcontainer.processAllMessages();\n\treturn { treeA, treeB, container };\n}\n"]}

package/lib/test/Snapshot.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Snapshot.tests.d.ts","sourceRoot":"","sources":["../../src/test/Snapshot.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/Snapshot.tests.js

@@ -1,96 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { Side, Snapshot } from '../Snapshot';
-import { EditValidationResult } from '../Checkout';
-import { detachRange, insertIntoTrait, StablePlace, StableRange, validateStableRange } from '../default-edits';
-import { simpleTreeSnapshotWithValidation, left, right, leftTraitLocation, makeEmptyNode, makeTestNode, } from './utilities/TestUtilities';
-describe('Snapshot', () => {
-    describe('creation from a ChangeNode', () => {
-        it('ignores empty traits', () => {
-            const nodeId = '46711f26-5a27-4a35-9f04-0602dd853b43';
-            const testNode = makeTestNode();
-            const node = {
-                traits: {
-                    trait: [testNode],
-                    emptyTrait: [],
-                },
-                definition: '9f9f7fd1-780b-4d78-bca7-2342df4523f2',
-                identifier: nodeId,
-            };
-            const snapshot = Snapshot.fromTree(node);
-            expect(snapshot.getChangeNode(nodeId).traits.trait[0].identifier).to.equal(testNode.identifier);
-            expect(snapshot.getChangeNode(nodeId).traits.emptyTrait).to.equal(undefined);
-        });
-    });
-    describe('StableRange validation', () => {
-        it('is malformed when anchors are malformed', () => {
-            expect(validateStableRange(simpleTreeSnapshotWithValidation, {
-                // trait and sibling should be mutually exclusive
-                start: { referenceTrait: leftTraitLocation, referenceSibling: left.identifier, side: Side.Before },
-                end: { referenceSibling: left.identifier, side: Side.After },
-            })).equals(EditValidationResult.Malformed);
-        });
-        it('is invalid when anchors are incorrectly ordered', () => {
-            expect(validateStableRange(simpleTreeSnapshotWithValidation, {
-                start: { referenceSibling: left.identifier, side: Side.After },
-                end: { referenceSibling: left.identifier, side: Side.Before },
-            })).equals(EditValidationResult.Invalid);
-        });
-        it('is invalid when anchors are in different traits', () => {
-            expect(validateStableRange(simpleTreeSnapshotWithValidation, {
-                start: { referenceSibling: left.identifier, side: Side.Before },
-                end: { referenceSibling: right.identifier, side: Side.After },
-            })).equals(EditValidationResult.Invalid);
-        });
-        it('is invalid when an anchor is invalid', () => {
-            expect(validateStableRange(simpleTreeSnapshotWithValidation, {
-                start: { referenceSibling: '49a7e636-71ed-45f1-a1a8-2b8f2e7e84a3', side: Side.Before },
-                end: { referenceSibling: right.identifier, side: Side.After },
-            })).equals(EditValidationResult.Invalid);
-        });
-    });
-    describe('Mutators', () => {
-        const label = 'label';
-        const nodeA = makeEmptyNode();
-        const nodeB = makeEmptyNode();
-        const tree = Object.assign(Object.assign({}, makeEmptyNode()), { traits: { [label]: [nodeA, nodeB] } });
-        const startingSnapshot = Snapshot.fromTree(tree, true);
-        it('can detach a single node', () => {
-            var _a;
-            expect(startingSnapshot.getIndexInTrait(nodeA.identifier)).to.equal(0);
-            expect(startingSnapshot.getIndexInTrait(nodeB.identifier)).to.equal(1);
-            const { snapshot } = detachRange(startingSnapshot, StableRange.only(nodeA));
-            expect(snapshot.size).to.equal(3);
-            expect(snapshot.hasNode(nodeA.identifier)).to.be.true;
-            expect(snapshot.getParentSnapshotNode(nodeA.identifier)).to.be.undefined;
-            expect((_a = snapshot.getParentSnapshotNode(nodeB.identifier)) === null || _a === void 0 ? void 0 : _a.identifier).to.equal(tree.identifier);
-            expect(snapshot.getIndexInTrait(nodeB.identifier)).to.equal(0);
-        });
-        it('can detach an entire trait', () => {
-            const { snapshot, detached } = detachRange(startingSnapshot, StableRange.all({ parent: tree.identifier, label }));
-            expect(detached).deep.equals([nodeA.identifier, nodeB.identifier]);
-            expect(snapshot.size).to.equal(3);
-            expect(snapshot.hasNode(nodeA.identifier)).to.be.true;
-            expect(snapshot.hasNode(nodeB.identifier)).to.be.true;
-            expect(snapshot.getParentSnapshotNode(nodeA.identifier)).to.be.undefined;
-            expect(snapshot.getParentSnapshotNode(nodeB.identifier)).to.be.undefined;
-        });
-        it('can insert a node', () => {
-            var _a;
-            const newNode = makeEmptyNode();
-            let snapshot = startingSnapshot.addNodes([Object.assign(Object.assign({}, newNode), { traits: new Map() })]);
-            expect(snapshot.size).to.equal(4);
-            expect(snapshot.hasNode(newNode.identifier)).to.be.true;
-            expect(snapshot.getParentSnapshotNode(newNode.identifier)).to.be.undefined;
-            snapshot = insertIntoTrait(snapshot, [newNode.identifier], StablePlace.atStartOf({ parent: tree.identifier, label }));
-            expect((_a = snapshot.getParentSnapshotNode(newNode.identifier)) === null || _a === void 0 ? void 0 : _a.identifier).to.equal(tree.identifier);
-            expect(snapshot.getIndexInTrait(newNode.identifier)).to.equal(0);
-            expect(snapshot.getIndexInTrait(nodeA.identifier)).to.equal(1);
-            expect(snapshot.getIndexInTrait(nodeB.identifier)).to.equal(2);
-        });
-    });
-});
-//# sourceMappingURL=Snapshot.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Snapshot.tests.js","sourceRoot":"","sources":["../../src/test/Snapshot.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,WAAW,EAAE,WAAW,EAAE,mBAAmB,EAAE,MAAM,kBAAkB,CAAC;AAE/G,OAAO,EACN,gCAAgC,EAChC,IAAI,EACJ,KAAK,EACL,iBAAiB,EACjB,aAAa,EACb,YAAY,GACZ,MAAM,2BAA2B,CAAC;AAEnC,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;IACzB,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,MAAM,GAAG,sCAAgD,CAAC;YAChE,MAAM,QAAQ,GAAG,YAAY,EAAE,CAAC;YAChC,MAAM,IAAI,GAAe;gBACxB,MAAM,EAAE;oBACP,KAAK,EAAE,CAAC,QAAQ,CAAC;oBACjB,UAAU,EAAE,EAAE;iBACd;gBACD,UAAU,EAAE,sCAAoD;gBAChE,UAAU,EAAE,MAAM;aAClB,CAAC;YAEF,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChG,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACvC,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAClD,MAAM,CACL,mBAAmB,CAAC,gCAAgC,EAAE;gBACrD,iDAAiD;gBACjD,KAAK,EAAE,EAAE,cAAc,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBAClG,GAAG,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aAC5D,CAAC,CACF,CAAC,MAAM,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,CACL,mBAAmB,CAAC,gCAAgC,EAAE;gBACrD,KAAK,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;gBAC9D,GAAG,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aAC7D,CAAC,CACF,CAAC,MAAM,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,CACL,mBAAmB,CAAC,gCAAgC,EAAE;gBACrD,KAAK,EAAE,EAAE,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBAC/D,GAAG,EAAE,EAAE,gBAAgB,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aAC7D,CAAC,CACF,CAAC,MAAM,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,MAAM,CACL,mBAAmB,CAAC,gCAAgC,EAAE;gBACrD,KAAK,EAAE,EAAE,gBAAgB,EAAE,sCAAgD,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBAChG,GAAG,EAAE,EAAE,gBAAgB,EAAE,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aAC7D,CAAC,CACF,CAAC,MAAM,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,MAAM,KAAK,GAAG,OAAqB,CAAC;QACpC,MAAM,KAAK,GAAG,aAAa,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,aAAa,EAAE,CAAC;QAC9B,MAAM,IAAI,mCACN,aAAa,EAAE,KAClB,MAAM,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE,GACnC,CAAC;QACF,MAAM,gBAAgB,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvD,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;;YACnC,MAAM,CAAC,gBAAgB,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvE,MAAM,CAAC,gBAAgB,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACvE,MAAM,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC,gBAAgB,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5E,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACtD,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACzE,MAAM,OAAC,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,UAAU,CAAC,0CAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/F,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,GAAG,WAAW,CACzC,gBAAgB,EAChB,WAAW,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,CACnD,CAAC;YACF,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACtD,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACtD,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACzE,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC1E,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;;YAC5B,MAAM,OAAO,GAAG,aAAa,EAAE,CAAC;YAChC,IAAI,QAAQ,GAAG,gBAAgB,CAAC,QAAQ,CAAC,iCAAM,OAAO,KAAE,MAAM,EAAE,IAAI,GAAG,EAAE,IAAG,CAAC,CAAC;YAC9E,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YACxD,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAC3E,QAAQ,GAAG,eAAe,CACzB,QAAQ,EACR,CAAC,OAAO,CAAC,UAAU,CAAC,EACpB,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,CAAC,CACzD,CAAC;YACF,MAAM,OAAC,QAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC,UAAU,CAAC,0CAAE,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACjG,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/D,MAAM,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChE,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 { Definition, NodeId, TraitLabel } from '../Identifiers';\nimport { Side, Snapshot } from '../Snapshot';\nimport { EditValidationResult } from '../Checkout';\nimport { detachRange, insertIntoTrait, StablePlace, StableRange, validateStableRange } from '../default-edits';\nimport { ChangeNode } from '../generic';\nimport {\n\tsimpleTreeSnapshotWithValidation,\n\tleft,\n\tright,\n\tleftTraitLocation,\n\tmakeEmptyNode,\n\tmakeTestNode,\n} from './utilities/TestUtilities';\n\ndescribe('Snapshot', () => {\n\tdescribe('creation from a ChangeNode', () => {\n\t\tit('ignores empty traits', () => {\n\t\t\tconst nodeId = '46711f26-5a27-4a35-9f04-0602dd853b43' as NodeId;\n\t\t\tconst testNode = makeTestNode();\n\t\t\tconst node: ChangeNode = {\n\t\t\t\ttraits: {\n\t\t\t\t\ttrait: [testNode],\n\t\t\t\t\temptyTrait: [],\n\t\t\t\t},\n\t\t\t\tdefinition: '9f9f7fd1-780b-4d78-bca7-2342df4523f2' as Definition,\n\t\t\t\tidentifier: nodeId,\n\t\t\t};\n\n\t\t\tconst snapshot = Snapshot.fromTree(node);\n\t\t\texpect(snapshot.getChangeNode(nodeId).traits.trait[0].identifier).to.equal(testNode.identifier);\n\t\t\texpect(snapshot.getChangeNode(nodeId).traits.emptyTrait).to.equal(undefined);\n\t\t});\n\t});\n\n\tdescribe('StableRange validation', () => {\n\t\tit('is malformed when anchors are malformed', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(simpleTreeSnapshotWithValidation, {\n\t\t\t\t\t// trait and sibling should be mutually exclusive\n\t\t\t\t\tstart: { referenceTrait: leftTraitLocation, referenceSibling: left.identifier, side: Side.Before },\n\t\t\t\t\tend: { referenceSibling: left.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).equals(EditValidationResult.Malformed);\n\t\t});\n\t\tit('is invalid when anchors are incorrectly ordered', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(simpleTreeSnapshotWithValidation, {\n\t\t\t\t\tstart: { referenceSibling: left.identifier, side: Side.After },\n\t\t\t\t\tend: { referenceSibling: left.identifier, side: Side.Before },\n\t\t\t\t})\n\t\t\t).equals(EditValidationResult.Invalid);\n\t\t});\n\t\tit('is invalid when anchors are in different traits', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(simpleTreeSnapshotWithValidation, {\n\t\t\t\t\tstart: { referenceSibling: left.identifier, side: Side.Before },\n\t\t\t\t\tend: { referenceSibling: right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).equals(EditValidationResult.Invalid);\n\t\t});\n\t\tit('is invalid when an anchor is invalid', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(simpleTreeSnapshotWithValidation, {\n\t\t\t\t\tstart: { referenceSibling: '49a7e636-71ed-45f1-a1a8-2b8f2e7e84a3' as NodeId, side: Side.Before },\n\t\t\t\t\tend: { referenceSibling: right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).equals(EditValidationResult.Invalid);\n\t\t});\n\t});\n\n\tdescribe('Mutators', () => {\n\t\tconst label = 'label' as TraitLabel;\n\t\tconst nodeA = makeEmptyNode();\n\t\tconst nodeB = makeEmptyNode();\n\t\tconst tree: ChangeNode = {\n\t\t\t...makeEmptyNode(),\n\t\t\ttraits: { [label]: [nodeA, nodeB] },\n\t\t};\n\t\tconst startingSnapshot = Snapshot.fromTree(tree, true);\n\t\tit('can detach a single node', () => {\n\t\t\texpect(startingSnapshot.getIndexInTrait(nodeA.identifier)).to.equal(0);\n\t\t\texpect(startingSnapshot.getIndexInTrait(nodeB.identifier)).to.equal(1);\n\t\t\tconst { snapshot } = detachRange(startingSnapshot, StableRange.only(nodeA));\n\t\t\texpect(snapshot.size).to.equal(3);\n\t\t\texpect(snapshot.hasNode(nodeA.identifier)).to.be.true;\n\t\t\texpect(snapshot.getParentSnapshotNode(nodeA.identifier)).to.be.undefined;\n\t\t\texpect(snapshot.getParentSnapshotNode(nodeB.identifier)?.identifier).to.equal(tree.identifier);\n\t\t\texpect(snapshot.getIndexInTrait(nodeB.identifier)).to.equal(0);\n\t\t});\n\t\tit('can detach an entire trait', () => {\n\t\t\tconst { snapshot, detached } = detachRange(\n\t\t\t\tstartingSnapshot,\n\t\t\t\tStableRange.all({ parent: tree.identifier, label })\n\t\t\t);\n\t\t\texpect(detached).deep.equals([nodeA.identifier, nodeB.identifier]);\n\t\t\texpect(snapshot.size).to.equal(3);\n\t\t\texpect(snapshot.hasNode(nodeA.identifier)).to.be.true;\n\t\t\texpect(snapshot.hasNode(nodeB.identifier)).to.be.true;\n\t\t\texpect(snapshot.getParentSnapshotNode(nodeA.identifier)).to.be.undefined;\n\t\t\texpect(snapshot.getParentSnapshotNode(nodeB.identifier)).to.be.undefined;\n\t\t});\n\t\tit('can insert a node', () => {\n\t\t\tconst newNode = makeEmptyNode();\n\t\t\tlet snapshot = startingSnapshot.addNodes([{ ...newNode, traits: new Map() }]);\n\t\t\texpect(snapshot.size).to.equal(4);\n\t\t\texpect(snapshot.hasNode(newNode.identifier)).to.be.true;\n\t\t\texpect(snapshot.getParentSnapshotNode(newNode.identifier)).to.be.undefined;\n\t\t\tsnapshot = insertIntoTrait(\n\t\t\t\tsnapshot,\n\t\t\t\t[newNode.identifier],\n\t\t\t\tStablePlace.atStartOf({ parent: tree.identifier, label })\n\t\t\t);\n\t\t\texpect(snapshot.getParentSnapshotNode(newNode.identifier)?.identifier).to.equal(tree.identifier);\n\t\t\texpect(snapshot.getIndexInTrait(newNode.identifier)).to.equal(0);\n\t\t\texpect(snapshot.getIndexInTrait(nodeA.identifier)).to.equal(1);\n\t\t\texpect(snapshot.getIndexInTrait(nodeB.identifier)).to.equal(2);\n\t\t});\n\t});\n});\n"]}

package/lib/test/SnapshotUtilities.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SnapshotUtilities.tests.d.ts","sourceRoot":"","sources":["../../src/test/SnapshotUtilities.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/SnapshotUtilities.tests.js

@@ -1,168 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FluidSerializer } from '@fluidframework/shared-object-base';
-import { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';
-import { expect } from 'chai';
-import { comparePayloads } from '../Common';
-describe('SnapshotUtilities', () => {
-    describe('comparePayloads', () => {
-        const serializer = new FluidSerializer(new MockFluidDataStoreRuntime().IFluidHandleContext, () => { });
-        const binder = { bind: () => void {} };
-        let Equality;
-        (function (Equality) {
-            Equality[Equality["Equal"] = 0] = "Equal";
-            Equality[Equality["Unequal"] = 1] = "Unequal";
-            Equality[Equality["Unspecified"] = 2] = "Unspecified";
-        })(Equality || (Equality = {}));
-        function checkEquality(equal, equality) {
-            if (equality !== Equality.Unspecified) {
-                expect(equal).equals(equality === Equality.Equal);
-            }
-        }
-        function check(a, b, flags) {
-            // Check reflexive
-            expect(comparePayloads(a, a)).equal(true);
-            expect(comparePayloads(b, b)).equal(true);
-            checkEquality(comparePayloads(a, b), flags.initial);
-            // Check commutative
-            checkEquality(comparePayloads(b, a), flags.initial);
-            const [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);
-            const [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);
-            checkEquality(aString === bString, flags.serialized);
-            checkEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);
-            // Check commutative
-            checkEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);
-        }
-        function checkSerialization(a, roundtrip) {
-            const aString = serializer.stringify(a, binder);
-            const a2 = serializer.parse(aString);
-            const aString2 = serializer.stringify(a2, binder);
-            expect(aString2).equal(aString);
-            checkEquality(comparePayloads(a, a2), roundtrip);
-            // Check second round trip, should always be equal
-            const a3 = serializer.parse(aString2);
-            expect(comparePayloads(a3, a2)).true;
-            return [aString, a2];
-        }
-        const allEqual = {
-            initial: Equality.Equal,
-            serialized: Equality.Equal,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Equal,
-        };
-        // For when the inputs are logically equal, but may serialize differently due to field ordering.
-        const allEqualUnstable = {
-            initial: Equality.Equal,
-            serialized: Equality.Unspecified,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Equal,
-        };
-        const allUnequal = {
-            initial: Equality.Unequal,
-            serialized: Equality.Unequal,
-            deserialized: Equality.Unequal,
-            roundtrip: Equality.Equal,
-        };
-        it('compares numbers correctly', () => {
-            check(0, 0, allEqual);
-            check(1, 1, allEqual);
-            check(0, 1, allUnequal);
-            check(-1, 1, allUnequal);
-            check(5.2, 5.200000001, allUnequal);
-        });
-        it('compares strings', () => {
-            check('', '', allEqual);
-            check(' ', '', allUnequal);
-            check('1', '+1', allUnequal);
-            // This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work
-            // Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.
-            check('𤭢', '𤭢', allEqual);
-            check('𤭢', '', allUnequal);
-            check('several characters', 'several characters', allEqual);
-            check('several characters', 'several_characters', allUnequal);
-        });
-        it('compares arrays', () => {
-            check([], [], allEqual);
-            check([1], [1], allEqual);
-            check([[1]], [[1]], allEqual);
-            check([[1]], [[2]], allUnequal);
-            check([], [1], allUnequal);
-            check([1, 2], [2, 1], allUnequal);
-        });
-        it('compares objects', () => {
-            check({ 1: 'x' }, { 1: 'x' }, allEqual);
-            check({ x: 'x' }, { y: 'x' }, allUnequal);
-            check({ x: 'x' }, { x: {} }, allUnequal);
-            check({ x: {} }, { x: {} }, allEqual);
-            check({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);
-            check({ 1: 'x' }, {}, allUnequal);
-            check({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);
-            check({ field: 'a' }, { field: 'b' }, allUnequal);
-            // Fluid Serialization arbitrarily orders fields.
-            // Thus any object with more than one field may have non-deterministic serialization.
-            // However objects have field order, and we need to check comparePayloads is not impacted by it.
-            check({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);
-        });
-        it('compares mixed types', () => {
-            check({ 0: 1 }, [1], allUnequal);
-            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)
-            check(null, 'null', allUnequal);
-            check(null, 'null', allUnequal);
-            check(1, '1', allUnequal);
-            check(null, 0, allUnequal);
-            check('', 0, allUnequal);
-        });
-        const sameAfter = {
-            initial: Equality.Unspecified,
-            serialized: Equality.Unspecified,
-            deserialized: Equality.Equal,
-            roundtrip: Equality.Unspecified,
-        };
-        const differentAfter = {
-            initial: Equality.Unequal,
-            serialized: Equality.Unequal,
-            deserialized: Equality.Unequal,
-            roundtrip: Equality.Unspecified,
-        };
-        it('lossy cases', () => {
-            // Undefined fields are omitted in json, and thus lost on the round trip.
-            check({ x: undefined }, { y: undefined }, sameAfter);
-            check({ x: undefined }, {}, sameAfter);
-            // NaN and Infinity become null
-            check(NaN, NaN, sameAfter);
-            check(NaN, 7, differentAfter);
-            check(Infinity, Infinity, sameAfter);
-            check(-Infinity, Infinity, sameAfter);
-            check(NaN, 'NaN', differentAfter);
-            // json loses -0 on round trip
-            check(-0, -0, sameAfter);
-        });
-        it('compares handles', () => {
-            function makeMockHandle(data) {
-                const handleObject = { absolutePath: data, IFluidHandle: undefined };
-                handleObject.IFluidHandle = handleObject;
-                const handle = handleObject;
-                // Handle gets modified by serializing. This is probably because handle is malformed.
-                // To avoid this being an issue, round trip it.
-                const serialized = serializer.stringify(handle, binder);
-                const finalHandle = serializer.parse(serialized);
-                return finalHandle;
-            }
-            // Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic
-            // so use allEqualUnstable not allEqual.
-            check(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);
-            check(makeMockHandle('x'), makeMockHandle('y'), allUnequal);
-            check({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);
-        });
-        // These are cases that are allowed by the type system and produce unexpected results due to Json serialization.
-        // Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.
-        it.skip('strange cases', () => {
-            // Top level undefined fails in JSON.parse.
-            // Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)
-            check(undefined, null, sameAfter);
-        });
-    });
-});
-//# sourceMappingURL=SnapshotUtilities.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"SnapshotUtilities.tests.js","sourceRoot":"","sources":["../../src/test/SnapshotUtilities.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAG5C,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,MAAM,UAAU,GAAG,IAAI,eAAe,CAAC,IAAI,yBAAyB,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAiB,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,EAAE,EAA6B,CAAC;QAEhF,IAAK,QAIJ;QAJD,WAAK,QAAQ;YACZ,yCAAK,CAAA;YACL,6CAAO,CAAA;YACP,qDAAW,CAAA;QACZ,CAAC,EAJI,QAAQ,KAAR,QAAQ,QAIZ;QAED,SAAS,aAAa,CAAC,KAAc,EAAE,QAAkB;YACxD,IAAI,QAAQ,KAAK,QAAQ,CAAC,WAAW,EAAE;gBACtC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC;aAClD;QACF,CAAC;QAED,SAAS,KAAK,CACb,CAAU,EACV,CAAU,EACV,KAA+F;YAE/F,kBAAkB;YAClB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAE1C,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACpD,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAEpD,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACxE,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAExE,aAAa,CAAC,OAAO,KAAK,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;YACjF,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QAClF,CAAC;QAED,SAAS,kBAAkB,CAAC,CAAU,EAAE,SAAmB;YAC1D,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAChC,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YAEjD,kDAAkD;YAClD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAErC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,QAAQ,GAAG;YAChB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,KAAK;YAC1B,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,gGAAgG;QAChG,MAAM,gBAAgB,GAAG;YACxB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,MAAM,UAAU,GAAG;YAClB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YAC7B,0FAA0F;YAC1F,0GAA0G;YAC1G,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5B,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,QAAQ,CAAC,CAAC;YAC5D,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC9B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAC1C,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YACzC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACtC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAClC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAClD,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAElD,iDAAiD;YACjD,qFAAqF;YACrF,gGAAgG;YAChG,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YACjC,+EAA+E;YAC/E,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG;YACjB,OAAO,EAAE,QAAQ,CAAC,WAAW;YAC7B,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QACF,MAAM,cAAc,GAAG;YACtB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QAEF,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB,yEAAyE;YACzE,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;YACrD,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YAEvC,+BAA+B;YAC/B,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;YAC9B,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACrC,KAAK,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACtC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;YAElC,8BAA8B;YAC9B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,SAAS,cAAc,CAAC,IAAY;gBACnC,MAAM,YAAY,GAAG,EAAE,YAAY,EAAE,IAAI,EAAE,YAAY,EAAE,SAAoB,EAAE,CAAC;gBAChF,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC;gBACzC,MAAM,MAAM,GAAG,YAA4B,CAAC;gBAC5C,qFAAqF;gBACrF,+CAA+C;gBAC/C,MAAM,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBACxD,MAAM,WAAW,GAAiB,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBAC/D,OAAO,WAAW,CAAC;YACpB,CAAC;YACD,qHAAqH;YACrH,wCAAwC;YACxC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAClE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,gHAAgH;QAChH,kHAAkH;QAClH,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE;YAC7B,2CAA2C;YAC3C,gFAAgF;YAChF,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnC,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 { IFluidHandle } from '@fluidframework/core-interfaces';\nimport { FluidSerializer } from '@fluidframework/shared-object-base';\nimport { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';\nimport { expect } from 'chai';\nimport { comparePayloads } from '../Common';\nimport { Payload } from '../generic';\n\ndescribe('SnapshotUtilities', () => {\n\tdescribe('comparePayloads', () => {\n\t\tconst serializer = new FluidSerializer(new MockFluidDataStoreRuntime().IFluidHandleContext, () => {});\n\t\tconst binder: IFluidHandle = { bind: () => void {} } as unknown as IFluidHandle;\n\n\t\tenum Equality {\n\t\t\tEqual,\n\t\t\tUnequal,\n\t\t\tUnspecified,\n\t\t}\n\n\t\tfunction checkEquality(equal: boolean, equality: Equality): void {\n\t\t\tif (equality !== Equality.Unspecified) {\n\t\t\t\texpect(equal).equals(equality === Equality.Equal);\n\t\t\t}\n\t\t}\n\n\t\tfunction check(\n\t\t\ta: Payload,\n\t\t\tb: Payload,\n\t\t\tflags: { initial: Equality; serialized: Equality; deserialized: Equality; roundtrip: Equality }\n\t\t): void {\n\t\t\t// Check reflexive\n\t\t\texpect(comparePayloads(a, a)).equal(true);\n\t\t\texpect(comparePayloads(b, b)).equal(true);\n\n\t\t\tcheckEquality(comparePayloads(a, b), flags.initial);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(b, a), flags.initial);\n\n\t\t\tconst [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);\n\t\t\tconst [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);\n\n\t\t\tcheckEquality(aString === bString, flags.serialized);\n\t\t\tcheckEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);\n\t\t}\n\n\t\tfunction checkSerialization(a: Payload, roundtrip: Equality): [string, Payload] {\n\t\t\tconst aString = serializer.stringify(a, binder);\n\t\t\tconst a2: Payload = serializer.parse(aString);\n\t\t\tconst aString2 = serializer.stringify(a2, binder);\n\t\t\texpect(aString2).equal(aString);\n\t\t\tcheckEquality(comparePayloads(a, a2), roundtrip);\n\n\t\t\t// Check second round trip, should always be equal\n\t\t\tconst a3: Payload = serializer.parse(aString2);\n\t\t\texpect(comparePayloads(a3, a2)).true;\n\n\t\t\treturn [aString, a2];\n\t\t}\n\n\t\tconst allEqual = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Equal,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\t// For when the inputs are logically equal, but may serialize differently due to field ordering.\n\t\tconst allEqualUnstable = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tconst allUnequal = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tit('compares numbers correctly', () => {\n\t\t\tcheck(0, 0, allEqual);\n\t\t\tcheck(1, 1, allEqual);\n\t\t\tcheck(0, 1, allUnequal);\n\t\t\tcheck(-1, 1, allUnequal);\n\t\t\tcheck(5.2, 5.200000001, allUnequal);\n\t\t});\n\n\t\tit('compares strings', () => {\n\t\t\tcheck('', '', allEqual);\n\t\t\tcheck(' ', '', allUnequal);\n\t\t\tcheck('1', '+1', allUnequal);\n\t\t\t// This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work\n\t\t\t// Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.\n\t\t\tcheck('𤭢', '𤭢', allEqual);\n\t\t\tcheck('𤭢', '', allUnequal);\n\t\t\tcheck('several characters', 'several characters', allEqual);\n\t\t\tcheck('several characters', 'several_characters', allUnequal);\n\t\t});\n\n\t\tit('compares arrays', () => {\n\t\t\tcheck([], [], allEqual);\n\t\t\tcheck([1], [1], allEqual);\n\t\t\tcheck([[1]], [[1]], allEqual);\n\t\t\tcheck([[1]], [[2]], allUnequal);\n\t\t\tcheck([], [1], allUnequal);\n\t\t\tcheck([1, 2], [2, 1], allUnequal);\n\t\t});\n\n\t\tit('compares objects', () => {\n\t\t\tcheck({ 1: 'x' }, { 1: 'x' }, allEqual);\n\t\t\tcheck({ x: 'x' }, { y: 'x' }, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: {} }, allUnequal);\n\t\t\tcheck({ x: {} }, { x: {} }, allEqual);\n\t\t\tcheck({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);\n\t\t\tcheck({ 1: 'x' }, {}, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);\n\t\t\tcheck({ field: 'a' }, { field: 'b' }, allUnequal);\n\n\t\t\t// Fluid Serialization arbitrarily orders fields.\n\t\t\t// Thus any object with more than one field may have non-deterministic serialization.\n\t\t\t// However objects have field order, and we need to check comparePayloads is not impacted by it.\n\t\t\tcheck({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);\n\t\t});\n\n\t\tit('compares mixed types', () => {\n\t\t\tcheck({ 0: 1 }, [1], allUnequal);\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(1, '1', allUnequal);\n\t\t\tcheck(null, 0, allUnequal);\n\t\t\tcheck('', 0, allUnequal);\n\t\t});\n\n\t\tconst sameAfter = {\n\t\t\tinitial: Equality.Unspecified,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\t\tconst differentAfter = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\n\t\tit('lossy cases', () => {\n\t\t\t// Undefined fields are omitted in json, and thus lost on the round trip.\n\t\t\tcheck({ x: undefined }, { y: undefined }, sameAfter);\n\t\t\tcheck({ x: undefined }, {}, sameAfter);\n\n\t\t\t// NaN and Infinity become null\n\t\t\tcheck(NaN, NaN, sameAfter);\n\t\t\tcheck(NaN, 7, differentAfter);\n\t\t\tcheck(Infinity, Infinity, sameAfter);\n\t\t\tcheck(-Infinity, Infinity, sameAfter);\n\t\t\tcheck(NaN, 'NaN', differentAfter);\n\n\t\t\t// json loses -0 on round trip\n\t\t\tcheck(-0, -0, sameAfter);\n\t\t});\n\n\t\tit('compares handles', () => {\n\t\t\tfunction makeMockHandle(data: string): IFluidHandle {\n\t\t\t\tconst handleObject = { absolutePath: data, IFluidHandle: undefined as unknown };\n\t\t\t\thandleObject.IFluidHandle = handleObject;\n\t\t\t\tconst handle = handleObject as IFluidHandle;\n\t\t\t\t// Handle gets modified by serializing. This is probably because handle is malformed.\n\t\t\t\t// To avoid this being an issue, round trip it.\n\t\t\t\tconst serialized = serializer.stringify(handle, binder);\n\t\t\t\tconst finalHandle: IFluidHandle = serializer.parse(serialized);\n\t\t\t\treturn finalHandle;\n\t\t\t}\n\t\t\t// Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic\n\t\t\t// so use allEqualUnstable not allEqual.\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('y'), allUnequal);\n\t\t\tcheck({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);\n\t\t});\n\n\t\t// These are cases that are allowed by the type system and produce unexpected results due to Json serialization.\n\t\t// Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.\n\t\tit.skip('strange cases', () => {\n\t\t\t// Top level undefined fails in JSON.parse.\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)\n\t\t\tcheck(undefined, null, sameAfter);\n\t\t});\n\t});\n});\n"]}

package/lib/test/undoRedoStackManager.d.ts

@@ -1,26 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IRevertible } from '../default-edits/UndoRedoHandler';
-/**
- * Manages the Undo and Redo stacks, and operations withing those stacks.
- * Allows adding items to the current operation on the stack, closing the current operation,
- * and issuing and undo or a redo.
- */
-export declare class UndoRedoStackManager {
-    private static revert;
-    private readonly undoStack;
-    private readonly redoStack;
-    private mode;
-    private readonly eventEmitter;
-    constructor();
-    closeCurrentOperation(): void;
-    on(event: 'changePushed', listener: () => void): void;
-    removeListener(event: 'changePushed', listener: () => void): void;
-    undoOperation(): boolean;
-    redoOperation(): boolean;
-    pushToCurrentOperation(revertible: IRevertible): void;
-    private clearRedoStack;
-}
-//# sourceMappingURL=undoRedoStackManager.d.ts.map

package/lib/test/undoRedoStackManager.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"undoRedoStackManager.d.ts","sourceRoot":"","sources":["../../src/test/undoRedoStackManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAmE/D;;;;GAIG;AACH,qBAAa,oBAAoB;IAChC,OAAO,CAAC,MAAM,CAAC,MAAM;IA+BrB,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAuB;IACjD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAuB;IACjD,OAAO,CAAC,IAAI,CAAmC;IAC/C,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAsB;;IAO5C,qBAAqB;IAMrB,EAAE,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,IAAI;IAG9C,cAAc,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,IAAI;IAI1D,aAAa,IAAI,OAAO;IAUxB,aAAa,IAAI,OAAO;IAUxB,sBAAsB,CAAC,UAAU,EAAE,WAAW;IA4BrD,OAAO,CAAC,cAAc;CAatB"}

package/lib/test/undoRedoStackManager.js

@@ -1,176 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// TODO: This is a temporary copy of the 'UndoRedoStackManager' from 'framework/undo-redo'
-//       to unblock testing of SharedMatrix undo while we decide on the correct layering
-//       for undo.
-import { EventEmitter } from 'events';
-var UndoRedoMode;
-(function (UndoRedoMode) {
-    UndoRedoMode[UndoRedoMode["None"] = 0] = "None";
-    UndoRedoMode[UndoRedoMode["Redo"] = 1] = "Redo";
-    UndoRedoMode[UndoRedoMode["Undo"] = 2] = "Undo";
-})(UndoRedoMode || (UndoRedoMode = {}));
-/**
- * Helper class for createing a stack over an array
- */
-class Stack {
-    constructor(...items) {
-        this.items = [];
-        if (items !== undefined) {
-            items.forEach((item) => this.push(item));
-        }
-    }
-    empty() {
-        return this.items.length === 0;
-    }
-    top() {
-        if (!this.empty()) {
-            return this.items[0];
-        }
-        return undefined;
-    }
-    pop() {
-        return this.items.shift();
-    }
-    push(item) {
-        this.items.unshift(item);
-        if (this.itemPushedCallback !== undefined) {
-            this.itemPushedCallback();
-        }
-    }
-}
-/**
- * Helper class for creating the Undo and Redo stacks
- */
-class UndoRedoStack extends Stack {
-    push(item) {
-        if (item !== undefined) {
-            item.itemPushedCallback = () => this.callItemPushedCallback;
-        }
-        super.push(item);
-    }
-    closeCurrentOperationIfInProgress() {
-        if (this.top() !== undefined) {
-            this.push(undefined);
-        }
-        else {
-            this.callItemPushedCallback();
-        }
-    }
-    callItemPushedCallback() {
-        if (this.itemPushedCallback !== undefined) {
-            this.itemPushedCallback();
-        }
-    }
-}
-/**
- * Manages the Undo and Redo stacks, and operations withing those stacks.
- * Allows adding items to the current operation on the stack, closing the current operation,
- * and issuing and undo or a redo.
- */
-export class UndoRedoStackManager {
-    constructor() {
-        this.undoStack = new UndoRedoStack();
-        this.redoStack = new UndoRedoStack();
-        this.mode = UndoRedoMode.None;
-        this.eventEmitter = new EventEmitter();
-        this.undoStack.itemPushedCallback = () => this.eventEmitter.emit('changePushed');
-        this.redoStack.itemPushedCallback = () => this.eventEmitter.emit('changePushed');
-    }
-    static revert(revertStack, pushStack) {
-        // Close the pushStack, as it could get  new ops
-        // from the revert, and we don't want those combined
-        // with any existing operation
-        pushStack.closeCurrentOperationIfInProgress();
-        // Search the revert stack for the first defined operation stack
-        while (!revertStack.empty() && revertStack.top() === undefined) {
-            revertStack.pop();
-        }
-        // If there is a defined operation stack, revert it
-        if (!revertStack.empty()) {
-            const operationStack = revertStack.pop();
-            if (operationStack !== undefined) {
-                while (!operationStack.empty()) {
-                    const operation = operationStack.pop();
-                    if (operation !== undefined) {
-                        operation.revert();
-                    }
-                }
-            }
-        }
-        // Make sure both stacks have any open operations
-        // closed, since we won't want anything added to those
-        //
-        revertStack.closeCurrentOperationIfInProgress();
-        pushStack.closeCurrentOperationIfInProgress();
-    }
-    closeCurrentOperation() {
-        if (this.mode === UndoRedoMode.None) {
-            this.undoStack.closeCurrentOperationIfInProgress();
-        }
-    }
-    on(event, listener) {
-        this.eventEmitter.on(event, listener);
-    }
-    removeListener(event, listener) {
-        this.eventEmitter.removeListener(event, listener);
-    }
-    undoOperation() {
-        if (this.undoStack.empty()) {
-            return false;
-        }
-        this.mode = UndoRedoMode.Undo;
-        UndoRedoStackManager.revert(this.undoStack, this.redoStack);
-        this.mode = UndoRedoMode.None;
-        return true;
-    }
-    redoOperation() {
-        if (this.redoStack.empty()) {
-            return false;
-        }
-        this.mode = UndoRedoMode.Redo;
-        UndoRedoStackManager.revert(this.redoStack, this.undoStack);
-        this.mode = UndoRedoMode.None;
-        return true;
-    }
-    pushToCurrentOperation(revertible) {
-        let currentStack;
-        switch (this.mode) {
-            case UndoRedoMode.None:
-                currentStack = this.undoStack;
-                this.clearRedoStack();
-                break;
-            case UndoRedoMode.Redo:
-                currentStack = this.undoStack;
-                break;
-            case UndoRedoMode.Undo:
-                currentStack = this.redoStack;
-                break;
-            default:
-                throw new Error('unknown mode');
-        }
-        const operationStack = currentStack.top();
-        if (operationStack === undefined) {
-            currentStack.push(new Stack(revertible));
-        }
-        else {
-            operationStack.push(revertible);
-        }
-    }
-    clearRedoStack() {
-        while (!this.redoStack.empty()) {
-            const redoOpertionStack = this.redoStack.pop();
-            if (redoOpertionStack !== undefined) {
-                while (!redoOpertionStack.empty()) {
-                    const redoOperation = redoOpertionStack.pop();
-                    if (redoOperation !== undefined) {
-                        redoOperation.discard();
-                    }
-                }
-            }
-        }
-    }
-}
-//# sourceMappingURL=undoRedoStackManager.js.map