npm - @fluid-experimental/property-changeset - Versions diffs - 2.0.2 → 2.1.0-276326 - Mend

@fluid-experimental/property-changeset 2.0.2 → 2.1.0-276326

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (35) hide show

package/dist/changeset.js +11 -11
package/dist/changeset.js.map +1 -1
package/dist/changeset_operations/array.js +7 -7
package/dist/changeset_operations/array.js.map +1 -1
package/dist/changeset_operations/indexedCollection.js +4 -4
package/dist/changeset_operations/indexedCollection.js.map +1 -1
package/dist/rebase.js +6 -6
package/dist/rebase.js.map +1 -1
package/dist/templateValidator.js +2 -2
package/dist/templateValidator.js.map +1 -1
package/dist/test/array.spec.js +15 -15
package/dist/test/array.spec.js.map +1 -1
package/dist/test/reversibleCs.spec.js +6 -3
package/dist/test/reversibleCs.spec.js.map +1 -1
package/dist/test/tsconfig.cjs.tsbuildinfo +1 -1
package/dist/utils.js +9 -9
package/dist/utils.js.map +1 -1
package/lib/changeset.js +1 -1
package/lib/changeset.js.map +1 -1
package/lib/changeset_operations/array.js +1 -1
package/lib/changeset_operations/array.js.map +1 -1
package/lib/changeset_operations/indexedCollection.js +1 -1
package/lib/changeset_operations/indexedCollection.js.map +1 -1
package/lib/rebase.js +1 -1
package/lib/rebase.js.map +1 -1
package/lib/templateValidator.js +1 -1
package/lib/templateValidator.js.map +1 -1
package/lib/test/array.spec.js +1 -1
package/lib/test/array.spec.js.map +1 -1
package/lib/test/reversibleCs.spec.js +1 -1
package/lib/test/reversibleCs.spec.js.map +1 -1
package/lib/test/tsconfig.tsbuildinfo +1 -1
package/lib/utils.js +1 -1
package/lib/utils.js.map +1 -1
package/package.json +3 -4

package/dist/changeset_operations/indexedCollection.js CHANGED Viewed

@@ -12,7 +12,7 @@ exports.ChangeSetIndexedCollectionFunctions = void 0;
  * @fileoverview Helper functions and classes to work with ChangeSets with indexed collections (sets and maps)
  */
 const property_common_1 = require("@fluid-experimental/property-common");
-const fastest_json_copy_1 = require("fastest-json-copy");
+const cloneDeep_js_1 = __importDefault(require("lodash/cloneDeep.js"));
 const includes_js_1 = __importDefault(require("lodash/includes.js"));
 const isEmpty_js_1 = __importDefault(require("lodash/isEmpty.js"));
 const isEqual_js_1 = __importDefault(require("lodash/isEqual.js"));
@@ -269,7 +269,7 @@ var ChangeSetIndexedCollectionFunctions;
                             else {
                                 io_basePropertyChanges.modify[typeid] =
                                     io_basePropertyChanges.modify[typeid] || {};
-                                io_basePropertyChanges.modify[typeid][key] = (0, fastest_json_copy_1.copy)(insertedEntries[key]);
+                                io_basePropertyChanges.modify[typeid][key] = (0, cloneDeep_js_1.default)(insertedEntries[key]);
                             }
                         }
                     }
@@ -279,7 +279,7 @@ var ChangeSetIndexedCollectionFunctions;
                     else if (!isPrimitiveTypeid &&
                         (!baseInserted[typeid] || baseInserted[typeid][key] === undefined)) {
                         baseInserted[typeid] = baseInserted[typeid] || {};
-                        baseInserted[typeid][key] = (0, fastest_json_copy_1.copy)(insertedEntries[key]);
+                        baseInserted[typeid][key] = (0, cloneDeep_js_1.default)(insertedEntries[key]);
                     }
                     else {
                         throw new Error(MSG.ALREADY_EXISTING_ENTRY + key);
@@ -373,7 +373,7 @@ var ChangeSetIndexedCollectionFunctions;
                         }
                         else {
                             baseModified[typeid] = baseModified[typeid] || {};
-                            baseModified[typeid][key] = (0, fastest_json_copy_1.copy)(modifiedEntries[typeid][key]);
+                            baseModified[typeid][key] = (0, cloneDeep_js_1.default)(modifiedEntries[typeid][key]);
                         }
                     }
                 }

