@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

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

@@ -0,0 +1 @@
+{"version":3,"file":"TransactionInternal.tests.js","sourceRoot":"","sources":["../../src/test/TransactionInternal.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAAsB,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AACjF,OAAO,EACN,cAAc,EAEd,kBAAkB,EAClB,gBAAgB,EAChB,UAAU,EAEV,IAAI,EACJ,mBAAmB,EACnB,mBAAmB,GACnB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,yBAAyB,EAAE,MAAM,kBAAkB,CAAC;AACtG,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAEvF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,IAAI,WAA+B,CAAC;IACpC,MAAM,QAAQ,GAAG,eAAe,CAC/B,SAAS,EACT,CAAC,CAAC,EAAE,EAAE;QACL,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,EACD,IAAI,CACJ,CAAC;IACF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,SAAS,YAAY;YACpB,OAAO,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;QAED,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;YACrB,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACvB,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,kBAAkB,GAAwB;gBAC/C,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;gBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aAC1B,CAAC;YACF,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;aACpE,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,YAAY,EAAE;wBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;wBACxC,KAAK,EAAE,kBAAkB,CAAC,KAAK;wBAC/B,YAAY,EAAE,qBAAqB,CAAC,cAAc;qBAClD;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE;oBACZ,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,KAAK,EAAE;oBACpD,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;iBAC1B;gBACD,MAAM,EAAE,gBAAgB,CAAC,UAAU;gBACnC,IAAI,EAAE,kBAAkB,CAAC,UAAU;aACnC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,MAAM,EAAE,CAAC;aACT,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,MAAM,EAAE,CAAC;aACT,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,CAAC;iBACT;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,UAAU,EAAE,QAAQ,CAAC,UAAU;aAC/B,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAC1D,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,UAAU;aACV,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,SAAS;oBAC3D,MAAM,EAAE,UAAU;iBAClB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,WAAW,CAAC,WAAW,CAAC;gBACvB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;gBACnC,KAAK,EAAE,cAAc;aACrB,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,UAAU,GAAG;gBAClB,WAAW,EAAE,YAAY,EAAE;gBAC3B,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;gBAC1C,IAAI,EAAE,kBAAkB,CAAC,UAA2C;gBACpE,KAAK,EAAE,sCAAoD;aAC3D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YACpC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,mBAAmB;gBACzD,UAAU;gBACV,SAAS,EAAE;oBACV,IAAI,EAAE,mBAAmB,CAAC,uBAAuB,CAAC,QAAQ;oBAC1D,MAAM,EAAE,cAAc;iBACtB;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACpD,MAAM,MAAM,GAAqB;gBAChC,YAAY,EAAE,QAAQ,CAAC,cAAc,EAAE;gBACvC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAEhC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,SAAS;gBAC/C,MAAM;gBACN,EAAE,EAAE,MAAM,CAAC,YAAY;aACvB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC;YAC5B,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO;gBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxF,CAAC,CAAC,CAAC;QAEH,4EAA4E;QAC5E,KAAK,MAAM,OAAO,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE;YACtC,EAAE,CAAC,sBAAsB,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,GAAG,EAAE;gBACxD,WAAW,CAAC,WAAW,CAAC;oBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;oBACjC,OAAO;oBACP,IAAI,EAAE,kBAAkB,CAAC,QAAQ;iBACjC,CAAC,CAAC;gBACH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnF,CAAC,CAAC,CAAC;SACH;QAED,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,WAAW,CAAC,WAAW,CAAC;gBACvB,YAAY,EAAE,QAAQ,CAAC,UAAU;gBACjC,OAAO,EAAE,EAAE;gBACX,IAAI,EAAE,kBAAkB,CAAC,QAAQ;aACjC,CAAC,CAAC;YAEH,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC;YAChF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;YAC1E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YACzG,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC,EAAE,SAAS,CAAC,CAAC;iBACzG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,MAAM,OAAO,GAAG,CAAuB,CAAC;QAExC,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACjC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;gBACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBACvF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM;gBACnC,2BAA2B;gBAC3B,CAAuB,EACvB,EAAE,gBAAgB,EAAE,QAAQ,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,CAC3D,CAAC;gBACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;oBAC9D,MAAM;oBACN,UAAU,EAAE,MAAM,CAAC,MAAM;iBACzB,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;gBAC7C,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBAEvF,MAAM,cAAc,GAAG,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;gBACnD,MAAM,cAAc,GAAG;oBACtB,gFAAgF;oBAChF,cAAc;oBACd,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;oBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;iBACjB,CAAC;gBACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;gBAC9D,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;gBACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;oBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;oBAC9C,MAAM;oBACN,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,MAAM,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YACvF,MAAM,KAAK,GAAG;gBACb,gBAAgB,EAAE,KAAK;gBACvB,IAAI,EAAE,IAAI,CAAC,KAAK;aAChB,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YACrD,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,qBAAqB,CAAC,cAAc;aAClD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,EAAE,CAAC;YACnB,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,YAAY,CAAC;gBACxB,cAAc,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC;gBAC5D,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC;gBAClE,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;aACrF,CAAC,CAAC;YACH,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACH,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;YAC1C,EAAE,CAAC,4BAA4B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,aAAa,EAAE,GAAG,EAAE;gBAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,SAAS,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;gBAC5C,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBACtD,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CACxB,CAAC,OAAO,CAAC,EACT,IAAI,KAAK,IAAI,CAAC,KAAK;oBAClB,CAAC,CAAC,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC;oBACpD,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CACnD,CACD,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CACnG,CAAC;YACH,CAAC,CAAC,CAAC;YACH,EAAE,CAAC,qBAAqB,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,eAAe,EAAE,GAAG,EAAE;gBACtF,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;gBAE7C,WAAW,CAAC,YAAY,CACvB,cAAc,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,CAC1F,CAAC;gBACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CACzE,IAAI,KAAK,IAAI,CAAC,MAAM;oBACnB,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC;oBAChD,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CACjD,CAAC;YACH,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,8CAA8C;YAC9C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YACvG,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,EAAE,CAAuB,CAAC,CAAC;YAC7F,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,+DAA+D;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAClC;gBACC,OAAO;gDAEH,QAAQ,CAAC,iBAAiB,EAAE,KAC/B,MAAM,EAAE;wBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;4DACtB,QAAQ,CAAC,iBAAiB,EAAE,KAAE,UAAU,EAAE,OAAO,CAAC,UAAU;yBACjE;qBACD;aAEF,EACD,CAAuB,CACvB,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,kBAAkB;gBACxD,MAAM;gBACN,EAAE,EAAE,OAAO,CAAC,UAAU;aACtB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,2CAA2C;YAC3C,MAAM,UAAU,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YACF,MAAM,KAAK,GAAe;gBACzB,UAAU;gBACV,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACtE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,cAAc;gBACpD,MAAM;gBACN,EAAE,EAAE,UAAU;aACd,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACpE,6DAA6D;YAC7D,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,mBAAmB,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,OAAO,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YAC7C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAuB,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC;YAC7D,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC;YAC/E,MAAM,CAAC,gBAAgB,CAAC,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;iBACtG,IAAI,CAAC;QACR,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,MAAM,GAAG;gBACd,WAAW,EAAE,CAAuB;gBACpC,MAAM,EAAE,CAAC,kBAAkB,CAAC;gBAC5B,IAAI,EAAE,kBAAkB,CAAC,KAAiC;aAC1D,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,wBAAwB;gBAC9D,MAAM;gBACN,UAAU,EAAE,kBAAkB;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,0CAA0C;YAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAC;YACnD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAEjD,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,aAAa,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YACnF,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,iBAAiB,GAAG,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;YACjF,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,cAAc,GAAG;gBACtB,gFAAgF;gBAChF,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;YACrG,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE;oBACb,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,cAAc;oBACrB,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mEAAmE,EAAE,GAAG,EAAE;YAC5E,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAuB,CAAC,CACvF,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAuB,CAAC,CAAC;YACxG,oCAAoC;YACpC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,SAAS,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,8BAA8B;gBACpE,MAAM;gBACN,UAAU,EAAE,MAAM,CAAC,WAAW;aAC9B,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,MAAM,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAClG,mBAAmB,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAC1D,CAAC;YACF,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5C,kCAAkC;YAClC,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACtD,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;YACnC,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,IAAI,EAAE,mBAAmB,CAAC,WAAW,CAAC,QAAQ;gBAC9C,MAAM;gBACN,KAAK;gBACL,YAAY,EAAE,yBAAyB,CAAC,QAAQ;aAChD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC;QACrE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,UAAU,GAAG,CAAuB,CAAC;YAC3C,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;YACpG,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,EAAE,mBAAmB,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC/E,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC3E,QAAQ,CAAC,KAAK,CAAC,UAAU;gBACzB,QAAQ,CAAC,IAAI,CAAC,UAAU;aACxB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,gGAAgG;YAChG,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,gBAAgB,GAAG,CAAuB,CAAC;YACjD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,mCAAmC;YACnC,MAAM,gBAAgB,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACnD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;YACxE,MAAM,kBAAkB,GAAG,WAAyB,CAAC;YACrD,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,KAAK,CACnB;gDAEK,kBAAkB,KACrB,MAAM,EAAE,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE;aAEvD,EACD,gBAAgB,CAChB,CACD,CAAC;YACF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,gBAAgB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC3F,CAAC;YACF,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACzE,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAClD,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC;gBAC/C,MAAM,EAAE,gBAAgB;gBACxB,KAAK,EAAE,kBAAkB;aACzB,CAAC,CAAC;YACH,MAAM,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACtE,MAAM,kBAAkB,GAAG,CAAuB,CAAC;YACnD,MAAM,mBAAmB,GAAG,CAAuB,CAAC;YACpD,MAAM,iBAAiB,GAAG,CAAuB,CAAC;YAClD,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC;YAC5G,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,mBAAmB,CAAC,CACpF,CAAC;YAEF,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACjD,MAAM,eAAe,mCACjB,QAAQ,CAAC,iBAAiB,CAAC,cAAc,CAAC,KAC7C,MAAM,EAAE;oBACP,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,kBAAkB,CAAC;oBAChD,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,mBAAmB,CAAC;iBAClD,GACD,CAAC;YACF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC;YACpF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,iBAAiB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAC5F,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAChF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;YAE7F,MAAM,eAAe,GAAG,yBAAyB,CAAC,WAAW,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YACpF,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;YAEtC,MAAM,cAAc,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACxD,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,gBAAgB,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;YAEtE,MAAM,eAAe,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC1D,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5C,MAAM,CAAC,gBAAgB,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACzE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;YAC3F,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC/D,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,wBAAwB,GAAG,CAAuB,CAAC;YACzD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE/E,MAAM,OAAO,GAAe;gBAC3B,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBACpC,UAAU,EAAE,cAAc,CAAC,UAAU;gBACrC,MAAM,EAAE,EAAE;aACV,CAAC;YAEF,WAAW,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,wBAAwB,CAAC,CAAC,CAAC;YACnF,WAAW,CAAC,WAAW,CACtB,cAAc,CAAC,MAAM,CAAC,wBAAwB,EAAE,WAAW,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CACnG,CAAC;YACF,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QACxG,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, TraitLabel } from '../Identifiers';\nimport { assert } from '../Common';\nimport { getChangeNodeFromViewNode } from '../SerializationUtilities';\nimport { GenericTransaction, TransactionInternal } from '../TransactionInternal';\nimport {\n\tChangeInternal,\n\tChangeNode,\n\tChangeTypeInternal,\n\tConstraintEffect,\n\tEditStatus,\n\tSetValueInternal,\n\tSide,\n\tStablePlaceInternal,\n\tStableRangeInternal,\n} from '../persisted-types';\nimport { StablePlace, StableRange } from '../ChangeTypes';\nimport { deepCompareNodes, PlaceValidationResult, RangeValidationResultKind } from '../EditUtilities';\nimport { SimpleTestTree } from './utilities/TestNode';\nimport { refreshTestTree, testTrait, testTraitLabel } from './utilities/TestUtilities';\n\ndescribe('Transaction', () => {\n\tlet transaction: GenericTransaction;\n\tconst testTree = refreshTestTree(\n\t\tundefined,\n\t\t(t) => {\n\t\t\ttransaction = TransactionInternal.factory(t.view);\n\t\t},\n\t\ttrue\n\t);\n\tdescribe('Constraints', () => {\n\t\tfunction getTestTrait(): StableRangeInternal {\n\t\t\treturn StableRange.all(testTrait(transaction.view));\n\t\t}\n\n\t\tit('can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('can be unmet', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst invalidStableRange: StableRangeInternal = {\n\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\tend: { side: Side.Before },\n\t\t\t};\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadRange,\n\t\t\t\t\trangeFailure: {\n\t\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\t\tplace: invalidStableRange.start,\n\t\t\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('effect can apply anyway', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: {\n\t\t\t\t\tstart: { side: Side.After, referenceSibling: badId },\n\t\t\t\t\tend: { side: Side.Before },\n\t\t\t\t},\n\t\t\t\teffect: ConstraintEffect.ValidRetry,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 0,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('length can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlength: 1,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLength,\n\t\t\t\t\tactual: 0,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('parent can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode: testTree.identifier,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('parent can be unmet', () => {\n\t\t\tconst parentNode = testTree.generateNodeId('not in tree');\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tparentNode,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadParent,\n\t\t\t\t\tactual: parentNode,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('label can be met', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: testTraitLabel,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t});\n\t\tit('label can be unmet', () => {\n\t\t\tconst constraint = {\n\t\t\t\ttoConstrain: getTestTrait(),\n\t\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\t\ttype: ChangeTypeInternal.Constraint as ChangeTypeInternal.Constraint,\n\t\t\t\tlabel: '7969ee2e-5418-43db-929a-4e9a23c5499d' as TraitLabel,\n\t\t\t};\n\t\t\ttransaction.applyChange(constraint);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.ConstraintViolation,\n\t\t\t\tconstraint,\n\t\t\t\tviolation: {\n\t\t\t\t\tkind: TransactionInternal.ConstraintViolationKind.BadLabel,\n\t\t\t\t\tactual: testTraitLabel,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('SetValue', () => {\n\t\tit('can be invalid if the node does not exist', () => {\n\t\t\tconst change: SetValueInternal = {\n\t\t\t\tnodeToModify: testTree.generateNodeId(),\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.UnknownId,\n\t\t\t\tchange,\n\t\t\t\tid: change.nodeToModify,\n\t\t\t});\n\t\t});\n\n\t\tit('can change payload', () => {\n\t\t\tconst payload = { foo: {} };\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload, // Arbitrary payload.\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).deep.equals(payload);\n\t\t});\n\n\t\t// 'null' is not included here since it means clear the payload in setValue.\n\t\tfor (const payload of [0, '', [], {}]) {\n\t\t\tit(`can set payload to ${JSON.stringify(payload)}`, () => {\n\t\t\t\ttransaction.applyChange({\n\t\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\t\tpayload,\n\t\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t\t});\n\t\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).equals(payload);\n\t\t\t});\n\t\t}\n\n\t\tit('can clear an unset payload', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\n\t\tit('can clear a set payload', () => {\n\t\t\ttransaction.applyChange({\n\t\t\t\tnodeToModify: testTree.identifier,\n\t\t\t\tpayload: {},\n\t\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t\t});\n\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.getViewNode(testTree.identifier).payload).not.undefined;\n\t\t\ttransaction.applyChange(ChangeInternal.clearPayload(testTree.identifier));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect({}.hasOwnProperty.call(transaction.view.getViewNode(testTree.identifier), 'payload')).to.be.false;\n\t\t\texpect({}.hasOwnProperty.call(getChangeNodeFromViewNode(transaction.view, testTree.identifier), 'payload'))\n\t\t\t\t.to.be.false;\n\t\t});\n\t});\n\n\tdescribe('Insert', () => {\n\t\tconst buildId = 0 as DetachedSequenceId;\n\n\t\tdescribe('can be malformed', () => {\n\t\t\tit('when the detached sequence ID is bogus', () => {\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\t\tconst change = ChangeInternal.insert(\n\t\t\t\t\t// Non-existent detached id\n\t\t\t\t\t1 as DetachedSequenceId,\n\t\t\t\t\t{ referenceSibling: testTree.identifier, side: Side.After }\n\t\t\t\t);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\t\tchange,\n\t\t\t\t\tsequenceId: change.source,\n\t\t\t\t});\n\t\t\t});\n\t\t\tit('when the target place is malformed', () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\n\t\t\t\tconst referenceTrait = testTree.left.traitLocation;\n\t\t\t\tconst malformedPlace = {\n\t\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\t\treferenceTrait,\n\t\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t};\n\t\t\t\tconst change = ChangeInternal.insert(buildId, malformedPlace);\n\t\t\t\ttransaction.applyChange(change);\n\t\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\t\tconst result = transaction.close();\n\t\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\t\texpect(result.failure).deep.equals({\n\t\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\t\tchange,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t\tit('can be invalid when the target place is invalid', () => {\n\t\t\tconst badId = testTree.generateNodeId('not in tree');\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], buildId));\n\t\t\tconst place = {\n\t\t\t\treferenceSibling: badId,\n\t\t\t\tside: Side.After,\n\t\t\t};\n\t\t\tconst change = ChangeInternal.insert(buildId, place);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadPlace,\n\t\t\t\tchange,\n\t\t\t\tplace,\n\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t});\n\t\t});\n\t\tit('a detached node with a payload', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst payload = 42;\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChanges([\n\t\t\t\tChangeInternal.setPayload(testTree.left.identifier, payload),\n\t\t\t\tChangeInternal.detach(StableRange.only(testTree.left), detachedId),\n\t\t\t\tChangeInternal.insert(detachedId, StablePlace.atStartOf(testTree.left.traitLocation)),\n\t\t\t]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t\texpect(transaction.view.getViewNode(testTree.left.identifier).payload).to.equal(payload);\n\t\t});\n\t\t[Side.Before, Side.After].forEach((side) => {\n\t\t\tit(`can insert a node at the ${side === Side.After ? 'beginning' : 'end'} of a trait`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNodeId = testTree.generateNodeId();\n\t\t\t\tconst newNode = testTree.buildLeafInternal(newNodeId);\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree(\n\t\t\t\t\t\t[newNode],\n\t\t\t\t\t\tside === Side.After\n\t\t\t\t\t\t\t? StablePlace.atStartOf(testTree.left.traitLocation)\n\t\t\t\t\t\t\t: StablePlace.atEndOf(testTree.left.traitLocation)\n\t\t\t\t\t)\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.After ? [newNodeId, testTree.left.identifier] : [testTree.left.identifier, newNodeId]\n\t\t\t\t);\n\t\t\t});\n\t\t\tit(`can insert a node ${side === Side.Before ? 'before' : 'after'} another node`, () => {\n\t\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\t\tconst newNode = testTree.buildLeafInternal();\n\n\t\t\t\ttransaction.applyChanges(\n\t\t\t\t\tChangeInternal.insertTree([newNode], { referenceSibling: testTree.left.identifier, side })\n\t\t\t\t);\n\t\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals(\n\t\t\t\t\tside === Side.Before\n\t\t\t\t\t\t? [newNode.identifier, testTree.left.identifier]\n\t\t\t\t\t\t: [testTree.left.identifier, newNode.identifier]\n\t\t\t\t);\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Build', () => {\n\t\tit('can be malformed due to detached ID collision', () => {\n\t\t\t// Apply two Build_s with the same detached id\n\t\t\ttransaction.applyChange(ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([testTree.buildLeafInternal()], 0 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\n\t\tit('can be malformed due to duplicate node identifiers', () => {\n\t\t\t// Build two nodes with the same identifier, one of them nested\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\tconst change = ChangeInternal.build(\n\t\t\t\t[\n\t\t\t\t\tnewNode,\n\t\t\t\t\t{\n\t\t\t\t\t\t...testTree.buildLeafInternal(),\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\t[testTree.left.traitLabel]: [\n\t\t\t\t\t\t\t\t{ ...testTree.buildLeafInternal(), identifier: newNode.identifier },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t\t0 as DetachedSequenceId\n\t\t\t);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DuplicateIdInBuild,\n\t\t\t\tchange,\n\t\t\t\tid: newNode.identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid when a node already exists with the given identifier', () => {\n\t\t\t// Build two nodes with the same identifier\n\t\t\tconst identifier = testTree.generateNodeId();\n\t\t\tconst node1: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\t\t\tconst node2: ChangeNode = {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([node1], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst change = ChangeInternal.build([node2], 1 as DetachedSequenceId);\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.IdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tid: identifier,\n\t\t\t});\n\t\t});\n\n\t\tit('is invalid to build a node that has already been inserted', () => {\n\t\t\t// Build new node using identifier already in use in the tree\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure.kind).equals(TransactionInternal.FailureKind.IdAlreadyInUse);\n\t\t});\n\n\t\tit('can build a detached node', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst newNode = testTree.buildLeafInternal();\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], 0 as DetachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\texpect(transaction.view.hasNode(newNode.identifier)).is.true;\n\t\t\texpect(transaction.view.tryGetParentViewNode(newNode.identifier)).is.undefined;\n\t\t\texpect(deepCompareNodes(getChangeNodeFromViewNode(transaction.view, newNode.identifier), newNode)).to.be\n\t\t\t\t.true;\n\t\t});\n\n\t\tit(\"can be malformed if detached sequence id doesn't exist\", () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\tconst change = {\n\t\t\t\tdestination: 1 as DetachedSequenceId,\n\t\t\t\tsource: [detachedSequenceId],\n\t\t\t\ttype: ChangeTypeInternal.Build as ChangeTypeInternal.Build,\n\t\t\t};\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceNotFound,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: detachedSequenceId,\n\t\t\t});\n\t\t});\n\n\t\tit('can build a node with an explicit empty trait', () => {\n\t\t\t// Forest should strip off the empty trait\n\t\t\tconst nodeWithEmpty = testTree.buildLeafInternal();\n\t\t\tconst traits = new Map<TraitLabel, NodeId[]>();\n\t\t\tconst emptyTrait: NodeId[] = [];\n\t\t\ttraits.set(testTree.left.traitLabel, emptyTrait);\n\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\tconst detachedSequenceId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.build([nodeWithEmpty], detachedSequenceId));\n\t\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t\t\tconst viewNodeWithEmpty = transaction.view.getViewNode(nodeWithEmpty.identifier);\n\t\t\texpect(viewNodeWithEmpty.traits.size).to.equal(0);\n\t\t});\n\t});\n\n\tdescribe('Detach', () => {\n\t\tit('can be malformed if the target range is malformed', () => {\n\t\t\tconst malformedPlace = {\n\t\t\t\t// A place is malformed if it has both a reference trait and a reference sibling\n\t\t\t\treferenceTrait: testTree.left.traitLocation,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\tconst range = StableRangeInternal.from(malformedPlace).to(StablePlaceInternal.after(testTree.right));\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: malformedPlace,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t\tit('can be malformed if the destination sequence id is already in use', () => {\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.left), 0 as DetachedSequenceId)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(StableRangeInternal.only(testTree.right), 0 as DetachedSequenceId);\n\t\t\t// Supplied StableRange is malformed\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Malformed);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Malformed);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.DetachedSequenceIdAlreadyInUse,\n\t\t\t\tchange,\n\t\t\t\tsequenceId: change.destination,\n\t\t\t});\n\t\t});\n\t\tit('can be invalid if the target range is invalid', () => {\n\t\t\tconst range = StableRangeInternal.from(StablePlaceInternal.atEndOf(testTree.left.traitLocation)).to(\n\t\t\t\tStablePlaceInternal.atStartOf(testTree.left.traitLocation)\n\t\t\t);\n\t\t\tconst change = ChangeInternal.detach(range);\n\t\t\t// Start place is before end place\n\t\t\ttransaction.applyChange(change);\n\t\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t\t\tconst result = transaction.close();\n\t\t\tassert(result.status === EditStatus.Invalid);\n\t\t\texpect(result.failure).deep.equals({\n\t\t\t\tkind: TransactionInternal.FailureKind.BadRange,\n\t\t\t\tchange,\n\t\t\t\trange,\n\t\t\t\trangeFailure: RangeValidationResultKind.Inverted,\n\t\t\t});\n\t\t});\n\t\tit('can delete a node', () => {\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\texpect(transaction.view.hasNode(testTree.left.identifier)).is.false;\n\t\t});\n\t});\n\n\tdescribe('Composite changes', () => {\n\t\tit('can form a node move', () => {\n\t\t\tconst detachedId = 0 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), detachedId));\n\t\t\ttransaction.applyChange(ChangeInternal.insert(detachedId, StablePlaceInternal.after(testTree.right)));\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([\n\t\t\t\ttestTree.right.identifier,\n\t\t\t\ttestTree.left.identifier,\n\t\t\t]);\n\t\t});\n\t\tit('can form a wrap insert', () => {\n\t\t\t// A wrap insert is an edit that inserts a new node between a subtree and its parent atomically.\n\t\t\t// Ex: given A -> B -> C, a wrap insert of D around B would produce A -> D -> B -> C\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst parentDetachedId = 1 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\t// This is node D, from the example\n\t\t\tconst wrappingParentId = testTree.generateNodeId();\n\t\t\tconst wrappingParentNode = testTree.buildLeafInternal(wrappingParentId);\n\t\t\tconst wrappingTraitLabel = 'wrapTrait' as TraitLabel;\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.build(\n\t\t\t\t\t[\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\t...wrappingParentNode,\n\t\t\t\t\t\t\ttraits: { [wrappingTraitLabel]: [leftNodeDetachedId] }, // Re-parent left under new node\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t\tparentDetachedId\n\t\t\t\t)\n\t\t\t);\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(parentDetachedId, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\tconst leftTrait = transaction.view.getTrait(testTree.left.traitLocation);\n\t\t\texpect(leftTrait).deep.equals([wrappingParentId]);\n\t\t\tconst wrappingTrait = transaction.view.getTrait({\n\t\t\t\tparent: wrappingParentId,\n\t\t\t\tlabel: wrappingTraitLabel,\n\t\t\t});\n\t\t\texpect(wrappingTrait).deep.equals([testTree.left.identifier]);\n\t\t});\n\n\t\tit('can build and insert a tree that contains detached subtrees', () => {\n\t\t\tconst leftNodeDetachedId = 0 as DetachedSequenceId;\n\t\t\tconst rightNodeDetachedId = 1 as DetachedSequenceId;\n\t\t\tconst detachedIdSubtree = 2 as DetachedSequenceId;\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left), leftNodeDetachedId));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.detach(StableRangeInternal.only(testTree.right), rightNodeDetachedId)\n\t\t\t);\n\n\t\t\tconst detachedNodeId = testTree.generateNodeId();\n\t\t\tconst detachedSubtree = {\n\t\t\t\t...testTree.buildLeafInternal(detachedNodeId),\n\t\t\t\ttraits: {\n\t\t\t\t\t[testTree.left.traitLabel]: [leftNodeDetachedId],\n\t\t\t\t\t[testTree.right.traitLabel]: [rightNodeDetachedId],\n\t\t\t\t},\n\t\t\t};\n\t\t\ttransaction.applyChange(ChangeInternal.build([detachedSubtree], detachedIdSubtree));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(detachedIdSubtree, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.right.traitLocation)).deep.equals([]);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([detachedNodeId]);\n\n\t\t\tconst insertedSubtree = getChangeNodeFromViewNode(transaction.view, detachedNodeId);\n\t\t\tconst traits = insertedSubtree.traits;\n\n\t\t\tconst leftTreeTraits = traits[testTree.left.traitLabel];\n\t\t\texpect(leftTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(leftTreeTraits[0], testTree.left)).to.be.true;\n\n\t\t\tconst rightTreeTraits = traits[testTree.right.traitLabel];\n\t\t\texpect(rightTreeTraits).to.have.lengthOf(1);\n\t\t\texpect(deepCompareNodes(rightTreeTraits[0], testTree.right)).to.be.true;\n\t\t});\n\n\t\tit('can build and insert a tree with the same identity as that of a detached subtree', () => {\n\t\t\tconst transaction = TransactionInternal.factory(testTree.view);\n\t\t\ttransaction.applyChange(ChangeInternal.detach(StableRangeInternal.only(testTree.left)));\n\t\t\tconst idOfDetachedNodeToInsert = 1 as DetachedSequenceId;\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([]);\n\n\t\t\tconst newNode: ChangeNode = {\n\t\t\t\tidentifier: testTree.left.identifier,\n\t\t\t\tdefinition: SimpleTestTree.definition,\n\t\t\t\ttraits: {},\n\t\t\t};\n\n\t\t\ttransaction.applyChange(ChangeInternal.build([newNode], idOfDetachedNodeToInsert));\n\t\t\ttransaction.applyChange(\n\t\t\t\tChangeInternal.insert(idOfDetachedNodeToInsert, StablePlace.atStartOf(testTree.left.traitLocation))\n\t\t\t);\n\t\t\texpect(transaction.view.getTrait(testTree.left.traitLocation)).deep.equals([testTree.left.identifier]);\n\t\t});\n\t});\n});\n"]}

