@itwin/core-geometry 5.2.0-dev.8 → 5.3.0-dev.2

package/lib/esm/clipping/ClipUtils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ClipUtils.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAGvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACnH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AASvD,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAE1F,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,oBAAY,oBAAoB;IAC9B,yBAAyB;IACzB,cAAc,IAAI;IAClB,oCAAoC;IACpC,SAAS,IAAI;IACb,0BAA0B;IAC1B,eAAe,IAAI;CACpB;AACD;;;GAGG;AACH,oBAAY,cAAc;IACxB,4DAA4D;IAC5D,QAAQ,IAAI;IACZ,6DAA6D;IAC7D,SAAS,KAAK;IACd,6CAA6C;IAC7C,cAAc,IAAI;CACnB;AAED;;;GAGG;AACH,oBAAY,UAAU;IACpB,kDAAkD;IAClD,YAAY,IAAA;IACZ,kCAAkC;IAClC,aAAa,IAAA;IACb,iCAAiC;IACjC,aAAa,IAAA;CACd;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,4DAA4D;IAC5D,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/D;;;;;;;;;;;;;OAaG;IACH,+BAA+B,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO,CAAC;IACX;;;;;OAKG;IACH,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO,CAAC;IAChG;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,yBAAyB,CAAC;CAC/C;AACD;;;;;;;;GAQG;AACH,KAAK,yBAAyB,GAAG,CAC/B,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,KAC9B,IAAI,CAAC;AAEV;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,iBAAiB,EAAE,yBAAyB,CAAC;CAC9C;AACD;;;GAGG;AACH,qBAAa,aAAa;IAExB,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAY;IAC1C,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAU;IACpC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAqB;IAEjD,OAAO,CAAC,MAAM,CAAC,2BAA2B,CAAoB;IAC9D;;;;;OAKG;WACW,iBAAiB,CAC7B,KAAK,EAAE,cAAc,EACrB,iBAAiB,EAAE,oBAAoB,EACvC,OAAO,EAAE,OAAO,EAChB,QAAQ,CAAC,EAAE,kCAAkC,GAC5C,OAAO;IA2BV;;;;;OAKG;WACW,WAAW,CACvB,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GACtF,OAAO;IAQV;;;;;OAKG;WACW,oBAAoB,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,cAAc,EAAE;IAc7F;;;;;OAKG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,GAAG,SAAS;IA+CvF;;;;;OAKG;WACW,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,QAAQ,EAAE;IAgBzE;;;OAGG;WACW,sBAAsB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,aAAa,GAAG,OAAO,EAAE,EAAE;IAO/F;;;OAGG;WACW,6CAA6C,CACzD,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,aAAa,GAC3C,gBAAgB,EAAE;IASrB;;;;;OAKG;WACW,wBAAwB,CACpC,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,0BAA0B,EAAE,SAAS,EAAE,MAAM,GAChF,UAAU;IAiCb;;;;;;;OAOG;WACW,+CAA+C,CAC3D,SAAS,EAAE,kBAAkB,GAAG,SAAS,EACzC,KAAK,EAAE,OAAO,EACd,YAAY,EAAE,CAAC,UAAU,EAAE,gBAAgB,KAAK,IAAI,EACpD,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,IAAI;IA8CP;;;;;;;;;OASG;WACW,2CAA2C,CACvD,WAAW,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,SAAS,EACxE,KAAK,EAAE,OAAO,EACd,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,aAAa,EAAE;IAmBlB;;;;;OAKG;WACW,8CAA8C,CAAC,SAAS,EAAE,kBAAkB,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO;IASpH;;;;;;;;;;;;OAYG;WACW,mCAAmC,CAC/C,OAAO,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,aAAa,GAAG,UAAU,GAAG,SAAS,EACjG,KAAK,EAAE,OAAO,EACd,oBAAoB,GAAE,OAAc,GACnC,OAAO;IAiCV;;;;;;;;;;;;;OAaG;WACW,yBAAyB,CACrC,OAAO,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,aAAa,GAAG,UAAU,GAAG,SAAS,EACjG,KAAK,EAAE,OAAO,EACd,oBAAoB,GAAE,OAAc,GACnC,OAAO;IAoCV;;;;;;;OAOG;WACW,oCAAoC,CAChD,SAAS,EAAE,kBAAkB,EAC7B,KAAK,EAAE,OAAO,EACd,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,OAAO;IA+BV;;;;;;MAME;IACF,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAoBlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAkB3C;;;;;;;;;OASG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,CAAC,EAAE,MAAM,GAC1G,OAAO;IAiBV;;;;;;;;OAQG;WACW,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAe/J;;;OAGG;WACW,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAS1C;;;;;;;;;;;;;;;OAeG;WACW,uCAAuC,CACnD,SAAS,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,oBAAoB,EAAE,UAAU,EAAE,qBAAqB,GAC/H,IAAI;IASP;;;;;;;;OAQG;WACW,gCAAgC,CAC5C,MAAM,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GACxG,0BAA0B;IAO7B,2GAA2G;WAC7F,aAAa,CACzB,IAAI,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,EAAE,EAAE,KAAK,EAAE,qBAAqB,GACvG,IAAI;IAMP;;;;;;;;;;;;;OAaG;WACW,0BAA0B,CACtC,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACvI,IAAI;IA+BP;;;;;;;;;;OAUG;WACW,0BAA0B,CACtC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACpI,IAAI;IAWP;;;;;;;;;;;;;OAaG;WACW,uBAAuB,CACnC,KAAK,EAAE,4BAA4B,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACtI,IAAI;IA6BP;;;;;;;;;;OAUG;WACW,wBAAwB,CACpC,MAAM,EAAE,4BAA4B,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,GAAE,MAAgB,GAC5H,IAAI;IAMP;;;;;OAKG;WACW,oBAAoB,CAChC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI,GACxF,IAAI;IAQP;;;;OAIG;WACW,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM;IAShF;;;;;;;;;;;;;;;;;OAiBG;WACW,qBAAqB,CACjC,GAAG,EAAE,oBAAoB,EACzB,QAAQ,EAAE,OAAO,EAAE,EACnB,UAAU,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC1C,WAAW,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC3C,eAAe,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC/C,QAAQ,EAAE,cAAc,EACxB,SAAS,EAAE,cAAc,EACzB,mBAAmB,EAAE,cAAc,EACnC,UAAU,EAAE,qBAAqB,GAAG,SAAS;IAmC/C,qFAAqF;WACvE,2BAA2B,CACvC,GAAG,EAAE,oBAAoB,EACzB,QAAQ,EAAE,OAAO,EAAE,EACnB,UAAU,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC1C,WAAW,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC3C,UAAU,EAAE,qBAAqB,GAAG,SAAS;IA6C/C;;;OAGG;WACW,wBAAwB,CAAC,OAAO,EAAE,kBAAkB,GAAG,0BAA0B;CA6BhG"}
+{"version":3,"file":"ClipUtils.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAe,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEnE,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACnH,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAMvD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAIvD,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAE1F,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAG7D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,oBAAY,oBAAoB;IAC9B,yBAAyB;IACzB,cAAc,IAAI;IAClB,oCAAoC;IACpC,SAAS,IAAI;IACb,0BAA0B;IAC1B,eAAe,IAAI;CACpB;AACD;;;GAGG;AACH,oBAAY,cAAc;IACxB,4DAA4D;IAC5D,QAAQ,IAAI;IACZ,6DAA6D;IAC7D,SAAS,KAAK;IACd,6CAA6C;IAC7C,cAAc,IAAI;CACnB;AAED;;;GAGG;AACH,oBAAY,UAAU;IACpB,kDAAkD;IAClD,YAAY,IAAA;IACZ,kCAAkC;IAClC,aAAa,IAAA;IACb,iCAAiC;IACjC,aAAa,IAAA;CACd;AAED;;;GAGG;AACH,MAAM,WAAW,OAAO;IACtB,4DAA4D;IAC5D,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC;IAC/D;;;;;;;;;;;;;OAaG;IACH,+BAA+B,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO,CAAC;IACX;;;;;OAKG;IACH,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO,CAAC;IAChG;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,yBAAyB,CAAC;CAC/C;AACD;;;;;;;;GAQG;AACH,KAAK,yBAAyB,GAAG,CAC/B,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,KAC9B,IAAI,CAAC;AAEV;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,iBAAiB,EAAE,yBAAyB,CAAC;CAC9C;AACD;;;GAGG;AACH,qBAAa,aAAa;IAExB,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAY;IAC1C,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAU;IACpC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAqB;IAEjD,OAAO,CAAC,MAAM,CAAC,2BAA2B,CAAoB;IAC9D;;;;;OAKG;WACW,iBAAiB,CAC7B,KAAK,EAAE,cAAc,EACrB,iBAAiB,EAAE,oBAAoB,EACvC,OAAO,EAAE,OAAO,EAChB,QAAQ,CAAC,EAAE,kCAAkC,GAC5C,OAAO;IA2BV;;;;;OAKG;WACW,WAAW,CACvB,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GACtF,OAAO;IAQV;;;;;OAKG;WACW,oBAAoB,CAAC,KAAK,EAAE,cAAc,EAAE,OAAO,EAAE,OAAO,GAAG,cAAc,EAAE;IAc7F;;;;;OAKG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,GAAG,SAAS,GAAG,SAAS;IA6CvF;;;;;OAKG;WACW,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,GAAG,QAAQ,EAAE;IAgBzE;;;OAGG;WACW,sBAAsB,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,aAAa,GAAG,OAAO,EAAE,EAAE;IAO/F;;;OAGG;WACW,6CAA6C,CACzD,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,aAAa,GAC3C,gBAAgB,EAAE;IASrB;;;;;OAKG;WACW,wBAAwB,CACpC,MAAM,EAAE,gBAAgB,EAAE,QAAQ,EAAE,0BAA0B,EAAE,SAAS,EAAE,MAAM,GAChF,UAAU;IAiCb;;;;;;;OAOG;WACW,+CAA+C,CAC3D,SAAS,EAAE,kBAAkB,GAAG,SAAS,EACzC,KAAK,EAAE,OAAO,EACd,YAAY,EAAE,CAAC,UAAU,EAAE,gBAAgB,KAAK,IAAI,EACpD,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,IAAI;IA8CP;;;;;;;;;OASG;WACW,2CAA2C,CACvD,WAAW,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,SAAS,EACxE,KAAK,EAAE,OAAO,EACd,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,aAAa,EAAE;IAmBlB;;;;;OAKG;WACW,8CAA8C,CAAC,SAAS,EAAE,kBAAkB,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO;IASpH;;;;;;;;;;;;OAYG;WACW,mCAAmC,CAC/C,OAAO,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,aAAa,GAAG,UAAU,GAAG,SAAS,EACjG,KAAK,EAAE,OAAO,EACd,oBAAoB,GAAE,OAAc,GACnC,OAAO;IAiCV;;;;;;;;;;;;;OAaG;WACW,yBAAyB,CACrC,OAAO,EAAE,kBAAkB,GAAG,0BAA0B,GAAG,aAAa,GAAG,UAAU,GAAG,SAAS,EACjG,KAAK,EAAE,OAAO,EACd,oBAAoB,GAAE,OAAc,GACnC,OAAO;IAoCV;;;;;;;OAOG;WACW,oCAAoC,CAChD,SAAS,EAAE,kBAAkB,EAC7B,KAAK,EAAE,OAAO,EACd,qBAAqB,GAAE,OAAc,EACrC,iBAAiB,GAAE,OAAc,EACjC,qBAAqB,UAAQ,GAC5B,OAAO;IA+BV;;;;;;MAME;IACF,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAoBlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAkB3C;;;;;;;;;OASG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,CAAC,EAAE,MAAM,GAC1G,OAAO;IAiBV;;;;;;;;OAQG;WACW,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAe/J;;;OAGG;WACW,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAS1C;;;;;;;;;;;;;;;OAeG;WACW,uCAAuC,CACnD,SAAS,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,oBAAoB,EAAE,UAAU,EAAE,qBAAqB,GAC/H,IAAI;IASP;;;;;;;;OAQG;WACW,gCAAgC,CAC5C,MAAM,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GACxG,0BAA0B;IAO7B,2GAA2G;WAC7F,aAAa,CACzB,IAAI,EAAE,gBAAgB,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,gBAAgB,EAAE,EAAE,KAAK,EAAE,qBAAqB,GACvG,IAAI;IAMP;;;;;;;;;;;;;OAaG;WACW,0BAA0B,CACtC,UAAU,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACvI,IAAI;IA+BP;;;;;;;;;;OAUG;WACW,0BAA0B,CACtC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACpI,IAAI;IAWP;;;;;;;;;;;;;OAaG;WACW,uBAAuB,CACnC,KAAK,EAAE,4BAA4B,EAAE,aAAa,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAgB,GACtI,IAAI;IA6BP;;;;;;;;;;OAUG;WACW,wBAAwB,CACpC,MAAM,EAAE,4BAA4B,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,GAAE,MAAgB,GAC5H,IAAI;IAMP;;;;;OAKG;WACW,oBAAoB,CAChC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,KAAK,IAAI,GACxF,IAAI;IAQP;;;;OAIG;WACW,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM;IAShF;;;;;;;;;;;;;;;;;OAiBG;WACW,qBAAqB,CACjC,GAAG,EAAE,oBAAoB,EACzB,QAAQ,EAAE,OAAO,EAAE,EACnB,UAAU,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC1C,WAAW,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC3C,eAAe,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC/C,QAAQ,EAAE,cAAc,EACxB,SAAS,EAAE,cAAc,EACzB,mBAAmB,EAAE,cAAc,EACnC,UAAU,EAAE,qBAAqB,GAAG,SAAS;IAmC/C,qFAAqF;WACvE,2BAA2B,CACvC,GAAG,EAAE,oBAAoB,EACzB,QAAQ,EAAE,OAAO,EAAE,EACnB,UAAU,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC1C,WAAW,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAC3C,UAAU,EAAE,qBAAqB,GAAG,SAAS;IA6C/C;;;OAGG;WACW,wBAAwB,CAAC,OAAO,EAAE,kBAAkB,GAAG,0BAA0B;IA6B/F;;;;;;;;;OASG;WACW,kDAAkD,CAC9D,UAAU,EAAE,UAAU,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,WAAW,GAAE,MAAqC,EAAE,WAAW,CAAC,EAAE,YAAY,GACpI,0BAA0B,EAAE,GAAG,SAAS;CAS5C"}

package/lib/esm/clipping/ClipUtils.js

@@ -24,6 +24,7 @@ import { Range1d, Range3d } from "../geometry3d/Range";
 import { GrowableXYZArrayCache } from "../geometry3d/ReusableObjectCache";
 import { Transform } from "../geometry3d/Transform";
 import { PolyfaceBuilder } from "../polyface/PolyfaceBuilder";
+import { Voronoi } from "../topology/Voronoi";
 import { ClipPlane } from "./ClipPlane";
 import { ClipPrimitive } from "./ClipPrimitive";
 import { ClipVector } from "./ClipVector";
@@ -151,15 +152,13 @@ export class ClipUtilities {
      */
     static clipAnyRegion(region, clipper) {
         let result;
-        // Create "local region" which is the result of rotating region to make
-        // it parallel to the xy-plane and then translating it to the xy-plane.
         const localToWorld = ClipUtilities._workTransform = FrameBuilder.createRightHandedFrame(undefined, region, ClipUtilities._workTransform);
         if (!localToWorld)
             return result;
         const worldToLocal = localToWorld?.inverse();
         if (!worldToLocal)
             return result;
-        const localRegion = region.cloneTransformed(worldToLocal);
+        const localRegion = region.cloneTransformed(worldToLocal); // parallel to xy-plane so we can ignore z
         if (!localRegion)
             return result;
         // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be
@@ -967,6 +966,25 @@ export class ClipUtilities {
         }
         return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);
     }