package/dist/changeset_operations/indexedCollection.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"indexedCollection.js","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH;;GAEG;AAEH,yEAA2E;AAC3E,yDAAsD;AACtD,qEAA0C;AAC1C,mEAAwC;AACxC,mEAAwC;AACxC,qEAA0C;AAC1C,mEAAwC;AAIxC,gEAA0D;AAC1D,oDAA8C;AAE9C,2EAA2D;AAC3D,+DAAyD;AAEzD,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAEnD;;;;GAIG;AAEH;;;;;;;;;GASG;AACH,MAAM,kBAAkB,GAAG,UAAU,SAAc;IAClD,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAA,qBAAQ,EAAC,SAAS,CAAC,EAAE,CAAC;QACpE,OAAO,IAAA,oBAAO,EAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC,CAAC;AAEF,2DAA2D;AAC3D,IAAiB,mCAAmC,CA80BnD;AA90BD,WAAiB,mCAAmC;IACnD;;;;;;;;;;;;;OAaG;IACU,iFAA6C,GAAG,UAC5D,sBAA2C,EAC3C,yBAA8C,EAC9C,SAAiB,EACjB,UAAiC;QAEjC,MAAM,iBAAiB,GAAG,8BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,0EAA0E;YAC1E,IAAI,cAAc,GAAG,yBAAyB,CAAC,MAAM,CAAC;YAEtD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM;gBAC5B,sBAAsB,CAAC,MAAM;oBAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACvD,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC;YAChD,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,IAAI,GAAG,KAAK,CAAC;YAEjB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;gBACpC,IAAI,iBAAiB,EAAE,CAAC;oBACvB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAC9C,CAAC;qBAAM,CAAC;oBACP,qDAAqD;oBACrD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC7C,IACC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAC1D,CAAC;gCACF,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAErD,+DAA+D;gCAC/D,6CAA6C;gCAC7C,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oCAC5D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gCACtC,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IACC,YAAY;oCACZ,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAC1D,CAAC;oCACF,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oCAErD,+DAA+D;oCAC/D,6CAA6C;oCAC7C,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wCAC5D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;oCACtC,CAAC;gCACF,CAAC;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;oCAChC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAClC,CAAC;qCAAM,CAAC;oCACP,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wCACnC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oCACnC,CAAC;oCACD,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;wCAC3C,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAClD,CAAC;4BACF,CAAC;wBACF,CAAC;oBACF,CAAC;oBACD,IAAI,GAAG,IAAI,CAAC;gBACb,CAAC;YACF,CAAC;YAED,IAAI,CAAC,IAAI,EAAE,CAAC;gBACX,IAAI,iBAAiB,EAAE,CAAC;oBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChD,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;wBAC1B,CAAC;6BAAM,CAAC;4BACP,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;gCACrD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;4BAC1B,CAAC;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;gCAChC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACvB,CAAC;iCAAM,CAAC;gCACP,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BAC1D,CAAC;wBACF,CAAC;oBACF,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,MAAM,mBAAmB,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChD,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAC5B,IAAI,aAAa,CAAC;wBAElB,mFAAmF;wBACnF,uBAAuB;wBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACrD,IACC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtD,CAAC;gCACF,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;4BACP,CAAC;wBACF,CAAC;wBAED,IAAI,aAAa,EAAE,CAAC;4BACnB,uFAAuF;4BACvF,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;4BAExC,+DAA+D;4BAC/D,yDAAyD;4BACzD,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;gCAC1D,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;4BACpC,CAAC;4BACD,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;gCAC1D,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;4BACpC,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,sEAAsE;4BACtE,MAAM,mBAAmB,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC;4BAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gCACrD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oCAC/C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;gCACP,CAAC;4BACF,CAAC;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACvB,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,4EAA4E;YAC5E,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACpE,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC;YAEhD,8BAA8B;YAE9B,gFAAgF;YAChF,MAAM,eAAe,GAAG,iBAAiB;gBACxC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACb,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,eAAe,GAAG,iBAAiB;oBACxC,CAAC,CAAC,yBAAyB,CAAC,MAAM;oBAClC,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,IAAI,SAAS,CAAC;gBACd,IAAI,WAAW,EAAE,CAAC;oBACjB,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBACnE,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,IAAI,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;oBAC1B,IAAI,aAAa,GAAG,KAAK,CAAC;oBAE1B,0FAA0F;oBAC1F,kDAAkD;oBAClD,uGAAuG;oBACvG,kGAAkG;oBAClG,sDAAsD;oBACtD,IACC,CAAC,iBAAiB;wBAClB,SAAS;wBACT,IAAA,qBAAQ,EAAC,SAAS,CAAC;wBACnB,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,EAC3B,CAAC;wBACF,uFAAuF;wBACvF,wEAAwE;wBACxE,aAAa,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;wBAE1E,wFAAwF;wBACxF,IAAI,aAAa,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;4BAClD,aAAa,GAAG,IAAA,oBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;wBAC7E,CAAC;wBAED,8EAA8E;wBAC9E,MAAM,aAAa,GAAG,IAAA,qBAAQ,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC;4BACnD,CAAC,CAAC,IAAA,oBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACzC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;wBACxB,MAAM,YAAY,GAAG,IAAA,qBAAQ,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC;4BAC5C,CAAC,CAAC,IAAA,oBAAO,EAAC,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACnC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBAClB,aAAa,GAAG,aAAa,IAAI,IAAA,oBAAO,EAAC,aAAa,EAAE,YAAY,CAAC,CAAC;oBACvE,CAAC;oBAED,IACC,CAAC,iBAAiB,IAAI,8BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC;wBAC5E,SAAS;wBACT,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,IAAA,qBAAQ,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;4BACxD,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAC7B,CAAC;wBACF,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC9B,IAAI,iBAAiB,EAAE,CAAC;gCACvB,sBAAsB,CAAC,MAAM,GAAG,IAAA,oBAAO,EAAC,sBAAsB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;4BAC7E,CAAC;iCAAM,CAAC;gCACP,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAA,oBAAO,EAC9C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EACrC,GAAG,CACH,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,eAAe,GAAG,aAAa,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC3E,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;wBACvB,CAAC;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE,CAAC;4BACtB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE,CAAC;gCACvB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC3D,CAAC;iCAAM,CAAC;gCACP,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC;oCACpC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gCAC7C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,wBAAS,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC9E,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;wBACjE,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;oBAC1C,CAAC;yBAAM,IACN,CAAC,iBAAiB;wBAClB,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EACjE,CAAC;wBACF,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,wBAAS,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7D,CAAC;yBAAM,CAAC;wBACP,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;oBACnD,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,4EAA4E;YAC5E,MAAM,eAAe,GAAG,yBAAyB,CAAC,MAAM,CAAC;YACzD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACpE,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YAEvD,4BAA4B;YAE5B,gFAAgF;YAChF,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YACvF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEhC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAC7B,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAC7D,CAAC;gBACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE,CAAC;wBACvB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BAClD,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;wBAC3B,CAAC;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;wBAC9B,CAAC;6BAAM,CAAC;4BACP,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;gCACpE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;4BACpC,CAAC;iCAAM,CAAC;gCACP,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;4BAC9B,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,iFAAiF;wBACjF,kBAAkB;wBAClB,MAAM,oBAAoB,GAAG,8BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBAElE,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gCACjD,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;oCAClD,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;gCAC/C,CAAC;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;oCAC/C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gCAC7B,CAAC;gCAED,IACC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;oCACzB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAChD,CAAC;oCACF,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;gCAC5C,CAAC;qCAAM,CAAC;oCACP,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;gCACtC,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CACV,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BAC5E,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gCACjD,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;oCAC/C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;wCACtD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;oCAC/B,CAAC;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gCAChD,CAAC;qCAAM,CAAC;oCACP,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC1D,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CACV,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;4BAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,wBAAS,EAAC,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBACrE,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,sBAAsB,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACnF,CAAC,CAAC;IAEF;;;;;;;;;;;;;;;OAeG;IACU,gFAA4C,GAAG,UAC3D,uBAA4C,EAC5C,0BAA+C,EAC/C,WAAmB,EACnB,SAAiB,EACjB,0BAAmC,EACnC,aAA6B,EAC7B,UAAiC;QAEjC,MAAM,iBAAiB,GAAG,8BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,wFAAwF;QACxF,sEAAsE;QACtE,MAAM,UAAU,GAAG,UAClB,aAAkC,EAClC,mBAA2B,EAC3B,eAAuB,EACvB,eAAwB;YAExB,4CAA4C;YAC5C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,OAAO;YACR,CAAC;YAED,sGAAsG;YACtG,iCAAiC;YACjC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAEvF,uCAAuC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEpB,+BAA+B;gBAC/B,aAAa,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC9C,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC;oBACxE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,mBAAmB,EAAE;oBACjE,CAAC,CAAC,mBAAmB,CAAC;gBAEvB,+CAA+C;gBAC/C,IAAI,eAAe,EAAE,CAAC;oBACrB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;gBAClE,CAAC;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE,CAAC;oBACjC,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;gBACrF,CAAC;YACF,CAAC;QACF,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAC7B,aAAa,EACb,mBAAmB,EACnB,eAAe;YAEf,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,OAAO;YACR,CAAC;YACD,iEAAiE;YACjE,MAAM,eAAe,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;YACjF,CAAC;QACF,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;aAAM,CAAC;YACP,IAAI,iBAAiB,EAAE,CAAC;gBACvB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,CAAC;iBAAM,CAAC;gBACP,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACxE,CAAC;QACF,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACP,IAAI,iBAAiB,EAAE,CAAC;gBACvB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACP,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC7E,CAAC;QACF,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACvB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5D,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5D,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YACjE,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACP,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvE,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvE,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5E,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC7E,CAAC;QAED,sDAAsD;QACtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,0BAA0B;gBACzC,CAAC,CAAC,GAAG,WAAW,IAAI,0BAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG;gBAC/D,CAAC,CAAC,IAAA,2BAAS,EACT,WAAW,EACX,0BAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,EACxC,uBAAuB,CACvB,CAAC;YAEJ,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;gBAC5C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+Bc;gBAEd,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBACtE,IACC,iBAAiB;wBACjB,CAAC,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC;4BACpD,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EACpC,CAAC;wBACF,kFAAkF;wBAClF,iFAAiF;wBACjF,mCAAmC;wBACnC,IAAI,SAAS,GAAG,uBAAuB,CAAC,MAAM,CAAC;wBAC/C,IAAI,aAAa,GAAG,0BAA0B,CAAC,MAAM,CAAC;wBACtD,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;4BAC9B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;wBACzD,CAAC;wBAED,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAC7B,yCAAyC;wBACzC,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;wBAC9B,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BACtE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;wBAC3B,CAAC;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BAC5E,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;wBACjC,CAAC;wBACD,IACC,YAAY,CAAC,SAAS,KAAK,OAAO;4BAClC,YAAY,CAAC,SAAS,KAAK,QAAQ;4BACnC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACpB,CAAC;4BACF,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gCACtE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;4BAC3B,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;gCAC9B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;4BAC3B,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,IAAI,CAAC,yCAAyC,CAC7C,GAAG,EACH,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,EACtD,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAC3D,YAAY,CAAC,SAAS,EACtB,OAAO,EACP,IAAI,EACJ,aAAa,EACb,UAAU,CACV,CAAC;oBACH,CAAC;gBACF,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC7E,SAAS,GAAG,YAAY,CAAC,WAAW;wBACnC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;wBAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;oBAErC,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,2BAA2B;wBAC9C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACjC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBACpF,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACxB,2FAA2F;wBAC3F,2FAA2F;wBAC3F,sFAAsF;wBACtF,yBAAyB;wBAEzB,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,sCAAsC;4BACzD,iBAAiB,EAChB,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC;yBACjE,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;oBACzE,CAAC;gBACF,CAAC;qBAAM,IACN,CAAC,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC;oBAChE,CAAC,YAAY,CAAC,KAAK,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,CAAC,EAC1E,CAAC;oBACF,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;wBACnC,SAAS,GAAG,YAAY,CAAC,SAAS;4BACjC,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC;4BACxD,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC;wBAElC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,mBAAmB;4BACtC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC9B,CAAC;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;wBACnC,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;4BACtD,0BAA0B,CAAC,MAAM,GAAG,IAAA,oBAAO,EAC1C,0BAA0B,CAAC,MAAM,EACjC,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,IAAI,iBAAiB,EAAE,CAAC;gCACvB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BAC/C,CAAC;iCAAM,CAAC;gCACP,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;4BACzE,CAAC;wBACF,CAAC;oBACF,CAAC;gBACF,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC7E,IAAI,iBAAiB,IAAI,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC/E,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;4BACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;4BAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;wBAErC,+EAA+E;wBAC/E,iFAAiF;wBACjF,0CAA0C;wBAC1C,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,oBAAoB;wBACpB,IAAI,QAAQ,CAAC;wBACb,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;4BAC9B,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;gCAC1D,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;4BACnE,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BACxE,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;wBACxE,CAAC;6BAAM,CAAC;4BACP,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBAChD,CAAC;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;yBAAM,CAAC;wBACP,8FAA8F;wBAC9F,kGAAkG;wBAElG,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;4BACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;4BAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;wBAErC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,4BAA4B;4BAC/C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,eAAe,EACrC,CAAC;oBACF,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;wBACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;wBAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;oBAErC,4CAA4C;oBAC5C,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,aAAa;wBAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACjC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACP,kGAAkG;oBAClG,qBAAqB;oBAErB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,sBAAsB;wBACzC,iBAAiB,EAAE,YAAY,CAAC,MAAM;qBACtC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,uCAAuC;oBACvC,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;wBACrC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;4BAC5C,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,CAC9E,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC5D,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;4BACnE,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAA,oBAAO,EACvD,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAC9C,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC5D,CAAC;oBACF,CAAC;oBAED,OAAO,CAAC,KAAK,CACZ,yEAAyE,CACzE,CAAC;gBACH,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,0BAA0B,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACvF,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,oEAAgC,GAAG,UAC/C,kBAAuC,EACvC,kBAA2B;QAE3B,MAAM,OAAO,GAAG,kBAAkB,CAAC;QACnC,gBAAgB;QAEhB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,IAAI,IAAA,sCAAgB,EAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChC,CAAC;gBACF,CAAC;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;IACF,CAAC,CAAC;AACH,CAAC,EA90BgB,mCAAmC,mDAAnC,mCAAmC,QA80BnD","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/\n @fileoverview Helper functions and classes to work with ChangeSets with indexed collections (sets and maps)\n /\n\nimport { constants, joinPaths } from \"@fluid-experimental/property-common\";\nimport { copy as cloneDeep } from \"fastest-json-copy\";\nimport includes from \"lodash/includes.js\";\nimport isEmpty from \"lodash/isEmpty.js\";\nimport isEqual from \"lodash/isEqual.js\";\nimport isObject from \"lodash/isObject.js\";\nimport without from \"lodash/without.js\";\n\n// @ts-ignore\nimport { ApplyChangeSetOptions, ConflictInfo, SerializedChangeSet } from \"../changeset.js\";\nimport { TypeIdHelper } from \"../helpers/typeidHelper.js\";\nimport { PathHelper } from \"../pathHelper.js\";\n\nimport { ConflictType } from \"./changesetConflictTypes.js\";\nimport { isEmptyChangeSet } from \"./isEmptyChangeset.js\";\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\n/\n @namespace property-changeset.ChangeSetOperations.IndexedCollectionOperations\n * @alias property-changeset.ChangeSetOperations.IndexedCollectionOperations\n * Helper functions and classes to perform operations on ChangeSets with indexed collections (sets and maps)\n /\n\n/\n Checks whether an object is empty (has no keys)\n * This function should be a bit faster than the isEmpty from\n * underscore. Unfortunately, at least on Chrome, it is still in\n * O(n)\n \n @param in_object - The object to check\n * @returns Is it empty?\n * @private\n /\nconst _fastIsEmptyObject = function (in_object: any): boolean {\n\tif (!in_object \|\| Array.isArray(in_object) \|\| !isObject(in_object)) {\n\t\treturn isEmpty(in_object);\n\t}\n\n\t// eslint-disable-next-line guard-for-in, no-restricted-syntax\n\tfor (const _entry in in_object) {\n\t\treturn false;\n\t}\n\n\treturn true;\n};\n\n// eslint-disable-next-line @typescript-eslint/no-namespace\nexport namespace ChangeSetIndexedCollectionFunctions {\n\t/\n\t Applies a ChangeSet to a given indexed collection property (recursively). The ChangeSet is assumed to be relative\n\t * to the same property root and it will be applied behind the base ChangeSet (assuming that the changes are\n\t * relative to the state after the base ChangeSet has been applied. It will change the base ChangeSet.\n\t \n\t @param io_basePropertyChanges - The ChangeSet describing the initial state\n\t * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n\t * @param in_typeid - The typeid of the contents collection (without the collection type).\n\t * @param in_options - Optional additional parameters\n\t * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n\t * more compact changeset during the apply operation.\n\t \n\t @private\n\t /\n\texport const _performApplyAfterOnPropertyIndexedCollection = function (\n\t\tio_basePropertyChanges: SerializedChangeSet,\n\t\tin_appliedPropertyChanges: SerializedChangeSet,\n\t\tin_typeid: string,\n\t\tin_options: ApplyChangeSetOptions,\n\t) {\n\t\tconst isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n\t\t// Handle remove entry operations\n\t\tif (in_appliedPropertyChanges.remove) {\n\t\t\t// Get and initialize the corresponding entries in the existing collection\n\t\t\tlet removedEntries = in_appliedPropertyChanges.remove;\n\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.remove =\n\t\t\t\tio_basePropertyChanges.remove \|\|\n\t\t\t\t(Array.isArray(in_appliedPropertyChanges.remove) ? [] : {});\n\t\t\tlet baseInserted = io_basePropertyChanges.insert \|\| {};\n\t\t\tlet baseRemoved = io_basePropertyChanges.remove;\n\t\t\tlet baseModified = io_basePropertyChanges.modify;\n\t\t\tlet done = false;\n\n\t\t\tif (!Array.isArray(removedEntries)) {\n\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\tremovedEntries = Object.keys(removedEntries);\n\t\t\t\t} else {\n\t\t\t\t\t// this is a reversible change set of templated types\n\t\t\t\t\tconst removedTypes = Object.keys(removedEntries);\n\t\t\t\t\tfor (let t = 0; t < removedTypes.length; t++) {\n\t\t\t\t\t\tconst removedKeys = Object.keys(removedEntries[removedTypes[t]]);\n\t\t\t\t\t\tfor (let i = 0; i < removedKeys.length; i++) {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tbaseInserted[removedTypes[t]] &&\n\t\t\t\t\t\t\t\tbaseInserted[removedTypes[t]][removedKeys[i]] !== undefined\n\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\tdelete baseInserted[removedTypes[t]][removedKeys[i]];\n\n\t\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t\t// the whole typeid from the inserted section\n\t\t\t\t\t\t\t\tif (baseInserted && isEmpty(baseInserted[removedTypes[t]])) {\n\t\t\t\t\t\t\t\t\tdelete baseInserted[removedTypes[t]];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t\tbaseModified &&\n\t\t\t\t\t\t\t\t\tbaseModified[removedTypes[t]] &&\n\t\t\t\t\t\t\t\t\tbaseModified[removedTypes[t]][removedKeys[i]] !== undefined\n\t\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\t\tdelete baseModified[removedTypes[t]][removedKeys[i]];\n\n\t\t\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t\t\t// the whole typeid from the inserted section\n\t\t\t\t\t\t\t\t\tif (baseModified && isEmpty(baseModified[removedTypes[t]])) {\n\t\t\t\t\t\t\t\t\t\tdelete baseModified[removedTypes[t]];\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (Array.isArray(baseRemoved)) {\n\t\t\t\t\t\t\t\t\tbaseRemoved.push(removedKeys[i]);\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tif (!baseRemoved[removedTypes[t]]) {\n\t\t\t\t\t\t\t\t\t\tbaseRemoved[removedTypes[t]] = {};\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbaseRemoved[removedTypes[t]][removedKeys[i]] =\n\t\t\t\t\t\t\t\t\t\tremovedEntries[removedTypes[t]][removedKeys[i]];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!done) {\n\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\tfor (let i = 0; i < removedEntries.length; i++) {\n\t\t\t\t\t\tlet key = removedEntries[i];\n\n\t\t\t\t\t\t// If there is an insert for this key, we just remove it\n\t\t\t\t\t\tif (baseInserted[key] !== undefined) {\n\t\t\t\t\t\t\tdelete baseInserted[key];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// There could be a modify entry for this key, which we have to remove\n\t\t\t\t\t\t\tif (baseModified && baseModified[key] !== undefined) {\n\t\t\t\t\t\t\t\tdelete baseModified[key];\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Otherwise we add it to the remove list\n\t\t\t\t\t\t\tif (Array.isArray(baseRemoved)) {\n\t\t\t\t\t\t\t\tbaseRemoved.push(key);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbaseRemoved[key] = in_appliedPropertyChanges.remove[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tconst baseInsertedTypeids = Object.keys(baseInserted);\n\t\t\t\t\tfor (let i = 0; i < removedEntries.length; i++) {\n\t\t\t\t\t\tlet key = removedEntries[i];\n\t\t\t\t\t\tlet foundInTypeid;\n\n\t\t\t\t\t\t// Since we only have a flat remove list (without typeid) in the changeset, we have\n\t\t\t\t\t\t// to check all inserts\n\t\t\t\t\t\tfor (let j = 0; j < baseInsertedTypeids.length; j++) {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tbaseInserted[baseInsertedTypeids[j]] &&\n\t\t\t\t\t\t\t\tbaseInserted[baseInsertedTypeids[j]][key] !== undefined\n\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\tfoundInTypeid = baseInsertedTypeids[j];\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (foundInTypeid) {\n\t\t\t\t\t\t\t// If this key was inserted by this ChangeSet, we just remove it from the inserted list\n\t\t\t\t\t\t\tdelete baseInserted[foundInTypeid][key];\n\n\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t// the whole typeid from the inserted or modified section\n\t\t\t\t\t\t\tif (baseInserted && isEmpty(baseInserted[foundInTypeid])) {\n\t\t\t\t\t\t\t\tdelete baseInserted[foundInTypeid];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (baseModified && isEmpty(baseModified[foundInTypeid])) {\n\t\t\t\t\t\t\t\tdelete baseModified[foundInTypeid];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// There could be a modify entry for this key, which we have to remove\n\t\t\t\t\t\t\tconst baseModifiedTypeids = Object.keys(baseModified \|\| {});\n\t\t\t\t\t\t\tfor (let j = 0; j < baseModifiedTypeids.length; j++) {\n\t\t\t\t\t\t\t\tif (baseModified[baseModifiedTypeids[j]][key]) {\n\t\t\t\t\t\t\t\t\tfoundInTypeid = baseModifiedTypeids[j];\n\t\t\t\t\t\t\t\t\tdelete baseModified[foundInTypeid][key];\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Otherwise we add it to the remove list\n\t\t\t\t\t\t\tbaseRemoved.push(key);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Apply insert operations\n\t\tif (in_appliedPropertyChanges.insert) {\n\t\t\t// Get and initialize the corresponding entries from the existing collection\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.insert = io_basePropertyChanges.insert \|\| {};\n\t\t\tlet baseInserted = io_basePropertyChanges.insert;\n\t\t\tlet baseRemoved = io_basePropertyChanges.remove;\n\n\t\t\t// Insert the inserted entries\n\n\t\t\t// If no typeids are included, we just use a placeholder for the iteration below\n\t\t\tconst insertedTypeids = isPrimitiveTypeid\n\t\t\t\t? [undefined]\n\t\t\t\t: Object.keys(in_appliedPropertyChanges.insert);\n\t\t\tfor (let i = 0; i < insertedTypeids.length; i++) {\n\t\t\t\tlet typeid = insertedTypeids[i];\n\t\t\t\tconst insertedEntries = isPrimitiveTypeid\n\t\t\t\t\t? in_appliedPropertyChanges.insert\n\t\t\t\t\t: in_appliedPropertyChanges.insert[typeid];\n\t\t\t\tconst insertedKeys = Object.keys(insertedEntries);\n\t\t\t\tlet removalCS;\n\t\t\t\tif (baseRemoved) {\n\t\t\t\t\tremovalCS = isPrimitiveTypeid ? baseRemoved : baseRemoved[typeid];\n\t\t\t\t}\n\t\t\t\tfor (let j = 0; j < insertedKeys.length; j++) {\n\t\t\t\t\tlet key = insertedKeys[j];\n\t\t\t\t\tlet deeplyEqualCS = false;\n\n\t\t\t\t\t// If we have a complex type in the collection, we need to do a deep comparison of the two\n\t\t\t\t\t// ChangeSets to determine, whether they are equal\n\t\t\t\t\t// TODO: We should actually compute a diff between the two and recursively convert portions to modifies\n\t\t\t\t\t// Instead, right now, we only handle the case where the two keys cancel each out perfectly, i.e.,\n\t\t\t\t\t// the insert is reinserting exactly what was removed.\n\t\t\t\t\tif (\n\t\t\t\t\t\t!isPrimitiveTypeid &&\n\t\t\t\t\t\tremovalCS &&\n\t\t\t\t\t\tisObject(removalCS) &&\n\t\t\t\t\t\tremovalCS[key] !== undefined\n\t\t\t\t\t) {\n\t\t\t\t\t\t// Split out the two parts: all the keys other than remove/insert should match exactly.\n\t\t\t\t\t\t// The contents 'remove' and 'insert', if they exist, should also match.\n\t\t\t\t\t\tdeeplyEqualCS = !!insertedEntries[key].insert === !!removalCS[key].remove;\n\n\t\t\t\t\t\t// If there are 'insert' and 'remove', see if the removed data matches the inserted data\n\t\t\t\t\t\tif (deeplyEqualCS && insertedEntries[key].insert) {\n\t\t\t\t\t\t\tdeeplyEqualCS = isEqual(insertedEntries[key].insert, removalCS[key].remove);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Finally, check if the data being inserted matches the data that was removed\n\t\t\t\t\t\tconst insertedEntry = isObject(insertedEntries[key])\n\t\t\t\t\t\t\t? without(insertedEntries[key], \"insert\")\n\t\t\t\t\t\t\t: insertedEntries[key];\n\t\t\t\t\t\tconst removedEntry = isObject(removalCS[key])\n\t\t\t\t\t\t\t? without(removalCS[key], \"remove\")\n\t\t\t\t\t\t\t: removalCS[key];\n\t\t\t\t\t\tdeeplyEqualCS = deeplyEqualCS && isEqual(insertedEntry, removedEntry);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (\n\t\t\t\t\t\t(isPrimitiveTypeid \|\| TypeIdHelper.isPrimitiveType(typeid) \|\| deeplyEqualCS) &&\n\t\t\t\t\t\tremovalCS &&\n\t\t\t\t\t\t((Array.isArray(removalCS) && includes(baseRemoved, key)) \|\|\n\t\t\t\t\t\t\tremovalCS[key] !== undefined)\n\t\t\t\t\t) {\n\t\t\t\t\t\t// A remove and insert are combined into a modify for primitive types\n\n\t\t\t\t\t\t// Remove the old remove command\n\t\t\t\t\t\tlet oldValueMatches = false;\n\t\t\t\t\t\tif (Array.isArray(removalCS)) {\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.remove = without(io_basePropertyChanges.remove, key);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.remove[typeid] = without(\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.remove[typeid],\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\toldValueMatches = deeplyEqualCS \|\| removalCS[key] === insertedEntries[key];\n\t\t\t\t\t\t\tdelete removalCS[key];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Insert a modify command instead\n\t\t\t\t\t\tif (!oldValueMatches) {\n\t\t\t\t\t\t\tio_basePropertyChanges.modify = io_basePropertyChanges.modify \|\| {};\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[key] = insertedEntries[key];\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid] =\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid] \|\| {};\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid][key] = cloneDeep(insertedEntries[key]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (isPrimitiveTypeid && baseInserted[key] === undefined) {\n\t\t\t\t\t\tbaseInserted[key] = insertedEntries[key];\n\t\t\t\t\t} else if (\n\t\t\t\t\t\t!isPrimitiveTypeid &&\n\t\t\t\t\t\t(!baseInserted[typeid] \|\| baseInserted[typeid][key] === undefined)\n\t\t\t\t\t) {\n\t\t\t\t\t\tbaseInserted[typeid] = baseInserted[typeid] \|\| {};\n\t\t\t\t\t\tbaseInserted[typeid][key] = cloneDeep(insertedEntries[key]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new Error(MSG.ALREADY_EXISTING_ENTRY + key);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Handle modification operations\n\t\tif (in_appliedPropertyChanges.modify) {\n\t\t\t// Get and initialize the corresponding entries from the existing collection\n\t\t\tconst modifiedEntries = in_appliedPropertyChanges.modify;\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.modify = io_basePropertyChanges.modify \|\| {};\n\t\t\tlet baseModified = io_basePropertyChanges.modify;\n\t\t\tlet baseInserted = io_basePropertyChanges.insert \|\| {};\n\n\t\t\t// Process the modifications\n\n\t\t\t// If no typeids are included, we just use a placeholder for the iteration below\n\t\t\tconst modifiedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(modifiedEntries);\n\t\t\tfor (let i = 0; i < modifiedTypeids.length; i++) {\n\t\t\t\tlet typeid = modifiedTypeids[i];\n\n\t\t\t\tconst modifyKeys = Object.keys(\n\t\t\t\t\tisPrimitiveTypeid ? modifiedEntries : modifiedEntries[typeid],\n\t\t\t\t);\n\t\t\t\tfor (let j = 0; j < modifyKeys.length; j++) {\n\t\t\t\t\tlet key = modifyKeys[j];\n\n\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\tlet newValue = modifiedEntries[key];\n\t\t\t\t\t\tif (newValue && newValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\tnewValue = newValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (baseInserted[key] !== undefined) {\n\t\t\t\t\t\t\t// If this entry was added by this ChangeSet, we modify the insert operation according to the\n\t\t\t\t\t\t\t// new ChangeSet\n\t\t\t\t\t\t\tbaseInserted[key] = newValue;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (baseModified[key] && baseModified[key].hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\tbaseModified[key].value = newValue;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbaseModified[key] = newValue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// If this is a polymorphic collection, we can still have individual entries with\n\t\t\t\t\t\t// primitive types\n\t\t\t\t\t\tconst isEntryPrimitiveType = TypeIdHelper.isPrimitiveType(typeid);\n\n\t\t\t\t\t\tif (baseInserted[typeid] && baseInserted[typeid][key] !== undefined) {\n\t\t\t\t\t\t\t// If this entry was added by this ChangeSet, we modify the insert operation according to the\n\t\t\t\t\t\t\t// new ChangeSet\n\t\t\t\t\t\t\tif (isEntryPrimitiveType && typeid !== \"String\") {\n\t\t\t\t\t\t\t\tlet newValue = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\tif (newValue && newValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\t\tnewValue = modifiedEntries[typeid][key].value;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t// In the case of Int64 or Uint64 we copy the array so that\n\t\t\t\t\t\t\t\t// both ChangeSets don't point to the same instance\n\t\t\t\t\t\t\t\tif (typeid === \"Int64\" \|\| typeid === \"Uint64\") {\n\t\t\t\t\t\t\t\t\tnewValue = newValue.slice();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key] &&\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key].hasOwnProperty(\"value\")\n\t\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key].value = newValue;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key] = newValue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthis.performApplyAfterOnPropertyWithTypeid(\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid],\n\t\t\t\t\t\t\t\t\tmodifiedEntries[typeid],\n\t\t\t\t\t\t\t\t\ttypeid,\n\t\t\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if (baseModified[typeid] && baseModified[typeid][key] !== undefined) {\n\t\t\t\t\t\t\t// If there was a previous modification operation, we have to merge the two\n\t\t\t\t\t\t\tif (isEntryPrimitiveType && typeid !== \"String\") {\n\t\t\t\t\t\t\t\t// Primitive types can simply be overwritten, however we have an exception for\n\t\t\t\t\t\t\t\t// 64 bit integers (until javascript natively supports them)\n\t\t\t\t\t\t\t\tif (typeid === \"Int64\" \|\| typeid === \"Uint64\") {\n\t\t\t\t\t\t\t\t\tlet appliedVal = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\t\tif (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\t\t\tappliedVal = appliedVal.value;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbaseModified[typeid][key] = appliedVal.slice();\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbaseModified[typeid][key] = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthis.performApplyAfterOnPropertyWithTypeid(\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t\tbaseModified[typeid],\n\t\t\t\t\t\t\t\t\tmodifiedEntries[typeid],\n\t\t\t\t\t\t\t\t\ttypeid,\n\t\t\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tbaseModified[typeid] = baseModified[typeid] \|\| {};\n\t\t\t\t\t\t\tbaseModified[typeid][key] = cloneDeep(modifiedEntries[typeid][key]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove unnecessary entries from the ChangeSet\n\t\tthis._cleanIndexedCollectionChangeSet(io_basePropertyChanges, !isPrimitiveTypeid);\n\t};\n\n\t/\n\t Performs the rebase operation for set and map collections.\n\t \n\t @param in_ownPropertyChangeSet - The ChangeSet for this collection.\n\t * @param io_rebasePropertyChangeSet - The ChangeSet for the collection to be rebased.\n\t * @param in_basePath - Base path to get to the property processed by this function.\n\t * @param in_typeid - The typeid of the contents collection (without the collection type).\n\t * @param in_useSquareBracketsInPath - If set to true, paths will be created using the angular brackets syntax (for\n\t * arrays), otherwise dots will be used (for NodeProperties).\n\t * @param out_conflicts - A list of paths that resulted in conflicts together with the type of the conflict.\n\t * @param in_options - Optional additional parameters.\n\t * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n\t * more compact changeset during the apply operation.\n\t \n\t @private\n\t /\n\texport const _rebaseIndexedCollectionChangeSetForProperty = function (\n\t\tin_ownPropertyChangeSet: SerializedChangeSet,\n\t\tio_rebasePropertyChangeSet: SerializedChangeSet,\n\t\tin_basePath: string,\n\t\tin_typeid: string,\n\t\tin_useSquareBracketsInPath: boolean,\n\t\tout_conflicts: ConflictInfo[],\n\t\tin_options: ApplyChangeSetOptions,\n\t) {\n\t\tconst isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n\t\tconst changesByKeys = {};\n\t\tlet modifyMap = {};\n\t\t// Helper function which stores the changes indexed by key in the changesByKeys array to\n\t\t// make it easier to compare the related changes in the two ChangeSets\n\t\tconst addChanges = function (\n\t\t\tin_collection: Record<string, any>,\n\t\t\tin_changeIdentifier: string,\n\t\t\tin_changePrefix: string,\n\t\t\tin_typeidChange?: string,\n\t\t) {\n\t\t\t// Collection didn't exist in this ChangeSet\n\t\t\tif (in_collection === undefined) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// For remove operations, the ChangeSet is only an array of keys, otherwise it is a map, so we have to\n\t\t\t// distinguish the two cases here\n\t\t\tconst keys = Array.isArray(in_collection) ? in_collection : Object.keys(in_collection);\n\n\t\t\t// Add all entries indexed with the key\n\t\t\tfor (let j = 0; j < keys.length; j++) {\n\t\t\t\tconst key = keys[j];\n\n\t\t\t\t// Store the type of the change\n\t\t\t\tchangesByKeys[key] = changesByKeys[key] \|\| {};\n\t\t\t\tchangesByKeys[key][in_changePrefix] = changesByKeys[key][in_changePrefix]\n\t\t\t\t\t? `${changesByKeys[key][in_changePrefix]}_${in_changeIdentifier}`\n\t\t\t\t\t: in_changeIdentifier;\n\n\t\t\t\t// If applicable store the typeid of the change\n\t\t\t\tif (in_typeidChange) {\n\t\t\t\t\tchangesByKeys[key][`${in_changePrefix}Typeid`] = in_typeidChange;\n\t\t\t\t}\n\n\t\t\t\t// Store the ChangeSet\n\t\t\t\tif (in_changePrefix === \"other\") {\n\t\t\t\t\tchangesByKeys[key].change = Array.isArray(in_collection) ? key : in_collection[key];\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\t// Helper function which adds the Changes for a ChangeSet that is ordered by typeid\n\t\tconst addChangesWithTypeids = function (\n\t\t\tin_collection,\n\t\t\tin_changeIdentifier,\n\t\t\tin_changePrefix,\n\t\t) {\n\t\t\tif (in_collection === undefined) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Iterate over the typeids (or use dummy entry for the iteration\n\t\t\tconst addedKeyTypeids = Object.keys(in_collection);\n\t\t\tfor (let i = 0; i < addedKeyTypeids.length; i++) {\n\t\t\t\tconst Typeid = addedKeyTypeids[i];\n\t\t\t\taddChanges(in_collection[Typeid], in_changeIdentifier, in_changePrefix, Typeid);\n\t\t\t}\n\t\t};\n\n\t\t// Insert all changes from the ChangeSet into the lookup map\n\t\tif (Array.isArray(in_ownPropertyChangeSet.remove)) {\n\t\t\taddChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t} else {\n\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\taddChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t\t} else {\n\t\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t\t}\n\t\t}\n\n\t\tif (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n\t\t\taddChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t} else {\n\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\taddChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t\t} else {\n\t\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t\t}\n\t\t}\n\n\t\tif (isPrimitiveTypeid) {\n\t\t\taddChanges(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n\t\t\taddChanges(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n\t\t\taddChanges(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n\t\t\taddChanges(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n\t\t} else {\n\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n\t\t}\n\n\t\t// Check for modifications that affect the same object\n\t\tconst changedKeys = Object.keys(changesByKeys);\n\t\tfor (let i = 0; i < changedKeys.length; i++) {\n\t\t\tconst key = changedKeys[i];\n\t\t\tconst newPath = in_useSquareBracketsInPath\n\t\t\t\t? `${in_basePath}[${PathHelper.quotePathSegmentIfNeeded(key)}]`\n\t\t\t\t: joinPaths(\n\t\t\t\t\t\tin_basePath,\n\t\t\t\t\t\tPathHelper.quotePathSegmentIfNeeded(key),\n\t\t\t\t\t\tPROPERTY_PATH_DELIMITER,\n\t\t\t\t\t);\n\n\t\t\tconst modification = changesByKeys[key];\n\t\t\tif (modification.own && modification.other) {\n\t\t\t\t/\n We found a key that was changed by both ChangeSets at the same time\n We now have to handle the conflicting changes. The changes we do, are summarized in this table:\n\n <START REBASE HANDLING TABLE>\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \\Own\| insert \| modify \| remove \| remove+insert \|\n \| \\ \| \| \| \| \|\n \|other\\ \| \| \| \| \|\n +=======+=================+==================+===================+=====================================+\n \| \| conflicting \| incompatible \| incompatible \| incompatible \|\n \|insert \| inserts \| psets \| psets \| psets \|\n \| \| \| \| \| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| merge recursively\| conflict \| conflict \|\n \|modify \| psets \| (conflicting on \| \| (modify can not be applied due to \|\n \| \| \| leaf) \| - delete modify \| to incompatible base) \|\n \| \| \| \| in other \| \|\n \| \| \| \| \| - delete modify in other \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| non-conflicting \| non-conflicting \| incompatible \|\n \|remove \| psets \| change \| change \| psets \|\n \| \| \| \| \| \|\n \| \| \| \| - rem dupl. remove\| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| non-conflicting \| non-conflicting \| conflict \|\n \|remove+\| psets \| change \| change \| \|\n \|insert \| \| \| \| - remove conflicting insert \|\n \| \| \| \| - rem dupl. remove\| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n <END REBASE HANDLING TABLE>\n /\n\n\t\t\t\t// A key was modified after it had been removed\n\t\t\t\tif (modification.own === \"modify\" && modification.other === \"modify\") {\n\t\t\t\t\tif (\n\t\t\t\t\t\tisPrimitiveTypeid \|\|\n\t\t\t\t\t\t(TypeIdHelper.isPrimitiveType(modification.ownTypeid) &&\n\t\t\t\t\t\t\tmodification.ownTypeid !== \"String\")\n\t\t\t\t\t) {\n\t\t\t\t\t\t// We have two modification operations that affect the same entry for a base type.\n\t\t\t\t\t\t// This is a legal operation, the second one will overwrite the first one, but we\n\t\t\t\t\t\t// report it as a possible conflict\n\t\t\t\t\t\tlet ownModify = in_ownPropertyChangeSet.modify;\n\t\t\t\t\t\tlet rebasedModify = io_rebasePropertyChangeSet.modify;\n\t\t\t\t\t\tif (modification.otherTypeid) {\n\t\t\t\t\t\t\townModify = ownModify[modification.otherTypeid];\n\t\t\t\t\t\t\trebasedModify = rebasedModify[modification.otherTypeid];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\t\tconflictingChange: ownModify[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t\t\t// If value is the same, delete the entry\n\t\t\t\t\t\tlet ownValue = ownModify[key];\n\t\t\t\t\t\tif (typeof ownValue === \"object\" && ownValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\townValue = ownValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlet rebaseValue = rebasedModify[key];\n\t\t\t\t\t\tif (typeof rebaseValue === \"object\" && rebaseValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\trebaseValue = rebaseValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tmodification.ownTypeid === \"Int64\" \|\|\n\t\t\t\t\t\t\tmodification.ownTypeid === \"Uint64\" \|\|\n\t\t\t\t\t\t\townValue.length === 2\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// For (u)int64, values are arrays of 2 elements\n\t\t\t\t\t\t\tif (ownValue[0] === rebaseValue[0] && ownValue[1] === rebaseValue[1]) {\n\t\t\t\t\t\t\t\tdelete rebasedModify[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (ownValue === rebaseValue) {\n\t\t\t\t\t\t\t\tdelete rebasedModify[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthis.rebaseChangeSetForPropertyEntryWithTypeid(\n\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\tin_ownPropertyChangeSet.modify[modification.ownTypeid],\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid],\n\t\t\t\t\t\t\tmodification.ownTypeid,\n\t\t\t\t\t\t\tnewPath,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tout_conflicts,\n\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t} else if (modification.own === \"remove\" && modification.other === \"modify\") {\n\t\t\t\t\tmodifyMap = modification.otherTypeid\n\t\t\t\t\t\t? io_rebasePropertyChangeSet.modify[modification.otherTypeid]\n\t\t\t\t\t\t: io_rebasePropertyChangeSet.modify;\n\n\t\t\t\t\t// Create the conflict information\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.ENTRY_MODIFIED_AFTER_REMOVE,\n\t\t\t\t\t\tconflictingChange: modifyMap[key],\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\tdelete modifyMap[key];\n\t\t\t\t} else if (modification.own === \"remove_insert\" && modification.other === \"modify\") {\n\t\t\t\t\tif (!isPrimitiveTypeid) {\n\t\t\t\t\t\t// We have a conflicting change. A node was removed and inserted (replaced) in the original\n\t\t\t\t\t\t// ChangeSet and then modified by the rebased ChangeSet. Since the base of the modification\n\t\t\t\t\t\t// can have been changed significantly by this operation, we don't know whether we can\n\t\t\t\t\t\t// apply the modification\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.ENTRY_MODIFICATION_AFTER_REMOVE_INSERT,\n\t\t\t\t\t\t\tconflictingChange:\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid][key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.modify[modification.otherTypeid][key];\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\t(modification.own === \"modify\" \|\| modification.own === \"remove\") &&\n\t\t\t\t\t(modification.other === \"remove\" \|\| modification.other === \"remove_insert\")\n\t\t\t\t) {\n\t\t\t\t\tif (modification.own === \"modify\") {\n\t\t\t\t\t\tmodifyMap = modification.ownTypeid\n\t\t\t\t\t\t\t? in_ownPropertyChangeSet.modify[modification.ownTypeid]\n\t\t\t\t\t\t\t: in_ownPropertyChangeSet.modify;\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.REMOVE_AFTER_MODIFY,\n\t\t\t\t\t\t\tconflictingChange: modifyMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t\t}\n\n\t\t\t\t\t// If we have a duplicated delete, we remove it from the new ChangeSet\n\t\t\t\t\tif (modification.own === \"remove\") {\n\t\t\t\t\t\tif (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.remove = without(\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.remove,\n\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.remove[key];\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.remove[modification.otherTypeid][key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if (modification.own === \"insert\" && modification.other === \"insert\") {\n\t\t\t\t\tif (isPrimitiveTypeid \|\| TypeIdHelper.isPrimitiveType(modification.ownTypeid)) {\n\t\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t\t// We have two insert operations that affect the same key for a primitive type.\n\t\t\t\t\t\t// This is a legal operation, the second one will overwrite the first one, but we\n\t\t\t\t\t\t// report it as a possible conflicting set\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Convert to modify\n\t\t\t\t\t\tlet oldValue;\n\t\t\t\t\t\tif (modification.otherTypeid) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify \|\| {};\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid] =\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid] \|\| {};\n\t\t\t\t\t\t\tmodifyMap = io_rebasePropertyChangeSet.modify[modification.otherTypeid];\n\t\t\t\t\t\t\toldValue = in_ownPropertyChangeSet.insert[modification.ownTypeid][key];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify \|\| {};\n\t\t\t\t\t\t\tmodifyMap = io_rebasePropertyChangeSet.modify;\n\t\t\t\t\t\t\toldValue = in_ownPropertyChangeSet.insert[key];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tmodifyMap[key] = { value: insertMap[key], oldValue };\n\t\t\t\t\t\tdelete insertMap[key];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Here we have two insert operations for objects. Since these affect a whole sub-tree and not\n\t\t\t\t\t\t// just a single value, we cannot easily convert it into a modify and instead report it as invalid\n\n\t\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.INSERTED_ENTRY_WITH_SAME_KEY,\n\t\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\t\tdelete insertMap[key];\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\tmodification.own === \"remove_insert\" &&\n\t\t\t\t\tmodification.other === \"remove_insert\"\n\t\t\t\t) {\n\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t// Raise the duplicate inserts as a conflict\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t} else {\n\t\t\t\t\t// All other operations are conflicting changes, which only occur for ChangeSets that are relative\n\t\t\t\t\t// to different bases\n\n\t\t\t\t\t// Create the conflict information\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.INVALID_CHANGESET_BASE,\n\t\t\t\t\t\tconflictingChange: modification.change,\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t// Remove the change from the ChangeSet\n\t\t\t\t\tif (modification.other !== \"remove\") {\n\t\t\t\t\t\tif (modification.otherTypeid !== undefined) {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][modification.otherTypeid][\n\t\t\t\t\t\t\t\tkey\n\t\t\t\t\t\t\t];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][key];\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Remove remove operations from the ChangeSet\n\t\t\t\t\t\tif (Array.isArray(io_rebasePropertyChangeSet[modification.other])) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet[modification.other] = without(\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet[modification.other],\n\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][key];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tconsole.error(\n\t\t\t\t\t\t\"Rebase operation with conflicting ChangeSets. Probably incorrect bases.\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove unnecessary entries from the ChangeSet\n\t\tthis._cleanIndexedCollectionChangeSet(io_rebasePropertyChangeSet, !isPrimitiveTypeid);\n\t};\n\n\t/\n\t Removes empty entries from the .children collection of the ChangeSet\n\t \n\t @param in_propertyChanges - The ChangeSet to clean up\n\t * @param in_containsTypeids - Does this ChangeSet contain typeids\n\t * @private\n\t */\n\texport const _cleanIndexedCollectionChangeSet = function (\n\t\tin_propertyChanges: SerializedChangeSet,\n\t\tin_containsTypeids: boolean,\n\t) {\n\t\tconst changes = in_propertyChanges;\n\t\t// Clean inserts\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.insert \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tif (_fastIsEmptyObject(changes.insert[typeidList[j]])) {\n\t\t\t\t\tdelete changes.insert[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove add group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.insert)) {\n\t\t\tdelete changes.insert;\n\t\t}\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.remove \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tif (_fastIsEmptyObject(changes.remove[typeidList[j]])) {\n\t\t\t\t\tdelete changes.remove[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Remove remove group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.remove)) {\n\t\t\tdelete changes.remove;\n\t\t}\n\n\t\t// Clean modifies\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.modify \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tconst modifies = changes.modify[typeidList[j]];\n\t\t\t\tconst modifyKeys = Object.keys(modifies);\n\t\t\t\tfor (let k = 0; k < modifyKeys.length; k++) {\n\t\t\t\t\tif (isEmptyChangeSet(modifies[modifyKeys[k]])) {\n\t\t\t\t\t\tdelete modifies[modifyKeys[k]];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (_fastIsEmptyObject(changes.modify[typeidList[j]])) {\n\t\t\t\t\tdelete changes.modify[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove modify group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.modify)) {\n\t\t\tdelete changes.modify;\n\t\t}\n\t};\n}\n"]}
1	+ {"version":3,"file":"indexedCollection.js","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH;;GAEG;AAEH,yEAA2E;AAC3E,uEAA4C;AAC5C,qEAA0C;AAC1C,mEAAwC;AACxC,mEAAwC;AACxC,qEAA0C;AAC1C,mEAAwC;AAIxC,gEAA0D;AAC1D,oDAA8C;AAE9C,2EAA2D;AAC3D,+DAAyD;AAEzD,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAEnD;;;;GAIG;AAEH;;;;;;;;;GASG;AACH,MAAM,kBAAkB,GAAG,UAAU,SAAc;IAClD,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAA,qBAAQ,EAAC,SAAS,CAAC,EAAE,CAAC;QACpE,OAAO,IAAA,oBAAO,EAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;IAED,8DAA8D;IAC9D,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;QAChC,OAAO,KAAK,CAAC;IACd,CAAC;IAED,OAAO,IAAI,CAAC;AACb,CAAC,CAAC;AAEF,2DAA2D;AAC3D,IAAiB,mCAAmC,CA80BnD;AA90BD,WAAiB,mCAAmC;IACnD;;;;;;;;;;;;;OAaG;IACU,iFAA6C,GAAG,UAC5D,sBAA2C,EAC3C,yBAA8C,EAC9C,SAAiB,EACjB,UAAiC;QAEjC,MAAM,iBAAiB,GAAG,8BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,0EAA0E;YAC1E,IAAI,cAAc,GAAG,yBAAyB,CAAC,MAAM,CAAC;YAEtD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM;gBAC5B,sBAAsB,CAAC,MAAM;oBAC7B,CAAC,KAAK,CAAC,OAAO,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACvD,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC;YAChD,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,IAAI,GAAG,KAAK,CAAC;YAEjB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;gBACpC,IAAI,iBAAiB,EAAE,CAAC;oBACvB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAC9C,CAAC;qBAAM,CAAC;oBACP,qDAAqD;oBACrD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;oBACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC9C,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BAC7C,IACC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAC1D,CAAC;gCACF,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAErD,+DAA+D;gCAC/D,6CAA6C;gCAC7C,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oCAC5D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;gCACtC,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IACC,YAAY;oCACZ,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAC1D,CAAC;oCACF,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;oCAErD,+DAA+D;oCAC/D,6CAA6C;oCAC7C,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wCAC5D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;oCACtC,CAAC;gCACF,CAAC;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;oCAChC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAClC,CAAC;qCAAM,CAAC;oCACP,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wCACnC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;oCACnC,CAAC;oCACD,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;wCAC3C,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gCAClD,CAAC;4BACF,CAAC;wBACF,CAAC;oBACF,CAAC;oBACD,IAAI,GAAG,IAAI,CAAC;gBACb,CAAC;YACF,CAAC;YAED,IAAI,CAAC,IAAI,EAAE,CAAC;gBACX,IAAI,iBAAiB,EAAE,CAAC;oBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChD,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;wBAC1B,CAAC;6BAAM,CAAC;4BACP,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;gCACrD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;4BAC1B,CAAC;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;gCAChC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;4BACvB,CAAC;iCAAM,CAAC;gCACP,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BAC1D,CAAC;wBACF,CAAC;oBACF,CAAC;gBACF,CAAC;qBAAM,CAAC;oBACP,MAAM,mBAAmB,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAChD,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAC5B,IAAI,aAAa,CAAC;wBAElB,mFAAmF;wBACnF,uBAAuB;wBACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;4BACrD,IACC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtD,CAAC;gCACF,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;4BACP,CAAC;wBACF,CAAC;wBAED,IAAI,aAAa,EAAE,CAAC;4BACnB,uFAAuF;4BACvF,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;4BAExC,+DAA+D;4BAC/D,yDAAyD;4BACzD,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;gCAC1D,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;4BACpC,CAAC;4BACD,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC;gCAC1D,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;4BACpC,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,sEAAsE;4BACtE,MAAM,mBAAmB,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC;4BAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gCACrD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oCAC/C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;gCACP,CAAC;4BACF,CAAC;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACvB,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,4EAA4E;YAC5E,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACpE,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,WAAW,GAAG,sBAAsB,CAAC,MAAM,CAAC;YAEhD,8BAA8B;YAE9B,gFAAgF;YAChF,MAAM,eAAe,GAAG,iBAAiB;gBACxC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACb,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,eAAe,GAAG,iBAAiB;oBACxC,CAAC,CAAC,yBAAyB,CAAC,MAAM;oBAClC,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC5C,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,IAAI,SAAS,CAAC;gBACd,IAAI,WAAW,EAAE,CAAC;oBACjB,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;gBACnE,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9C,IAAI,GAAG,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;oBAC1B,IAAI,aAAa,GAAG,KAAK,CAAC;oBAE1B,0FAA0F;oBAC1F,kDAAkD;oBAClD,uGAAuG;oBACvG,kGAAkG;oBAClG,sDAAsD;oBACtD,IACC,CAAC,iBAAiB;wBAClB,SAAS;wBACT,IAAA,qBAAQ,EAAC,SAAS,CAAC;wBACnB,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,EAC3B,CAAC;wBACF,uFAAuF;wBACvF,wEAAwE;wBACxE,aAAa,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;wBAE1E,wFAAwF;wBACxF,IAAI,aAAa,IAAI,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;4BAClD,aAAa,GAAG,IAAA,oBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;wBAC7E,CAAC;wBAED,8EAA8E;wBAC9E,MAAM,aAAa,GAAG,IAAA,qBAAQ,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC;4BACnD,CAAC,CAAC,IAAA,oBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACzC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;wBACxB,MAAM,YAAY,GAAG,IAAA,qBAAQ,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC;4BAC5C,CAAC,CAAC,IAAA,oBAAO,EAAC,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACnC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBAClB,aAAa,GAAG,aAAa,IAAI,IAAA,oBAAO,EAAC,aAAa,EAAE,YAAY,CAAC,CAAC;oBACvE,CAAC;oBAED,IACC,CAAC,iBAAiB,IAAI,8BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC;wBAC5E,SAAS;wBACT,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,IAAA,qBAAQ,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;4BACxD,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAC7B,CAAC;wBACF,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC9B,IAAI,iBAAiB,EAAE,CAAC;gCACvB,sBAAsB,CAAC,MAAM,GAAG,IAAA,oBAAO,EAAC,sBAAsB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;4BAC7E,CAAC;iCAAM,CAAC;gCACP,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAA,oBAAO,EAC9C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EACrC,GAAG,CACH,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,eAAe,GAAG,aAAa,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC3E,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;wBACvB,CAAC;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE,CAAC;4BACtB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE,CAAC;gCACvB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC3D,CAAC;iCAAM,CAAC;gCACP,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC;oCACpC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gCAC7C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,sBAAS,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC9E,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;wBACjE,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;oBAC1C,CAAC;yBAAM,IACN,CAAC,iBAAiB;wBAClB,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EACjE,CAAC;wBACF,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,sBAAS,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7D,CAAC;yBAAM,CAAC;wBACP,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;oBACnD,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE,CAAC;YACtC,4EAA4E;YAC5E,MAAM,eAAe,GAAG,yBAAyB,CAAC,MAAM,CAAC;YACzD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YACpE,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,CAAC;YACjD,IAAI,YAAY,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;YAEvD,4BAA4B;YAE5B,gFAAgF;YAChF,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YACvF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEhC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAC7B,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAC7D,CAAC;gBACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE,CAAC;wBACvB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BAClD,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;wBAC3B,CAAC;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;wBAC9B,CAAC;6BAAM,CAAC;4BACP,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;gCACpE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;4BACpC,CAAC;iCAAM,CAAC;gCACP,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;4BAC9B,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,iFAAiF;wBACjF,kBAAkB;wBAClB,MAAM,oBAAoB,GAAG,8BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBAElE,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BACrE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gCACjD,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;oCAClD,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;gCAC/C,CAAC;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;oCAC/C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;gCAC7B,CAAC;gCAED,IACC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;oCACzB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAChD,CAAC;oCACF,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;gCAC5C,CAAC;qCAAM,CAAC;oCACP,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;gCACtC,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CACV,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;4BAC5E,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;gCACjD,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE,CAAC;oCAC/C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;wCACtD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;oCAC/B,CAAC;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gCAChD,CAAC;qCAAM,CAAC;oCACP,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC1D,CAAC;4BACF,CAAC;iCAAM,CAAC;gCACP,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CACV,CAAC;4BACH,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;4BAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,sBAAS,EAAC,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBACrE,CAAC;oBACF,CAAC;gBACF,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,sBAAsB,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACnF,CAAC,CAAC;IAEF;;;;;;;;;;;;;;;OAeG;IACU,gFAA4C,GAAG,UAC3D,uBAA4C,EAC5C,0BAA+C,EAC/C,WAAmB,EACnB,SAAiB,EACjB,0BAAmC,EACnC,aAA6B,EAC7B,UAAiC;QAEjC,MAAM,iBAAiB,GAAG,8BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,wFAAwF;QACxF,sEAAsE;QACtE,MAAM,UAAU,GAAG,UAClB,aAAkC,EAClC,mBAA2B,EAC3B,eAAuB,EACvB,eAAwB;YAExB,4CAA4C;YAC5C,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,OAAO;YACR,CAAC;YAED,sGAAsG;YACtG,iCAAiC;YACjC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAEvF,uCAAuC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEpB,+BAA+B;gBAC/B,aAAa,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC9C,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC;oBACxE,CAAC,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,mBAAmB,EAAE;oBACjE,CAAC,CAAC,mBAAmB,CAAC;gBAEvB,+CAA+C;gBAC/C,IAAI,eAAe,EAAE,CAAC;oBACrB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;gBAClE,CAAC;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE,CAAC;oBACjC,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;gBACrF,CAAC;YACF,CAAC;QACF,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAC7B,aAAa,EACb,mBAAmB,EACnB,eAAe;YAEf,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,OAAO;YACR,CAAC;YACD,iEAAiE;YACjE,MAAM,eAAe,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;YACjF,CAAC;QACF,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;aAAM,CAAC;YACP,IAAI,iBAAiB,EAAE,CAAC;gBACvB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC7D,CAAC;iBAAM,CAAC;gBACP,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACxE,CAAC;QACF,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACP,IAAI,iBAAiB,EAAE,CAAC;gBACvB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACP,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC7E,CAAC;QACF,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACvB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5D,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YAC5D,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YACjE,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACP,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvE,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;YACvE,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5E,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC7E,CAAC;QAED,sDAAsD;QACtD,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,0BAA0B;gBACzC,CAAC,CAAC,GAAG,WAAW,IAAI,0BAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG;gBAC/D,CAAC,CAAC,IAAA,2BAAS,EACT,WAAW,EACX,0BAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,EACxC,uBAAuB,CACvB,CAAC;YAEJ,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;gBAC5C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+Bc;gBAEd,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBACtE,IACC,iBAAiB;wBACjB,CAAC,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC;4BACpD,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EACpC,CAAC;wBACF,kFAAkF;wBAClF,iFAAiF;wBACjF,mCAAmC;wBACnC,IAAI,SAAS,GAAG,uBAAuB,CAAC,MAAM,CAAC;wBAC/C,IAAI,aAAa,GAAG,0BAA0B,CAAC,MAAM,CAAC;wBACtD,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;4BAC9B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;wBACzD,CAAC;wBAED,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAC7B,yCAAyC;wBACzC,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;wBAC9B,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BACtE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;wBAC3B,CAAC;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;4BAC5E,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;wBACjC,CAAC;wBACD,IACC,YAAY,CAAC,SAAS,KAAK,OAAO;4BAClC,YAAY,CAAC,SAAS,KAAK,QAAQ;4BACnC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACpB,CAAC;4BACF,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;gCACtE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;4BAC3B,CAAC;wBACF,CAAC;6BAAM,CAAC;4BACP,IAAI,QAAQ,KAAK,WAAW,EAAE,CAAC;gCAC9B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;4BAC3B,CAAC;wBACF,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,IAAI,CAAC,yCAAyC,CAC7C,GAAG,EACH,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,EACtD,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,EAC3D,YAAY,CAAC,SAAS,EACtB,OAAO,EACP,IAAI,EACJ,aAAa,EACb,UAAU,CACV,CAAC;oBACH,CAAC;gBACF,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC7E,SAAS,GAAG,YAAY,CAAC,WAAW;wBACnC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;wBAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;oBAErC,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,2BAA2B;wBAC9C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACjC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBACpF,IAAI,CAAC,iBAAiB,EAAE,CAAC;wBACxB,2FAA2F;wBAC3F,2FAA2F;wBAC3F,sFAAsF;wBACtF,yBAAyB;wBAEzB,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,sCAAsC;4BACzD,iBAAiB,EAChB,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC;yBACjE,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;oBACzE,CAAC;gBACF,CAAC;qBAAM,IACN,CAAC,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC;oBAChE,CAAC,YAAY,CAAC,KAAK,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,CAAC,EAC1E,CAAC;oBACF,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;wBACnC,SAAS,GAAG,YAAY,CAAC,SAAS;4BACjC,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC;4BACxD,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC;wBAElC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,mBAAmB;4BACtC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAC9B,CAAC;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE,CAAC;wBACnC,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE,CAAC;4BACtD,0BAA0B,CAAC,MAAM,GAAG,IAAA,oBAAO,EAC1C,0BAA0B,CAAC,MAAM,EACjC,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,IAAI,iBAAiB,EAAE,CAAC;gCACvB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BAC/C,CAAC;iCAAM,CAAC;gCACP,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;4BACzE,CAAC;wBACF,CAAC;oBACF,CAAC;gBACF,CAAC;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC7E,IAAI,iBAAiB,IAAI,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;wBAC/E,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;4BACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;4BAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;wBAErC,+EAA+E;wBAC/E,iFAAiF;wBACjF,0CAA0C;wBAC1C,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,oBAAoB;wBACpB,IAAI,QAAQ,CAAC;wBACb,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;4BAC9B,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;gCAC1D,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;4BACnE,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BACxE,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC;wBACxE,CAAC;6BAAM,CAAC;4BACP,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBAChD,CAAC;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;yBAAM,CAAC;wBACP,8FAA8F;wBAC9F,kGAAkG;wBAElG,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;4BACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;4BAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;wBAErC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,wCAAY,CAAC,4BAA4B;4BAC/C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;oBACvB,CAAC;gBACF,CAAC;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,eAAe,EACrC,CAAC;oBACF,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW;wBACvC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;wBAC7D,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC;oBAErC,4CAA4C;oBAC5C,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,aAAa;wBAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACjC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACP,kGAAkG;oBAClG,qBAAqB;oBAErB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,wCAAY,CAAC,sBAAsB;wBACzC,iBAAiB,EAAE,YAAY,CAAC,MAAM;qBACtC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,uCAAuC;oBACvC,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;wBACrC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;4BAC5C,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,CAC9E,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC5D,CAAC;oBACF,CAAC;yBAAM,CAAC;wBACP,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;4BACnE,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAA,oBAAO,EACvD,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAC9C,GAAG,CACH,CAAC;wBACH,CAAC;6BAAM,CAAC;4BACP,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;wBAC5D,CAAC;oBACF,CAAC;oBAED,OAAO,CAAC,KAAK,CACZ,yEAAyE,CACzE,CAAC;gBACH,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,0BAA0B,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACvF,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,oEAAgC,GAAG,UAC/C,kBAAuC,EACvC,kBAA2B;QAE3B,MAAM,OAAO,GAAG,kBAAkB,CAAC;QACnC,gBAAgB;QAEhB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE,CAAC;YACxB,IAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,IAAI,IAAA,sCAAgB,EAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBAC/C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChC,CAAC;gBACF,CAAC;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,CAAC;YACF,CAAC;QACF,CAAC;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACxC,OAAO,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC;IACF,CAAC,CAAC;AACH,CAAC,EA90BgB,mCAAmC,mDAAnC,mCAAmC,QA80BnD","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\n/\n @fileoverview Helper functions and classes to work with ChangeSets with indexed collections (sets and maps)\n /\n\nimport { constants, joinPaths } from \"@fluid-experimental/property-common\";\nimport cloneDeep from \"lodash/cloneDeep.js\";\nimport includes from \"lodash/includes.js\";\nimport isEmpty from \"lodash/isEmpty.js\";\nimport isEqual from \"lodash/isEqual.js\";\nimport isObject from \"lodash/isObject.js\";\nimport without from \"lodash/without.js\";\n\n// @ts-ignore\nimport { ApplyChangeSetOptions, ConflictInfo, SerializedChangeSet } from \"../changeset.js\";\nimport { TypeIdHelper } from \"../helpers/typeidHelper.js\";\nimport { PathHelper } from \"../pathHelper.js\";\n\nimport { ConflictType } from \"./changesetConflictTypes.js\";\nimport { isEmptyChangeSet } from \"./isEmptyChangeset.js\";\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\n/\n @namespace property-changeset.ChangeSetOperations.IndexedCollectionOperations\n * @alias property-changeset.ChangeSetOperations.IndexedCollectionOperations\n * Helper functions and classes to perform operations on ChangeSets with indexed collections (sets and maps)\n /\n\n/\n Checks whether an object is empty (has no keys)\n * This function should be a bit faster than the isEmpty from\n * underscore. Unfortunately, at least on Chrome, it is still in\n * O(n)\n \n @param in_object - The object to check\n * @returns Is it empty?\n * @private\n /\nconst _fastIsEmptyObject = function (in_object: any): boolean {\n\tif (!in_object \|\| Array.isArray(in_object) \|\| !isObject(in_object)) {\n\t\treturn isEmpty(in_object);\n\t}\n\n\t// eslint-disable-next-line guard-for-in, no-restricted-syntax\n\tfor (const _entry in in_object) {\n\t\treturn false;\n\t}\n\n\treturn true;\n};\n\n// eslint-disable-next-line @typescript-eslint/no-namespace\nexport namespace ChangeSetIndexedCollectionFunctions {\n\t/\n\t Applies a ChangeSet to a given indexed collection property (recursively). The ChangeSet is assumed to be relative\n\t * to the same property root and it will be applied behind the base ChangeSet (assuming that the changes are\n\t * relative to the state after the base ChangeSet has been applied. It will change the base ChangeSet.\n\t \n\t @param io_basePropertyChanges - The ChangeSet describing the initial state\n\t * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n\t * @param in_typeid - The typeid of the contents collection (without the collection type).\n\t * @param in_options - Optional additional parameters\n\t * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n\t * more compact changeset during the apply operation.\n\t \n\t @private\n\t /\n\texport const _performApplyAfterOnPropertyIndexedCollection = function (\n\t\tio_basePropertyChanges: SerializedChangeSet,\n\t\tin_appliedPropertyChanges: SerializedChangeSet,\n\t\tin_typeid: string,\n\t\tin_options: ApplyChangeSetOptions,\n\t) {\n\t\tconst isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n\t\t// Handle remove entry operations\n\t\tif (in_appliedPropertyChanges.remove) {\n\t\t\t// Get and initialize the corresponding entries in the existing collection\n\t\t\tlet removedEntries = in_appliedPropertyChanges.remove;\n\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.remove =\n\t\t\t\tio_basePropertyChanges.remove \|\|\n\t\t\t\t(Array.isArray(in_appliedPropertyChanges.remove) ? [] : {});\n\t\t\tlet baseInserted = io_basePropertyChanges.insert \|\| {};\n\t\t\tlet baseRemoved = io_basePropertyChanges.remove;\n\t\t\tlet baseModified = io_basePropertyChanges.modify;\n\t\t\tlet done = false;\n\n\t\t\tif (!Array.isArray(removedEntries)) {\n\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\tremovedEntries = Object.keys(removedEntries);\n\t\t\t\t} else {\n\t\t\t\t\t// this is a reversible change set of templated types\n\t\t\t\t\tconst removedTypes = Object.keys(removedEntries);\n\t\t\t\t\tfor (let t = 0; t < removedTypes.length; t++) {\n\t\t\t\t\t\tconst removedKeys = Object.keys(removedEntries[removedTypes[t]]);\n\t\t\t\t\t\tfor (let i = 0; i < removedKeys.length; i++) {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tbaseInserted[removedTypes[t]] &&\n\t\t\t\t\t\t\t\tbaseInserted[removedTypes[t]][removedKeys[i]] !== undefined\n\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\tdelete baseInserted[removedTypes[t]][removedKeys[i]];\n\n\t\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t\t// the whole typeid from the inserted section\n\t\t\t\t\t\t\t\tif (baseInserted && isEmpty(baseInserted[removedTypes[t]])) {\n\t\t\t\t\t\t\t\t\tdelete baseInserted[removedTypes[t]];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t\tbaseModified &&\n\t\t\t\t\t\t\t\t\tbaseModified[removedTypes[t]] &&\n\t\t\t\t\t\t\t\t\tbaseModified[removedTypes[t]][removedKeys[i]] !== undefined\n\t\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\t\tdelete baseModified[removedTypes[t]][removedKeys[i]];\n\n\t\t\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t\t\t// the whole typeid from the inserted section\n\t\t\t\t\t\t\t\t\tif (baseModified && isEmpty(baseModified[removedTypes[t]])) {\n\t\t\t\t\t\t\t\t\t\tdelete baseModified[removedTypes[t]];\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif (Array.isArray(baseRemoved)) {\n\t\t\t\t\t\t\t\t\tbaseRemoved.push(removedKeys[i]);\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tif (!baseRemoved[removedTypes[t]]) {\n\t\t\t\t\t\t\t\t\t\tbaseRemoved[removedTypes[t]] = {};\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbaseRemoved[removedTypes[t]][removedKeys[i]] =\n\t\t\t\t\t\t\t\t\t\tremovedEntries[removedTypes[t]][removedKeys[i]];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (!done) {\n\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\tfor (let i = 0; i < removedEntries.length; i++) {\n\t\t\t\t\t\tlet key = removedEntries[i];\n\n\t\t\t\t\t\t// If there is an insert for this key, we just remove it\n\t\t\t\t\t\tif (baseInserted[key] !== undefined) {\n\t\t\t\t\t\t\tdelete baseInserted[key];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// There could be a modify entry for this key, which we have to remove\n\t\t\t\t\t\t\tif (baseModified && baseModified[key] !== undefined) {\n\t\t\t\t\t\t\t\tdelete baseModified[key];\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Otherwise we add it to the remove list\n\t\t\t\t\t\t\tif (Array.isArray(baseRemoved)) {\n\t\t\t\t\t\t\t\tbaseRemoved.push(key);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbaseRemoved[key] = in_appliedPropertyChanges.remove[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tconst baseInsertedTypeids = Object.keys(baseInserted);\n\t\t\t\t\tfor (let i = 0; i < removedEntries.length; i++) {\n\t\t\t\t\t\tlet key = removedEntries[i];\n\t\t\t\t\t\tlet foundInTypeid;\n\n\t\t\t\t\t\t// Since we only have a flat remove list (without typeid) in the changeset, we have\n\t\t\t\t\t\t// to check all inserts\n\t\t\t\t\t\tfor (let j = 0; j < baseInsertedTypeids.length; j++) {\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\tbaseInserted[baseInsertedTypeids[j]] &&\n\t\t\t\t\t\t\t\tbaseInserted[baseInsertedTypeids[j]][key] !== undefined\n\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\tfoundInTypeid = baseInsertedTypeids[j];\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (foundInTypeid) {\n\t\t\t\t\t\t\t// If this key was inserted by this ChangeSet, we just remove it from the inserted list\n\t\t\t\t\t\t\tdelete baseInserted[foundInTypeid][key];\n\n\t\t\t\t\t\t\t// If all entries for a typeid have been removed, we can remove\n\t\t\t\t\t\t\t// the whole typeid from the inserted or modified section\n\t\t\t\t\t\t\tif (baseInserted && isEmpty(baseInserted[foundInTypeid])) {\n\t\t\t\t\t\t\t\tdelete baseInserted[foundInTypeid];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif (baseModified && isEmpty(baseModified[foundInTypeid])) {\n\t\t\t\t\t\t\t\tdelete baseModified[foundInTypeid];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// There could be a modify entry for this key, which we have to remove\n\t\t\t\t\t\t\tconst baseModifiedTypeids = Object.keys(baseModified \|\| {});\n\t\t\t\t\t\t\tfor (let j = 0; j < baseModifiedTypeids.length; j++) {\n\t\t\t\t\t\t\t\tif (baseModified[baseModifiedTypeids[j]][key]) {\n\t\t\t\t\t\t\t\t\tfoundInTypeid = baseModifiedTypeids[j];\n\t\t\t\t\t\t\t\t\tdelete baseModified[foundInTypeid][key];\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t// Otherwise we add it to the remove list\n\t\t\t\t\t\t\tbaseRemoved.push(key);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Apply insert operations\n\t\tif (in_appliedPropertyChanges.insert) {\n\t\t\t// Get and initialize the corresponding entries from the existing collection\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.insert = io_basePropertyChanges.insert \|\| {};\n\t\t\tlet baseInserted = io_basePropertyChanges.insert;\n\t\t\tlet baseRemoved = io_basePropertyChanges.remove;\n\n\t\t\t// Insert the inserted entries\n\n\t\t\t// If no typeids are included, we just use a placeholder for the iteration below\n\t\t\tconst insertedTypeids = isPrimitiveTypeid\n\t\t\t\t? [undefined]\n\t\t\t\t: Object.keys(in_appliedPropertyChanges.insert);\n\t\t\tfor (let i = 0; i < insertedTypeids.length; i++) {\n\t\t\t\tlet typeid = insertedTypeids[i];\n\t\t\t\tconst insertedEntries = isPrimitiveTypeid\n\t\t\t\t\t? in_appliedPropertyChanges.insert\n\t\t\t\t\t: in_appliedPropertyChanges.insert[typeid];\n\t\t\t\tconst insertedKeys = Object.keys(insertedEntries);\n\t\t\t\tlet removalCS;\n\t\t\t\tif (baseRemoved) {\n\t\t\t\t\tremovalCS = isPrimitiveTypeid ? baseRemoved : baseRemoved[typeid];\n\t\t\t\t}\n\t\t\t\tfor (let j = 0; j < insertedKeys.length; j++) {\n\t\t\t\t\tlet key = insertedKeys[j];\n\t\t\t\t\tlet deeplyEqualCS = false;\n\n\t\t\t\t\t// If we have a complex type in the collection, we need to do a deep comparison of the two\n\t\t\t\t\t// ChangeSets to determine, whether they are equal\n\t\t\t\t\t// TODO: We should actually compute a diff between the two and recursively convert portions to modifies\n\t\t\t\t\t// Instead, right now, we only handle the case where the two keys cancel each out perfectly, i.e.,\n\t\t\t\t\t// the insert is reinserting exactly what was removed.\n\t\t\t\t\tif (\n\t\t\t\t\t\t!isPrimitiveTypeid &&\n\t\t\t\t\t\tremovalCS &&\n\t\t\t\t\t\tisObject(removalCS) &&\n\t\t\t\t\t\tremovalCS[key] !== undefined\n\t\t\t\t\t) {\n\t\t\t\t\t\t// Split out the two parts: all the keys other than remove/insert should match exactly.\n\t\t\t\t\t\t// The contents 'remove' and 'insert', if they exist, should also match.\n\t\t\t\t\t\tdeeplyEqualCS = !!insertedEntries[key].insert === !!removalCS[key].remove;\n\n\t\t\t\t\t\t// If there are 'insert' and 'remove', see if the removed data matches the inserted data\n\t\t\t\t\t\tif (deeplyEqualCS && insertedEntries[key].insert) {\n\t\t\t\t\t\t\tdeeplyEqualCS = isEqual(insertedEntries[key].insert, removalCS[key].remove);\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Finally, check if the data being inserted matches the data that was removed\n\t\t\t\t\t\tconst insertedEntry = isObject(insertedEntries[key])\n\t\t\t\t\t\t\t? without(insertedEntries[key], \"insert\")\n\t\t\t\t\t\t\t: insertedEntries[key];\n\t\t\t\t\t\tconst removedEntry = isObject(removalCS[key])\n\t\t\t\t\t\t\t? without(removalCS[key], \"remove\")\n\t\t\t\t\t\t\t: removalCS[key];\n\t\t\t\t\t\tdeeplyEqualCS = deeplyEqualCS && isEqual(insertedEntry, removedEntry);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (\n\t\t\t\t\t\t(isPrimitiveTypeid \|\| TypeIdHelper.isPrimitiveType(typeid) \|\| deeplyEqualCS) &&\n\t\t\t\t\t\tremovalCS &&\n\t\t\t\t\t\t((Array.isArray(removalCS) && includes(baseRemoved, key)) \|\|\n\t\t\t\t\t\t\tremovalCS[key] !== undefined)\n\t\t\t\t\t) {\n\t\t\t\t\t\t// A remove and insert are combined into a modify for primitive types\n\n\t\t\t\t\t\t// Remove the old remove command\n\t\t\t\t\t\tlet oldValueMatches = false;\n\t\t\t\t\t\tif (Array.isArray(removalCS)) {\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.remove = without(io_basePropertyChanges.remove, key);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.remove[typeid] = without(\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.remove[typeid],\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\toldValueMatches = deeplyEqualCS \|\| removalCS[key] === insertedEntries[key];\n\t\t\t\t\t\t\tdelete removalCS[key];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\t// Insert a modify command instead\n\t\t\t\t\t\tif (!oldValueMatches) {\n\t\t\t\t\t\t\tio_basePropertyChanges.modify = io_basePropertyChanges.modify \|\| {};\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[key] = insertedEntries[key];\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid] =\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid] \|\| {};\n\t\t\t\t\t\t\t\tio_basePropertyChanges.modify[typeid][key] = cloneDeep(insertedEntries[key]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else if (isPrimitiveTypeid && baseInserted[key] === undefined) {\n\t\t\t\t\t\tbaseInserted[key] = insertedEntries[key];\n\t\t\t\t\t} else if (\n\t\t\t\t\t\t!isPrimitiveTypeid &&\n\t\t\t\t\t\t(!baseInserted[typeid] \|\| baseInserted[typeid][key] === undefined)\n\t\t\t\t\t) {\n\t\t\t\t\t\tbaseInserted[typeid] = baseInserted[typeid] \|\| {};\n\t\t\t\t\t\tbaseInserted[typeid][key] = cloneDeep(insertedEntries[key]);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthrow new Error(MSG.ALREADY_EXISTING_ENTRY + key);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Handle modification operations\n\t\tif (in_appliedPropertyChanges.modify) {\n\t\t\t// Get and initialize the corresponding entries from the existing collection\n\t\t\tconst modifiedEntries = in_appliedPropertyChanges.modify;\n\t\t\tio_basePropertyChanges = io_basePropertyChanges \|\| {};\n\t\t\tio_basePropertyChanges.modify = io_basePropertyChanges.modify \|\| {};\n\t\t\tlet baseModified = io_basePropertyChanges.modify;\n\t\t\tlet baseInserted = io_basePropertyChanges.insert \|\| {};\n\n\t\t\t// Process the modifications\n\n\t\t\t// If no typeids are included, we just use a placeholder for the iteration below\n\t\t\tconst modifiedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(modifiedEntries);\n\t\t\tfor (let i = 0; i < modifiedTypeids.length; i++) {\n\t\t\t\tlet typeid = modifiedTypeids[i];\n\n\t\t\t\tconst modifyKeys = Object.keys(\n\t\t\t\t\tisPrimitiveTypeid ? modifiedEntries : modifiedEntries[typeid],\n\t\t\t\t);\n\t\t\t\tfor (let j = 0; j < modifyKeys.length; j++) {\n\t\t\t\t\tlet key = modifyKeys[j];\n\n\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\tlet newValue = modifiedEntries[key];\n\t\t\t\t\t\tif (newValue && newValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\tnewValue = newValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (baseInserted[key] !== undefined) {\n\t\t\t\t\t\t\t// If this entry was added by this ChangeSet, we modify the insert operation according to the\n\t\t\t\t\t\t\t// new ChangeSet\n\t\t\t\t\t\t\tbaseInserted[key] = newValue;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (baseModified[key] && baseModified[key].hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\tbaseModified[key].value = newValue;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tbaseModified[key] = newValue;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// If this is a polymorphic collection, we can still have individual entries with\n\t\t\t\t\t\t// primitive types\n\t\t\t\t\t\tconst isEntryPrimitiveType = TypeIdHelper.isPrimitiveType(typeid);\n\n\t\t\t\t\t\tif (baseInserted[typeid] && baseInserted[typeid][key] !== undefined) {\n\t\t\t\t\t\t\t// If this entry was added by this ChangeSet, we modify the insert operation according to the\n\t\t\t\t\t\t\t// new ChangeSet\n\t\t\t\t\t\t\tif (isEntryPrimitiveType && typeid !== \"String\") {\n\t\t\t\t\t\t\t\tlet newValue = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\tif (newValue && newValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\t\tnewValue = modifiedEntries[typeid][key].value;\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\t// In the case of Int64 or Uint64 we copy the array so that\n\t\t\t\t\t\t\t\t// both ChangeSets don't point to the same instance\n\t\t\t\t\t\t\t\tif (typeid === \"Int64\" \|\| typeid === \"Uint64\") {\n\t\t\t\t\t\t\t\t\tnewValue = newValue.slice();\n\t\t\t\t\t\t\t\t}\n\n\t\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key] &&\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key].hasOwnProperty(\"value\")\n\t\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key].value = newValue;\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid][key] = newValue;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthis.performApplyAfterOnPropertyWithTypeid(\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t\tbaseInserted[typeid],\n\t\t\t\t\t\t\t\t\tmodifiedEntries[typeid],\n\t\t\t\t\t\t\t\t\ttypeid,\n\t\t\t\t\t\t\t\t\tfalse,\n\t\t\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if (baseModified[typeid] && baseModified[typeid][key] !== undefined) {\n\t\t\t\t\t\t\t// If there was a previous modification operation, we have to merge the two\n\t\t\t\t\t\t\tif (isEntryPrimitiveType && typeid !== \"String\") {\n\t\t\t\t\t\t\t\t// Primitive types can simply be overwritten, however we have an exception for\n\t\t\t\t\t\t\t\t// 64 bit integers (until javascript natively supports them)\n\t\t\t\t\t\t\t\tif (typeid === \"Int64\" \|\| typeid === \"Uint64\") {\n\t\t\t\t\t\t\t\t\tlet appliedVal = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\t\tif (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\t\t\t\tappliedVal = appliedVal.value;\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\tbaseModified[typeid][key] = appliedVal.slice();\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\tbaseModified[typeid][key] = modifiedEntries[typeid][key];\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tthis.performApplyAfterOnPropertyWithTypeid(\n\t\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t\t\tbaseModified[typeid],\n\t\t\t\t\t\t\t\t\tmodifiedEntries[typeid],\n\t\t\t\t\t\t\t\t\ttypeid,\n\t\t\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tbaseModified[typeid] = baseModified[typeid] \|\| {};\n\t\t\t\t\t\t\tbaseModified[typeid][key] = cloneDeep(modifiedEntries[typeid][key]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove unnecessary entries from the ChangeSet\n\t\tthis._cleanIndexedCollectionChangeSet(io_basePropertyChanges, !isPrimitiveTypeid);\n\t};\n\n\t/\n\t Performs the rebase operation for set and map collections.\n\t \n\t @param in_ownPropertyChangeSet - The ChangeSet for this collection.\n\t * @param io_rebasePropertyChangeSet - The ChangeSet for the collection to be rebased.\n\t * @param in_basePath - Base path to get to the property processed by this function.\n\t * @param in_typeid - The typeid of the contents collection (without the collection type).\n\t * @param in_useSquareBracketsInPath - If set to true, paths will be created using the angular brackets syntax (for\n\t * arrays), otherwise dots will be used (for NodeProperties).\n\t * @param out_conflicts - A list of paths that resulted in conflicts together with the type of the conflict.\n\t * @param in_options - Optional additional parameters.\n\t * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n\t * more compact changeset during the apply operation.\n\t \n\t @private\n\t /\n\texport const _rebaseIndexedCollectionChangeSetForProperty = function (\n\t\tin_ownPropertyChangeSet: SerializedChangeSet,\n\t\tio_rebasePropertyChangeSet: SerializedChangeSet,\n\t\tin_basePath: string,\n\t\tin_typeid: string,\n\t\tin_useSquareBracketsInPath: boolean,\n\t\tout_conflicts: ConflictInfo[],\n\t\tin_options: ApplyChangeSetOptions,\n\t) {\n\t\tconst isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n\t\tconst changesByKeys = {};\n\t\tlet modifyMap = {};\n\t\t// Helper function which stores the changes indexed by key in the changesByKeys array to\n\t\t// make it easier to compare the related changes in the two ChangeSets\n\t\tconst addChanges = function (\n\t\t\tin_collection: Record<string, any>,\n\t\t\tin_changeIdentifier: string,\n\t\t\tin_changePrefix: string,\n\t\t\tin_typeidChange?: string,\n\t\t) {\n\t\t\t// Collection didn't exist in this ChangeSet\n\t\t\tif (in_collection === undefined) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\t// For remove operations, the ChangeSet is only an array of keys, otherwise it is a map, so we have to\n\t\t\t// distinguish the two cases here\n\t\t\tconst keys = Array.isArray(in_collection) ? in_collection : Object.keys(in_collection);\n\n\t\t\t// Add all entries indexed with the key\n\t\t\tfor (let j = 0; j < keys.length; j++) {\n\t\t\t\tconst key = keys[j];\n\n\t\t\t\t// Store the type of the change\n\t\t\t\tchangesByKeys[key] = changesByKeys[key] \|\| {};\n\t\t\t\tchangesByKeys[key][in_changePrefix] = changesByKeys[key][in_changePrefix]\n\t\t\t\t\t? `${changesByKeys[key][in_changePrefix]}_${in_changeIdentifier}`\n\t\t\t\t\t: in_changeIdentifier;\n\n\t\t\t\t// If applicable store the typeid of the change\n\t\t\t\tif (in_typeidChange) {\n\t\t\t\t\tchangesByKeys[key][`${in_changePrefix}Typeid`] = in_typeidChange;\n\t\t\t\t}\n\n\t\t\t\t// Store the ChangeSet\n\t\t\t\tif (in_changePrefix === \"other\") {\n\t\t\t\t\tchangesByKeys[key].change = Array.isArray(in_collection) ? key : in_collection[key];\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\n\t\t// Helper function which adds the Changes for a ChangeSet that is ordered by typeid\n\t\tconst addChangesWithTypeids = function (\n\t\t\tin_collection,\n\t\t\tin_changeIdentifier,\n\t\t\tin_changePrefix,\n\t\t) {\n\t\t\tif (in_collection === undefined) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t// Iterate over the typeids (or use dummy entry for the iteration\n\t\t\tconst addedKeyTypeids = Object.keys(in_collection);\n\t\t\tfor (let i = 0; i < addedKeyTypeids.length; i++) {\n\t\t\t\tconst Typeid = addedKeyTypeids[i];\n\t\t\t\taddChanges(in_collection[Typeid], in_changeIdentifier, in_changePrefix, Typeid);\n\t\t\t}\n\t\t};\n\n\t\t// Insert all changes from the ChangeSet into the lookup map\n\t\tif (Array.isArray(in_ownPropertyChangeSet.remove)) {\n\t\t\taddChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t} else {\n\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\taddChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t\t} else {\n\t\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n\t\t\t}\n\t\t}\n\n\t\tif (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n\t\t\taddChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t} else {\n\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\taddChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t\t} else {\n\t\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n\t\t\t}\n\t\t}\n\n\t\tif (isPrimitiveTypeid) {\n\t\t\taddChanges(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n\t\t\taddChanges(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n\t\t\taddChanges(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n\t\t\taddChanges(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n\t\t} else {\n\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n\t\t\taddChangesWithTypeids(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n\t\t\taddChangesWithTypeids(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n\t\t}\n\n\t\t// Check for modifications that affect the same object\n\t\tconst changedKeys = Object.keys(changesByKeys);\n\t\tfor (let i = 0; i < changedKeys.length; i++) {\n\t\t\tconst key = changedKeys[i];\n\t\t\tconst newPath = in_useSquareBracketsInPath\n\t\t\t\t? `${in_basePath}[${PathHelper.quotePathSegmentIfNeeded(key)}]`\n\t\t\t\t: joinPaths(\n\t\t\t\t\t\tin_basePath,\n\t\t\t\t\t\tPathHelper.quotePathSegmentIfNeeded(key),\n\t\t\t\t\t\tPROPERTY_PATH_DELIMITER,\n\t\t\t\t\t);\n\n\t\t\tconst modification = changesByKeys[key];\n\t\t\tif (modification.own && modification.other) {\n\t\t\t\t/\n We found a key that was changed by both ChangeSets at the same time\n We now have to handle the conflicting changes. The changes we do, are summarized in this table:\n\n <START REBASE HANDLING TABLE>\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \\Own\| insert \| modify \| remove \| remove+insert \|\n \| \\ \| \| \| \| \|\n \|other\\ \| \| \| \| \|\n +=======+=================+==================+===================+=====================================+\n \| \| conflicting \| incompatible \| incompatible \| incompatible \|\n \|insert \| inserts \| psets \| psets \| psets \|\n \| \| \| \| \| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| merge recursively\| conflict \| conflict \|\n \|modify \| psets \| (conflicting on \| \| (modify can not be applied due to \|\n \| \| \| leaf) \| - delete modify \| to incompatible base) \|\n \| \| \| \| in other \| \|\n \| \| \| \| \| - delete modify in other \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| non-conflicting \| non-conflicting \| incompatible \|\n \|remove \| psets \| change \| change \| psets \|\n \| \| \| \| \| \|\n \| \| \| \| - rem dupl. remove\| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n \| \| incompatible \| non-conflicting \| non-conflicting \| conflict \|\n \|remove+\| psets \| change \| change \| \|\n \|insert \| \| \| \| - remove conflicting insert \|\n \| \| \| \| - rem dupl. remove\| \|\n +-------+-----------------+------------------+-------------------+-------------------------------------+\n <END REBASE HANDLING TABLE>\n /\n\n\t\t\t\t// A key was modified after it had been removed\n\t\t\t\tif (modification.own === \"modify\" && modification.other === \"modify\") {\n\t\t\t\t\tif (\n\t\t\t\t\t\tisPrimitiveTypeid \|\|\n\t\t\t\t\t\t(TypeIdHelper.isPrimitiveType(modification.ownTypeid) &&\n\t\t\t\t\t\t\tmodification.ownTypeid !== \"String\")\n\t\t\t\t\t) {\n\t\t\t\t\t\t// We have two modification operations that affect the same entry for a base type.\n\t\t\t\t\t\t// This is a legal operation, the second one will overwrite the first one, but we\n\t\t\t\t\t\t// report it as a possible conflict\n\t\t\t\t\t\tlet ownModify = in_ownPropertyChangeSet.modify;\n\t\t\t\t\t\tlet rebasedModify = io_rebasePropertyChangeSet.modify;\n\t\t\t\t\t\tif (modification.otherTypeid) {\n\t\t\t\t\t\t\townModify = ownModify[modification.otherTypeid];\n\t\t\t\t\t\t\trebasedModify = rebasedModify[modification.otherTypeid];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\t\tconflictingChange: ownModify[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t\t\t// If value is the same, delete the entry\n\t\t\t\t\t\tlet ownValue = ownModify[key];\n\t\t\t\t\t\tif (typeof ownValue === \"object\" && ownValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\townValue = ownValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlet rebaseValue = rebasedModify[key];\n\t\t\t\t\t\tif (typeof rebaseValue === \"object\" && rebaseValue.hasOwnProperty(\"value\")) {\n\t\t\t\t\t\t\trebaseValue = rebaseValue.value;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tmodification.ownTypeid === \"Int64\" \|\|\n\t\t\t\t\t\t\tmodification.ownTypeid === \"Uint64\" \|\|\n\t\t\t\t\t\t\townValue.length === 2\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// For (u)int64, values are arrays of 2 elements\n\t\t\t\t\t\t\tif (ownValue[0] === rebaseValue[0] && ownValue[1] === rebaseValue[1]) {\n\t\t\t\t\t\t\t\tdelete rebasedModify[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (ownValue === rebaseValue) {\n\t\t\t\t\t\t\t\tdelete rebasedModify[key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tthis.rebaseChangeSetForPropertyEntryWithTypeid(\n\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\tin_ownPropertyChangeSet.modify[modification.ownTypeid],\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid],\n\t\t\t\t\t\t\tmodification.ownTypeid,\n\t\t\t\t\t\t\tnewPath,\n\t\t\t\t\t\t\ttrue,\n\t\t\t\t\t\t\tout_conflicts,\n\t\t\t\t\t\t\tin_options,\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t} else if (modification.own === \"remove\" && modification.other === \"modify\") {\n\t\t\t\t\tmodifyMap = modification.otherTypeid\n\t\t\t\t\t\t? io_rebasePropertyChangeSet.modify[modification.otherTypeid]\n\t\t\t\t\t\t: io_rebasePropertyChangeSet.modify;\n\n\t\t\t\t\t// Create the conflict information\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.ENTRY_MODIFIED_AFTER_REMOVE,\n\t\t\t\t\t\tconflictingChange: modifyMap[key],\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\tdelete modifyMap[key];\n\t\t\t\t} else if (modification.own === \"remove_insert\" && modification.other === \"modify\") {\n\t\t\t\t\tif (!isPrimitiveTypeid) {\n\t\t\t\t\t\t// We have a conflicting change. A node was removed and inserted (replaced) in the original\n\t\t\t\t\t\t// ChangeSet and then modified by the rebased ChangeSet. Since the base of the modification\n\t\t\t\t\t\t// can have been changed significantly by this operation, we don't know whether we can\n\t\t\t\t\t\t// apply the modification\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.ENTRY_MODIFICATION_AFTER_REMOVE_INSERT,\n\t\t\t\t\t\t\tconflictingChange:\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid][key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.modify[modification.otherTypeid][key];\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\t(modification.own === \"modify\" \|\| modification.own === \"remove\") &&\n\t\t\t\t\t(modification.other === \"remove\" \|\| modification.other === \"remove_insert\")\n\t\t\t\t) {\n\t\t\t\t\tif (modification.own === \"modify\") {\n\t\t\t\t\t\tmodifyMap = modification.ownTypeid\n\t\t\t\t\t\t\t? in_ownPropertyChangeSet.modify[modification.ownTypeid]\n\t\t\t\t\t\t\t: in_ownPropertyChangeSet.modify;\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.REMOVE_AFTER_MODIFY,\n\t\t\t\t\t\t\tconflictingChange: modifyMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t\t}\n\n\t\t\t\t\t// If we have a duplicated delete, we remove it from the new ChangeSet\n\t\t\t\t\tif (modification.own === \"remove\") {\n\t\t\t\t\t\tif (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.remove = without(\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.remove,\n\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tif (isPrimitiveTypeid) {\n\t\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.remove[key];\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet.remove[modification.otherTypeid][key];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else if (modification.own === \"insert\" && modification.other === \"insert\") {\n\t\t\t\t\tif (isPrimitiveTypeid \|\| TypeIdHelper.isPrimitiveType(modification.ownTypeid)) {\n\t\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t\t// We have two insert operations that affect the same key for a primitive type.\n\t\t\t\t\t\t// This is a legal operation, the second one will overwrite the first one, but we\n\t\t\t\t\t\t// report it as a possible conflicting set\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Convert to modify\n\t\t\t\t\t\tlet oldValue;\n\t\t\t\t\t\tif (modification.otherTypeid) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify \|\| {};\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid] =\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify[modification.otherTypeid] \|\| {};\n\t\t\t\t\t\t\tmodifyMap = io_rebasePropertyChangeSet.modify[modification.otherTypeid];\n\t\t\t\t\t\t\toldValue = in_ownPropertyChangeSet.insert[modification.ownTypeid][key];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify \|\| {};\n\t\t\t\t\t\t\tmodifyMap = io_rebasePropertyChangeSet.modify;\n\t\t\t\t\t\t\toldValue = in_ownPropertyChangeSet.insert[key];\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tmodifyMap[key] = { value: insertMap[key], oldValue };\n\t\t\t\t\t\tdelete insertMap[key];\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Here we have two insert operations for objects. Since these affect a whole sub-tree and not\n\t\t\t\t\t\t// just a single value, we cannot easily convert it into a modify and instead report it as invalid\n\n\t\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t\t// Create the conflict information\n\t\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\t\ttype: ConflictType.INSERTED_ENTRY_WITH_SAME_KEY,\n\t\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t\t};\n\t\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t\t// Delete the modification from the rebased ChangeSet\n\t\t\t\t\t\tdelete insertMap[key];\n\t\t\t\t\t}\n\t\t\t\t} else if (\n\t\t\t\t\tmodification.own === \"remove_insert\" &&\n\t\t\t\t\tmodification.other === \"remove_insert\"\n\t\t\t\t) {\n\t\t\t\t\tlet insertMap = modification.otherTypeid\n\t\t\t\t\t\t? io_rebasePropertyChangeSet.insert[modification.otherTypeid]\n\t\t\t\t\t\t: io_rebasePropertyChangeSet.insert;\n\n\t\t\t\t\t// Raise the duplicate inserts as a conflict\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.COLLIDING_SET,\n\t\t\t\t\t\tconflictingChange: insertMap[key],\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\t\t\t\t} else {\n\t\t\t\t\t// All other operations are conflicting changes, which only occur for ChangeSets that are relative\n\t\t\t\t\t// to different bases\n\n\t\t\t\t\t// Create the conflict information\n\t\t\t\t\tlet conflict = {\n\t\t\t\t\t\tpath: newPath,\n\t\t\t\t\t\ttype: ConflictType.INVALID_CHANGESET_BASE,\n\t\t\t\t\t\tconflictingChange: modification.change,\n\t\t\t\t\t};\n\t\t\t\t\tout_conflicts.push(conflict);\n\n\t\t\t\t\t// Remove the change from the ChangeSet\n\t\t\t\t\tif (modification.other !== \"remove\") {\n\t\t\t\t\t\tif (modification.otherTypeid !== undefined) {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][modification.otherTypeid][\n\t\t\t\t\t\t\t\tkey\n\t\t\t\t\t\t\t];\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][key];\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t// Remove remove operations from the ChangeSet\n\t\t\t\t\t\tif (Array.isArray(io_rebasePropertyChangeSet[modification.other])) {\n\t\t\t\t\t\t\tio_rebasePropertyChangeSet[modification.other] = without(\n\t\t\t\t\t\t\t\tio_rebasePropertyChangeSet[modification.other],\n\t\t\t\t\t\t\t\tkey,\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tdelete io_rebasePropertyChangeSet[modification.other][key];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tconsole.error(\n\t\t\t\t\t\t\"Rebase operation with conflicting ChangeSets. Probably incorrect bases.\",\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove unnecessary entries from the ChangeSet\n\t\tthis._cleanIndexedCollectionChangeSet(io_rebasePropertyChangeSet, !isPrimitiveTypeid);\n\t};\n\n\t/\n\t Removes empty entries from the .children collection of the ChangeSet\n\t \n\t @param in_propertyChanges - The ChangeSet to clean up\n\t * @param in_containsTypeids - Does this ChangeSet contain typeids\n\t * @private\n\t */\n\texport const _cleanIndexedCollectionChangeSet = function (\n\t\tin_propertyChanges: SerializedChangeSet,\n\t\tin_containsTypeids: boolean,\n\t) {\n\t\tconst changes = in_propertyChanges;\n\t\t// Clean inserts\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.insert \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tif (_fastIsEmptyObject(changes.insert[typeidList[j]])) {\n\t\t\t\t\tdelete changes.insert[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove add group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.insert)) {\n\t\t\tdelete changes.insert;\n\t\t}\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.remove \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tif (_fastIsEmptyObject(changes.remove[typeidList[j]])) {\n\t\t\t\t\tdelete changes.remove[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// Remove remove group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.remove)) {\n\t\t\tdelete changes.remove;\n\t\t}\n\n\t\t// Clean modifies\n\n\t\t// First remove unused typeid sections\n\t\tif (in_containsTypeids) {\n\t\t\tlet typeidList = Object.keys(changes.modify \|\| {});\n\t\t\tfor (let j = 0; j < typeidList.length; j++) {\n\t\t\t\tconst modifies = changes.modify[typeidList[j]];\n\t\t\t\tconst modifyKeys = Object.keys(modifies);\n\t\t\t\tfor (let k = 0; k < modifyKeys.length; k++) {\n\t\t\t\t\tif (isEmptyChangeSet(modifies[modifyKeys[k]])) {\n\t\t\t\t\t\tdelete modifies[modifyKeys[k]];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (_fastIsEmptyObject(changes.modify[typeidList[j]])) {\n\t\t\t\t\tdelete changes.modify[typeidList[j]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Remove modify group if no operations are present\n\t\tif (_fastIsEmptyObject(changes.modify)) {\n\t\t\tdelete changes.modify;\n\t\t}\n\t};\n}\n"]}

