@fluid-experimental/property-properties 1.1.0 → 1.2.0

package/dist/properties/arrayProperty.js.map

@@ -1 +1 @@
-{"version":3,"file":"arrayProperty.js","sourceRoot":"","sources":["../../src/properties/arrayProperty.js"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH;;GAEG;AACH,MAAM,EACF,sBAAsB,EACtB,SAAS,EACT,UAAU,EACV,YAAY,GACf,GAAG,OAAO,CAAC,wCAAwC,CAAC,CAAC;AACtD,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,qCAAqC,CAAC,CAAC,SAAS,CAAC;AACzE,MAAM,EAAE,kBAAkB,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,qCAAqC,CAAC,CAAC;AAC5F,MAAM,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;AACrD,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,EAAE,oCAAoC,EAAE,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC;AACnF,MAAM,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC;AAC/D,MAAM,EAAE,gCAAgC,EAAE,GAAG,OAAO,CAAC,oCAAoC,CAAC,CAAC;AAC3F,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,EAAE,oBAAoB,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC;AAE7E,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC;AAEtC,IAAI,oBAAoB,GAAG,YAAY,CAAC,oBAAoB,CAAC;AAE7D,uEAAuE;AACvE,yEAAyE;AACzE,qEAAqE;AACrE,4EAA4E;AAC5E,wDAAwD;AACxD,mFAAmF;AACnF,uCAAuC;AACvC,IAAI,+BAA+B,GAAG;IAClC,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,cAAc,GAAG,oBAAoB,CAAC,KAAK;CAC1E,CAAC;AACF,IAAI,qBAAqB,GAAG;IACxB,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,cAAc;CAC7C,CAAC;AACF,IAAI,mBAAmB,GAAG;IACtB,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,KAAK;CACpC,CAAC;AACF,IAAI,uBAAuB,GAAG;IAC1B,SAAS;IACT,qBAAqB;IACrB,mBAAmB;IACnB,+BAA+B;CAClC,CAAC;AAEF,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC;AAE3C;;;;;;;;;;;;;GAaG;AACH,IAAI,wCAAwC,GAAG,UAAS,gBAAgB,EAAE,iBAAiB;IACvF,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,OAAO,EAAE,CAAC;KACb;IAED,mEAAmE;IACnE,mEAAmE;IACnE,mEAAmE;IACnE,qEAAqE;IACrE,+CAA+C;IAC/C,IAAI,iBAAiB,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC9C,IAAI,mBAAmB,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAE9C,6EAA6E;QAC7E,qFAAqF;QACrF,IAAI,KAAK,GAAG,CAAC,CAAC,aAAa,CAAC,iBAAiB,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAChH,IAAI,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAErE,yFAAyF;QACzF,uBAAuB;QACvB,IAAI,QAAQ,GAAG;YACX,cAAc,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,YAAY,EAAE,CAAC;YACf,iBAAiB,EAAE,mBAAmB,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC;YACjE,aAAa,EAAE,SAAS;SAC3B,CAAC;QAEF,mDAAmD;QACnD,IAAI,cAAc,GAAG,CAAC,CAAC,aAAa,CAAC,iBAAiB,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACpF,IAAI,iBAAiB,CAAC,cAAc,CAAC,KAAK,SAAS;YAC/C,iBAAiB,CAAC,cAAc,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC,cAAc,EAAE;YAC9E,cAAc,EAAE,CAAC;SACpB;QAED,wEAAwE;QACxE,0EAA0E;QAC1E,wEAAwE;QACxE,sEAAsE;QACtE,8DAA8D;QAC9D,IAAI,mBAAmB,GAAG,QAAQ,CAAC,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAEzE,IAAI,CAAC,GAAG,cAAc,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,mBAAmB,EAAE,CAAC,EAAE,EAAE;YAC7E,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,iBAAiB,IAAI,QAAQ,CAAC,iBAAiB,EAAE;gBACtE,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/B,cAAc,EAAE,CAAC;aACpB;SACJ;QAED,gEAAgE;QAChE,iBAAiB,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,8CAA8C;KACxG;IAED,uEAAuE;IACvE,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAElD,qBAAqB;IACrB,IAAI,eAAe,GAAG,EAAE,CAAC;IACzB,IAAI,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC/C,OAAO,cAAc,EAAE;QACnB,eAAe,CAAC,OAAO,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QACrD,cAAc,GAAG,cAAc,CAAC,aAAa,CAAC;KACjD;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC,CAAC;AAEF,MAAa,aAAc,SAAQ,gCAAgC;IAC/D;;;;;;OAMG;IACH,YAAY,SAAS,EAAE,QAAQ;QAC3B,KAAK,CAAC,SAAS,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,CAAC;QAErD,aAAa;QACb,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QAExB,0DAA0D;QAC1D,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1B;QAED,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;;OAOG;IACH,2BAA2B,CAAC,YAAY;QACpC,IAAI,KAAK,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC7D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,qCAAqC,CAAC,CAAC;SAC9D;QAED,OAAO,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;IAC7B,CAAC;IAED;;;;;;;;OAQG;IACH,mBAAmB,CAAC,UAAU,EAAE,cAAc;QAC1C,wDAAwD;QACxD,IAAI,cAAc,KAAK,UAAU,CAAC,WAAW,CAAC,WAAW,EAAE;YACvD,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAEnC,4FAA4F;YAC5F,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAClB,qDAAqD;gBACrD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mCAAmC,GAAG,UAAU,CAAC,CAAC;aACzE;YAED,mFAAmF;YACnF,oBAAoB;YACpB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE;gBAClD,OAAO,SAAS,CAAC;aACpB;YACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;SACzC;aAAM;YACH,OAAO,gCAAgC,CAAC,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;SAChH;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,WAAW,EAAE,QAAQ;QACxB,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACH,cAAc;QACV,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,SAAS;QACV,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,SAAS,CAAC,CAAC;SAC3D;aAAM;YACH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;SAC7D;QACD,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,GAAG,IAAI;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,SAAS;QACb,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;YACtB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;SAClC;aAAM;YACH,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,WAAW;QACd,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,GAAG;QACC,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAC9C,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7F,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC;IAED;;OAEG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,WAAW,EAAE,QAAQ;QACrB,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YACrB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,qBAAqB,GAAG,QAAQ,CAAC,CAAC;SAC7D;QACD,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;OAUG;IACH,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,UAAU;QACtC,IAAI,QAAQ,EAAE;YACV,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACpB,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,kBAAkB,GAAG,0BAA0B,CAAC,CAAC;gBAE/F,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACvC,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;wBACtC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;qBACvB;yBAAM;wBACH,IAAI,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC3C,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;qBACxF;oBACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAClB;gBAED,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;aAChC;iBAAM;gBACH,gCAAgC,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;aACrG;SACJ;aAAM;YACH,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;SACtC;IACL,CAAC;IAED;;;OAGG;IACH,kBAAkB,CAAC,SAAS;QACxB,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;gBACtB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAClC;iBAAM;gBACH,gCAAgC,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;aAC9E;SACJ;aAAM;YACH,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE;gBACvE,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,mBAAmB,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;aACrF;YAED,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,IAAI,QAAQ,GAAG,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC;YAC9C,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,UAAS,KAAK,EAAE,KAAK;gBACnC,IAAI,KAAK,GAAG,QAAQ,EAAE;oBAClB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;iBAC7B;qBAAM;oBACH,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE;wBAC1C,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;qBAC1B;iBACJ;YACL,CAAC,CAAC,CAAC;SACN;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,CAAC,SAAS;QACf,IAAI,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,IAAI,YAAY,KAAK,SAAS,EAAE;YAC5B,YAAY,CAAC,0BAA0B,EAAE,CAAC;YAC1C,aAAa,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,YAAY,CAAC,yBAAyB,EAAE,CAAC;SAC5C;aAAM;YACH,aAAa,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAC1E;IACL,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;YAClB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SACzC;IACL,CAAC;IAED;;;;;OAKG;IACH,kBAAkB;QACd,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,YAAY;QACvB,IAAI,cAAc,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC/C,SAAS,CAAC,SAAS,CAAC,iCAAiC,CAAC,cAAc,EAChE,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAE5C,IAAI,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,SAAS,CAAC,SAAS,CAAC,iCAAiC,CAAC,YAAY,EAC9D,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAE5C,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,kBAAkB;QACd,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,gBAAgB;QACZ,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,UAAU,EAAE,QAAQ;QAC5B,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,IAAI,IAAI,CAAC,MAAM;YACX,IAAI,CAAC,MAAM,KAAK,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC5D,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SAC3B;QAED,IAAI,UAAU,KAAK,IAAI,EAAE;YACrB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;gBACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;gBAChC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC;aACpC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,SAAS,CAAC;aACnC;SACJ;QAED,IAAI,QAAQ,KAAK,IAAI,EAAE;YACnB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;gBACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;gBAChC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;aAChC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aACjC;SACJ;QAED,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS;gBAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE;gBACnC,IAAI,QAAQ,KAAK,CAAC,EAAE;oBAChB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;iBAC3B;qBAAM;oBACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;iBACnD;aACJ;iBAAM;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;aAChC;SACJ;aAAM,IAAI,QAAQ,EAAE;YACjB,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,QAAQ;QACnB,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,IAAI,CAAC,MAAM,KAAK,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;gBAC5D,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;gBAE7B,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS;oBAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS;oBACjC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,EAAE;oBAC9D,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;iBAC3B;aACJ;iBAAM;gBACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;OAGG;IACH,cAAc;QACV,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;YAC3B,OAAO,CAAC,CAAC;SACZ;QAED,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,SAAS,EAAE,QAAQ;QAC3B,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YACtB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,kBAAkB,GAAG,2BAA2B,CAAC,CAAC;SAC7E;QAED,IAAI,kBAAkB,CAAC,OAAO,EAAE;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;oBACrC,QAAQ,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBACvC;aACJ;YACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;SAClC;QACD,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;;;OAQG;IACH,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,aAAa;QAC1D,IAAI,aAAa,KAAK,SAAS,EAAE;YAC7B,aAAa,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACpE,MAAM,KAAK,CAAC,GAAG,CAAC,oBAAoB,GAAG,SAAS,CAAC,CAAC;SACrD;QACD,IAAI,aAAa,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACrC,IAAI,GAAG,GAAG,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBACtC,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,CAAC,EAAE;oBACxC,IAAI,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;iBACtG;gBAED,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;oBAClB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;iBAC9C;qBAAM;oBACH,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;iBACzB;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAClB;YAED,QAAQ,GAAG,GAAG,CAAC;SAClB;QACD,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAEhD,+BAA+B;QAC/B,IAAI,SAAS,GAAG;YACZ,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;SAC1D,CAAC;QACF,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,WAAW,CAAC,SAAS,EAAE,cAAc;QACjC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,UAAU;YACrD,yDAAyD,CAAC,CAAC;QAC/D,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,EAC1C,GAAG,CAAC,UAAU,GAAG,8DAA8D,CAAC,CAAC;QACrF,YAAY,CAAC,MAAM,CAAC,SAAS,GAAG,cAAc,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,cAAc,GAAG,CAAC,EACpG,GAAG,CAAC,oBAAoB,GAAG,gBAAgB,GAAG,cAAc,GAAG,2BAA2B,GAAG,SAAS,CAAC,CAAC;QAC5G,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;YACzD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC5D,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,SAAS,EAAE,cAAc;QACjC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,EAAE,CAAC,EAAE;gBACrC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE;oBAC7D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;iBAC5D;qBAAM;oBACH,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;iBAChE;aACJ;SACJ;QAED,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACH,2BAA2B,CAAC,SAAS,EAAE,cAAc;QACjD,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAE5C,+BAA+B;QAC/B,IAAI,SAAS,GAAG;YACZ,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;SAC1C,CAAC;QACF,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;OAQG;IACH,QAAQ,CAAC,SAAS,EAAE,QAAQ;QACxB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;YAC/C,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,kBAAkB,GAAG,wBAAwB,CAAC,CAAC;SAC1E;QACD,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACtB,qDAAqD;YACrD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,GAAG,mDAAmD,CAAC,CAAC;SACzF;QACD,YAAY,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,EACpF,GAAG,CAAC,iBAAiB,GAAG,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,2BAA2B,GAAG,SAAS;YACjG,kBAAkB,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,wBAAwB,CAAC,SAAS,EAAE,QAAQ;QACxC,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACH,2BAA2B,CAAC,SAAS,EAAE,QAAQ;QAC3C,iDAAiD;QACjD,IAAI,SAAS,GAAG,CAAC,EAAE;YACf,MAAM,KAAK,CAAC,GAAG,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;SACtD;QACD,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,WAAW,GAAG,EAAE,CAAC;QAErB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,sEAAsE;YACtE,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7D,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;SACzD;aAAM;YACH,gEAAgE;YAChE,qFAAqF;YACrF,wFAAwF;YACxF,+DAA+D;YAC/D,IAAI,CAAC,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACxD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACtC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE;4BACxD,MAAM;yBACT;qBACJ;oBACD,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC7D,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9E,CAAC,GAAG,CAAC,CAAC;iBACT;aACJ;YACD,SAAS,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;YAClC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC;IACL,CAAC;IAED;;;;;;OAMG;IACH,MAAM;QACF,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,WAAW;QACX,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,CAAC;IACjE,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,GAAG,CAAC,WAAW,EAAE,UAAU;QACvB,UAAU,GAAG,UAAU,IAAI,EAAE,CAAC;QAC9B,UAAU,CAAC,uBAAuB;YAC9B,UAAU,CAAC,uBAAuB,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;gBACzF,UAAU,CAAC,uBAAuB,CAAC;QAC3C,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;YACxB,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,EAAE,EAAE;gBACnC,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxB,cAAc,GAAG,CAAC,CAAC;aACtB;iBAAM,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,IAAI,EAAE;gBAC5C,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtB,cAAc,GAAG,CAAC,CAAC;aACtB;iBAAM;gBACH,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,yBAAyB,CAAC,CAAC;gBAClE,IAAI,IAAI,GAAG,UAAU,CAAC,uBAAuB,CAAC;gBAC9C,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,EAClD,GAAG,CAAC,gBAAgB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9C;YACD,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC9D,IAAI,UAAU,CAAC,uBAAuB,KAAK,YAAY,CAAC,oBAAoB,CAAC,QAAQ,EAAE;oBACnF,IAAI,GAAG,CAAC,KAAK,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;wBAC5E,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC;iBAC/C;gBACD,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,WAAW,CAAC,GAAG,EAAE;oBACxC,IAAI,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC;iBAClD;gBACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnE,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;oBAClD,OAAO,SAAS,CAAC;iBACpB;aACJ;YACD,OAAO,IAAI,CAAC;SACf;QAED,IAAI,WAAW,KAAK,WAAW,CAAC,IAAI,EAAE;YAClC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;SACzB;aAAM,IAAI,WAAW,KAAK,WAAW,CAAC,EAAE,EAAE;YACvC,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;SAC3B;aAAM,IAAI,WAAW,KAAK,WAAW,CAAC,GAAG,EAAE;YACxC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;SAChD;aAAM;YACH,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAClC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,0BAA0B,CAAC,CAAC;YACnE,IAAI,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,UAAU,CAAC,uBAAuB,KAAK,YAAY,CAAC,oBAAoB,CAAC,MAAM,EAAE;gBACjF,IAAI,MAAM,YAAY,QAAQ,CAAC,iBAAiB,EAAE;oBAC9C,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;iBACvB;aACJ;YACD,OAAO,MAAM,CAAC;SACjB;IACL,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,SAAS;QACL,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;SAClC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,YAAY,EAAE,eAAe;QACzC,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,wEAAwE;QACxE,IAAI,aAAa,GAAG,IAAI,sBAAsB,CAAC,YAAY,CAAC,CAAC;QAE7D,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,oDAAoD;YACpD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;gBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;oBACtC,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,oBAAoB,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpE,IAAI,yBAAyB,GAAG,EAAE,CAAC;wBACnC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;wBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;4BAClD,IAAI,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC1D,oBAAoB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;4BAC/D,qDAAqD;4BACrD,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;4BACjC,eAAe,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;4BAC7D,yBAAyB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;yBACnD;wBACD,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,yBAAyB,CAAC,EAAE,KAAK,CAAC,CAAC;wBAC9D,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,UAAU,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC1D,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;4BACzB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;yBAClC;wBACD,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;wBAC5H,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,kBAAkB;wBAClB,IAAI,oBAAoB,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpE,IAAI,UAAU,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC;wBAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;4BAClD,IAAI,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,EAC1C,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;4BAC1E,IAAI,CAAC,gBAAgB,EAAE;gCACnB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;6BACzD;4BACD,gBAAgB,CAAC,eAAe,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;yBACpE;wBACD,MAAM;oBACV;wBACI,OAAO,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;iBACpG;gBACD,aAAa,CAAC,IAAI,EAAE,CAAC;aACxB;SACJ;aAAM;YACH,oDAAoD;YACpD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;gBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;oBACtC,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,YAAY,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC5D,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE;4BACrD,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC;yBACtC;wBAED,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9H,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,kBAAkB;wBAClB,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,MAAM;oBACV;wBACI,OAAO,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;iBACpG;gBACD,aAAa,CAAC,IAAI,EAAE,CAAC;aACxB;SACJ;QAED,kHAAkH;QAClH,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,mBAAmB,EAAE,iBAAiB;QACrD,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,CAAC,WAAW,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,CAAC;QACzD,kHAAkH;QAClH,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,QAAQ;QAChB,wCAAwC;QACxC,YAAY,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAExD,0DAA0D;QAC1D,IAAI,cAAc,GAAG,IAAI,EACrB,YAAY,GAAG,IAAI,CAAC;QAExB,IAAI,QAAQ,KAAK,SAAS;YACtB,CAAC,QAAQ,GAAG,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;YACrE,cAAc,GAAG,SAAS,CAAC;SAC9B;QACD,IAAI,QAAQ,KAAK,SAAS;YACtB,CAAC,QAAQ,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YAC5D,YAAY,GAAG,SAAS,CAAC;SAC5B;QAED,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,gBAAgB;QACvB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,EAAE,CAAC,EAAE;gBACjD,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;aAC3D;SACJ;QACD,gDAAgD;QAChD,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;OAUG;IACH,8BAA8B,CAAC,gBAAgB,EAAE,eAAe;QAC5D,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC3C,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;SAC9C;QAED,6FAA6F;QAC7F,sEAAsE;QACtE,IAAI,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,2GAA2G;QAC3G,4FAA4F;QAC5F,0GAA0G;QAC1G,mBAAmB;QACnB,4GAA4G;QAC5G,yGAAyG;QACzG,2BAA2B;QAC3B,+GAA+G;QAC/G,yEAAyE;QAEzE,qDAAqD;QACrD,IAAI,oBAAoB,GAAG,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,gBAAgB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,KAAK,SAAS;gBACxC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE;gBAClD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;aAC7D;YAED,IAAI,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9C,yGAAyG;YACzG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE;gBAChE,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC1D;YACD,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAClC;QAED,IAAI,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAEpD,+BAA+B;QAC/B,IAAI,gCAAgC,GAAG,EAAE,CAAC;QAC1C,IAAI,+BAA+B,GAAG,EAAE,CAAC;QACzC,IAAI,cAAc,GAAG,EAAE,CAAC;QACxB,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE;YACzC,4BAA4B;YAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAEhD,+CAA+C;YAC/C,IAAI,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACrB,iEAAiE;gBACjE,IAAI,CAAC,kBAAkB;oBACnB,+BAA+B,CAAC,MAAM,GAAG,CAAC;oBAC1C,CAAC,CAAC,IAAI,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,KAAK,EAAE;oBAC5E,0DAA0D;oBAC1D,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;iBAC/C;qBAAM;oBACH,uBAAuB;oBACvB,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACzC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC5C,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,kBAAkB,GAAG,KAAK,CAAC;iBAC9B;aACJ;iBAAM;gBACH,kBAAkB,GAAG,IAAI,CAAC;aAC7B;SACJ;QAED,wGAAwG;QACxG,uEAAuE;QACvE,IAAI,eAAe,GAAG,wCAAwC,CAAC,+BAA+B,EAAE,cAAc,CAAC,CAAC;QAEhH,4FAA4F;QAC5F,IAAI,OAAO,GAAG,EAAE,CAAC;QAEjB,IAAI,0BAA0B,GAAG,CAAC,CAAC;QACnC,IAAI,yBAAyB,GAAG,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,IAAI,wBAAwB,EAAE,uBAAuB,EAAE,aAAa,CAAC;YACrE,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE;gBAC5B,iEAAiE;gBACjE,wBAAwB,GAAG,gCAAgC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,uBAAuB,GAAG,+BAA+B,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9E,aAAa,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;aACtD;iBAAM;gBACH,0FAA0F;gBAC1F,wBAAwB,GAAG,kBAAkB,CAAC;gBAC9C,uBAAuB,GAAG,WAAW,CAAC,MAAM,CAAC;gBAC7C,aAAa,GAAG,CAAC,CAAC;aACrB;YAED,6GAA6G;YAC7G,gDAAgD;YAChD,IAAI,wBAAwB,GAAG,0BAA0B,EAAE;gBACvD,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;gBACtC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,0BAA0B,EAAE,wBAAwB,GAAG,0BAA0B,CAAC,CAAC,CAAC;gBACzG,IAAI,CAAC,2BAA2B,CAAC,0BAA0B,GAAG,MAAM,EAChE,wBAAwB,GAAG,0BAA0B,CAAC,CAAC;gBAC3D,YAAY,IAAI,wBAAwB,GAAG,0BAA0B,CAAC;aACzE;YAED,4GAA4G;YAC5G,gDAAgD;YAChD,IAAI,uBAAuB,GAAG,yBAAyB,EAAE;gBACrD,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;gBACtC,IAAI,gBAAgB,GAAG,WAAW,CAAC,KAAK,CAAC,yBAAyB,EAAE,uBAAuB,CAAC,CAAC;gBAC7F,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;oBAChB,0BAA0B;oBAC1B,QAAQ,CAAC,gBAAgB,CAAC;iBAC7B,CAAC,CAAC;gBACH,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC7B,IAAI,kBAAkB,GAAG,oCAAoC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;gBACvF,IAAI,CAAC,2BAA2B,CAAC,0BAA0B,GAAG,MAAM,EAAE,kBAAkB,CAAC,CAAC;gBAC1F,YAAY,IAAI,kBAAkB,CAAC,MAAM,CAAC;aAC7C;YAED,mCAAmC;YACnC,0BAA0B,GAAG,wBAAwB,GAAG,aAAa,CAAC;YACtE,yBAAyB,GAAG,uBAAuB,GAAG,aAAa,CAAC;YACpE,MAAM,IAAI,YAAY,CAAC;YAEvB,qEAAqE;YACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;gBACnF,IAAI,YAAY,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,uBAAuB,GAAG,CAAC,CAAC,EACxC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;gBAEtE,8CAA8C;gBAC9C,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE;oBAC3C,qEAAqE;oBACrE,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,CAAC;oBAEpD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;wBACjB,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,wBAAwB,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;qBACrE;yBAAM;wBACH,IAAI,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;wBAClD,IAAI,oBAAoB,CAAC,CAAC,CAAC,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,wBAAwB,GAAG,CAAC,EAAE;4BAC3F,oBAAoB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;yBAC9C;6BAAM;4BACH,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,wBAAwB,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;yBACvE;qBACJ;iBACJ;aACJ;SACJ;QAED,oEAAoE;QACpE,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE;YACtC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;SACnC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,iBAAiB,CAAC,gBAAgB;QAC9B,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,MAAM;QAClB,2DAA2D;QAC3D,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,QAAQ;QACpB,IAAI,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC1B,IAAI,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,YAAY,EAAE;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACJ;aAAM;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;aAClB;SACJ;QACG,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,iBAAiB,CAAC,gBAAgB;QAC9B,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,gBAAgB,EAAE,eAAe,EAAE,mBAAmB,EAAE,kBAAkB;QACnF,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/D,CAAC,gBAAgB,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/D,CAAC,gBAAgB,CAAC,MAAM;gBACpB,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;oBAC/B,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;wBACjC,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;4BAChC,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC/D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;SAChD;QAED,IAAI,WAAW,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAE7C,IAAI,CAAC,gBAAgB,CAAC,MAAM;YACxB,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YAC7B,qEAAqE;YACrE,IAAI,WAAW,GAAG,CAAC,EAAE;gBACjB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBACjC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBAChC,IAAI,eAAe,GAAG;oBAClB,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;iBAC7B,CAAC;gBACF,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;gBACrC,OAAO,eAAe,CAAC;aAC1B;iBAAM;gBACH,mDAAmD;gBACnD,OAAO,EAAE,CAAC;aACb;SACJ;QAED,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAE7B,IAAI,QAAQ,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE;YAC5F,OAAO,IAAI,CAAC,8BAA8B,CAAC,gBAAgB,EAAE,eAAe,CAAC,CAAC;SACjF;aAAM;YACH,gFAAgF;YAEhF,wDAAwD;YACxD,IAAI,aAAa,GAAG;gBAChB,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM;aAC3F,CAAC;YACF,IAAI,WAAW,GAAG,CAAC,EAAE;gBACjB,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;aAC7C;YAED,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACpB,IAAI,oBAAoB,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,MAAM,GAAG,EAAE,CAAC;gBAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBAClD,IAAI,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC1D,oBAAoB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;oBAC/D,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,eAAe,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,CAAC,CAAC;oBACzF,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;iBAChC;gBACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;gBAChD,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;aACzC;iBAAM;gBACH,+DAA+D;gBAC/D,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,mBAAmB,EAAE,EAAE;oBACrE,qCAAqC;oBACrC,IAAI,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBACxC,IAAI,cAAc,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnD,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;oBACxB,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,IAAI,IAAI,CAAC,OAAO,KAAK,QAAQ,EAAE;wBACvD,2EAA2E;wBAC3E,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;4BACtB,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE;gCACvG,MAAM;6BACT;yBACJ;qBACJ;yBAAM;wBACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;4BACtB,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EAAE;gCACjC,MAAM;6BACT;yBACJ;qBACJ;oBACD,IAAI,CAAC,KAAK,GAAG,EAAE;wBACX,OAAO,EAAE,CAAC;qBACb;iBACJ;gBACD,2CAA2C;gBAC3C,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACrF;YAED,uCAAuC;YACvC,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAEnC,qEAAqE;YACrE,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YAEhC,OAAO,aAAa,CAAC;SACxB;IACL,CAAC;IAED,+BAA+B,CAAC,wBAAwB,EACpD,gBAAgB,EAChB,gCAAgC;QAChC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,wBAAwB,CAAC,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC/E,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC;SAC7D;QACD,qCAAqC;QACrC,IAAI,QAAQ,GAAG,IAAI,sBAAsB,CAAC,wBAAwB,CAAC,CAAC;QACpE,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAClD,IAAI,EAAE,EAAE,YAAY,CAAC;QACrB,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,iBAAiB,GAAG,gBAAgB,EAAE;YAC9D,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE;gBACnB,EAAE,GAAG,QAAQ,CAAC,aAAa,CAAC;gBAC5B,YAAY,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;aAC9C;iBAAM;gBACH,cAAc;gBACd,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBAC/C,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC;aACnC;YAED,IAAI,iBAAiB,GAAG,YAAY,EAAE;gBAClC,8CAA8C;gBAE9C,2EAA2E;gBAC3E,IAAI,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;oBACvE,oCAAoC;oBACpC,IAAI,UAAU,GAAG,SAAS,CAAC;oBAC3B,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;wBAC3C,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACrD,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC,MAAM,EAAE;4BACxE,sCAAsC;yBACzC;6BAAM;4BACH,UAAU,GAAG,SAAS,CAAC;yBAC1B;qBACJ;oBAED,IAAI,UAAU,EAAE;wBACZ,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CACnE;4BACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAC/E,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CAAC,CAAC;qBACX;yBAAM;wBACH,mBAAmB;wBACnB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;4BAChB,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;yBACtB;wBACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,iBAAiB,GAAG,EAAE,CAAC,MAAM;4BACjD,CAAC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CACjD;oCACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;oCAC/E,+BAA+B,EAAE,gCAAgC;iCACpE,CAAC,CAAC,CAAC,CAAC,CAAC;qBACb;oBACD,iBAAiB,EAAE,CAAC;oBACpB,0CAA0C;oBAC1C,OAAO,iBAAiB,GAAG,gBAAgB,IAAI,iBAAiB,GAAG,YAAY;wBAC3E,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;wBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAC3C,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CAChD;4BACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAC/E,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CACT,CAAC;wBACF,iBAAiB,EAAE,CAAC;qBACvB;iBACJ;qBAAM;oBACH,iBAAiB,EAAE,CAAC;iBACvB;aACJ;iBAAM,IAAI,iBAAiB,KAAK,YAAY,EAAE;gBAC3C,gBAAgB;gBAChB,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACjD,oDAAoD;oBACpD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;qBAAM,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACxD,kCAAkC;oBAClC,IAAI,aAAa,GAAG,EAAE,CAAC,SAAS,CAAC;oBACjC,IAAI,SAAS,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;wBAC9C,4EAA4E;wBAC5E,2EAA2E;wBAC3E,gDAAgD;wBAChD,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE;4BAC5C,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;yBAC5C;wBACD,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,SAAS,CACjE;4BACI,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAChF,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CAAC,CAAC;qBACX;oBACD,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;wBAChB,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;qBACtB;oBACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC9B,iBAAiB,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,0CAA0C;oBACxF,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;qBAAM,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACxD,iCAAiC;oBACjC,6DAA6D;oBAC7D,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;aACJ;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,UAAU,CAAC,YAAY,EAAE,oBAAoB,EACzC,gBAAgB,EAAE,gCAAgC;QAClD,IAAI,MAAM,GAAG,gCAAgC,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,oBAAoB,EAC5G,gBAAgB,EAAE,gCAAgC,CAAC,CAAC;QAExD,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,YAAY,EAAE;gBACd,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,KAAK,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,CAAC;oBACpF,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,gBAAgB,EAC5E,gCAAgC,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAC1E,gCAAgC,CAAC,CAAC,CAAC;gBAE3C,OAAO,MAAM,CAAC;aACjB;iBAAM;gBACH,+CAA+C;gBAC/C,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;oBAChC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;oBACnB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;oBAC5B,2DAA2D;oBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;wBACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,EACxF,gCAAgC,CAAC,CAAC,CAAC;qBAC1C;iBACJ;gBACD,OAAO,MAAM,CAAC;aACjB;SACJ;aAAM,IAAI,YAAY,EAAE;YACrB,OAAO,gBAAgB,KAAK,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,CAAC;gBAC1E,QAAQ,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;SAC/E;aAAM;YACH,+CAA+C;YAC/C,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;gBAChC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;gBACnB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;oBACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9E;aACJ;YACD,OAAO,MAAM,CAAC;SACjB;IACL,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ;QACrC,QAAQ,CAAC,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,aAAa,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,MAAM,CAAC,CAAC;QACzF,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC/C;aAAM;YACH,IAAI,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC;YAChC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,SAAS,EAAE,KAAK,QAAQ,EAAE;gBAC/B,MAAM,GAAG,GAAG,CAAC;gBACb,MAAM,GAAG,GAAG,CAAC;aAChB;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;gBACjD,QAAQ,CAAC,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;aACnF;SACJ;QACD,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,MAAM,EAAE,QAAQ;QACjC,MAAM,IAAI,IAAI,CAAC;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;iBACjF,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC;SACtD;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO;QACH,IAAI,IAAI,GAAG;YACP,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE;YAChB,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE;YACxB,UAAU,EAAE,IAAI,CAAC,WAAW;YAC5B,KAAK,EAAE,EAAE;SACZ,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CACX,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CACnG,CAAC;aACL;SACJ;aAAM;YACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;SACjC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,iBAAiB;QAC3B,IAAI,iBAAiB,EAAE;YACnB,OAAO,IAAI,CAAC,OAAO,CAAC;SACvB;aAAM;YACH,OAAO,YAAY,CAAC,yBAAyB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SACxE;IACL,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,SAAS;QACtB,yFAAyF;QACzF,uFAAuF;QACvF,IAAI,CAAC,aAAa,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,OAAO,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;SACvC;IACL,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACf,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACf,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACH,kBAAkB,CAAC,QAAQ;QACvB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,QAAQ,EAAE,QAAQ;QACjC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,qBAAqB,CAAC,WAAW;QAC7B,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,WAAW,EAAE,QAAQ;QACvC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,WAAW,EAAE,SAAS;QACxC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,WAAW,EAAE,QAAQ;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACH,SAAS;QACL,IAAI,KAAK,GAAG,gCAAgC,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5E,IAAI,KAAK,KAAK,SAAS,EAAE;YACrB,OAAO,KAAK,CAAC;SAChB;aAAM;YACH,OAAO,IAAI,CAAC,MAAM,CAAC;SACtB;IACL,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACN,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC5B,CAAC;IACD,IAAI,MAAM,CAAC,GAAG;QACV,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAC1C,CAAC;CACJ;AA1lDD,sCA0lDC;AAED,aAAa,CAAC,SAAS,CAAC,eAAe,GAAG,EAAE,CAAC;AAC7C,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,OAAO,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Definition of the array property class\n */\nconst {\n    ArrayChangeSetIterator,\n    ChangeSet,\n    PathHelper,\n    TypeIdHelper,\n} = require('@fluid-experimental/property-changeset');\nconst { MSG } = require('@fluid-experimental/property-common').constants;\nconst { UniversalDataArray, ConsoleUtils } = require('@fluid-experimental/property-common');\nconst fastestJSONCopy = require('fastest-json-copy');\nconst _ = require('lodash');\nconst { deserializeNonPrimitiveArrayElements } = require('../containerSerializer');\nconst { validationsEnabled } = require('../enableValidations');\nconst { AbstractStaticCollectionProperty } = require('./abstractStaticCollectionProperty');\nconst { BaseProperty } = require('./baseProperty');\nconst { LazyLoadedProperties: Property } = require('./lazyLoadedProperties');\n\nconst deepCopy = fastestJSONCopy.copy;\n\nvar MODIFIED_STATE_FLAGS = BaseProperty.MODIFIED_STATE_FLAGS;\n\n// Some global constant objects that are used to indicate a few special\n// cases for the dirty object. If there are no entries in the pending and\n// dirty changesets, but the array still has a pending or dirty state\n// flag we use these objects to indicate this state. This happens for custom\n// type array, for which the children have been changed.\n// By using these special objects we avoid the memory overhead of having a separate\n// object for each array in this state.\nvar DIRTY_AND_PENDING_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.PENDING_CHANGE | MODIFIED_STATE_FLAGS.DIRTY,\n};\nvar PENDING_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.PENDING_CHANGE,\n};\nvar DIRTY_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.DIRTY,\n};\nvar DIRTY_STATE_FLAGS_ARRAY = [\n    undefined,\n    PENDING_CHILD_CHANGES,\n    DIRTY_CHILD_CHANGES,\n    DIRTY_AND_PENDING_CHILD_CHANGES,\n];\n\nvar PATH_TOKENS = BaseProperty.PATH_TOKENS;\n\n/**\n * Given a list of non-overlapping, unordered segments, each identified by its start point and length,\n * this function computes the longest monotone, increasing sub-sequence of segments.\n *\n * Currently, this is O(n^2) in the worst case, it could be implemented in O(n log n), but I would have\n * to implement a binary search tree for this. If this becomes a bottle-neck, we should replace\n * the insertions and binary searches below, with a search tree.\n *\n * @param {Array.<number>} in_segmentStarts  - The starting points of the segments\n * @param {Array.<number>} in_segmentLengths - The lengths of the segments\n *\n * @return {Array.<Number>} List of the selected segments, given as indices of the segments\n * @private\n */\nvar _getLongestIncreasingSubsequenceSegments = function(in_segmentStarts, in_segmentLengths) {\n    if (in_segmentStarts.length === 0) {\n        return [];\n    }\n\n    // Contains the already found sub sequences, sorted by their length\n    // in increasing order. These sub-sequences have the invariant that\n    // the last entry in each of the sequences is smaller than the last\n    // entry in longer sequences (so the list is also sorted according to\n    // the sequenceLastEntry member of the structs)\n    var foundSubSequences = [];\n\n    for (var i = 0; i < in_segmentStarts.length; i++) {\n        var currentSegmentStart = in_segmentStarts[i];\n\n        // Perform a binary search to find the largest entry in the list of found sub\n        // sequences that has a sequenceEnd that is smaller or equal than currentSegmentStart\n        var index = _.sortedIndexBy(foundSubSequences, { sequenceLastEntry: currentSegmentStart }, 'sequenceLastEntry');\n        var lastEntry = index > 0 ? foundSubSequences[index - 1] : undefined;\n\n        // Create a new entry that is obtained by concatenating the longest sequence found so far\n        // with the new segment\n        var newEntry = {\n            sequenceLength: in_segmentLengths[i] + (lastEntry ? lastEntry.sequenceLength : 0),\n            segmentIndex: i,\n            sequenceLastEntry: currentSegmentStart + in_segmentLengths[i] - 1,\n            previousEntry: lastEntry,\n        };\n\n        // Search for the insertion position for this entry\n        var insertionPoint = _.sortedIndexBy(foundSubSequences, newEntry, 'sequenceLength');\n        if (foundSubSequences[insertionPoint] !== undefined &&\n            foundSubSequences[insertionPoint].sequenceLength === newEntry.sequenceLength) {\n            insertionPoint++;\n        }\n\n        // We have to delete all entries from the foundSubSequences array, which\n        // are shorter, but have a higher sequenceLastEntry (we can do that, since\n        // it would be a better choice to use the new entry instead of these old\n        // entries). This will preserve the invariant on the foundSubSequences\n        // that they are sorted with respect to the sequenceLastEntry.\n        var lowerLengthBoundary = newEntry.sequenceLength - in_segmentLengths[i];\n\n        var j = insertionPoint - 1;\n        for (; j >= 0 && foundSubSequences[j].sequenceLength > lowerLengthBoundary; j--) {\n            if (foundSubSequences[j].sequenceLastEntry >= newEntry.sequenceLastEntry) {\n                foundSubSequences.splice(j, 1);\n                insertionPoint--;\n            }\n        }\n\n        // Insert the entry as a new entry into the list of subsequences\n        foundSubSequences.splice(insertionPoint, 0, newEntry); // TODO: this should be done via a binary tree\n    }\n\n    // This should always be the case, as we checked for empty inputs above\n    ConsoleUtils.assert(foundSubSequences.length > 0);\n\n    // Extract the result\n    var longestSequence = [];\n    var currentSegment = _.last(foundSubSequences);\n    while (currentSegment) {\n        longestSequence.unshift(currentSegment.segmentIndex);\n        currentSegment = currentSegment.previousEntry;\n    }\n\n    return longestSequence;\n};\n\nexport class ArrayProperty extends AbstractStaticCollectionProperty {\n    /**\n     * Default constructor for ArrayProperty\n     * @param {Object} [in_params] - the parameters\n     * @param {Number} [in_params.length = 0] the length of the array, if applicable\n     * @param {string} [in_scope] - The scope in which the property typeid is defined\n     * @protected\n     */\n    constructor(in_params, in_scope) {\n        super(in_params);\n        var length = in_params.size || in_params.length || 0;\n\n        // changesets\n        this._dirty = undefined;\n\n        // We only need the scope for custom type array properties\n        if (!this._isPrimitive) {\n            this._scope = in_scope;\n        }\n\n        this._dataArrayCreate(length);\n    }\n\n    /**\n     * Returns the path segment for a child\n     *\n     * @param {property-properties.BaseProperty} in_childNode - The child for which the path is returned\n     *\n     * @return {string|undefined} The path segment to resolve the child property under this property\n     * @protected\n     */\n    _getPathSegmentForChildNode(in_childNode) {\n        var index = this._dataArrayGetBuffer().indexOf(in_childNode);\n        if (index === -1) {\n            throw new Error(MSG.GET_PATH_SEGMENT_CALLED_FOR_NON_ENTRY);\n        }\n\n        return '[' + index + ']';\n    }\n\n    /**\n     * Resolves a direct child node based on the given path segment\n     *\n     * @param {String} in_segment                                   - The path segment to resolve\n     * @param {property-properties.PathHelper.TOKEN_TYPES} in_segmentType - The type of segment in the tokenized path\n     *\n     * @return {property-properties.BaseProperty|undefined} The child property that has been resolved\n     * @protected\n     */\n    _resolvePathSegment(in_segment, in_segmentType) {\n        // Base Properties only support paths separated via dots\n        if (in_segmentType === PathHelper.TOKEN_TYPES.ARRAY_TOKEN) {\n            var index = Math.floor(in_segment);\n\n            // Specifying a non-integer index is regarded a mal-formed path and thus throws an exception\n            if (!isFinite(index)) {\n                // eslint-disable-next-line unicorn/prefer-type-error\n                throw new Error(MSG.INVALID_NON_NUMERIC_SEGMENT_IN_PATH + in_segment);\n            }\n\n            // Accessing an entry outside of the array is just a non existing property and thus\n            // returns undefined\n            if (index < 0 || index >= this._dataArrayGetLength()) {\n                return undefined;\n            }\n            return this._dataArrayGetValue(index);\n        } else {\n            return AbstractStaticCollectionProperty.prototype._resolvePathSegment.call(this, in_segment, in_segmentType);\n        }\n    }\n\n    /**\n     * Insert into the array at a given position.\n     * It will not overwrite the existing values, it will push them to the right.\n     * @param {number} in_position target index\n     * @param {*} in_value inserted value or property\n     * @throws if in_position is smaller than zero, larger than the length of the array or not a number.\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to modify a referenced property.\n     * @throws if trying to insert a property that is a root property\n     */\n    insert(in_position, in_value) {\n        this.insertRange(in_position, [in_value]);\n    }\n\n    /**\n     * Is this property a leaf node with regard to flattening?\n     *\n     * TODO: Which semantics should flattening have? It stops at primitive types and collections?\n     *\n     * @return {boolean} True if it is a leaf with regard to flattening?\n     */\n    _isFlattenLeaf() {\n        return true;\n    }\n\n    /**\n     * Add one or more values at the end of the array\n     * @param {Array<property-properties.BaseProperty>|property-properties.BaseProperty|*|Array<*>} in_values\n     * the item or items to be pushed (either properties or values). If an array is passed, .push\n     *  will be called on each item in the array.\n     * @throws if trying to push a property that is a root property\n     * @return {number} new length of the array\n     */\n    push(in_values) {\n        if (_.isArray(in_values)) {\n            this.insertRange(this._dataArrayGetLength(), in_values);\n        } else {\n            this.insertRange(this._dataArrayGetLength(), [in_values]);\n        }\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * Add elements to the end of the queue (array)\n     */\n    enqueue(...args) {\n        return this.push(...args);\n    }\n\n    /**\n     * Add a value at the front of the array or letters to the beginning of a string (for StringProperty)\n     * It can also add multiple values to an array if you pass in an array of values.\n     * @param {Array<*>|*|Array<property-properties.BaseProperty>|property-properties.BaseProperty} in_values the values\n     * or properties to be pushed\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to insert a root property\n     * @throws if trying to modify a referenced property.\n     * @return {number} new length of the array\n     */\n    unshift(in_values) {\n        if (_.isArray(in_values)) {\n            this.insertRange(0, in_values);\n        } else {\n            this.insertRange(0, [in_values]);\n        }\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * Removes an element of the array (or a letter in a StringProperty) and shifts remaining elements to the left\n     * E.g. [1, 2, 3]   .remove(1) => [1, 3]\n     * E.g. (StringProperty) 'ABCDE'  .remove(1) => 'ACDE'\n     * @param {number} in_position the index that will be removed\n     * @throws if in_position is not a number\n     * @throws if trying to remove something that does not exist\n     * @throws if trying to remove an item with a parent\n     * @return {property-properties.BaseProperty | * } the value that was removed.\n     */\n    remove(in_position) {\n        var value = this.get(in_position);\n        this.removeRange(in_position, 1);\n        return value;\n    }\n\n    /**\n     * Removes the last element of the array or the last letter of a string (for StringProperty)\n     * @throws if trying to modify a referenced property\n     * @return {property-properties.BaseProperty|*} deleted element.\n     */\n    pop() {\n        if (this._dataArrayGetLength() > 0) {\n            var item = this.get(this._dataArrayGetLength() - 1,\n                { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n            this.remove(this._dataArrayGetLength() - 1);\n            return item;\n        } else {\n            return undefined;\n        }\n    }\n\n    /**\n     * Removes an element from the front of the array or a letter from the beginning of a string (for StringProperty)\n     * @return {*|property-properties.BaseProperty} the element removed.\n     */\n    shift() {\n        if (this._dataArrayGetLength() > 0) {\n            var item = this.get(0, { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n            this.remove(0);\n            return item;\n        } else {\n            return undefined;\n        }\n    }\n\n    /**\n     * Removes elements from the front of the queue (array)\n     */\n    dequeue() {\n        return this.shift();\n    }\n\n    /**\n     * Change an existing element of the array. This will overwrite an existing element.\n     * E.g. [1, 2, 3]  .set(1, 8) => [1, 8, 3]\n     * @param {number} in_position the target index\n     * @param {*} in_value the new property or value\n     * @throws if in_position is not a number\n     * @throws if in_position is smaller than zero\n     */\n    set(in_position, in_value) {\n        if (_.isArray(in_value)) {\n            throw new TypeError(MSG.ARRAY_SET_ONE_ELEMENT + in_value);\n        }\n        this.setRange(in_position, [in_value]);\n    }\n\n    /**\n     * Sets the values of items in the array.\n     * If values are typed, iterates through the values and creates a property with the defined type and value.\n     * @see {setValues}\n     * @param {Array<*>} in_values  - The list of typed values.\n     * @param {Bool} in_typed  - Whether the values are typed/polymorphic.\n     * @param {Bool} in_initial  - Whether we are setting default/initial values\n     *   or if the function is called directly with the values to set.\n     * @protected\n     * @override\n     */\n    _setValues(in_values, in_typed, in_initial) {\n        if (in_typed) {\n            if (!this._isPrimitive) {\n                ConsoleUtils.assert(_.isArray(in_values), MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty._setValues');\n\n                var arr = [];\n                for (var i = 0; i < in_values.length; i++) {\n                    var prop = in_values[i];\n\n                    if (in_values[i] instanceof BaseProperty) {\n                        prop = in_values[i];\n                    } else {\n                        prop = Property.PropertyFactory._createProperty(\n                            in_values[i].typeid || this._typeid, null, in_values[i].value, this._getScope());\n                    }\n                    arr.push(prop);\n                }\n\n                this._setValuesInternal(arr);\n            } else {\n                AbstractStaticCollectionProperty.prototype._setValues.call(this, in_values, in_typed, in_initial);\n            }\n        } else {\n            this._setValuesInternal(in_values);\n        }\n    }\n\n    /**\n     * @param {Array<*>|Object} in_values an array or object containing the values to be set.\n     * @see {setValues}\n     */\n    _setValuesInternal(in_values) {\n        this._checkIsNotReadOnly(true);\n\n        if (!this._isPrimitive) {\n            if (_.isArray(in_values)) {\n                this.clear();\n                this.insertRange(0, in_values);\n            } else {\n                AbstractStaticCollectionProperty.prototype.setValues.call(this, in_values);\n            }\n        } else {\n            if (_.isArray(in_values) && in_values.length < this._dataArrayGetLength()) {\n                this.removeRange(in_values.length, this._dataArrayGetLength() - in_values.length);\n            }\n\n            var that = this;\n            var maxIndex = this._dataArrayGetLength() - 1;\n            _.each(in_values, function(value, index) {\n                if (index > maxIndex) {\n                    that.insert(index, value);\n                } else {\n                    if (that._dataArrayGetValue(index) !== value) {\n                        that.set(index, value);\n                    }\n                }\n            });\n        }\n    }\n\n    /**\n     * Sets the values of items in the array.\n     * If called using an array (e.g. setValues([prop1, prop2])), it will overwrite the whole array.\n     * If called using an object with indexes (e.g. setValues{0: prop1}), it will only overwrite the\n     * items at those indexes.\n     * For arrays of Properties, this can be used to set nested values in properties found in the array.\n     * For example: setValues({0: {position: {x: 2, y:3}}});\n     * @param {Array<*>|Object} in_values an array or object containing the values to be set.\n     * @throws if one of the path in in_values does not correspond to a path in the property\n     */\n    setValues(in_values) {\n        var checkoutView = this._getCheckoutView();\n        if (checkoutView !== undefined) {\n            checkoutView.pushNotificationDelayScope();\n            ArrayProperty.prototype._setValues.call(this, in_values, false, false);\n            checkoutView.popNotificationDelayScope();\n        } else {\n            ArrayProperty.prototype._setValues.call(this, in_values, false, false);\n        }\n    }\n\n    /**\n     * Deletes all values from an array\n     */\n    clear() {\n        if (this.getLength()) {\n            this.removeRange(0, this.getLength());\n        }\n    }\n\n    /**\n     * @return {Array<*> | String} all values in the ArrayProperty\n     * If called on StringProperty, it returns the whole string\n     * WARNING: the returned array must be read only, data written to it\n     * will get lost.\n     */\n    getEntriesReadOnly() {\n        return this._dataArrayGetBuffer();\n    }\n\n    /**\n     * Private helper function to update the internal dirty and pending changes\n     * is overwritten by StringProperty\n     *\n     * @param {property-properties.SerializedChangeSet} in_changeSet - The changeset to apply\n     * @private\n     */\n    _updateChanges(in_changeSet) {\n        var pendingChanges = this._getPendingChanges();\n        ChangeSet.prototype._performApplyAfterOnPropertyArray(pendingChanges,\n            in_changeSet, this.getFullTypeid(true));\n\n        var dirtyChanges = this._getDirtyChanges();\n        ChangeSet.prototype._performApplyAfterOnPropertyArray(dirtyChanges,\n            in_changeSet, this.getFullTypeid(true));\n\n        this._setChanges(pendingChanges, dirtyChanges);\n    }\n\n    /**\n     * Returns the pending changeset for this object\n     * @return {property-properties.SerializedChangeSet} The pending changes\n     */\n    _getPendingChanges() {\n        return (this._dirty && this._dirty.pending) || {};\n    }\n\n    /**\n     * Returns the dirty changeset for this object\n     * @return {property-properties.SerializedChangeSet} The dirty changes\n     */\n    _getDirtyChanges() {\n        return (this._dirty && this._dirty.dirty) || {};\n    }\n\n    /**\n     * Sets the pending and dirty changesets\n     *\n     * @param {property-properties.SerializedChangeSet|undefined|null} in_pending\n     *     The pending changeset. If null is passed, no change will be\n     *     applied. undefined indicates that the changes should be reset\n     * @param {property-properties.SerializedChangeSet|undefined|null} in_dirty\n     *     The dirty changeset. If null is passed, no change will be\n     *     applied. undefined indicates that the changes should be reset\n     */\n    _setChanges(in_pending, in_dirty) {\n        var oldFlags = this._dirty ? this._dirty.flags : 0;\n\n        if (this._dirty &&\n            this._dirty === DIRTY_STATE_FLAGS_ARRAY[this._dirty.flags]) {\n            this._dirty = undefined;\n        }\n\n        if (in_pending !== null) {\n            if (!_.isEmpty(in_pending)) {\n                this._dirty = this._dirty || {};\n                this._dirty.pending = in_pending;\n            } else if (this._dirty) {\n                this._dirty.pending = undefined;\n            }\n        }\n\n        if (in_dirty !== null) {\n            if (!_.isEmpty(in_dirty)) {\n                this._dirty = this._dirty || {};\n                this._dirty.dirty = in_dirty;\n            } else if (this._dirty) {\n                this._dirty.dirty = undefined;\n            }\n        }\n\n        if (this._dirty) {\n            if (this._dirty.dirty === undefined &&\n                this._dirty.pending === undefined) {\n                if (oldFlags === 0) {\n                    this._dirty = undefined;\n                } else {\n                    this._dirty = DIRTY_STATE_FLAGS_ARRAY[oldFlags];\n                }\n            } else {\n                this._dirty.flags = oldFlags;\n            }\n        } else if (oldFlags) {\n            this._dirty = DIRTY_STATE_FLAGS_ARRAY[oldFlags];\n        }\n    }\n\n    /**\n     * Sets the dirty flags for this property\n     * @param {Number} in_flags The dirty flags\n     */\n    _setDirtyFlags(in_flags) {\n        if (this._dirty) {\n            if (this._dirty !== DIRTY_STATE_FLAGS_ARRAY[this._dirty.flags]) {\n                this._dirty.flags = in_flags;\n\n                if (this._dirty.dirty === undefined &&\n                    this._dirty.pending === undefined &&\n                    (this._dirty.flags === 0 || this._dirty.flags === undefined)) {\n                    this._dirty = undefined;\n                }\n            } else {\n                this._dirty = DIRTY_STATE_FLAGS_ARRAY[in_flags];\n            }\n        } else {\n            this._dirty = DIRTY_STATE_FLAGS_ARRAY[in_flags];\n        }\n    }\n\n    /**\n     * Gets the dirty flags for this property\n     * @return {Number} The dirty flags\n     */\n    _getDirtyFlags() {\n        if (this._dirty === undefined) {\n            return 0;\n        }\n\n        return this._dirty.flags;\n    }\n\n    /**\n     * Inserts the content of a given array into the array property\n     * It will not overwrite the existing values but push them to the right instead.\n     * E.g. [1, 2, 3] .insertRange(1, [9, 8]) => [1, 9, 8, 2, 3]\n     * @param {number} in_offset target index\n     * @param {Array<*>} in_array the array to be inserted\n     * @throws if in_offset is smaller than zero, larger than the length of the array or not a number.\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to modify a referenced property.\n     * @throws if trying to insert a property that is not an array.\n     * @throws if trying to insert a root property.\n     */\n    insertRange(in_offset, in_array) {\n        if (!_.isArray(in_array)) {\n            throw new TypeError(MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty.insertRange');\n        }\n\n        if (validationsEnabled.enabled) {\n            for (var i = 0; i < in_array.length; i++) {\n                if (in_array[i] instanceof BaseProperty) {\n                    in_array[i]._validateInsertIn(this);\n                }\n            }\n            this._checkIsNotReadOnly(true);\n        }\n        this._insertRangeWithoutDirtying(in_offset, in_array);\n        this._setDirty();\n    }\n\n    /**\n     * inserts the content of a given array, but doesn't dirty the property\n     * this is useful for batch changes\n     * @param {number} in_offset target index\n     * @param {Array<*>} in_array the array to be inserted\n     * @param {Boolean=} [in_setParents=true] If true, set parent of inserted properties.\n     *                   If false, caller has already set parents.\n     * @private\n     */\n    _insertRangeWithoutDirtying(in_offset, in_array, in_setParents) {\n        if (in_setParents === undefined) {\n            in_setParents = true;\n        }\n        if (in_offset < 0 || in_offset > this.length || !_.isNumber(in_offset)) {\n            throw Error(MSG.START_OFFSET_INVALID + in_offset);\n        }\n        if (in_setParents && !this._isPrimitive) {\n            var arr = [];\n            for (var i = 0; i < in_array.length; ++i) {\n                var prop = in_array[i];\n                if (!(in_array[i] instanceof BaseProperty)) {\n                    prop = Property.PropertyFactory._createProperty(this._typeid, null, in_array[i], this._getScope());\n                }\n\n                if (prop.getParent()) {\n                    throw new Error(MSG.NO_INSERT_WITH_PARENT);\n                } else {\n                    prop._setParent(this);\n                }\n                arr.push(prop);\n            }\n\n            in_array = arr;\n        }\n        this._dataArrayInsertRange(in_offset, in_array);\n\n        // Insert entry into changesets\n        var changeSet = {\n            'insert': [[in_offset, this._serializeArray(in_array)]],\n        };\n        this._updateChanges(changeSet);\n    }\n\n    /**\n     * Removes a given number of elements from the array property (or given number of letters from a StringProperty)\n     *  and shifts remaining values to the left.\n     * E.g. [1, 2, 3, 4, 5]  .removeRange(1, 3) => [1, 5]\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @throws if in_offset is not a number\n     * @throws if in_deleteCount is not a number\n     * @throws if trying to remove an item with a parent\n     * @throws if in_offset is smaller than zero or if in_offset + in_delete count is larger than the length of the array\n     * @return {Array<*>| Array<property-properties.BaseProperty>} an array containing the values or\n     *  properties removed.\n     */\n    removeRange(in_offset, in_deleteCount) {\n        ConsoleUtils.assert(_.isNumber(in_offset), MSG.NOT_NUMBER +\n            'in_offset, method: ArrayProperty.removeRange or .remove');\n        ConsoleUtils.assert(_.isNumber(in_deleteCount),\n            MSG.NOT_NUMBER + 'in_deleteCount, method: ArrayProperty.removeRange or .remove');\n        ConsoleUtils.assert(in_offset + in_deleteCount < this.length + 1 && in_offset >= 0 && in_deleteCount > 0,\n            MSG.REMOVE_OUT_OF_BOUNDS + 'Cannot remove ' + in_deleteCount + ' items starting at index ' + in_offset);\n        var result = [];\n        for (var i = in_offset; i < in_offset + in_deleteCount; i++) {\n            result.push(this.get(i));\n        }\n        this._checkIsNotReadOnly(true);\n        this._removeRangeWithoutDirtying(in_offset, in_deleteCount);\n        this._setDirty();\n        return result;\n    }\n\n    /**\n     * removes a given number of elements from the array property, and ensures, if this is not\n     * a primitive array, that any existing properties have their parent pointer cleared.\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @private\n     */\n    _clearRange(in_offset, in_deleteCount) {\n        if (!this._isPrimitive) {\n            for (var i = 0; i < in_deleteCount; ++i) {\n                if (this._dataArrayGetValue(in_offset + i).getParent() !== this) {\n                    throw new Error(MSG.CANNOT_REMOVE_WITH_DIFFERENT_PARENT);\n                } else {\n                    this._dataArrayGetValue(in_offset + i)._setParent(undefined);\n                }\n            }\n        }\n\n        this._dataArrayRemoveRange(in_offset, in_deleteCount);\n    }\n\n    /**\n     * removes a given number of elements from the array property, but doesn't dirty the property\n     * this is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @private\n     */\n    _removeRangeWithoutDirtying(in_offset, in_deleteCount) {\n        this._clearRange(in_offset, in_deleteCount);\n\n        // Insert entry into changesets\n        var changeSet = {\n            'remove': [[in_offset, in_deleteCount]],\n        };\n        this._updateChanges(changeSet);\n    }\n\n    /**\n     * Sets the array properties elements to the content of the given array\n     * All changed elements must already exist. This will overwrite existing elements.\n     * E.g. [1, 2, 3, 4, 5]  .setRange(1, [7, 8]) => [1, 7, 8, 4, 5]\n     * @param {number} in_offset target start index\n     * @param {Array<*>|Array<property-properties.BaseProperty>} in_array contains the elements to be set\n     * @throws if in_offset is not a number\n     * @throws if in_offset is smaller than zero or higher than the length of the array\n     */\n    setRange(in_offset, in_array) {\n        if (!_.isArray(in_array) && !_.isString(in_array)) {\n            throw new TypeError(MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty.setRange');\n        }\n        in_offset = Math.floor(in_offset);\n        if (!isFinite(in_offset)) {\n            // eslint-disable-next-line unicorn/prefer-type-error\n            throw new Error(MSG.NOT_NUMBER + 'in_offset, method: ArrayProperty.setRange or .set');\n        }\n        ConsoleUtils.assert(in_offset >= -1 && (in_offset + in_array.length) <= this.getLength(),\n            MSG.SET_OUT_OF_BOUNDS + 'Cannot set ' + in_array.length + ' items starting at index ' + in_offset +\n            '. Array length: ' + this.getLength());\n        this._checkIsNotReadOnly(true);\n        this._setRangeWithoutDirtying(in_offset, in_array);\n        this._setDirty();\n    }\n\n    /**\n     * sets the array properties elements to the content of the given array\n     * all changed elements must already exist. This version doesn't dirty the property,\n     * which is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {Array<*>} in_array contains the elements to be set\n     */\n    _setRangeWithoutDirtying(in_offset, in_array) {\n        this._modifyRangeWithoutDirtying(in_offset, in_array);\n    }\n\n    /**\n     * sets the array properties elements to the content of the given array\n     * all changed elements must already exist. This version doesn't dirty the property,\n     * which is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {Array<*>} in_array contains the elements to be set\n     */\n    _modifyRangeWithoutDirtying(in_offset, in_array) {\n        // Has to be overloaded for arrays of properties!\n        if (in_offset < 0) {\n            throw Error(MSG.START_OFFSET_NEGATIVE + in_offset);\n        }\n        var changeSet = {};\n        var changeArray = [];\n\n        if (!this._isPrimitive) {\n            // for custom array properties, we have to do a remove/insert instead:\n            this._removeRangeWithoutDirtying(in_offset, in_array.length);\n            this._insertRangeWithoutDirtying(in_offset, in_array);\n        } else {\n            // does the reference array property not have a _dataArrayRef ??\n            // go through all the elements of in_array to check if the content of the given array\n            // is same as value of the array properties. If the values are same, we don't change it.\n            // Otherwise, we set them and generate corresponding changeset.\n            var j;\n            for (var i = 0; i < in_array.length; i++) {\n                if (this._dataArrayGetValue(in_offset + i) !== in_array[i]) {\n                    for (j = i + 1; j < in_array.length; j++) {\n                        if (this._dataArrayGetValue(in_offset + j) === in_array[j]) {\n                            break;\n                        }\n                    }\n                    this._dataArraySetRange(in_offset + i, in_array.slice(i, j));\n                    changeArray.push([in_offset + i, this._serializeArray(in_array.slice(i, j))]);\n                    i = j;\n                }\n            }\n            changeSet['modify'] = changeArray;\n            this._updateChanges(changeSet);\n        }\n    }\n\n    /**\n     * Returns the name of all the sub-properties of this property.\n     * Numerical indexes from the array will be returned as strings.\n     * E.g. ['0', '1', '2']\n     *\n     * @return {Array.<string>} An array of all the property ids\n     */\n    getIds() {\n        return Object.keys(this._dataArrayGetBuffer());\n    }\n\n    /**\n     * Checks whether a property or data exists at the given position.\n     *\n     * @param {string} in_position - index of the property\n     * @return {boolean} True if the property or data exists. Otherwise false.\n     */\n    has(in_position) {\n        return this._dataArrayGetBuffer()[in_position] !== undefined;\n    }\n\n    /**\n     * Gets the array element at a given index\n     * @param {number | array<string|number>} in_position the target index\n     * if an array is passed, elements in the array will be treated as part of a path.\n     * The first item in an array should be a position in the array.\n     * For example, .get([0,'position','x']) is the equivalent of .get(0).get('position').get('x')\n     * If it encounters a ReferenceProperty, .get will, by default, resolve the property it refers to.\n     * @param {Object} in_options - parameter object\n     * @param {property-properties.BaseProperty.REFERENCE_RESOLUTION} [in_options.referenceResolutionMode=ALWAYS]\n     *     How should this function behave during reference resolution?\n     * @throws if in_position is an array and the first item in the array is not a number\n     * @throws if in_position is neither an array nor a number.\n     * @throws if in_position is smaller than zero or larger than the length of the array.\n     * @return {* | property-properties.BaseProperty | undefined} the element at that index - either a property or a value.\n     * or undefined if nothing was found.\n     */\n    get(in_position, in_options) {\n        in_options = in_options || {};\n        in_options.referenceResolutionMode =\n            in_options.referenceResolutionMode === undefined ? BaseProperty.REFERENCE_RESOLUTION.ALWAYS :\n                in_options.referenceResolutionMode;\n        var prop = this;\n        if (_.isArray(in_position)) {\n            var iterationStart = 0;\n            var prop = this;\n            if (in_position[0] === PATH_TOKENS.UP) {\n                prop = prop.getParent();\n                iterationStart = 1;\n            } else if (in_position[0] === PATH_TOKENS.ROOT) {\n                prop = prop.getRoot();\n                iterationStart = 1;\n            } else {\n                var pos = Math.floor(in_position[0]);\n                ConsoleUtils.assert(isFinite(pos), MSG.FIRST_ITEM_MUST_BE_NUMBER);\n                var mode = in_options.referenceResolutionMode;\n                ConsoleUtils.assert(pos >= 0 && pos < this.getLength(),\n                    MSG.GET_OUT_OF_RANGE + in_position[0]);\n            }\n            for (var i = iterationStart; i < in_position.length && prop; i++) {\n                if (in_options.referenceResolutionMode === BaseProperty.REFERENCE_RESOLUTION.NO_LEAFS) {\n                    mode = i !== in_position.length - 1 ? BaseProperty.REFERENCE_RESOLUTION.ALWAYS :\n                        BaseProperty.REFERENCE_RESOLUTION.NEVER;\n                }\n                if (in_position[i + 1] === PATH_TOKENS.REF) {\n                    mode = BaseProperty.REFERENCE_RESOLUTION.NEVER;\n                }\n                prop = prop.get(in_position[i], { referenceResolutionMode: mode });\n                if (prop === undefined && i < in_position.length - 1) {\n                    return undefined;\n                }\n            }\n            return prop;\n        }\n\n        if (in_position === PATH_TOKENS.ROOT) {\n            return prop.getRoot();\n        } else if (in_position === PATH_TOKENS.UP) {\n            return prop.getParent();\n        } else if (in_position === PATH_TOKENS.REF) {\n            throw new Error(MSG.NO_GET_DEREFERENCE_ONLY);\n        } else {\n            var pos = Math.floor(in_position);\n            ConsoleUtils.assert(isFinite(pos), MSG.IN_POSITION_MUST_BE_NUMBER);\n            var result = this._dataArrayGetValue(pos);\n            if (in_options.referenceResolutionMode === BaseProperty.REFERENCE_RESOLUTION.ALWAYS) {\n                if (result instanceof Property.ReferenceProperty) {\n                    result = result.ref;\n                }\n            }\n            return result;\n        }\n    }\n\n    /**\n     * Returns an object with all the nested values contained in this property\n     * @return {array<object> | array<*>} an array of objects or values representing the values of your property\n     * for example: [\n     * {\n     *   position: {\n     *    x: 2,\n     *    y: 5\n     *   }\n     * },\n     * {\n     *   position: {\n     *    x: 1,\n     *    y: -8\n     *  }\n     * }]\n     * or for a Value Array: [1, 3, 6]\n     */\n    getValues() {\n        var result = [];\n        var ids = this.getIds();\n        for (var i = 0; i < ids.length; i++) {\n            var child = this.get(ids[i]);\n            result.push(child.getValues());\n        }\n        return result;\n    }\n\n    /**\n     * @return {Number} the current length of the array\n     */\n    getLength() {\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _applyChangeset(in_changeSet, in_reportToView) {\n        this._checkIsNotReadOnly(false);\n\n        // Iterator to process the changes in the ChangeSet in the correct order\n        var arrayIterator = new ArrayChangeSetIterator(in_changeSet);\n\n        if (!this._isPrimitive) {\n            // Successively apply the changes from the changeSet\n            while (!arrayIterator.atEnd()) {\n                switch (arrayIterator.opDescription.type) {\n                    case ArrayChangeSetIterator.types.INSERT:\n                        // Handle inserts\n                        var propertyDescriptions = arrayIterator.opDescription.operation[1];\n                        var insertedPropertyInstances = [];\n                        var scope = this._getScope();\n                        for (var i = 0; i < propertyDescriptions.length; ++i) {\n                            var createdProperty = Property.PropertyFactory._createProperty(\n                                propertyDescriptions[i]['typeid'], null, undefined, scope);\n                            // Set parent so scope is defined for deserialization\n                            createdProperty._setParent(this);\n                            createdProperty._deserialize(propertyDescriptions[i], false);\n                            insertedPropertyInstances.push(createdProperty);\n                        }\n                        this._insertRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(insertedPropertyInstances), false);\n                        break;\n                    case ArrayChangeSetIterator.types.REMOVE:\n                        // Handle removes\n                        var numRemoved = arrayIterator.opDescription.operation[1];\n                        if (!_.isNumber(numRemoved)) {\n                            numRemoved = numRemoved.length;\n                        }\n                        this._removeRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset, numRemoved);\n                        break;\n                    case ArrayChangeSetIterator.types.MODIFY:\n                        // Handle modifies\n                        var propertyDescriptions = arrayIterator.opDescription.operation[1];\n                        var startIndex = arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset;\n                        for (var i = 0; i < propertyDescriptions.length; ++i) {\n                            var modifiedProperty = this.get(startIndex + i,\n                                { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n                            if (!modifiedProperty) {\n                                throw new Error(MSG.INDEX_INVALID + (startIndex + i));\n                            }\n                            modifiedProperty._applyChangeset(propertyDescriptions[i], false);\n                        }\n                        break;\n                    default:\n                        console.error('applyChangeset: ' + MSG.UNKNOWN_OPERATION + arrayIterator.opDescription.type);\n                }\n                arrayIterator.next();\n            }\n        } else {\n            // Successively apply the changes from the changeSet\n            while (!arrayIterator.atEnd()) {\n                switch (arrayIterator.opDescription.type) {\n                    case ArrayChangeSetIterator.types.INSERT:\n                        // Handle inserts\n                        this._insertRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(arrayIterator.opDescription.operation[1]));\n                        break;\n                    case ArrayChangeSetIterator.types.REMOVE:\n                        // Handle removes\n                        var removeLength = arrayIterator.opDescription.operation[1];\n                        if (_.isArray(removeLength) || _.isString(removeLength)) {\n                            removeLength = removeLength.length;\n                        }\n\n                        this._removeRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset, removeLength);\n                        break;\n                    case ArrayChangeSetIterator.types.MODIFY:\n                        // Handle modifies\n                        this._modifyRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(arrayIterator.opDescription.operation[1]));\n                        break;\n                    default:\n                        console.error('applyChangeset: ' + MSG.UNKNOWN_OPERATION + arrayIterator.opDescription.type);\n                }\n                arrayIterator.next();\n            }\n        }\n\n        // Finally mark the property as dirty (we postponed this in the previous operations to prevent multiple triggering\n        // of dirtying events)\n        this._setDirty(in_reportToView);\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _reapplyDirtyFlags(in_pendingChangeSet, in_dirtyChangeSet) {\n        this._checkIsNotReadOnly(false);\n\n        this._setChanges(in_pendingChangeSet, in_dirtyChangeSet);\n        // Finally mark the property as dirty (we postponed this in the previous operations to prevent multiple triggering\n        // of dirtying events)\n        this._setDirty(false);\n    }\n\n    /**\n     * Removes the dirtiness flag from this property\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_flags] - The flags to clean, if none are supplied all\n     *                                                                       will be removed\n     * @private\n     */\n    _cleanDirty(in_flags) {\n        // Invoke parent - cleans own dirty flag\n        BaseProperty.prototype._cleanDirty.call(this, in_flags);\n\n        // null means no change, undefined means reset the changes\n        var pendingChanges = null,\n            dirtyChanges = null;\n\n        if (in_flags === undefined ||\n            (in_flags & BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE) !== 0) {\n            pendingChanges = undefined;\n        }\n        if (in_flags === undefined ||\n            (in_flags & BaseProperty.MODIFIED_STATE_FLAGS.DIRTY) !== 0) {\n            dirtyChanges = undefined;\n        }\n\n        this._setChanges(pendingChanges, dirtyChanges);\n    }\n\n    /**\n     * Removes the dirtiness flag from this property and recursively from all of its children\n     *\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_dirtinessType] - The flags to clean,\n     * if none are supplied all will be removed\n     */\n    cleanDirty(in_dirtinessType) {\n        if (!this._isPrimitive) {\n            for (var i = 0; i < this._dataArrayGetLength(); ++i) {\n                this._dataArrayGetValue(i).cleanDirty(in_dirtinessType);\n            }\n        }\n        // after all paths are clean, we are also clean!\n        this._cleanDirty(in_dirtinessType);\n    }\n\n    /**\n     * Internal helper function that implements the deserialize algorithm for an array of named properties.\n     *\n     * @param {property-properties.SerializedChangeSet} in_serializedObj - The serialized changeset to apply. This\n     *     has to be a normalized change-set (only containing inserts. Removes and Modifies are forbidden).\n     * @param {boolean} [in_reportToView = true] - By default, the dirtying will always be reported to the checkout view\n     *                                             and trigger a modified event there. When batching updates, this\n     *                                             can be prevented via this flag.\n     * @return {property-properties.SerializedChangeSet} ChangeSet with the changes that actually were performed during the\n     *     deserialization\n     */\n    _deserializeNamedPropertyArray(in_serializedObj, in_reportToView) {\n        if (!_.isArray(in_serializedObj.insert[0][1])) {\n            throw new TypeError(MSG.INVALID_CHANGESET);\n        }\n\n        // When the array contains named properties, we can use an efficient diffing algorithm, which\n        // takes advantage of the ability to identify entries in an unique way\n        var targetArray = in_serializedObj.insert[0][1];\n\n        // The algorithm below finds the mapping between the two given arrays which requires the smallest number of\n        // inserted and removed entries. These operations are determined via the following strategy:\n        // 1) We search for all consecutive segments in the input data, which map to a consecutive segments in the\n        //    target array.\n        // 2) We search for the longest sequence of consecutive segments in the input data which are all starting at\n        //    monotone increasing points in the target array. These are the segments which will remain unmodified\n        //    by insertion/removals\n        // 3) Finally, we determine the necessary insertion and remove operations to fill in/remove the entries between\n        //    these segments and compute modify instructions within the segments.\n\n        // 1) Map the GUIDs in the input ChangeSet to indices\n        var resultGuidToIndexMap = {};\n        for (var i = 0; i < targetArray.length; i++) {\n            var insertedProperty = targetArray[i];\n            if (insertedProperty['String'] === undefined ||\n                insertedProperty['String']['guid'] === undefined) {\n                throw new Error(MSG.MISSING_GUID_IN_NORMALIZED_CHANGESET);\n            }\n\n            var guid = insertedProperty['String']['guid'];\n            // since the spec allows alternatively other changeset formats for strings, we have to support them here:\n            if (!_.isString(guid) && insertedProperty['String']['guid'].insert) {\n                guid = insertedProperty['String']['guid'].insert[0][1];\n            }\n            resultGuidToIndexMap[guid] = i;\n        }\n\n        var initialArrayLength = this._dataArrayGetLength();\n\n        // Collect consecutive segments\n        var segmentStartPointsInInitialArray = [];\n        var segmentStartPointsInTargetArray = [];\n        var segmentLengths = [];\n        var segmentInterrupted = false;\n        for (var i = 0; i < initialArrayLength; i++) {\n            // Get the GUID of the entry\n            var guid = this._dataArrayGetValue(i).getGuid();\n\n            // Check where it is stored in the target array\n            var index = resultGuidToIndexMap[guid];\n            if (index !== undefined) {\n                // Check whether we can append the entry to the existing sequence\n                if (!segmentInterrupted &&\n                    segmentStartPointsInTargetArray.length > 0 &&\n                    _.last(segmentStartPointsInTargetArray) + _.last(segmentLengths) === index) {\n                    // In that case we just increase the length of the segment\n                    segmentLengths[segmentLengths.length - 1]++;\n                } else {\n                    // Create a new segment\n                    segmentStartPointsInInitialArray.push(i);\n                    segmentStartPointsInTargetArray.push(index);\n                    segmentLengths.push(1);\n                    segmentInterrupted = false;\n                }\n            } else {\n                segmentInterrupted = true;\n            }\n        }\n\n        // 2) Get all segments in the array which we will keep (we try to keep as many as possible, so this maps\n        // to finding the longest monotone increasing sequence of sub-segments)\n        var orderedSegments = _getLongestIncreasingSubsequenceSegments(segmentStartPointsInTargetArray, segmentLengths);\n\n        // 3) Now we have to convert this sequence of ordered segments to insert and remove commands\n        var changes = {};\n\n        var lastPositionInInitialArray = 0;\n        var lastPositionInTargetArray = 0;\n        var offset = 0;\n        for (var i = 0; i <= orderedSegments.length; i++) {\n            var startPointInInitialArray, startPointInTargetArray, segmentLength;\n            var offsetChange = 0;\n            if (i < orderedSegments.length) {\n                // Extract the information about the currently processed segment.\n                startPointInInitialArray = segmentStartPointsInInitialArray[orderedSegments[i]];\n                startPointInTargetArray = segmentStartPointsInTargetArray[orderedSegments[i]];\n                segmentLength = segmentLengths[orderedSegments[i]];\n            } else {\n                // Special case to handle the end of the sequence: We add a segment of length 0 at the end\n                startPointInInitialArray = initialArrayLength;\n                startPointInTargetArray = targetArray.length;\n                segmentLength = 0;\n            }\n\n            // If the start point of the segment in the initial array is larger than the last point we processed, we have\n            // to remove the elements between the two points\n            if (startPointInInitialArray > lastPositionInInitialArray) {\n                changes.remove = changes.remove || [];\n                changes.remove.push([lastPositionInInitialArray, startPointInInitialArray - lastPositionInInitialArray]);\n                this._removeRangeWithoutDirtying(lastPositionInInitialArray + offset,\n                    startPointInInitialArray - lastPositionInInitialArray);\n                offsetChange -= startPointInInitialArray - lastPositionInInitialArray;\n            }\n\n            // If the start point of the segment in the target array is larger than the last point we processed, we have\n            // to insert the elements between the two points\n            if (startPointInTargetArray > lastPositionInTargetArray) {\n                changes.insert = changes.insert || [];\n                let elementsToInsert = targetArray.slice(lastPositionInTargetArray, startPointInTargetArray);\n                changes.insert.push([\n                    lastPositionInInitialArray,\n                    deepCopy(elementsToInsert),\n                ]);\n                var scope = this._getScope();\n                var insertedProperties = deserializeNonPrimitiveArrayElements(elementsToInsert, scope);\n                this._insertRangeWithoutDirtying(lastPositionInInitialArray + offset, insertedProperties);\n                offsetChange += insertedProperties.length;\n            }\n\n            // Update the last processed points\n            lastPositionInInitialArray = startPointInInitialArray + segmentLength;\n            lastPositionInTargetArray = startPointInTargetArray + segmentLength;\n            offset += offsetChange;\n\n            // Recursively check the entries within the segment for modifications\n            for (var j = 0; j < segmentLength; j++) {\n                var existingEntry = this._dataArrayGetValue(startPointInInitialArray + j + offset);\n                var entryChanges = existingEntry._deserialize(targetArray[startPointInTargetArray + j],\n                                                              false, undefined, true);\n\n                // We had changes which we have to report back\n                if (!ChangeSet.isEmptyChangeSet(entryChanges)) {\n                    // Make sure, the ChangeSet contains the typeid of the modified entry\n                    entryChanges.typeid = existingEntry.getFullTypeid();\n\n                    if (!changes.modify) {\n                        changes.modify = [[startPointInInitialArray + j, [entryChanges]]];\n                    } else {\n                        var lastModifiedSequence = _.last(changes.modify);\n                        if (lastModifiedSequence[0] + lastModifiedSequence[1].length === startPointInInitialArray + j) {\n                            lastModifiedSequence[1].push(entryChanges);\n                        } else {\n                            changes.modify.push([startPointInInitialArray + j, [entryChanges]]);\n                        }\n                    }\n                }\n            }\n        }\n\n        // If there were any changes, we have to mark this property as dirty\n        if (!ChangeSet.isEmptyChangeSet(changes)) {\n            this._setDirty(in_reportToView);\n        }\n        return changes;\n    }\n\n    /**\n     * Function to deserialize special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on deserialization. For supported types, we can just return the input here.\n     *\n     * @param {property-properties.SerializedChangeSet} in_serializedObj - The object to be deserialized\n     * @return {*} the deserialized value\n     */\n    _deserializeValue(in_serializedObj) {\n        return in_serializedObj;\n    }\n\n    /**\n     * Function to serialize special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on serialization. For supported types, we can just return the input here.\n     *\n     * @param {*} in_obj - The object to be serialized\n     * @return {property-properties.SerializedChangeSet} the serialized object\n     */\n    _serializeValue(in_obj) {\n        // we have to convert the propertySet objects to changesets\n        return in_obj._serialize(false, true);\n    }\n\n    /**\n     * Function to serialize arrays of special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on serialization. For supported types, we can just return the input here.\n     *\n     * @param {Array} in_array - The array of special objects to be serialized\n     * @return {Array<property-properties.SerializedChangeSet>} the serialized object\n     */\n    _serializeArray(in_array) {\n        var len = in_array.length;\n        var result = new Array(len);\n    if (this._isPrimitive) {\n        for (var i = 0; i < len; i++) {\n            result[i] = this._serializeValue(in_array[i]);\n        }\n    } else {\n        for (var i = 0; i < len; i++) {\n            result[i] = {};\n        }\n    }\n        return result;\n    }\n\n    /**\n     * Function to deserialize arrays of special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on deserialization. For supported types, we can just return the input here.\n     *\n     * @param {Array<property-properties.SerializedChangeSet>} in_serializedObj the serialized object\n     * @return {Array} in_array - The array of special objects that were deserialized\n     */\n    _deserializeArray(in_serializedObj) {\n        return in_serializedObj;\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _deserialize(in_serializedObj, in_reportToView, in_filteringOptions, in_createChangeSet) {\n        this._checkIsNotReadOnly(false);\n\n        if ((in_serializedObj.remove && in_serializedObj.remove.length > 0) ||\n            (in_serializedObj.modify && in_serializedObj.modify.length > 0) ||\n            (in_serializedObj.insert &&\n                (in_serializedObj.insert.length > 1 ||\n                    (in_serializedObj.insert.length === 1 &&\n                        (in_serializedObj.insert[0][0] !== 0 ||\n                            !_.isArray(in_serializedObj.insert[0][1])))))) {\n            throw new Error(MSG.NO_NORMALIZED_CHANGESET);\n        }\n\n        var arrayLength = this._dataArrayGetLength();\n\n        if (!in_serializedObj.insert ||\n            !in_serializedObj.insert[0]) {\n            // we've got an empty object, so we have to wipe everything we've got\n            if (arrayLength > 0) {\n                this._clearRange(0, arrayLength);\n                this._setDirty(in_reportToView);\n                var removeChangeSet = {\n                    remove: [[0, arrayLength]],\n                };\n                this._updateChanges(removeChangeSet);\n                return removeChangeSet;\n            } else {\n                // the array was already empty, nothing has changed\n                return {};\n            }\n        }\n\n        var scope = this._getScope();\n\n        if (Property.PropertyFactory.inheritsFrom(this.getTypeid(), 'NamedProperty', { scope: scope })) {\n            return this._deserializeNamedPropertyArray(in_serializedObj, in_reportToView);\n        } else {\n            // most simplistic diff method: Remove all existing data and insert the new data\n\n            // The changes we will report as result of this function\n            var simpleChanges = {\n                insert: in_createChangeSet ? deepCopy(in_serializedObj.insert) : in_serializedObj.insert,\n            };\n            if (arrayLength > 0) {\n                simpleChanges.remove = [[0, arrayLength]];\n            }\n\n            if (!this._isPrimitive) {\n                var propertyDescriptions = in_serializedObj.insert[0][1];\n                var result = [];\n\n                for (var i = 0; i < propertyDescriptions.length; ++i) {\n                    var createdProperty = Property.PropertyFactory._createProperty(\n                        propertyDescriptions[i]['typeid'], null, undefined, scope);\n                    createdProperty._setParent(this);\n                    createdProperty._deserialize(propertyDescriptions[i], false, in_filteringOptions, false);\n                    result.push(createdProperty);\n                }\n                this._clearRange(0, this._dataArrayGetLength());\n                this._dataArrayInsertRange(0, result);\n            } else {\n                // Check, whether there has been any change in the array at all\n                if (in_serializedObj.insert[0][1].length === this._dataArrayGetLength()) {\n                    // We have to compare the two buffers\n                    var buffer = this._dataArrayGetBuffer();\n                    var changeSetArray = in_serializedObj.insert[0][1];\n                    var len = buffer.length;\n                    var i = 0;\n                    if (this._typeid === 'Int64' || this._typeid === 'Uint64') {\n                        // For (u)int64, we will compare (Ui/I)nt64 objects with arrays [low, high]\n                        for (i = 0; i < len; i++) {\n                            if (changeSetArray[i][0] !== buffer[i].getValueLow() || changeSetArray[i][1] !== buffer[i].getValueHigh()) {\n                                break;\n                            }\n                        }\n                    } else {\n                        for (i = 0; i < len; i++) {\n                            if (buffer[i] !== changeSetArray[i]) {\n                                break;\n                            }\n                        }\n                    }\n                    if (i === len) {\n                        return {};\n                    }\n                }\n                // set the actual array values to our array\n                this._dataArrayDeserialize(this._deserializeArray(in_serializedObj.insert[0][1]));\n            }\n\n            // Update the dirty and pending changes\n            this._updateChanges(simpleChanges);\n\n            // Finally report the dirtiness to the view (we postponed this above)\n            this._setDirty(in_reportToView);\n\n            return simpleChanges;\n        }\n    }\n\n    _getChangesetForCustomTypeArray(in_basePropertyChangeset,\n        in_dirtinessType,\n        in_includeReferencedRepositories) {\n        var result = {};\n        if (in_basePropertyChangeset.remove && in_basePropertyChangeset.remove.length > 0) {\n            result.remove = deepCopy(in_basePropertyChangeset.remove);\n        }\n        // get the iterator over the changes:\n        var iterator = new ArrayChangeSetIterator(in_basePropertyChangeset);\n        var currentArrayIndex = 0;\n        var currentArraySize = this._dataArrayGetLength();\n        var op, opStartIndex;\n        while (!iterator.atEnd() || currentArrayIndex < currentArraySize) {\n            if (!iterator.atEnd()) {\n                op = iterator.opDescription;\n                opStartIndex = op.operation[0] + op.offset;\n            } else {\n                // no more ops\n                op = { offset: iterator.opDescription.offset };\n                opStartIndex = Number.MAX_VALUE;\n            }\n\n            if (currentArrayIndex < opStartIndex) {\n                // not in the influence of an insert or remove\n\n                // we have to check if the element was modified (since that is not tracked)\n                if (this._dataArrayGetValue(currentArrayIndex)._isDirty(in_dirtinessType)) {\n                    // check if we can combine modifies:\n                    var lastModify = undefined;\n                    if (result.modify && result.modify.length > 0) {\n                        lastModify = result.modify[result.modify.length - 1];\n                        if (lastModify[0] + lastModify[1].length === currentArrayIndex - op.offset) {\n                            // we need to combine, keep lastModify\n                        } else {\n                            lastModify = undefined;\n                        }\n                    }\n\n                    if (lastModify) {\n                        lastModify[1].push(this._dataArrayGetValue(currentArrayIndex).serialize(\n                            {\n                                'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            }));\n                    } else {\n                        // begin new modify\n                        if (!result.modify) {\n                            result.modify = [];\n                        }\n                        result.modify.push([currentArrayIndex - op.offset,\n                        [this._dataArrayGetValue(currentArrayIndex).serialize(\n                            {\n                                'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            })]]);\n                    }\n                    currentArrayIndex++;\n                    // add more immediate modifies if possible\n                    while (currentArrayIndex < currentArraySize && currentArrayIndex < opStartIndex &&\n                        this._dataArrayGetValue(currentArrayIndex)._isDirty(in_dirtinessType)) {\n                        result.modify[result.modify.length - 1][1].push(\n                            this._dataArrayGetValue(currentArrayIndex).serialize(\n                                {\n                                    'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                    'includeReferencedRepositories': in_includeReferencedRepositories,\n                                }),\n                        );\n                        currentArrayIndex++;\n                    }\n                } else {\n                    currentArrayIndex++;\n                }\n            } else if (currentArrayIndex === opStartIndex) {\n                // handle the op\n                if (op.type === ArrayChangeSetIterator.types.REMOVE) {\n                    // no need to do something (removes are just copied)\n                    iterator.next(); // we've completely consumed that op\n                } else if (op.type === ArrayChangeSetIterator.types.INSERT) {\n                    // we have to convert the inserts:\n                    var currentInsert = op.operation;\n                    var newInsert = [currentInsert[0], []];\n                    for (var j = 0; j < currentInsert[1].length; ++j) {\n                        // TODO: we don't use the data from the changeset anymore, since we directly\n                        // TODO: read the data from the array now - remove the data from the op and\n                        // TODO: replace it with just the length instead\n                        if (!this._dataArrayGetValue(opStartIndex + j)) {\n                            throw new Error('insert: invalid index');\n                        }\n                        newInsert[1].push(this._dataArrayGetValue(opStartIndex + j).serialize(\n                            {\n                                'dirtyOnly': false, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            }));\n                    }\n                    if (!result.insert) {\n                        result.insert = [];\n                    }\n                    result.insert.push(newInsert);\n                    currentArrayIndex += currentInsert[1].length; // we've read and used these entries above\n                    iterator.next(); // we've completely consumed that op\n                } else if (op.type === ArrayChangeSetIterator.types.MODIFY) {\n                    // Prevent from looping infinitly\n                    // TODO: Might want to decide if there's something to do here\n                    iterator.next(); // we've completely consumed that op\n                }\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Serialize the property\n     *\n     * @param {boolean} in_dirtyOnly -\n     *     Only include dirty entries in the serialization\n     * @param {boolean} in_includeRootTypeid -\n     *     Include the typeid of the root of the hierarchy - has no effect for ArrayProperty\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_dirtinessType] -\n     *     The type of dirtiness to use when reporting dirty changes. By default this is\n     *     PENDING_CHANGE\n     * @param {boolean} [in_includeReferencedRepositories=false] - If this is set to true, the _serialize\n     *     function will descend into referenced repositories. WARNING: if there are loops in the references\n     *     this can result in an infinite loop\n     *\n     *\n     * @return {Object} The serialized representation of this property\n     * @private\n     */\n    _serialize(in_dirtyOnly, in_includeRootTypeid,\n        in_dirtinessType, in_includeReferencedRepositories) {\n        var result = AbstractStaticCollectionProperty.prototype._serialize.call(this, in_dirtyOnly, in_includeRootTypeid,\n            in_dirtinessType, in_includeReferencedRepositories);\n\n        if (!this._isPrimitive) {\n            if (in_dirtyOnly) {\n                _.extend(result, in_dirtinessType === BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE ?\n                    this._getChangesetForCustomTypeArray(this._getPendingChanges(), in_dirtinessType,\n                        in_includeReferencedRepositories) :\n                    this._getChangesetForCustomTypeArray(this._getDirtyChanges(), in_dirtinessType,\n                        in_includeReferencedRepositories));\n\n                return result;\n            } else {\n                // returns just an insert with the current data\n                if (this._dataArrayGetLength() > 0) {\n                    result.insert = [];\n                    result.insert.push([0, []]);\n                    // we have to convert the propertySet objects to changesets\n                    for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                        result.insert[0][1].push(this._dataArrayGetValue(i)._serialize(false, true, in_dirtinessType,\n                            in_includeReferencedRepositories));\n                    }\n                }\n                return result;\n            }\n        } else if (in_dirtyOnly) {\n            return in_dirtinessType === BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE ?\n                deepCopy(this._getPendingChanges()) : deepCopy(this._getDirtyChanges());\n        } else {\n            // returns just an insert with the current data\n            if (this._dataArrayGetLength() > 0) {\n                result.insert = [];\n                result.insert.push([0, []]);\n                for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                    result.insert[0][1].push(this._serializeValue(this._dataArrayGetValue(i)));\n                }\n            }\n            return result;\n        }\n    }\n\n    /**\n     * Repeatedly calls back the given function with human-readable string\n     * representations of the property and of its sub-properties.\n     * @param {string} indent - Leading spaces to create the tree representation\n     * @param {string} externalId - Name of the current property at the upper level.\n     *                              Used for arrays.\n     * @param {function} printFct - Function to call for printing each property\n     */\n    _prettyPrint(indent, externalId, printFct) {\n        printFct(indent + externalId + this.getId() + ' (Array of ' + this.getTypeid() + '): [');\n        if (!this._isPrimitive) {\n            this._prettyPrintChildren(indent, printFct);\n        } else {\n            var childIndent = indent + '  ';\n            var prefix = '';\n            var suffix = '';\n            if (this.getTypeid() === 'String') {\n                prefix = '\"';\n                suffix = '\"';\n            }\n            for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                printFct(childIndent + i + ': ' + prefix + this._dataArrayGetValue(i) + suffix);\n            }\n        }\n        printFct(indent + ']');\n    }\n\n    /**\n     * Repeatedly calls back the given function with human-readable string\n     * representations of the property's sub-properties.\n     * @param {string} indent - Leading spaces to create the tree representation\n     * @param {function} printFct - Function to call for printing each property\n     */\n    _prettyPrintChildren(indent, printFct) {\n        indent += '  ';\n        var ids = this.getIds();\n        for (var i = 0; i < ids.length; i++) {\n            this.get(ids[i], { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER })\n                ._prettyPrint(indent, ids[i] + ': ', printFct);\n        }\n    }\n\n    /**\n     * Return a JSON representation of the array and its items.\n     * @return {object} A JSON representation of the array and its items.\n     * @private\n     */\n    _toJson() {\n        var json = {\n            id: this.getId(),\n            context: this._context,\n            typeid: this.getTypeid(),\n            isConstant: this._isConstant,\n            value: [],\n        };\n\n        if (!this._isPrimitive) {\n            var ids = this.getIds();\n            for (var i = 0; i < ids.length; i++) {\n                json.value.push(\n                    this.get(ids[i], { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER })._toJson(),\n                );\n            }\n        } else {\n            json.value = this.getValues();\n        }\n\n        return json;\n    }\n\n    /**\n     * Returns the full property type identifier for the ChangeSet including the array type id, if not\n     * omitted by parameters\n     * @param  {boolean} [in_hideCollection=false] - if true the collection type (if applicable) will be omitted\n     * @return {string} The typeid\n     */\n    getFullTypeid(in_hideCollection) {\n        if (in_hideCollection) {\n            return this._typeid;\n        } else {\n            return TypeIdHelper.createSerializationTypeId(this._typeid, 'array');\n        }\n    }\n\n    /**\n     * Creates and initializes the data array\n     * @param {Number} in_length      the initial length of the array\n     */\n    _dataArrayCreate(in_length) {\n        // This really creates a generic array for custom type arrays. For primitive arrays, like\n        // 'StringArrayProperty' or 'Float32ArrayProperty', you need to overload this function.\n        this._dataArrayRef = new UniversalDataArray(in_length);\n        for (var i = 0; i < in_length; i++) {\n            var element = Property.PropertyFactory._createProperty(this.getTypeid(), null, undefined, this._scope);\n            element._setParent(this);\n            this._dataArraySetValue(i, element);\n        }\n    }\n\n    /**\n     * Returns the length of the data array\n     * @return {Number} The length\n     */\n    _dataArrayGetLength() {\n        return this._dataArrayRef.length;\n    }\n\n    /**\n     * Returns the data array's internal buffer\n     * @return {Array} The buffer\n     */\n    _dataArrayGetBuffer() {\n        return this._dataArrayRef.getBuffer();\n    }\n\n    /**\n     * Returns an entry from the data array\n     * @param {Number} in_index - Position in the array\n     *\n     * @return {*} The value at index in_index\n     */\n    _dataArrayGetValue(in_index) {\n        return this._dataArrayRef.getValue(in_index);\n    }\n\n    /**\n     * Sets an entry in the data array\n     * @param {Number} in_index - Position in the array\n     * @param {*}      in_value - The new value at index in_index\n     */\n    _dataArraySetValue(in_index, in_value) {\n        this._dataArrayRef.setValue(in_index, in_value);\n    }\n\n    /**\n     * Set the array to the given new array\n     * @param {Array} in_newArray - The new contents of the array\n     */\n    _dataArrayDeserialize(in_newArray) {\n        this._dataArrayRef.deserialize(in_newArray);\n    }\n\n    /**\n     * Inserts a range into the data array\n     * @param {Number} in_position - Position at which the insert should be done\n     * @param {Array} in_range     - The array to insert\n     */\n    _dataArrayInsertRange(in_position, in_range) {\n        this._dataArrayRef.insertRange(in_position, in_range);\n    }\n\n    /**\n     * Removes a range from the data array\n     * @param {Number} in_position - Position at which to start the removal\n     * @param {Number} in_length   - The number of entries to remove\n     */\n    _dataArrayRemoveRange(in_position, in_length) {\n        this._dataArrayRef.removeRange(in_position, in_length);\n    }\n\n    /**\n     * Overwrites a range in the data array\n     * @param {Number} in_position - Position at which to start the removal\n     * @param {Array} in_range     - The array to overwrite\n     */\n    _dataArraySetRange(in_position, in_range) {\n        this._dataArrayRef.set(in_position, in_range);\n    }\n\n    /**\n     * Get the scope to which this property belongs to.\n     * @return {string|undefined} The guid representing the scope in which the\n     * map belongs to. If there is a workspace scope return it, else return the scope of this array.\n     * @override\n     * @private\n     */\n    _getScope() {\n        var scope = AbstractStaticCollectionProperty.prototype._getScope.call(this);\n\n        if (scope !== undefined) {\n            return scope;\n        } else {\n            return this._scope;\n        }\n    }\n\n    /**\n     * returns the length of the current array property\n     */\n    get length() {\n        return this.getLength();\n    }\n    set length(len) {\n        throw new Error(MSG.MODIFY_READ_ONLY);\n    }\n}\n\nArrayProperty.prototype._staticChildren = {};\nArrayProperty.prototype._context = 'array';\n"]}
+{"version":3,"file":"arrayProperty.js","sourceRoot":"","sources":["../../src/properties/arrayProperty.js"],"names":[],"mappings":";;;AAAA;;;GAGG;AACH;;GAEG;AACH,MAAM,EACF,sBAAsB,EACtB,SAAS,EACT,UAAU,EACV,YAAY,GACf,GAAG,OAAO,CAAC,wCAAwC,CAAC,CAAC;AACtD,MAAM,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC,qCAAqC,CAAC,CAAC,SAAS,CAAC;AACzE,MAAM,EAAE,kBAAkB,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,qCAAqC,CAAC,CAAC;AAC5F,MAAM,eAAe,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;AACrD,MAAM,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC5B,MAAM,EAAE,oCAAoC,EAAE,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC;AACnF,MAAM,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC;AAC/D,MAAM,EAAE,gCAAgC,EAAE,GAAG,OAAO,CAAC,oCAAoC,CAAC,CAAC;AAC3F,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC;AACnD,MAAM,EAAE,oBAAoB,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC;AAE7E,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC;AAEtC,IAAI,oBAAoB,GAAG,YAAY,CAAC,oBAAoB,CAAC;AAE7D,uEAAuE;AACvE,yEAAyE;AACzE,qEAAqE;AACrE,4EAA4E;AAC5E,wDAAwD;AACxD,mFAAmF;AACnF,uCAAuC;AACvC,IAAI,+BAA+B,GAAG;IAClC,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,cAAc,GAAG,oBAAoB,CAAC,KAAK;CAC1E,CAAC;AACF,IAAI,qBAAqB,GAAG;IACxB,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,cAAc;CAC7C,CAAC;AACF,IAAI,mBAAmB,GAAG;IACtB,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;IAChB,KAAK,EAAE,oBAAoB,CAAC,KAAK;CACpC,CAAC;AACF,IAAI,uBAAuB,GAAG;IAC1B,SAAS;IACT,qBAAqB;IACrB,mBAAmB;IACnB,+BAA+B;CAClC,CAAC;AAEF,IAAI,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC;AAE3C;;;;;;;;;;;;;GAaG;AACH,IAAI,wCAAwC,GAAG,UAAS,gBAAgB,EAAE,iBAAiB;IACvF,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE;QAC/B,OAAO,EAAE,CAAC;KACb;IAED,mEAAmE;IACnE,mEAAmE;IACnE,mEAAmE;IACnE,qEAAqE;IACrE,+CAA+C;IAC/C,IAAI,iBAAiB,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC9C,IAAI,mBAAmB,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAE9C,6EAA6E;QAC7E,qFAAqF;QACrF,IAAI,KAAK,GAAG,CAAC,CAAC,aAAa,CAAC,iBAAiB,EAAE,EAAE,iBAAiB,EAAE,mBAAmB,EAAE,EAAE,mBAAmB,CAAC,CAAC;QAChH,IAAI,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAErE,yFAAyF;QACzF,uBAAuB;QACvB,IAAI,QAAQ,GAAG;YACX,cAAc,EAAE,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,YAAY,EAAE,CAAC;YACf,iBAAiB,EAAE,mBAAmB,GAAG,iBAAiB,CAAC,CAAC,CAAC,GAAG,CAAC;YACjE,aAAa,EAAE,SAAS;SAC3B,CAAC;QAEF,mDAAmD;QACnD,IAAI,cAAc,GAAG,CAAC,CAAC,aAAa,CAAC,iBAAiB,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACpF,IAAI,iBAAiB,CAAC,cAAc,CAAC,KAAK,SAAS;YAC/C,iBAAiB,CAAC,cAAc,CAAC,CAAC,cAAc,KAAK,QAAQ,CAAC,cAAc,EAAE;YAC9E,cAAc,EAAE,CAAC;SACpB;QAED,wEAAwE;QACxE,0EAA0E;QAC1E,wEAAwE;QACxE,sEAAsE;QACtE,8DAA8D;QAC9D,IAAI,mBAAmB,GAAG,QAAQ,CAAC,cAAc,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAEzE,IAAI,CAAC,GAAG,cAAc,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,mBAAmB,EAAE,CAAC,EAAE,EAAE;YAC7E,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC,iBAAiB,IAAI,QAAQ,CAAC,iBAAiB,EAAE;gBACtE,iBAAiB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/B,cAAc,EAAE,CAAC;aACpB;SACJ;QAED,gEAAgE;QAChE,iBAAiB,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,8CAA8C;KACxG;IAED,uEAAuE;IACvE,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAElD,qBAAqB;IACrB,IAAI,eAAe,GAAG,EAAE,CAAC;IACzB,IAAI,cAAc,GAAG,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC/C,OAAO,cAAc,EAAE;QACnB,eAAe,CAAC,OAAO,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;QACrD,cAAc,GAAG,cAAc,CAAC,aAAa,CAAC;KACjD;IAED,OAAO,eAAe,CAAC;AAC3B,CAAC,CAAC;AAEF,MAAa,aAAc,SAAQ,gCAAgC;IAC/D;;;;;;OAMG;IACH,YAAY,SAAS,EAAE,QAAQ;QAC3B,KAAK,CAAC,SAAS,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,CAAC;QAErD,aAAa;QACb,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QAExB,0DAA0D;QAC1D,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;SAC1B;QAED,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;;OAOG;IACH,2BAA2B,CAAC,YAAY;QACpC,IAAI,KAAK,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC7D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YACd,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,qCAAqC,CAAC,CAAC;SAC9D;QAED,OAAO,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;IAC7B,CAAC;IAED;;;;;;;;OAQG;IACH,mBAAmB,CAAC,UAAU,EAAE,cAAc;QAC1C,wDAAwD;QACxD,IAAI,cAAc,KAAK,UAAU,CAAC,WAAW,CAAC,WAAW,EAAE;YACvD,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAEnC,4FAA4F;YAC5F,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAClB,qDAAqD;gBACrD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mCAAmC,GAAG,UAAU,CAAC,CAAC;aACzE;YAED,mFAAmF;YACnF,oBAAoB;YACpB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,mBAAmB,EAAE,EAAE;gBAClD,OAAO,SAAS,CAAC;aACpB;YACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;SACzC;aAAM;YACH,OAAO,gCAAgC,CAAC,SAAS,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;SAChH;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,WAAW,EAAE,QAAQ;QACxB,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;;;;;OAMG;IACH,cAAc;QACV,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;;;OAOG;IACH,IAAI,CAAC,SAAS;QACV,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,SAAS,CAAC,CAAC;SAC3D;aAAM;YACH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;SAC7D;QACD,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,GAAG,IAAI;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,SAAS;QACb,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;YACtB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;SAClC;aAAM;YACH,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,WAAW;QACd,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,GAAG;QACC,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAC9C,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;YAC1E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC;IAED;;;OAGG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7F,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,OAAO,IAAI,CAAC;SACf;aAAM;YACH,OAAO,SAAS,CAAC;SACpB;IACL,CAAC;IAED;;OAEG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,WAAW,EAAE,QAAQ;QACrB,IAAI,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YACrB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,qBAAqB,GAAG,QAAQ,CAAC,CAAC;SAC7D;QACD,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,SAAS,EAAE,QAAQ,EAAE,UAAU;QACtC,IAAI,QAAQ,EAAE;YACV,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACpB,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,kBAAkB,GAAG,0BAA0B,CAAC,CAAC;gBAE/F,IAAI,GAAG,GAAG,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACvC,IAAI,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBAExB,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;wBACtC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;qBACvB;yBAAM;wBACH,IAAI,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC3C,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;qBACxF;oBACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBAClB;gBAED,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;aAChC;iBAAM;gBACH,gCAAgC,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;aACrG;SACJ;aAAM;YACH,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;SACtC;IACL,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,SAAS;QACxB,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;gBACtB,IAAI,CAAC,KAAK,EAAE,CAAC;gBACb,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAClC;iBAAM;gBACH,gCAAgC,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;aAC9E;SACJ;aAAM;YACH,IAAI,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE;gBACvE,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,mBAAmB,EAAE,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;aACrF;YAED,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,IAAI,QAAQ,GAAG,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,CAAC;YAC9C,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,UAAS,KAAK,EAAE,KAAK;gBACnC,IAAI,KAAK,GAAG,QAAQ,EAAE;oBAClB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;iBAC7B;qBAAM;oBACH,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,KAAK,KAAK,EAAE;wBAC1C,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;qBAC1B;iBACJ;YACL,CAAC,CAAC,CAAC;SACN;IACL,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,CAAC,SAAS;QACf,IAAI,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,IAAI,YAAY,KAAK,SAAS,EAAE;YAC5B,YAAY,CAAC,0BAA0B,EAAE,CAAC;YAC1C,aAAa,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,YAAY,CAAC,yBAAyB,EAAE,CAAC;SAC5C;aAAM;YACH,aAAa,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;SAC1E;IACL,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;YAClB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;SACzC;IACL,CAAC;IAED;;;;;OAKG;IACH,kBAAkB;QACd,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,YAAY;QACvB,IAAI,cAAc,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC/C,SAAS,CAAC,SAAS,CAAC,iCAAiC,CAAC,cAAc,EAChE,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAE5C,IAAI,YAAY,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC3C,SAAS,CAAC,SAAS,CAAC,iCAAiC,CAAC,YAAY,EAC9D,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QAE5C,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,kBAAkB;QACd,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;IACtD,CAAC;IAED;;;OAGG;IACH,gBAAgB;QACZ,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACpD,CAAC;IAED;;;;;;;;;OASG;IACH,WAAW,CAAC,UAAU,EAAE,QAAQ;QAC5B,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,IAAI,IAAI,CAAC,MAAM;YACX,IAAI,CAAC,MAAM,KAAK,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;YAC5D,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;SAC3B;QAED,IAAI,UAAU,KAAK,IAAI,EAAE;YACrB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;gBACxB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;gBAChC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC;aACpC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,SAAS,CAAC;aACnC;SACJ;QAED,IAAI,QAAQ,KAAK,IAAI,EAAE;YACnB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;gBACtB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC;gBAChC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;aAChC;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE;gBACpB,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,SAAS,CAAC;aACjC;SACJ;QAED,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS;gBAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS,EAAE;gBACnC,IAAI,QAAQ,KAAK,CAAC,EAAE;oBAChB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;iBAC3B;qBAAM;oBACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;iBACnD;aACJ;iBAAM;gBACH,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;aAChC;SACJ;aAAM,IAAI,QAAQ,EAAE;YACjB,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,QAAQ;QACnB,IAAI,IAAI,CAAC,MAAM,EAAE;YACb,IAAI,IAAI,CAAC,MAAM,KAAK,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;gBAC5D,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,QAAQ,CAAC;gBAE7B,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS;oBAC/B,IAAI,CAAC,MAAM,CAAC,OAAO,KAAK,SAAS;oBACjC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,EAAE;oBAC9D,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;iBAC3B;aACJ;iBAAM;gBACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;aACnD;SACJ;aAAM;YACH,IAAI,CAAC,MAAM,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;SACnD;IACL,CAAC;IAED;;;OAGG;IACH,cAAc;QACV,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;YAC3B,OAAO,CAAC,CAAC;SACZ;QAED,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;IAC7B,CAAC;IAED;;;;;;;;;;;OAWG;IACH,WAAW,CAAC,SAAS,EAAE,QAAQ;QAC3B,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YACtB,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,kBAAkB,GAAG,2BAA2B,CAAC,CAAC;SAC7E;QAED,IAAI,kBAAkB,CAAC,OAAO,EAAE;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;oBACrC,QAAQ,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBACvC;aACJ;YACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;SAClC;QACD,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;;;OAQG;IACH,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,aAAa;QAC1D,IAAI,aAAa,KAAK,SAAS,EAAE;YAC7B,aAAa,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACpE,MAAM,KAAK,CAAC,GAAG,CAAC,oBAAoB,GAAG,SAAS,CAAC,CAAC;SACrD;QACD,IAAI,aAAa,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACrC,IAAI,GAAG,GAAG,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;gBACtC,IAAI,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,CAAC,EAAE;oBACxC,IAAI,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;iBACtG;gBAED,IAAI,IAAI,CAAC,SAAS,EAAE,EAAE;oBAClB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,qBAAqB,CAAC,CAAC;iBAC9C;qBAAM;oBACH,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;iBACzB;gBACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAClB;YAED,QAAQ,GAAG,GAAG,CAAC;SAClB;QACD,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAEhD,+BAA+B;QAC/B,IAAI,SAAS,GAAG;YACZ,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;SAC1D,CAAC;QACF,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,WAAW,CAAC,SAAS,EAAE,cAAc;QACjC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,UAAU;YACrD,yDAAyD,CAAC,CAAC;QAC/D,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,EAC1C,GAAG,CAAC,UAAU,GAAG,8DAA8D,CAAC,CAAC;QACrF,YAAY,CAAC,MAAM,CAAC,SAAS,GAAG,cAAc,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,IAAI,CAAC,IAAI,cAAc,GAAG,CAAC,EACpG,GAAG,CAAC,oBAAoB,GAAG,gBAAgB,GAAG,cAAc,GAAG,2BAA2B,GAAG,SAAS,CAAC,CAAC;QAC5G,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,SAAS,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;YACzD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAC5D,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,SAAS,EAAE,cAAc;QACjC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,EAAE,CAAC,EAAE;gBACrC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,IAAI,EAAE;oBAC7D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAC;iBAC5D;qBAAM;oBACH,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;iBAChE;aACJ;SACJ;QAED,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACH,2BAA2B,CAAC,SAAS,EAAE,cAAc;QACjD,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;QAE5C,+BAA+B;QAC/B,IAAI,SAAS,GAAG;YACZ,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;SAC1C,CAAC;QACF,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;OAQG;IACH,QAAQ,CAAC,SAAS,EAAE,QAAQ;QACxB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;YAC/C,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,kBAAkB,GAAG,wBAAwB,CAAC,CAAC;SAC1E;QACD,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YACtB,qDAAqD;YACrD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,GAAG,mDAAmD,CAAC,CAAC;SACzF;QACD,YAAY,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,EACpF,GAAG,CAAC,iBAAiB,GAAG,aAAa,GAAG,QAAQ,CAAC,MAAM,GAAG,2BAA2B,GAAG,SAAS;YACjG,kBAAkB,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,EAAE,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,wBAAwB,CAAC,SAAS,EAAE,QAAQ;QACxC,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;OAMG;IACH,2BAA2B,CAAC,SAAS,EAAE,QAAQ;QAC3C,iDAAiD;QACjD,IAAI,SAAS,GAAG,CAAC,EAAE;YACf,MAAM,KAAK,CAAC,GAAG,CAAC,qBAAqB,GAAG,SAAS,CAAC,CAAC;SACtD;QACD,IAAI,SAAS,GAAG,EAAE,CAAC;QACnB,IAAI,WAAW,GAAG,EAAE,CAAC;QAErB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,sEAAsE;YACtE,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;YAC7D,IAAI,CAAC,2BAA2B,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;SACzD;aAAM;YACH,gEAAgE;YAChE,qFAAqF;YACrF,wFAAwF;YACxF,+DAA+D;YAC/D,IAAI,CAAC,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE;oBACxD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACtC,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE;4BACxD,MAAM;yBACT;qBACJ;oBACD,IAAI,CAAC,kBAAkB,CAAC,SAAS,GAAG,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC7D,WAAW,CAAC,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC9E,CAAC,GAAG,CAAC,CAAC;iBACT;aACJ;YACD,SAAS,CAAC,QAAQ,CAAC,GAAG,WAAW,CAAC;YAClC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC;IACL,CAAC;IAED;;;;;;OAMG;IACH,MAAM;QACF,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,WAAW;QACX,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC,WAAW,CAAC,KAAK,SAAS,CAAC;IACjE,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACH,GAAG,CAAC,WAAW,EAAE,UAAU;QACvB,UAAU,GAAG,UAAU,IAAI,EAAE,CAAC;QAC9B,UAAU,CAAC,uBAAuB;YAC9B,UAAU,CAAC,uBAAuB,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;gBACzF,UAAU,CAAC,uBAAuB,CAAC;QAC3C,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,CAAC,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;YACxB,IAAI,cAAc,GAAG,CAAC,CAAC;YACvB,IAAI,IAAI,GAAG,IAAI,CAAC;YAChB,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,EAAE,EAAE;gBACnC,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxB,cAAc,GAAG,CAAC,CAAC;aACtB;iBAAM,IAAI,WAAW,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,IAAI,EAAE;gBAC5C,IAAI,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;gBACtB,cAAc,GAAG,CAAC,CAAC;aACtB;iBAAM;gBACH,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,yBAAyB,CAAC,CAAC;gBAClE,IAAI,IAAI,GAAG,UAAU,CAAC,uBAAuB,CAAC;gBAC9C,YAAY,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,EAClD,GAAG,CAAC,gBAAgB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9C;YACD,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE;gBAC9D,IAAI,UAAU,CAAC,uBAAuB,KAAK,YAAY,CAAC,oBAAoB,CAAC,QAAQ,EAAE;oBACnF,IAAI,GAAG,CAAC,KAAK,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;wBAC5E,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC;iBAC/C;gBACD,IAAI,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,WAAW,CAAC,GAAG,EAAE;oBACxC,IAAI,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC;iBAClD;gBACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,CAAC;gBACnE,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;oBAClD,OAAO,SAAS,CAAC;iBACpB;aACJ;YACD,OAAO,IAAI,CAAC;SACf;QAED,IAAI,WAAW,KAAK,WAAW,CAAC,IAAI,EAAE;YAClC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;SACzB;aAAM,IAAI,WAAW,KAAK,WAAW,CAAC,EAAE,EAAE;YACvC,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;SAC3B;aAAM,IAAI,WAAW,KAAK,WAAW,CAAC,GAAG,EAAE;YACxC,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;SAChD;aAAM;YACH,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAClC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,0BAA0B,CAAC,CAAC;YACnE,IAAI,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,UAAU,CAAC,uBAAuB,KAAK,YAAY,CAAC,oBAAoB,CAAC,MAAM,EAAE;gBACjF,IAAI,MAAM,YAAY,QAAQ,CAAC,iBAAiB,EAAE;oBAC9C,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;iBACvB;aACJ;YACD,OAAO,MAAM,CAAC;SACjB;IACL,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,SAAS;QACL,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,CAAC;SAClC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,SAAS;QACL,OAAO,IAAI,CAAC,mBAAmB,EAAE,CAAC;IACtC,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,YAAY,EAAE,eAAe;QACzC,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,wEAAwE;QACxE,IAAI,aAAa,GAAG,IAAI,sBAAsB,CAAC,YAAY,CAAC,CAAC;QAE7D,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,oDAAoD;YACpD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;gBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;oBACtC,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,oBAAoB,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpE,IAAI,yBAAyB,GAAG,EAAE,CAAC;wBACnC,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;wBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;4BAClD,IAAI,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC1D,oBAAoB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;4BAC/D,qDAAqD;4BACrD,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;4BACjC,eAAe,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;4BAC7D,yBAAyB,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;yBACnD;wBACD,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,yBAAyB,CAAC,EAAE,KAAK,CAAC,CAAC;wBAC9D,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,UAAU,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC1D,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE;4BACzB,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;yBAClC;wBACD,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;wBAC5H,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,kBAAkB;wBAClB,IAAI,oBAAoB,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBACpE,IAAI,UAAU,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC;wBAC/F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;4BAClD,IAAI,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,GAAG,CAAC,EAC1C,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC;4BAC1E,IAAI,CAAC,gBAAgB,EAAE;gCACnB,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,aAAa,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;6BACzD;4BACD,gBAAgB,CAAC,eAAe,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;yBACpE;wBACD,MAAM;oBACV;wBACI,OAAO,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;iBACpG;gBACD,aAAa,CAAC,IAAI,EAAE,CAAC;aACxB;SACJ;aAAM;YACH,oDAAoD;YACpD,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE;gBAC3B,QAAQ,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE;oBACtC,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,iBAAiB;wBACjB,IAAI,YAAY,GAAG,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC5D,IAAI,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE;4BACrD,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC;yBACtC;wBAED,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9H,MAAM;oBACV,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM;wBACpC,kBAAkB;wBAClB,IAAI,CAAC,2BAA2B,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,EAC1G,IAAI,CAAC,iBAAiB,CAAC,aAAa,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBACtE,MAAM;oBACV;wBACI,OAAO,CAAC,KAAK,CAAC,kBAAkB,GAAG,GAAG,CAAC,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;iBACpG;gBACD,aAAa,CAAC,IAAI,EAAE,CAAC;aACxB;SACJ;QAED,kHAAkH;QAClH,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,mBAAmB,EAAE,iBAAiB;QACrD,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,CAAC,WAAW,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,CAAC;QACzD,kHAAkH;QAClH,sBAAsB;QACtB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;;;;OAKG;IACH,WAAW,CAAC,QAAQ;QAChB,wCAAwC;QACxC,YAAY,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAExD,0DAA0D;QAC1D,IAAI,cAAc,GAAG,IAAI,EACrB,YAAY,GAAG,IAAI,CAAC;QAExB,IAAI,QAAQ,KAAK,SAAS;YACtB,CAAC,QAAQ,GAAG,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,KAAK,CAAC,EAAE;YACrE,cAAc,GAAG,SAAS,CAAC;SAC9B;QACD,IAAI,QAAQ,KAAK,SAAS;YACtB,CAAC,QAAQ,GAAG,YAAY,CAAC,oBAAoB,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YAC5D,YAAY,GAAG,SAAS,CAAC;SAC5B;QAED,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,YAAY,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,gBAAgB;QACvB,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,EAAE,CAAC,EAAE;gBACjD,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC;aAC3D;SACJ;QACD,gDAAgD;QAChD,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;;;;;OAUG;IACH,8BAA8B,CAAC,gBAAgB,EAAE,eAAe;QAC5D,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC3C,MAAM,IAAI,SAAS,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;SAC9C;QAED,6FAA6F;QAC7F,sEAAsE;QACtE,IAAI,WAAW,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhD,2GAA2G;QAC3G,4FAA4F;QAC5F,0GAA0G;QAC1G,mBAAmB;QACnB,4GAA4G;QAC5G,yGAAyG;QACzG,2BAA2B;QAC3B,+GAA+G;QAC/G,yEAAyE;QAEzE,qDAAqD;QACrD,IAAI,oBAAoB,GAAG,EAAE,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,gBAAgB,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,KAAK,SAAS;gBACxC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,SAAS,EAAE;gBAClD,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,oCAAoC,CAAC,CAAC;aAC7D;YAED,IAAI,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC;YAC9C,yGAAyG;YACzG,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE;gBAChE,IAAI,GAAG,gBAAgB,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC1D;YACD,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SAClC;QAED,IAAI,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAEpD,+BAA+B;QAC/B,IAAI,gCAAgC,GAAG,EAAE,CAAC;QAC1C,IAAI,+BAA+B,GAAG,EAAE,CAAC;QACzC,IAAI,cAAc,GAAG,EAAE,CAAC;QACxB,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,kBAAkB,EAAE,CAAC,EAAE,EAAE;YACzC,4BAA4B;YAC5B,IAAI,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YAEhD,+CAA+C;YAC/C,IAAI,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,KAAK,KAAK,SAAS,EAAE;gBACrB,iEAAiE;gBACjE,IAAI,CAAC,kBAAkB;oBACnB,+BAA+B,CAAC,MAAM,GAAG,CAAC;oBAC1C,CAAC,CAAC,IAAI,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,KAAK,EAAE;oBAC5E,0DAA0D;oBAC1D,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;iBAC/C;qBAAM;oBACH,uBAAuB;oBACvB,gCAAgC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACzC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC5C,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACvB,kBAAkB,GAAG,KAAK,CAAC;iBAC9B;aACJ;iBAAM;gBACH,kBAAkB,GAAG,IAAI,CAAC;aAC7B;SACJ;QAED,wGAAwG;QACxG,uEAAuE;QACvE,IAAI,eAAe,GAAG,wCAAwC,CAAC,+BAA+B,EAAE,cAAc,CAAC,CAAC;QAEhH,4FAA4F;QAC5F,IAAI,OAAO,GAAG,EAAE,CAAC;QAEjB,IAAI,0BAA0B,GAAG,CAAC,CAAC;QACnC,IAAI,yBAAyB,GAAG,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC9C,IAAI,wBAAwB,EAAE,uBAAuB,EAAE,aAAa,CAAC;YACrE,IAAI,YAAY,GAAG,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE;gBAC5B,iEAAiE;gBACjE,wBAAwB,GAAG,gCAAgC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,uBAAuB,GAAG,+BAA+B,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9E,aAAa,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;aACtD;iBAAM;gBACH,0FAA0F;gBAC1F,wBAAwB,GAAG,kBAAkB,CAAC;gBAC9C,uBAAuB,GAAG,WAAW,CAAC,MAAM,CAAC;gBAC7C,aAAa,GAAG,CAAC,CAAC;aACrB;YAED,6GAA6G;YAC7G,gDAAgD;YAChD,IAAI,wBAAwB,GAAG,0BAA0B,EAAE;gBACvD,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;gBACtC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,0BAA0B,EAAE,wBAAwB,GAAG,0BAA0B,CAAC,CAAC,CAAC;gBACzG,IAAI,CAAC,2BAA2B,CAAC,0BAA0B,GAAG,MAAM,EAChE,wBAAwB,GAAG,0BAA0B,CAAC,CAAC;gBAC3D,YAAY,IAAI,wBAAwB,GAAG,0BAA0B,CAAC;aACzE;YAED,4GAA4G;YAC5G,gDAAgD;YAChD,IAAI,uBAAuB,GAAG,yBAAyB,EAAE;gBACrD,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC;gBACtC,IAAI,gBAAgB,GAAG,WAAW,CAAC,KAAK,CAAC,yBAAyB,EAAE,uBAAuB,CAAC,CAAC;gBAC7F,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;oBAChB,0BAA0B;oBAC1B,QAAQ,CAAC,gBAAgB,CAAC;iBAC7B,CAAC,CAAC;gBACH,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;gBAC7B,IAAI,kBAAkB,GAAG,oCAAoC,CAAC,gBAAgB,EAAE,KAAK,CAAC,CAAC;gBACvF,IAAI,CAAC,2BAA2B,CAAC,0BAA0B,GAAG,MAAM,EAAE,kBAAkB,CAAC,CAAC;gBAC1F,YAAY,IAAI,kBAAkB,CAAC,MAAM,CAAC;aAC7C;YAED,mCAAmC;YACnC,0BAA0B,GAAG,wBAAwB,GAAG,aAAa,CAAC;YACtE,yBAAyB,GAAG,uBAAuB,GAAG,aAAa,CAAC;YACpE,MAAM,IAAI,YAAY,CAAC;YAEvB,qEAAqE;YACrE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;gBACpC,IAAI,aAAa,GAAG,IAAI,CAAC,kBAAkB,CAAC,wBAAwB,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;gBACnF,IAAI,YAAY,GAAG,aAAa,CAAC,YAAY,CAAC,WAAW,CAAC,uBAAuB,GAAG,CAAC,CAAC,EACxC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;gBAEtE,8CAA8C;gBAC9C,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,YAAY,CAAC,EAAE;oBAC3C,qEAAqE;oBACrE,YAAY,CAAC,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,CAAC;oBAEpD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE;wBACjB,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,wBAAwB,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;qBACrE;yBAAM;wBACH,IAAI,oBAAoB,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;wBAClD,IAAI,oBAAoB,CAAC,CAAC,CAAC,GAAG,oBAAoB,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,wBAAwB,GAAG,CAAC,EAAE;4BAC3F,oBAAoB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;yBAC9C;6BAAM;4BACH,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,wBAAwB,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;yBACvE;qBACJ;iBACJ;aACJ;SACJ;QAED,oEAAoE;QACpE,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE;YACtC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;SACnC;QACD,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,iBAAiB,CAAC,gBAAgB;QAC9B,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,MAAM;QAClB,2DAA2D;QAC3D,OAAO,MAAM,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;OAOG;IACH,eAAe,CAAC,QAAQ;QACpB,IAAI,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC1B,IAAI,MAAM,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,YAAY,EAAE;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACJ;aAAM;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;aAClB;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;OAOG;IACH,iBAAiB,CAAC,gBAAgB;QAC9B,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,gBAAgB,EAAE,eAAe,EAAE,mBAAmB,EAAE,kBAAkB;QACnF,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/D,CAAC,gBAAgB,CAAC,MAAM,IAAI,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YAC/D,CAAC,gBAAgB,CAAC,MAAM;gBACpB,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;oBAC/B,CAAC,gBAAgB,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;wBACjC,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;4BAChC,CAAC,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC/D,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,uBAAuB,CAAC,CAAC;SAChD;QAED,IAAI,WAAW,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAE7C,IAAI,CAAC,gBAAgB,CAAC,MAAM;YACxB,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;YAC7B,qEAAqE;YACrE,IAAI,WAAW,GAAG,CAAC,EAAE;gBACjB,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBACjC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBAChC,IAAI,eAAe,GAAG;oBAClB,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;iBAC7B,CAAC;gBACF,IAAI,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;gBACrC,OAAO,eAAe,CAAC;aAC1B;iBAAM;gBACH,mDAAmD;gBACnD,OAAO,EAAE,CAAC;aACb;SACJ;QAED,IAAI,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAE7B,IAAI,QAAQ,CAAC,eAAe,CAAC,YAAY,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE;YAC5F,OAAO,IAAI,CAAC,8BAA8B,CAAC,gBAAgB,EAAE,eAAe,CAAC,CAAC;SACjF;aAAM;YACH,gFAAgF;YAEhF,wDAAwD;YACxD,IAAI,aAAa,GAAG;gBAChB,MAAM,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM;aAC3F,CAAC;YACF,IAAI,WAAW,GAAG,CAAC,EAAE;gBACjB,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;aAC7C;YAED,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACpB,IAAI,oBAAoB,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzD,IAAI,MAAM,GAAG,EAAE,CAAC;gBAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBAClD,IAAI,eAAe,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAC1D,oBAAoB,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;oBAC/D,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,eAAe,CAAC,YAAY,CAAC,oBAAoB,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,mBAAmB,EAAE,KAAK,CAAC,CAAC;oBACzF,MAAM,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;iBAChC;gBACD,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;gBAChD,IAAI,CAAC,qBAAqB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;aACzC;iBAAM;gBACH,+DAA+D;gBAC/D,IAAI,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,mBAAmB,EAAE,EAAE;oBACrE,qCAAqC;oBACrC,IAAI,MAAM,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBACxC,IAAI,cAAc,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnD,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;oBACxB,IAAI,CAAC,GAAG,CAAC,CAAC;oBACV,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,IAAI,IAAI,CAAC,OAAO,KAAK,QAAQ,EAAE;wBACvD,2EAA2E;wBAC3E,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;4BACtB,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE;gCACvG,MAAM;6BACT;yBACJ;qBACJ;yBAAM;wBACH,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;4BACtB,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,EAAE;gCACjC,MAAM;6BACT;yBACJ;qBACJ;oBACD,IAAI,CAAC,KAAK,GAAG,EAAE;wBACX,OAAO,EAAE,CAAC;qBACb;iBACJ;gBACD,2CAA2C;gBAC3C,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACrF;YAED,uCAAuC;YACvC,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAEnC,qEAAqE;YACrE,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YAEhC,OAAO,aAAa,CAAC;SACxB;IACL,CAAC;IAED,+BAA+B,CAAC,wBAAwB,EACpD,gBAAgB,EAChB,gCAAgC;QAChC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,wBAAwB,CAAC,MAAM,IAAI,wBAAwB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC/E,MAAM,CAAC,MAAM,GAAG,QAAQ,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC;SAC7D;QACD,qCAAqC;QACrC,IAAI,QAAQ,GAAG,IAAI,sBAAsB,CAAC,wBAAwB,CAAC,CAAC;QACpE,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,IAAI,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAClD,IAAI,EAAE,EAAE,YAAY,CAAC;QACrB,OAAO,CAAC,QAAQ,CAAC,KAAK,EAAE,IAAI,iBAAiB,GAAG,gBAAgB,EAAE;YAC9D,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE;gBACnB,EAAE,GAAG,QAAQ,CAAC,aAAa,CAAC;gBAC5B,YAAY,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC;aAC9C;iBAAM;gBACH,cAAc;gBACd,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;gBAC/C,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC;aACnC;YAED,IAAI,iBAAiB,GAAG,YAAY,EAAE;gBAClC,8CAA8C;gBAE9C,2EAA2E;gBAC3E,IAAI,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;oBACvE,oCAAoC;oBACpC,IAAI,UAAU,GAAG,SAAS,CAAC;oBAC3B,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;wBAC3C,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACrD,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,iBAAiB,GAAG,EAAE,CAAC,MAAM,EAAE;4BACxE,sCAAsC;yBACzC;6BAAM;4BACH,UAAU,GAAG,SAAS,CAAC;yBAC1B;qBACJ;oBAED,IAAI,UAAU,EAAE;wBACZ,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CACnE;4BACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAC/E,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CAAC,CAAC;qBACX;yBAAM;wBACH,mBAAmB;wBACnB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;4BAChB,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;yBACtB;wBACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,iBAAiB,GAAG,EAAE,CAAC,MAAM;4BACjD,CAAC,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CACjD;oCACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;oCAC/E,+BAA+B,EAAE,gCAAgC;iCACpE,CAAC,CAAC,CAAC,CAAC,CAAC;qBACb;oBACD,iBAAiB,EAAE,CAAC;oBACpB,0CAA0C;oBAC1C,OAAO,iBAAiB,GAAG,gBAAgB,IAAI,iBAAiB,GAAG,YAAY;wBAC3E,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE;wBACvE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAC3C,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,CAAC,CAAC,SAAS,CAChD;4BACI,WAAW,EAAE,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAC/E,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CACT,CAAC;wBACF,iBAAiB,EAAE,CAAC;qBACvB;iBACJ;qBAAM;oBACH,iBAAiB,EAAE,CAAC;iBACvB;aACJ;iBAAM,IAAI,iBAAiB,KAAK,YAAY,EAAE;gBAC3C,gBAAgB;gBAChB,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACjD,oDAAoD;oBACpD,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;qBAAM,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACxD,kCAAkC;oBAClC,IAAI,aAAa,GAAG,EAAE,CAAC,SAAS,CAAC;oBACjC,IAAI,SAAS,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;oBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;wBAC9C,4EAA4E;wBAC5E,2EAA2E;wBAC3E,gDAAgD;wBAChD,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE;4BAC5C,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;yBAC5C;wBACD,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,SAAS,CACjE;4BACI,WAAW,EAAE,KAAK,EAAE,mBAAmB,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB;4BAChF,+BAA+B,EAAE,gCAAgC;yBACpE,CAAC,CAAC,CAAC;qBACX;oBACD,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;wBAChB,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;qBACtB;oBACD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBAC9B,iBAAiB,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,0CAA0C;oBACxF,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;qBAAM,IAAI,EAAE,CAAC,IAAI,KAAK,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE;oBACxD,iCAAiC;oBACjC,6DAA6D;oBAC7D,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,oCAAoC;iBACxD;aACJ;SACJ;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED;;;;;;;;;;;;;;;;;OAiBG;IACH,UAAU,CAAC,YAAY,EAAE,oBAAoB,EACzC,gBAAgB,EAAE,gCAAgC;QAClD,IAAI,MAAM,GAAG,gCAAgC,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,oBAAoB,EAC5G,gBAAgB,EAAE,gCAAgC,CAAC,CAAC;QAExD,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,YAAY,EAAE;gBACd,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,gBAAgB,KAAK,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,CAAC;oBACpF,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,gBAAgB,EAC5E,gCAAgC,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,+BAA+B,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,gBAAgB,EAC1E,gCAAgC,CAAC,CAAC,CAAC;gBAE3C,OAAO,MAAM,CAAC;aACjB;iBAAM;gBACH,+CAA+C;gBAC/C,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;oBAChC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;oBACnB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;oBAC5B,2DAA2D;oBAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;wBACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,EACxF,gCAAgC,CAAC,CAAC,CAAC;qBAC1C;iBACJ;gBACD,OAAO,MAAM,CAAC;aACjB;SACJ;aAAM,IAAI,YAAY,EAAE;YACrB,OAAO,gBAAgB,KAAK,YAAY,CAAC,oBAAoB,CAAC,cAAc,CAAC,CAAC;gBAC1E,QAAQ,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;SAC/E;aAAM;YACH,+CAA+C;YAC/C,IAAI,IAAI,CAAC,mBAAmB,EAAE,GAAG,CAAC,EAAE;gBAChC,MAAM,CAAC,MAAM,GAAG,EAAE,CAAC;gBACnB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;oBACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9E;aACJ;YACD,OAAO,MAAM,CAAC;SACjB;IACL,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CAAC,MAAM,EAAE,UAAU,EAAE,QAAQ;QACrC,QAAQ,CAAC,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,aAAa,GAAG,IAAI,CAAC,SAAS,EAAE,GAAG,MAAM,CAAC,CAAC;QACzF,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,CAAC,oBAAoB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC/C;aAAM;YACH,IAAI,WAAW,GAAG,MAAM,GAAG,IAAI,CAAC;YAChC,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,MAAM,GAAG,EAAE,CAAC;YAChB,IAAI,IAAI,CAAC,SAAS,EAAE,KAAK,QAAQ,EAAE;gBAC/B,MAAM,GAAG,GAAG,CAAC;gBACb,MAAM,GAAG,GAAG,CAAC;aAChB;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,EAAE,CAAC,EAAE,EAAE;gBACjD,QAAQ,CAAC,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;aACnF;SACJ;QACD,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACH,oBAAoB,CAAC,MAAM,EAAE,QAAQ;QACjC,MAAM,IAAI,IAAI,CAAC;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC;iBACjF,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC;SACtD;IACL,CAAC;IAED;;;;OAIG;IACH,OAAO;QACH,IAAI,IAAI,GAAG;YACP,EAAE,EAAE,IAAI,CAAC,KAAK,EAAE;YAChB,OAAO,EAAE,IAAI,CAAC,QAAQ;YACtB,MAAM,EAAE,IAAI,CAAC,SAAS,EAAE;YACxB,UAAU,EAAE,IAAI,CAAC,WAAW;YAC5B,KAAK,EAAE,EAAE;SACZ,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;YACpB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjC,IAAI,CAAC,KAAK,CAAC,IAAI,CACX,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,uBAAuB,EAAE,YAAY,CAAC,oBAAoB,CAAC,KAAK,EAAE,CAAC,CAAC,OAAO,EAAE,CACnG,CAAC;aACL;SACJ;aAAM;YACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;SACjC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACH,aAAa,CAAC,iBAAiB;QAC3B,IAAI,iBAAiB,EAAE;YACnB,OAAO,IAAI,CAAC,OAAO,CAAC;SACvB;aAAM;YACH,OAAO,YAAY,CAAC,yBAAyB,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SACxE;IACL,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,SAAS;QACtB,yFAAyF;QACzF,uFAAuF;QACvF,IAAI,CAAC,aAAa,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QACvD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAChC,IAAI,OAAO,GAAG,QAAQ,CAAC,eAAe,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACvG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;SACvC;IACL,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACf,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACf,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACH,kBAAkB,CAAC,QAAQ;QACvB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,QAAQ,EAAE,QAAQ;QACjC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,qBAAqB,CAAC,WAAW;QAC7B,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,WAAW,EAAE,QAAQ;QACvC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IAED;;;;OAIG;IACH,qBAAqB,CAAC,WAAW,EAAE,SAAS;QACxC,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,WAAW,EAAE,QAAQ;QACpC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACH,SAAS;QACL,IAAI,KAAK,GAAG,gCAAgC,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE5E,IAAI,KAAK,KAAK,SAAS,EAAE;YACrB,OAAO,KAAK,CAAC;SAChB;aAAM;YACH,OAAO,IAAI,CAAC,MAAM,CAAC;SACtB;IACL,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACN,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IAC5B,CAAC;IACD,IAAI,MAAM,CAAC,GAAG;QACV,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IAC1C,CAAC;CACJ;AA7lDD,sCA6lDC;AAED,aAAa,CAAC,SAAS,CAAC,eAAe,GAAG,EAAE,CAAC;AAC7C,aAAa,CAAC,SAAS,CAAC,QAAQ,GAAG,OAAO,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n/**\n * @fileoverview Definition of the array property class\n */\nconst {\n    ArrayChangeSetIterator,\n    ChangeSet,\n    PathHelper,\n    TypeIdHelper,\n} = require('@fluid-experimental/property-changeset');\nconst { MSG } = require('@fluid-experimental/property-common').constants;\nconst { UniversalDataArray, ConsoleUtils } = require('@fluid-experimental/property-common');\nconst fastestJSONCopy = require('fastest-json-copy');\nconst _ = require('lodash');\nconst { deserializeNonPrimitiveArrayElements } = require('../containerSerializer');\nconst { validationsEnabled } = require('../enableValidations');\nconst { AbstractStaticCollectionProperty } = require('./abstractStaticCollectionProperty');\nconst { BaseProperty } = require('./baseProperty');\nconst { LazyLoadedProperties: Property } = require('./lazyLoadedProperties');\n\nconst deepCopy = fastestJSONCopy.copy;\n\nvar MODIFIED_STATE_FLAGS = BaseProperty.MODIFIED_STATE_FLAGS;\n\n// Some global constant objects that are used to indicate a few special\n// cases for the dirty object. If there are no entries in the pending and\n// dirty changesets, but the array still has a pending or dirty state\n// flag we use these objects to indicate this state. This happens for custom\n// type array, for which the children have been changed.\n// By using these special objects we avoid the memory overhead of having a separate\n// object for each array in this state.\nvar DIRTY_AND_PENDING_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.PENDING_CHANGE | MODIFIED_STATE_FLAGS.DIRTY,\n};\nvar PENDING_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.PENDING_CHANGE,\n};\nvar DIRTY_CHILD_CHANGES = {\n    pending: undefined,\n    dirty: undefined,\n    flags: MODIFIED_STATE_FLAGS.DIRTY,\n};\nvar DIRTY_STATE_FLAGS_ARRAY = [\n    undefined,\n    PENDING_CHILD_CHANGES,\n    DIRTY_CHILD_CHANGES,\n    DIRTY_AND_PENDING_CHILD_CHANGES,\n];\n\nvar PATH_TOKENS = BaseProperty.PATH_TOKENS;\n\n/**\n * Given a list of non-overlapping, unordered segments, each identified by its start point and length,\n * this function computes the longest monotone, increasing sub-sequence of segments.\n *\n * Currently, this is O(n^2) in the worst case, it could be implemented in O(n log n), but I would have\n * to implement a binary search tree for this. If this becomes a bottle-neck, we should replace\n * the insertions and binary searches below, with a search tree.\n *\n * @param {Array.<number>} in_segmentStarts  - The starting points of the segments\n * @param {Array.<number>} in_segmentLengths - The lengths of the segments\n *\n * @return {Array.<Number>} List of the selected segments, given as indices of the segments\n * @private\n */\nvar _getLongestIncreasingSubsequenceSegments = function(in_segmentStarts, in_segmentLengths) {\n    if (in_segmentStarts.length === 0) {\n        return [];\n    }\n\n    // Contains the already found sub sequences, sorted by their length\n    // in increasing order. These sub-sequences have the invariant that\n    // the last entry in each of the sequences is smaller than the last\n    // entry in longer sequences (so the list is also sorted according to\n    // the sequenceLastEntry member of the structs)\n    var foundSubSequences = [];\n\n    for (var i = 0; i < in_segmentStarts.length; i++) {\n        var currentSegmentStart = in_segmentStarts[i];\n\n        // Perform a binary search to find the largest entry in the list of found sub\n        // sequences that has a sequenceEnd that is smaller or equal than currentSegmentStart\n        var index = _.sortedIndexBy(foundSubSequences, { sequenceLastEntry: currentSegmentStart }, 'sequenceLastEntry');\n        var lastEntry = index > 0 ? foundSubSequences[index - 1] : undefined;\n\n        // Create a new entry that is obtained by concatenating the longest sequence found so far\n        // with the new segment\n        var newEntry = {\n            sequenceLength: in_segmentLengths[i] + (lastEntry ? lastEntry.sequenceLength : 0),\n            segmentIndex: i,\n            sequenceLastEntry: currentSegmentStart + in_segmentLengths[i] - 1,\n            previousEntry: lastEntry,\n        };\n\n        // Search for the insertion position for this entry\n        var insertionPoint = _.sortedIndexBy(foundSubSequences, newEntry, 'sequenceLength');\n        if (foundSubSequences[insertionPoint] !== undefined &&\n            foundSubSequences[insertionPoint].sequenceLength === newEntry.sequenceLength) {\n            insertionPoint++;\n        }\n\n        // We have to delete all entries from the foundSubSequences array, which\n        // are shorter, but have a higher sequenceLastEntry (we can do that, since\n        // it would be a better choice to use the new entry instead of these old\n        // entries). This will preserve the invariant on the foundSubSequences\n        // that they are sorted with respect to the sequenceLastEntry.\n        var lowerLengthBoundary = newEntry.sequenceLength - in_segmentLengths[i];\n\n        var j = insertionPoint - 1;\n        for (; j >= 0 && foundSubSequences[j].sequenceLength > lowerLengthBoundary; j--) {\n            if (foundSubSequences[j].sequenceLastEntry >= newEntry.sequenceLastEntry) {\n                foundSubSequences.splice(j, 1);\n                insertionPoint--;\n            }\n        }\n\n        // Insert the entry as a new entry into the list of subsequences\n        foundSubSequences.splice(insertionPoint, 0, newEntry); // TODO: this should be done via a binary tree\n    }\n\n    // This should always be the case, as we checked for empty inputs above\n    ConsoleUtils.assert(foundSubSequences.length > 0);\n\n    // Extract the result\n    var longestSequence = [];\n    var currentSegment = _.last(foundSubSequences);\n    while (currentSegment) {\n        longestSequence.unshift(currentSegment.segmentIndex);\n        currentSegment = currentSegment.previousEntry;\n    }\n\n    return longestSequence;\n};\n\nexport class ArrayProperty extends AbstractStaticCollectionProperty {\n    /**\n     * Default constructor for ArrayProperty\n     * @param {Object} [in_params] - the parameters\n     * @param {Number} [in_params.length = 0] the length of the array, if applicable\n     * @param {string} [in_scope] - The scope in which the property typeid is defined\n     * @protected\n     */\n    constructor(in_params, in_scope) {\n        super(in_params);\n        var length = in_params.size || in_params.length || 0;\n\n        // changesets\n        this._dirty = undefined;\n\n        // We only need the scope for custom type array properties\n        if (!this._isPrimitive) {\n            this._scope = in_scope;\n        }\n\n        this._dataArrayCreate(length);\n    }\n\n    /**\n     * Returns the path segment for a child\n     *\n     * @param {property-properties.BaseProperty} in_childNode - The child for which the path is returned\n     *\n     * @return {string|undefined} The path segment to resolve the child property under this property\n     * @protected\n     */\n    _getPathSegmentForChildNode(in_childNode) {\n        var index = this._dataArrayGetBuffer().indexOf(in_childNode);\n        if (index === -1) {\n            throw new Error(MSG.GET_PATH_SEGMENT_CALLED_FOR_NON_ENTRY);\n        }\n\n        return '[' + index + ']';\n    }\n\n    /**\n     * Resolves a direct child node based on the given path segment\n     *\n     * @param {String} in_segment                                   - The path segment to resolve\n     * @param {property-properties.PathHelper.TOKEN_TYPES} in_segmentType - The type of segment in the tokenized path\n     *\n     * @return {property-properties.BaseProperty|undefined} The child property that has been resolved\n     * @protected\n     */\n    _resolvePathSegment(in_segment, in_segmentType) {\n        // Base Properties only support paths separated via dots\n        if (in_segmentType === PathHelper.TOKEN_TYPES.ARRAY_TOKEN) {\n            var index = Math.floor(in_segment);\n\n            // Specifying a non-integer index is regarded a mal-formed path and thus throws an exception\n            if (!isFinite(index)) {\n                // eslint-disable-next-line unicorn/prefer-type-error\n                throw new Error(MSG.INVALID_NON_NUMERIC_SEGMENT_IN_PATH + in_segment);\n            }\n\n            // Accessing an entry outside of the array is just a non existing property and thus\n            // returns undefined\n            if (index < 0 || index >= this._dataArrayGetLength()) {\n                return undefined;\n            }\n            return this._dataArrayGetValue(index);\n        } else {\n            return AbstractStaticCollectionProperty.prototype._resolvePathSegment.call(this, in_segment, in_segmentType);\n        }\n    }\n\n    /**\n     * Insert into the array at a given position.\n     * It will not overwrite the existing values, it will push them to the right.\n     * @param {number} in_position target index\n     * @param {*} in_value inserted value or property\n     * @throws if in_position is smaller than zero, larger than the length of the array or not a number.\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to modify a referenced property.\n     * @throws if trying to insert a property that is a root property\n     */\n    insert(in_position, in_value) {\n        this.insertRange(in_position, [in_value]);\n    }\n\n    /**\n     * Is this property a leaf node with regard to flattening?\n     *\n     * TODO: Which semantics should flattening have? It stops at primitive types and collections?\n     *\n     * @return {boolean} True if it is a leaf with regard to flattening?\n     */\n    _isFlattenLeaf() {\n        return true;\n    }\n\n    /**\n     * Add one or more values at the end of the array\n     * @param {Array<property-properties.BaseProperty>|property-properties.BaseProperty|*|Array<*>} in_values\n     * the item or items to be pushed (either properties or values). If an array is passed, .push\n     *  will be called on each item in the array.\n     * @throws if trying to push a property that is a root property\n     * @return {number} new length of the array\n     */\n    push(in_values) {\n        if (_.isArray(in_values)) {\n            this.insertRange(this._dataArrayGetLength(), in_values);\n        } else {\n            this.insertRange(this._dataArrayGetLength(), [in_values]);\n        }\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * Add elements to the end of the queue (array)\n     */\n    enqueue(...args) {\n        return this.push(...args);\n    }\n\n    /**\n     * Add a value at the front of the array or letters to the beginning of a string (for StringProperty)\n     * It can also add multiple values to an array if you pass in an array of values.\n     * @param {Array<*>|*|Array<property-properties.BaseProperty>|property-properties.BaseProperty} in_values the values\n     * or properties to be pushed\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to insert a root property\n     * @throws if trying to modify a referenced property.\n     * @return {number} new length of the array\n     */\n    unshift(in_values) {\n        if (_.isArray(in_values)) {\n            this.insertRange(0, in_values);\n        } else {\n            this.insertRange(0, [in_values]);\n        }\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * Removes an element of the array (or a letter in a StringProperty) and shifts remaining elements to the left\n     * E.g. [1, 2, 3]   .remove(1) => [1, 3]\n     * E.g. (StringProperty) 'ABCDE'  .remove(1) => 'ACDE'\n     * @param {number} in_position the index that will be removed\n     * @throws if in_position is not a number\n     * @throws if trying to remove something that does not exist\n     * @throws if trying to remove an item with a parent\n     * @return {property-properties.BaseProperty | * } the value that was removed.\n     */\n    remove(in_position) {\n        var value = this.get(in_position);\n        this.removeRange(in_position, 1);\n        return value;\n    }\n\n    /**\n     * Removes the last element of the array or the last letter of a string (for StringProperty)\n     * @throws if trying to modify a referenced property\n     * @return {property-properties.BaseProperty|*} deleted element.\n     */\n    pop() {\n        if (this._dataArrayGetLength() > 0) {\n            var item = this.get(this._dataArrayGetLength() - 1,\n                { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n            this.remove(this._dataArrayGetLength() - 1);\n            return item;\n        } else {\n            return undefined;\n        }\n    }\n\n    /**\n     * Removes an element from the front of the array or a letter from the beginning of a string (for StringProperty)\n     * @return {*|property-properties.BaseProperty} the element removed.\n     */\n    shift() {\n        if (this._dataArrayGetLength() > 0) {\n            var item = this.get(0, { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n            this.remove(0);\n            return item;\n        } else {\n            return undefined;\n        }\n    }\n\n    /**\n     * Removes elements from the front of the queue (array)\n     */\n    dequeue() {\n        return this.shift();\n    }\n\n    /**\n     * Change an existing element of the array. This will overwrite an existing element.\n     * E.g. [1, 2, 3]  .set(1, 8) => [1, 8, 3]\n     * @param {number} in_position the target index\n     * @param {*} in_value the new property or value\n     * @throws if in_position is not a number\n     * @throws if in_position is smaller than zero\n     */\n    set(in_position, in_value) {\n        if (_.isArray(in_value)) {\n            throw new TypeError(MSG.ARRAY_SET_ONE_ELEMENT + in_value);\n        }\n        this.setRange(in_position, [in_value]);\n    }\n\n    /**\n     * Sets the values of items in the array.\n     * If values are typed, iterates through the values and creates a property with the defined type and value.\n     *\n     * See {@link ArrayProperty.setValues}\n     *\n     * @param {Array<*>} in_values  - The list of typed values.\n     * @param {Bool} in_typed  - Whether the values are typed/polymorphic.\n     * @param {Bool} in_initial  - Whether we are setting default/initial values\n     *   or if the function is called directly with the values to set.\n     * @protected\n     * @override\n     */\n    _setValues(in_values, in_typed, in_initial) {\n        if (in_typed) {\n            if (!this._isPrimitive) {\n                ConsoleUtils.assert(_.isArray(in_values), MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty._setValues');\n\n                var arr = [];\n                for (var i = 0; i < in_values.length; i++) {\n                    var prop = in_values[i];\n\n                    if (in_values[i] instanceof BaseProperty) {\n                        prop = in_values[i];\n                    } else {\n                        prop = Property.PropertyFactory._createProperty(\n                            in_values[i].typeid || this._typeid, null, in_values[i].value, this._getScope());\n                    }\n                    arr.push(prop);\n                }\n\n                this._setValuesInternal(arr);\n            } else {\n                AbstractStaticCollectionProperty.prototype._setValues.call(this, in_values, in_typed, in_initial);\n            }\n        } else {\n            this._setValuesInternal(in_values);\n        }\n    }\n\n    /**\n     * See {@link ArrayProperty.setValues}\n     *\n     * @param {Array<*>|Object} in_values an array or object containing the values to be set.\n     */\n    _setValuesInternal(in_values) {\n        this._checkIsNotReadOnly(true);\n\n        if (!this._isPrimitive) {\n            if (_.isArray(in_values)) {\n                this.clear();\n                this.insertRange(0, in_values);\n            } else {\n                AbstractStaticCollectionProperty.prototype.setValues.call(this, in_values);\n            }\n        } else {\n            if (_.isArray(in_values) && in_values.length < this._dataArrayGetLength()) {\n                this.removeRange(in_values.length, this._dataArrayGetLength() - in_values.length);\n            }\n\n            var that = this;\n            var maxIndex = this._dataArrayGetLength() - 1;\n            _.each(in_values, function(value, index) {\n                if (index > maxIndex) {\n                    that.insert(index, value);\n                } else {\n                    if (that._dataArrayGetValue(index) !== value) {\n                        that.set(index, value);\n                    }\n                }\n            });\n        }\n    }\n\n    /**\n     * Sets the values of items in the array.\n     * If called using an array (e.g. setValues([prop1, prop2])), it will overwrite the whole array.\n     * If called using an object with indexes (e.g. setValues{0: prop1}), it will only overwrite the\n     * items at those indexes.\n     * For arrays of Properties, this can be used to set nested values in properties found in the array.\n     * For example: setValues({0: {position: {x: 2, y:3}}});\n     * @param {Array<*>|Object} in_values an array or object containing the values to be set.\n     * @throws if one of the path in in_values does not correspond to a path in the property\n     */\n    setValues(in_values) {\n        var checkoutView = this._getCheckoutView();\n        if (checkoutView !== undefined) {\n            checkoutView.pushNotificationDelayScope();\n            ArrayProperty.prototype._setValues.call(this, in_values, false, false);\n            checkoutView.popNotificationDelayScope();\n        } else {\n            ArrayProperty.prototype._setValues.call(this, in_values, false, false);\n        }\n    }\n\n    /**\n     * Deletes all values from an array\n     */\n    clear() {\n        if (this.getLength()) {\n            this.removeRange(0, this.getLength());\n        }\n    }\n\n    /**\n     * @return {Array<*> | String} all values in the ArrayProperty\n     * If called on StringProperty, it returns the whole string\n     * WARNING: the returned array must be read only, data written to it\n     * will get lost.\n     */\n    getEntriesReadOnly() {\n        return this._dataArrayGetBuffer();\n    }\n\n    /**\n     * Private helper function to update the internal dirty and pending changes\n     * is overwritten by StringProperty\n     *\n     * @param {property-properties.SerializedChangeSet} in_changeSet - The changeset to apply\n     * @private\n     */\n    _updateChanges(in_changeSet) {\n        var pendingChanges = this._getPendingChanges();\n        ChangeSet.prototype._performApplyAfterOnPropertyArray(pendingChanges,\n            in_changeSet, this.getFullTypeid(true));\n\n        var dirtyChanges = this._getDirtyChanges();\n        ChangeSet.prototype._performApplyAfterOnPropertyArray(dirtyChanges,\n            in_changeSet, this.getFullTypeid(true));\n\n        this._setChanges(pendingChanges, dirtyChanges);\n    }\n\n    /**\n     * Returns the pending changeset for this object\n     * @return {property-properties.SerializedChangeSet} The pending changes\n     */\n    _getPendingChanges() {\n        return (this._dirty && this._dirty.pending) || {};\n    }\n\n    /**\n     * Returns the dirty changeset for this object\n     * @return {property-properties.SerializedChangeSet} The dirty changes\n     */\n    _getDirtyChanges() {\n        return (this._dirty && this._dirty.dirty) || {};\n    }\n\n    /**\n     * Sets the pending and dirty changesets\n     *\n     * @param {property-properties.SerializedChangeSet|undefined|null} in_pending\n     *     The pending changeset. If null is passed, no change will be\n     *     applied. undefined indicates that the changes should be reset\n     * @param {property-properties.SerializedChangeSet|undefined|null} in_dirty\n     *     The dirty changeset. If null is passed, no change will be\n     *     applied. undefined indicates that the changes should be reset\n     */\n    _setChanges(in_pending, in_dirty) {\n        var oldFlags = this._dirty ? this._dirty.flags : 0;\n\n        if (this._dirty &&\n            this._dirty === DIRTY_STATE_FLAGS_ARRAY[this._dirty.flags]) {\n            this._dirty = undefined;\n        }\n\n        if (in_pending !== null) {\n            if (!_.isEmpty(in_pending)) {\n                this._dirty = this._dirty || {};\n                this._dirty.pending = in_pending;\n            } else if (this._dirty) {\n                this._dirty.pending = undefined;\n            }\n        }\n\n        if (in_dirty !== null) {\n            if (!_.isEmpty(in_dirty)) {\n                this._dirty = this._dirty || {};\n                this._dirty.dirty = in_dirty;\n            } else if (this._dirty) {\n                this._dirty.dirty = undefined;\n            }\n        }\n\n        if (this._dirty) {\n            if (this._dirty.dirty === undefined &&\n                this._dirty.pending === undefined) {\n                if (oldFlags === 0) {\n                    this._dirty = undefined;\n                } else {\n                    this._dirty = DIRTY_STATE_FLAGS_ARRAY[oldFlags];\n                }\n            } else {\n                this._dirty.flags = oldFlags;\n            }\n        } else if (oldFlags) {\n            this._dirty = DIRTY_STATE_FLAGS_ARRAY[oldFlags];\n        }\n    }\n\n    /**\n     * Sets the dirty flags for this property\n     * @param {Number} in_flags The dirty flags\n     */\n    _setDirtyFlags(in_flags) {\n        if (this._dirty) {\n            if (this._dirty !== DIRTY_STATE_FLAGS_ARRAY[this._dirty.flags]) {\n                this._dirty.flags = in_flags;\n\n                if (this._dirty.dirty === undefined &&\n                    this._dirty.pending === undefined &&\n                    (this._dirty.flags === 0 || this._dirty.flags === undefined)) {\n                    this._dirty = undefined;\n                }\n            } else {\n                this._dirty = DIRTY_STATE_FLAGS_ARRAY[in_flags];\n            }\n        } else {\n            this._dirty = DIRTY_STATE_FLAGS_ARRAY[in_flags];\n        }\n    }\n\n    /**\n     * Gets the dirty flags for this property\n     * @return {Number} The dirty flags\n     */\n    _getDirtyFlags() {\n        if (this._dirty === undefined) {\n            return 0;\n        }\n\n        return this._dirty.flags;\n    }\n\n    /**\n     * Inserts the content of a given array into the array property\n     * It will not overwrite the existing values but push them to the right instead.\n     * E.g. [1, 2, 3] .insertRange(1, [9, 8]) => [1, 9, 8, 2, 3]\n     * @param {number} in_offset target index\n     * @param {Array<*>} in_array the array to be inserted\n     * @throws if in_offset is smaller than zero, larger than the length of the array or not a number.\n     * @throws if trying to insert a property that already has a parent.\n     * @throws if trying to modify a referenced property.\n     * @throws if trying to insert a property that is not an array.\n     * @throws if trying to insert a root property.\n     */\n    insertRange(in_offset, in_array) {\n        if (!_.isArray(in_array)) {\n            throw new TypeError(MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty.insertRange');\n        }\n\n        if (validationsEnabled.enabled) {\n            for (var i = 0; i < in_array.length; i++) {\n                if (in_array[i] instanceof BaseProperty) {\n                    in_array[i]._validateInsertIn(this);\n                }\n            }\n            this._checkIsNotReadOnly(true);\n        }\n        this._insertRangeWithoutDirtying(in_offset, in_array);\n        this._setDirty();\n    }\n\n    /**\n     * inserts the content of a given array, but doesn't dirty the property\n     * this is useful for batch changes\n     * @param {number} in_offset target index\n     * @param {Array<*>} in_array the array to be inserted\n     * @param {Boolean=} [in_setParents=true] If true, set parent of inserted properties.\n     *                   If false, caller has already set parents.\n     * @private\n     */\n    _insertRangeWithoutDirtying(in_offset, in_array, in_setParents) {\n        if (in_setParents === undefined) {\n            in_setParents = true;\n        }\n        if (in_offset < 0 || in_offset > this.length || !_.isNumber(in_offset)) {\n            throw Error(MSG.START_OFFSET_INVALID + in_offset);\n        }\n        if (in_setParents && !this._isPrimitive) {\n            var arr = [];\n            for (var i = 0; i < in_array.length; ++i) {\n                var prop = in_array[i];\n                if (!(in_array[i] instanceof BaseProperty)) {\n                    prop = Property.PropertyFactory._createProperty(this._typeid, null, in_array[i], this._getScope());\n                }\n\n                if (prop.getParent()) {\n                    throw new Error(MSG.NO_INSERT_WITH_PARENT);\n                } else {\n                    prop._setParent(this);\n                }\n                arr.push(prop);\n            }\n\n            in_array = arr;\n        }\n        this._dataArrayInsertRange(in_offset, in_array);\n\n        // Insert entry into changesets\n        var changeSet = {\n            'insert': [[in_offset, this._serializeArray(in_array)]],\n        };\n        this._updateChanges(changeSet);\n    }\n\n    /**\n     * Removes a given number of elements from the array property (or given number of letters from a StringProperty)\n     *  and shifts remaining values to the left.\n     * E.g. [1, 2, 3, 4, 5]  .removeRange(1, 3) => [1, 5]\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @throws if in_offset is not a number\n     * @throws if in_deleteCount is not a number\n     * @throws if trying to remove an item with a parent\n     * @throws if in_offset is smaller than zero or if in_offset + in_delete count is larger than the length of the array\n     * @return {Array<*>| Array<property-properties.BaseProperty>} an array containing the values or\n     *  properties removed.\n     */\n    removeRange(in_offset, in_deleteCount) {\n        ConsoleUtils.assert(_.isNumber(in_offset), MSG.NOT_NUMBER +\n            'in_offset, method: ArrayProperty.removeRange or .remove');\n        ConsoleUtils.assert(_.isNumber(in_deleteCount),\n            MSG.NOT_NUMBER + 'in_deleteCount, method: ArrayProperty.removeRange or .remove');\n        ConsoleUtils.assert(in_offset + in_deleteCount < this.length + 1 && in_offset >= 0 && in_deleteCount > 0,\n            MSG.REMOVE_OUT_OF_BOUNDS + 'Cannot remove ' + in_deleteCount + ' items starting at index ' + in_offset);\n        var result = [];\n        for (var i = in_offset; i < in_offset + in_deleteCount; i++) {\n            result.push(this.get(i));\n        }\n        this._checkIsNotReadOnly(true);\n        this._removeRangeWithoutDirtying(in_offset, in_deleteCount);\n        this._setDirty();\n        return result;\n    }\n\n    /**\n     * removes a given number of elements from the array property, and ensures, if this is not\n     * a primitive array, that any existing properties have their parent pointer cleared.\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @private\n     */\n    _clearRange(in_offset, in_deleteCount) {\n        if (!this._isPrimitive) {\n            for (var i = 0; i < in_deleteCount; ++i) {\n                if (this._dataArrayGetValue(in_offset + i).getParent() !== this) {\n                    throw new Error(MSG.CANNOT_REMOVE_WITH_DIFFERENT_PARENT);\n                } else {\n                    this._dataArrayGetValue(in_offset + i)._setParent(undefined);\n                }\n            }\n        }\n\n        this._dataArrayRemoveRange(in_offset, in_deleteCount);\n    }\n\n    /**\n     * removes a given number of elements from the array property, but doesn't dirty the property\n     * this is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {number} in_deleteCount number of elements to be deleted\n     * @private\n     */\n    _removeRangeWithoutDirtying(in_offset, in_deleteCount) {\n        this._clearRange(in_offset, in_deleteCount);\n\n        // Insert entry into changesets\n        var changeSet = {\n            'remove': [[in_offset, in_deleteCount]],\n        };\n        this._updateChanges(changeSet);\n    }\n\n    /**\n     * Sets the array properties elements to the content of the given array\n     * All changed elements must already exist. This will overwrite existing elements.\n     * E.g. [1, 2, 3, 4, 5]  .setRange(1, [7, 8]) => [1, 7, 8, 4, 5]\n     * @param {number} in_offset target start index\n     * @param {Array<*>|Array<property-properties.BaseProperty>} in_array contains the elements to be set\n     * @throws if in_offset is not a number\n     * @throws if in_offset is smaller than zero or higher than the length of the array\n     */\n    setRange(in_offset, in_array) {\n        if (!_.isArray(in_array) && !_.isString(in_array)) {\n            throw new TypeError(MSG.IN_ARRAY_NOT_ARRAY + 'ArrayProperty.setRange');\n        }\n        in_offset = Math.floor(in_offset);\n        if (!isFinite(in_offset)) {\n            // eslint-disable-next-line unicorn/prefer-type-error\n            throw new Error(MSG.NOT_NUMBER + 'in_offset, method: ArrayProperty.setRange or .set');\n        }\n        ConsoleUtils.assert(in_offset >= -1 && (in_offset + in_array.length) <= this.getLength(),\n            MSG.SET_OUT_OF_BOUNDS + 'Cannot set ' + in_array.length + ' items starting at index ' + in_offset +\n            '. Array length: ' + this.getLength());\n        this._checkIsNotReadOnly(true);\n        this._setRangeWithoutDirtying(in_offset, in_array);\n        this._setDirty();\n    }\n\n    /**\n     * sets the array properties elements to the content of the given array\n     * all changed elements must already exist. This version doesn't dirty the property,\n     * which is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {Array<*>} in_array contains the elements to be set\n     */\n    _setRangeWithoutDirtying(in_offset, in_array) {\n        this._modifyRangeWithoutDirtying(in_offset, in_array);\n    }\n\n    /**\n     * sets the array properties elements to the content of the given array\n     * all changed elements must already exist. This version doesn't dirty the property,\n     * which is useful for batch changes\n     * @param {number} in_offset target start index\n     * @param {Array<*>} in_array contains the elements to be set\n     */\n    _modifyRangeWithoutDirtying(in_offset, in_array) {\n        // Has to be overloaded for arrays of properties!\n        if (in_offset < 0) {\n            throw Error(MSG.START_OFFSET_NEGATIVE + in_offset);\n        }\n        var changeSet = {};\n        var changeArray = [];\n\n        if (!this._isPrimitive) {\n            // for custom array properties, we have to do a remove/insert instead:\n            this._removeRangeWithoutDirtying(in_offset, in_array.length);\n            this._insertRangeWithoutDirtying(in_offset, in_array);\n        } else {\n            // does the reference array property not have a _dataArrayRef ??\n            // go through all the elements of in_array to check if the content of the given array\n            // is same as value of the array properties. If the values are same, we don't change it.\n            // Otherwise, we set them and generate corresponding changeset.\n            var j;\n            for (var i = 0; i < in_array.length; i++) {\n                if (this._dataArrayGetValue(in_offset + i) !== in_array[i]) {\n                    for (j = i + 1; j < in_array.length; j++) {\n                        if (this._dataArrayGetValue(in_offset + j) === in_array[j]) {\n                            break;\n                        }\n                    }\n                    this._dataArraySetRange(in_offset + i, in_array.slice(i, j));\n                    changeArray.push([in_offset + i, this._serializeArray(in_array.slice(i, j))]);\n                    i = j;\n                }\n            }\n            changeSet['modify'] = changeArray;\n            this._updateChanges(changeSet);\n        }\n    }\n\n    /**\n     * Returns the name of all the sub-properties of this property.\n     * Numerical indexes from the array will be returned as strings.\n     * E.g. ['0', '1', '2']\n     *\n     * @return {Array.<string>} An array of all the property ids\n     */\n    getIds() {\n        return Object.keys(this._dataArrayGetBuffer());\n    }\n\n    /**\n     * Checks whether a property or data exists at the given position.\n     *\n     * @param {string} in_position - index of the property\n     * @return {boolean} True if the property or data exists. Otherwise false.\n     */\n    has(in_position) {\n        return this._dataArrayGetBuffer()[in_position] !== undefined;\n    }\n\n    /**\n     * Gets the array element at a given index\n     * @param {number | array<string|number>} in_position the target index\n     * if an array is passed, elements in the array will be treated as part of a path.\n     * The first item in an array should be a position in the array.\n     * For example, .get([0,'position','x']) is the equivalent of .get(0).get('position').get('x')\n     * If it encounters a ReferenceProperty, .get will, by default, resolve the property it refers to.\n     * @param {Object} in_options - parameter object\n     * @param {property-properties.BaseProperty.REFERENCE_RESOLUTION} [in_options.referenceResolutionMode=ALWAYS]\n     *     How should this function behave during reference resolution?\n     * @throws if in_position is an array and the first item in the array is not a number\n     * @throws if in_position is neither an array nor a number.\n     * @throws if in_position is smaller than zero or larger than the length of the array.\n     * @return {* | property-properties.BaseProperty | undefined} the element at that index - either a property or a value.\n     * or undefined if nothing was found.\n     */\n    get(in_position, in_options) {\n        in_options = in_options || {};\n        in_options.referenceResolutionMode =\n            in_options.referenceResolutionMode === undefined ? BaseProperty.REFERENCE_RESOLUTION.ALWAYS :\n                in_options.referenceResolutionMode;\n        var prop = this;\n        if (_.isArray(in_position)) {\n            var iterationStart = 0;\n            var prop = this;\n            if (in_position[0] === PATH_TOKENS.UP) {\n                prop = prop.getParent();\n                iterationStart = 1;\n            } else if (in_position[0] === PATH_TOKENS.ROOT) {\n                prop = prop.getRoot();\n                iterationStart = 1;\n            } else {\n                var pos = Math.floor(in_position[0]);\n                ConsoleUtils.assert(isFinite(pos), MSG.FIRST_ITEM_MUST_BE_NUMBER);\n                var mode = in_options.referenceResolutionMode;\n                ConsoleUtils.assert(pos >= 0 && pos < this.getLength(),\n                    MSG.GET_OUT_OF_RANGE + in_position[0]);\n            }\n            for (var i = iterationStart; i < in_position.length && prop; i++) {\n                if (in_options.referenceResolutionMode === BaseProperty.REFERENCE_RESOLUTION.NO_LEAFS) {\n                    mode = i !== in_position.length - 1 ? BaseProperty.REFERENCE_RESOLUTION.ALWAYS :\n                        BaseProperty.REFERENCE_RESOLUTION.NEVER;\n                }\n                if (in_position[i + 1] === PATH_TOKENS.REF) {\n                    mode = BaseProperty.REFERENCE_RESOLUTION.NEVER;\n                }\n                prop = prop.get(in_position[i], { referenceResolutionMode: mode });\n                if (prop === undefined && i < in_position.length - 1) {\n                    return undefined;\n                }\n            }\n            return prop;\n        }\n\n        if (in_position === PATH_TOKENS.ROOT) {\n            return prop.getRoot();\n        } else if (in_position === PATH_TOKENS.UP) {\n            return prop.getParent();\n        } else if (in_position === PATH_TOKENS.REF) {\n            throw new Error(MSG.NO_GET_DEREFERENCE_ONLY);\n        } else {\n            var pos = Math.floor(in_position);\n            ConsoleUtils.assert(isFinite(pos), MSG.IN_POSITION_MUST_BE_NUMBER);\n            var result = this._dataArrayGetValue(pos);\n            if (in_options.referenceResolutionMode === BaseProperty.REFERENCE_RESOLUTION.ALWAYS) {\n                if (result instanceof Property.ReferenceProperty) {\n                    result = result.ref;\n                }\n            }\n            return result;\n        }\n    }\n\n    /**\n     * Returns an object with all the nested values contained in this property\n     * @return {array<object> | array<*>} an array of objects or values representing the values of your property\n     * for example: [\n     * {\n     *   position: {\n     *    x: 2,\n     *    y: 5\n     *   }\n     * },\n     * {\n     *   position: {\n     *    x: 1,\n     *    y: -8\n     *  }\n     * }]\n     * or for a Value Array: [1, 3, 6]\n     */\n    getValues() {\n        var result = [];\n        var ids = this.getIds();\n        for (var i = 0; i < ids.length; i++) {\n            var child = this.get(ids[i]);\n            result.push(child.getValues());\n        }\n        return result;\n    }\n\n    /**\n     * @return {Number} the current length of the array\n     */\n    getLength() {\n        return this._dataArrayGetLength();\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _applyChangeset(in_changeSet, in_reportToView) {\n        this._checkIsNotReadOnly(false);\n\n        // Iterator to process the changes in the ChangeSet in the correct order\n        var arrayIterator = new ArrayChangeSetIterator(in_changeSet);\n\n        if (!this._isPrimitive) {\n            // Successively apply the changes from the changeSet\n            while (!arrayIterator.atEnd()) {\n                switch (arrayIterator.opDescription.type) {\n                    case ArrayChangeSetIterator.types.INSERT:\n                        // Handle inserts\n                        var propertyDescriptions = arrayIterator.opDescription.operation[1];\n                        var insertedPropertyInstances = [];\n                        var scope = this._getScope();\n                        for (var i = 0; i < propertyDescriptions.length; ++i) {\n                            var createdProperty = Property.PropertyFactory._createProperty(\n                                propertyDescriptions[i]['typeid'], null, undefined, scope);\n                            // Set parent so scope is defined for deserialization\n                            createdProperty._setParent(this);\n                            createdProperty._deserialize(propertyDescriptions[i], false);\n                            insertedPropertyInstances.push(createdProperty);\n                        }\n                        this._insertRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(insertedPropertyInstances), false);\n                        break;\n                    case ArrayChangeSetIterator.types.REMOVE:\n                        // Handle removes\n                        var numRemoved = arrayIterator.opDescription.operation[1];\n                        if (!_.isNumber(numRemoved)) {\n                            numRemoved = numRemoved.length;\n                        }\n                        this._removeRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset, numRemoved);\n                        break;\n                    case ArrayChangeSetIterator.types.MODIFY:\n                        // Handle modifies\n                        var propertyDescriptions = arrayIterator.opDescription.operation[1];\n                        var startIndex = arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset;\n                        for (var i = 0; i < propertyDescriptions.length; ++i) {\n                            var modifiedProperty = this.get(startIndex + i,\n                                { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER });\n                            if (!modifiedProperty) {\n                                throw new Error(MSG.INDEX_INVALID + (startIndex + i));\n                            }\n                            modifiedProperty._applyChangeset(propertyDescriptions[i], false);\n                        }\n                        break;\n                    default:\n                        console.error('applyChangeset: ' + MSG.UNKNOWN_OPERATION + arrayIterator.opDescription.type);\n                }\n                arrayIterator.next();\n            }\n        } else {\n            // Successively apply the changes from the changeSet\n            while (!arrayIterator.atEnd()) {\n                switch (arrayIterator.opDescription.type) {\n                    case ArrayChangeSetIterator.types.INSERT:\n                        // Handle inserts\n                        this._insertRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(arrayIterator.opDescription.operation[1]));\n                        break;\n                    case ArrayChangeSetIterator.types.REMOVE:\n                        // Handle removes\n                        var removeLength = arrayIterator.opDescription.operation[1];\n                        if (_.isArray(removeLength) || _.isString(removeLength)) {\n                            removeLength = removeLength.length;\n                        }\n\n                        this._removeRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset, removeLength);\n                        break;\n                    case ArrayChangeSetIterator.types.MODIFY:\n                        // Handle modifies\n                        this._modifyRangeWithoutDirtying(arrayIterator.opDescription.operation[0] + arrayIterator.opDescription.offset,\n                            this._deserializeArray(arrayIterator.opDescription.operation[1]));\n                        break;\n                    default:\n                        console.error('applyChangeset: ' + MSG.UNKNOWN_OPERATION + arrayIterator.opDescription.type);\n                }\n                arrayIterator.next();\n            }\n        }\n\n        // Finally mark the property as dirty (we postponed this in the previous operations to prevent multiple triggering\n        // of dirtying events)\n        this._setDirty(in_reportToView);\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _reapplyDirtyFlags(in_pendingChangeSet, in_dirtyChangeSet) {\n        this._checkIsNotReadOnly(false);\n\n        this._setChanges(in_pendingChangeSet, in_dirtyChangeSet);\n        // Finally mark the property as dirty (we postponed this in the previous operations to prevent multiple triggering\n        // of dirtying events)\n        this._setDirty(false);\n    }\n\n    /**\n     * Removes the dirtiness flag from this property\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_flags] - The flags to clean, if none are supplied all\n     *                                                                       will be removed\n     * @private\n     */\n    _cleanDirty(in_flags) {\n        // Invoke parent - cleans own dirty flag\n        BaseProperty.prototype._cleanDirty.call(this, in_flags);\n\n        // null means no change, undefined means reset the changes\n        var pendingChanges = null,\n            dirtyChanges = null;\n\n        if (in_flags === undefined ||\n            (in_flags & BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE) !== 0) {\n            pendingChanges = undefined;\n        }\n        if (in_flags === undefined ||\n            (in_flags & BaseProperty.MODIFIED_STATE_FLAGS.DIRTY) !== 0) {\n            dirtyChanges = undefined;\n        }\n\n        this._setChanges(pendingChanges, dirtyChanges);\n    }\n\n    /**\n     * Removes the dirtiness flag from this property and recursively from all of its children\n     *\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_dirtinessType] - The flags to clean,\n     * if none are supplied all will be removed\n     */\n    cleanDirty(in_dirtinessType) {\n        if (!this._isPrimitive) {\n            for (var i = 0; i < this._dataArrayGetLength(); ++i) {\n                this._dataArrayGetValue(i).cleanDirty(in_dirtinessType);\n            }\n        }\n        // after all paths are clean, we are also clean!\n        this._cleanDirty(in_dirtinessType);\n    }\n\n    /**\n     * Internal helper function that implements the deserialize algorithm for an array of named properties.\n     *\n     * @param {property-properties.SerializedChangeSet} in_serializedObj - The serialized changeset to apply. This\n     *     has to be a normalized change-set (only containing inserts. Removes and Modifies are forbidden).\n     * @param {boolean} [in_reportToView = true] - By default, the dirtying will always be reported to the checkout view\n     *                                             and trigger a modified event there. When batching updates, this\n     *                                             can be prevented via this flag.\n     * @return {property-properties.SerializedChangeSet} ChangeSet with the changes that actually were performed during the\n     *     deserialization\n     */\n    _deserializeNamedPropertyArray(in_serializedObj, in_reportToView) {\n        if (!_.isArray(in_serializedObj.insert[0][1])) {\n            throw new TypeError(MSG.INVALID_CHANGESET);\n        }\n\n        // When the array contains named properties, we can use an efficient diffing algorithm, which\n        // takes advantage of the ability to identify entries in an unique way\n        var targetArray = in_serializedObj.insert[0][1];\n\n        // The algorithm below finds the mapping between the two given arrays which requires the smallest number of\n        // inserted and removed entries. These operations are determined via the following strategy:\n        // 1) We search for all consecutive segments in the input data, which map to a consecutive segments in the\n        //    target array.\n        // 2) We search for the longest sequence of consecutive segments in the input data which are all starting at\n        //    monotone increasing points in the target array. These are the segments which will remain unmodified\n        //    by insertion/removals\n        // 3) Finally, we determine the necessary insertion and remove operations to fill in/remove the entries between\n        //    these segments and compute modify instructions within the segments.\n\n        // 1) Map the GUIDs in the input ChangeSet to indices\n        var resultGuidToIndexMap = {};\n        for (var i = 0; i < targetArray.length; i++) {\n            var insertedProperty = targetArray[i];\n            if (insertedProperty['String'] === undefined ||\n                insertedProperty['String']['guid'] === undefined) {\n                throw new Error(MSG.MISSING_GUID_IN_NORMALIZED_CHANGESET);\n            }\n\n            var guid = insertedProperty['String']['guid'];\n            // since the spec allows alternatively other changeset formats for strings, we have to support them here:\n            if (!_.isString(guid) && insertedProperty['String']['guid'].insert) {\n                guid = insertedProperty['String']['guid'].insert[0][1];\n            }\n            resultGuidToIndexMap[guid] = i;\n        }\n\n        var initialArrayLength = this._dataArrayGetLength();\n\n        // Collect consecutive segments\n        var segmentStartPointsInInitialArray = [];\n        var segmentStartPointsInTargetArray = [];\n        var segmentLengths = [];\n        var segmentInterrupted = false;\n        for (var i = 0; i < initialArrayLength; i++) {\n            // Get the GUID of the entry\n            var guid = this._dataArrayGetValue(i).getGuid();\n\n            // Check where it is stored in the target array\n            var index = resultGuidToIndexMap[guid];\n            if (index !== undefined) {\n                // Check whether we can append the entry to the existing sequence\n                if (!segmentInterrupted &&\n                    segmentStartPointsInTargetArray.length > 0 &&\n                    _.last(segmentStartPointsInTargetArray) + _.last(segmentLengths) === index) {\n                    // In that case we just increase the length of the segment\n                    segmentLengths[segmentLengths.length - 1]++;\n                } else {\n                    // Create a new segment\n                    segmentStartPointsInInitialArray.push(i);\n                    segmentStartPointsInTargetArray.push(index);\n                    segmentLengths.push(1);\n                    segmentInterrupted = false;\n                }\n            } else {\n                segmentInterrupted = true;\n            }\n        }\n\n        // 2) Get all segments in the array which we will keep (we try to keep as many as possible, so this maps\n        // to finding the longest monotone increasing sequence of sub-segments)\n        var orderedSegments = _getLongestIncreasingSubsequenceSegments(segmentStartPointsInTargetArray, segmentLengths);\n\n        // 3) Now we have to convert this sequence of ordered segments to insert and remove commands\n        var changes = {};\n\n        var lastPositionInInitialArray = 0;\n        var lastPositionInTargetArray = 0;\n        var offset = 0;\n        for (var i = 0; i <= orderedSegments.length; i++) {\n            var startPointInInitialArray, startPointInTargetArray, segmentLength;\n            var offsetChange = 0;\n            if (i < orderedSegments.length) {\n                // Extract the information about the currently processed segment.\n                startPointInInitialArray = segmentStartPointsInInitialArray[orderedSegments[i]];\n                startPointInTargetArray = segmentStartPointsInTargetArray[orderedSegments[i]];\n                segmentLength = segmentLengths[orderedSegments[i]];\n            } else {\n                // Special case to handle the end of the sequence: We add a segment of length 0 at the end\n                startPointInInitialArray = initialArrayLength;\n                startPointInTargetArray = targetArray.length;\n                segmentLength = 0;\n            }\n\n            // If the start point of the segment in the initial array is larger than the last point we processed, we have\n            // to remove the elements between the two points\n            if (startPointInInitialArray > lastPositionInInitialArray) {\n                changes.remove = changes.remove || [];\n                changes.remove.push([lastPositionInInitialArray, startPointInInitialArray - lastPositionInInitialArray]);\n                this._removeRangeWithoutDirtying(lastPositionInInitialArray + offset,\n                    startPointInInitialArray - lastPositionInInitialArray);\n                offsetChange -= startPointInInitialArray - lastPositionInInitialArray;\n            }\n\n            // If the start point of the segment in the target array is larger than the last point we processed, we have\n            // to insert the elements between the two points\n            if (startPointInTargetArray > lastPositionInTargetArray) {\n                changes.insert = changes.insert || [];\n                let elementsToInsert = targetArray.slice(lastPositionInTargetArray, startPointInTargetArray);\n                changes.insert.push([\n                    lastPositionInInitialArray,\n                    deepCopy(elementsToInsert),\n                ]);\n                var scope = this._getScope();\n                var insertedProperties = deserializeNonPrimitiveArrayElements(elementsToInsert, scope);\n                this._insertRangeWithoutDirtying(lastPositionInInitialArray + offset, insertedProperties);\n                offsetChange += insertedProperties.length;\n            }\n\n            // Update the last processed points\n            lastPositionInInitialArray = startPointInInitialArray + segmentLength;\n            lastPositionInTargetArray = startPointInTargetArray + segmentLength;\n            offset += offsetChange;\n\n            // Recursively check the entries within the segment for modifications\n            for (var j = 0; j < segmentLength; j++) {\n                var existingEntry = this._dataArrayGetValue(startPointInInitialArray + j + offset);\n                var entryChanges = existingEntry._deserialize(targetArray[startPointInTargetArray + j],\n                                                              false, undefined, true);\n\n                // We had changes which we have to report back\n                if (!ChangeSet.isEmptyChangeSet(entryChanges)) {\n                    // Make sure, the ChangeSet contains the typeid of the modified entry\n                    entryChanges.typeid = existingEntry.getFullTypeid();\n\n                    if (!changes.modify) {\n                        changes.modify = [[startPointInInitialArray + j, [entryChanges]]];\n                    } else {\n                        var lastModifiedSequence = _.last(changes.modify);\n                        if (lastModifiedSequence[0] + lastModifiedSequence[1].length === startPointInInitialArray + j) {\n                            lastModifiedSequence[1].push(entryChanges);\n                        } else {\n                            changes.modify.push([startPointInInitialArray + j, [entryChanges]]);\n                        }\n                    }\n                }\n            }\n        }\n\n        // If there were any changes, we have to mark this property as dirty\n        if (!ChangeSet.isEmptyChangeSet(changes)) {\n            this._setDirty(in_reportToView);\n        }\n        return changes;\n    }\n\n    /**\n     * Function to deserialize special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on deserialization. For supported types, we can just return the input here.\n     *\n     * @param {property-properties.SerializedChangeSet} in_serializedObj - The object to be deserialized\n     * @return {*} the deserialized value\n     */\n    _deserializeValue(in_serializedObj) {\n        return in_serializedObj;\n    }\n\n    /**\n     * Function to serialize special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on serialization. For supported types, we can just return the input here.\n     *\n     * @param {*} in_obj - The object to be serialized\n     * @return {property-properties.SerializedChangeSet} the serialized object\n     */\n    _serializeValue(in_obj) {\n        // we have to convert the propertySet objects to changesets\n        return in_obj._serialize(false, true);\n    }\n\n    /**\n     * Function to serialize arrays of special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on serialization. For supported types, we can just return the input here.\n     *\n     * @param {Array} in_array - The array of special objects to be serialized\n     * @return {Array<property-properties.SerializedChangeSet>} the serialized object\n     */\n    _serializeArray(in_array) {\n        var len = in_array.length;\n        var result = new Array(len);\n        if (this._isPrimitive) {\n            for (var i = 0; i < len; i++) {\n                result[i] = this._serializeValue(in_array[i]);\n            }\n        } else {\n            for (var i = 0; i < len; i++) {\n                result[i] = {};\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Function to deserialize arrays of special primitive types.\n     * Some primitive types (e.g. Int64, which is not natively supported by javascript) require\n     * special treatment on deserialization. For supported types, we can just return the input here.\n     *\n     * @param {Array<property-properties.SerializedChangeSet>} in_serializedObj the serialized object\n     * @return {Array} in_array - The array of special objects that were deserialized\n     */\n    _deserializeArray(in_serializedObj) {\n        return in_serializedObj;\n    }\n\n    /**\n     * @inheritdoc\n     */\n    _deserialize(in_serializedObj, in_reportToView, in_filteringOptions, in_createChangeSet) {\n        this._checkIsNotReadOnly(false);\n\n        if ((in_serializedObj.remove && in_serializedObj.remove.length > 0) ||\n            (in_serializedObj.modify && in_serializedObj.modify.length > 0) ||\n            (in_serializedObj.insert &&\n                (in_serializedObj.insert.length > 1 ||\n                    (in_serializedObj.insert.length === 1 &&\n                        (in_serializedObj.insert[0][0] !== 0 ||\n                            !_.isArray(in_serializedObj.insert[0][1])))))) {\n            throw new Error(MSG.NO_NORMALIZED_CHANGESET);\n        }\n\n        var arrayLength = this._dataArrayGetLength();\n\n        if (!in_serializedObj.insert ||\n            !in_serializedObj.insert[0]) {\n            // we've got an empty object, so we have to wipe everything we've got\n            if (arrayLength > 0) {\n                this._clearRange(0, arrayLength);\n                this._setDirty(in_reportToView);\n                var removeChangeSet = {\n                    remove: [[0, arrayLength]],\n                };\n                this._updateChanges(removeChangeSet);\n                return removeChangeSet;\n            } else {\n                // the array was already empty, nothing has changed\n                return {};\n            }\n        }\n\n        var scope = this._getScope();\n\n        if (Property.PropertyFactory.inheritsFrom(this.getTypeid(), 'NamedProperty', { scope: scope })) {\n            return this._deserializeNamedPropertyArray(in_serializedObj, in_reportToView);\n        } else {\n            // most simplistic diff method: Remove all existing data and insert the new data\n\n            // The changes we will report as result of this function\n            var simpleChanges = {\n                insert: in_createChangeSet ? deepCopy(in_serializedObj.insert) : in_serializedObj.insert,\n            };\n            if (arrayLength > 0) {\n                simpleChanges.remove = [[0, arrayLength]];\n            }\n\n            if (!this._isPrimitive) {\n                var propertyDescriptions = in_serializedObj.insert[0][1];\n                var result = [];\n\n                for (var i = 0; i < propertyDescriptions.length; ++i) {\n                    var createdProperty = Property.PropertyFactory._createProperty(\n                        propertyDescriptions[i]['typeid'], null, undefined, scope);\n                    createdProperty._setParent(this);\n                    createdProperty._deserialize(propertyDescriptions[i], false, in_filteringOptions, false);\n                    result.push(createdProperty);\n                }\n                this._clearRange(0, this._dataArrayGetLength());\n                this._dataArrayInsertRange(0, result);\n            } else {\n                // Check, whether there has been any change in the array at all\n                if (in_serializedObj.insert[0][1].length === this._dataArrayGetLength()) {\n                    // We have to compare the two buffers\n                    var buffer = this._dataArrayGetBuffer();\n                    var changeSetArray = in_serializedObj.insert[0][1];\n                    var len = buffer.length;\n                    var i = 0;\n                    if (this._typeid === 'Int64' || this._typeid === 'Uint64') {\n                        // For (u)int64, we will compare (Ui/I)nt64 objects with arrays [low, high]\n                        for (i = 0; i < len; i++) {\n                            if (changeSetArray[i][0] !== buffer[i].getValueLow() || changeSetArray[i][1] !== buffer[i].getValueHigh()) {\n                                break;\n                            }\n                        }\n                    } else {\n                        for (i = 0; i < len; i++) {\n                            if (buffer[i] !== changeSetArray[i]) {\n                                break;\n                            }\n                        }\n                    }\n                    if (i === len) {\n                        return {};\n                    }\n                }\n                // set the actual array values to our array\n                this._dataArrayDeserialize(this._deserializeArray(in_serializedObj.insert[0][1]));\n            }\n\n            // Update the dirty and pending changes\n            this._updateChanges(simpleChanges);\n\n            // Finally report the dirtiness to the view (we postponed this above)\n            this._setDirty(in_reportToView);\n\n            return simpleChanges;\n        }\n    }\n\n    _getChangesetForCustomTypeArray(in_basePropertyChangeset,\n        in_dirtinessType,\n        in_includeReferencedRepositories) {\n        var result = {};\n        if (in_basePropertyChangeset.remove && in_basePropertyChangeset.remove.length > 0) {\n            result.remove = deepCopy(in_basePropertyChangeset.remove);\n        }\n        // get the iterator over the changes:\n        var iterator = new ArrayChangeSetIterator(in_basePropertyChangeset);\n        var currentArrayIndex = 0;\n        var currentArraySize = this._dataArrayGetLength();\n        var op, opStartIndex;\n        while (!iterator.atEnd() || currentArrayIndex < currentArraySize) {\n            if (!iterator.atEnd()) {\n                op = iterator.opDescription;\n                opStartIndex = op.operation[0] + op.offset;\n            } else {\n                // no more ops\n                op = { offset: iterator.opDescription.offset };\n                opStartIndex = Number.MAX_VALUE;\n            }\n\n            if (currentArrayIndex < opStartIndex) {\n                // not in the influence of an insert or remove\n\n                // we have to check if the element was modified (since that is not tracked)\n                if (this._dataArrayGetValue(currentArrayIndex)._isDirty(in_dirtinessType)) {\n                    // check if we can combine modifies:\n                    var lastModify = undefined;\n                    if (result.modify && result.modify.length > 0) {\n                        lastModify = result.modify[result.modify.length - 1];\n                        if (lastModify[0] + lastModify[1].length === currentArrayIndex - op.offset) {\n                            // we need to combine, keep lastModify\n                        } else {\n                            lastModify = undefined;\n                        }\n                    }\n\n                    if (lastModify) {\n                        lastModify[1].push(this._dataArrayGetValue(currentArrayIndex).serialize(\n                            {\n                                'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            }));\n                    } else {\n                        // begin new modify\n                        if (!result.modify) {\n                            result.modify = [];\n                        }\n                        result.modify.push([currentArrayIndex - op.offset,\n                        [this._dataArrayGetValue(currentArrayIndex).serialize(\n                            {\n                                'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            })]]);\n                    }\n                    currentArrayIndex++;\n                    // add more immediate modifies if possible\n                    while (currentArrayIndex < currentArraySize && currentArrayIndex < opStartIndex &&\n                        this._dataArrayGetValue(currentArrayIndex)._isDirty(in_dirtinessType)) {\n                        result.modify[result.modify.length - 1][1].push(\n                            this._dataArrayGetValue(currentArrayIndex).serialize(\n                                {\n                                    'dirtyOnly': true, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                    'includeReferencedRepositories': in_includeReferencedRepositories,\n                                }),\n                        );\n                        currentArrayIndex++;\n                    }\n                } else {\n                    currentArrayIndex++;\n                }\n            } else if (currentArrayIndex === opStartIndex) {\n                // handle the op\n                if (op.type === ArrayChangeSetIterator.types.REMOVE) {\n                    // no need to do something (removes are just copied)\n                    iterator.next(); // we've completely consumed that op\n                } else if (op.type === ArrayChangeSetIterator.types.INSERT) {\n                    // we have to convert the inserts:\n                    var currentInsert = op.operation;\n                    var newInsert = [currentInsert[0], []];\n                    for (var j = 0; j < currentInsert[1].length; ++j) {\n                        // TODO: we don't use the data from the changeset anymore, since we directly\n                        // TODO: read the data from the array now - remove the data from the op and\n                        // TODO: replace it with just the length instead\n                        if (!this._dataArrayGetValue(opStartIndex + j)) {\n                            throw new Error('insert: invalid index');\n                        }\n                        newInsert[1].push(this._dataArrayGetValue(opStartIndex + j).serialize(\n                            {\n                                'dirtyOnly': false, 'includeRootTypeid': true, 'dirtinessType': in_dirtinessType,\n                                'includeReferencedRepositories': in_includeReferencedRepositories,\n                            }));\n                    }\n                    if (!result.insert) {\n                        result.insert = [];\n                    }\n                    result.insert.push(newInsert);\n                    currentArrayIndex += currentInsert[1].length; // we've read and used these entries above\n                    iterator.next(); // we've completely consumed that op\n                } else if (op.type === ArrayChangeSetIterator.types.MODIFY) {\n                    // Prevent from looping infinitly\n                    // TODO: Might want to decide if there's something to do here\n                    iterator.next(); // we've completely consumed that op\n                }\n            }\n        }\n        return result;\n    }\n\n    /**\n     * Serialize the property\n     *\n     * @param {boolean} in_dirtyOnly -\n     *     Only include dirty entries in the serialization\n     * @param {boolean} in_includeRootTypeid -\n     *     Include the typeid of the root of the hierarchy - has no effect for ArrayProperty\n     * @param {property-properties.BaseProperty.MODIFIED_STATE_FLAGS} [in_dirtinessType] -\n     *     The type of dirtiness to use when reporting dirty changes. By default this is\n     *     PENDING_CHANGE\n     * @param {boolean} [in_includeReferencedRepositories=false] - If this is set to true, the _serialize\n     *     function will descend into referenced repositories. WARNING: if there are loops in the references\n     *     this can result in an infinite loop\n     *\n     *\n     * @return {Object} The serialized representation of this property\n     * @private\n     */\n    _serialize(in_dirtyOnly, in_includeRootTypeid,\n        in_dirtinessType, in_includeReferencedRepositories) {\n        var result = AbstractStaticCollectionProperty.prototype._serialize.call(this, in_dirtyOnly, in_includeRootTypeid,\n            in_dirtinessType, in_includeReferencedRepositories);\n\n        if (!this._isPrimitive) {\n            if (in_dirtyOnly) {\n                _.extend(result, in_dirtinessType === BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE ?\n                    this._getChangesetForCustomTypeArray(this._getPendingChanges(), in_dirtinessType,\n                        in_includeReferencedRepositories) :\n                    this._getChangesetForCustomTypeArray(this._getDirtyChanges(), in_dirtinessType,\n                        in_includeReferencedRepositories));\n\n                return result;\n            } else {\n                // returns just an insert with the current data\n                if (this._dataArrayGetLength() > 0) {\n                    result.insert = [];\n                    result.insert.push([0, []]);\n                    // we have to convert the propertySet objects to changesets\n                    for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                        result.insert[0][1].push(this._dataArrayGetValue(i)._serialize(false, true, in_dirtinessType,\n                            in_includeReferencedRepositories));\n                    }\n                }\n                return result;\n            }\n        } else if (in_dirtyOnly) {\n            return in_dirtinessType === BaseProperty.MODIFIED_STATE_FLAGS.PENDING_CHANGE ?\n                deepCopy(this._getPendingChanges()) : deepCopy(this._getDirtyChanges());\n        } else {\n            // returns just an insert with the current data\n            if (this._dataArrayGetLength() > 0) {\n                result.insert = [];\n                result.insert.push([0, []]);\n                for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                    result.insert[0][1].push(this._serializeValue(this._dataArrayGetValue(i)));\n                }\n            }\n            return result;\n        }\n    }\n\n    /**\n     * Repeatedly calls back the given function with human-readable string\n     * representations of the property and of its sub-properties.\n     * @param {string} indent - Leading spaces to create the tree representation\n     * @param {string} externalId - Name of the current property at the upper level.\n     *                              Used for arrays.\n     * @param {function} printFct - Function to call for printing each property\n     */\n    _prettyPrint(indent, externalId, printFct) {\n        printFct(indent + externalId + this.getId() + ' (Array of ' + this.getTypeid() + '): [');\n        if (!this._isPrimitive) {\n            this._prettyPrintChildren(indent, printFct);\n        } else {\n            var childIndent = indent + '  ';\n            var prefix = '';\n            var suffix = '';\n            if (this.getTypeid() === 'String') {\n                prefix = '\"';\n                suffix = '\"';\n            }\n            for (var i = 0; i < this._dataArrayGetLength(); i++) {\n                printFct(childIndent + i + ': ' + prefix + this._dataArrayGetValue(i) + suffix);\n            }\n        }\n        printFct(indent + ']');\n    }\n\n    /**\n     * Repeatedly calls back the given function with human-readable string\n     * representations of the property's sub-properties.\n     * @param {string} indent - Leading spaces to create the tree representation\n     * @param {function} printFct - Function to call for printing each property\n     */\n    _prettyPrintChildren(indent, printFct) {\n        indent += '  ';\n        var ids = this.getIds();\n        for (var i = 0; i < ids.length; i++) {\n            this.get(ids[i], { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER })\n                ._prettyPrint(indent, ids[i] + ': ', printFct);\n        }\n    }\n\n    /**\n     * Return a JSON representation of the array and its items.\n     * @return {object} A JSON representation of the array and its items.\n     * @private\n     */\n    _toJson() {\n        var json = {\n            id: this.getId(),\n            context: this._context,\n            typeid: this.getTypeid(),\n            isConstant: this._isConstant,\n            value: [],\n        };\n\n        if (!this._isPrimitive) {\n            var ids = this.getIds();\n            for (var i = 0; i < ids.length; i++) {\n                json.value.push(\n                    this.get(ids[i], { referenceResolutionMode: BaseProperty.REFERENCE_RESOLUTION.NEVER })._toJson(),\n                );\n            }\n        } else {\n            json.value = this.getValues();\n        }\n\n        return json;\n    }\n\n    /**\n     * Returns the full property type identifier for the ChangeSet including the array type id, if not\n     * omitted by parameters\n     * @param  {boolean} [in_hideCollection=false] - if true the collection type (if applicable) will be omitted\n     * @return {string} The typeid\n     */\n    getFullTypeid(in_hideCollection) {\n        if (in_hideCollection) {\n            return this._typeid;\n        } else {\n            return TypeIdHelper.createSerializationTypeId(this._typeid, 'array');\n        }\n    }\n\n    /**\n     * Creates and initializes the data array\n     * @param {Number} in_length      the initial length of the array\n     */\n    _dataArrayCreate(in_length) {\n        // This really creates a generic array for custom type arrays. For primitive arrays, like\n        // 'StringArrayProperty' or 'Float32ArrayProperty', you need to overload this function.\n        this._dataArrayRef = new UniversalDataArray(in_length);\n        for (var i = 0; i < in_length; i++) {\n            var element = Property.PropertyFactory._createProperty(this.getTypeid(), null, undefined, this._scope);\n            element._setParent(this);\n            this._dataArraySetValue(i, element);\n        }\n    }\n\n    /**\n     * Returns the length of the data array\n     * @return {Number} The length\n     */\n    _dataArrayGetLength() {\n        return this._dataArrayRef.length;\n    }\n\n    /**\n     * Returns the data array's internal buffer\n     * @return {Array} The buffer\n     */\n    _dataArrayGetBuffer() {\n        return this._dataArrayRef.getBuffer();\n    }\n\n    /**\n     * Returns an entry from the data array\n     * @param {Number} in_index - Position in the array\n     *\n     * @return {*} The value at index in_index\n     */\n    _dataArrayGetValue(in_index) {\n        return this._dataArrayRef.getValue(in_index);\n    }\n\n    /**\n     * Sets an entry in the data array\n     * @param {Number} in_index - Position in the array\n     * @param {*}      in_value - The new value at index in_index\n     */\n    _dataArraySetValue(in_index, in_value) {\n        this._dataArrayRef.setValue(in_index, in_value);\n    }\n\n    /**\n     * Set the array to the given new array\n     * @param {Array} in_newArray - The new contents of the array\n     */\n    _dataArrayDeserialize(in_newArray) {\n        this._dataArrayRef.deserialize(in_newArray);\n    }\n\n    /**\n     * Inserts a range into the data array\n     * @param {Number} in_position - Position at which the insert should be done\n     * @param {Array} in_range     - The array to insert\n     */\n    _dataArrayInsertRange(in_position, in_range) {\n        this._dataArrayRef.insertRange(in_position, in_range);\n    }\n\n    /**\n     * Removes a range from the data array\n     * @param {Number} in_position - Position at which to start the removal\n     * @param {Number} in_length   - The number of entries to remove\n     */\n    _dataArrayRemoveRange(in_position, in_length) {\n        this._dataArrayRef.removeRange(in_position, in_length);\n    }\n\n    /**\n     * Overwrites a range in the data array\n     * @param {Number} in_position - Position at which to start the removal\n     * @param {Array} in_range     - The array to overwrite\n     */\n    _dataArraySetRange(in_position, in_range) {\n        this._dataArrayRef.set(in_position, in_range);\n    }\n\n    /**\n     * Get the scope to which this property belongs to.\n     * @return {string|undefined} The guid representing the scope in which the\n     * map belongs to. If there is a workspace scope return it, else return the scope of this array.\n     * @override\n     * @private\n     */\n    _getScope() {\n        var scope = AbstractStaticCollectionProperty.prototype._getScope.call(this);\n\n        if (scope !== undefined) {\n            return scope;\n        } else {\n            return this._scope;\n        }\n    }\n\n    /**\n     * returns the length of the current array property\n     */\n    get length() {\n        return this.getLength();\n    }\n    set length(len) {\n        throw new Error(MSG.MODIFY_READ_ONLY);\n    }\n}\n\nArrayProperty.prototype._staticChildren = {};\nArrayProperty.prototype._context = 'array';\n"]}

package/dist/properties/mapProperty.d.ts

@@ -25,10 +25,11 @@ export class MapProperty extends IndexedCollectionBaseProperty {
     /**
      * Sets multiple values in a map.
      *
+     * See {@link MapProperty.setValues}
+     *
      * @param {object} in_values to assign to the collection
      * @param {Boolean} in_typed - If the map's items have a typeid and a value then create the
      *   properties with that typeid, else use the set's typeid (support polymorphic items).
-     * @see {setValues}
      * @private
      */
     private _setValuesInternal;

package/dist/properties/mapProperty.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mapProperty.d.ts","sourceRoot":"","sources":["../../src/properties/mapProperty.js"],"names":[],"mappings":"AAmBA;;;;;GAKG;AAEH;;GAEG;AACH;IACI;;;;;;;;OAQG;IACH,wBAQC;IALG,eAAsB;IACtB,qBAA2D;IAE3D,6CAA6C;IAC7C,qBAA0B;IA2B9B;;;;;;;;OAQG;IACH,2BAsCC;IA+FD;;;;;;;;;;;;OAYG;IACH,eAPW,MAAM,0BAsBhB;IAED;;;;;;OAMG;IACH,eAJW,MAAM,OAQhB;IAED;;;;;;;;;;OAUG;IACH,YANW,MAAM,0BAwBhB;IAwED;;;;;;;OAOG;IACH,cAHY,eAAe,CAK1B;IA8BD;;OAEG;IACH,cAKC;CACJ"}
+{"version":3,"file":"mapProperty.d.ts","sourceRoot":"","sources":["../../src/properties/mapProperty.js"],"names":[],"mappings":"AAmBA;;;;;GAKG;AAEH;;GAEG;AACH;IACI;;;;;;;;OAQG;IACH,wBAQC;IALG,eAAsB;IACtB,qBAA2D;IAE3D,6CAA6C;IAC7C,qBAA0B;IA2B9B;;;;;;;;;OASG;IACH,2BAsCC;IAgGD;;;;;;;;;;;;OAYG;IACH,eAPW,MAAM,0BAsBhB;IAED;;;;;;OAMG;IACH,eAJW,MAAM,OAQhB;IAED;;;;;;;;;;OAUG;IACH,YANW,MAAM,0BAwBhB;IAwED;;;;;;;OAOG;IACH,cAHY,eAAe,CAK1B;IA8BD;;OAEG;IACH,cAKC;CACJ"}