+    /**
+     * Creates clippers for regions closest to the children of a curve chain.
+     * * For best results, each child should have length larger than `distanceTol`.
+     * @param curveChain A curve chain; xy-only (z-coordinate is ignored). Must have at least 2 children.
+     * @param strokeOptions Optional stroke options to control the sampling of the curve chain.
+     * @param distanceTol Optional distance tolerance to use when comparing points; default is [[Geometry.smallMetricDistance]].
+     * @param boundingBox Optional nominal xy-bounding box for the clipper regions; default is maximal clipper regions.
+     * @returns An ordered array of clippers, each of which represents the region closest to the corresponding primitive in the
+     * input chain, or undefined if the input is invalid.
+     */
+    static createClippersForRegionsClosestToCurvePrimitivesXY(curveChain, strokeOptions, distanceTol = Geometry.smallMetricDistance, boundingBox) {
+        const voronoi = Voronoi.createFromCurveChain(curveChain, strokeOptions, distanceTol, boundingBox);
+        if (!voronoi)
+            return undefined;
+        const superFaces = voronoi.computeVoronoiSuperFaces(curveChain.children.length);
+        if (superFaces === undefined || superFaces.length !== curveChain.children.length)
+            return undefined;
+        return voronoi.generateClippersFromVoronoiSuperFaces(superFaces);
+    }
 }
 function moveFragments(fragments, destination, arrayCache) {
     if (destination === undefined)

package/lib/esm/clipping/ClipUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClipUtils.js","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAA4D,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAGnH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACnE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAGlE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,MAAM,CAAN,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,KAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,MAAM,CAAN,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,KAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,KAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAM,OAAO,aAAa;IACxB,wHAAwH;IAChH,MAAM,CAAC,cAAc,CAAa;IAClC,MAAM,CAAC,UAAU,CAAW;IAC5B,MAAM,CAAC,YAAY,CAAsB;IAEzC,MAAM,CAAC,2BAA2B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAC9D;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAC7B,KAAqB,EACrB,iBAAuC,EACvC,OAAgB,EAChB,QAA6C;QAE7C,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC;QACP,IAAI,IAAI,CAAC;QACT,MAAM,SAAS,GAAG,aAAa,CAAC,2BAA2B,CAAC;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,aAAa,EAAE,CAAC;gBACrC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;oBAC/B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;wBACzC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,KAAqB,EAAE,OAAgB;QACxE,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,CAAC,qBAAqB,CACzB,OAAO,EACP,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAsB,EAAE,EAAE;YAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAgB;QAC7D,IAAI,MAA+B,CAAC;QACpC,uEAAuE;QACvE,uEAAuE;QACvE,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,YAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;QACzI,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,YAAY,GAAG,YAAY,EAAE,OAAO,EAAE,CAAC;QAC7C,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAc,CAAC;QACvE,IAAI,CAAC,WAAW;YACd,OAAO,MAAM,CAAC;QAChB,uGAAuG;QACvG,qGAAqG;QACrG,6GAA6G;QAC7G,gHAAgH;QAChH,iFAAiF;QACjF,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/F,SAAS,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5C,kGAAkG;QAClG,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,gBAAgB,GAAuB,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC1C,OAAO,CAAC,iBAAiB,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC9F,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE,CAAC;gBACvB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBACrH,IAAI,kBAAkB,YAAY,WAAW;oBAC3C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,4BAA4B;;oBAElF,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACxD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1B,CAAC;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;YAC1D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,OAAkB,EAAE,SAAwB;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,6CAA6C,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,OAAO;YACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6CAA6C,CACzD,OAAkB,EAAE,SAAwB;QAE5C,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/C,0CAA0C;QAC1C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAwB,EAAE,QAAoC,EAAE,SAAiB;QAEjF,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,UAAU,CAAC,aAAa,CAAC;QAElC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;YAC5C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBACzF,CAAC;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;QACnC,CAAC;QACD,OAAO,UAAU,CAAC,aAAa,CAAC;IAClC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAC3D,SAAyC,EACzC,KAAc,EACd,YAAoD,EACpD,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,IAAI,SAAS,YAAY,kBAAkB,EAAE,CAAC;gBAC5C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;oBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;wBAC1C,SAAS;oBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE,CAAC;wBACzB,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;wBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;4BACxB,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC,CAAE,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;oBACjD,YAAY;gBACd,CAAC;qBAAM,CAAC;oBACN,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,kBAAkB,EAAE,CAAC;oBAC5C,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,YAAY,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,wBAAwB,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;wBACpC,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2CAA2C,CACvD,WAAwE,EACxE,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,WAAW,YAAY,0BAA0B,EAAE,CAAC;YACtD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,KAAK,EACjE,CAAC,MAAwB,EAAE,EAAE;oBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;aAAM,IAAI,WAAW,YAAY,kBAAkB,IAAI,WAAW,YAAY,SAAS,EAAE,CAAC;YACzF,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,KAAK,EACrE,CAAC,MAAwB,EAAE,EAAE;gBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,+CAA+C,CAAC,SAAS,EAAE,KAAK,EACnE,CAAC,MAAwB,EAAE,EAAE;YAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC,EACD,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,mCAAmC,CAC/C,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,0BAA0B,EAAE,CAAC;YAClD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,YAAY,aAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS;gBAC3C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,mCAAmC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,iBAAiB,CAAC;QAE3B,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CACrC,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,IAAI,CAAC;QAEd,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,0BAA0B,EAAE,CAAC;YAClD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,YAAY,aAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAK,6DAA6D;gBAC7G,OAAO,IAAI,CAAC;YACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,6FAA6F;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,oCAAoC,CAChD,SAA6B,EAC7B,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;oBAC1C,SAAS;gBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/D,IAAI,oBAAoB,EAAE,CAAC;oBACzB,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;oBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;oBACxB,OAAO,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACM,MAAM,CAAC,mCAAmC,CAAC,KAAc,EAAE,SAAoB,EAAE,gBAA4B;QACnH,IAAI,CAAC,SAAS;YACZ,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,kBAAkB,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAC7G,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAC3B,OAAO,OAAO,CAAC;QACjB,wCAAwC;QACxC,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK;oBACP,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,4BAA4B,CAAC,KAAc,EAAE,MAAiB,EAAE,YAAwB,EAAE,YAAsB;QAC7H,MAAM,gBAAgB,GAAmD,YAAY,CAAC,CAAC;YACrF,CAAC,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,EAAE;gBAC7C,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC/D,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,kBAAkB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,GAAG,OAAO,CAAC,qBAAqB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAC7E,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,eAAe,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,eAAe,IAAI,YAAY;gBACjC,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,YAAqB;QAE3G,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAI,YAAY,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACtF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,MAAgB;QACnJ,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,QAAQ,CAAC;QAClB,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,UAA4B,EAAE,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;YAE9J,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QACvF,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,uCAAuC,CACnD,SAAyC,EAAE,SAAiB,EAAE,SAA+B,EAAE,UAAiC;QAEhI,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAC5C,MAAwC,EAAE,UAAkB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU;QAEzG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,8BAA8B,CAAC,wBAAwB,CAC5D,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,8BAA8B,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1G,CAAC;IACD,2GAA2G;IACpG,MAAM,CAAC,aAAa,CACzB,IAAsB,EAAE,SAAiB,EAAE,WAA+B,EAAE,KAA4B;QAExG,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAC1B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAiB,EAAE,UAAiB,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAExI,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,qCAAqC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,iCAAiC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAa,EAAE,MAAa,EAAE,MAAa,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAErI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,uBAAuB,CACnC,KAAmC,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAEvI,qCAAqC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,6DAA6D;YAC7D,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAsC,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,iBAAyB,OAAO;QAE7H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAChC,OAAgB,EAAE,MAAiB,EAAE,QAAoD;QAEzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,OAAgB,EAAE,MAAiB;QACrE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACI,MAAM,CAAC,qBAAqB,CACjC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,eAA+C,EAC/C,QAAwB,EACxB,SAAyB,EACzB,mBAAmC,EACnC,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,cAAc,GAAuB,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC;QACV,0GAA0G;QAC1G,4GAA4G;QAC5G,oEAAoE;QACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAChD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACnG,mBAAmB,CAAC,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACrG,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,mBAAmB,CAAC,mBAAmB,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QAC3G,yGAAyG;QACzG,4EAA4E;QAC5E,IAAI,WAAW,EAAE,MAAM,KAAK,eAAe;YACzC,aAAa,CAAC,uCAAuC,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QACrG,4EAA4E;QAC5E,IAAI,UAAU,EAAE,MAAM,KAAK,cAAc;YACvC,aAAa,CAAC,uCAAuC,CAAC,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;IACzG,CAAC;IACD,qFAAqF;IAC9E,MAAM,CAAC,2BAA2B,CACvC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,YAAY,GAAuB,EAAE,CAAC;QAC1C,IAAI,gBAAgB,GAAuB,EAAE,CAAC;QAC9C,IAAI,iBAAiB,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,IAAI,KAAK,CAAC;QACV,kBAAkB;QAClB,wDAAwD;QACxD,mDAAmD;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAClD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBACzH,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC3H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,KAAK,GAAG,YAAY,CAAC;gBAAC,YAAY,GAAG,gBAAgB,CAAC;gBAAC,gBAAgB,GAAG,KAAK,CAAC;gBACtF,MAAM,KAAK,GAAG,aAAa,CAAC;gBAAC,aAAa,GAAG,iBAAiB,CAAC;gBAAC,iBAAiB,GAAG,KAAK,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,gDAAgD;QAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC3C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC5C,CAAC;YACJ,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE,CAAC;oBACR,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAClD,kEAAkE;wBAClE,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;wBAC7E,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE,CAAC;4BACX,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;4BACrC,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;4BAC3C,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,0BAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;;AAEH,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC;AACD;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAC1B,MAAsB,EACtB,SAA6B,EAC7B,UAA0C,EAC1C,WAA2C,EAC3C,cAA8C,EAC9C,UAAiC;IAEjC,IAAI,WAAW,CAAC;IAChB,IAAI,MAAM,KAAK,cAAc,CAAC,QAAQ;QACpC,WAAW,GAAG,UAAU,CAAC;SACtB,IAAI,MAAM,KAAK,cAAc,CAAC,SAAS;QAC1C,WAAW,GAAG,WAAW,CAAC;SACvB,IAAI,MAAM,KAAK,cAAc,CAAC,cAAc;QAC/C,WAAW,GAAG,cAAc,CAAC;IAC/B,4EAA4E;IAC5E,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { BagOfCurves } from \"../curve/CurveCollection\";\nimport { CurveFactory } from \"../curve/CurveFactory\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Path } from \"../curve/Path\";\nimport { RegionBinaryOpType, RegionOps } from \"../curve/RegionOps\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { Geometry } from \"../Geometry\";\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipPrimitive } from \"./ClipPrimitive\";\nimport { ClipVector } from \"./ClipVector\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\nimport { LineStringOffsetClipperContext } from \"./internalContexts/LineStringOffsetClipperContext\";\nimport { UnionOfConvexClipPlaneSets } from \"./UnionOfConvexClipPlaneSets\";\n\n/**\n * Enumerated type for describing where geometry lies with respect to clipping planes.\n * @public\n */\nexport enum ClipPlaneContainment {\n  /** All points inside. */\n  StronglyInside = 1,\n  /** Inside/outside state unknown. */\n  Ambiguous = 2,\n  /** All points outside. */\n  StronglyOutside = 3,\n}\n/**\n * Enumeration of ways to handle an intermediate fragment from a clipping step.\n * @public\n */\nexport enum ClipStepAction {\n  /** Pass fragments directly to final accepted \"in\" state. */\n  acceptIn = 1,\n  /** Pass fragments directly to final accepted \"out\" state. */\n  acceptOut = -1,\n  /** Forward fragments to subsequent steps. */\n  passToNextStep = 0,\n}\n\n/**\n * Enumerated type for describing what must yet be done to clip a piece of geometry.\n * @public\n */\nexport enum ClipStatus {\n  /** Some geometry may cross the clip boundaries */\n  ClipRequired,\n  /** Geometry is clearly outside */\n  TrivialReject,\n  /** Geometry is clearly inside */\n  TrivialAccept,\n}\n\n/**\n * An object containing clipping planes that can be used to clip geometry.\n * @public\n */\nexport interface Clipper {\n  /** Test if `point` is on or inside the Clipper's volume. */\n  isPointOnOrInside(point: Point3d, tolerance?: number): boolean;\n  /**\n   * Find the parts of the line segment (if any) that is within the convex clip volume.\n   * * The line segment is defined by `pointA` and `pointB`.\n   * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\n   * * To clip to the usual bounded line segment, start with fractions (0,1).\n   * If the clip volume is unbounded, the line interval may also be unbounded.\n   * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\n   * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\n   * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\n   * @param pointA segment start (fraction 0)\n   * @param pointB segment end (fraction 1)\n   * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\n   * @returns true if a segment was announced, false if entirely outside.\n   */\n  announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber\n  ): boolean;\n  /**\n   * Find the portion (or portions) of the arc (if any) that are within the convex clip volume.\n   * @param arc the arc to be clipped.\n   * @param announce function to be called to announce a fraction intervals that are within the convex clip volume.\n   * @returns true if one or more arcs portions were announced, false if entirely outside.\n   */\n  announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;\n  /**\n   * Optional polygon clip method.\n   * * This is expected to be implemented by planar clip structures.\n   * * This is unimplemented for curve clippers (e.g. sphere) for which polygon clip result has curved edges.\n   * * The input polygon must be convex.\n   */\n  appendPolygonClip?: AppendPolygonClipFunction;\n}\n/**\n * Signature of method to execute polygon clip, distributing fragments of xyz among insideFragments and outsideFragments\n * @param xyz convex polygon. This is not changed.\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param arrayCache cache for reusable GrowableXYZArray.\n */\ntype AppendPolygonClipFunction = (\n  xyz: IndexedXYZCollection,\n  insideFragments: GrowableXYZArray[],\n  outsideFragments: GrowableXYZArray[],\n  arrayCache: GrowableXYZArrayCache\n) => void;\n\n/**\n * Interface for clipping convex polygons.\n * Supported by:\n * * AlternatingCCTreeNode\n * * ConvexClipPlaneSet\n * @public\n */\nexport interface PolygonClipper {\n  appendPolygonClip: AppendPolygonClipFunction;\n}\n/**\n * Class whose various static methods are functions for clipping geometry\n * @public\n */\nexport class ClipUtilities {\n  // on-demand scratch objects for method implementations. If you use one, make sure it isn't already being used in scope.\n  private static _workTransform?: Transform;\n  private static _workRange?: Range3d;\n  private static _workClipper?: ConvexClipPlaneSet;\n\n  private static _selectIntervals01TestPoint = Point3d.create();\n  /**\n   * Augment the unsortedFractionsArray with 0 and 1\n   * * sort\n   * * test the midpoint of each interval with `clipper.isPointOnOrInside`\n   * * pass accepted intervals to `announce(f0,f1,curve)`\n   */\n  public static selectIntervals01(\n    curve: CurvePrimitive,\n    unsortedFractions: GrowableFloat64Array,\n    clipper: Clipper,\n    announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    unsortedFractions.push(0);\n    unsortedFractions.push(1);\n    unsortedFractions.sort();\n    let f0 = unsortedFractions.atUncheckedIndex(0);\n    let f1;\n    let fMid;\n    const testPoint = ClipUtilities._selectIntervals01TestPoint;\n    const n = unsortedFractions.length;\n    for (let i = 1; i < n; i++) {\n      f1 = unsortedFractions.atUncheckedIndex(i);\n      if (f1 > f0 + Geometry.smallFraction) {\n        fMid = 0.5 * (f0 + f1);\n        if (fMid >= 0.0 && fMid <= 1.0) {\n          curve.fractionToPoint(fMid, testPoint);\n          if (clipper.isPointOnOrInside(testPoint)) {\n            if (announce)\n              announce(f0, f1, curve);\n            else\n              return true;\n          }\n        }\n        f0 = f1;\n      }\n    }\n    return false;\n  }\n  /**\n   * Announce triples of (low, high, cp) for each entry in intervals.\n   * @param intervals source array\n   * @param cp CurvePrimitive for announcement\n   * @param announce function to receive data\n   */\n  public static announceNNC(\n    intervals: Range1d[], cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    if (announce) {\n      for (const ab of intervals) {\n        announce(ab.low, ab.high, cp);\n      }\n    }\n    return intervals.length > 0;\n  }\n  /**\n   * Compute and return portions of the input curve that are within the clipper.\n   * @param curve input curve, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped curves\n   */\n  public static collectClippedCurves(curve: CurvePrimitive, clipper: Clipper): CurvePrimitive[] {\n    const result: CurvePrimitive[] = [];\n    curve.announceClipIntervals(\n      clipper,\n      (fraction0: number, fraction1: number, curveA: CurvePrimitive) => {\n        if (fraction1 !== fraction0) {\n          const partialCurve = curveA.clonePartialCurve(fraction0, fraction1);\n          if (partialCurve)\n            result.push(partialCurve);\n        }\n      },\n    );\n    return result;\n  }\n  /**\n   * Compute and return the portions of the input region that are within the clipper.\n   * @param region input region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return clipped subregion, as a single `AnyRegion`\n   */\n  public static clipAnyRegion(region: AnyRegion, clipper: Clipper): AnyRegion | undefined {\n    let result: UnionRegion | undefined;\n    // Create \"local region\" which is the result of rotating region to make\n    // it parallel to the xy-plane and then translating it to the xy-plane.\n    const localToWorld = ClipUtilities._workTransform = FrameBuilder.createRightHandedFrame(undefined, region, ClipUtilities._workTransform);\n    if (!localToWorld)\n      return result;\n    const worldToLocal = localToWorld?.inverse();\n    if (!worldToLocal)\n      return result;\n    const localRegion = region.cloneTransformed(worldToLocal) as AnyRegion;\n    if (!localRegion)\n      return result;\n    // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be\n    // convex or even a polygon. We get around this limitation by using a Boolean operation, which admits\n    // *any* planar regions, albeit in local coordinates. First, we clip a rectangle that covers the input region\n    // (in world coordinates), then we intersect the resulting fragments with the input region in local coordinates.\n    // Finally, we assemble the results into a UnionRegion back in world coordinates.\n    const localRegionRange = ClipUtilities._workRange = localRegion.range();\n    const xLength = localRegionRange.xLength();\n    const yLength = localRegionRange.yLength();\n    const rectangle = LineString3d.createRectangleXY(localRegionRange.low, xLength, yLength, true);\n    rectangle.tryTransformInPlace(localToWorld);\n    // Clip the rectangle to produce fragment(s) which we can Boolean intersect with the input region.\n    const insideFragments: GrowableXYZArray[] = [];\n    const outsideFragments: GrowableXYZArray[] = [];\n    const cache = new GrowableXYZArrayCache();\n    clipper.appendPolygonClip?.(rectangle.packedPoints, insideFragments, outsideFragments, cache);\n    if (insideFragments.length === 0)\n      return result;\n    // Create the \"clipped region\".\n    for (const fragment of insideFragments) {\n      const loop = Loop.createPolygon(fragment);\n      loop.tryTransformInPlace(worldToLocal);\n      const clippedLocalRegion = RegionOps.regionBooleanXY(localRegion, loop, RegionBinaryOpType.Intersection);\n      if (clippedLocalRegion) {\n        clippedLocalRegion.tryTransformInPlace(localToWorld);\n        if (!result)\n          result = (clippedLocalRegion instanceof UnionRegion) ? clippedLocalRegion : UnionRegion.create(clippedLocalRegion);\n        if (clippedLocalRegion instanceof UnionRegion)\n          result.children.push(...clippedLocalRegion.children); // avoid nested UnionRegions\n        else\n          result.tryAddChild(clippedLocalRegion);\n      }\n    }\n    return result ? RegionOps.simplifyRegion(result) : undefined;\n  }\n  /**\n   * Compute and return portions of the input curve or region that are within the clipper.\n   * @param curve input curve or region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped components of the input curve or region that lie inside the clipper\n   */\n  public static clipAnyCurve(curve: AnyCurve, clipper: Clipper): AnyCurve[] {\n    if (curve instanceof CurvePrimitive)\n      return ClipUtilities.collectClippedCurves(curve, clipper);\n    if (curve.isAnyRegion()) {\n      const ret = ClipUtilities.clipAnyRegion(curve, clipper);\n      return ret ? [ret] : [];\n    }\n    const result: AnyCurve[] = [];\n    if (curve instanceof Path || curve instanceof BagOfCurves) {\n      for (const child of curve.children) {\n        const partialClip = ClipUtilities.clipAnyCurve(child, clipper);\n        result.push(...partialClip);\n      }\n    }\n    return result;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShape(polygon: Point3d[], clipShape: ClipPrimitive): Point3d[][] {\n    const outputA = this.clipPolygonToClipShapeReturnGrowableXYZArrays(polygon, clipShape);\n    const output = [];\n    for (const g of outputA)\n      output.push(g.getPoint3dArray());\n    return output;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShapeReturnGrowableXYZArrays(\n    polygon: Point3d[], clipShape: ClipPrimitive,\n  ): GrowableXYZArray[] {\n    const output: GrowableXYZArray[] = [];\n    const clipper = clipShape.fetchClipPlanesRef();\n    // NEEDS WORK -- what if it is a mask !!!!\n    if (clipper) {\n      clipper.polygonClip(polygon, output);\n    }\n    return output;\n  }\n  /**\n   * Given an array of points, test for trivial containment conditions.\n   * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.\n   * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.\n   * * ClipStatus.TrivialReject if neither of those occurred.\n   */\n  public static pointSetSingleClipStatus(\n    points: GrowableXYZArray, planeSet: UnionOfConvexClipPlaneSets, tolerance: number,\n  ): ClipStatus {\n    if (planeSet.convexSets.length === 0)\n      return ClipStatus.TrivialAccept;\n\n    for (const convexSet of planeSet.convexSets) {\n      let allOutsideSinglePlane = false, anyOutside = false;\n\n      for (const plane of convexSet.planes) {\n        let numInside = 0, numOutside = 0;\n        const planeDistance = plane.distance - tolerance;\n\n        const currPt = Point3d.create();\n        const currVec = Vector3d.create();\n        for (let i = 0; i < points.length; i++) {\n          points.getPoint3dAtUncheckedPointIndex(i, currPt);\n          currVec.setFrom(currPt);\n          currVec.dotProduct(plane.inwardNormalRef) > planeDistance ? numInside++ : numOutside++;\n        }\n\n        anyOutside = (numOutside !== 0) ? true : anyOutside;\n        if (numInside === 0) {\n          allOutsideSinglePlane = true;\n          break;\n        }\n      }\n\n      if (!anyOutside)  // totally inside this set - no clip required\n        return ClipStatus.TrivialAccept;\n      if (!allOutsideSinglePlane)\n        return ClipStatus.ClipRequired;\n    }\n    return ClipStatus.TrivialReject;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static announceLoopsOfConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet | ClipPlane,\n    range: Range3d,\n    loopFunction: (loopPoints: GrowableXYZArray) => void,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): void {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      if (convexSet instanceof ConvexClipPlaneSet) {\n        for (const plane of convexSet.planes) {\n          if (ignoreInvisiblePlanes && plane.invisible)\n            continue;\n          const pointsClippedToRange = plane.intersectRange(range, true);\n          const finalPoints = new GrowableXYZArray();\n          if (pointsClippedToRange) {\n            convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n            if (finalPoints.length > 0)\n              loopFunction(finalPoints);\n          }\n        }\n      } else {  // `convexSet` is just one plane ...\n        if (ignoreInvisiblePlanes && convexSet.invisible) {\n          // skip it !\n        } else {\n          const pointsClippedToRange = convexSet.intersectRange(range, true);\n          if (pointsClippedToRange)\n            loopFunction(pointsClippedToRange);\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        if (convexSet instanceof ConvexClipPlaneSet) {\n          convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n          if (finalPoints.length > 0)\n            loopFunction(finalPoints);\n        } else {\n          convexSet.clipConvexPolygonInPlace(lineString.packedPoints, work);\n          if (lineString.packedPoints.length > 0)\n            loopFunction(lineString.packedPoints);\n        }\n      }\n    }\n  }\n  /**\n   * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set\n   * intersecting a range.\n   * * Return zero length array for (a) null range or (b) no intersections\n   * @param allClippers convex or union clipper\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static loopsOfConvexClipPlaneIntersectionWithRange(\n    allClippers: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPlane,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): GeometryQuery[] {\n    const result: GeometryQuery[] = [];\n    if (allClippers instanceof UnionOfConvexClipPlaneSets) {\n      for (const clipper of allClippers.convexSets) {\n        this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range,\n          (points: GrowableXYZArray) => {\n            if (points.length > 0) result.push(Loop.createPolygon(points));\n          },\n          includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n      }\n    } else if (allClippers instanceof ConvexClipPlaneSet || allClippers instanceof ClipPlane) {\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(allClippers, range,\n        (points: GrowableXYZArray) => {\n          if (points.length > 0) result.push(Loop.createPolygon(points));\n        },\n        includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n    }\n    return result;\n  }\n  /**\n   * Return the (possibly null) range of the intersection of the convex set with a range.\n   * * The convex set is permitted to be unbounded (e.g. a single plane).  The range parameter provides bounds.\n   * @param convexSet convex set for intersection.\n   * @param range range to intersect\n   */\n  public static rangeOfConvexClipPlaneSetIntersectionWithRange(convexSet: ConvexClipPlaneSet, range: Range3d): Range3d {\n    const result = Range3d.createNull();\n    this.announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet, range,\n      (points: GrowableXYZArray) => {\n        if (points.length > 0) result.extendArray(points);\n      },\n      true, true, false);\n    return result;\n  }\n  /**\n   * Return the range of various types of clippers\n   * * `ConvexClipPlaneSet` -- dispatch to `rangeOfConvexClipPlaneSetIntersectionWithRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and this effectively returns the range of the edge work of the members\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and \"invisible\" parts do not restrict the range.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static rangeOfClipperIntersectionWithRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): Range3d {\n    if (clipper === undefined)\n      return range.clone();\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.rangeOfConvexClipPlaneSetIntersectionWithRange(clipper, range);\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      const rangeUnion = Range3d.createNull();\n      for (const c of clipper.convexSets) {\n        const rangeC = this.rangeOfConvexClipPlaneSetIntersectionWithRange(c, range);\n        rangeUnion.extendRange(rangeC);\n      }\n      return rangeUnion;\n    }\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)\n        return range.clone();\n      return this.rangeOfClipperIntersectionWithRange(clipper.fetchClipPlanesRef(), range);\n    }\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return rangeIntersection;\n\n    }\n    return range.clone();\n  }\n  /**\n   * Test if various types of clippers have any intersection with a range.\n   * * This follows the same logic as `rangeOfClipperIntersectionWithRange` but attempts to exit at earliest point of confirmed intersection\n   * * `ConvexClipPlaneSet` -- dispatch to `doesConvexClipPlaneSetIntersectRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and holes do not affect the result.\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and may affect the result.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static doesClipperIntersectRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): boolean {\n    if (clipper === undefined)\n      return true;\n\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.doesConvexClipPlaneSetIntersectRange(clipper, range);\n\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      for (const c of clipper.convexSets) {\n        if (this.doesConvexClipPlaneSetIntersectRange(c, range))\n          return true;\n      }\n      return false;\n    }\n\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)    // um is there an easy way to detect range-completely-inside?\n        return true;\n      return this.doesClipperIntersectRange(clipper.fetchClipPlanesRef(), range);\n    }\n\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return !rangeIntersection.isNull;\n    }\n    /** If the case statement above is complete for the variant inputs, this is unreachable .. */\n    return false;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static doesConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): boolean {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      for (const plane of convexSet.planes) {\n        if (ignoreInvisiblePlanes && plane.invisible)\n          continue;\n        const pointsClippedToRange = plane.intersectRange(range, true);\n        if (pointsClippedToRange) {\n          const finalPoints = new GrowableXYZArray();\n          convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n          if (finalPoints.length > 0)\n            return true;\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n        if (finalPoints.length > 0)\n          return true;\n      }\n    }\n    return false;\n  }\n  /**\n   * Create a clipper from the transformed range.\n   * @param range input range to create clipper from\n   * @param transform how to transform the range (NOTE: applied to the range faces without swelling the range volume)\n   * @param degeneratePoints optionally populated with the 1 or 2 points defining the transformed range if it is degenerate (all points colinear/coincident); otherwise untouched\n   * @returns newly constructed clipper. If no clip planes could be computed, fill `degeneratePoints` and return undefined.\n  */\n  private static createClipperFromTransformedRange3d(range: Range3d, transform: Transform, degeneratePoints?: Point3d[]): ConvexClipPlaneSet | undefined {\n    if (!transform)\n      transform = Transform.createIdentity();\n    const builder = PolyfaceBuilder.create();\n    builder.addTransformedRangeMesh(transform, range);\n    const mesh = builder.claimPolyface();\n    const clipper = this._workClipper = ConvexClipPlaneSet.createConvexPolyface(mesh, this._workClipper).clipper;\n    if (clipper.planes.length > 0)\n      return clipper;\n    // no faces found in the compressed mesh\n    if (degeneratePoints) {\n      assert(mesh.data.point.length <= 2);\n      for (let i = 0; i < 2; ++i) {\n        const point = mesh.data.point.getPoint3dAtCheckedPointIndex(i);\n        if (point)\n          degeneratePoints.push(point);\n      }\n    }\n    return undefined;\n  }\n  /**\n   * Handle pathological cases of range-range intersection, where one of the ranges defines no area or volume (is a line segment or single point).\n   * @param range local range to intersect with the point/segment\n   * @param points isolated local point, or local segment's start and end\n   * @param localToWorld optional transform for output range\n   * @param intersection optional range of the intersection, in world coordinates, or null range if no intersection.\n   * @returns whether the point/segment intersects the range\n   */\n  private static rangeIntersectPointOrSegment(range: Range3d, points: Point3d[], localToWorld?: Transform, intersection?: Range3d): boolean {\n    const announceInterval: AnnounceNumberNumberCurvePrimitive | undefined = intersection ?\n      (f0: number, f1: number, cp: CurvePrimitive) => {\n        intersection.extendPoint(cp.fractionToPoint(f0), localToWorld);\n        intersection.extendPoint(cp.fractionToPoint(f1), localToWorld);\n      } : undefined;\n    let hasIntersection = false;\n    if (points.length > 1) {\n      const segment = LineSegment3d.createCapture(points[0], points[1]);\n      const clipper = ConvexClipPlaneSet.createRange3dPlanes(range);\n      hasIntersection = segment.announceClipIntervals(clipper, announceInterval);\n    } else if (points.length > 0) {\n      hasIntersection = range.containsPoint(points[0]);\n      if (hasIntersection && intersection)\n        intersection.extendPoint(points[0], localToWorld);\n    }\n    return hasIntersection;\n  }\n  /**\n   * Test for intersection of two ranges in different local coordinates.\n   * * Useful for clash detection of elements in iModels, using their stored (tight) local ranges and placement transforms.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param range1Margin optional signed local distance to expand/contract the second range before intersection. Positive expands.\n   * @return whether the local ranges are adjacent or intersect. Also returns false if local1ToWorld is singular.\n   */\n  public static doLocalRangesIntersect(\n    range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, range1Margin?: number,\n  ): boolean {\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return false;\n    let myRange1 = range1;\n    if (range1Margin) {\n      myRange1 = this._workRange = range1.clone(this._workRange);\n      myRange1.expandInPlace(range1Margin);\n    }\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      return this.doesClipperIntersectRange(clipper, myRange1);\n    return this.rangeIntersectPointOrSegment(myRange1, degeneratePoints, local1ToWorld);\n  }\n  /**\n   * Compute the range of the intersection between two local (e.g., element-aligned) ranges.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param result optional pre-allocated range to fill and return\n   * @return range of the intersection (aligned to world axes). Returns null range if local1ToWorld is singular.\n   */\n  public static rangeOfIntersectionOfLocalRanges(range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, result?: Range3d): Range3d {\n    const myResult = Range3d.createNull(result);\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return myResult;\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range1, (loopPoints: GrowableXYZArray) => { loopPoints.extendRange(myResult, local1ToWorld); });\n    else\n      this.rangeIntersectPointOrSegment(range1, degeneratePoints, local1ToWorld, myResult);\n    return myResult;\n  }\n  /**\n   * Test if `obj` is a `Clipper` object.\n   * * This is implemented by testing for each of the methods in the `Clipper` interface.\n   */\n  public static isClipper(obj: any): boolean {\n    if (obj) {\n      if (obj.isPointOnOrInside\n        && obj.announceClippedSegmentIntervals\n        && obj.announceClippedArcIntervals)\n        return true;\n    }\n    return false;\n  }\n  /**\n   * Specialized logic for replacing clip fragments by an equivalent singleton.\n   * * If there are baseCount + 1 or fewer fragments, do nothing.\n   * * If there are more than baseCount+1 fragments:\n   *   * drop them all to the cache\n   *   * push a copy of the singleton.\n   * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments,\n   * and then be able to determine that they really are the original pre-clip polygon unchanged.\n   * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.\n   * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.\n   * * This determination is solely within the logic of the caller.\n   * @param shards array of fragments\n   * @param baseCount original count\n   * @param singleton single array which may be a replacement for multiple fragments\n   * @param cache cache for array management\n   */\n  public static restoreSingletonInPlaceOfMultipleShards(\n    fragments: GrowableXYZArray[] | undefined, baseCount: number, singleton: IndexedXYZCollection, arrayCache: GrowableXYZArrayCache,\n  ): void {\n    if (fragments && fragments.length > baseCount + 1) {\n      while (fragments.length > baseCount) {\n        const f = fragments.pop();\n        arrayCache.dropToCache(f);\n      }\n      fragments.push(arrayCache.grabAndFill(singleton));\n    }\n  }\n  /**\n   * Create a UnionOfConvexClipPlaneSets for a volume defined by a path and offsets.\n   * @param points points along the path.\n   * @param positiveOffsetLeft offset to left.  0 is clip on the path.\n   * @param positiveOffsetRight offset to the right.  0 is clip on the path.\n   * @param z0 z for lower clipping plane.  If undefined, unbounded in positive z\n   * @param z1 z for upper clipping plane.  If undefined, unbounded in negative z.\n   * @alpha\n   */\n  public static createXYOffsetClipFromLineString(\n    points: Point3d[] | IndexedXYZCollection, leftOffset: number, rightOffset: number, z0: number, z1: number,\n  ): UnionOfConvexClipPlaneSets {\n    if (Array.isArray(points)) {\n      return LineStringOffsetClipperContext.createClipBetweenOffsets(\n        new Point3dArrayCarrier(points), leftOffset, rightOffset, z0, z1);\n    }\n    return LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);\n  }\n  /** If data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache. */\n  public static captureOrDrop(\n    data: GrowableXYZArray, minLength: number, destination: GrowableXYZArray[], cache: GrowableXYZArrayCache,\n  ): void {\n    if (data.length >= minLength)\n      destination.push(data);\n    else\n      cache.dropToCache(data);\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentToLLeftOfLineXY(\n    linePointA: XAndY, linePointB: XAndY, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    const ux = linePointB.x - linePointA.x;\n    const uy = linePointB.y - linePointA.y;\n    // negative is in positive is out ...\n    const h0 = -(ux * (segmentPoint0.y - linePointA.y) - uy * (segmentPoint0.x - linePointA.x));\n    const h1 = -(ux * (segmentPoint1.y - linePointA.y) - uy * (segmentPoint1.x - linePointA.x));\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in .....\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to a triangle.\n   * * Triangle is assumed CCW\n   * @param pointA point of triangle.\n   * @param pointB point of triangle.\n   * @param pointC point of triangle.\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentToCCWTriangleXY(\n    pointA: XAndY, pointB: XAndY, pointC: XAndY, segment0: XAndY, segment1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    if (!interval.isNull) {\n      this.clipSegmentToLLeftOfLineXY(pointA, pointB, segment0, segment1, interval, absoluteTolerance);\n      if (!interval.isNull) {\n        this.clipSegmentToLLeftOfLineXY(pointB, pointC, segment0, segment1, interval, absoluteTolerance);\n        if (!interval.isNull) {\n          this.clipSegmentToLLeftOfLineXY(pointC, pointA, segment0, segment1, interval, absoluteTolerance);\n        }\n      }\n    }\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentBelowPlaneXY(\n    plane: Plane3dByOriginAndUnitNormal, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    // negative is in positive is out ...\n    const h0 = plane.altitudeXY(segmentPoint0.x, segmentPoint0.y);\n    const h1 = plane.altitudeXY(segmentPoint1.x, segmentPoint1.y);\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in ..... the interval is unaffected.\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to an array of planes\n   * * plane normals assumed OUTWARD\n   * * planeAltitude is typically a tolerance a tolerance distance.\n   *   * positive altitude makes tha plane move in the direction of the unit normal.\n   * @param planes array of planes\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentBelowPlanesXY(\n    planes: Plane3dByOriginAndUnitNormal[], segment0: XAndY, segment1: XAndY, interval: Range1d, signedAltitude: number = 1.0e-14,\n  ): void {\n    const numPlanes = planes.length;\n    for (let i = 0; (!interval.isNull) && i < numPlanes; i++) {\n      this.clipSegmentBelowPlaneXY(planes[i], segment0, segment1, interval, signedAltitude);\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Resolve the fractional clips to simple points for announcement.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   * @param announce caller's handler for simple point pairs.\n   */\n  public static announcePolylineClip(\n    clipper: Clipper, points: Point3d[], announce: (point0: Point3d, point1: Point3d) => void,\n  ): void {\n    for (let i = 0; i + 1 < points.length; i++) {\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => {\n          announce(points[i].interpolate(f0, points[i + 1]), points[i].interpolate(f1, points[i + 1]));\n        });\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Sum the lengths of the clipped pieces.  Return the sum.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   */\n  public static sumPolylineClipLength(clipper: Clipper, points: Point3d[]): number {\n    let s = 0;\n    for (let i = 0; i + 1 < points.length; i++) {\n      const a = points[i].distance(points[i + 1]);\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => { s += Math.abs(f1 - f0) * a; });\n    }\n    return s;\n  }\n  /**\n   * Pass polygon `xyz` through a sequence of PolygonClip steps.\n   * * At the outset, `xyz` is the (only) entry in a set of candidates.\n   * * For each clipper, each candidate is presented for appendPolygon to inside and outside parts.\n   * * Each (in,out) result is distributed among (acceptedIn, acceptedOut, candidates) according to\n   *      (inAction, outAction)\n   * * At the end, all remaining candidates are distributed among (acceptedIn, acceptedOut, finalUnknown)\n   *     according to finalAction\n   * * Any clipper that does not have an appendPolygonClip method is skipped.\n   * @param xyz\n   * @param clippers\n   * @param acceptedIn\n   * @param acceptedOut\n   * @param finalCandidates\n   * @param inAction\n   * @param outAction\n   * @param finalCandidateAction\n   */\n  public static doPolygonClipSequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    finalCandidates: GrowableXYZArray[] | undefined,\n    inAction: ClipStepAction,\n    outAction: ClipStepAction,\n    finalFragmentAction: ClipStepAction,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidates = [arrayCache.grabAndFill(xyz)];\n    let nextCandidates: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    const oldInsideCount = acceptedIn ? acceptedIn.length : 0;\n    const oldOutsideCount = acceptedOut ? acceptedOut.length : 0;\n    let shard;\n    // At each convex set, carryForwardA is all the fragments that have been outside all previous convex sets.\n    // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to\n    // the next clipper. The final surviving carryForward really is out.\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        while (undefined !== (shard = candidates.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(inAction, intermediateIn, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          distributeFragments(outAction, intermediateOut, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // candidates is empty !!\n        const temp = candidates; candidates = nextCandidates; nextCandidates = temp;\n      }\n    }\n    distributeFragments(finalFragmentAction, candidates, acceptedIn, acceptedOut, finalCandidates, arrayCache);\n    // Note: The following assumes that there were no residual candidates ... need to track if that happened?\n    // If nothing was out, the inside fragments can be replaced by the original.\n    if (acceptedOut?.length === oldOutsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedIn, oldInsideCount, xyz, arrayCache);\n    // If nothing was in, the outside fragments can be replaced by the original.\n    if (acceptedIn?.length === oldInsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedOut, oldOutsideCount, xyz, arrayCache);\n  }\n  /** Pass polygon `xyz` through a sequence of PolygonClip steps with \"parity\" rules */\n  public static doPolygonClipParitySequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidatesOut = [arrayCache.grabAndFill(xyz)];\n    let candidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesOut: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    let shard;\n    // at each step ..\n    // candidatesIn and candidatesOut are evolved in and out\n    // nextCandidatesIn and nextCandidatesOut are EMPTY\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesIn.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesOut.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // reload each candidate step\n        const tempA = candidatesIn; candidatesIn = nextCandidatesIn; nextCandidatesIn = tempA;\n        const tempB = candidatesOut; candidatesOut = nextCandidatesOut; nextCandidatesOut = tempB;\n      }\n    }\n    // candidatesIn and candidatesOut are final ....\n    if (candidatesOut.length === 0)\n      acceptedIn?.push(arrayCache.grabAndFill(xyz));\n    else if (candidatesOut.length === 0)\n      acceptedOut?.push(arrayCache.grabAndFill(xyz));\n    else {\n      moveFragments(candidatesIn, acceptedIn, arrayCache);\n      moveFragments(candidatesOut, acceptedOut, arrayCache);\n    }\n  }\n  /**\n   * For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that\n   * abuts the outer volume of the neighbor faces.\n   */\n  public static createComplementaryClips(clipper: ConvexClipPlaneSet): UnionOfConvexClipPlaneSets {\n    const planes = clipper.planes;\n    const interval = Range1d.createNull();\n    const n = planes.length;\n    const newClippers: ConvexClipPlaneSet[] = [];\n    for (const p of planes) {\n      const outerSet = ConvexClipPlaneSet.createEmpty();\n      outerSet.addPlaneToConvexSet(p.cloneNegated());\n      newClippers.push(outerSet);\n    }\n    for (let i = 0; i < n; i++) {\n      for (let j = i + 1; j < n; j++) {\n        const ray = CurveFactory.planePlaneIntersectionRay(planes[i], planes[j]);\n        if (ray) {\n          if (clipper.hasIntersectionWithRay(ray, interval)) {\n            // the normal-to-normal vector is bisector (or close to bisector?)\n            const newNormal = planes[j].inwardNormalRef.minus(planes[i].inwardNormalRef);\n            const plane1 = ClipPlane.createNormalAndPoint(newNormal, ray.origin);\n            if (plane1) {\n              const plane2 = plane1.cloneNegated();\n              newClippers[i].addPlaneToConvexSet(plane1);\n              newClippers[j].addPlaneToConvexSet(plane2);\n            }\n          }\n        }\n      }\n    }\n    return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);\n  }\n}\nfunction moveFragments(\n  fragments: GrowableXYZArray[],\n  destination: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n/**\n * Distribute fragments among acceptedIn, acceptedOut, and passToNextStep as directed by action.\n * * If the indicated destination is unknown, drop the fragments to the arrayCache.\n * @param action destination selector\n * @param fragments fragments to be distributed\n * @param acceptedIn destination for \"in\"\n * @param acceptedOut destination for \"out\"\n * @param passToNextStep destination for fragments to be passed to a later step\n * @param arrayCache destination for un-distributed fragments.\n */\nfunction distributeFragments(\n  action: ClipStepAction,\n  fragments: GrowableXYZArray[],\n  acceptedIn: GrowableXYZArray[] | undefined,\n  acceptedOut: GrowableXYZArray[] | undefined,\n  passToNextStep: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  let destination;\n  if (action === ClipStepAction.acceptIn)\n    destination = acceptedIn;\n  else if (action === ClipStepAction.acceptOut)\n    destination = acceptedOut;\n  else if (action === ClipStepAction.passToNextStep)\n    destination = passToNextStep;\n  // remark: if action is other than the enum values, destination is undefined\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n"]}
+{"version":3,"file":"ClipUtils.js","sourceRoot":"","sources":["../../../src/clipping/ClipUtils.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,WAAW,EAAc,MAAM,0BAA0B,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAA4D,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAGnH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEnE,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAGlE,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,8BAA8B,EAAE,MAAM,mDAAmD,CAAC;AACnG,OAAO,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AAE1E;;;GAGG;AACH,MAAM,CAAN,IAAY,oBAOX;AAPD,WAAY,oBAAoB;IAC9B,yBAAyB;IACzB,mFAAkB,CAAA;IAClB,oCAAoC;IACpC,yEAAa,CAAA;IACb,0BAA0B;IAC1B,qFAAmB,CAAA;AACrB,CAAC,EAPW,oBAAoB,KAApB,oBAAoB,QAO/B;AACD;;;GAGG;AACH,MAAM,CAAN,IAAY,cAOX;AAPD,WAAY,cAAc;IACxB,4DAA4D;IAC5D,2DAAY,CAAA;IACZ,6DAA6D;IAC7D,8DAAc,CAAA;IACd,6CAA6C;IAC7C,uEAAkB,CAAA;AACpB,CAAC,EAPW,cAAc,KAAd,cAAc,QAOzB;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,UAOX;AAPD,WAAY,UAAU;IACpB,kDAAkD;IAClD,2DAAY,CAAA;IACZ,kCAAkC;IAClC,6DAAa,CAAA;IACb,iCAAiC;IACjC,6DAAa,CAAA;AACf,CAAC,EAPW,UAAU,KAAV,UAAU,QAOrB;AAmED;;;GAGG;AACH,MAAM,OAAO,aAAa;IACxB,wHAAwH;IAChH,MAAM,CAAC,cAAc,CAAa;IAClC,MAAM,CAAC,UAAU,CAAW;IAC5B,MAAM,CAAC,YAAY,CAAsB;IAEzC,MAAM,CAAC,2BAA2B,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAC9D;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAC7B,KAAqB,EACrB,iBAAuC,EACvC,OAAgB,EAChB,QAA6C;QAE7C,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,iBAAiB,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC;QACP,IAAI,IAAI,CAAC;QACT,MAAM,SAAS,GAAG,aAAa,CAAC,2BAA2B,CAAC;QAC5D,MAAM,CAAC,GAAG,iBAAiB,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,EAAE,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;YAC3C,IAAI,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAC,aAAa,EAAE,CAAC;gBACrC,IAAI,GAAG,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvB,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;oBAC/B,KAAK,CAAC,eAAe,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;oBACvC,IAAI,OAAO,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC;wBACzC,IAAI,QAAQ;4BACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;;4BAExB,OAAO,IAAI,CAAC;oBAChB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,CAAC;YACV,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CACvB,SAAoB,EAAE,EAAkB,EAAE,QAA6C;QAEvF,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;gBAC3B,QAAQ,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,KAAqB,EAAE,OAAgB;QACxE,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,CAAC,qBAAqB,CACzB,OAAO,EACP,CAAC,SAAiB,EAAE,SAAiB,EAAE,MAAsB,EAAE,EAAE;YAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,YAAY,GAAG,MAAM,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACpE,IAAI,YAAY;oBACd,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAgB;QAC7D,IAAI,MAA+B,CAAC;QACpC,MAAM,YAAY,GAAG,aAAa,CAAC,cAAc,GAAG,YAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,CAAC,cAAc,CAAC,CAAC;QACzI,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,YAAY,GAAG,YAAY,EAAE,OAAO,EAAE,CAAC;QAC7C,IAAI,CAAC,YAAY;YACf,OAAO,MAAM,CAAC;QAChB,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAc,CAAC,CAAC,0CAA0C;QAClH,IAAI,CAAC,WAAW;YACd,OAAO,MAAM,CAAC;QAChB,uGAAuG;QACvG,qGAAqG;QACrG,6GAA6G;QAC7G,gHAAgH;QAChH,iFAAiF;QACjF,MAAM,gBAAgB,GAAG,aAAa,CAAC,UAAU,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QACxE,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,YAAY,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAC/F,SAAS,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QAC5C,kGAAkG;QAClG,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,gBAAgB,GAAuB,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC1C,OAAO,CAAC,iBAAiB,EAAE,CAAC,SAAS,CAAC,YAAY,EAAE,eAAe,EAAE,gBAAgB,EAAE,KAAK,CAAC,CAAC;QAC9F,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1C,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;YACvC,MAAM,kBAAkB,GAAG,SAAS,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,EAAE,kBAAkB,CAAC,YAAY,CAAC,CAAC;YACzG,IAAI,kBAAkB,EAAE,CAAC;gBACvB,kBAAkB,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;gBACrD,IAAI,CAAC,MAAM;oBACT,MAAM,GAAG,CAAC,kBAAkB,YAAY,WAAW,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC;gBACrH,IAAI,kBAAkB,YAAY,WAAW;oBAC3C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC,4BAA4B;;oBAElF,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,YAAY,CAAC,KAAe,EAAE,OAAgB;QAC1D,IAAI,KAAK,YAAY,cAAc;YACjC,OAAO,aAAa,CAAC,oBAAoB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5D,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,aAAa,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACxD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1B,CAAC;QACD,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,IAAI,KAAK,YAAY,IAAI,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;YAC1D,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACnC,MAAM,WAAW,GAAG,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,sBAAsB,CAAC,OAAkB,EAAE,SAAwB;QAC/E,MAAM,OAAO,GAAG,IAAI,CAAC,6CAA6C,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,OAAO;YACrB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6CAA6C,CACzD,OAAkB,EAAE,SAAwB;QAE5C,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC/C,0CAA0C;QAC1C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAwB,EAAE,QAAoC,EAAE,SAAiB;QAEjF,IAAI,QAAQ,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,UAAU,CAAC,aAAa,CAAC;QAElC,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;YAC5C,IAAI,qBAAqB,GAAG,KAAK,EAAE,UAAU,GAAG,KAAK,CAAC;YAEtD,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,SAAS,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;gBAClC,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAEjD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;gBAChC,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;oBAClD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBACxB,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,eAAe,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;gBACzF,CAAC;gBAED,UAAU,GAAG,CAAC,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC;gBACpD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,qBAAqB,GAAG,IAAI,CAAC;oBAC7B,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,UAAU,EAAG,6CAA6C;gBAC7D,OAAO,UAAU,CAAC,aAAa,CAAC;YAClC,IAAI,CAAC,qBAAqB;gBACxB,OAAO,UAAU,CAAC,YAAY,CAAC;QACnC,CAAC;QACD,OAAO,UAAU,CAAC,aAAa,CAAC;IAClC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,+CAA+C,CAC3D,SAAyC,EACzC,KAAc,EACd,YAAoD,EACpD,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,IAAI,SAAS,YAAY,kBAAkB,EAAE,CAAC;gBAC5C,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;oBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;wBAC1C,SAAS;oBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,IAAI,oBAAoB,EAAE,CAAC;wBACzB,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;wBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;4BACxB,YAAY,CAAC,WAAW,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,CAAC,CAAE,oCAAoC;gBAC5C,IAAI,qBAAqB,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;oBACjD,YAAY;gBACd,CAAC;qBAAM,CAAC;oBACN,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;oBACnE,IAAI,oBAAoB;wBACtB,YAAY,CAAC,oBAAoB,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,IAAI,SAAS,YAAY,kBAAkB,EAAE,CAAC;oBAC5C,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,YAAY,CAAC,WAAW,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,SAAS,CAAC,wBAAwB,CAAC,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAClE,IAAI,UAAU,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC;wBACpC,YAAY,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2CAA2C,CACvD,WAAwE,EACxE,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,IAAI,WAAW,YAAY,0BAA0B,EAAE,CAAC;YACtD,KAAK,MAAM,OAAO,IAAI,WAAW,CAAC,UAAU,EAAE,CAAC;gBAC7C,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,KAAK,EACjE,CAAC,MAAwB,EAAE,EAAE;oBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;wBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;gBACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;aAAM,IAAI,WAAW,YAAY,kBAAkB,IAAI,WAAW,YAAY,SAAS,EAAE,CAAC;YACzF,IAAI,CAAC,+CAA+C,CAAC,WAAW,EAAE,KAAK,EACrE,CAAC,MAAwB,EAAE,EAAE;gBAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACjE,CAAC,EACD,qBAAqB,EAAE,iBAAiB,EAAE,qBAAqB,CAAC,CAAC;QACrE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,8CAA8C,CAAC,SAA6B,EAAE,KAAc;QACxG,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,+CAA+C,CAAC,SAAS,EAAE,KAAK,EACnE,CAAC,MAAwB,EAAE,EAAE;YAC3B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBAAE,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpD,CAAC,EACD,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,mCAAmC,CAC/C,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,8CAA8C,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC7E,IAAI,OAAO,YAAY,0BAA0B,EAAE,CAAC;YAClD,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,8CAA8C,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7E,UAAU,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,IAAI,OAAO,YAAY,aAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS;gBAC3C,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,mCAAmC,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QACvF,CAAC;QACD,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,iBAAiB,CAAC;QAE3B,CAAC;QACD,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CACrC,OAAiG,EACjG,KAAc,EACd,uBAAgC,IAAI;QAEpC,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,IAAI,CAAC;QAEd,IAAI,OAAO,YAAY,kBAAkB;YACvC,OAAO,IAAI,CAAC,oCAAoC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEnE,IAAI,OAAO,YAAY,0BAA0B,EAAE,CAAC;YAClD,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;gBACnC,IAAI,IAAI,CAAC,oCAAoC,CAAC,CAAC,EAAE,KAAK,CAAC;oBACrD,OAAO,IAAI,CAAC;YAChB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,OAAO,YAAY,aAAa,EAAE,CAAC;YACrC,IAAI,oBAAoB,IAAI,OAAO,CAAC,SAAS,EAAK,6DAA6D;gBAC7G,OAAO,IAAI,CAAC;YACd,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,KAAK,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,OAAO,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,iBAAiB,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;YACxC,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,oBAAoB,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;oBACxC,sFAAsF;gBACxF,CAAC;qBAAM,CAAC;oBACN,MAAM,MAAM,GAAG,IAAI,CAAC,mCAAmC,CAAC,CAAC,EAAE,KAAK,EAAE,oBAAoB,CAAC,CAAC;oBACxF,iBAAiB,CAAC,SAAS,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YACD,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC;QACnC,CAAC;QACD,6FAA6F;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,oCAAoC,CAChD,SAA6B,EAC7B,KAAc,EACd,wBAAiC,IAAI,EACrC,oBAA6B,IAAI,EACjC,qBAAqB,GAAG,KAAK;QAE7B,MAAM,IAAI,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,qBAAqB,EAAE,CAAC;YAC1B,0EAA0E;YAC1E,KAAK,MAAM,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;gBACrC,IAAI,qBAAqB,IAAI,KAAK,CAAC,SAAS;oBAC1C,SAAS;gBACX,MAAM,oBAAoB,GAAG,KAAK,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC/D,IAAI,oBAAoB,EAAE,CAAC;oBACzB,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;oBAC3C,SAAS,CAAC,WAAW,CAAC,oBAAoB,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;oBACtE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;wBACxB,OAAO,IAAI,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,iBAAiB,EAAE,CAAC;YACtB,2CAA2C;YAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAC7C,MAAM,WAAW,GAAG,IAAI,gBAAgB,EAAE,CAAC;gBAC3C,MAAM,UAAU,GAAG,YAAY,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,YAAY,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;gBAClE,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;oBACxB,OAAO,IAAI,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACM,MAAM,CAAC,mCAAmC,CAAC,KAAc,EAAE,SAAoB,EAAE,gBAA4B;QACnH,IAAI,CAAC,SAAS;YACZ,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC;QACzC,OAAO,CAAC,uBAAuB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,kBAAkB,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC;QAC7G,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YAC3B,OAAO,OAAO,CAAC;QACjB,wCAAwC;QACxC,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;YACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,KAAK;oBACP,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,4BAA4B,CAAC,KAAc,EAAE,MAAiB,EAAE,YAAwB,EAAE,YAAsB;QAC7H,MAAM,gBAAgB,GAAmD,YAAY,CAAC,CAAC;YACrF,CAAC,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,EAAE;gBAC7C,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC/D,YAAY,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACjE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChB,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,OAAO,GAAG,kBAAkB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC9D,eAAe,GAAG,OAAO,CAAC,qBAAqB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;QAC7E,CAAC;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,eAAe,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,eAAe,IAAI,YAAY;gBACjC,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,YAAqB;QAE3G,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,MAAM,CAAC;QACtB,IAAI,YAAY,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;QACvC,CAAC;QACD,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,OAAO,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,gBAAgB,EAAE,aAAa,CAAC,CAAC;IACtF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAe,EAAE,aAAwB,EAAE,MAAe,EAAE,aAAwB,EAAE,MAAgB;QACnJ,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,aAAa,GAAG,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;QACvF,IAAI,CAAC,aAAa;YAChB,OAAO,QAAQ,CAAC;QAClB,MAAM,gBAAgB,GAAc,EAAE,CAAC;QACvC,MAAM,cAAc,GAAG,aAAa,CAAC,0BAA0B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QAC9F,kFAAkF;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;QACnG,IAAI,OAAO;YACT,IAAI,CAAC,+CAA+C,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,UAA4B,EAAE,EAAE,GAAG,UAAU,CAAC,WAAW,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;;YAE9J,IAAI,CAAC,4BAA4B,CAAC,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,QAAQ,CAAC,CAAC;QACvF,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,SAAS,CAAC,GAAQ;QAC9B,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,GAAG,CAAC,iBAAiB;mBACpB,GAAG,CAAC,+BAA+B;mBACnC,GAAG,CAAC,2BAA2B;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,uCAAuC,CACnD,SAAyC,EAAE,SAAiB,EAAE,SAA+B,EAAE,UAAiC;QAEhI,IAAI,SAAS,IAAI,SAAS,CAAC,MAAM,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;YAClD,OAAO,SAAS,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;gBACpC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBAC1B,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAC5C,MAAwC,EAAE,UAAkB,EAAE,WAAmB,EAAE,EAAU,EAAE,EAAU;QAEzG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,OAAO,8BAA8B,CAAC,wBAAwB,CAC5D,IAAI,mBAAmB,CAAC,MAAM,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACtE,CAAC;QACD,OAAO,8BAA8B,CAAC,wBAAwB,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC1G,CAAC;IACD,2GAA2G;IACpG,MAAM,CAAC,aAAa,CACzB,IAAsB,EAAE,SAAiB,EAAE,WAA+B,EAAE,KAA4B;QAExG,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS;YAC1B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,0BAA0B,CACtC,UAAiB,EAAE,UAAiB,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAExI,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC;QACvC,qCAAqC;QACrC,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5F,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,iCAAiC;YACjC,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAa,EAAE,MAAa,EAAE,MAAa,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAErI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;YACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;gBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;oBACrB,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,iBAAiB,CAAC,CAAC;gBACnG,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,uBAAuB,CACnC,KAAmC,EAAE,aAAoB,EAAE,aAAoB,EAAE,QAAiB,EAAE,oBAA4B,OAAO;QAEvI,qCAAqC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,EAAE,GAAG,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,EAAE,CAAC;YACrD,6DAA6D;YAC7D,OAAO;QACT,CAAC;QACD,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YAClB,IAAI,EAAE,GAAG,GAAG;gBACV,QAAQ,CAAC,OAAO,EAAE,CAAC;QACvB,CAAC;aAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;YACzB,2CAA2C;YAC3C,MAAM,QAAQ,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,OAAO,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACN,OAAO,QAAQ,CAAC,uBAAuB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,2HAA2H;YAC3H,qFAAqF;YACrF,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACb,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;iBAAM,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;gBACpB,QAAQ,CAAC,uBAAuB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,wBAAwB,CACpC,MAAsC,EAAE,QAAe,EAAE,QAAe,EAAE,QAAiB,EAAE,iBAAyB,OAAO;QAE7H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAChC,OAAgB,EAAE,MAAiB,EAAE,QAAoD;QAEzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;gBACzB,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/F,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,OAAgB,EAAE,MAAiB;QACrE,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5C,OAAO,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EACpE,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;;;;;OAiBG;IACI,MAAM,CAAC,qBAAqB,CACjC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,eAA+C,EAC/C,QAAwB,EACxB,SAAyB,EACzB,mBAAmC,EACnC,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC3C,IAAI,UAAU,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,cAAc,GAAuB,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAG,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,MAAM,eAAe,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC;QACV,0GAA0G;QAC1G,4GAA4G;QAC5G,oEAAoE;QACpE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAChD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,QAAQ,EAAE,cAAc,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACnG,mBAAmB,CAAC,SAAS,EAAE,eAAe,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;oBACrG,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,yBAAyB;gBACzB,MAAM,IAAI,GAAG,UAAU,CAAC;gBAAC,UAAU,GAAG,cAAc,CAAC;gBAAC,cAAc,GAAG,IAAI,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,mBAAmB,CAAC,mBAAmB,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QAC3G,yGAAyG;QACzG,4EAA4E;QAC5E,IAAI,WAAW,EAAE,MAAM,KAAK,eAAe;YACzC,aAAa,CAAC,uCAAuC,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QACrG,4EAA4E;QAC5E,IAAI,UAAU,EAAE,MAAM,KAAK,cAAc;YACvC,aAAa,CAAC,uCAAuC,CAAC,WAAW,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;IACzG,CAAC;IACD,qFAAqF;IAC9E,MAAM,CAAC,2BAA2B,CACvC,GAAyB,EACzB,QAAmB,EACnB,UAA0C,EAC1C,WAA2C,EAC3C,UAA6C;QAE7C,IAAI,UAAU,KAAK,SAAS;YAC1B,UAAU,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC3C,IAAI,aAAa,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,IAAI,YAAY,GAAuB,EAAE,CAAC;QAC1C,IAAI,gBAAgB,GAAuB,EAAE,CAAC;QAC9C,IAAI,iBAAiB,GAAuB,EAAE,CAAC;QAC/C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,MAAM,eAAe,GAAuB,EAAE,CAAC;QAC/C,IAAI,KAAK,CAAC;QACV,kBAAkB;QAClB,wDAAwD;QACxD,mDAAmD;QACnD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,CAAC,iBAAiB,EAAE,CAAC;gBACxB,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBAClD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC1H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,oDAAoD;gBACpD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;oBACxE,mBAAmB,CAAC,cAAc,CAAC,QAAQ,EAAE,cAAc,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBACzH,mBAAmB,CAAC,cAAc,CAAC,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;oBAC3H,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,6BAA6B;gBAC7B,MAAM,KAAK,GAAG,YAAY,CAAC;gBAAC,YAAY,GAAG,gBAAgB,CAAC;gBAAC,gBAAgB,GAAG,KAAK,CAAC;gBACtF,MAAM,KAAK,GAAG,aAAa,CAAC;gBAAC,aAAa,GAAG,iBAAiB,CAAC;gBAAC,iBAAiB,GAAG,KAAK,CAAC;YAC5F,CAAC;QACH,CAAC;QACD,gDAAgD;QAChD,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC3C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YACjC,WAAW,EAAE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;aAC5C,CAAC;YACJ,aAAa,CAAC,YAAY,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;YACpD,aAAa,CAAC,aAAa,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,wBAAwB,CAAC,OAA2B;QAChE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,WAAW,GAAyB,EAAE,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;YAClD,QAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/C,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC7B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,MAAM,GAAG,GAAG,YAAY,CAAC,yBAAyB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,IAAI,GAAG,EAAE,CAAC;oBACR,IAAI,OAAO,CAAC,sBAAsB,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,CAAC;wBAClD,kEAAkE;wBAClE,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;wBAC7E,MAAM,MAAM,GAAG,SAAS,CAAC,oBAAoB,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;wBACrE,IAAI,MAAM,EAAE,CAAC;4BACX,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,EAAE,CAAC;4BACrC,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;4BAC3C,WAAW,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;wBAC7C,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,0BAA0B,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;IAClE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,kDAAkD,CAC9D,UAAsB,EAAE,aAA6B,EAAE,cAAsB,QAAQ,CAAC,mBAAmB,EAAE,WAA0B;QAErI,MAAM,OAAO,GAAG,OAAO,CAAC,oBAAoB,CAAC,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAClG,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,OAAO,CAAC,wBAAwB,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAChF,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,QAAQ,CAAC,MAAM;YAC9E,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC,qCAAqC,CAAC,UAAU,CAAC,CAAC;IACnE,CAAC;;AAEH,SAAS,aAAa,CACpB,SAA6B,EAC7B,WAA2C,EAC3C,UAAiC;IAEjC,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC;AACD;;;;;;;;;GASG;AACH,SAAS,mBAAmB,CAC1B,MAAsB,EACtB,SAA6B,EAC7B,UAA0C,EAC1C,WAA2C,EAC3C,cAA8C,EAC9C,UAAiC;IAEjC,IAAI,WAAW,CAAC;IAChB,IAAI,MAAM,KAAK,cAAc,CAAC,QAAQ;QACpC,WAAW,GAAG,UAAU,CAAC;SACtB,IAAI,MAAM,KAAK,cAAc,CAAC,SAAS;QAC1C,WAAW,GAAG,WAAW,CAAC;SACvB,IAAI,MAAM,KAAK,cAAc,CAAC,cAAc;QAC/C,WAAW,GAAG,cAAc,CAAC;IAC/B,4EAA4E;IAC5E,IAAI,WAAW,KAAK,SAAS;QAC3B,UAAU,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;SAClC,CAAC;QACJ,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { BagOfCurves, CurveChain } from \"../curve/CurveCollection\";\nimport { CurveFactory } from \"../curve/CurveFactory\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AnyCurve, AnyRegion } from \"../curve/CurveTypes\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Path } from \"../curve/Path\";\nimport { RegionBinaryOpType, RegionOps } from \"../curve/RegionOps\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { Geometry } from \"../Geometry\";\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { LowAndHighXY, XAndY } from \"../geometry3d/XYZProps\";\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\nimport { Voronoi } from \"../topology/Voronoi\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipPrimitive } from \"./ClipPrimitive\";\nimport { ClipVector } from \"./ClipVector\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\nimport { LineStringOffsetClipperContext } from \"./internalContexts/LineStringOffsetClipperContext\";\nimport { UnionOfConvexClipPlaneSets } from \"./UnionOfConvexClipPlaneSets\";\n\n/**\n * Enumerated type for describing where geometry lies with respect to clipping planes.\n * @public\n */\nexport enum ClipPlaneContainment {\n  /** All points inside. */\n  StronglyInside = 1,\n  /** Inside/outside state unknown. */\n  Ambiguous = 2,\n  /** All points outside. */\n  StronglyOutside = 3,\n}\n/**\n * Enumeration of ways to handle an intermediate fragment from a clipping step.\n * @public\n */\nexport enum ClipStepAction {\n  /** Pass fragments directly to final accepted \"in\" state. */\n  acceptIn = 1,\n  /** Pass fragments directly to final accepted \"out\" state. */\n  acceptOut = -1,\n  /** Forward fragments to subsequent steps. */\n  passToNextStep = 0,\n}\n\n/**\n * Enumerated type for describing what must yet be done to clip a piece of geometry.\n * @public\n */\nexport enum ClipStatus {\n  /** Some geometry may cross the clip boundaries */\n  ClipRequired,\n  /** Geometry is clearly outside */\n  TrivialReject,\n  /** Geometry is clearly inside */\n  TrivialAccept,\n}\n\n/**\n * An object containing clipping planes that can be used to clip geometry.\n * @public\n */\nexport interface Clipper {\n  /** Test if `point` is on or inside the Clipper's volume. */\n  isPointOnOrInside(point: Point3d, tolerance?: number): boolean;\n  /**\n   * Find the parts of the line segment (if any) that is within the convex clip volume.\n   * * The line segment is defined by `pointA` and `pointB`.\n   * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.\n   * * To clip to the usual bounded line segment, start with fractions (0,1).\n   * If the clip volume is unbounded, the line interval may also be unbounded.\n   * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.\n   * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).\n   * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).\n   * @param pointA segment start (fraction 0)\n   * @param pointB segment end (fraction 1)\n   * @param announce function to be called to announce a fraction interval that is within the convex clip volume.\n   * @returns true if a segment was announced, false if entirely outside.\n   */\n  announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber\n  ): boolean;\n  /**\n   * Find the portion (or portions) of the arc (if any) that are within the convex clip volume.\n   * @param arc the arc to be clipped.\n   * @param announce function to be called to announce a fraction intervals that are within the convex clip volume.\n   * @returns true if one or more arcs portions were announced, false if entirely outside.\n   */\n  announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean;\n  /**\n   * Optional polygon clip method.\n   * * This is expected to be implemented by planar clip structures.\n   * * This is unimplemented for curve clippers (e.g. sphere) for which polygon clip result has curved edges.\n   * * The input polygon must be convex.\n   */\n  appendPolygonClip?: AppendPolygonClipFunction;\n}\n/**\n * Signature of method to execute polygon clip, distributing fragments of xyz among insideFragments and outsideFragments\n * @param xyz convex polygon. This is not changed.\n * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n * the cache. This is NOT cleared.\n * @param arrayCache cache for reusable GrowableXYZArray.\n */\ntype AppendPolygonClipFunction = (\n  xyz: IndexedXYZCollection,\n  insideFragments: GrowableXYZArray[],\n  outsideFragments: GrowableXYZArray[],\n  arrayCache: GrowableXYZArrayCache\n) => void;\n\n/**\n * Interface for clipping convex polygons.\n * Supported by:\n * * AlternatingCCTreeNode\n * * ConvexClipPlaneSet\n * @public\n */\nexport interface PolygonClipper {\n  appendPolygonClip: AppendPolygonClipFunction;\n}\n/**\n * Class whose various static methods are functions for clipping geometry\n * @public\n */\nexport class ClipUtilities {\n  // on-demand scratch objects for method implementations. If you use one, make sure it isn't already being used in scope.\n  private static _workTransform?: Transform;\n  private static _workRange?: Range3d;\n  private static _workClipper?: ConvexClipPlaneSet;\n\n  private static _selectIntervals01TestPoint = Point3d.create();\n  /**\n   * Augment the unsortedFractionsArray with 0 and 1\n   * * sort\n   * * test the midpoint of each interval with `clipper.isPointOnOrInside`\n   * * pass accepted intervals to `announce(f0,f1,curve)`\n   */\n  public static selectIntervals01(\n    curve: CurvePrimitive,\n    unsortedFractions: GrowableFloat64Array,\n    clipper: Clipper,\n    announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    unsortedFractions.push(0);\n    unsortedFractions.push(1);\n    unsortedFractions.sort();\n    let f0 = unsortedFractions.atUncheckedIndex(0);\n    let f1;\n    let fMid;\n    const testPoint = ClipUtilities._selectIntervals01TestPoint;\n    const n = unsortedFractions.length;\n    for (let i = 1; i < n; i++) {\n      f1 = unsortedFractions.atUncheckedIndex(i);\n      if (f1 > f0 + Geometry.smallFraction) {\n        fMid = 0.5 * (f0 + f1);\n        if (fMid >= 0.0 && fMid <= 1.0) {\n          curve.fractionToPoint(fMid, testPoint);\n          if (clipper.isPointOnOrInside(testPoint)) {\n            if (announce)\n              announce(f0, f1, curve);\n            else\n              return true;\n          }\n        }\n        f0 = f1;\n      }\n    }\n    return false;\n  }\n  /**\n   * Announce triples of (low, high, cp) for each entry in intervals.\n   * @param intervals source array\n   * @param cp CurvePrimitive for announcement\n   * @param announce function to receive data\n   */\n  public static announceNNC(\n    intervals: Range1d[], cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n  ): boolean {\n    if (announce) {\n      for (const ab of intervals) {\n        announce(ab.low, ab.high, cp);\n      }\n    }\n    return intervals.length > 0;\n  }\n  /**\n   * Compute and return portions of the input curve that are within the clipper.\n   * @param curve input curve, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped curves\n   */\n  public static collectClippedCurves(curve: CurvePrimitive, clipper: Clipper): CurvePrimitive[] {\n    const result: CurvePrimitive[] = [];\n    curve.announceClipIntervals(\n      clipper,\n      (fraction0: number, fraction1: number, curveA: CurvePrimitive) => {\n        if (fraction1 !== fraction0) {\n          const partialCurve = curveA.clonePartialCurve(fraction0, fraction1);\n          if (partialCurve)\n            result.push(partialCurve);\n        }\n      },\n    );\n    return result;\n  }\n  /**\n   * Compute and return the portions of the input region that are within the clipper.\n   * @param region input region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return clipped subregion, as a single `AnyRegion`\n   */\n  public static clipAnyRegion(region: AnyRegion, clipper: Clipper): AnyRegion | undefined {\n    let result: UnionRegion | undefined;\n    const localToWorld = ClipUtilities._workTransform = FrameBuilder.createRightHandedFrame(undefined, region, ClipUtilities._workTransform);\n    if (!localToWorld)\n      return result;\n    const worldToLocal = localToWorld?.inverse();\n    if (!worldToLocal)\n      return result;\n    const localRegion = region.cloneTransformed(worldToLocal) as AnyRegion; // parallel to xy-plane so we can ignore z\n    if (!localRegion)\n      return result;\n    // We can only clip convex polygons with our clipper machinery, but the input region doesn't have to be\n    // convex or even a polygon. We get around this limitation by using a Boolean operation, which admits\n    // *any* planar regions, albeit in local coordinates. First, we clip a rectangle that covers the input region\n    // (in world coordinates), then we intersect the resulting fragments with the input region in local coordinates.\n    // Finally, we assemble the results into a UnionRegion back in world coordinates.\n    const localRegionRange = ClipUtilities._workRange = localRegion.range();\n    const xLength = localRegionRange.xLength();\n    const yLength = localRegionRange.yLength();\n    const rectangle = LineString3d.createRectangleXY(localRegionRange.low, xLength, yLength, true);\n    rectangle.tryTransformInPlace(localToWorld);\n    // Clip the rectangle to produce fragment(s) which we can Boolean intersect with the input region.\n    const insideFragments: GrowableXYZArray[] = [];\n    const outsideFragments: GrowableXYZArray[] = [];\n    const cache = new GrowableXYZArrayCache();\n    clipper.appendPolygonClip?.(rectangle.packedPoints, insideFragments, outsideFragments, cache);\n    if (insideFragments.length === 0)\n      return result;\n    // Create the \"clipped region\".\n    for (const fragment of insideFragments) {\n      const loop = Loop.createPolygon(fragment);\n      loop.tryTransformInPlace(worldToLocal);\n      const clippedLocalRegion = RegionOps.regionBooleanXY(localRegion, loop, RegionBinaryOpType.Intersection);\n      if (clippedLocalRegion) {\n        clippedLocalRegion.tryTransformInPlace(localToWorld);\n        if (!result)\n          result = (clippedLocalRegion instanceof UnionRegion) ? clippedLocalRegion : UnionRegion.create(clippedLocalRegion);\n        if (clippedLocalRegion instanceof UnionRegion)\n          result.children.push(...clippedLocalRegion.children); // avoid nested UnionRegions\n        else\n          result.tryAddChild(clippedLocalRegion);\n      }\n    }\n    return result ? RegionOps.simplifyRegion(result) : undefined;\n  }\n  /**\n   * Compute and return portions of the input curve or region that are within the clipper.\n   * @param curve input curve or region, unmodified\n   * @param clipper used to compute the clipped components\n   * @return array of clipped components of the input curve or region that lie inside the clipper\n   */\n  public static clipAnyCurve(curve: AnyCurve, clipper: Clipper): AnyCurve[] {\n    if (curve instanceof CurvePrimitive)\n      return ClipUtilities.collectClippedCurves(curve, clipper);\n    if (curve.isAnyRegion()) {\n      const ret = ClipUtilities.clipAnyRegion(curve, clipper);\n      return ret ? [ret] : [];\n    }\n    const result: AnyCurve[] = [];\n    if (curve instanceof Path || curve instanceof BagOfCurves) {\n      for (const child of curve.children) {\n        const partialClip = ClipUtilities.clipAnyCurve(child, clipper);\n        result.push(...partialClip);\n      }\n    }\n    return result;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShape(polygon: Point3d[], clipShape: ClipPrimitive): Point3d[][] {\n    const outputA = this.clipPolygonToClipShapeReturnGrowableXYZArrays(polygon, clipShape);\n    const output = [];\n    for (const g of outputA)\n      output.push(g.getPoint3dArray());\n    return output;\n  }\n  /**\n   * Clip a polygon down to regions defined by each shape of a ClipShape.\n   * @return An multidimensional array of points, where each array is the boundary of part of the remaining polygon.\n   */\n  public static clipPolygonToClipShapeReturnGrowableXYZArrays(\n    polygon: Point3d[], clipShape: ClipPrimitive,\n  ): GrowableXYZArray[] {\n    const output: GrowableXYZArray[] = [];\n    const clipper = clipShape.fetchClipPlanesRef();\n    // NEEDS WORK -- what if it is a mask !!!!\n    if (clipper) {\n      clipper.polygonClip(polygon, output);\n    }\n    return output;\n  }\n  /**\n   * Given an array of points, test for trivial containment conditions.\n   * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.\n   * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.\n   * * ClipStatus.TrivialReject if neither of those occurred.\n   */\n  public static pointSetSingleClipStatus(\n    points: GrowableXYZArray, planeSet: UnionOfConvexClipPlaneSets, tolerance: number,\n  ): ClipStatus {\n    if (planeSet.convexSets.length === 0)\n      return ClipStatus.TrivialAccept;\n\n    for (const convexSet of planeSet.convexSets) {\n      let allOutsideSinglePlane = false, anyOutside = false;\n\n      for (const plane of convexSet.planes) {\n        let numInside = 0, numOutside = 0;\n        const planeDistance = plane.distance - tolerance;\n\n        const currPt = Point3d.create();\n        const currVec = Vector3d.create();\n        for (let i = 0; i < points.length; i++) {\n          points.getPoint3dAtUncheckedPointIndex(i, currPt);\n          currVec.setFrom(currPt);\n          currVec.dotProduct(plane.inwardNormalRef) > planeDistance ? numInside++ : numOutside++;\n        }\n\n        anyOutside = (numOutside !== 0) ? true : anyOutside;\n        if (numInside === 0) {\n          allOutsideSinglePlane = true;\n          break;\n        }\n      }\n\n      if (!anyOutside)  // totally inside this set - no clip required\n        return ClipStatus.TrivialAccept;\n      if (!allOutsideSinglePlane)\n        return ClipStatus.ClipRequired;\n    }\n    return ClipStatus.TrivialReject;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static announceLoopsOfConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet | ClipPlane,\n    range: Range3d,\n    loopFunction: (loopPoints: GrowableXYZArray) => void,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): void {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      if (convexSet instanceof ConvexClipPlaneSet) {\n        for (const plane of convexSet.planes) {\n          if (ignoreInvisiblePlanes && plane.invisible)\n            continue;\n          const pointsClippedToRange = plane.intersectRange(range, true);\n          const finalPoints = new GrowableXYZArray();\n          if (pointsClippedToRange) {\n            convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n            if (finalPoints.length > 0)\n              loopFunction(finalPoints);\n          }\n        }\n      } else {  // `convexSet` is just one plane ...\n        if (ignoreInvisiblePlanes && convexSet.invisible) {\n          // skip it !\n        } else {\n          const pointsClippedToRange = convexSet.intersectRange(range, true);\n          if (pointsClippedToRange)\n            loopFunction(pointsClippedToRange);\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        if (convexSet instanceof ConvexClipPlaneSet) {\n          convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n          if (finalPoints.length > 0)\n            loopFunction(finalPoints);\n        } else {\n          convexSet.clipConvexPolygonInPlace(lineString.packedPoints, work);\n          if (lineString.packedPoints.length > 0)\n            loopFunction(lineString.packedPoints);\n        }\n      }\n    }\n  }\n  /**\n   * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set\n   * intersecting a range.\n   * * Return zero length array for (a) null range or (b) no intersections\n   * @param allClippers convex or union clipper\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static loopsOfConvexClipPlaneIntersectionWithRange(\n    allClippers: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPlane,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): GeometryQuery[] {\n    const result: GeometryQuery[] = [];\n    if (allClippers instanceof UnionOfConvexClipPlaneSets) {\n      for (const clipper of allClippers.convexSets) {\n        this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range,\n          (points: GrowableXYZArray) => {\n            if (points.length > 0) result.push(Loop.createPolygon(points));\n          },\n          includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n      }\n    } else if (allClippers instanceof ConvexClipPlaneSet || allClippers instanceof ClipPlane) {\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(allClippers, range,\n        (points: GrowableXYZArray) => {\n          if (points.length > 0) result.push(Loop.createPolygon(points));\n        },\n        includeConvexSetFaces, includeRangeFaces, ignoreInvisiblePlanes);\n    }\n    return result;\n  }\n  /**\n   * Return the (possibly null) range of the intersection of the convex set with a range.\n   * * The convex set is permitted to be unbounded (e.g. a single plane).  The range parameter provides bounds.\n   * @param convexSet convex set for intersection.\n   * @param range range to intersect\n   */\n  public static rangeOfConvexClipPlaneSetIntersectionWithRange(convexSet: ConvexClipPlaneSet, range: Range3d): Range3d {\n    const result = Range3d.createNull();\n    this.announceLoopsOfConvexClipPlaneSetIntersectRange(convexSet, range,\n      (points: GrowableXYZArray) => {\n        if (points.length > 0) result.extendArray(points);\n      },\n      true, true, false);\n    return result;\n  }\n  /**\n   * Return the range of various types of clippers\n   * * `ConvexClipPlaneSet` -- dispatch to `rangeOfConvexClipPlaneSetIntersectionWithRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and this effectively returns the range of the edge work of the members\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and \"invisible\" parts do not restrict the range.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static rangeOfClipperIntersectionWithRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): Range3d {\n    if (clipper === undefined)\n      return range.clone();\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.rangeOfConvexClipPlaneSetIntersectionWithRange(clipper, range);\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      const rangeUnion = Range3d.createNull();\n      for (const c of clipper.convexSets) {\n        const rangeC = this.rangeOfConvexClipPlaneSetIntersectionWithRange(c, range);\n        rangeUnion.extendRange(rangeC);\n      }\n      return rangeUnion;\n    }\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)\n        return range.clone();\n      return this.rangeOfClipperIntersectionWithRange(clipper.fetchClipPlanesRef(), range);\n    }\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return rangeIntersection;\n\n    }\n    return range.clone();\n  }\n  /**\n   * Test if various types of clippers have any intersection with a range.\n   * * This follows the same logic as `rangeOfClipperIntersectionWithRange` but attempts to exit at earliest point of confirmed intersection\n   * * `ConvexClipPlaneSet` -- dispatch to `doesConvexClipPlaneSetIntersectRange`\n   * * `UnionOfConvexClipPlaneSet` -- union of ranges of member `ConvexClipPlaneSet`\n   * * `ClipPrimitive` -- access its `UnionOfConvexClipPlaneSet`.\n   * * `ClipVector` -- intersection of the ranges of its `ClipPrimitive`.\n   * * `undefined` -- entire input range.\n   * * If `observeInvisibleFlag` is false, the \"invisible\" properties are ignored, and holes do not affect the result.\n   * * If `observeInvisibleFlag` is true, the \"invisible\" properties are observed, and may affect the result.\n   * @param clipper\n   * @param range non-null range.\n   * @param observeInvisibleFlag indicates how \"invisible\" bit is applied for ClipPrimitive.\n   */\n  public static doesClipperIntersectRange(\n    clipper: ConvexClipPlaneSet | UnionOfConvexClipPlaneSets | ClipPrimitive | ClipVector | undefined,\n    range: Range3d,\n    observeInvisibleFlag: boolean = true,\n  ): boolean {\n    if (clipper === undefined)\n      return true;\n\n    if (clipper instanceof ConvexClipPlaneSet)\n      return this.doesConvexClipPlaneSetIntersectRange(clipper, range);\n\n    if (clipper instanceof UnionOfConvexClipPlaneSets) {\n      for (const c of clipper.convexSets) {\n        if (this.doesConvexClipPlaneSetIntersectRange(c, range))\n          return true;\n      }\n      return false;\n    }\n\n    if (clipper instanceof ClipPrimitive) {\n      if (observeInvisibleFlag && clipper.invisible)    // um is there an easy way to detect range-completely-inside?\n        return true;\n      return this.doesClipperIntersectRange(clipper.fetchClipPlanesRef(), range);\n    }\n\n    if (clipper instanceof ClipVector) {\n      const rangeIntersection = range.clone();\n      for (const c of clipper.clips) {\n        if (observeInvisibleFlag && c.invisible) {\n          // trivial range tests do not expose the effects.   Assume the hole allows everything.\n        } else {\n          const rangeC = this.rangeOfClipperIntersectionWithRange(c, range, observeInvisibleFlag);\n          rangeIntersection.intersect(rangeC, rangeIntersection);\n        }\n      }\n      return !rangeIntersection.isNull;\n    }\n    /** If the case statement above is complete for the variant inputs, this is unreachable .. */\n    return false;\n  }\n  /**\n   * Emit point loops for intersection of a convex set with a range.\n   * * return zero length array for (a) null range or (b) no intersections\n   * @param range range to intersect\n   * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.\n   * @param includeRangeFaces if false, do not compute facets originating as range faces\n   * @param ignoreInvisiblePlanes if true, do NOT compute a facet for convex set faces marked invisible.\n   */\n  public static doesConvexClipPlaneSetIntersectRange(\n    convexSet: ConvexClipPlaneSet,\n    range: Range3d,\n    includeConvexSetFaces: boolean = true,\n    includeRangeFaces: boolean = true,\n    ignoreInvisiblePlanes = false,\n  ): boolean {\n    const work = new GrowableXYZArray();\n    if (includeConvexSetFaces) {\n      // Clip convexSet planes to the range and to the rest of the convexSet . .\n      for (const plane of convexSet.planes) {\n        if (ignoreInvisiblePlanes && plane.invisible)\n          continue;\n        const pointsClippedToRange = plane.intersectRange(range, true);\n        if (pointsClippedToRange) {\n          const finalPoints = new GrowableXYZArray();\n          convexSet.polygonClip(pointsClippedToRange, finalPoints, work, plane);\n          if (finalPoints.length > 0)\n            return true;\n        }\n      }\n    }\n\n    if (includeRangeFaces) {\n      // clip range faces to the convex set . . .\n      const corners = range.corners();\n      for (let i = 0; i < 6; i++) {\n        const indices = Range3d.faceCornerIndices(i);\n        const finalPoints = new GrowableXYZArray();\n        const lineString = LineString3d.createIndexedPoints(corners, indices);\n        convexSet.polygonClip(lineString.packedPoints, finalPoints, work);\n        if (finalPoints.length > 0)\n          return true;\n      }\n    }\n    return false;\n  }\n  /**\n   * Create a clipper from the transformed range.\n   * @param range input range to create clipper from\n   * @param transform how to transform the range (NOTE: applied to the range faces without swelling the range volume)\n   * @param degeneratePoints optionally populated with the 1 or 2 points defining the transformed range if it is degenerate (all points colinear/coincident); otherwise untouched\n   * @returns newly constructed clipper. If no clip planes could be computed, fill `degeneratePoints` and return undefined.\n  */\n  private static createClipperFromTransformedRange3d(range: Range3d, transform: Transform, degeneratePoints?: Point3d[]): ConvexClipPlaneSet | undefined {\n    if (!transform)\n      transform = Transform.createIdentity();\n    const builder = PolyfaceBuilder.create();\n    builder.addTransformedRangeMesh(transform, range);\n    const mesh = builder.claimPolyface();\n    const clipper = this._workClipper = ConvexClipPlaneSet.createConvexPolyface(mesh, this._workClipper).clipper;\n    if (clipper.planes.length > 0)\n      return clipper;\n    // no faces found in the compressed mesh\n    if (degeneratePoints) {\n      assert(mesh.data.point.length <= 2);\n      for (let i = 0; i < 2; ++i) {\n        const point = mesh.data.point.getPoint3dAtCheckedPointIndex(i);\n        if (point)\n          degeneratePoints.push(point);\n      }\n    }\n    return undefined;\n  }\n  /**\n   * Handle pathological cases of range-range intersection, where one of the ranges defines no area or volume (is a line segment or single point).\n   * @param range local range to intersect with the point/segment\n   * @param points isolated local point, or local segment's start and end\n   * @param localToWorld optional transform for output range\n   * @param intersection optional range of the intersection, in world coordinates, or null range if no intersection.\n   * @returns whether the point/segment intersects the range\n   */\n  private static rangeIntersectPointOrSegment(range: Range3d, points: Point3d[], localToWorld?: Transform, intersection?: Range3d): boolean {\n    const announceInterval: AnnounceNumberNumberCurvePrimitive | undefined = intersection ?\n      (f0: number, f1: number, cp: CurvePrimitive) => {\n        intersection.extendPoint(cp.fractionToPoint(f0), localToWorld);\n        intersection.extendPoint(cp.fractionToPoint(f1), localToWorld);\n      } : undefined;\n    let hasIntersection = false;\n    if (points.length > 1) {\n      const segment = LineSegment3d.createCapture(points[0], points[1]);\n      const clipper = ConvexClipPlaneSet.createRange3dPlanes(range);\n      hasIntersection = segment.announceClipIntervals(clipper, announceInterval);\n    } else if (points.length > 0) {\n      hasIntersection = range.containsPoint(points[0]);\n      if (hasIntersection && intersection)\n        intersection.extendPoint(points[0], localToWorld);\n    }\n    return hasIntersection;\n  }\n  /**\n   * Test for intersection of two ranges in different local coordinates.\n   * * Useful for clash detection of elements in iModels, using their stored (tight) local ranges and placement transforms.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param range1Margin optional signed local distance to expand/contract the second range before intersection. Positive expands.\n   * @return whether the local ranges are adjacent or intersect. Also returns false if local1ToWorld is singular.\n   */\n  public static doLocalRangesIntersect(\n    range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, range1Margin?: number,\n  ): boolean {\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return false;\n    let myRange1 = range1;\n    if (range1Margin) {\n      myRange1 = this._workRange = range1.clone(this._workRange);\n      myRange1.expandInPlace(range1Margin);\n    }\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      return this.doesClipperIntersectRange(clipper, myRange1);\n    return this.rangeIntersectPointOrSegment(myRange1, degeneratePoints, local1ToWorld);\n  }\n  /**\n   * Compute the range of the intersection between two local (e.g., element-aligned) ranges.\n   * @param range0 first range in local coordinates\n   * @param local0ToWorld placement transform for first range\n   * @param range1 second range in local coordinates\n   * @param local1ToWorld placement transform for second range. Assumed to be invertible.\n   * @param result optional pre-allocated range to fill and return\n   * @return range of the intersection (aligned to world axes). Returns null range if local1ToWorld is singular.\n   */\n  public static rangeOfIntersectionOfLocalRanges(range0: Range3d, local0ToWorld: Transform, range1: Range3d, local1ToWorld: Transform, result?: Range3d): Range3d {\n    const myResult = Range3d.createNull(result);\n    const worldToLocal1 = this._workTransform = local1ToWorld.inverse(this._workTransform);\n    if (!worldToLocal1)\n      return myResult;\n    const degeneratePoints: Point3d[] = [];\n    const local0ToLocal1 = worldToLocal1.multiplyTransformTransform(local0ToWorld, worldToLocal1);\n    // convert range0 into a clipper in local1 coordinates, then intersect with range1\n    const clipper = this.createClipperFromTransformedRange3d(range0, local0ToLocal1, degeneratePoints);\n    if (clipper)\n      this.announceLoopsOfConvexClipPlaneSetIntersectRange(clipper, range1, (loopPoints: GrowableXYZArray) => { loopPoints.extendRange(myResult, local1ToWorld); });\n    else\n      this.rangeIntersectPointOrSegment(range1, degeneratePoints, local1ToWorld, myResult);\n    return myResult;\n  }\n  /**\n   * Test if `obj` is a `Clipper` object.\n   * * This is implemented by testing for each of the methods in the `Clipper` interface.\n   */\n  public static isClipper(obj: any): boolean {\n    if (obj) {\n      if (obj.isPointOnOrInside\n        && obj.announceClippedSegmentIntervals\n        && obj.announceClippedArcIntervals)\n        return true;\n    }\n    return false;\n  }\n  /**\n   * Specialized logic for replacing clip fragments by an equivalent singleton.\n   * * If there are baseCount + 1 or fewer fragments, do nothing.\n   * * If there are more than baseCount+1 fragments:\n   *   * drop them all to the cache\n   *   * push a copy of the singleton.\n   * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments,\n   * and then be able to determine that they really are the original pre-clip polygon unchanged.\n   * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.\n   * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.\n   * * This determination is solely within the logic of the caller.\n   * @param shards array of fragments\n   * @param baseCount original count\n   * @param singleton single array which may be a replacement for multiple fragments\n   * @param cache cache for array management\n   */\n  public static restoreSingletonInPlaceOfMultipleShards(\n    fragments: GrowableXYZArray[] | undefined, baseCount: number, singleton: IndexedXYZCollection, arrayCache: GrowableXYZArrayCache,\n  ): void {\n    if (fragments && fragments.length > baseCount + 1) {\n      while (fragments.length > baseCount) {\n        const f = fragments.pop();\n        arrayCache.dropToCache(f);\n      }\n      fragments.push(arrayCache.grabAndFill(singleton));\n    }\n  }\n  /**\n   * Create a UnionOfConvexClipPlaneSets for a volume defined by a path and offsets.\n   * @param points points along the path.\n   * @param positiveOffsetLeft offset to left.  0 is clip on the path.\n   * @param positiveOffsetRight offset to the right.  0 is clip on the path.\n   * @param z0 z for lower clipping plane.  If undefined, unbounded in positive z\n   * @param z1 z for upper clipping plane.  If undefined, unbounded in negative z.\n   * @alpha\n   */\n  public static createXYOffsetClipFromLineString(\n    points: Point3d[] | IndexedXYZCollection, leftOffset: number, rightOffset: number, z0: number, z1: number,\n  ): UnionOfConvexClipPlaneSets {\n    if (Array.isArray(points)) {\n      return LineStringOffsetClipperContext.createClipBetweenOffsets(\n        new Point3dArrayCarrier(points), leftOffset, rightOffset, z0, z1);\n    }\n    return LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);\n  }\n  /** If data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache. */\n  public static captureOrDrop(\n    data: GrowableXYZArray, minLength: number, destination: GrowableXYZArray[], cache: GrowableXYZArrayCache,\n  ): void {\n    if (data.length >= minLength)\n      destination.push(data);\n    else\n      cache.dropToCache(data);\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentToLLeftOfLineXY(\n    linePointA: XAndY, linePointB: XAndY, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    const ux = linePointB.x - linePointA.x;\n    const uy = linePointB.y - linePointA.y;\n    // negative is in positive is out ...\n    const h0 = -(ux * (segmentPoint0.y - linePointA.y) - uy * (segmentPoint0.x - linePointA.x));\n    const h1 = -(ux * (segmentPoint1.y - linePointA.y) - uy * (segmentPoint1.x - linePointA.x));\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in .....\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to a triangle.\n   * * Triangle is assumed CCW\n   * @param pointA point of triangle.\n   * @param pointB point of triangle.\n   * @param pointC point of triangle.\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentToCCWTriangleXY(\n    pointA: XAndY, pointB: XAndY, pointC: XAndY, segment0: XAndY, segment1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    if (!interval.isNull) {\n      this.clipSegmentToLLeftOfLineXY(pointA, pointB, segment0, segment1, interval, absoluteTolerance);\n      if (!interval.isNull) {\n        this.clipSegmentToLLeftOfLineXY(pointB, pointC, segment0, segment1, interval, absoluteTolerance);\n        if (!interval.isNull) {\n          this.clipSegmentToLLeftOfLineXY(pointC, pointA, segment0, segment1, interval, absoluteTolerance);\n        }\n      }\n    }\n  }\n  /**\n   * Find the portion of a line within a half-plane clip.\n   * * The half-plane clip is to the left of the line from clipA to clipB.\n   * * The original clipped segment has fractions 0 and 1 at respective segment points.\n   * * Caller initializes the interval\n   * * This method reduces the interval size.\n   * * See clipSegmentToCCWTriangleXY for typical use.\n   * @param linePointA First point of clip line\n   * @param linePointB Second point of clip line\n   * @param segmentPoint0 First point of clipped segment\n   * @param segmentPoint1 Second point of clipped segment\n   * @param interval Live interval.\n     * @param absoluteTolerance absolute tolerance for both cross product values to indicate \"on\" the line\n   */\n  public static clipSegmentBelowPlaneXY(\n    plane: Plane3dByOriginAndUnitNormal, segmentPoint0: XAndY, segmentPoint1: XAndY, interval: Range1d, absoluteTolerance: number = 1.0e-14,\n  ): void {\n    // negative is in positive is out ...\n    const h0 = plane.altitudeXY(segmentPoint0.x, segmentPoint0.y);\n    const h1 = plane.altitudeXY(segmentPoint1.x, segmentPoint1.y);\n    if (h0 < absoluteTolerance && h1 < absoluteTolerance) {\n      // The entire segment is in ..... the interval is unaffected.\n      return;\n    }\n    if (h0 * h1 > 0.0) {\n      if (h0 > 0.0)\n        interval.setNull();\n    } else if (h0 * h1 < 0.0) {\n      // strict crossing with safe fraction . . .\n      const fraction = -h0 / (h1 - h0);\n      if (h0 < 0.0) {\n        return interval.intersectRangeXXInPlace(0.0, fraction);\n      } else {\n        return interval.intersectRangeXXInPlace(fraction, 1.0);\n      }\n    } else {\n      // There is an exact hit at one end, possibly non-zero at the other ... the sign of either determines which side is in play\n      // A zero and a zero or negative is entirely in, which does not alter the prior clip.\n      if (h0 > 0.0) {\n        interval.intersectRangeXXInPlace(1.0, 1.0);\n      } else if (h1 > 0.0) {\n        interval.intersectRangeXXInPlace(0.0, 0.0);\n      }\n    }\n  }\n  /**\n   * Clip an interval of a line segment to an array of planes\n   * * plane normals assumed OUTWARD\n   * * planeAltitude is typically a tolerance a tolerance distance.\n   *   * positive altitude makes tha plane move in the direction of the unit normal.\n   * @param planes array of planes\n   * @param segment0 start of segment\n   * @param segment1 end of segment\n   * @param interval Pre-initialized interval of live part of segment\n   * @param absoluteTolerance absolute tolerance for begin \"on a line\"\n   */\n  public static clipSegmentBelowPlanesXY(\n    planes: Plane3dByOriginAndUnitNormal[], segment0: XAndY, segment1: XAndY, interval: Range1d, signedAltitude: number = 1.0e-14,\n  ): void {\n    const numPlanes = planes.length;\n    for (let i = 0; (!interval.isNull) && i < numPlanes; i++) {\n      this.clipSegmentBelowPlaneXY(planes[i], segment0, segment1, interval, signedAltitude);\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Resolve the fractional clips to simple points for announcement.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   * @param announce caller's handler for simple point pairs.\n   */\n  public static announcePolylineClip(\n    clipper: Clipper, points: Point3d[], announce: (point0: Point3d, point1: Point3d) => void,\n  ): void {\n    for (let i = 0; i + 1 < points.length; i++) {\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => {\n          announce(points[i].interpolate(f0, points[i + 1]), points[i].interpolate(f1, points[i + 1]));\n        });\n    }\n  }\n  /**\n   * Pass line segments from a polyline to the clipper.  Sum the lengths of the clipped pieces.  Return the sum.\n   * @param clipper clipper to call\n   * @param points polyline whose segments are passed to the clipper\n   */\n  public static sumPolylineClipLength(clipper: Clipper, points: Point3d[]): number {\n    let s = 0;\n    for (let i = 0; i + 1 < points.length; i++) {\n      const a = points[i].distance(points[i + 1]);\n      clipper.announceClippedSegmentIntervals(0, 1, points[i], points[i + 1],\n        (f0: number, f1: number) => { s += Math.abs(f1 - f0) * a; });\n    }\n    return s;\n  }\n  /**\n   * Pass polygon `xyz` through a sequence of PolygonClip steps.\n   * * At the outset, `xyz` is the (only) entry in a set of candidates.\n   * * For each clipper, each candidate is presented for appendPolygon to inside and outside parts.\n   * * Each (in,out) result is distributed among (acceptedIn, acceptedOut, candidates) according to\n   *      (inAction, outAction)\n   * * At the end, all remaining candidates are distributed among (acceptedIn, acceptedOut, finalUnknown)\n   *     according to finalAction\n   * * Any clipper that does not have an appendPolygonClip method is skipped.\n   * @param xyz\n   * @param clippers\n   * @param acceptedIn\n   * @param acceptedOut\n   * @param finalCandidates\n   * @param inAction\n   * @param outAction\n   * @param finalCandidateAction\n   */\n  public static doPolygonClipSequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    finalCandidates: GrowableXYZArray[] | undefined,\n    inAction: ClipStepAction,\n    outAction: ClipStepAction,\n    finalFragmentAction: ClipStepAction,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidates = [arrayCache.grabAndFill(xyz)];\n    let nextCandidates: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    const oldInsideCount = acceptedIn ? acceptedIn.length : 0;\n    const oldOutsideCount = acceptedOut ? acceptedOut.length : 0;\n    let shard;\n    // At each convex set, carryForwardA is all the fragments that have been outside all previous convex sets.\n    // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to\n    // the next clipper. The final surviving carryForward really is out.\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        while (undefined !== (shard = candidates.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(inAction, intermediateIn, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          distributeFragments(outAction, intermediateOut, acceptedIn, acceptedOut, nextCandidates, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // candidates is empty !!\n        const temp = candidates; candidates = nextCandidates; nextCandidates = temp;\n      }\n    }\n    distributeFragments(finalFragmentAction, candidates, acceptedIn, acceptedOut, finalCandidates, arrayCache);\n    // Note: The following assumes that there were no residual candidates ... need to track if that happened?\n    // If nothing was out, the inside fragments can be replaced by the original.\n    if (acceptedOut?.length === oldOutsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedIn, oldInsideCount, xyz, arrayCache);\n    // If nothing was in, the outside fragments can be replaced by the original.\n    if (acceptedIn?.length === oldInsideCount)\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedOut, oldOutsideCount, xyz, arrayCache);\n  }\n  /** Pass polygon `xyz` through a sequence of PolygonClip steps with \"parity\" rules */\n  public static doPolygonClipParitySequence(\n    xyz: IndexedXYZCollection,\n    clippers: Clipper[],\n    acceptedIn: GrowableXYZArray[] | undefined,\n    acceptedOut: GrowableXYZArray[] | undefined,\n    arrayCache: GrowableXYZArrayCache | undefined,\n  ) {\n    if (arrayCache === undefined)\n      arrayCache = new GrowableXYZArrayCache();\n    let candidatesOut = [arrayCache.grabAndFill(xyz)];\n    let candidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesIn: GrowableXYZArray[] = [];\n    let nextCandidatesOut: GrowableXYZArray[] = [];\n    const intermediateIn: GrowableXYZArray[] = [];\n    const intermediateOut: GrowableXYZArray[] = [];\n    let shard;\n    // at each step ..\n    // candidatesIn and candidatesOut are evolved in and out\n    // nextCandidatesIn and nextCandidatesOut are EMPTY\n    for (const c of clippers) {\n      if (c.appendPolygonClip) {\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesIn.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // (IN,OUT) parts of IN parts distribute to (OUT,IN)\n        while (undefined !== (shard = candidatesOut.pop())) {\n          c.appendPolygonClip(shard, intermediateIn, intermediateOut, arrayCache);\n          distributeFragments(ClipStepAction.acceptIn, intermediateIn, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          distributeFragments(ClipStepAction.acceptOut, intermediateOut, nextCandidatesIn, nextCandidatesOut, undefined, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        // reload each candidate step\n        const tempA = candidatesIn; candidatesIn = nextCandidatesIn; nextCandidatesIn = tempA;\n        const tempB = candidatesOut; candidatesOut = nextCandidatesOut; nextCandidatesOut = tempB;\n      }\n    }\n    // candidatesIn and candidatesOut are final ....\n    if (candidatesOut.length === 0)\n      acceptedIn?.push(arrayCache.grabAndFill(xyz));\n    else if (candidatesOut.length === 0)\n      acceptedOut?.push(arrayCache.grabAndFill(xyz));\n    else {\n      moveFragments(candidatesIn, acceptedIn, arrayCache);\n      moveFragments(candidatesOut, acceptedOut, arrayCache);\n    }\n  }\n  /**\n   * For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that\n   * abuts the outer volume of the neighbor faces.\n   */\n  public static createComplementaryClips(clipper: ConvexClipPlaneSet): UnionOfConvexClipPlaneSets {\n    const planes = clipper.planes;\n    const interval = Range1d.createNull();\n    const n = planes.length;\n    const newClippers: ConvexClipPlaneSet[] = [];\n    for (const p of planes) {\n      const outerSet = ConvexClipPlaneSet.createEmpty();\n      outerSet.addPlaneToConvexSet(p.cloneNegated());\n      newClippers.push(outerSet);\n    }\n    for (let i = 0; i < n; i++) {\n      for (let j = i + 1; j < n; j++) {\n        const ray = CurveFactory.planePlaneIntersectionRay(planes[i], planes[j]);\n        if (ray) {\n          if (clipper.hasIntersectionWithRay(ray, interval)) {\n            // the normal-to-normal vector is bisector (or close to bisector?)\n            const newNormal = planes[j].inwardNormalRef.minus(planes[i].inwardNormalRef);\n            const plane1 = ClipPlane.createNormalAndPoint(newNormal, ray.origin);\n            if (plane1) {\n              const plane2 = plane1.cloneNegated();\n              newClippers[i].addPlaneToConvexSet(plane1);\n              newClippers[j].addPlaneToConvexSet(plane2);\n            }\n          }\n        }\n      }\n    }\n    return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);\n  }\n  /**\n   * Creates clippers for regions closest to the children of a curve chain.\n   * * For best results, each child should have length larger than `distanceTol`.\n   * @param curveChain A curve chain; xy-only (z-coordinate is ignored). Must have at least 2 children.\n   * @param strokeOptions Optional stroke options to control the sampling of the curve chain.\n   * @param distanceTol Optional distance tolerance to use when comparing points; default is [[Geometry.smallMetricDistance]].\n   * @param boundingBox Optional nominal xy-bounding box for the clipper regions; default is maximal clipper regions.\n   * @returns An ordered array of clippers, each of which represents the region closest to the corresponding primitive in the\n   * input chain, or undefined if the input is invalid.\n   */\n  public static createClippersForRegionsClosestToCurvePrimitivesXY(\n    curveChain: CurveChain, strokeOptions?: StrokeOptions, distanceTol: number = Geometry.smallMetricDistance, boundingBox?: LowAndHighXY\n  ): UnionOfConvexClipPlaneSets[] | undefined {\n    const voronoi = Voronoi.createFromCurveChain(curveChain, strokeOptions, distanceTol, boundingBox);\n    if (!voronoi)\n      return undefined;\n    const superFaces = voronoi.computeVoronoiSuperFaces(curveChain.children.length);\n    if (superFaces === undefined || superFaces.length !== curveChain.children.length)\n      return undefined;\n    return voronoi.generateClippersFromVoronoiSuperFaces(superFaces);\n  }\n}\nfunction moveFragments(\n  fragments: GrowableXYZArray[],\n  destination: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n/**\n * Distribute fragments among acceptedIn, acceptedOut, and passToNextStep as directed by action.\n * * If the indicated destination is unknown, drop the fragments to the arrayCache.\n * @param action destination selector\n * @param fragments fragments to be distributed\n * @param acceptedIn destination for \"in\"\n * @param acceptedOut destination for \"out\"\n * @param passToNextStep destination for fragments to be passed to a later step\n * @param arrayCache destination for un-distributed fragments.\n */\nfunction distributeFragments(\n  action: ClipStepAction,\n  fragments: GrowableXYZArray[],\n  acceptedIn: GrowableXYZArray[] | undefined,\n  acceptedOut: GrowableXYZArray[] | undefined,\n  passToNextStep: GrowableXYZArray[] | undefined,\n  arrayCache: GrowableXYZArrayCache,\n) {\n  let destination;\n  if (action === ClipStepAction.acceptIn)\n    destination = acceptedIn;\n  else if (action === ClipStepAction.acceptOut)\n    destination = acceptedOut;\n  else if (action === ClipStepAction.passToNextStep)\n    destination = passToNextStep;\n  // remark: if action is other than the enum values, destination is undefined\n  if (destination === undefined)\n    arrayCache.dropAllToCache(fragments);\n  else {\n    for (const f of fragments)\n      destination.push(f);\n  }\n  fragments.length = 0;\n}\n"]}

