@fluid-experimental/tree 0.58.2002 → 0.59.1000

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

@@ -0,0 +1 @@
+{"version":3,"file":"EditUtilities.tests.js","sourceRoot":"","sources":["../../src/test/EditUtilities.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,MAAM,8BAA8B,CAAC;AAEtD,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AAErE,OAAO,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAC;AAClE,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EACN,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,EACpB,qBAAqB,EACrB,yBAAyB,EACzB,mBAAmB,EACnB,mBAAmB,EACnB,QAAQ,GACR,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAA0C,IAAI,EAAY,MAAM,oBAAoB,CAAC;AAE5F,OAAO,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,0BAA0B,CAAC,IAAI,CAAC,CAAC;IAExF,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE,qBAAqB,CAAC,KAAK;gBACnC,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,cAAc,EAAE,QAAQ,CAAC,IAAI,CAAC,aAAa;gBAC3C,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;gBAC1C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,SAAS,EAAE,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,cAAc,EAAE;gBAC3C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,cAAc,EAAE,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,cAAc,EAAE;oBACf,MAAM,EAAE,QAAQ,CAAC,cAAc,EAAE;oBACjC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU;iBAC/B;gBACD,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,aAAa,EAAE,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,gBAAgB,EAAE,QAAQ,CAAC,UAAU;gBACrC,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,qBAAqB,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,cAAc,GAAG,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBACzD,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBACxE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACrE,CAAC,CAAC;YACH,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,cAAc,CAAC,MAAM,KAAK,yBAAyB,CAAC,KAAK,EAAE;gBAC9D,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACjF,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC5D,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACxD,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/E,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;gBAC1D,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACrD;iBAAM;gBACN,MAAM,CAAC,IAAI,EAAE,CAAC;aACd;QACF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;gBACvE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,yBAAyB,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACrD,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE;gBACxE,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,yBAAyB,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,KAAK,GAAG;gBACb,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,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,iDAAiD;gBACjD,KAAK;gBACL,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACrE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE;oBACP,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,KAAK;oBACZ,YAAY,EAAE,qBAAqB,CAAC,SAAS;iBAC7C;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG;gBACb,gBAAgB,EAAE,QAAQ,CAAC,cAAc,EAAE;gBAC3C,IAAI,EAAE,IAAI,CAAC,MAAM;aACjB,CAAC;YACF,MAAM,CACL,mBAAmB,CAAC,QAAQ,CAAC,IAAI,EAAE;gBAClC,KAAK;gBACL,GAAG,EAAE,EAAE,gBAAgB,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE;aACtE,CAAC,CACF,CAAC,IAAI,CAAC,MAAM,CAAC;gBACb,MAAM,EAAE;oBACP,IAAI,EAAE,yBAAyB,CAAC,QAAQ;oBACxC,KAAK,EAAE,KAAK;oBACZ,YAAY,EAAE,qBAAqB,CAAC,cAAc;iBAClD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,gBAAgB,CAAyB,qBAAqB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,mBACnG,IAAI,EACN,CAAC,CAAC;YACJ,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACtD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,MAAM,CACL,gBAAgB,CACf,EAAE,EACF,CAAC,CAAC,EAAE,EAAE;gBACL,SAAS,GAAG,IAAI,CAAC;gBACjB,OAAO,CAAC,CAAC;YACV,CAAC,EACD,QAAQ,CACR,CACD,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACf,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,SAAS,GAAG,MAAM,CAAC;YACzB,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,IAAI,mCACN,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAChD,OAAO,EAAE,SAAS,EAClB,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,GACrD,CAAC;YACF,MAAM,KAAK,GAAG,gBAAgB,CAAyB,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAM,IAAI,EAAG,CAAC,CAAC;YACtF,MAAM,CAAC,OAAO,KAAK,KAAK,QAAQ,EAAE,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,MAAM,IAAI,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,OAAO,EAAE,SAAS,GAAE,CAAC;YACtF,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,gBAAgB,CACf,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE;gBACL,SAAS,GAAG,IAAI,CAAC;gBACjB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAClD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC5C,OAAO,CAAC,CAAC;YACV,CAAC,EACD,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,IAAI,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,OAAO,EAAE,SAAS,GAAE,CAAC;YACtF,MAAM,EAAE,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,MAAoB,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC,EAClF,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;QAC1G,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,MAAM,IAAI,qBAAuB,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAE,CAAC;YACjF,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,QAAQ,CAAC,EACxC,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,wBAAwB,CAAC,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,MAAM,IAAI,mCAAmB,QAAQ,CAAC,SAAS,EAAE,KAAE,MAAM,EAAE,EAAE,IAAI,oBAAO,QAAQ,CAAC,SAAS,EAAE,CAAE,EAAE,GAAE,CAAC;YACnG,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,EAAE,QAAQ,CAAC,EACxC,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,wBAAwB,CAAC,CAAC;YAChE,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,OAAO,EAAE,GAAG,GAAE,CAAC;YAClF,MAAM,MAAM,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,OAAO,EAAE,GAAG,GAAE,CAAC;YAClF,MAAM,IAAI,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,GAAE,CAAC;YACtG,MAAM,SAAS,GAAG,gBAAgB,CAAyB,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzE,IAAI,IAAI,CAAC,UAAU,KAAK,MAAM,CAAC,UAAU,EAAE;oBAC1C,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;iBAClF;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE;wBAC1F,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE;qBAC1F;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,MAAM,UAAU,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,OAAO,EAAE,GAAG,GAAE,CAAC;YACtF,MAAM,KAAK,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,GAAE,CAAC;YACnG,MAAM,MAAM,mCAAQ,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,GAAE,CAAC;YAC/F,MAAM,SAAS,GAAG,gBAAgB,CAAyB,MAAM,EAAE,CAAC,IAAI,EAAE,EAAE;gBAC3E,IAAI,IAAI,CAAC,UAAU,KAAK,UAAU,CAAC,UAAU,EAAE;oBAC9C,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;iBAClF;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL;4BACC,UAAU,EAAE,KAAK,CAAC,UAAU;4BAC5B,UAAU,EAAE,KAAK,CAAC,UAAU;4BAC5B,MAAM,EAAE;gCACP,IAAI,EAAE;oCACL;wCACC,UAAU,EAAE,UAAU,CAAC,UAAU;wCACjC,UAAU,EAAE,UAAU,CAAC,UAAU;wCACjC,OAAO,EAAE,GAAG;wCACZ,MAAM,EAAE,EAAE;qCACV;iCACD;6BACD;yBACD;qBACD;iBACD;aACD,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC5C,0FAA0F;YAC1F,MAAM,UAAU,GAAkB;gBACjC,UAAU,EAAE,QAAQ;gBACpB,MAAM,EAAE;oBACP,IAAI,EAAE;wBACL,UAAU,EAAE,YAAY;wBACxB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,4BAA4B;6BACxC;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;6BAC9C;yBACD;qBACD;oBACD,KAAK,EAAE;wBACN,UAAU,EAAE,aAAa;wBACzB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,6BAA6B;6BACzC;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,8BAA8B;6BAC1C;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;6BAC/C;yBACD;qBACD;oBACD,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;qBACpC;iBACD;aACD,CAAC;YAEF,MAAM,UAAU,GAAkB;gBACjC,UAAU,EAAE,QAAQ;gBACpB,MAAM,EAAE;oBACP,KAAK,EAAE;wBACN,UAAU,EAAE,aAAa;wBACzB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;gCAC/C,EAAE,UAAU,EAAE,+BAA+B,EAAE;6BAC/C;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,8BAA8B;6BAC1C;yBACD;qBACD;oBACD,IAAI,EAAE;wBACL,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;wBACpC,EAAE,UAAU,EAAE,oBAAoB,EAAE;qBACpC;oBACD,IAAI,EAAE;wBACL,UAAU,EAAE,YAAY;wBACxB,MAAM,EAAE;4BACP,IAAI,EAAE;gCACL,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;gCAC9C,EAAE,UAAU,EAAE,8BAA8B,EAAE;6BAC9C;4BACD,KAAK,EAAE;gCACN,UAAU,EAAE,6BAA6B;6BACzC;4BACD,IAAI,EAAE;gCACL,UAAU,EAAE,4BAA4B;6BACxC;yBACD;qBACD;iBACD;aACD,CAAC;YAEF,wEAAwE;YACxE,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,QAAQ,CACP,UAAU,EACV,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,EACtC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CACzC,CAAC;YAEF,MAAM,YAAY,GAAa,EAAE,CAAC;YAClC,QAAQ,CACP,UAAU,EACV,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,EACtC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CACzC,CAAC;YAEF,oGAAoG;YACpG,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC9D,MAAM,IAAI,mCACN,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAChD,MAAM,EAAE,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE,GACjE,CAAC;YACD,IAAqC,CAAC,KAAK,GAAG,8CAA8C,CAAC;YAC9F,MAAM,SAAS,GAAG,gBAAgB,CACjC,IAAI,EACJ,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAC9C,QAAQ,CACR,CAAC;YACF,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,MAAM,EAAE,IAAI,CAAC,MAAM;aACnB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC7D,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;YAC1E,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;YACnG,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QAChF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,SAAS,QAAQ,CAAC,IAAsB;QACvC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC;IACjC,CAAC;IAED,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAChC,MAAM,UAAU,GAAoB,IAAI,eAAe,CACtD,IAAI,yBAAyB,EAAE,CAAC,mBAAmB,EACnD,GAAG,EAAE,GAAE,CAAC,CACR,CAAC;QACF,MAAM,MAAM,GAAiB,EAAE,IAAI,EAAE,IAAI,EAA6B,CAAC;QAEvE,IAAK,QAIJ;QAJD,WAAK,QAAQ;YACZ,yCAAK,CAAA;YACL,6CAAO,CAAA;YACP,qDAAW,CAAA;QACZ,CAAC,EAJI,QAAQ,KAAR,QAAQ,QAIZ;QAED,SAAS,aAAa,CAAC,KAAc,EAAE,QAAkB;YACxD,IAAI,QAAQ,KAAK,QAAQ,CAAC,WAAW,EAAE;gBACtC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,KAAK,QAAQ,CAAC,KAAK,CAAC,CAAC;aAClD;QACF,CAAC;QAED,SAAS,KAAK,CACb,CAAU,EACV,CAAU,EACV,KAA+F;YAE/F,kBAAkB;YAClB,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1C,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAE1C,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YACpD,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAEpD,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACxE,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,GAAG,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YAExE,aAAa,CAAC,OAAO,KAAK,OAAO,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;YACrD,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;YACjF,oBAAoB;YACpB,aAAa,CAAC,eAAe,CAAC,aAAa,EAAE,aAAa,CAAC,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QAClF,CAAC;QAED,SAAS,kBAAkB,CAAC,CAAU,EAAE,SAAmB;YAC1D,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAClD,MAAM,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAChC,aAAa,CAAC,eAAe,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;YAEjD,kDAAkD;YAClD,MAAM,EAAE,GAAY,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,CAAC,eAAe,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAErC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,QAAQ,GAAG;YAChB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,KAAK;YAC1B,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,gGAAgG;QAChG,MAAM,gBAAgB,GAAG;YACxB,OAAO,EAAE,QAAQ,CAAC,KAAK;YACvB,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,MAAM,UAAU,GAAG;YAClB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,KAAK;SACzB,CAAC;QAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtB,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;YAC7B,0FAA0F;YAC1F,0GAA0G;YAC1G,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC5B,KAAK,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5B,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,QAAQ,CAAC,CAAC;YAC5D,KAAK,CAAC,oBAAoB,EAAE,oBAAoB,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC1B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC9B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,QAAQ,CAAC,CAAC;YACxC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAC1C,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YACzC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACtC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;YAClC,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAClD,KAAK,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,UAAU,CAAC,CAAC;YAElD,iDAAiD;YACjD,qFAAqF;YACrF,gGAAgG;YAChG,KAAK,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,gBAAgB,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YACjC,+EAA+E;YAC/E,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;YAChC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;YAC1B,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;YAC3B,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,MAAM,SAAS,GAAG;YACjB,OAAO,EAAE,QAAQ,CAAC,WAAW;YAC7B,UAAU,EAAE,QAAQ,CAAC,WAAW;YAChC,YAAY,EAAE,QAAQ,CAAC,KAAK;YAC5B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QACF,MAAM,cAAc,GAAG;YACtB,OAAO,EAAE,QAAQ,CAAC,OAAO;YACzB,UAAU,EAAE,QAAQ,CAAC,OAAO;YAC5B,YAAY,EAAE,QAAQ,CAAC,OAAO;YAC9B,SAAS,EAAE,QAAQ,CAAC,WAAW;SAC/B,CAAC;QAEF,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB,yEAAyE;YACzE,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC,CAAC;YACrD,KAAK,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YAEvC,+BAA+B;YAC/B,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;YAC3B,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;YAC9B,KAAK,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACrC,KAAK,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACtC,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;YAElC,8BAA8B;YAC9B,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3B,4EAA4E;YAC5E,SAAS,cAAc,CAAC,IAAY;gBACnC,qEAAqE;gBACrE,MAAM,YAAY,GAAG,EAAE,YAAY,EAAE,IAAI,IAAI,EAAE,EAAE,YAAY,EAAE,SAAoB,EAAE,CAAC;gBACtF,YAAY,CAAC,YAAY,GAAG,YAAY,CAAC;gBACzC,OAAO,YAA4B,CAAC;YACrC,CAAC;YACD,qHAAqH;YACrH,wCAAwC;YACxC,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;YAClE,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;YAC5D,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,gHAAgH;QAChH,kHAAkH;QAClH,EAAE,CAAC,IAAI,CAAC,eAAe,EAAE,GAAG,EAAE;YAC7B,2CAA2C;YAC3C,gFAAgF;YAChF,KAAK,CAAC,SAAS,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { assert } from '@fluidframework/common-utils';\nimport { IFluidHandle } from '@fluidframework/core-interfaces';\nimport { MockFluidDataStoreRuntime } from '@fluidframework/test-runtime-utils';\nimport { FluidSerializer } from '@fluidframework/shared-object-base';\nimport { Definition, NodeId } from '../Identifiers';\nimport { getChangeNodeFromView } from '../SerializationUtilities';\nimport { noop } from '../Common';\nimport {\n\tconvertTreeNodes,\n\tdeepCompareNodes,\n\tinternalizeBuildNode,\n\tPlaceValidationResult,\n\tRangeValidationResultKind,\n\tvalidateStablePlace,\n\tvalidateStableRange,\n\twalkTree,\n} from '../EditUtilities';\nimport { BuildNodeInternal, ChangeNode, Payload, Side, TreeNode } from '../persisted-types';\nimport { BuildNode, BuildTreeNode } from '../ChangeTypes';\nimport { comparePayloads } from '../PayloadUtilities';\nimport { refreshTestTree } from './utilities/TestUtilities';\n\ndescribe('EditUtilities', () => {\n\tconst testTree = refreshTestTree(undefined, undefined, /* expensiveValidation: */ true);\n\n\tdescribe('validateStablePlace', () => {\n\t\tit('accepts valid places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\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).deep.equals({\n\t\t\t\tresult: PlaceValidationResult.Valid,\n\t\t\t\treferenceSibling: testTree.left.identifier,\n\t\t\t\tside: Side.Before,\n\t\t\t});\n\t\t});\n\n\t\tit('detects malformed places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceTrait: testTree.left.traitLocation,\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).deep.equals({ result: PlaceValidationResult.Malformed });\n\t\t});\n\n\t\tit('detects missing siblings', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceSibling: testTree.generateNodeId(),\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.MissingSibling });\n\t\t});\n\n\t\tit('detects missing parents', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceTrait: {\n\t\t\t\t\t\tparent: testTree.generateNodeId(),\n\t\t\t\t\t\tlabel: testTree.left.traitLabel,\n\t\t\t\t\t},\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.MissingParent });\n\t\t});\n\n\t\tit('detects root places', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStablePlace(testTree.view, {\n\t\t\t\t\treferenceSibling: testTree.identifier,\n\t\t\t\t\tside: Side.Before,\n\t\t\t\t})\n\t\t\t).deep.equals({ result: PlaceValidationResult.SiblingIsRootOrDetached });\n\t\t});\n\t});\n\n\tdescribe('validateStableRange', () => {\n\t\tit('accepts valid ranges', () => {\n\t\t\tconst validatedRange = validateStableRange(testTree.view, {\n\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t});\n\t\t\texpect(validatedRange.result).to.equal(RangeValidationResultKind.Valid);\n\t\t\tif (validatedRange.result === RangeValidationResultKind.Valid) {\n\t\t\t\texpect(validatedRange.start.referenceSibling).to.equal(testTree.left.identifier);\n\t\t\t\texpect(validatedRange.start.referenceTrait).to.be.undefined;\n\t\t\t\texpect(validatedRange.start.side).to.equal(Side.Before);\n\t\t\t\texpect(validatedRange.end.referenceSibling).to.equal(testTree.left.identifier);\n\t\t\t\texpect(validatedRange.end.referenceTrait).to.be.undefined;\n\t\t\t\texpect(validatedRange.end.side).to.equal(Side.After);\n\t\t\t} else {\n\t\t\t\texpect.fail();\n\t\t\t}\n\t\t});\n\n\t\tit('detects inverted ranges', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\t})\n\t\t\t).deep.equals({ result: RangeValidationResultKind.Inverted });\n\t\t});\n\n\t\tit('detects when place are in different traits', () => {\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart: { referenceSibling: testTree.left.identifier, side: Side.Before },\n\t\t\t\t\tend: { referenceSibling: testTree.right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({ result: RangeValidationResultKind.PlacesInDifferentTraits });\n\t\t});\n\n\t\tit('detects malformed places', () => {\n\t\t\tconst start = {\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\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\t// trait and sibling should be mutually exclusive\n\t\t\t\t\tstart,\n\t\t\t\t\tend: { referenceSibling: testTree.left.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({\n\t\t\t\tresult: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: start,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.Malformed,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('detects invalid places', () => {\n\t\t\tconst start = {\n\t\t\t\treferenceSibling: testTree.generateNodeId(),\n\t\t\t\tside: Side.Before,\n\t\t\t};\n\t\t\texpect(\n\t\t\t\tvalidateStableRange(testTree.view, {\n\t\t\t\t\tstart,\n\t\t\t\t\tend: { referenceSibling: testTree.right.identifier, side: Side.After },\n\t\t\t\t})\n\t\t\t).deep.equals({\n\t\t\t\tresult: {\n\t\t\t\t\tkind: RangeValidationResultKind.BadPlace,\n\t\t\t\t\tplace: start,\n\t\t\t\t\tplaceFailure: PlaceValidationResult.MissingSibling,\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe('Tree node conversion', () => {\n\t\tit('can clone a tree', () => {\n\t\t\tconst clone = convertTreeNodes<ChangeNode, ChangeNode>(getChangeNodeFromView(testTree.view), (node) => ({\n\t\t\t\t...node,\n\t\t\t}));\n\t\t\texpect(testTree).to.not.equal(clone);\n\t\t\texpect(deepCompareNodes(testTree, clone)).to.be.true;\n\t\t});\n\n\t\tit('can clone a leaf', () => {\n\t\t\tlet converted = false;\n\t\t\texpect(\n\t\t\t\tconvertTreeNodes(\n\t\t\t\t\t42,\n\t\t\t\t\t(n) => {\n\t\t\t\t\t\tconverted = true;\n\t\t\t\t\t\treturn n;\n\t\t\t\t\t},\n\t\t\t\t\tisNumber\n\t\t\t\t)\n\t\t\t).to.equal(42);\n\t\t\texpect(converted).to.be.false;\n\t\t});\n\n\t\tit('can clone a tree with a leaf', () => {\n\t\t\tconst leafTrait = 'main';\n\t\t\tconst leafId = testTree.generateNodeId();\n\t\t\tconst tree = {\n\t\t\t\t...testTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\tpayload: 'payload',\n\t\t\t\ttraits: { [leafTrait]: [testTree.buildLeaf(leafId)] },\n\t\t\t};\n\t\t\tconst clone = convertTreeNodes<ChangeNode, ChangeNode>(tree, (node) => ({ ...node }));\n\t\t\tassert(typeof clone !== 'number', '');\n\t\t\texpect(clone.definition).to.equal(tree.definition);\n\t\t\texpect(clone.identifier).to.equal(tree.identifier);\n\t\t\texpect(clone.payload).to.equal(tree.payload);\n\t\t\texpect(clone.traits[leafTrait][0].identifier).to.equal(leafId);\n\t\t});\n\n\t\tit('correctly invokes the convert function', () => {\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };\n\t\t\tlet converted = false;\n\t\t\tconvertTreeNodes(\n\t\t\t\tnode,\n\t\t\t\t(n) => {\n\t\t\t\t\tconverted = true;\n\t\t\t\t\texpect(node.definition).to.equal(node.definition);\n\t\t\t\t\texpect(node.identifier).to.equal(node.identifier);\n\t\t\t\t\texpect(node.payload).to.equal(node.payload);\n\t\t\t\t\treturn n;\n\t\t\t\t},\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.be.true;\n\t\t});\n\n\t\tit('can convert a node', () => {\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'payload' };\n\t\t\tconst id = testTree.generateNodeId();\n\t\t\tconst converted = convertTreeNodes(\n\t\t\t\tnode,\n\t\t\t\t(_) => ({ definition: '_def' as Definition, identifier: id, payload: 'payload2' }),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.deep.equal({ definition: '_def', identifier: id, payload: 'payload2', traits: {} });\n\t\t});\n\n\t\tit('creates empty trait objects for the root', () => {\n\t\t\tconst node: BuildTreeNode = { ...testTree.buildLeaf(testTree.generateNodeId()) };\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(n) => internalizeBuildNode(n, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\tassert(typeof converted !== 'number', 'unexpected detached ID');\n\t\t\texpect(converted.traits).to.not.be.undefined;\n\t\t});\n\n\t\tit('creates empty trait objects for children', () => {\n\t\t\tconst node: BuildNode = { ...testTree.buildLeaf(), traits: { main: { ...testTree.buildLeaf() } } };\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(n) => internalizeBuildNode(n, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\tassert(typeof converted !== 'number', 'unexpected detached ID');\n\t\t\texpect(converted.traits).to.not.be.undefined;\n\t\t});\n\n\t\tit('can convert a tree with children', () => {\n\t\t\tconst childA = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'a' };\n\t\t\tconst childB = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'b' };\n\t\t\tconst node = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [childA, childB] } };\n\t\t\tconst converted = convertTreeNodes<ChangeNode, ChangeNode>(node, (node) => {\n\t\t\t\tif (node.identifier === childB.identifier) {\n\t\t\t\t\treturn { definition: node.definition, identifier: node.identifier, payload: 'c' };\n\t\t\t\t}\n\t\t\t\treturn node;\n\t\t\t});\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t\ttraits: {\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{ definition: childA.definition, identifier: childA.identifier, payload: 'a', traits: {} },\n\t\t\t\t\t\t{ definition: childB.definition, identifier: childB.identifier, payload: 'c', traits: {} },\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('can convert a tree with a grandchild', () => {\n\t\t\tconst grandchild = { ...testTree.buildLeaf(testTree.generateNodeId()), payload: 'g' };\n\t\t\tconst child = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [grandchild] } };\n\t\t\tconst parent = { ...testTree.buildLeaf(testTree.generateNodeId()), traits: { main: [child] } };\n\t\t\tconst converted = convertTreeNodes<ChangeNode, ChangeNode>(parent, (node) => {\n\t\t\t\tif (node.identifier === grandchild.identifier) {\n\t\t\t\t\treturn { definition: node.definition, identifier: node.identifier, payload: 'h' };\n\t\t\t\t}\n\t\t\t\treturn node;\n\t\t\t});\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: parent.definition,\n\t\t\t\tidentifier: parent.identifier,\n\t\t\t\ttraits: {\n\t\t\t\t\tmain: [\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tdefinition: child.definition,\n\t\t\t\t\t\t\tidentifier: child.identifier,\n\t\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\t\tdefinition: grandchild.definition,\n\t\t\t\t\t\t\t\t\t\tidentifier: grandchild.identifier,\n\t\t\t\t\t\t\t\t\t\tpayload: 'h',\n\t\t\t\t\t\t\t\t\t\ttraits: {},\n\t\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t});\n\t\t});\n\n\t\tit('walks trees in a consistent order', () => {\n\t\t\t// Construct two trees that are the same but have their traits defined in different orders\n\t\t\tconst buildTreeA: BuildTreeNode = {\n\t\t\t\tdefinition: 'parent',\n\t\t\t\ttraits: {\n\t\t\t\t\tleft: {\n\t\t\t\t\t\tdefinition: 'left child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under left main' },\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\tright: {\n\t\t\t\t\t\tdefinition: 'right child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under right main' },\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\tmain: [\n\t\t\t\t\t\t{ definition: 'child A under main' },\n\t\t\t\t\t\t{ definition: 'child B under main' },\n\t\t\t\t\t\t{ definition: 'child C under main' },\n\t\t\t\t\t],\n\t\t\t\t},\n\t\t\t};\n\n\t\t\tconst buildTreeB: BuildTreeNode = {\n\t\t\t\tdefinition: 'parent',\n\t\t\t\ttraits: {\n\t\t\t\t\tright: {\n\t\t\t\t\t\tdefinition: 'right child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under right',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under right main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under right main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under right',\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\tmain: [\n\t\t\t\t\t\t{ definition: 'child A under main' },\n\t\t\t\t\t\t{ definition: 'child B under main' },\n\t\t\t\t\t\t{ definition: 'child C under main' },\n\t\t\t\t\t],\n\t\t\t\t\tleft: {\n\t\t\t\t\t\tdefinition: 'left child',\n\t\t\t\t\t\ttraits: {\n\t\t\t\t\t\t\tmain: [\n\t\t\t\t\t\t\t\t{ definition: 'grandchild A under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild B under left main' },\n\t\t\t\t\t\t\t\t{ definition: 'grandchild C under left main' },\n\t\t\t\t\t\t\t],\n\t\t\t\t\t\t\tright: {\n\t\t\t\t\t\t\t\tdefinition: 'right grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\tleft: {\n\t\t\t\t\t\t\t\tdefinition: 'left grandchild under left',\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t},\n\t\t\t\t\t},\n\t\t\t\t},\n\t\t\t};\n\n\t\t\t// Record the order in which the tree walk visits each node in each tree\n\t\t\tconst definitionsA: string[] = [];\n\t\t\twalkTree<BuildTreeNode, number>(\n\t\t\t\tbuildTreeA,\n\t\t\t\t(n) => definitionsA.push(n.definition),\n\t\t\t\t(x): x is number => typeof x === 'number'\n\t\t\t);\n\n\t\t\tconst definitionsB: string[] = [];\n\t\t\twalkTree<BuildTreeNode, number>(\n\t\t\t\tbuildTreeB,\n\t\t\t\t(n) => definitionsB.push(n.definition),\n\t\t\t\t(x): x is number => typeof x === 'number'\n\t\t\t);\n\n\t\t\t// The orders should be the same, even though the trees had their traits defined in different orders\n\t\t\texpect(definitionsA).to.deep.equal(definitionsB);\n\t\t});\n\t});\n\n\tdescribe('Build tree internalization', () => {\n\t\tit('does not copy extraneous properties from input tree', () => {\n\t\t\tconst node: BuildTreeNode = {\n\t\t\t\t...testTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\ttraits: { main: [testTree.buildLeaf(testTree.generateNodeId())] },\n\t\t\t};\n\t\t\t(node as unknown as { extra: string }).extra = 'This is extra data that should not be copied';\n\t\t\tconst converted = convertTreeNodes<BuildTreeNode, TreeNode<BuildNodeInternal, NodeId>, number>(\n\t\t\t\tnode,\n\t\t\t\t(node) => internalizeBuildNode(node, testTree),\n\t\t\t\tisNumber\n\t\t\t);\n\t\t\texpect(converted).to.deep.equal({\n\t\t\t\tdefinition: node.definition,\n\t\t\t\tidentifier: node.identifier,\n\t\t\t\ttraits: node.traits,\n\t\t\t});\n\t\t});\n\n\t\tit('does not copy extraneous properties from converter', () => {\n\t\t\tconst node = testTree.buildLeaf(testTree.generateNodeId());\n\t\t\texpect(Object.prototype.hasOwnProperty.call(node, 'payload')).to.be.false;\n\t\t\tconst converted = convertTreeNodes(node, (node) => internalizeBuildNode(node, testTree), isNumber);\n\t\t\texpect(Object.prototype.hasOwnProperty.call(converted, 'payload')).to.be.false;\n\t\t});\n\t});\n\n\tfunction isNumber(node: number | unknown): node is number {\n\t\treturn typeof node === 'number';\n\t}\n\n\tdescribe('comparePayloads', () => {\n\t\tconst serializer: FluidSerializer = new FluidSerializer(\n\t\t\tnew MockFluidDataStoreRuntime().IFluidHandleContext,\n\t\t\t() => {}\n\t\t);\n\t\tconst binder: IFluidHandle = { bind: noop } as unknown as IFluidHandle;\n\n\t\tenum Equality {\n\t\t\tEqual,\n\t\t\tUnequal,\n\t\t\tUnspecified,\n\t\t}\n\n\t\tfunction checkEquality(equal: boolean, equality: Equality): void {\n\t\t\tif (equality !== Equality.Unspecified) {\n\t\t\t\texpect(equal).equals(equality === Equality.Equal);\n\t\t\t}\n\t\t}\n\n\t\tfunction check(\n\t\t\ta: Payload,\n\t\t\tb: Payload,\n\t\t\tflags: { initial: Equality; serialized: Equality; deserialized: Equality; roundtrip: Equality }\n\t\t): void {\n\t\t\t// Check reflexive\n\t\t\texpect(comparePayloads(a, a)).equal(true);\n\t\t\texpect(comparePayloads(b, b)).equal(true);\n\n\t\t\tcheckEquality(comparePayloads(a, b), flags.initial);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(b, a), flags.initial);\n\n\t\t\tconst [aString, aDeserialized] = checkSerialization(a, flags.roundtrip);\n\t\t\tconst [bString, bDeserialized] = checkSerialization(b, flags.roundtrip);\n\n\t\t\tcheckEquality(aString === bString, flags.serialized);\n\t\t\tcheckEquality(comparePayloads(aDeserialized, bDeserialized), flags.deserialized);\n\t\t\t// Check commutative\n\t\t\tcheckEquality(comparePayloads(bDeserialized, aDeserialized), flags.deserialized);\n\t\t}\n\n\t\tfunction checkSerialization(a: Payload, roundtrip: Equality): [string, Payload] {\n\t\t\tconst aString = serializer.stringify(a, binder);\n\t\t\tconst a2: Payload = serializer.parse(aString);\n\t\t\tconst aString2 = serializer.stringify(a2, binder);\n\t\t\texpect(aString2).equal(aString);\n\t\t\tcheckEquality(comparePayloads(a, a2), roundtrip);\n\n\t\t\t// Check second round trip, should always be equal\n\t\t\tconst a3: Payload = serializer.parse(aString2);\n\t\t\texpect(comparePayloads(a3, a2)).true;\n\n\t\t\treturn [aString, a2];\n\t\t}\n\n\t\tconst allEqual = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Equal,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\t// For when the inputs are logically equal, but may serialize differently due to field ordering.\n\t\tconst allEqualUnstable = {\n\t\t\tinitial: Equality.Equal,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tconst allUnequal = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Equal,\n\t\t};\n\n\t\tit('compares numbers correctly', () => {\n\t\t\tcheck(0, 0, allEqual);\n\t\t\tcheck(1, 1, allEqual);\n\t\t\tcheck(0, 1, allUnequal);\n\t\t\tcheck(-1, 1, allUnequal);\n\t\t\tcheck(5.2, 5.200000001, allUnequal);\n\t\t});\n\n\t\tit('compares strings', () => {\n\t\t\tcheck('', '', allEqual);\n\t\t\tcheck(' ', '', allUnequal);\n\t\t\tcheck('1', '+1', allUnequal);\n\t\t\t// This character makes sure multi-byte utf-8 and multi-word utf-16 at least somewhat work\n\t\t\t// Cases like unicode normalization are not covered here here. Normalization or not will be considered ok.\n\t\t\tcheck('𤭢', '𤭢', allEqual);\n\t\t\tcheck('𤭢', '', allUnequal);\n\t\t\tcheck('several characters', 'several characters', allEqual);\n\t\t\tcheck('several characters', 'several_characters', allUnequal);\n\t\t});\n\n\t\tit('compares arrays', () => {\n\t\t\tcheck([], [], allEqual);\n\t\t\tcheck([1], [1], allEqual);\n\t\t\tcheck([[1]], [[1]], allEqual);\n\t\t\tcheck([[1]], [[2]], allUnequal);\n\t\t\tcheck([], [1], allUnequal);\n\t\t\tcheck([1, 2], [2, 1], allUnequal);\n\t\t});\n\n\t\tit('compares objects', () => {\n\t\t\tcheck({ 1: 'x' }, { 1: 'x' }, allEqual);\n\t\t\tcheck({ x: 'x' }, { y: 'x' }, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: {} }, allUnequal);\n\t\t\tcheck({ x: {} }, { x: {} }, allEqual);\n\t\t\tcheck({ x: [1, 2, 3, 5] }, { x: [1, 2, 3, 4] }, allUnequal);\n\t\t\tcheck({ 1: 'x' }, {}, allUnequal);\n\t\t\tcheck({ x: 'x' }, { x: 'x', y: 'x' }, allUnequal);\n\t\t\tcheck({ field: 'a' }, { field: 'b' }, allUnequal);\n\n\t\t\t// Fluid Serialization arbitrarily orders fields.\n\t\t\t// Thus any object with more than one field may have non-deterministic serialization.\n\t\t\t// However objects have field order, and we need to check comparePayloads is not impacted by it.\n\t\t\tcheck({ y: 'a', x: 'b' }, { x: 'b', y: 'a' }, allEqualUnstable);\n\t\t});\n\n\t\tit('compares mixed types', () => {\n\t\t\tcheck({ 0: 1 }, [1], allUnequal);\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface)\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(null, 'null', allUnequal);\n\t\t\tcheck(1, '1', allUnequal);\n\t\t\tcheck(null, 0, allUnequal);\n\t\t\tcheck('', 0, allUnequal);\n\t\t});\n\n\t\tconst sameAfter = {\n\t\t\tinitial: Equality.Unspecified,\n\t\t\tserialized: Equality.Unspecified,\n\t\t\tdeserialized: Equality.Equal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\t\tconst differentAfter = {\n\t\t\tinitial: Equality.Unequal,\n\t\t\tserialized: Equality.Unequal,\n\t\t\tdeserialized: Equality.Unequal,\n\t\t\troundtrip: Equality.Unspecified,\n\t\t};\n\n\t\tit('lossy cases', () => {\n\t\t\t// Undefined fields are omitted in json, and thus lost on the round trip.\n\t\t\tcheck({ x: undefined }, { y: undefined }, sameAfter);\n\t\t\tcheck({ x: undefined }, {}, sameAfter);\n\n\t\t\t// NaN and Infinity become null\n\t\t\tcheck(NaN, NaN, sameAfter);\n\t\t\tcheck(NaN, 7, differentAfter);\n\t\t\tcheck(Infinity, Infinity, sameAfter);\n\t\t\tcheck(-Infinity, Infinity, sameAfter);\n\t\t\tcheck(NaN, 'NaN', differentAfter);\n\n\t\t\t// json loses -0 on round trip\n\t\t\tcheck(-0, -0, sameAfter);\n\t\t});\n\n\t\tit('compares handles', () => {\n\t\t\t// This is used instead of MockHandle so equal handles compare deeply equal.\n\t\t\tfunction makeMockHandle(data: string): IFluidHandle {\n\t\t\t\t// `/` prefix is needed to prevent serializing from modifying handle.\n\t\t\t\tconst handleObject = { absolutePath: `/${data}`, IFluidHandle: undefined as unknown };\n\t\t\t\thandleObject.IFluidHandle = handleObject;\n\t\t\t\treturn handleObject as IFluidHandle;\n\t\t\t}\n\t\t\t// Theoretically handles serialize as objects with 2 fields and thus serialization is allowed to be non-deterministic\n\t\t\t// so use allEqualUnstable not allEqual.\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('x'), allEqualUnstable);\n\t\t\tcheck(makeMockHandle('x'), makeMockHandle('y'), allUnequal);\n\t\t\tcheck({ x: makeMockHandle('x') }, makeMockHandle('x'), allUnequal);\n\t\t});\n\n\t\t// These are cases that are allowed by the type system and produce unexpected results due to Json serialization.\n\t\t// Clear documentation and/or adjustments to equality, type checking or serialization would help with these cases.\n\t\tit.skip('strange cases', () => {\n\t\t\t// Top level undefined fails in JSON.parse.\n\t\t\t// Rationale: 'undefined' is reserved for future use (see 'SetValue' interface.)\n\t\t\tcheck(undefined, null, sameAfter);\n\t\t});\n\t});\n});\n"]}