package/dist/rebase.js CHANGED Viewed

@@ -8,7 +8,7 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.rebaseToRemoteChanges = void 0;
-const fastest_json_copy_1 = require("fastest-json-copy");
+const cloneDeep_js_1 = __importDefault(require("lodash/cloneDeep.js"));
 const isEqual_js_1 = __importDefault(require("lodash/isEqual.js"));
 const changeset_js_1 = require("./changeset.js");
 class SyncPromise {
@@ -87,12 +87,12 @@ function rebaseToRemoteChanges(change, getUnrebasedChange, getRebasedChanges, is
                     let applyAfterMetaInformation;
                     if (alreadyRebasedChanges[0] !== undefined &&
                         alreadyRebasedChanges[0].guid === c.guid) {
-                        const invertedChange = new changeset_js_1.ChangeSet((0, fastest_json_copy_1.copy)(alreadyRebasedChanges[0].changeSet));
+                        const invertedChange = new changeset_js_1.ChangeSet((0, cloneDeep_js_1.default)(alreadyRebasedChanges[0].changeSet));
                         invertedChange.toInverseChangeSet();
                         invertedChange.applyChangeSet(rebaseBaseChangeSetForAlreadyRebasedChanges);
                         applyAfterMetaInformation = new Map();
                         const conflicts2 = [];
-                        changeset = (0, fastest_json_copy_1.copy)(alreadyRebasedChanges[0].changeSet);
+                        changeset = (0, cloneDeep_js_1.default)(alreadyRebasedChanges[0].changeSet);
                         rebaseBaseChangeSetForAlreadyRebasedChanges._rebaseChangeSet(changeset, conflicts2, {
                             applyAfterMetaInformation,
                         });
@@ -126,11 +126,11 @@ function rebaseToRemoteChanges(change, getUnrebasedChange, getRebasedChanges, is
                 let changeset = remoteChange.changeSet;
                 if (changesOnOtherLocalBranch[0] !== undefined &&
                     changesOnOtherLocalBranch[0].guid === remoteChange.guid) {
-                    const invertedChange = new changeset_js_1.ChangeSet((0, fastest_json_copy_1.copy)(changesOnOtherLocalBranch[0].changeSet));
+                    const invertedChange = new changeset_js_1.ChangeSet((0, cloneDeep_js_1.default)(changesOnOtherLocalBranch[0].changeSet));
                     invertedChange.toInverseChangeSet();
                     invertedChange.applyChangeSet(rebaseBaseChangeSet);
                     applyAfterMetaInformation = new Map();
-                    changeset = (0, fastest_json_copy_1.copy)(changesOnOtherLocalBranch[0].changeSet);
+                    changeset = (0, cloneDeep_js_1.default)(changesOnOtherLocalBranch[0].changeSet);
                     rebaseBaseChangeSet._rebaseChangeSet(changeset, conflicts, {
                         applyAfterMetaInformation,
                     });
@@ -155,7 +155,7 @@ exports.rebaseToRemoteChanges = rebaseToRemoteChanges;
 function rebaseChangeArrays(baseChangeSet, changesToRebase) {
     let rebaseBaseChangeSet = baseChangeSet;
     for (const change of changesToRebase) {
-        const copiedChangeSet = new changeset_js_1.ChangeSet((0, fastest_json_copy_1.copy)(change.changeSet));
+        const copiedChangeSet = new changeset_js_1.ChangeSet((0, cloneDeep_js_1.default)(change.changeSet));
         copiedChangeSet.toInverseChangeSet();
         const conflicts = [];
         change.rebaseMetaInformation = new Map();

package/dist/rebase.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"rebase.js","sourceRoot":"","sources":["../src/rebase.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH,yDAAsD;AACtD,mEAAwC;AAExC,iDAA2C;AAE3C,MAAM,WAAW;IAGhB,YAAY,CAAiB;QAC5B,IAAI,CAAC,CAAC,IAAI,YAAY,WAAW,CAAC,EAAE,CAAC;YACpC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,YAAY,WAAW,EAAE,CAAC;YAC9B,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QACb,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,IAAI,CAAC,EAAiC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACnD,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED,MAAM,IAAI,GAAG,CACZ,OAAqB,EACrB,EAAmE,EACnE,WAA+B,EAC9B,EAAE,CACH,OAAO;KACL,IAAI,CAAC,EAAE,CAAC;KACR,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;AAE7F;;GAEG;AACH,SAAgB,qBAAqB,CACpC,MAAW,EACX,kBAAuB,EACvB,iBAAsB,EACtB,UAAmB,KAAK;IAExB,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACxF,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;IAEhC,MAAM,yBAAyB,GAAG,EAAE,CAAC;IACrC,IAAI,mBAAmB,GAAG,IAAI,wBAAS,CAAC,EAAE,CAAC,CAAC;IAC5C,MAAM,yBAAyB,GAAG,EAAE,CAAC;IACrC,IAAI,MAAM,CAAC,aAAa,KAAK,MAAM,CAAC,cAAc,EAAE,CAAC;QACpD,uEAAuE;QACvE,IAAI,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC;QACvC,WAAW,GAAG,IAAI,CACjB,WAAW,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAC5C,CAAC,aAAa,EAAE,EAAE;YACjB,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;YACjF,CAAC;YACD,yBAAyB,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;YACjD,yBAAyB,CAAC,WAAW,CAAC,GAAG,aAAa,CAAC;YACvD,IAAI,WAAW,KAAK,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAC;YACb,CAAC;YACD,WAAW,GAAG,aAAa,CAAC,aAAa,CAAC;YAC1C,OAAO,kBAAkB,CAAC,WAAW,CAAC,CAAC;QACxC,CAAC,EACD,WAAW,CACX,CAAC;QAEF,6FAA6F;QAC7F,MAAM,qBAAqB,GAAG,EAAE,CAAC;QAEjC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CACnC,IAAI,CACH,WAAW,CAAC,kBAAkB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EACxD,CAAC,oBAAoB,EAAE,EAAE;YACxB,IAAI,oBAAoB,CAAC,cAAc,KAAK,oBAAoB,CAAC,aAAa,EAAE,CAAC;gBAChF,OAAO,IAAI,CAAC;YACb,CAAC;YACD,OAAO,WAAW,CAAC,kBAAkB,CAAC,oBAAoB,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAC9E,CAAC,YAAY,EAAE,EAAE;gBAChB,qBAAqB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBAC5C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAChC,MAAM,IAAI,KAAK,CACd,8DAA8D,CAC9D,CAAC;gBACH,CAAC;gBACD,OAAO,YAAY,CAAC;YACrB,CAAC,CACD,CAAC;QACH,CAAC,EACD,WAAW,CACX,CACD,CAAC;QAEF,iGAAiG;QACjG,uCAAuC;QAEvC,WAAW,GAAG,WAAW;aACvB,IAAI,CAAC,GAAG,EAAE;YACV,wDAAwD;YACxD,MAAM,SAAS,GACd,qBAAqB,CAAC,MAAM,GAAG,CAAC;gBAC/B,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,aAAa;gBACxC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YAE/C,oDAAoD;YACpD,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,CAAC;YACtC,OAAO,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,qBAAqB,EAAE,EAAE;YAC/B,IAAI,2CAA2C,GAAG,IAAI,wBAAS,CAAC,EAAE,CAAC,CAAC;YAEpE,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtC,KAAK,MAAM,CAAC,IAAI,qBAAqB,EAAE,CAAC;oBACvC,IAAI,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;oBAC5B,IAAI,yBAAyB,CAAC;oBAE9B,IACC,qBAAqB,CAAC,CAAC,CAAC,KAAK,SAAS;wBACtC,qBAAqB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EACvC,CAAC;wBACF,MAAM,cAAc,GAAG,IAAI,wBAAS,CACnC,IAAA,wBAAS,EAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAC7C,CAAC;wBACF,cAAc,CAAC,kBAAkB,EAAE,CAAC;wBACpC,cAAc,CAAC,cAAc,CAAC,2CAA2C,CAAC,CAAC;wBAC3E,yBAAyB,GAAG,IAAI,GAAG,EAAE,CAAC;wBACtC,MAAM,UAAU,GAAG,EAAE,CAAC;wBACtB,SAAS,GAAG,IAAA,wBAAS,EAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBAC1D,2CAA2C,CAAC,gBAAgB,CAC3D,SAAS,EACT,UAAU,EACV;4BACC,yBAAyB;yBACzB,CACD,CAAC;wBAEF,2CAA2C,GAAG,cAAc,CAAC;wBAC7D,qBAAqB,CAAC,KAAK,EAAE,CAAC;oBAC/B,CAAC;oBACD,2CAA2C,CAAC,cAAc,CAAC,SAAS,EAAE;wBACrE,yBAAyB;qBACzB,CAAC,CAAC;gBACJ,CAAC;gBAED,qGAAqG;gBACrG,kBAAkB,CACjB,2CAA2C,EAC3C,yBAAyB,CACzB,CAAC;YACH,CAAC;YAED,iGAAiG;YACjG,qBAAqB;YACrB,IAAI,yBAAyB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1C,yBAAyB,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;gBACpE,yBAAyB,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,MAAM,CAAC,cAAc,CAAC;YACpE,CAAC;QACF,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,WAAW;SAChB,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,iBAAiB,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,aAAa,EAAE,EAAE;QACvB,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,IACC,CAAC,IAAA,oBAAO,EACP,yBAAyB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EACtD,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC1C,EACA,CAAC;YACF,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;gBAC1C,IAAI,yBAAyB,GAC5B,yBAAyB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,SAAS;oBACzD,CAAC,CAAC,YAAY,CAAC,qBAAqB;oBACpC,CAAC,CAAC,SAAS,CAAC;gBAEd,IAAI,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC;gBACvC,IACC,yBAAyB,CAAC,CAAC,CAAC,KAAK,SAAS;oBAC1C,yBAAyB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,IAAI,EACtD,CAAC;oBACF,MAAM,cAAc,GAAG,IAAI,wBAAS,CACnC,IAAA,wBAAS,EAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CACjD,CAAC;oBACF,cAAc,CAAC,kBAAkB,EAAE,CAAC;oBACpC,cAAc,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;oBAEnD,yBAAyB,GAAG,IAAI,GAAG,EAAE,CAAC;oBACtC,SAAS,GAAG,IAAA,wBAAS,EAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAC9D,mBAAmB,CAAC,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE;wBAC1D,yBAAyB;qBACzB,CAAC,CAAC;oBAEH,uEAAuE;oBACvE,6DAA6D;oBAC7D,6DAA6D;oBAC7D,mBAAmB,GAAG,cAAc,CAAC;oBACrC,yBAAyB,CAAC,KAAK,EAAE,CAAC;gBACnC,CAAC;gBAED,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE;oBAC7C,yBAAyB;iBACzB,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,MAAM,CAAC,qBAAqB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,mBAAmB,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE;YACjE,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAhLD,sDAgLC;AAED,SAAS,kBAAkB,CAAC,aAAa,EAAE,eAAe;IACzD,IAAI,mBAAmB,GAAG,aAAa,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,eAAe,GAAG,IAAI,wBAAS,CAAC,IAAA,wBAAS,EAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QACnE,eAAe,CAAC,kBAAkB,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,CAAC,qBAAqB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,mBAAmB,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE;YACjE,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;QAEH,eAAe,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;QACpD,eAAe,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE;YAChD,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;QACH,mBAAmB,GAAG,eAAe,CAAC;IACvC,CAAC;AACF,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport { copy as cloneDeep } from \"fastest-json-copy\";\nimport isEqual from \"lodash/isEqual.js\";\n\nimport { ChangeSet } from \"./changeset.js\";\n\nclass SyncPromise {\n\tvalue: any;\n\n\tconstructor(x: { value: any }) {\n\t\tif (!(this instanceof SyncPromise)) {\n\t\t\treturn new SyncPromise(x);\n\t\t}\n\t\tif (x instanceof SyncPromise) {\n\t\t\tx = x.value;\n\t\t}\n\t\tthis.value = x;\n\t}\n\n\tthen(fn: (arg0: any) => { value: any }): SyncPromise {\n\t\tthis.value = new SyncPromise(fn(this.value)).value;\n\t\treturn this;\n\t}\n}\n\nconst loop = (\n\tpromise: Promise<any>,\n\tfn: { (currentChange: any): any; (currentRebasedChange: any): any },\n\tmakePromise: (arg0: any) => any,\n) =>\n\tpromise\n\t\t.then(fn)\n\t\t.then((result) => (result === null ? result : loop(makePromise(result), fn, makePromise)));\n\n/\n @internal\n */\nexport function rebaseToRemoteChanges(\n\tchange: any,\n\tgetUnrebasedChange: any,\n\tgetRebasedChanges: any,\n\tisAsync: boolean = false,\n) {\n\tconst makePromise = isAsync ? Promise.resolve.bind(Promise) : (x) => new SyncPromise(x);\n\tlet mainPromise = makePromise();\n\n\tconst commitsOnOtherLocalBranch = {};\n\tlet rebaseBaseChangeSet = new ChangeSet({});\n\tconst changesOnOtherLocalBranch = [];\n\tif (change.referenceGuid !== change.remoteHeadGuid) {\n\t\t// Extract all changes between the remoteHeadGuid and the referenceGuid\n\t\tlet currentGuid = change.referenceGuid;\n\t\tmainPromise = loop(\n\t\t\tmakePromise(getUnrebasedChange(currentGuid)),\n\t\t\t(currentChange) => {\n\t\t\t\tif (currentChange === undefined) {\n\t\t\t\t\tthrow new Error(\"Received change that references a non-existing parent change\");\n\t\t\t\t}\n\t\t\t\tchangesOnOtherLocalBranch.unshift(currentChange);\n\t\t\t\tcommitsOnOtherLocalBranch[currentGuid] = currentChange;\n\t\t\t\tif (currentGuid === change.localBranchStart) {\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t\tcurrentGuid = currentChange.referenceGuid;\n\t\t\t\treturn getUnrebasedChange(currentGuid);\n\t\t\t},\n\t\t\tmakePromise,\n\t\t);\n\n\t\t// Now we extract all changes until we arrive at a change that is relative to a remote change\n\t\tconst alreadyRebasedChanges = [];\n\n\t\tmainPromise = mainPromise.then(() =>\n\t\t\tloop(\n\t\t\t\tmakePromise(getUnrebasedChange(change.localBranchStart)),\n\t\t\t\t(currentRebasedChange) => {\n\t\t\t\t\tif (currentRebasedChange.remoteHeadGuid === currentRebasedChange.referenceGuid) {\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\treturn makePromise(getUnrebasedChange(currentRebasedChange.referenceGuid)).then(\n\t\t\t\t\t\t(rebaseChange) => {\n\t\t\t\t\t\t\talreadyRebasedChanges.unshift(rebaseChange);\n\t\t\t\t\t\t\tif (rebaseChange === undefined) {\n\t\t\t\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\t\t\t\"Received change that references a non-existing parent change\",\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn rebaseChange;\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t},\n\t\t\t\tmakePromise,\n\t\t\t),\n\t\t);\n\n\t\t// Compute the base Changeset to rebase the changes on the branch that was still the local branch\n\t\t// when the incoming change was created\n\n\t\tmainPromise = mainPromise\n\t\t\t.then(() => {\n\t\t\t\t// First invert all changes on the previous local branch\n\t\t\t\tconst startGuid =\n\t\t\t\t\talreadyRebasedChanges.length > 0\n\t\t\t\t\t\t? alreadyRebasedChanges[0].referenceGuid\n\t\t\t\t\t\t: changesOnOtherLocalBranch[0].referenceGuid;\n\n\t\t\t\t// Then apply all changes on the local remote branch\n\t\t\t\tconst endGuid = change.remoteHeadGuid;\n\t\t\t\treturn getRebasedChanges(startGuid, endGuid);\n\t\t\t})\n\t\t\t.then((relevantRemoteChanges) => {\n\t\t\t\tlet rebaseBaseChangeSetForAlreadyRebasedChanges = new ChangeSet({});\n\n\t\t\t\tif (relevantRemoteChanges.length > 0) {\n\t\t\t\t\tfor (const c of relevantRemoteChanges) {\n\t\t\t\t\t\tlet changeset = c.changeSet;\n\t\t\t\t\t\tlet applyAfterMetaInformation;\n\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\talreadyRebasedChanges[0] !== undefined &&\n\t\t\t\t\t\t\talreadyRebasedChanges[0].guid === c.guid\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tconst invertedChange = new ChangeSet(\n\t\t\t\t\t\t\t\tcloneDeep(alreadyRebasedChanges[0].changeSet),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\tinvertedChange.toInverseChangeSet();\n\t\t\t\t\t\t\tinvertedChange.applyChangeSet(rebaseBaseChangeSetForAlreadyRebasedChanges);\n\t\t\t\t\t\t\tapplyAfterMetaInformation = new Map();\n\t\t\t\t\t\t\tconst conflicts2 = [];\n\t\t\t\t\t\t\tchangeset = cloneDeep(alreadyRebasedChanges[0].changeSet);\n\t\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges._rebaseChangeSet(\n\t\t\t\t\t\t\t\tchangeset,\n\t\t\t\t\t\t\t\tconflicts2,\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t);\n\n\t\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges = invertedChange;\n\t\t\t\t\t\t\talreadyRebasedChanges.shift();\n\t\t\t\t\t\t}\n\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges.applyChangeSet(changeset, {\n\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\t\t// Now we have to rebase all changes from the remote local branch with respect to this base changeset\n\t\t\t\t\trebaseChangeArrays(\n\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges,\n\t\t\t\t\t\tchangesOnOtherLocalBranch,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\t// Update the reference for the rebased changes to indicate that they are now with respect to the\n\t\t\t\t// new remoteHeadGuid\n\t\t\t\tif (changesOnOtherLocalBranch.length > 0) {\n\t\t\t\t\tchangesOnOtherLocalBranch[0].remoteHeadGuid = change.remoteHeadGuid;\n\t\t\t\t\tchangesOnOtherLocalBranch[0].referenceGuid = change.remoteHeadGuid;\n\t\t\t\t}\n\t\t\t});\n\t}\n\n\treturn mainPromise\n\t\t.then(() => makePromise(getRebasedChanges(change.remoteHeadGuid)))\n\t\t.then((remoteChanges) => {\n\t\t\tconst conflicts = [];\n\t\t\tif (\n\t\t\t\t!isEqual(\n\t\t\t\t\tchangesOnOtherLocalBranch.map((change) => change.guid),\n\t\t\t\t\tremoteChanges.map((change) => change.guid),\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\tfor (const remoteChange of remoteChanges) {\n\t\t\t\t\tlet applyAfterMetaInformation =\n\t\t\t\t\t\tcommitsOnOtherLocalBranch[remoteChange.guid] !== undefined\n\t\t\t\t\t\t\t? remoteChange.rebaseMetaInformation\n\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\tlet changeset = remoteChange.changeSet;\n\t\t\t\t\tif (\n\t\t\t\t\t\tchangesOnOtherLocalBranch[0] !== undefined &&\n\t\t\t\t\t\tchangesOnOtherLocalBranch[0].guid === remoteChange.guid\n\t\t\t\t\t) {\n\t\t\t\t\t\tconst invertedChange = new ChangeSet(\n\t\t\t\t\t\t\tcloneDeep(changesOnOtherLocalBranch[0].changeSet),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tinvertedChange.toInverseChangeSet();\n\t\t\t\t\t\tinvertedChange.applyChangeSet(rebaseBaseChangeSet);\n\n\t\t\t\t\t\tapplyAfterMetaInformation = new Map();\n\t\t\t\t\t\tchangeset = cloneDeep(changesOnOtherLocalBranch[0].changeSet);\n\t\t\t\t\t\trebaseBaseChangeSet._rebaseChangeSet(changeset, conflicts, {\n\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\t// This is disabled for performance reasons. Only used during debugging\n\t\t\t\t\t\t// assert(isEqual(changeset,this.remoteChanges[i].changeSet),\n\t\t\t\t\t\t// \"Failed Rebase in rebaseToRemoteChanges\");\n\t\t\t\t\t\trebaseBaseChangeSet = invertedChange;\n\t\t\t\t\t\tchangesOnOtherLocalBranch.shift();\n\t\t\t\t\t}\n\n\t\t\t\t\trebaseBaseChangeSet.applyChangeSet(changeset, {\n\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchange.rebaseMetaInformation = new Map();\n\t\t\trebaseBaseChangeSet._rebaseChangeSet(change.changeSet, conflicts, {\n\t\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t\t});\n\t\t});\n}\n\nfunction rebaseChangeArrays(baseChangeSet, changesToRebase) {\n\tlet rebaseBaseChangeSet = baseChangeSet;\n\tfor (const change of changesToRebase) {\n\t\tconst copiedChangeSet = new ChangeSet(cloneDeep(change.changeSet));\n\t\tcopiedChangeSet.toInverseChangeSet();\n\n\t\tconst conflicts = [];\n\t\tchange.rebaseMetaInformation = new Map();\n\t\trebaseBaseChangeSet._rebaseChangeSet(change.changeSet, conflicts, {\n\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t});\n\n\t\tcopiedChangeSet.applyChangeSet(rebaseBaseChangeSet);\n\t\tcopiedChangeSet.applyChangeSet(change.changeSet, {\n\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t});\n\t\trebaseBaseChangeSet = copiedChangeSet;\n\t}\n}\n"]}
1	+ {"version":3,"file":"rebase.js","sourceRoot":"","sources":["../src/rebase.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH,uEAA4C;AAC5C,mEAAwC;AAExC,iDAA2C;AAE3C,MAAM,WAAW;IAGhB,YAAY,CAAiB;QAC5B,IAAI,CAAC,CAAC,IAAI,YAAY,WAAW,CAAC,EAAE,CAAC;YACpC,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,CAAC,YAAY,WAAW,EAAE,CAAC;YAC9B,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;QACb,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IAChB,CAAC;IAED,IAAI,CAAC,EAAiC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;QACnD,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED,MAAM,IAAI,GAAG,CACZ,OAAqB,EACrB,EAAmE,EACnE,WAA+B,EAC9B,EAAE,CACH,OAAO;KACL,IAAI,CAAC,EAAE,CAAC;KACR,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;AAE7F;;GAEG;AACH,SAAgB,qBAAqB,CACpC,MAAW,EACX,kBAAuB,EACvB,iBAAsB,EACtB,UAAmB,KAAK;IAExB,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IACxF,IAAI,WAAW,GAAG,WAAW,EAAE,CAAC;IAEhC,MAAM,yBAAyB,GAAG,EAAE,CAAC;IACrC,IAAI,mBAAmB,GAAG,IAAI,wBAAS,CAAC,EAAE,CAAC,CAAC;IAC5C,MAAM,yBAAyB,GAAG,EAAE,CAAC;IACrC,IAAI,MAAM,CAAC,aAAa,KAAK,MAAM,CAAC,cAAc,EAAE,CAAC;QACpD,uEAAuE;QACvE,IAAI,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC;QACvC,WAAW,GAAG,IAAI,CACjB,WAAW,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,EAC5C,CAAC,aAAa,EAAE,EAAE;YACjB,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;gBACjC,MAAM,IAAI,KAAK,CAAC,8DAA8D,CAAC,CAAC;YACjF,CAAC;YACD,yBAAyB,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;YACjD,yBAAyB,CAAC,WAAW,CAAC,GAAG,aAAa,CAAC;YACvD,IAAI,WAAW,KAAK,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC7C,OAAO,IAAI,CAAC;YACb,CAAC;YACD,WAAW,GAAG,aAAa,CAAC,aAAa,CAAC;YAC1C,OAAO,kBAAkB,CAAC,WAAW,CAAC,CAAC;QACxC,CAAC,EACD,WAAW,CACX,CAAC;QAEF,6FAA6F;QAC7F,MAAM,qBAAqB,GAAG,EAAE,CAAC;QAEjC,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,GAAG,EAAE,CACnC,IAAI,CACH,WAAW,CAAC,kBAAkB,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,EACxD,CAAC,oBAAoB,EAAE,EAAE;YACxB,IAAI,oBAAoB,CAAC,cAAc,KAAK,oBAAoB,CAAC,aAAa,EAAE,CAAC;gBAChF,OAAO,IAAI,CAAC;YACb,CAAC;YACD,OAAO,WAAW,CAAC,kBAAkB,CAAC,oBAAoB,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAC9E,CAAC,YAAY,EAAE,EAAE;gBAChB,qBAAqB,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;gBAC5C,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;oBAChC,MAAM,IAAI,KAAK,CACd,8DAA8D,CAC9D,CAAC;gBACH,CAAC;gBACD,OAAO,YAAY,CAAC;YACrB,CAAC,CACD,CAAC;QACH,CAAC,EACD,WAAW,CACX,CACD,CAAC;QAEF,iGAAiG;QACjG,uCAAuC;QAEvC,WAAW,GAAG,WAAW;aACvB,IAAI,CAAC,GAAG,EAAE;YACV,wDAAwD;YACxD,MAAM,SAAS,GACd,qBAAqB,CAAC,MAAM,GAAG,CAAC;gBAC/B,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,aAAa;gBACxC,CAAC,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;YAE/C,oDAAoD;YACpD,MAAM,OAAO,GAAG,MAAM,CAAC,cAAc,CAAC;YACtC,OAAO,iBAAiB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,qBAAqB,EAAE,EAAE;YAC/B,IAAI,2CAA2C,GAAG,IAAI,wBAAS,CAAC,EAAE,CAAC,CAAC;YAEpE,IAAI,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtC,KAAK,MAAM,CAAC,IAAI,qBAAqB,EAAE,CAAC;oBACvC,IAAI,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC;oBAC5B,IAAI,yBAAyB,CAAC;oBAE9B,IACC,qBAAqB,CAAC,CAAC,CAAC,KAAK,SAAS;wBACtC,qBAAqB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EACvC,CAAC;wBACF,MAAM,cAAc,GAAG,IAAI,wBAAS,CACnC,IAAA,sBAAS,EAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAC7C,CAAC;wBACF,cAAc,CAAC,kBAAkB,EAAE,CAAC;wBACpC,cAAc,CAAC,cAAc,CAAC,2CAA2C,CAAC,CAAC;wBAC3E,yBAAyB,GAAG,IAAI,GAAG,EAAE,CAAC;wBACtC,MAAM,UAAU,GAAG,EAAE,CAAC;wBACtB,SAAS,GAAG,IAAA,sBAAS,EAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;wBAC1D,2CAA2C,CAAC,gBAAgB,CAC3D,SAAS,EACT,UAAU,EACV;4BACC,yBAAyB;yBACzB,CACD,CAAC;wBAEF,2CAA2C,GAAG,cAAc,CAAC;wBAC7D,qBAAqB,CAAC,KAAK,EAAE,CAAC;oBAC/B,CAAC;oBACD,2CAA2C,CAAC,cAAc,CAAC,SAAS,EAAE;wBACrE,yBAAyB;qBACzB,CAAC,CAAC;gBACJ,CAAC;gBAED,qGAAqG;gBACrG,kBAAkB,CACjB,2CAA2C,EAC3C,yBAAyB,CACzB,CAAC;YACH,CAAC;YAED,iGAAiG;YACjG,qBAAqB;YACrB,IAAI,yBAAyB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1C,yBAAyB,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,CAAC;gBACpE,yBAAyB,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,MAAM,CAAC,cAAc,CAAC;YACpE,CAAC;QACF,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,WAAW;SAChB,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,iBAAiB,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;SACjE,IAAI,CAAC,CAAC,aAAa,EAAE,EAAE;QACvB,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,IACC,CAAC,IAAA,oBAAO,EACP,yBAAyB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EACtD,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAC1C,EACA,CAAC;YACF,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;gBAC1C,IAAI,yBAAyB,GAC5B,yBAAyB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,SAAS;oBACzD,CAAC,CAAC,YAAY,CAAC,qBAAqB;oBACpC,CAAC,CAAC,SAAS,CAAC;gBAEd,IAAI,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC;gBACvC,IACC,yBAAyB,CAAC,CAAC,CAAC,KAAK,SAAS;oBAC1C,yBAAyB,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,IAAI,EACtD,CAAC;oBACF,MAAM,cAAc,GAAG,IAAI,wBAAS,CACnC,IAAA,sBAAS,EAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CACjD,CAAC;oBACF,cAAc,CAAC,kBAAkB,EAAE,CAAC;oBACpC,cAAc,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;oBAEnD,yBAAyB,GAAG,IAAI,GAAG,EAAE,CAAC;oBACtC,SAAS,GAAG,IAAA,sBAAS,EAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAC9D,mBAAmB,CAAC,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE;wBAC1D,yBAAyB;qBACzB,CAAC,CAAC;oBAEH,uEAAuE;oBACvE,6DAA6D;oBAC7D,6DAA6D;oBAC7D,mBAAmB,GAAG,cAAc,CAAC;oBACrC,yBAAyB,CAAC,KAAK,EAAE,CAAC;gBACnC,CAAC;gBAED,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE;oBAC7C,yBAAyB;iBACzB,CAAC,CAAC;YACJ,CAAC;QACF,CAAC;QAED,MAAM,CAAC,qBAAqB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,mBAAmB,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE;YACjE,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAhLD,sDAgLC;AAED,SAAS,kBAAkB,CAAC,aAAa,EAAE,eAAe;IACzD,IAAI,mBAAmB,GAAG,aAAa,CAAC;IACxC,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,eAAe,GAAG,IAAI,wBAAS,CAAC,IAAA,sBAAS,EAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QACnE,eAAe,CAAC,kBAAkB,EAAE,CAAC;QAErC,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,CAAC,qBAAqB,GAAG,IAAI,GAAG,EAAE,CAAC;QACzC,mBAAmB,CAAC,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE;YACjE,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;QAEH,eAAe,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;QACpD,eAAe,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE;YAChD,yBAAyB,EAAE,MAAM,CAAC,qBAAqB;SACvD,CAAC,CAAC;QACH,mBAAmB,GAAG,eAAe,CAAC;IACvC,CAAC;AACF,CAAC","sourcesContent":["/!\n Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n /\n\nimport cloneDeep from \"lodash/cloneDeep.js\";\nimport isEqual from \"lodash/isEqual.js\";\n\nimport { ChangeSet } from \"./changeset.js\";\n\nclass SyncPromise {\n\tvalue: any;\n\n\tconstructor(x: { value: any }) {\n\t\tif (!(this instanceof SyncPromise)) {\n\t\t\treturn new SyncPromise(x);\n\t\t}\n\t\tif (x instanceof SyncPromise) {\n\t\t\tx = x.value;\n\t\t}\n\t\tthis.value = x;\n\t}\n\n\tthen(fn: (arg0: any) => { value: any }): SyncPromise {\n\t\tthis.value = new SyncPromise(fn(this.value)).value;\n\t\treturn this;\n\t}\n}\n\nconst loop = (\n\tpromise: Promise<any>,\n\tfn: { (currentChange: any): any; (currentRebasedChange: any): any },\n\tmakePromise: (arg0: any) => any,\n) =>\n\tpromise\n\t\t.then(fn)\n\t\t.then((result) => (result === null ? result : loop(makePromise(result), fn, makePromise)));\n\n/\n @internal\n */\nexport function rebaseToRemoteChanges(\n\tchange: any,\n\tgetUnrebasedChange: any,\n\tgetRebasedChanges: any,\n\tisAsync: boolean = false,\n) {\n\tconst makePromise = isAsync ? Promise.resolve.bind(Promise) : (x) => new SyncPromise(x);\n\tlet mainPromise = makePromise();\n\n\tconst commitsOnOtherLocalBranch = {};\n\tlet rebaseBaseChangeSet = new ChangeSet({});\n\tconst changesOnOtherLocalBranch = [];\n\tif (change.referenceGuid !== change.remoteHeadGuid) {\n\t\t// Extract all changes between the remoteHeadGuid and the referenceGuid\n\t\tlet currentGuid = change.referenceGuid;\n\t\tmainPromise = loop(\n\t\t\tmakePromise(getUnrebasedChange(currentGuid)),\n\t\t\t(currentChange) => {\n\t\t\t\tif (currentChange === undefined) {\n\t\t\t\t\tthrow new Error(\"Received change that references a non-existing parent change\");\n\t\t\t\t}\n\t\t\t\tchangesOnOtherLocalBranch.unshift(currentChange);\n\t\t\t\tcommitsOnOtherLocalBranch[currentGuid] = currentChange;\n\t\t\t\tif (currentGuid === change.localBranchStart) {\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t\tcurrentGuid = currentChange.referenceGuid;\n\t\t\t\treturn getUnrebasedChange(currentGuid);\n\t\t\t},\n\t\t\tmakePromise,\n\t\t);\n\n\t\t// Now we extract all changes until we arrive at a change that is relative to a remote change\n\t\tconst alreadyRebasedChanges = [];\n\n\t\tmainPromise = mainPromise.then(() =>\n\t\t\tloop(\n\t\t\t\tmakePromise(getUnrebasedChange(change.localBranchStart)),\n\t\t\t\t(currentRebasedChange) => {\n\t\t\t\t\tif (currentRebasedChange.remoteHeadGuid === currentRebasedChange.referenceGuid) {\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t\treturn makePromise(getUnrebasedChange(currentRebasedChange.referenceGuid)).then(\n\t\t\t\t\t\t(rebaseChange) => {\n\t\t\t\t\t\t\talreadyRebasedChanges.unshift(rebaseChange);\n\t\t\t\t\t\t\tif (rebaseChange === undefined) {\n\t\t\t\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\t\t\t\"Received change that references a non-existing parent change\",\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn rebaseChange;\n\t\t\t\t\t\t},\n\t\t\t\t\t);\n\t\t\t\t},\n\t\t\t\tmakePromise,\n\t\t\t),\n\t\t);\n\n\t\t// Compute the base Changeset to rebase the changes on the branch that was still the local branch\n\t\t// when the incoming change was created\n\n\t\tmainPromise = mainPromise\n\t\t\t.then(() => {\n\t\t\t\t// First invert all changes on the previous local branch\n\t\t\t\tconst startGuid =\n\t\t\t\t\talreadyRebasedChanges.length > 0\n\t\t\t\t\t\t? alreadyRebasedChanges[0].referenceGuid\n\t\t\t\t\t\t: changesOnOtherLocalBranch[0].referenceGuid;\n\n\t\t\t\t// Then apply all changes on the local remote branch\n\t\t\t\tconst endGuid = change.remoteHeadGuid;\n\t\t\t\treturn getRebasedChanges(startGuid, endGuid);\n\t\t\t})\n\t\t\t.then((relevantRemoteChanges) => {\n\t\t\t\tlet rebaseBaseChangeSetForAlreadyRebasedChanges = new ChangeSet({});\n\n\t\t\t\tif (relevantRemoteChanges.length > 0) {\n\t\t\t\t\tfor (const c of relevantRemoteChanges) {\n\t\t\t\t\t\tlet changeset = c.changeSet;\n\t\t\t\t\t\tlet applyAfterMetaInformation;\n\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\talreadyRebasedChanges[0] !== undefined &&\n\t\t\t\t\t\t\talreadyRebasedChanges[0].guid === c.guid\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\tconst invertedChange = new ChangeSet(\n\t\t\t\t\t\t\t\tcloneDeep(alreadyRebasedChanges[0].changeSet),\n\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\tinvertedChange.toInverseChangeSet();\n\t\t\t\t\t\t\tinvertedChange.applyChangeSet(rebaseBaseChangeSetForAlreadyRebasedChanges);\n\t\t\t\t\t\t\tapplyAfterMetaInformation = new Map();\n\t\t\t\t\t\t\tconst conflicts2 = [];\n\t\t\t\t\t\t\tchangeset = cloneDeep(alreadyRebasedChanges[0].changeSet);\n\t\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges._rebaseChangeSet(\n\t\t\t\t\t\t\t\tchangeset,\n\t\t\t\t\t\t\t\tconflicts2,\n\t\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t);\n\n\t\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges = invertedChange;\n\t\t\t\t\t\t\talreadyRebasedChanges.shift();\n\t\t\t\t\t\t}\n\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges.applyChangeSet(changeset, {\n\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\n\t\t\t\t\t// Now we have to rebase all changes from the remote local branch with respect to this base changeset\n\t\t\t\t\trebaseChangeArrays(\n\t\t\t\t\t\trebaseBaseChangeSetForAlreadyRebasedChanges,\n\t\t\t\t\t\tchangesOnOtherLocalBranch,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\t// Update the reference for the rebased changes to indicate that they are now with respect to the\n\t\t\t\t// new remoteHeadGuid\n\t\t\t\tif (changesOnOtherLocalBranch.length > 0) {\n\t\t\t\t\tchangesOnOtherLocalBranch[0].remoteHeadGuid = change.remoteHeadGuid;\n\t\t\t\t\tchangesOnOtherLocalBranch[0].referenceGuid = change.remoteHeadGuid;\n\t\t\t\t}\n\t\t\t});\n\t}\n\n\treturn mainPromise\n\t\t.then(() => makePromise(getRebasedChanges(change.remoteHeadGuid)))\n\t\t.then((remoteChanges) => {\n\t\t\tconst conflicts = [];\n\t\t\tif (\n\t\t\t\t!isEqual(\n\t\t\t\t\tchangesOnOtherLocalBranch.map((change) => change.guid),\n\t\t\t\t\tremoteChanges.map((change) => change.guid),\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\tfor (const remoteChange of remoteChanges) {\n\t\t\t\t\tlet applyAfterMetaInformation =\n\t\t\t\t\t\tcommitsOnOtherLocalBranch[remoteChange.guid] !== undefined\n\t\t\t\t\t\t\t? remoteChange.rebaseMetaInformation\n\t\t\t\t\t\t\t: undefined;\n\n\t\t\t\t\tlet changeset = remoteChange.changeSet;\n\t\t\t\t\tif (\n\t\t\t\t\t\tchangesOnOtherLocalBranch[0] !== undefined &&\n\t\t\t\t\t\tchangesOnOtherLocalBranch[0].guid === remoteChange.guid\n\t\t\t\t\t) {\n\t\t\t\t\t\tconst invertedChange = new ChangeSet(\n\t\t\t\t\t\t\tcloneDeep(changesOnOtherLocalBranch[0].changeSet),\n\t\t\t\t\t\t);\n\t\t\t\t\t\tinvertedChange.toInverseChangeSet();\n\t\t\t\t\t\tinvertedChange.applyChangeSet(rebaseBaseChangeSet);\n\n\t\t\t\t\t\tapplyAfterMetaInformation = new Map();\n\t\t\t\t\t\tchangeset = cloneDeep(changesOnOtherLocalBranch[0].changeSet);\n\t\t\t\t\t\trebaseBaseChangeSet._rebaseChangeSet(changeset, conflicts, {\n\t\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t\t});\n\n\t\t\t\t\t\t// This is disabled for performance reasons. Only used during debugging\n\t\t\t\t\t\t// assert(isEqual(changeset,this.remoteChanges[i].changeSet),\n\t\t\t\t\t\t// \"Failed Rebase in rebaseToRemoteChanges\");\n\t\t\t\t\t\trebaseBaseChangeSet = invertedChange;\n\t\t\t\t\t\tchangesOnOtherLocalBranch.shift();\n\t\t\t\t\t}\n\n\t\t\t\t\trebaseBaseChangeSet.applyChangeSet(changeset, {\n\t\t\t\t\t\tapplyAfterMetaInformation,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tchange.rebaseMetaInformation = new Map();\n\t\t\trebaseBaseChangeSet._rebaseChangeSet(change.changeSet, conflicts, {\n\t\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t\t});\n\t\t});\n}\n\nfunction rebaseChangeArrays(baseChangeSet, changesToRebase) {\n\tlet rebaseBaseChangeSet = baseChangeSet;\n\tfor (const change of changesToRebase) {\n\t\tconst copiedChangeSet = new ChangeSet(cloneDeep(change.changeSet));\n\t\tcopiedChangeSet.toInverseChangeSet();\n\n\t\tconst conflicts = [];\n\t\tchange.rebaseMetaInformation = new Map();\n\t\trebaseBaseChangeSet._rebaseChangeSet(change.changeSet, conflicts, {\n\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t});\n\n\t\tcopiedChangeSet.applyChangeSet(rebaseBaseChangeSet);\n\t\tcopiedChangeSet.applyChangeSet(change.changeSet, {\n\t\t\tapplyAfterMetaInformation: change.rebaseMetaInformation,\n\t\t});\n\t\trebaseBaseChangeSet = copiedChangeSet;\n\t}\n}\n"]}

package/dist/templateValidator.js CHANGED Viewed

@@ -17,7 +17,7 @@ exports.TemplateValidator = void 0;
 /* eslint-disable jsdoc/check-line-alignment */
 const property_common_1 = require("@fluid-experimental/property-common");
 const async_1 = require("async");
-const fastest_json_copy_1 = require("fastest-json-copy");
+const cloneDeep_js_1 = __importDefault(require("lodash/cloneDeep.js"));
 const difference_js_1 = __importDefault(require("lodash/difference.js"));
 const each_js_1 = __importDefault(require("lodash/each.js"));
 const every_js_1 = __importDefault(require("lodash/every.js"));
@@ -716,7 +716,7 @@ const _processValidationResults = function (in_template) {
                     break;
             }
             // Deep-copy for thread-safety.
-            that._resultBuilder.addError((0, fastest_json_copy_1.copy)(error));
+            that._resultBuilder.addError((0, cloneDeep_js_1.default)(error));
         });
     }
     result.unresolvedTypes = _unresolvedTypes.call(this, in_template);