@fluid-experimental/property-changeset 0.59.2001 → 0.59.3000

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;;;;;;AAEF,yDAAoD;AACpD,6DAAqC;AACrC,6DAAqC;AACrC,+DAAuC;AACvC,6DAAqC;AACrC,+DAAuC;AAExC,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,UAAS,SAAc;IAC9C,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,kBAAQ,CAAC,SAAS,CAAC,EAAE;QAChE,OAAO,iBAAO,CAAC,SAAS,CAAC,CAAC;KAC7B;IAED,wCAAwC;IACxC,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE;QAC5B,OAAO,KAAK,CAAC;KAChB;IAED,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF,IAAiB,mCAAmC,CA+vBnD;AA/vBD,WAAiB,mCAAmC;IAChD;;;;;;;;;;;;;;OAcG;IACU,iFAA6C,GAAG,UACzD,sBAA2C,EAAE,iCAAiC;IAC9E,yBAA8C,EAC9C,SAAiB,EACjB,UAAiC;QACjC,MAAM,iBAAiB,GAAG,2BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,0EAA0E;YAC1E,IAAI,cAAc,GAAG,yBAAyB,CAAC,MAAM,CAAC;YAEtD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM;gBACzD,CAAC,KAAK,CAAC,OAAO,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChE,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;gBAChC,IAAI,iBAAiB,EAAE;oBACnB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAChD;qBAAM;oBACH,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;wBAC1C,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;4BACzC,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;gCAC7D,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,iBAAO,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oCACxD,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;iCACxC;6BACJ;iCAAM;gCACH,IAAI,YAAY,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oCAC7C,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oCAC7D,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,iBAAO,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wCACxD,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qCACxC;iCACJ;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;oCAC5B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCACpC;qCAAM;oCACH,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;wCAC/B,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;qCACrC;oCACD,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCAClG;6BACJ;yBACJ;qBACJ;oBACD,IAAI,GAAG,IAAI,CAAC;iBACf;aACJ;YAED,IAAI,CAAC,IAAI,EAAE;gBACP,IAAI,iBAAiB,EAAE;oBACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACjC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;yBAC5B;6BAAM;4BACH,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACjD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;6BAC5B;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC5B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BACzB;iCAAM;gCACH,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BAC5D;yBACJ;qBACJ;iBACJ;qBAAM;oBACH,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;wBAC5C,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;4BACjD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACzD,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;6BACT;yBACJ;wBAED,IAAI,aAAa,EAAE;4BACf,uFAAuF;4BACvF,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;4BAExC,+DAA+D;4BAC/D,yDAAyD;4BACzD,IAAI,YAAY,IAAI,iBAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACtD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACtC;4BACD,IAAI,YAAY,IAAI,iBAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACtD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACtC;yBACJ;6BAAM;4BACH,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;gCACjD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;oCAC3C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;iCACT;6BACJ;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBACzB;qBACJ;iBACJ;aACJ;SACJ;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,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,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACxG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC;oBACvC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAChF,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,IAAI,SAAS,CAAC;gBACd,IAAI,WAAW,EAAE;oBACb,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;iBACrE;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC1C,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,IAAI,CAAC,iBAAiB,IAAI,SAAS,IAAI,kBAAQ,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBACxF,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;4BAC9C,aAAa,GAAG,iBAAO,CACnB,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CACxB,CAAC;yBACL;wBAED,8EAA8E;wBAC9E,MAAM,aAAa,GAAG,kBAAQ,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAO,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;wBACtH,MAAM,YAAY,GAAG,kBAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,iBAAO,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBACnG,aAAa,GAAG,aAAa,IAAI,iBAAO,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;qBACzE;oBAED,IAAI,CAAC,iBAAiB,IAAI,2BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC;wBAC5E,SAAS;wBACT,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,kBAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE;wBAC5F,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;4BAC1B,IAAI,iBAAiB,EAAE;gCACnB,sBAAsB,CAAC,MAAM,GAAG,iBAAO,CAAC,sBAAsB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;6BAC/E;iCAAM;gCACH,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,iBAAO,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;6BAC/F;yBACJ;6BAAM;4BACH,eAAe,GAAG,aAAa,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC7E,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;yBACzB;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE;4BAClB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE;gCACnB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;6BAC7D;iCAAM;gCACH,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gCACpF,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,wBAAS,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;6BAChF;yBACJ;qBACJ;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBAC7D,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;qBAC5C;yBAAM,IAAI,CAAC,iBAAiB,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE;wBACjG,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;wBAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,wBAAS,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;qBAC/D;yBAAM;wBACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;qBACrD;iBACJ;aACJ;SACJ;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,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;gBAC7C,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEhC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACxC,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE;wBACnB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BAC9C,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC7B;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACjC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;yBAChC;6BAAM;4BACH,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCAChE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;6BACtC;iCAAM;gCACH,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;6BAChC;yBACJ;qBACJ;yBAAM;wBACH,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;4BACjE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAC7C,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAC9C,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;iCACjD;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC3C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;iCAC/B;gCAED,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAChF,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;iCAC9C;qCAAM;oCACH,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;iCACxC;6BACJ;iCAAM;gCACH,IAAI,CAAC,qCAAqC,CAAC,GAAG,EAC1C,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CAAC,CAAC;6BACnB;yBACJ;6BAAM,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACxE,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAC7C,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC3C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wCAClD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qCACjC;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;iCAClD;qCAAM;oCACH,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iCAC5D;6BACJ;iCAAM;gCACH,IAAI,CAAC,qCAAqC,CAAC,GAAG,EAC1C,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CAAC,CAAC;6BACnB;yBACJ;6BAAM;4BACH,YAAY,CAAC,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;4BAClD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,wBAAS,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;yBACvE;qBACJ;iBACJ;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,sBAAsB,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACtF,CAAC,CAAC;IAEF;;;;;;;;;;;;;;;;OAgBG;IACU,gFAA4C,GAAG,UACxD,uBAA4C,EAAE,iCAAiC;IAC/E,0BAA+C,EAC/C,WAAmB,EACnB,SAAiB,EACjB,0BAAmC,EACnC,aAA6B,EAC7B,UAAiC;QACjC,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,UAAS,aAAkC,EAAE,mBAA2B,EAAE,eAAuB,EAAE,eAAwB;YAC1I,4CAA4C;YAC5C,IAAI,aAAa,KAAK,SAAS,EAAE;gBAC7B,OAAO;aACV;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;gBAClC,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,CAAC,CAAC;oBACvE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,mBAAmB,EAAE,CAAC,CAAC;oBACjE,mBAAmB,CAAC;gBAExB,+CAA+C;gBAC/C,IAAI,eAAe,EAAE;oBACjB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;iBACpE;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE;oBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;wBAC/B,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;qBAClD;yBAAM;wBACH,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;qBACnC;iBACJ;aACJ;QACL,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAAS,aAAa,EAAE,mBAAmB,EAAE,eAAe;YACtF,IAAI,aAAa,KAAK,SAAS,EAAE;gBAC7B,OAAO;aACV;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;gBAC7C,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;aACnF;QACL,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE;YAC/C,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;SAC/D;aAAM;YACH,IAAI,iBAAiB,EAAE;gBACnB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC/D;iBAAM;gBACH,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC1E;SACJ;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YAClD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACpE;aAAM;YACH,IAAI,iBAAiB,EAAE;gBACnB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aACpE;iBAAM;gBACH,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aAC/E;SACJ;QAED,IAAI,iBAAiB,EAAE;YACnB,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;SACpE;aAAM;YACH,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;SAC/E;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;YACzC,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,0BAA0B,CAAC,CAAC;gBACxC,GAAG,WAAW,IAAI,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/D,2BAAS,CAAC,WAAW,EAAE,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,uBAAuB,CAAC,CAAC;YAE9F,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE;gBACxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+BE;gBAEF,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAClE,IAAI,iBAAiB;wBACjB,CAAC,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EAAE;wBAC/F,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;4BAC1B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;yBAC3D;wBAED,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,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;4BAClE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC7B;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BACxE,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;yBACnC;wBACD,IAAI,YAAY,CAAC,SAAS,KAAK,OAAO,IAAI,YAAY,CAAC,SAAS,KAAK,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;4BACpG,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE;gCAClE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC7B;yBACJ;6BAAM;4BACH,IAAI,QAAQ,KAAK,WAAW,EAAE;gCAC1B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC7B;yBACJ;qBACJ;yBAAM;wBACH,IAAI,CAAC,yCAAyC,CAAC,GAAG,EAC9C,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,CAAC,CAAC;qBACnB;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACzE,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;wBAChG,0BAA0B,CAAC,MAAM,CAAC;oBAEtC,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,2BAA2B;wBAC9C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACpC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;iBACzB;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAChF,2FAA2F;oBAC3F,2FAA2F;oBAC3F,sFAAsF;oBACtF,yBAAyB;oBAEzB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,sCAAsC;wBACzD,iBAAiB,EAAE,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC;qBACtF,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;iBACjD;qBAAM,IAAI,CAAC,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC;oBACvE,CAAC,YAAY,CAAC,KAAK,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,CAAC,EAAE;oBAC7E,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAC/B,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;4BACzF,uBAAuB,CAAC,MAAM,CAAC;wBAEnC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,mBAAmB;4BACtC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBAChC;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;4BAClD,0BAA0B,CAAC,MAAM,GAAG,iBAAO,CAAC,0BAA0B,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;yBACvF;6BAAM;4BACH,IAAI,iBAAiB,EAAE;gCACnB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BACjD;iCAAM;gCACH,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;6BAC3E;yBACJ;qBACJ;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACzE,IAAI,iBAAiB;wBACjB,CAAC,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE;wBACxD,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;4BACpG,0BAA0B,CAAC,MAAM,CAAC;wBAEtC,+EAA+E;wBAC/E,iFAAiF;wBACjF,0CAA0C;wBAC1C,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,oBAAoB;wBACpB,IAAI,QAAQ,CAAC;wBACb,IAAI,YAAY,CAAC,WAAW,EAAE;4BAC1B,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;gCACvD,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;4BACtE,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;yBAC1E;6BAAM;4BACH,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;yBAClD;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACzB;yBAAM;wBACH,8FAA8F;wBAC9F,kGAAkG;wBAElG,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;4BACpG,0BAA0B,CAAC,MAAM,CAAC;wBAEtC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,4BAA4B;4BAC/C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACzB;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,EAAE;oBACvF,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;wBACpG,0BAA0B,CAAC,MAAM,CAAC;oBAEtC,4CAA4C;oBAC5C,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,aAAa;wBAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACpC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAChC;qBAAM;oBACH,kGAAkG;oBAClG,qBAAqB;oBAErB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,sBAAsB;wBACzC,iBAAiB,EAAE,YAAY,CAAC,MAAM;qBACzC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,uCAAuC;oBACvC,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;wBACjC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;4BACxC,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;yBACxF;6BAAM;4BACH,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC9D;qBACJ;yBAAM;wBACH,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE;4BAC/D,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC;gCAC1C,iBAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;yBACpE;6BAAM;4BACH,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC9D;qBACJ;oBAED,OAAO,CAAC,KAAK,CAAC,yEAAyE,CAAC,CAAC;iBAC5F;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,0BAA0B,EAAE,CAAC,iBAAiB,CAAC,CAAC;IAC1F,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,oEAAgC,GAAG,UAAS,kBAAuC,EAAE,kBAA2B;QACzH,MAAM,OAAO,GAAG,kBAAkB,CAAC;QACnC,gBAAgB;QAEhB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,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;oBACxC,IAAI,mCAAgB,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC3C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;qBAClC;iBACJ;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;IACL,CAAC,CAAC;AACN,CAAC,EA/vBgB,mCAAmC,GAAnC,2CAAmC,KAAnC,2CAAmC,QA+vBnD","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\n import {copy as cloneDeep} from \"fastest-json-copy\";\n import isEmpty from \"lodash/isEmpty\";\n import isEqual from \"lodash/isEqual\";\n import isObject from \"lodash/isObject\";\n import without from \"lodash/without\";\n import 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    if (!in_object || Array.isArray(in_object) || !isObject(in_object)) {\n        return isEmpty(in_object);\n    }\n\n    // eslint-disable-next-line guard-for-in\n    for (const _entry in in_object) {\n        return false;\n    }\n\n    return true;\n};\n\nexport namespace ChangeSetIndexedCollectionFunctions {\n    /**\n     * Applies a ChangeSet to a given indexed collection property (recursively). The ChangeSet is assumed to be relative\n     * to the same property root and it will be applied behind the base ChangeSet (assuming that the changes are\n     * relative to the state after the base ChangeSet has been applied. It will change the base ChangeSet.\n     *\n     * @param io_basePropertyChanges    - The ChangeSet describing the initial state\n     * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n     * @param in_typeid                 - The typeid of the contents collection\n     *                                                                        (without the collection type)\n     * @param in_options - Optional additional parameters\n     * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n     *                                                       more compact changeset during the apply operation\n     *\n     * @private\n     */\n    export const _performApplyAfterOnPropertyIndexedCollection = function(\n        io_basePropertyChanges: SerializedChangeSet, // eslint-disable-line complexity\n        in_appliedPropertyChanges: SerializedChangeSet,\n        in_typeid: string,\n        in_options: ApplyChangeSetOptions) {\n        const isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n        // Handle remove entry operations\n        if (in_appliedPropertyChanges.remove) {\n            // Get and initialize the corresponding entries in the existing collection\n            let removedEntries = in_appliedPropertyChanges.remove;\n\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.remove = io_basePropertyChanges.remove ||\n                (Array.isArray(in_appliedPropertyChanges.remove) ? [] : {});\n            let baseInserted = io_basePropertyChanges.insert || {};\n            let baseRemoved = io_basePropertyChanges.remove;\n            let baseModified = io_basePropertyChanges.modify;\n            let done = false;\n\n            if (!Array.isArray(removedEntries)) {\n                if (isPrimitiveTypeid) {\n                    removedEntries = Object.keys(removedEntries);\n                } else {\n                    // this is a reversible change set of templated types\n                    const removedTypes = Object.keys(removedEntries);\n                    for (let t = 0; t < removedTypes.length; t++) {\n                        const removedKeys = Object.keys(removedEntries[removedTypes[t]]);\n                        for (let i = 0; i < removedKeys.length; i++) {\n                            if (baseInserted[removedTypes[t]] &&\n                                baseInserted[removedTypes[t]][removedKeys[i]] !== undefined) {\n                                delete baseInserted[removedTypes[t]][removedKeys[i]];\n\n                                // If all entries for a typeid have been removed, we can remove\n                                // the whole typeid from the inserted section\n                                if (baseInserted && isEmpty(baseInserted[removedTypes[t]])) {\n                                    delete baseInserted[removedTypes[t]];\n                                }\n                            } else {\n                                if (baseModified && baseModified[removedTypes[t]] &&\n                                    baseModified[removedTypes[t]][removedKeys[i]] !== undefined) {\n                                    delete baseModified[removedTypes[t]][removedKeys[i]];\n\n                                    // If all entries for a typeid have been removed, we can remove\n                                    // the whole typeid from the inserted section\n                                    if (baseModified && isEmpty(baseModified[removedTypes[t]])) {\n                                        delete baseModified[removedTypes[t]];\n                                    }\n                                }\n                                if (Array.isArray(baseRemoved)) {\n                                    baseRemoved.push(removedKeys[i]);\n                                } else {\n                                    if (!baseRemoved[removedTypes[t]]) {\n                                        baseRemoved[removedTypes[t]] = {};\n                                    }\n                                    baseRemoved[removedTypes[t]][removedKeys[i]] = removedEntries[removedTypes[t]][removedKeys[i]];\n                                }\n                            }\n                        }\n                    }\n                    done = true;\n                }\n            }\n\n            if (!done) {\n                if (isPrimitiveTypeid) {\n                    for (let i = 0; i < removedEntries.length; i++) {\n                        let key = removedEntries[i];\n\n                        // If there is an insert for this key, we just remove it\n                        if (baseInserted[key] !== undefined) {\n                            delete baseInserted[key];\n                        } else {\n                            // There could be a modify entry for this key, which we have to remove\n                            if (baseModified && baseModified[key] !== undefined) {\n                                delete baseModified[key];\n                            }\n\n                            // Otherwise we add it to the remove list\n                            if (Array.isArray(baseRemoved)) {\n                                baseRemoved.push(key);\n                            } else {\n                                baseRemoved[key] = in_appliedPropertyChanges.remove[key];\n                            }\n                        }\n                    }\n                } else {\n                    const baseInsertedTypeids = Object.keys(baseInserted);\n                    for (let i = 0; i < removedEntries.length; i++) {\n                        let key = removedEntries[i];\n                        let foundInTypeid;\n\n                        // Since we only have a flat remove list (without typeid) in the changeset, we have\n                        // to check all inserts\n                        for (let j = 0; j < baseInsertedTypeids.length; j++) {\n                            if (baseInserted[baseInsertedTypeids[j]] &&\n                                baseInserted[baseInsertedTypeids[j]][key] !== undefined) {\n                                foundInTypeid = baseInsertedTypeids[j];\n                                break;\n                            }\n                        }\n\n                        if (foundInTypeid) {\n                            // If this key was inserted by this ChangeSet, we just remove it from the inserted list\n                            delete baseInserted[foundInTypeid][key];\n\n                            // If all entries for a typeid have been removed, we can remove\n                            // the whole typeid from the inserted or modified section\n                            if (baseInserted && isEmpty(baseInserted[foundInTypeid])) {\n                                delete baseInserted[foundInTypeid];\n                            }\n                            if (baseModified && isEmpty(baseModified[foundInTypeid])) {\n                                delete baseModified[foundInTypeid];\n                            }\n                        } else {\n                            // There could be a modify entry for this key, which we have to remove\n                            const baseModifiedTypeids = Object.keys(baseModified || {});\n                            for (let j = 0; j < baseModifiedTypeids.length; j++) {\n                                if (baseModified[baseModifiedTypeids[j]][key]) {\n                                    foundInTypeid = baseModifiedTypeids[j];\n                                    delete baseModified[foundInTypeid][key];\n                                    break;\n                                }\n                            }\n\n                            // Otherwise we add it to the remove list\n                            baseRemoved.push(key);\n                        }\n                    }\n                }\n            }\n        }\n\n        // Apply insert operations\n        if (in_appliedPropertyChanges.insert) {\n            // Get and initialize the corresponding entries from the existing collection\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.insert = io_basePropertyChanges.insert || {};\n            let baseInserted = io_basePropertyChanges.insert;\n            let baseRemoved = io_basePropertyChanges.remove;\n\n            // Insert the inserted entries\n\n            // If no typeids are included, we just use a placeholder for the iteration below\n            const insertedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(in_appliedPropertyChanges.insert);\n            for (let i = 0; i < insertedTypeids.length; i++) {\n                let typeid = insertedTypeids[i];\n                const insertedEntries = isPrimitiveTypeid ?\n                    in_appliedPropertyChanges.insert : in_appliedPropertyChanges.insert[typeid];\n                const insertedKeys = Object.keys(insertedEntries);\n                let removalCS;\n                if (baseRemoved) {\n                    removalCS = isPrimitiveTypeid ? baseRemoved : baseRemoved[typeid];\n                }\n                for (let j = 0; j < insertedKeys.length; j++) {\n                    let key = insertedKeys[j];\n                    let deeplyEqualCS = false;\n\n                    // If we have a complex type in the collection, we need to do a deep comparison of the two\n                    // ChangeSets to determine, whether they are equal\n                    // TODO: We should actually compute a diff between the two and recursively convert portions to modifies\n                    // Instead, right now, we only handle the case where the two keys cancel each out perfectly, i.e.,\n                    // the insert is reinserting exactly what was removed.\n                    if (!isPrimitiveTypeid && removalCS && isObject(removalCS) && removalCS[key] !== undefined) {\n                        // Split out the two parts: all the keys other than remove/insert should match exactly.\n                        // The contents 'remove' and 'insert', if they exist, should also match.\n                        deeplyEqualCS = !!insertedEntries[key].insert === !!removalCS[key].remove;\n\n                        // If there are 'insert' and 'remove', see if the removed data matches the inserted data\n                        if (deeplyEqualCS && insertedEntries[key].insert) {\n                            deeplyEqualCS = isEqual(\n                                insertedEntries[key].insert,\n                                removalCS[key].remove,\n                            );\n                        }\n\n                        // Finally, check if the data being inserted matches the data that was removed\n                        const insertedEntry = isObject(insertedEntries[key]) ? without(insertedEntries[key], \"insert\") : insertedEntries[key];\n                        const removedEntry = isObject(removalCS[key]) ? without(removalCS[key], \"remove\") : removalCS[key];\n                        deeplyEqualCS = deeplyEqualCS && isEqual(insertedEntry, removedEntry);\n                    }\n\n                    if ((isPrimitiveTypeid || TypeIdHelper.isPrimitiveType(typeid) || deeplyEqualCS) &&\n                        removalCS &&\n                        ((Array.isArray(removalCS) && includes(baseRemoved, key)) || removalCS[key] !== undefined)) {\n                        // A remove and insert are combined into a modify for primitive types\n\n                        // Remove the old remove command\n                        let oldValueMatches = false;\n                        if (Array.isArray(removalCS)) {\n                            if (isPrimitiveTypeid) {\n                                io_basePropertyChanges.remove = without(io_basePropertyChanges.remove, key);\n                            } else {\n                                io_basePropertyChanges.remove[typeid] = without(io_basePropertyChanges.remove[typeid], key);\n                            }\n                        } else {\n                            oldValueMatches = deeplyEqualCS || (removalCS[key] === insertedEntries[key]);\n                            delete removalCS[key];\n                        }\n\n                        // Insert a modify command instead\n                        if (!oldValueMatches) {\n                            io_basePropertyChanges.modify = io_basePropertyChanges.modify || {};\n                            if (isPrimitiveTypeid) {\n                                io_basePropertyChanges.modify[key] = insertedEntries[key];\n                            } else {\n                                io_basePropertyChanges.modify[typeid] = io_basePropertyChanges.modify[typeid] || {};\n                                io_basePropertyChanges.modify[typeid][key] = cloneDeep(insertedEntries[key]);\n                            }\n                        }\n                    } else if (isPrimitiveTypeid && baseInserted[key] === undefined) {\n                        baseInserted[key] = insertedEntries[key];\n                    } else if (!isPrimitiveTypeid && (!baseInserted[typeid] || baseInserted[typeid][key] === undefined)) {\n                        baseInserted[typeid] = baseInserted[typeid] || {};\n                        baseInserted[typeid][key] = cloneDeep(insertedEntries[key]);\n                    } else {\n                        throw new Error(MSG.ALREADY_EXISTING_ENTRY + key);\n                    }\n                }\n            }\n        }\n\n        // Handle modification operations\n        if (in_appliedPropertyChanges.modify) {\n            // Get and initialize the corresponding entries from the existing collection\n            const modifiedEntries = in_appliedPropertyChanges.modify;\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.modify = io_basePropertyChanges.modify || {};\n            let baseModified = io_basePropertyChanges.modify;\n            let baseInserted = io_basePropertyChanges.insert || {};\n\n            // Process the modifications\n\n            // If no typeids are included, we just use a placeholder for the iteration below\n            const modifiedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(modifiedEntries);\n            for (let i = 0; i < modifiedTypeids.length; i++) {\n                let typeid = modifiedTypeids[i];\n\n                const modifyKeys = Object.keys(isPrimitiveTypeid ? modifiedEntries : modifiedEntries[typeid]);\n                for (let j = 0; j < modifyKeys.length; j++) {\n                    let key = modifyKeys[j];\n\n                    if (isPrimitiveTypeid) {\n                        let newValue = modifiedEntries[key];\n                        if (newValue && newValue.hasOwnProperty(\"value\")) {\n                            newValue = newValue.value;\n                        }\n                        if (baseInserted[key] !== undefined) {\n                            // If this entry was added by this ChangeSet, we modify the insert operation according to the\n                            // new ChangeSet\n                            baseInserted[key] = newValue;\n                        } else {\n                            if (baseModified[key] && baseModified[key].hasOwnProperty(\"value\")) {\n                                baseModified[key].value = newValue;\n                            } else {\n                                baseModified[key] = newValue;\n                            }\n                        }\n                    } else {\n                        // If this is a polymorphic collection, we can still have individual entries with\n                        // primitive types\n                        const isEntryPrimitiveType = TypeIdHelper.isPrimitiveType(typeid);\n\n                        if (baseInserted[typeid] && baseInserted[typeid][key] !== undefined) {\n                            // If this entry was added by this ChangeSet, we modify the insert operation according to the\n                            // new ChangeSet\n                            if (isEntryPrimitiveType && typeid !== \"String\") {\n                                let newValue = modifiedEntries[typeid][key];\n                                if (newValue && newValue.hasOwnProperty(\"value\")) {\n                                    newValue = modifiedEntries[typeid][key].value;\n                                }\n\n                                // In the case of Int64 or Uint64 we copy the array so that\n                                // both ChangeSets don't point to the same instance\n                                if (typeid === \"Int64\" || typeid === \"Uint64\") {\n                                    newValue = newValue.slice();\n                                }\n\n                                if (baseInserted[typeid][key] && baseInserted[typeid][key].hasOwnProperty(\"value\")) {\n                                    baseInserted[typeid][key].value = newValue;\n                                } else {\n                                    baseInserted[typeid][key] = newValue;\n                                }\n                            } else {\n                                this.performApplyAfterOnPropertyWithTypeid(key,\n                                    baseInserted[typeid],\n                                    modifiedEntries[typeid],\n                                    typeid,\n                                    false,\n                                    in_options);\n                            }\n                        } else if (baseModified[typeid] && baseModified[typeid][key] !== undefined) {\n                            // If there was a previous modification operation, we have to merge the two\n                            if (isEntryPrimitiveType && typeid !== \"String\") {\n                                // Primitive types can simply be overwritten, however we have an exception for\n                                // 64 bit integers (until javascript natively supports them)\n                                if (typeid === \"Int64\" || typeid === \"Uint64\") {\n                                    let appliedVal = modifiedEntries[typeid][key];\n                                    if (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n                                        appliedVal = appliedVal.value;\n                                    }\n                                    baseModified[typeid][key] = appliedVal.slice();\n                                } else {\n                                    baseModified[typeid][key] = modifiedEntries[typeid][key];\n                                }\n                            } else {\n                                this.performApplyAfterOnPropertyWithTypeid(key,\n                                    baseModified[typeid],\n                                    modifiedEntries[typeid],\n                                    typeid,\n                                    true,\n                                    in_options);\n                            }\n                        } else {\n                            baseModified[typeid] = baseModified[typeid] || {};\n                            baseModified[typeid][key] = cloneDeep(modifiedEntries[typeid][key]);\n                        }\n                    }\n                }\n            }\n        }\n\n        // Remove unnecessary entries from the ChangeSet\n        this._cleanIndexedCollectionChangeSet(io_basePropertyChanges, !isPrimitiveTypeid);\n    };\n\n    /**\n     * Performs the rebase operation for set and map collections\n     *\n     * @param in_ownPropertyChangeSet - The ChangeSet for this collection\n     * @param io_rebasePropertyChangeSet - The ChangeSet for the collection to be rebased\n     * @param in_basePath - Base path to get to the property processed by this function\n     * @param in_typeid - The typeid of the contents collection (without the collection type)\n     * @param in_useSquareBracketsInPath -\n     *     If set to true, paths will be created using the angular brackets syntax (for\n     *     arrays), otherwise dots will be used (for NodeProperties)\n     * @param out_conflicts - A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n     *                                                       more compact changeset during the apply operation\n     *\n     * @private\n     */\n    export const _rebaseIndexedCollectionChangeSetForProperty = function(\n        in_ownPropertyChangeSet: SerializedChangeSet, // eslint-disable-line complexity\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_basePath: string,\n        in_typeid: string,\n        in_useSquareBracketsInPath: boolean,\n        out_conflicts: ConflictInfo[],\n        in_options: ApplyChangeSetOptions) {\n        const isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n        const changesByKeys = {};\n        let modifyMap = {};\n        // Helper function which stores the changes indexed by key in the changesByKeys array to\n        // make it easier to compare the related changes in the two ChangeSets\n        const addChanges = function(in_collection: Record<string, any>, in_changeIdentifier: string, in_changePrefix: string, in_typeidChange?: string) {\n            // Collection didn't exist in this ChangeSet\n            if (in_collection === undefined) {\n                return;\n            }\n\n            // For remove operations, the ChangeSet is only an array of keys, otherwise it is a map, so we have to\n            // distinguish the two cases here\n            const keys = Array.isArray(in_collection) ? in_collection : Object.keys(in_collection);\n\n            // Add all entries indexed with the key\n            for (let j = 0; j < keys.length; j++) {\n                const key = keys[j];\n\n                // Store the type of the change\n                changesByKeys[key] = changesByKeys[key] || {};\n                changesByKeys[key][in_changePrefix] = changesByKeys[key][in_changePrefix] ?\n                    `${changesByKeys[key][in_changePrefix]}_${in_changeIdentifier}` :\n                    in_changeIdentifier;\n\n                // If applicable store the typeid of the change\n                if (in_typeidChange) {\n                    changesByKeys[key][`${in_changePrefix}Typeid`] = in_typeidChange;\n                }\n\n                // Store the ChangeSet\n                if (in_changePrefix === \"other\") {\n                    if (!Array.isArray(in_collection)) {\n                        changesByKeys[key].change = in_collection[key];\n                    } else {\n                        changesByKeys[key].change = key;\n                    }\n                }\n            }\n        };\n\n        // Helper function which adds the Changes for a ChangeSet that is ordered by typeid\n        const addChangesWithTypeids = function(in_collection, in_changeIdentifier, in_changePrefix) {\n            if (in_collection === undefined) {\n                return;\n            }\n            // Iterate over the typeids (or use dummy entry for the iteration\n            const addedKeyTypeids = Object.keys(in_collection);\n            for (let i = 0; i < addedKeyTypeids.length; i++) {\n                const Typeid = addedKeyTypeids[i];\n                addChanges(in_collection[Typeid], in_changeIdentifier, in_changePrefix, Typeid);\n            }\n        };\n\n        // Insert all changes from the ChangeSet into the lookup map\n        if (Array.isArray(in_ownPropertyChangeSet.remove)) {\n            addChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n        } else {\n            if (isPrimitiveTypeid) {\n                addChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n            } else {\n                addChangesWithTypeids(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n            }\n        }\n\n        if (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n            addChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n        } else {\n            if (isPrimitiveTypeid) {\n                addChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n            } else {\n                addChangesWithTypeids(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n            }\n        }\n\n        if (isPrimitiveTypeid) {\n            addChanges(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n            addChanges(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n            addChanges(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n            addChanges(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n        } else {\n            addChangesWithTypeids(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n            addChangesWithTypeids(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n            addChangesWithTypeids(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n            addChangesWithTypeids(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n        }\n\n        // Check for modifications that affect the same object\n        const changedKeys = Object.keys(changesByKeys);\n        for (let i = 0; i < changedKeys.length; i++) {\n            const key = changedKeys[i];\n            const newPath = in_useSquareBracketsInPath ?\n                `${in_basePath}[${PathHelper.quotePathSegmentIfNeeded(key)}]` :\n                joinPaths(in_basePath, PathHelper.quotePathSegmentIfNeeded(key), PROPERTY_PATH_DELIMITER);\n\n            const modification = changesByKeys[key];\n            if (modification.own && modification.other) {\n                /*\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                // A key was modified after it had been removed\n                if (modification.own === \"modify\" && modification.other === \"modify\") {\n                    if (isPrimitiveTypeid ||\n                        (TypeIdHelper.isPrimitiveType(modification.ownTypeid) && modification.ownTypeid !== \"String\")) {\n                        // We have two modification operations that affect the same entry for a base type.\n                        // This is a legal operation, the second one will overwrite the first one, but we\n                        // report it as a possible conflict\n                        let ownModify = in_ownPropertyChangeSet.modify;\n                        let rebasedModify = io_rebasePropertyChangeSet.modify;\n                        if (modification.otherTypeid) {\n                            ownModify = ownModify[modification.otherTypeid];\n                            rebasedModify = rebasedModify[modification.otherTypeid];\n                        }\n\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.COLLIDING_SET,\n                            conflictingChange: ownModify[key],\n                        };\n                        out_conflicts.push(conflict);\n                        // If value is the same, delete the entry\n                        let ownValue = ownModify[key];\n                        if (typeof ownValue === \"object\" && ownValue.hasOwnProperty(\"value\")) {\n                            ownValue = ownValue.value;\n                        }\n                        let rebaseValue = rebasedModify[key];\n                        if (typeof rebaseValue === \"object\" && rebaseValue.hasOwnProperty(\"value\")) {\n                            rebaseValue = rebaseValue.value;\n                        }\n                        if (modification.ownTypeid === \"Int64\" || modification.ownTypeid === \"Uint64\" || ownValue.length === 2) {\n                            // For (u)int64, values are arrays of 2 elements\n                            if (ownValue[0] === rebaseValue[0] && ownValue[1] === rebaseValue[1]) {\n                                delete rebasedModify[key];\n                            }\n                        } else {\n                            if (ownValue === rebaseValue) {\n                                delete rebasedModify[key];\n                            }\n                        }\n                    } else {\n                        this.rebaseChangeSetForPropertyEntryWithTypeid(key,\n                            in_ownPropertyChangeSet.modify[modification.ownTypeid],\n                            io_rebasePropertyChangeSet.modify[modification.otherTypeid],\n                            modification.ownTypeid,\n                            newPath,\n                            true,\n                            out_conflicts,\n                            in_options);\n                    }\n                } else if (modification.own === \"remove\" && modification.other === \"modify\") {\n                    modifyMap = modification.otherTypeid ? io_rebasePropertyChangeSet.modify[modification.otherTypeid] :\n                        io_rebasePropertyChangeSet.modify;\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.ENTRY_MODIFIED_AFTER_REMOVE,\n                        conflictingChange: modifyMap[key],\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Delete the modification from the rebased ChangeSet\n                    delete modifyMap[key];\n                } else if (modification.own === \"remove_insert\" && modification.other === \"modify\") {\n                    // We have a conflicting change. A node was removed and inserted (replaced) in the original\n                    // ChangeSet and then modified by the rebased ChangeSet. Since the base of the modification\n                    // can have been changed significantly by this operation, we don't know whether we can\n                    // apply the modification\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.ENTRY_MODIFICATION_AFTER_REMOVE_INSERT,\n                        conflictingChange: io_rebasePropertyChangeSet.modify[modification.otherTypeid][key],\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Delete the modification from the rebased ChangeSet\n                    delete io_rebasePropertyChangeSet.modify[key];\n                } else if ((modification.own === \"modify\" || modification.own === \"remove\") &&\n                    (modification.other === \"remove\" || modification.other === \"remove_insert\")) {\n                    if (modification.own === \"modify\") {\n                        modifyMap = modification.ownTypeid ? in_ownPropertyChangeSet.modify[modification.ownTypeid] :\n                            in_ownPropertyChangeSet.modify;\n\n                        // Create the conflict information\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.REMOVE_AFTER_MODIFY,\n                            conflictingChange: modifyMap[key],\n                        };\n                        out_conflicts.push(conflict);\n                    }\n\n                    // If we have a duplicated delete, we remove it from the new ChangeSet\n                    if (modification.own === \"remove\") {\n                        if (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n                            io_rebasePropertyChangeSet.remove = without(io_rebasePropertyChangeSet.remove, key);\n                        } else {\n                            if (isPrimitiveTypeid) {\n                                delete io_rebasePropertyChangeSet.remove[key];\n                            } else {\n                                delete io_rebasePropertyChangeSet.remove[modification.otherTypeid][key];\n                            }\n                        }\n                    }\n                } else if (modification.own === \"insert\" && modification.other === \"insert\") {\n                    if (isPrimitiveTypeid ||\n                        (TypeIdHelper.isPrimitiveType(modification.ownTypeid))) {\n                        let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                            io_rebasePropertyChangeSet.insert;\n\n                        // We have two insert operations that affect the same key for a primitive type.\n                        // This is a legal operation, the second one will overwrite the first one, but we\n                        // report it as a possible conflicting set\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.COLLIDING_SET,\n                            conflictingChange: insertMap[key],\n                        };\n                        out_conflicts.push(conflict);\n\n                        // Convert to modify\n                        let oldValue;\n                        if (modification.otherTypeid) {\n                            io_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify || {};\n                            io_rebasePropertyChangeSet.modify[modification.otherTypeid] =\n                                io_rebasePropertyChangeSet.modify[modification.otherTypeid] || {};\n                            modifyMap = io_rebasePropertyChangeSet.modify[modification.otherTypeid];\n                            oldValue = in_ownPropertyChangeSet.insert[modification.ownTypeid][key];\n                        } else {\n                            io_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify || {};\n                            modifyMap = io_rebasePropertyChangeSet.modify;\n                            oldValue = in_ownPropertyChangeSet.insert[key];\n                        }\n\n                        modifyMap[key] = { value: insertMap[key], oldValue };\n                        delete insertMap[key];\n                    } else {\n                        // Here we have two insert operations for objects. Since these affect a whole sub-tree and not\n                        // just a single value, we cannot easily convert it into a modify and instead report it as invalid\n\n                        let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                            io_rebasePropertyChangeSet.insert;\n\n                        // Create the conflict information\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.INSERTED_ENTRY_WITH_SAME_KEY,\n                            conflictingChange: insertMap[key],\n                        };\n                        out_conflicts.push(conflict);\n\n                        // Delete the modification from the rebased ChangeSet\n                        delete insertMap[key];\n                    }\n                } else if (modification.own === \"remove_insert\" && modification.other === \"remove_insert\") {\n                    let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                        io_rebasePropertyChangeSet.insert;\n\n                    // Raise the duplicate inserts as a conflict\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.COLLIDING_SET,\n                        conflictingChange: insertMap[key],\n                    };\n                    out_conflicts.push(conflict);\n                } else {\n                    // All other operations are conflicting changes, which only occur for ChangeSets that are relative\n                    // to different bases\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.INVALID_CHANGESET_BASE,\n                        conflictingChange: modification.change,\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Remove the change from the ChangeSet\n                    if (modification.other !== \"remove\") {\n                        if (modification.otherTypeid !== undefined) {\n                            delete io_rebasePropertyChangeSet[modification.other][modification.otherTypeid][key];\n                        } else {\n                            delete io_rebasePropertyChangeSet[modification.other][key];\n                        }\n                    } else {\n                        // Remove remove operations from the ChangeSet\n                        if (Array.isArray(io_rebasePropertyChangeSet[modification.other])) {\n                            io_rebasePropertyChangeSet[modification.other] =\n                                without(io_rebasePropertyChangeSet[modification.other], key);\n                        } else {\n                            delete io_rebasePropertyChangeSet[modification.other][key];\n                        }\n                    }\n\n                    console.error(\"Rebase operation with conflicting ChangeSets. Probably incorrect bases.\");\n                }\n            }\n        }\n\n        // Remove unnecessary entries from the ChangeSet\n        this._cleanIndexedCollectionChangeSet(io_rebasePropertyChangeSet, !isPrimitiveTypeid);\n    };\n\n    /**\n     * Removes empty entries from the .children collection of the ChangeSet\n     *\n     * @param in_propertyChanges - The ChangeSet to clean up\n     * @param in_containsTypeids - Does this ChangeSet contain typeids\n     * @private\n     */\n    export const _cleanIndexedCollectionChangeSet = function(in_propertyChanges: SerializedChangeSet, in_containsTypeids: boolean) {\n        const changes = in_propertyChanges;\n        // Clean inserts\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.insert || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                if (_fastIsEmptyObject(changes.insert[typeidList[j]])) {\n                    delete changes.insert[typeidList[j]];\n                }\n            }\n        }\n\n        // Remove add group if no operations are present\n        if (_fastIsEmptyObject(changes.insert)) {\n            delete changes.insert;\n        }\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.remove || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                if (_fastIsEmptyObject(changes.remove[typeidList[j]])) {\n                    delete changes.remove[typeidList[j]];\n                }\n            }\n        }\n        // Remove remove group if no operations are present\n        if (_fastIsEmptyObject(changes.remove)) {\n            delete changes.remove;\n        }\n\n        // Clean modifies\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.modify || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                const modifies = changes.modify[typeidList[j]];\n                const modifyKeys = Object.keys(modifies);\n                for (let k = 0; k < modifyKeys.length; k++) {\n                    if (isEmptyChangeSet(modifies[modifyKeys[k]])) {\n                        delete modifies[modifyKeys[k]];\n                    }\n                }\n                if (_fastIsEmptyObject(changes.modify[typeidList[j]])) {\n                    delete changes.modify[typeidList[j]];\n                }\n            }\n        }\n\n        // Remove modify group if no operations are present\n        if (_fastIsEmptyObject(changes.modify)) {\n            delete changes.modify;\n        }\n    };\n}\n"]}
+{"version":3,"file":"indexedCollection.js","sourceRoot":"","sources":["../../src/changeset_operations/indexedCollection.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;;;;AAEF,yDAAsD;AACtD,6DAAqC;AACrC,6DAAqC;AACrC,+DAAuC;AACvC,6DAAqC;AACrC,+DAAuC;AAExC,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,UAAS,SAAc;IAC9C,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAA,kBAAQ,EAAC,SAAS,CAAC,EAAE;QAChE,OAAO,IAAA,iBAAO,EAAC,SAAS,CAAC,CAAC;KAC7B;IAED,wCAAwC;IACxC,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE;QAC5B,OAAO,KAAK,CAAC;KAChB;IAED,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF,IAAiB,mCAAmC,CA+vBnD;AA/vBD,WAAiB,mCAAmC;IAChD;;;;;;;;;;;;;;OAcG;IACU,iFAA6C,GAAG,UACzD,sBAA2C,EAAE,iCAAiC;IAC9E,yBAA8C,EAC9C,SAAiB,EACjB,UAAiC;QACjC,MAAM,iBAAiB,GAAG,2BAAY,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QAElE,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,0EAA0E;YAC1E,IAAI,cAAc,GAAG,yBAAyB,CAAC,MAAM,CAAC;YAEtD,sBAAsB,GAAG,sBAAsB,IAAI,EAAE,CAAC;YACtD,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM;gBACzD,CAAC,KAAK,CAAC,OAAO,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChE,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;gBAChC,IAAI,iBAAiB,EAAE;oBACnB,cAAc,GAAG,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;iBAChD;qBAAM;oBACH,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;wBAC1C,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;4BACzC,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gCAC7B,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;gCAC7D,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;oCACxD,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;iCACxC;6BACJ;iCAAM;gCACH,IAAI,YAAY,IAAI,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;oCAC7C,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;oCAC7D,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;wCACxD,OAAO,YAAY,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qCACxC;iCACJ;gCACD,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;oCAC5B,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCACpC;qCAAM;oCACH,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;wCAC/B,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;qCACrC;oCACD,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;iCAClG;6BACJ;yBACJ;qBACJ;oBACD,IAAI,GAAG,IAAI,CAAC;iBACf;aACJ;YAED,IAAI,CAAC,IAAI,EAAE;gBACP,IAAI,iBAAiB,EAAE;oBACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC5C,IAAI,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;wBAE5B,wDAAwD;wBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACjC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;yBAC5B;6BAAM;4BACH,sEAAsE;4BACtE,IAAI,YAAY,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACjD,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC;6BAC5B;4BAED,yCAAyC;4BACzC,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;gCAC5B,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;6BACzB;iCAAM;gCACH,WAAW,CAAC,GAAG,CAAC,GAAG,yBAAyB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BAC5D;yBACJ;qBACJ;iBACJ;qBAAM;oBACH,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;wBAC5C,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;4BACjD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACpC,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;gCACzD,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;gCACvC,MAAM;6BACT;yBACJ;wBAED,IAAI,aAAa,EAAE;4BACf,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;gCACtD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACtC;4BACD,IAAI,YAAY,IAAI,IAAA,iBAAO,EAAC,YAAY,CAAC,aAAa,CAAC,CAAC,EAAE;gCACtD,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;6BACtC;yBACJ;6BAAM;4BACH,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;gCACjD,IAAI,YAAY,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;oCAC3C,aAAa,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;oCACvC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC;oCACxC,MAAM;iCACT;6BACJ;4BAED,yCAAyC;4BACzC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;yBACzB;qBACJ;iBACJ;aACJ;SACJ;QAED,0BAA0B;QAC1B,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,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,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC;YACxG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC7C,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC;oBACvC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,yBAAyB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAChF,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;gBAClD,IAAI,SAAS,CAAC;gBACd,IAAI,WAAW,EAAE;oBACb,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;iBACrE;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC1C,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,IAAI,CAAC,iBAAiB,IAAI,SAAS,IAAI,IAAA,kBAAQ,EAAC,SAAS,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBACxF,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;4BAC9C,aAAa,GAAG,IAAA,iBAAO,EACnB,eAAe,CAAC,GAAG,CAAC,CAAC,MAAM,EAC3B,SAAS,CAAC,GAAG,CAAC,CAAC,MAAM,CACxB,CAAC;yBACL;wBAED,8EAA8E;wBAC9E,MAAM,aAAa,GAAG,IAAA,kBAAQ,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAO,EAAC,eAAe,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;wBACtH,MAAM,YAAY,GAAG,IAAA,kBAAQ,EAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAA,iBAAO,EAAC,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;wBACnG,aAAa,GAAG,aAAa,IAAI,IAAA,iBAAO,EAAC,aAAa,EAAE,YAAY,CAAC,CAAC;qBACzE;oBAED,IAAI,CAAC,iBAAiB,IAAI,2BAAY,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC;wBAC5E,SAAS;wBACT,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,IAAA,kBAAQ,EAAC,WAAW,EAAE,GAAG,CAAC,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE;wBAC5F,qEAAqE;wBAErE,gCAAgC;wBAChC,IAAI,eAAe,GAAG,KAAK,CAAC;wBAC5B,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;4BAC1B,IAAI,iBAAiB,EAAE;gCACnB,sBAAsB,CAAC,MAAM,GAAG,IAAA,iBAAO,EAAC,sBAAsB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;6BAC/E;iCAAM;gCACH,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,IAAA,iBAAO,EAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;6BAC/F;yBACJ;6BAAM;4BACH,eAAe,GAAG,aAAa,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC7E,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;yBACzB;wBAED,kCAAkC;wBAClC,IAAI,CAAC,eAAe,EAAE;4BAClB,sBAAsB,CAAC,MAAM,GAAG,sBAAsB,CAAC,MAAM,IAAI,EAAE,CAAC;4BACpE,IAAI,iBAAiB,EAAE;gCACnB,sBAAsB,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;6BAC7D;iCAAM;gCACH,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gCACpF,sBAAsB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,IAAA,wBAAS,EAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;6BAChF;yBACJ;qBACJ;yBAAM,IAAI,iBAAiB,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;wBAC7D,YAAY,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;qBAC5C;yBAAM,IAAI,CAAC,iBAAiB,IAAI,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,EAAE;wBACjG,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;qBAC/D;yBAAM;wBACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,sBAAsB,GAAG,GAAG,CAAC,CAAC;qBACrD;iBACJ;aACJ;SACJ;QAED,iCAAiC;QACjC,IAAI,yBAAyB,CAAC,MAAM,EAAE;YAClC,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;gBAC7C,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAEhC,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC9F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACxC,IAAI,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,iBAAiB,EAAE;wBACnB,IAAI,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC;wBACpC,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BAC9C,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC7B;wBACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACjC,6FAA6F;4BAC7F,gBAAgB;4BAChB,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;yBAChC;6BAAM;4BACH,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;gCAChE,YAAY,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;6BACtC;iCAAM;gCACH,YAAY,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;6BAChC;yBACJ;qBACJ;yBAAM;wBACH,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;4BACjE,6FAA6F;4BAC7F,gBAAgB;4BAChB,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAC7C,IAAI,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;gCAC5C,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAC9C,QAAQ,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;iCACjD;gCAED,2DAA2D;gCAC3D,mDAAmD;gCACnD,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC3C,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;iCAC/B;gCAED,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;oCAChF,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC;iCAC9C;qCAAM;oCACH,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,CAAC;iCACxC;6BACJ;iCAAM;gCACH,IAAI,CAAC,qCAAqC,CAAC,GAAG,EAC1C,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,KAAK,EACL,UAAU,CAAC,CAAC;6BACnB;yBACJ;6BAAM,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;4BACxE,2EAA2E;4BAC3E,IAAI,oBAAoB,IAAI,MAAM,KAAK,QAAQ,EAAE;gCAC7C,8EAA8E;gCAC9E,4DAA4D;gCAC5D,IAAI,MAAM,KAAK,OAAO,IAAI,MAAM,KAAK,QAAQ,EAAE;oCAC3C,IAAI,UAAU,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;oCAC9C,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;wCAClD,UAAU,GAAG,UAAU,CAAC,KAAK,CAAC;qCACjC;oCACD,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;iCAClD;qCAAM;oCACH,YAAY,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;iCAC5D;6BACJ;iCAAM;gCACH,IAAI,CAAC,qCAAqC,CAAC,GAAG,EAC1C,YAAY,CAAC,MAAM,CAAC,EACpB,eAAe,CAAC,MAAM,CAAC,EACvB,MAAM,EACN,IAAI,EACJ,UAAU,CAAC,CAAC;6BACnB;yBACJ;6BAAM;4BACH,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;yBACvE;qBACJ;iBACJ;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,sBAAsB,EAAE,CAAC,iBAAiB,CAAC,CAAC;IACtF,CAAC,CAAC;IAEF;;;;;;;;;;;;;;;;OAgBG;IACU,gFAA4C,GAAG,UACxD,uBAA4C,EAAE,iCAAiC;IAC/E,0BAA+C,EAC/C,WAAmB,EACnB,SAAiB,EACjB,0BAAmC,EACnC,aAA6B,EAC7B,UAAiC;QACjC,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,UAAS,aAAkC,EAAE,mBAA2B,EAAE,eAAuB,EAAE,eAAwB;YAC1I,4CAA4C;YAC5C,IAAI,aAAa,KAAK,SAAS,EAAE;gBAC7B,OAAO;aACV;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;gBAClC,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,CAAC,CAAC;oBACvE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,eAAe,CAAC,IAAI,mBAAmB,EAAE,CAAC,CAAC;oBACjE,mBAAmB,CAAC;gBAExB,+CAA+C;gBAC/C,IAAI,eAAe,EAAE;oBACjB,aAAa,CAAC,GAAG,CAAC,CAAC,GAAG,eAAe,QAAQ,CAAC,GAAG,eAAe,CAAC;iBACpE;gBAED,sBAAsB;gBACtB,IAAI,eAAe,KAAK,OAAO,EAAE;oBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;wBAC/B,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;qBAClD;yBAAM;wBACH,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC;qBACnC;iBACJ;aACJ;QACL,CAAC,CAAC;QAEF,mFAAmF;QACnF,MAAM,qBAAqB,GAAG,UAAS,aAAa,EAAE,mBAAmB,EAAE,eAAe;YACtF,IAAI,aAAa,KAAK,SAAS,EAAE;gBAC7B,OAAO;aACV;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;gBAC7C,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;gBAClC,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,mBAAmB,EAAE,eAAe,EAAE,MAAM,CAAC,CAAC;aACnF;QACL,CAAC,CAAC;QAEF,4DAA4D;QAC5D,IAAI,KAAK,CAAC,OAAO,CAAC,uBAAuB,CAAC,MAAM,CAAC,EAAE;YAC/C,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;SAC/D;aAAM;YACH,IAAI,iBAAiB,EAAE;gBACnB,UAAU,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC/D;iBAAM;gBACH,qBAAqB,CAAC,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;aAC1E;SACJ;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;YAClD,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACpE;aAAM;YACH,IAAI,iBAAiB,EAAE;gBACnB,UAAU,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aACpE;iBAAM;gBACH,qBAAqB,CAAC,0BAA0B,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;aAC/E;SACJ;QAED,IAAI,iBAAiB,EAAE;YACnB,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;SACpE;aAAM;YACH,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;SAC/E;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;YACzC,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,OAAO,GAAG,0BAA0B,CAAC,CAAC;gBACxC,GAAG,WAAW,IAAI,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC/D,IAAA,2BAAS,EAAC,WAAW,EAAE,uBAAU,CAAC,wBAAwB,CAAC,GAAG,CAAC,EAAE,uBAAuB,CAAC,CAAC;YAE9F,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACxC,IAAI,YAAY,CAAC,GAAG,IAAI,YAAY,CAAC,KAAK,EAAE;gBACxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA+BE;gBAEF,+CAA+C;gBAC/C,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAClE,IAAI,iBAAiB;wBACjB,CAAC,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,YAAY,CAAC,SAAS,KAAK,QAAQ,CAAC,EAAE;wBAC/F,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;4BAC1B,SAAS,GAAG,SAAS,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;4BAChD,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;yBAC3D;wBAED,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,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;4BAClE,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;yBAC7B;wBACD,IAAI,WAAW,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;wBACrC,IAAI,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,cAAc,CAAC,OAAO,CAAC,EAAE;4BACxE,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;yBACnC;wBACD,IAAI,YAAY,CAAC,SAAS,KAAK,OAAO,IAAI,YAAY,CAAC,SAAS,KAAK,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;4BACpG,gDAAgD;4BAChD,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE;gCAClE,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC7B;yBACJ;6BAAM;4BACH,IAAI,QAAQ,KAAK,WAAW,EAAE;gCAC1B,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC;6BAC7B;yBACJ;qBACJ;yBAAM;wBACH,IAAI,CAAC,yCAAyC,CAAC,GAAG,EAC9C,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,CAAC,CAAC;qBACnB;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACzE,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;wBAChG,0BAA0B,CAAC,MAAM,CAAC;oBAEtC,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,2BAA2B;wBAC9C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACpC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;iBACzB;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBAChF,2FAA2F;oBAC3F,2FAA2F;oBAC3F,sFAAsF;oBACtF,yBAAyB;oBAEzB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,sCAAsC;wBACzD,iBAAiB,EAAE,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC;qBACtF,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,qDAAqD;oBACrD,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;iBACjD;qBAAM,IAAI,CAAC,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,CAAC;oBACvE,CAAC,YAAY,CAAC,KAAK,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,CAAC,EAAE;oBAC7E,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAC/B,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,uBAAuB,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;4BACzF,uBAAuB,CAAC,MAAM,CAAC;wBAEnC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,mBAAmB;4BACtC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBAChC;oBAED,sEAAsE;oBACtE,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,EAAE;wBAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,MAAM,CAAC,EAAE;4BAClD,0BAA0B,CAAC,MAAM,GAAG,IAAA,iBAAO,EAAC,0BAA0B,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;yBACvF;6BAAM;4BACH,IAAI,iBAAiB,EAAE;gCACnB,OAAO,0BAA0B,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;6BACjD;iCAAM;gCACH,OAAO,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;6BAC3E;yBACJ;qBACJ;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,QAAQ,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;oBACzE,IAAI,iBAAiB;wBACjB,CAAC,2BAAY,CAAC,eAAe,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,EAAE;wBACxD,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;4BACpG,0BAA0B,CAAC,MAAM,CAAC;wBAEtC,+EAA+E;wBAC/E,iFAAiF;wBACjF,0CAA0C;wBAC1C,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,aAAa;4BAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,oBAAoB;wBACpB,IAAI,QAAQ,CAAC;wBACb,IAAI,YAAY,CAAC,WAAW,EAAE;4BAC1B,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC;gCACvD,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;4BACtE,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;yBAC1E;6BAAM;4BACH,0BAA0B,CAAC,MAAM,GAAG,0BAA0B,CAAC,MAAM,IAAI,EAAE,CAAC;4BAC5E,SAAS,GAAG,0BAA0B,CAAC,MAAM,CAAC;4BAC9C,QAAQ,GAAG,uBAAuB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;yBAClD;wBAED,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACzB;yBAAM;wBACH,8FAA8F;wBAC9F,kGAAkG;wBAElG,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;4BACpG,0BAA0B,CAAC,MAAM,CAAC;wBAEtC,kCAAkC;wBAClC,IAAI,QAAQ,GAAG;4BACX,IAAI,EAAE,OAAO;4BACb,IAAI,EAAE,qCAAY,CAAC,4BAA4B;4BAC/C,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;yBACpC,CAAC;wBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAE7B,qDAAqD;wBACrD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC;qBACzB;iBACJ;qBAAM,IAAI,YAAY,CAAC,GAAG,KAAK,eAAe,IAAI,YAAY,CAAC,KAAK,KAAK,eAAe,EAAE;oBACvF,IAAI,SAAS,GAAG,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC,0BAA0B,CAAC,MAAM,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,CAAC;wBACpG,0BAA0B,CAAC,MAAM,CAAC;oBAEtC,4CAA4C;oBAC5C,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,aAAa;wBAChC,iBAAiB,EAAE,SAAS,CAAC,GAAG,CAAC;qBACpC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBAChC;qBAAM;oBACH,kGAAkG;oBAClG,qBAAqB;oBAErB,kCAAkC;oBAClC,IAAI,QAAQ,GAAG;wBACX,IAAI,EAAE,OAAO;wBACb,IAAI,EAAE,qCAAY,CAAC,sBAAsB;wBACzC,iBAAiB,EAAE,YAAY,CAAC,MAAM;qBACzC,CAAC;oBACF,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAE7B,uCAAuC;oBACvC,IAAI,YAAY,CAAC,KAAK,KAAK,QAAQ,EAAE;wBACjC,IAAI,YAAY,CAAC,WAAW,KAAK,SAAS,EAAE;4BACxC,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;yBACxF;6BAAM;4BACH,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC9D;qBACJ;yBAAM;wBACH,8CAA8C;wBAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE;4BAC/D,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC;gCAC1C,IAAA,iBAAO,EAAC,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC;yBACpE;6BAAM;4BACH,OAAO,0BAA0B,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;yBAC9D;qBACJ;oBAED,OAAO,CAAC,KAAK,CAAC,yEAAyE,CAAC,CAAC;iBAC5F;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,CAAC,gCAAgC,CAAC,0BAA0B,EAAE,CAAC,iBAAiB,CAAC,CAAC;IAC1F,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,oEAAgC,GAAG,UAAS,kBAAuC,EAAE,kBAA2B;QACzH,MAAM,OAAO,GAAG,kBAAkB,CAAC;QACnC,gBAAgB;QAEhB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QAED,gDAAgD;QAChD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;QAED,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QACD,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;QAED,iBAAiB;QAEjB,sCAAsC;QACtC,IAAI,kBAAkB,EAAE;YACpB,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;gBACxC,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;oBACxC,IAAI,IAAA,mCAAgB,EAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;wBAC3C,OAAO,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;qBAClC;iBACJ;gBACD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACnD,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;aACJ;SACJ;QAED,mDAAmD;QACnD,IAAI,kBAAkB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC;SACzB;IACL,CAAC,CAAC;AACN,CAAC,EA/vBgB,mCAAmC,GAAnC,2CAAmC,KAAnC,2CAAmC,QA+vBnD","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\n import { copy as cloneDeep } from \"fastest-json-copy\";\n import isEmpty from \"lodash/isEmpty\";\n import isEqual from \"lodash/isEqual\";\n import isObject from \"lodash/isObject\";\n import without from \"lodash/without\";\n import 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    if (!in_object || Array.isArray(in_object) || !isObject(in_object)) {\n        return isEmpty(in_object);\n    }\n\n    // eslint-disable-next-line guard-for-in\n    for (const _entry in in_object) {\n        return false;\n    }\n\n    return true;\n};\n\nexport namespace ChangeSetIndexedCollectionFunctions {\n    /**\n     * Applies a ChangeSet to a given indexed collection property (recursively). The ChangeSet is assumed to be relative\n     * to the same property root and it will be applied behind the base ChangeSet (assuming that the changes are\n     * relative to the state after the base ChangeSet has been applied. It will change the base ChangeSet.\n     *\n     * @param io_basePropertyChanges    - The ChangeSet describing the initial state\n     * @param in_appliedPropertyChanges - The ChangeSet to apply to this state\n     * @param in_typeid                 - The typeid of the contents collection\n     *                                                                        (without the collection type)\n     * @param in_options - Optional additional parameters\n     * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n     *                                                       more compact changeset during the apply operation\n     *\n     * @private\n     */\n    export const _performApplyAfterOnPropertyIndexedCollection = function(\n        io_basePropertyChanges: SerializedChangeSet, // eslint-disable-line complexity\n        in_appliedPropertyChanges: SerializedChangeSet,\n        in_typeid: string,\n        in_options: ApplyChangeSetOptions) {\n        const isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n        // Handle remove entry operations\n        if (in_appliedPropertyChanges.remove) {\n            // Get and initialize the corresponding entries in the existing collection\n            let removedEntries = in_appliedPropertyChanges.remove;\n\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.remove = io_basePropertyChanges.remove ||\n                (Array.isArray(in_appliedPropertyChanges.remove) ? [] : {});\n            let baseInserted = io_basePropertyChanges.insert || {};\n            let baseRemoved = io_basePropertyChanges.remove;\n            let baseModified = io_basePropertyChanges.modify;\n            let done = false;\n\n            if (!Array.isArray(removedEntries)) {\n                if (isPrimitiveTypeid) {\n                    removedEntries = Object.keys(removedEntries);\n                } else {\n                    // this is a reversible change set of templated types\n                    const removedTypes = Object.keys(removedEntries);\n                    for (let t = 0; t < removedTypes.length; t++) {\n                        const removedKeys = Object.keys(removedEntries[removedTypes[t]]);\n                        for (let i = 0; i < removedKeys.length; i++) {\n                            if (baseInserted[removedTypes[t]] &&\n                                baseInserted[removedTypes[t]][removedKeys[i]] !== undefined) {\n                                delete baseInserted[removedTypes[t]][removedKeys[i]];\n\n                                // If all entries for a typeid have been removed, we can remove\n                                // the whole typeid from the inserted section\n                                if (baseInserted && isEmpty(baseInserted[removedTypes[t]])) {\n                                    delete baseInserted[removedTypes[t]];\n                                }\n                            } else {\n                                if (baseModified && baseModified[removedTypes[t]] &&\n                                    baseModified[removedTypes[t]][removedKeys[i]] !== undefined) {\n                                    delete baseModified[removedTypes[t]][removedKeys[i]];\n\n                                    // If all entries for a typeid have been removed, we can remove\n                                    // the whole typeid from the inserted section\n                                    if (baseModified && isEmpty(baseModified[removedTypes[t]])) {\n                                        delete baseModified[removedTypes[t]];\n                                    }\n                                }\n                                if (Array.isArray(baseRemoved)) {\n                                    baseRemoved.push(removedKeys[i]);\n                                } else {\n                                    if (!baseRemoved[removedTypes[t]]) {\n                                        baseRemoved[removedTypes[t]] = {};\n                                    }\n                                    baseRemoved[removedTypes[t]][removedKeys[i]] = removedEntries[removedTypes[t]][removedKeys[i]];\n                                }\n                            }\n                        }\n                    }\n                    done = true;\n                }\n            }\n\n            if (!done) {\n                if (isPrimitiveTypeid) {\n                    for (let i = 0; i < removedEntries.length; i++) {\n                        let key = removedEntries[i];\n\n                        // If there is an insert for this key, we just remove it\n                        if (baseInserted[key] !== undefined) {\n                            delete baseInserted[key];\n                        } else {\n                            // There could be a modify entry for this key, which we have to remove\n                            if (baseModified && baseModified[key] !== undefined) {\n                                delete baseModified[key];\n                            }\n\n                            // Otherwise we add it to the remove list\n                            if (Array.isArray(baseRemoved)) {\n                                baseRemoved.push(key);\n                            } else {\n                                baseRemoved[key] = in_appliedPropertyChanges.remove[key];\n                            }\n                        }\n                    }\n                } else {\n                    const baseInsertedTypeids = Object.keys(baseInserted);\n                    for (let i = 0; i < removedEntries.length; i++) {\n                        let key = removedEntries[i];\n                        let foundInTypeid;\n\n                        // Since we only have a flat remove list (without typeid) in the changeset, we have\n                        // to check all inserts\n                        for (let j = 0; j < baseInsertedTypeids.length; j++) {\n                            if (baseInserted[baseInsertedTypeids[j]] &&\n                                baseInserted[baseInsertedTypeids[j]][key] !== undefined) {\n                                foundInTypeid = baseInsertedTypeids[j];\n                                break;\n                            }\n                        }\n\n                        if (foundInTypeid) {\n                            // If this key was inserted by this ChangeSet, we just remove it from the inserted list\n                            delete baseInserted[foundInTypeid][key];\n\n                            // If all entries for a typeid have been removed, we can remove\n                            // the whole typeid from the inserted or modified section\n                            if (baseInserted && isEmpty(baseInserted[foundInTypeid])) {\n                                delete baseInserted[foundInTypeid];\n                            }\n                            if (baseModified && isEmpty(baseModified[foundInTypeid])) {\n                                delete baseModified[foundInTypeid];\n                            }\n                        } else {\n                            // There could be a modify entry for this key, which we have to remove\n                            const baseModifiedTypeids = Object.keys(baseModified || {});\n                            for (let j = 0; j < baseModifiedTypeids.length; j++) {\n                                if (baseModified[baseModifiedTypeids[j]][key]) {\n                                    foundInTypeid = baseModifiedTypeids[j];\n                                    delete baseModified[foundInTypeid][key];\n                                    break;\n                                }\n                            }\n\n                            // Otherwise we add it to the remove list\n                            baseRemoved.push(key);\n                        }\n                    }\n                }\n            }\n        }\n\n        // Apply insert operations\n        if (in_appliedPropertyChanges.insert) {\n            // Get and initialize the corresponding entries from the existing collection\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.insert = io_basePropertyChanges.insert || {};\n            let baseInserted = io_basePropertyChanges.insert;\n            let baseRemoved = io_basePropertyChanges.remove;\n\n            // Insert the inserted entries\n\n            // If no typeids are included, we just use a placeholder for the iteration below\n            const insertedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(in_appliedPropertyChanges.insert);\n            for (let i = 0; i < insertedTypeids.length; i++) {\n                let typeid = insertedTypeids[i];\n                const insertedEntries = isPrimitiveTypeid ?\n                    in_appliedPropertyChanges.insert : in_appliedPropertyChanges.insert[typeid];\n                const insertedKeys = Object.keys(insertedEntries);\n                let removalCS;\n                if (baseRemoved) {\n                    removalCS = isPrimitiveTypeid ? baseRemoved : baseRemoved[typeid];\n                }\n                for (let j = 0; j < insertedKeys.length; j++) {\n                    let key = insertedKeys[j];\n                    let deeplyEqualCS = false;\n\n                    // If we have a complex type in the collection, we need to do a deep comparison of the two\n                    // ChangeSets to determine, whether they are equal\n                    // TODO: We should actually compute a diff between the two and recursively convert portions to modifies\n                    // Instead, right now, we only handle the case where the two keys cancel each out perfectly, i.e.,\n                    // the insert is reinserting exactly what was removed.\n                    if (!isPrimitiveTypeid && removalCS && isObject(removalCS) && removalCS[key] !== undefined) {\n                        // Split out the two parts: all the keys other than remove/insert should match exactly.\n                        // The contents 'remove' and 'insert', if they exist, should also match.\n                        deeplyEqualCS = !!insertedEntries[key].insert === !!removalCS[key].remove;\n\n                        // If there are 'insert' and 'remove', see if the removed data matches the inserted data\n                        if (deeplyEqualCS && insertedEntries[key].insert) {\n                            deeplyEqualCS = isEqual(\n                                insertedEntries[key].insert,\n                                removalCS[key].remove,\n                            );\n                        }\n\n                        // Finally, check if the data being inserted matches the data that was removed\n                        const insertedEntry = isObject(insertedEntries[key]) ? without(insertedEntries[key], \"insert\") : insertedEntries[key];\n                        const removedEntry = isObject(removalCS[key]) ? without(removalCS[key], \"remove\") : removalCS[key];\n                        deeplyEqualCS = deeplyEqualCS && isEqual(insertedEntry, removedEntry);\n                    }\n\n                    if ((isPrimitiveTypeid || TypeIdHelper.isPrimitiveType(typeid) || deeplyEqualCS) &&\n                        removalCS &&\n                        ((Array.isArray(removalCS) && includes(baseRemoved, key)) || removalCS[key] !== undefined)) {\n                        // A remove and insert are combined into a modify for primitive types\n\n                        // Remove the old remove command\n                        let oldValueMatches = false;\n                        if (Array.isArray(removalCS)) {\n                            if (isPrimitiveTypeid) {\n                                io_basePropertyChanges.remove = without(io_basePropertyChanges.remove, key);\n                            } else {\n                                io_basePropertyChanges.remove[typeid] = without(io_basePropertyChanges.remove[typeid], key);\n                            }\n                        } else {\n                            oldValueMatches = deeplyEqualCS || (removalCS[key] === insertedEntries[key]);\n                            delete removalCS[key];\n                        }\n\n                        // Insert a modify command instead\n                        if (!oldValueMatches) {\n                            io_basePropertyChanges.modify = io_basePropertyChanges.modify || {};\n                            if (isPrimitiveTypeid) {\n                                io_basePropertyChanges.modify[key] = insertedEntries[key];\n                            } else {\n                                io_basePropertyChanges.modify[typeid] = io_basePropertyChanges.modify[typeid] || {};\n                                io_basePropertyChanges.modify[typeid][key] = cloneDeep(insertedEntries[key]);\n                            }\n                        }\n                    } else if (isPrimitiveTypeid && baseInserted[key] === undefined) {\n                        baseInserted[key] = insertedEntries[key];\n                    } else if (!isPrimitiveTypeid && (!baseInserted[typeid] || baseInserted[typeid][key] === undefined)) {\n                        baseInserted[typeid] = baseInserted[typeid] || {};\n                        baseInserted[typeid][key] = cloneDeep(insertedEntries[key]);\n                    } else {\n                        throw new Error(MSG.ALREADY_EXISTING_ENTRY + key);\n                    }\n                }\n            }\n        }\n\n        // Handle modification operations\n        if (in_appliedPropertyChanges.modify) {\n            // Get and initialize the corresponding entries from the existing collection\n            const modifiedEntries = in_appliedPropertyChanges.modify;\n            io_basePropertyChanges = io_basePropertyChanges || {};\n            io_basePropertyChanges.modify = io_basePropertyChanges.modify || {};\n            let baseModified = io_basePropertyChanges.modify;\n            let baseInserted = io_basePropertyChanges.insert || {};\n\n            // Process the modifications\n\n            // If no typeids are included, we just use a placeholder for the iteration below\n            const modifiedTypeids = isPrimitiveTypeid ? [undefined] : Object.keys(modifiedEntries);\n            for (let i = 0; i < modifiedTypeids.length; i++) {\n                let typeid = modifiedTypeids[i];\n\n                const modifyKeys = Object.keys(isPrimitiveTypeid ? modifiedEntries : modifiedEntries[typeid]);\n                for (let j = 0; j < modifyKeys.length; j++) {\n                    let key = modifyKeys[j];\n\n                    if (isPrimitiveTypeid) {\n                        let newValue = modifiedEntries[key];\n                        if (newValue && newValue.hasOwnProperty(\"value\")) {\n                            newValue = newValue.value;\n                        }\n                        if (baseInserted[key] !== undefined) {\n                            // If this entry was added by this ChangeSet, we modify the insert operation according to the\n                            // new ChangeSet\n                            baseInserted[key] = newValue;\n                        } else {\n                            if (baseModified[key] && baseModified[key].hasOwnProperty(\"value\")) {\n                                baseModified[key].value = newValue;\n                            } else {\n                                baseModified[key] = newValue;\n                            }\n                        }\n                    } else {\n                        // If this is a polymorphic collection, we can still have individual entries with\n                        // primitive types\n                        const isEntryPrimitiveType = TypeIdHelper.isPrimitiveType(typeid);\n\n                        if (baseInserted[typeid] && baseInserted[typeid][key] !== undefined) {\n                            // If this entry was added by this ChangeSet, we modify the insert operation according to the\n                            // new ChangeSet\n                            if (isEntryPrimitiveType && typeid !== \"String\") {\n                                let newValue = modifiedEntries[typeid][key];\n                                if (newValue && newValue.hasOwnProperty(\"value\")) {\n                                    newValue = modifiedEntries[typeid][key].value;\n                                }\n\n                                // In the case of Int64 or Uint64 we copy the array so that\n                                // both ChangeSets don't point to the same instance\n                                if (typeid === \"Int64\" || typeid === \"Uint64\") {\n                                    newValue = newValue.slice();\n                                }\n\n                                if (baseInserted[typeid][key] && baseInserted[typeid][key].hasOwnProperty(\"value\")) {\n                                    baseInserted[typeid][key].value = newValue;\n                                } else {\n                                    baseInserted[typeid][key] = newValue;\n                                }\n                            } else {\n                                this.performApplyAfterOnPropertyWithTypeid(key,\n                                    baseInserted[typeid],\n                                    modifiedEntries[typeid],\n                                    typeid,\n                                    false,\n                                    in_options);\n                            }\n                        } else if (baseModified[typeid] && baseModified[typeid][key] !== undefined) {\n                            // If there was a previous modification operation, we have to merge the two\n                            if (isEntryPrimitiveType && typeid !== \"String\") {\n                                // Primitive types can simply be overwritten, however we have an exception for\n                                // 64 bit integers (until javascript natively supports them)\n                                if (typeid === \"Int64\" || typeid === \"Uint64\") {\n                                    let appliedVal = modifiedEntries[typeid][key];\n                                    if (appliedVal && appliedVal.hasOwnProperty(\"value\")) {\n                                        appliedVal = appliedVal.value;\n                                    }\n                                    baseModified[typeid][key] = appliedVal.slice();\n                                } else {\n                                    baseModified[typeid][key] = modifiedEntries[typeid][key];\n                                }\n                            } else {\n                                this.performApplyAfterOnPropertyWithTypeid(key,\n                                    baseModified[typeid],\n                                    modifiedEntries[typeid],\n                                    typeid,\n                                    true,\n                                    in_options);\n                            }\n                        } else {\n                            baseModified[typeid] = baseModified[typeid] || {};\n                            baseModified[typeid][key] = cloneDeep(modifiedEntries[typeid][key]);\n                        }\n                    }\n                }\n            }\n        }\n\n        // Remove unnecessary entries from the ChangeSet\n        this._cleanIndexedCollectionChangeSet(io_basePropertyChanges, !isPrimitiveTypeid);\n    };\n\n    /**\n     * Performs the rebase operation for set and map collections\n     *\n     * @param in_ownPropertyChangeSet - The ChangeSet for this collection\n     * @param io_rebasePropertyChangeSet - The ChangeSet for the collection to be rebased\n     * @param in_basePath - Base path to get to the property processed by this function\n     * @param in_typeid - The typeid of the contents collection (without the collection type)\n     * @param in_useSquareBracketsInPath -\n     *     If set to true, paths will be created using the angular brackets syntax (for\n     *     arrays), otherwise dots will be used (for NodeProperties)\n     * @param out_conflicts - A list of paths that resulted in conflicts together with the type of the conflict\n     * @param in_options - Optional additional parameters\n     * @param in_options.applyAfterMetaInformation - Additional meta information which help later to obtain\n     *                                                       more compact changeset during the apply operation\n     *\n     * @private\n     */\n    export const _rebaseIndexedCollectionChangeSetForProperty = function(\n        in_ownPropertyChangeSet: SerializedChangeSet, // eslint-disable-line complexity\n        io_rebasePropertyChangeSet: SerializedChangeSet,\n        in_basePath: string,\n        in_typeid: string,\n        in_useSquareBracketsInPath: boolean,\n        out_conflicts: ConflictInfo[],\n        in_options: ApplyChangeSetOptions) {\n        const isPrimitiveTypeid = TypeIdHelper.isPrimitiveType(in_typeid);\n\n        const changesByKeys = {};\n        let modifyMap = {};\n        // Helper function which stores the changes indexed by key in the changesByKeys array to\n        // make it easier to compare the related changes in the two ChangeSets\n        const addChanges = function(in_collection: Record<string, any>, in_changeIdentifier: string, in_changePrefix: string, in_typeidChange?: string) {\n            // Collection didn't exist in this ChangeSet\n            if (in_collection === undefined) {\n                return;\n            }\n\n            // For remove operations, the ChangeSet is only an array of keys, otherwise it is a map, so we have to\n            // distinguish the two cases here\n            const keys = Array.isArray(in_collection) ? in_collection : Object.keys(in_collection);\n\n            // Add all entries indexed with the key\n            for (let j = 0; j < keys.length; j++) {\n                const key = keys[j];\n\n                // Store the type of the change\n                changesByKeys[key] = changesByKeys[key] || {};\n                changesByKeys[key][in_changePrefix] = changesByKeys[key][in_changePrefix] ?\n                    `${changesByKeys[key][in_changePrefix]}_${in_changeIdentifier}` :\n                    in_changeIdentifier;\n\n                // If applicable store the typeid of the change\n                if (in_typeidChange) {\n                    changesByKeys[key][`${in_changePrefix}Typeid`] = in_typeidChange;\n                }\n\n                // Store the ChangeSet\n                if (in_changePrefix === \"other\") {\n                    if (!Array.isArray(in_collection)) {\n                        changesByKeys[key].change = in_collection[key];\n                    } else {\n                        changesByKeys[key].change = key;\n                    }\n                }\n            }\n        };\n\n        // Helper function which adds the Changes for a ChangeSet that is ordered by typeid\n        const addChangesWithTypeids = function(in_collection, in_changeIdentifier, in_changePrefix) {\n            if (in_collection === undefined) {\n                return;\n            }\n            // Iterate over the typeids (or use dummy entry for the iteration\n            const addedKeyTypeids = Object.keys(in_collection);\n            for (let i = 0; i < addedKeyTypeids.length; i++) {\n                const Typeid = addedKeyTypeids[i];\n                addChanges(in_collection[Typeid], in_changeIdentifier, in_changePrefix, Typeid);\n            }\n        };\n\n        // Insert all changes from the ChangeSet into the lookup map\n        if (Array.isArray(in_ownPropertyChangeSet.remove)) {\n            addChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n        } else {\n            if (isPrimitiveTypeid) {\n                addChanges(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n            } else {\n                addChangesWithTypeids(in_ownPropertyChangeSet.remove, \"remove\", \"own\");\n            }\n        }\n\n        if (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n            addChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n        } else {\n            if (isPrimitiveTypeid) {\n                addChanges(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n            } else {\n                addChangesWithTypeids(io_rebasePropertyChangeSet.remove, \"remove\", \"other\");\n            }\n        }\n\n        if (isPrimitiveTypeid) {\n            addChanges(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n            addChanges(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n            addChanges(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n            addChanges(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n        } else {\n            addChangesWithTypeids(in_ownPropertyChangeSet.insert, \"insert\", \"own\");\n            addChangesWithTypeids(in_ownPropertyChangeSet.modify, \"modify\", \"own\");\n            addChangesWithTypeids(io_rebasePropertyChangeSet.insert, \"insert\", \"other\");\n            addChangesWithTypeids(io_rebasePropertyChangeSet.modify, \"modify\", \"other\");\n        }\n\n        // Check for modifications that affect the same object\n        const changedKeys = Object.keys(changesByKeys);\n        for (let i = 0; i < changedKeys.length; i++) {\n            const key = changedKeys[i];\n            const newPath = in_useSquareBracketsInPath ?\n                `${in_basePath}[${PathHelper.quotePathSegmentIfNeeded(key)}]` :\n                joinPaths(in_basePath, PathHelper.quotePathSegmentIfNeeded(key), PROPERTY_PATH_DELIMITER);\n\n            const modification = changesByKeys[key];\n            if (modification.own && modification.other) {\n                /*\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                // A key was modified after it had been removed\n                if (modification.own === \"modify\" && modification.other === \"modify\") {\n                    if (isPrimitiveTypeid ||\n                        (TypeIdHelper.isPrimitiveType(modification.ownTypeid) && modification.ownTypeid !== \"String\")) {\n                        // We have two modification operations that affect the same entry for a base type.\n                        // This is a legal operation, the second one will overwrite the first one, but we\n                        // report it as a possible conflict\n                        let ownModify = in_ownPropertyChangeSet.modify;\n                        let rebasedModify = io_rebasePropertyChangeSet.modify;\n                        if (modification.otherTypeid) {\n                            ownModify = ownModify[modification.otherTypeid];\n                            rebasedModify = rebasedModify[modification.otherTypeid];\n                        }\n\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.COLLIDING_SET,\n                            conflictingChange: ownModify[key],\n                        };\n                        out_conflicts.push(conflict);\n                        // If value is the same, delete the entry\n                        let ownValue = ownModify[key];\n                        if (typeof ownValue === \"object\" && ownValue.hasOwnProperty(\"value\")) {\n                            ownValue = ownValue.value;\n                        }\n                        let rebaseValue = rebasedModify[key];\n                        if (typeof rebaseValue === \"object\" && rebaseValue.hasOwnProperty(\"value\")) {\n                            rebaseValue = rebaseValue.value;\n                        }\n                        if (modification.ownTypeid === \"Int64\" || modification.ownTypeid === \"Uint64\" || ownValue.length === 2) {\n                            // For (u)int64, values are arrays of 2 elements\n                            if (ownValue[0] === rebaseValue[0] && ownValue[1] === rebaseValue[1]) {\n                                delete rebasedModify[key];\n                            }\n                        } else {\n                            if (ownValue === rebaseValue) {\n                                delete rebasedModify[key];\n                            }\n                        }\n                    } else {\n                        this.rebaseChangeSetForPropertyEntryWithTypeid(key,\n                            in_ownPropertyChangeSet.modify[modification.ownTypeid],\n                            io_rebasePropertyChangeSet.modify[modification.otherTypeid],\n                            modification.ownTypeid,\n                            newPath,\n                            true,\n                            out_conflicts,\n                            in_options);\n                    }\n                } else if (modification.own === \"remove\" && modification.other === \"modify\") {\n                    modifyMap = modification.otherTypeid ? io_rebasePropertyChangeSet.modify[modification.otherTypeid] :\n                        io_rebasePropertyChangeSet.modify;\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.ENTRY_MODIFIED_AFTER_REMOVE,\n                        conflictingChange: modifyMap[key],\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Delete the modification from the rebased ChangeSet\n                    delete modifyMap[key];\n                } else if (modification.own === \"remove_insert\" && modification.other === \"modify\") {\n                    // We have a conflicting change. A node was removed and inserted (replaced) in the original\n                    // ChangeSet and then modified by the rebased ChangeSet. Since the base of the modification\n                    // can have been changed significantly by this operation, we don't know whether we can\n                    // apply the modification\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.ENTRY_MODIFICATION_AFTER_REMOVE_INSERT,\n                        conflictingChange: io_rebasePropertyChangeSet.modify[modification.otherTypeid][key],\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Delete the modification from the rebased ChangeSet\n                    delete io_rebasePropertyChangeSet.modify[key];\n                } else if ((modification.own === \"modify\" || modification.own === \"remove\") &&\n                    (modification.other === \"remove\" || modification.other === \"remove_insert\")) {\n                    if (modification.own === \"modify\") {\n                        modifyMap = modification.ownTypeid ? in_ownPropertyChangeSet.modify[modification.ownTypeid] :\n                            in_ownPropertyChangeSet.modify;\n\n                        // Create the conflict information\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.REMOVE_AFTER_MODIFY,\n                            conflictingChange: modifyMap[key],\n                        };\n                        out_conflicts.push(conflict);\n                    }\n\n                    // If we have a duplicated delete, we remove it from the new ChangeSet\n                    if (modification.own === \"remove\") {\n                        if (Array.isArray(io_rebasePropertyChangeSet.remove)) {\n                            io_rebasePropertyChangeSet.remove = without(io_rebasePropertyChangeSet.remove, key);\n                        } else {\n                            if (isPrimitiveTypeid) {\n                                delete io_rebasePropertyChangeSet.remove[key];\n                            } else {\n                                delete io_rebasePropertyChangeSet.remove[modification.otherTypeid][key];\n                            }\n                        }\n                    }\n                } else if (modification.own === \"insert\" && modification.other === \"insert\") {\n                    if (isPrimitiveTypeid ||\n                        (TypeIdHelper.isPrimitiveType(modification.ownTypeid))) {\n                        let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                            io_rebasePropertyChangeSet.insert;\n\n                        // We have two insert operations that affect the same key for a primitive type.\n                        // This is a legal operation, the second one will overwrite the first one, but we\n                        // report it as a possible conflicting set\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.COLLIDING_SET,\n                            conflictingChange: insertMap[key],\n                        };\n                        out_conflicts.push(conflict);\n\n                        // Convert to modify\n                        let oldValue;\n                        if (modification.otherTypeid) {\n                            io_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify || {};\n                            io_rebasePropertyChangeSet.modify[modification.otherTypeid] =\n                                io_rebasePropertyChangeSet.modify[modification.otherTypeid] || {};\n                            modifyMap = io_rebasePropertyChangeSet.modify[modification.otherTypeid];\n                            oldValue = in_ownPropertyChangeSet.insert[modification.ownTypeid][key];\n                        } else {\n                            io_rebasePropertyChangeSet.modify = io_rebasePropertyChangeSet.modify || {};\n                            modifyMap = io_rebasePropertyChangeSet.modify;\n                            oldValue = in_ownPropertyChangeSet.insert[key];\n                        }\n\n                        modifyMap[key] = { value: insertMap[key], oldValue };\n                        delete insertMap[key];\n                    } else {\n                        // Here we have two insert operations for objects. Since these affect a whole sub-tree and not\n                        // just a single value, we cannot easily convert it into a modify and instead report it as invalid\n\n                        let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                            io_rebasePropertyChangeSet.insert;\n\n                        // Create the conflict information\n                        let conflict = {\n                            path: newPath,\n                            type: ConflictType.INSERTED_ENTRY_WITH_SAME_KEY,\n                            conflictingChange: insertMap[key],\n                        };\n                        out_conflicts.push(conflict);\n\n                        // Delete the modification from the rebased ChangeSet\n                        delete insertMap[key];\n                    }\n                } else if (modification.own === \"remove_insert\" && modification.other === \"remove_insert\") {\n                    let insertMap = modification.otherTypeid ? io_rebasePropertyChangeSet.insert[modification.otherTypeid] :\n                        io_rebasePropertyChangeSet.insert;\n\n                    // Raise the duplicate inserts as a conflict\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.COLLIDING_SET,\n                        conflictingChange: insertMap[key],\n                    };\n                    out_conflicts.push(conflict);\n                } else {\n                    // All other operations are conflicting changes, which only occur for ChangeSets that are relative\n                    // to different bases\n\n                    // Create the conflict information\n                    let conflict = {\n                        path: newPath,\n                        type: ConflictType.INVALID_CHANGESET_BASE,\n                        conflictingChange: modification.change,\n                    };\n                    out_conflicts.push(conflict);\n\n                    // Remove the change from the ChangeSet\n                    if (modification.other !== \"remove\") {\n                        if (modification.otherTypeid !== undefined) {\n                            delete io_rebasePropertyChangeSet[modification.other][modification.otherTypeid][key];\n                        } else {\n                            delete io_rebasePropertyChangeSet[modification.other][key];\n                        }\n                    } else {\n                        // Remove remove operations from the ChangeSet\n                        if (Array.isArray(io_rebasePropertyChangeSet[modification.other])) {\n                            io_rebasePropertyChangeSet[modification.other] =\n                                without(io_rebasePropertyChangeSet[modification.other], key);\n                        } else {\n                            delete io_rebasePropertyChangeSet[modification.other][key];\n                        }\n                    }\n\n                    console.error(\"Rebase operation with conflicting ChangeSets. Probably incorrect bases.\");\n                }\n            }\n        }\n\n        // Remove unnecessary entries from the ChangeSet\n        this._cleanIndexedCollectionChangeSet(io_rebasePropertyChangeSet, !isPrimitiveTypeid);\n    };\n\n    /**\n     * Removes empty entries from the .children collection of the ChangeSet\n     *\n     * @param in_propertyChanges - The ChangeSet to clean up\n     * @param in_containsTypeids - Does this ChangeSet contain typeids\n     * @private\n     */\n    export const _cleanIndexedCollectionChangeSet = function(in_propertyChanges: SerializedChangeSet, in_containsTypeids: boolean) {\n        const changes = in_propertyChanges;\n        // Clean inserts\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.insert || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                if (_fastIsEmptyObject(changes.insert[typeidList[j]])) {\n                    delete changes.insert[typeidList[j]];\n                }\n            }\n        }\n\n        // Remove add group if no operations are present\n        if (_fastIsEmptyObject(changes.insert)) {\n            delete changes.insert;\n        }\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.remove || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                if (_fastIsEmptyObject(changes.remove[typeidList[j]])) {\n                    delete changes.remove[typeidList[j]];\n                }\n            }\n        }\n        // Remove remove group if no operations are present\n        if (_fastIsEmptyObject(changes.remove)) {\n            delete changes.remove;\n        }\n\n        // Clean modifies\n\n        // First remove unused typeid sections\n        if (in_containsTypeids) {\n            let typeidList = Object.keys(changes.modify || {});\n            for (let j = 0; j < typeidList.length; j++) {\n                const modifies = changes.modify[typeidList[j]];\n                const modifyKeys = Object.keys(modifies);\n                for (let k = 0; k < modifyKeys.length; k++) {\n                    if (isEmptyChangeSet(modifies[modifyKeys[k]])) {\n                        delete modifies[modifyKeys[k]];\n                    }\n                }\n                if (_fastIsEmptyObject(changes.modify[typeidList[j]])) {\n                    delete changes.modify[typeidList[j]];\n                }\n            }\n        }\n\n        // Remove modify group if no operations are present\n        if (_fastIsEmptyObject(changes.modify)) {\n            delete changes.modify;\n        }\n    };\n}\n"]}