package/lib/test/Forest.perf.tests.d.ts

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

package/lib/test/Forest.perf.tests.d.ts.map

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

package/lib/test/Forest.perf.tests.js

@@ -0,0 +1,133 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
+import { v4 } from 'uuid';
+import { assert } from '../Common';
+import { Forest } from '../Forest';
+import { RevisionView } from '../RevisionView';
+import { Side } from '../persisted-types';
+import { refreshTestTree } from './utilities/TestUtilities';
+describe('Forest Perf', () => {
+    const testTree = refreshTestTree();
+    for (const count of [100, 1000, 10000, 100000]) {
+        // Pick a single representative size for the 'Measurement' suite to keep it small.
+        const type = count === 10000 ? BenchmarkType.Measurement : BenchmarkType.Perspective;
+        benchmark({
+            type,
+            title: `${count} random inserts in TreeView`,
+            benchmarkFn: () => {
+                buildRandomTree(testTree, count);
+            },
+        });
+        let built;
+        let rootId;
+        benchmark({
+            type,
+            title: `walk ${count} node TreeView`,
+            before: () => {
+                [built, rootId] = buildRandomTree(testTree, count);
+            },
+            benchmarkFn: () => {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                const nodes = walk(built, rootId);
+                assert(nodes === count);
+            },
+            after: () => {
+                built = undefined;
+                rootId = undefined;
+            },
+        });
+        let forest;
+        let nodes;
+        benchmark({
+            type,
+            title: `insert ${count} nodes into Forest`,
+            before: () => {
+                forest = Forest.create(true);
+                nodes = [];
+                for (let i = 0; i < count; i++) {
+                    nodes.push(makeTestForestNode(testTree));
+                }
+            },
+            benchmarkFn: () => {
+                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                forest.add(nodes);
+            },
+            after: () => {
+                forest = undefined;
+            },
+        });
+        let otherForest;
+        for (const otherCount of [100, 1000, 10000, 100000]) {
+            benchmark({
+                type,
+                title: `invoke delta on Forest with ${count} nodes against Forest with ${otherCount} nodes`,
+                before: () => {
+                    forest = Forest.create(true);
+                    otherForest = Forest.create(true);
+                    nodes = [];
+                    for (let i = 0; i < count; i++) {
+                        nodes.push(makeTestForestNode(testTree));
+                    }
+                    forest = forest.add(nodes);
+                    const otherNodes = [];
+                    for (let i = 0; i < otherCount; i++) {
+                        otherNodes.push(makeTestForestNode(testTree));
+                    }
+                    otherForest = otherForest.add(otherNodes);
+                },
+                benchmarkFn: () => {
+                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+                    forest.delta(otherForest);
+                },
+                after: () => {
+                    forest = undefined;
+                    otherForest = undefined;
+                },
+            });
+        }
+    }
+});
+function walk(s, id) {
+    let count = 1;
+    const n = s.getViewNode(id);
+    for (const [_label, v] of n.traits.entries()) {
+        for (const child of v) {
+            count += walk(s, child);
+        }
+    }
+    return count;
+}
+function buildRandomTree(testTree, size) {
+    function getId() {
+        return testTree.generateNodeId();
+    }
+    function getLabel() {
+        return v4();
+    }
+    const rootId = getId();
+    const root = { traits: {}, definition: v4(), identifier: rootId };
+    const ids = [rootId];
+    let f = RevisionView.fromTree(root).openForTransaction();
+    for (let i = 1; i < size; i++) {
+        const label = getLabel();
+        const def = v4();
+        const id = getId();
+        const newNode = {
+            identifier: id,
+            definition: def,
+            traits: new Map(),
+        };
+        f = f.addNodes([newNode]);
+        const parent = ids[Math.floor(Math.random() * ids.length)];
+        f = f.attachRange([id], { trait: { parent, label }, side: Side.Before });
+        ids.push(id);
+    }
+    return [f.close(), rootId];
+}
+function makeTestForestNode(testTree) {
+    return Object.assign(Object.assign({}, testTree.buildLeaf(testTree.generateNodeId())), { traits: new Map() });
+}
+//# sourceMappingURL=Forest.perf.tests.js.map