package/lib/esm/clipping/ConvexClipPlaneSet.d.ts

@@ -30,6 +30,8 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
     /** Planes that define the convex set. */
     private _planes;
     private constructor();
+    /** Return the (reference to the) array of `ClipPlane`. */
+    get planes(): ClipPlane[];
     /**
      * Return an array containing all the planes of the convex set.
      * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
@@ -97,8 +99,6 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
     static setPlaneAndXYLoopCCW(points: GrowableXYZArray, planeOfPolygon: ClipPlane, frustum: ConvexClipPlaneSet): void;
     /** Deep clone of all planes. */
     clone(result?: ConvexClipPlaneSet): ConvexClipPlaneSet;
-    /** Return the (reference to the) array of `ClipPlane` */
-    get planes(): ClipPlane[];
     /**
      * Test if there is any intersection with a ray defined by origin and direction.
      * * Optionally record the range (null or otherwise) in caller-allocated result.
@@ -176,6 +176,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
      * @param arrayCache cache for work arrays.
      * @return the surviving inside part (if any)
+     * @see polygonClip
      */
     clipInsidePushOutside(xyz: IndexedXYZCollection, outsideFragments: GrowableXYZArray[] | undefined, arrayCache: GrowableXYZArrayCache): GrowableXYZArray | undefined;
     /**
@@ -214,17 +215,18 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
     clipPointsOnOrInside(points: Point3d[], inOrOn: Point3d[], out: Point3d[]): void;
     /**
      * Clip a polygon to the planes of the clip plane set.
-     * * For a convex input polygon, the output is another convex polygon.
-     * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
-     * valid clip in a parity sense.
-     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
-     * the polygon.
-     * @param input polygon, usually convex.
+     * * For a convex input polygon, the output polygon is also convex.
+     * * For non-convex input, the output polygon may have double-back edges along plane intersections. This is still a
+     * valid clip in a parity sense (overlapping regions cancel).
+     * @param input polygon, usually convex. Unchanged.
      * @param output output polygon
-     * @param work work array.
-     * @param containingPlane if this plane is found in the convex set, it is NOT applied.
+     * @param work optional work array.
+     * @param planeToSkip if this plane is found in the convex set, it is NOT applied.
+     * This is useful when caller knows the polygon lies in one of the instance planes.
+     * @param tolerance distance tolerance for "on plane" decision. Default value is [[Geometry.smallMetricDistance]].
+     * @see appendPolygonClip
      */