package/dist/changeset_operations/isEmptyChangeset.js

@@ -21,7 +21,7 @@ const isObject_1 = __importDefault(require("lodash/isObject"));
  * @returns True if it is an empty changeset.
  */
 const isEmptyChangeSet = (in_changeSet) => in_changeSet === undefined ||
-    (isObject_1.default(in_changeSet) &&
-        (isEmpty_1.default(in_changeSet) || (Object.keys(in_changeSet).length === 1 && has_1.default(in_changeSet, "typeid"))));
+    ((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"))));
 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;;;;;;AAEF,6DAAqC;AACrC,qDAA6B;AAC7B,+DAAuC;AAIxC;;;;;GAKG;AACI,MAAM,gBAAgB,GAAG,CAAC,YAAiC,EAAW,EAAE,CAAC,YAAY,KAAK,SAAS;IAClG,CAAC,kBAAQ,CAAC,YAAY,CAAC;QACnB,CAAC,iBAAO,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,aAAG,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAFnG,QAAA,gBAAgB,oBAEmF","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\n import isEmpty from \"lodash/isEmpty\";\n import has from \"lodash/has\";\n import isObject from \"lodash/isObject\";\n\n import { 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 => in_changeSet === undefined ||\n        (isObject(in_changeSet) &&\n            (isEmpty(in_changeSet) || (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;AACH;;GAEG;;;;;;AAEF,6DAAqC;AACrC,qDAA6B;AAC7B,+DAAuC;AAIxC;;;;;GAKG;AACI,MAAM,gBAAgB,GAAG,CAAC,YAAiC,EAAW,EAAE,CAAC,YAAY,KAAK,SAAS;IAClG,CAAC,IAAA,kBAAQ,EAAC,YAAY,CAAC;QACnB,CAAC,IAAA,iBAAO,EAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,IAAA,aAAG,EAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;AAFnG,QAAA,gBAAgB,oBAEmF","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\n import isEmpty from \"lodash/isEmpty\";\n import has from \"lodash/has\";\n import isObject from \"lodash/isObject\";\n\n import { 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 => in_changeSet === undefined ||\n        (isObject(in_changeSet) &&\n            (isEmpty(in_changeSet) || (Object.keys(in_changeSet).length === 1 && has(in_changeSet, \"typeid\"))));\n"]}

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,EAAC,MAAM,SAAS,CAAC;AAE/B,QAAA,MAAQ,gBAAgB,+BAAU,CAAC;AAEnC,OAAO,EACH,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,GACnB,CAAC"}
+{"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,QAAA,MAAQ,gBAAgB,+BAAU,CAAC;AAEnC,OAAO,EACH,cAAc,EACd,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,KAAK,EACL,UAAU,EACV,sBAAsB,EACtB,qBAAqB,EACrB,mBAAmB,EACnB,gBAAgB,EAChB,gBAAgB,GACnB,CAAC"}

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,2CAA6D;AAezD,0FAfK,qBAAS,OAeL;AAdb,0FAAuF;AAiBnF,uGAjBK,+CAAsB,OAiBL;AAhB1B,yDAAwE;AAYpE,6FAZuB,2BAAY,OAYvB;AAXhB,6CAA0C;AActC,2FAdK,uBAAU,OAcL;AAbd,qCAAiD;AAe7C,sGAfK,8BAAqB,OAeL;AAdzB,qDAAkD;AAO9C,+FAPK,+BAAc,OAOL;AANlB,2DAAwD;AAOpD,kGAPK,qCAAiB,OAOL;AANrB,mCAA+B;AAS3B,sFATK,aAAK,OASL;AAPT,MAAM,EAAE,gBAAgB,EAAE,GAAG,aAAK,CAAC;AAY/B,4CAAgB","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport { ChangeSet, SerializedChangeSet } from \"./changeset\";\nimport { ArrayChangeSetIterator } from \"./changeset_operations/arrayChangesetIterator\";\nimport { ExtractedContext, TypeIdHelper } from \"./helpers/typeidHelper\";\nimport { PathHelper } from \"./pathHelper\";\nimport { rebaseToRemoteChanges } from \"./rebase\";\nimport { TemplateSchema } from \"./templateSchema\";\nimport { TemplateValidator } from \"./templateValidator\";\nimport { Utils} from \"./utils\";\n\nconst { TraversalContext } = Utils;\n\nexport {\n    TemplateSchema,\n    TemplateValidator,\n    TypeIdHelper,\n    ChangeSet,\n    Utils,\n    PathHelper,\n    ArrayChangeSetIterator,\n    rebaseToRemoteChanges,\n    SerializedChangeSet,\n    TraversalContext,\n    ExtractedContext,\n};\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH,2CAA6D;AAezD,0FAfK,qBAAS,OAeL;AAdb,0FAAuF;AAiBnF,uGAjBK,+CAAsB,OAiBL;AAhB1B,yDAAwE;AAYpE,6FAZuB,2BAAY,OAYvB;AAXhB,6CAA0C;AActC,2FAdK,uBAAU,OAcL;AAbd,qCAAiD;AAe7C,sGAfK,8BAAqB,OAeL;AAdzB,qDAAkD;AAO9C,+FAPK,+BAAc,OAOL;AANlB,2DAAwD;AAOpD,kGAPK,qCAAiB,OAOL;AANrB,mCAAgC;AAS5B,sFATK,aAAK,OASL;AAPT,MAAM,EAAE,gBAAgB,EAAE,GAAG,aAAK,CAAC;AAY/B,4CAAgB","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport { ChangeSet, SerializedChangeSet } from \"./changeset\";\nimport { ArrayChangeSetIterator } from \"./changeset_operations/arrayChangesetIterator\";\nimport { ExtractedContext, TypeIdHelper } from \"./helpers/typeidHelper\";\nimport { PathHelper } from \"./pathHelper\";\nimport { rebaseToRemoteChanges } from \"./rebase\";\nimport { TemplateSchema } from \"./templateSchema\";\nimport { TemplateValidator } from \"./templateValidator\";\nimport { Utils } from \"./utils\";\n\nconst { TraversalContext } = Utils;\n\nexport {\n    TemplateSchema,\n    TemplateValidator,\n    TypeIdHelper,\n    ChangeSet,\n    Utils,\n    PathHelper,\n    ArrayChangeSetIterator,\n    rebaseToRemoteChanges,\n    SerializedChangeSet,\n    TraversalContext,\n    ExtractedContext,\n};\n"]}