package/lib/test/Forest.perf.tests.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Forest.perf.tests.js","sourceRoot":"","sources":["../../src/test/Forest.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAE1B,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAEnC,OAAO,EAAE,MAAM,EAAc,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAc,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAGtD,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,EAAE,IAAK,EAAE,KAAM,EAAE,MAAO,CAAC,EAAE;QAClD,kFAAkF;QAClF,MAAM,IAAI,GAAG,KAAK,KAAK,KAAM,CAAC,CAAC,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,aAAa,CAAC,WAAW,CAAC;QAEtF,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,GAAG,KAAK,6BAA6B;YAC5C,WAAW,EAAE,GAAG,EAAE;gBACjB,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YAClC,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,KAA+B,CAAC;QACpC,IAAI,MAA0B,CAAC;QAC/B,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,QAAQ,KAAK,gBAAgB;YACpC,MAAM,EAAE,GAAG,EAAE;gBACZ,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,eAAe,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACpD,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAM,EAAE,MAAO,CAAC,CAAC;gBACpC,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;YACzB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACX,KAAK,GAAG,SAAS,CAAC;gBAClB,MAAM,GAAG,SAAS,CAAC;YACpB,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,MAA0B,CAAC;QAC/B,IAAI,KAAmB,CAAC;QACxB,SAAS,CAAC;YACT,IAAI;YACJ,KAAK,EAAE,UAAU,KAAK,oBAAoB;YAC1C,MAAM,EAAE,GAAG,EAAE;gBACZ,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC7B,KAAK,GAAG,EAAE,CAAC;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;oBAC/B,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;iBACzC;YACF,CAAC;YACD,WAAW,EAAE,GAAG,EAAE;gBACjB,oEAAoE;gBACpE,MAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;YACD,KAAK,EAAE,GAAG,EAAE;gBACX,MAAM,GAAG,SAAS,CAAC;YACpB,CAAC;SACD,CAAC,CAAC;QAEH,IAAI,WAA+B,CAAC;QACpC,KAAK,MAAM,UAAU,IAAI,CAAC,GAAG,EAAE,IAAK,EAAE,KAAM,EAAE,MAAO,CAAC,EAAE;YACvD,SAAS,CAAC;gBACT,IAAI;gBACJ,KAAK,EAAE,+BAA+B,KAAK,8BAA8B,UAAU,QAAQ;gBAC3F,MAAM,EAAE,GAAG,EAAE;oBACZ,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC7B,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAClC,KAAK,GAAG,EAAE,CAAC;oBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;wBAC/B,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;qBACzC;oBACD,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAE3B,MAAM,UAAU,GAAiB,EAAE,CAAC;oBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE;wBACpC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;qBAC9C;oBACD,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC3C,CAAC;gBACD,WAAW,EAAE,GAAG,EAAE;oBACjB,oEAAoE;oBACpE,MAAO,CAAC,KAAK,CAAC,WAAY,CAAC,CAAC;gBAC7B,CAAC;gBACD,KAAK,EAAE,GAAG,EAAE;oBACX,MAAM,GAAG,SAAS,CAAC;oBACnB,WAAW,GAAG,SAAS,CAAC;gBACzB,CAAC;aACD,CAAC,CAAC;SACH;KACD;AACF,CAAC,CAAC,CAAC;AAEH,SAAS,IAAI,CAAC,CAAe,EAAE,EAAU;IACxC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAC5B,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE;QAC7C,KAAK,MAAM,KAAK,IAAI,CAAC,EAAE;YACtB,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;SACxB;KACD;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,eAAe,CAAC,QAAkB,EAAE,IAAY;IACxD,SAAS,KAAK;QACb,OAAO,QAAQ,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IAED,SAAS,QAAQ;QAChB,OAAO,EAAE,EAAgB,CAAC;IAC3B,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,EAAE,CAAC;IACvB,MAAM,IAAI,GAAe,EAAE,MAAM,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAgB,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;IAC5F,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,IAAI,CAAC,GAAG,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,kBAAkB,EAAE,CAAC;IAEzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAe,EAAE,EAAgB,CAAC;QAC3C,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;QAEnB,MAAM,OAAO,GAAiB;YAC7B,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,GAAG;YACf,MAAM,EAAE,IAAI,GAAG,EAAiC;SAChD,CAAC;QAEF,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACzE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;KACb;IACD,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,SAAS,kBAAkB,CAAC,QAAkB;IAC7C,uCAAY,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,KAAE,MAAM,EAAE,IAAI,GAAG,EAAE,IAAG;AAChF,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { v4 } from 'uuid';\n\nimport { assert } from '../Common';\nimport { Definition, NodeId, TraitLabel } from '../Identifiers';\nimport { Forest, ForestNode } from '../Forest';\nimport { RevisionView } from '../RevisionView';\nimport { ChangeNode, Side } from '../persisted-types';\nimport { TreeViewNode } from '../TreeView';\nimport { TestTree } from './utilities/TestNode';\nimport { refreshTestTree } from './utilities/TestUtilities';\n\ndescribe('Forest Perf', () => {\n\tconst testTree = refreshTestTree();\n\n\tfor (const count of [100, 1_000, 10_000, 100_000]) {\n\t\t// Pick a single representative size for the 'Measurement' suite to keep it small.\n\t\tconst type = count === 10_000 ? BenchmarkType.Measurement : BenchmarkType.Perspective;\n\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `${count} random inserts in TreeView`,\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tbuildRandomTree(testTree, count);\n\t\t\t},\n\t\t});\n\n\t\tlet built: RevisionView | undefined;\n\t\tlet rootId: NodeId | undefined;\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `walk ${count} node TreeView`,\n\t\t\tbefore: () => {\n\t\t\t\t[built, rootId] = buildRandomTree(testTree, count);\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tconst nodes = walk(built!, rootId!);\n\t\t\t\tassert(nodes === count);\n\t\t\t},\n\t\t\tafter: () => {\n\t\t\t\tbuilt = undefined;\n\t\t\t\trootId = undefined;\n\t\t\t},\n\t\t});\n\n\t\tlet forest: Forest | undefined;\n\t\tlet nodes: ForestNode[];\n\t\tbenchmark({\n\t\t\ttype,\n\t\t\ttitle: `insert ${count} nodes into Forest`,\n\t\t\tbefore: () => {\n\t\t\t\tforest = Forest.create(true);\n\t\t\t\tnodes = [];\n\t\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\t\tnodes.push(makeTestForestNode(testTree));\n\t\t\t\t}\n\t\t\t},\n\t\t\tbenchmarkFn: () => {\n\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\tforest!.add(nodes);\n\t\t\t},\n\t\t\tafter: () => {\n\t\t\t\tforest = undefined;\n\t\t\t},\n\t\t});\n\n\t\tlet otherForest: Forest | undefined;\n\t\tfor (const otherCount of [100, 1_000, 10_000, 100_000]) {\n\t\t\tbenchmark({\n\t\t\t\ttype,\n\t\t\t\ttitle: `invoke delta on Forest with ${count} nodes against Forest with ${otherCount} nodes`,\n\t\t\t\tbefore: () => {\n\t\t\t\t\tforest = Forest.create(true);\n\t\t\t\t\totherForest = Forest.create(true);\n\t\t\t\t\tnodes = [];\n\t\t\t\t\tfor (let i = 0; i < count; i++) {\n\t\t\t\t\t\tnodes.push(makeTestForestNode(testTree));\n\t\t\t\t\t}\n\t\t\t\t\tforest = forest.add(nodes);\n\n\t\t\t\t\tconst otherNodes: ForestNode[] = [];\n\t\t\t\t\tfor (let i = 0; i < otherCount; i++) {\n\t\t\t\t\t\totherNodes.push(makeTestForestNode(testTree));\n\t\t\t\t\t}\n\t\t\t\t\totherForest = otherForest.add(otherNodes);\n\t\t\t\t},\n\t\t\t\tbenchmarkFn: () => {\n\t\t\t\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\t\t\t\tforest!.delta(otherForest!);\n\t\t\t\t},\n\t\t\t\tafter: () => {\n\t\t\t\t\tforest = undefined;\n\t\t\t\t\totherForest = undefined;\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\t}\n});\n\nfunction walk(s: RevisionView, id: NodeId): number {\n\tlet count = 1;\n\tconst n = s.getViewNode(id);\n\tfor (const [_label, v] of n.traits.entries()) {\n\t\tfor (const child of v) {\n\t\t\tcount += walk(s, child);\n\t\t}\n\t}\n\treturn count;\n}\n\nfunction buildRandomTree(testTree: TestTree, size: number): [RevisionView, NodeId] {\n\tfunction getId(): NodeId {\n\t\treturn testTree.generateNodeId();\n\t}\n\n\tfunction getLabel(): TraitLabel {\n\t\treturn v4() as TraitLabel;\n\t}\n\n\tconst rootId = getId();\n\tconst root: ChangeNode = { traits: {}, definition: v4() as Definition, identifier: rootId };\n\tconst ids = [rootId];\n\tlet f = RevisionView.fromTree(root).openForTransaction();\n\n\tfor (let i = 1; i < size; i++) {\n\t\tconst label = getLabel();\n\t\tconst def: Definition = v4() as Definition;\n\t\tconst id = getId();\n\n\t\tconst newNode: TreeViewNode = {\n\t\t\tidentifier: id,\n\t\t\tdefinition: def,\n\t\t\ttraits: new Map<TraitLabel, readonly NodeId[]>(),\n\t\t};\n\n\t\tf = f.addNodes([newNode]);\n\t\tconst parent = ids[Math.floor(Math.random() * ids.length)];\n\t\tf = f.attachRange([id], { trait: { parent, label }, side: Side.Before });\n\t\tids.push(id);\n\t}\n\treturn [f.close(), rootId];\n}\n\nfunction makeTestForestNode(testTree: TestTree): ForestNode {\n\treturn { ...testTree.buildLeaf(testTree.generateNodeId()), traits: new Map() };\n}\n"]}

package/lib/test/Forest.tests.js

@@ -4,27 +4,40 @@
  */
 import { expect } from 'chai';
 import { compareForestNodes, Forest } from '../Forest';
-import { makeEmptyNode } from './utilities/TestUtilities';
+import { refreshTestTree } from './utilities/TestUtilities';
 const mainTraitLabel = 'main';
-function makeForestNodeWithChildren(id, ...children) {
-    return Object.assign(Object.assign({}, makeEmptyNode(id)), { traits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []) });
+function makeForestNodeWithChildren(testTree, id, ...children) {
+    return Object.assign(Object.assign({}, testTree.buildLeaf(id)), { traits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []) });
 }
 describe('Forest', () => {
-    const parentId = 'parent';
-    const childId = 'child';
-    const secondChildId = 'secondChild';
-    const thirdChildId = 'thirdChild';
-    const childNode = makeForestNodeWithChildren(childId);
-    const parentNode = makeForestNodeWithChildren(parentId);
-    const emptyForest = Forest.create(true);
-    const oneNodeForest = emptyForest.add([parentNode]);
-    const parentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);
-    const grandparentForest = parentForest
-        .add([makeForestNodeWithChildren(secondChildId)])
-        .attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);
-    const threeLeafForest = parentForest
-        .add([makeForestNodeWithChildren(secondChildId), makeForestNodeWithChildren(thirdChildId)])
-        .attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);
+    let parentId;
+    let childId;
+    let secondChildId;
+    let thirdChildId;
+    let childNode;
+    let parentNode;
+    let emptyForest;
+    let oneNodeForest;
+    let parentForest;
+    let grandparentForest;
+    let threeLeafForest;
+    const testTree = refreshTestTree(undefined, (t) => {
+        parentId = t.generateNodeId();
+        childId = t.generateNodeId();
+        secondChildId = t.generateNodeId();
+        thirdChildId = t.generateNodeId();
+        childNode = makeForestNodeWithChildren(t, childId);
+        parentNode = makeForestNodeWithChildren(t, parentId);
+        emptyForest = Forest.create(true);
+        oneNodeForest = emptyForest.add([parentNode]);
+        parentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);
+        grandparentForest = parentForest
+            .add([makeForestNodeWithChildren(t, secondChildId)])
+            .attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);
+        threeLeafForest = parentForest
+            .add([makeForestNodeWithChildren(t, secondChildId), makeForestNodeWithChildren(t, thirdChildId)])
+            .attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);
+    });
     it('test forests are consistent', () => {
         emptyForest.assertConsistent();
         parentForest.assertConsistent();
@@ -32,10 +45,10 @@ describe('Forest', () => {
         expect(parentForest.size).equals(2);
     });
     it('fails on multiparenting', () => {
-        expect(() => oneNodeForest.add([makeForestNodeWithChildren(parentId, childId, childId)])).to.throw();
+        expect(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId, childId, childId)])).to.throw();
     });
     it('cannot add a node with a duplicate ID', () => {
-        expect(() => oneNodeForest.add([makeForestNodeWithChildren(parentId)])).to.throw();
+        expect(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId)])).to.throw();
     });
     it('can get nodes in the forest', () => {
         expect(compareForestNodes(parentForest.get(childId), childNode));
@@ -51,7 +64,7 @@ describe('Forest', () => {
         const children = [];
         const numToAdd = 10;
         for (let i = 0; i < numToAdd; i++) {
-            const node = makeForestNodeWithChildren(i.toString());
+            const node = makeForestNodeWithChildren(testTree, testTree.generateNodeId());
             children.push(node);
             forestA = forestA.add([node]);
         }
@@ -61,31 +74,45 @@ describe('Forest', () => {
         expect(forestA.size).to.equal(10);
         expect(forestA.equals(forestB)).to.be.true;
     });
+    // Test that Forest.add() adds descendants and ancestors correctly regardless of the order in which they are supplied
+    it('can add nodes in any order', () => {
+        const childId = testTree.generateNodeId();
+        const parentId = testTree.generateNodeId();
+        const child = makeForestNodeWithChildren(testTree, childId);
+        const parent = makeForestNodeWithChildren(testTree, parentId, childId);
+        const grandparent = makeForestNodeWithChildren(testTree, testTree.generateNodeId(), parentId);
+        const forestA = emptyForest.add([child, parent, grandparent]);
+        const forestB = emptyForest.add([grandparent, parent, child]);
+        forestA.assertConsistent();
+        forestB.assertConsistent();
+        expect(forestA.size).to.equal(3);
+        expect(forestA.equals(forestB)).to.be.true;
+    });
     it('can replace payloads', () => {
         expectSuccessfulReplace(oneNodeForest, parentId, 0); // Set a payload when there was none
         expectSuccessfulReplace(oneNodeForest, parentId, 1); // Change a payload
     });
     it('can correctly attach a range to an empty trait on a root', () => {
         const moreChildrenForest = oneNodeForest.add([
-            makeForestNodeWithChildren(childId),
-            makeForestNodeWithChildren(secondChildId),
+            makeForestNodeWithChildren(testTree, childId),
+            makeForestNodeWithChildren(testTree, secondChildId),
         ]);
         expectSuccessfulAttach(moreChildrenForest, parentId, mainTraitLabel, 0, [childId, secondChildId]);
     });
     it('can correctly attach ranges to a populated trait on a root', () => {
         const twoLeafForest = parentForest.add([
-            makeForestNodeWithChildren(secondChildId),
-            makeForestNodeWithChildren(thirdChildId),
+            makeForestNodeWithChildren(testTree, secondChildId),
+            makeForestNodeWithChildren(testTree, thirdChildId),
         ]);
         expectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [secondChildId]);
         expectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [thirdChildId]);
     });
     it('can correctly attach ranges under a leaf', () => {
-        const threeNodeForest = parentForest.add([makeForestNodeWithChildren(secondChildId)]);
+        const threeNodeForest = parentForest.add([makeForestNodeWithChildren(testTree, secondChildId)]);
         expectSuccessfulAttach(threeNodeForest, childId, mainTraitLabel, 0, [secondChildId]);
     });
     it('only accepts valid indices for attaches', () => {
-        const twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(childId)]);
+        const twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(testTree, childId)]);
         expect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, -1, [childId])).to.throw('invalid attach index');
         expect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 1, [childId])).to.throw('invalid attach index');
     });

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

