@fluid-experimental/property-changeset 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/dist/changeset_operations/indexedCollection.js.map

@@ -1 +1 @@
-{"version":3,"file":"indexedCollection.js","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;;;;AAEH,yDAAsD;AACtD,6DAAqC;AACrC,6DAAqC;AACrC,+DAAuC;AACvC,6DAAqC;AACrC,+DAAuC;AAEvC,aAAa;AACb,yEAA2E;AAE3E,0DAAuD;AACvD,8CAA2C;AAC3C,qEAAwD;AACxD,yDAAsD;AAEtD,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,kBAAQ,EAAC,SAAS,CAAC,EAAE;QACnE,OAAO,IAAA,iBAAO,EAAC,SAAS,CAAC,CAAC;KAC1B;IAED,8DAA8D;IAC9D,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE;QAC/B,OAAO,KAAK,CAAC;KACb;IAED,OAAO,IAAI,CAAC;AACb,CAAC,CAAC;AAEF,2DAA2D;AAC3D,IAAiB,mCAAmC,CAw2BnD;AAx2BD,WAAiB,mCAAmC;IACnD;;;;;;;;;;;;;OAaG;IACU,iFAA6C,GAAG,UAC5D,sBAA2C,EAC3C,yBAA8C,EAC9C,SAAiB,EACjB,UAAiC;QAEjC,MAAM,iBAAiB,GAAG,2BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YACrC,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;gBACnC,IAAI,iBAAiB,EAAE;oBACtB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAC7C;qBAAM;oBACN,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;wBAC7C,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;4BAC5C,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;gCACD,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,iBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oCAC3D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;iCACrC;6BACD;iCAAM;gCACN,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;oCACD,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,iBAAO,EAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wCAC3D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qCACrC;iCACD;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;oCAC/B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCACjC;qCAAM;oCACN,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;wCAClC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;qCAClC;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;iCACjD;6BACD;yBACD;qBACD;oBACD,IAAI,GAAG,IAAI,CAAC;iBACZ;aACD;YAED,IAAI,CAAC,IAAI,EAAE;gBACV,IAAI,iBAAiB,EAAE;oBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC/C,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACpC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;yBACzB;6BAAM;4BACN,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACpD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;6BACzB;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BACtB;iCAAM;gCACN,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BACzD;yBACD;qBACD;iBACD;qBAAM;oBACN,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;wBAC/C,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;4BACpD,IACC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtD;gCACD,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;6BACN;yBACD;wBAED,IAAI,aAAa,EAAE;4BAClB,uFAAuF;4BACvF,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;4BAExC,+DAA+D;4BAC/D,yDAAyD;4BACzD,IAAI,YAAY,IAAI,IAAA,iBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACzD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACnC;4BACD,IAAI,YAAY,IAAI,IAAA,iBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACzD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACnC;yBACD;6BAAM;4BACN,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;gCACpD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;oCAC9C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;iCACN;6BACD;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBACtB;qBACD;iBACD;aACD;SACD;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE;YACrC,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;gBAChD,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;oBAChB,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;iBAClE;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC7C,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,kBAAQ,EAAC,SAAS,CAAC;wBACnB,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,EAC3B;wBACD,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;4BACjD,aAAa,GAAG,IAAA,iBAAO,EACtB,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CACrB,CAAC;yBACF;wBAED,8EAA8E;wBAC9E,MAAM,aAAa,GAAG,IAAA,kBAAQ,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC;4BACnD,CAAC,CAAC,IAAA,iBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACzC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;wBACxB,MAAM,YAAY,GAAG,IAAA,kBAAQ,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC;4BAC5C,CAAC,CAAC,IAAA,iBAAO,EAAC,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;4BACnC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBAClB,aAAa,GAAG,aAAa,IAAI,IAAA,iBAAO,EAAC,aAAa,EAAE,YAAY,CAAC,CAAC;qBACtE;oBAED,IACC,CAAC,iBAAiB;wBACjB,2BAAY,CAAC,eAAe,CAAC,MAAM,CAAC;wBACpC,aAAa,CAAC;wBACf,SAAS;wBACT,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,IAAA,kBAAQ,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC;4BACxD,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAC7B;wBACD,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;4BAC7B,IAAI,iBAAiB,EAAE;gCACtB,sBAAsB,CAAC,MAAM,GAAG,IAAA,iBAAO,EACtC,sBAAsB,CAAC,MAAM,EAC7B,GAAG,CACH,CAAC;6BACF;iCAAM;gCACN,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAA,iBAAO,EAC9C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EACrC,GAAG,CACH,CAAC;6BACF;yBACD;6BAAM;4BACN,eAAe;gCACd,aAAa,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC1D,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;yBACtB;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE;4BACrB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE;gCACtB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;6BAC1D;iCAAM;gCACN,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,EACrD,eAAe,CAAC,GAAG,CAAC,CACpB,CAAC;6BACF;yBACD;qBACD;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBAChE,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;qBACzC;yBAAM,IACN,CAAC,iBAAiB;wBAClB,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EACjE;wBACD,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;qBAC5D;yBAAM;wBACN,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;qBAClD;iBACD;aACD;SACD;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YACrC,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;gBAChD,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;oBAC3C,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE;wBACtB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BACjD,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC1B;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACpC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;yBAC7B;6BAAM;4BACN,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCACnE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;6BACnC;iCAAM;gCACN,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;6BAC7B;yBACD;qBACD;yBAAM;wBACN,iFAAiF;wBACjF,kBAAkB;wBAClB,MAAM,oBAAoB,GAAG,2BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;wBAElE,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACpE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAChD,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCACjD,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;iCAC9C;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC9C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;iCAC5B;gCAED,IACC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;oCACzB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAChD;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;iCAC3C;qCAAM;oCACN,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;iCACrC;6BACD;iCAAM;gCACN,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CACV,CAAC;6BACF;yBACD;6BAAM,IACN,YAAY,CAAC,MAAM,CAAC;4BACpB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtC;4BACD,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAChD,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC9C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wCACrD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qCAC9B;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;iCAC/C;qCAAM;oCACN,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iCACzD;6BACD;iCAAM;gCACN,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CACV,CAAC;6BACF;yBACD;6BAAM;4BACN,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;yBACpE;qBACD;iBACD;aACD;SACD;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,2BAAY,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;gBAChC,OAAO;aACP;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;gBACrC,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;oBACpB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;iBACjE;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE;oBAChC,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;wBACvD,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;iBACtB;aACD;QACF,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAC7B,aAAa,EACb,mBAAmB,EACnB,eAAe;YAEf,IAAI,aAAa,KAAK,SAAS,EAAE;gBAChC,OAAO;aACP;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;gBAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;aAChF;QACF,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE;YAClD,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;SAC5D;aAAM;YACN,IAAI,iBAAiB,EAAE;gBACtB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC5D;iBAAM;gBACN,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aACvE;SACD;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YACrD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACjE;aAAM;YACN,IAAI,iBAAiB,EAAE;gBACtB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aACjE;iBAAM;gBACN,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aAC5E;SACD;QAED,IAAI,iBAAiB,EAAE;YACtB,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;SACjE;aAAM;YACN,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;SAC5E;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;YAC5C,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,0BAA0B;gBACzC,CAAC,CAAC,GAAG,WAAW,IAAI,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG;gBAC/D,CAAC,CAAC,IAAA,2BAAS,EACT,WAAW,EACX,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,EACxC,uBAAuB,CACtB,CAAC;YAEL,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE;gBAC3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+Bc;gBAEd,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACrE,IACC,iBAAiB;wBACjB,CAAC,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC;4BACpD,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EACpC;wBACD,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;4BAC7B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;yBACxD;wBAED,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,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;4BACrE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC1B;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IACC,OAAO,WAAW,KAAK,QAAQ;4BAC/B,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAClC;4BACD,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;yBAChC;wBACD,IACC,YAAY,CAAC,SAAS,KAAK,OAAO;4BAClC,YAAY,CAAC,SAAS,KAAK,QAAQ;4BACnC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACpB;4BACD,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE;gCACrE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC1B;yBACD;6BAAM;4BACN,IAAI,QAAQ,KAAK,WAAW,EAAE;gCAC7B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC1B;yBACD;qBACD;yBAAM;wBACN,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;qBACF;iBACD;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAC5E,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,qCAAY,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;iBACtB;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,QAAQ,EAC9B;oBACD,IAAI,CAAC,iBAAiB,EAAE;wBACvB,2FAA2F;wBAC3F,2FAA2F;wBAC3F,sFAAsF;wBACtF,yBAAyB;wBAEzB,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACd,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,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;qBACxE;iBACD;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;oBACD,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAClC,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,qCAAY,CAAC,mBAAmB;4BACtC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACjC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBAC7B;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;4BACrD,0BAA0B,CAAC,MAAM,GAAG,IAAA,iBAAO,EAC1C,0BAA0B,CAAC,MAAM,EACjC,GAAG,CACH,CAAC;yBACF;6BAAM;4BACN,IAAI,iBAAiB,EAAE;gCACtB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BAC9C;iCAAM;gCACN,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CACjE,GAAG,CACH,CAAC;6BACF;yBACD;qBACD;iBACD;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAC5E,IAAI,iBAAiB,IAAI,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE;wBAC9E,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,qCAAY,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;4BAC7B,0BAA0B,CAAC,MAAM;gCAChC,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BACzC,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;yBACvE;6BAAM;4BACN,0BAA0B,CAAC,MAAM;gCAChC,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BACzC,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;yBAC/C;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACtB;yBAAM;wBACN,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,qCAAY,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;qBACtB;iBACD;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,eAAe,EACrC;oBACD,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,qCAAY,CAAC,aAAa;wBAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACjC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAC7B;qBAAM;oBACN,kGAAkG;oBAClG,qBAAqB;oBAErB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACd,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,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;wBACpC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;4BAC3C,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CACpD,YAAY,CAAC,WAAW,CACxB,CAAC,GAAG,CAAC,CAAC;yBACP;6BAAM;4BACN,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3D;qBACD;yBAAM;wBACN,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE;4BAClE,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAA,iBAAO,EACvD,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAC9C,GAAG,CACH,CAAC;yBACF;6BAAM;4BACN,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3D;qBACD;oBAED,OAAO,CAAC,KAAK,CACZ,yEAAyE,CACzE,CAAC;iBACF;aACD;SACD;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;YACvB,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;gBAC3C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACvB,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;gBAC3C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACvB,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;gBAC3C,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;oBAC3C,IAAI,IAAA,mCAAgB,EAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC9C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC/B;iBACD;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;IACF,CAAC,CAAC;AACH,CAAC,EAx2BgB,mCAAmC,mDAAnC,mCAAmC,QAw2BnD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Helper functions and classes to work with ChangeSets with indexed collections (sets and maps)\n */\n\nimport { copy as cloneDeep } from \"fastest-json-copy\";\nimport isEmpty from \"lodash/isEmpty\";\nimport isEqual from \"lodash/isEqual\";\nimport isObject from \"lodash/isObject\";\nimport without from \"lodash/without\";\nimport includes from \"lodash/includes\";\n\n// @ts-ignore\nimport { constants, joinPaths } from \"@fluid-experimental/property-common\";\nimport { ApplyChangeSetOptions, ConflictInfo, SerializedChangeSet } from \"../changeset\";\nimport { TypeIdHelper } from \"../helpers/typeidHelper\";\nimport { PathHelper } from \"../pathHelper\";\nimport { ConflictType } from \"./changesetConflictTypes\";\nimport { isEmptyChangeSet } from \"./isEmptyChangeset\";\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(\n\t\t\t\t\t\t\t\tinsertedEntries[key].insert,\n\t\t\t\t\t\t\t\tremovalCS[key].remove,\n\t\t\t\t\t\t\t);\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 ||\n\t\t\t\t\t\t\tTypeIdHelper.isPrimitiveType(typeid) ||\n\t\t\t\t\t\t\tdeeplyEqualCS) &&\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(\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.remove,\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} 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 =\n\t\t\t\t\t\t\t\tdeeplyEqualCS || 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(\n\t\t\t\t\t\t\t\t\tinsertedEntries[key],\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} 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 (\n\t\t\t\t\t\t\tbaseModified[typeid] &&\n\t\t\t\t\t\t\tbaseModified[typeid][key] !== undefined\n\t\t\t\t\t\t) {\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)\n\t\t\t\t\t\t? key\n\t\t\t\t\t\t: 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  );\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 (\n\t\t\t\t\t\t\ttypeof rebaseValue === \"object\" &&\n\t\t\t\t\t\t\trebaseValue.hasOwnProperty(\"value\")\n\t\t\t\t\t\t) {\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 (\n\t\t\t\t\tmodification.own === \"remove_insert\" &&\n\t\t\t\t\tmodification.other === \"modify\"\n\t\t\t\t) {\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][\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}\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 =\n\t\t\t\t\t\t\t\tio_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 =\n\t\t\t\t\t\t\t\tio_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][\n\t\t\t\t\t\t\t\tmodification.otherTypeid\n\t\t\t\t\t\t\t][key];\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"]}
+{"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;QACnE,OAAO,IAAA,oBAAO,EAAC,SAAS,CAAC,CAAC;KAC1B;IAED,8DAA8D;IAC9D,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE;QAC/B,OAAO,KAAK,CAAC;KACb;IAED,OAAO,IAAI,CAAC;AACb,CAAC,CAAC;AAEF,2DAA2D;AAC3D,IAAiB,mCAAmC,CAw2BnD;AAx2BD,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;YACrC,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;gBACnC,IAAI,iBAAiB,EAAE;oBACtB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAC7C;qBAAM;oBACN,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;wBAC7C,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;4BAC5C,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;gCACD,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;oCAC3D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;iCACrC;6BACD;iCAAM;gCACN,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;oCACD,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;wCAC3D,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qCACrC;iCACD;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;oCAC/B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCACjC;qCAAM;oCACN,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;wCAClC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;qCAClC;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;iCACjD;6BACD;yBACD;qBACD;oBACD,IAAI,GAAG,IAAI,CAAC;iBACZ;aACD;YAED,IAAI,CAAC,IAAI,EAAE;gBACV,IAAI,iBAAiB,EAAE;oBACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC/C,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACpC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;yBACzB;6BAAM;4BACN,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACpD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;6BACzB;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC/B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BACtB;iCAAM;gCACN,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BACzD;yBACD;qBACD;iBACD;qBAAM;oBACN,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;wBAC/C,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;4BACpD,IACC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtD;gCACD,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;6BACN;yBACD;wBAED,IAAI,aAAa,EAAE;4BAClB,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;gCACzD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACnC;4BACD,IAAI,YAAY,IAAI,IAAA,oBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACzD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACnC;yBACD;6BAAM;4BACN,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;gCACpD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;oCAC9C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;iCACN;6BACD;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBACtB;qBACD;iBACD;aACD;SACD;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE;YACrC,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;gBAChD,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;oBAChB,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;iBAClE;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC7C,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;wBACD,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;4BACjD,aAAa,GAAG,IAAA,oBAAO,EACtB,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CACrB,CAAC;yBACF;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;qBACtE;oBAED,IACC,CAAC,iBAAiB;wBACjB,8BAAY,CAAC,eAAe,CAAC,MAAM,CAAC;wBACpC,aAAa,CAAC;wBACf,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;wBACD,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;4BAC7B,IAAI,iBAAiB,EAAE;gCACtB,sBAAsB,CAAC,MAAM,GAAG,IAAA,oBAAO,EACtC,sBAAsB,CAAC,MAAM,EAC7B,GAAG,CACH,CAAC;6BACF;iCAAM;gCACN,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAA,oBAAO,EAC9C,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EACrC,GAAG,CACH,CAAC;6BACF;yBACD;6BAAM;4BACN,eAAe;gCACd,aAAa,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC;4BAC1D,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;yBACtB;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE;4BACrB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE;gCACtB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;6BAC1D;iCAAM;gCACN,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,EACrD,eAAe,CAAC,GAAG,CAAC,CACpB,CAAC;6BACF;yBACD;qBACD;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBAChE,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;qBACzC;yBAAM,IACN,CAAC,iBAAiB;wBAClB,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EACjE;wBACD,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;qBAC5D;yBAAM;wBACN,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;qBAClD;iBACD;aACD;SACD;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YACrC,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;gBAChD,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;oBAC3C,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE;wBACtB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BACjD,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC1B;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACpC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;yBAC7B;6BAAM;4BACN,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCACnE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;6BACnC;iCAAM;gCACN,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;6BAC7B;yBACD;qBACD;yBAAM;wBACN,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;4BACpE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAChD,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCACjD,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;iCAC9C;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC9C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;iCAC5B;gCAED,IACC,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC;oCACzB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAChD;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;iCAC3C;qCAAM;oCACN,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;iCACrC;6BACD;iCAAM;gCACN,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CACV,CAAC;6BACF;yBACD;6BAAM,IACN,YAAY,CAAC,MAAM,CAAC;4BACpB,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EACtC;4BACD,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAChD,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC9C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wCACrD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qCAC9B;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;iCAC/C;qCAAM;oCACN,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iCACzD;6BACD;iCAAM;gCACN,IAAI,CAAC,qCAAqC,CACzC,GAAG,EACH,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CACV,CAAC;6BACF;yBACD;6BAAM;4BACN,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;yBACpE;qBACD;iBACD;aACD;SACD;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;gBAChC,OAAO;aACP;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;gBACrC,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;oBACpB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;iBACjE;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE;oBAChC,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC;wBACvD,CAAC,CAAC,GAAG;wBACL,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;iBACtB;aACD;QACF,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAC7B,aAAa,EACb,mBAAmB,EACnB,eAAe;YAEf,IAAI,aAAa,KAAK,SAAS,EAAE;gBAChC,OAAO;aACP;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;gBAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;aAChF;QACF,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE;YAClD,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;SAC5D;aAAM;YACN,IAAI,iBAAiB,EAAE;gBACtB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC5D;iBAAM;gBACN,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aACvE;SACD;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YACrD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACjE;aAAM;YACN,IAAI,iBAAiB,EAAE;gBACtB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aACjE;iBAAM;gBACN,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aAC5E;SACD;QAED,IAAI,iBAAiB,EAAE;YACtB,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;SACjE;aAAM;YACN,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;SAC5E;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;YAC5C,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,CACtB,CAAC;YAEL,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE;gBAC3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+Bc;gBAEd,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACrE,IACC,iBAAiB;wBACjB,CAAC,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC;4BACpD,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EACpC;wBACD,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;4BAC7B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;yBACxD;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;4BACrE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC1B;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IACC,OAAO,WAAW,KAAK,QAAQ;4BAC/B,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAClC;4BACD,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;yBAChC;wBACD,IACC,YAAY,CAAC,SAAS,KAAK,OAAO;4BAClC,YAAY,CAAC,SAAS,KAAK,QAAQ;4BACnC,QAAQ,CAAC,MAAM,KAAK,CAAC,EACpB;4BACD,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE;gCACrE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC1B;yBACD;6BAAM;4BACN,IAAI,QAAQ,KAAK,WAAW,EAAE;gCAC7B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC1B;yBACD;qBACD;yBAAM;wBACN,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;qBACF;iBACD;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAC5E,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;iBACtB;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,QAAQ,EAC9B;oBACD,IAAI,CAAC,iBAAiB,EAAE;wBACvB,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;qBACxE;iBACD;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;oBACD,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAClC,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;qBAC7B;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;4BACrD,0BAA0B,CAAC,MAAM,GAAG,IAAA,oBAAO,EAC1C,0BAA0B,CAAC,MAAM,EACjC,GAAG,CACH,CAAC;yBACF;6BAAM;4BACN,IAAI,iBAAiB,EAAE;gCACtB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BAC9C;iCAAM;gCACN,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CACjE,GAAG,CACH,CAAC;6BACF;yBACD;qBACD;iBACD;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAC5E,IAAI,iBAAiB,IAAI,8BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE;wBAC9E,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;4BAC7B,0BAA0B,CAAC,MAAM;gCAChC,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BACzC,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;yBACvE;6BAAM;4BACN,0BAA0B,CAAC,MAAM;gCAChC,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BACzC,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;yBAC/C;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACtB;yBAAM;wBACN,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;qBACtB;iBACD;qBAAM,IACN,YAAY,CAAC,GAAG,KAAK,eAAe;oBACpC,YAAY,CAAC,KAAK,KAAK,eAAe,EACrC;oBACD,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;iBAC7B;qBAAM;oBACN,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;wBACpC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;4BAC3C,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CACpD,YAAY,CAAC,WAAW,CACxB,CAAC,GAAG,CAAC,CAAC;yBACP;6BAAM;4BACN,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3D;qBACD;yBAAM;wBACN,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE;4BAClE,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,IAAA,oBAAO,EACvD,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAC9C,GAAG,CACH,CAAC;yBACF;6BAAM;4BACN,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC3D;qBACD;oBAED,OAAO,CAAC,KAAK,CACZ,yEAAyE,CACzE,CAAC;iBACF;aACD;SACD;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;YACvB,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;gBAC3C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACvB,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;gBAC3C,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACvB,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;gBAC3C,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;oBAC3C,IAAI,IAAA,sCAAgB,EAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC9C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC/B;iBACD;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACtD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACrC;aACD;SACD;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACvC,OAAO,OAAO,CAAC,MAAM,CAAC;SACtB;IACF,CAAC,CAAC;AACH,CAAC,EAx2BgB,mCAAmC,mDAAnC,mCAAmC,QAw2BnD","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(\n\t\t\t\t\t\t\t\tinsertedEntries[key].insert,\n\t\t\t\t\t\t\t\tremovalCS[key].remove,\n\t\t\t\t\t\t\t);\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 ||\n\t\t\t\t\t\t\tTypeIdHelper.isPrimitiveType(typeid) ||\n\t\t\t\t\t\t\tdeeplyEqualCS) &&\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(\n\t\t\t\t\t\t\t\t\tio_basePropertyChanges.remove,\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} 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 =\n\t\t\t\t\t\t\t\tdeeplyEqualCS || 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(\n\t\t\t\t\t\t\t\t\tinsertedEntries[key],\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} 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 (\n\t\t\t\t\t\t\tbaseModified[typeid] &&\n\t\t\t\t\t\t\tbaseModified[typeid][key] !== undefined\n\t\t\t\t\t\t) {\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)\n\t\t\t\t\t\t? key\n\t\t\t\t\t\t: 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  );\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 (\n\t\t\t\t\t\t\ttypeof rebaseValue === \"object\" &&\n\t\t\t\t\t\t\trebaseValue.hasOwnProperty(\"value\")\n\t\t\t\t\t\t) {\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 (\n\t\t\t\t\tmodification.own === \"remove_insert\" &&\n\t\t\t\t\tmodification.other === \"modify\"\n\t\t\t\t) {\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][\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}\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 =\n\t\t\t\t\t\t\t\tio_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 =\n\t\t\t\t\t\t\t\tio_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][\n\t\t\t\t\t\t\t\tmodification.otherTypeid\n\t\t\t\t\t\t\t][key];\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/changeset_operations/isEmptyChangeset.d.ts

@@ -2,10 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-/**
- * @fileoverview Helper function to check whether a changeset is empty
- */
-import { SerializedChangeSet } from "../changeset";
+import { SerializedChangeSet } from "../changeset.js";
 /**
  * Helper function which checks whether a given serialized changeSet is an empty changeSet.
  *

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

@@ -1 +1 @@
-{"version":3,"file":"isEmptyChangeset.d.ts","sourceRoot":"","sources":["../../src/changeset_operations/isEmptyChangeset.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAMH,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AAEnD;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,iBAAkB,mBAAmB,KAAG,OAIO,CAAC"}
+{"version":3,"file":"isEmptyChangeset.d.ts","sourceRoot":"","sources":["../../src/changeset_operations/isEmptyChangeset.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,OAAO,EAAE,mBAAmB,EAAE,MAAM,iBAAiB,CAAC;AAEtD;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,iBAAkB,mBAAmB,KAAG,OAIO,CAAC"}

package/dist/changeset_operations/isEmptyChangeset.js

@@ -3,17 +3,17 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-/**
- * @fileoverview Helper function to check whether a changeset is empty
- */
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.isEmptyChangeSet = void 0;
-const isEmpty_1 = __importDefault(require("lodash/isEmpty"));
-const has_1 = __importDefault(require("lodash/has"));
-const isObject_1 = __importDefault(require("lodash/isObject"));
+/**
+ * @fileoverview Helper function to check whether a changeset is empty
+ */
+const has_js_1 = __importDefault(require("lodash/has.js"));
+const isEmpty_js_1 = __importDefault(require("lodash/isEmpty.js"));
+const isObject_js_1 = __importDefault(require("lodash/isObject.js"));
 /**
  * Helper function which checks whether a given serialized changeSet is an empty changeSet.
  *
@@ -21,8 +21,8 @@ const isObject_1 = __importDefault(require("lodash/isObject"));
  * @returns True if it is an empty changeset.
  */
 const isEmptyChangeSet = (in_changeSet) => in_changeSet === undefined ||
-    ((0, isObject_1.default)(in_changeSet) &&
-        ((0, isEmpty_1.default)(in_changeSet) ||
-            (Object.keys(in_changeSet).length === 1 && (0, has_1.default)(in_changeSet, "typeid"))));
+    ((0, isObject_js_1.default)(in_changeSet) &&
+        ((0, isEmpty_js_1.default)(in_changeSet) ||
+            (Object.keys(in_changeSet).length === 1 && (0, has_js_1.default)(in_changeSet, "typeid"))));
 exports.isEmptyChangeSet = isEmptyChangeSet;
 //# sourceMappingURL=isEmptyChangeset.js.map

package/dist/changeset_operations/isEmptyChangeset.js.map

@@ -1 +1 @@
-{"version":3,"file":"isEmptyChangeset.js","sourceRoot":"","sources":["../../src/changeset_operations/isEmptyChangeset.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;;;;AAEH,6DAAqC;AACrC,qDAA6B;AAC7B,+DAAuC;AAIvC;;;;;GAKG;AACI,MAAM,gBAAgB,GAAG,CAAC,YAAiC,EAAW,EAAE,CAC9E,YAAY,KAAK,SAAS;IAC1B,CAAC,IAAA,kBAAQ,EAAC,YAAY,CAAC;QACtB,CAAC,IAAA,iBAAO,EAAC,YAAY,CAAC;YACrB,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,IAAA,aAAG,EAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAJhE,QAAA,gBAAgB,oBAIgD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Helper function to check whether a changeset is empty\n */\n\nimport isEmpty from \"lodash/isEmpty\";\nimport has from \"lodash/has\";\nimport isObject from \"lodash/isObject\";\n\nimport { SerializedChangeSet } from \"../changeset\";\n\n/**\n * Helper function which checks whether a given serialized changeSet is an empty changeSet.\n *\n * @param in_changeSet - The changeset to test\n * @returns True if it is an empty changeset.\n */\nexport const isEmptyChangeSet = (in_changeSet: SerializedChangeSet): boolean =>\n\tin_changeSet === undefined ||\n\t(isObject(in_changeSet) &&\n\t\t(isEmpty(in_changeSet) ||\n\t\t\t(Object.keys(in_changeSet).length === 1 && has(in_changeSet, \"typeid\"))));\n"]}
+{"version":3,"file":"isEmptyChangeset.js","sourceRoot":"","sources":["../../src/changeset_operations/isEmptyChangeset.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;AAEH;;GAEG;AAEH,2DAAgC;AAChC,mEAAwC;AACxC,qEAA0C;AAI1C;;;;;GAKG;AACI,MAAM,gBAAgB,GAAG,CAAC,YAAiC,EAAW,EAAE,CAC9E,YAAY,KAAK,SAAS;IAC1B,CAAC,IAAA,qBAAQ,EAAC,YAAY,CAAC;QACtB,CAAC,IAAA,oBAAO,EAAC,YAAY,CAAC;YACrB,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,IAAA,gBAAG,EAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAJhE,QAAA,gBAAgB,oBAIgD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * @fileoverview Helper function to check whether a changeset is empty\n */\n\nimport has from \"lodash/has.js\";\nimport isEmpty from \"lodash/isEmpty.js\";\nimport isObject from \"lodash/isObject.js\";\n\nimport { SerializedChangeSet } from \"../changeset.js\";\n\n/**\n * Helper function which checks whether a given serialized changeSet is an empty changeSet.\n *\n * @param in_changeSet - The changeset to test\n * @returns True if it is an empty changeset.\n */\nexport const isEmptyChangeSet = (in_changeSet: SerializedChangeSet): boolean =>\n\tin_changeSet === undefined ||\n\t(isObject(in_changeSet) &&\n\t\t(isEmpty(in_changeSet) ||\n\t\t\t(Object.keys(in_changeSet).length === 1 && has(in_changeSet, \"typeid\"))));\n"]}

package/dist/helpers/typeidHelper.d.ts

@@ -2,9 +2,6 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-/**
- * @fileoverview Helper functions to work with typeid strings
- */
 export declare interface ExtractedVersion {
     version: string;
     typeidWithoutVersion: string;

package/dist/helpers/typeidHelper.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"typeidHelper.d.ts","sourceRoot":"","sources":["../../src/helpers/typeidHelper.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH;;GAEG;AAQH,MAAM,CAAC,OAAO,WAAW,gBAAgB;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,oBAAoB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,CAAC,OAAO,WAAW,gBAAgB;IACxC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AAEH,yBAAiB,YAAY,CAAC;IAC7B;;;;;;OAMG;IACH,SAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAY1D;IAED;;;;;;OAMG;IACH,SAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAE3D;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAGzD;IAED;;;;;OAKG;IACH,SAAgB,cAAc,CAAC,SAAS,KAAA,GAAG,gBAAgB,CAU1D;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,GAAG,gBAAgB,CAwC9E;IAED;;;;;;;;;;OAUG;IACH,SAAgB,yBAAyB,CACxC,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,GACd,MAAM,CAeR;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAMxE;IAED;;;;;;OAMG;IACH,SAAgB,yCAAyC,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAKnF;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAEzD;IAED;;;;;;;OAOG;IACH,SAAgB,aAAa,CAAC,SAAS,KAAA,GAAG,MAAM,CAK/C;IAED;;;;;;;;;;OAUG;IACH,SAAgB,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,CAsCpF;IAED;;;;;OAKG;IACH,SAAgB,mBAAmB,IAAI,MAAM,EAAE,CAE9C;IAED;;;;;OAKG;IACH,SAAgB,kBAAkB,IAAI,MAAM,EAAE,CAE7C;CACD"}
+{"version":3,"file":"typeidHelper.d.ts","sourceRoot":"","sources":["../../src/helpers/typeidHelper.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAaH,MAAM,CAAC,OAAO,WAAW,gBAAgB;IACxC,OAAO,EAAE,MAAM,CAAC;IAChB,oBAAoB,EAAE,MAAM,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,CAAC,OAAO,WAAW,gBAAgB;IACxC,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,OAAO,CAAC;CAChB;AAED;;;;GAIG;AAEH,yBAAiB,YAAY,CAAC;IAC7B;;;;;;OAMG;IACH,SAAgB,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAY1D;IAED;;;;;;OAMG;IACH,SAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAE3D;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAGzD;IAED;;;;;OAKG;IACH,SAAgB,cAAc,CAAC,SAAS,KAAA,GAAG,gBAAgB,CAU1D;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,GAAG,gBAAgB,CAwC9E;IAED;;;;;;;;;;OAUG;IACH,SAAgB,yBAAyB,CACxC,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,OAAO,EAAE,OAAO,GACd,MAAM,CAeR;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,CAMxE;IAED;;;;;;OAMG;IACH,SAAgB,yCAAyC,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAKnF;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAEzD;IAED;;;;;;;OAOG;IACH,SAAgB,aAAa,CAAC,SAAS,KAAA,GAAG,MAAM,CAK/C;IAED;;;;;;;;;;OAUG;IACH,SAAgB,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,CAsCpF;IAED;;;;;OAKG;IACH,SAAgB,mBAAmB,IAAI,MAAM,EAAE,CAE9C;IAED;;;;;OAKG;IACH,SAAgB,kBAAkB,IAAI,MAAM,EAAE,CAE7C;CACD"}

package/dist/helpers/typeidHelper.js

@@ -3,14 +3,14 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TypeIdHelper = void 0;
 /**
  * @fileoverview Helper functions to work with typeid strings
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TypeIdHelper = void 0;
 // @ts-ignore
 const property_common_1 = require("@fluid-experimental/property-common");
-const templateSchema_1 = require("../templateSchema");
+const templateSchema_js_1 = require("../templateSchema.js");
 const { MSG } = property_common_1.constants;
 /**
  * Helper for Type IDs
@@ -28,7 +28,7 @@ var TypeIdHelper;
      * @internal
      */
     function isPrimitiveType(in_typeid) {
-        const primitiveTypes = templateSchema_1.TemplateSchema["$defs"]["primitive-typeid"]["enum"];
+        const primitiveTypes = templateSchema_js_1.TemplateSchema["$defs"]["primitive-typeid"]["enum"];
         if (in_typeid === undefined || in_typeid === "") {
             return false;
         }
@@ -56,7 +56,7 @@ var TypeIdHelper;
      * @internal
      */
     function isReservedType(in_typeid) {
-        const reservedTypes = templateSchema_1.TemplateSchema["$defs"]["reserved-typeid"]["enum"];
+        const reservedTypes = templateSchema_js_1.TemplateSchema["$defs"]["reserved-typeid"]["enum"];
         return reservedTypes.indexOf(in_typeid) >= 0;
     }
     TypeIdHelper.isReservedType = isReservedType;
@@ -229,10 +229,10 @@ var TypeIdHelper;
         if (in_baseTypeid.substr(0, 10) === "Reference<") {
             in_baseTypeid = "Reference";
         }
-        if (!templateSchema_1.NativeTypes[in_typeid]) {
+        if (!templateSchema_js_1.NativeTypes[in_typeid]) {
             throw new Error(MSG.TYPEID_NOT_NATIVE + in_typeid);
         }
-        if (!templateSchema_1.NativeTypes[in_baseTypeid]) {
+        if (!templateSchema_js_1.NativeTypes[in_baseTypeid]) {
             throw new Error(MSG.TYPEID_NOT_NATIVE + in_baseTypeid);
         }
         if (in_baseTypeid === "BaseProperty" || in_typeid === in_baseTypeid) {
@@ -241,7 +241,7 @@ var TypeIdHelper;
         if (in_typeid === "BaseProperty") {
             return false;
         }
-        let parents = templateSchema_1.NativeTypes[in_typeid]["inherits"];
+        let parents = templateSchema_js_1.NativeTypes[in_typeid]["inherits"];
         // recursively call the function for the parent of the typeid
         for (let i = 0; i < parents.length; i++) {
             if (this.nativeInheritsFrom(parents[i], in_baseTypeid)) {
@@ -258,7 +258,7 @@ var TypeIdHelper;
      * @internal
      */
     function getPrimitiveTypeIds() {
-        return templateSchema_1.TemplateSchema["$defs"]["primitive-typeid"]["enum"];
+        return templateSchema_js_1.TemplateSchema["$defs"]["primitive-typeid"]["enum"];
     }
     TypeIdHelper.getPrimitiveTypeIds = getPrimitiveTypeIds;
     /**
@@ -268,7 +268,7 @@ var TypeIdHelper;
      * @internal
      */
     function getReservedTypeIds() {
-        return templateSchema_1.TemplateSchema["$defs"]["reserved-typeid"]["enum"];
+        return templateSchema_js_1.TemplateSchema["$defs"]["reserved-typeid"]["enum"];
     }
     TypeIdHelper.getReservedTypeIds = getReservedTypeIds;
 })(TypeIdHelper || (exports.TypeIdHelper = TypeIdHelper = {}));

package/dist/helpers/typeidHelper.js.map

@@ -1 +1 @@
-{"version":3,"file":"typeidHelper.js","sourceRoot":"","sources":["../../src/helpers/typeidHelper.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;AAEH,aAAa;AACb,yEAAgE;AAChE,sDAAsF;AAEtF,MAAM,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAgB1B;;;;GAIG;AACH,2DAA2D;AAC3D,IAAiB,YAAY,CA6Q5B;AA7QD,WAAiB,YAAY;IAC5B;;;;;;OAMG;IACH,SAAgB,eAAe,CAAC,SAAiB;QAChD,MAAM,cAAc,GAAG,+BAAkB,CAAC,OAAO,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;QAE/E,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,EAAE,EAAE;YAChD,OAAO,KAAK,CAAC;SACb;QAED,OAAO,CACN,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO;YAClC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY;YACxC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CACtC,CAAC;IACH,CAAC;IAZe,4BAAe,kBAY9B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,gBAAgB,CAAC,SAAiB;QACjD,OAAO,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAFe,6BAAgB,mBAE/B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAiB;QAC/C,MAAM,aAAa,GAAG,+BAAkB,CAAC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7E,OAAO,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAHe,2BAAc,iBAG7B,CAAA;IAED;;;;;OAKG;IACH,SAAgB,cAAc,CAAC,SAAS;QACvC,IAAI,CAAC,SAAS,EAAE;YACf,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;SACxC;QACD,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEzC,OAAO;YACN,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;YACvB,oBAAoB,EAAE,WAAW,CAAC,CAAC,CAAC;SACpC,CAAC;IACH,CAAC;IAVe,2BAAc,iBAU7B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAA6B;QAC3D,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,YAAY,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;YACnD,IAAI,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC;YACrF,IAAI,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YAEhD,kFAAkF;YAClF,wCAAwC;YACxC,IAAI,MAAM,KAAK,EAAE,EAAE;gBAClB,MAAM,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC;aAC9D;YAED,0DAA0D;YAC1D,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE;gBAC1D,MAAM,GAAG,IAAI,CAAC;gBACd,IAAI,OAAO,KAAK,MAAM,EAAE;oBACvB,OAAO,GAAG,QAAQ,CAAC;iBACnB;qBAAM;oBACN,mDAAmD;oBACnD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;iBAC7C;aACD;YACD,IAAI,OAAO,KAAK,WAAW,EAAE;gBAC5B,MAAM,GAAG,aAAa,MAAM,GAAG,CAAC;gBAChC,OAAO,GAAG,QAAQ,CAAC;aACnB;YAED,OAAO;gBACN,MAAM;gBACN,OAAO;gBACP,MAAM;aACN,CAAC;SACF;aAAM;YACN,OAAO;gBACN,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,QAAQ;gBACjB,MAAM,EAAE,KAAK;aACb,CAAC;SACF;IACF,CAAC;IAxCe,2BAAc,iBAwC7B,CAAA;IAED;;;;;;;;;;OAUG;IACH,SAAgB,yBAAyB,CACxC,SAAiB,EACjB,UAAkB,EAClB,OAAgB;QAEhB,UAAU;QACV,IAAI,SAAS,KAAK,cAAc,EAAE;YACjC,yEAAyE;YACzE,yEAAyE;YACzE,OAAO,GAAG,UAAU,IAAI,CAAC;SACzB;aAAM;YACN,IAAI,OAAO,EAAE;gBACZ,OAAO,UAAU,KAAK,EAAE,IAAI,UAAU,KAAK,QAAQ;oBAClD,CAAC,CAAC,QAAQ,SAAS,GAAG;oBACtB,CAAC,CAAC,GAAG,UAAU,SAAS,SAAS,IAAI,CAAC;aACvC;iBAAM;gBACN,OAAO,GAAG,UAAU,IAAI,SAAS,GAAG,CAAC;aACrC;SACD;IACF,CAAC;IAnBe,sCAAyB,4BAmBxC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,SAA6B;QAC9D,UAAU;QACV,OAAO,CACN,SAAS,KAAK,WAAW;YACzB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAC1E,CAAC;IACH,CAAC;IANe,8BAAiB,oBAMhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,yCAAyC,CAAC,SAAiB;QAC1E,UAAU;QACV,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY;YAC9C,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;YAC7C,CAAC,CAAC,cAAc,CAAC;IACnB,CAAC;IALe,sDAAyC,4CAKxD,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAiB;QAC/C,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,CAAC;IAFe,2BAAc,iBAE7B,CAAA;IAED;;;;;;;OAOG;IACH,SAAgB,aAAa,CAAC,SAAS;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC7C,OAAO,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAC5C,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;YACpC,CAAC,CAAC,SAAS,CAAC;IACd,CAAC;IALe,0BAAa,gBAK5B,CAAA;IAED;;;;;;;;;;OAUG;IACH,SAAgB,kBAAkB,CAAC,SAAiB,EAAE,aAAqB;QAC1E,IAAI,CAAC,SAAS,IAAI,CAAC,aAAa,EAAE;YACjC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;SACxC;QAED,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE;YAC7C,SAAS,GAAG,WAAW,CAAC;SACxB;QAED,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE;YACjD,aAAa,GAAG,WAAW,CAAC;SAC5B;QAED,IAAI,CAAC,4BAAW,CAAC,SAAS,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,SAAS,CAAC,CAAC;SACnD;QAED,IAAI,CAAC,4BAAW,CAAC,aAAa,CAAC,EAAE;YAChC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,CAAC;SACvD;QAED,IAAI,aAAa,KAAK,cAAc,IAAI,SAAS,KAAK,aAAa,EAAE;YACpE,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,SAAS,KAAK,cAAc,EAAE;YACjC,OAAO,KAAK,CAAC;SACb;QAED,IAAI,OAAO,GAAG,4BAAW,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC,CAAC;QAEjD,6DAA6D;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE;gBACvD,OAAO,IAAI,CAAC;aACZ;SACD;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAtCe,+BAAkB,qBAsCjC,CAAA;IAED;;;;;OAKG;IACH,SAAgB,mBAAmB;QAClC,OAAO,+BAAkB,CAAC,OAAO,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;IAChE,CAAC;IAFe,gCAAmB,sBAElC,CAAA;IAED;;;;;OAKG;IACH,SAAgB,kBAAkB;QACjC,OAAO,+BAAkB,CAAC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC;IAFe,+BAAkB,qBAEjC,CAAA;AACF,CAAC,EA7QgB,YAAY,4BAAZ,YAAY,QA6Q5B","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Helper functions to work with typeid strings\n */\n\n// @ts-ignore\nimport { constants } from \"@fluid-experimental/property-common\";\nimport { TemplateSchema as templateSchemaJson, NativeTypes } from \"../templateSchema\";\n\nconst { MSG } = constants;\n\nexport declare interface ExtractedVersion {\n\tversion: string;\n\ttypeidWithoutVersion: string;\n}\n\n/**\n * @internal\n */\nexport declare interface ExtractedContext {\n\ttypeid: string;\n\tcontext: string;\n\tisEnum: boolean;\n}\n\n/**\n * Helper for Type IDs\n * @description Helper functions to work with typeid strings\n * @internal\n */\n// eslint-disable-next-line @typescript-eslint/no-namespace\nexport namespace TypeIdHelper {\n\t/**\n\t * Checks whether the given type is a primitive type.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base type?\n\t * @internal\n\t */\n\texport function isPrimitiveType(in_typeid: string): boolean {\n\t\tconst primitiveTypes = templateSchemaJson[\"$defs\"][\"primitive-typeid\"][\"enum\"];\n\n\t\tif (in_typeid === undefined || in_typeid === \"\") {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn (\n\t\t\tin_typeid.substr(0, 5) === \"enum<\" ||\n\t\t\tin_typeid.substr(0, 10) === \"Reference<\" ||\n\t\t\tprimitiveTypes.indexOf(in_typeid) >= 0\n\t\t);\n\t}\n\n\t/**\n\t * Checks whether the given type is a template typeid.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base template typeid?\n\t * @internal\n\t */\n\texport function isTemplateTypeid(in_typeid: string): boolean {\n\t\treturn in_typeid.indexOf(\":\") !== -1;\n\t}\n\n\t/**\n\t * Checks whether the given type is a reserved type.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a reserved type?\n\t * @internal\n\t */\n\texport function isReservedType(in_typeid: string): boolean {\n\t\tconst reservedTypes = templateSchemaJson[\"$defs\"][\"reserved-typeid\"][\"enum\"];\n\t\treturn reservedTypes.indexOf(in_typeid) >= 0;\n\t}\n\n\t/**\n\t * Extract the version number from the given typeid\n\t * @param in_typeid - The typeid to check against\n\t * @returns Extracted version\n\t * @internal\n\t */\n\texport function extractVersion(in_typeid): ExtractedVersion {\n\t\tif (!in_typeid) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_DEFINED);\n\t\t}\n\t\tconst splitTypeId = in_typeid.split(\"-\");\n\n\t\treturn {\n\t\t\tversion: splitTypeId[1],\n\t\t\ttypeidWithoutVersion: splitTypeId[0],\n\t\t};\n\t}\n\n\t/**\n\t * Extracts the context from a typeid\n\t *\n\t * @param in_typeid - The typeid to process\n\t * @returns The typeid without context, the context and if we have an enum type\n\t * @internal\n\t */\n\texport function extractContext(in_typeid: string | undefined): ExtractedContext {\n\t\tconst bracketIndex = in_typeid.indexOf(\"<\");\n\t\tif (bracketIndex !== -1 && in_typeid.endsWith(\">\")) {\n\t\t\tlet typeid = in_typeid.substr(bracketIndex + 1, in_typeid.length - bracketIndex - 2);\n\t\t\tlet context = in_typeid.substr(0, bracketIndex);\n\n\t\t\t// Special case to handle collections without a typeid (e.g. \"map<>\", which should\n\t\t\t// be able to support all property types\n\t\t\tif (typeid === \"\") {\n\t\t\t\ttypeid = context !== \"set\" ? \"BaseProperty\" : \"NamedProperty\";\n\t\t\t}\n\n\t\t\t// Special case to handle enums (e.g. array<enum<myType>>)\n\t\t\tlet isEnum = false;\n\t\t\tif (context === \"enum\" || typeid.substr(0, 5) === \"enum<\") {\n\t\t\t\tisEnum = true;\n\t\t\t\tif (context === \"enum\") {\n\t\t\t\t\tcontext = \"single\";\n\t\t\t\t} else {\n\t\t\t\t\t// remove the `enum<...>` tag to get the raw typeid\n\t\t\t\t\ttypeid = typeid.substr(5, typeid.length - 6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (context === \"Reference\") {\n\t\t\t\ttypeid = `Reference<${typeid}>`;\n\t\t\t\tcontext = \"single\";\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\ttypeid,\n\t\t\t\tcontext,\n\t\t\t\tisEnum,\n\t\t\t};\n\t\t} else {\n\t\t\treturn {\n\t\t\t\ttypeid: in_typeid,\n\t\t\t\tcontext: \"single\",\n\t\t\t\tisEnum: false,\n\t\t\t};\n\t\t}\n\t}\n\n\t/**\n\t * Creates a collection typeid string from the\n\t * typeid and the context.\n\t *\n\t * @param in_typeid - The typeid in the collection\n\t * @param in_context - The context\n\t * @param in_enum - Set to true if the type should get an enum tag\n\t *\n\t * @returns The combined typeid string\n\t * @internal\n\t */\n\texport function createSerializationTypeId(\n\t\tin_typeid: string,\n\t\tin_context: string,\n\t\tin_enum: boolean,\n\t): string {\n\t\t// in_enum\n\t\tif (in_typeid === \"BaseProperty\") {\n\t\t\t// Special case for BaseProperties. These get represented as a collection\n\t\t\t// typeid without a child typeid. E.g. map<> instead of map<BaseProperty>\n\t\t\treturn `${in_context}<>`;\n\t\t} else {\n\t\t\tif (in_enum) {\n\t\t\t\treturn in_context === \"\" || in_context === \"single\"\n\t\t\t\t\t? `enum<${in_typeid}>`\n\t\t\t\t\t: `${in_context}<enum<${in_typeid}>>`;\n\t\t\t} else {\n\t\t\t\treturn `${in_context}<${in_typeid}>`;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks, whether the supplied typeid is a reference property type id\n\t *\n\t * @param in_typeid - The typeid to check\n\t * @returns Is this a reference property typeid?\n\t * @internal\n\t */\n\texport function isReferenceTypeId(in_typeid: string | undefined): boolean {\n\t\t// in_enum\n\t\treturn (\n\t\t\tin_typeid === \"Reference\" ||\n\t\t\t(in_typeid.substr(0, 10) === \"Reference<\" && in_typeid.substr(-1) === \">\")\n\t\t);\n\t}\n\n\t/**\n\t * Returns the type of the properties a reference points to\n\t *\n\t * @param in_typeid - The typeid to process\n\t * @return The type of the referenced property\n\t * @internal\n\t */\n\texport function extractReferenceTargetTypeIdFromReference(in_typeid: string): string {\n\t\t// in_enum\n\t\treturn in_typeid.substr(0, 10) === \"Reference<\"\n\t\t\t? in_typeid.substr(10, in_typeid.length - 11)\n\t\t\t: \"BaseProperty\";\n\t}\n\n\t/**\n\t * Checks whether the given type is a template typeid.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base template typeid?\n\t * @internal\n\t */\n\texport function isSchemaTypeid(in_typeid: string): boolean {\n\t\treturn typeof in_typeid === \"string\" && in_typeid.indexOf(\":\") !== -1;\n\t}\n\n\t/**\n\t * Extracts referenced typeid from input typeid\n\t *\n\t * @param in_typeid - typeid\n\t *\n\t * @return referenced typeid or in_param if it is not a reference\n\t * @internal\n\t */\n\texport function extractTypeId(in_typeid): string {\n\t\tconst matches = in_typeid.match(/\\<(.*?)\\>/);\n\t\treturn matches !== null && matches.length > 0\n\t\t\t? matches[0].replace(/[\\<\\>]/gi, \"\")\n\t\t\t: in_typeid;\n\t}\n\n\t/**\n\t * Check wether the in_typeid inherits from the in_baseTypeid.\n\t *\n\t * @remarks Note: By default, this also returns true if in_typeid === in_baseTypeid.\n\t *\n\t * @param in_typeid - Typeid for which we want to check, whethwe in_baseTypeid is a parent.\n\t * @param in_baseTypeid - The base typeId to check for.\n\t * @throws If in_typeid or in_baseTypeid are not native typeid.\n\t * @returns True if in_baseTypeid is a parent of in_typeid.\n\t * @internal\n\t */\n\texport function nativeInheritsFrom(in_typeid: string, in_baseTypeid: string): boolean {\n\t\tif (!in_typeid || !in_baseTypeid) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_DEFINED);\n\t\t}\n\n\t\tif (in_typeid.substr(0, 10) === \"Reference<\") {\n\t\t\tin_typeid = \"Reference\";\n\t\t}\n\n\t\tif (in_baseTypeid.substr(0, 10) === \"Reference<\") {\n\t\t\tin_baseTypeid = \"Reference\";\n\t\t}\n\n\t\tif (!NativeTypes[in_typeid]) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_NATIVE + in_typeid);\n\t\t}\n\n\t\tif (!NativeTypes[in_baseTypeid]) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_NATIVE + in_baseTypeid);\n\t\t}\n\n\t\tif (in_baseTypeid === \"BaseProperty\" || in_typeid === in_baseTypeid) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (in_typeid === \"BaseProperty\") {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet parents = NativeTypes[in_typeid][\"inherits\"];\n\n\t\t// recursively call the function for the parent of the typeid\n\t\tfor (let i = 0; i < parents.length; i++) {\n\t\t\tif (this.nativeInheritsFrom(parents[i], in_baseTypeid)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * return all primitive typeIds\n\t *\n\t * @returns return a list of primitiveTypeIds\n\t * @internal\n\t */\n\texport function getPrimitiveTypeIds(): string[] {\n\t\treturn templateSchemaJson[\"$defs\"][\"primitive-typeid\"][\"enum\"];\n\t}\n\n\t/**\n\t * return all reserved typeIds\n\t *\n\t * @returns return a list of reservedTypeIds\n\t * @internal\n\t */\n\texport function getReservedTypeIds(): string[] {\n\t\treturn templateSchemaJson[\"$defs\"][\"reserved-typeid\"][\"enum\"];\n\t}\n}\n"]}
+{"version":3,"file":"typeidHelper.js","sourceRoot":"","sources":["../../src/helpers/typeidHelper.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH;;GAEG;AAEH,aAAa;AACb,yEAAgE;AAEhE,4DAAyF;AAEzF,MAAM,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAgB1B;;;;GAIG;AACH,2DAA2D;AAC3D,IAAiB,YAAY,CA6Q5B;AA7QD,WAAiB,YAAY;IAC5B;;;;;;OAMG;IACH,SAAgB,eAAe,CAAC,SAAiB;QAChD,MAAM,cAAc,GAAG,kCAAkB,CAAC,OAAO,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;QAE/E,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,EAAE,EAAE;YAChD,OAAO,KAAK,CAAC;SACb;QAED,OAAO,CACN,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO;YAClC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY;YACxC,cAAc,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CACtC,CAAC;IACH,CAAC;IAZe,4BAAe,kBAY9B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,gBAAgB,CAAC,SAAiB;QACjD,OAAO,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtC,CAAC;IAFe,6BAAgB,mBAE/B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAiB;QAC/C,MAAM,aAAa,GAAG,kCAAkB,CAAC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;QAC7E,OAAO,aAAa,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAHe,2BAAc,iBAG7B,CAAA;IAED;;;;;OAKG;IACH,SAAgB,cAAc,CAAC,SAAS;QACvC,IAAI,CAAC,SAAS,EAAE;YACf,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;SACxC;QACD,MAAM,WAAW,GAAG,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEzC,OAAO;YACN,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC;YACvB,oBAAoB,EAAE,WAAW,CAAC,CAAC,CAAC;SACpC,CAAC;IACH,CAAC;IAVe,2BAAc,iBAU7B,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAA6B;QAC3D,MAAM,YAAY,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,YAAY,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;YACnD,IAAI,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,YAAY,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC;YACrF,IAAI,OAAO,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YAEhD,kFAAkF;YAClF,wCAAwC;YACxC,IAAI,MAAM,KAAK,EAAE,EAAE;gBAClB,MAAM,GAAG,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe,CAAC;aAC9D;YAED,0DAA0D;YAC1D,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,IAAI,OAAO,KAAK,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,OAAO,EAAE;gBAC1D,MAAM,GAAG,IAAI,CAAC;gBACd,IAAI,OAAO,KAAK,MAAM,EAAE;oBACvB,OAAO,GAAG,QAAQ,CAAC;iBACnB;qBAAM;oBACN,mDAAmD;oBACnD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;iBAC7C;aACD;YACD,IAAI,OAAO,KAAK,WAAW,EAAE;gBAC5B,MAAM,GAAG,aAAa,MAAM,GAAG,CAAC;gBAChC,OAAO,GAAG,QAAQ,CAAC;aACnB;YAED,OAAO;gBACN,MAAM;gBACN,OAAO;gBACP,MAAM;aACN,CAAC;SACF;aAAM;YACN,OAAO;gBACN,MAAM,EAAE,SAAS;gBACjB,OAAO,EAAE,QAAQ;gBACjB,MAAM,EAAE,KAAK;aACb,CAAC;SACF;IACF,CAAC;IAxCe,2BAAc,iBAwC7B,CAAA;IAED;;;;;;;;;;OAUG;IACH,SAAgB,yBAAyB,CACxC,SAAiB,EACjB,UAAkB,EAClB,OAAgB;QAEhB,UAAU;QACV,IAAI,SAAS,KAAK,cAAc,EAAE;YACjC,yEAAyE;YACzE,yEAAyE;YACzE,OAAO,GAAG,UAAU,IAAI,CAAC;SACzB;aAAM;YACN,IAAI,OAAO,EAAE;gBACZ,OAAO,UAAU,KAAK,EAAE,IAAI,UAAU,KAAK,QAAQ;oBAClD,CAAC,CAAC,QAAQ,SAAS,GAAG;oBACtB,CAAC,CAAC,GAAG,UAAU,SAAS,SAAS,IAAI,CAAC;aACvC;iBAAM;gBACN,OAAO,GAAG,UAAU,IAAI,SAAS,GAAG,CAAC;aACrC;SACD;IACF,CAAC;IAnBe,sCAAyB,4BAmBxC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,iBAAiB,CAAC,SAA6B;QAC9D,UAAU;QACV,OAAO,CACN,SAAS,KAAK,WAAW;YACzB,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAC1E,CAAC;IACH,CAAC;IANe,8BAAiB,oBAMhC,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,yCAAyC,CAAC,SAAiB;QAC1E,UAAU;QACV,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY;YAC9C,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,MAAM,GAAG,EAAE,CAAC;YAC7C,CAAC,CAAC,cAAc,CAAC;IACnB,CAAC;IALe,sDAAyC,4CAKxD,CAAA;IAED;;;;;;OAMG;IACH,SAAgB,cAAc,CAAC,SAAiB;QAC/C,OAAO,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,CAAC;IAFe,2BAAc,iBAE7B,CAAA;IAED;;;;;;;OAOG;IACH,SAAgB,aAAa,CAAC,SAAS;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC7C,OAAO,OAAO,KAAK,IAAI,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAC5C,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;YACpC,CAAC,CAAC,SAAS,CAAC;IACd,CAAC;IALe,0BAAa,gBAK5B,CAAA;IAED;;;;;;;;;;OAUG;IACH,SAAgB,kBAAkB,CAAC,SAAiB,EAAE,aAAqB;QAC1E,IAAI,CAAC,SAAS,IAAI,CAAC,aAAa,EAAE;YACjC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;SACxC;QAED,IAAI,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE;YAC7C,SAAS,GAAG,WAAW,CAAC;SACxB;QAED,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,YAAY,EAAE;YACjD,aAAa,GAAG,WAAW,CAAC;SAC5B;QAED,IAAI,CAAC,+BAAW,CAAC,SAAS,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,SAAS,CAAC,CAAC;SACnD;QAED,IAAI,CAAC,+BAAW,CAAC,aAAa,CAAC,EAAE;YAChC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,CAAC;SACvD;QAED,IAAI,aAAa,KAAK,cAAc,IAAI,SAAS,KAAK,aAAa,EAAE;YACpE,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,SAAS,KAAK,cAAc,EAAE;YACjC,OAAO,KAAK,CAAC;SACb;QAED,IAAI,OAAO,GAAG,+BAAW,CAAC,SAAS,CAAC,CAAC,UAAU,CAAC,CAAC;QAEjD,6DAA6D;QAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,IAAI,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,aAAa,CAAC,EAAE;gBACvD,OAAO,IAAI,CAAC;aACZ;SACD;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAtCe,+BAAkB,qBAsCjC,CAAA;IAED;;;;;OAKG;IACH,SAAgB,mBAAmB;QAClC,OAAO,kCAAkB,CAAC,OAAO,CAAC,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC,CAAC;IAChE,CAAC;IAFe,gCAAmB,sBAElC,CAAA;IAED;;;;;OAKG;IACH,SAAgB,kBAAkB;QACjC,OAAO,kCAAkB,CAAC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC;IAFe,+BAAkB,qBAEjC,CAAA;AACF,CAAC,EA7QgB,YAAY,4BAAZ,YAAY,QA6Q5B","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * @fileoverview Helper functions to work with typeid strings\n */\n\n// @ts-ignore\nimport { constants } from \"@fluid-experimental/property-common\";\n\nimport { NativeTypes, TemplateSchema as templateSchemaJson } from \"../templateSchema.js\";\n\nconst { MSG } = constants;\n\nexport declare interface ExtractedVersion {\n\tversion: string;\n\ttypeidWithoutVersion: string;\n}\n\n/**\n * @internal\n */\nexport declare interface ExtractedContext {\n\ttypeid: string;\n\tcontext: string;\n\tisEnum: boolean;\n}\n\n/**\n * Helper for Type IDs\n * @description Helper functions to work with typeid strings\n * @internal\n */\n// eslint-disable-next-line @typescript-eslint/no-namespace\nexport namespace TypeIdHelper {\n\t/**\n\t * Checks whether the given type is a primitive type.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base type?\n\t * @internal\n\t */\n\texport function isPrimitiveType(in_typeid: string): boolean {\n\t\tconst primitiveTypes = templateSchemaJson[\"$defs\"][\"primitive-typeid\"][\"enum\"];\n\n\t\tif (in_typeid === undefined || in_typeid === \"\") {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn (\n\t\t\tin_typeid.substr(0, 5) === \"enum<\" ||\n\t\t\tin_typeid.substr(0, 10) === \"Reference<\" ||\n\t\t\tprimitiveTypes.indexOf(in_typeid) >= 0\n\t\t);\n\t}\n\n\t/**\n\t * Checks whether the given type is a template typeid.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base template typeid?\n\t * @internal\n\t */\n\texport function isTemplateTypeid(in_typeid: string): boolean {\n\t\treturn in_typeid.indexOf(\":\") !== -1;\n\t}\n\n\t/**\n\t * Checks whether the given type is a reserved type.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a reserved type?\n\t * @internal\n\t */\n\texport function isReservedType(in_typeid: string): boolean {\n\t\tconst reservedTypes = templateSchemaJson[\"$defs\"][\"reserved-typeid\"][\"enum\"];\n\t\treturn reservedTypes.indexOf(in_typeid) >= 0;\n\t}\n\n\t/**\n\t * Extract the version number from the given typeid\n\t * @param in_typeid - The typeid to check against\n\t * @returns Extracted version\n\t * @internal\n\t */\n\texport function extractVersion(in_typeid): ExtractedVersion {\n\t\tif (!in_typeid) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_DEFINED);\n\t\t}\n\t\tconst splitTypeId = in_typeid.split(\"-\");\n\n\t\treturn {\n\t\t\tversion: splitTypeId[1],\n\t\t\ttypeidWithoutVersion: splitTypeId[0],\n\t\t};\n\t}\n\n\t/**\n\t * Extracts the context from a typeid\n\t *\n\t * @param in_typeid - The typeid to process\n\t * @returns The typeid without context, the context and if we have an enum type\n\t * @internal\n\t */\n\texport function extractContext(in_typeid: string | undefined): ExtractedContext {\n\t\tconst bracketIndex = in_typeid.indexOf(\"<\");\n\t\tif (bracketIndex !== -1 && in_typeid.endsWith(\">\")) {\n\t\t\tlet typeid = in_typeid.substr(bracketIndex + 1, in_typeid.length - bracketIndex - 2);\n\t\t\tlet context = in_typeid.substr(0, bracketIndex);\n\n\t\t\t// Special case to handle collections without a typeid (e.g. \"map<>\", which should\n\t\t\t// be able to support all property types\n\t\t\tif (typeid === \"\") {\n\t\t\t\ttypeid = context !== \"set\" ? \"BaseProperty\" : \"NamedProperty\";\n\t\t\t}\n\n\t\t\t// Special case to handle enums (e.g. array<enum<myType>>)\n\t\t\tlet isEnum = false;\n\t\t\tif (context === \"enum\" || typeid.substr(0, 5) === \"enum<\") {\n\t\t\t\tisEnum = true;\n\t\t\t\tif (context === \"enum\") {\n\t\t\t\t\tcontext = \"single\";\n\t\t\t\t} else {\n\t\t\t\t\t// remove the `enum<...>` tag to get the raw typeid\n\t\t\t\t\ttypeid = typeid.substr(5, typeid.length - 6);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (context === \"Reference\") {\n\t\t\t\ttypeid = `Reference<${typeid}>`;\n\t\t\t\tcontext = \"single\";\n\t\t\t}\n\n\t\t\treturn {\n\t\t\t\ttypeid,\n\t\t\t\tcontext,\n\t\t\t\tisEnum,\n\t\t\t};\n\t\t} else {\n\t\t\treturn {\n\t\t\t\ttypeid: in_typeid,\n\t\t\t\tcontext: \"single\",\n\t\t\t\tisEnum: false,\n\t\t\t};\n\t\t}\n\t}\n\n\t/**\n\t * Creates a collection typeid string from the\n\t * typeid and the context.\n\t *\n\t * @param in_typeid - The typeid in the collection\n\t * @param in_context - The context\n\t * @param in_enum - Set to true if the type should get an enum tag\n\t *\n\t * @returns The combined typeid string\n\t * @internal\n\t */\n\texport function createSerializationTypeId(\n\t\tin_typeid: string,\n\t\tin_context: string,\n\t\tin_enum: boolean,\n\t): string {\n\t\t// in_enum\n\t\tif (in_typeid === \"BaseProperty\") {\n\t\t\t// Special case for BaseProperties. These get represented as a collection\n\t\t\t// typeid without a child typeid. E.g. map<> instead of map<BaseProperty>\n\t\t\treturn `${in_context}<>`;\n\t\t} else {\n\t\t\tif (in_enum) {\n\t\t\t\treturn in_context === \"\" || in_context === \"single\"\n\t\t\t\t\t? `enum<${in_typeid}>`\n\t\t\t\t\t: `${in_context}<enum<${in_typeid}>>`;\n\t\t\t} else {\n\t\t\t\treturn `${in_context}<${in_typeid}>`;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks, whether the supplied typeid is a reference property type id\n\t *\n\t * @param in_typeid - The typeid to check\n\t * @returns Is this a reference property typeid?\n\t * @internal\n\t */\n\texport function isReferenceTypeId(in_typeid: string | undefined): boolean {\n\t\t// in_enum\n\t\treturn (\n\t\t\tin_typeid === \"Reference\" ||\n\t\t\t(in_typeid.substr(0, 10) === \"Reference<\" && in_typeid.substr(-1) === \">\")\n\t\t);\n\t}\n\n\t/**\n\t * Returns the type of the properties a reference points to\n\t *\n\t * @param in_typeid - The typeid to process\n\t * @return The type of the referenced property\n\t * @internal\n\t */\n\texport function extractReferenceTargetTypeIdFromReference(in_typeid: string): string {\n\t\t// in_enum\n\t\treturn in_typeid.substr(0, 10) === \"Reference<\"\n\t\t\t? in_typeid.substr(10, in_typeid.length - 11)\n\t\t\t: \"BaseProperty\";\n\t}\n\n\t/**\n\t * Checks whether the given type is a template typeid.\n\t *\n\t * @param in_typeid - The typeid we want to check\n\t * @returns Is this a base template typeid?\n\t * @internal\n\t */\n\texport function isSchemaTypeid(in_typeid: string): boolean {\n\t\treturn typeof in_typeid === \"string\" && in_typeid.indexOf(\":\") !== -1;\n\t}\n\n\t/**\n\t * Extracts referenced typeid from input typeid\n\t *\n\t * @param in_typeid - typeid\n\t *\n\t * @return referenced typeid or in_param if it is not a reference\n\t * @internal\n\t */\n\texport function extractTypeId(in_typeid): string {\n\t\tconst matches = in_typeid.match(/\\<(.*?)\\>/);\n\t\treturn matches !== null && matches.length > 0\n\t\t\t? matches[0].replace(/[\\<\\>]/gi, \"\")\n\t\t\t: in_typeid;\n\t}\n\n\t/**\n\t * Check wether the in_typeid inherits from the in_baseTypeid.\n\t *\n\t * @remarks Note: By default, this also returns true if in_typeid === in_baseTypeid.\n\t *\n\t * @param in_typeid - Typeid for which we want to check, whethwe in_baseTypeid is a parent.\n\t * @param in_baseTypeid - The base typeId to check for.\n\t * @throws If in_typeid or in_baseTypeid are not native typeid.\n\t * @returns True if in_baseTypeid is a parent of in_typeid.\n\t * @internal\n\t */\n\texport function nativeInheritsFrom(in_typeid: string, in_baseTypeid: string): boolean {\n\t\tif (!in_typeid || !in_baseTypeid) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_DEFINED);\n\t\t}\n\n\t\tif (in_typeid.substr(0, 10) === \"Reference<\") {\n\t\t\tin_typeid = \"Reference\";\n\t\t}\n\n\t\tif (in_baseTypeid.substr(0, 10) === \"Reference<\") {\n\t\t\tin_baseTypeid = \"Reference\";\n\t\t}\n\n\t\tif (!NativeTypes[in_typeid]) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_NATIVE + in_typeid);\n\t\t}\n\n\t\tif (!NativeTypes[in_baseTypeid]) {\n\t\t\tthrow new Error(MSG.TYPEID_NOT_NATIVE + in_baseTypeid);\n\t\t}\n\n\t\tif (in_baseTypeid === \"BaseProperty\" || in_typeid === in_baseTypeid) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (in_typeid === \"BaseProperty\") {\n\t\t\treturn false;\n\t\t}\n\n\t\tlet parents = NativeTypes[in_typeid][\"inherits\"];\n\n\t\t// recursively call the function for the parent of the typeid\n\t\tfor (let i = 0; i < parents.length; i++) {\n\t\t\tif (this.nativeInheritsFrom(parents[i], in_baseTypeid)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * return all primitive typeIds\n\t *\n\t * @returns return a list of primitiveTypeIds\n\t * @internal\n\t */\n\texport function getPrimitiveTypeIds(): string[] {\n\t\treturn templateSchemaJson[\"$defs\"][\"primitive-typeid\"][\"enum\"];\n\t}\n\n\t/**\n\t * return all reserved typeIds\n\t *\n\t * @returns return a list of reservedTypeIds\n\t * @internal\n\t */\n\texport function getReservedTypeIds(): string[] {\n\t\treturn templateSchemaJson[\"$defs\"][\"reserved-typeid\"][\"enum\"];\n\t}\n}\n"]}

package/dist/index.d.ts

@@ -2,14 +2,14 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ChangeSet, SerializedChangeSet } from "./changeset";
-import { ArrayChangeSetIterator } from "./changeset_operations/arrayChangesetIterator";
-import { ExtractedContext, TypeIdHelper } from "./helpers/typeidHelper";
-import { PathHelper } from "./pathHelper";
-import { rebaseToRemoteChanges } from "./rebase";
-import { TemplateSchema } from "./templateSchema";
-import { TemplateValidator } from "./templateValidator";
-import { Utils } from "./utils";
+import { ChangeSet, SerializedChangeSet } from "./changeset.js";
+import { ArrayChangeSetIterator } from "./changeset_operations/arrayChangesetIterator.js";
+import { ExtractedContext, TypeIdHelper } from "./helpers/typeidHelper.js";
+import { PathHelper } from "./pathHelper.js";
+import { rebaseToRemoteChanges } from "./rebase.js";
+import { TemplateSchema } from "./templateSchema.js";
+import { TemplateValidator } from "./templateValidator.js";
+import { Utils } from "./utils.js";
 /**
  * @internal
  */

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,aAAa,CAAC;AAC7D,OAAO,EAAE,sBAAsB,EAAE,MAAM,+CAA+C,CAAC;AACvF,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACxE,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,qBAAqB,EAAE,MAAM,UAAU,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC;;GAEG;AACH,QAAA,MAAQ,gBAAgB,+BAAU,CAAC;AAEnC,OAAO,EACN,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,GAChB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAChE,OAAO,EAAE,sBAAsB,EAAE,MAAM,kDAAkD,CAAC;AAC1F,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC3E,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,qBAAqB,EAAE,MAAM,aAAa,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC;;GAEG;AACH,QAAA,MAAQ,gBAAgB,+BAAU,CAAC;AAEnC,OAAO,EACN,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,GAChB,CAAC"}