package/dist/pathHelper.js.map

@@ -1 +1 @@
-{"version":3,"file":"pathHelper.js","sourceRoot":"","sources":["../src/pathHelper.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;AAEH,aAAa;AACb,yEAAgE;AAEhE,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAInD;;GAEG;AACH,IAAiB,UAAU,CA0e1B;AA1eD,WAAiB,UAAU;IAEvB,MAAM,2BAA2B,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAE3D;;;OAGG;IACH,IAAY,WAWX;IAXD,WAAY,WAAW;QACnB,6CAA6C;QAC7C,yEAAkB,CAAA;QAClB,+CAA+C;QAC/C,2DAAW,CAAA;QACX,uCAAuC;QACvC,mEAAe,CAAA;QACf,mDAAmD,CAAC,kBAAkB;QACtE,uEAAiB,CAAA;QACjB,2DAA2D;QAC3D,uEAAiB,CAAA;IACrB,CAAC,EAXW,WAAW,GAAX,sBAAW,KAAX,sBAAW,QAWtB;IAED;;;;;;;OAOG;IACU,6BAAkB,GAAG,UAAS,OAAe,EAAE,SAAyB;QACjF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,YAAY,GAAG,EAAE,CAAC;QAEtB,IAAI,SAAS,EAAE;YACX,+BAA+B;YAC/B,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;SACzC;QAED,2EAA2E;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;YACpB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,EAAE;gBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;aAC/C;YACD,UAAU,GAAG,CAAC,CAAC;SAClB;aAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE;YACvC,6DAA6D;YAC7D,IAAI,YAAY,GAAG,UAAS,YAAY;gBACpC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE;oBACrC,IAAI,SAAS,EAAE;wBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;qBACjD;oBACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACnB,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBACrC,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;iBAC/B;YACL,CAAC,CAAC;YACF,YAAY,CAAC,OAAO,CAAC,CAAC;SACzB;QAED,wEAAwE;QACxE,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;YAC5F,0EAA0E;YAC1E,IAAI,gBAAgB,GAAa,EAAE,CAAC;YACpC,MAAM,eAAe,GAAG,EAAE,CAAC;YAC3B,IAAI,KAAwB,CAAC;YAC7B,IAAI,CAAS,CAAC;YACd,yEAAyE;YACzE,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;YACnE,oBAAoB;YACpB,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACzC,2BAA2B;YAC3B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC1C,KAAK,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAC5B,0EAA0E;gBAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;oBACpB,0DAA0D;oBAC1D,MAAM;iBACT;qBAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;oBACzB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;wBACrD,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;wBAC9C,gBAAgB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;qBAC3D;yBAAM;wBACH,0DAA0D;wBAC1D,MAAM;qBACT;iBACJ;qBAAM;oBACH,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;wBAC3B,0DAA0D;wBAC1D,MAAM;qBACT;yBAAM;wBACH,iCAAiC;wBACjC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBACxD;iBACJ;aACJ;YACD,IAAI,CAAC,KAAK,gBAAgB,CAAC,MAAM,EAAE;gBAC/B,uDAAuD;gBACvD,IAAI,SAAS,EAAE;oBACX,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACzC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;qBACtC;iBACJ;gBACD,OAAO,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;aAC1C;SACJ;QAED,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAE/B,oDAAoD;QACpD,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,MAAM,cAAc,GAAG,UAAS,SAAS;YACrC,6DAA6D;YAC7D,IAAI,CAAC,YAAY,EAAE;gBACf,IAAI,CAAC,YAAY,EAAE;oBACf,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,CAAC;iBAC9C;qBAAM;oBACH,OAAO;iBACV;aACJ;YAED,kBAAkB;YAClB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1B,YAAY,GAAG,EAAE,CAAC;YAClB,YAAY,GAAG,KAAK,CAAC;YACrB,YAAY,GAAG,KAAK,CAAC;YACrB,kBAAkB,GAAG,KAAK,CAAC;YAC3B,iBAAiB,GAAG,KAAK,CAAC;YAE1B,IAAI,SAAS,EAAE;gBACX,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aAC7B;QACL,CAAC,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAE7B,IAAI,SAAS,KAAK,GAAG,EAAE;gBACnB,yDAAyD;gBACzD,iBAAiB;gBACjB,IAAI,CAAC,YAAY,EAAE;oBACf,IAAI,QAAQ,GAAG,KAAK,CAAC;oBAErB,wBAAwB;oBACxB,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC/B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;4BACpB,4CAA4C;4BAC5C,QAAQ,GAAG,IAAI,CAAC;4BAChB,MAAM;yBACT;6BAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;4BAC5B,yBAAyB;4BACzB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE;gCACxB,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;oCACzB,YAAY,IAAI,IAAI,CAAC;oCACrB,CAAC,EAAE,CAAC;iCACP;qCAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;oCAC/B,YAAY,IAAI,GAAG,CAAC;oCACpB,CAAC,EAAE,CAAC;iCACP;qCAAM;oCACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;iCAC1D;6BACJ;iCAAM;gCACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;6BAC1D;yBACJ;6BAAM;4BACH,6CAA6C;4BAC7C,YAAY,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;yBAC9B;qBACJ;oBAED,IAAI,CAAC,QAAQ,EAAE;wBACX,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,wBAAwB,GAAG,OAAO,CAAC,CAAC;qBAC3D;oBACD,kBAAkB,GAAG,IAAI,CAAC;oBAC1B,YAAY,GAAG,IAAI,CAAC;iBACvB;qBAAM;oBACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;iBACtD;aACJ;iBAAM,IAAI,CAAC,gBAAgB,EAAE;gBAC1B,IAAI,SAAS,KAAK,uBAAuB,EAAE;oBACvC,mCAAmC;oBACnC,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;oBAE/C,iBAAiB,GAAG,IAAI,CAAC;iBAC5B;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,+CAA+C;oBAC/C,IAAI,YAAY,EAAE;wBACd,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBAClD;oBAED,yCAAyC;oBACzC,gBAAgB,GAAG,IAAI,CAAC;iBAC3B;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,+BAA+B,GAAG,OAAO,CAAC,CAAC;iBAClE;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,uBAAuB;oBACvB,IAAI,YAAY,EAAE;wBACd,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBAClD;oBAED,iCAAiC;oBACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,IAAI,SAAS,EAAE;wBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;qBACjD;oBAED,+BAA+B;oBAC/B,YAAY,GAAG,KAAK,CAAC;oBACrB,YAAY,GAAG,IAAI,CAAC;oBACpB,iBAAiB,GAAG,KAAK,CAAC;iBAC7B;qBAAM;oBACH,IAAI,CAAC,YAAY;wBACb,CAAC,iBAAiB;wBAClB,CAAC,gBAAgB,EAAE;wBACnB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,4BAA4B,GAAG,OAAO,CAAC,CAAC;qBAC/D;oBAED,YAAY,IAAI,SAAS,CAAC;oBAE1B,oCAAoC;oBACpC,YAAY,GAAG,IAAI,CAAC;oBAEpB,0EAA0E;oBAC1E,IAAI,kBAAkB,EAAE;wBACpB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;qBACtD;iBACJ;aACJ;iBAAM;gBACH,IAAI,SAAS,KAAK,GAAG,EAAE;oBACnB,8CAA8C;oBAC9C,cAAc,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;oBAExC,2CAA2C;oBAC3C,6CAA6C;oBAC7C,QAAQ;oBACR,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,sDAAsD;wBAChF,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,uBAAuB,EAAE;4BAC5C,sCAAsC;4BACtC,gBAAgB,GAAG,KAAK,CAAC;4BACzB,iBAAiB,GAAG,IAAI,CAAC;4BACzB,CAAC,EAAE,CAAC;yBACP;6BAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;4BAC/B,+BAA+B;4BAC/B,oCAAoC;4BACpC,CAAC,EAAE,CAAC;yBACP;6BAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;4BAC/B,+BAA+B;4BAC/B,gBAAgB,GAAG,KAAK,CAAC;yBAC5B;6BAAM;4BACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,8BAA8B,GAAG,OAAO,CAAC,CAAC;yBACjE;qBACJ;yBAAM;wBACH,gBAAgB,GAAG,KAAK,CAAC;wBACzB,YAAY,GAAG,KAAK,CAAC;qBACxB;iBACJ;qBAAM,IAAI,SAAS,KAAK,uBAAuB,EAAE;oBAC9C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;iBAC1D;qBAAM;oBACH,YAAY,IAAI,SAAS,CAAC;oBAE1B,oCAAoC;oBACpC,YAAY,GAAG,IAAI,CAAC;oBAEpB,0EAA0E;oBAC1E,IAAI,kBAAkB,EAAE;wBACpB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;qBACtD;iBACJ;aACJ;SACJ;QAED,kEAAkE;QAClE,IAAI,gBAAgB,EAAE;YAClB,2CAA2C;YAC3C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,OAAO,CAAC,CAAC;SACpD;aAAM,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,uBAAuB,EAAE;YAChE,8CAA8C;YAC9C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;SAC7C;aAAM,IAAI,YAAY,EAAE;YACrB,yCAAyC;YACzC,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;SAClD;QAED,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,2BAAgB,GAAG,UAAS,cAAsB;QAC3D,qDAAqD;QACrD,uDAAuD;QAEvD,iCAAiC;QACjC,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEvD,wBAAwB;QACxB,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAErD,sDAAsD;QACtD,OAAO,IAAI,cAAc,GAAG,CAAC;IACjC,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,6BAAkB,GAAG,UAAS,oBAA4B;QACnE,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE;YAC1C,MAAM,IAAI,KAAK,CAAC,iCAAiC,oBAAoB,EAAE,CAAC,CAAC;SAC5E;QAED,IAAI,oBAAoB,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;YAClG,0BAA0B;YAC1B,oBAAoB,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEvF,kCAAkC;YAClC,oBAAoB,GAAG,oBAAoB,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAEnE,0BAA0B;YAC1B,oBAAoB,GAAG,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;SACpE;QAED,OAAO,oBAAoB,CAAC;IAChC,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,mCAAwB,GAAG,UAAS,cAAsB;QACnE,IAAI,cAAc,CAAC,OAAO,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YACtD,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;YAC7B,OAAO,WAAA,gBAAgB,CAAC,cAAc,CAAC,CAAC;SAC3C;aAAM;YACH,OAAO,cAAc,CAAC;SACzB;IACL,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,2CAAgC,GAAG,UAAS,OAAe;QACpE,IAAI,OAAO,KAAK,EAAE,IAAI,4BAA4B;YAC9C,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,sCAAsC;YAC5D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;SAClD;IACL,CAAC,CAAC;IAEF;;;;;;;OAOG;IACU,yCAA8B,GAAG,UAAS,eAAuB;QAC1E,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,WAAA,kBAAkB,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;QAC/D,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,QAAQ,SAAS,EAAE;gBACf,KAAK,WAAW,CAAC,eAAe;oBAC5B,uBAAuB;oBACvB,MAAM;gBACV,KAAK,WAAW,CAAC,iBAAiB;oBAC9B,MAAM,IAAI,KAAK,CAAC,wDAAwD,eAAe,EAAE,CAAC,CAAC;gBAC/F,KAAK,WAAW,CAAC,iBAAiB;oBAC9B,MAAM,IAAI,KAAK,CAAC,0DAA0D,eAAe,EAAE,CAAC,CAAC;gBACjG,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,kBAAkB;oBAC/B,IAAI,IAAI,CAAC,uBAAuB,GAAG,WAAA,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxE,MAAM;gBACV;oBACI,MAAM;aACb;SACJ;QACD,+CAA+C;QAC/C,IAAI,IAAI,EAAE;YACN,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF;;;;;;;;OAQG;IACU,wCAA6B,GAAG,UAAS,8BAAsC,EAAE,UAAkB;QAC5G,MAAM,SAAS,GAAG,WAAA,wBAAwB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,IAAI,8BAA8B,EAAE;YAChC,OAAO,CAAC,8BAA8B,GAAG,uBAAuB,GAAG,SAAS,CAAC,CAAC;SACjF;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC,CAAC;IAEF,IAAY,cAUX;IAVD,WAAY,cAAc;QACtB,uEAAuE;QACvE,kFAAkF;QAClF,6DAAS,CAAA;QACT,sFAAsF;QACtF,sGAAsG;QACtG,uEAAc,CAAA;QACd,kFAAkF;QAClF,uGAAuG;QACvG,qEAAa,CAAA;IACjB,CAAC,EAVW,cAAc,GAAd,yBAAc,KAAd,yBAAc,QAUzB;IAOD;;;;;;;;;;OAUG;IACU,0BAAe,GAAG,UAAS,WAAmB,EAAE,QAAkB;QAC3E,yEAAyE;QACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;gBACrC,OAAO;oBACH,cAAc,EAAE,cAAc,CAAC,aAAa;oBAC5C,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC1B,CAAC;aACL;SACJ;QACD,sEAAsE;QACtE,mDAAmD;QACnD,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE;gBACrC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B;SACJ;QACD,IAAI,KAAK,CAAC,MAAM,EAAE;YACd,+DAA+D;YAC/D,OAAO;gBACH,cAAc,EAAE,cAAc,CAAC,cAAc;gBAC7C,QAAQ,EAAE,KAAK;aAClB,CAAC;SACL;QAED,yDAAyD;QACzD,OAAO;YACH,cAAc,EAAE,cAAc,CAAC,SAAS;YACxC,QAAQ,EAAE,KAAK;SAClB,CAAC;IACN,CAAC,CAAC;AACN,CAAC,EA1egB,UAAU,GAAV,kBAAU,KAAV,kBAAU,QA0e1B","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 path strings\n */\n\n// @ts-ignore\nimport { constants } from '@fluid-experimental/property-common';\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\nexport type PathTree = Map<String, PathTree>;\n\n/**\n * Helper functions for string processing\n */\nexport namespace PathHelper {\n\n    const RE_ALL_OPEN_SQUARE_BRACKETS = new RegExp(\"[[]\", \"g\");\n\n    /**\n     * Token Types\n     * Type of the token in the path string\n     */\n    export enum TOKEN_TYPES {\n        /** A normal path segment, separated via . */\n        PATH_SEGMENT_TOKEN,\n        /** An array path segment, separated via [ ] */\n        ARRAY_TOKEN,\n        /** A / at the beginning of the path */\n        PATH_ROOT_TOKEN,\n        /** A * that indicates a dereferencing operation */ // note: reversed!\n        DEREFERENCE_TOKEN,\n        /** A ../ that indicates one step above the current path */\n        RAISE_LEVEL_TOKEN,\n    }\n\n    /**\n     * Tokenizes a path string\n     *\n     * @param in_path     - The path string to divide into tokens\n     * @param out_types - The types of the tokens\n     *\n     * @returns the tokens from the path string\n     */\n    export const tokenizePathString = function(in_path: string, out_types?: TOKEN_TYPES[]): string[] { // eslint-disable-line complexity\n        const tokens = [];\n        let currentToken = \"\";\n\n        if (out_types) {\n            // Make sure out_types is empty\n            out_types.splice(0, out_types.length);\n        }\n\n        // Handle a / at the beginning of the path by adding a special token for it\n        let path_start = 0;\n        if (in_path[0] === \"/\") {\n            tokens.push(\"/\");\n            if (out_types) {\n                out_types.push(TOKEN_TYPES.PATH_ROOT_TOKEN);\n            }\n            path_start = 1;\n        } else if (in_path.substr(0, 3) === \"../\") {\n            // Handle relative paths by extracting the number steps above\n            var extractLevel = function(current_path) {\n                if (current_path.substr(0, 3) === \"../\") {\n                    if (out_types) {\n                        out_types.push(TOKEN_TYPES.RAISE_LEVEL_TOKEN);\n                    }\n                    tokens.push(\"../\");\n                    extractLevel(current_path.substr(3));\n                    path_start = path_start + 3;\n                }\n            };\n            extractLevel(in_path);\n        }\n\n        // Let's see if the path is simple enough to use a fast-track algorithm.\n        let hackedPath = in_path.substr(path_start);\n        if (in_path.indexOf(\"\\\\\") === -1 && in_path.indexOf('\"') === -1 && in_path.indexOf(\"*\") === -1) {\n            // Yes, we can do something faster than parsing each character one by one.\n            let additionalTokens: string[] = [];\n            const additionalTypes = [];\n            let token: string | string[];\n            let i: number;\n            // Hack for simplicity, let's first replace all occurences of '[' by '.['\n            hackedPath = hackedPath.replace(RE_ALL_OPEN_SQUARE_BRACKETS, \".[\");\n            // Then split on '.'\n            additionalTokens = hackedPath.split(\".\");\n            // And validate each token.\n            for (i = 0; i < additionalTokens.length; ++i) {\n                token = additionalTokens[i];\n                // Empty tokens are considered errors... but shouldn't '' be a valid name?\n                if (token.length === 0) {\n                    // There's an error somewhere. Let's abort the fast-track.\n                    break;\n                } else if (token[0] === \"[\") {\n                    if (token.length > 2 && token[token.length - 1] === \"]\") {\n                        additionalTypes.push(TOKEN_TYPES.ARRAY_TOKEN);\n                        additionalTokens[i] = token.substr(1, token.length - 2);\n                    } else {\n                        // There's an error somewhere. Let's abort the fast-track.\n                        break;\n                    }\n                } else {\n                    if (token.indexOf(\"]\") !== -1) {\n                        // There's an error somewhere. Let's abort the fast-track.\n                        break;\n                    } else {\n                        // It was a simple property name.\n                        additionalTypes.push(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n                }\n            }\n            if (i === additionalTokens.length) {\n                // Parsed everything successfully so end function here.\n                if (out_types) {\n                    for (i = 0; i < additionalTypes.length; i++) {\n                        out_types.push(additionalTypes[i]);\n                    }\n                }\n                return tokens.concat(additionalTokens);\n            }\n        }\n\n        let inSquareBrackets = false;\n        let tokenStarted = false;\n        let lastTokenWasQuoted = false;\n\n        // We are in a context where an empty token is valid\n        let atStartToken = false;\n        let allowSegmentStart = true;\n\n        const storeNextToken = function(tokenType) {\n            // Make sure, this is not an empty token (E.g. a .. or a [] )\n            if (!tokenStarted) {\n                if (!atStartToken) {\n                    throw new Error(MSG.EMPTY_TOKEN + in_path);\n                } else {\n                    return;\n                }\n            }\n\n            // Store the token\n            tokens.push(currentToken);\n            currentToken = \"\";\n            tokenStarted = false;\n            atStartToken = false;\n            lastTokenWasQuoted = false;\n            allowSegmentStart = false;\n\n            if (out_types) {\n                out_types.push(tokenType);\n            }\n        };\n\n        for (var i = path_start; i < in_path.length; i++) {\n            const character = in_path[i];\n\n            if (character === '\"') {\n                // If we encounter a quotation mark, we start parsing the\n                // quoted section\n                if (!tokenStarted) {\n                    let endFound = false;\n\n                    // Read the quoted token\n                    for (i++; i < in_path.length; i++) {\n                        if (in_path[i] === '\"') {\n                            // We have found the end of the quoted token\n                            endFound = true;\n                            break;\n                        } else if (in_path[i] === \"\\\\\") {\n                            // Read an escaped symbol\n                            if (in_path.length > i + 1) {\n                                if (in_path[i + 1] === \"\\\\\") {\n                                    currentToken += \"\\\\\";\n                                    i++;\n                                } else if (in_path[i + 1] === '\"') {\n                                    currentToken += '\"';\n                                    i++;\n                                } else {\n                                    throw new Error(MSG.INVALID_ESCAPE_SEQUENCE + in_path);\n                                }\n                            } else {\n                                throw new Error(MSG.INVALID_ESCAPE_SEQUENCE + in_path);\n                            }\n                        } else {\n                            // Everything else is just added to the token\n                            currentToken += in_path[i];\n                        }\n                    }\n\n                    if (!endFound) {\n                        throw new Error(MSG.UNCLOSED_QUOTATION_MARKS + in_path);\n                    }\n                    lastTokenWasQuoted = true;\n                    tokenStarted = true;\n                } else {\n                    throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                }\n            } else if (!inSquareBrackets) {\n                if (character === PROPERTY_PATH_DELIMITER) {\n                    // A dot symbols starts a new token\n                    storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n\n                    allowSegmentStart = true;\n                } else if (character === \"[\") {\n                    // An opening square bracket starts a new token\n                    if (tokenStarted) {\n                        storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n\n                    // And sets the state to inSquareBrackets\n                    inSquareBrackets = true;\n                } else if (character === \"]\") {\n                    throw new Error(MSG.CLOSING_BRACKET_WITHOUT_OPENING + in_path);\n                } else if (character === \"*\") {\n                    // Store the last token\n                    if (tokenStarted) {\n                        storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n\n                    // Create a new dereference token\n                    tokens.push(\"*\");\n                    if (out_types) {\n                        out_types.push(TOKEN_TYPES.DEREFERENCE_TOKEN);\n                    }\n\n                    // Reset the token started flag\n                    tokenStarted = false;\n                    atStartToken = true;\n                    allowSegmentStart = false;\n                } else {\n                    if (!tokenStarted &&\n                        !allowSegmentStart &&\n                        !inSquareBrackets) {\n                        throw new Error(MSG.MISSING_DOT_AT_SEGMENT_START + in_path);\n                    }\n\n                    currentToken += character;\n\n                    // We have started parsing the token\n                    tokenStarted = true;\n\n                    // When a symbols appears after a closing quotation mark, we have an error\n                    if (lastTokenWasQuoted) {\n                        throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                    }\n                }\n            } else {\n                if (character === \"]\") {\n                    // A closing square bracket starts a new token\n                    storeNextToken(TOKEN_TYPES.ARRAY_TOKEN);\n\n                    // We now have to check the next character,\n                    // as only the combinations '][' and '].' are\n                    // valid\n                    if (in_path.length > i + 1) { // We only have to check this at the end of the string\n                        if (in_path[i + 1] === PROPERTY_PATH_DELIMITER) {\n                            // We are no longer in square brackets\n                            inSquareBrackets = false;\n                            allowSegmentStart = true;\n                            i++;\n                        } else if (in_path[i + 1] === \"[\") {\n                            // We remain in square brackets\n                            // so inSquareBrackets remains true;\n                            i++;\n                        } else if (in_path[i + 1] === \"*\") {\n                            // We leave the square brackets\n                            inSquareBrackets = false;\n                        } else {\n                            throw new Error(MSG.INVALID_END_OF_SQUARE_BRACKETS + in_path);\n                        }\n                    } else {\n                        inSquareBrackets = false;\n                        tokenStarted = false;\n                    }\n                } else if (character === PROPERTY_PATH_DELIMITER) {\n                    throw new Error(MSG.DOTS_IN_SQUARE_BRACKETS + in_path);\n                } else {\n                    currentToken += character;\n\n                    // We have started parsing the token\n                    tokenStarted = true;\n\n                    // When a symbols appears after a closing quotation mark, we have an error\n                    if (lastTokenWasQuoted) {\n                        throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                    }\n                }\n            }\n        }\n\n        // At the end of the path we have to distinguish a few error cases\n        if (inSquareBrackets) {\n            // There was a un-closed bracket at the end\n            throw new Error(MSG.UNCLOSED_BRACKETS + in_path);\n        } else if (in_path[in_path.length - 1] === PROPERTY_PATH_DELIMITER) {\n            // A path ended with a PROPERTY_PATH_DELIMITER\n            throw new Error(MSG.DOT_AT_END + in_path);\n        } else if (tokenStarted) {\n            // There was a valid, not yet ended token\n            storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n        }\n\n        return tokens;\n    };\n\n    /**\n     * Creates a quoted string for a path seqment to make sure it parses correctly\n     *\n     * @param in_pathSegment   - The path string to put in quotes\n     *\n     * @returns quoted path string\n     */\n    export const quotePathSegment = function(in_pathSegment: string): string {\n        // WARNING: I use RegExps here, as the normal replace\n        //          function only replaces the first occurrence\n\n        // First we escape escape symbols\n        in_pathSegment = in_pathSegment.replace(/\\\\/g, \"\\\\\\\\\");\n\n        // Then we escape quotes\n        in_pathSegment = in_pathSegment.replace(/\"/g, '\\\\\"');\n\n        // And finally, we put the string into quotation marks\n        return `\"${in_pathSegment}\"`;\n    };\n\n    /**\n     * Reverse a quoted/escaped string for a path seqment\n     *\n     * @param in_quotedPathSegment   - The quoted/escaped path string to put in quotes\n     *\n     * @return unquoted path string\n     */\n    export const unquotePathSegment = function(in_quotedPathSegment: string): string {\n        if (typeof in_quotedPathSegment !== \"string\") {\n            throw new Error(`Expecting a string as a path: ${in_quotedPathSegment}`);\n        }\n\n        if (in_quotedPathSegment[0] === '\"' && in_quotedPathSegment[in_quotedPathSegment.length - 1] === '\"') {\n            // We remove double quotes\n            in_quotedPathSegment = in_quotedPathSegment.substr(1, in_quotedPathSegment.length - 2);\n\n            // Then we unescape escape symbols\n            in_quotedPathSegment = in_quotedPathSegment.replace(/\\\\\\\\/g, \"\\\\\");\n\n            // Then we unescape quotes\n            in_quotedPathSegment = in_quotedPathSegment.replace(/\\\\\"/g, '\"');\n        }\n\n        return in_quotedPathSegment;\n    };\n\n    /**\n     * Adds quotation marks to a path string if they are needed\n     *\n     * @param in_pathSegment   - The path string to put in quotes\n     *\n     * @returns quoted path string\n     */\n    export const quotePathSegmentIfNeeded = function(in_pathSegment: string): string {\n        if (in_pathSegment.indexOf(PROPERTY_PATH_DELIMITER) !== -1 ||\n            in_pathSegment.indexOf('\"') !== -1 ||\n            in_pathSegment.indexOf(\"\\\\\") !== -1 ||\n            in_pathSegment.indexOf(\"/\") !== -1 ||\n            in_pathSegment.indexOf(\"*\") !== -1 ||\n            in_pathSegment.indexOf(\"[\") !== -1 ||\n            in_pathSegment.indexOf(\"]\") !== -1 ||\n            in_pathSegment.length === 0) {\n            return quotePathSegment(in_pathSegment);\n        } else {\n            return in_pathSegment;\n        }\n    };\n\n    /**\n     * This function checks, whether the supplied path is a valid repository absolute path.\n     *\n     * It has to be either an empty string, or a path starting with a /\n     *\n     * @param in_path - The path to check\n     */\n    export const checkValidRepositoryAbsolutePath = function(in_path: string) {\n        if (in_path !== \"\" && // either an empty reference\n            in_path[0] !== \"/\") { // or an absolute path starting with /\n            throw new Error(MSG.INVALID_PATH_IN_REFERENCE);\n        }\n    };\n\n    /**\n     * This utility function provides a canonical representation of an absolute property path.\n     * It is useful to compare partial checkout paths and property paths.\n     * The canonical form of paths is not suitable for ChangeSets.\n     *\n     * @param in_absolutePath - The absolute path to make canonical\n     * @return Absolute path in canonical form\n     */\n    export const convertAbsolutePathToCanonical = function(in_absolutePath: string): string {\n        const tokenTypes = [];\n        const tokens = tokenizePathString(in_absolutePath, tokenTypes);\n        let path = \"\";\n        for (let i = 0; i < tokenTypes.length; i++) {\n            const tokenType = tokenTypes[i];\n            switch (tokenType) {\n                case TOKEN_TYPES.PATH_ROOT_TOKEN:\n                    // Skip the leading '/'\n                    break;\n                case TOKEN_TYPES.RAISE_LEVEL_TOKEN:\n                    throw new Error(`No level up (\"../\") is expected in an absolute path: ${in_absolutePath}`);\n                case TOKEN_TYPES.DEREFERENCE_TOKEN:\n                    throw new Error(`Dereference (\"*\") is not supported in canonical paths: ${in_absolutePath}`);\n                case TOKEN_TYPES.ARRAY_TOKEN:\n                case TOKEN_TYPES.PATH_SEGMENT_TOKEN:\n                    path += (PROPERTY_PATH_DELIMITER + quotePathSegmentIfNeeded(tokens[i]));\n                    break;\n                default:\n                    break;\n            }\n        }\n        // Removes the leading PROPERTY_PATH_DELIMITER.\n        if (path) {\n            path = path.substring(1);\n        }\n        return path;\n    };\n\n    /**\n     * This utility function provides a canonical representation of a child property path.\n     * It is useful to compare partial checkout paths and property paths.\n     * The canonical form of paths is not suitable for ChangeSets.\n     *\n     * @param in_parentAbsolutePathCanonical - The absolute path of the parent property in canonical form\n     * @param in_childId - The name of the child property in its parent\n     * @returns Absolute path of the child property in canonical form\n     */\n    export const getChildAbsolutePathCanonical = function(in_parentAbsolutePathCanonical: string, in_childId: string): string {\n        const childPath = quotePathSegmentIfNeeded(String(in_childId));\n        if (in_parentAbsolutePathCanonical) {\n            return (in_parentAbsolutePathCanonical + PROPERTY_PATH_DELIMITER + childPath);\n        } else {\n            return childPath;\n        }\n    };\n\n    export enum CoverageExtent {\n        // The base path is not covered by any path from a given list of paths.\n        // This means a property with this path and all its children would not be covered.\n        UNCOVERED,\n        // The base path is partially covered by at least one path from a given list of paths.\n        // This means a property with this path would be covered, but some of its children could be uncovered.\n        PARTLY_COVERED,\n        // The base path is fully covered by at least one path from a given list of paths.\n        // This means a property with this path would be covered and all of its children would be covered also.\n        FULLY_COVERED,\n    }\n\n    interface BasePathCoverage {\n        coverageExtent: CoverageExtent,\n        pathList: string[],\n    }\n\n    /**\n     * Determines if the base path is covered by the given list of paths. From that you can deduce if a\n     * property with that path and all its children are covered by the given list of paths.\n     *\n     * This function uses the canonical representation of the property paths.\n     *\n     * @param in_basePath - The property's absolute path in canonical form\n     * @param in_paths - The array of paths that must cover the property and its children\n     * @returns The coverage of the property and its children. For a coverage of\n     *    'FULLY_COVERED', only the first matching path is returned.\n     */\n    export const getPathCoverage = function(in_basePath: string, in_paths: string[]): BasePathCoverage {\n        // First, check if the base path is entirely included in one of the paths\n        for (let i = 0; i < in_paths.length; i++) {\n            if (in_basePath.startsWith(in_paths[i])) {\n                return {\n                    coverageExtent: CoverageExtent.FULLY_COVERED,\n                    pathList: [in_paths[i]],\n                };\n            }\n        }\n        // We did not find a path including all the children of this insertion\n        // Let's check if there are paths going through it.\n        const paths = [];\n        for (let i = 0; i < in_paths.length; i++) {\n            if (in_paths[i].startsWith(in_basePath)) {\n                paths.push(in_paths[i]);\n            }\n        }\n        if (paths.length) {\n            // We found at least one path including parts of the base path.\n            return {\n                coverageExtent: CoverageExtent.PARTLY_COVERED,\n                pathList: paths,\n            };\n        }\n\n        // We did not find any path covering the given base path.\n        return {\n            coverageExtent: CoverageExtent.UNCOVERED,\n            pathList: paths,\n        };\n    };\n}\n"]}
+{"version":3,"file":"pathHelper.js","sourceRoot":"","sources":["../src/pathHelper.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH;;GAEG;;;AAEH,aAAa;AACb,yEAAgE;AAEhE,MAAM,EAAE,uBAAuB,EAAE,GAAG,EAAE,GAAG,2BAAS,CAAC;AAInD;;GAEG;AACH,IAAiB,UAAU,CA0e1B;AA1eD,WAAiB,UAAU;IAEvB,MAAM,2BAA2B,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAE3D;;;OAGG;IACH,IAAY,WAWX;IAXD,WAAY,WAAW;QACnB,6CAA6C;QAC7C,yEAAkB,CAAA;QAClB,+CAA+C;QAC/C,2DAAW,CAAA;QACX,uCAAuC;QACvC,mEAAe,CAAA;QACf,mDAAmD,CAAC,kBAAkB;QACtE,uEAAiB,CAAA;QACjB,2DAA2D;QAC3D,uEAAiB,CAAA;IACrB,CAAC,EAXW,WAAW,GAAX,sBAAW,KAAX,sBAAW,QAWtB;IAED;;;;;;;OAOG;IACU,6BAAkB,GAAG,UAAS,OAAe,EAAE,SAAyB;QACjF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,YAAY,GAAG,EAAE,CAAC;QAEtB,IAAI,SAAS,EAAE;YACX,+BAA+B;YAC/B,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;SACzC;QAED,2EAA2E;QAC3E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;YACpB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,SAAS,EAAE;gBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC;aAC/C;YACD,UAAU,GAAG,CAAC,CAAC;SAClB;aAAM,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE;YACvC,6DAA6D;YAC7D,IAAI,YAAY,GAAG,UAAS,YAAY;gBACpC,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,EAAE;oBACrC,IAAI,SAAS,EAAE;wBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;qBACjD;oBACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBACnB,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;oBACrC,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC;iBAC/B;YACL,CAAC,CAAC;YACF,YAAY,CAAC,OAAO,CAAC,CAAC;SACzB;QAED,wEAAwE;QACxE,IAAI,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;YAC5F,0EAA0E;YAC1E,IAAI,gBAAgB,GAAa,EAAE,CAAC;YACpC,MAAM,eAAe,GAAG,EAAE,CAAC;YAC3B,IAAI,KAAwB,CAAC;YAC7B,IAAI,CAAS,CAAC;YACd,yEAAyE;YACzE,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;YACnE,oBAAoB;YACpB,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACzC,2BAA2B;YAC3B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBAC1C,KAAK,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAC5B,0EAA0E;gBAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;oBACpB,0DAA0D;oBAC1D,MAAM;iBACT;qBAAM,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;oBACzB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;wBACrD,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;wBAC9C,gBAAgB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;qBAC3D;yBAAM;wBACH,0DAA0D;wBAC1D,MAAM;qBACT;iBACJ;qBAAM;oBACH,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE;wBAC3B,0DAA0D;wBAC1D,MAAM;qBACT;yBAAM;wBACH,iCAAiC;wBACjC,eAAe,CAAC,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBACxD;iBACJ;aACJ;YACD,IAAI,CAAC,KAAK,gBAAgB,CAAC,MAAM,EAAE;gBAC/B,uDAAuD;gBACvD,IAAI,SAAS,EAAE;oBACX,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACzC,SAAS,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;qBACtC;iBACJ;gBACD,OAAO,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;aAC1C;SACJ;QAED,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAE/B,oDAAoD;QACpD,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,iBAAiB,GAAG,IAAI,CAAC;QAE7B,MAAM,cAAc,GAAG,UAAS,SAAS;YACrC,6DAA6D;YAC7D,IAAI,CAAC,YAAY,EAAE;gBACf,IAAI,CAAC,YAAY,EAAE;oBACf,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,CAAC;iBAC9C;qBAAM;oBACH,OAAO;iBACV;aACJ;YAED,kBAAkB;YAClB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1B,YAAY,GAAG,EAAE,CAAC;YAClB,YAAY,GAAG,KAAK,CAAC;YACrB,YAAY,GAAG,KAAK,CAAC;YACrB,kBAAkB,GAAG,KAAK,CAAC;YAC3B,iBAAiB,GAAG,KAAK,CAAC;YAE1B,IAAI,SAAS,EAAE;gBACX,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aAC7B;QACL,CAAC,CAAC;QAEF,KAAK,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAE7B,IAAI,SAAS,KAAK,GAAG,EAAE;gBACnB,yDAAyD;gBACzD,iBAAiB;gBACjB,IAAI,CAAC,YAAY,EAAE;oBACf,IAAI,QAAQ,GAAG,KAAK,CAAC;oBAErB,wBAAwB;oBACxB,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBAC/B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;4BACpB,4CAA4C;4BAC5C,QAAQ,GAAG,IAAI,CAAC;4BAChB,MAAM;yBACT;6BAAM,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;4BAC5B,yBAAyB;4BACzB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE;gCACxB,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;oCACzB,YAAY,IAAI,IAAI,CAAC;oCACrB,CAAC,EAAE,CAAC;iCACP;qCAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;oCAC/B,YAAY,IAAI,GAAG,CAAC;oCACpB,CAAC,EAAE,CAAC;iCACP;qCAAM;oCACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;iCAC1D;6BACJ;iCAAM;gCACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;6BAC1D;yBACJ;6BAAM;4BACH,6CAA6C;4BAC7C,YAAY,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;yBAC9B;qBACJ;oBAED,IAAI,CAAC,QAAQ,EAAE;wBACX,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,wBAAwB,GAAG,OAAO,CAAC,CAAC;qBAC3D;oBACD,kBAAkB,GAAG,IAAI,CAAC;oBAC1B,YAAY,GAAG,IAAI,CAAC;iBACvB;qBAAM;oBACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;iBACtD;aACJ;iBAAM,IAAI,CAAC,gBAAgB,EAAE;gBAC1B,IAAI,SAAS,KAAK,uBAAuB,EAAE;oBACvC,mCAAmC;oBACnC,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;oBAE/C,iBAAiB,GAAG,IAAI,CAAC;iBAC5B;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,+CAA+C;oBAC/C,IAAI,YAAY,EAAE;wBACd,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBAClD;oBAED,yCAAyC;oBACzC,gBAAgB,GAAG,IAAI,CAAC;iBAC3B;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,+BAA+B,GAAG,OAAO,CAAC,CAAC;iBAClE;qBAAM,IAAI,SAAS,KAAK,GAAG,EAAE;oBAC1B,uBAAuB;oBACvB,IAAI,YAAY,EAAE;wBACd,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;qBAClD;oBAED,iCAAiC;oBACjC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,IAAI,SAAS,EAAE;wBACX,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC;qBACjD;oBAED,+BAA+B;oBAC/B,YAAY,GAAG,KAAK,CAAC;oBACrB,YAAY,GAAG,IAAI,CAAC;oBACpB,iBAAiB,GAAG,KAAK,CAAC;iBAC7B;qBAAM;oBACH,IAAI,CAAC,YAAY;wBACb,CAAC,iBAAiB;wBAClB,CAAC,gBAAgB,EAAE;wBACnB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,4BAA4B,GAAG,OAAO,CAAC,CAAC;qBAC/D;oBAED,YAAY,IAAI,SAAS,CAAC;oBAE1B,oCAAoC;oBACpC,YAAY,GAAG,IAAI,CAAC;oBAEpB,0EAA0E;oBAC1E,IAAI,kBAAkB,EAAE;wBACpB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;qBACtD;iBACJ;aACJ;iBAAM;gBACH,IAAI,SAAS,KAAK,GAAG,EAAE;oBACnB,8CAA8C;oBAC9C,cAAc,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;oBAExC,2CAA2C;oBAC3C,6CAA6C;oBAC7C,QAAQ;oBACR,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,sDAAsD;wBAChF,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,uBAAuB,EAAE;4BAC5C,sCAAsC;4BACtC,gBAAgB,GAAG,KAAK,CAAC;4BACzB,iBAAiB,GAAG,IAAI,CAAC;4BACzB,CAAC,EAAE,CAAC;yBACP;6BAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;4BAC/B,+BAA+B;4BAC/B,oCAAoC;4BACpC,CAAC,EAAE,CAAC;yBACP;6BAAM,IAAI,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;4BAC/B,+BAA+B;4BAC/B,gBAAgB,GAAG,KAAK,CAAC;yBAC5B;6BAAM;4BACH,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,8BAA8B,GAAG,OAAO,CAAC,CAAC;yBACjE;qBACJ;yBAAM;wBACH,gBAAgB,GAAG,KAAK,CAAC;wBACzB,YAAY,GAAG,KAAK,CAAC;qBACxB;iBACJ;qBAAM,IAAI,SAAS,KAAK,uBAAuB,EAAE;oBAC9C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,GAAG,OAAO,CAAC,CAAC;iBAC1D;qBAAM;oBACH,YAAY,IAAI,SAAS,CAAC;oBAE1B,oCAAoC;oBACpC,YAAY,GAAG,IAAI,CAAC;oBAEpB,0EAA0E;oBAC1E,IAAI,kBAAkB,EAAE;wBACpB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC;qBACtD;iBACJ;aACJ;SACJ;QAED,kEAAkE;QAClE,IAAI,gBAAgB,EAAE;YAClB,2CAA2C;YAC3C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,iBAAiB,GAAG,OAAO,CAAC,CAAC;SACpD;aAAM,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,uBAAuB,EAAE;YAChE,8CAA8C;YAC9C,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,GAAG,OAAO,CAAC,CAAC;SAC7C;aAAM,IAAI,YAAY,EAAE;YACrB,yCAAyC;YACzC,cAAc,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;SAClD;QAED,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,2BAAgB,GAAG,UAAS,cAAsB;QAC3D,qDAAqD;QACrD,uDAAuD;QAEvD,iCAAiC;QACjC,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEvD,wBAAwB;QACxB,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAErD,sDAAsD;QACtD,OAAO,IAAI,cAAc,GAAG,CAAC;IACjC,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,6BAAkB,GAAG,UAAS,oBAA4B;QACnE,IAAI,OAAO,oBAAoB,KAAK,QAAQ,EAAE;YAC1C,MAAM,IAAI,KAAK,CAAC,iCAAiC,oBAAoB,EAAE,CAAC,CAAC;SAC5E;QAED,IAAI,oBAAoB,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,oBAAoB,CAAC,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE;YAClG,0BAA0B;YAC1B,oBAAoB,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAEvF,kCAAkC;YAClC,oBAAoB,GAAG,oBAAoB,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAEnE,0BAA0B;YAC1B,oBAAoB,GAAG,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;SACpE;QAED,OAAO,oBAAoB,CAAC;IAChC,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,mCAAwB,GAAG,UAAS,cAAsB;QACnE,IAAI,cAAc,CAAC,OAAO,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YACtD,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE;YAC7B,OAAO,WAAA,gBAAgB,CAAC,cAAc,CAAC,CAAC;SAC3C;aAAM;YACH,OAAO,cAAc,CAAC;SACzB;IACL,CAAC,CAAC;IAEF;;;;;;OAMG;IACU,2CAAgC,GAAG,UAAS,OAAe;QACpE,IAAI,OAAO,KAAK,EAAE,IAAI,4BAA4B;YAC9C,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,sCAAsC;YAC5D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC;SAClD;IACL,CAAC,CAAC;IAEF;;;;;;;OAOG;IACU,yCAA8B,GAAG,UAAS,eAAuB;QAC1E,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,WAAA,kBAAkB,CAAC,eAAe,EAAE,UAAU,CAAC,CAAC;QAC/D,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,QAAQ,SAAS,EAAE;gBACf,KAAK,WAAW,CAAC,eAAe;oBAC5B,uBAAuB;oBACvB,MAAM;gBACV,KAAK,WAAW,CAAC,iBAAiB;oBAC9B,MAAM,IAAI,KAAK,CAAC,wDAAwD,eAAe,EAAE,CAAC,CAAC;gBAC/F,KAAK,WAAW,CAAC,iBAAiB;oBAC9B,MAAM,IAAI,KAAK,CAAC,0DAA0D,eAAe,EAAE,CAAC,CAAC;gBACjG,KAAK,WAAW,CAAC,WAAW,CAAC;gBAC7B,KAAK,WAAW,CAAC,kBAAkB;oBAC/B,IAAI,IAAI,CAAC,uBAAuB,GAAG,WAAA,wBAAwB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACxE,MAAM;gBACV;oBACI,MAAM;aACb;SACJ;QACD,+CAA+C;QAC/C,IAAI,IAAI,EAAE;YACN,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IAEF;;;;;;;;OAQG;IACU,wCAA6B,GAAG,UAAS,8BAAsC,EAAE,UAAkB;QAC5G,MAAM,SAAS,GAAG,WAAA,wBAAwB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/D,IAAI,8BAA8B,EAAE;YAChC,OAAO,CAAC,8BAA8B,GAAG,uBAAuB,GAAG,SAAS,CAAC,CAAC;SACjF;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC,CAAC;IAEF,IAAY,cAUX;IAVD,WAAY,cAAc;QACtB,uEAAuE;QACvE,kFAAkF;QAClF,6DAAS,CAAA;QACT,sFAAsF;QACtF,sGAAsG;QACtG,uEAAc,CAAA;QACd,kFAAkF;QAClF,uGAAuG;QACvG,qEAAa,CAAA;IACjB,CAAC,EAVW,cAAc,GAAd,yBAAc,KAAd,yBAAc,QAUzB;IAOD;;;;;;;;;;OAUG;IACU,0BAAe,GAAG,UAAS,WAAmB,EAAE,QAAkB;QAC3E,yEAAyE;QACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,WAAW,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;gBACrC,OAAO;oBACH,cAAc,EAAE,cAAc,CAAC,aAAa;oBAC5C,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC1B,CAAC;aACL;SACJ;QACD,sEAAsE;QACtE,mDAAmD;QACnD,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE;gBACrC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B;SACJ;QACD,IAAI,KAAK,CAAC,MAAM,EAAE;YACd,+DAA+D;YAC/D,OAAO;gBACH,cAAc,EAAE,cAAc,CAAC,cAAc;gBAC7C,QAAQ,EAAE,KAAK;aAClB,CAAC;SACL;QAED,yDAAyD;QACzD,OAAO;YACH,cAAc,EAAE,cAAc,CAAC,SAAS;YACxC,QAAQ,EAAE,KAAK;SAClB,CAAC;IACN,CAAC,CAAC;AACN,CAAC,EA1egB,UAAU,GAAV,kBAAU,KAAV,kBAAU,QA0e1B","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 path strings\n */\n\n// @ts-ignore\nimport { constants } from '@fluid-experimental/property-common';\n\nconst { PROPERTY_PATH_DELIMITER, MSG } = constants;\n\nexport type PathTree = Map<String, PathTree>;\n\n/**\n * Helper functions for string processing\n */\nexport namespace PathHelper {\n\n    const RE_ALL_OPEN_SQUARE_BRACKETS = new RegExp(\"[[]\", \"g\");\n\n    /**\n     * Token Types\n     * Type of the token in the path string\n     */\n    export enum TOKEN_TYPES {\n        /** A normal path segment, separated via . */\n        PATH_SEGMENT_TOKEN,\n        /** An array path segment, separated via [ ] */\n        ARRAY_TOKEN,\n        /** A / at the beginning of the path */\n        PATH_ROOT_TOKEN,\n        /** A * that indicates a dereferencing operation */ // note: reversed!\n        DEREFERENCE_TOKEN,\n        /** A ../ that indicates one step above the current path */\n        RAISE_LEVEL_TOKEN,\n    }\n\n    /**\n     * Tokenizes a path string\n     *\n     * @param in_path     - The path string to divide into tokens\n     * @param out_types - The types of the tokens\n     *\n     * @returns the tokens from the path string\n     */\n    export const tokenizePathString = function(in_path: string, out_types?: TOKEN_TYPES[]): string[] { // eslint-disable-line complexity\n        const tokens = [];\n        let currentToken = \"\";\n\n        if (out_types) {\n            // Make sure out_types is empty\n            out_types.splice(0, out_types.length);\n        }\n\n        // Handle a / at the beginning of the path by adding a special token for it\n        let path_start = 0;\n        if (in_path[0] === \"/\") {\n            tokens.push(\"/\");\n            if (out_types) {\n                out_types.push(TOKEN_TYPES.PATH_ROOT_TOKEN);\n            }\n            path_start = 1;\n        } else if (in_path.substr(0, 3) === \"../\") {\n            // Handle relative paths by extracting the number steps above\n            var extractLevel = function(current_path) {\n                if (current_path.substr(0, 3) === \"../\") {\n                    if (out_types) {\n                        out_types.push(TOKEN_TYPES.RAISE_LEVEL_TOKEN);\n                    }\n                    tokens.push(\"../\");\n                    extractLevel(current_path.substr(3));\n                    path_start = path_start + 3;\n                }\n            };\n            extractLevel(in_path);\n        }\n\n        // Let's see if the path is simple enough to use a fast-track algorithm.\n        let hackedPath = in_path.substr(path_start);\n        if (in_path.indexOf(\"\\\\\") === -1 && in_path.indexOf('\"') === -1 && in_path.indexOf(\"*\") === -1) {\n            // Yes, we can do something faster than parsing each character one by one.\n            let additionalTokens: string[] = [];\n            const additionalTypes = [];\n            let token: string | string[];\n            let i: number;\n            // Hack for simplicity, let's first replace all occurences of '[' by '.['\n            hackedPath = hackedPath.replace(RE_ALL_OPEN_SQUARE_BRACKETS, \".[\");\n            // Then split on '.'\n            additionalTokens = hackedPath.split(\".\");\n            // And validate each token.\n            for (i = 0; i < additionalTokens.length; ++i) {\n                token = additionalTokens[i];\n                // Empty tokens are considered errors... but shouldn't '' be a valid name?\n                if (token.length === 0) {\n                    // There's an error somewhere. Let's abort the fast-track.\n                    break;\n                } else if (token[0] === \"[\") {\n                    if (token.length > 2 && token[token.length - 1] === \"]\") {\n                        additionalTypes.push(TOKEN_TYPES.ARRAY_TOKEN);\n                        additionalTokens[i] = token.substr(1, token.length - 2);\n                    } else {\n                        // There's an error somewhere. Let's abort the fast-track.\n                        break;\n                    }\n                } else {\n                    if (token.indexOf(\"]\") !== -1) {\n                        // There's an error somewhere. Let's abort the fast-track.\n                        break;\n                    } else {\n                        // It was a simple property name.\n                        additionalTypes.push(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n                }\n            }\n            if (i === additionalTokens.length) {\n                // Parsed everything successfully so end function here.\n                if (out_types) {\n                    for (i = 0; i < additionalTypes.length; i++) {\n                        out_types.push(additionalTypes[i]);\n                    }\n                }\n                return tokens.concat(additionalTokens);\n            }\n        }\n\n        let inSquareBrackets = false;\n        let tokenStarted = false;\n        let lastTokenWasQuoted = false;\n\n        // We are in a context where an empty token is valid\n        let atStartToken = false;\n        let allowSegmentStart = true;\n\n        const storeNextToken = function(tokenType) {\n            // Make sure, this is not an empty token (E.g. a .. or a [] )\n            if (!tokenStarted) {\n                if (!atStartToken) {\n                    throw new Error(MSG.EMPTY_TOKEN + in_path);\n                } else {\n                    return;\n                }\n            }\n\n            // Store the token\n            tokens.push(currentToken);\n            currentToken = \"\";\n            tokenStarted = false;\n            atStartToken = false;\n            lastTokenWasQuoted = false;\n            allowSegmentStart = false;\n\n            if (out_types) {\n                out_types.push(tokenType);\n            }\n        };\n\n        for (var i = path_start; i < in_path.length; i++) {\n            const character = in_path[i];\n\n            if (character === '\"') {\n                // If we encounter a quotation mark, we start parsing the\n                // quoted section\n                if (!tokenStarted) {\n                    let endFound = false;\n\n                    // Read the quoted token\n                    for (i++; i < in_path.length; i++) {\n                        if (in_path[i] === '\"') {\n                            // We have found the end of the quoted token\n                            endFound = true;\n                            break;\n                        } else if (in_path[i] === \"\\\\\") {\n                            // Read an escaped symbol\n                            if (in_path.length > i + 1) {\n                                if (in_path[i + 1] === \"\\\\\") {\n                                    currentToken += \"\\\\\";\n                                    i++;\n                                } else if (in_path[i + 1] === '\"') {\n                                    currentToken += '\"';\n                                    i++;\n                                } else {\n                                    throw new Error(MSG.INVALID_ESCAPE_SEQUENCE + in_path);\n                                }\n                            } else {\n                                throw new Error(MSG.INVALID_ESCAPE_SEQUENCE + in_path);\n                            }\n                        } else {\n                            // Everything else is just added to the token\n                            currentToken += in_path[i];\n                        }\n                    }\n\n                    if (!endFound) {\n                        throw new Error(MSG.UNCLOSED_QUOTATION_MARKS + in_path);\n                    }\n                    lastTokenWasQuoted = true;\n                    tokenStarted = true;\n                } else {\n                    throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                }\n            } else if (!inSquareBrackets) {\n                if (character === PROPERTY_PATH_DELIMITER) {\n                    // A dot symbols starts a new token\n                    storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n\n                    allowSegmentStart = true;\n                } else if (character === \"[\") {\n                    // An opening square bracket starts a new token\n                    if (tokenStarted) {\n                        storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n\n                    // And sets the state to inSquareBrackets\n                    inSquareBrackets = true;\n                } else if (character === \"]\") {\n                    throw new Error(MSG.CLOSING_BRACKET_WITHOUT_OPENING + in_path);\n                } else if (character === \"*\") {\n                    // Store the last token\n                    if (tokenStarted) {\n                        storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n                    }\n\n                    // Create a new dereference token\n                    tokens.push(\"*\");\n                    if (out_types) {\n                        out_types.push(TOKEN_TYPES.DEREFERENCE_TOKEN);\n                    }\n\n                    // Reset the token started flag\n                    tokenStarted = false;\n                    atStartToken = true;\n                    allowSegmentStart = false;\n                } else {\n                    if (!tokenStarted &&\n                        !allowSegmentStart &&\n                        !inSquareBrackets) {\n                        throw new Error(MSG.MISSING_DOT_AT_SEGMENT_START + in_path);\n                    }\n\n                    currentToken += character;\n\n                    // We have started parsing the token\n                    tokenStarted = true;\n\n                    // When a symbols appears after a closing quotation mark, we have an error\n                    if (lastTokenWasQuoted) {\n                        throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                    }\n                }\n            } else {\n                if (character === \"]\") {\n                    // A closing square bracket starts a new token\n                    storeNextToken(TOKEN_TYPES.ARRAY_TOKEN);\n\n                    // We now have to check the next character,\n                    // as only the combinations '][' and '].' are\n                    // valid\n                    if (in_path.length > i + 1) { // We only have to check this at the end of the string\n                        if (in_path[i + 1] === PROPERTY_PATH_DELIMITER) {\n                            // We are no longer in square brackets\n                            inSquareBrackets = false;\n                            allowSegmentStart = true;\n                            i++;\n                        } else if (in_path[i + 1] === \"[\") {\n                            // We remain in square brackets\n                            // so inSquareBrackets remains true;\n                            i++;\n                        } else if (in_path[i + 1] === \"*\") {\n                            // We leave the square brackets\n                            inSquareBrackets = false;\n                        } else {\n                            throw new Error(MSG.INVALID_END_OF_SQUARE_BRACKETS + in_path);\n                        }\n                    } else {\n                        inSquareBrackets = false;\n                        tokenStarted = false;\n                    }\n                } else if (character === PROPERTY_PATH_DELIMITER) {\n                    throw new Error(MSG.DOTS_IN_SQUARE_BRACKETS + in_path);\n                } else {\n                    currentToken += character;\n\n                    // We have started parsing the token\n                    tokenStarted = true;\n\n                    // When a symbols appears after a closing quotation mark, we have an error\n                    if (lastTokenWasQuoted) {\n                        throw new Error(MSG.QUOTES_WITHIN_TOKEN + in_path);\n                    }\n                }\n            }\n        }\n\n        // At the end of the path we have to distinguish a few error cases\n        if (inSquareBrackets) {\n            // There was a un-closed bracket at the end\n            throw new Error(MSG.UNCLOSED_BRACKETS + in_path);\n        } else if (in_path[in_path.length - 1] === PROPERTY_PATH_DELIMITER) {\n            // A path ended with a PROPERTY_PATH_DELIMITER\n            throw new Error(MSG.DOT_AT_END + in_path);\n        } else if (tokenStarted) {\n            // There was a valid, not yet ended token\n            storeNextToken(TOKEN_TYPES.PATH_SEGMENT_TOKEN);\n        }\n\n        return tokens;\n    };\n\n    /**\n     * Creates a quoted string for a path seqment to make sure it parses correctly\n     *\n     * @param in_pathSegment   - The path string to put in quotes\n     *\n     * @returns quoted path string\n     */\n    export const quotePathSegment = function(in_pathSegment: string): string {\n        // WARNING: I use RegExps here, as the normal replace\n        //          function only replaces the first occurrence\n\n        // First we escape escape symbols\n        in_pathSegment = in_pathSegment.replace(/\\\\/g, \"\\\\\\\\\");\n\n        // Then we escape quotes\n        in_pathSegment = in_pathSegment.replace(/\"/g, '\\\\\"');\n\n        // And finally, we put the string into quotation marks\n        return `\"${in_pathSegment}\"`;\n    };\n\n    /**\n     * Reverse a quoted/escaped string for a path seqment\n     *\n     * @param in_quotedPathSegment   - The quoted/escaped path string to put in quotes\n     *\n     * @return unquoted path string\n     */\n    export const unquotePathSegment = function(in_quotedPathSegment: string): string {\n        if (typeof in_quotedPathSegment !== \"string\") {\n            throw new Error(`Expecting a string as a path: ${in_quotedPathSegment}`);\n        }\n\n        if (in_quotedPathSegment[0] === '\"' && in_quotedPathSegment[in_quotedPathSegment.length - 1] === '\"') {\n            // We remove double quotes\n            in_quotedPathSegment = in_quotedPathSegment.substr(1, in_quotedPathSegment.length - 2);\n\n            // Then we unescape escape symbols\n            in_quotedPathSegment = in_quotedPathSegment.replace(/\\\\\\\\/g, \"\\\\\");\n\n            // Then we unescape quotes\n            in_quotedPathSegment = in_quotedPathSegment.replace(/\\\\\"/g, '\"');\n        }\n\n        return in_quotedPathSegment;\n    };\n\n    /**\n     * Adds quotation marks to a path string if they are needed\n     *\n     * @param in_pathSegment   - The path string to put in quotes\n     *\n     * @returns quoted path string\n     */\n    export const quotePathSegmentIfNeeded = function(in_pathSegment: string): string {\n        if (in_pathSegment.indexOf(PROPERTY_PATH_DELIMITER) !== -1 ||\n            in_pathSegment.indexOf('\"') !== -1 ||\n            in_pathSegment.indexOf(\"\\\\\") !== -1 ||\n            in_pathSegment.indexOf(\"/\") !== -1 ||\n            in_pathSegment.indexOf(\"*\") !== -1 ||\n            in_pathSegment.indexOf(\"[\") !== -1 ||\n            in_pathSegment.indexOf(\"]\") !== -1 ||\n            in_pathSegment.length === 0) {\n            return quotePathSegment(in_pathSegment);\n        } else {\n            return in_pathSegment;\n        }\n    };\n\n    /**\n     * This function checks, whether the supplied path is a valid repository absolute path.\n     *\n     * It has to be either an empty string, or a path starting with a /\n     *\n     * @param in_path - The path to check\n     */\n    export const checkValidRepositoryAbsolutePath = function(in_path: string) {\n        if (in_path !== \"\" && // either an empty reference\n            in_path[0] !== \"/\") { // or an absolute path starting with /\n            throw new Error(MSG.INVALID_PATH_IN_REFERENCE);\n        }\n    };\n\n    /**\n     * This utility function provides a canonical representation of an absolute property path.\n     * It is useful to compare partial checkout paths and property paths.\n     * The canonical form of paths is not suitable for ChangeSets.\n     *\n     * @param in_absolutePath - The absolute path to make canonical\n     * @return Absolute path in canonical form\n     */\n    export const convertAbsolutePathToCanonical = function(in_absolutePath: string): string {\n        const tokenTypes = [];\n        const tokens = tokenizePathString(in_absolutePath, tokenTypes);\n        let path = \"\";\n        for (let i = 0; i < tokenTypes.length; i++) {\n            const tokenType = tokenTypes[i];\n            switch (tokenType) {\n                case TOKEN_TYPES.PATH_ROOT_TOKEN:\n                    // Skip the leading '/'\n                    break;\n                case TOKEN_TYPES.RAISE_LEVEL_TOKEN:\n                    throw new Error(`No level up (\"../\") is expected in an absolute path: ${in_absolutePath}`);\n                case TOKEN_TYPES.DEREFERENCE_TOKEN:\n                    throw new Error(`Dereference (\"*\") is not supported in canonical paths: ${in_absolutePath}`);\n                case TOKEN_TYPES.ARRAY_TOKEN:\n                case TOKEN_TYPES.PATH_SEGMENT_TOKEN:\n                    path += (PROPERTY_PATH_DELIMITER + quotePathSegmentIfNeeded(tokens[i]));\n                    break;\n                default:\n                    break;\n            }\n        }\n        // Removes the leading PROPERTY_PATH_DELIMITER.\n        if (path) {\n            path = path.substring(1);\n        }\n        return path;\n    };\n\n    /**\n     * This utility function provides a canonical representation of a child property path.\n     * It is useful to compare partial checkout paths and property paths.\n     * The canonical form of paths is not suitable for ChangeSets.\n     *\n     * @param in_parentAbsolutePathCanonical - The absolute path of the parent property in canonical form\n     * @param in_childId - The name of the child property in its parent\n     * @returns Absolute path of the child property in canonical form\n     */\n    export const getChildAbsolutePathCanonical = function(in_parentAbsolutePathCanonical: string, in_childId: string): string {\n        const childPath = quotePathSegmentIfNeeded(String(in_childId));\n        if (in_parentAbsolutePathCanonical) {\n            return (in_parentAbsolutePathCanonical + PROPERTY_PATH_DELIMITER + childPath);\n        } else {\n            return childPath;\n        }\n    };\n\n    export enum CoverageExtent {\n        // The base path is not covered by any path from a given list of paths.\n        // This means a property with this path and all its children would not be covered.\n        UNCOVERED,\n        // The base path is partially covered by at least one path from a given list of paths.\n        // This means a property with this path would be covered, but some of its children could be uncovered.\n        PARTLY_COVERED,\n        // The base path is fully covered by at least one path from a given list of paths.\n        // This means a property with this path would be covered and all of its children would be covered also.\n        FULLY_COVERED,\n    }\n\n    interface BasePathCoverage {\n        coverageExtent: CoverageExtent;\n        pathList: string[];\n    }\n\n    /**\n     * Determines if the base path is covered by the given list of paths. From that you can deduce if a\n     * property with that path and all its children are covered by the given list of paths.\n     *\n     * This function uses the canonical representation of the property paths.\n     *\n     * @param in_basePath - The property's absolute path in canonical form\n     * @param in_paths - The array of paths that must cover the property and its children\n     * @returns The coverage of the property and its children. For a coverage of\n     *    'FULLY_COVERED', only the first matching path is returned.\n     */\n    export const getPathCoverage = function(in_basePath: string, in_paths: string[]): BasePathCoverage {\n        // First, check if the base path is entirely included in one of the paths\n        for (let i = 0; i < in_paths.length; i++) {\n            if (in_basePath.startsWith(in_paths[i])) {\n                return {\n                    coverageExtent: CoverageExtent.FULLY_COVERED,\n                    pathList: [in_paths[i]],\n                };\n            }\n        }\n        // We did not find a path including all the children of this insertion\n        // Let's check if there are paths going through it.\n        const paths = [];\n        for (let i = 0; i < in_paths.length; i++) {\n            if (in_paths[i].startsWith(in_basePath)) {\n                paths.push(in_paths[i]);\n            }\n        }\n        if (paths.length) {\n            // We found at least one path including parts of the base path.\n            return {\n                coverageExtent: CoverageExtent.PARTLY_COVERED,\n                pathList: paths,\n            };\n        }\n\n        // We did not find any path covering the given base path.\n        return {\n            coverageExtent: CoverageExtent.UNCOVERED,\n            pathList: paths,\n        };\n    };\n}\n"]}