@@ -1 +1 @@
-{"version":3,"file":"Forest.tests.js","sourceRoot":"","sources":["../../src/test/Forest.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAc,MAAM,WAAW,CAAC;AAGnE,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,MAAM,cAAc,GAAG,MAAoB,CAAC;AAE5C,SAAS,0BAA0B,CAAC,EAAU,EAAE,GAAG,QAAkB;IACpE,uCACI,aAAa,CAAC,EAAE,CAAC,KACpB,MAAM,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAC5E;AACH,CAAC;AAED,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACvB,MAAM,QAAQ,GAAG,QAAkB,CAAC;IACpC,MAAM,OAAO,GAAG,OAAiB,CAAC;IAClC,MAAM,aAAa,GAAG,aAAuB,CAAC;IAC9C,MAAM,YAAY,GAAG,YAAsB,CAAC;IAC5C,MAAM,SAAS,GAAG,0BAA0B,CAAC,OAAO,CAAC,CAAC;IACtD,MAAM,UAAU,GAAG,0BAA0B,CAAC,QAAQ,CAAC,CAAC;IACxD,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACxC,MAAM,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IACpD,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;IAClH,MAAM,iBAAiB,GAAG,YAAY;SACpC,GAAG,CAAC,CAAC,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;SAChD,qBAAqB,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;IAErE,MAAM,eAAe,GAAG,YAAY;SAClC,GAAG,CAAC,CAAC,0BAA0B,CAAC,aAAa,CAAC,EAAE,0BAA0B,CAAC,YAAY,CAAC,CAAC,CAAC;SAC1F,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;IAEpF,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,WAAW,CAAC,gBAAgB,EAAE,CAAC;QAC/B,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAChC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACtG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;;QACxC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC5D,MAAM,OAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,0CAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,IAAI,OAAO,GAAG,WAAW,CAAC;QAC1B,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,0BAA0B,CAAC,CAAC,CAAC,QAAQ,EAAY,CAAC,CAAC;YAChE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SAC9B;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,oCAAoC;QACzF,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,kBAAkB,GAAG,aAAa,CAAC,GAAG,CAAC;YAC5C,0BAA0B,CAAC,OAAO,CAAC;YACnC,0BAA0B,CAAC,aAAa,CAAC;SACzC,CAAC,CAAC;QAEH,sBAAsB,CAAC,kBAAkB,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACrE,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC;YACtC,0BAA0B,CAAC,aAAa,CAAC;YACzC,0BAA0B,CAAC,YAAY,CAAC;SACxC,CAAC,CAAC;QAEH,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;QACpF,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtF,sBAAsB,CAAC,eAAe,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAClG,sBAAsB,CACtB,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACjG,sBAAsB,CACtB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACvE,MAAM,gBAAgB,GAAG,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9F,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,iBAAiB,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1F,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACzF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,kCAAkC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;QACzD,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE5C,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAErD,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,KAAa,EACb,QAAkB;;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,OAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;QAC5C,MAAM,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACxF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC/B,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,CAAC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,CAAC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;SAChD;IACF,CAAC;IAED,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,UAAkB,EAClB,QAAgB;;QAEhB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,OAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;QACxE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,qBAAqB,CAC1E,QAAQ,EACR,KAAK,EACL,UAAU,EACV,QAAQ,CACR,CAAC;QAEF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAC9B;aAAM;YACN,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;SACzC;QAED,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE;YAClC,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAClE;IACF,CAAC;IAED,SAAS,uBAAuB,CAAC,MAAc,EAAE,MAAc,EAAE,OAAuB;QACvF,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;AACF,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 { compareForestNodes, Forest, ForestNode } from '../Forest';\nimport { Payload } from '../generic';\nimport { NodeId, TraitLabel } from '../Identifiers';\nimport { makeEmptyNode } from './utilities/TestUtilities';\n\nconst mainTraitLabel = 'main' as TraitLabel;\n\nfunction makeForestNodeWithChildren(id: NodeId, ...children: NodeId[]): ForestNode {\n\treturn {\n\t\t...makeEmptyNode(id),\n\t\ttraits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []),\n\t};\n}\n\ndescribe('Forest', () => {\n\tconst parentId = 'parent' as NodeId;\n\tconst childId = 'child' as NodeId;\n\tconst secondChildId = 'secondChild' as NodeId;\n\tconst thirdChildId = 'thirdChild' as NodeId;\n\tconst childNode = makeForestNodeWithChildren(childId);\n\tconst parentNode = makeForestNodeWithChildren(parentId);\n\tconst emptyForest = Forest.create(true);\n\tconst oneNodeForest = emptyForest.add([parentNode]);\n\tconst parentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);\n\tconst grandparentForest = parentForest\n\t\t.add([makeForestNodeWithChildren(secondChildId)])\n\t\t.attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);\n\n\tconst threeLeafForest = parentForest\n\t\t.add([makeForestNodeWithChildren(secondChildId), makeForestNodeWithChildren(thirdChildId)])\n\t\t.attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);\n\n\tit('test forests are consistent', () => {\n\t\temptyForest.assertConsistent();\n\t\tparentForest.assertConsistent();\n\t\texpect(emptyForest.size).equals(0);\n\t\texpect(parentForest.size).equals(2);\n\t});\n\n\tit('fails on multiparenting', () => {\n\t\texpect(() => oneNodeForest.add([makeForestNodeWithChildren(parentId, childId, childId)])).to.throw();\n\t});\n\n\tit('cannot add a node with a duplicate ID', () => {\n\t\texpect(() => oneNodeForest.add([makeForestNodeWithChildren(parentId)])).to.throw();\n\t});\n\n\tit('can get nodes in the forest', () => {\n\t\texpect(compareForestNodes(parentForest.get(childId), childNode));\n\t\texpect(compareForestNodes(parentForest.get(parentId), parentNode));\n\t});\n\n\tit('can get parents in the forest', () => {\n\t\texpect(parentForest.tryGetParent(parentId)).to.be.undefined;\n\t\texpect(parentForest.tryGetParent(childId)?.parentId).to.equal(parentId);\n\t});\n\n\tit('can add nodes', () => {\n\t\tlet forestA = emptyForest;\n\t\tconst children: ForestNode[] = [];\n\t\tconst numToAdd = 10;\n\t\tfor (let i = 0; i < numToAdd; i++) {\n\t\t\tconst node = makeForestNodeWithChildren(i.toString() as NodeId);\n\t\t\tchildren.push(node);\n\t\t\tforestA = forestA.add([node]);\n\t\t}\n\t\tconst forestB = emptyForest.add(children);\n\t\tforestA.assertConsistent();\n\t\tforestB.assertConsistent();\n\t\texpect(forestA.size).to.equal(10);\n\t\texpect(forestA.equals(forestB)).to.be.true;\n\t});\n\n\tit('can replace payloads', () => {\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 0); // Set a payload when there was none\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 1); // Change a payload\n\t});\n\n\tit('can correctly attach a range to an empty trait on a root', () => {\n\t\tconst moreChildrenForest = oneNodeForest.add([\n\t\t\tmakeForestNodeWithChildren(childId),\n\t\t\tmakeForestNodeWithChildren(secondChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(moreChildrenForest, parentId, mainTraitLabel, 0, [childId, secondChildId]);\n\t});\n\n\tit('can correctly attach ranges to a populated trait on a root', () => {\n\t\tconst twoLeafForest = parentForest.add([\n\t\t\tmakeForestNodeWithChildren(secondChildId),\n\t\t\tmakeForestNodeWithChildren(thirdChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [secondChildId]);\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [thirdChildId]);\n\t});\n\n\tit('can correctly attach ranges under a leaf', () => {\n\t\tconst threeNodeForest = parentForest.add([makeForestNodeWithChildren(secondChildId)]);\n\t\texpectSuccessfulAttach(threeNodeForest, childId, mainTraitLabel, 0, [secondChildId]);\n\t});\n\n\tit('only accepts valid indices for attaches', () => {\n\t\tconst twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(childId)]);\n\t\texpect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, -1, [childId])).to.throw(\n\t\t\t'invalid attach index'\n\t\t);\n\t\texpect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 1, [childId])).to.throw(\n\t\t\t'invalid attach index'\n\t\t);\n\t});\n\n\tit('does not add trait when attaching empty range to empty trait', () => {\n\t\tconst forestWithAttach = oneNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 0, []);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(mainTraitLabel)).equals(undefined);\n\t});\n\n\tit('can correctly detach a range on a root node', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 1, 2);\n\t});\n\n\tit('can correctly detach a range on a leaf node', () => {\n\t\texpectSuccessfulDetach(grandparentForest, childId, mainTraitLabel, 0, 1);\n\t});\n\n\tit('can correctly detach an entire trait', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 0, 2);\n\t});\n\n\tit('only accepts valid indices for detaches', () => {\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, -1)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, 0)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 0)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 0, 2)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 2)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t});\n\n\tit('cannot delete parented nodes', () => {\n\t\texpect(() => parentForest.delete([childId], false)).throws('deleted nodes must be unparented');\n\t});\n\n\tit('can delete a root', () => {\n\t\tconst deleteRoot = parentForest.delete([parentId], false);\n\t\tdeleteRoot.assertConsistent();\n\t\texpect(deleteRoot.size).to.equal(1);\n\t\texpect(deleteRoot.tryGet(childId)).to.not.be.undefined;\n\t});\n\n\tit('can delete a subtree', () => {\n\t\tconst deleteLeaf = parentForest.delete([parentId], true);\n\t\tdeleteLeaf.assertConsistent();\n\t\texpect(deleteLeaf.size).to.equal(0);\n\t});\n\n\tit('calculates deltas correctly', () => {\n\t\tconst add = emptyForest.delta(oneNodeForest);\n\t\tconst remove = oneNodeForest.delta(emptyForest);\n\t\tconst same = parentForest.delta(parentForest);\n\t\tconst modified = parentForest.setValue(childId, -1);\n\t\tconst modify = parentForest.delta(modified);\n\n\t\texpect(remove).deep.equals({ changed: [], added: [], removed: [parentId] });\n\t\texpect(add).deep.equals({ changed: [], added: [parentId], removed: [] });\n\t\texpect(same).deep.equals({ changed: [], added: [], removed: [] });\n\t\texpect(modify).deep.equals({ changed: [childId], added: [], removed: [] });\n\t});\n\n\tit('calculates equality correctly', () => {\n\t\tconst modified = parentForest.setValue(parentId, -1);\n\n\t\texpect(oneNodeForest.equals(emptyForest)).false;\n\t\texpect(emptyForest.equals(oneNodeForest)).false;\n\t\texpect(parentForest.equals(parentForest)).true;\n\t\texpect(parentForest.equals(modified)).false;\n\t});\n\n\tfunction expectSuccessfulAttach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tindex: number,\n\t\tchildIds: NodeId[]\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\texpectedTrait.splice(index, 0, ...childIds);\n\t\tconst forestWithAttach = forest.attachRangeOfChildren(parentId, label, index, childIds);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(label)).deep.equals(expectedTrait);\n\t\tfor (const childId of childIds) {\n\t\t\tconst parentData = forestWithAttach.tryGetParent(childId);\n\t\t\texpect(parentData?.traitParent).to.equal(label);\n\t\t\texpect(parentData?.parentId).to.equal(parentId);\n\t\t}\n\t}\n\n\tfunction expectSuccessfulDetach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tstartIndex: number,\n\t\tendIndex: number\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\tconst spliced = expectedTrait.splice(startIndex, endIndex - startIndex);\n\t\tconst { forest: forestWithDetach, detached } = forest.detachRangeOfChildren(\n\t\t\tparentId,\n\t\t\tlabel,\n\t\t\tstartIndex,\n\t\t\tendIndex\n\t\t);\n\n\t\tconst newParent = forestWithDetach.get(parentId);\n\t\tconst trait = newParent.traits.get(label);\n\t\tif (expectedTrait.length === 0) {\n\t\t\texpect(trait).to.be.undefined;\n\t\t} else {\n\t\t\texpect(trait).deep.equals(expectedTrait);\n\t\t}\n\n\t\texpect(detached).deep.equals(spliced);\n\t\tfor (const detachedId of detached) {\n\t\t\texpect(forestWithDetach.tryGetParent(detachedId)).to.be.undefined;\n\t\t}\n\t}\n\n\tfunction expectSuccessfulReplace(forest: Forest, nodeId: NodeId, payload: Payload | null): void {\n\t\tconst forestWithReplace = forest.setValue(nodeId, payload);\n\t\tconst newNode = forestWithReplace.get(nodeId);\n\t\texpect(newNode.payload).equals(payload);\n\t}\n});\n"]}
+{"version":3,"file":"Forest.tests.js","sourceRoot":"","sources":["../../src/test/Forest.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAc,MAAM,WAAW,CAAC;AAInE,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAE5D,MAAM,cAAc,GAAG,MAAoB,CAAC;AAE5C,SAAS,0BAA0B,CAAC,QAAkB,EAAE,EAAU,EAAE,GAAG,QAAkB;IACxF,uCACI,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,KACzB,MAAM,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAC5E;AACH,CAAC;AAED,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACvB,IAAI,QAAgB,CAAC;IACrB,IAAI,OAAe,CAAC;IACpB,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IAEzB,IAAI,SAAqB,CAAC;IAC1B,IAAI,UAAsB,CAAC;IAC3B,IAAI,WAAmB,CAAC;IACxB,IAAI,aAAqB,CAAC;IAC1B,IAAI,YAAoB,CAAC;IACzB,IAAI,iBAAyB,CAAC;IAC9B,IAAI,eAAuB,CAAC;IAE5B,MAAM,QAAQ,GAAG,eAAe,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE;QACjD,QAAQ,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAC9B,OAAO,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAC7B,aAAa,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QACnC,YAAY,GAAG,CAAC,CAAC,cAAc,EAAE,CAAC;QAElC,SAAS,GAAG,0BAA0B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACnD,UAAU,GAAG,0BAA0B,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClC,aAAa,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;QAC9C,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5G,iBAAiB,GAAG,YAAY;aAC9B,GAAG,CAAC,CAAC,0BAA0B,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;aACnD,qBAAqB,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;QAErE,eAAe,GAAG,YAAY;aAC5B,GAAG,CAAC,CAAC,0BAA0B,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE,0BAA0B,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAChG,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,WAAW,CAAC,gBAAgB,EAAE,CAAC;QAC/B,YAAY,CAAC,gBAAgB,EAAE,CAAC;QAChC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAChH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAC9F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,kBAAkB,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;;QACxC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC5D,MAAM,OAAC,YAAY,CAAC,YAAY,CAAC,OAAO,CAAC,0CAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,IAAI,OAAO,GAAG,WAAW,CAAC;QAC1B,MAAM,QAAQ,GAAiB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YAClC,MAAM,IAAI,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;YAC7E,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SAC9B;QACD,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,qHAAqH;IACrH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvE,MAAM,WAAW,GAAG,0BAA0B,CAAC,QAAQ,EAAE,QAAQ,CAAC,cAAc,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,oCAAoC;QACzF,uBAAuB,CAAC,aAAa,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,kBAAkB,GAAG,aAAa,CAAC,GAAG,CAAC;YAC5C,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC;YAC7C,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC;SACnD,CAAC,CAAC;QAEH,sBAAsB,CAAC,kBAAkB,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACrE,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC;YACtC,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC;YACnD,0BAA0B,CAAC,QAAQ,EAAE,YAAY,CAAC;SAClD,CAAC,CAAC;QAEH,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;QACpF,sBAAsB,CAAC,aAAa,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC;IACpF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAChG,sBAAsB,CAAC,eAAe,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,0BAA0B,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAClG,sBAAsB,CACtB,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACjG,sBAAsB,CACtB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACvE,MAAM,gBAAgB,GAAG,aAAa,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9F,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,sBAAsB,CAAC,iBAAiB,EAAE,OAAO,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,sBAAsB,CAAC,eAAe,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAC1F,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACzF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;QACF,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,cAAc,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CACxF,4BAA4B,CAC5B,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,kCAAkC,CAAC,CAAC;IAChG,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAK,CAAC,CAAC;QAC1D,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC/B,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC;QACzD,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9B,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAChD,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAE5C,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,QAAQ,GAAG,YAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAErD,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;QAChD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,KAAa,EACb,QAAkB;;QAElB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,OAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;QAC5C,MAAM,gBAAgB,GAAG,MAAM,CAAC,qBAAqB,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACxF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC/B,MAAM,UAAU,GAAG,gBAAgB,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC1D,MAAM,CAAC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAChD,MAAM,CAAC,UAAU,aAAV,UAAU,uBAAV,UAAU,CAAE,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;SAChD;IACF,CAAC;IAED,SAAS,sBAAsB,CAC9B,MAAc,EACd,QAAgB,EAChB,KAAiB,EACjB,UAAkB,EAClB,QAAgB;;QAEhB,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,MAAM,aAAa,GAAG,CAAC,GAAG,OAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAI,EAAE,CAAC,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,EAAE,QAAQ,GAAG,UAAU,CAAC,CAAC;QACxE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,qBAAqB,CAC1E,QAAQ,EACR,KAAK,EACL,UAAU,EACV,QAAQ,CACR,CAAC;QAEF,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,MAAM,KAAK,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE;YAC/B,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAC9B;aAAM;YACN,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;SACzC;QAED,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE;YAClC,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;SAClE;IACF,CAAC;IAED,SAAS,uBAAuB,CAAC,MAAc,EAAE,MAAc,EAAE,OAAuB;QACvF,MAAM,iBAAiB,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;AACF,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 { compareForestNodes, Forest, ForestNode } from '../Forest';\nimport { NodeId, TraitLabel } from '../Identifiers';\nimport { Payload } from '../persisted-types';\nimport { TestTree } from './utilities/TestNode';\nimport { refreshTestTree } from './utilities/TestUtilities';\n\nconst mainTraitLabel = 'main' as TraitLabel;\n\nfunction makeForestNodeWithChildren(testTree: TestTree, id: NodeId, ...children: NodeId[]): ForestNode {\n\treturn {\n\t\t...testTree.buildLeaf(id),\n\t\ttraits: new Map(children.length > 0 ? [[mainTraitLabel, [...children]]] : []),\n\t};\n}\n\ndescribe('Forest', () => {\n\tlet parentId: NodeId;\n\tlet childId: NodeId;\n\tlet secondChildId: NodeId;\n\tlet thirdChildId: NodeId;\n\n\tlet childNode: ForestNode;\n\tlet parentNode: ForestNode;\n\tlet emptyForest: Forest;\n\tlet oneNodeForest: Forest;\n\tlet parentForest: Forest;\n\tlet grandparentForest: Forest;\n\tlet threeLeafForest: Forest;\n\n\tconst testTree = refreshTestTree(undefined, (t) => {\n\t\tparentId = t.generateNodeId();\n\t\tchildId = t.generateNodeId();\n\t\tsecondChildId = t.generateNodeId();\n\t\tthirdChildId = t.generateNodeId();\n\n\t\tchildNode = makeForestNodeWithChildren(t, childId);\n\t\tparentNode = makeForestNodeWithChildren(t, parentId);\n\t\temptyForest = Forest.create(true);\n\t\toneNodeForest = emptyForest.add([parentNode]);\n\t\tparentForest = oneNodeForest.add([childNode]).attachRangeOfChildren(parentId, mainTraitLabel, 0, [childId]);\n\t\tgrandparentForest = parentForest\n\t\t\t.add([makeForestNodeWithChildren(t, secondChildId)])\n\t\t\t.attachRangeOfChildren(childId, mainTraitLabel, 0, [secondChildId]);\n\n\t\tthreeLeafForest = parentForest\n\t\t\t.add([makeForestNodeWithChildren(t, secondChildId), makeForestNodeWithChildren(t, thirdChildId)])\n\t\t\t.attachRangeOfChildren(parentId, mainTraitLabel, 1, [secondChildId, thirdChildId]);\n\t});\n\n\tit('test forests are consistent', () => {\n\t\temptyForest.assertConsistent();\n\t\tparentForest.assertConsistent();\n\t\texpect(emptyForest.size).equals(0);\n\t\texpect(parentForest.size).equals(2);\n\t});\n\n\tit('fails on multiparenting', () => {\n\t\texpect(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId, childId, childId)])).to.throw();\n\t});\n\n\tit('cannot add a node with a duplicate ID', () => {\n\t\texpect(() => oneNodeForest.add([makeForestNodeWithChildren(testTree, parentId)])).to.throw();\n\t});\n\n\tit('can get nodes in the forest', () => {\n\t\texpect(compareForestNodes(parentForest.get(childId), childNode));\n\t\texpect(compareForestNodes(parentForest.get(parentId), parentNode));\n\t});\n\n\tit('can get parents in the forest', () => {\n\t\texpect(parentForest.tryGetParent(parentId)).to.be.undefined;\n\t\texpect(parentForest.tryGetParent(childId)?.parentId).to.equal(parentId);\n\t});\n\n\tit('can add nodes', () => {\n\t\tlet forestA = emptyForest;\n\t\tconst children: ForestNode[] = [];\n\t\tconst numToAdd = 10;\n\t\tfor (let i = 0; i < numToAdd; i++) {\n\t\t\tconst node = makeForestNodeWithChildren(testTree, testTree.generateNodeId());\n\t\t\tchildren.push(node);\n\t\t\tforestA = forestA.add([node]);\n\t\t}\n\t\tconst forestB = emptyForest.add(children);\n\t\tforestA.assertConsistent();\n\t\tforestB.assertConsistent();\n\t\texpect(forestA.size).to.equal(10);\n\t\texpect(forestA.equals(forestB)).to.be.true;\n\t});\n\n\t// Test that Forest.add() adds descendants and ancestors correctly regardless of the order in which they are supplied\n\tit('can add nodes in any order', () => {\n\t\tconst childId = testTree.generateNodeId();\n\t\tconst parentId = testTree.generateNodeId();\n\t\tconst child = makeForestNodeWithChildren(testTree, childId);\n\t\tconst parent = makeForestNodeWithChildren(testTree, parentId, childId);\n\t\tconst grandparent = makeForestNodeWithChildren(testTree, testTree.generateNodeId(), parentId);\n\t\tconst forestA = emptyForest.add([child, parent, grandparent]);\n\t\tconst forestB = emptyForest.add([grandparent, parent, child]);\n\t\tforestA.assertConsistent();\n\t\tforestB.assertConsistent();\n\t\texpect(forestA.size).to.equal(3);\n\t\texpect(forestA.equals(forestB)).to.be.true;\n\t});\n\n\tit('can replace payloads', () => {\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 0); // Set a payload when there was none\n\t\texpectSuccessfulReplace(oneNodeForest, parentId, 1); // Change a payload\n\t});\n\n\tit('can correctly attach a range to an empty trait on a root', () => {\n\t\tconst moreChildrenForest = oneNodeForest.add([\n\t\t\tmakeForestNodeWithChildren(testTree, childId),\n\t\t\tmakeForestNodeWithChildren(testTree, secondChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(moreChildrenForest, parentId, mainTraitLabel, 0, [childId, secondChildId]);\n\t});\n\n\tit('can correctly attach ranges to a populated trait on a root', () => {\n\t\tconst twoLeafForest = parentForest.add([\n\t\t\tmakeForestNodeWithChildren(testTree, secondChildId),\n\t\t\tmakeForestNodeWithChildren(testTree, thirdChildId),\n\t\t]);\n\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [secondChildId]);\n\t\texpectSuccessfulAttach(twoLeafForest, parentId, mainTraitLabel, 1, [thirdChildId]);\n\t});\n\n\tit('can correctly attach ranges under a leaf', () => {\n\t\tconst threeNodeForest = parentForest.add([makeForestNodeWithChildren(testTree, secondChildId)]);\n\t\texpectSuccessfulAttach(threeNodeForest, childId, mainTraitLabel, 0, [secondChildId]);\n\t});\n\n\tit('only accepts valid indices for attaches', () => {\n\t\tconst twoNodeForest = oneNodeForest.add([makeForestNodeWithChildren(testTree, childId)]);\n\t\texpect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, -1, [childId])).to.throw(\n\t\t\t'invalid attach index'\n\t\t);\n\t\texpect(() => twoNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 1, [childId])).to.throw(\n\t\t\t'invalid attach index'\n\t\t);\n\t});\n\n\tit('does not add trait when attaching empty range to empty trait', () => {\n\t\tconst forestWithAttach = oneNodeForest.attachRangeOfChildren(parentId, mainTraitLabel, 0, []);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(mainTraitLabel)).equals(undefined);\n\t});\n\n\tit('can correctly detach a range on a root node', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 1, 2);\n\t});\n\n\tit('can correctly detach a range on a leaf node', () => {\n\t\texpectSuccessfulDetach(grandparentForest, childId, mainTraitLabel, 0, 1);\n\t});\n\n\tit('can correctly detach an entire trait', () => {\n\t\texpectSuccessfulDetach(threeLeafForest, parentId, mainTraitLabel, 0, 2);\n\t});\n\n\tit('only accepts valid indices for detaches', () => {\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, -1)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, -1, 0)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 0)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 0, 2)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t\texpect(() => parentForest.detachRangeOfChildren(parentId, mainTraitLabel, 1, 2)).to.throw(\n\t\t\t'invalid detach index range'\n\t\t);\n\t});\n\n\tit('cannot delete parented nodes', () => {\n\t\texpect(() => parentForest.delete([childId], false)).throws('deleted nodes must be unparented');\n\t});\n\n\tit('can delete a root', () => {\n\t\tconst deleteRoot = parentForest.delete([parentId], false);\n\t\tdeleteRoot.assertConsistent();\n\t\texpect(deleteRoot.size).to.equal(1);\n\t\texpect(deleteRoot.tryGet(childId)).to.not.be.undefined;\n\t});\n\n\tit('can delete a subtree', () => {\n\t\tconst deleteLeaf = parentForest.delete([parentId], true);\n\t\tdeleteLeaf.assertConsistent();\n\t\texpect(deleteLeaf.size).to.equal(0);\n\t});\n\n\tit('calculates deltas correctly', () => {\n\t\tconst add = emptyForest.delta(oneNodeForest);\n\t\tconst remove = oneNodeForest.delta(emptyForest);\n\t\tconst same = parentForest.delta(parentForest);\n\t\tconst modified = parentForest.setValue(childId, -1);\n\t\tconst modify = parentForest.delta(modified);\n\n\t\texpect(remove).deep.equals({ changed: [], added: [], removed: [parentId] });\n\t\texpect(add).deep.equals({ changed: [], added: [parentId], removed: [] });\n\t\texpect(same).deep.equals({ changed: [], added: [], removed: [] });\n\t\texpect(modify).deep.equals({ changed: [childId], added: [], removed: [] });\n\t});\n\n\tit('calculates equality correctly', () => {\n\t\tconst modified = parentForest.setValue(parentId, -1);\n\n\t\texpect(oneNodeForest.equals(emptyForest)).false;\n\t\texpect(emptyForest.equals(oneNodeForest)).false;\n\t\texpect(parentForest.equals(parentForest)).true;\n\t\texpect(parentForest.equals(modified)).false;\n\t});\n\n\tfunction expectSuccessfulAttach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tindex: number,\n\t\tchildIds: NodeId[]\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\texpectedTrait.splice(index, 0, ...childIds);\n\t\tconst forestWithAttach = forest.attachRangeOfChildren(parentId, label, index, childIds);\n\t\tconst newParent = forestWithAttach.get(parentId);\n\t\texpect(newParent.traits.get(label)).deep.equals(expectedTrait);\n\t\tfor (const childId of childIds) {\n\t\t\tconst parentData = forestWithAttach.tryGetParent(childId);\n\t\t\texpect(parentData?.traitParent).to.equal(label);\n\t\t\texpect(parentData?.parentId).to.equal(parentId);\n\t\t}\n\t}\n\n\tfunction expectSuccessfulDetach(\n\t\tforest: Forest,\n\t\tparentId: NodeId,\n\t\tlabel: TraitLabel,\n\t\tstartIndex: number,\n\t\tendIndex: number\n\t): void {\n\t\tconst parent = forest.get(parentId);\n\t\tconst expectedTrait = [...(parent.traits.get(label) ?? [])];\n\t\tconst spliced = expectedTrait.splice(startIndex, endIndex - startIndex);\n\t\tconst { forest: forestWithDetach, detached } = forest.detachRangeOfChildren(\n\t\t\tparentId,\n\t\t\tlabel,\n\t\t\tstartIndex,\n\t\t\tendIndex\n\t\t);\n\n\t\tconst newParent = forestWithDetach.get(parentId);\n\t\tconst trait = newParent.traits.get(label);\n\t\tif (expectedTrait.length === 0) {\n\t\t\texpect(trait).to.be.undefined;\n\t\t} else {\n\t\t\texpect(trait).deep.equals(expectedTrait);\n\t\t}\n\n\t\texpect(detached).deep.equals(spliced);\n\t\tfor (const detachedId of detached) {\n\t\t\texpect(forestWithDetach.tryGetParent(detachedId)).to.be.undefined;\n\t\t}\n\t}\n\n\tfunction expectSuccessfulReplace(forest: Forest, nodeId: NodeId, payload: Payload | null): void {\n\t\tconst forestWithReplace = forest.setValue(nodeId, payload);\n\t\tconst newNode = forestWithReplace.get(nodeId);\n\t\texpect(newNode.payload).equals(payload);\n\t}\n});\n"]}