package/lib/test/TreeCompression.tests.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=TreeCompression.tests.d.ts.map

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

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

package/lib/test/TreeCompression.tests.js

@@ -0,0 +1,292 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { v4 as uuidv4 } from 'uuid';
+import { assert } from '../Common';
+import { walkTree } from '../EditUtilities';
+import { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor';
+import { isDetachedSequenceId, } from '../Identifiers';
+import { scopeIdNormalizer } from '../NodeIdUtilities';
+import { RevisionView } from '../RevisionView';
+import { MutableStringInterner } from '../StringInterner';
+import { InterningTreeCompressor } from '../TreeCompressor';
+import { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';
+/**
+ * Verifies a tree can round-trip through compression/decompression. Optionally also asserts the compressed state
+ * matches some expected state.
+ *
+ * By default, this function asserts the round-tripped tree is deeply equal to the `tree` parameter.
+ * If that parameter is not normalized (ex: contains extra properties), a custom `roundTripAsserter` can be passed instead.
+ */
+function testCompression(tree, idNormalizer, compressed, roundTripAsserter, internStrings = (interner, tree) => {
+    walkTree(tree, (node) => {
+        interner.getOrCreateInternedId(node.definition);
+        for (const trait of Object.keys(node.traits).sort()) {
+            interner.getOrCreateInternedId(trait);
+        }
+    }, isDetachedSequenceId);
+}) {
+    const interner = new MutableStringInterner();
+    internStrings(interner, tree);
+    const treeCompressor = new InterningTreeCompressor();
+    const compressedTree = treeCompressor.compress(tree, interner, idNormalizer);
+    if (compressed !== undefined) {
+        expect(compressedTree).to.deep.equal(compressed);
+    }
+    const internedStrings = interner.getSerializable();
+    const newInterner = new MutableStringInterner(internedStrings);
+    const decompressedTree = treeCompressor.decompress(compressedTree, newInterner, idNormalizer);
+    if (roundTripAsserter) {
+        roundTripAsserter(tree, decompressedTree);
+    }
+    else {
+        expect(decompressedTree).to.deep.equal(tree);
+    }
+}
+/**
+ * Brands the passed in number as an `InternedStringId`.
+ * Ergonomic helper for making expected compressed trees typecheck.
+ */
+function internedId(n) {
+    return n;
+}
+describe('TreeCompression', () => {
+    it('noops on a placeholder root tree', () => {
+        const placeholderId = 42;
+        const context = makeNodeIdContext();
+        testCompression(placeholderId, scopeIdNormalizer(context), placeholderId);
+    });
+    it('can compress trees containing nested DetachedSequenceIds', () => {
+        const context = makeNodeIdContext();
+        const id = context.generateNodeId();
+        const detachedSequenceId = 43;
+        const tree = {
+            identifier: id,
+            definition: 'node',
+            traits: {
+                someTrait: [detachedSequenceId],
+            },
+        };
+        testCompression(tree, scopeIdNormalizer(context), [
+            internedId(0),
+            context.normalizeToOpSpace(id),
+            [internedId(1), [detachedSequenceId]],
+        ]);
+    });
+    it('omits traits and payload fields on empty leaf nodes', () => {
+        const context = makeNodeIdContext();
+        const id = context.generateNodeId();
+        const tree = {
+            identifier: id,
+            definition: 'node',
+            traits: {},
+        };
+        testCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id)]);
+    });
+    it('handles payloads on leaves', () => {
+        const context = makeNodeIdContext();
+        const id = context.generateNodeId();
+        const tree = {
+            identifier: id,
+            definition: 'node',
+            traits: {},
+            payload: 5,
+        };
+        testCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id), [5]]);
+    });
+    it('handles non-interned `Definition`s', () => {
+        const context = makeNodeIdContext();
+        const id = context.generateNodeId();
+        const definition = 'node';
+        const tree = {
+            identifier: id,
+            definition,
+            traits: {},
+        };
+        testCompression(tree, scopeIdNormalizer(context), [definition, context.normalizeToOpSpace(id)], undefined, () => { } /* intern nothing */);
+    });
+    it('handles non-interned `TraitLabel`s', () => {
+        const context = makeNodeIdContext();
+        const parentId = context.generateNodeId();
+        const childId = context.generateNodeId();
+        const parentDefinition = 'def1';
+        const childDefinition = 'def2';
+        const tree = {
+            identifier: parentId,
+            definition: parentDefinition,
+            traits: {
+                trait1: [
+                    {
+                        identifier: childId,
+                        definition: childDefinition,
+                        traits: {},
+                    },
+                ],
+            },
+        };
+        testCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(parentId), ['trait1', [[internedId(1)]]]], undefined, (interner) => {
+            interner.getOrCreateInternedId(parentDefinition);
+            interner.getOrCreateInternedId(childDefinition);
+        });
+    });
+    it('handles intermediate nodes without payloads', () => {
+        const context = makeNodeIdContext();
+        const parentId = context.generateNodeId();
+        const childId = context.generateNodeId();
+        const parentDefinition = 'def1';
+        const childDefinition = 'def2';
+        const tree = {
+            identifier: parentId,
+            definition: parentDefinition,
+            traits: {
+                trait1: [
+                    {
+                        identifier: childId,
+                        definition: childDefinition,
+                        traits: {},
+                    },
+                ],
+            },
+        };
+        testCompression(tree, scopeIdNormalizer(context), [
+            internedId(0),
+            context.normalizeToOpSpace(parentId),
+            [internedId(1), [[internedId(2)]]],
+        ]);
+    });
+    it('handles intermediate nodes with payloads', () => {
+        const context = makeNodeIdContext();
+        const parentId = context.generateNodeId();
+        const childId = context.generateNodeId();
+        const parentDefinition = 'def1';
+        const childDefinition = 'def2';
+        const payload = 'parentPayload';
+        const tree = {
+            identifier: parentId,
+            definition: parentDefinition,
+            traits: {
+                trait1: [
+                    {
+                        identifier: childId,
+                        definition: childDefinition,
+                        traits: {},
+                    },
+                ],
+            },
+            payload,
+        };
+        testCompression(tree, scopeIdNormalizer(context), [
+            internedId(0),
+            context.normalizeToOpSpace(parentId),
+            [payload, internedId(1), [[internedId(2)]]],
+        ]);
+    });
+    it('handles traits with multiple nodes', () => {
+        const tree = setUpTestTree();
+        testCompression(tree, scopeIdNormalizer(tree), [
+            internedId(0),
+            tree.normalizeToOpSpace(tree.identifier),
+            [
+                internedId(1),
+                [[internedId(0), tree.normalizeToOpSpace(tree.left.identifier)]],
+                internedId(2),
+                [[internedId(0)]],
+            ],
+        ], 
+        // SimpleTestTree contains extra properties, so deep compare as objects is insufficient. The revision view strategy
+        // only works for valid standalone trees (i.e. ones without placeholders).
+        (tree, treeAfterRoundTrip) => {
+            expect(RevisionView.fromTree(tree).equals(RevisionView.fromTree(treeAfterRoundTrip)), 'Unequal revision views');
+        });
+    });
+    it('can round trip a tree with several levels', () => {
+        const context = makeNodeIdContext();
+        const makeLeaf = () => ({
+            identifier: context.generateNodeId(),
+            definition: uuidv4(),
+            traits: {},
+        });
+        // Makes a full 2-ary tree with the provided height.
+        const makeTreeWithHeight = (height) => {
+            if (height === 0) {
+                return makeLeaf();
+            }
+            return {
+                identifier: context.generateNodeId(),
+                definition: uuidv4(),
+                traits: {
+                    [uuidv4()]: [makeTreeWithHeight(height - 1)],
+                    [uuidv4()]: [makeTreeWithHeight(height - 1)],
+                },
+            };
+        };
+        testCompression(makeTreeWithHeight(3), scopeIdNormalizer(context));
+    });
+    it('elides IDs that span multiple children or cousins', () => {
+        const reservedIdCount = 4;
+        const idCompressor = new IdCompressor(createSessionId(), reservedIdCount);
+        const context = makeNodeIdContext(idCompressor);
+        // Order of IDs:  [-1, -2, -3, -4, 0, 1, 2, -5, 3, -6, -6]
+        // After elision: [-1,  _,  _,  _, 0, _, _, -5, 3, -6, -6]
+        const localIds = [...Array(6).keys()].map((_) => context.generateNodeId());
+        localIds.forEach((id) => assert(isLocalId(id)));
+        const finalIds = [...Array(reservedIdCount).keys()].map((_, i) => idCompressor.getReservedId(i));
+        finalIds.forEach((id) => assert(isFinalId(id)));
+        function node(identifier, traits) {
+            return {
+                identifier,
+                definition: 'def',
+                traits: traits !== null && traits !== void 0 ? traits : {},
+            };
+        }
+        const tree = node(localIds[0], {
+            zebra: [node(localIds[5]), node(localIds[5])],
+            maganio: [
+                node(localIds[3]),
+                node(finalIds[0], {
+                    pardesio: [node(finalIds[2]), node(localIds[4]), node(finalIds[3])],
+                    hortonio: [node(finalIds[1])],
+                }),
+            ],
+            aardvark: [
+                node(localIds[1], {
+                    basketball: [node(localIds[2])],
+                }),
+            ],
+        });
+        const nodeDef = internedId(0);
+        function id(id) {
+            return context.normalizeToOpSpace(id);
+        }
+        testCompression(tree, scopeIdNormalizer(context), [
+            nodeDef,
+            id(tree.identifier),
+            [
+                internedId(1),
+                [[nodeDef, [internedId(4), [[nodeDef]]]]],
+                internedId(2),
+                [
+                    [nodeDef],
+                    [
+                        nodeDef,
+                        id(finalIds[0]),
+                        [
+                            internedId(5),
+                            [[nodeDef]],
+                            internedId(6),
+                            [[nodeDef], [nodeDef, id(localIds[4])], [nodeDef, id(finalIds[3])]],
+                        ],
+                    ],
+                ],
+                internedId(3),
+                [
+                    [nodeDef, id(localIds[5])],
+                    [nodeDef, id(localIds[5])],
+                ],
+            ],
+        ]);
+    });
+});
+//# sourceMappingURL=TreeCompression.tests.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TreeCompression.tests.js","sourceRoot":"","sources":["../../src/test/TreeCompression.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AACnC,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACvF,OAAO,EAIN,oBAAoB,GAIpB,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAkC,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAEvF,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,uBAAuB,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE7E;;;;;;GAMG;AACH,SAAS,eAAe,CACvB,IAAmC,EACnC,YAA2D,EAC3D,UAAmE,EACnE,iBAAkH,EAClH,gBAAgG,CAC/F,QAAQ,EACR,IAAI,EACH,EAAE;IACH,QAAQ,CACP,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE;QACR,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;YACpD,QAAQ,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;SACtC;IACF,CAAC,EACD,oBAAoB,CACpB,CAAC;AACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;IAC7C,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC9B,MAAM,cAAc,GAAG,IAAI,uBAAuB,EAAgB,CAAC;IACnE,MAAM,cAAc,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IAC7E,IAAI,UAAU,KAAK,SAAS,EAAE;QAC7B,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;KACjD;IACD,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,EAAE,CAAC;IACnD,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;IAC/D,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,CAAC,cAAc,EAAE,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9F,IAAI,iBAAiB,EAAE;QACtB,iBAAiB,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;KAC1C;SAAM;QACN,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;KAC7C;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,CAAS;IAC5B,OAAO,CAAqB,CAAC;AAC9B,CAAC;AAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,aAAa,GAAG,EAAwB,CAAC;QAC/C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,eAAe,CAAC,aAAa,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,kBAAkB,GAAG,EAAwB,CAAC;QACpD,MAAM,IAAI,GAAwC;YACjD,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE;gBACP,SAAS,EAAE,CAAC,kBAAkB,CAAC;aAC/B;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC;YAC9B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC;SACrC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC9D,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,MAAoB;YAChC,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,CAAC;SACV,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,UAAU,GAAG,MAAoB,CAAC;QACxC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU;YACV,MAAM,EAAE,EAAE;SACV,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,EAC5C,SAAS,EACT,GAAG,EAAE,GAAE,CAAC,CAAC,oBAAoB,CAC7B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,OAAO,CAAC,EAC1B,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACpF,SAAS,EACT,CAAC,QAAQ,EAAE,EAAE;YACZ,QAAQ,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC;YACjD,QAAQ,CAAC,qBAAqB,CAAC,eAAe,CAAC,CAAC;QACjD,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,gBAAgB,GAAG,MAAoB,CAAC;QAC9C,MAAM,eAAe,GAAG,MAAoB,CAAC;QAC7C,MAAM,OAAO,GAAG,eAAe,CAAC;QAChC,MAAM,IAAI,GAAoB;YAC7B,UAAU,EAAE,QAAQ;YACpB,UAAU,EAAE,gBAAgB;YAC5B,MAAM,EAAE;gBACP,MAAM,EAAE;oBACP;wBACC,UAAU,EAAE,OAAO;wBACnB,UAAU,EAAE,eAAe;wBAC3B,MAAM,EAAE,EAAE;qBACV;iBACD;aACD;YACD,OAAO;SACP,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACjD,UAAU,CAAC,CAAC,CAAC;YACb,OAAO,CAAC,kBAAkB,CAAC,QAAQ,CAAC;YACpC,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3C,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,eAAe,CACd,IAAI,EACJ,iBAAiB,CAAC,IAAI,CAAC,EACvB;YACC,UAAU,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,CAAC;YACxC;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;gBAChE,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;aACjB;SACD;QACD,mHAAmH;QACnH,0EAA0E;QAC1E,CAAC,IAAI,EAAE,kBAAkB,EAAE,EAAE;YAC5B,MAAM,CACL,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAC7E,wBAAwB,CACxB,CAAC;QACH,CAAC,CACD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,GAAoB,EAAE,CAAC,CAAC;YACxC,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;YACpC,UAAU,EAAE,MAAM,EAAgB;YAClC,MAAM,EAAE,EAAE;SACV,CAAC,CAAC;QAEH,oDAAoD;QACpD,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAmB,EAAE;YAC9D,IAAI,MAAM,KAAK,CAAC,EAAE;gBACjB,OAAO,QAAQ,EAAE,CAAC;aAClB;YAED,OAAO;gBACN,UAAU,EAAE,OAAO,CAAC,cAAc,EAAE;gBACpC,UAAU,EAAE,MAAM,EAAgB;gBAClC,MAAM,EAAE;oBACP,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAC1D,CAAC,MAAM,EAAgB,CAAC,EAAE,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;iBAC1D;aACD,CAAC;QACH,CAAC,CAAC;QAEF,eAAe,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,eAAe,GAAG,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,IAAI,YAAY,CAAC,eAAe,EAAE,EAAE,eAAe,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAChD,0DAA0D;QAC1D,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC,CAAC;QAC3E,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,eAAe,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAW,CAAC,CAAC;QAC3G,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEhD,SAAS,IAAI,CACZ,UAAkB,EAClB,MAAoD;YAEpD,OAAO;gBACN,UAAU;gBACV,UAAU,EAAE,KAAmB;gBAC/B,MAAM,EAAE,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,EAAE;aACpB,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAoB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;YAC/C,KAAK,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,OAAO,EAAE;gBACR,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACjB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnE,QAAQ,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC7B,CAAC;aACF;YACD,QAAQ,EAAE;gBACT,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACjB,UAAU,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC/B,CAAC;aACF;SACD,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,SAAS,EAAE,CAAC,EAAU;YACrB,OAAO,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,eAAe,CAAQ,IAAI,EAAE,iBAAiB,CAAC,OAAO,CAAC,EAAE;YACxD,OAAO;YACP,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC;YACnB;gBACC,UAAU,CAAC,CAAC,CAAC;gBACb,CAAC,CAAC,OAAO,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,CAAC;oBACT;wBACC,OAAO;wBACP,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;wBACf;4BACC,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,CAAC;4BACX,UAAU,CAAC,CAAC,CAAC;4BACb,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;yBACnE;qBACD;iBACD;gBACD,UAAU,CAAC,CAAC,CAAC;gBACb;oBACC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC1B,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC1B;aACD;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { v4 as uuidv4 } from 'uuid';\nimport { assert } from '../Common';\nimport { walkTree } from '../EditUtilities';\nimport { createSessionId, IdCompressor, isFinalId, isLocalId } from '../id-compressor';\nimport {\n\tDefinition,\n\tDetachedSequenceId,\n\tInternedStringId,\n\tisDetachedSequenceId,\n\tNodeId,\n\tOpSpaceNodeId,\n\tTraitLabel,\n} from '../Identifiers';\nimport { ContextualizedNodeIdNormalizer, scopeIdNormalizer } from '../NodeIdUtilities';\nimport { CompressedPlaceholderTree, PlaceholderTree, TraitMap, TreeNode } from '../persisted-types';\nimport { RevisionView } from '../RevisionView';\nimport { MutableStringInterner } from '../StringInterner';\nimport { InterningTreeCompressor } from '../TreeCompressor';\nimport { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';\n\n/**\n * Verifies a tree can round-trip through compression/decompression. Optionally also asserts the compressed state\n * matches some expected state.\n *\n * By default, this function asserts the round-tripped tree is deeply equal to the `tree` parameter.\n * If that parameter is not normalized (ex: contains extra properties), a custom `roundTripAsserter` can be passed instead.\n */\nfunction testCompression<TPlaceholder extends DetachedSequenceId | never>(\n\ttree: PlaceholderTree<TPlaceholder>,\n\tidNormalizer: ContextualizedNodeIdNormalizer<OpSpaceNodeId>,\n\tcompressed?: CompressedPlaceholderTree<OpSpaceNodeId, TPlaceholder>,\n\troundTripAsserter?: (tree: PlaceholderTree<TPlaceholder>, roundTrippedTree: PlaceholderTree<TPlaceholder>) => void,\n\tinternStrings: (interner: MutableStringInterner, tree: PlaceholderTree<TPlaceholder>) => void = (\n\t\tinterner,\n\t\ttree\n\t) => {\n\t\twalkTree<Exclude<PlaceholderTree<DetachedSequenceId>, DetachedSequenceId>, DetachedSequenceId>(\n\t\t\ttree,\n\t\t\t(node) => {\n\t\t\t\tinterner.getOrCreateInternedId(node.definition);\n\t\t\t\tfor (const trait of Object.keys(node.traits).sort()) {\n\t\t\t\t\tinterner.getOrCreateInternedId(trait);\n\t\t\t\t}\n\t\t\t},\n\t\t\tisDetachedSequenceId\n\t\t);\n\t}\n): void {\n\tconst interner = new MutableStringInterner();\n\tinternStrings(interner, tree);\n\tconst treeCompressor = new InterningTreeCompressor<TPlaceholder>();\n\tconst compressedTree = treeCompressor.compress(tree, interner, idNormalizer);\n\tif (compressed !== undefined) {\n\t\texpect(compressedTree).to.deep.equal(compressed);\n\t}\n\tconst internedStrings = interner.getSerializable();\n\tconst newInterner = new MutableStringInterner(internedStrings);\n\tconst decompressedTree = treeCompressor.decompress(compressedTree, newInterner, idNormalizer);\n\tif (roundTripAsserter) {\n\t\troundTripAsserter(tree, decompressedTree);\n\t} else {\n\t\texpect(decompressedTree).to.deep.equal(tree);\n\t}\n}\n\n/**\n * Brands the passed in number as an `InternedStringId`.\n * Ergonomic helper for making expected compressed trees typecheck.\n */\nfunction internedId(n: number): InternedStringId {\n\treturn n as InternedStringId;\n}\n\ndescribe('TreeCompression', () => {\n\tit('noops on a placeholder root tree', () => {\n\t\tconst placeholderId = 42 as DetachedSequenceId;\n\t\tconst context = makeNodeIdContext();\n\t\ttestCompression(placeholderId, scopeIdNormalizer(context), placeholderId);\n\t});\n\n\tit('can compress trees containing nested DetachedSequenceIds', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst detachedSequenceId = 43 as DetachedSequenceId;\n\t\tconst tree: PlaceholderTree<DetachedSequenceId> = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {\n\t\t\t\tsomeTrait: [detachedSequenceId],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(id),\n\t\t\t[internedId(1), [detachedSequenceId]],\n\t\t]);\n\t});\n\n\tit('omits traits and payload fields on empty leaf nodes', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id)]);\n\t});\n\n\tit('handles payloads on leaves', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: 'node' as Definition,\n\t\t\ttraits: {},\n\t\t\tpayload: 5,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [internedId(0), context.normalizeToOpSpace(id), [5]]);\n\t});\n\n\tit('handles non-interned `Definition`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst definition = 'node' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: id,\n\t\t\tdefinition,\n\t\t\ttraits: {},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[definition, context.normalizeToOpSpace(id)],\n\t\t\tundefined,\n\t\t\t() => {} /* intern nothing */\n\t\t);\n\t});\n\n\tit('handles non-interned `TraitLabel`s', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(context),\n\t\t\t[internedId(0), context.normalizeToOpSpace(parentId), ['trait1', [[internedId(1)]]]],\n\t\t\tundefined,\n\t\t\t(interner) => {\n\t\t\t\tinterner.getOrCreateInternedId(parentDefinition);\n\t\t\t\tinterner.getOrCreateInternedId(childDefinition);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('handles intermediate nodes without payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles intermediate nodes with payloads', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst parentId = context.generateNodeId();\n\t\tconst childId = context.generateNodeId();\n\t\tconst parentDefinition = 'def1' as Definition;\n\t\tconst childDefinition = 'def2' as Definition;\n\t\tconst payload = 'parentPayload';\n\t\tconst tree: PlaceholderTree = {\n\t\t\tidentifier: parentId,\n\t\t\tdefinition: parentDefinition,\n\t\t\ttraits: {\n\t\t\t\ttrait1: [\n\t\t\t\t\t{\n\t\t\t\t\t\tidentifier: childId,\n\t\t\t\t\t\tdefinition: childDefinition,\n\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t},\n\t\t\t\t],\n\t\t\t},\n\t\t\tpayload,\n\t\t};\n\t\ttestCompression(tree, scopeIdNormalizer(context), [\n\t\t\tinternedId(0),\n\t\t\tcontext.normalizeToOpSpace(parentId),\n\t\t\t[payload, internedId(1), [[internedId(2)]]],\n\t\t]);\n\t});\n\n\tit('handles traits with multiple nodes', () => {\n\t\tconst tree = setUpTestTree();\n\t\ttestCompression<never>(\n\t\t\ttree,\n\t\t\tscopeIdNormalizer(tree),\n\t\t\t[\n\t\t\t\tinternedId(0),\n\t\t\t\ttree.normalizeToOpSpace(tree.identifier),\n\t\t\t\t[\n\t\t\t\t\tinternedId(1),\n\t\t\t\t\t[[internedId(0), tree.normalizeToOpSpace(tree.left.identifier)]],\n\t\t\t\t\tinternedId(2),\n\t\t\t\t\t[[internedId(0)]], // Right ID should be elided, but no others\n\t\t\t\t],\n\t\t\t],\n\t\t\t// SimpleTestTree contains extra properties, so deep compare as objects is insufficient. The revision view strategy\n\t\t\t// only works for valid standalone trees (i.e. ones without placeholders).\n\t\t\t(tree, treeAfterRoundTrip) => {\n\t\t\t\texpect(\n\t\t\t\t\tRevisionView.fromTree(tree).equals(RevisionView.fromTree(treeAfterRoundTrip)),\n\t\t\t\t\t'Unequal revision views'\n\t\t\t\t);\n\t\t\t}\n\t\t);\n\t});\n\n\tit('can round trip a tree with several levels', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst makeLeaf = (): PlaceholderTree => ({\n\t\t\tidentifier: context.generateNodeId(),\n\t\t\tdefinition: uuidv4() as Definition,\n\t\t\ttraits: {},\n\t\t});\n\n\t\t// Makes a full 2-ary tree with the provided height.\n\t\tconst makeTreeWithHeight = (height: number): PlaceholderTree => {\n\t\t\tif (height === 0) {\n\t\t\t\treturn makeLeaf();\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\tidentifier: context.generateNodeId(),\n\t\t\t\tdefinition: uuidv4() as Definition,\n\t\t\t\ttraits: {\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t\t[uuidv4() as TraitLabel]: [makeTreeWithHeight(height - 1)],\n\t\t\t\t},\n\t\t\t};\n\t\t};\n\n\t\ttestCompression(makeTreeWithHeight(3), scopeIdNormalizer(context));\n\t});\n\n\tit('elides IDs that span multiple children or cousins', () => {\n\t\tconst reservedIdCount = 4;\n\t\tconst idCompressor = new IdCompressor(createSessionId(), reservedIdCount);\n\t\tconst context = makeNodeIdContext(idCompressor);\n\t\t// Order of IDs:  [-1, -2, -3, -4, 0, 1, 2, -5, 3, -6, -6]\n\t\t// After elision: [-1,  _,  _,  _, 0, _, _, -5, 3, -6, -6]\n\t\tconst localIds = [...Array(6).keys()].map((_) => context.generateNodeId());\n\t\tlocalIds.forEach((id) => assert(isLocalId(id)));\n\t\tconst finalIds = [...Array(reservedIdCount).keys()].map((_, i) => idCompressor.getReservedId(i) as NodeId);\n\t\tfinalIds.forEach((id) => assert(isFinalId(id)));\n\n\t\tfunction node(\n\t\t\tidentifier: NodeId,\n\t\t\ttraits?: TraitMap<TreeNode<PlaceholderTree, NodeId>>\n\t\t): TreeNode<PlaceholderTree, NodeId> {\n\t\t\treturn {\n\t\t\t\tidentifier,\n\t\t\t\tdefinition: 'def' as Definition,\n\t\t\t\ttraits: traits ?? {},\n\t\t\t};\n\t\t}\n\n\t\tconst tree: PlaceholderTree = node(localIds[0], {\n\t\t\tzebra: [node(localIds[5]), node(localIds[5])],\n\t\t\tmaganio: [\n\t\t\t\tnode(localIds[3]),\n\t\t\t\tnode(finalIds[0], {\n\t\t\t\t\tpardesio: [node(finalIds[2]), node(localIds[4]), node(finalIds[3])],\n\t\t\t\t\thortonio: [node(finalIds[1])],\n\t\t\t\t}),\n\t\t\t],\n\t\t\taardvark: [\n\t\t\t\tnode(localIds[1], {\n\t\t\t\t\tbasketball: [node(localIds[2])],\n\t\t\t\t}),\n\t\t\t],\n\t\t});\n\n\t\tconst nodeDef = internedId(0);\n\n\t\tfunction id(id: NodeId): OpSpaceNodeId {\n\t\t\treturn context.normalizeToOpSpace(id);\n\t\t}\n\n\t\ttestCompression<never>(tree, scopeIdNormalizer(context), [\n\t\t\tnodeDef,\n\t\t\tid(tree.identifier),\n\t\t\t[\n\t\t\t\tinternedId(1), // aardvark\n\t\t\t\t[[nodeDef, [internedId(4), [[nodeDef]]]]],\n\t\t\t\tinternedId(2), // maganio\n\t\t\t\t[\n\t\t\t\t\t[nodeDef],\n\t\t\t\t\t[\n\t\t\t\t\t\tnodeDef,\n\t\t\t\t\t\tid(finalIds[0]),\n\t\t\t\t\t\t[\n\t\t\t\t\t\t\tinternedId(5), // hortonio\n\t\t\t\t\t\t\t[[nodeDef]],\n\t\t\t\t\t\t\tinternedId(6), // pardesio\n\t\t\t\t\t\t\t[[nodeDef], [nodeDef, id(localIds[4])], [nodeDef, id(finalIds[3])]],\n\t\t\t\t\t\t],\n\t\t\t\t\t],\n\t\t\t\t],\n\t\t\t\tinternedId(3), // zebra\n\t\t\t\t[\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t\t[nodeDef, id(localIds[5])],\n\t\t\t\t],\n\t\t\t],\n\t\t]);\n\t});\n});\n"]}