package/dist/rebase.js

@@ -82,12 +82,12 @@ function rebaseToRemoteChanges(change, getUnrebasedChange, getRebasedChanges, is
                     let changeset = c.changeSet;
                     let applyAfterMetaInformation;
                     if (alreadyRebasedChanges[0] !== undefined && alreadyRebasedChanges[0].guid === c.guid) {
-                        const invertedChange = new changeset_1.ChangeSet(fastest_json_copy_1.copy(alreadyRebasedChanges[0].changeSet));
+                        const invertedChange = new changeset_1.ChangeSet((0, fastest_json_copy_1.copy)(alreadyRebasedChanges[0].changeSet));
                         invertedChange.toInverseChangeSet();
                         invertedChange.applyChangeSet(rebaseBaseChangeSetForAlreadyRebasedChanges);
                         applyAfterMetaInformation = new Map();
                         const conflicts2 = [];
-                        changeset = fastest_json_copy_1.copy(alreadyRebasedChanges[0].changeSet);
+                        changeset = (0, fastest_json_copy_1.copy)(alreadyRebasedChanges[0].changeSet);
                         rebaseBaseChangeSetForAlreadyRebasedChanges._rebaseChangeSet(changeset, conflicts2, {
                             applyAfterMetaInformation,
                         });
@@ -111,18 +111,18 @@ function rebaseToRemoteChanges(change, getUnrebasedChange, getRebasedChanges, is
         .then(() => makePromise(getRebasedChanges(change.remoteHeadGuid)))
         .then((remoteChanges) => {
         const conflicts = [];
-        if (!isEqual_1.default(changesOnOtherLocalBranch.map((change) => change.guid), remoteChanges.map((change) => change.guid))) {
+        if (!(0, isEqual_1.default)(changesOnOtherLocalBranch.map((change) => change.guid), remoteChanges.map((change) => change.guid))) {
             for (const remoteChange of remoteChanges) {
                 let applyAfterMetaInformation = commitsOnOtherLocalBranch[remoteChange.guid] !== undefined ?
                     remoteChange.rebaseMetaInformation :
                     undefined;
                 let changeset = remoteChange.changeSet;
                 if (changesOnOtherLocalBranch[0] !== undefined && changesOnOtherLocalBranch[0].guid === remoteChange.guid) {
-                    const invertedChange = new changeset_1.ChangeSet(fastest_json_copy_1.copy(changesOnOtherLocalBranch[0].changeSet));
+                    const invertedChange = new changeset_1.ChangeSet((0, fastest_json_copy_1.copy)(changesOnOtherLocalBranch[0].changeSet));
                     invertedChange.toInverseChangeSet();
                     invertedChange.applyChangeSet(rebaseBaseChangeSet);
                     applyAfterMetaInformation = new Map();
-                    changeset = fastest_json_copy_1.copy(changesOnOtherLocalBranch[0].changeSet);
+                    changeset = (0, fastest_json_copy_1.copy)(changesOnOtherLocalBranch[0].changeSet);
                     rebaseBaseChangeSet._rebaseChangeSet(changeset, conflicts, { applyAfterMetaInformation });
                     // This is disabled for performance reasons. Only used during debugging
                     // assert(isEqual(changeset,this.remoteChanges[i].changeSet),
@@ -145,7 +145,7 @@ exports.rebaseToRemoteChanges = rebaseToRemoteChanges;
 function rebaseChangeArrays(baseChangeSet, changesToRebase) {
     let rebaseBaseChangeSet = baseChangeSet;
     for (const change of changesToRebase) {
-        const copiedChangeSet = new changeset_1.ChangeSet(fastest_json_copy_1.copy(change.changeSet));
+        const copiedChangeSet = new changeset_1.ChangeSet((0, fastest_json_copy_1.copy)(change.changeSet));
         copiedChangeSet.toInverseChangeSet();
         const conflicts = [];
         change.rebaseMetaInformation = new Map();