@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/test/Anchors.glassBox.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Anchors.glassBox.tests.js","sourceRoot":"","sources":["../../src/test/Anchors.glassBox.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAG9B,OAAO,EAAE,WAAW,EAAe,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAC9E,OAAO,EACN,cAAc,EACd,WAAW,EACX,0BAA0B,EAC1B,WAAW,EAEX,oBAAoB,EACpB,uBAAuB,EACvB,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,kCAAkC,EAClC,gCAAgC,GAEhC,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAEnD,OAAO,EAAE,aAAa,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE3F,MAAM,IAAI,GAAe,aAAa,CAAC,MAAgB,CAAC,CAAC;AACzD,MAAM,YAAY,GAAe,aAAa,CAAC,OAAiB,CAAC,CAAC;AAClE,MAAM,WAAW,GAAe,aAAa,CAAC,MAAgB,CAAC,CAAC;AAChE,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;AAEF,MAAM,UAAU,GAAG,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;AAC5D,MAAM,QAAQ,GAAG,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC;AACxD,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;AAC7C,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAE3C,MAAM,WAAW,GAAG,WAAW,CAAC,SAAS,CACxC,iBAAiB,EACjB,0BAA0B,CAAC,cAAc,CAClB,CAAC;AACzB,MAAM,SAAS,GAAG,WAAW,CAAC,OAAO,CACpC,iBAAiB,EACjB,0BAA0B,CAAC,cAAc,CAClB,CAAC;AACzB,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,0BAA0B,CAAC,cAAc,CAAwB,CAAC;AAChH,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,0BAA0B,CAAC,cAAc,CAAwB,CAAC;AAE9G,MAAM,sBAAsB,GAAG,EAAwB,CAAC;AACxD,MAAM,UAAU,GAAG,cAAwB,CAAC;AAC5C,MAAM,SAAS,GAAG,YAAsC,CAAC;AACzD,MAAM,SAAS,GAAG,YAAsC,CAAC;AACzD,MAAM,eAAe,GAAG,mBAAqD,CAAC;AAC9E,MAAM,YAAY,GAAG,eAAsC,CAAC;AAC5D,MAAM,QAAQ,GAAG,WAA4D,CAAC;AAC9E,MAAM,mBAAmB,GAAG,uBAAqE,CAAC;AAElG,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,QAAQ,CAAC,oBAAoB,CAAC,IAAI,EAAE,GAAG,EAAE;QACxC,MAAM,SAAS,GAAG;YACjB;gBACC,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,cAAc,CAAC,MAAM,CAAC,sBAAsB,EAAE,YAAY,CAAC;gBAClE,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,sBAAsB,EAAE,SAAS,CAAC;aAClE;YACD;gBACC,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,sBAAsB,CAAC;gBAC7E,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,sBAAsB,CAAC;aAClE;YACD;gBACC,IAAI,EAAE,wBAAwB;gBAC9B,KAAK,EAAE,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;gBACrD,QAAQ,EAAE,cAAc,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,CAAC;aACnD;YACD;gBACC,IAAI,EAAE,0BAA0B;gBAChC,KAAK,EAAE,cAAc,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC;gBACnD,QAAQ,EAAE,cAAc,CAAC,YAAY,CAAC,UAAU,CAAC;aACjD;YACD;gBACC,IAAI,EAAE,YAAY;gBAClB,KAAK,EAAE,cAAc,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,gBAAgB,CAAC,UAAU,CAAC;gBACtF,QAAQ,EAAE,cAAc,CAAC,UAAU,CAAC,SAAS,EAAE,gBAAgB,CAAC,UAAU,CAAC;aAC3E;SACD,CAAC;QACF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;YACjC,EAAE,CAAC,kCAAkC,QAAQ,CAAC,IAAI,UAAU,EAAE,GAAG,EAAE;gBAClE,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAC9B,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE;oBAClE,YAAY,EAAE,GAAG,EAAE,CAAC,UAAU;oBAC9B,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;oBAC9B,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;iBAC9B,CAAC,CAAC;gBACH,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBAClD,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,YAAY,EAAE,EAAE,EAAE;oBAChE,YAAY,EAAE,GAAG,EAAE,CAAC,SAAS;oBAC7B,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;oBAC9B,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;iBAC9B,CAAC,CAAC;gBACH,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;SACH;QAED,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACvD,MAAM,UAAU,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,CAAC,oBAAoB,CAAC,UAA4B,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QAC7F,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,CAAC,IAAI,EAAE,GAAG,EAAE;QACrC,EAAE,CAAC,6EAA6E,EAAE,GAAG,EAAE;YACtF,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACxE,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,CAAC,iBAAiB,CAAC,UAAU,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,CAAC,IAAI,EAAE,GAAG,EAAE;QACtC,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,MAAM,CACL,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC5D,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC9B,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,KAAK;aAChD,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC/D,MAAM,CACL,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC5D,aAAa,EAAE,CAAC,KAAkB,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC1F,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,KAAK;aAChD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACpB,MAAM,CACL,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC5D,aAAa,EAAE,CAAC,KAAkB,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC3F,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,KAAK;aAChD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,MAAM,CACL,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC5D,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC9B,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,SAAS;aACpD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACpB,MAAM,CACL,kBAAkB,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC5D,aAAa,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC9B,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,OAAO;aAClD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,CAAC,IAAI,EAAE,GAAG,EAAE;QACtC,EAAE,CAAC,4EAA4E,EAAE,GAAG,EAAE;YACrF,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAChD,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC;YACzE,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACvD,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACnD,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACzD,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACvD,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACrF,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACjF,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACtE,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;YACzE,MAAM,CACL,kBAAkB,CAAC,SAAS,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC/C,mBAAmB,EAAE,GAAG,EAAE,CAAC,SAAS;gBACpC,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,OAAO;aAClD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oEAAoE,EAAE,GAAG,EAAE;YAC7E,MAAM,iCAAiC,GAAG,CAAC,KAAK,EAAE,EAAE,CACnD,kBAAkB,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE;gBAC3C,mBAAmB,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE;gBACjC,cAAc,EAAE,GAAG,EAAE,CAAC,oBAAoB,CAAC,OAAO;aAClD,CAAC,CAAC;YACJ,MAAM,CAAC,iCAAiC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACxE,MAAM,CAAC,iCAAiC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACtE,MAAM,CAAC,iCAAiC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACzE,MAAM,CAAC,iCAAiC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gFAAgF,EAAE,GAAG,EAAE;YACzF,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACrD,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,mBAAmB,GAAG,CAC3B,KAA0B,EAC1B,IAAwC,EACd,EAAE;gBAC5B,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC9B,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;YACrD,CAAC,CAAC;YACF,MAAM,cAAc,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBACvC,OAAO,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,CAAC,KAAK,CAAC;YACzF,CAAC,CAAC;YACF,MAAM,CACL,kBAAkB,CAAC,UAAU,EAAE,aAAa,EAAE,QAAQ,EAAE;gBACvD,mBAAmB;gBACnB,cAAc;aACd,CAAC,CACF,CAAC,QAAQ,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YACpC,oDAAoD;YACpD,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0EAA0E,EAAE,GAAG,EAAE;YACnF,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,MAAM,aAAa,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACrD,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,mBAAmB,GAAG,CAC3B,KAA0B,EAC1B,IAAwC,EACd,EAAE;gBAC5B,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACjC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC9B,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;YACnD,CAAC,CAAC;YACF,MAAM,cAAc,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE;gBAC1C,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBACvC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBACjC,OAAO,oBAAoB,CAAC,OAAO,CAAC;YACrC,CAAC,CAAC;YACF,MAAM,CACL,kBAAkB,CAAC,UAAU,EAAE,aAAa,EAAE,QAAQ,EAAE;gBACvD,mBAAmB;gBACnB,cAAc;aACd,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACpB,oDAAoD;YACpD,MAAM,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACtE,MAAM,UAAU,GAAG,EAAE,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,EAAE,CAAC,kBAAkB,CAAC,UAAyB,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QACxF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gCAAgC,CAAC,IAAI,EAAE,GAAG,EAAE;QACpD,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC9D,MAAM,CAAC,gCAAgC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC5E,MAAM,CAAC,gCAAgC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC3E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC9E,MAAM,CACL,gCAAgC,CAAC,WAAW,EAAE,EAAE,EAAE;gBACjD,yBAAyB,EAAE,GAAG,EAAE,CAAC,SAAS;gBAC1C,qBAAqB,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE;aACnC,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,MAAM,CACL,gCAAgC,CAAC,YAAY,EAAE,EAAE,EAAE;gBAClD,yBAAyB,EAAE,GAAG,EAAE,CAAC,mBAAmB;gBACpD,qBAAqB,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;oBACxC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;oBACnC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;oBAC3C,OAAO,SAAS,CAAC;gBAClB,CAAC;aACD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACpB,MAAM,CACL,gCAAgC,CAAC,YAAY,EAAE,EAAE,EAAE;gBAClD,yBAAyB,EAAE,GAAG,EAAE,CAAC,mBAAmB;gBACpD,qBAAqB,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;oBACxC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;oBACnC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;oBAC3C,OAAO,SAAS,CAAC;gBAClB,CAAC;aACD,CAAC,CACF,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,CAAC,IAAI,EAAE,GAAG,EAAE;QAC3C,SAAS,QAAQ,CAAC,OAAkC;YACnD,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC3B,MAAM,KAAK,GAA2C,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAC9E,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE;gBAC3B,MAAM,EAAE,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACxC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,KAAK;aACpC,CAAC,CAAC;QACJ,CAAC;QAED,SAAS,UAAU,CAAC,MAAsB;YACzC,OAAO;gBACN,cAAc,EAAE,MAAM;gBACtB,KAAK,EAAE,mBAAmB,CAAC,MAAM,CAAC;aAClC,CAAC;QACH,CAAC;QAED,SAAS,oBAAoB,CAAC,MAAsB;YACnD,OAAO,MAAM,KAAK,iBAAiB,IAAI,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,aAAa,CAAC;QACnG,CAAC;QAED,SAAS,mBAAmB,CAAC,MAAsB;YAClD,OAAO,MAAM,KAAK,eAAe,IAAI,MAAM,KAAK,aAAa,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,CAAC;QACjG,CAAC;QAED,MAAM,aAAa,GAAG,gBAAuC,CAAC;QAC9D,MAAM,eAAe,GAAG,kBAAyC,CAAC;QAClE,MAAM,oBAAoB,GAAG,wBAAqD,CAAC;QACnF,MAAM,mBAAmB,GAAG,uBAAoD,CAAC;QACjF,MAAM,eAAe,GAAG,mBAAgD,CAAC;QACzE,MAAM,iBAAiB,GAAG,qBAAkD,CAAC;QAC7E,MAAM,aAAa,GAAG,gBAA6C,CAAC;QACpE,MAAM,kBAAkB,GAAG,QAAQ,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC;QAC5D,MAAM,iBAAiB,GAAG,QAAQ,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC;QAC1D,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;QAC9C,MAAM,aAAa,GAAG,QAAQ,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC;QAClD,MAAM,eAAe,GAAG,QAAQ,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAEtD,MAAM,YAAY,GAAG,CAAC,IAAwC,EAAE,EAAE,CACjE,uBAAuB,CAAC,eAAe,EAAE,IAAI,EAAE;YAC9C,cAAc,EAAE,CAAC,QAAQ,EAAE,EAAE,CAC5B,QAAQ,KAAK,eAAe;gBAC3B,CAAC,CAAC,oBAAoB,CAAC,OAAO;gBAC9B,CAAC,CAAC,QAAQ,KAAK,aAAa;oBAC5B,CAAC,CAAC,oBAAoB,CAAC,KAAK;oBAC5B,CAAC,CAAC,IAAI,EAAE;SACV,CAAC,CAAC;QAEJ,QAAQ,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAChF,MAAM,SAAS,GAAyC;gBACvD,EAAE;gBACF,CAAC,eAAe,CAAC;gBACjB,CAAC,eAAe,EAAE,eAAe,EAAE,eAAe,CAAC;gBACnD,CAAC,QAAQ,CAAC,CAAC,iBAAiB,EAAE,iBAAiB,EAAE,iBAAiB,CAAC,CAAC,CAAC;aACrE,CAAC;YACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC1C,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE;oBACzB,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACtD,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;YACpE,MAAM,SAAS,GAAyC;gBACvD,CAAC,iBAAiB,CAAC;gBACnB,CAAC,iBAAiB,EAAE,eAAe,CAAC;gBACpC,CAAC,aAAa,EAAE,iBAAiB,CAAC;gBAClC,CAAC,aAAa,EAAE,iBAAiB,EAAE,eAAe,CAAC;gBACnD,CAAC,aAAa,EAAE,kBAAkB,EAAE,eAAe,EAAE,WAAW,EAAE,iBAAiB,CAAC;gBACpF,CAAC,aAAa,EAAE,kBAAkB,EAAE,eAAe,EAAE,WAAW,EAAE,iBAAiB,EAAE,eAAe,CAAC;gBACrG,CAAC,kBAAkB,EAAE,WAAW,EAAE,kBAAkB,EAAE,WAAW,EAAE,iBAAiB,CAAC;gBACrF,CAAC,QAAQ,CAAC,CAAC,eAAe,EAAE,mBAAmB,CAAC,CAAC,CAAC;gBAClD,CAAC,QAAQ,CAAC,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,CAAC,CAAC;gBACpD,CAAC,QAAQ,CAAC,CAAC,eAAe,EAAE,mBAAmB,EAAE,iBAAiB,CAAC,CAAC,CAAC;gBACrE,CAAC,QAAQ,CAAC,CAAC,eAAe,EAAE,oBAAoB,EAAE,aAAa,EAAE,mBAAmB,CAAC,CAAC,CAAC;gBACvF;oBACC,QAAQ,CAAC;wBACR,oBAAoB;wBACpB,aAAa;wBACb,oBAAoB;wBACpB,aAAa;wBACb,mBAAmB;qBACnB,CAAC;iBACF;gBACD,CAAC,eAAe,EAAE,QAAQ,CAAC,CAAC,aAAa,EAAE,mBAAmB,CAAC,CAAC,CAAC;aACjE,CAAC;YACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC1C,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE;oBACzB,MAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;wBAC1B,MAAM,EAAE,aAAa;wBACrB,KAAK,EAAE,eAAe;wBACtB,MAAM,EAAE,mBAAmB;qBAC3B,CAAC,CAAC;gBACJ,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE;QACtD,MAAM,UAAU,GAAG,WAAW,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnD,MAAM,YAAY,GAAG;YACpB;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;gBACnD,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC;aAC1B;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC;gBACpD,KAAK,EAAE,CAAC,IAAI,CAAC;aACb;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;gBAClD,KAAK,EAAE,CAAC,IAAI,CAAC;aACb;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;gBACpD,KAAK,EAAE,CAAC,IAAI,EAAE,WAAW,CAAC;aAC1B;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC;gBACrD,KAAK,EAAE,CAAC,IAAI,CAAC;aACb;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;gBACnD,KAAK,EAAE,CAAC,IAAI,CAAC;aACb;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC;gBAClD,KAAK,EAAE,CAAC,YAAY,EAAE,IAAI,EAAE,WAAW,CAAC;aACxC;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC;gBACnD,KAAK,EAAE,CAAC,YAAY,EAAE,IAAI,CAAC;aAC3B;YACD;gBACC,KAAK,EAAE,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;gBACjD,KAAK,EAAE,CAAC,YAAY,EAAE,IAAI,CAAC;aAC3B;SACD,CAAC;QAEF,SAAS,YAAY,CAAC,SAAiB,EAAE,MAA2B;YACnE,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,iCAC5B,MAAM,KACT,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,IAC1D,CAAC;YACH,MAAM,aAAa,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC;YAC1F,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,iCAC3B,MAAM,KACT,MAAM,EAAE,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,cAAc,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,IACtE,CAAC;YACH,MAAM,eAAe,GAAoC;gBACxD,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC;gBAC5D,MAAM;gBACN,KAAK;aACL,CAAC;YACF,OAAO,kCAAkC,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QACpE,CAAC;QAED,QAAQ,CAAC,sDAAsD,EAAE,GAAG,EAAE;YACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC7C,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE;oBACzB,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,CAAC;oBAC3F,MAAM,cAAc,GACnB,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,WAAW;wBACtE,CAAC,CAAC,UAAU;wBACZ,CAAC,CAAC,SAAS,CAAC;oBACd,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;oBAChE,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;gBACnE,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,qDAAqD,EAAE,GAAG,EAAE;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC7C,EAAE,CAAC,aAAa,CAAC,EAAE,EAAE,GAAG,EAAE;oBACzB,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;oBACvD,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;gBACtD,CAAC,CAAC,CAAC;aACH;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACxE,MAAM,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,iCAC3B,WAAW,KACd,MAAM,EAAE,EAAE,IACT,CAAC;YACH,MAAM,eAAe,GAAoC;gBACxD,MAAM,EAAE,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvD,MAAM;gBACN,KAAK;aACL,CAAC;YACF,MAAM,CAAC,kCAAkC,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3F,MAAM,CAAC,kCAAkC,CAAC,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACzF,MAAM,CAAC,kCAAkC,CAAC,WAAW,EAAE,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAC3F,MAAM,CAAC,kCAAkC,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7F,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 { DetachedSequenceId, NodeId } from '../Identifiers';\nimport { ChangeNode } from '../generic';\nimport { StablePlace, StableRange, ConstraintEffect } from '../default-edits';\nimport {\n\tAnchoredChange,\n\tPlaceAnchor,\n\tPlaceAnchorSemanticsChoice,\n\tRangeAnchor,\n\tRelativePlaceAnchor,\n\tresolveChangeAnchors,\n\tfindLastOffendingChange,\n\tresolveNodeAnchor,\n\tresolvePlaceAnchor,\n\tresolveRangeAnchor,\n\tupdateRelativePlaceAnchorForChange,\n\tupdateRelativePlaceAnchorForPath,\n\tEvaluatedChange,\n} from '../anchored-edits';\nimport { assert, fail } from '../Common';\nimport { Side, Snapshot } from '../Snapshot';\nimport { EditValidationResult } from '../Checkout';\nimport { ReconciliationChange, ReconciliationEdit, ReconciliationPath } from '../ReconciliationPath';\nimport { makeEmptyNode, leftTraitLabel, rightTraitLabel } from './utilities/TestUtilities';\n\nconst left: ChangeNode = makeEmptyNode('left' as NodeId);\nconst priorSibling: ChangeNode = makeEmptyNode('prior' as NodeId);\nconst nextSibling: ChangeNode = makeEmptyNode('next' 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};\n\nconst startPlace = StablePlace.atStartOf(leftTraitLocation);\nconst endPlace = StablePlace.atEndOf(leftTraitLocation);\nconst beforePlace = StablePlace.before(left);\nconst afterPlace = StablePlace.after(left);\n\nconst startAnchor = PlaceAnchor.atStartOf(\n\tleftTraitLocation,\n\tPlaceAnchorSemanticsChoice.RelativeToNode\n) as RelativePlaceAnchor;\nconst endAnchor = PlaceAnchor.atEndOf(\n\tleftTraitLocation,\n\tPlaceAnchorSemanticsChoice.RelativeToNode\n) as RelativePlaceAnchor;\nconst beforeAnchor = PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.RelativeToNode) as RelativePlaceAnchor;\nconst afterAnchor = PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.RelativeToNode) as RelativePlaceAnchor;\n\nconst mockDetachedSequenceId = 42 as DetachedSequenceId;\nconst mockNodeId = 'mock-node-id' as NodeId;\nconst mockPlace = 'mock-place' as unknown as StablePlace;\nconst mockRange = 'mock-range' as unknown as StableRange;\nconst mockPlaceAnchor = 'mock-place-anchor' as unknown as RelativePlaceAnchor;\nconst mockSnapshot = 'mock-snapshot' as unknown as Snapshot;\nconst mockPath = 'mock-path' as unknown as ReconciliationPath<AnchoredChange>;\nconst mockEvaluatedChange = 'mock-evaluated-change' as unknown as EvaluatedChange<AnchoredChange>;\n\ndescribe('Anchor Glass Box Tests', () => {\n\tdescribe(resolveChangeAnchors.name, () => {\n\t\tconst testCases = [\n\t\t\t{\n\t\t\t\tname: 'Insert',\n\t\t\t\tinput: AnchoredChange.insert(mockDetachedSequenceId, beforeAnchor),\n\t\t\t\texpected: AnchoredChange.insert(mockDetachedSequenceId, mockPlace),\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: 'Detach',\n\t\t\t\tinput: AnchoredChange.detach(RangeAnchor.only(right), mockDetachedSequenceId),\n\t\t\t\texpected: AnchoredChange.detach(mockRange, mockDetachedSequenceId),\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: 'SetValue (set payload)',\n\t\t\t\tinput: AnchoredChange.setPayload(left.identifier, 42),\n\t\t\t\texpected: AnchoredChange.setPayload(mockNodeId, 42),\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: 'SetValue (clear payload)',\n\t\t\t\tinput: AnchoredChange.clearPayload(left.identifier),\n\t\t\t\texpected: AnchoredChange.clearPayload(mockNodeId),\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: 'Constraint',\n\t\t\t\tinput: AnchoredChange.constraint(RangeAnchor.only(right), ConstraintEffect.ValidRetry),\n\t\t\t\texpected: AnchoredChange.constraint(mockRange, ConstraintEffect.ValidRetry),\n\t\t\t},\n\t\t];\n\t\tfor (const testCase of testCases) {\n\t\t\tit(`attempts to resolve anchors in ${testCase.name} changes`, () => {\n\t\t\t\tconst change = testCase.input;\n\t\t\t\tconst actualHappy = resolveChangeAnchors(change, mockSnapshot, [], {\n\t\t\t\t\tnodeResolver: () => mockNodeId,\n\t\t\t\t\tplaceResolver: () => mockPlace,\n\t\t\t\t\trangeResolver: () => mockRange,\n\t\t\t\t});\n\t\t\t\texpect(actualHappy).deep.equal(testCase.expected);\n\t\t\t\tconst actualSad = resolveChangeAnchors(change, mockSnapshot, [], {\n\t\t\t\t\tnodeResolver: () => undefined,\n\t\t\t\t\tplaceResolver: () => undefined,\n\t\t\t\t\trangeResolver: () => undefined,\n\t\t\t\t});\n\t\t\t\texpect(actualSad).equal(undefined);\n\t\t\t});\n\t\t}\n\n\t\tit('throws when given an unsupported change type', () => {\n\t\t\tconst fakeChange = { type: -42 };\n\t\t\texpect(() => resolveChangeAnchors(fakeChange as AnchoredChange, mockSnapshot, [])).throws();\n\t\t});\n\t});\n\n\tdescribe(resolveNodeAnchor.name, () => {\n\t\tit('returns the given NodeAnchor as a NodeId if the node exists in the snapshot', () => {\n\t\t\tconst snapshot = Snapshot.fromTree(left);\n\t\t\texpect(resolveNodeAnchor(left.identifier, snapshot, [])).equals(left.identifier);\n\t\t});\n\n\t\tit('returns undefined if the node does not exists in the snapshot', () => {\n\t\t\tconst snapshot = Snapshot.fromTree(left);\n\t\t\texpect(resolveNodeAnchor(mockNodeId, snapshot, [])).equals(undefined);\n\t\t});\n\t});\n\n\tdescribe(resolveRangeAnchor.name, () => {\n\t\tit('returns a range with resolved places when possible', () => {\n\t\t\texpect(\n\t\t\t\tresolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {\n\t\t\t\t\tplaceResolver: () => mockPlace,\n\t\t\t\t\trangeValidator: () => EditValidationResult.Valid,\n\t\t\t\t})\n\t\t\t).deep.equals(RangeAnchor.from(mockPlace).to(mockPlace));\n\t\t});\n\n\t\tit('returns undefined if either place cannot be resolved', () => {\n\t\t\texpect(\n\t\t\t\tresolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {\n\t\t\t\t\tplaceResolver: (place: PlaceAnchor) => (place.side === Side.After ? mockPlace : undefined),\n\t\t\t\t\trangeValidator: () => EditValidationResult.Valid,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t\texpect(\n\t\t\t\tresolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {\n\t\t\t\t\tplaceResolver: (place: PlaceAnchor) => (place.side === Side.Before ? undefined : mockPlace),\n\t\t\t\t\trangeValidator: () => EditValidationResult.Valid,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t});\n\n\t\tit('returns undefined the resolved places do not make a valid range', () => {\n\t\t\texpect(\n\t\t\t\tresolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {\n\t\t\t\t\tplaceResolver: () => mockPlace,\n\t\t\t\t\trangeValidator: () => EditValidationResult.Malformed,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t\texpect(\n\t\t\t\tresolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {\n\t\t\t\t\tplaceResolver: () => mockPlace,\n\t\t\t\t\trangeValidator: () => EditValidationResult.Invalid,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t});\n\t});\n\n\tdescribe(resolvePlaceAnchor.name, () => {\n\t\tit('returns the given anchor when that anchor is valid in the current snapshot', () => {\n\t\t\tconst snapshot = Snapshot.fromTree(initialTree);\n\t\t\tconst testWithPlace = (place) => resolvePlaceAnchor(place, snapshot, []);\n\t\t\texpect(testWithPlace(startPlace)).contains(startPlace);\n\t\t\texpect(testWithPlace(endPlace)).contains(endPlace);\n\t\t\texpect(testWithPlace(beforePlace)).contains(beforePlace);\n\t\t\texpect(testWithPlace(afterPlace)).contains(afterPlace);\n\t\t\texpect(testWithPlace(PlaceAnchor.atStartOf(leftTraitLocation))).contains(startPlace);\n\t\t\texpect(testWithPlace(PlaceAnchor.atEndOf(leftTraitLocation))).contains(endPlace);\n\t\t\texpect(testWithPlace(PlaceAnchor.before(left))).contains(beforePlace);\n\t\t\texpect(testWithPlace(PlaceAnchor.after(left))).contains(afterPlace);\n\t\t});\n\n\t\tit('returns undefined when the anchor is invalid and not updatable', () => {\n\t\t\texpect(\n\t\t\t\tresolvePlaceAnchor(mockPlace, mockSnapshot, [], {\n\t\t\t\t\tplaceUpdatorForPath: () => undefined,\n\t\t\t\t\tplaceValidator: () => EditValidationResult.Invalid,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t});\n\n\t\tit('returns undefined when the anchor is invalid and bound to the node', () => {\n\t\t\tconst resolvePlaceAnchorForInvalidPlace = (place) =>\n\t\t\t\tresolvePlaceAnchor(place, mockSnapshot, [], {\n\t\t\t\t\tplaceUpdatorForPath: () => fail(),\n\t\t\t\t\tplaceValidator: () => EditValidationResult.Invalid,\n\t\t\t\t});\n\t\t\texpect(resolvePlaceAnchorForInvalidPlace(startPlace)).equals(undefined);\n\t\t\texpect(resolvePlaceAnchorForInvalidPlace(endPlace)).equals(undefined);\n\t\t\texpect(resolvePlaceAnchorForInvalidPlace(beforePlace)).equals(undefined);\n\t\t\texpect(resolvePlaceAnchorForInvalidPlace(afterPlace)).equals(undefined);\n\t\t});\n\n\t\tit('returns an updated anchor when the anchor is invalid but updatable to be valid', () => {\n\t\t\tlet updateCountdown = 5;\n\t\t\tconst inputSnapshot = Snapshot.fromTree(initialTree);\n\t\t\tconst inputPlace = PlaceAnchor.after(mockNodeId);\n\t\t\tconst placeUpdatorForPath = (\n\t\t\t\tplace: RelativePlaceAnchor,\n\t\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t\t): PlaceAnchor | undefined => {\n\t\t\t\texpect(place).equals(inputPlace);\n\t\t\t\texpect(path).equals(mockPath);\n\t\t\t\treturn --updateCountdown ? inputPlace : afterAnchor;\n\t\t\t};\n\t\t\tconst placeValidator = (snapshot, place) => {\n\t\t\t\texpect(snapshot).equals(inputSnapshot);\n\t\t\t\treturn place === inputPlace ? EditValidationResult.Invalid : EditValidationResult.Valid;\n\t\t\t};\n\t\t\texpect(\n\t\t\t\tresolvePlaceAnchor(inputPlace, inputSnapshot, mockPath, {\n\t\t\t\t\tplaceUpdatorForPath,\n\t\t\t\t\tplaceValidator,\n\t\t\t\t})\n\t\t\t).contains(PlaceAnchor.after(left));\n\t\t\t// Check that it took the expected number of updates\n\t\t\texpect(updateCountdown).equals(0);\n\t\t});\n\n\t\tit('returns undefined when the anchor is invalid and updatable to be invalid', () => {\n\t\t\tlet updateCountdown = 5;\n\t\t\tconst inputSnapshot = Snapshot.fromTree(initialTree);\n\t\t\tconst inputPlace = PlaceAnchor.after(mockNodeId);\n\t\t\tconst placeUpdatorForPath = (\n\t\t\t\tplace: RelativePlaceAnchor,\n\t\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t\t): PlaceAnchor | undefined => {\n\t\t\t\texpect(place).equals(inputPlace);\n\t\t\t\texpect(path).equals(mockPath);\n\t\t\t\treturn --updateCountdown ? inputPlace : undefined;\n\t\t\t};\n\t\t\tconst placeValidator = (snapshot, place) => {\n\t\t\t\texpect(snapshot).equals(inputSnapshot);\n\t\t\t\texpect(place).equals(inputPlace);\n\t\t\t\treturn EditValidationResult.Invalid;\n\t\t\t};\n\t\t\texpect(\n\t\t\t\tresolvePlaceAnchor(inputPlace, inputSnapshot, mockPath, {\n\t\t\t\t\tplaceUpdatorForPath,\n\t\t\t\t\tplaceValidator,\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t\t// Check that it took the expected number of updates\n\t\t\texpect(updateCountdown).equals(0);\n\t\t});\n\n\t\tit('throws when given an unsupported choice of anchor semantics', () => {\n\t\t\tconst fakeAnchor = { semantics: -42 };\n\t\t\texpect(() => resolvePlaceAnchor(fakeAnchor as PlaceAnchor, mockSnapshot, [])).throws();\n\t\t});\n\t});\n\n\tdescribe(updateRelativePlaceAnchorForPath.name, () => {\n\t\tit('does not update anchors for start and end of traits', () => {\n\t\t\texpect(updateRelativePlaceAnchorForPath(startAnchor, [])).equals(undefined);\n\t\t\texpect(updateRelativePlaceAnchorForPath(endAnchor, [])).equals(undefined);\n\t\t});\n\n\t\tit('does not update anchors when the last offending change is not found', () => {\n\t\t\texpect(\n\t\t\t\tupdateRelativePlaceAnchorForPath(startAnchor, [], {\n\t\t\t\t\tlastOffendingChangeFinder: () => undefined,\n\t\t\t\t\tplaceUpdatorForChange: () => fail(),\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t});\n\n\t\tit('tries to update anchors when the last offending change is found', () => {\n\t\t\texpect(\n\t\t\t\tupdateRelativePlaceAnchorForPath(beforeAnchor, [], {\n\t\t\t\t\tlastOffendingChangeFinder: () => mockEvaluatedChange,\n\t\t\t\t\tplaceUpdatorForChange: (place, change) => {\n\t\t\t\t\t\texpect(place).equals(beforeAnchor);\n\t\t\t\t\t\texpect(change).equals(mockEvaluatedChange);\n\t\t\t\t\t\treturn mockPlace;\n\t\t\t\t\t},\n\t\t\t\t})\n\t\t\t).equals(mockPlace);\n\t\t\texpect(\n\t\t\t\tupdateRelativePlaceAnchorForPath(beforeAnchor, [], {\n\t\t\t\t\tlastOffendingChangeFinder: () => mockEvaluatedChange,\n\t\t\t\t\tplaceUpdatorForChange: (place, change) => {\n\t\t\t\t\t\texpect(place).equals(beforeAnchor);\n\t\t\t\t\t\texpect(change).equals(mockEvaluatedChange);\n\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t},\n\t\t\t\t})\n\t\t\t).equals(undefined);\n\t\t});\n\t});\n\n\tdescribe(findLastOffendingChange.name, () => {\n\t\tfunction makeEdit(changes: readonly AnchoredChange[]): ReconciliationEdit<AnchoredChange> {\n\t\t\tassert(changes.length > 0);\n\t\t\tconst steps: ReconciliationChange<AnchoredChange>[] = changes.map(makeChange);\n\t\t\treturn Object.assign(steps, {\n\t\t\t\tbefore: snapshotBeforeChange(changes[0]),\n\t\t\t\tafter: steps[steps.length - 1].after,\n\t\t\t});\n\t\t}\n\n\t\tfunction makeChange(change: AnchoredChange): ReconciliationChange<AnchoredChange> {\n\t\t\treturn {\n\t\t\t\tresolvedChange: change,\n\t\t\t\tafter: snapshotAfterChange(change),\n\t\t\t};\n\t\t}\n\n\t\tfunction snapshotBeforeChange(change: AnchoredChange): Snapshot {\n\t\t\treturn change === stayInvalidChange || change === mendingChange ? invalidSnapshot : validSnapshot;\n\t\t}\n\n\t\tfunction snapshotAfterChange(change: AnchoredChange): Snapshot {\n\t\t\treturn change === stayValidChange || change === mendingChange ? validSnapshot : invalidSnapshot;\n\t\t}\n\n\t\tconst validSnapshot = 'valid-snapshot' as unknown as Snapshot;\n\t\tconst invalidSnapshot = 'invalid-snapshot' as unknown as Snapshot;\n\t\tconst priorOffendingChange = 'prior-offending-change' as unknown as AnchoredChange;\n\t\tconst lastOffendingChange = 'last-offending-change' as unknown as AnchoredChange;\n\t\tconst stayValidChange = 'stay-valid-change' as unknown as AnchoredChange;\n\t\tconst stayInvalidChange = 'stay-invalid-change' as unknown as AnchoredChange;\n\t\tconst mendingChange = 'mending-change' as unknown as AnchoredChange;\n\t\tconst priorOffendingEdit = makeEdit([priorOffendingChange]);\n\t\tconst lastOffendingEdit = makeEdit([lastOffendingChange]);\n\t\tconst mendingEdit = makeEdit([mendingChange]);\n\t\tconst stayValidEdit = makeEdit([stayValidChange]);\n\t\tconst stayInvalidEdit = makeEdit([stayInvalidChange]);\n\n\t\tconst testWithPath = (path: ReconciliationPath<AnchoredChange>) =>\n\t\t\tfindLastOffendingChange(mockPlaceAnchor, path, {\n\t\t\t\tplaceValidator: (snapshot) =>\n\t\t\t\t\tsnapshot === invalidSnapshot\n\t\t\t\t\t\t? EditValidationResult.Invalid\n\t\t\t\t\t\t: snapshot === validSnapshot\n\t\t\t\t\t\t? EditValidationResult.Valid\n\t\t\t\t\t\t: fail(),\n\t\t\t});\n\n\t\tdescribe('returns undefined when the place is invalid throughout the path', () => {\n\t\t\tconst testCases: ReconciliationPath<AnchoredChange>[] = [\n\t\t\t\t[],\n\t\t\t\t[stayInvalidEdit],\n\t\t\t\t[stayInvalidEdit, stayInvalidEdit, stayInvalidEdit],\n\t\t\t\t[makeEdit([stayInvalidChange, stayInvalidChange, stayInvalidChange])],\n\t\t\t];\n\t\t\tfor (let i = 0; i < testCases.length; ++i) {\n\t\t\t\tit(`Test Case ${i}`, () => {\n\t\t\t\t\texpect(testWithPath(testCases[i])).equals(undefined);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe('returns the last offending change when there is one', () => {\n\t\t\tconst testCases: ReconciliationPath<AnchoredChange>[] = [\n\t\t\t\t[lastOffendingEdit],\n\t\t\t\t[lastOffendingEdit, stayInvalidEdit],\n\t\t\t\t[stayValidEdit, lastOffendingEdit],\n\t\t\t\t[stayValidEdit, lastOffendingEdit, stayInvalidEdit],\n\t\t\t\t[stayValidEdit, priorOffendingEdit, stayInvalidEdit, mendingEdit, lastOffendingEdit],\n\t\t\t\t[stayValidEdit, priorOffendingEdit, stayInvalidEdit, mendingEdit, lastOffendingEdit, stayInvalidEdit],\n\t\t\t\t[priorOffendingEdit, mendingEdit, priorOffendingEdit, mendingEdit, lastOffendingEdit],\n\t\t\t\t[makeEdit([stayValidChange, lastOffendingChange])],\n\t\t\t\t[makeEdit([lastOffendingChange, stayInvalidChange])],\n\t\t\t\t[makeEdit([stayValidChange, lastOffendingChange, stayInvalidChange])],\n\t\t\t\t[makeEdit([stayValidChange, priorOffendingChange, mendingChange, lastOffendingChange])],\n\t\t\t\t[\n\t\t\t\t\tmakeEdit([\n\t\t\t\t\t\tpriorOffendingChange,\n\t\t\t\t\t\tmendingChange,\n\t\t\t\t\t\tpriorOffendingChange,\n\t\t\t\t\t\tmendingChange,\n\t\t\t\t\t\tlastOffendingChange,\n\t\t\t\t\t]),\n\t\t\t\t],\n\t\t\t\t[stayInvalidEdit, makeEdit([mendingChange, lastOffendingChange])],\n\t\t\t];\n\t\t\tfor (let i = 0; i < testCases.length; ++i) {\n\t\t\t\tit(`Test Case ${i}`, () => {\n\t\t\t\t\tconst actual = testWithPath(testCases[i]);\n\t\t\t\t\texpect(actual).deep.equals({\n\t\t\t\t\t\tbefore: validSnapshot,\n\t\t\t\t\t\tafter: invalidSnapshot,\n\t\t\t\t\t\tchange: lastOffendingChange,\n\t\t\t\t\t});\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(updateRelativePlaceAnchorForChange.name, () => {\n\t\tconst afterPrior = PlaceAnchor.after(priorSibling);\n\t\tconst beforeNext = PlaceAnchor.before(nextSibling);\n\t\tconst rangesInSitu = [\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(startAnchor).to(beforeNext),\n\t\t\t\ttrait: [left, nextSibling],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(startAnchor).to(afterAnchor),\n\t\t\t\ttrait: [left],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(startAnchor).to(endAnchor),\n\t\t\t\ttrait: [left],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(beforeAnchor).to(beforeNext),\n\t\t\t\ttrait: [left, nextSibling],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(beforeAnchor).to(afterAnchor),\n\t\t\t\ttrait: [left],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(beforeAnchor).to(endAnchor),\n\t\t\t\ttrait: [left],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(afterPrior).to(beforeNext),\n\t\t\t\ttrait: [priorSibling, left, nextSibling],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(afterPrior).to(afterAnchor),\n\t\t\t\ttrait: [priorSibling, left],\n\t\t\t},\n\t\t\t{\n\t\t\t\trange: RangeAnchor.from(afterPrior).to(endAnchor),\n\t\t\t\ttrait: [priorSibling, left],\n\t\t\t},\n\t\t];\n\n\t\tfunction evaluateCase(caseIndex: number, anchor: RelativePlaceAnchor): PlaceAnchor | undefined {\n\t\t\tconst before = Snapshot.fromTree({\n\t\t\t\t...parent,\n\t\t\t\ttraits: { [leftTraitLabel]: rangesInSitu[caseIndex].trait },\n\t\t\t});\n\t\t\tconst filteredTrait = rangesInSitu[caseIndex].trait.filter((sibling) => sibling !== left);\n\t\t\tconst after = Snapshot.fromTree({\n\t\t\t\t...parent,\n\t\t\t\ttraits: filteredTrait.length ? { [leftTraitLabel]: filteredTrait } : {},\n\t\t\t});\n\t\t\tconst evaluatedChange: EvaluatedChange<AnchoredChange> = {\n\t\t\t\tchange: AnchoredChange.detach(rangesInSitu[caseIndex].range),\n\t\t\t\tbefore,\n\t\t\t\tafter,\n\t\t\t};\n\t\t\treturn updateRelativePlaceAnchorForChange(anchor, evaluatedChange);\n\t\t}\n\n\t\tdescribe('can update before(X) and after(X) when X is detached', () => {\n\t\t\tfor (let i = 0; i < rangesInSitu.length; ++i) {\n\t\t\t\tit(`Test Case ${i}`, () => {\n\t\t\t\t\tconst expectedAfter = rangesInSitu[i].trait[0] === priorSibling ? afterPrior : startAnchor;\n\t\t\t\t\tconst expectedBefore =\n\t\t\t\t\t\trangesInSitu[i].trait[rangesInSitu[i].trait.length - 1] === nextSibling\n\t\t\t\t\t\t\t? beforeNext\n\t\t\t\t\t\t\t: endAnchor;\n\t\t\t\t\texpect(evaluateCase(i, afterAnchor)).deep.equals(expectedAfter);\n\t\t\t\t\texpect(evaluateCase(i, beforeAnchor)).deep.equals(expectedBefore);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tdescribe('does not update anchors for start and end of traits', () => {\n\t\t\tfor (let i = 0; i < rangesInSitu.length; ++i) {\n\t\t\t\tit(`Test Case ${i}`, () => {\n\t\t\t\t\texpect(evaluateCase(i, startAnchor)).equals(undefined);\n\t\t\t\t\texpect(evaluateCase(i, endAnchor)).equals(undefined);\n\t\t\t\t});\n\t\t\t}\n\t\t});\n\n\t\tit('does not update anchors when the containing parent is deleted', () => {\n\t\t\tconst before = Snapshot.fromTree(initialTree);\n\t\t\tconst after = Snapshot.fromTree({\n\t\t\t\t...initialTree,\n\t\t\t\ttraits: {},\n\t\t\t});\n\t\t\tconst evaluatedChange: EvaluatedChange<AnchoredChange> = {\n\t\t\t\tchange: AnchoredChange.detach(RangeAnchor.only(parent)),\n\t\t\t\tbefore,\n\t\t\t\tafter,\n\t\t\t};\n\t\t\texpect(updateRelativePlaceAnchorForChange(startAnchor, evaluatedChange)).equals(undefined);\n\t\t\texpect(updateRelativePlaceAnchorForChange(endAnchor, evaluatedChange)).equals(undefined);\n\t\t\texpect(updateRelativePlaceAnchorForChange(afterAnchor, evaluatedChange)).equals(undefined);\n\t\t\texpect(updateRelativePlaceAnchorForChange(beforeAnchor, evaluatedChange)).equals(undefined);\n\t\t});\n\t});\n});\n"]}

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

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

package/lib/test/BasicCheckout.tests.js

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { BasicCheckout } from '../BasicCheckout';
-import { checkoutTests } from './Checkout.tests';
-checkoutTests('BasicCheckout', async (tree) => Promise.resolve(new BasicCheckout(tree)));
-//# sourceMappingURL=BasicCheckout.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"BasicCheckout.tests.js","sourceRoot":"","sources":["../../src/test/BasicCheckout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,aAAa,CAAC,eAAe,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { BasicCheckout } from '../BasicCheckout';\nimport { checkoutTests } from './Checkout.tests';\n\ncheckoutTests('BasicCheckout', async (tree) => Promise.resolve(new BasicCheckout(tree)));\n"]}

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

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

package/lib/test/GenericTransactionWithAnchors.tests.js

@@ -1,25 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { EditStatus } from '../generic';
-import { AnchoredChange, PlaceAnchorSemanticsChoice, RangeAnchor, TransactionWithAnchors } from '../anchored-edits';
-import { simpleTreeSnapshotWithValidation, left, right } from './utilities/TestUtilities';
-describe('TransactionWithAnchors', () => {
-    it('does not read the reconciliation path when change resolution does not require it', () => {
-        const trappedPath = new Proxy([], {
-            get: (target, prop) => {
-                expect('the path was read').equals('the path should not be read');
-                return target[prop];
-            },
-        });
-        const transaction = new TransactionWithAnchors(simpleTreeSnapshotWithValidation);
-        transaction.applyChanges([
-            AnchoredChange.detach(RangeAnchor.only(left, PlaceAnchorSemanticsChoice.BoundToNode)),
-            AnchoredChange.detach(RangeAnchor.only(right, PlaceAnchorSemanticsChoice.BoundToNode)),
-        ], trappedPath);
-        expect(transaction.status).equals(EditStatus.Applied);
-    });
-});
-//# sourceMappingURL=GenericTransactionWithAnchors.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"GenericTransactionWithAnchors.tests.js","sourceRoot":"","sources":["../../src/test/GenericTransactionWithAnchors.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,cAAc,EAAE,0BAA0B,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,mBAAmB,CAAC;AACpH,OAAO,EAAE,gCAAgC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,2BAA2B,CAAC;AAE1F,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACvC,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC3F,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,EAA0C,EAAE;YACzE,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,EAAW,EAAE;gBAC9B,MAAM,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC;gBAClE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;SACD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,IAAI,sBAAsB,CAAC,gCAAgC,CAAC,CAAC;QACjF,WAAW,CAAC,YAAY,CACvB;YACC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC;YACrF,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC;SACtF,EACD,WAAW,CACX,CAAC;QACF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,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 } from '../generic';\nimport { ReconciliationEdit } from '../ReconciliationPath';\nimport { AnchoredChange, PlaceAnchorSemanticsChoice, RangeAnchor, TransactionWithAnchors } from '../anchored-edits';\nimport { simpleTreeSnapshotWithValidation, left, right } from './utilities/TestUtilities';\n\ndescribe('TransactionWithAnchors', () => {\n\tit('does not read the reconciliation path when change resolution does not require it', () => {\n\t\tconst trappedPath = new Proxy([] as ReconciliationEdit<AnchoredChange>[], {\n\t\t\tget: (target, prop): unknown => {\n\t\t\t\texpect('the path was read').equals('the path should not be read');\n\t\t\t\treturn target[prop];\n\t\t\t},\n\t\t});\n\t\tconst transaction = new TransactionWithAnchors(simpleTreeSnapshotWithValidation);\n\t\ttransaction.applyChanges(\n\t\t\t[\n\t\t\t\tAnchoredChange.detach(RangeAnchor.only(left, PlaceAnchorSemanticsChoice.BoundToNode)),\n\t\t\t\tAnchoredChange.detach(RangeAnchor.only(right, PlaceAnchorSemanticsChoice.BoundToNode)),\n\t\t\t],\n\t\t\ttrappedPath\n\t\t);\n\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t});\n});\n"]}

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

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

package/lib/test/SharedTreeWithAnchors.tests.js

@@ -1,420 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { StablePlace, StableRange, ConstraintEffect, revert } from '../default-edits';
-import { AnchoredChange, AnchoredDelete, AnchoredInsert, AnchoredMove, PlaceAnchor, PlaceAnchorSemanticsChoice, RangeAnchor, } from '../anchored-edits';
-import { fail } from '../Common';
-import { makeEmptyNode, setUpTestSharedTreeWithAnchors, leftTraitLabel, rightTraitLabel, setUpLocalServerTestSharedTreeWithAnchors, } from './utilities/TestUtilities';
-import { runSharedTreeOperationsTests } from './utilities/SharedTreeTests';
-import { runSummaryTests } from './utilities/SummaryFormatCompatibilityTests';
-const left = makeEmptyNode('left');
-const right = makeEmptyNode('right');
-const parent = Object.assign(Object.assign({}, makeEmptyNode('parent')), { traits: { [leftTraitLabel]: [left], [rightTraitLabel]: [right] } });
-const initialTree = Object.assign(Object.assign({}, makeEmptyNode('root')), { traits: {
-        parentTraitLabel: [parent],
-    } });
-const leftTraitLocation = {
-    parent: parent.identifier,
-    label: leftTraitLabel,
-};
-const rightTraitLocation = {
-    parent: parent.identifier,
-    label: rightTraitLabel,
-};
-/**
- * Used for tests that require more than the left and right nodes.
- */
-const extra = makeEmptyNode('extra');
-/**
- * The node inserted by the change whose anchors are being tested.
- * Tests outcomes are decided based on where this node ends up (if present at all).
- */
-const inserted = makeEmptyNode('inserted');
-/**
- * Used for tests cases where we check `inserted`'s final location with respect to another node that is concurrently inserted.
- */
-const concurrentlyInserted = makeEmptyNode('concurrently inserted');
-const treeOptions = {
-    initialTree,
-    localMode: false,
-    enableAnchors: true,
-    allowInvalid: true,
-};
-const secondTreeOptions = {
-    id: 'secondTestSharedTree',
-    localMode: false,
-    enableAnchors: true,
-    allowInvalid: true,
-};
-const thirdTreeOptions = {
-    id: 'thirdTestSharedTree',
-    localMode: false,
-    enableAnchors: true,
-    allowInvalid: true,
-};
-const boundToNodeBefore = {
-    name: 'BoundToNode Before(left)',
-    insertionPlace: PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.BoundToNode),
-    onNoConcurrency: { leftTrait: [inserted, left] },
-    onMove: { leftTrait: [], rightTrait: [inserted, left, right] },
-    onDelete: { leftTrait: [] },
-    onDroppedEdit: { leftTrait: [inserted, left] },
-    onInsert: { leftTrait: [concurrentlyInserted, inserted, left] },
-};
-const boundToNodeAfter = Object.assign(Object.assign({}, boundToNodeBefore), { name: 'BoundToNode After(left)', insertionPlace: PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.BoundToNode), onNoConcurrency: { leftTrait: [left, inserted] }, onMove: { leftTrait: [], rightTrait: [left, inserted, right] }, onDroppedEdit: { leftTrait: [left, inserted] }, onInsert: { leftTrait: [left, inserted, concurrentlyInserted] } });
-const boundToNodeStart = Object.assign(Object.assign({}, boundToNodeBefore), { name: 'BoundToNode Start(left trait)', insertionPlace: PlaceAnchor.atStartOf(leftTraitLocation, PlaceAnchorSemanticsChoice.BoundToNode), onMove: { leftTrait: [inserted], rightTrait: [left, right] }, onDelete: { leftTrait: [inserted] }, onInsert: { leftTrait: [inserted, concurrentlyInserted, left] } });
-const boundToNodeEnd = Object.assign(Object.assign({}, boundToNodeAfter), { name: 'BoundToNode End(left trait)', insertionPlace: PlaceAnchor.atEndOf(leftTraitLocation, PlaceAnchorSemanticsChoice.BoundToNode), onMove: { leftTrait: [inserted], rightTrait: [left, right] }, onDelete: { leftTrait: [inserted] }, onInsert: { leftTrait: [left, concurrentlyInserted, inserted] } });
-const relativeToNodeBefore = Object.assign(Object.assign({}, boundToNodeBefore), { name: 'RelativeToNode Before(left)', insertionPlace: PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.RelativeToNode), onDelete: { leftTrait: [inserted] } });
-const relativeToNodeAfter = Object.assign(Object.assign({}, boundToNodeAfter), { name: 'RelativeToNode After(left)', insertionPlace: PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.RelativeToNode), onDelete: relativeToNodeBefore.onDelete });
-const relativeToNodeStart = Object.assign(Object.assign({}, boundToNodeStart), { name: 'RelativeToNode Start(left trait)', insertionPlace: PlaceAnchor.atStartOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode) });
-const relativeToNodeEnd = Object.assign(Object.assign({}, boundToNodeEnd), { name: 'RelativeToNode End(left trait)', insertionPlace: PlaceAnchor.atEndOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode) });
-/**
- * A representative set of possible anchors with a variety of semantics and in a variety of contexts.
- * Includes the expected outcome of inserting the `inserted` node at the given anchor for various test scenarios.
- */
-const anchorCases = [
-    boundToNodeBefore,
-    boundToNodeAfter,
-    boundToNodeStart,
-    boundToNodeEnd,
-    relativeToNodeBefore,
-    relativeToNodeAfter,
-    relativeToNodeStart,
-    relativeToNodeEnd,
-];
-/**
- * A set of test scenario where `inserted` is inserted at a given anchor.
- */
-const insertScenarios = [
-    {
-        title: 'when there are no concurrent edits',
-        outcomeKey: 'onNoConcurrency',
-    },
-    {
-        title: 'when target sibling is moved to a different trait',
-        outcomeKey: 'onMove',
-        concurrent: AnchoredMove.create(StableRange.only(left), StablePlace.before(right)),
-    },
-    {
-        title: 'when target sibling is deleted then re-inserted in a different trait',
-        outcomeKey: 'onTeleport',
-        concurrent: [
-            AnchoredDelete.create(StableRange.only(left)),
-            ...AnchoredInsert.create([left], StablePlace.before(right)),
-        ],
-    },
-    {
-        title: 'when target sibling is deleted with (before, before) range',
-        outcomeKey: 'onDelete',
-        concurrent: AnchoredDelete.create({
-            start: StablePlace.before(left),
-            end: StablePlace.atEndOf(leftTraitLocation),
-        }),
-    },
-    {
-        title: 'when target sibling is deleted with (before, after) range',
-        outcomeKey: 'onDelete',
-        concurrent: AnchoredDelete.create({
-            start: StablePlace.before(left),
-            end: StablePlace.after(left),
-        }),
-    },
-    {
-        title: 'when target sibling is deleted with (after, before) range',
-        outcomeKey: 'onDelete',
-        concurrent: AnchoredDelete.create({
-            start: StablePlace.atStartOf(leftTraitLocation),
-            end: StablePlace.atEndOf(leftTraitLocation),
-        }),
-    },
-    {
-        title: 'when target sibling is deleted with (after, after) range',
-        outcomeKey: 'onDelete',
-        concurrent: AnchoredDelete.create({
-            start: StablePlace.atStartOf(leftTraitLocation),
-            end: StablePlace.after(left),
-        }),
-    },
-    {
-        title: 'when target sibling is deleted then un-deleted',
-        outcomeKey: 'onUndoDelete',
-        concurrent: (tree) => {
-            const deletionEditId = tree.editor.delete(StableRange.only(left));
-            const deletionEditIndex = tree.edits.getIndexOfId(deletionEditId);
-            const deletionEdit = tree.edits.getEditInSessionAtIndex(deletionEditIndex);
-            return revert(deletionEdit.changes, tree.logViewer.getSnapshotInSession(deletionEditIndex));
-        },
-    },
-    {
-        title: 'when target sibling is deleted then un-deleted and re-deleted',
-        outcomeKey: 'onUndoRedoDelete',
-        concurrent: (tree) => {
-            const deletionEditId = tree.editor.delete(StableRange.only(left));
-            const deletionEditIndex = tree.edits.getIndexOfId(deletionEditId);
-            const deletionEdit = tree.edits.getEditInSessionAtIndex(deletionEditIndex);
-            const undoEditId = tree.editor.revert(deletionEdit, tree.logViewer.getSnapshotInSession(deletionEditIndex));
-            const undoEditIndex = tree.edits.getIndexOfId(undoEditId);
-            const undoEdit = tree.edits.getEditInSessionAtIndex(undoEditIndex);
-            return revert(undoEdit.changes, tree.logViewer.getSnapshotInSession(undoEditIndex));
-        },
-    },
-    {
-        title: 'when target sibling parent is deleted',
-        outcomeKey: 'onDeleteParent',
-        concurrent: AnchoredDelete.create(StableRange.only(parent)),
-    },
-    {
-        title: 'when target sibling is moved in an edit that is dropped',
-        outcomeKey: 'onDroppedEdit',
-        concurrent: [
-            // Valid move
-            ...AnchoredMove.create(StableRange.only(left), StablePlace.before(right)),
-            // Invalid constraint
-            AnchoredChange.constraint(StableRange.only(left), ConstraintEffect.InvalidAndDiscard, undefined, 0),
-        ],
-    },
-    {
-        title: 'when target sibling is deleted in an edit that is dropped',
-        outcomeKey: 'onDroppedEdit',
-        concurrent: [
-            // Valid delete
-            AnchoredDelete.create(StableRange.only(left)),
-            // Invalid constraint
-            AnchoredChange.constraint(StableRange.only(left), ConstraintEffect.InvalidAndDiscard, undefined, 0),
-        ],
-    },
-    {
-        title: 'when target place is inserted at',
-        outcomeKey: 'onInsert',
-        concurrent: (_, anchorCase) => AnchoredInsert.create([concurrentlyInserted], anchorCase.insertionPlace),
-    },
-];
-describe('SharedTreeWithAnchors', () => {
-    describe('Fulfills the SharedTree contract', () => {
-        runSharedTreeOperationsTests('SharedTree Operations', setUpTestSharedTreeWithAnchors);
-        runSummaryTests('SharedTree Summary', setUpTestSharedTreeWithAnchors, setUpLocalServerTestSharedTreeWithAnchors);
-    });
-    it('PlaceAnchor builders default to RelativeToNode semantics', () => {
-        const start = PlaceAnchor.atStartOf(leftTraitLocation);
-        const end = PlaceAnchor.atEndOf(leftTraitLocation);
-        const before = PlaceAnchor.before(left);
-        const after = PlaceAnchor.after(left);
-        expect(start.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-        expect(end.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-        expect(before.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-        expect(after.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-    });
-    it('RangeAnchor builders default to RelativeToNode semantics', () => {
-        const range = RangeAnchor.only(left);
-        expect(range.start.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-        expect(range.end.semantics).equals(PlaceAnchorSemanticsChoice.RelativeToNode);
-    });
-    // This is the main battery of tests.
-    // These tests insert the `inserted` node at a given PlaceAnchor in different scenarios and check where that node ends up.
-    // The scenarios cover the various ways concurrent change might affect an anchor.
-    describe('Basic scenarios', () => {
-        for (const insertScenario of insertScenarios) {
-            describe(insertScenario.title, () => {
-                insertTestsWithExtraChanges(insertScenario.outcomeKey, insertScenario.concurrent);
-            });
-        }
-    });
-    // These tests exercise special scenarios that the main battery of tests (above) does not cover.
-    // They are mainly aimed at uncovering invalid assumptions that the anchor resolution implementation might make.
-    // While these tests could be made exhaustive like the main battery, doing so would just add redundant coverage.
-    describe(`Special scenarios`, () => {
-        it('when target place is invalid', () => {
-            const { treeA, treeB, container } = setupTrees();
-            treeA.editor.insert(inserted, PlaceAnchor.before(inserted));
-            container.processAllMessages();
-            expectChangedTraits(treeA, treeB, {});
-        });
-        // For each scenario we test with:
-        //   groupInEdit=true:  the concurrent changes that introduced the conflict were applied in a single edit
-        //   groupInEdit=false: the concurrent changes that introduced the conflict were applied in separate edits
-        for (const groupInEdit of [true, false]) {
-            describe(groupInEdit ? 'In one edit' : 'In separate edits', () => {
-                // These tests verify that re-anchoring works even when more than one place anchor needs updating.
-                it('when target place and source range both need updating due to two deletes', () => {
-                    const { treeA, treeB, container } = setupTrees();
-                    treeA.editor.insert(extra, StablePlace.before(left));
-                    container.processAllMessages();
-                    if (groupInEdit) {
-                        treeB.editor.applyChanges([
-                            AnchoredDelete.create(RangeAnchor.only(left)),
-                            AnchoredDelete.create(RangeAnchor.all(rightTraitLocation)),
-                        ]);
-                    }
-                    else {
-                        treeB.editor.delete(RangeAnchor.only(left));
-                        treeB.editor.delete(RangeAnchor.all(rightTraitLocation));
-                    }
-                    const beforeExtra = PlaceAnchor.before(extra);
-                    const afterExtra = PlaceAnchor.after(extra);
-                    treeA.editor.move(RangeAnchor.from(beforeExtra).to(afterExtra), PlaceAnchor.before(right));
-                    container.processAllMessages();
-                    expectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [extra] });
-                });
-            });
-        }
-        // This test covers the scenario that yields different results depending on whether the front-biased approach
-        // seeks backward to find the most recent offending change at the granularity of changes or at the granularity of edits
-        // and then proceeds through changes forward.
-        it('when target place is teleported then deleted in a single edit', () => {
-            const { treeA, treeB, container } = setupTrees();
-            treeB.editor.applyChanges([
-                // The reanchor will happen on this change if seeking backward through edits and then forward through changes
-                AnchoredDelete.create(RangeAnchor.only(left)),
-                ...AnchoredInsert.create([left], PlaceAnchor.atStartOf(rightTraitLocation)),
-                // The reanchor will happen on this change if seeking backward through changes
-                AnchoredDelete.create(RangeAnchor.only(left)),
-            ]);
-            treeA.editor.insert(inserted, PlaceAnchor.before(left));
-            container.processAllMessages();
-            expectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted, right] });
-        });
-        // This test covers the scenario that yields different results depending on whether the front-biased approach
-        // seeks backward to find the most recent offending change at the granularity of changes or at the granularity of edits.
-        it('when target place is teleported then deleted across edits', () => {
-            const { treeA, treeB, container } = setupTrees();
-            // The reanchor will happen on this change if seeking backward through edits
-            treeB.editor.delete(left);
-            treeB.editor.applyChanges([
-                ...AnchoredInsert.create([left], StablePlace.atStartOf(rightTraitLocation)),
-                // The reanchor will happen on this change if seeking backward through changes
-                AnchoredDelete.create(StableRange.only(left)),
-            ]);
-            treeA.editor.insert(inserted, PlaceAnchor.before(left));
-            container.processAllMessages();
-            expectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted, right] });
-        });
-        // This test covers the scenario that yields different results depending on whether the changes of the edit being applied are
-        // included in the reconciliation path or not.
-        it('when target place is deleted by the edit being rebased', () => {
-            const { treeA, treeB, container } = setupTrees();
-            treeB.editor.move(left, PlaceAnchor.before(right));
-            treeA.editor.applyChanges([
-                // The reanchor will happen on this change if changes for this edit are included in the reconciliation path
-                AnchoredDelete.create(RangeAnchor.all(rightTraitLocation)),
-                // This change will fail if changes for this edit are not included in the reconciliation path
-                ...AnchoredInsert.create([inserted], PlaceAnchor.before(left)),
-            ]);
-            container.processAllMessages();
-            expectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [inserted] });
-        });
-        // These tests cover the scenario that yields different results depending on whether the change application performed on the
-        // reconciliation path is itself using anchor resolution
-        for (const extraChange of [false, true]) {
-            it(`when target place resolution requires resolution of a different place in another edit${extraChange ? ' (with extra change)' : ''}`, () => {
-                const { treeA, treeB, container } = setupTrees();
-                const { tree: treeC } = setUpTestSharedTreeWithAnchors(Object.assign({ containerRuntimeFactory: container }, thirdTreeOptions));
-                treeA.editor.insert(extra, StablePlace.before(right));
-                treeA.editor.move(left, StablePlace.before(extra));
-                container.processAllMessages();
-                // State of right trait: [left, extra, right]
-                treeB.editor.move(left, StablePlace.after(extra));
-                // State of right trait: [extra, left, right]
-                treeB.editor.delete(left);
-                // State of right trait: [extra, left-tombstone, right]
-                treeC.editor.applyChanges([
-                    // Will be re-anchored to delete [right] instead of [left, extra, right]
-                    AnchoredDelete.create(RangeAnchor.from(PlaceAnchor.before(left)).to(StablePlace.atEndOf(rightTraitLocation))),
-                    // When present, the no-op change after the change of interest to ensures the anchor resolution uses resolved
-                    // changes in the reconciliation path (or derives them).
-                    // When not present, the above delete is the only change in the edit so there's a possibility that the anchor
-                    // resolution would use cached edit results (which reflect the resolved changes) and therefore don't require
-                    // the actual use of resolved changes.
-                    // We still want to test without this extra change to ensure that such a possibility, if leveraged, does work
-                    // properly.
-                    ...(extraChange ? [AnchoredChange.clearPayload(parent.identifier)] : []),
-                ]);
-                // State of right trait: [extra, left-tombstone, right-tombstone]
-                treeA.editor.insert(inserted, PlaceAnchor.after(right));
-                // State of right trait: [extra, left-tombstone, right-tombstone, inserted]
-                // Unless anchor resolution is not performed which case the edit will fail when it tries to apply the
-                // "delete everything before left" edit because it will not take into account the resolved location for "before left".
-                container.processAllMessages();
-                expectChangedTraits(treeA, treeB, { leftTrait: [], rightTrait: [extra, inserted] });
-            });
-        }
-    });
-});
-/**
- * Runs an insertion test scenario on all possible anchors.
- */
-function insertTestsWithExtraChanges(outcomeField, concurrentSteps) {
-    for (const anchorCase of anchorCases) {
-        const outcome = outcomeFromCaseAndField(anchorCase, outcomeField);
-        insertTest(anchorCase, outcome, concurrentSteps);
-    }
-}
-/**
- * Provides the expected outcome for a particular `AnchorCase` instance and scenario (described by its `outcomeField`)
- * This helps reduce cruft in the `AnchorCase` by providing general expectations (e.g., concurrently deleting a node and undoing the
- * deletion is expected, unless otherwise specified, to yield the same outcome as through no concurrent changes were made).
- */
-function outcomeFromCaseAndField(anchorCase, outcomeField) {
-    if (anchorCase[outcomeField] !== undefined) {
-        return anchorCase[outcomeField];
-    }
-    switch (outcomeField) {
-        case 'onUndoDelete':
-            return outcomeFromCaseAndField(anchorCase, 'onNoConcurrency');
-        case 'onUndoRedoDelete':
-            return outcomeFromCaseAndField(anchorCase, 'onDelete');
-        case 'onTeleport':
-            return outcomeFromCaseAndField(anchorCase, 'onMove');
-        case 'onDeleteParent':
-            return { leftTrait: [], rightTrait: [] };
-        default:
-            fail('The expected outcome for this case has not been specified');
-    }
-}
-/**
- * Runs the insertion test characterized by the anchor as which to insert, the expected outcome, and the concurrent changes to apply.
- */
-function insertTest(anchorCase, expected, concurrentSteps) {
-    it(anchorCase.name, () => {
-        const { tree: treeA, containerRuntimeFactory } = setUpTestSharedTreeWithAnchors(treeOptions);
-        const { tree: treeB } = setUpTestSharedTreeWithAnchors(Object.assign({ containerRuntimeFactory }, secondTreeOptions));
-        // Sync initial tree
-        containerRuntimeFactory.processAllMessages();
-        const concurrentChanges = concurrentSteps === undefined
-            ? []
-            : typeof concurrentSteps === 'function'
-                ? concurrentSteps(treeB, anchorCase)
-                : Array.isArray(concurrentSteps)
-                    ? concurrentSteps
-                    : [concurrentSteps];
-        // Perform the concurrent edit(s) to be sequenced first
-        if (concurrentSteps) {
-            treeB.editor.applyChanges(concurrentChanges);
-        }
-        // Make the insertion at the anchored place
-        treeA.editor.insert(inserted, anchorCase.insertionPlace);
-        containerRuntimeFactory.processAllMessages();
-        // Test the outcome matches expectations
-        expectChangedTraits(treeA, treeB, expected);
-    });
-}
-function expectChangedTraits(treeA, treeB, expected) {
-    var _a, _b;
-    const leftIds = ((_a = expected.leftTrait) !== null && _a !== void 0 ? _a : [left]).map((node) => node.identifier);
-    const rightIds = ((_b = expected.rightTrait) !== null && _b !== void 0 ? _b : [right]).map((node) => node.identifier);
-    expect(tryGetTrait(treeA, leftTraitLocation)).deep.equal(leftIds);
-    expect(tryGetTrait(treeB, leftTraitLocation)).deep.equal(leftIds);
-    expect(tryGetTrait(treeA, rightTraitLocation)).deep.equal(rightIds);
-    expect(tryGetTrait(treeB, rightTraitLocation)).deep.equal(rightIds);
-}
-function tryGetTrait(tree, location) {
-    return tree.currentView.hasNode(location.parent) ? tree.currentView.getTrait(location) : [];
-}
-function setupTrees() {
-    const { tree: treeA, containerRuntimeFactory: container } = setUpTestSharedTreeWithAnchors(treeOptions);
-    const { tree: treeB } = setUpTestSharedTreeWithAnchors(Object.assign({ containerRuntimeFactory: container }, secondTreeOptions));
-    container.processAllMessages();
-    return { treeA, treeB, container };
-}
-//# sourceMappingURL=SharedTreeWithAnchors.tests.js.map