package/lib/test/TreeView.tests.d.ts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export {};
+//# sourceMappingURL=TreeView.tests.d.ts.map

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

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

package/lib/test/TreeView.tests.js

@@ -0,0 +1,147 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { RevisionView } from '../RevisionView';
+import { refreshTestTree } from './utilities/TestUtilities';
+import { expectDefined } from './utilities/TestCommon';
+describe('TreeView', () => {
+    const testTree = refreshTestTree();
+    describe('can compute deltas', () => {
+        it('that are the same object', () => {
+            const view = testTree.view;
+            expect(view.delta(view)).deep.equals({
+                changed: [],
+                added: [],
+                removed: [],
+            });
+        });
+        it('that have the same tree', () => {
+            const viewA = RevisionView.fromTree(testTree);
+            const viewB = RevisionView.fromTree(testTree);
+            expect(viewA.delta(viewB)).deep.equals({
+                changed: [],
+                added: [],
+                removed: [],
+            });
+        });
+        it('with different root ids', () => {
+            const viewA = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));
+            const viewB = RevisionView.fromTree(testTree.buildLeaf(testTree.generateNodeId()));
+            expect(() => viewA.delta(viewB)).to.throw('Delta can only be calculated between views that share a root');
+        });
+        it('with different subtrees', () => {
+            const rootId = testTree.generateNodeId();
+            const leafA = testTree.buildLeaf(testTree.generateNodeId());
+            const leafB = testTree.buildLeaf(testTree.generateNodeId());
+            const subtreeA = {
+                identifier: testTree.generateNodeId(),
+                definition: 'node',
+                traits: { children: [leafA] },
+            };
+            const subtreeB = {
+                identifier: testTree.generateNodeId(),
+                definition: 'node',
+                traits: { children: [leafB] },
+            };
+            const rootA = {
+                identifier: rootId,
+                definition: 'node',
+                traits: {
+                    children: [subtreeA],
+                },
+            };
+            const rootB = {
+                identifier: rootId,
+                definition: 'node',
+                traits: {
+                    children: [subtreeB],
+                },
+            };
+            const viewA = RevisionView.fromTree(rootA);
+            const viewB = RevisionView.fromTree(rootB);
+            const delta = viewA.delta(viewB);
+            expect(delta.changed).deep.equals([rootId]);
+            expect(delta.removed.length).equals(2);
+            expect(delta.added.length).equals(2);
+            expect(delta.removed).contains(subtreeA.identifier);
+            expect(delta.removed).contains(leafA.identifier);
+            expect(delta.added).contains(subtreeB.identifier);
+            expect(delta.added).contains(leafB.identifier);
+        });
+        it('with different payloads', () => {
+            const rootId = testTree.generateNodeId();
+            const nodeA = {
+                identifier: rootId,
+                definition: 'node',
+                payload: 'test1',
+                traits: {},
+            };
+            const nodeB = {
+                identifier: rootId,
+                definition: 'node',
+                payload: 'test2',
+                traits: {},
+            };
+            const viewA = RevisionView.fromTree(nodeA);
+            const viewB = RevisionView.fromTree(nodeB);
+            const delta = viewA.delta(viewB);
+            expect(delta.changed).deep.equals([rootId]);
+            expect(delta.removed).deep.equals([]);
+            expect(delta.added).deep.equals([]);
+        });
+        it('after an insert', () => {
+            const viewA = testTree.view;
+            const insertedNode = testTree.buildLeaf(testTree.generateNodeId());
+            const treeB = {
+                identifier: testTree.identifier,
+                definition: testTree.definition,
+                traits: Object.assign(Object.assign({}, testTree.traits), { left: [insertedNode, testTree.left] }),
+            };
+            const viewB = RevisionView.fromTree(treeB);
+            const delta = viewA.delta(viewB);
+            expect(delta.changed).deep.equals([testTree.identifier]);
+            expect(delta.removed).deep.equals([]);
+            expect(delta.added).deep.equals([insertedNode.identifier]);
+        });
+        it('after a delete', () => {
+            const viewA = testTree.view;
+            const treeB = {
+                identifier: testTree.identifier,
+                definition: testTree.definition,
+                traits: Object.assign(Object.assign({}, testTree.traits), { left: [] }),
+            };
+            const viewB = RevisionView.fromTree(treeB);
+            const delta = viewA.delta(viewB);
+            expect(delta.changed).deep.equals([testTree.identifier]);
+            expect(delta.removed).deep.equals([testTree.left.identifier]);
+            expect(delta.added).deep.equals([]);
+        });
+        it('after a move', () => {
+            const viewA = testTree.view;
+            const treeB = {
+                identifier: testTree.identifier,
+                definition: testTree.definition,
+                traits: Object.assign(Object.assign({}, testTree.traits), { left: [], right: [testTree.right, testTree.left] }),
+            };
+            const viewB = RevisionView.fromTree(treeB);
+            const delta = viewA.delta(viewB);
+            expect(delta.changed).deep.equals([testTree.identifier]);
+            expect(delta.removed).deep.equals([]);
+            expect(delta.added).deep.equals([]);
+        });
+    });
+    it('correctly returns node parentage', () => {
+        const view = testTree.view;
+        for (const node of view) {
+            const parentNode = view.tryGetParentViewNode(node.identifier);
+            if (parentNode !== undefined) {
+                const parentage = expectDefined(node.parentage);
+                expect(parentage.label).to.equal(view.getTraitLabel(node.identifier));
+                expect(parentage.parent).to.equal(parentNode.identifier);
+            }
+        }
+    });
+});
+//# sourceMappingURL=TreeView.tests.js.map