@fluid-experimental/property-changeset 0.57.2 → 0.58.1000

package/dist/changeset.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"changeset.d.ts","sourceRoot":"","sources":["../src/changeset.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAaH,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,EAAE,YAAY,EAAE,MAAM,+CAA+C,CAAA;AAE5E,OAAO,EAAE,mCAAmC,EAAE,MAAM,0CAA0C,CAAC;AAY/F,MAAM,WAAW,qBAAqB;IAClC;;OAEG;IACH,yBAAyB,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAE1C;;OAEG;IACH,uBAAuB,CAAC,EAAE,OAAO,CAAA;CACpC;AAGD,MAAM,WAAW,sBAAuB,SAAQ,qBAAqB;IACjE,qBAAqB,CAAC,EAAE,MAAM,CAAA;CACjC;AAED;;GAEG;AACH,oBAAY,mBAAmB,GAAG,GAAG,CAAC;AACtC,oBAAY,aAAa,GAAG,GAAG,CAAC;AAChC,MAAM,WAAW,YAAY;IACzB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B;;OAEG;IACH,IAAI,EAAE,YAAY,CAAC;IACnB,iBAAiB,CAAC,EAAE,mBAAmB,CAAC;CAC3C;AAED;;;;GAIG;AACH,qBAAa,SAAS;IAClB,MAAM,CAAC,YAAY,sBAAgB;IACnC,MAAM,CAAC,gBAAgB,iCAAoB;IAC3C,MAAM,CAAC,iBAAiB,8BAAqB;IAE9B,gCAAgC,EAAE,OAAO,mCAAmC,CAAC,gCAAgC,CAAC;IAC9G,iCAAiC,EAAE,OAAO,uBAAuB,CAAC,iCAAiC,CAAC;IACpG,gCAAgC,EAAE,OAAO,uBAAuB,CAAC,gCAAgC,CAAC;IAClG,yBAAyB,EAAE,OAAO,uBAAuB,CAAC,yBAAyB,CAAC;IACpF,6CAA6C,EAAE,OAAO,mCAAmC,CAAC,6CAA6C,CAAC;IACxI,4CAA4C,EAAE,OAAO,mCAAmC,CAAC,4CAA4C,CAAC;IAGrJ,QAAQ,EAAE,mBAAmB,CAAC;IAC9B,aAAa,EAAE,OAAO,CAAC;IAEvB;;;OAGG;gBACS,UAAU,CAAC,EAAE,aAAa;IAgBtC;;;OAGG;IACH,QAAQ,IAAI,MAAM;IAKlB;;;;OAIG;IACH,sBAAsB,IAAI,mBAAmB;IAI7C;;;;;OAKG;IACH,eAAe,CAAC,eAAe,EAAE,OAAO;IAIxC;;;;;OAKG;IACH,eAAe,IAAI,OAAO;IAI1B;;;;OAIG;IACH,KAAK,IAAI,SAAS;IAKlB;;;;;;;;OAQG;IACH,cAAc,CAAC,YAAY,EAAE,mBAAmB,EAAE,UAAU,CAAC,EAAE,qBAAqB;IAcpF;;;;;;;;;OASG;IACH,OAAO,CAAC,4BAA4B;IA+CpC;;;;;;;;OAQG;IACH,OAAO,CAAC,WAAW;IAkBnB;;;;;;;;;;;OAWG;IACI,qCAAqC,CACxC,aAAa,EAAE,MAAM,EACrB,cAAc,EAAE,mBAAmB,EACnC,yBAAyB,EAAE;QAAE,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,EAChD,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,OAAO,EACvB,UAAU,CAAC,EAAE,qBAAqB;IAqHtC;;;;;;;;;;;;;OAaG;IACI,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,EAAE,aAAa,EAAE,YAAY,EAAE,EACpF,UAAU,CAAC,EAAE,sBAAsB,GAAG,mBAAmB;IAK7D;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,2BAA2B;IAuKnC;;;;;;;;;;;;;;;;;;;OAmBG;IACH,OAAO,CAAC,yCAAyC;IAwEjD;;;;;OAKG;IAEH,OAAO,CAAC,oCAAoC;IAkM5C;;;;;;;OAOG;IACI,sBAAsB,CAAC,qBAAqB,EAAE,mBAAmB;IAuBxE;;;;;;OAMG;IACI,yBAAyB,CAAC,cAAc,EAAE,OAAO;IAoHxD;;;;;;OAMG;IACH,OAAO,CAAC,uBAAuB;IAgB/B;;;OAGG;IACH,OAAO,CAAC,qCAAqC;IAoI7C;;;;;OAKG;IACI,kBAAkB;CAY5B"}
+{"version":3,"file":"changeset.d.ts","sourceRoot":"","sources":["../src/changeset.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAaH,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAGvE,OAAO,EAAE,YAAY,EAAE,MAAM,+CAA+C,CAAA;AAE5E,OAAO,EAAE,mCAAmC,EAAE,MAAM,0CAA0C,CAAC;AAY/F,MAAM,WAAW,qBAAqB;IAClC;;OAEG;IACH,yBAAyB,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAE1C;;OAEG;IACH,uBAAuB,CAAC,EAAE,OAAO,CAAA;CACpC;AAGD,MAAM,WAAW,sBAAuB,SAAQ,qBAAqB;IACjE,qBAAqB,CAAC,EAAE,MAAM,CAAA;CACjC;AAED;;GAEG;AACH,oBAAY,mBAAmB,GAAG,GAAG,CAAC;AACtC,oBAAY,aAAa,GAAG,GAAG,CAAC;AAChC,MAAM,WAAW,YAAY;IACzB;;;OAGG;IACH,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAC1B;;OAEG;IACH,IAAI,EAAE,YAAY,CAAC;IACnB,iBAAiB,CAAC,EAAE,mBAAmB,CAAC;CAC3C;AAED;;;;GAIG;AACH,qBAAa,SAAS;IAClB,MAAM,CAAC,YAAY,sBAAgB;IACnC,MAAM,CAAC,gBAAgB,iCAAoB;IAC3C,MAAM,CAAC,iBAAiB,8BAAqB;IAE9B,gCAAgC,EAAE,OAAO,mCAAmC,CAAC,gCAAgC,CAAC;IAC9G,iCAAiC,EAAE,OAAO,uBAAuB,CAAC,iCAAiC,CAAC;IACpG,gCAAgC,EAAE,OAAO,uBAAuB,CAAC,gCAAgC,CAAC;IAClG,yBAAyB,EAAE,OAAO,uBAAuB,CAAC,yBAAyB,CAAC;IACpF,6CAA6C,EAAE,OAAO,mCAAmC,CAAC,6CAA6C,CAAC;IACxI,4CAA4C,EAAE,OAAO,mCAAmC,CAAC,4CAA4C,CAAC;IAGrJ,QAAQ,EAAE,mBAAmB,CAAC;IAC9B,aAAa,EAAE,OAAO,CAAC;IAEvB;;;OAGG;gBACS,UAAU,CAAC,EAAE,aAAa;IAgBtC;;;OAGG;IACH,QAAQ,IAAI,MAAM;IAKlB;;;;OAIG;IACH,sBAAsB,IAAI,mBAAmB;IAI7C;;;;;OAKG;IACH,eAAe,CAAC,eAAe,EAAE,OAAO;IAIxC;;;;;OAKG;IACH,eAAe,IAAI,OAAO;IAI1B;;;;OAIG;IACH,KAAK,IAAI,SAAS;IAKlB;;;;;;;;OAQG;IACH,cAAc,CAAC,YAAY,EAAE,mBAAmB,EAAE,UAAU,CAAC,EAAE,qBAAqB;IAcpF;;;;;;;;;OASG;IACH,OAAO,CAAC,4BAA4B;IA+CpC;;;;;;;;OAQG;IACH,OAAO,CAAC,WAAW;IAkBnB;;;;;;;;;;;OAWG;IACI,qCAAqC,CACxC,aAAa,EAAE,MAAM,EACrB,cAAc,EAAE,mBAAmB,EACnC,yBAAyB,EAAE;QAAE,CAAC,CAAC,EAAE,MAAM,GAAG,GAAG,CAAC;KAAE,EAChD,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,OAAO,EACvB,UAAU,CAAC,EAAE,qBAAqB;IAqHtC;;;;;;;;;;;;;OAaG;IACI,gBAAgB,CAAC,YAAY,EAAE,mBAAmB,EAAE,aAAa,EAAE,YAAY,EAAE,EACpF,UAAU,CAAC,EAAE,sBAAsB,GAAG,mBAAmB;IAK7D;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,2BAA2B;IAuKnC;;;;;;;;;;;;;;;;;;;OAmBG;IACH,OAAO,CAAC,yCAAyC;IAwEjD;;;;;OAKG;IACH,OAAO,CAAC,oCAAoC;IAkM5C;;;;;;;OAOG;IACI,sBAAsB,CAAC,qBAAqB,EAAE,mBAAmB;IAuBxE;;;;;;OAMG;IACI,yBAAyB,CAAC,cAAc,EAAE,OAAO;IAmHxD;;;;;;OAMG;IACH,OAAO,CAAC,uBAAuB;IAgB/B;;;OAGG;IACH,OAAO,CAAC,qCAAqC;IAoI7C;;;;;OAKG;IACI,kBAAkB;CAY5B"}

package/dist/changeset.js

@@ -559,7 +559,6 @@ class ChangeSet {
      * or updates the former state of a reversible changeset
      * @param in_context the traversal context
      */
-    // eslint-disable-next-line complexity
     _recursivelyBuildReversibleChangeSet(in_context) {
         const opType = in_context.getOperationType();
         if (opType === "modify") {
@@ -791,7 +790,6 @@ class ChangeSet {
      * @param in_withoutRoot - Bypass a fix where the root of a changeset is cleaned
      */
     _stripReversibleChangeSet(in_withoutRoot) {
-        // eslint-disable-next-line complexity
         const callback = function (in_context) {
             const opType = in_context.getOperationType();
             if (opType === "remove" || opType === "modify") {

package/dist/changeset.js.map

@@ -1 +1 @@
-{"version":3,"file":"changeset.js","sourceRoot":"","sources":["../src/changeset.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;;;;AAEH,+DAAuC;AACvC,+DAAuC;AACvC,yDAAoD;AACpD,6DAAqC;AACrC,2DAAmC;AACnC,uDAA+B;AAE/B,YAAY;AACZ,yEAAyF;AAEzF,yDAAsD;AACtD,wDAAuE;AAEvE,0FAAuF;AACvF,0FAA4E;AAC5E,2EAA2E;AAC3E,gFAA+F;AAC/F,8EAA2E;AAC3E,2DAAwD;AACxD,mCAAgC;AAChC,2DAAwD;AACxD,0EAAmF;AAEnF,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAEnD,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,GAAG,2BAAY,CAAC;AAsCzD;;;;GAIG;AACH,MAAa,SAAS;IAgBlB;;;OAGG;IACH,YAAY,UAA0B;QAClC,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,IAAI,EAAE;YACjD,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;SACtB;aAAM,IAAI,kBAAQ,CAAC,UAAU,CAAC,EAAE,EAAE,8BAA8B;YAC7D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;SAC1C;aAAM,IAAI,UAAU,YAAY,SAAS,EAAE;YACxC,IAAI,CAAC,QAAQ,GAAG,wBAAS,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;SAClD;aAAM;YACH,uBAAuB;YACvB,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;SAC9B;QAED,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC/B,CAAC;IAGD;;;OAGG;IACH,QAAQ;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IAAA,CAAC;IAGF;;;;OAIG;IACH,sBAAsB;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACH,eAAe,CAAC,eAAwB;QACpC,IAAI,CAAC,aAAa,GAAG,eAAe,CAAC;IACzC,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACH,eAAe;QACX,OAAO,IAAI,CAAC,aAAa,CAAC;IAC9B,CAAC;IAAA,CAAC;IAEF;;;;OAIG;IACH,KAAK;QACD,OAAO,IAAI,SAAS,CAAC,wBAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC;IAAA,CAAC;IAGF;;;;;;;;OAQG;IACH,cAAc,CAAC,YAAiC,EAAE,UAAkC;QAChF,IAAI,OAAO,GAAG,YAAY,CAAC;QAC3B,IAAI,YAAY,YAAY,SAAS,EAAE;YACnC,OAAO,GAAG,YAAY,CAAC,sBAAsB,EAAE,CAAC;SACnD;QAED,IAAI,CAAC,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YAC1D,MAAM,QAAQ,GAAG,kBAAQ,CAAC,OAAO,CAAC,IAAK,OAA+B,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAE,OAA+B,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9I,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;SACzE;aAAM;YACH,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;SAC9F;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;OASG;IACK,4BAA4B,CAChC,sBAA2C,EAC3C,yBAA8C,EAC9C,cAAuB,EACvB,UAAkC;QAClC,oCAAoC;QACpC,IAAI,yBAAyB,CAAC,MAAM;YAChC,yBAAyB,CAAC,MAAM;YAChC,yBAAyB,CAAC,MAAM,EAAE;YAClC,IAAI,CAAC,6CAA6C,CAAC,sBAAsB,EACrE,yBAAyB,EACzB,cAAc,EACd,UAAU,CAAC,CAAC,CAAC,0CAA0C;SAC9D;QAED,IAAI,CAAC,iBAAO,CAAC,yBAAyB,CAAC,eAAe,CAAC,EAAE;YACrD,sBAAsB,CAAC,eAAe,GAAG,sBAAsB,CAAC,eAAe,IAAI,EAAE,CAAC;YACtF,gBAAM,CAAC,sBAAsB,CAAC,eAAe,EAAE,yBAAyB,CAAC,eAAe,CAAC,CAAC;SAC7F;QAED,oCAAoC;QACpC,MAAM,eAAe,GAAG,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAClC,wDAAwD;YACxD,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE;gBACrC,SAAS;aACZ;YAED,sBAAsB,CAAC,MAAM,CAAC,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACtE,MAAM,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC;YACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,qCAAqC,CAAC,WAAW,CAAC,CAAC,CAAC,EACrD,WAAW,EACX,yBAAyB,CAAC,MAAM,CAAC,EACjC,MAAM,EACN,cAAc,EACd,UAAU,CAAC,CAAC;aACnB;YACD,8DAA8D;YAC9D,IAAI,cAAc,IAAI,iBAAO,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC3D,OAAO,sBAAsB,CAAC,MAAM,CAAC,CAAC;aACzC;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;OAQG;IACK,WAAW,CAAC,cAAmC,EAAE,UAAkB,EAAE,eAAoC;QAC7G,MAAM,QAAQ,GAAG,CAAC,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3E,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC;QAC5C,IAAI,cAAc,CAAC,UAAU,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;YAClF,cAAc,CAAC,UAAU,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;SAC/C;aAAM;YACH,IAAI,cAAc,CAAC,UAAU,CAAC,KAAK,SAAS;gBACxC,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;gBAC/D,cAAc,CAAC,UAAU,CAAC,GAAG;oBACzB,KAAK,EAAE,QAAQ;oBACf,QAAQ,EAAE,eAAe,CAAC,QAAQ;iBACrC,CAAC;aACL;iBAAM;gBACH,cAAc,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC;aACzC;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;OAWG;IACI,qCAAqC,CACxC,aAAqB,EACrB,cAAmC,EACnC,yBAAgD,EAChD,SAAiB,EACjB,cAAuB,EACvB,UAAkC;QAClC,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE9C,IAAI,WAAW,CAAC,OAAO,KAAK,KAAK;YAC7B,WAAW,CAAC,OAAO,KAAK,KAAK,EAAE;YAC/B,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;YACpE,IAAI,CAAC,6CAA6C,CAAC,cAAc,CAAC,aAAa,CAAC,EAC5E,yBAAyB,CAAC,aAAa,CAAC,EACxC,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;YAEhB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;gBAC1D,OAAO,cAAc,CAAC,aAAa,CAAC,CAAC;aACxC;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,OAAO,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;YAC3E,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjH,IAAI,eAAe,GAAG,KAAK,CAAC;YAC5B,IAAI,QAAQ,CAAC;YACb,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ;gBAC/B,CAAC,kBAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;oBACpC,CAAC,cAAc,CAAC,aAAa,CAAC,IAAI,cAAc,CAAC,aAAa,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/F,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC,QAAQ,CAAC;gBAClD,wEAAwE;gBACxE,yFAAyF;gBACzF,IAAI,cAAc,CAAC,aAAa,CAAC,IAAI,cAAc,CAAC,aAAa,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oBACxF,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,MAAM,EAAE;4BACJ,CAAC,CAAC,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC;yBAC3C;qBACJ,CAAC;iBACL;qBAAM;oBACH,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,MAAM,EAAE;4BACJ,CAAC,CAAC,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC;yBACrC;qBACJ,CAAC;iBACL;gBACD,eAAe,GAAG,IAAI,CAAC;aAC1B;YACD,IAAI,cAAc,GAAG,yBAAyB,CAAC,aAAa,CAAC,CAAC;YAC9D,IAAI,kBAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gBACpE,cAAc,GAAI,cAAsC,CAAC,KAAK,CAAC;aAClE;YAED,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,IAAI,kBAAQ,CAAC,cAAc,CAAC,EAAE;gBAC7D,2DAA2D;gBAC3D,IAAI,eAAe,IAAI,QAAQ,KAAK,SAAS,EAAE;oBAC3C,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,KAAK,EAAE,cAAc;wBACrB,QAAQ;qBACX,CAAC;iBACL;qBAAM;oBACH,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC;iBAClD;aACJ;iBAAM;gBACH,oDAAoD;gBACpD,IAAI,CAAC,iCAAiC,CAAC,cAAc,CAAC,aAAa,CAAC,EAChE,yBAAyB,CAAC,aAAa,CAAC,EACxC,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;gBAChB,IAAI,eAAe,EAAE;oBACjB,uEAAuE;oBACvE,IAAI,QAAQ,CAAC;oBACb,IAAI,iBAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;wBACxC,QAAQ,GAAG,EAAE,CAAC;qBACjB;yBAAM;wBACH,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACzD;oBACD,IAAI,QAAQ,KAAK,SAAS,EAAE;wBACxB,cAAc,CAAC,aAAa,CAAC,GAAG;4BAC5B,KAAK,EAAE,QAAQ;4BACf,QAAQ;yBACX,CAAC;qBACL;yBAAM;wBACH,cAAc,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;qBAC5C;iBACJ;aACJ;YAED,yDAAyD;YACzD,IAAI,cAAc,IAAI,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;gBAC7E,OAAO,cAAc,CAAC,aAAa,CAAC,CAAC;aACxC;SACJ;aAAM,IAAI,WAAW,CAAC,MAAM,EAAE;YAC3B,uCAAuC;YACvC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;SAC7F;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,QAAQ,EAAE;YACzC,IAAI,eAAe,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;gBACrC,8EAA8E;gBAC9E,4DAA4D;gBAC5D,IAAI,WAAW,CAAC,MAAM,KAAK,OAAO,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;oBACnE,IAAI,UAAU,GAAG,yBAAyB,CAAC,aAAa,CAAC,CAAC;oBAC1D,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBAClD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qBACjC;oBACD,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;iBACvE;qBAAM;oBACH,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;iBAC7F;aACJ;iBAAM;gBACH,IAAI,cAAc,CAAC,aAAa,CAAC,EAAE;oBAC/B,wDAAwD;oBACxD,IAAI,CAAC,4BAA4B,CAAC,cAAc,CAAC,aAAa,CAAC,EAC3D,yBAAyB,CAAC,aAAa,CAAC,EACxC,KAAK,EACL,UAAU,CAAC,CAAC;iBACnB;qBAAM;oBACH,qDAAqD;oBACrD,cAAc,CAAC,aAAa,CAAC,GAAG,wBAAS,CAAC,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;iBACvF;aACJ;SACJ;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;SAC9D;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;OAaG;IACI,gBAAgB,CAAC,YAAiC,EAAE,aAA6B,EACpF,UAAmC;QACnC,wEAAwE;QACxE,OAAO,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;IACxG,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;OAaG;IACK,2BAA2B,CAC/B,uBAA4C,EAC5C,0BAA+C,EAC/C,WAAmB,EACnB,aAA6B,EAC7B,UAAiC;QACjC,yCAAyC;QACzC,IAAI,CAAC,uBAAuB,CAAC,MAAM;YAC/B,uBAAuB,CAAC,MAAM;YAC9B,uBAAuB,CAAC,MAAM,CAAC;YAC/B,CAAC,0BAA0B,CAAC,MAAM;gBAC9B,0BAA0B,CAAC,MAAM;gBACjC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YACxC,IAAI,CAAC,4CAA4C,CAAC,uBAAuB,EACrE,0BAA0B,EAC1B,WAAW,EACX,cAAc,EAAE,0CAA0C;YAC1D,KAAK,EAAE,+CAA+C;YACtD,aAAa,EACb,UAAU,CAAC,CAAC;SACnB;QACD,IAAI,CAAC,iBAAO,CAAC,0BAA0B,CAAC,eAAe,CAAC,EAAE;YACtD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;YAExE,MAAM,yBAAyB,GAAG,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;YAE1D,MAAM,wBAAwB,GAAG;gBAC7B,IAAI,EAAE,SAAS,CAAC,YAAY,CAAC,kBAAkB;gBAC/C,iBAAiB,EAAE,yBAAyB;aAC/C,CAAC;YAEF,cAAI,CAAC,OAAO,EAAE,UAAS,MAAM;gBACzB,MAAM,QAAQ,GAAG,0BAA0B,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gBACpE,IAAI,uBAAuB,CAAC,eAAe;oBACvC,uBAAuB,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;oBACjD,MAAM,OAAO,GAAG,qCAAiB,CAAC,KAAK,CAAC,cAAc,CAClD,QAAQ,EACR,uBAAuB,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,CAC3D,CAAC;oBAEF,IAAI,CAAC,OAAO,EAAE;wBACV,IAAI,UAAU,IAAI,UAAU,CAAC,uBAAuB,EAAE;4BAClD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,MAAM,CAAC,CAAC;yBACnD;wBAED,yBAAyB,CAAC,eAAe,CAAC,MAAM,CAAC;4BAC7C,uBAAuB,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;wBAC7D,4EAA4E;wBAC5E,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,GAAG,MAAM,CAAC,CAAC;qBAChD;oBAED,OAAO,0BAA0B,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;iBAC7D;YACL,CAAC,CAAC,CAAC;YAEH,4CAA4C;YAC5C,IAAI,iBAAO,CAAC,0BAA0B,CAAC,eAAe,CAAC,EAAE;gBACrD,OAAO,0BAA0B,CAAC,eAAe,CAAC;aACrD;YAED,IAAI,CAAC,iBAAO,CAAC,wBAAwB,CAAC,iBAAiB,CAAC,eAAe,CAAC,EAAE;gBACtE,aAAa,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;aAChD;SACJ;QAED,mDAAmD;QACnD,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAE5D,mCAAmC;QACnC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC;YAE3D,2DAA2D;YAC3D,iEAAiE;YACjE,kDAAkD;YAClD,IAAI,MAAM,KAAK,QAAQ,IAAI,QAAQ,IAAI,0BAA0B,EAAE;gBAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;wBAC7B,UAAU,IAAI,0BAA0B,CAAC,MAAM,EAAE;wBACjD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;wBAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACvC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;gCAC/D,IAAI,kBAAkB,GAAG,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gCACrF,IAAI,kBAAQ,CAAC,kBAAkB,CAAC,IAAI,UAAU,IAAI,kBAAkB,EAAE;oCACjE,kBAA0C,CAAC,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;iCACzH;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;iBAAM,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE;gBAChC,0GAA0G;gBAC1G,8GAA8G;gBAC9G,0CAA0C;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,IAAI,MAAM,IAAI,0BAA0B,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,0BAA0B,CAAC,MAAM,CAAC,EAAE;wBACxF,IAAI,kBAAkB,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,IAAI,kBAAQ,CAAC,kBAAkB,CAAC,IAAI,UAAU,IAAI,kBAAkB,EAAE;4BAClE,+DAA+D;4BAC/D,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;gCACrD,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;gCACjD,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;6BAC3G;yBACJ;qBACJ;iBACJ;aACJ;YAED,6FAA6F;YAC7F,qCAAqC;YACrC,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,CAAC;gBACnC,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;gBACrC,SAAS;aACZ;YAED,sDAAsD;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACnC,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oBAC5D,uBAAuB,CAAC,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;oBAExE,MAAM,OAAO,GAAG,2BAAS,CAAC,WAAW,EACjC,KAAK,CAAC,CAAC,CAAC,EACR,uBAAuB,CAAC,CAAC;oBAC7B,+DAA+D;oBAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,yCAAyC,CAAC,KAAK,CAAC,CAAC,CAAC,EACvE,uBAAuB,CAAC,MAAM,CAAC,EAC/B,0BAA0B,CAAC,MAAM,CAAC,EAClC,MAAM,EACN,OAAO,EACP,IAAI,EACJ,aAAa,EACb,UAAU,CAAC,CAAC;oBAEhB,+EAA+E;oBAC/E,IAAI,WAAW,EAAE;wBACb,+DAA+D;wBAC/D,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBAE5C,oFAAoF;wBACpF,6FAA6F;wBAC7F,SAAS,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACtF;oBAED,yDAAyD;oBACzD,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;wBAC7C,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;qBAC7C;iBACJ;aACJ;SACJ;QAED,6DAA6D;QAC7D,IAAI,CAAC,iBAAO,CAAC,SAAS,CAAC,EAAE;YACrB,MAAM,QAAQ,GAAG;gBACb,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,SAAS,CAAC,YAAY,CAAC,aAAa;gBAC1C,iBAAiB,EAAE,SAAS;aAC/B,CAAC;YACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAChC;QAED,OAAO,0BAA0B,CAAC;IACtC,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;;;;;;;OAmBG;IACK,yCAAyC,CAC7C,MAAc,EACd,uBAA4C,EAC5C,0BAA+C,EAC/C,SAAiB,EACjB,WAAmB,EACnB,cAAuB,EACvB,aAAkB,EAClB,UAAiC;QACjC,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE9C,IAAI,WAAW,CAAC,OAAO,KAAK,KAAK;YAC7B,WAAW,CAAC,OAAO,KAAK,KAAK,EAAE;YAC/B,IAAI,CAAC,4CAA4C,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC7E,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,WAAW,CAAC,MAAM,EAClB,IAAI,EAAE,sBAAsB;YAC5B,aAAa,EACb,UAAU,CAAC,CAAC;YAEhB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,OAAO,EAAE;YACxC,IAAI,CAAC,gCAAgC,CAAC,uBAAuB,CAAC,MAAM,CAAC,EACjE,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,aAAa,EACb,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;YAChB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;YACxC,IAAI,CAAC,yBAAyB,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC1D,0BAA0B,EAAE,MAAM,EAClC,WAAW,EACX,aAAa,EACb,UAAU,CAAC,CAAC;YAChB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,QAAQ,EAAE;YACzC,sEAAsE;YACtE,IAAI,uBAAuB,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE;gBAC/C,IAAI,eAAe,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE;oBAC3D,OAAO,IAAI,CAAC;iBACf;qBAAM;oBACH,6CAA6C;oBAE7C,4BAA4B;oBAC5B,uBAAuB,CAAC,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;oBAExE,wCAAwC;oBACxC,IAAI,CAAC,2BAA2B,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC5D,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,aAAa,EACb,UAAU,CAAC,CAAC;iBACnB;aACJ;SACJ;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;SAC9D;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACH,sCAAsC;IAC9B,oCAAoC,CAAC,UAAkC;QAC3E,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,QAAQ,EAAE;YACrB,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9C,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;YAEtD,IAAI,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC;YACrD,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,MAAM,EAAE;gBAClD,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;aAC/C;iBAAM,IAAI,OAAO,EAAE;gBAChB,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,UAAU,EAAE;oBACtD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;iBAC5B;gBAED,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,OAAO,EAAE;oBACnD,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC;oBACrD,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;iBAC7D;qBAAM;oBACH,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;iBACnE;aACJ;YAED,UAAU,CAAC,WAAW,CAAC;gBACnB,aAAa,EAAE,OAAO;gBACtB,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ;aAC9C,CAAC,CAAC;YAEH,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,sCAAsC,CAAC,CAAC;iBACzG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC;gBAEvB,kCAAkC;gBAClC,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,EAAE;oBACjD,2BAA2B;oBAC3B,IAAI,SAAS,CAAC;oBACd,IAAI,kBAAQ,CAAC,QAAQ,CAAC,EAAE;wBACpB,SAAS,GAAG,QAAQ,CAAC;qBACxB;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAC3B,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;4BACpC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,WAAW,GAAG,WAAW,CAAC,CAAC;yBACtE;qBACJ;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAE3B,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BACjC,IAAI,kBAAQ,CAAC,iBAAiB,CAAC,EAAE;gCAC7B,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;6BACvC;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,WAAW,GAAG,iBAAiB,CAAC,CAAC;yBAC5E;qBACJ;iBACJ;qBAAM;oBACH,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBAC5D,eAAe,CAAC,QAAQ,GAAG,QAAQ,CAAC;qBACvC;yBAAM;wBACH,MAAM,YAAY,GAAG;4BACjB,KAAK,EAAE,eAAe;4BACtB,QAAQ;yBACX,CAAC;wBACF,UAAU,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;qBACnD;iBACJ;aACJ;iBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;gBACtC,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,kCAAkC,CAAC,CAAC;iBACrG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAE1D,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;gBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;wBACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAC3B,IAAI,UAAU,GAAG,EAAE,CAAC;4BACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACtC,UAAU,CAAC,IAAI,CAAC,wBAAS,CAAC,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;6BACzD;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;yBACzB;qBACJ;iBACJ;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC3B,IAAI,UAAU,GAAG,EAAE,CAAC;wBAEpB,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACjC,IAAI,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE;4BAClC,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;yBACvC;wBAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;4BACxC,UAAU,CAAC,IAAI,CAAC,wBAAS,CAAC,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;yBACzD;wBACD,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;qBACzB;iBACJ;aACJ;iBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK;gBAClC,gFAAgF;gBAChF,CAAC,eAAe,CAAC,MAAM;oBACnB,eAAe,CAAC,MAAM;oBACtB,eAAe,CAAC,MAAM,CAAC,EAAE;gBAC7B,2FAA2F;gBAC3F,4FAA4F;gBAC5F,gHAAgH;gBAChH,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,CAAC;oBACzC,eAAe,CAAC,MAAM,EAAE;oBACxB,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC;oBACpC,OAAO;iBACV;gBACD,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,gCAAgC,CAAC,CAAC;iBACnG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;gBAE9B,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;oBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;4BACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCAC5D,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;6BACvB;4BACD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG;gCACtC,KAAK,EAAE,KAAK;gCACZ,QAAQ,EAAE,wBAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;6BACjD,CAAC;yBACL;qBACJ;oBACD,IAAI,SAAS,GAAG,EAAE,CAAC;oBACnB,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;wBACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;4BAC7B,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;yBAC1C;wBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACzC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;yBACnE;wBACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;qBACtC;iBACJ;qBAAM;oBACH,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,oCAAoC;qBACvC;oBACD,IAAI,SAAS,GAAG,EAAE,CAAC;oBACnB,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;4BACvC,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;4BACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACzC,IAAI,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gCACjC,uCAAuC;gCACvC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gCAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCACzC,IAAI,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE;wCACtD,IAAI,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;wCAClD,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;4CAC5B,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;yCAClC;wCACD,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,KAAK,CAAC,CAAC;qCAChE;iCACJ;6BACJ;4BACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;yBACtC;6BAAM;4BACH,yEAAyE;4BACzE,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;4BACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCAC1C,IAAI,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gCACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCACzC,IAAI,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;oCACjC,IAAI,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;oCACnD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iCACnE;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;OAOG;IACI,sBAAsB,CAAC,qBAA0C;QACpE,8BAAY,CAAC,MAAM,CAAC,qBAAqB,KAAK,SAAS,EACnD,GAAG,GAAG,CAAC,gBAAgB,iFAAiF,CAAC,CAAC;QAE9G,IAAI,CAAC,kBAAQ,CAAC,qBAAqB,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,EAAE;YAC1E,IAAI,CAAC,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC1D,IAAI,CAAC,QAAQ,GAAG;oBACZ,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAqB;oBACtG,KAAK,EAAE,IAAI,CAAC,QAAQ;iBACvB,CAAC;aACL;iBAAM;gBACF,IAAI,CAAC,QAAgC,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC;oBACpH,qBAAqB,CAAC;aAC7B;SACJ;aAAM;YACH,MAAM,SAAS,GAAG,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CAAC;YACtD,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAC9C,WAAW,EAAE,IAAI,CAAC,oCAAoC;gBACtD,QAAQ,EAAE,SAAS;aACtB,CAAC,CAAC;SACN;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;OAMG;IACI,yBAAyB,CAAC,cAAuB;QACpD,sCAAsC;QACtC,MAAM,QAAQ,GAAG,UAAS,UAAU;YAChC,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;YAC7C,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,EAAE;gBAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,EAAE;oBACP,OAAO;iBACV;gBACD,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;gBAE9C,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE;oBACvB,mBAAmB;oBACnB,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,EAAE;wBACjD,2BAA2B;wBAE3B,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gCACtC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;6BACtB;yBACJ;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gCAEtC,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gCACjC,IAAI,kBAAQ,CAAC,iBAAiB,CAAC,EAAE;oCAC7B,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;iCACvC;gCACD,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC;6BAChC;yBACJ;wBACD,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BAC5D,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;yBAC5D;qBACJ;yBAAM,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBACnE,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;qBAC5D;iBACJ;qBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;oBACtC,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;yBACtB;qBACJ;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BACjC,IAAI,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE;gCAClC,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;6BACvC;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC;yBAChC;qBACJ;oBACD,+DAA+D;iBAClE;qBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK;oBAClC,CAAC,CAAC,cAAc,IAAI,SAAS,CAAC,OAAO,KAAK,QAAQ,CAAC,EAAE,EAAE,yCAAyC;oBAChG,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;wBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;4BACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCAC1C,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gCACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAC5D,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;iCACvB;gCACD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;6BACnD;yBACJ;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;4BACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC7B,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gCACvC,eAAe,CAAC,MAAM,GAAG,WAAW,CAAC;6BACxC;yBACJ;qBACJ;yBAAM;wBACH,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;wBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,oCAAoC;yBACvC;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;gCACxC,oDAAoD;gCACpD,IAAI,SAAS,GAAG,EAAE,CAAC;gCACnB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gCACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oCACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wCACzC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;qCAClC;iCACJ;gCACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;6BACtC;yBACJ;qBACJ;iBACJ;aACJ;QACL,CAAC,CAAC;QAEF,IAAI,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;YACtB,IAAI,CAAC,QAAgC,CAAC,QAAQ,KAAK,SAAS;YAC5D,IAAI,CAAC,QAAgC,CAAC,KAAK,KAAK,SAAS,EAAE;YAC5D,IAAI,CAAC,QAAQ,GAAI,IAAI,CAAC,QAAgC,CAAC,KAAK,CAAC;YAC7D,OAAO;SACV;QAED,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;YAC9C,WAAW,EAAE,QAAQ;SACxB,CAAC,CAAC;IACP,CAAC;IAAA,CAAC;IAEF;;;;;;OAMG;IACK,uBAAuB,CAAC,YAAiC,EAAE,qBAA8B;QAC7F,IAAI,KAAK,CAAC;QACV,IAAI,qBAAqB,EAAE;YACvB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;aAAM;YACH,KAAK,GAAG,EAAE,CAAC;YACX,cAAI,CAAC,YAAY,EAAE,UAAS,eAAe;gBACvC,cAAI,CAAC,eAAe,EAAE,UAAS,gBAAgB,EAAE,IAAI;oBACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;SACN;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAAA,CAAC;IAEF;;;OAGG;IACK,qCAAqC,CAAC,UAAkC;QAC5E,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;QAEvD,kFAAkF;QAClF,sEAAsE;QACtE,MAAM,sBAAsB,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAElF,IAAI,sBAAsB,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ,EAAE;YACtE,mEAAmE;YACnE,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC;YACpC,OAAO;SACV;QAED,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ;YAC1C,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ,EAAE;YAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;YAE9C,IAAI,CAAC,SAAS,EAAE;gBACZ,8BAAY,CAAC,MAAM,CAAC,KAAK,EACrB,GAAG,GAAG,CAAC,gBAAgB,uCAAuC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;aACnG;YAED,MAAM,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;YAExD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,QAAQ,CAAC;gBAC5C,CAAC,IAAI,KAAK,QAAQ,IAAI,kBAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,EAAE;gBAC3D,yDAAyD;gBACzD,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ;oBAC1C,CAAC,CAAC,kBAAQ,CAAC,eAAe,CAAC,IAAI,OAAQ,eAAuC,CAAC,QAAQ,KAAK,WAAW,CAAC,EAAE;oBAC1G,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;iBAC5C;gBAED,4BAA4B;gBAC5B,IAAI,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC;gBACnC,eAAe,CAAC,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC;gBACjD,eAAe,CAAC,KAAK,GAAG,GAAG,CAAC;aAC/B;iBAAM,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;gBACpG,4CAA4C;gBAC5C,MAAM,aAAa,GAAG,IAAI,+CAAsB,CAAC,eAAe,CAAC,CAAC;gBAClE,MAAM,eAAe,GAAwB,EAAE,CAAC;gBAChD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,qDAAqD;gBACrD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;oBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;wBACtC,KAAK,4CAA2B,CAAC,MAAM;4BACnC,iBAAiB;4BACjB,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;gCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;gCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;6BAC3C,CAAC,CAAC;4BACH,MAAM;wBACV,KAAK,4CAA2B,CAAC,MAAM;4BACnC,iBAAiB;4BACjB,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;gCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;gCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;6BAC3C,CAAC,CAAC;4BACH,MAAM;wBACV,KAAK,4CAA2B,CAAC,MAAM;4BACnC,kBAAkB;4BAClB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;gCACnC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;oCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;oCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;oCACxC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;iCAC3C,CAAC,CAAC;6BACN;iCAAM;gCACH,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;oCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;oCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;iCAC3C,CAAC,CAAC;6BACN;4BACD,MAAM;wBACV;4BACI,OAAO,CAAC,KAAK,CAAC,mBAAmB,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;qBACpG;oBACD,aAAa,CAAC,IAAI,EAAE,CAAC;iBACxB;gBACD,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC;aACtD;iBAAM;gBACH,mCAAmC;gBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK,EAAE;wBAClE,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;4BACtD,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC;4BACtB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;4BAC7B,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC;yBACxB;qBACJ;iBACJ;gBACD,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC;gBACzC,IAAI,cAAc,GAAG,KAAK,CAAC;gBAC3B,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;oBAChD,cAAc,GAAG,IAAI,CAAC;oBACtB,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;oBACnC,OAAO,eAAe,CAAC,MAAM,CAAC;oBAC9B,MAAM,iBAAiB,GAAG,eAAe,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;oBAC9E,cAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAAE,UAAS,IAAI;wBACvF,MAAM,QAAQ,GAAG,2BAAS,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;wBACpF,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;oBAC9C,CAAC,CAAC,CAAC;iBACN;gBACD,IAAI,SAAS,EAAE;oBACX,IAAI,cAAc,EAAE;wBAChB,eAAe,CAAC,MAAM,GAAG,wBAAS,CAAC,SAAS,CAAC,CAAC;qBACjD;yBAAM;wBACH,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;wBACnC,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;wBACnC,OAAO,eAAe,CAAC,MAAM,CAAC;qBACjC;oBACD,MAAM,iBAAiB,GAAG,eAAe,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;oBAC9E,cAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAAE,UAAS,IAAI;wBACvF,MAAM,QAAQ,GAAG,2BAAS,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;wBACpF,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;oBAC9C,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACI,kBAAkB;QACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,KAAK,SAAS;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,EAAE;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;SAChC;aAAM;YACH,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAC9C,WAAW,EAAE,IAAI,CAAC,qCAAqC,CAAC,IAAI,CAAC,IAAI,CAAC;aACrE,CAAC,CAAC;SACN;IACL,CAAC;;AA9nCL,8BA+nCC;AA9nCU,sBAAY,GAAG,qCAAY,CAAC;AAC5B,0BAAgB,GAAG,mCAAgB,CAAC;AACpC,2BAAiB,GAAG,qCAAiB,CAAC;AA+nCjD,SAAS,CAAC,SAAS,CAAC,iCAAiC,GAAG,+BAAuB,CAAC,iCAAiC,CAAC;AAClH,SAAS,CAAC,SAAS,CAAC,gCAAgC,GAAG,+BAAuB,CAAC,gCAAgC,CAAC;AAChH,SAAS,CAAC,SAAS,CAAC,yBAAyB,GAAG,+BAAuB,CAAC,yBAAyB,CAAC;AAElG,2EAA2E;AAC3E,SAAS,CAAC,SAAS,CAAC,6CAA6C;IAC7D,uDAAmC,CAAC,6CAA6C,CAAC;AACtF,SAAS,CAAC,SAAS,CAAC,gCAAgC;IAChD,uDAAmC,CAAC,gCAAgC,CAAC;AACzE,SAAS,CAAC,SAAS,CAAC,4CAA4C;IAC5D,uDAAmC,CAAC,4CAA4C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Serialized representation of the changes in a repository\n */\n\nimport isObject from \"lodash/isObject\";\nimport isString from \"lodash/isString\";\nimport {copy as cloneDeep} from \"fastest-json-copy\";\nimport isEmpty from \"lodash/isEmpty\";\nimport extend from \"lodash/extend\";\nimport each from \"lodash/each\";\n\n//@ts-ignore\nimport { ConsoleUtils, joinPaths, constants } from \"@fluid-experimental/property-common\";\n\nimport { TypeIdHelper } from \"./helpers/typeidHelper\";\nimport { ChangeSetArrayFunctions } from './changeset_operations/array';\n\nimport { ArrayChangeSetIterator } from \"./changeset_operations/arrayChangesetIterator\";\nimport { ConflictType } from './changeset_operations/changesetConflictTypes'\n// Add the indexed collection functions into the prototype of the ChangeSet\nimport { ChangeSetIndexedCollectionFunctions } from \"./changeset_operations/indexedCollection\";\nimport { isEmptyChangeSet } from \"./changeset_operations/isEmptyChangeset\";\nimport { isReservedKeyword } from \"./isReservedKeyword\";\nimport { Utils } from \"./utils\";\nimport { TemplateValidator } from \"./templateValidator\";\nimport { ArrayIteratorOperationTypes } from \"./changeset_operations/operationTypes\"\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\nconst { extractContext, isPrimitiveType } = TypeIdHelper;\n\n\nexport interface ApplyChangeSetOptions {\n    /**\n     * Additional meta information which help later to obtain more compact changeset during the apply operation.\n     */\n    applyAfterMetaInformation?: Map<any, any>,\n\n    /**\n     * Throw error for template definition mismatches.\n     */\n    throwOnTemplateMismatch?: boolean\n}\n\n\nexport interface RebaseChangeSetOptions extends ApplyChangeSetOptions {\n    rebaseMetaInformation?: object\n}\n\n/**\n * The plain serialization data structure used to encode a ChangeSet.\n */\nexport type SerializedChangeSet = any; //@TODO Maybe we should add full type for the ChangeSet\nexport type ChangeSetType = any;\nexport interface ConflictInfo {\n    /**\n     * Path to the position where the conflict occurred. If the conflicting change is of type\n     * MISMATCH_TEMPLATES then the path will be undefined.\n     */\n    path?: string | undefined;\n    /**\n     * Type of the conflict\n     */\n    type: ConflictType;\n    conflictingChange?: SerializedChangeSet;\n}\n\n/**\n * The ChangeSet represents an operation to be done (or that was done) on the data. It encapsulate one or\n * many addition/insertion and deletion of properties. The ChangeSetObject also provides functionality\n * to merge and swap change sets.\n */\nexport class ChangeSet {\n    static ConflictType = ConflictType;\n    static isEmptyChangeSet = isEmptyChangeSet;\n    static isReservedKeyword = isReservedKeyword;\n\n    declare public _cleanIndexedCollectionChangeSet: typeof ChangeSetIndexedCollectionFunctions._cleanIndexedCollectionChangeSet;\n    declare public _performApplyAfterOnPropertyArray: typeof ChangeSetArrayFunctions._performApplyAfterOnPropertyArray;\n    declare public _rebaseArrayChangeSetForProperty: typeof ChangeSetArrayFunctions._rebaseArrayChangeSetForProperty;\n    declare public _rebaseChangeSetForString: typeof ChangeSetArrayFunctions._rebaseChangeSetForString;\n    declare public _performApplyAfterOnPropertyIndexedCollection: typeof ChangeSetIndexedCollectionFunctions._performApplyAfterOnPropertyIndexedCollection;\n    declare public _rebaseIndexedCollectionChangeSetForProperty: typeof ChangeSetIndexedCollectionFunctions._rebaseIndexedCollectionChangeSetForProperty;\n\n\n    _changes: SerializedChangeSet;\n    _isNormalized: boolean;\n\n    /**\n     * @param [in_changes] - The serialized changes to store in this change set if a string is supplied,\n     * we assume it to be a serialized JSON representation of the change set. If none is supplied, an empty changeset will be created.\n     */\n    constructor(in_changes?: ChangeSetType) {\n        if (in_changes === undefined || in_changes === null) {\n            this._changes = {};\n        } else if (isString(in_changes)) { // Stringified Serialized JSON\n            this._changes = JSON.parse(in_changes);\n        } else if (in_changes instanceof ChangeSet) {\n            this._changes = cloneDeep(in_changes._changes);\n        } else {\n            // Serialized Changeset\n            this._changes = in_changes;\n        }\n\n        this._isNormalized = false;\n    }\n\n\n    /**\n     * Creates a string representation of the change set\n     * @returns JSON encoding of the changes in this change set\n     */\n    toString(): string {\n        return JSON.stringify(this._changes);\n    };\n\n\n    /**\n     * Returns the serialized changes.\n     *\n     * @returns The serialized changeset\n     */\n    getSerializedChangeSet(): SerializedChangeSet {\n        return this._changes;\n    };\n\n    /**\n     * Indicates whether this is a normalized ChangeSet. If this is set to true, squashes will not remove empty entries\n     * from the ChangeSet.\n     *\n     * @param in_isNormalized - is this a normalized ChangeSet?\n     */\n    setIsNormalized(in_isNormalized: boolean) {\n        this._isNormalized = in_isNormalized;\n    };\n\n    /**\n     * Indicates whether this is a normalized ChangeSet. If this is set to true, squashes will not remove empty entries\n     * from the ChangeSet.\n     *\n     * @returns Is this a normalized ChangeSet?\n     */\n    getIsNormalized(): boolean {\n        return this._isNormalized;\n    };\n\n    /**\n     * Clones the ChangeSet\n     *\n     * @returns The cloned ChangeSet\n     */\n    clone(): ChangeSet {\n        return new ChangeSet(cloneDeep(this._changes));\n    };\n\n\n    /**\n     * Updates this ChangeSet. The result will be the concatenation of the two ChangeSets. First the changes in this\n     * ChangeSet are executed, then the changes in the supplied in_changeSet are applied. The result will be\n     * stored in this ChangeSet. This function assumes that the second ChangeSet is relative to the state after\n     * application of the first ChangeSet.\n     *\n     * @param in_changeSet - The changeset to apply\n     * @param in_options - Optional additional parameters\n     */\n    applyChangeSet(in_changeSet: SerializedChangeSet, in_options?: ApplyChangeSetOptions) {\n        let changes = in_changeSet;\n        if (in_changeSet instanceof ChangeSet) {\n            changes = in_changeSet.getSerializedChangeSet();\n        }\n\n        if (!isObject(this._changes) || Array.isArray(this._changes)) {\n            const oldValue = isObject(changes) && (changes as SerializedChangeSet).value !== undefined ? (changes as SerializedChangeSet).value : changes;\n            this._changes = Array.isArray(oldValue) ? oldValue.slice() : oldValue;\n        } else {\n            this._performApplyAfterOnProperty(this._changes, changes, !this._isNormalized, in_options);\n        }\n    };\n\n    /**\n     * Applies a changeset to a given property (recursively). The ChangeSet is assumed to be relative to the same\n     * property root and it will be applied behind the base ChangeSet (assuming that the changes are relative to the\n     * state after the base ChangeSet has been applied. It will change the base ChangeSet.)\n     *\n     * @param io_basePropertyChanges    - The ChangeSet describing the initial state\n     * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n     * @param in_removeEmpty            - Should empty ChangeSets be removed?\n     * @param in_options - Optional additional parameters\n     */\n    private _performApplyAfterOnProperty(\n        io_basePropertyChanges: SerializedChangeSet,\n        in_appliedPropertyChanges: SerializedChangeSet,\n        in_removeEmpty: boolean,\n        in_options?: ApplyChangeSetOptions) {\n        // Apply dynamic property operations\n        if (in_appliedPropertyChanges.insert ||\n            in_appliedPropertyChanges.modify ||\n            in_appliedPropertyChanges.remove) {\n            this._performApplyAfterOnPropertyIndexedCollection(io_basePropertyChanges,\n                in_appliedPropertyChanges,\n                \"NodeProperty\",\n                in_options); // TODO: recursively propagate the typeid?\n        }\n\n        if (!isEmpty(in_appliedPropertyChanges.insertTemplates)) {\n            io_basePropertyChanges.insertTemplates = io_basePropertyChanges.insertTemplates || {};\n            extend(io_basePropertyChanges.insertTemplates, in_appliedPropertyChanges.insertTemplates);\n        }\n\n        // Apply ChangeSet to the properties\n        const modifiedTypeids = Object.keys(in_appliedPropertyChanges);\n        for (let i = 0; i < modifiedTypeids.length; i++) {\n            const typeid = modifiedTypeids[i];\n            // The reserved keywords have already been handled above\n            if (ChangeSet.isReservedKeyword(typeid)) {\n                continue;\n            }\n\n            io_basePropertyChanges[typeid] = io_basePropertyChanges[typeid] || {};\n            const baseChanges = io_basePropertyChanges[typeid];\n            const changedKeys = Object.keys(in_appliedPropertyChanges[typeid]);\n            for (let j = 0; j < changedKeys.length; j++) {\n                this.performApplyAfterOnPropertyWithTypeid(changedKeys[j],\n                    baseChanges,\n                    in_appliedPropertyChanges[typeid],\n                    typeid,\n                    in_removeEmpty,\n                    in_options);\n            }\n            // Remove the type when it no longer contains any changed keys\n            if (in_removeEmpty && isEmpty(io_basePropertyChanges[typeid])) {\n                delete io_basePropertyChanges[typeid];\n            }\n        }\n    };\n\n    /**\n     * Helper function used to apply a new value to a given ChangeSet.\n     * It is used to handle setting a primitive value, which might either be represented\n     * via a literal or an object with a member value.\n     * applies in_appliedValue to the io_baseChanges at the given in_baseKey\n     * @param io_baseChanges - base changes (modified)\n     * @param in_baseKey - key\n     * @param in_appliedValue - applied changes to be applied\n     */\n    private _applyValue(io_baseChanges: SerializedChangeSet, in_baseKey: string, in_appliedValue: SerializedChangeSet) {\n        const newValue = (in_appliedValue && in_appliedValue.hasOwnProperty(\"value\")) ?\n            in_appliedValue.value : in_appliedValue;\n        if (io_baseChanges[in_baseKey] && io_baseChanges[in_baseKey].hasOwnProperty(\"value\")) {\n            io_baseChanges[in_baseKey].value = newValue;\n        } else {\n            if (io_baseChanges[in_baseKey] === undefined &&\n                in_appliedValue && in_appliedValue.hasOwnProperty(\"oldValue\")) {\n                io_baseChanges[in_baseKey] = {\n                    value: newValue,\n                    oldValue: in_appliedValue.oldValue,\n                };\n            } else {\n                io_baseChanges[in_baseKey] = newValue;\n            }\n        }\n    };\n\n    /**\n     * Decides based on the given Typeid which applyAfter operation to perform.\n     * Note: This function is not directly called on the ChangeSet but on the object containing it together with a key\n     *       since it needs to be able to overwrite this entry\n     *\n     * @param in_changedKey             - The key of the entry in the object\n     * @param in_baseChanges            - The object containing the state before the applyAfter\n     * @param in_appliedPropertyChanges - The object containing the ChangeSet with the modification\n     * @param in_typeid                 - The typeid of the property to modify\n     * @param in_removeEmpty            - Should empty ChangeSets be removed?\n     * @param in_options - Optional additional parameters\n     */\n    public performApplyAfterOnPropertyWithTypeid(\n        in_changedKey: string,\n        in_baseChanges: SerializedChangeSet,\n        in_appliedPropertyChanges: { [x: string]: any; },\n        in_typeid: string,\n        in_removeEmpty: boolean,\n        in_options?: ApplyChangeSetOptions) {\n        const splitTypeid = extractContext(in_typeid);\n\n        if (splitTypeid.context === \"set\" ||\n            splitTypeid.context === \"map\") {\n            in_baseChanges[in_changedKey] = in_baseChanges[in_changedKey] || {};\n            this._performApplyAfterOnPropertyIndexedCollection(in_baseChanges[in_changedKey],\n                in_appliedPropertyChanges[in_changedKey],\n                splitTypeid.typeid,\n                in_options);\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(in_baseChanges[in_changedKey])) {\n                delete in_baseChanges[in_changedKey];\n            }\n        } else if (splitTypeid.context === \"array\" || splitTypeid.typeid === \"String\") {\n            in_baseChanges[in_changedKey] = in_baseChanges[in_changedKey] !== undefined ? in_baseChanges[in_changedKey] : {};\n            let baseIsSetChange = false;\n            let oldValue;\n            if (splitTypeid.typeid === \"String\" &&\n                (isString(in_baseChanges[in_changedKey]) ||\n                    (in_baseChanges[in_changedKey] && in_baseChanges[in_changedKey].hasOwnProperty(\"value\")))) {\n                oldValue = in_baseChanges[in_changedKey].oldValue;\n                // we need to convert the format to allow the application of the changes\n                // since _performApplyAfterOnPropertyArray only understands insert/modify/remove commands\n                if (in_baseChanges[in_changedKey] && in_baseChanges[in_changedKey].hasOwnProperty(\"value\")) {\n                    in_baseChanges[in_changedKey] = {\n                        insert: [\n                            [0, in_baseChanges[in_changedKey].value],\n                        ],\n                    };\n                } else {\n                    in_baseChanges[in_changedKey] = {\n                        insert: [\n                            [0, in_baseChanges[in_changedKey]],\n                        ],\n                    };\n                }\n                baseIsSetChange = true;\n            }\n            let appliedChanges = in_appliedPropertyChanges[in_changedKey];\n            if (isObject(appliedChanges) && appliedChanges.hasOwnProperty(\"value\")) {\n                appliedChanges = (appliedChanges as SerializedChangeSet).value;\n            }\n\n            if (splitTypeid.typeid === \"String\" && isString(appliedChanges)) {\n                // we've got a 'set' command and just overwrite the changes\n                if (baseIsSetChange && oldValue !== undefined) {\n                    in_baseChanges[in_changedKey] = {\n                        value: appliedChanges,\n                        oldValue,\n                    };\n                } else {\n                    in_baseChanges[in_changedKey] = appliedChanges;\n                }\n            } else {\n                // we have incremental changes (or a standard array)\n                this._performApplyAfterOnPropertyArray(in_baseChanges[in_changedKey],\n                    in_appliedPropertyChanges[in_changedKey],\n                    splitTypeid.typeid,\n                    in_options);\n                if (baseIsSetChange) {\n                    // we have to convert back to a string, if it had been converted before\n                    let newValue;\n                    if (isEmpty(in_baseChanges[in_changedKey])) {\n                        newValue = \"\";\n                    } else {\n                        newValue = in_baseChanges[in_changedKey].insert[0][1];\n                    }\n                    if (oldValue !== undefined) {\n                        in_baseChanges[in_changedKey] = {\n                            value: newValue,\n                            oldValue,\n                        };\n                    } else {\n                        in_baseChanges[in_changedKey] = newValue;\n                    }\n                }\n            }\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && ChangeSet.isEmptyChangeSet(in_baseChanges[in_changedKey])) {\n                delete in_baseChanges[in_changedKey];\n            }\n        } else if (splitTypeid.isEnum) {\n            // Enum types can simply be overwritten\n            this._applyValue(in_baseChanges, in_changedKey, in_appliedPropertyChanges[in_changedKey]);\n        } else if (splitTypeid.context === \"single\") {\n            if (isPrimitiveType(splitTypeid.typeid)) {\n                // Primitive types can simply be overwritten, however we have an exception for\n                // 64 bit integers (until javascript natively supports them)\n                if (splitTypeid.typeid === \"Int64\" || splitTypeid.typeid === \"Uint64\") {\n                    let appliedVal = in_appliedPropertyChanges[in_changedKey];\n                    if (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n                        appliedVal = appliedVal.value;\n                    }\n                    this._applyValue(in_baseChanges, in_changedKey, appliedVal.slice());\n                } else {\n                    this._applyValue(in_baseChanges, in_changedKey, in_appliedPropertyChanges[in_changedKey]);\n                }\n            } else {\n                if (in_baseChanges[in_changedKey]) {\n                    // Otherwise we have to continue the merging recursively\n                    this._performApplyAfterOnProperty(in_baseChanges[in_changedKey],\n                        in_appliedPropertyChanges[in_changedKey],\n                        false,\n                        in_options);\n                } else {\n                    // If the key doesn't exist, yet, we can just copy it\n                    in_baseChanges[in_changedKey] = cloneDeep(in_appliedPropertyChanges[in_changedKey]);\n                }\n            }\n        } else {\n            throw new Error(MSG.UNKNOWN_CONTEXT + splitTypeid.context);\n        }\n    };\n\n    /**\n     * Rebases a given ChangeSet behind the current ChangeSet.\n     *\n     * This function takes a ChangeSet which is assumed to be relative to the same base state as the ChangeSet stored in\n     * this class and transforms it in such a way that it can be applied after this ChangeSet. The function will modify\n     * the supplied ChangeSet\n     *\n     * @param io_changeSet   -\n     *     The ChangeSet that is rebased behind the state obtained by application of this ChangeSet\n     * @param out_conflicts A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @returns The rebased ChangeSet (the same object as io_changeSet, it will be\n     *     modified in place)\n     */\n    public _rebaseChangeSet(io_changeSet: SerializedChangeSet, out_conflicts: ConflictInfo[],\n        in_options?: RebaseChangeSetOptions): SerializedChangeSet {\n        // We actually only pass this request to the recursive internal function\n        return this._rebaseChangeSetForProperty(this._changes, io_changeSet, \"\", out_conflicts, in_options);\n    };\n\n    /**\n     * Internal helper function that performs a rebase on a single property\n     *\n     * @param in_ownPropertyChangeSet -\n     *     The ChangeSet for the property stored in this class\n     * @param io_rebasePropertyChangeSet -\n     *     The ChangeSet for the property to be rebased\n     * @param in_basePath -\n     *     Base path to get to the property processed by this function\n     * @param out_conflicts -\n     *     A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @returns The rebased ChangeSet for this property\n     */\n    private _rebaseChangeSetForProperty(\n        in_ownPropertyChangeSet: SerializedChangeSet,\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_basePath: string,\n        out_conflicts: ConflictInfo[],\n        in_options: ApplyChangeSetOptions): SerializedChangeSet {\n        // Process the children in this ChangeSet\n        if ((in_ownPropertyChangeSet.insert ||\n            in_ownPropertyChangeSet.modify ||\n            in_ownPropertyChangeSet.remove) &&\n            (io_rebasePropertyChangeSet.insert ||\n                io_rebasePropertyChangeSet.modify ||\n                io_rebasePropertyChangeSet.remove)) {\n            this._rebaseIndexedCollectionChangeSetForProperty(in_ownPropertyChangeSet,\n                io_rebasePropertyChangeSet,\n                in_basePath,\n                \"NodeProperty\", // TODO: recursively propagate the typeid?\n                false, // don't use square brackets (use dots instead)\n                out_conflicts,\n                in_options);\n        }\n        if (!isEmpty(io_rebasePropertyChangeSet.insertTemplates)) {\n            const typeids = Object.keys(io_rebasePropertyChangeSet.insertTemplates);\n\n            const templateMismatchChangeSet = { insertTemplates: {} };\n\n            const templateMismatchConflict = {\n                type: ChangeSet.ConflictType.MISMATCH_TEMPLATES,\n                conflictingChange: templateMismatchChangeSet,\n            };\n\n            each(typeids, function(typeid) {\n                const template = io_rebasePropertyChangeSet.insertTemplates[typeid];\n                if (in_ownPropertyChangeSet.insertTemplates &&\n                    in_ownPropertyChangeSet.insertTemplates[typeid]) {\n                    const isEqual = TemplateValidator.Utils.psetDeepEquals(\n                        template,\n                        in_ownPropertyChangeSet.insertTemplates[template.typeid],\n                    );\n\n                    if (!isEqual) {\n                        if (in_options && in_options.throwOnTemplateMismatch) {\n                            throw new Error(MSG.TEMPLATE_MISMATCH + typeid);\n                        }\n\n                        templateMismatchChangeSet.insertTemplates[typeid] =\n                            in_ownPropertyChangeSet.insertTemplates[template.typeid];\n                        // TODO: Remove this warning message once we offer a conflict resolution API\n                        console.warn(MSG.TEMPLATE_MISMATCH + typeid);\n                    }\n\n                    delete io_rebasePropertyChangeSet.insertTemplates[typeid];\n                }\n            });\n\n            // Remove insertTemplates key if it is empty\n            if (isEmpty(io_rebasePropertyChangeSet.insertTemplates)) {\n                delete io_rebasePropertyChangeSet.insertTemplates;\n            }\n\n            if (!isEmpty(templateMismatchConflict.conflictingChange.insertTemplates)) {\n                out_conflicts.push(templateMismatchConflict);\n            }\n        }\n\n        // Check for collisions in the property assignments\n        const changedTypeids = Object.keys(in_ownPropertyChangeSet);\n\n        // We currently do not yet have any\n        const changeSet = {};\n        for (let i = 0; i < changedTypeids.length; i++) {\n            const typeid = changedTypeids[i];\n            const paths = Object.keys(in_ownPropertyChangeSet[typeid]);\n\n            // Update the oldValue of primitive property of a changeset\n            // for simple changeset with 'modify', property type, name, value\n            // find the oldValue of the property and update it\n            if (typeid === \"modify\" && \"modify\" in io_rebasePropertyChangeSet) {\n                for (let j = 0; j < paths.length; j++) {\n                    const tempTypeid = paths[i];\n                    if ((isPrimitiveType(tempTypeid)) &&\n                        tempTypeid in io_rebasePropertyChangeSet.modify) {\n                        const tempPaths = Object.keys(in_ownPropertyChangeSet.modify[tempTypeid]);\n                        for (let z = 0; z < tempPaths.length; z++) {\n                            if (tempPaths[z] in io_rebasePropertyChangeSet.modify[tempTypeid]) {\n                                let rebasedPropContent = io_rebasePropertyChangeSet.modify[tempTypeid][tempPaths[z]];\n                                if (isObject(rebasedPropContent) && \"oldValue\" in rebasedPropContent) {\n                                    (rebasedPropContent as SerializedChangeSet).oldValue = in_ownPropertyChangeSet.modify[tempTypeid][tempPaths[z]].value;\n                                }\n                            }\n                        }\n                    }\n                }\n            } else if (isPrimitiveType(typeid)) {\n                // for complex changeset, the function will be called recursively, when the function is at the level where\n                // io_rebasePropertyChangeSet && in_ownPropertyChangeSet contain only property type, name and value, we update\n                // oldValue of io_rebasePropertyChangeSet.\n                for (let j = 0; j < paths.length; j++) {\n                    if (typeid in io_rebasePropertyChangeSet && paths[j] in io_rebasePropertyChangeSet[typeid]) {\n                        let rebasedPropContent = io_rebasePropertyChangeSet[typeid][paths[j]];\n                        if (isObject(rebasedPropContent) && \"oldValue\" in rebasedPropContent) {\n                            // if oldValue already be update above, we don't need to update\n                            if (io_rebasePropertyChangeSet[typeid][paths[j]].oldValue !==\n                                in_ownPropertyChangeSet[typeid][paths[j]].value) {\n                                io_rebasePropertyChangeSet[typeid][paths[j]].oldValue = in_ownPropertyChangeSet[typeid][paths[j]].value;\n                            }\n                        }\n                    }\n                }\n            }\n\n            // The reserved keywords have already been handled above and changes which are not present in\n            // the other ChangeSet can be ignored\n            if (ChangeSet.isReservedKeyword(typeid) ||\n                !io_rebasePropertyChangeSet[typeid]) {\n                continue;\n            }\n\n            // Check, whether we have a collision in a path update\n            for (let j = 0; j < paths.length; j++) {\n                if (io_rebasePropertyChangeSet[typeid][paths[j]] !== undefined) {\n                    in_ownPropertyChangeSet[typeid] = in_ownPropertyChangeSet[typeid] || {};\n\n                    const newPath = joinPaths(in_basePath,\n                        paths[j],\n                        PROPERTY_PATH_DELIMITER);\n                    // Perform the rebase operation on the ChangeSet for this entry\n                    const setConflict = this.rebaseChangeSetForPropertyEntryWithTypeid(paths[j],\n                        in_ownPropertyChangeSet[typeid],\n                        io_rebasePropertyChangeSet[typeid],\n                        typeid,\n                        newPath,\n                        true,\n                        out_conflicts,\n                        in_options);\n\n                    // If there has been a non-recursive set collision we handle it here separately\n                    if (setConflict) {\n                        // If we have two writes to primitive types, this is a conflict\n                        changeSet[typeid] = changeSet[typeid] || {};\n\n                        // Store the change. Note: We make a deep copy here, as this is a reference into our\n                        // own internal ChangeSet and we want to be sure, nobody changes our internal data-structures\n                        changeSet[typeid][paths[j]] = cloneDeep(in_ownPropertyChangeSet[typeid][paths[j]]);\n                    }\n\n                    // Remove the typeid, when it no longer contains any keys\n                    if (isEmpty(io_rebasePropertyChangeSet[typeid])) {\n                        delete io_rebasePropertyChangeSet[typeid];\n                    }\n                }\n            }\n        }\n\n        // If there were conflicts in the set operations, report them\n        if (!isEmpty(changeSet)) {\n            const conflict = {\n                path: in_basePath,\n                type: ChangeSet.ConflictType.COLLIDING_SET,\n                conflictingChange: changeSet,\n            };\n            out_conflicts.push(conflict);\n        }\n\n        return io_rebasePropertyChangeSet;\n    };\n\n    /**\n     * Decides based on the given Typeid which rebase operation to perform\n     * Note: This function is not directly called on the ChangeSet but on the object containing it together with a key\n     *       since it needs to be able to overwrite this entry\n     *\n     * @param in_key                          - The key of the entry in the object\n     * @param in_ownPropertyChangeSet         - The object containing the ChangeSet for the property\n     *                                                   stored in this class\n     * @param io_rebasePropertyChangeSet      - The object containing the ChangeSet for the property to\n     *                                                   be rebased\n     * @param in_typeid                       - The typeid of the property to rebase\n     * @param in_basePath                     - Base path to get to the property processed by this function\n     * @param in_removeEmpty                 - Should empty ChangeSets be removed?\n     * @param out_conflicts - A list of paths that resulted in\n     *                                                   conflicts together with the type of the conflict\n     *\n     * @returns Has there been a simple set collision? Those have to be handled separately\n     *                   TODO: We should unify the handling of set collisions\n     * @private\n     */\n    private rebaseChangeSetForPropertyEntryWithTypeid(\n        in_key: string,\n        in_ownPropertyChangeSet: SerializedChangeSet,\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_typeid: string,\n        in_basePath: string,\n        in_removeEmpty: boolean,\n        out_conflicts: any,\n        in_options: ApplyChangeSetOptions): boolean {\n        const splitTypeid = extractContext(in_typeid);\n\n        if (splitTypeid.context === \"set\" ||\n            splitTypeid.context === \"map\") {\n            this._rebaseIndexedCollectionChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet[in_key],\n                in_basePath,\n                splitTypeid.typeid,\n                true, // use square brackets\n                out_conflicts,\n                in_options);\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.context === \"array\") {\n            this._rebaseArrayChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet[in_key],\n                in_basePath,\n                out_conflicts,\n                splitTypeid.typeid,\n                in_options);\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.typeid === \"String\") {\n            this._rebaseChangeSetForString(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet, in_key,\n                in_basePath,\n                out_conflicts,\n                in_options);\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.context === \"single\") {\n            // We only can have a conflict when the path exists in both ChangeSets\n            if (in_ownPropertyChangeSet[in_key] !== undefined) {\n                if (isPrimitiveType(splitTypeid.typeid) || splitTypeid.isEnum) {\n                    return true;\n                } else {\n                    // Otherwise, we have to continue recursively\n\n                    // Make sure the paths exist\n                    in_ownPropertyChangeSet[in_key] = in_ownPropertyChangeSet[in_key] || {};\n\n                    // And then perform the recursive rebase\n                    this._rebaseChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                        io_rebasePropertyChangeSet[in_key],\n                        in_basePath,\n                        out_conflicts,\n                        in_options);\n                }\n            }\n        } else {\n            throw new Error(MSG.UNKNOWN_CONTEXT + splitTypeid.context);\n        }\n\n        return false;\n    };\n\n    /**\n     * recursive helper function for ChangeSet.prototype._toReversibleChangeSet\n     * which converts a irreversible changeset to a reversible changeset\n     * or updates the former state of a reversible changeset\n     * @param in_context the traversal context\n     */\n    // eslint-disable-next-line complexity\n    private _recursivelyBuildReversibleChangeSet(in_context: Utils.TraversalContext) {\n        const opType = in_context.getOperationType();\n        if (opType === \"modify\") {\n            const type = in_context.getTypeid();\n            const splitType = in_context.getSplitTypeID();\n            let nestedChangeset = in_context.getNestedChangeSet();\n\n            let current = in_context.getUserData().parallelState;\n            if (in_context.getPropertyContainerType() === \"root\") {\n                current = in_context.getUserData().oldState;\n            } else if (current) {\n                if (in_context.getPropertyContainerType() !== \"template\") {\n                    current = current.insert;\n                }\n\n                if (in_context.getPropertyContainerType() !== \"array\") {\n                    current = current && current[in_context.getTypeid()];\n                    current = current && current[in_context.getLastSegment()];\n                } else {\n                    current = current && current[0][1][in_context.getLastSegment()];\n                }\n            }\n\n            in_context.setUserData({\n                parallelState: current,\n                oldState: in_context.getUserData().oldState,\n            });\n\n            if (isPrimitiveType(type)) {\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making primitive value reversible.`);\n                }\n                let oldValue = current;\n\n                // store it in reversibleChangeSet\n                if (type === \"String\" && !isString(nestedChangeset)) {\n                    // String is a special case\n                    let oldString;\n                    if (isString(oldValue)) {\n                        oldString = oldValue;\n                    }\n                    if (nestedChangeset.modify) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            let entryOffset = entry[0];\n                            const entryLength = entry[1].length;\n                            entry[2] = oldString.slice(entryOffset, entryOffset + entryLength);\n                        }\n                    }\n                    if (nestedChangeset.remove) {\n                        for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                            let entry = nestedChangeset.remove[i];\n                            let entryOffset = entry[0];\n\n                            let removeRangeLength = entry[1];\n                            if (isString(removeRangeLength)) {\n                                removeRangeLength = entry[1].length;\n                            }\n                            entry[1] = oldString.slice(entryOffset, entryOffset + removeRangeLength);\n                        }\n                    }\n                } else {\n                    if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                        nestedChangeset.oldValue = oldValue;\n                    } else {\n                        const newChangeSet = {\n                            value: nestedChangeset,\n                            oldValue,\n                        };\n                        in_context.replaceNestedChangeSet(newChangeSet);\n                    }\n                }\n            } else if (splitType.context === \"array\") {\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making array value reversible.`);\n                }\n                let oldValue = current.insert ? current.insert[0][1] : [];\n\n                let nestedChangeset = in_context.getNestedChangeSet();\n                if (nestedChangeset.modify) {\n                    if (isPrimitiveType(splitType.typeid)) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            let entryOffset = entry[0];\n                            let oldEntries = [];\n                            for (let j = 0; j < entry[1].length; j++) {\n                                oldEntries.push(cloneDeep(oldValue[entryOffset + j]));\n                            }\n                            entry[2] = oldEntries;\n                        }\n                    }\n                }\n                if (nestedChangeset.remove) {\n                    for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                        let entry = nestedChangeset.remove[i];\n                        let entryOffset = entry[0];\n                        let oldEntries = [];\n\n                        let removeRangeLength = entry[1];\n                        if (Array.isArray(removeRangeLength)) {\n                            removeRangeLength = entry[1].length;\n                        }\n\n                        for (let j = 0; j < removeRangeLength; j++) {\n                            oldEntries.push(cloneDeep(oldValue[entryOffset + j]));\n                        }\n                        entry[1] = oldEntries;\n                    }\n                }\n            } else if (splitType.context === \"map\" ||\n                // node property test: (we have to do the test this way, because of inheritance)\n                (nestedChangeset.insert ||\n                    nestedChangeset.modify ||\n                    nestedChangeset.remove)) {\n                // This prevents an error, if the changeset only contains an insert operation. In that case\n                // we don't actually need the corresponding old state and thus do not need to throw an error\n                // This type of situation can occur in the materialized history, if an insert happens right at a chunk boundary.\n                if (Object.keys(nestedChangeset).length === 1 &&\n                    nestedChangeset.insert) {\n                    in_context._traversalStopped = true;\n                    return;\n                }\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making map value reversible.`);\n                }\n                let oldValue = current.insert;\n\n                if (isPrimitiveType(splitType.typeid)) {\n                    if (nestedChangeset.modify) {\n                        const modifiedKeys = Object.keys(nestedChangeset.modify);\n                        for (let i = 0; i < modifiedKeys.length; i++) {\n                            let entry = nestedChangeset.modify[modifiedKeys[i]];\n                            if (typeof entry === \"object\" && entry.hasOwnProperty(\"value\")) {\n                                entry = entry.value;\n                            }\n                            nestedChangeset.modify[modifiedKeys[i]] = {\n                                value: entry,\n                                oldValue: cloneDeep(oldValue[modifiedKeys[i]]),\n                            };\n                        }\n                    }\n                    let newRemove = {};\n                    if (nestedChangeset.remove) {\n                        let removedKeys = nestedChangeset.remove;\n                        if (!Array.isArray(removedKeys)) {\n                            removedKeys = Object.keys(removedKeys);\n                        }\n                        for (let i = 0; i < removedKeys.length; i++) {\n                            newRemove[removedKeys[i]] = cloneDeep(oldValue[removedKeys[i]]);\n                        }\n                        nestedChangeset.remove = newRemove;\n                    }\n                } else {\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (nestedChangeset.modify) {\n                        // this case is handeled recursively\n                    }\n                    let newRemove = {};\n                    if (nestedChangeset.remove) {\n                        if (Array.isArray(nestedChangeset.remove)) {\n                            let removedKeys = nestedChangeset.remove;\n                            for (let i = 0; i < removedKeys.length; i++) {\n                                let searchedKey = removedKeys[i];\n                                // search for this key in the old keys:\n                                const oldTypeKeys = Object.keys(oldValue);\n                                for (let k = 0; k < oldTypeKeys.length; k++) {\n                                    if (oldValue[oldTypeKeys[k]].hasOwnProperty(searchedKey)) {\n                                        let entry = oldValue[oldTypeKeys[k]][searchedKey];\n                                        if (!newRemove[oldTypeKeys[k]]) {\n                                            newRemove[oldTypeKeys[k]] = {};\n                                        }\n                                        newRemove[oldTypeKeys[k]][removedKeys[i]] = cloneDeep(entry);\n                                    }\n                                }\n                            }\n                            nestedChangeset.remove = newRemove;\n                        } else {\n                            // we already have a reversibleChangeSet and need to update the oldValues\n                            const removedTypes = Object.keys(nestedChangeset.remove);\n                            for (let t = 0; t < removedTypes.length; t++) {\n                                let removedKeys = Object.keys(nestedChangeset.remove[removedTypes[t]]);\n                                for (let i = 0; i < removedKeys.length; i++) {\n                                    let searchedKey = removedKeys[i];\n                                    let entry = oldValue[removedTypes[t]][searchedKey];\n                                    nestedChangeset.remove[removedTypes[t]][removedKeys[i]] = entry;\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    };\n\n    /**\n     * Converts an irreversible changeset to a reversible changeset\n     * or updates the former state of a reversible changeset\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release.\n     * @param in_oldSerializedState the old state\n     */\n    public _toReversibleChangeSet(in_oldSerializedState: SerializedChangeSet) {\n        ConsoleUtils.assert(in_oldSerializedState !== undefined,\n            `${MSG.ASSERTION_FAILED}Missing function parameter \"in_oldSerializedState\" of \"_toReversibleChangeSet\".`);\n\n        if (!isObject(in_oldSerializedState) || Array.isArray(in_oldSerializedState)) {\n            if (!isObject(this._changes) || Array.isArray(this._changes)) {\n                this._changes = {\n                    oldValue: Array.isArray(in_oldSerializedState) ? in_oldSerializedState.slice() : in_oldSerializedState,\n                    value: this._changes,\n                };\n            } else {\n                (this._changes as SerializedChangeSet).oldValue = Array.isArray(in_oldSerializedState) ? in_oldSerializedState.slice() :\n                    in_oldSerializedState;\n            }\n        } else {\n            const workspace = { oldState: in_oldSerializedState };\n            Utils.traverseChangeSetRecursively(this._changes, {\n                preCallback: this._recursivelyBuildReversibleChangeSet,\n                userData: workspace,\n            });\n        }\n    };\n\n    /**\n     * Converts a reversible changeset to an irreversible changeset\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release.\n     * @param in_withoutRoot - Bypass a fix where the root of a changeset is cleaned\n     */\n    public _stripReversibleChangeSet(in_withoutRoot: boolean) {\n        // eslint-disable-next-line complexity\n        const callback = function(in_context) {\n            const opType = in_context.getOperationType();\n            if (opType === \"remove\" || opType === \"modify\") {\n                const type = in_context.getTypeid();\n                if (!type) {\n                    return;\n                }\n                const splitType = in_context.getSplitTypeID();\n\n                if (isPrimitiveType(type)) {\n                    // remove old state\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (type === \"String\" && !isString(nestedChangeset)) {\n                        // String is a special case\n\n                        if (nestedChangeset.modify) {\n                            for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                                let entry = nestedChangeset.modify[i];\n                                entry.splice(2, 1);\n                            }\n                        }\n                        if (nestedChangeset.remove) {\n                            for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                                let entry = nestedChangeset.remove[i];\n\n                                let removeRangeLength = entry[1];\n                                if (isString(removeRangeLength)) {\n                                    removeRangeLength = entry[1].length;\n                                }\n                                entry[1] = removeRangeLength;\n                            }\n                        }\n                        if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                            in_context.replaceNestedChangeSet(nestedChangeset.value);\n                        }\n                    } else if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                        in_context.replaceNestedChangeSet(nestedChangeset.value);\n                    }\n                } else if (splitType.context === \"array\") {\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (nestedChangeset.modify) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            entry.splice(2, 1);\n                        }\n                    }\n                    if (nestedChangeset.remove) {\n                        for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                            let entry = nestedChangeset.remove[i];\n                            let removeRangeLength = entry[1];\n                            if (Array.isArray(removeRangeLength)) {\n                                removeRangeLength = entry[1].length;\n                            }\n                            entry[1] = removeRangeLength;\n                        }\n                    }\n                    // TODO: Remove in_withoutRoot when it will not be used anymore\n                } else if (splitType.context === \"map\" ||\n                    (!in_withoutRoot && splitType.context === \"single\")) { // For NodeProperty / inserts at the root\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (isPrimitiveType(splitType.typeid)) {\n                        if (nestedChangeset.modify) {\n                            const modifiedKeys = Object.keys(nestedChangeset.modify);\n                            for (let i = 0; i < modifiedKeys.length; i++) {\n                                let entry = nestedChangeset.modify[modifiedKeys[i]];\n                                if (typeof entry === \"object\" && entry.hasOwnProperty(\"value\")) {\n                                    entry = entry.value;\n                                }\n                                nestedChangeset.modify[modifiedKeys[i]] = entry;\n                            }\n                        }\n                        if (nestedChangeset.remove) {\n                            let removedKeys = nestedChangeset.remove;\n                            if (!Array.isArray(removedKeys)) {\n                                removedKeys = Object.keys(removedKeys);\n                                nestedChangeset.remove = removedKeys;\n                            }\n                        }\n                    } else {\n                        let nestedChangeset = in_context.getNestedChangeSet();\n                        if (nestedChangeset.modify) {\n                            // this case is handeled recursively\n                        }\n                        if (nestedChangeset.remove) {\n                            if (!Array.isArray(nestedChangeset.remove)) {\n                                // we have a reversibleChangeSet and need to convert\n                                let newRemove = [];\n                                const removedTypes = Object.keys(nestedChangeset.remove);\n                                for (let t = 0; t < removedTypes.length; t++) {\n                                    let removedKeys = Object.keys(nestedChangeset.remove[removedTypes[t]]);\n                                    for (let i = 0; i < removedKeys.length; i++) {\n                                        newRemove.push(removedKeys[i]);\n                                    }\n                                }\n                                nestedChangeset.remove = newRemove;\n                            }\n                        }\n                    }\n                }\n            }\n        };\n\n        if (isObject(this._changes) &&\n            (this._changes as SerializedChangeSet).oldValue !== undefined &&\n            (this._changes as SerializedChangeSet).value !== undefined) {\n            this._changes = (this._changes as SerializedChangeSet).value;\n            return;\n        }\n\n        Utils.traverseChangeSetRecursively(this._changes, {\n            preCallback: callback,\n        });\n    };\n\n    /**\n     * Helper function to extract the first level paths from a given change set\n     * @param in_changeSet The ChangeSet to extract paths from\n     * @param isPrimitiveCollection Is this a primitive type collection?\n     *\n     * @returns List of paths found at the first level of the change set\n     */\n    private _extractFirstLevelPaths(in_changeSet: SerializedChangeSet, isPrimitiveCollection: boolean): string[] {\n        let paths;\n        if (isPrimitiveCollection) {\n            paths = Object.keys(in_changeSet);\n        } else {\n            paths = [];\n            each(in_changeSet, function(nestedChangeSet) {\n                each(nestedChangeSet, function(nestedChangeSet2, path) {\n                    paths.push(path);\n                });\n            });\n        }\n\n        return paths;\n    };\n\n    /**\n     * recursive helper function for ChangeSet.prototype._toInverseChangeSet\n     * @param in_context the traversal context\n     */\n    private _recursivelyInvertReversibleChangeset(in_context: Utils.TraversalContext) {\n        in_context.setUserData(in_context.getUserData() || {});\n\n        // Figure out if we have already visited this path by verifying that the full path\n        // is contained within the list of processed deleted or inserted paths\n        const isWithinInsertOrDelete = in_context.getUserData()[in_context.getFullPath()];\n\n        if (isWithinInsertOrDelete && in_context.getOperationType() !== \"modify\") {\n            // We are within an insert or remove sub tree. Skip this iteration.\n            in_context._traversalStopped = true;\n            return;\n        }\n\n        if (in_context.getOperationType() === \"remove\" ||\n            in_context.getOperationType() === \"modify\") {\n            const type = in_context.getTypeid();\n            const splitType = in_context.getSplitTypeID();\n\n            if (!splitType) {\n                ConsoleUtils.assert(false,\n                    `${MSG.ASSERTION_FAILED}Missing \"splitType\" in \"in_context\":${JSON.stringify(in_context)}`);\n            }\n\n            const nestedChangeset = in_context.getNestedChangeSet();\n\n            if ((isPrimitiveType(type) && type !== \"String\") ||\n                (type === \"String\" && isString(nestedChangeset.oldValue))) {\n                // check if we were called with an irreversible changeset\n                if (in_context.getOperationType() === \"modify\" &&\n                    (!isObject(nestedChangeset) || typeof (nestedChangeset as SerializedChangeSet).oldValue === \"undefined\")) {\n                    throw new Error(MSG.OLD_VALUE_NOT_FOUND);\n                }\n\n                // switch oldValue and value\n                let tmp = nestedChangeset.oldValue;\n                nestedChangeset.oldValue = nestedChangeset.value;\n                nestedChangeset.value = tmp;\n            } else if ((type === \"String\" && !isString(nestedChangeset.oldValue)) || splitType.context === \"array\") {\n                // String and Arrays need special treatment:\n                const arrayIterator = new ArrayChangeSetIterator(nestedChangeset);\n                const resultChangeset: SerializedChangeSet = {};\n                if (nestedChangeset.modify) {\n                    resultChangeset.modify = [];\n                }\n                if (nestedChangeset.insert) {\n                    resultChangeset.remove = [];\n                }\n                if (nestedChangeset.remove) {\n                    resultChangeset.insert = [];\n                }\n                // Successively invert the changes from the changeSet\n                while (!arrayIterator.atEnd()) {\n                    switch (arrayIterator.opDescription.type) {\n                        case ArrayIteratorOperationTypes.INSERT:\n                            // Handle inserts\n                            resultChangeset.remove.push([\n                                arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                arrayIterator.opDescription.operation[1],\n                            ]);\n                            break;\n                        case ArrayIteratorOperationTypes.REMOVE:\n                            // Handle removes\n                            resultChangeset.insert.push([\n                                arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                arrayIterator.opDescription.operation[1],\n                            ]);\n                            break;\n                        case ArrayIteratorOperationTypes.MODIFY:\n                            // Handle modifies\n                            if (isPrimitiveType(splitType.typeid)) {\n                                resultChangeset.modify.push([\n                                    arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                    arrayIterator.opDescription.operation[2],\n                                    arrayIterator.opDescription.operation[1],\n                                ]);\n                            } else {\n                                resultChangeset.modify.push([\n                                    arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                    arrayIterator.opDescription.operation[1],\n                                ]);\n                            }\n                            break;\n                        default:\n                            console.error(`applyChangeset: ${MSG.UNKNOWN_OPERATION}${arrayIterator.opDescription.type}`);\n                    }\n                    arrayIterator.next();\n                }\n                in_context.replaceNestedChangeSet(resultChangeset);\n            } else {\n                // Covers NodeProperty, Map and Set\n                if (nestedChangeset.modify) {\n                    if (isPrimitiveType(splitType.typeid) && splitType.context === \"map\") {\n                        const modifiedKeys = Object.keys(nestedChangeset.modify);\n                        for (let i = 0; i < modifiedKeys.length; i++) {\n                            const entry = nestedChangeset.modify[modifiedKeys[i]];\n                            let tmp = entry.value;\n                            entry.value = entry.oldValue;\n                            entry.oldValue = tmp;\n                        }\n                    }\n                }\n                const oldInsert = nestedChangeset.insert;\n                let replacedInsert = false;\n                if (nestedChangeset.remove) {\n                    nestedChangeset.insert = nestedChangeset.remove;\n                    replacedInsert = true;\n                    nestedChangeset.remove = undefined;\n                    delete nestedChangeset.remove;\n                    const isPrimitiveTypeid = isPrimitiveType(in_context.getSplitTypeID().typeid);\n                    each(this._extractFirstLevelPaths(nestedChangeset.insert, isPrimitiveTypeid), function(path) {\n                        const fullPath = joinPaths(in_context.getFullPath(), path, PROPERTY_PATH_DELIMITER);\n                        in_context.getUserData()[fullPath] = true;\n                    });\n                }\n                if (oldInsert) {\n                    if (replacedInsert) {\n                        nestedChangeset.remove = cloneDeep(oldInsert);\n                    } else {\n                        nestedChangeset.remove = oldInsert;\n                        nestedChangeset.insert = undefined;\n                        delete nestedChangeset.insert;\n                    }\n                    const isPrimitiveTypeid = isPrimitiveType(in_context.getSplitTypeID().typeid);\n                    each(this._extractFirstLevelPaths(nestedChangeset.remove, isPrimitiveTypeid), function(path) {\n                        const fullPath = joinPaths(in_context.getFullPath(), path, PROPERTY_PATH_DELIMITER);\n                        in_context.getUserData()[fullPath] = true;\n                    });\n                }\n            }\n        }\n    };\n\n    /**\n     * Inverts a reversible ChangeSets\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release\n     */\n    public toInverseChangeSet() {\n        if (this._changes.value !== undefined &&\n            this._changes.oldValue !== undefined) {\n            const tmp = this._changes.value;\n            this._changes.value = this._changes.oldValue;\n            this._changes.oldValue = tmp;\n        } else {\n            Utils.traverseChangeSetRecursively(this._changes, {\n                preCallback: this._recursivelyInvertReversibleChangeset.bind(this),\n            });\n        }\n    }\n}\n\n\nChangeSet.prototype._performApplyAfterOnPropertyArray = ChangeSetArrayFunctions._performApplyAfterOnPropertyArray;\nChangeSet.prototype._rebaseArrayChangeSetForProperty = ChangeSetArrayFunctions._rebaseArrayChangeSetForProperty;\nChangeSet.prototype._rebaseChangeSetForString = ChangeSetArrayFunctions._rebaseChangeSetForString;\n\n// Add the indexed collection functions into the prototype of the ChangeSet\nChangeSet.prototype._performApplyAfterOnPropertyIndexedCollection =\n    ChangeSetIndexedCollectionFunctions._performApplyAfterOnPropertyIndexedCollection;\nChangeSet.prototype._cleanIndexedCollectionChangeSet =\n    ChangeSetIndexedCollectionFunctions._cleanIndexedCollectionChangeSet;\nChangeSet.prototype._rebaseIndexedCollectionChangeSetForProperty =\n    ChangeSetIndexedCollectionFunctions._rebaseIndexedCollectionChangeSetForProperty;\n"]}
+{"version":3,"file":"changeset.js","sourceRoot":"","sources":["../src/changeset.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;;;;AAEH,+DAAuC;AACvC,+DAAuC;AACvC,yDAAoD;AACpD,6DAAqC;AACrC,2DAAmC;AACnC,uDAA+B;AAE/B,YAAY;AACZ,yEAAyF;AAEzF,yDAAsD;AACtD,wDAAuE;AAEvE,0FAAuF;AACvF,0FAA4E;AAC5E,2EAA2E;AAC3E,gFAA+F;AAC/F,8EAA2E;AAC3E,2DAAwD;AACxD,mCAAgC;AAChC,2DAAwD;AACxD,0EAAmF;AAEnF,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAEnD,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,GAAG,2BAAY,CAAC;AAsCzD;;;;GAIG;AACH,MAAa,SAAS;IAgBlB;;;OAGG;IACH,YAAY,UAA0B;QAClC,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,IAAI,EAAE;YACjD,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;SACtB;aAAM,IAAI,kBAAQ,CAAC,UAAU,CAAC,EAAE,EAAE,8BAA8B;YAC7D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;SAC1C;aAAM,IAAI,UAAU,YAAY,SAAS,EAAE;YACxC,IAAI,CAAC,QAAQ,GAAG,wBAAS,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;SAClD;aAAM;YACH,uBAAuB;YACvB,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;SAC9B;QAED,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC/B,CAAC;IAGD;;;OAGG;IACH,QAAQ;QACJ,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IAAA,CAAC;IAGF;;;;OAIG;IACH,sBAAsB;QAClB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACzB,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACH,eAAe,CAAC,eAAwB;QACpC,IAAI,CAAC,aAAa,GAAG,eAAe,CAAC;IACzC,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACH,eAAe;QACX,OAAO,IAAI,CAAC,aAAa,CAAC;IAC9B,CAAC;IAAA,CAAC;IAEF;;;;OAIG;IACH,KAAK;QACD,OAAO,IAAI,SAAS,CAAC,wBAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnD,CAAC;IAAA,CAAC;IAGF;;;;;;;;OAQG;IACH,cAAc,CAAC,YAAiC,EAAE,UAAkC;QAChF,IAAI,OAAO,GAAG,YAAY,CAAC;QAC3B,IAAI,YAAY,YAAY,SAAS,EAAE;YACnC,OAAO,GAAG,YAAY,CAAC,sBAAsB,EAAE,CAAC;SACnD;QAED,IAAI,CAAC,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;YAC1D,MAAM,QAAQ,GAAG,kBAAQ,CAAC,OAAO,CAAC,IAAK,OAA+B,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAE,OAA+B,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YAC9I,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;SACzE;aAAM;YACH,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;SAC9F;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;OASG;IACK,4BAA4B,CAChC,sBAA2C,EAC3C,yBAA8C,EAC9C,cAAuB,EACvB,UAAkC;QAClC,oCAAoC;QACpC,IAAI,yBAAyB,CAAC,MAAM;YAChC,yBAAyB,CAAC,MAAM;YAChC,yBAAyB,CAAC,MAAM,EAAE;YAClC,IAAI,CAAC,6CAA6C,CAAC,sBAAsB,EACrE,yBAAyB,EACzB,cAAc,EACd,UAAU,CAAC,CAAC,CAAC,0CAA0C;SAC9D;QAED,IAAI,CAAC,iBAAO,CAAC,yBAAyB,CAAC,eAAe,CAAC,EAAE;YACrD,sBAAsB,CAAC,eAAe,GAAG,sBAAsB,CAAC,eAAe,IAAI,EAAE,CAAC;YACtF,gBAAM,CAAC,sBAAsB,CAAC,eAAe,EAAE,yBAAyB,CAAC,eAAe,CAAC,CAAC;SAC7F;QAED,oCAAoC;QACpC,MAAM,eAAe,GAAG,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAClC,wDAAwD;YACxD,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE;gBACrC,SAAS;aACZ;YAED,sBAAsB,CAAC,MAAM,CAAC,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACtE,MAAM,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC;YACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACzC,IAAI,CAAC,qCAAqC,CAAC,WAAW,CAAC,CAAC,CAAC,EACrD,WAAW,EACX,yBAAyB,CAAC,MAAM,CAAC,EACjC,MAAM,EACN,cAAc,EACd,UAAU,CAAC,CAAC;aACnB;YACD,8DAA8D;YAC9D,IAAI,cAAc,IAAI,iBAAO,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC3D,OAAO,sBAAsB,CAAC,MAAM,CAAC,CAAC;aACzC;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;OAQG;IACK,WAAW,CAAC,cAAmC,EAAE,UAAkB,EAAE,eAAoC;QAC7G,MAAM,QAAQ,GAAG,CAAC,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3E,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC;QAC5C,IAAI,cAAc,CAAC,UAAU,CAAC,IAAI,cAAc,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;YAClF,cAAc,CAAC,UAAU,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;SAC/C;aAAM;YACH,IAAI,cAAc,CAAC,UAAU,CAAC,KAAK,SAAS;gBACxC,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;gBAC/D,cAAc,CAAC,UAAU,CAAC,GAAG;oBACzB,KAAK,EAAE,QAAQ;oBACf,QAAQ,EAAE,eAAe,CAAC,QAAQ;iBACrC,CAAC;aACL;iBAAM;gBACH,cAAc,CAAC,UAAU,CAAC,GAAG,QAAQ,CAAC;aACzC;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;OAWG;IACI,qCAAqC,CACxC,aAAqB,EACrB,cAAmC,EACnC,yBAAgD,EAChD,SAAiB,EACjB,cAAuB,EACvB,UAAkC;QAClC,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE9C,IAAI,WAAW,CAAC,OAAO,KAAK,KAAK;YAC7B,WAAW,CAAC,OAAO,KAAK,KAAK,EAAE;YAC/B,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;YACpE,IAAI,CAAC,6CAA6C,CAAC,cAAc,CAAC,aAAa,CAAC,EAC5E,yBAAyB,CAAC,aAAa,CAAC,EACxC,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;YAEhB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;gBAC1D,OAAO,cAAc,CAAC,aAAa,CAAC,CAAC;aACxC;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,OAAO,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;YAC3E,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC,aAAa,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACjH,IAAI,eAAe,GAAG,KAAK,CAAC;YAC5B,IAAI,QAAQ,CAAC;YACb,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ;gBAC/B,CAAC,kBAAQ,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;oBACpC,CAAC,cAAc,CAAC,aAAa,CAAC,IAAI,cAAc,CAAC,aAAa,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBAC/F,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC,QAAQ,CAAC;gBAClD,wEAAwE;gBACxE,yFAAyF;gBACzF,IAAI,cAAc,CAAC,aAAa,CAAC,IAAI,cAAc,CAAC,aAAa,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oBACxF,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,MAAM,EAAE;4BACJ,CAAC,CAAC,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC;yBAC3C;qBACJ,CAAC;iBACL;qBAAM;oBACH,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,MAAM,EAAE;4BACJ,CAAC,CAAC,EAAE,cAAc,CAAC,aAAa,CAAC,CAAC;yBACrC;qBACJ,CAAC;iBACL;gBACD,eAAe,GAAG,IAAI,CAAC;aAC1B;YACD,IAAI,cAAc,GAAG,yBAAyB,CAAC,aAAa,CAAC,CAAC;YAC9D,IAAI,kBAAQ,CAAC,cAAc,CAAC,IAAI,cAAc,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gBACpE,cAAc,GAAI,cAAsC,CAAC,KAAK,CAAC;aAClE;YAED,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,IAAI,kBAAQ,CAAC,cAAc,CAAC,EAAE;gBAC7D,2DAA2D;gBAC3D,IAAI,eAAe,IAAI,QAAQ,KAAK,SAAS,EAAE;oBAC3C,cAAc,CAAC,aAAa,CAAC,GAAG;wBAC5B,KAAK,EAAE,cAAc;wBACrB,QAAQ;qBACX,CAAC;iBACL;qBAAM;oBACH,cAAc,CAAC,aAAa,CAAC,GAAG,cAAc,CAAC;iBAClD;aACJ;iBAAM;gBACH,oDAAoD;gBACpD,IAAI,CAAC,iCAAiC,CAAC,cAAc,CAAC,aAAa,CAAC,EAChE,yBAAyB,CAAC,aAAa,CAAC,EACxC,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;gBAChB,IAAI,eAAe,EAAE;oBACjB,uEAAuE;oBACvE,IAAI,QAAQ,CAAC;oBACb,IAAI,iBAAO,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;wBACxC,QAAQ,GAAG,EAAE,CAAC;qBACjB;yBAAM;wBACH,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACzD;oBACD,IAAI,QAAQ,KAAK,SAAS,EAAE;wBACxB,cAAc,CAAC,aAAa,CAAC,GAAG;4BAC5B,KAAK,EAAE,QAAQ;4BACf,QAAQ;yBACX,CAAC;qBACL;yBAAM;wBACH,cAAc,CAAC,aAAa,CAAC,GAAG,QAAQ,CAAC;qBAC5C;iBACJ;aACJ;YAED,yDAAyD;YACzD,IAAI,cAAc,IAAI,SAAS,CAAC,gBAAgB,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC,EAAE;gBAC7E,OAAO,cAAc,CAAC,aAAa,CAAC,CAAC;aACxC;SACJ;aAAM,IAAI,WAAW,CAAC,MAAM,EAAE;YAC3B,uCAAuC;YACvC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;SAC7F;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,QAAQ,EAAE;YACzC,IAAI,eAAe,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;gBACrC,8EAA8E;gBAC9E,4DAA4D;gBAC5D,IAAI,WAAW,CAAC,MAAM,KAAK,OAAO,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;oBACnE,IAAI,UAAU,GAAG,yBAAyB,CAAC,aAAa,CAAC,CAAC;oBAC1D,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBAClD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qBACjC;oBACD,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;iBACvE;qBAAM;oBACH,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,aAAa,EAAE,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;iBAC7F;aACJ;iBAAM;gBACH,IAAI,cAAc,CAAC,aAAa,CAAC,EAAE;oBAC/B,wDAAwD;oBACxD,IAAI,CAAC,4BAA4B,CAAC,cAAc,CAAC,aAAa,CAAC,EAC3D,yBAAyB,CAAC,aAAa,CAAC,EACxC,KAAK,EACL,UAAU,CAAC,CAAC;iBACnB;qBAAM;oBACH,qDAAqD;oBACrD,cAAc,CAAC,aAAa,CAAC,GAAG,wBAAS,CAAC,yBAAyB,CAAC,aAAa,CAAC,CAAC,CAAC;iBACvF;aACJ;SACJ;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;SAC9D;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;OAaG;IACI,gBAAgB,CAAC,YAAiC,EAAE,aAA6B,EACpF,UAAmC;QACnC,wEAAwE;QACxE,OAAO,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,EAAE,YAAY,EAAE,EAAE,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;IACxG,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;OAaG;IACK,2BAA2B,CAC/B,uBAA4C,EAC5C,0BAA+C,EAC/C,WAAmB,EACnB,aAA6B,EAC7B,UAAiC;QACjC,yCAAyC;QACzC,IAAI,CAAC,uBAAuB,CAAC,MAAM;YAC/B,uBAAuB,CAAC,MAAM;YAC9B,uBAAuB,CAAC,MAAM,CAAC;YAC/B,CAAC,0BAA0B,CAAC,MAAM;gBAC9B,0BAA0B,CAAC,MAAM;gBACjC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YACxC,IAAI,CAAC,4CAA4C,CAAC,uBAAuB,EACrE,0BAA0B,EAC1B,WAAW,EACX,cAAc,EAAE,0CAA0C;YAC1D,KAAK,EAAE,+CAA+C;YACtD,aAAa,EACb,UAAU,CAAC,CAAC;SACnB;QACD,IAAI,CAAC,iBAAO,CAAC,0BAA0B,CAAC,eAAe,CAAC,EAAE;YACtD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;YAExE,MAAM,yBAAyB,GAAG,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;YAE1D,MAAM,wBAAwB,GAAG;gBAC7B,IAAI,EAAE,SAAS,CAAC,YAAY,CAAC,kBAAkB;gBAC/C,iBAAiB,EAAE,yBAAyB;aAC/C,CAAC;YAEF,cAAI,CAAC,OAAO,EAAE,UAAS,MAAM;gBACzB,MAAM,QAAQ,GAAG,0BAA0B,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gBACpE,IAAI,uBAAuB,CAAC,eAAe;oBACvC,uBAAuB,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;oBACjD,MAAM,OAAO,GAAG,qCAAiB,CAAC,KAAK,CAAC,cAAc,CAClD,QAAQ,EACR,uBAAuB,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,CAC3D,CAAC;oBAEF,IAAI,CAAC,OAAO,EAAE;wBACV,IAAI,UAAU,IAAI,UAAU,CAAC,uBAAuB,EAAE;4BAClD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,MAAM,CAAC,CAAC;yBACnD;wBAED,yBAAyB,CAAC,eAAe,CAAC,MAAM,CAAC;4BAC7C,uBAAuB,CAAC,eAAe,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;wBAC7D,4EAA4E;wBAC5E,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,GAAG,MAAM,CAAC,CAAC;qBAChD;oBAED,OAAO,0BAA0B,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;iBAC7D;YACL,CAAC,CAAC,CAAC;YAEH,4CAA4C;YAC5C,IAAI,iBAAO,CAAC,0BAA0B,CAAC,eAAe,CAAC,EAAE;gBACrD,OAAO,0BAA0B,CAAC,eAAe,CAAC;aACrD;YAED,IAAI,CAAC,iBAAO,CAAC,wBAAwB,CAAC,iBAAiB,CAAC,eAAe,CAAC,EAAE;gBACtE,aAAa,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;aAChD;SACJ;QAED,mDAAmD;QACnD,MAAM,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;QAE5D,mCAAmC;QACnC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC;YAE3D,2DAA2D;YAC3D,iEAAiE;YACjE,kDAAkD;YAClD,IAAI,MAAM,KAAK,QAAQ,IAAI,QAAQ,IAAI,0BAA0B,EAAE;gBAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;wBAC7B,UAAU,IAAI,0BAA0B,CAAC,MAAM,EAAE;wBACjD,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;wBAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACvC,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;gCAC/D,IAAI,kBAAkB,GAAG,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gCACrF,IAAI,kBAAQ,CAAC,kBAAkB,CAAC,IAAI,UAAU,IAAI,kBAAkB,EAAE;oCACjE,kBAA0C,CAAC,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;iCACzH;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;iBAAM,IAAI,eAAe,CAAC,MAAM,CAAC,EAAE;gBAChC,0GAA0G;gBAC1G,8GAA8G;gBAC9G,0CAA0C;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnC,IAAI,MAAM,IAAI,0BAA0B,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,0BAA0B,CAAC,MAAM,CAAC,EAAE;wBACxF,IAAI,kBAAkB,GAAG,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,IAAI,kBAAQ,CAAC,kBAAkB,CAAC,IAAI,UAAU,IAAI,kBAAkB,EAAE;4BAClE,+DAA+D;4BAC/D,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;gCACrD,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE;gCACjD,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;6BAC3G;yBACJ;qBACJ;iBACJ;aACJ;YAED,6FAA6F;YAC7F,qCAAqC;YACrC,IAAI,SAAS,CAAC,iBAAiB,CAAC,MAAM,CAAC;gBACnC,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;gBACrC,SAAS;aACZ;YAED,sDAAsD;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACnC,IAAI,0BAA0B,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oBAC5D,uBAAuB,CAAC,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;oBAExE,MAAM,OAAO,GAAG,2BAAS,CAAC,WAAW,EACjC,KAAK,CAAC,CAAC,CAAC,EACR,uBAAuB,CAAC,CAAC;oBAC7B,+DAA+D;oBAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,yCAAyC,CAAC,KAAK,CAAC,CAAC,CAAC,EACvE,uBAAuB,CAAC,MAAM,CAAC,EAC/B,0BAA0B,CAAC,MAAM,CAAC,EAClC,MAAM,EACN,OAAO,EACP,IAAI,EACJ,aAAa,EACb,UAAU,CAAC,CAAC;oBAEhB,+EAA+E;oBAC/E,IAAI,WAAW,EAAE;wBACb,+DAA+D;wBAC/D,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBAE5C,oFAAoF;wBACpF,6FAA6F;wBAC7F,SAAS,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;qBACtF;oBAED,yDAAyD;oBACzD,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;wBAC7C,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;qBAC7C;iBACJ;aACJ;SACJ;QAED,6DAA6D;QAC7D,IAAI,CAAC,iBAAO,CAAC,SAAS,CAAC,EAAE;YACrB,MAAM,QAAQ,GAAG;gBACb,IAAI,EAAE,WAAW;gBACjB,IAAI,EAAE,SAAS,CAAC,YAAY,CAAC,aAAa;gBAC1C,iBAAiB,EAAE,SAAS;aAC/B,CAAC;YACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SAChC;QAED,OAAO,0BAA0B,CAAC;IACtC,CAAC;IAAA,CAAC;IAEF;;;;;;;;;;;;;;;;;;;OAmBG;IACK,yCAAyC,CAC7C,MAAc,EACd,uBAA4C,EAC5C,0BAA+C,EAC/C,SAAiB,EACjB,WAAmB,EACnB,cAAuB,EACvB,aAAkB,EAClB,UAAiC;QACjC,MAAM,WAAW,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;QAE9C,IAAI,WAAW,CAAC,OAAO,KAAK,KAAK;YAC7B,WAAW,CAAC,OAAO,KAAK,KAAK,EAAE;YAC/B,IAAI,CAAC,4CAA4C,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC7E,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,WAAW,CAAC,MAAM,EAClB,IAAI,EAAE,sBAAsB;YAC5B,aAAa,EACb,UAAU,CAAC,CAAC;YAEhB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,OAAO,EAAE;YACxC,IAAI,CAAC,gCAAgC,CAAC,uBAAuB,CAAC,MAAM,CAAC,EACjE,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,aAAa,EACb,WAAW,CAAC,MAAM,EAClB,UAAU,CAAC,CAAC;YAChB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,MAAM,KAAK,QAAQ,EAAE;YACxC,IAAI,CAAC,yBAAyB,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC1D,0BAA0B,EAAE,MAAM,EAClC,WAAW,EACX,aAAa,EACb,UAAU,CAAC,CAAC;YAChB,yDAAyD;YACzD,IAAI,cAAc,IAAI,iBAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,CAAC,EAAE;gBAC/D,OAAO,0BAA0B,CAAC,MAAM,CAAC,CAAC;aAC7C;SACJ;aAAM,IAAI,WAAW,CAAC,OAAO,KAAK,QAAQ,EAAE;YACzC,sEAAsE;YACtE,IAAI,uBAAuB,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE;gBAC/C,IAAI,eAAe,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE;oBAC3D,OAAO,IAAI,CAAC;iBACf;qBAAM;oBACH,6CAA6C;oBAE7C,4BAA4B;oBAC5B,uBAAuB,CAAC,MAAM,CAAC,GAAG,uBAAuB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;oBAExE,wCAAwC;oBACxC,IAAI,CAAC,2BAA2B,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAC5D,0BAA0B,CAAC,MAAM,CAAC,EAClC,WAAW,EACX,aAAa,EACb,UAAU,CAAC,CAAC;iBACnB;aACJ;SACJ;aAAM;YACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,eAAe,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;SAC9D;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACK,oCAAoC,CAAC,UAAkC;QAC3E,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,QAAQ,EAAE;YACrB,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9C,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;YAEtD,IAAI,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,aAAa,CAAC;YACrD,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,MAAM,EAAE;gBAClD,OAAO,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC;aAC/C;iBAAM,IAAI,OAAO,EAAE;gBAChB,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,UAAU,EAAE;oBACtD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;iBAC5B;gBAED,IAAI,UAAU,CAAC,wBAAwB,EAAE,KAAK,OAAO,EAAE;oBACnD,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC;oBACrD,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;iBAC7D;qBAAM;oBACH,OAAO,GAAG,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC;iBACnE;aACJ;YAED,UAAU,CAAC,WAAW,CAAC;gBACnB,aAAa,EAAE,OAAO;gBACtB,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ;aAC9C,CAAC,CAAC;YAEH,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,sCAAsC,CAAC,CAAC;iBACzG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC;gBAEvB,kCAAkC;gBAClC,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,EAAE;oBACjD,2BAA2B;oBAC3B,IAAI,SAAS,CAAC;oBACd,IAAI,kBAAQ,CAAC,QAAQ,CAAC,EAAE;wBACpB,SAAS,GAAG,QAAQ,CAAC;qBACxB;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAC3B,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;4BACpC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,WAAW,GAAG,WAAW,CAAC,CAAC;yBACtE;qBACJ;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAE3B,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BACjC,IAAI,kBAAQ,CAAC,iBAAiB,CAAC,EAAE;gCAC7B,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;6BACvC;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,EAAE,WAAW,GAAG,iBAAiB,CAAC,CAAC;yBAC5E;qBACJ;iBACJ;qBAAM;oBACH,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBAC5D,eAAe,CAAC,QAAQ,GAAG,QAAQ,CAAC;qBACvC;yBAAM;wBACH,MAAM,YAAY,GAAG;4BACjB,KAAK,EAAE,eAAe;4BACtB,QAAQ;yBACX,CAAC;wBACF,UAAU,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;qBACnD;iBACJ;aACJ;iBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;gBACtC,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,kCAAkC,CAAC,CAAC;iBACrG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAE1D,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;gBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;wBACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BAC3B,IAAI,UAAU,GAAG,EAAE,CAAC;4BACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACtC,UAAU,CAAC,IAAI,CAAC,wBAAS,CAAC,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;6BACzD;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;yBACzB;qBACJ;iBACJ;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBACtC,IAAI,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBAC3B,IAAI,UAAU,GAAG,EAAE,CAAC;wBAEpB,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;wBACjC,IAAI,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE;4BAClC,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;yBACvC;wBAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,CAAC,EAAE,EAAE;4BACxC,UAAU,CAAC,IAAI,CAAC,wBAAS,CAAC,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;yBACzD;wBACD,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;qBACzB;iBACJ;aACJ;iBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK;gBAClC,gFAAgF;gBAChF,CAAC,eAAe,CAAC,MAAM;oBACnB,eAAe,CAAC,MAAM;oBACtB,eAAe,CAAC,MAAM,CAAC,EAAE;gBAC7B,2FAA2F;gBAC3F,4FAA4F;gBAC5F,gHAAgH;gBAChH,IAAI,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,MAAM,KAAK,CAAC;oBACzC,eAAe,CAAC,MAAM,EAAE;oBACxB,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC;oBACpC,OAAO;iBACV;gBACD,IAAI,OAAO,KAAK,SAAS,EAAE;oBACvB,MAAM,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,YAAY,GAAG,UAAU,CAAC,WAAW,EAAE,gCAAgC,CAAC,CAAC;iBACnG;gBACD,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;gBAE9B,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;oBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;4BACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCAC5D,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;6BACvB;4BACD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG;gCACtC,KAAK,EAAE,KAAK;gCACZ,QAAQ,EAAE,wBAAS,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;6BACjD,CAAC;yBACL;qBACJ;oBACD,IAAI,SAAS,GAAG,EAAE,CAAC;oBACnB,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;wBACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;4BAC7B,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;yBAC1C;wBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACzC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;yBACnE;wBACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;qBACtC;iBACJ;qBAAM;oBACH,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,oCAAoC;qBACvC;oBACD,IAAI,SAAS,GAAG,EAAE,CAAC;oBACnB,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;4BACvC,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;4BACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACzC,IAAI,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gCACjC,uCAAuC;gCACvC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gCAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCACzC,IAAI,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE;wCACtD,IAAI,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;wCAClD,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE;4CAC5B,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;yCAClC;wCACD,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,wBAAS,CAAC,KAAK,CAAC,CAAC;qCAChE;iCACJ;6BACJ;4BACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;yBACtC;6BAAM;4BACH,yEAAyE;4BACzE,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;4BACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCAC1C,IAAI,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gCACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCACzC,IAAI,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;oCACjC,IAAI,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;oCACnD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;iCACnE;6BACJ;yBACJ;qBACJ;iBACJ;aACJ;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;;OAOG;IACI,sBAAsB,CAAC,qBAA0C;QACpE,8BAAY,CAAC,MAAM,CAAC,qBAAqB,KAAK,SAAS,EACnD,GAAG,GAAG,CAAC,gBAAgB,iFAAiF,CAAC,CAAC;QAE9G,IAAI,CAAC,kBAAQ,CAAC,qBAAqB,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,EAAE;YAC1E,IAAI,CAAC,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC1D,IAAI,CAAC,QAAQ,GAAG;oBACZ,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAqB;oBACtG,KAAK,EAAE,IAAI,CAAC,QAAQ;iBACvB,CAAC;aACL;iBAAM;gBACF,IAAI,CAAC,QAAgC,CAAC,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,CAAC,CAAC;oBACpH,qBAAqB,CAAC;aAC7B;SACJ;aAAM;YACH,MAAM,SAAS,GAAG,EAAE,QAAQ,EAAE,qBAAqB,EAAE,CAAC;YACtD,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAC9C,WAAW,EAAE,IAAI,CAAC,oCAAoC;gBACtD,QAAQ,EAAE,SAAS;aACtB,CAAC,CAAC;SACN;IACL,CAAC;IAAA,CAAC;IAEF;;;;;;OAMG;IACI,yBAAyB,CAAC,cAAuB;QACpD,MAAM,QAAQ,GAAG,UAAS,UAAU;YAChC,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,EAAE,CAAC;YAC7C,IAAI,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,QAAQ,EAAE;gBAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,EAAE;oBACP,OAAO;iBACV;gBACD,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;gBAE9C,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE;oBACvB,mBAAmB;oBACnB,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,EAAE;wBACjD,2BAA2B;wBAE3B,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gCACtC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;6BACtB;yBACJ;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gCAEtC,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gCACjC,IAAI,kBAAQ,CAAC,iBAAiB,CAAC,EAAE;oCAC7B,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;iCACvC;gCACD,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC;6BAChC;yBACJ;wBACD,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BAC5D,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;yBAC5D;qBACJ;yBAAM,IAAI,eAAe,IAAI,eAAe,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wBACnE,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;qBAC5D;iBACJ;qBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;oBACtC,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;yBACtB;qBACJ;oBACD,IAAI,eAAe,CAAC,MAAM,EAAE;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACpD,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;4BACtC,IAAI,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;4BACjC,IAAI,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,EAAE;gCAClC,iBAAiB,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;6BACvC;4BACD,KAAK,CAAC,CAAC,CAAC,GAAG,iBAAiB,CAAC;yBAChC;qBACJ;oBACD,+DAA+D;iBAClE;qBAAM,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK;oBAClC,CAAC,CAAC,cAAc,IAAI,SAAS,CAAC,OAAO,KAAK,QAAQ,CAAC,EAAE,EAAE,yCAAyC;oBAChG,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;oBACtD,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;wBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;4BACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gCAC1C,IAAI,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gCACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAC5D,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;iCACvB;gCACD,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;6BACnD;yBACJ;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,IAAI,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC;4BACzC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC7B,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gCACvC,eAAe,CAAC,MAAM,GAAG,WAAW,CAAC;6BACxC;yBACJ;qBACJ;yBAAM;wBACH,IAAI,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;wBACtD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,oCAAoC;yBACvC;wBACD,IAAI,eAAe,CAAC,MAAM,EAAE;4BACxB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;gCACxC,oDAAoD;gCACpD,IAAI,SAAS,GAAG,EAAE,CAAC;gCACnB,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gCACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oCAC1C,IAAI,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oCACvE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wCACzC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;qCAClC;iCACJ;gCACD,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;6BACtC;yBACJ;qBACJ;iBACJ;aACJ;QACL,CAAC,CAAC;QAEF,IAAI,kBAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;YACtB,IAAI,CAAC,QAAgC,CAAC,QAAQ,KAAK,SAAS;YAC5D,IAAI,CAAC,QAAgC,CAAC,KAAK,KAAK,SAAS,EAAE;YAC5D,IAAI,CAAC,QAAQ,GAAI,IAAI,CAAC,QAAgC,CAAC,KAAK,CAAC;YAC7D,OAAO;SACV;QAED,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;YAC9C,WAAW,EAAE,QAAQ;SACxB,CAAC,CAAC;IACP,CAAC;IAAA,CAAC;IAEF;;;;;;OAMG;IACK,uBAAuB,CAAC,YAAiC,EAAE,qBAA8B;QAC7F,IAAI,KAAK,CAAC;QACV,IAAI,qBAAqB,EAAE;YACvB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;aAAM;YACH,KAAK,GAAG,EAAE,CAAC;YACX,cAAI,CAAC,YAAY,EAAE,UAAS,eAAe;gBACvC,cAAI,CAAC,eAAe,EAAE,UAAS,gBAAgB,EAAE,IAAI;oBACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,CAAC,CAAC,CAAC;YACP,CAAC,CAAC,CAAC;SACN;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAAA,CAAC;IAEF;;;OAGG;IACK,qCAAqC,CAAC,UAAkC;QAC5E,UAAU,CAAC,WAAW,CAAC,UAAU,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;QAEvD,kFAAkF;QAClF,sEAAsE;QACtE,MAAM,sBAAsB,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC;QAElF,IAAI,sBAAsB,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ,EAAE;YACtE,mEAAmE;YACnE,UAAU,CAAC,iBAAiB,GAAG,IAAI,CAAC;YACpC,OAAO;SACV;QAED,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ;YAC1C,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ,EAAE;YAC5C,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,UAAU,CAAC,cAAc,EAAE,CAAC;YAE9C,IAAI,CAAC,SAAS,EAAE;gBACZ,8BAAY,CAAC,MAAM,CAAC,KAAK,EACrB,GAAG,GAAG,CAAC,gBAAgB,uCAAuC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;aACnG;YAED,MAAM,eAAe,GAAG,UAAU,CAAC,kBAAkB,EAAE,CAAC;YAExD,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,IAAI,KAAK,QAAQ,CAAC;gBAC5C,CAAC,IAAI,KAAK,QAAQ,IAAI,kBAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,EAAE;gBAC3D,yDAAyD;gBACzD,IAAI,UAAU,CAAC,gBAAgB,EAAE,KAAK,QAAQ;oBAC1C,CAAC,CAAC,kBAAQ,CAAC,eAAe,CAAC,IAAI,OAAQ,eAAuC,CAAC,QAAQ,KAAK,WAAW,CAAC,EAAE;oBAC1G,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC;iBAC5C;gBAED,4BAA4B;gBAC5B,IAAI,GAAG,GAAG,eAAe,CAAC,QAAQ,CAAC;gBACnC,eAAe,CAAC,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC;gBACjD,eAAe,CAAC,KAAK,GAAG,GAAG,CAAC;aAC/B;iBAAM,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,kBAAQ,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE;gBACpG,4CAA4C;gBAC5C,MAAM,aAAa,GAAG,IAAI,+CAAsB,CAAC,eAAe,CAAC,CAAC;gBAClE,MAAM,eAAe,GAAwB,EAAE,CAAC;gBAChD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,EAAE,CAAC;iBAC/B;gBACD,qDAAqD;gBACrD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;oBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;wBACtC,KAAK,4CAA2B,CAAC,MAAM;4BACnC,iBAAiB;4BACjB,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;gCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;gCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;6BAC3C,CAAC,CAAC;4BACH,MAAM;wBACV,KAAK,4CAA2B,CAAC,MAAM;4BACnC,iBAAiB;4BACjB,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;gCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;gCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;6BAC3C,CAAC,CAAC;4BACH,MAAM;wBACV,KAAK,4CAA2B,CAAC,MAAM;4BACnC,kBAAkB;4BAClB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;gCACnC,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;oCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;oCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;oCACxC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;iCAC3C,CAAC,CAAC;6BACN;iCAAM;gCACH,eAAe,CAAC,MAAM,CAAC,IAAI,CAAC;oCACxB,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM;oCAC7E,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;iCAC3C,CAAC,CAAC;6BACN;4BACD,MAAM;wBACV;4BACI,OAAO,CAAC,KAAK,CAAC,mBAAmB,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;qBACpG;oBACD,aAAa,CAAC,IAAI,EAAE,CAAC;iBACxB;gBACD,UAAU,CAAC,sBAAsB,CAAC,eAAe,CAAC,CAAC;aACtD;iBAAM;gBACH,mCAAmC;gBACnC,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,OAAO,KAAK,KAAK,EAAE;wBAClE,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BAC1C,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;4BACtD,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC;4BACtB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;4BAC7B,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC;yBACxB;qBACJ;iBACJ;gBACD,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC;gBACzC,IAAI,cAAc,GAAG,KAAK,CAAC;gBAC3B,IAAI,eAAe,CAAC,MAAM,EAAE;oBACxB,eAAe,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC;oBAChD,cAAc,GAAG,IAAI,CAAC;oBACtB,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;oBACnC,OAAO,eAAe,CAAC,MAAM,CAAC;oBAC9B,MAAM,iBAAiB,GAAG,eAAe,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;oBAC9E,cAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAAE,UAAS,IAAI;wBACvF,MAAM,QAAQ,GAAG,2BAAS,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;wBACpF,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;oBAC9C,CAAC,CAAC,CAAC;iBACN;gBACD,IAAI,SAAS,EAAE;oBACX,IAAI,cAAc,EAAE;wBAChB,eAAe,CAAC,MAAM,GAAG,wBAAS,CAAC,SAAS,CAAC,CAAC;qBACjD;yBAAM;wBACH,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;wBACnC,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;wBACnC,OAAO,eAAe,CAAC,MAAM,CAAC;qBACjC;oBACD,MAAM,iBAAiB,GAAG,eAAe,CAAC,UAAU,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,CAAC;oBAC9E,cAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,MAAM,EAAE,iBAAiB,CAAC,EAAE,UAAS,IAAI;wBACvF,MAAM,QAAQ,GAAG,2BAAS,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;wBACpF,UAAU,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC;oBAC9C,CAAC,CAAC,CAAC;iBACN;aACJ;SACJ;IACL,CAAC;IAAA,CAAC;IAEF;;;;;OAKG;IACI,kBAAkB;QACrB,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,KAAK,SAAS;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,KAAK,SAAS,EAAE;YACtC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;YAChC,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;SAChC;aAAM;YACH,aAAK,CAAC,4BAA4B,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAC9C,WAAW,EAAE,IAAI,CAAC,qCAAqC,CAAC,IAAI,CAAC,IAAI,CAAC;aACrE,CAAC,CAAC;SACN;IACL,CAAC;;AA5nCL,8BA6nCC;AA5nCU,sBAAY,GAAG,qCAAY,CAAC;AAC5B,0BAAgB,GAAG,mCAAgB,CAAC;AACpC,2BAAiB,GAAG,qCAAiB,CAAC;AA6nCjD,SAAS,CAAC,SAAS,CAAC,iCAAiC,GAAG,+BAAuB,CAAC,iCAAiC,CAAC;AAClH,SAAS,CAAC,SAAS,CAAC,gCAAgC,GAAG,+BAAuB,CAAC,gCAAgC,CAAC;AAChH,SAAS,CAAC,SAAS,CAAC,yBAAyB,GAAG,+BAAuB,CAAC,yBAAyB,CAAC;AAElG,2EAA2E;AAC3E,SAAS,CAAC,SAAS,CAAC,6CAA6C;IAC7D,uDAAmC,CAAC,6CAA6C,CAAC;AACtF,SAAS,CAAC,SAAS,CAAC,gCAAgC;IAChD,uDAAmC,CAAC,gCAAgC,CAAC;AACzE,SAAS,CAAC,SAAS,CAAC,4CAA4C;IAC5D,uDAAmC,CAAC,4CAA4C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Serialized representation of the changes in a repository\n */\n\nimport isObject from \"lodash/isObject\";\nimport isString from \"lodash/isString\";\nimport {copy as cloneDeep} from \"fastest-json-copy\";\nimport isEmpty from \"lodash/isEmpty\";\nimport extend from \"lodash/extend\";\nimport each from \"lodash/each\";\n\n//@ts-ignore\nimport { ConsoleUtils, joinPaths, constants } from \"@fluid-experimental/property-common\";\n\nimport { TypeIdHelper } from \"./helpers/typeidHelper\";\nimport { ChangeSetArrayFunctions } from './changeset_operations/array';\n\nimport { ArrayChangeSetIterator } from \"./changeset_operations/arrayChangesetIterator\";\nimport { ConflictType } from './changeset_operations/changesetConflictTypes'\n// Add the indexed collection functions into the prototype of the ChangeSet\nimport { ChangeSetIndexedCollectionFunctions } from \"./changeset_operations/indexedCollection\";\nimport { isEmptyChangeSet } from \"./changeset_operations/isEmptyChangeset\";\nimport { isReservedKeyword } from \"./isReservedKeyword\";\nimport { Utils } from \"./utils\";\nimport { TemplateValidator } from \"./templateValidator\";\nimport { ArrayIteratorOperationTypes } from \"./changeset_operations/operationTypes\"\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\nconst { extractContext, isPrimitiveType } = TypeIdHelper;\n\n\nexport interface ApplyChangeSetOptions {\n    /**\n     * Additional meta information which help later to obtain more compact changeset during the apply operation.\n     */\n    applyAfterMetaInformation?: Map<any, any>,\n\n    /**\n     * Throw error for template definition mismatches.\n     */\n    throwOnTemplateMismatch?: boolean\n}\n\n\nexport interface RebaseChangeSetOptions extends ApplyChangeSetOptions {\n    rebaseMetaInformation?: object\n}\n\n/**\n * The plain serialization data structure used to encode a ChangeSet.\n */\nexport type SerializedChangeSet = any; //@TODO Maybe we should add full type for the ChangeSet\nexport type ChangeSetType = any;\nexport interface ConflictInfo {\n    /**\n     * Path to the position where the conflict occurred. If the conflicting change is of type\n     * MISMATCH_TEMPLATES then the path will be undefined.\n     */\n    path?: string | undefined;\n    /**\n     * Type of the conflict\n     */\n    type: ConflictType;\n    conflictingChange?: SerializedChangeSet;\n}\n\n/**\n * The ChangeSet represents an operation to be done (or that was done) on the data. It encapsulate one or\n * many addition/insertion and deletion of properties. The ChangeSetObject also provides functionality\n * to merge and swap change sets.\n */\nexport class ChangeSet {\n    static ConflictType = ConflictType;\n    static isEmptyChangeSet = isEmptyChangeSet;\n    static isReservedKeyword = isReservedKeyword;\n\n    declare public _cleanIndexedCollectionChangeSet: typeof ChangeSetIndexedCollectionFunctions._cleanIndexedCollectionChangeSet;\n    declare public _performApplyAfterOnPropertyArray: typeof ChangeSetArrayFunctions._performApplyAfterOnPropertyArray;\n    declare public _rebaseArrayChangeSetForProperty: typeof ChangeSetArrayFunctions._rebaseArrayChangeSetForProperty;\n    declare public _rebaseChangeSetForString: typeof ChangeSetArrayFunctions._rebaseChangeSetForString;\n    declare public _performApplyAfterOnPropertyIndexedCollection: typeof ChangeSetIndexedCollectionFunctions._performApplyAfterOnPropertyIndexedCollection;\n    declare public _rebaseIndexedCollectionChangeSetForProperty: typeof ChangeSetIndexedCollectionFunctions._rebaseIndexedCollectionChangeSetForProperty;\n\n\n    _changes: SerializedChangeSet;\n    _isNormalized: boolean;\n\n    /**\n     * @param [in_changes] - The serialized changes to store in this change set if a string is supplied,\n     * we assume it to be a serialized JSON representation of the change set. If none is supplied, an empty changeset will be created.\n     */\n    constructor(in_changes?: ChangeSetType) {\n        if (in_changes === undefined || in_changes === null) {\n            this._changes = {};\n        } else if (isString(in_changes)) { // Stringified Serialized JSON\n            this._changes = JSON.parse(in_changes);\n        } else if (in_changes instanceof ChangeSet) {\n            this._changes = cloneDeep(in_changes._changes);\n        } else {\n            // Serialized Changeset\n            this._changes = in_changes;\n        }\n\n        this._isNormalized = false;\n    }\n\n\n    /**\n     * Creates a string representation of the change set\n     * @returns JSON encoding of the changes in this change set\n     */\n    toString(): string {\n        return JSON.stringify(this._changes);\n    };\n\n\n    /**\n     * Returns the serialized changes.\n     *\n     * @returns The serialized changeset\n     */\n    getSerializedChangeSet(): SerializedChangeSet {\n        return this._changes;\n    };\n\n    /**\n     * Indicates whether this is a normalized ChangeSet. If this is set to true, squashes will not remove empty entries\n     * from the ChangeSet.\n     *\n     * @param in_isNormalized - is this a normalized ChangeSet?\n     */\n    setIsNormalized(in_isNormalized: boolean) {\n        this._isNormalized = in_isNormalized;\n    };\n\n    /**\n     * Indicates whether this is a normalized ChangeSet. If this is set to true, squashes will not remove empty entries\n     * from the ChangeSet.\n     *\n     * @returns Is this a normalized ChangeSet?\n     */\n    getIsNormalized(): boolean {\n        return this._isNormalized;\n    };\n\n    /**\n     * Clones the ChangeSet\n     *\n     * @returns The cloned ChangeSet\n     */\n    clone(): ChangeSet {\n        return new ChangeSet(cloneDeep(this._changes));\n    };\n\n\n    /**\n     * Updates this ChangeSet. The result will be the concatenation of the two ChangeSets. First the changes in this\n     * ChangeSet are executed, then the changes in the supplied in_changeSet are applied. The result will be\n     * stored in this ChangeSet. This function assumes that the second ChangeSet is relative to the state after\n     * application of the first ChangeSet.\n     *\n     * @param in_changeSet - The changeset to apply\n     * @param in_options - Optional additional parameters\n     */\n    applyChangeSet(in_changeSet: SerializedChangeSet, in_options?: ApplyChangeSetOptions) {\n        let changes = in_changeSet;\n        if (in_changeSet instanceof ChangeSet) {\n            changes = in_changeSet.getSerializedChangeSet();\n        }\n\n        if (!isObject(this._changes) || Array.isArray(this._changes)) {\n            const oldValue = isObject(changes) && (changes as SerializedChangeSet).value !== undefined ? (changes as SerializedChangeSet).value : changes;\n            this._changes = Array.isArray(oldValue) ? oldValue.slice() : oldValue;\n        } else {\n            this._performApplyAfterOnProperty(this._changes, changes, !this._isNormalized, in_options);\n        }\n    };\n\n    /**\n     * Applies a changeset to a given property (recursively). The ChangeSet is assumed to be relative to the same\n     * property root and it will be applied behind the base ChangeSet (assuming that the changes are relative to the\n     * state after the base ChangeSet has been applied. It will change the base ChangeSet.)\n     *\n     * @param io_basePropertyChanges    - The ChangeSet describing the initial state\n     * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n     * @param in_removeEmpty            - Should empty ChangeSets be removed?\n     * @param in_options - Optional additional parameters\n     */\n    private _performApplyAfterOnProperty(\n        io_basePropertyChanges: SerializedChangeSet,\n        in_appliedPropertyChanges: SerializedChangeSet,\n        in_removeEmpty: boolean,\n        in_options?: ApplyChangeSetOptions) {\n        // Apply dynamic property operations\n        if (in_appliedPropertyChanges.insert ||\n            in_appliedPropertyChanges.modify ||\n            in_appliedPropertyChanges.remove) {\n            this._performApplyAfterOnPropertyIndexedCollection(io_basePropertyChanges,\n                in_appliedPropertyChanges,\n                \"NodeProperty\",\n                in_options); // TODO: recursively propagate the typeid?\n        }\n\n        if (!isEmpty(in_appliedPropertyChanges.insertTemplates)) {\n            io_basePropertyChanges.insertTemplates = io_basePropertyChanges.insertTemplates || {};\n            extend(io_basePropertyChanges.insertTemplates, in_appliedPropertyChanges.insertTemplates);\n        }\n\n        // Apply ChangeSet to the properties\n        const modifiedTypeids = Object.keys(in_appliedPropertyChanges);\n        for (let i = 0; i < modifiedTypeids.length; i++) {\n            const typeid = modifiedTypeids[i];\n            // The reserved keywords have already been handled above\n            if (ChangeSet.isReservedKeyword(typeid)) {\n                continue;\n            }\n\n            io_basePropertyChanges[typeid] = io_basePropertyChanges[typeid] || {};\n            const baseChanges = io_basePropertyChanges[typeid];\n            const changedKeys = Object.keys(in_appliedPropertyChanges[typeid]);\n            for (let j = 0; j < changedKeys.length; j++) {\n                this.performApplyAfterOnPropertyWithTypeid(changedKeys[j],\n                    baseChanges,\n                    in_appliedPropertyChanges[typeid],\n                    typeid,\n                    in_removeEmpty,\n                    in_options);\n            }\n            // Remove the type when it no longer contains any changed keys\n            if (in_removeEmpty && isEmpty(io_basePropertyChanges[typeid])) {\n                delete io_basePropertyChanges[typeid];\n            }\n        }\n    };\n\n    /**\n     * Helper function used to apply a new value to a given ChangeSet.\n     * It is used to handle setting a primitive value, which might either be represented\n     * via a literal or an object with a member value.\n     * applies in_appliedValue to the io_baseChanges at the given in_baseKey\n     * @param io_baseChanges - base changes (modified)\n     * @param in_baseKey - key\n     * @param in_appliedValue - applied changes to be applied\n     */\n    private _applyValue(io_baseChanges: SerializedChangeSet, in_baseKey: string, in_appliedValue: SerializedChangeSet) {\n        const newValue = (in_appliedValue && in_appliedValue.hasOwnProperty(\"value\")) ?\n            in_appliedValue.value : in_appliedValue;\n        if (io_baseChanges[in_baseKey] && io_baseChanges[in_baseKey].hasOwnProperty(\"value\")) {\n            io_baseChanges[in_baseKey].value = newValue;\n        } else {\n            if (io_baseChanges[in_baseKey] === undefined &&\n                in_appliedValue && in_appliedValue.hasOwnProperty(\"oldValue\")) {\n                io_baseChanges[in_baseKey] = {\n                    value: newValue,\n                    oldValue: in_appliedValue.oldValue,\n                };\n            } else {\n                io_baseChanges[in_baseKey] = newValue;\n            }\n        }\n    };\n\n    /**\n     * Decides based on the given Typeid which applyAfter operation to perform.\n     * Note: This function is not directly called on the ChangeSet but on the object containing it together with a key\n     *       since it needs to be able to overwrite this entry\n     *\n     * @param in_changedKey             - The key of the entry in the object\n     * @param in_baseChanges            - The object containing the state before the applyAfter\n     * @param in_appliedPropertyChanges - The object containing the ChangeSet with the modification\n     * @param in_typeid                 - The typeid of the property to modify\n     * @param in_removeEmpty            - Should empty ChangeSets be removed?\n     * @param in_options - Optional additional parameters\n     */\n    public performApplyAfterOnPropertyWithTypeid(\n        in_changedKey: string,\n        in_baseChanges: SerializedChangeSet,\n        in_appliedPropertyChanges: { [x: string]: any; },\n        in_typeid: string,\n        in_removeEmpty: boolean,\n        in_options?: ApplyChangeSetOptions) {\n        const splitTypeid = extractContext(in_typeid);\n\n        if (splitTypeid.context === \"set\" ||\n            splitTypeid.context === \"map\") {\n            in_baseChanges[in_changedKey] = in_baseChanges[in_changedKey] || {};\n            this._performApplyAfterOnPropertyIndexedCollection(in_baseChanges[in_changedKey],\n                in_appliedPropertyChanges[in_changedKey],\n                splitTypeid.typeid,\n                in_options);\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(in_baseChanges[in_changedKey])) {\n                delete in_baseChanges[in_changedKey];\n            }\n        } else if (splitTypeid.context === \"array\" || splitTypeid.typeid === \"String\") {\n            in_baseChanges[in_changedKey] = in_baseChanges[in_changedKey] !== undefined ? in_baseChanges[in_changedKey] : {};\n            let baseIsSetChange = false;\n            let oldValue;\n            if (splitTypeid.typeid === \"String\" &&\n                (isString(in_baseChanges[in_changedKey]) ||\n                    (in_baseChanges[in_changedKey] && in_baseChanges[in_changedKey].hasOwnProperty(\"value\")))) {\n                oldValue = in_baseChanges[in_changedKey].oldValue;\n                // we need to convert the format to allow the application of the changes\n                // since _performApplyAfterOnPropertyArray only understands insert/modify/remove commands\n                if (in_baseChanges[in_changedKey] && in_baseChanges[in_changedKey].hasOwnProperty(\"value\")) {\n                    in_baseChanges[in_changedKey] = {\n                        insert: [\n                            [0, in_baseChanges[in_changedKey].value],\n                        ],\n                    };\n                } else {\n                    in_baseChanges[in_changedKey] = {\n                        insert: [\n                            [0, in_baseChanges[in_changedKey]],\n                        ],\n                    };\n                }\n                baseIsSetChange = true;\n            }\n            let appliedChanges = in_appliedPropertyChanges[in_changedKey];\n            if (isObject(appliedChanges) && appliedChanges.hasOwnProperty(\"value\")) {\n                appliedChanges = (appliedChanges as SerializedChangeSet).value;\n            }\n\n            if (splitTypeid.typeid === \"String\" && isString(appliedChanges)) {\n                // we've got a 'set' command and just overwrite the changes\n                if (baseIsSetChange && oldValue !== undefined) {\n                    in_baseChanges[in_changedKey] = {\n                        value: appliedChanges,\n                        oldValue,\n                    };\n                } else {\n                    in_baseChanges[in_changedKey] = appliedChanges;\n                }\n            } else {\n                // we have incremental changes (or a standard array)\n                this._performApplyAfterOnPropertyArray(in_baseChanges[in_changedKey],\n                    in_appliedPropertyChanges[in_changedKey],\n                    splitTypeid.typeid,\n                    in_options);\n                if (baseIsSetChange) {\n                    // we have to convert back to a string, if it had been converted before\n                    let newValue;\n                    if (isEmpty(in_baseChanges[in_changedKey])) {\n                        newValue = \"\";\n                    } else {\n                        newValue = in_baseChanges[in_changedKey].insert[0][1];\n                    }\n                    if (oldValue !== undefined) {\n                        in_baseChanges[in_changedKey] = {\n                            value: newValue,\n                            oldValue,\n                        };\n                    } else {\n                        in_baseChanges[in_changedKey] = newValue;\n                    }\n                }\n            }\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && ChangeSet.isEmptyChangeSet(in_baseChanges[in_changedKey])) {\n                delete in_baseChanges[in_changedKey];\n            }\n        } else if (splitTypeid.isEnum) {\n            // Enum types can simply be overwritten\n            this._applyValue(in_baseChanges, in_changedKey, in_appliedPropertyChanges[in_changedKey]);\n        } else if (splitTypeid.context === \"single\") {\n            if (isPrimitiveType(splitTypeid.typeid)) {\n                // Primitive types can simply be overwritten, however we have an exception for\n                // 64 bit integers (until javascript natively supports them)\n                if (splitTypeid.typeid === \"Int64\" || splitTypeid.typeid === \"Uint64\") {\n                    let appliedVal = in_appliedPropertyChanges[in_changedKey];\n                    if (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n                        appliedVal = appliedVal.value;\n                    }\n                    this._applyValue(in_baseChanges, in_changedKey, appliedVal.slice());\n                } else {\n                    this._applyValue(in_baseChanges, in_changedKey, in_appliedPropertyChanges[in_changedKey]);\n                }\n            } else {\n                if (in_baseChanges[in_changedKey]) {\n                    // Otherwise we have to continue the merging recursively\n                    this._performApplyAfterOnProperty(in_baseChanges[in_changedKey],\n                        in_appliedPropertyChanges[in_changedKey],\n                        false,\n                        in_options);\n                } else {\n                    // If the key doesn't exist, yet, we can just copy it\n                    in_baseChanges[in_changedKey] = cloneDeep(in_appliedPropertyChanges[in_changedKey]);\n                }\n            }\n        } else {\n            throw new Error(MSG.UNKNOWN_CONTEXT + splitTypeid.context);\n        }\n    };\n\n    /**\n     * Rebases a given ChangeSet behind the current ChangeSet.\n     *\n     * This function takes a ChangeSet which is assumed to be relative to the same base state as the ChangeSet stored in\n     * this class and transforms it in such a way that it can be applied after this ChangeSet. The function will modify\n     * the supplied ChangeSet\n     *\n     * @param io_changeSet   -\n     *     The ChangeSet that is rebased behind the state obtained by application of this ChangeSet\n     * @param out_conflicts A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @returns The rebased ChangeSet (the same object as io_changeSet, it will be\n     *     modified in place)\n     */\n    public _rebaseChangeSet(io_changeSet: SerializedChangeSet, out_conflicts: ConflictInfo[],\n        in_options?: RebaseChangeSetOptions): SerializedChangeSet {\n        // We actually only pass this request to the recursive internal function\n        return this._rebaseChangeSetForProperty(this._changes, io_changeSet, \"\", out_conflicts, in_options);\n    };\n\n    /**\n     * Internal helper function that performs a rebase on a single property\n     *\n     * @param in_ownPropertyChangeSet -\n     *     The ChangeSet for the property stored in this class\n     * @param io_rebasePropertyChangeSet -\n     *     The ChangeSet for the property to be rebased\n     * @param in_basePath -\n     *     Base path to get to the property processed by this function\n     * @param out_conflicts -\n     *     A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @returns The rebased ChangeSet for this property\n     */\n    private _rebaseChangeSetForProperty(\n        in_ownPropertyChangeSet: SerializedChangeSet,\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_basePath: string,\n        out_conflicts: ConflictInfo[],\n        in_options: ApplyChangeSetOptions): SerializedChangeSet {\n        // Process the children in this ChangeSet\n        if ((in_ownPropertyChangeSet.insert ||\n            in_ownPropertyChangeSet.modify ||\n            in_ownPropertyChangeSet.remove) &&\n            (io_rebasePropertyChangeSet.insert ||\n                io_rebasePropertyChangeSet.modify ||\n                io_rebasePropertyChangeSet.remove)) {\n            this._rebaseIndexedCollectionChangeSetForProperty(in_ownPropertyChangeSet,\n                io_rebasePropertyChangeSet,\n                in_basePath,\n                \"NodeProperty\", // TODO: recursively propagate the typeid?\n                false, // don't use square brackets (use dots instead)\n                out_conflicts,\n                in_options);\n        }\n        if (!isEmpty(io_rebasePropertyChangeSet.insertTemplates)) {\n            const typeids = Object.keys(io_rebasePropertyChangeSet.insertTemplates);\n\n            const templateMismatchChangeSet = { insertTemplates: {} };\n\n            const templateMismatchConflict = {\n                type: ChangeSet.ConflictType.MISMATCH_TEMPLATES,\n                conflictingChange: templateMismatchChangeSet,\n            };\n\n            each(typeids, function(typeid) {\n                const template = io_rebasePropertyChangeSet.insertTemplates[typeid];\n                if (in_ownPropertyChangeSet.insertTemplates &&\n                    in_ownPropertyChangeSet.insertTemplates[typeid]) {\n                    const isEqual = TemplateValidator.Utils.psetDeepEquals(\n                        template,\n                        in_ownPropertyChangeSet.insertTemplates[template.typeid],\n                    );\n\n                    if (!isEqual) {\n                        if (in_options && in_options.throwOnTemplateMismatch) {\n                            throw new Error(MSG.TEMPLATE_MISMATCH + typeid);\n                        }\n\n                        templateMismatchChangeSet.insertTemplates[typeid] =\n                            in_ownPropertyChangeSet.insertTemplates[template.typeid];\n                        // TODO: Remove this warning message once we offer a conflict resolution API\n                        console.warn(MSG.TEMPLATE_MISMATCH + typeid);\n                    }\n\n                    delete io_rebasePropertyChangeSet.insertTemplates[typeid];\n                }\n            });\n\n            // Remove insertTemplates key if it is empty\n            if (isEmpty(io_rebasePropertyChangeSet.insertTemplates)) {\n                delete io_rebasePropertyChangeSet.insertTemplates;\n            }\n\n            if (!isEmpty(templateMismatchConflict.conflictingChange.insertTemplates)) {\n                out_conflicts.push(templateMismatchConflict);\n            }\n        }\n\n        // Check for collisions in the property assignments\n        const changedTypeids = Object.keys(in_ownPropertyChangeSet);\n\n        // We currently do not yet have any\n        const changeSet = {};\n        for (let i = 0; i < changedTypeids.length; i++) {\n            const typeid = changedTypeids[i];\n            const paths = Object.keys(in_ownPropertyChangeSet[typeid]);\n\n            // Update the oldValue of primitive property of a changeset\n            // for simple changeset with 'modify', property type, name, value\n            // find the oldValue of the property and update it\n            if (typeid === \"modify\" && \"modify\" in io_rebasePropertyChangeSet) {\n                for (let j = 0; j < paths.length; j++) {\n                    const tempTypeid = paths[i];\n                    if ((isPrimitiveType(tempTypeid)) &&\n                        tempTypeid in io_rebasePropertyChangeSet.modify) {\n                        const tempPaths = Object.keys(in_ownPropertyChangeSet.modify[tempTypeid]);\n                        for (let z = 0; z < tempPaths.length; z++) {\n                            if (tempPaths[z] in io_rebasePropertyChangeSet.modify[tempTypeid]) {\n                                let rebasedPropContent = io_rebasePropertyChangeSet.modify[tempTypeid][tempPaths[z]];\n                                if (isObject(rebasedPropContent) && \"oldValue\" in rebasedPropContent) {\n                                    (rebasedPropContent as SerializedChangeSet).oldValue = in_ownPropertyChangeSet.modify[tempTypeid][tempPaths[z]].value;\n                                }\n                            }\n                        }\n                    }\n                }\n            } else if (isPrimitiveType(typeid)) {\n                // for complex changeset, the function will be called recursively, when the function is at the level where\n                // io_rebasePropertyChangeSet && in_ownPropertyChangeSet contain only property type, name and value, we update\n                // oldValue of io_rebasePropertyChangeSet.\n                for (let j = 0; j < paths.length; j++) {\n                    if (typeid in io_rebasePropertyChangeSet && paths[j] in io_rebasePropertyChangeSet[typeid]) {\n                        let rebasedPropContent = io_rebasePropertyChangeSet[typeid][paths[j]];\n                        if (isObject(rebasedPropContent) && \"oldValue\" in rebasedPropContent) {\n                            // if oldValue already be update above, we don't need to update\n                            if (io_rebasePropertyChangeSet[typeid][paths[j]].oldValue !==\n                                in_ownPropertyChangeSet[typeid][paths[j]].value) {\n                                io_rebasePropertyChangeSet[typeid][paths[j]].oldValue = in_ownPropertyChangeSet[typeid][paths[j]].value;\n                            }\n                        }\n                    }\n                }\n            }\n\n            // The reserved keywords have already been handled above and changes which are not present in\n            // the other ChangeSet can be ignored\n            if (ChangeSet.isReservedKeyword(typeid) ||\n                !io_rebasePropertyChangeSet[typeid]) {\n                continue;\n            }\n\n            // Check, whether we have a collision in a path update\n            for (let j = 0; j < paths.length; j++) {\n                if (io_rebasePropertyChangeSet[typeid][paths[j]] !== undefined) {\n                    in_ownPropertyChangeSet[typeid] = in_ownPropertyChangeSet[typeid] || {};\n\n                    const newPath = joinPaths(in_basePath,\n                        paths[j],\n                        PROPERTY_PATH_DELIMITER);\n                    // Perform the rebase operation on the ChangeSet for this entry\n                    const setConflict = this.rebaseChangeSetForPropertyEntryWithTypeid(paths[j],\n                        in_ownPropertyChangeSet[typeid],\n                        io_rebasePropertyChangeSet[typeid],\n                        typeid,\n                        newPath,\n                        true,\n                        out_conflicts,\n                        in_options);\n\n                    // If there has been a non-recursive set collision we handle it here separately\n                    if (setConflict) {\n                        // If we have two writes to primitive types, this is a conflict\n                        changeSet[typeid] = changeSet[typeid] || {};\n\n                        // Store the change. Note: We make a deep copy here, as this is a reference into our\n                        // own internal ChangeSet and we want to be sure, nobody changes our internal data-structures\n                        changeSet[typeid][paths[j]] = cloneDeep(in_ownPropertyChangeSet[typeid][paths[j]]);\n                    }\n\n                    // Remove the typeid, when it no longer contains any keys\n                    if (isEmpty(io_rebasePropertyChangeSet[typeid])) {\n                        delete io_rebasePropertyChangeSet[typeid];\n                    }\n                }\n            }\n        }\n\n        // If there were conflicts in the set operations, report them\n        if (!isEmpty(changeSet)) {\n            const conflict = {\n                path: in_basePath,\n                type: ChangeSet.ConflictType.COLLIDING_SET,\n                conflictingChange: changeSet,\n            };\n            out_conflicts.push(conflict);\n        }\n\n        return io_rebasePropertyChangeSet;\n    };\n\n    /**\n     * Decides based on the given Typeid which rebase operation to perform\n     * Note: This function is not directly called on the ChangeSet but on the object containing it together with a key\n     *       since it needs to be able to overwrite this entry\n     *\n     * @param in_key                          - The key of the entry in the object\n     * @param in_ownPropertyChangeSet         - The object containing the ChangeSet for the property\n     *                                                   stored in this class\n     * @param io_rebasePropertyChangeSet      - The object containing the ChangeSet for the property to\n     *                                                   be rebased\n     * @param in_typeid                       - The typeid of the property to rebase\n     * @param in_basePath                     - Base path to get to the property processed by this function\n     * @param in_removeEmpty                 - Should empty ChangeSets be removed?\n     * @param out_conflicts - A list of paths that resulted in\n     *                                                   conflicts together with the type of the conflict\n     *\n     * @returns Has there been a simple set collision? Those have to be handled separately\n     *                   TODO: We should unify the handling of set collisions\n     * @private\n     */\n    private rebaseChangeSetForPropertyEntryWithTypeid(\n        in_key: string,\n        in_ownPropertyChangeSet: SerializedChangeSet,\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_typeid: string,\n        in_basePath: string,\n        in_removeEmpty: boolean,\n        out_conflicts: any,\n        in_options: ApplyChangeSetOptions): boolean {\n        const splitTypeid = extractContext(in_typeid);\n\n        if (splitTypeid.context === \"set\" ||\n            splitTypeid.context === \"map\") {\n            this._rebaseIndexedCollectionChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet[in_key],\n                in_basePath,\n                splitTypeid.typeid,\n                true, // use square brackets\n                out_conflicts,\n                in_options);\n\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.context === \"array\") {\n            this._rebaseArrayChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet[in_key],\n                in_basePath,\n                out_conflicts,\n                splitTypeid.typeid,\n                in_options);\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.typeid === \"String\") {\n            this._rebaseChangeSetForString(in_ownPropertyChangeSet[in_key],\n                io_rebasePropertyChangeSet, in_key,\n                in_basePath,\n                out_conflicts,\n                in_options);\n            // Remove the key, when it no longer contains a changeset\n            if (in_removeEmpty && isEmpty(io_rebasePropertyChangeSet[in_key])) {\n                delete io_rebasePropertyChangeSet[in_key];\n            }\n        } else if (splitTypeid.context === \"single\") {\n            // We only can have a conflict when the path exists in both ChangeSets\n            if (in_ownPropertyChangeSet[in_key] !== undefined) {\n                if (isPrimitiveType(splitTypeid.typeid) || splitTypeid.isEnum) {\n                    return true;\n                } else {\n                    // Otherwise, we have to continue recursively\n\n                    // Make sure the paths exist\n                    in_ownPropertyChangeSet[in_key] = in_ownPropertyChangeSet[in_key] || {};\n\n                    // And then perform the recursive rebase\n                    this._rebaseChangeSetForProperty(in_ownPropertyChangeSet[in_key],\n                        io_rebasePropertyChangeSet[in_key],\n                        in_basePath,\n                        out_conflicts,\n                        in_options);\n                }\n            }\n        } else {\n            throw new Error(MSG.UNKNOWN_CONTEXT + splitTypeid.context);\n        }\n\n        return false;\n    };\n\n    /**\n     * recursive helper function for ChangeSet.prototype._toReversibleChangeSet\n     * which converts a irreversible changeset to a reversible changeset\n     * or updates the former state of a reversible changeset\n     * @param in_context the traversal context\n     */\n    private _recursivelyBuildReversibleChangeSet(in_context: Utils.TraversalContext) {\n        const opType = in_context.getOperationType();\n        if (opType === \"modify\") {\n            const type = in_context.getTypeid();\n            const splitType = in_context.getSplitTypeID();\n            let nestedChangeset = in_context.getNestedChangeSet();\n\n            let current = in_context.getUserData().parallelState;\n            if (in_context.getPropertyContainerType() === \"root\") {\n                current = in_context.getUserData().oldState;\n            } else if (current) {\n                if (in_context.getPropertyContainerType() !== \"template\") {\n                    current = current.insert;\n                }\n\n                if (in_context.getPropertyContainerType() !== \"array\") {\n                    current = current && current[in_context.getTypeid()];\n                    current = current && current[in_context.getLastSegment()];\n                } else {\n                    current = current && current[0][1][in_context.getLastSegment()];\n                }\n            }\n\n            in_context.setUserData({\n                parallelState: current,\n                oldState: in_context.getUserData().oldState,\n            });\n\n            if (isPrimitiveType(type)) {\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making primitive value reversible.`);\n                }\n                let oldValue = current;\n\n                // store it in reversibleChangeSet\n                if (type === \"String\" && !isString(nestedChangeset)) {\n                    // String is a special case\n                    let oldString;\n                    if (isString(oldValue)) {\n                        oldString = oldValue;\n                    }\n                    if (nestedChangeset.modify) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            let entryOffset = entry[0];\n                            const entryLength = entry[1].length;\n                            entry[2] = oldString.slice(entryOffset, entryOffset + entryLength);\n                        }\n                    }\n                    if (nestedChangeset.remove) {\n                        for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                            let entry = nestedChangeset.remove[i];\n                            let entryOffset = entry[0];\n\n                            let removeRangeLength = entry[1];\n                            if (isString(removeRangeLength)) {\n                                removeRangeLength = entry[1].length;\n                            }\n                            entry[1] = oldString.slice(entryOffset, entryOffset + removeRangeLength);\n                        }\n                    }\n                } else {\n                    if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                        nestedChangeset.oldValue = oldValue;\n                    } else {\n                        const newChangeSet = {\n                            value: nestedChangeset,\n                            oldValue,\n                        };\n                        in_context.replaceNestedChangeSet(newChangeSet);\n                    }\n                }\n            } else if (splitType.context === \"array\") {\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making array value reversible.`);\n                }\n                let oldValue = current.insert ? current.insert[0][1] : [];\n\n                let nestedChangeset = in_context.getNestedChangeSet();\n                if (nestedChangeset.modify) {\n                    if (isPrimitiveType(splitType.typeid)) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            let entryOffset = entry[0];\n                            let oldEntries = [];\n                            for (let j = 0; j < entry[1].length; j++) {\n                                oldEntries.push(cloneDeep(oldValue[entryOffset + j]));\n                            }\n                            entry[2] = oldEntries;\n                        }\n                    }\n                }\n                if (nestedChangeset.remove) {\n                    for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                        let entry = nestedChangeset.remove[i];\n                        let entryOffset = entry[0];\n                        let oldEntries = [];\n\n                        let removeRangeLength = entry[1];\n                        if (Array.isArray(removeRangeLength)) {\n                            removeRangeLength = entry[1].length;\n                        }\n\n                        for (let j = 0; j < removeRangeLength; j++) {\n                            oldEntries.push(cloneDeep(oldValue[entryOffset + j]));\n                        }\n                        entry[1] = oldEntries;\n                    }\n                }\n            } else if (splitType.context === \"map\" ||\n                // node property test: (we have to do the test this way, because of inheritance)\n                (nestedChangeset.insert ||\n                    nestedChangeset.modify ||\n                    nestedChangeset.remove)) {\n                // This prevents an error, if the changeset only contains an insert operation. In that case\n                // we don't actually need the corresponding old state and thus do not need to throw an error\n                // This type of situation can occur in the materialized history, if an insert happens right at a chunk boundary.\n                if (Object.keys(nestedChangeset).length === 1 &&\n                    nestedChangeset.insert) {\n                    in_context._traversalStopped = true;\n                    return;\n                }\n                if (current === undefined) {\n                    throw new Error(`${MSG.INVALID_PATH + in_context.getFullPath()}. Making map value reversible.`);\n                }\n                let oldValue = current.insert;\n\n                if (isPrimitiveType(splitType.typeid)) {\n                    if (nestedChangeset.modify) {\n                        const modifiedKeys = Object.keys(nestedChangeset.modify);\n                        for (let i = 0; i < modifiedKeys.length; i++) {\n                            let entry = nestedChangeset.modify[modifiedKeys[i]];\n                            if (typeof entry === \"object\" && entry.hasOwnProperty(\"value\")) {\n                                entry = entry.value;\n                            }\n                            nestedChangeset.modify[modifiedKeys[i]] = {\n                                value: entry,\n                                oldValue: cloneDeep(oldValue[modifiedKeys[i]]),\n                            };\n                        }\n                    }\n                    let newRemove = {};\n                    if (nestedChangeset.remove) {\n                        let removedKeys = nestedChangeset.remove;\n                        if (!Array.isArray(removedKeys)) {\n                            removedKeys = Object.keys(removedKeys);\n                        }\n                        for (let i = 0; i < removedKeys.length; i++) {\n                            newRemove[removedKeys[i]] = cloneDeep(oldValue[removedKeys[i]]);\n                        }\n                        nestedChangeset.remove = newRemove;\n                    }\n                } else {\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (nestedChangeset.modify) {\n                        // this case is handeled recursively\n                    }\n                    let newRemove = {};\n                    if (nestedChangeset.remove) {\n                        if (Array.isArray(nestedChangeset.remove)) {\n                            let removedKeys = nestedChangeset.remove;\n                            for (let i = 0; i < removedKeys.length; i++) {\n                                let searchedKey = removedKeys[i];\n                                // search for this key in the old keys:\n                                const oldTypeKeys = Object.keys(oldValue);\n                                for (let k = 0; k < oldTypeKeys.length; k++) {\n                                    if (oldValue[oldTypeKeys[k]].hasOwnProperty(searchedKey)) {\n                                        let entry = oldValue[oldTypeKeys[k]][searchedKey];\n                                        if (!newRemove[oldTypeKeys[k]]) {\n                                            newRemove[oldTypeKeys[k]] = {};\n                                        }\n                                        newRemove[oldTypeKeys[k]][removedKeys[i]] = cloneDeep(entry);\n                                    }\n                                }\n                            }\n                            nestedChangeset.remove = newRemove;\n                        } else {\n                            // we already have a reversibleChangeSet and need to update the oldValues\n                            const removedTypes = Object.keys(nestedChangeset.remove);\n                            for (let t = 0; t < removedTypes.length; t++) {\n                                let removedKeys = Object.keys(nestedChangeset.remove[removedTypes[t]]);\n                                for (let i = 0; i < removedKeys.length; i++) {\n                                    let searchedKey = removedKeys[i];\n                                    let entry = oldValue[removedTypes[t]][searchedKey];\n                                    nestedChangeset.remove[removedTypes[t]][removedKeys[i]] = entry;\n                                }\n                            }\n                        }\n                    }\n                }\n            }\n        }\n    };\n\n    /**\n     * Converts an irreversible changeset to a reversible changeset\n     * or updates the former state of a reversible changeset\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release.\n     * @param in_oldSerializedState the old state\n     */\n    public _toReversibleChangeSet(in_oldSerializedState: SerializedChangeSet) {\n        ConsoleUtils.assert(in_oldSerializedState !== undefined,\n            `${MSG.ASSERTION_FAILED}Missing function parameter \"in_oldSerializedState\" of \"_toReversibleChangeSet\".`);\n\n        if (!isObject(in_oldSerializedState) || Array.isArray(in_oldSerializedState)) {\n            if (!isObject(this._changes) || Array.isArray(this._changes)) {\n                this._changes = {\n                    oldValue: Array.isArray(in_oldSerializedState) ? in_oldSerializedState.slice() : in_oldSerializedState,\n                    value: this._changes,\n                };\n            } else {\n                (this._changes as SerializedChangeSet).oldValue = Array.isArray(in_oldSerializedState) ? in_oldSerializedState.slice() :\n                    in_oldSerializedState;\n            }\n        } else {\n            const workspace = { oldState: in_oldSerializedState };\n            Utils.traverseChangeSetRecursively(this._changes, {\n                preCallback: this._recursivelyBuildReversibleChangeSet,\n                userData: workspace,\n            });\n        }\n    };\n\n    /**\n     * Converts a reversible changeset to an irreversible changeset\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release.\n     * @param in_withoutRoot - Bypass a fix where the root of a changeset is cleaned\n     */\n    public _stripReversibleChangeSet(in_withoutRoot: boolean) {\n        const callback = function(in_context) {\n            const opType = in_context.getOperationType();\n            if (opType === \"remove\" || opType === \"modify\") {\n                const type = in_context.getTypeid();\n                if (!type) {\n                    return;\n                }\n                const splitType = in_context.getSplitTypeID();\n\n                if (isPrimitiveType(type)) {\n                    // remove old state\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (type === \"String\" && !isString(nestedChangeset)) {\n                        // String is a special case\n\n                        if (nestedChangeset.modify) {\n                            for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                                let entry = nestedChangeset.modify[i];\n                                entry.splice(2, 1);\n                            }\n                        }\n                        if (nestedChangeset.remove) {\n                            for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                                let entry = nestedChangeset.remove[i];\n\n                                let removeRangeLength = entry[1];\n                                if (isString(removeRangeLength)) {\n                                    removeRangeLength = entry[1].length;\n                                }\n                                entry[1] = removeRangeLength;\n                            }\n                        }\n                        if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                            in_context.replaceNestedChangeSet(nestedChangeset.value);\n                        }\n                    } else if (nestedChangeset && nestedChangeset.hasOwnProperty(\"value\")) {\n                        in_context.replaceNestedChangeSet(nestedChangeset.value);\n                    }\n                } else if (splitType.context === \"array\") {\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (nestedChangeset.modify) {\n                        for (let i = 0; i < nestedChangeset.modify.length; i++) {\n                            let entry = nestedChangeset.modify[i];\n                            entry.splice(2, 1);\n                        }\n                    }\n                    if (nestedChangeset.remove) {\n                        for (let i = 0; i < nestedChangeset.remove.length; i++) {\n                            let entry = nestedChangeset.remove[i];\n                            let removeRangeLength = entry[1];\n                            if (Array.isArray(removeRangeLength)) {\n                                removeRangeLength = entry[1].length;\n                            }\n                            entry[1] = removeRangeLength;\n                        }\n                    }\n                    // TODO: Remove in_withoutRoot when it will not be used anymore\n                } else if (splitType.context === \"map\" ||\n                    (!in_withoutRoot && splitType.context === \"single\")) { // For NodeProperty / inserts at the root\n                    let nestedChangeset = in_context.getNestedChangeSet();\n                    if (isPrimitiveType(splitType.typeid)) {\n                        if (nestedChangeset.modify) {\n                            const modifiedKeys = Object.keys(nestedChangeset.modify);\n                            for (let i = 0; i < modifiedKeys.length; i++) {\n                                let entry = nestedChangeset.modify[modifiedKeys[i]];\n                                if (typeof entry === \"object\" && entry.hasOwnProperty(\"value\")) {\n                                    entry = entry.value;\n                                }\n                                nestedChangeset.modify[modifiedKeys[i]] = entry;\n                            }\n                        }\n                        if (nestedChangeset.remove) {\n                            let removedKeys = nestedChangeset.remove;\n                            if (!Array.isArray(removedKeys)) {\n                                removedKeys = Object.keys(removedKeys);\n                                nestedChangeset.remove = removedKeys;\n                            }\n                        }\n                    } else {\n                        let nestedChangeset = in_context.getNestedChangeSet();\n                        if (nestedChangeset.modify) {\n                            // this case is handeled recursively\n                        }\n                        if (nestedChangeset.remove) {\n                            if (!Array.isArray(nestedChangeset.remove)) {\n                                // we have a reversibleChangeSet and need to convert\n                                let newRemove = [];\n                                const removedTypes = Object.keys(nestedChangeset.remove);\n                                for (let t = 0; t < removedTypes.length; t++) {\n                                    let removedKeys = Object.keys(nestedChangeset.remove[removedTypes[t]]);\n                                    for (let i = 0; i < removedKeys.length; i++) {\n                                        newRemove.push(removedKeys[i]);\n                                    }\n                                }\n                                nestedChangeset.remove = newRemove;\n                            }\n                        }\n                    }\n                }\n            }\n        };\n\n        if (isObject(this._changes) &&\n            (this._changes as SerializedChangeSet).oldValue !== undefined &&\n            (this._changes as SerializedChangeSet).value !== undefined) {\n            this._changes = (this._changes as SerializedChangeSet).value;\n            return;\n        }\n\n        Utils.traverseChangeSetRecursively(this._changes, {\n            preCallback: callback,\n        });\n    };\n\n    /**\n     * Helper function to extract the first level paths from a given change set\n     * @param in_changeSet The ChangeSet to extract paths from\n     * @param isPrimitiveCollection Is this a primitive type collection?\n     *\n     * @returns List of paths found at the first level of the change set\n     */\n    private _extractFirstLevelPaths(in_changeSet: SerializedChangeSet, isPrimitiveCollection: boolean): string[] {\n        let paths;\n        if (isPrimitiveCollection) {\n            paths = Object.keys(in_changeSet);\n        } else {\n            paths = [];\n            each(in_changeSet, function(nestedChangeSet) {\n                each(nestedChangeSet, function(nestedChangeSet2, path) {\n                    paths.push(path);\n                });\n            });\n        }\n\n        return paths;\n    };\n\n    /**\n     * recursive helper function for ChangeSet.prototype._toInverseChangeSet\n     * @param in_context the traversal context\n     */\n    private _recursivelyInvertReversibleChangeset(in_context: Utils.TraversalContext) {\n        in_context.setUserData(in_context.getUserData() || {});\n\n        // Figure out if we have already visited this path by verifying that the full path\n        // is contained within the list of processed deleted or inserted paths\n        const isWithinInsertOrDelete = in_context.getUserData()[in_context.getFullPath()];\n\n        if (isWithinInsertOrDelete && in_context.getOperationType() !== \"modify\") {\n            // We are within an insert or remove sub tree. Skip this iteration.\n            in_context._traversalStopped = true;\n            return;\n        }\n\n        if (in_context.getOperationType() === \"remove\" ||\n            in_context.getOperationType() === \"modify\") {\n            const type = in_context.getTypeid();\n            const splitType = in_context.getSplitTypeID();\n\n            if (!splitType) {\n                ConsoleUtils.assert(false,\n                    `${MSG.ASSERTION_FAILED}Missing \"splitType\" in \"in_context\":${JSON.stringify(in_context)}`);\n            }\n\n            const nestedChangeset = in_context.getNestedChangeSet();\n\n            if ((isPrimitiveType(type) && type !== \"String\") ||\n                (type === \"String\" && isString(nestedChangeset.oldValue))) {\n                // check if we were called with an irreversible changeset\n                if (in_context.getOperationType() === \"modify\" &&\n                    (!isObject(nestedChangeset) || typeof (nestedChangeset as SerializedChangeSet).oldValue === \"undefined\")) {\n                    throw new Error(MSG.OLD_VALUE_NOT_FOUND);\n                }\n\n                // switch oldValue and value\n                let tmp = nestedChangeset.oldValue;\n                nestedChangeset.oldValue = nestedChangeset.value;\n                nestedChangeset.value = tmp;\n            } else if ((type === \"String\" && !isString(nestedChangeset.oldValue)) || splitType.context === \"array\") {\n                // String and Arrays need special treatment:\n                const arrayIterator = new ArrayChangeSetIterator(nestedChangeset);\n                const resultChangeset: SerializedChangeSet = {};\n                if (nestedChangeset.modify) {\n                    resultChangeset.modify = [];\n                }\n                if (nestedChangeset.insert) {\n                    resultChangeset.remove = [];\n                }\n                if (nestedChangeset.remove) {\n                    resultChangeset.insert = [];\n                }\n                // Successively invert the changes from the changeSet\n                while (!arrayIterator.atEnd()) {\n                    switch (arrayIterator.opDescription.type) {\n                        case ArrayIteratorOperationTypes.INSERT:\n                            // Handle inserts\n                            resultChangeset.remove.push([\n                                arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                arrayIterator.opDescription.operation[1],\n                            ]);\n                            break;\n                        case ArrayIteratorOperationTypes.REMOVE:\n                            // Handle removes\n                            resultChangeset.insert.push([\n                                arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                arrayIterator.opDescription.operation[1],\n                            ]);\n                            break;\n                        case ArrayIteratorOperationTypes.MODIFY:\n                            // Handle modifies\n                            if (isPrimitiveType(splitType.typeid)) {\n                                resultChangeset.modify.push([\n                                    arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                    arrayIterator.opDescription.operation[2],\n                                    arrayIterator.opDescription.operation[1],\n                                ]);\n                            } else {\n                                resultChangeset.modify.push([\n                                    arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                                    arrayIterator.opDescription.operation[1],\n                                ]);\n                            }\n                            break;\n                        default:\n                            console.error(`applyChangeset: ${MSG.UNKNOWN_OPERATION}${arrayIterator.opDescription.type}`);\n                    }\n                    arrayIterator.next();\n                }\n                in_context.replaceNestedChangeSet(resultChangeset);\n            } else {\n                // Covers NodeProperty, Map and Set\n                if (nestedChangeset.modify) {\n                    if (isPrimitiveType(splitType.typeid) && splitType.context === \"map\") {\n                        const modifiedKeys = Object.keys(nestedChangeset.modify);\n                        for (let i = 0; i < modifiedKeys.length; i++) {\n                            const entry = nestedChangeset.modify[modifiedKeys[i]];\n                            let tmp = entry.value;\n                            entry.value = entry.oldValue;\n                            entry.oldValue = tmp;\n                        }\n                    }\n                }\n                const oldInsert = nestedChangeset.insert;\n                let replacedInsert = false;\n                if (nestedChangeset.remove) {\n                    nestedChangeset.insert = nestedChangeset.remove;\n                    replacedInsert = true;\n                    nestedChangeset.remove = undefined;\n                    delete nestedChangeset.remove;\n                    const isPrimitiveTypeid = isPrimitiveType(in_context.getSplitTypeID().typeid);\n                    each(this._extractFirstLevelPaths(nestedChangeset.insert, isPrimitiveTypeid), function(path) {\n                        const fullPath = joinPaths(in_context.getFullPath(), path, PROPERTY_PATH_DELIMITER);\n                        in_context.getUserData()[fullPath] = true;\n                    });\n                }\n                if (oldInsert) {\n                    if (replacedInsert) {\n                        nestedChangeset.remove = cloneDeep(oldInsert);\n                    } else {\n                        nestedChangeset.remove = oldInsert;\n                        nestedChangeset.insert = undefined;\n                        delete nestedChangeset.insert;\n                    }\n                    const isPrimitiveTypeid = isPrimitiveType(in_context.getSplitTypeID().typeid);\n                    each(this._extractFirstLevelPaths(nestedChangeset.remove, isPrimitiveTypeid), function(path) {\n                        const fullPath = joinPaths(in_context.getFullPath(), path, PROPERTY_PATH_DELIMITER);\n                        in_context.getUserData()[fullPath] = true;\n                    });\n                }\n            }\n        }\n    };\n\n    /**\n     * Inverts a reversible ChangeSets\n     * WARNING: This function is still experimental and needs more testing\n     * and it's set to private for now. It will be converted to a public API function\n     * in a later release\n     */\n    public toInverseChangeSet() {\n        if (this._changes.value !== undefined &&\n            this._changes.oldValue !== undefined) {\n            const tmp = this._changes.value;\n            this._changes.value = this._changes.oldValue;\n            this._changes.oldValue = tmp;\n        } else {\n            Utils.traverseChangeSetRecursively(this._changes, {\n                preCallback: this._recursivelyInvertReversibleChangeset.bind(this),\n            });\n        }\n    }\n}\n\n\nChangeSet.prototype._performApplyAfterOnPropertyArray = ChangeSetArrayFunctions._performApplyAfterOnPropertyArray;\nChangeSet.prototype._rebaseArrayChangeSetForProperty = ChangeSetArrayFunctions._rebaseArrayChangeSetForProperty;\nChangeSet.prototype._rebaseChangeSetForString = ChangeSetArrayFunctions._rebaseChangeSetForString;\n\n// Add the indexed collection functions into the prototype of the ChangeSet\nChangeSet.prototype._performApplyAfterOnPropertyIndexedCollection =\n    ChangeSetIndexedCollectionFunctions._performApplyAfterOnPropertyIndexedCollection;\nChangeSet.prototype._cleanIndexedCollectionChangeSet =\n    ChangeSetIndexedCollectionFunctions._cleanIndexedCollectionChangeSet;\nChangeSet.prototype._rebaseIndexedCollectionChangeSetForProperty =\n    ChangeSetIndexedCollectionFunctions._rebaseIndexedCollectionChangeSetForProperty;\n"]}

package/dist/changeset_operations/indexedCollection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"indexedCollection.d.ts","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAWH,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAoCxF,yBAAiB,mCAAmC,CAAC;IACjD;;;;;;;;;;;;;;OAcG;IACI,MAAM,6CAA6C,2BAC9B,mBAAmB,6BAChB,mBAAmB,aACnC,MAAM,cACL,qBAAqB,SAgUpC,CAAA;IAED;;;;;;;;;;;;;;;;OAgBG;IACI,MAAM,4CAA4C,4BAC5B,mBAAmB,8BAChB,mBAAmB,eAClC,MAAM,aACR,MAAM,8BACW,OAAO,iBACpB,YAAY,EAAE,cACjB,qBAAqB,SA+UpC,CAAA;IAED;;;;;;OAMG;IACI,MAAM,gCAAgC,uBAAgC,mBAAmB,sBAAsB,OAAO,SAwD5H,CAAA;CACJ"}
+{"version":3,"file":"indexedCollection.d.ts","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAWH,OAAO,EAAE,qBAAqB,EAAE,YAAY,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAqCxF,yBAAiB,mCAAmC,CAAC;IACjD;;;;;;;;;;;;;;OAcG;IACI,MAAM,6CAA6C,2BAC9B,mBAAmB,6BAChB,mBAAmB,aACnC,MAAM,cACL,qBAAqB,SAgUpC,CAAA;IAED;;;;;;;;;;;;;;;;OAgBG;IACI,MAAM,4CAA4C,4BAC5B,mBAAmB,8BAChB,mBAAmB,eAClC,MAAM,aACR,MAAM,8BACW,OAAO,iBACpB,YAAY,EAAE,cACjB,qBAAqB,SA+UpC,CAAA;IAED;;;;;;OAMG;IACI,MAAM,gCAAgC,uBAAgC,mBAAmB,sBAAsB,OAAO,SAwD5H,CAAA;CACJ"}

package/dist/changeset_operations/indexedCollection.js

@@ -43,7 +43,8 @@ const _fastIsEmptyObject = function (in_object) {
     if (!in_object || Array.isArray(in_object) || !isObject_1.default(in_object)) {
         return isEmpty_1.default(in_object);
     }
-    for (const _entry in in_object) { // eslint-disable-line
+    // eslint-disable-next-line guard-for-in
+    for (const _entry in in_object) {
         return false;
     }
     return true;