package/lib/test/GenericTransaction.tests.js

@@ -3,10 +3,11 @@
  * Licensed under the MIT License.
  */
 import { expect } from 'chai';
-import { EditStatus } from '../generic';
-import { initialSnapshotWithValidation } from './utilities/TestUtilities';
+import { EditStatus } from '../persisted-types';
+import { refreshTestTree } from './utilities/TestUtilities';
 import { MockTransaction } from './utilities/MockTransaction';
 describe('GenericTransaction', () => {
+    const testTree = refreshTestTree();
     it('does not read the reconciliation path when change resolution does not require it', () => {
         const trappedPath = new Proxy([], {
             get: (target, prop) => {
@@ -14,9 +15,17 @@ describe('GenericTransaction', () => {
                 return target[prop];
             },
         });
-        const transaction = new MockTransaction(initialSnapshotWithValidation);
+        const transaction = MockTransaction.factory(testTree.view);
         transaction.applyChanges([{}, {}], trappedPath);
         expect(transaction.status).equals(EditStatus.Applied);
     });
+    it('reflects failure status when validateOnClose is not successful', () => {
+        const transaction = MockTransaction.factory(testTree.view, {
+            statusOnClose: EditStatus.Invalid,
+        });
+        const result = transaction.close();
+        expect(result.status).equals(EditStatus.Invalid);
+        expect(transaction.status).equals(EditStatus.Invalid);
+    });
 });
 //# sourceMappingURL=GenericTransaction.tests.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"GenericTransaction.tests.js","sourceRoot":"","sources":["../../src/test/GenericTransaction.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAExC,OAAO,EAAE,6BAA6B,EAAE,MAAM,2BAA2B,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAE9D,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC3F,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,EAAmC,EAAE;YAClE,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,EAAW,EAAE;gBAC9B,MAAM,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC;gBAClE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;SACD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,IAAI,eAAe,CAAU,6BAA6B,CAAC,CAAC;QAChF,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { EditStatus } from '../generic';\nimport { ReconciliationEdit } from '../ReconciliationPath';\nimport { initialSnapshotWithValidation } from './utilities/TestUtilities';\nimport { MockTransaction } from './utilities/MockTransaction';\n\ndescribe('GenericTransaction', () => {\n\tit('does not read the reconciliation path when change resolution does not require it', () => {\n\t\tconst trappedPath = new Proxy([] as ReconciliationEdit<unknown>[], {\n\t\t\tget: (target, prop): unknown => {\n\t\t\t\texpect('the path was read').equals('the path should not be read');\n\t\t\t\treturn target[prop];\n\t\t\t},\n\t\t});\n\t\tconst transaction = new MockTransaction<unknown>(initialSnapshotWithValidation);\n\t\ttransaction.applyChanges([{}, {}], trappedPath);\n\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t});\n});\n"]}
+{"version":3,"file":"GenericTransaction.tests.js","sourceRoot":"","sources":["../../src/test/GenericTransaction.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAkB,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAE9D,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;QAC3F,MAAM,WAAW,GAAG,IAAI,KAAK,CAAC,EAA0B,EAAE;YACzD,GAAG,EAAE,CAAC,MAAM,EAAE,IAAI,EAAW,EAAE;gBAC9B,MAAM,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC;gBAClE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;SACD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3D,WAAW,CAAC,YAAY,CAAC,CAAC,EAAE,EAAE,EAAE,CAAgC,EAAE,WAAW,CAAC,CAAC;QAC/E,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gEAAgE,EAAE,GAAG,EAAE;QACzE,MAAM,WAAW,GAAG,eAAe,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE;YAC1D,aAAa,EAAE,UAAU,CAAC,OAAO;SACjC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { ReconciliationEdit } from '../ReconciliationPath';\nimport { ChangeInternal, EditStatus } from '../persisted-types';\nimport { refreshTestTree } from './utilities/TestUtilities';\nimport { MockTransaction } from './utilities/MockTransaction';\n\ndescribe('GenericTransaction', () => {\n\tconst testTree = refreshTestTree();\n\tit('does not read the reconciliation path when change resolution does not require it', () => {\n\t\tconst trappedPath = new Proxy([] as ReconciliationEdit[], {\n\t\t\tget: (target, prop): unknown => {\n\t\t\t\texpect('the path was read').equals('the path should not be read');\n\t\t\t\treturn target[prop];\n\t\t\t},\n\t\t});\n\t\tconst transaction = MockTransaction.factory(testTree.view);\n\t\ttransaction.applyChanges([{}, {}] as unknown as ChangeInternal[], trappedPath);\n\t\texpect(transaction.status).equals(EditStatus.Applied);\n\t});\n\n\tit('reflects failure status when validateOnClose is not successful', () => {\n\t\tconst transaction = MockTransaction.factory(testTree.view, {\n\t\t\tstatusOnClose: EditStatus.Invalid,\n\t\t});\n\t\tconst result = transaction.close();\n\t\texpect(result.status).equals(EditStatus.Invalid);\n\t\texpect(transaction.status).equals(EditStatus.Invalid);\n\t});\n});\n"]}

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

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

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

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