-    polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray, work: GrowableXYZArray, planeToSkip?: ClipPlane): void;
+    polygonClip(input: GrowableXYZArray | Point3d[], output: GrowableXYZArray, work?: GrowableXYZArray, planeToSkip?: ClipPlane, tolerance?: number): void;
     /**
      * * Define new planes in this ConvexClipPlaneSet so it clips to the inside of a polygon.
      * * always create planes for the swept edges of the polygon
@@ -271,6 +273,7 @@ export declare class ConvexClipPlaneSet implements Clipper, PolygonClipper {
      * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
      * the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
+     * @see polygonClip
      */
     appendPolygonClip(xyz: IndexedXYZCollection, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
     /**

package/lib/esm/clipping/ConvexClipPlaneSet.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ConvexClipPlaneSet.d.ts","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,oBAAoB,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAE3F;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,cAAc,EAAE,CAAC;AAEvD;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,OAAO,EAAE,cAAc;IAChE,iEAAiE;IACjE,gBAAuB,OAAO,SAAQ;IACtC,yCAAyC;IACzC,OAAO,CAAC,OAAO,CAAc;IAI7B,OAAO;IAIP;;;OAGG;IACI,MAAM,IAAI,uBAAuB;IAMxC;;;OAGG;WACW,QAAQ,CAAC,IAAI,EAAE,uBAAuB,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAYlH;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO;IAQxD;;;;OAIG;WACW,YAAY,CACxB,MAAM,EAAE,CAAC,SAAS,GAAG,4BAA4B,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAChF,kBAAkB;IAYrB;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,KAAK,EAAE,OAAO,EACd,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,GACpB,kBAAkB;IAoBrB,2CAA2C;WAC7B,WAAW,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO1E,oCAAoC;IAC7B,eAAe,IAAI,IAAI;IAI9B;;;;;OAKG;WACW,WAAW,CACvB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAC1E,kBAAkB;IAYrB;;;;;;;OAOG;WACW,gBAAgB,CAC5B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,kBAAkB,GACrG,kBAAkB;IAsBrB;;;OAGG;WACW,0BAA0B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAgB5G;;;;;;OAMG;WACW,oBAAoB,CAAC,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB;IAsBnH,gCAAgC;IACzB,KAAK,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO7D,yDAAyD;IACzD,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IACD;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAmCtH;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAY7G,4EAA4E;IACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAS7C,gFAAgF;IACzE,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAQnG;;;;OAIG;IACI,cAAc,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IASpE;;;;;;;;;;;;;OAaG;IACI,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO;IAmCV,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAStG;;;;;;OAMG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GAAG,OAAO;IAGvG,qCAAqC;IAC9B,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAK5C;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,SAAS,GAAE,MAAqC,GAC9F,IAAI;IAOP;;;;;;OAMG;IACI,qBAAqB,CAC1B,GAAG,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,qBAAqB,GAC7G,gBAAgB,GAAG,SAAS;IAuC/B;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,oBAAoB;IAkB9F;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,GACvD,kBAAkB,GAAG,SAAS;IA4BjC;;;OAGG;IACI,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,4BAA4B,GAAG,SAAS;IAMtF;;;;;OAKG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;IAWhF;;;;;;;;;;;OAWG;IACI,WAAW,CAChB,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,CAAC,EAAE,SAAS,GAC7G,IAAI;IAcP;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAyClG;;;;;;;;;;;;;;;OAeG;IACI,mCAAmC,CACxC,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAC7B,aAAa,EAAE,OAAO,GAAG,SAAS,EAClC,SAAS,CAAC,EAAE,SAAS,EACrB,eAAe,GAAE,OAAc,GAC9B,MAAM;IA6BT;;;OAGG;IACI,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC;;;;;OAKG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAMvE;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAKP;;;;;;;;;;MAUE;WACY,oBAAoB,CAChC,UAAU,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAClE;QAAE,OAAO,EAAE,kBAAkB,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;CA4BnD"}
+{"version":3,"file":"ConvexClipPlaneSet.d.ts","sourceRoot":"","sources":["../../../src/clipping/ConvexClipPlaneSet.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,SAAS,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,oBAAoB,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAE3F;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG,cAAc,EAAE,CAAC;AAEvD;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,OAAO,EAAE,cAAc;IAChE,iEAAiE;IACjE,gBAAuB,OAAO,SAAQ;IACtC,yCAAyC;IACzC,OAAO,CAAC,OAAO,CAAc;IAI7B,OAAO;IAIP,0DAA0D;IAC1D,IAAW,MAAM,IAAI,SAAS,EAAE,CAE/B;IACD;;;OAGG;IACI,MAAM,IAAI,uBAAuB;IAMxC;;;OAGG;WACW,QAAQ,CAAC,IAAI,EAAE,uBAAuB,GAAG,SAAS,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAYlH;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO;IAQxD;;;;OAIG;WACW,YAAY,CACxB,MAAM,EAAE,CAAC,SAAS,GAAG,4BAA4B,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAChF,kBAAkB;IAYrB;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,KAAK,EAAE,OAAO,EACd,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,EACrB,IAAI,GAAE,OAAc,EACpB,KAAK,GAAE,OAAc,GACpB,kBAAkB;IAoBrB,2CAA2C;WAC7B,WAAW,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO1E,oCAAoC;IAC7B,eAAe,IAAI,IAAI;IAI9B;;;;;OAKG;WACW,WAAW,CACvB,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAC1E,kBAAkB;IAYrB;;;;;;;OAOG;WACW,gBAAgB,CAC5B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,kBAAkB,GACrG,kBAAkB;IAsBrB;;;OAGG;WACW,0BAA0B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAgB5G;;;;;;OAMG;WACW,oBAAoB,CAAC,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,SAAS,EAAE,OAAO,EAAE,kBAAkB;IAsBnH,gCAAgC;IACzB,KAAK,CAAC,MAAM,CAAC,EAAE,kBAAkB,GAAG,kBAAkB;IAO7D;;;;;;;OAOG;IACI,sBAAsB,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAmCtH;;;;;;;;;;OAUG;IACI,wBAAwB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAY7G,4EAA4E;IACrE,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAS7C,gFAAgF;IACzE,iBAAiB,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAQnG;;;;OAIG;IACI,cAAc,CAAC,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IASpE;;;;;;;;;;;;;OAaG;IACI,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO;IAmCV,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAStG;;;;;;OAMG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GAAG,OAAO;IAGvG,qCAAqC;IAC9B,gBAAgB,CAAC,SAAS,EAAE,SAAS;IAK5C;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EAAE,IAAI,EAAE,gBAAgB,EAAE,SAAS,GAAE,MAAqC,GAC9F,IAAI;IAOP;;;;;;;OAOG;IACI,qBAAqB,CAC1B,GAAG,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,SAAS,EAAE,UAAU,EAAE,qBAAqB,GAC7G,gBAAgB,GAAG,SAAS;IAwC/B;;;;;;;;;OASG;IACI,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,OAAO,GAAG,oBAAoB;IAkB9F;;;;;;;;;OASG;WACW,mBAAmB,CAC/B,MAAM,EAAE,OAAO,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,GACvD,kBAAkB,GAAG,SAAS;IA4BjC;;;OAGG;IACI,mBAAmB,CAAC,KAAK,EAAE,SAAS,GAAG,4BAA4B,GAAG,SAAS;IAMtF;;;;;OAKG;IACI,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE;IAWhF;;;;;;;;;;;;OAYG;IACI,WAAW,CAChB,KAAK,EAAE,gBAAgB,GAAG,OAAO,EAAE,EACnC,MAAM,EAAE,gBAAgB,EACxB,IAAI,CAAC,EAAE,gBAAgB,EACvB,WAAW,CAAC,EAAE,SAAS,EACvB,SAAS,GAAE,MAAsC,GAChD,IAAI;IAeP;;;;;;;OAOG;IACI,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAyClG;;;;;;;;;;;;;;;OAeG;IACI,mCAAmC,CACxC,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,EAC7B,aAAa,EAAE,OAAO,GAAG,SAAS,EAClC,SAAS,CAAC,EAAE,SAAS,EACrB,eAAe,GAAE,OAAc,GAC9B,MAAM;IA6BT;;;OAGG;IACI,YAAY,CAAC,SAAS,EAAE,OAAO;IAKtC;;;;;OAKG;IACI,cAAc,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,MAAM;IAMvE;;;;;;;;;OASG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAKP;;;;;;;;;;MAUE;WACY,oBAAoB,CAChC,UAAU,EAAE,QAAQ,GAAG,eAAe,EAAE,MAAM,CAAC,EAAE,kBAAkB,GAClE;QAAE,OAAO,EAAE,kBAAkB,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE;CA4BnD"}