@itwin/core-geometry 5.2.0-dev.19 → 5.2.0-dev.20

package/lib/cjs/curve/RegionOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,0CAAuC;AACvC,6DAA0D;AAC1D,qEAAkE;AAClE,6EAE4C;AAC5C,2EAAwE;AACxE,mEAAkE;AAClE,yDAAsD;AACtD,mGAA2F;AAC3F,+CAA8C;AAC9C,+CAA4C;AAC5C,mEAAgE;AAChE,uDAAoD;AAEpD,yDAAsD;AAEtD,iEAA8D;AAC9D,6CAA0E;AAC1E,yEAAsE;AACtE,iDAAuD;AACvD,6DAAyD;AACzD,uDAA6E;AAC7E,6CAA0C;AAC1C,yCAAsC;AACtC,qDAAkD;AAElD,+DAA4D;AAC5D,mDAAgD;AAChD,oFAAiF;AACjF,kFAAmF;AACnF,oFAAiF;AACjF,mDAAgD;AAChD,iDAA8C;AAC9C,iCAA2C;AAC3C,mDAA8D;AAC9D,iDAA8C;AAC9C,iCAA8B;AAC9B,uGAAyG;AACzG,iEAA8D;AAC9D,mDAAyD;AACzD,iEAA8D;AAC9D,uDAAoD;AACpD,mFAAqH;AAErH,+CAA4C;AAY5C;;;GAGG;AACH,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,kCAAlB,kBAAkB,QAM7B;AAED;;;;;;;;;;;GAWG;AACH,MAAa,SAAS;IACpB;;;;;;;;OAQG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB;QAClD,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,MAAM,YAAY,uBAAU,EAAE,CAAC;YACjC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;MAIE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,mBAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB;QAC3C,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,MAAM,YAAY,uBAAU,EAAE,CAAC;YACjC,OAAO,MAAM,CAAC,WAAW,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,wBAAwB,CAAC,KAAe;QACpD,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB,EAAE,MAAc;QAChE,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC5E,IAAI,CAAC,YAAY;YACf,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,0BAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/D,IAAI,QAAQ,GAA0B,MAAM,CAAC;QAC7C,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,mDAAmD;YACpE,QAAQ,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,OAAO,EAAG,CAA0B,CAAC;YACrF,IAAI,CAAC,QAAQ;gBACX,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,UAAU,GAAG,SAAS,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU;YACb,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC,UAAU,EAAE,2CAA2C;YAC1D,YAAY,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEnD,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,IAAI,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,aAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;QAChB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAC3B,KAAoB,EACpB,IAAgC,EAChC,oBAAoE;QAEpE,IAAI,IAAI,YAAY,WAAI,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,yBAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAE1C,CAAC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,2CAAoB,EAAE,CAAC;oBACnD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;wBACxB,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;oBAC1C,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;wBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;oBAC3F,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAExF,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACxD,CAAC;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,WAAW,EAAE,CAAC;gBAChB,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CACjD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAC7C,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAClD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB;QAChD,IAAI,MAAM,YAAY,yBAAW,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC9B,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;aAAM,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC;YAC1C,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,cAAc,CAAC,MAAiB;QAC5C,IAAI,MAAM,YAAY,WAAI;YACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QACzD,sCAAsC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC;iBAAM,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;gBAC9B,IAAA,qBAAM,EAAC,CAAC,CAAC,QAAQ,YAAY,yBAAW,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,SAAS,CAAC;QACnB,6CAA6C;QAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,MAA2C,EAC3C,MAA2C,EAC3C,SAA6B,EAC7B,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,MAAM,MAAM,GAAG,yBAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,MAAM,UAAU,GAAG,oBAAY,CAAC,WAAW,CAAC;QAC5C,OAAO,CAAC,sBAAsB,CAC5B,SAAS,EACT,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YAC5E,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,MAAM,kBAAkB,GAAG,qCAAiB,CAAC,8BAA8B,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBACzG,IAAI,kBAAkB;oBACpB,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC,EACpC,cAAuB,KAAK;QAE5B,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QAEpC,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,SAAS,EACT,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,IAAI,CACL,CAAC;QACF,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,2BAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,4BAA4B,CACxC,MAAiB,EAAE,IAAa,EAAE,uBAA8C;QAEhF,MAAM,OAAO,GAAG,IAAI,+CAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAmB,EAAE,uBAA8D;QAEnF,MAAM,aAAa,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QACpE,OAAO,mBAAQ,CAAC,sBAAsB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,gCAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2BAA2B,CACvC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QAE9F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACpC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,MAAM,CAAC,wBAAwB,CAA2B;IAClE;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B;QAC7D,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,WAAiC,EAAE,YAA6B;QAEhE,OAAO,qCAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,6CAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAC1C,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAEnE,OAAO,mBAAQ,CAAC,gCAAgC,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB;QACpG,OAAO,mBAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IACzD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CACvC,WAAiC,EAAE,MAAiB;QAEpD,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,iCAAe,EAAE,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACxC,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;gBACvG,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,UAAU,YAAY,+BAAc,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;YAC5G,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,sBAAsB,CAClC,IAAiD,EAAE,sBAA+B,IAAI;QAEtF,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACxD,CAAC;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE,CAAC;YAChD,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACrD,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvD,OAAO,SAAS,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,4DAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1C,OAAO,qBAAS,CAAC,4BAA4B,CAC3C,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAC/E,CAAC;YACJ,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,yCAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE,CAAC;YAC1G,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE,CAAC;YAC1G,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,YAAY,4BAAU,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,CAAC;gBACxC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAuB,EAAE,OAAmD;QACtH,MAAM,OAAO,GAAG,IAAI,gFAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,SAAS,YAAY,WAAI;gBAC3B,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,2CAAoB,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,OAAO,iCAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;MAIE;IACM,MAAM,CAAC,iCAAiC,CAAC,MAA6B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC9H,MAAM,OAAO,GAAgB,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACxB,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,WAAI,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,YAAY,yBAAW,EAAE,CAAC;gBAC3F,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,KAAK,YAAY,WAAI,EAAE,CAAC;gBACjC,IAAI,KAAK,CAAC,uBAAuB,CAAC,SAAS,CAAC;oBAC1C,OAAO,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjD,CAAC;iBAAM,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,uBAAuB,CAAC,SAAS,CAAC;oBAC1C,OAAO,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACI,MAAM,CAAC,yBAAyB,CACrC,gBAAuC,EACvC,YAAoB,mBAAQ,CAAC,mBAAmB,EAChD,aAAsB,IAAI;QAE1B,IAAI,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3F,UAAU,GAAG,6CAAqB,CAAC,KAAK,CAAC,6BAAW,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,QAA4B,CAAC;QACzG,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,UAAU,EAAE,CAAC,CAAC,oDAAoD;YACpE,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;YAC9F,MAAM,OAAO,GAAG,IAAI,CAAC,iCAAiC,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACpF,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACvC,OAAO,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC;YACjD,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,EAAE,IAAc,EAAE,EAAE;gBACrD,IAAI,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,WAAW,CAAC;oBAC1C,UAAU,CAAC,IAAI,CAAC,6BAAa,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC5F,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;QACL,CAAC;QACD,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,qCAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAClC,UAAiC,EACjC,cAAiC,EACjC,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QAEnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,+BAAc,EAAE,CAAC;YACzC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QAC7F,CAAC;aAAM,IAAI,UAAU,YAAY,iCAAe,EAAE,CAAC;YACjD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QAC7F,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,YAAY,2BAAY,EAAE,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,6BAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,CAAC,YAAY,6BAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,yBAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,mCAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACK,MAAM,CAAC,iCAAiC,CAAC,QAAoC;QACnF,IAAI,KAAgC,CAAC;QACrC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACvB,OAAO,SAAS,CAAC;YACnB,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,yBAAO,CAAC,uBAAuB,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChD,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,QAA2C,CAAC,CAAC;YAC1G,CAAC;iBAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,IAAI,gBAAiD,CAAC;gBACtD,IAAI,UAAU,YAAY,oDAA6B,EAAE,CAAC;oBACxD,gBAAgB,GAAG,QAA2C,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,gBAAgB,GAAG,EAAE,CAAC;oBACtB,KAAK,MAAM,OAAO,IAAI,QAAmC;wBACvD,gBAAgB,CAAC,IAAI,CAAC,mCAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC5D,CAAC;gBACD,MAAM,cAAc,GAAG,uBAAU,CAAC,uBAAuB,CAAC,gBAAgB,CAAC,CAAC;gBAC5E,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC,yCAAyC;oBAC1E,IAAI,KAAK,GAAG,4BAAY,CAAC,gCAAgC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;wBAC1E,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,UAAU,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,QAAQ,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,gGAAgG;YAChG,IAAI,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzF,IAAI,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC;oBACrD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC5B,MAAM,CAAC,qBAAqB,CAAC,SAA8B,EAAE,OAAuB;QAC1F,MAAM,gBAAgB,GAAG,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACzD,yCAAyC;QACzC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QACxC,IAAI,gBAAgB,YAAY,WAAI,EAAE,CAAC;YACrC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY;gBAC9F,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB;QAC9E,CAAC;aAAM,IAAI,gBAAgB,YAAY,2BAAY,EAAE,CAAC;YACpD,KAAK,MAAM,WAAW,IAAI,gBAAgB,CAAC,QAAQ,EAAE,CAAC;gBACpD,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY;oBACpF,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB;YACzE,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,0BAA0B,CAAC,SAA8B,EAAE,OAAuB;QAC/F,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,iCAAiC,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAuB;QACpE,IAAI,KAAgC,CAAC;QACrC,IAAI,MAAM,YAAY,yBAAW,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACxE,IAAI,UAAU,EAAE,CAAC;oBACf,IAAI,CAAC,KAAK,EAAE,CAAC;wBACX,KAAK,GAAG,UAAU,CAAC;oBACrB,CAAC;yBAAM,CAAC;wBACN,gHAAgH;wBAChH,+GAA+G;wBAC/G,gEAAgE;wBAChE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,EAAE,oBAAoB;YAC/B,0BAAgB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC5C,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IACD;;;;;MAKE;IACK,MAAM,CAAC,wBAAwB,CAAC,OAAmC,EAAE,WAAoB,IAAI;QAClG,MAAM,KAAK,GAAG,SAAS,CAAC,iCAAiC,CAAC,OAAO,CAAC,CAAC;QACnE,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ;YACV,0BAAgB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,KAAK,CAAC,iBAAiB,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;gBACxC,cAAc,CAAC,IAAI,CAAC,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChH,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,cAAc,CAAC;IACxB,CAAC;CACF;AAv6BD,8BAu6BC;AACD,gBAAgB;AAChB,SAAS,mBAAmB,CAC1B,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IAEzG,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,GAAY,IAAI,CAAC;IACjD,0EAA0E;IACnE,yBAAyB,GAAY,IAAI,CAAC;IACjD,+GAA+G;IACxG,mBAAmB,GAAa,KAAK,CAAC;IAC7C,gEAAgE;IACzD,wBAAwB,GAAa,KAAK,CAAC;IAClD,gDAAgD;IACzC,uBAAuB,GAAW,mBAAQ,CAAC,mBAAmB,CAAC;IACtE,wFAAwF;IACjF,sBAAsB,GAAW,mBAAQ,CAAC,mBAAmB,CAAC;CACtE;AAbD,8FAaC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport {\r\n  IndexedReadWriteXYZCollection, IndexedXYZCollection, LineStringDataVariant, MultiLineStringDataVariant,\r\n} from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\r\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { XAndY, XYAndZ } from \"../geometry3d/XYZProps\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { IndexedPolyface, Polyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphOps } from \"../topology/Merging\";\r\nimport { Triangulator } from \"../topology/Triangulation\";\r\nimport { BagOfCurves, CurveChain, CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurveOps } from \"./CurveOps\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyChain, AnyCurve, AnyRegion } from \"./CurveTypes\";\r\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { ChainCollectorContext } from \"./internalContexts/ChainCollectorContext\";\r\nimport { PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { TransferWithSplitArcs } from \"./internalContexts/TransferWithSplitArcs\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop, SignedLoops } from \"./Loop\";\r\nimport { JointOptions, OffsetOptions } from \"./OffsetOptions\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\r\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\r\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\r\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * * `properties` is a string with special characters indicating\r\n *   * \"U\" -- contains unmerged stick data\r\n *   * \"M\" -- merged\r\n *   * \"R\" -- regularized\r\n *   * \"X\" -- has exterior markup\r\n * @internal\r\n */\r\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\r\n\r\n/**\r\n * Enumeration of the binary operation types for a booleans among regions\r\n * @public\r\n */\r\nexport enum RegionBinaryOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  AMinusB = 3,\r\n  BMinusA = 4,\r\n}\r\n\r\n/**\r\n * Class `RegionOps` has static members for calculations on regions (areas).\r\n * * Regions are represented by these [[CurveCollection]] subclasses:\r\n *   * [[Loop]] -- a single loop\r\n *   * [[ParityRegion]] -- a collection of loops, interpreted by parity rules.\r\n * The common \"One outer loop and many inner loops\" is a parity region.\r\n *   * [[UnionRegion]] -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\r\n * * Most of the methods in this class:\r\n *   * Ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.\r\n *   * Assume consistent Loop orientation: \"solid\" Loops are counterclockwise; \"hole\" Loops are clockwise.\r\n * @public\r\n */\r\nexport class RegionOps {\r\n  /**\r\n   * Return moment sums for a loop, parity region, or union region.\r\n   * * The input region should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   * call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes(rawMomentData.origin, rawMomentData.sums);`\r\n   * * `rawMomentData.origin` is the centroid of `region`.\r\n   * * `rawMomentData.sums.weight()` is the signed area of `region`.\r\n   * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].\r\n   */\r\n  public static computeXYAreaMoments(region: AnyRegion): MomentData | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = region.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      result.shiftOriginAndSumsToCentroidOfSums();\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return an area tolerance for a given xy-range and optional distance tolerance.\r\n   * @param range range of planar region to tolerance.\r\n   * @param distanceTolerance optional absolute distance tolerance.\r\n  */\r\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\r\n    // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).\r\n    const halfDistTol = 0.5 * distanceTolerance;\r\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\r\n  }\r\n  /**\r\n   * Return a (signed) xy area for a region.\r\n   * * The input region should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\r\n   * * For a non-self-intersecting Loop, the returned area is negative if and only if the Loop is oriented clockwise\r\n   * with respect to the positive z-axis.\r\n   * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].\r\n   */\r\n  public static computeXYArea(region: AnyRegion): number | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = region.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      return result.quantitySum;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return MomentData with the sums of wire moments.\r\n   * * The input curve should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   * call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * * `rawMomentData.origin` is the wire centroid of `curve`.\r\n   * * `rawMomentData.sums.weight()` is the signed length of `curve`.\r\n   * @param curve any [[CurveCollection]] or [[CurvePrimitive]].\r\n   */\r\n  public static computeXYZWireMomentSums(curve: AnyCurve): MomentData | undefined {\r\n    const handler = new CurveWireMomentsXYZ();\r\n    handler.visitLeaves(curve);\r\n    const result = handler.momentData;\r\n    result.shiftOriginAndSumsToCentroidOfSums();\r\n    return result;\r\n  }\r\n  /**\r\n   * Return a [[Ray3d]] with:\r\n   * * `origin` is the centroid of the region,\r\n   * * `direction` is a unit vector perpendicular to the region plane,\r\n   * * `a` is the region area.\r\n   * @param region the region to process. Can lie in any plane.\r\n   * @param result optional pre-allocated result to populate and return.\r\n   */\r\n  public static centroidAreaNormal(region: AnyRegion, result?: Ray3d): Ray3d | undefined {\r\n    const localToWorld = FrameBuilder.createRightHandedFrame(undefined, region);\r\n    if (!localToWorld)\r\n      return undefined;\r\n    const normal = localToWorld.matrix.columnZ(result?.direction);\r\n    const regionIsXY = normal.isParallelTo(Vector3d.unitZ(), true);\r\n    let regionXY: AnyRegion | undefined = region;\r\n    if (!regionIsXY) { // rotate the region to be parallel to the xy-plane\r\n      regionXY = region.cloneTransformed(localToWorld.inverse()!) as AnyRegion | undefined;\r\n      if (!regionXY)\r\n        return undefined;\r\n    }\r\n    const momentData = RegionOps.computeXYAreaMoments(regionXY);\r\n    if (!momentData)\r\n      return undefined;\r\n    const centroid = momentData.origin.clone(result?.origin);\r\n    if (!regionIsXY) // rotate centroid back (area is unchanged)\r\n      localToWorld.multiplyPoint3d(centroid, centroid);\r\n\r\n    let area = momentData.sums.weight();\r\n    if (area < 0.0) {\r\n      area = -area;\r\n      normal.scale(-1.0, normal);\r\n    }\r\n    if (!result)\r\n      result = Ray3d.createCapture(centroid, normal);\r\n    result.a = area;\r\n    return result;\r\n  }\r\n  /**\r\n   * Create loops in the graph.\r\n   * @internal\r\n   */\r\n  public static addLoopsToGraph(\r\n    graph: HalfEdgeGraph,\r\n    data: MultiLineStringDataVariant,\r\n    announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void,\r\n  ): void {\r\n    if (data instanceof Loop) {\r\n      const points = data.getPackedStrokes();\r\n      if (points)\r\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n    } else if (data instanceof ParityRegion) {\r\n      for (const child of data.children) {\r\n        const points = child.getPackedStrokes();\r\n        if (points)\r\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n      }\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\r\n      if (loopSeed !== undefined)\r\n        announceIsolatedLoop(graph, loopSeed);\r\n    } else if (Array.isArray(data)) {\r\n      if (data.length > 0) {\r\n        if (Point3d.isAnyImmediatePointType(data[0])) {\r\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\r\n          if (loopSeed !== undefined)\r\n            announceIsolatedLoop(graph, loopSeed);\r\n\r\n        } else if (data[0] instanceof IndexedXYZCollection) {\r\n          for (const loop of data) {\r\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\r\n            if (loopSeed !== undefined)\r\n              announceIsolatedLoop(graph, loopSeed);\r\n          }\r\n        } else {\r\n          for (const child of data) {\r\n            if (Array.isArray(child))\r\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Add multiple loops to a graph.\r\n   * * Apply edgeTag and mask to each edge.\r\n   * @internal\r\n   */\r\n  public static addLoopsWithEdgeTagToGraph(\r\n    graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any,\r\n  ): HalfEdge[] | undefined {\r\n    const loopSeeds: HalfEdge[] = [];\r\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\r\n      if (seed) {\r\n        loopSeeds.push(seed);\r\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\r\n      }\r\n    });\r\n    if (loopSeeds.length > 0)\r\n      return loopSeeds;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Given a graph just produced by booleans, convert to a polyface\r\n   * * \"just produced\" implies exterior face markup.\r\n   * @param graph\r\n   * @param triangulate\r\n   */\r\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\r\n    if (graph) {\r\n      if (triangulate) {\r\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\r\n        Triangulator.flipTriangles(graph);\r\n      }\r\n      return PolyfaceBuilder.graphToPolyface(graph);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a polyface containing the area intersection of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaIntersectLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area union of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaUnionLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA || inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area difference of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaDifferenceLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && !inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return the region's simplest representation by stripping redundant parent(s).\r\n   * * No Boolean operations are performed.\r\n   * @param region input region (unchanged). Assumed to have at least one child.\r\n   * @returns\r\n   * * For a [[UnionRegion]] with exactly one child, return the child if it is a [[Loop]],\r\n   * or if it is a [[ParityRegion]] with multiple children; otherwise return the `ParityRegion`'s `Loop`.\r\n   * * For a `ParityRegion` with exactly one child, return the `Loop`.\r\n   * * All other inputs returned unchanged.\r\n   * @see [[simplifyRegion]]\r\n   */\r\n  public static simplifyRegionType(region: AnyRegion): AnyRegion {\r\n    if (region instanceof UnionRegion) {\r\n      if (region.children.length === 1)\r\n        return this.simplifyRegionType(region.children[0]);\r\n    } else if (region instanceof ParityRegion) {\r\n      if (region.children.length === 1)\r\n        return region.children[0];\r\n    }\r\n    return region;\r\n  }\r\n  /**\r\n   * Simplify the region's parent/child hierarchy in place:\r\n   * * Regions with exactly one child are simplified as per [[simplifyRegionType]].\r\n   * * Regions without children are removed.\r\n   * * No Boolean operations are performed.\r\n   * @param region region to simplify in place\r\n   * @returns reference to the updated input region\r\n   * @see [[simplifyRegionType]]\r\n   */\r\n  public static simplifyRegion(region: AnyRegion): AnyRegion | undefined {\r\n    if (region instanceof Loop)\r\n      return region.children.length > 0 ? region : undefined;\r\n    // remove childless Parity/UnionRegion\r\n    for (let i = 0; i < region.children.length; ++i) {\r\n      const child = region.children[i];\r\n      const newChild = this.simplifyRegion(child);\r\n      if (!newChild) {\r\n        region.children.splice(i--, 1);\r\n      } else if (newChild !== child) {\r\n        assert(!(newChild instanceof UnionRegion));\r\n        region.children.splice(i--, 1, newChild);\r\n      }\r\n    }\r\n    if (region.children.length === 0)\r\n      return undefined;\r\n    // remove redundant Parity/UnionRegion parent\r\n    if (region.children.length === 1)\r\n      return region.children.splice(0, 1)[0];\r\n    return region;\r\n  }\r\n  /**\r\n   * Return areas defined by a boolean operation.\r\n   * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].\r\n   * @note A common use case of this method is to convert a region with overlapping children into one with\r\n   * non-overlapping children: `regionOut = RegionOps.regionBooleanXY(regionIn, undefined, RegionBinaryOpType.Union)`.\r\n   * @param loopsA first set of loops (treated as a union)\r\n   * @param loopsB second set of loops (treated as a union)\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   * @returns a region resulting from merging input loops and the boolean operation.\r\n   */\r\n  public static regionBooleanXY(\r\n    loopsA: AnyRegion | AnyRegion[] | undefined,\r\n    loopsB: AnyRegion | AnyRegion[] | undefined,\r\n    operation: RegionBinaryOpType,\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): AnyRegion | undefined {\r\n    const result = UnionRegion.create();\r\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n    context.addMembers(loopsA, loopsB);\r\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\r\n    const visitMask = context.graph.grabMask(false);\r\n    const range = context.groupA.range().union(context.groupB.range());\r\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\r\n    const bridgeMask = HalfEdgeMask.BRIDGE_EDGE;\r\n    context.runClassificationSweep(\r\n      operation,\r\n      (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\r\n        // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\r\n        if (face.countEdgesAroundFace() < 2)\r\n          return;\r\n        if (Math.abs(area) < areaTol)\r\n          return;\r\n        if (faceType === 1) {\r\n          const loopOrParityRegion = PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask);\r\n          if (loopOrParityRegion)\r\n            result.tryAddChild(loopOrParityRegion);\r\n        }\r\n      },\r\n    );\r\n    context.graph.dropMask(visitMask);\r\n    return this.simplifyRegion(result);\r\n  }\r\n  /**\r\n   * Return a polyface whose facets are a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonBooleanXYToPolyface(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[],\r\n    triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union,\r\n      true,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   */\r\n  public static polygonBooleanXYToLoops(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[],\r\n  ): AnyRegion | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA,\r\n      RegionGroupOpType.Union,\r\n      operation,\r\n      inputB,\r\n      RegionGroupOpType.Union,\r\n      true,\r\n    );\r\n    if (!graph)\r\n      return undefined;\r\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\r\n    const allLoops: Loop[] = [];\r\n    for (const graphLoop of loopEdges) {\r\n      const points = new GrowableXYZArray();\r\n      for (const edge of graphLoop)\r\n        points.pushXYZ(edge.x, edge.y, edge.z);\r\n      points.pushWrap(1);\r\n      const loop = Loop.create();\r\n      loop.tryAddChild(LineString3d.createCapture(points));\r\n      allLoops.push(loop);\r\n    }\r\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\r\n  }\r\n  /**\r\n   * Construct a wire that is offset from the given polyline or polygon.\r\n   * * This is a simple wire offset, not an area offset.\r\n   * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)\r\n   * the xy-plane.\r\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not\r\n   * guarantee a simple area offset.\r\n   * @param points a single loop or path\r\n   * @param wrap true to include wraparound\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions\r\n   * object.\r\n   */\r\n  public static constructPolygonWireXYOffset(\r\n    points: Point3d[], wrap: boolean, offsetDistanceOrOptions: number | JointOptions,\r\n  ): CurveChain | undefined {\r\n    const context = new PolygonWireOffsetContext();\r\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will\r\n   * not detect self intersection among widely separated edges.\r\n   * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/Offset\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(\r\n    curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions,\r\n  ): CurveCollection | undefined {\r\n    const offsetOptions = OffsetOptions.create(offsetDistanceOrOptions);\r\n    return CurveOps.constructCurveXYOffset(curves, offsetOptions);\r\n  }\r\n  /**\r\n   * Test if point (x,y) is IN, OUT or ON a region.\r\n   * @return (1) for in, (-1) for OUT, (0) for ON\r\n   * @param curves input region\r\n   * @param x x coordinate of point to test\r\n   * @param y y coordinate of point to test\r\n   */\r\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\r\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\r\n  }\r\n  /**\r\n   * Create curve collection of subtype determined by gaps between the input curves.\r\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\r\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\r\n   * * If there are internal gaps, return a `BagOfCurves`\r\n   * * If input array has zero length, return undefined.\r\n   * @param curves input curves\r\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\r\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\r\n   */\r\n  public static createLoopPathOrBagOfCurves(\r\n    curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false,\r\n  ): CurveCollection | undefined {\r\n    const n = curves.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    let maxGap = 0.0;\r\n    let isPath = false;\r\n    if (wrap)\r\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\r\n    for (let i = 0; i + 1 < n; i++)\r\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\r\n    let collection: Loop | Path | BagOfCurves;\r\n    if (Geometry.isSmallMetricDistance(maxGap)) {\r\n      collection = wrap ? Loop.create() : Path.create();\r\n      isPath = true;\r\n    } else {\r\n      collection = BagOfCurves.create();\r\n    }\r\n    for (const c of curves)\r\n      collection.tryAddChild(c);\r\n    if (isPath && consolidateAdjacentPrimitives)\r\n      RegionOps.consolidateAdjacentPrimitives(collection);\r\n    return collection;\r\n  }\r\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\r\n  /**\r\n   * Announce Checkpoint function for use during booleans\r\n   * @internal\r\n   */\r\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) {\r\n    this._graphCheckPointFunction = f;\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\r\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\r\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\r\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\r\n   * * All cutting is \"as viewed in the xy plane\"\r\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\r\n   * @param cutterCurves input curves to intersect with `curvesToCut`\r\n   */\r\n  public static cloneCurvesWithXYSplits(\r\n    curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection,\r\n  ): AnyCurve | undefined {\r\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\r\n  }\r\n  /**\r\n   * Create paths assembled from many curves.\r\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by\r\n   * [[cloneCurvesWithXYSplits]].\r\n   * * Return simplest form -- single primitive, single path, or bag of curves.\r\n   */\r\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): AnyChain | undefined {\r\n    if (source === undefined)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive)\r\n      return source;\r\n    // source is a collection .  ..\r\n    const primitives = source.collectCurvePrimitives();\r\n    const chainCollector = new ChainCollectorContext(makeClones);\r\n    for (const primitive of primitives) {\r\n      chainCollector.announceCurvePrimitive(primitive);\r\n    }\r\n    return chainCollector.grabResult();\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideOffsets(\r\n    fragments: AnyCurve[], offsetDistance: number, gapTolerance: number,\r\n  ): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\r\n    return CurveOps.collectInsideAndOutsideXYOffsets(fragments, offsetDistance, gapTolerance);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): AnyChain | undefined {\r\n    return CurveOps.collectChains(fragments, gapTolerance);\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments\r\n   * of `curvesToCut`.\r\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\r\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\r\n   */\r\n  public static splitPathsByRegionInOnOutXY(\r\n    curvesToCut: AnyCurve | undefined, region: AnyRegion,\r\n  ): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\r\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\r\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\r\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\r\n    if (splitPaths instanceof CurveCollection) {\r\n      for (const child of splitPaths.children) {\r\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\r\n        if (pointOnChild) {\r\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n        }\r\n      }\r\n    } else if (splitPaths instanceof CurvePrimitive) {\r\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\r\n      if (pointOnChild) {\r\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * If `data` is one of several forms of a rectangle, return its edge Transform.\r\n   * * Points are considered a rectangle if, within the first 4 points:\r\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\r\n   *     * vectors from 0 to 3 and 1 to 2 are the same\r\n   * @param data points in one of several formats:\r\n   *   * LineString\r\n   *   * Loop containing rectangle content\r\n   *   * Path containing rectangle content\r\n   *   * Array of Point3d[]\r\n   *   * IndexedXYZCollection\r\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\r\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit\r\n   * normal in z column. If not a rectangle, return undefined.\r\n   */\r\n  public static rectangleEdgeTransform(\r\n    data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true,\r\n  ): Transform | undefined {\r\n    if (data instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.packedPoints);\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      let dataToUse;\r\n      if (requireClosurePoint && data.length === 5) {\r\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\r\n          return undefined;\r\n        dataToUse = data;\r\n      } else if (!requireClosurePoint && data.length === 4) {\r\n        dataToUse = data;\r\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\r\n        return undefined;\r\n      } else {\r\n        dataToUse = GrowableXYZArray.create(data);\r\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\r\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\r\n          return undefined;\r\n      }\r\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\r\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\r\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\r\n      const normalVector = vector01.crossProduct(vector03);\r\n      if (normalVector.normalizeInPlace()\r\n        && vector12.isAlmostEqual(vector03)\r\n        && vector01.isPerpendicularTo(vector03)) {\r\n        return Transform.createOriginAndMatrixColumns(\r\n          dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector,\r\n        );\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\r\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\r\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\r\n    } else if (data instanceof CurveChain) {\r\n      if (!data.checkForNonLinearPrimitives()) {\r\n        // const linestring = LineString3d.create();\r\n        const strokes = data.getPackedStrokes();\r\n        if (strokes) {\r\n          return this.rectangleEdgeTransform(strokes);\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Look for and simplify:\r\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\r\n   *   * collect all points\r\n   *   * eliminate duplicated points\r\n   *   * eliminate points colinear with surrounding points\r\n   *   * contiguous concentric circular or elliptic arcs\r\n   *   * combine angular ranges\r\n   * * This function can be used to compress adjacent LineSegment3ds into a LineString3d\r\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\r\n   * @param options options for tolerance and selective simplification.\r\n   */\r\n  public static consolidateAdjacentPrimitives(curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions): void {\r\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\r\n    curves.dispatchToGeometryHandler(context);\r\n  }\r\n  /**\r\n   * Reverse and reorder loops in the xy-plane for consistent orientation and containment.\r\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored.\r\n   * * For best results, all overlaps should be containments, i.e., loop boundaries can touch, but should not cross.\r\n   * @returns a region that captures the input pointers. This region is a:\r\n   * * [[Loop]] if there is exactly one input loop. It is oriented counterclockwise.\r\n   * * [[ParityRegion]] if input consists of exactly one outer loop with at least one hole loop.\r\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented\r\n   * clockwise.\r\n   * * [[UnionRegion]] if any other input configuration. Its children are individually ordered/oriented as in\r\n   * the above cases.\r\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\r\n   */\r\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\r\n    const loopAndArea: SortablePolygon[] = [];\r\n    for (const candidate of loops) {\r\n      if (candidate instanceof Loop)\r\n        SortablePolygon.pushLoop(loopAndArea, candidate);\r\n      else if (candidate instanceof IndexedXYZCollection) {\r\n        const loop = Loop.createPolygon(candidate);\r\n        SortablePolygon.pushLoop(loopAndArea, loop);\r\n      }\r\n    }\r\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\r\n  }\r\n  /**\r\n   * Collect inputs that are nominally closed: regions, and physically closed curves.\r\n   * * Physically closed input curves are each returned wrapped in a Loop to facilitate xy-algorithms,\r\n   * but outside this limited context, these Loops only makes sense if they are planar.\r\n  */\r\n  private static collectRegionsAndClosedPrimitives(curves: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance): AnyRegion[] {\r\n    const regions: AnyRegion[] = [];\r\n    if (!Array.isArray(curves))\r\n      curves = [curves];\r\n    for (const curve of curves) {\r\n      if (curve instanceof Loop || curve instanceof ParityRegion || curve instanceof UnionRegion) {\r\n        regions.push(curve);\r\n      } else if (curve instanceof Path) {\r\n        if (curve.isPhysicallyClosedCurve(tolerance))\r\n          regions.push(Loop.create(...curve.children));\r\n      } else if (curve instanceof CurvePrimitive) {\r\n        if (curve.isPhysicallyClosedCurve(tolerance))\r\n          regions.push(Loop.create(curve));\r\n      }\r\n    }\r\n    return regions;\r\n  }\r\n  /**\r\n   * Find all xy-areas bounded by the unstructured, possibly intersecting curves.\r\n   * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.\r\n   * * \"Holes\" implied/bounded by inputs are _not_ preserved/discovered in output; in particular [[ParityRegion]]\r\n   * hole loops are treated like any other positive area loops.\r\n   * * A common use case of this method is to assemble the bounding negative-area \"exterior\" loop for each connected\r\n   * component of input curves. Passing `addBridges = true` decreases the number of connected components for nested\r\n   * input [[Loop]]s, and thus increases the likelihood of returning exactly one exterior loop. (This is why the\r\n   * default value for `addBridges` is `true`.)\r\n   * @param curvesAndRegions Any collection of curves. Each [[AnyRegion]] contributes its children _stripped of\r\n   * parity context_.\r\n   * @param tolerance optional distance tolerance for coincidence.\r\n   * @param addBridges whether to add line segments to connect nested input [[Loop]]s (default is `true`). When `false`,\r\n   * no line segments are added to the input curves, but the number of output components may be greater than expected.\r\n   * @returns array of [[SignedLoops]], each entry of which describes the areas bounded by a single connected component:\r\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have\r\n   * positive area and counterclockwise orientation.\r\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\r\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\r\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent\r\n   * to the edge and a constituent curve in each.\r\n   */\r\n  public static constructAllXYRegionLoops(\r\n    curvesAndRegions: AnyCurve | AnyCurve[],\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n    addBridges: boolean = true,\r\n  ): SignedLoops[] {\r\n    let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\r\n    primitives = TransferWithSplitArcs.clone(BagOfCurves.create(...primitives)).children as CurvePrimitive[];\r\n    const range = this.curveArrayRange(primitives);\r\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\r\n    if (addBridges) { // generate a temp graph to extract its bridge edges\r\n      const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n      const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);\r\n      context.addMembers(regions, undefined);\r\n      context.annotateAndMergeCurvesInGraph(tolerance);\r\n      context.graph.announceEdges((_graph, edge: HalfEdge) => {\r\n        if (edge.isMaskSet(HalfEdgeMask.BRIDGE_EDGE))\r\n          primitives.push(LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));\r\n        return true;\r\n      });\r\n    }\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\r\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\r\n  }\r\n  /**\r\n   * Collect all `CurvePrimitives` in loosely typed input.\r\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\r\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\r\n   * @param candidates input curves\r\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\r\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If\r\n   * false, push the [[CurveChainWithDistanceIndex]] instead.\r\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\r\n   * push the [[LineString3d]] instead.\r\n   */\r\n  public static collectCurvePrimitives(\r\n    candidates: AnyCurve | AnyCurve[],\r\n    collectorArray?: CurvePrimitive[],\r\n    smallestPossiblePrimitives: boolean = false,\r\n    explodeLinestrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    if (candidates instanceof CurvePrimitive) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (candidates instanceof CurveCollection) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (Array.isArray(candidates)) {\r\n      for (const c of candidates) {\r\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n    return results;\r\n  }\r\n  /**\r\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed\r\n   * instances of [[LineSegment3d]].\r\n   * @param candidates input curves\r\n   * @return copied (captured) inputs except for the linestrings, which are exploded\r\n   */\r\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    for (const c of candidates) {\r\n      if (c instanceof LineString3d) {\r\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\r\n          const q = c.getIndexedSegment(i);\r\n          if (q !== undefined)\r\n            result.push(q);\r\n        }\r\n      } else {\r\n        result.push(c);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the overall range of given curves.\r\n   * @param data candidate curves\r\n   * @param worldToLocal transform to apply to data before computing its range\r\n   */\r\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\r\n    const range = Range3d.create();\r\n    if (data instanceof GeometryQuery)\r\n      data.extendRange(range, worldToLocal);\r\n    else if (Array.isArray(data)) {\r\n      for (const c of data) {\r\n        if (c instanceof GeometryQuery)\r\n          c.extendRange(range, worldToLocal);\r\n        else if (c instanceof Point3d)\r\n          range.extendPoint(c, worldToLocal);\r\n        else if (c instanceof GrowableXYZArray)\r\n          range.extendRange(c.getRange(worldToLocal));\r\n        else if (Array.isArray(c))\r\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Triangulate a stroked Loop or ParityRegion and return the graph.\r\n   * @param polygons polygons obtained by stroking a Loop or ParityRegion, z-coordinates ignored.\r\n   * @returns triangulated graph\r\n   */\r\n  private static triangulateStrokedRegionComponent(polygons: MultiLineStringDataVariant): HalfEdgeGraph | undefined {\r\n    let graph: HalfEdgeGraph | undefined;\r\n    if (Array.isArray(polygons)) {\r\n      if (polygons.length === 0)\r\n        return undefined;\r\n      const firstEntry = polygons[0];\r\n      if (Point3d.isAnyImmediatePointType(firstEntry)) {\r\n        graph = Triangulator.createTriangulatedGraphFromSingleLoop(polygons as XYAndZ[] | XAndY[] | number[][]);\r\n      } else if (polygons.length > 1) {\r\n        let writablePolygons: IndexedReadWriteXYZCollection[];\r\n        if (firstEntry instanceof IndexedReadWriteXYZCollection) {\r\n          writablePolygons = polygons as IndexedReadWriteXYZCollection[];\r\n        } else {\r\n          writablePolygons = [];\r\n          for (const polygon of polygons as LineStringDataVariant[])\r\n            writablePolygons.push(GrowableXYZArray.create(polygon));\r\n        }\r\n        const sortedPolygons = PolygonOps.sortOuterAndHoleLoopsXY(writablePolygons);\r\n        if (sortedPolygons.length === 1) { // below requires exactly one outer loop!\r\n          if (graph = Triangulator.createTriangulatedGraphFromLoops(sortedPolygons[0]))\r\n            Triangulator.flipTriangles(graph);\r\n        }\r\n      } else {\r\n        graph = Triangulator.createTriangulatedGraphFromSingleLoop(firstEntry);\r\n      }\r\n    } else {\r\n      graph = Triangulator.createTriangulatedGraphFromSingleLoop(polygons);\r\n    }\r\n    if (!graph) {\r\n      // Last resort: try full merge. Conveniently, multiple polygons are processed with parity logic.\r\n      if (graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(polygons, [], (inA, _inB) => inA)) {\r\n        if (Triangulator.triangulateAllPositiveAreaFaces(graph))\r\n          Triangulator.flipTriangles(graph);\r\n      }\r\n    }\r\n    return graph;\r\n  }\r\n  /** Stroke a Loop or ParityRegion */\r\n  private static strokeRegionComponent(component: Loop | ParityRegion, options?: StrokeOptions): GrowableXYZArray[] {\r\n    const strokedComponent = component.cloneStroked(options);\r\n    // package the stroked region as polygons\r\n    const polygons: GrowableXYZArray[] = [];\r\n    if (strokedComponent instanceof Loop) {\r\n      if (strokedComponent.children.length > 0 && strokedComponent.children[0] instanceof LineString3d)\r\n        polygons.push(strokedComponent.children[0].packedPoints); // expect only 1\r\n    } else if (strokedComponent instanceof ParityRegion) {\r\n      for (const strokedLoop of strokedComponent.children) {\r\n        if (strokedLoop.children.length > 0 && strokedLoop.children[0] instanceof LineString3d)\r\n          polygons.push(strokedLoop.children[0].packedPoints); // expect only 1\r\n      }\r\n    }\r\n    return polygons;\r\n  }\r\n  /**\r\n   * Triangulate a Loop or ParityRegion and return the graph.\r\n   * @param component region, z-coordinates ignored\r\n   * @param options how to stroke loops\r\n   * @returns triangulated graph\r\n   */\r\n  private static triangulateRegionComponent(component: Loop | ParityRegion, options?: StrokeOptions): HalfEdgeGraph | undefined {\r\n    const polygons = this.strokeRegionComponent(component, options);\r\n    return this.triangulateStrokedRegionComponent(polygons);\r\n  }\r\n  /**\r\n   * Facet the region according to stroke options.\r\n   * @note For best results, [[UnionRegion]] input should consist of non-overlapping children. See [[regionBooleanXY]].\r\n   * @note For best results, [[ParityRegion]] input should be correctly oriented. See [[sortOuterAndHoleLoopsXY]].\r\n   * @param region a closed xy-planar region, possibly with holes.\r\n   * * The z-coordinates of the region are ignored. Caller is responsible for rotating the region into plane local coordinates beforehand, and reversing the rotation afterwards.\r\n   * @param options primarily how to stroke the region boundary, but also how to facet the region interior.\r\n   * * By default, a triangulation is returned, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.\r\n   * @returns facets for the region, or undefined if facetting failed\r\n   */\r\n  public static facetRegionXY(region: AnyRegion, options?: StrokeOptions): IndexedPolyface | undefined {\r\n    let graph: HalfEdgeGraph | undefined;\r\n    if (region instanceof UnionRegion) {\r\n      for (const child of region.children) {\r\n        const childGraph = RegionOps.triangulateRegionComponent(child, options);\r\n        if (childGraph) {\r\n          if (!graph) {\r\n            graph = childGraph;\r\n          } else {\r\n            // Graph concatenation without edge splits, clustering, and merge. We assume disjoint children so that at worst,\r\n            // components will have unshared adjacent exterior edges that remain after expandConvexFaces. Note that calling\r\n            // clusterAndMergeXYTheta here can create non-manifold topology!\r\n            graph.allHalfEdges.push(...childGraph.allHalfEdges);\r\n          }\r\n        }\r\n      }\r\n    } else {\r\n      graph = this.triangulateRegionComponent(region, options);\r\n    }\r\n    if (!graph)\r\n      return undefined;\r\n    if (options?.maximizeConvexFacets)\r\n      HalfEdgeGraphOps.expandConvexFaces(graph);\r\n    return PolyfaceBuilder.graphToPolyface(graph, options);\r\n  }\r\n  /**\r\n   * Decompose a polygon with optional holes into an array of convex polygons.\r\n   * @param polygon polygon and hole loops, e.g., as returned by [[CurveCollection.cloneStroked]] on a Loop or ParityRegion. All z-coordinates are ignored.\r\n   * @param maximize whether to return maximally convex polygons. If false, triangles are returned.\r\n   * @returns array of convex polygons, or undefined if triangulation failed\r\n  */\r\n  public static convexDecomposePolygonXY(polygon: MultiLineStringDataVariant, maximize: boolean = true): GrowableXYZArray[] | undefined {\r\n    const graph = RegionOps.triangulateStrokedRegionComponent(polygon);\r\n    if (!graph)\r\n      return undefined;\r\n    if (maximize)\r\n      HalfEdgeGraphOps.expandConvexFaces(graph);\r\n    const convexPolygons: GrowableXYZArray[] = [];\r\n    graph.announceFaceLoops((_graph, seed) => {\r\n      if (!seed.isMaskSet(HalfEdgeMask.EXTERIOR))\r\n        convexPolygons.push(GrowableXYZArray.create(seed.collectAroundFace((node) => { return node.getPoint3d(); })));\r\n      return true;\r\n    });\r\n    return convexPolygons;\r\n  }\r\n}\r\n/** @internal */\r\nfunction pushToInOnOutArrays(\r\n  curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[],\r\n): void {\r\n  if (select > 0)\r\n    arrayPositive.push(curve);\r\n  else if (select < 0)\r\n    arrayNegative.push(curve);\r\n  else\r\n    array0.push(curve);\r\n}\r\n\r\n/**\r\n * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.\r\n * @public\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesOptions {\r\n  /** True to consolidate adjacent linear geometry into a single LineString3d. */\r\n  public consolidateLinearGeometry: boolean = true;\r\n  /** True to consolidate contiguous compatible arcs into a single Arc3d. */\r\n  public consolidateCompatibleArcs: boolean = true;\r\n  /** True to consolidate the first and last primitives of a [[Loop]], allowing the start/end point to change. */\r\n  public consolidateLoopSeam?: boolean = false;\r\n  /** Disable LineSegment3d and LineString3d point compression. */\r\n  public disableLinearCompression?: boolean = false;\r\n  /** Tolerance for detecting identical points. */\r\n  public duplicatePointTolerance: number = Geometry.smallMetricDistance;\r\n  /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */\r\n  public colinearPointTolerance: number = Geometry.smallMetricDistance;\r\n}\r\n"]}
+{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,0CAAuC;AACvC,6DAA0D;AAC1D,qEAAkE;AAClE,6EAE4C;AAC5C,2EAAwE;AACxE,mEAAkE;AAClE,yDAAsD;AACtD,mGAA2F;AAC3F,+CAA8C;AAC9C,+CAA4C;AAC5C,mEAAgE;AAChE,uDAAoD;AAEpD,yDAAsD;AAEtD,iEAA8D;AAC9D,6CAA0E;AAC1E,yEAAsE;AACtE,iDAAuD;AACvD,6DAAyD;AACzD,uDAA6E;AAC7E,6CAA0C;AAC1C,yCAAsC;AACtC,qDAAkD;AAElD,+DAA4D;AAC5D,mDAAgD;AAChD,oFAAiF;AACjF,kFAAmF;AACnF,oFAAiF;AACjF,mDAAgD;AAChD,iDAA8C;AAC9C,iCAA2C;AAC3C,mDAA8D;AAC9D,iDAA8C;AAC9C,iCAA8B;AAC9B,uGAAyG;AACzG,iEAA8D;AAC9D,mDAAyD;AACzD,iEAA8D;AAC9D,uDAAoD;AACpD,mFAAqH;AAErH,+CAA4C;AAY5C;;;GAGG;AACH,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,kCAAlB,kBAAkB,QAM7B;AAED;;;;;;;;;;;GAWG;AACH,MAAa,SAAS;IACpB;;;;;;;;OAQG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB;QAClD,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,MAAM,YAAY,uBAAU,EAAE,CAAC;YACjC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;MAIE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,mBAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB;QAC3C,MAAM,OAAO,GAAG,IAAI,iCAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,MAAM,YAAY,uBAAU,EAAE,CAAC;YACjC,OAAO,MAAM,CAAC,WAAW,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,wBAAwB,CAAC,KAAe;QACpD,MAAM,OAAO,GAAG,IAAI,yCAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC3B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB,EAAE,MAAc;QAChE,MAAM,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC5E,IAAI,CAAC,YAAY;YACf,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,0BAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/D,IAAI,QAAQ,GAA0B,MAAM,CAAC;QAC7C,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,mDAAmD;YACpE,QAAQ,GAAG,MAAM,CAAC,gBAAgB,CAAC,YAAY,CAAC,OAAO,EAAG,CAA0B,CAAC;YACrF,IAAI,CAAC,QAAQ;gBACX,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,MAAM,UAAU,GAAG,SAAS,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU;YACb,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzD,IAAI,CAAC,UAAU,EAAE,2CAA2C;YAC1D,YAAY,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEnD,IAAI,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;YACf,IAAI,GAAG,CAAC,IAAI,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,aAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;QAChB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAC3B,KAAoB,EACpB,IAAgC,EAChC,oBAAoE;QAEpE,IAAI,IAAI,YAAY,WAAI,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACxC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;YAC9D,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE,CAAC;YAChD,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,IAAI,yBAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC7C,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAE1C,CAAC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,2CAAoB,EAAE,CAAC;oBACnD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;wBACxB,MAAM,QAAQ,GAAG,4BAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;oBAC1C,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;wBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;oBAC3F,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAExF,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE,CAAC;gBACT,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YACxD,CAAC;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,WAAW,EAAE,CAAC;gBAChB,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACpC,CAAC;YACD,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CACjD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAC7C,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAClD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB;QAChD,IAAI,MAAM,YAAY,yBAAW,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC9B,OAAO,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;aAAM,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC;YAC1C,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,cAAc,CAAC,MAAiB;QAC5C,IAAI,MAAM,YAAY,WAAI;YACxB,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QACzD,sCAAsC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC;iBAAM,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;gBAC9B,IAAA,qBAAM,EAAC,CAAC,CAAC,QAAQ,YAAY,yBAAW,CAAC,CAAC,CAAC;gBAC3C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,SAAS,CAAC;QACnB,6CAA6C;QAC7C,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,MAA2C,EAC3C,MAA2C,EAC3C,SAA6B,EAC7B,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,MAAM,MAAM,GAAG,yBAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,MAAM,UAAU,GAAG,oBAAY,CAAC,WAAW,CAAC;QAC5C,OAAO,CAAC,sBAAsB,CAC5B,SAAS,EACT,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YAC5E,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,MAAM,kBAAkB,GAAG,qCAAiB,CAAC,8BAA8B,CAAC,IAAI,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBACzG,IAAI,kBAAkB;oBACpB,MAAM,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC,CACF,CAAC;QACF,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC,EACpC,cAAuB,KAAK;QAE5B,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iDAAiB,CAAC,KAAK,EAC/B,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QAEpC,MAAM,KAAK,GAAG,yDAAyB,CAAC,qCAAqC,CAC3E,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,SAAS,EACT,MAAM,EACN,iDAAiB,CAAC,KAAK,EACvB,IAAI,CACL,CAAC;QACF,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,2BAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,4BAA4B,CACxC,MAAiB,EAAE,IAAa,EAAE,uBAA8C;QAEhF,MAAM,OAAO,GAAG,IAAI,+CAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAmB,EAAE,uBAA8D;QAEnF,MAAM,aAAa,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QACpE,OAAO,mBAAQ,CAAC,sBAAsB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,gCAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2BAA2B,CACvC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QAE9F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,mBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC3C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,UAAU,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACpC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,MAAM,CAAC,wBAAwB,CAA2B;IAClE;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B;QAC7D,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,WAAiC,EAAE,YAA6B;QAEhE,OAAO,qCAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,6CAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAC1C,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAEnE,OAAO,mBAAQ,CAAC,gCAAgC,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB;QACpG,OAAO,mBAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IACzD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CACvC,WAAiC,EAAE,MAAiB;QAEpD,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,iCAAe,EAAE,CAAC;YAC1C,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACxC,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;gBACvG,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,UAAU,YAAY,+BAAc,EAAE,CAAC;YAChD,MAAM,YAAY,GAAG,iCAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE,CAAC;gBACjB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;YAC5G,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,sBAAsB,CAClC,IAAiD,EAAE,sBAA+B,IAAI;QAEtF,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACxD,CAAC;aAAM,IAAI,IAAI,YAAY,2CAAoB,EAAE,CAAC;YAChD,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACrD,SAAS,GAAG,IAAI,CAAC;YACnB,CAAC;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvD,OAAO,SAAS,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,SAAS,GAAG,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,4DAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;YACrB,CAAC;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1C,OAAO,qBAAS,CAAC,4BAA4B,CAC3C,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAC/E,CAAC;YACJ,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,yCAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE,CAAC;YAC1G,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1E,CAAC;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY,EAAE,CAAC;YAC1G,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,YAAY,4BAAU,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE,CAAC;gBACxC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;gBAC9C,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAuB,EAAE,OAAmD;QACtH,MAAM,OAAO,GAAG,IAAI,gFAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;YAC9B,IAAI,SAAS,YAAY,WAAI;gBAC3B,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,2CAAoB,EAAE,CAAC;gBACnD,MAAM,IAAI,GAAG,WAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,iCAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,OAAO,iCAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;MAIE;IACM,MAAM,CAAC,iCAAiC,CAAC,MAA6B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC9H,MAAM,OAAO,GAAgB,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACxB,MAAM,GAAG,CAAC,MAAM,CAAC,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,WAAI,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,YAAY,yBAAW,EAAE,CAAC;gBAC3F,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,KAAK,YAAY,WAAI,EAAE,CAAC;gBACjC,IAAI,KAAK,CAAC,uBAAuB,CAAC,SAAS,CAAC;oBAC1C,OAAO,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjD,CAAC;iBAAM,IAAI,KAAK,YAAY,+BAAc,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,uBAAuB,CAAC,SAAS,CAAC;oBAC1C,OAAO,CAAC,IAAI,CAAC,WAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;;;;;;;;;;;;;;;OAqBG;IACI,MAAM,CAAC,yBAAyB,CACrC,gBAAuC,EACvC,YAAoB,mBAAQ,CAAC,mBAAmB,EAChD,aAAsB,IAAI;QAE1B,IAAI,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3F,UAAU,GAAG,6CAAqB,CAAC,KAAK,CAAC,6BAAW,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,QAA4B,CAAC;QACzG,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,IAAI,UAAU,EAAE,CAAC,CAAC,oDAAoD;YACpE,MAAM,OAAO,GAAG,oDAAoB,CAAC,MAAM,CAAC,iDAAiB,CAAC,KAAK,EAAE,iDAAiB,CAAC,KAAK,CAAC,CAAC;YAC9F,MAAM,OAAO,GAAG,IAAI,CAAC,iCAAiC,CAAC,gBAAgB,EAAE,SAAS,CAAC,CAAC;YACpF,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YACvC,OAAO,CAAC,6BAA6B,CAAC,SAAS,CAAC,CAAC;YACjD,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAM,EAAE,IAAc,EAAE,EAAE;gBACrD,IAAI,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,WAAW,CAAC;oBAC1C,UAAU,CAAC,IAAI,CAAC,6BAAa,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC5F,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;QACL,CAAC;QACD,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,qCAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAClC,UAAiC,EACjC,cAAiC,EACjC,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QAEnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,+BAAc,EAAE,CAAC;YACzC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QAC7F,CAAC;aAAM,IAAI,UAAU,YAAY,iCAAe,EAAE,CAAC;YACjD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QAC7F,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACrC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,CAAC,YAAY,2BAAY,EAAE,CAAC;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,6BAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;gBACrB,IAAI,CAAC,YAAY,6BAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,yBAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,mCAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACK,MAAM,CAAC,iCAAiC,CAAC,QAAoC;QACnF,IAAI,KAAgC,CAAC;QACrC,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBACvB,OAAO,SAAS,CAAC;YACnB,MAAM,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,yBAAO,CAAC,uBAAuB,CAAC,UAAU,CAAC,EAAE,CAAC;gBAChD,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,QAA2C,CAAC,CAAC;YAC1G,CAAC;iBAAM,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,IAAI,gBAAiD,CAAC;gBACtD,IAAI,UAAU,YAAY,oDAA6B,EAAE,CAAC;oBACxD,gBAAgB,GAAG,QAA2C,CAAC;gBACjE,CAAC;qBAAM,CAAC;oBACN,gBAAgB,GAAG,EAAE,CAAC;oBACtB,KAAK,MAAM,OAAO,IAAI,QAAmC;wBACvD,gBAAgB,CAAC,IAAI,CAAC,mCAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC5D,CAAC;gBACD,MAAM,cAAc,GAAG,uBAAU,CAAC,uBAAuB,CAAC,gBAAgB,CAAC,CAAC;gBAC5E,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC,yCAAyC;oBAC1E,IAAI,KAAK,GAAG,4BAAY,CAAC,gCAAgC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;wBAC1E,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,UAAU,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,4BAAY,CAAC,qCAAqC,CAAC,QAAQ,CAAC,CAAC;QACvE,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,gGAAgG;YAChG,IAAI,KAAK,GAAG,yDAAyB,CAAC,gBAAgB,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzF,IAAI,4BAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC;oBACrD,4BAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC5B,MAAM,CAAC,qBAAqB,CAAC,SAA8B,EAAE,OAAuB;QAC1F,MAAM,gBAAgB,GAAG,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACzD,yCAAyC;QACzC,MAAM,QAAQ,GAAuB,EAAE,CAAC;QACxC,IAAI,gBAAgB,YAAY,WAAI,EAAE,CAAC;YACrC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY;gBAC9F,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB;QAC9E,CAAC;aAAM,IAAI,gBAAgB,YAAY,2BAAY,EAAE,CAAC;YACpD,KAAK,MAAM,WAAW,IAAI,gBAAgB,CAAC,QAAQ,EAAE,CAAC;gBACpD,IAAI,WAAW,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,2BAAY;oBACpF,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,gBAAgB;YACzE,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,0BAA0B,CAAC,SAA8B,EAAE,OAAuB;QAC/F,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,iCAAiC,CAAC,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,OAAuB;QACpE,IAAI,KAAgC,CAAC;QACrC,IAAI,MAAM,YAAY,yBAAW,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACpC,MAAM,UAAU,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACxE,IAAI,UAAU,EAAE,CAAC;oBACf,IAAI,CAAC,KAAK,EAAE,CAAC;wBACX,KAAK,GAAG,UAAU,CAAC;oBACrB,CAAC;yBAAM,CAAC;wBACN,gHAAgH;wBAChH,+GAA+G;wBAC/G,gEAAgE;wBAChE,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC3D,CAAC;QACD,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,EAAE,oBAAoB;YAC/B,0BAAgB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC5C,OAAO,iCAAe,CAAC,eAAe,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IACD;;;;;MAKE;IACK,MAAM,CAAC,wBAAwB,CAAC,OAAmC,EAAE,WAAoB,IAAI;QAClG,MAAM,KAAK,GAAG,SAAS,CAAC,iCAAiC,CAAC,OAAO,CAAC,CAAC;QACnE,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ;YACV,0BAAgB,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,cAAc,GAAuB,EAAE,CAAC;QAC9C,KAAK,CAAC,iBAAiB,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;gBACxC,cAAc,CAAC,IAAI,CAAC,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAI,EAAE,EAAE,GAAG,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChH,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,cAAc,CAAC;IACxB,CAAC;CACF;AAv6BD,8BAu6BC;AACD,gBAAgB;AAChB,SAAS,mBAAmB,CAC1B,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IAEzG,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAa,yCAAyC;IACpD,+EAA+E;IACxE,yBAAyB,GAAY,IAAI,CAAC;IACjD,0EAA0E;IACnE,yBAAyB,GAAY,IAAI,CAAC;IACjD,+GAA+G;IACxG,mBAAmB,GAAa,KAAK,CAAC;IAC7C,gEAAgE;IACzD,wBAAwB,GAAa,KAAK,CAAC;IAClD,gDAAgD;IACzC,uBAAuB,GAAW,mBAAQ,CAAC,mBAAmB,CAAC;IACtE,wFAAwF;IACjF,sBAAsB,GAAW,mBAAQ,CAAC,mBAAmB,CAAC;CACtE;AAbD,8FAaC","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\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../Geometry\";\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport {\n  IndexedReadWriteXYZCollection, IndexedXYZCollection, LineStringDataVariant, MultiLineStringDataVariant,\n} from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XAndY, XYAndZ } from \"../geometry3d/XYZProps\";\nimport { MomentData } from \"../geometry4d/MomentData\";\nimport { IndexedPolyface, Polyface } from \"../polyface/Polyface\";\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphOps } from \"../topology/Merging\";\nimport { Triangulator } from \"../topology/Triangulation\";\nimport { BagOfCurves, CurveChain, CurveCollection } from \"./CurveCollection\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { CurveOps } from \"./CurveOps\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyChain, AnyCurve, AnyRegion } from \"./CurveTypes\";\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { ChainCollectorContext } from \"./internalContexts/ChainCollectorContext\";\nimport { PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\nimport { TransferWithSplitArcs } from \"./internalContexts/TransferWithSplitArcs\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { LineString3d } from \"./LineString3d\";\nimport { Loop, SignedLoops } from \"./Loop\";\nimport { JointOptions, OffsetOptions } from \"./OffsetOptions\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { Path } from \"./Path\";\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\nimport { StrokeOptions } from \"./StrokeOptions\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/**\n * * `properties` is a string with special characters indicating\n *   * \"U\" -- contains unmerged stick data\n *   * \"M\" -- merged\n *   * \"R\" -- regularized\n *   * \"X\" -- has exterior markup\n * @internal\n */\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\n\n/**\n * Enumeration of the binary operation types for a booleans among regions\n * @public\n */\nexport enum RegionBinaryOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  AMinusB = 3,\n  BMinusA = 4,\n}\n\n/**\n * Class `RegionOps` has static members for calculations on regions (areas).\n * * Regions are represented by these [[CurveCollection]] subclasses:\n *   * [[Loop]] -- a single loop\n *   * [[ParityRegion]] -- a collection of loops, interpreted by parity rules.\n * The common \"One outer loop and many inner loops\" is a parity region.\n *   * [[UnionRegion]] -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\n * * Most of the methods in this class:\n *   * Ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.\n *   * Assume consistent Loop orientation: \"solid\" Loops are counterclockwise; \"hole\" Loops are clockwise.\n * @public\n */\nexport class RegionOps {\n  /**\n   * Return moment sums for a loop, parity region, or union region.\n   * * The input region should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\n   * call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes(rawMomentData.origin, rawMomentData.sums);`\n   * * `rawMomentData.origin` is the centroid of `region`.\n   * * `rawMomentData.sums.weight()` is the signed area of `region`.\n   * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].\n   */\n  public static computeXYAreaMoments(region: AnyRegion): MomentData | undefined {\n    const handler = new RegionMomentsXY();\n    const result = region.dispatchToGeometryHandler(handler);\n    if (result instanceof MomentData) {\n      result.shiftOriginAndSumsToCentroidOfSums();\n      return result;\n    }\n    return undefined;\n  }\n  /**\n   * Return an area tolerance for a given xy-range and optional distance tolerance.\n   * @param range range of planar region to tolerance.\n   * @param distanceTolerance optional absolute distance tolerance.\n  */\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\n    // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).\n    const halfDistTol = 0.5 * distanceTolerance;\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\n  }\n  /**\n   * Return a (signed) xy area for a region.\n   * * The input region should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\n   * * For a non-self-intersecting Loop, the returned area is negative if and only if the Loop is oriented clockwise\n   * with respect to the positive z-axis.\n   * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].\n   */\n  public static computeXYArea(region: AnyRegion): number | undefined {\n    const handler = new RegionMomentsXY();\n    const result = region.dispatchToGeometryHandler(handler);\n    if (result instanceof MomentData) {\n      return result.quantitySum;\n    }\n    return undefined;\n  }\n  /**\n   * Return MomentData with the sums of wire moments.\n   * * The input curve should lie in a plane parallel to the xy-plane, as z-coords will be ignored.\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\n   * call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\n   * * `rawMomentData.origin` is the wire centroid of `curve`.\n   * * `rawMomentData.sums.weight()` is the signed length of `curve`.\n   * @param curve any [[CurveCollection]] or [[CurvePrimitive]].\n   */\n  public static computeXYZWireMomentSums(curve: AnyCurve): MomentData | undefined {\n    const handler = new CurveWireMomentsXYZ();\n    handler.visitLeaves(curve);\n    const result = handler.momentData;\n    result.shiftOriginAndSumsToCentroidOfSums();\n    return result;\n  }\n  /**\n   * Return a [[Ray3d]] with:\n   * * `origin` is the centroid of the region,\n   * * `direction` is a unit vector perpendicular to the region plane,\n   * * `a` is the region area.\n   * @param region the region to process. Can lie in any plane.\n   * @param result optional pre-allocated result to populate and return.\n   */\n  public static centroidAreaNormal(region: AnyRegion, result?: Ray3d): Ray3d | undefined {\n    const localToWorld = FrameBuilder.createRightHandedFrame(undefined, region);\n    if (!localToWorld)\n      return undefined;\n    const normal = localToWorld.matrix.columnZ(result?.direction);\n    const regionIsXY = normal.isParallelTo(Vector3d.unitZ(), true);\n    let regionXY: AnyRegion | undefined = region;\n    if (!regionIsXY) { // rotate the region to be parallel to the xy-plane\n      regionXY = region.cloneTransformed(localToWorld.inverse()!) as AnyRegion | undefined;\n      if (!regionXY)\n        return undefined;\n    }\n    const momentData = RegionOps.computeXYAreaMoments(regionXY);\n    if (!momentData)\n      return undefined;\n    const centroid = momentData.origin.clone(result?.origin);\n    if (!regionIsXY) // rotate centroid back (area is unchanged)\n      localToWorld.multiplyPoint3d(centroid, centroid);\n\n    let area = momentData.sums.weight();\n    if (area < 0.0) {\n      area = -area;\n      normal.scale(-1.0, normal);\n    }\n    if (!result)\n      result = Ray3d.createCapture(centroid, normal);\n    result.a = area;\n    return result;\n  }\n  /**\n   * Create loops in the graph.\n   * @internal\n   */\n  public static addLoopsToGraph(\n    graph: HalfEdgeGraph,\n    data: MultiLineStringDataVariant,\n    announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void,\n  ): void {\n    if (data instanceof Loop) {\n      const points = data.getPackedStrokes();\n      if (points)\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\n    } else if (data instanceof ParityRegion) {\n      for (const child of data.children) {\n        const points = child.getPackedStrokes();\n        if (points)\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\n      }\n    } else if (data instanceof IndexedXYZCollection) {\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\n      if (loopSeed !== undefined)\n        announceIsolatedLoop(graph, loopSeed);\n    } else if (Array.isArray(data)) {\n      if (data.length > 0) {\n        if (Point3d.isAnyImmediatePointType(data[0])) {\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\n          if (loopSeed !== undefined)\n            announceIsolatedLoop(graph, loopSeed);\n\n        } else if (data[0] instanceof IndexedXYZCollection) {\n          for (const loop of data) {\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\n            if (loopSeed !== undefined)\n              announceIsolatedLoop(graph, loopSeed);\n          }\n        } else {\n          for (const child of data) {\n            if (Array.isArray(child))\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\n          }\n        }\n      }\n    }\n  }\n  /**\n   * Add multiple loops to a graph.\n   * * Apply edgeTag and mask to each edge.\n   * @internal\n   */\n  public static addLoopsWithEdgeTagToGraph(\n    graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any,\n  ): HalfEdge[] | undefined {\n    const loopSeeds: HalfEdge[] = [];\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\n      if (seed) {\n        loopSeeds.push(seed);\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\n      }\n    });\n    if (loopSeeds.length > 0)\n      return loopSeeds;\n    return undefined;\n  }\n  /**\n   * Given a graph just produced by booleans, convert to a polyface\n   * * \"just produced\" implies exterior face markup.\n   * @param graph\n   * @param triangulate\n   */\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\n    if (graph) {\n      if (triangulate) {\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\n        Triangulator.flipTriangles(graph);\n      }\n      return PolyfaceBuilder.graphToPolyface(graph);\n    }\n    return undefined;\n  }\n  /**\n   * Return a polyface containing the area intersection of two XY regions.\n   * * Within each region, in and out is determined by parity rules.\n   *   * Any face that is an odd number of crossings from the far outside is IN\n   *   * Any face that is an even number of crossings from the far outside is OUT\n   * @param loopsA first set of loops\n   * @param loopsB second set of loops\n   * @param triangulate whether to triangulate the result\n   */\n  public static polygonXYAreaIntersectLoopsToPolyface(\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\n  ): Polyface | undefined {\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\n      loopsA,\n      loopsB,\n      (inA: boolean, inB: boolean) => (inA && inB),\n      this._graphCheckPointFunction,\n    );\n    return this.finishGraphToPolyface(graph, triangulate);\n  }\n  /**\n   * Return a polyface containing the area union of two XY regions.\n   * * Within each region, in and out is determined by parity rules.\n   *   * Any face that is an odd number of crossings from the far outside is IN\n   *   * Any face that is an even number of crossings from the far outside is OUT\n   * @param loopsA first set of loops\n   * @param loopsB second set of loops\n   * @param triangulate whether to triangulate the result\n   */\n  public static polygonXYAreaUnionLoopsToPolyface(\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\n  ): Polyface | undefined {\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\n      loopsA,\n      loopsB,\n      (inA: boolean, inB: boolean) => (inA || inB),\n      this._graphCheckPointFunction,\n    );\n    return this.finishGraphToPolyface(graph, triangulate);\n  }\n  /**\n   * Return a polyface containing the area difference of two XY regions.\n   * * Within each region, in and out is determined by parity rules.\n   *   * Any face that is an odd number of crossings from the far outside is IN\n   *   * Any face that is an even number of crossings from the far outside is OUT\n   * @param loopsA first set of loops\n   * @param loopsB second set of loops\n   * @param triangulate whether to triangulate the result\n   */\n  public static polygonXYAreaDifferenceLoopsToPolyface(\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\n  ): Polyface | undefined {\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\n      loopsA,\n      loopsB,\n      (inA: boolean, inB: boolean) => (inA && !inB),\n      this._graphCheckPointFunction,\n    );\n    return this.finishGraphToPolyface(graph, triangulate);\n  }\n  /**\n   * Return the region's simplest representation by stripping redundant parent(s).\n   * * No Boolean operations are performed.\n   * @param region input region (unchanged). Assumed to have at least one child.\n   * @returns\n   * * For a [[UnionRegion]] with exactly one child, return the child if it is a [[Loop]],\n   * or if it is a [[ParityRegion]] with multiple children; otherwise return the `ParityRegion`'s `Loop`.\n   * * For a `ParityRegion` with exactly one child, return the `Loop`.\n   * * All other inputs returned unchanged.\n   * @see [[simplifyRegion]]\n   */\n  public static simplifyRegionType(region: AnyRegion): AnyRegion {\n    if (region instanceof UnionRegion) {\n      if (region.children.length === 1)\n        return this.simplifyRegionType(region.children[0]);\n    } else if (region instanceof ParityRegion) {\n      if (region.children.length === 1)\n        return region.children[0];\n    }\n    return region;\n  }\n  /**\n   * Simplify the region's parent/child hierarchy in place:\n   * * Regions with exactly one child are simplified as per [[simplifyRegionType]].\n   * * Regions without children are removed.\n   * * No Boolean operations are performed.\n   * @param region region to simplify in place\n   * @returns reference to the updated input region\n   * @see [[simplifyRegionType]]\n   */\n  public static simplifyRegion(region: AnyRegion): AnyRegion | undefined {\n    if (region instanceof Loop)\n      return region.children.length > 0 ? region : undefined;\n    // remove childless Parity/UnionRegion\n    for (let i = 0; i < region.children.length; ++i) {\n      const child = region.children[i];\n      const newChild = this.simplifyRegion(child);\n      if (!newChild) {\n        region.children.splice(i--, 1);\n      } else if (newChild !== child) {\n        assert(!(newChild instanceof UnionRegion));\n        region.children.splice(i--, 1, newChild);\n      }\n    }\n    if (region.children.length === 0)\n      return undefined;\n    // remove redundant Parity/UnionRegion parent\n    if (region.children.length === 1)\n      return region.children.splice(0, 1)[0];\n    return region;\n  }\n  /**\n   * Return areas defined by a boolean operation.\n   * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].\n   * @note A common use case of this method is to convert a region with overlapping children into one with\n   * non-overlapping children: `regionOut = RegionOps.regionBooleanXY(regionIn, undefined, RegionBinaryOpType.Union)`.\n   * @param loopsA first set of loops (treated as a union)\n   * @param loopsB second set of loops (treated as a union)\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\n   * @param mergeTolerance absolute distance tolerance for merging loops\n   * @returns a region resulting from merging input loops and the boolean operation.\n   */\n  public static regionBooleanXY(\n    loopsA: AnyRegion | AnyRegion[] | undefined,\n    loopsB: AnyRegion | AnyRegion[] | undefined,\n    operation: RegionBinaryOpType,\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): AnyRegion | undefined {\n    const result = UnionRegion.create();\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\n    context.addMembers(loopsA, loopsB);\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\n    const visitMask = context.graph.grabMask(false);\n    const range = context.groupA.range().union(context.groupB.range());\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\n    const bridgeMask = HalfEdgeMask.BRIDGE_EDGE;\n    context.runClassificationSweep(\n      operation,\n      (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\n        // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\n        if (face.countEdgesAroundFace() < 2)\n          return;\n        if (Math.abs(area) < areaTol)\n          return;\n        if (faceType === 1) {\n          const loopOrParityRegion = PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask);\n          if (loopOrParityRegion)\n            result.tryAddChild(loopOrParityRegion);\n        }\n      },\n    );\n    context.graph.dropMask(visitMask);\n    return this.simplifyRegion(result);\n  }\n  /**\n   * Return a polyface whose facets are a boolean operation between the input regions.\n   * * Each of the two inputs is an array of multiple loops or parity regions.\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\n   *    * A simple loop, e.g. array of Point3d.\n   *    * Several simple loops, each of which is an array of Point3d.\n   * @param inputA first set of loops\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\n   * @param inputB second set of loops\n   * @param triangulate whether to triangulate the result\n   */\n  public static polygonBooleanXYToPolyface(\n    inputA: MultiLineStringDataVariant[],\n    operation: RegionBinaryOpType,\n    inputB: MultiLineStringDataVariant[],\n    triangulate: boolean = false,\n  ): Polyface | undefined {\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\n      inputA, RegionGroupOpType.Union,\n      operation,\n      inputB, RegionGroupOpType.Union,\n      true,\n    );\n    return this.finishGraphToPolyface(graph, triangulate);\n  }\n  /**\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\n   * * Each of the two inputs is an array of multiple loops or parity regions.\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\n   *    * A simple loop, e.g. array of Point3d.\n   *    * Several simple loops, each of which is an array of Point3d.\n   * @param inputA first set of loops\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\n   * @param inputB second set of loops\n   */\n  public static polygonBooleanXYToLoops(\n    inputA: MultiLineStringDataVariant[],\n    operation: RegionBinaryOpType,\n    inputB: MultiLineStringDataVariant[],\n  ): AnyRegion | undefined {\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\n      inputA,\n      RegionGroupOpType.Union,\n      operation,\n      inputB,\n      RegionGroupOpType.Union,\n      true,\n    );\n    if (!graph)\n      return undefined;\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\n    const allLoops: Loop[] = [];\n    for (const graphLoop of loopEdges) {\n      const points = new GrowableXYZArray();\n      for (const edge of graphLoop)\n        points.pushXYZ(edge.x, edge.y, edge.z);\n      points.pushWrap(1);\n      const loop = Loop.create();\n      loop.tryAddChild(LineString3d.createCapture(points));\n      allLoops.push(loop);\n    }\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\n  }\n  /**\n   * Construct a wire that is offset from the given polyline or polygon.\n   * * This is a simple wire offset, not an area offset.\n   * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)\n   * the xy-plane.\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not\n   * guarantee a simple area offset.\n   * @param points a single loop or path\n   * @param wrap true to include wraparound\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions\n   * object.\n   */\n  public static constructPolygonWireXYOffset(\n    points: Point3d[], wrap: boolean, offsetDistanceOrOptions: number | JointOptions,\n  ): CurveChain | undefined {\n    const context = new PolygonWireOffsetContext();\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);\n  }\n  /**\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will\n   * not detect self intersection among widely separated edges.\n   * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/Offset\n   * @param curves base curves.\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\n   */\n  public static constructCurveXYOffset(\n    curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions,\n  ): CurveCollection | undefined {\n    const offsetOptions = OffsetOptions.create(offsetDistanceOrOptions);\n    return CurveOps.constructCurveXYOffset(curves, offsetOptions);\n  }\n  /**\n   * Test if point (x,y) is IN, OUT or ON a region.\n   * @return (1) for in, (-1) for OUT, (0) for ON\n   * @param curves input region\n   * @param x x coordinate of point to test\n   * @param y y coordinate of point to test\n   */\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\n  }\n  /**\n   * Create curve collection of subtype determined by gaps between the input curves.\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\n   * * If there are internal gaps, return a `BagOfCurves`\n   * * If input array has zero length, return undefined.\n   * @param curves input curves\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\n   */\n  public static createLoopPathOrBagOfCurves(\n    curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false,\n  ): CurveCollection | undefined {\n    const n = curves.length;\n    if (n === 0)\n      return undefined;\n    let maxGap = 0.0;\n    let isPath = false;\n    if (wrap)\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\n    for (let i = 0; i + 1 < n; i++)\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\n    let collection: Loop | Path | BagOfCurves;\n    if (Geometry.isSmallMetricDistance(maxGap)) {\n      collection = wrap ? Loop.create() : Path.create();\n      isPath = true;\n    } else {\n      collection = BagOfCurves.create();\n    }\n    for (const c of curves)\n      collection.tryAddChild(c);\n    if (isPath && consolidateAdjacentPrimitives)\n      RegionOps.consolidateAdjacentPrimitives(collection);\n    return collection;\n  }\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\n  /**\n   * Announce Checkpoint function for use during booleans\n   * @internal\n   */\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) {\n    this._graphCheckPointFunction = f;\n  }\n  /**\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\n   * * All cutting is \"as viewed in the xy plane\"\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\n   * @param cutterCurves input curves to intersect with `curvesToCut`\n   */\n  public static cloneCurvesWithXYSplits(\n    curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection,\n  ): AnyCurve | undefined {\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\n  }\n  /**\n   * Create paths assembled from many curves.\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by\n   * [[cloneCurvesWithXYSplits]].\n   * * Return simplest form -- single primitive, single path, or bag of curves.\n   */\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): AnyChain | undefined {\n    if (source === undefined)\n      return undefined;\n    if (source instanceof CurvePrimitive)\n      return source;\n    // source is a collection .  ..\n    const primitives = source.collectCurvePrimitives();\n    const chainCollector = new ChainCollectorContext(makeClones);\n    for (const primitive of primitives) {\n      chainCollector.announceCurvePrimitive(primitive);\n    }\n    return chainCollector.grabResult();\n  }\n  /**\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\n   * * For best offset results, the inputs should be parallel to the xy-plane.\n   * @param fragments fragments to be chained and offset\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\n   * @returns object with named chains, insideOffsets, outsideOffsets\n   */\n  public static collectInsideAndOutsideOffsets(\n    fragments: AnyCurve[], offsetDistance: number, gapTolerance: number,\n  ): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\n    return CurveOps.collectInsideAndOutsideXYOffsets(fragments, offsetDistance, gapTolerance);\n  }\n  /**\n   * Restructure curve fragments as Paths and Loops.\n   * @param fragments fragments to be chained\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\n   */\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): AnyChain | undefined {\n    return CurveOps.collectChains(fragments, gapTolerance);\n  }\n  /**\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments\n   * of `curvesToCut`.\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\n   */\n  public static splitPathsByRegionInOnOutXY(\n    curvesToCut: AnyCurve | undefined, region: AnyRegion,\n  ): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\n    if (splitPaths instanceof CurveCollection) {\n      for (const child of splitPaths.children) {\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\n        if (pointOnChild) {\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\n        }\n      }\n    } else if (splitPaths instanceof CurvePrimitive) {\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\n      if (pointOnChild) {\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\n      }\n    }\n    return result;\n  }\n  /**\n   * If `data` is one of several forms of a rectangle, return its edge Transform.\n   * * Points are considered a rectangle if, within the first 4 points:\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\n   *     * vectors from 0 to 3 and 1 to 2 are the same\n   * @param data points in one of several formats:\n   *   * LineString\n   *   * Loop containing rectangle content\n   *   * Path containing rectangle content\n   *   * Array of Point3d[]\n   *   * IndexedXYZCollection\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit\n   * normal in z column. If not a rectangle, return undefined.\n   */\n  public static rectangleEdgeTransform(\n    data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true,\n  ): Transform | undefined {\n    if (data instanceof LineString3d) {\n      return this.rectangleEdgeTransform(data.packedPoints);\n    } else if (data instanceof IndexedXYZCollection) {\n      let dataToUse;\n      if (requireClosurePoint && data.length === 5) {\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\n          return undefined;\n        dataToUse = data;\n      } else if (!requireClosurePoint && data.length === 4) {\n        dataToUse = data;\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\n        return undefined;\n      } else {\n        dataToUse = GrowableXYZArray.create(data);\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\n          return undefined;\n      }\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\n      const normalVector = vector01.crossProduct(vector03);\n      if (normalVector.normalizeInPlace()\n        && vector12.isAlmostEqual(vector03)\n        && vector01.isPerpendicularTo(vector03)) {\n        return Transform.createOriginAndMatrixColumns(\n          dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector,\n        );\n      }\n    } else if (Array.isArray(data)) {\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\n    } else if (data instanceof CurveChain) {\n      if (!data.checkForNonLinearPrimitives()) {\n        // const linestring = LineString3d.create();\n        const strokes = data.getPackedStrokes();\n        if (strokes) {\n          return this.rectangleEdgeTransform(strokes);\n        }\n      }\n    }\n    return undefined;\n  }\n  /**\n   * Look for and simplify:\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\n   *   * collect all points\n   *   * eliminate duplicated points\n   *   * eliminate points colinear with surrounding points\n   *   * contiguous concentric circular or elliptic arcs\n   *   * combine angular ranges\n   * * This function can be used to compress adjacent LineSegment3ds into a LineString3d\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\n   * @param options options for tolerance and selective simplification.\n   */\n  public static consolidateAdjacentPrimitives(curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions): void {\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\n    curves.dispatchToGeometryHandler(context);\n  }\n  /**\n   * Reverse and reorder loops in the xy-plane for consistent orientation and containment.\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored.\n   * * For best results, all overlaps should be containments, i.e., loop boundaries can touch, but should not cross.\n   * @returns a region that captures the input pointers. This region is a:\n   * * [[Loop]] if there is exactly one input loop. It is oriented counterclockwise.\n   * * [[ParityRegion]] if input consists of exactly one outer loop with at least one hole loop.\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented\n   * clockwise.\n   * * [[UnionRegion]] if any other input configuration. Its children are individually ordered/oriented as in\n   * the above cases.\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\n   */\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\n    const loopAndArea: SortablePolygon[] = [];\n    for (const candidate of loops) {\n      if (candidate instanceof Loop)\n        SortablePolygon.pushLoop(loopAndArea, candidate);\n      else if (candidate instanceof IndexedXYZCollection) {\n        const loop = Loop.createPolygon(candidate);\n        SortablePolygon.pushLoop(loopAndArea, loop);\n      }\n    }\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\n  }\n  /**\n   * Collect inputs that are nominally closed: regions, and physically closed curves.\n   * * Physically closed input curves are each returned wrapped in a Loop to facilitate xy-algorithms,\n   * but outside this limited context, these Loops only makes sense if they are planar.\n  */\n  private static collectRegionsAndClosedPrimitives(curves: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance): AnyRegion[] {\n    const regions: AnyRegion[] = [];\n    if (!Array.isArray(curves))\n      curves = [curves];\n    for (const curve of curves) {\n      if (curve instanceof Loop || curve instanceof ParityRegion || curve instanceof UnionRegion) {\n        regions.push(curve);\n      } else if (curve instanceof Path) {\n        if (curve.isPhysicallyClosedCurve(tolerance))\n          regions.push(Loop.create(...curve.children));\n      } else if (curve instanceof CurvePrimitive) {\n        if (curve.isPhysicallyClosedCurve(tolerance))\n          regions.push(Loop.create(curve));\n      }\n    }\n    return regions;\n  }\n  /**\n   * Find all xy-areas bounded by the unstructured, possibly intersecting curves.\n   * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.\n   * * \"Holes\" implied/bounded by inputs are _not_ preserved/discovered in output; in particular [[ParityRegion]]\n   * hole loops are treated like any other positive area loops.\n   * * A common use case of this method is to assemble the bounding negative-area \"exterior\" loop for each connected\n   * component of input curves. Passing `addBridges = true` decreases the number of connected components for nested\n   * input [[Loop]]s, and thus increases the likelihood of returning exactly one exterior loop. (This is why the\n   * default value for `addBridges` is `true`.)\n   * @param curvesAndRegions Any collection of curves. Each [[AnyRegion]] contributes its children _stripped of\n   * parity context_.\n   * @param tolerance optional distance tolerance for coincidence.\n   * @param addBridges whether to add line segments to connect nested input [[Loop]]s (default is `true`). When `false`,\n   * no line segments are added to the input curves, but the number of output components may be greater than expected.\n   * @returns array of [[SignedLoops]], each entry of which describes the areas bounded by a single connected component:\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have\n   * positive area and counterclockwise orientation.\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent\n   * to the edge and a constituent curve in each.\n   */\n  public static constructAllXYRegionLoops(\n    curvesAndRegions: AnyCurve | AnyCurve[],\n    tolerance: number = Geometry.smallMetricDistance,\n    addBridges: boolean = true,\n  ): SignedLoops[] {\n    let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\n    primitives = TransferWithSplitArcs.clone(BagOfCurves.create(...primitives)).children as CurvePrimitive[];\n    const range = this.curveArrayRange(primitives);\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\n    if (addBridges) { // generate a temp graph to extract its bridge edges\n      const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\n      const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);\n      context.addMembers(regions, undefined);\n      context.annotateAndMergeCurvesInGraph(tolerance);\n      context.graph.announceEdges((_graph, edge: HalfEdge) => {\n        if (edge.isMaskSet(HalfEdgeMask.BRIDGE_EDGE))\n          primitives.push(LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));\n        return true;\n      });\n    }\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\n  }\n  /**\n   * Collect all `CurvePrimitives` in loosely typed input.\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\n   * @param candidates input curves\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If\n   * false, push the [[CurveChainWithDistanceIndex]] instead.\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\n   * push the [[LineString3d]] instead.\n   */\n  public static collectCurvePrimitives(\n    candidates: AnyCurve | AnyCurve[],\n    collectorArray?: CurvePrimitive[],\n    smallestPossiblePrimitives: boolean = false,\n    explodeLinestrings: boolean = false,\n  ): CurvePrimitive[] {\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\n    if (candidates instanceof CurvePrimitive) {\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\n    } else if (candidates instanceof CurveCollection) {\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\n    } else if (Array.isArray(candidates)) {\n      for (const c of candidates) {\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\n      }\n    }\n    return results;\n  }\n  /**\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed\n   * instances of [[LineSegment3d]].\n   * @param candidates input curves\n   * @return copied (captured) inputs except for the linestrings, which are exploded\n   */\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\n    const result: CurvePrimitive[] = [];\n    for (const c of candidates) {\n      if (c instanceof LineString3d) {\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\n          const q = c.getIndexedSegment(i);\n          if (q !== undefined)\n            result.push(q);\n        }\n      } else {\n        result.push(c);\n      }\n    }\n    return result;\n  }\n  /**\n   * Return the overall range of given curves.\n   * @param data candidate curves\n   * @param worldToLocal transform to apply to data before computing its range\n   */\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\n    const range = Range3d.create();\n    if (data instanceof GeometryQuery)\n      data.extendRange(range, worldToLocal);\n    else if (Array.isArray(data)) {\n      for (const c of data) {\n        if (c instanceof GeometryQuery)\n          c.extendRange(range, worldToLocal);\n        else if (c instanceof Point3d)\n          range.extendPoint(c, worldToLocal);\n        else if (c instanceof GrowableXYZArray)\n          range.extendRange(c.getRange(worldToLocal));\n        else if (Array.isArray(c))\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\n      }\n    }\n    return range;\n  }\n  /**\n   * Triangulate a stroked Loop or ParityRegion and return the graph.\n   * @param polygons polygons obtained by stroking a Loop or ParityRegion, z-coordinates ignored.\n   * @returns triangulated graph\n   */\n  private static triangulateStrokedRegionComponent(polygons: MultiLineStringDataVariant): HalfEdgeGraph | undefined {\n    let graph: HalfEdgeGraph | undefined;\n    if (Array.isArray(polygons)) {\n      if (polygons.length === 0)\n        return undefined;\n      const firstEntry = polygons[0];\n      if (Point3d.isAnyImmediatePointType(firstEntry)) {\n        graph = Triangulator.createTriangulatedGraphFromSingleLoop(polygons as XYAndZ[] | XAndY[] | number[][]);\n      } else if (polygons.length > 1) {\n        let writablePolygons: IndexedReadWriteXYZCollection[];\n        if (firstEntry instanceof IndexedReadWriteXYZCollection) {\n          writablePolygons = polygons as IndexedReadWriteXYZCollection[];\n        } else {\n          writablePolygons = [];\n          for (const polygon of polygons as LineStringDataVariant[])\n            writablePolygons.push(GrowableXYZArray.create(polygon));\n        }\n        const sortedPolygons = PolygonOps.sortOuterAndHoleLoopsXY(writablePolygons);\n        if (sortedPolygons.length === 1) { // below requires exactly one outer loop!\n          if (graph = Triangulator.createTriangulatedGraphFromLoops(sortedPolygons[0]))\n            Triangulator.flipTriangles(graph);\n        }\n      } else {\n        graph = Triangulator.createTriangulatedGraphFromSingleLoop(firstEntry);\n      }\n    } else {\n      graph = Triangulator.createTriangulatedGraphFromSingleLoop(polygons);\n    }\n    if (!graph) {\n      // Last resort: try full merge. Conveniently, multiple polygons are processed with parity logic.\n      if (graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(polygons, [], (inA, _inB) => inA)) {\n        if (Triangulator.triangulateAllPositiveAreaFaces(graph))\n          Triangulator.flipTriangles(graph);\n      }\n    }\n    return graph;\n  }\n  /** Stroke a Loop or ParityRegion */\n  private static strokeRegionComponent(component: Loop | ParityRegion, options?: StrokeOptions): GrowableXYZArray[] {\n    const strokedComponent = component.cloneStroked(options);\n    // package the stroked region as polygons\n    const polygons: GrowableXYZArray[] = [];\n    if (strokedComponent instanceof Loop) {\n      if (strokedComponent.children.length > 0 && strokedComponent.children[0] instanceof LineString3d)\n        polygons.push(strokedComponent.children[0].packedPoints); // expect only 1\n    } else if (strokedComponent instanceof ParityRegion) {\n      for (const strokedLoop of strokedComponent.children) {\n        if (strokedLoop.children.length > 0 && strokedLoop.children[0] instanceof LineString3d)\n          polygons.push(strokedLoop.children[0].packedPoints); // expect only 1\n      }\n    }\n    return polygons;\n  }\n  /**\n   * Triangulate a Loop or ParityRegion and return the graph.\n   * @param component region, z-coordinates ignored\n   * @param options how to stroke loops\n   * @returns triangulated graph\n   */\n  private static triangulateRegionComponent(component: Loop | ParityRegion, options?: StrokeOptions): HalfEdgeGraph | undefined {\n    const polygons = this.strokeRegionComponent(component, options);\n    return this.triangulateStrokedRegionComponent(polygons);\n  }\n  /**\n   * Facet the region according to stroke options.\n   * @note For best results, [[UnionRegion]] input should consist of non-overlapping children. See [[regionBooleanXY]].\n   * @note For best results, [[ParityRegion]] input should be correctly oriented. See [[sortOuterAndHoleLoopsXY]].\n   * @param region a closed xy-planar region, possibly with holes.\n   * * The z-coordinates of the region are ignored. Caller is responsible for rotating the region into plane local coordinates beforehand, and reversing the rotation afterwards.\n   * @param options primarily how to stroke the region boundary, but also how to facet the region interior.\n   * * By default, a triangulation is returned, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.\n   * @returns facets for the region, or undefined if facetting failed\n   */\n  public static facetRegionXY(region: AnyRegion, options?: StrokeOptions): IndexedPolyface | undefined {\n    let graph: HalfEdgeGraph | undefined;\n    if (region instanceof UnionRegion) {\n      for (const child of region.children) {\n        const childGraph = RegionOps.triangulateRegionComponent(child, options);\n        if (childGraph) {\n          if (!graph) {\n            graph = childGraph;\n          } else {\n            // Graph concatenation without edge splits, clustering, and merge. We assume disjoint children so that at worst,\n            // components will have unshared adjacent exterior edges that remain after expandConvexFaces. Note that calling\n            // clusterAndMergeXYTheta here can create non-manifold topology!\n            graph.allHalfEdges.push(...childGraph.allHalfEdges);\n          }\n        }\n      }\n    } else {\n      graph = this.triangulateRegionComponent(region, options);\n    }\n    if (!graph)\n      return undefined;\n    if (options?.maximizeConvexFacets)\n      HalfEdgeGraphOps.expandConvexFaces(graph);\n    return PolyfaceBuilder.graphToPolyface(graph, options);\n  }\n  /**\n   * Decompose a polygon with optional holes into an array of convex polygons.\n   * @param polygon polygon and hole loops, e.g., as returned by [[CurveCollection.cloneStroked]] on a Loop or ParityRegion. All z-coordinates are ignored.\n   * @param maximize whether to return maximally convex polygons. If false, triangles are returned.\n   * @returns array of convex polygons, or undefined if triangulation failed\n  */\n  public static convexDecomposePolygonXY(polygon: MultiLineStringDataVariant, maximize: boolean = true): GrowableXYZArray[] | undefined {\n    const graph = RegionOps.triangulateStrokedRegionComponent(polygon);\n    if (!graph)\n      return undefined;\n    if (maximize)\n      HalfEdgeGraphOps.expandConvexFaces(graph);\n    const convexPolygons: GrowableXYZArray[] = [];\n    graph.announceFaceLoops((_graph, seed) => {\n      if (!seed.isMaskSet(HalfEdgeMask.EXTERIOR))\n        convexPolygons.push(GrowableXYZArray.create(seed.collectAroundFace((node) => { return node.getPoint3d(); })));\n      return true;\n    });\n    return convexPolygons;\n  }\n}\n/** @internal */\nfunction pushToInOnOutArrays(\n  curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[],\n): void {\n  if (select > 0)\n    arrayPositive.push(curve);\n  else if (select < 0)\n    arrayNegative.push(curve);\n  else\n    array0.push(curve);\n}\n\n/**\n * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.\n * @public\n */\nexport class ConsolidateAdjacentCurvePrimitivesOptions {\n  /** True to consolidate adjacent linear geometry into a single LineString3d. */\n  public consolidateLinearGeometry: boolean = true;\n  /** True to consolidate contiguous compatible arcs into a single Arc3d. */\n  public consolidateCompatibleArcs: boolean = true;\n  /** True to consolidate the first and last primitives of a [[Loop]], allowing the start/end point to change. */\n  public consolidateLoopSeam?: boolean = false;\n  /** Disable LineSegment3d and LineString3d point compression. */\n  public disableLinearCompression?: boolean = false;\n  /** Tolerance for detecting identical points. */\n  public duplicatePointTolerance: number = Geometry.smallMetricDistance;\n  /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */\n  public colinearPointTolerance: number = Geometry.smallMetricDistance;\n}\n"]}