@itwin/core-geometry 5.3.0-dev.5 → 5.3.0-dev.7

package/lib/esm/curve/RegionOpsClassificationSweeps.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAG5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,uEAAuE;IAChE,cAAc,CAAC,KAAe;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAC3E,mBAAmB,CAA8B;IACjD,YAAY,CAAY;IACxB,aAAa,CAAe;IACpC,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAqB,EACrB,IAAc,EACd,kBAAgC,EAChC,kBAAgC,EAChC,SAA6C;QAE7C,IAAI,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACpC,OAAO;QACT,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC;YACjC,OAAO;QACT,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,GAAG,CAAC;YACF,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACxC,0DAA0D;gBAC1D,mEAAmE;gBACnE,kDAAkD;gBAClD,6CAA6C;gBAC7C,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;gBAClC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;gBAC3C,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7C,SAAU,CAAC;wBACT,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BACxC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;4BAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;gCAC3C,OAAO;4BACT,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;4BAC7B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACzB,QAAQ,GAAG,IAAI,CAAC;4BAChB,SAAS,GAAG,IAAI,CAAC;wBACnB,CAAC;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;4BAC3B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCAC9B,MAAM;4BACR,CAAC;4BACD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;4BACnD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACtD,CAAC;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BAC3C,mBAAmB;4BACnB,OAAO;wBACT,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,8BAA8B;YAC9B,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;QACxC,CAAC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACnB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAEhF,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AAED;;;;;;GAMG;AACH,MAAM,OAAO,iBAAiB;IACrB,MAAM,CAAoE;IAC1E,UAAU,CAAS;IACnB,WAAW,CAAc;IAChC,YAAmB,MAAyE,EAAE,WAAwB;QACpH,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IACM,UAAU;QACf,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACf,OAAO,CAAsB;IAC7B,WAAW,CAAoB;IAC/B,MAAM,CAAuB;IAC5B,MAAM,CAAS;IACvB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oFAAoF;IAC7E,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;YACzD,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YACxD,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,WAAW,GAAG,qBAAqB,CAAC,KAAK,CAAC,WAAW,CAA0B,CAAC;YAChF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IAC5B,mBAAmB;IACZ,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAAwB;IACxC,QAAQ,CAAqB;IACpC,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,oCAAoC;IAChF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,UAA6B,EAAE,UAA6B;QAC/E,OAAO,IAAI,oBAAoB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IACM,UAAU,CAAC,KAA0C,EAAE,KAA0C;QACtG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IACO,YAAY,CAAiB;IAC7B,MAAM,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;IACrI;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAC/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QACF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,mBAAmB;YACnB,8CAA8C;YAC9C,8CAA8C;YAC9C,2CAA2C;YAC3C,kFAAkF;YAClF,2GAA2G;YAC3G,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,2BAA2B;QACjC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QAEvC,kGAAkG;QAClG,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG;gBACnC,OAAO,IAAI,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACrC,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;YACpD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,iHAAiH;QACjH,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAqB,EAAE,IAAc,EAAW,EAAE;YAC1E,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,OAAO,YAAY,mBAAmB,EAAE,CAAC;oBAChD,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;wBACvB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,YAAY,iBAAiB,EAAE,CAAC;4BAC3D,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC;gCACjE,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;oCAC5H,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;oCAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;oCAC3C,IAAI,CAAC,WAAW,EAAE,CAAC;gCACrB,CAAC;qCAAM,CAAC;oCACN,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gCAC7B,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,gGAAgG;QAChG,uGAAuG;QACvG,IAAI,mBAA2B,CAAC;QAChC,GAAG,CAAC;YACF,mBAAmB,GAAG,CAAC,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;oBAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;oBAC3C,IAAI,CAAC,WAAW,EAAE,CAAC;oBACnB,mBAAmB,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC,QAAQ,mBAAmB,GAAG,CAAC,EAAE;QAElC,kEAAkE;QAClE,MAAM,YAAY,GAAG,CAAC,EAAwB,EAAE,WAAoB,EAAE,QAAkB,EAAQ,EAAE;YAC9F,IAAI,EAAE,IAAI,EAAE,CAAC,OAAO,YAAY,mBAAmB,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,IAAI,QAAQ,EAAE,CAAC;gBAC1H,IAAI,EAAE,CAAC,QAAQ,GAAG,CAAC;oBACjB,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;;oBAEzD,EAAE,CAAC,OAAO,CAAC,oBAAoB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC,CAAC;QAEJ,uGAAuG;QACvG,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,eAAe,CAAC;YACxC,KAAK,gCAAgC;YACnC,OAAO,KAAK,OAAO;gBACnB,OAAO,CAAC,OAAO,YAAY,mBAAmB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;gBAChF,OAAO,CAAC,OAAO,YAAY,mBAAmB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;gBAChF,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,OAAO,CAAC,KAAK;gBAC/C,OAAO,CAAC,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,OAAO,CAAC,YAAY;gBAC5D,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,SAAU,CAAC,CAAC;oBACzG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,SAAU,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAC3G,CAAC;gBACD,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBACpD,IAAI,SAAS,EAAE,CAAC;oBACd,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACnG,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC1F,YAAY,CAAC,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;oBACjD,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACnG,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC1F,YAAY,CAAC,SAAS,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;IAC1C,CAAC;IACD;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,QAAQ,CAAC,mBAAmB;QACxF,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,wDAAwD;QACxD,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;oBAC3C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;QACnD,IAAI,CAAC,2BAA2B,EAAE,CAAC;IACrC,CAAC;IACO,qBAAqB,CAA0B;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAAC,QAA4B,EAAE,oBAA6C;QACvG,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAC5C,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,UAAU,EAAE,CAAC;YAClD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE,CAAC;gBACrB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBACtC,yBAAyB,CAAC,6BAA6B,CACrD,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CACnF,CAAC;YACJ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;IACD,kCAAkC;IAClC,qBAAqB;IACrB,0BAA0B;IAC1B,wCAAwC;IACxC,qBAAqB;IACd,qBAAqB,CAAC,IAAY;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBACnE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC;gBACxC,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;gBAC3B,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;YACxC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,uEAAuE;IAChE,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAEH;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAE5F,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IACtH,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE,CAAC;YAC1C,mCAAmC;QACrC,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;QAC/E,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;YACnF,WAAW,GAAG,OAAO,CAAC,CAAC;gBACrB,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;gBACtG,CAAC,CAAC,CAAC,CAAC;QACR,CAAC;IACH,CAAC;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,kHAAkH;AAClH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG,CAAC;QACF,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAClB,KAAK,CAAa;IAClB,SAAS,CAAW;IACpB,KAAK,CAAU;IACtB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACvB,UAAU,CAAmB;IAC7B,KAAK,CAAgB;IAC5B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAClB,KAAoB,EAAE,kBAA6D;QAEnF,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,cAAc,CAAC,cAAc,CAAC,CAAC;YACrD,SAAS,CAAC,aAAa,CAAC,kBAAkB,EAAE,0BAA0B,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","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 { Geometry } from \"../Geometry\";\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { TransferWithSplitArcs } from \"./internalContexts/TransferWithSplitArcs\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/**\n * base class for callbacks during region sweeps.\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\n *   * facePathStack[0] is the outermost node of the path from the outer face.\n *   * facePathStack[1] is its inside mate.\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\n *   * newFaceNode is the entry node (redundant of stack tip)\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\n *  * At end of component, `finishComponent (node)` is called.\n * * The base class is fully implemented to do nothing during the sweep.\n * @internal\n */\nabstract class RegionOpsFaceToFaceSearchCallbacks {\n  /** Announce a representative node on the outer face of a component. */\n  public startComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce return to outer face. */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce face entry. */\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce face exit. */\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\n    return true;\n  }\n}\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\n * @internal\n */\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\n/** Function signature ot announce classification of a face.\n * The `faceType` parameters are\n * * -1 for a fully exterior face.  This is a negative area face.\n * * 0 for a positive area face classified as \"out\" for the boolean.\n * * 1 for a positive area face classified as \"in\" for the boolean.\n */\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\n/**\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\n * * This assumes the each node in the graph has edgeTag set to:\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\n *     * for example, an edge added by regularization\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\n * * constructor\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\n *    * sets the in/out status of both terms to false.\n * * `startComponent` marks the entire outer face as `EXTERIOR`\n * * `enterFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\n *    * if out, set the `EXTERIOR` mask around the face.\n * * `leaveFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n * * `finishComponent` is not reimplemented.\n * @internal\n */\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\n  private _inComponent: boolean[];\n  private _exteriorMask: HalfEdgeMask;\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\n    super();\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\n    this._exteriorMask = exteriorMask;\n    this._faceSelectFunction = acceptFaceFunction;\n  }\n  /** Mark this face as exterior */\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\n  /**\n   * * If necessary, toggle a term state.\n   * * if indicated, mark this face exterior.\n   */\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\n      node.setMaskAroundFace(this._exteriorMask);\n    return true;\n  }\n  /**\n   * * If necessary, toggle a term state.\n   */\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    return true;\n  }\n}\n/**\n * Low level graph search for face classification.\n * @internal\n */\nexport class RegionOpsFaceToFaceSearch {\n  /**\n   * Run a DFS with face-to-face step announcements.\n   * * false return from any function terminates search immediately.\n   * * all reachable nodes assumed to have both visit masks clear.\n   * @param graph containing graph.\n   * @param seed first node to visit.\n   * @param faceHasBeenVisited mask marking faces that have been seen.\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\n   * @param callbacks callbacks.\n   */\n  public static faceToFaceSearchFromOuterLoop(\n    _graph: HalfEdgeGraph,\n    seed: HalfEdge,\n    faceHasBeenVisited: HalfEdgeMask,\n    nodeHasBeenVisited: HalfEdgeMask,\n    callbacks: RegionOpsFaceToFaceSearchCallbacks,\n  ): void {\n    if (seed.isMaskSet(faceHasBeenVisited))\n      return;\n    if (!callbacks.startComponent(seed))\n      return;\n    const facePathStack = [];\n    seed.setMaskAroundFace(faceHasBeenVisited);\n    let faceWalker = seed;\n    do {\n      let entryNode = faceWalker;\n      let mate = faceWalker.edgeMate;\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\n        // The faceWalker seed is always on the base of the stack.\n        // The stack then contains even-odd pairs of (entryNode, faceNode).\n        // entryNode is the node where a face was entered.\n        // faceNode is another node around that face.\n        facePathStack.push(faceWalker);\n        facePathStack.push(mate);\n        let faceNode = mate.faceSuccessor;\n        mate.setMaskAroundFace(faceHasBeenVisited);\n        entryNode = mate;\n        if (callbacks.enterFace(facePathStack, mate)) {\n          for (; ;) {\n            mate = faceNode.edgeMate;\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\n              mate.setMaskAroundFace(faceHasBeenVisited);\n              if (!callbacks.enterFace(facePathStack, mate))\n                return;\n              facePathStack.push(faceNode);\n              facePathStack.push(mate);\n              faceNode = mate;\n              entryNode = mate;\n            }\n            faceNode.setMask(nodeHasBeenVisited);\n            faceNode = faceNode.faceSuccessor;\n            if (faceNode === entryNode) {\n              callbacks.leaveFace(facePathStack, faceNode);\n              if (facePathStack.length <= 2) {\n                break;\n              }\n              facePathStack.pop();\n              faceNode = facePathStack[facePathStack.length - 1];\n              facePathStack.pop();\n              entryNode = facePathStack[facePathStack.length - 1];\n            }\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\n              // this is disaster\n              return;\n            }\n          }\n        }\n      }\n      // continue at outermost level\n      faceWalker = faceWalker.faceSuccessor;\n    } while (faceWalker !== seed);\n    callbacks.finishComponent(seed);\n  }\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * Each of the binary input terms is a collection of loops\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   */\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\n    if (graphCheckPoint)\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\n    if (seedA || seedB) {\n      // split edges where they cross . . .\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\n      // sort radially around vertices.\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\n      // add edges to connect various components  (e.g. holes!!!)\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\n      if (exteriorHalfEdge === undefined)\n        return undefined;\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const faceVisitedMask = graph.grabMask();\n      const nodeVisitedMask = graph.grabMask();\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\n      graph.clearMask(allMasksToClear);\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\n      graph.dropMask(faceVisitedMask);\n      graph.dropMask(nodeVisitedMask);\n      return graph;\n    }\n    return undefined;\n  }\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * the manyLoopsAndParitySets input is an array.\n   * * Each entry is one or more loops.\n   * * An entry that is \"just points\" is a simple loop.\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\n   *    * typically the first is an outer loop an others are holes.\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with index to the outer array.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   *   * assign inside/outside by parity within each set and overall union.\n   */\n  public static doBinaryBooleanBetweenMultiLoopInputs(\n    dataA: MultiLineStringDataVariant[],\n    opA: RegionGroupOpType,\n    binaryOp: RegionBinaryOpType,\n    dataB: MultiLineStringDataVariant[],\n    opB: RegionGroupOpType,\n    purgeSliverExteriorFaces: boolean,\n  ): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const callbacks = RegionBooleanContext.create(opA, opB);\n    callbacks.graph = graph;\n    callbacks.faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\n\n    // Add all the members in groupA ..\n    for (const data of dataA) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupA);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    for (const data of dataB) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupB);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    // split edges where they cross . . .\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n    // sort radially around vertices.\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n    // add edges to connect various components  (e.g. holes!!!)\n    const context = new RegularizationContext(graph);\n    context.regularizeGraph(true, true);\n    callbacks.runClassificationSweep(binaryOp);\n    if (purgeSliverExteriorFaces)\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\n    return graph;\n  }\n}\n\n/**\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\n * @internal\n */\nexport enum RegionGroupOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  NonBounding = -1,\n}\n\n/**\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\n * * the Loop or parityRegion object\n * * a numeric indication of the sweep state (parity) during the classification search.\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\n * @internal\n */\nexport class RegionGroupMember {\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\n  public sweepState: number;\n  public parentGroup: RegionGroup;\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\n    this.region = region;\n    this.parentGroup = parentGroup;\n    this.sweepState = 0;\n  }\n  public clearState() {\n    this.sweepState = 0;\n  }\n}\n\n/**\n * A `RegionGroup` is\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\n * * The `RegionGroupOpType` to be applied among those members.\n * * Pointer to the containing context\n * * The count of number of regions known to be \"in\" as the search progresses.\n * @internal\n */\nexport class RegionGroup {\n  public members: RegionGroupMember[];\n  public groupOpType: RegionGroupOpType;\n  public parent: RegionBooleanContext;\n  private _numIn: number;\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\n    this.members = [];\n    this.parent = parent;\n    this.groupOpType = groupOpType;\n    this._numIn = 0;\n  }\n  /** deep clear of state data -- group header plus all members */\n  public clearState() {\n    for (const member of this.members)\n      member.clearState();\n    this._numIn = 0;\n  }\n  public range(): Range3d {\n    const range = Range3d.createNull();\n    for (const m of this.members) {\n      if (m.region instanceof GeometryQuery)\n        m.region.extendRange(range);\n      else {\n        const range1 = Range3d.createFromVariantData(m.region);\n        range.extendRange(range1);\n      }\n    }\n    return range;\n  }\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type. */\n  public getInOut(): boolean {\n    // UNION is true if one or more members are IN\n    if (this.groupOpType === RegionGroupOpType.Union)\n      return this._numIn > 0;\n    // PARITY is true if an odd number of regions are IN\n    if (this.groupOpType === RegionGroupOpType.Parity)\n      return Geometry.isOdd(this._numIn);\n    // INTERSECTION is true if ALL the regions are IN\n    if (this.groupOpType === RegionGroupOpType.Intersection)\n      return this._numIn === this.members.length;\n    return false;\n  }\n  // push new members into the group.\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\n    if (data instanceof Loop || data instanceof ParityRegion) {\n      let cleanerData = data.clone() as (ParityRegion | Loop);\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\n      cleanerData = TransferWithSplitArcs.clone(cleanerData) as (ParityRegion | Loop);\n      this.members.push(new RegionGroupMember(cleanerData, this));\n    } else if (data instanceof UnionRegion) {\n      for (const child of data.children) {\n        this.addMember(child);\n      }\n    } else if (Array.isArray(data)) {\n      for (const item of data) {\n        this.addMember(item);\n      }\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\n      this.members.push(new RegionGroupMember(data, this));\n    }\n  }\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\n  public recordMemberStateChange(oldState: number, newState: number) {\n    const oldIn = Geometry.isOdd(oldState);\n    const newIn = Geometry.isOdd(newState);\n    if (!oldIn && newIn)\n      this._numIn++;\n    else if (oldIn && !newIn)\n      this._numIn--;\n  }\n}\n/**\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\n * are each a composite union, difference, or parity among multiple inputs, i.e.,\n *   * (operationA among Ai) OP (operationB among Bi)\n *   * where the Ai are one set of regions, being combined by operationA\n *   * and the Bi are the another set of regions, being combined by operationB.\n * * Each group of Ai and Bi is a `RegionGroup`.\n * * This is an extremely delicate structure.\n * * Members are public because of the unique variety of queries, but should only be used for queries.\n * * The graph and curves in the booleans are connected by an extended pointer chain:\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.\n *    * (CurveLocationDetail).curve points to a curve.\n *    * (Curve).parent points to RegionGroupMember.\n *    * (RegionGroupMember) points to RegionGroup.\n *    * (RegionGroup) points to RegionBooleanBinaryContext.\n * * So when a graph sweep crosses an edge\n *    * the chain leads to a parity count in the RegionGroupMember.\n *    * that can change the number of members active in the RegionGroup.\n *    * which can change the state of the context.\n * @internal\n */\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\n  public groupA!: RegionGroup;\n  public groupB!: RegionGroup;\n  /** bridge edges */\n  public extraGeometry!: RegionGroup;\n  public graph!: HalfEdgeGraph;\n  public faceAreaFunction!: NodeToNumberFunction;\n  public binaryOp: RegionBinaryOpType;\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\n    this.groupA = new RegionGroup(this, groupTypeA);\n    this.groupB = new RegionGroup(this, groupTypeB);\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\n    this.binaryOp = RegionBinaryOpType.Union; // revised in runClassificationSweep\n  }\n  /**\n   * Create a context with both A and B groups empty.\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\n   * @param groupTypeA\n   * @param groupTypeB\n   */\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\n  }\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\n    this.groupA.addMember(dataA);\n    this.groupB.addMember(dataB);\n    this.addConnectives();\n  }\n  private _workSegment?: LineSegment3d;\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\n  /**\n   * The sweep operations require access to all geometry by edge crossings and face walk.\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\n   * This method:\n   * * finds the total range\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\n   * * places those lines in the extraGeometry group\n   */\n  public addConnectives() {\n    const rangeA = this.groupA.range();\n    const rangeB = this.groupB.range();\n    const rangeAB = rangeA.union(rangeB);\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\n    let margin = 0.1;\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\n    if (this._workSegment)\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\n    const maxPoints: Point3d[] = [];\n    const findExtremePointsInLoop = (region: Loop) => {\n      const area = RegionOps.computeXYArea(region);\n      if (area === undefined || Math.abs(area) < areaTol)\n        return;   // avoid bridging trivial faces\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\n      if (this._workSegment)\n        maxPoints.push(this._workSegment.point1Ref);\n    };\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\n      for (const m of groupMembers) {\n        if (m.region instanceof Loop) {\n          findExtremePointsInLoop(m.region);\n        } else if (m.region instanceof ParityRegion) {\n          for (const loop of m.region.children)\n            findExtremePointsInLoop(loop);\n        }\n      }\n    }\n    const ray = Ray3d.createZero();\n    for (const p of maxPoints) {\n      // Make a line from\n      //    1) exactly the max point of the loops to\n      //    2) a point clearly outside the big range\n      // If p came from some inner loop this will\n      //    1) create a bridge from the inner loop through any containing loops (always)\n      //    2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\n      this.extraGeometry.addMember(bridgeLine, true);\n    }\n  }\n  /**\n   * Simplify the graph by removing bridge edges that do not serve to connect inner and outer loops, i.e.:\n   * * the bridge edge is dangling\n   * * the bridge edge is adjacent to multiple faces\n   * * the bridge edge is adjacent to a negative area face\n   * @returns the number of extraneous bridge edges removed from the graph.\n   */\n  private removeExtraneousBridgeEdges(): number {\n    const toHeal: HalfEdge[] = [];\n    const interiorBridges: HalfEdge[] = [];\n\n    // lambda test for boundary edge. Relies only on face loop orientation. Doesn't use HalfEdgeMasks!\n    const isExteriorEdge = (node: HalfEdge): boolean => {\n      if (this.faceAreaFunction(node) < 0.0)\n        return true;\n      if (!node.findAroundFace(node.edgeMate))\n        return this.faceAreaFunction(node.edgeMate) < 0.0;\n      return false;\n    };\n\n    // isolate dangling bridges, bridges separating different faces, and \"exterior\" bridges in the negative area face\n    this.graph.announceEdges((_graph: HalfEdgeGraph, node: HalfEdge): boolean => {\n      if (node.edgeTag !== undefined) {\n        if (node.edgeTag instanceof CurveLocationDetail) {\n          if (node.edgeTag.curve) {\n            if (node.edgeTag.curve.parent instanceof RegionGroupMember) {\n              if (node.edgeTag.curve.parent.parentGroup === this.extraGeometry) {\n                if (node.isDangling || node.edgeMate.isDangling || !node.findAroundFace(node.edgeMate) || this.faceAreaFunction(node) < 0.0) {\n                  toHeal.push(node.vertexSuccessor);\n                  toHeal.push(node.edgeMate.vertexSuccessor);\n                  node.isolateEdge();\n                } else {\n                  interiorBridges.push(node);\n                }\n              }\n            }\n          }\n        }\n      }\n      return true;\n    });\n\n    // At this point, all bridges that were exterior are isolated, but this may have caused formerly\n    // interior bridges to become exterior. Now we successively isolate exterior bridges until none remain.\n    let numIsolatedThisPass: number;\n    do {\n      numIsolatedThisPass = 0;\n      for (const node of interiorBridges) {\n        if (!node.isIsolatedEdge && isExteriorEdge(node)) {\n          toHeal.push(node.vertexSuccessor);\n          toHeal.push(node.edgeMate.vertexSuccessor);\n          node.isolateEdge();\n          numIsolatedThisPass++;\n        }\n      }\n    } while (numIsolatedThisPass > 0);\n\n    // lambda to extend the detail interval on a side of a healed edge\n    const mergeDetails = (he: HalfEdge | undefined, newFraction?: number, newPoint?: Point3d): void => {\n        if (he && he.edgeTag instanceof CurveLocationDetail && he.sortData !== undefined && newFraction !== undefined && newPoint) {\n          if (he.sortData > 0)\n            he.edgeTag.captureFraction1Point1(newFraction, newPoint);\n          else\n            he.edgeTag.captureFractionPoint(newFraction, newPoint);\n        }\n      };\n\n    // At this point all removable bridges are isolated. Clean up their original vertex loops, if possible.\n    for (const doomedA of toHeal) {\n      const doomedB = doomedA.vertexSuccessor;\n      if ( // are the geometries mergeable?\n        doomedA !== doomedB &&\n        doomedA.edgeTag instanceof CurveLocationDetail && doomedA.sortData !== undefined &&\n        doomedB.edgeTag instanceof CurveLocationDetail && doomedB.sortData !== undefined &&\n        doomedA.edgeTag.curve === doomedB.edgeTag.curve &&\n        doomedA.edgeTag.hasFraction1 && doomedB.edgeTag.hasFraction1 &&\n        doomedA.sortData * doomedB.sortData < 0 &&\n        ((doomedA.sortData > 0 && Geometry.isSmallRelative(doomedA.edgeTag.fraction - doomedB.edgeTag.fraction1!)) ||\n         (doomedA.sortData < 0 && Geometry.isSmallRelative(doomedA.edgeTag.fraction1! - doomedB.edgeTag.fraction)))\n      ) {\n        const survivorA = HalfEdge.healEdge(doomedA, false);\n        if (survivorA) {\n          const endFractionA = (doomedA.sortData > 0) ? doomedA.edgeTag.fraction1 : doomedA.edgeTag.fraction;\n          const endPointA = (doomedA.sortData > 0) ? doomedA.edgeTag.point1 : doomedA.edgeTag.point;\n          mergeDetails(survivorA, endFractionA, endPointA);\n          const endFractionB = (doomedB.sortData > 0) ? doomedB.edgeTag.fraction1 : doomedB.edgeTag.fraction;\n          const endPointB = (doomedB.sortData > 0) ? doomedB.edgeTag.point1 : doomedB.edgeTag.point;\n          mergeDetails(survivorA.edgeMate, endFractionB, endPointB);\n        }\n      }\n    }\n    return this.graph.deleteIsolatedEdges();\n  }\n  /**\n   * Markup and assembly steps for geometry in the RegionGroups.\n   * * Annotate connection from group to curves.\n   *    * groups with point data but no curves get no further annotation.\n   * * compute intersections.\n   * * assemble and merge the HalfEdgeGraph.\n   * @param mergeTolerance absolute distance tolerance for merging loops\n   */\n  public annotateAndMergeCurvesInGraph(mergeTolerance: number = Geometry.smallMetricDistance) {\n    const allPrimitives: CurvePrimitive[] = [];\n    // ASSUME loops have fine-grained types (no linestrings)\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\n      for (const member of group.members) {\n        let k = allPrimitives.length;\n        if (member.region instanceof GeometryQuery) {\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\n          for (; k < allPrimitives.length; k++)\n            allPrimitives[k].parent = member;\n        }\n      }\n    }\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);\n    this.graph = graph;\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\n    this.removeExtraneousBridgeEdges();\n  }\n  private _announceFaceFunction?: AnnounceClassifiedFace;\n  /**\n   * Sweep through the graph to assign in/out classifications to all faces.\n   * * the classification is announced in two ways:\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\n   *   * the announceFaceFunction is called once for each face.\n   * @param binaryOp\n   * @param announceFaceFunction\n   */\n  public runClassificationSweep(binaryOp: RegionBinaryOpType, announceFaceFunction?: AnnounceClassifiedFace): void {\n    this._announceFaceFunction = announceFaceFunction;\n    this.binaryOp = binaryOp;\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\n    for (const group of [this.groupA, this.groupB])\n      group.clearState();\n    const faceHasBeenVisitedMask = this.graph.grabMask();\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\n    const componentArray = GraphComponentArray.create(this.graph);\n    for (const component of componentArray.components) {\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\n      if (exteriorHalfEdge) {\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\n        this.graph.clearMask(allMasksToClear);\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(\n          this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this,\n        );\n      }\n    }\n    this.graph.dropMask(faceHasBeenVisitedMask);\n    this.graph.dropMask(nodeHasBeenVisitedMask);\n  }\n  // search the graph for faces with\n  // .. exactly 2 edges\n  // .. both with given mask\n  // .. at least one mate is not exterior.\n  // .. clear that mark\n  public unmaskMaskedNullFaces(mask: number) {\n    for (const nodeA of this.graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      if (nodeB.faceSuccessor === nodeA) {\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\n            nodeA.clearMask(mask);\n            nodeB.clearMask(mask);\n          }\n        }\n      }\n    }\n  }\n  private getInOut(): boolean {\n    if (this.binaryOp === RegionBinaryOpType.Union)\n      return this.groupA.getInOut() || this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\n      return this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\n      return this.groupA.getInOut() && !this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\n      return !this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Parity)\n      return this.groupA.getInOut() !== this.groupB.getInOut();\n    return false;\n  }\n  /**\n   * Record transition across an edge as entry or exit from a RegionGroup.\n   * * Work backward from the node to a RegionGroup.  This path can be:\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\n   *      * node points to CurveLocation Detail\n   *      * CurveLocationDetail points to curve\n   *      * curve points to RegionGroupMember\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\n   * @param node\n   * @param delta\n   */\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n        return member;  // no transition across a bridge edge\n      if (delta !== 0) {\n        const oldSweepState = member.sweepState;\n        member.sweepState += delta;\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\n      }\n      return member;\n    };\n\n    const data = node.edgeTag;\n    if (data instanceof RegionGroupMember)\n      return updateRegionGroupMemberState(data);\n\n    if (data instanceof CurveLocationDetail) {\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\n      const member = data.curve!.parent;\n      if (member instanceof RegionGroupMember)\n        return updateRegionGroupMemberState(member);\n    }\n    return undefined;\n  }\n  // obligations to act as sweep callback ...\n  /** Announce a representative node on the outer face of a component. */\n  public startComponent(outerFaceNode: HalfEdge): boolean {\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\n    return true;\n  }\n  /** Announce return to outer face. */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /**\n   * Announce entry to a graph face.\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\n   * * Crossing a bridge edge does not change the parity count.\n   */\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\n    const state = this.getInOut();\n    if (!state)\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\n    return true;\n  }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\n    return true;\n  }\n}\n/**\n * Return xy area between (part of) a curve and the x axis through a reference point.\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area.\n */\nfunction areaUnderPartialCurveXY(\n  detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY,\n): number {\n  // area between trapezoid and axis\n  let trapezoidArea;\n  if (detail && detail.point1) {\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\n  } else {\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\n  }\n  let areaToChord = 0.0;\n  if (detail && detail.curve && detail.hasFraction1) {\n    if (detail.curve instanceof LineSegment3d) {\n      // nothing to do for a line segment\n    } else if (detail.curve instanceof Arc3d) {\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\n    } else {\n      const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1!);\n      areaToChord = partial ?\n        RegionOps.computeXYArea(Loop.create(partial, LineSegment3d.create(detail.point1!, detail.point))) ?? 0\n        : 0;\n    }\n  }\n  return trapezoidArea + areaToChord;\n}\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves. */\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\n  let area = 0.0;\n  let edge = faceSeed;\n  do {\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\n  return area;\n}\n\n/**\n * Function to accumulate area under edges.\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\n/**\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport class GraphComponent {\n  public faces: HalfEdge[];\n  public faceAreas: number[];\n  public range: Range2d;\n  public constructor(faces: HalfEdge[]) {\n    this.faces = faces;\n    this.range = Range2d.createNull();\n    this.faceAreas = [];\n  }\n  /**\n   * Visit all vertices and edges in the component to build face area array and composite range.\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\n   */\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\n    const vertexFunction = (node: HalfEdge) => {\n      if (extendRangeForEdge)\n        extendRangeForEdge(node, this.range);\n      else\n        this.range.extendXY(node.x, node.y);\n      return 0;\n    };\n    this.range.setNull();\n    for (const f of this.faces) {\n      f.sumAroundFace(vertexFunction);\n    }\n    this.faceAreas.length = 0;\n    if (!faceAreaFunction)\n      faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\n    for (const f of this.faces) {\n      this.faceAreas.push(faceAreaFunction(f));\n    }\n  }\n}\n/**\n * Build and hold an array of component data for a HalfEdgeGraph.\n * @internal\n */\nexport class GraphComponentArray {\n  public components: GraphComponent[];\n  public graph: HalfEdgeGraph;\n  private constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.components = [];\n  }\n  public static create(\n    graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void,\n  ): GraphComponentArray {\n    const result = new GraphComponentArray(graph);\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    for (const componentFaces of componentArrays) {\n      const component = new GraphComponent(componentFaces);\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\n      result.components.push(component);\n    }\n    return result;\n  }\n}\n"]}
+{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAG5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,uEAAuE;IAChE,cAAc,CAAC,KAAe;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAC3E,mBAAmB,CAA8B;IACjD,YAAY,CAAY;IACxB,aAAa,CAAe;IACpC,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAqB,EACrB,IAAc,EACd,kBAAgC,EAChC,kBAAgC,EAChC,SAA6C;QAE7C,IAAI,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACpC,OAAO;QACT,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC;YACjC,OAAO;QACT,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,GAAG,CAAC;YACF,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACxC,0DAA0D;gBAC1D,mEAAmE;gBACnE,kDAAkD;gBAClD,6CAA6C;gBAC7C,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;gBAClC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;gBAC3C,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7C,SAAU,CAAC;wBACT,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BACxC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;4BAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;gCAC3C,OAAO;4BACT,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;4BAC7B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACzB,QAAQ,GAAG,IAAI,CAAC;4BAChB,SAAS,GAAG,IAAI,CAAC;wBACnB,CAAC;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;4BAC3B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCAC9B,MAAM;4BACR,CAAC;4BACD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;4BACnD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACtD,CAAC;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BAC3C,mBAAmB;4BACnB,OAAO;wBACT,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,8BAA8B;YAC9B,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;QACxC,CAAC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACnB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAEhF,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AAED;;;;;;GAMG;AACH,MAAM,OAAO,iBAAiB;IACrB,MAAM,CAAoE;IAC1E,UAAU,CAAS;IACnB,WAAW,CAAc;IAChC,YAAmB,MAAyE,EAAE,WAAwB;QACpH,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IACM,UAAU;QACf,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACf,OAAO,CAAsB;IAC7B,WAAW,CAAoB;IAC/B,MAAM,CAAuB;IAC5B,MAAM,CAAS;IACvB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oFAAoF;IAC7E,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;YACzD,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YACxD,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,WAAW,GAAG,qBAAqB,CAAC,KAAK,CAAC,WAAW,CAA0B,CAAC;YAChF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IAC5B,mBAAmB;IACZ,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAAwB;IACxC,QAAQ,CAAqB;IACpC,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,oCAAoC;IAChF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,UAA6B,EAAE,UAA6B;QAC/E,OAAO,IAAI,oBAAoB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IACM,UAAU,CAAC,KAA0C,EAAE,KAA0C;QACtG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IACO,YAAY,CAAiB;IAC7B,MAAM,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;IACrI;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAC/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QACF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,mBAAmB;YACnB,8CAA8C;YAC9C,8CAA8C;YAC9C,2CAA2C;YAC3C,kFAAkF;YAClF,2GAA2G;YAC3G,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,2BAA2B;QACjC,MAAM,MAAM,GAAe,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAe,EAAE,CAAC;QAEvC,kGAAkG;QAClG,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG;gBACnC,OAAO,IAAI,CAAC;YACd,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC;gBACrC,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;YACpD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,iHAAiH;QACjH,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,MAAqB,EAAE,IAAc,EAAW,EAAE;YAC1E,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,OAAO,YAAY,mBAAmB,EAAE,CAAC;oBAChD,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;wBACvB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,YAAY,iBAAiB,EAAE,CAAC;4BAC3D,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,KAAK,IAAI,CAAC,aAAa,EAAE,CAAC;gCACjE,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;oCAC5H,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;oCAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;oCAC3C,IAAI,CAAC,WAAW,EAAE,CAAC;gCACrB,CAAC;qCAAM,CAAC;oCACN,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gCAC7B,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,gGAAgG;QAChG,uGAAuG;QACvG,IAAI,mBAA2B,CAAC;QAChC,GAAG,CAAC;YACF,mBAAmB,GAAG,CAAC,CAAC;YACxB,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;oBACjD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;oBAClC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;oBAC3C,IAAI,CAAC,WAAW,EAAE,CAAC;oBACnB,mBAAmB,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC,QAAQ,mBAAmB,GAAG,CAAC,EAAE;QAElC,kEAAkE;QAClE,MAAM,YAAY,GAAG,CAAC,EAAwB,EAAE,WAAoB,EAAE,QAAkB,EAAQ,EAAE;YAC9F,IAAI,EAAE,IAAI,EAAE,CAAC,OAAO,YAAY,mBAAmB,IAAI,EAAE,CAAC,QAAQ,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,IAAI,QAAQ,EAAE,CAAC;gBAC1H,IAAI,EAAE,CAAC,QAAQ,GAAG,CAAC;oBACjB,EAAE,CAAC,OAAO,CAAC,sBAAsB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;;oBAEzD,EAAE,CAAC,OAAO,CAAC,oBAAoB,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YAC3D,CAAC;QACH,CAAC,CAAC;QAEJ,uGAAuG;QACvG,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,OAAO,CAAC,eAAe,CAAC;YACxC,KAAK,gCAAgC;YACnC,OAAO,KAAK,OAAO;gBACnB,OAAO,CAAC,OAAO,YAAY,mBAAmB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;gBAChF,OAAO,CAAC,OAAO,YAAY,mBAAmB,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS;gBAChF,OAAO,CAAC,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,OAAO,CAAC,KAAK;gBAC/C,OAAO,CAAC,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,OAAO,CAAC,YAAY;gBAC5D,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,SAAU,CAAC,CAAC;oBACzG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,OAAO,CAAC,SAAU,GAAG,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAC3G,CAAC;gBACD,MAAM,SAAS,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;gBACpD,IAAI,SAAS,EAAE,CAAC;oBACd,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACnG,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC1F,YAAY,CAAC,SAAS,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;oBACjD,MAAM,YAAY,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC;oBACnG,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC;oBAC1F,YAAY,CAAC,SAAS,CAAC,QAAQ,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;gBAC5D,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,mBAAmB,EAAE,CAAC;IAC1C,CAAC;IACD;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,QAAQ,CAAC,mBAAmB;QACxF,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,wDAAwD;QACxD,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;oBAC3C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;QACnD,IAAI,CAAC,2BAA2B,EAAE,CAAC;IACrC,CAAC;IACO,qBAAqB,CAA0B;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAAC,QAA4B,EAAE,oBAA6C;QACvG,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAC5C,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,UAAU,EAAE,CAAC;YAClD,MAAM,gBAAgB,GAAG,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACxG,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;YACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACtC,yBAAyB,CAAC,6BAA6B,CACrD,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CACnF,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;IACD,kCAAkC;IAClC,qBAAqB;IACrB,0BAA0B;IAC1B,wCAAwC;IACxC,qBAAqB;IACd,qBAAqB,CAAC,IAAY;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBACnE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC;gBACxC,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;gBAC3B,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;YACxC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,uEAAuE;IAChE,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAEH;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAE5F,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IACtH,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE,CAAC;YAC1C,mCAAmC;QACrC,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;QAC/E,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;YACnF,WAAW,GAAG,OAAO,CAAC,CAAC;gBACrB,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;gBACtG,CAAC,CAAC,CAAC,CAAC;QACR,CAAC;IACH,CAAC;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,kHAAkH;AAClH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG,CAAC;QACF,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAClB,KAAK,CAAa;IAClB,SAAS,CAAW;IACpB,KAAK,CAAU;IACtB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,gBAAgB,KAAK,0BAA0B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,YAAY,mBAAmB,CAAC;YACnI,gBAAgB,GAAG,SAAS,CAAC,CAAC,wEAAwE;QACxG,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAc,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe;QAClG,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACvB,UAAU,CAAmB;IAC7B,KAAK,CAAgB;IAC5B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAClB,KAAoB,EAAE,kBAA6D;QAEnF,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,cAAc,CAAC,cAAc,CAAC,CAAC;YACrD,SAAS,CAAC,aAAa,CAAC,kBAAkB,EAAE,0BAA0B,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","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 { Geometry } from \"../Geometry\";\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { TransferWithSplitArcs } from \"./internalContexts/TransferWithSplitArcs\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/**\n * base class for callbacks during region sweeps.\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\n *   * facePathStack[0] is the outermost node of the path from the outer face.\n *   * facePathStack[1] is its inside mate.\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\n *   * newFaceNode is the entry node (redundant of stack tip)\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\n *  * At end of component, `finishComponent (node)` is called.\n * * The base class is fully implemented to do nothing during the sweep.\n * @internal\n */\nabstract class RegionOpsFaceToFaceSearchCallbacks {\n  /** Announce a representative node on the outer face of a component. */\n  public startComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce return to outer face. */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce face entry. */\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce face exit. */\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\n    return true;\n  }\n}\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\n * @internal\n */\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\n/** Function signature ot announce classification of a face.\n * The `faceType` parameters are\n * * -1 for a fully exterior face.  This is a negative area face.\n * * 0 for a positive area face classified as \"out\" for the boolean.\n * * 1 for a positive area face classified as \"in\" for the boolean.\n */\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\n/**\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\n * * This assumes the each node in the graph has edgeTag set to:\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\n *     * for example, an edge added by regularization\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\n * * constructor\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\n *    * sets the in/out status of both terms to false.\n * * `startComponent` marks the entire outer face as `EXTERIOR`\n * * `enterFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\n *    * if out, set the `EXTERIOR` mask around the face.\n * * `leaveFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n * * `finishComponent` is not reimplemented.\n * @internal\n */\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\n  private _inComponent: boolean[];\n  private _exteriorMask: HalfEdgeMask;\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\n    super();\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\n    this._exteriorMask = exteriorMask;\n    this._faceSelectFunction = acceptFaceFunction;\n  }\n  /** Mark this face as exterior */\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\n  /**\n   * * If necessary, toggle a term state.\n   * * if indicated, mark this face exterior.\n   */\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\n      node.setMaskAroundFace(this._exteriorMask);\n    return true;\n  }\n  /**\n   * * If necessary, toggle a term state.\n   */\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    return true;\n  }\n}\n/**\n * Low level graph search for face classification.\n * @internal\n */\nexport class RegionOpsFaceToFaceSearch {\n  /**\n   * Run a DFS with face-to-face step announcements.\n   * * false return from any function terminates search immediately.\n   * * all reachable nodes assumed to have both visit masks clear.\n   * @param graph containing graph.\n   * @param seed first node to visit.\n   * @param faceHasBeenVisited mask marking faces that have been seen.\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\n   * @param callbacks callbacks.\n   */\n  public static faceToFaceSearchFromOuterLoop(\n    _graph: HalfEdgeGraph,\n    seed: HalfEdge,\n    faceHasBeenVisited: HalfEdgeMask,\n    nodeHasBeenVisited: HalfEdgeMask,\n    callbacks: RegionOpsFaceToFaceSearchCallbacks,\n  ): void {\n    if (seed.isMaskSet(faceHasBeenVisited))\n      return;\n    if (!callbacks.startComponent(seed))\n      return;\n    const facePathStack = [];\n    seed.setMaskAroundFace(faceHasBeenVisited);\n    let faceWalker = seed;\n    do {\n      let entryNode = faceWalker;\n      let mate = faceWalker.edgeMate;\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\n        // The faceWalker seed is always on the base of the stack.\n        // The stack then contains even-odd pairs of (entryNode, faceNode).\n        // entryNode is the node where a face was entered.\n        // faceNode is another node around that face.\n        facePathStack.push(faceWalker);\n        facePathStack.push(mate);\n        let faceNode = mate.faceSuccessor;\n        mate.setMaskAroundFace(faceHasBeenVisited);\n        entryNode = mate;\n        if (callbacks.enterFace(facePathStack, mate)) {\n          for (; ;) {\n            mate = faceNode.edgeMate;\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\n              mate.setMaskAroundFace(faceHasBeenVisited);\n              if (!callbacks.enterFace(facePathStack, mate))\n                return;\n              facePathStack.push(faceNode);\n              facePathStack.push(mate);\n              faceNode = mate;\n              entryNode = mate;\n            }\n            faceNode.setMask(nodeHasBeenVisited);\n            faceNode = faceNode.faceSuccessor;\n            if (faceNode === entryNode) {\n              callbacks.leaveFace(facePathStack, faceNode);\n              if (facePathStack.length <= 2) {\n                break;\n              }\n              facePathStack.pop();\n              faceNode = facePathStack[facePathStack.length - 1];\n              facePathStack.pop();\n              entryNode = facePathStack[facePathStack.length - 1];\n            }\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\n              // this is disaster\n              return;\n            }\n          }\n        }\n      }\n      // continue at outermost level\n      faceWalker = faceWalker.faceSuccessor;\n    } while (faceWalker !== seed);\n    callbacks.finishComponent(seed);\n  }\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * Each of the binary input terms is a collection of loops\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   */\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\n    if (graphCheckPoint)\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\n    if (seedA || seedB) {\n      // split edges where they cross . . .\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\n      // sort radially around vertices.\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\n      // add edges to connect various components  (e.g. holes!!!)\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\n      if (exteriorHalfEdge === undefined)\n        return undefined;\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const faceVisitedMask = graph.grabMask();\n      const nodeVisitedMask = graph.grabMask();\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\n      graph.clearMask(allMasksToClear);\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\n      graph.dropMask(faceVisitedMask);\n      graph.dropMask(nodeVisitedMask);\n      return graph;\n    }\n    return undefined;\n  }\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * the manyLoopsAndParitySets input is an array.\n   * * Each entry is one or more loops.\n   * * An entry that is \"just points\" is a simple loop.\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\n   *    * typically the first is an outer loop an others are holes.\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with index to the outer array.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   *   * assign inside/outside by parity within each set and overall union.\n   */\n  public static doBinaryBooleanBetweenMultiLoopInputs(\n    dataA: MultiLineStringDataVariant[],\n    opA: RegionGroupOpType,\n    binaryOp: RegionBinaryOpType,\n    dataB: MultiLineStringDataVariant[],\n    opB: RegionGroupOpType,\n    purgeSliverExteriorFaces: boolean,\n  ): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const callbacks = RegionBooleanContext.create(opA, opB);\n    callbacks.graph = graph;\n    callbacks.faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\n\n    // Add all the members in groupA ..\n    for (const data of dataA) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupA);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    for (const data of dataB) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupB);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    // split edges where they cross . . .\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n    // sort radially around vertices.\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n    // add edges to connect various components  (e.g. holes!!!)\n    const context = new RegularizationContext(graph);\n    context.regularizeGraph(true, true);\n    callbacks.runClassificationSweep(binaryOp);\n    if (purgeSliverExteriorFaces)\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\n    return graph;\n  }\n}\n\n/**\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\n * @internal\n */\nexport enum RegionGroupOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  NonBounding = -1,\n}\n\n/**\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\n * * the Loop or parityRegion object\n * * a numeric indication of the sweep state (parity) during the classification search.\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\n * @internal\n */\nexport class RegionGroupMember {\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\n  public sweepState: number;\n  public parentGroup: RegionGroup;\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\n    this.region = region;\n    this.parentGroup = parentGroup;\n    this.sweepState = 0;\n  }\n  public clearState() {\n    this.sweepState = 0;\n  }\n}\n\n/**\n * A `RegionGroup` is\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\n * * The `RegionGroupOpType` to be applied among those members.\n * * Pointer to the containing context\n * * The count of number of regions known to be \"in\" as the search progresses.\n * @internal\n */\nexport class RegionGroup {\n  public members: RegionGroupMember[];\n  public groupOpType: RegionGroupOpType;\n  public parent: RegionBooleanContext;\n  private _numIn: number;\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\n    this.members = [];\n    this.parent = parent;\n    this.groupOpType = groupOpType;\n    this._numIn = 0;\n  }\n  /** deep clear of state data -- group header plus all members */\n  public clearState() {\n    for (const member of this.members)\n      member.clearState();\n    this._numIn = 0;\n  }\n  public range(): Range3d {\n    const range = Range3d.createNull();\n    for (const m of this.members) {\n      if (m.region instanceof GeometryQuery)\n        m.region.extendRange(range);\n      else {\n        const range1 = Range3d.createFromVariantData(m.region);\n        range.extendRange(range1);\n      }\n    }\n    return range;\n  }\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type. */\n  public getInOut(): boolean {\n    // UNION is true if one or more members are IN\n    if (this.groupOpType === RegionGroupOpType.Union)\n      return this._numIn > 0;\n    // PARITY is true if an odd number of regions are IN\n    if (this.groupOpType === RegionGroupOpType.Parity)\n      return Geometry.isOdd(this._numIn);\n    // INTERSECTION is true if ALL the regions are IN\n    if (this.groupOpType === RegionGroupOpType.Intersection)\n      return this._numIn === this.members.length;\n    return false;\n  }\n  // push new members into the group.\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\n    if (data instanceof Loop || data instanceof ParityRegion) {\n      let cleanerData = data.clone() as (ParityRegion | Loop);\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\n      cleanerData = TransferWithSplitArcs.clone(cleanerData) as (ParityRegion | Loop);\n      this.members.push(new RegionGroupMember(cleanerData, this));\n    } else if (data instanceof UnionRegion) {\n      for (const child of data.children) {\n        this.addMember(child);\n      }\n    } else if (Array.isArray(data)) {\n      for (const item of data) {\n        this.addMember(item);\n      }\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\n      this.members.push(new RegionGroupMember(data, this));\n    }\n  }\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\n  public recordMemberStateChange(oldState: number, newState: number) {\n    const oldIn = Geometry.isOdd(oldState);\n    const newIn = Geometry.isOdd(newState);\n    if (!oldIn && newIn)\n      this._numIn++;\n    else if (oldIn && !newIn)\n      this._numIn--;\n  }\n}\n/**\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\n * are each a composite union, difference, or parity among multiple inputs, i.e.,\n *   * (operationA among Ai) OP (operationB among Bi)\n *   * where the Ai are one set of regions, being combined by operationA\n *   * and the Bi are the another set of regions, being combined by operationB.\n * * Each group of Ai and Bi is a `RegionGroup`.\n * * This is an extremely delicate structure.\n * * Members are public because of the unique variety of queries, but should only be used for queries.\n * * The graph and curves in the booleans are connected by an extended pointer chain:\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.\n *    * (CurveLocationDetail).curve points to a curve.\n *    * (Curve).parent points to RegionGroupMember.\n *    * (RegionGroupMember) points to RegionGroup.\n *    * (RegionGroup) points to RegionBooleanBinaryContext.\n * * So when a graph sweep crosses an edge\n *    * the chain leads to a parity count in the RegionGroupMember.\n *    * that can change the number of members active in the RegionGroup.\n *    * which can change the state of the context.\n * @internal\n */\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\n  public groupA!: RegionGroup;\n  public groupB!: RegionGroup;\n  /** bridge edges */\n  public extraGeometry!: RegionGroup;\n  public graph!: HalfEdgeGraph;\n  public faceAreaFunction!: NodeToNumberFunction;\n  public binaryOp: RegionBinaryOpType;\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\n    this.groupA = new RegionGroup(this, groupTypeA);\n    this.groupB = new RegionGroup(this, groupTypeB);\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\n    this.binaryOp = RegionBinaryOpType.Union; // revised in runClassificationSweep\n  }\n  /**\n   * Create a context with both A and B groups empty.\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\n   * @param groupTypeA\n   * @param groupTypeB\n   */\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\n  }\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\n    this.groupA.addMember(dataA);\n    this.groupB.addMember(dataB);\n    this.addConnectives();\n  }\n  private _workSegment?: LineSegment3d;\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\n  /**\n   * The sweep operations require access to all geometry by edge crossings and face walk.\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\n   * This method:\n   * * finds the total range\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\n   * * places those lines in the extraGeometry group\n   */\n  public addConnectives() {\n    const rangeA = this.groupA.range();\n    const rangeB = this.groupB.range();\n    const rangeAB = rangeA.union(rangeB);\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\n    let margin = 0.1;\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\n    if (this._workSegment)\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\n    const maxPoints: Point3d[] = [];\n    const findExtremePointsInLoop = (region: Loop) => {\n      const area = RegionOps.computeXYArea(region);\n      if (area === undefined || Math.abs(area) < areaTol)\n        return;   // avoid bridging trivial faces\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\n      if (this._workSegment)\n        maxPoints.push(this._workSegment.point1Ref);\n    };\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\n      for (const m of groupMembers) {\n        if (m.region instanceof Loop) {\n          findExtremePointsInLoop(m.region);\n        } else if (m.region instanceof ParityRegion) {\n          for (const loop of m.region.children)\n            findExtremePointsInLoop(loop);\n        }\n      }\n    }\n    const ray = Ray3d.createZero();\n    for (const p of maxPoints) {\n      // Make a line from\n      //    1) exactly the max point of the loops to\n      //    2) a point clearly outside the big range\n      // If p came from some inner loop this will\n      //    1) create a bridge from the inner loop through any containing loops (always)\n      //    2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\n      this.extraGeometry.addMember(bridgeLine, true);\n    }\n  }\n  /**\n   * Simplify the graph by removing bridge edges that do not serve to connect inner and outer loops, i.e.:\n   * * the bridge edge is dangling\n   * * the bridge edge is adjacent to multiple faces\n   * * the bridge edge is adjacent to a negative area face\n   * @returns the number of extraneous bridge edges removed from the graph.\n   */\n  private removeExtraneousBridgeEdges(): number {\n    const toHeal: HalfEdge[] = [];\n    const interiorBridges: HalfEdge[] = [];\n\n    // lambda test for boundary edge. Relies only on face loop orientation. Doesn't use HalfEdgeMasks!\n    const isExteriorEdge = (node: HalfEdge): boolean => {\n      if (this.faceAreaFunction(node) < 0.0)\n        return true;\n      if (!node.findAroundFace(node.edgeMate))\n        return this.faceAreaFunction(node.edgeMate) < 0.0;\n      return false;\n    };\n\n    // isolate dangling bridges, bridges separating different faces, and \"exterior\" bridges in the negative area face\n    this.graph.announceEdges((_graph: HalfEdgeGraph, node: HalfEdge): boolean => {\n      if (node.edgeTag !== undefined) {\n        if (node.edgeTag instanceof CurveLocationDetail) {\n          if (node.edgeTag.curve) {\n            if (node.edgeTag.curve.parent instanceof RegionGroupMember) {\n              if (node.edgeTag.curve.parent.parentGroup === this.extraGeometry) {\n                if (node.isDangling || node.edgeMate.isDangling || !node.findAroundFace(node.edgeMate) || this.faceAreaFunction(node) < 0.0) {\n                  toHeal.push(node.vertexSuccessor);\n                  toHeal.push(node.edgeMate.vertexSuccessor);\n                  node.isolateEdge();\n                } else {\n                  interiorBridges.push(node);\n                }\n              }\n            }\n          }\n        }\n      }\n      return true;\n    });\n\n    // At this point, all bridges that were exterior are isolated, but this may have caused formerly\n    // interior bridges to become exterior. Now we successively isolate exterior bridges until none remain.\n    let numIsolatedThisPass: number;\n    do {\n      numIsolatedThisPass = 0;\n      for (const node of interiorBridges) {\n        if (!node.isIsolatedEdge && isExteriorEdge(node)) {\n          toHeal.push(node.vertexSuccessor);\n          toHeal.push(node.edgeMate.vertexSuccessor);\n          node.isolateEdge();\n          numIsolatedThisPass++;\n        }\n      }\n    } while (numIsolatedThisPass > 0);\n\n    // lambda to extend the detail interval on a side of a healed edge\n    const mergeDetails = (he: HalfEdge | undefined, newFraction?: number, newPoint?: Point3d): void => {\n        if (he && he.edgeTag instanceof CurveLocationDetail && he.sortData !== undefined && newFraction !== undefined && newPoint) {\n          if (he.sortData > 0)\n            he.edgeTag.captureFraction1Point1(newFraction, newPoint);\n          else\n            he.edgeTag.captureFractionPoint(newFraction, newPoint);\n        }\n      };\n\n    // At this point all removable bridges are isolated. Clean up their original vertex loops, if possible.\n    for (const doomedA of toHeal) {\n      const doomedB = doomedA.vertexSuccessor;\n      if ( // are the geometries mergeable?\n        doomedA !== doomedB &&\n        doomedA.edgeTag instanceof CurveLocationDetail && doomedA.sortData !== undefined &&\n        doomedB.edgeTag instanceof CurveLocationDetail && doomedB.sortData !== undefined &&\n        doomedA.edgeTag.curve === doomedB.edgeTag.curve &&\n        doomedA.edgeTag.hasFraction1 && doomedB.edgeTag.hasFraction1 &&\n        doomedA.sortData * doomedB.sortData < 0 &&\n        ((doomedA.sortData > 0 && Geometry.isSmallRelative(doomedA.edgeTag.fraction - doomedB.edgeTag.fraction1!)) ||\n         (doomedA.sortData < 0 && Geometry.isSmallRelative(doomedA.edgeTag.fraction1! - doomedB.edgeTag.fraction)))\n      ) {\n        const survivorA = HalfEdge.healEdge(doomedA, false);\n        if (survivorA) {\n          const endFractionA = (doomedA.sortData > 0) ? doomedA.edgeTag.fraction1 : doomedA.edgeTag.fraction;\n          const endPointA = (doomedA.sortData > 0) ? doomedA.edgeTag.point1 : doomedA.edgeTag.point;\n          mergeDetails(survivorA, endFractionA, endPointA);\n          const endFractionB = (doomedB.sortData > 0) ? doomedB.edgeTag.fraction1 : doomedB.edgeTag.fraction;\n          const endPointB = (doomedB.sortData > 0) ? doomedB.edgeTag.point1 : doomedB.edgeTag.point;\n          mergeDetails(survivorA.edgeMate, endFractionB, endPointB);\n        }\n      }\n    }\n    return this.graph.deleteIsolatedEdges();\n  }\n  /**\n   * Markup and assembly steps for geometry in the RegionGroups.\n   * * Annotate connection from group to curves.\n   *    * groups with point data but no curves get no further annotation.\n   * * compute intersections.\n   * * assemble and merge the HalfEdgeGraph.\n   * @param mergeTolerance absolute distance tolerance for merging loops\n   */\n  public annotateAndMergeCurvesInGraph(mergeTolerance: number = Geometry.smallMetricDistance) {\n    const allPrimitives: CurvePrimitive[] = [];\n    // ASSUME loops have fine-grained types (no linestrings)\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\n      for (const member of group.members) {\n        let k = allPrimitives.length;\n        if (member.region instanceof GeometryQuery) {\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\n          for (; k < allPrimitives.length; k++)\n            allPrimitives[k].parent = member;\n        }\n      }\n    }\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);\n    this.graph = graph;\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\n    this.removeExtraneousBridgeEdges();\n  }\n  private _announceFaceFunction?: AnnounceClassifiedFace;\n  /**\n   * Sweep through the graph to assign in/out classifications to all faces.\n   * * the classification is announced in two ways:\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\n   *   * the announceFaceFunction is called once for each face.\n   * @param binaryOp\n   * @param announceFaceFunction\n   */\n  public runClassificationSweep(binaryOp: RegionBinaryOpType, announceFaceFunction?: AnnounceClassifiedFace): void {\n    this._announceFaceFunction = announceFaceFunction;\n    this.binaryOp = binaryOp;\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\n    for (const group of [this.groupA, this.groupB])\n      group.clearState();\n    const faceHasBeenVisitedMask = this.graph.grabMask();\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\n    const componentArray = GraphComponentArray.create(this.graph);\n    for (const component of componentArray.components) {\n      const exteriorHalfEdge = component.faces[component.faceAreas.indexOf(Math.min(...component.faceAreas))];\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\n      this.graph.clearMask(allMasksToClear);\n      RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(\n        this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this,\n      );\n    }\n    this.graph.dropMask(faceHasBeenVisitedMask);\n    this.graph.dropMask(nodeHasBeenVisitedMask);\n  }\n  // search the graph for faces with\n  // .. exactly 2 edges\n  // .. both with given mask\n  // .. at least one mate is not exterior.\n  // .. clear that mark\n  public unmaskMaskedNullFaces(mask: number) {\n    for (const nodeA of this.graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      if (nodeB.faceSuccessor === nodeA) {\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\n            nodeA.clearMask(mask);\n            nodeB.clearMask(mask);\n          }\n        }\n      }\n    }\n  }\n  private getInOut(): boolean {\n    if (this.binaryOp === RegionBinaryOpType.Union)\n      return this.groupA.getInOut() || this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\n      return this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\n      return this.groupA.getInOut() && !this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\n      return !this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Parity)\n      return this.groupA.getInOut() !== this.groupB.getInOut();\n    return false;\n  }\n  /**\n   * Record transition across an edge as entry or exit from a RegionGroup.\n   * * Work backward from the node to a RegionGroup.  This path can be:\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\n   *      * node points to CurveLocation Detail\n   *      * CurveLocationDetail points to curve\n   *      * curve points to RegionGroupMember\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\n   * @param node\n   * @param delta\n   */\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n        return member;  // no transition across a bridge edge\n      if (delta !== 0) {\n        const oldSweepState = member.sweepState;\n        member.sweepState += delta;\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\n      }\n      return member;\n    };\n\n    const data = node.edgeTag;\n    if (data instanceof RegionGroupMember)\n      return updateRegionGroupMemberState(data);\n\n    if (data instanceof CurveLocationDetail) {\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\n      const member = data.curve!.parent;\n      if (member instanceof RegionGroupMember)\n        return updateRegionGroupMemberState(member);\n    }\n    return undefined;\n  }\n  // obligations to act as sweep callback ...\n  /** Announce a representative node on the outer face of a component. */\n  public startComponent(outerFaceNode: HalfEdge): boolean {\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\n    return true;\n  }\n  /** Announce return to outer face. */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /**\n   * Announce entry to a graph face.\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\n   * * Crossing a bridge edge does not change the parity count.\n   */\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\n    const state = this.getInOut();\n    if (!state)\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\n    return true;\n  }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\n    return true;\n  }\n}\n/**\n * Return xy area between (part of) a curve and the x axis through a reference point.\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area.\n */\nfunction areaUnderPartialCurveXY(\n  detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY,\n): number {\n  // area between trapezoid and axis\n  let trapezoidArea;\n  if (detail && detail.point1) {\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\n  } else {\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\n  }\n  let areaToChord = 0.0;\n  if (detail && detail.curve && detail.hasFraction1) {\n    if (detail.curve instanceof LineSegment3d) {\n      // nothing to do for a line segment\n    } else if (detail.curve instanceof Arc3d) {\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\n    } else {\n      const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1!);\n      areaToChord = partial ?\n        RegionOps.computeXYArea(Loop.create(partial, LineSegment3d.create(detail.point1!, detail.point))) ?? 0\n        : 0;\n    }\n  }\n  return trapezoidArea + areaToChord;\n}\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves. */\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\n  let area = 0.0;\n  let edge = faceSeed;\n  do {\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\n  return area;\n}\n\n/**\n * Function to accumulate area under edges.\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\n/**\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport class GraphComponent {\n  public faces: HalfEdge[];\n  public faceAreas: number[];\n  public range: Range2d;\n  public constructor(faces: HalfEdge[]) {\n    this.faces = faces;\n    this.range = Range2d.createNull();\n    this.faceAreas = [];\n  }\n  /**\n   * Visit all vertices and edges in the component to build face area array and composite range.\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\n   */\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\n    const vertexFunction = (node: HalfEdge) => {\n      if (extendRangeForEdge)\n        extendRangeForEdge(node, this.range);\n      else\n        this.range.extendXY(node.x, node.y);\n      return 0;\n    };\n    this.range.setNull();\n    for (const f of this.faces) {\n      f.sumAroundFace(vertexFunction);\n    }\n    this.faceAreas.length = 0;\n    if (faceAreaFunction === faceAreaFromCurvedEdgeData && !this.faces.every((he: HalfEdge) => he.edgeTag instanceof CurveLocationDetail))\n      faceAreaFunction = undefined; // prerequisite CurveLocationDetails are absent, fall through to default\n    if (!faceAreaFunction)\n      faceAreaFunction = (node: HalfEdge) => HalfEdgeGraphSearch.signedFaceArea(node); // polygon area\n    for (const f of this.faces) {\n      this.faceAreas.push(faceAreaFunction(f));\n    }\n  }\n}\n/**\n * Build and hold an array of component data for a HalfEdgeGraph.\n * @internal\n */\nexport class GraphComponentArray {\n  public components: GraphComponent[];\n  public graph: HalfEdgeGraph;\n  private constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.components = [];\n  }\n  public static create(\n    graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void,\n  ): GraphComponentArray {\n    const result = new GraphComponentArray(graph);\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    for (const componentFaces of componentArrays) {\n      const component = new GraphComponent(componentFaces);\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\n      result.components.push(component);\n    }\n    return result;\n  }\n}\n"]}

package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts

@@ -108,6 +108,7 @@ export declare class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandle
      * 5- Convert intersection angles to fractions and record intersections.
      */
     private dispatchArcArc;
+    /** Compute the intersection of an arc and a B-spline curve. */
     private dispatchArcBsplineCurve3d;
     /** Apply the transformation to bezier curves. Optionally construct ranges. */
     private transformBeziers;

package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurveIntersectXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveIntersectXY.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAMrD,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAE7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAM/C;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,8BAA8B;IACvE,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,wBAAwB,CAAuB;IACvD,OAAO,CAAC,mBAAmB,CAAwB;IACnD,OAAO,CAAC,0BAA0B,CAA0B;IAC5D,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,UAAU,CAAC,CAAU;IAC7B,OAAO,CAAC,MAAM,CAAC,CAAU;IACzB;;;;;;;OAOG;gBAED,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,QAAQ,GAAG,SAAS,EAC/B,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC;IAkBlD,wGAAwG;IACjG,aAAa,CAAC,SAAS,EAAE,QAAQ,GAAG,IAAI;IAG/C,iFAAiF;IACjF,OAAO,CAAC,cAAc;IAQtB,yFAAyF;IACzF,OAAO,CAAC,oBAAoB;IAc5B;;;OAGG;IACI,iBAAiB,CAAC,YAAY,GAAE,OAAe,GAAG,uBAAuB,EAAE;IAMlF;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,6BAA6B;IA4DrC;;;;;;OAMG;IACI,WAAW,CAChB,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACxG,IAAI;IASP,0GAA0G;IAC1G,OAAO,CAAC,uBAAuB;IAsC/B;;;OAGG;IACH,OAAO,CAAC,wBAAwB;IAyChC,OAAO,CAAC,sBAAsB;IA4C9B,OAAO,CAAC,kBAAkB;IA6F1B;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IAkC/B;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAwCtB,OAAO,CAAC,yBAAyB;IA0EjC,8EAA8E;IAC9E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,+BAA+B;IA6FvC,OAAO,CAAC,oCAAoC;IAgC5C;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,2BAA2B;IAmCnC,0EAA0E;IACnE,8BAA8B,CACnC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAC9E,GAAG;IAoBN,8DAA8D;IACvD,wBAAwB,CAC7B,GAAG,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACxD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAwBN,0DAA0D;IACnD,oBAAoB,CACzB,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACjD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAqBN,iEAAiE;IACjE,OAAO,CAAC,2BAA2B;IAiCnC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAyB/B;;;OAGG;IACH,OAAO,CAAC,mCAAmC;IAe3C;;;OAGG;IACa,cAAc,CAAC,CAAC,EAAE,aAAa,GAAG,GAAG;IAqBrD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IA6BjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAuB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAuB7C,gEAAgE;IAChD,oBAAoB,CAAC,KAAK,EAAE,cAAc,GAAG,GAAG;IAsBhE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAK1F,4EAA4E;IAC5D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAgBpE"}
+{"version":3,"file":"CurveCurveIntersectXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveIntersectXY.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAMrD,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAE7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAM/C;;;;;GAKG;AACH,qBAAa,qBAAsB,SAAQ,8BAA8B;IACvE,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,SAAS,CAAU;IAC3B,OAAO,CAAC,QAAQ,CAA4B;IAC5C,OAAO,CAAC,wBAAwB,CAAuB;IACvD,OAAO,CAAC,mBAAmB,CAAwB;IACnD,OAAO,CAAC,0BAA0B,CAA0B;IAC5D,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,MAAM,CAAC,YAAY,CAAoB;IAC/C,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,UAAU,CAAC,CAAU;IAC7B,OAAO,CAAC,MAAM,CAAC,CAAU;IACzB;;;;;;;OAOG;gBAED,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,OAAO,EAAE,OAAO,EAChB,SAAS,EAAE,QAAQ,GAAG,SAAS,EAC/B,OAAO,EAAE,OAAO,EAChB,SAAS,GAAE,MAAqC;IAkBlD,wGAAwG;IACjG,aAAa,CAAC,SAAS,EAAE,QAAQ,GAAG,IAAI;IAG/C,iFAAiF;IACjF,OAAO,CAAC,cAAc;IAQtB,yFAAyF;IACzF,OAAO,CAAC,oBAAoB;IAc5B;;;OAGG;IACI,iBAAiB,CAAC,YAAY,GAAE,OAAe,GAAG,uBAAuB,EAAE;IAMlF;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,6BAA6B;IA4DrC;;;;;;OAMG;IACI,WAAW,CAChB,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACxG,IAAI;IASP,0GAA0G;IAC1G,OAAO,CAAC,uBAAuB;IAsC/B;;;OAGG;IACH,OAAO,CAAC,wBAAwB;IAyChC,OAAO,CAAC,sBAAsB;IA4C9B,OAAO,CAAC,kBAAkB;IAuG1B;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IA4C/B;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAkCtB,+DAA+D;IAC/D,OAAO,CAAC,yBAAyB;IAsEjC,8EAA8E;IAC9E,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,SAAS;IAQjB,OAAO,CAAC,+BAA+B;IA6FvC,OAAO,CAAC,oCAAoC;IAgC5C;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,2BAA2B;IAmCnC,0EAA0E;IACnE,8BAA8B,CACnC,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAC9E,GAAG;IAoBN,8DAA8D;IACvD,wBAAwB,CAC7B,GAAG,EAAE,aAAa,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACxD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAwBN,0DAA0D;IACnD,oBAAoB,CACzB,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACjD,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EACvD,QAAQ,EAAE,OAAO,GAChB,GAAG;IAqBN,iEAAiE;IACjE,OAAO,CAAC,2BAA2B;IAiCnC,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IAyB/B;;;OAGG;IACH,OAAO,CAAC,mCAAmC;IAe3C;;;OAGG;IACa,cAAc,CAAC,CAAC,EAAE,aAAa,GAAG,GAAG;IAqBrD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IA6BjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAuB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAuB7C,gEAAgE;IAChD,oBAAoB,CAAC,KAAK,EAAE,cAAc,GAAG,GAAG;IAsBhE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAK1F,4EAA4E;IAC5D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAgBpE"}

package/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js

@@ -262,7 +262,9 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
     // The fraction and extend parameters allow all combinations to be passed in.
     dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
-        let dist2;
+        const cosines = new GrowableFloat64Array(2);
+        const sines = new GrowableFloat64Array(2);
+        const radians = new GrowableFloat64Array(2);
         // Arc: X = C + cU + sV
         // Line:  contains points A0,A1
         // Arc point colinear with line if det (A0, A1, X) = 0
@@ -282,27 +284,30 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
             const alpha = Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.center);
             const beta = Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector0);
             const gamma = Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector90);
-            const cosines = new GrowableFloat64Array(2);
-            const sines = new GrowableFloat64Array(2);
-            const radians = new GrowableFloat64Array(2);
-            const numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
-            if (numRoots <= 0)
-                return;
+            let numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
+            const closeApproach = (0 === numRoots);
+            if (closeApproach)
+                numRoots = 1; // we returned the arc's closest approach as the first "root"; if within tolerance and at endpoints, we record it
+            const acceptSolution = (iRoot, checkOnlyEndPointDistance = false) => {
+                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(iRoot), data.vector90, sines.atUncheckedIndex(iRoot));
+                let fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(iRoot), extendB0);
+                let fLine = SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPoint);
+                if (fLine === undefined)
+                    return undefined;
+                if (!checkOnlyEndPointDistance && this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1))
+                    return { fLine, fArc };
+                // check for an endpoint intersection that is beyond parametric tolerance but within point tolerance
+                fLine = fLine < 0.5 ? 0 : 1;
+                fArc = data.sweep.fractionToSignedPeriodicFraction(fArc) < 0.5 ? 0 : 1;
+                const pointAH = fLine ? pointA1H : pointA0H;
+                const pointBH = fArc ? pointB1H : pointB0H;
+                const dist2 = pointAH.realDistanceSquaredXY(pointBH);
+                return (dist2 !== undefined && Geometry.isDistanceWithinTol(dist2, tol2)) ? { fLine, fArc } : undefined;
+            };
             for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                let arcFraction = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const lineFraction = SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPoint);
-                if (lineFraction !== undefined) {
-                    if (this.acceptFraction(extendA0, lineFraction, extendA1) && this.acceptFraction(extendB0, arcFraction, extendB1)) {
-                        this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
-                    }
-                    else { // check for endpoint intersections beyond parametric tolerance but within point tolerance
-                        const pointAH = lineFraction < 0.5 ? pointA0H : pointA1H;
-                        const pointBH = (arcFraction = data.sweep.fractionToSignedPeriodicFraction(arcFraction)) < 0.5 ? pointB0H : pointB1H;
-                        if ((dist2 = pointAH.realDistanceSquaredXY(pointBH)) !== undefined && Geometry.isDistanceWithinTol(dist2, tol2))
-                            this.recordPointWithLocalFractions(lineFraction < 0.5 ? 0 : 1, cpA, fractionA0, fractionA1, arcFraction < 0.5 ? 0 : 1, arc, 0, 1, reversed);
-                    }
-                }
+                const result = acceptSolution(i, closeApproach);
+                if (result)
+                    this.recordPointWithLocalFractions(result.fLine, cpA, fractionA0, fractionA1, result.fArc, arc, 0, 1, reversed);
             }
         }
         else {
@@ -320,27 +325,30 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
             const alpha = Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1);
             const beta = Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0);
             const gamma = Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0);
-            const cosines = new GrowableFloat64Array(2);
-            const sines = new GrowableFloat64Array(2);
-            const radians = new GrowableFloat64Array(2);
-            const numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
-            if (numRoots <= 0)
-                return;
+            let numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
+            const closeApproach = (0 === numRoots);
+            if (closeApproach)
+                numRoots = 1; // we returned the arc's closest approach as the first "root"; if within tolerance and at endpoints, we record it
+            const acceptSolution = (iRoot, checkOnlyEndPointDistance = false) => {
+                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(iRoot), data.vector90, sines.atUncheckedIndex(iRoot));
+                let fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(iRoot), extendB0);
+                let fLine = SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
+                if (fLine === undefined)
+                    return undefined;
+                if (!checkOnlyEndPointDistance && this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1))
+                    return { fLine, fArc };
+                // check for an endpoint intersection that is beyond parametric tolerance but within point tolerance
+                fLine = fLine < 0.5 ? 0 : 1;
+                fArc = data.sweep.fractionToSignedPeriodicFraction(fArc) < 0.5 ? 0 : 1;
+                const pointALocal = fLine ? pointA1Local : pointA0Local;
+                const pointBLocal = fArc ? pointB1Local : pointB0Local;
+                const dist2 = pointALocal.distanceSquaredXY(pointBLocal);
+                return Geometry.isDistanceWithinTol(dist2, tol2) ? { fLine, fArc } : undefined;
+            };
             for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                let arcFraction = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const lineFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
-                if (lineFraction !== undefined) {
-                    if (this.acceptFraction(extendA0, lineFraction, extendA1) && this.acceptFraction(extendB0, arcFraction, extendB1)) {
-                        this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
-                    }
-                    else { // check for endpoint intersections beyond parametric tolerance but within point tolerance
-                        const pointALocal = lineFraction < 0.5 ? pointA0Local : pointA1Local;
-                        const pointBLocal = (arcFraction = data.sweep.fractionToSignedPeriodicFraction(arcFraction)) < 0.5 ? pointB0Local : pointB1Local;
-                        if ((dist2 = pointALocal.distanceSquaredXY(pointBLocal)) !== undefined && Geometry.isDistanceWithinTol(dist2, tol2))
-                            this.recordPointWithLocalFractions(lineFraction < 0.5 ? 0 : 1, cpA, fractionA0, fractionA1, arcFraction < 0.5 ? 0 : 1, arc, 0, 1, reversed);
-                    }
-                }
+                const result = acceptSolution(i, closeApproach);
+                if (result)
+                    this.recordPointWithLocalFractions(result.fLine, cpA, fractionA0, fractionA1, result.fArc, arc, 0, 1, reversed);
             }
         }
     }
@@ -363,12 +371,23 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
             localB.coffs[0], localB.coffs[3], localB.coffs[6], // vector0 xyw
             localB.coffs[1], localB.coffs[4], localB.coffs[7], // vector90 xyw
             ellipseRadians, circleRadians);
+            const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
             // the intersections are transform-invariant, so the solution angles apply directly to the input arcs
             for (let i = 0; i < ellipseRadians.length; i++) {
-                const fractionA = cpA.sweep.radiansToSignedFraction(circleRadians[i], extendA0);
-                const fractionB = cpB.sweep.radiansToSignedFraction(ellipseRadians[i], extendB0);
-                if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(extendB0, fractionB, extendB1))
+                let fractionA = cpA.sweep.radiansToSignedFraction(circleRadians[i], extendA0);
+                let fractionB = cpB.sweep.radiansToSignedFraction(ellipseRadians[i], extendB0);
+                if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(extendB0, fractionB, extendB1)) {
                     this.recordPointWithLocalFractions(fractionA, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
+                }
+                else { // check for endpoint intersection beyond angular tolerance but within point tolerance
+                    fractionA = cpA.sweep.fractionToSignedPeriodicFraction(fractionA) < 0.5 ? 0 : 1;
+                    fractionB = cpB.sweep.fractionToSignedPeriodicFraction(fractionB) < 0.5 ? 0 : 1;
+                    const endPointA = cpA.fractionToPoint(fractionA, CurveCurveIntersectXY._workPointAA0);
+                    const endPointB = cpB.fractionToPoint(fractionB, CurveCurveIntersectXY._workPointBB0);
+                    const dist2 = endPointA.distanceSquaredXY(endPointB);
+                    if (Geometry.isDistanceWithinTol(dist2, tol2))
+                        this.recordPointWithLocalFractions(fractionA, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
+                }
             }
         }
     }
@@ -381,6 +400,15 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
      * 5- Convert intersection angles to fractions and record intersections.
      */
     dispatchArcArc(cpA, extendA0, extendA1, cpB, extendB0, extendB1, reversed) {
+        // overlap handling. perspective is not handled.
+        if (this._coincidentGeometryContext && !this._worldToLocalPerspective && !this._worldToLocalAffine) {
+            const pairs = this._coincidentGeometryContext.coincidentArcIntersectionXY(cpA, cpB, true);
+            if (pairs) {
+                this.recordPairs(cpA, cpB, pairs, reversed);
+                return;
+            }
+        }
+        // look for isolated intersections
         let matrixA;
         let matrixB;
         if (this._worldToLocalPerspective) {
@@ -397,27 +425,13 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
         }
         const conditionA = matrixA.conditionNumber();
         const conditionB = matrixB.conditionNumber();
-        // pick the arc that is closest to circular.
+        // order the arcs so that the first one we pass in is closer to circular
         if (conditionA > conditionB)
             this.dispatchArcArcThisOrder(cpA, matrixA, extendA0, extendA1, cpB, matrixB, extendB0, extendB1, reversed);
         else
             this.dispatchArcArcThisOrder(cpB, matrixB, extendB0, extendB1, cpA, matrixA, extendA0, extendA1, !reversed);
-        // overlap handling. perspective is not handled.
-        if (!this._coincidentGeometryContext) {
-            // do nothing
-        }
-        else if (this._worldToLocalPerspective) {
-            // do nothing
-        }
-        else if (this._worldToLocalAffine) {
-            // do nothing
-        }
-        else {
-            const pairs = this._coincidentGeometryContext.coincidentArcIntersectionXY(cpA, cpB, true);
-            if (pairs !== undefined)
-                this.recordPairs(cpA, cpB, pairs, reversed);
-        }
     }
+    /** Compute the intersection of an arc and a B-spline curve. */
     dispatchArcBsplineCurve3d(cpA, extendA0, extendA1, cpB, extendB0, extendB1, reversed) {
         // Arc: X = C + cU + sV
         // implicitize the arc as viewed.  This "3d" matrix is homogeneous "XYW" not "xyz"
@@ -432,8 +446,6 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
         }
         // The worldToLocal has moved the arc vectors into local space.
         // matrixA captures the xyw parts (ignoring z)
-        // for any point in world space,
-        // THIS CODE ONLY WORKS FOR
         const matrixAInverse = matrixA.inverse();
         if (matrixAInverse) {
             const orderF = cpB.order; // order of the beziers for simple coordinates
@@ -452,36 +464,34 @@ export class CurveCurveIntersectXY extends RecurseToCurvesGeometryHandler {
             const awy = matrixAInverse.at(2, 1);
             const awz = 0.0;
             const aww = matrixAInverse.at(2, 2);
-            if (matrixAInverse) {
-                let bezier;
-                for (let spanIndex = 0;; spanIndex++) {
-                    bezier = cpB.getSaturatedBezierSpan3dH(spanIndex, bezier);
-                    if (!bezier)
-                        break;
-                    if (this._worldToLocalPerspective)
-                        bezier.tryMultiplyMatrix4dInPlace(this._worldToLocalPerspective);
-                    else if (this._worldToLocalAffine)
-                        bezier.tryTransformInPlace(this._worldToLocalAffine);
-                    univariateBezierG.zero();
-                    bezier.poleProductsXYZW(coffF, axx, axy, axz, axw);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
-                    bezier.poleProductsXYZW(coffF, ayx, ayy, ayz, ayw);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
-                    bezier.poleProductsXYZW(coffF, awx, awy, awz, aww);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, -1.0);
-                    const roots = univariateBezierG.roots(0.0, true);
-                    if (roots) {
-                        for (const root of roots) {
-                            const fractionB = bezier.fractionToParentFraction(root);
-                            // The univariate bezier (which has been transformed by the view transform) evaluates into xyw space
-                            const bcurvePoint4d = bezier.fractionToPoint4d(root);
-                            const c = bcurvePoint4d.dotProductXYZW(axx, axy, axz, axw);
-                            const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
-                            const arcFraction = cpA.sweep.radiansToSignedFraction(Math.atan2(s, c), extendA0);
-                            if (this.acceptFraction(extendA0, arcFraction, extendA1) &&
-                                this.acceptFraction(extendB0, fractionB, extendB1)) {
-                                this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
-                            }
+            let bezier;
+            for (let spanIndex = 0;; spanIndex++) {
+                bezier = cpB.getSaturatedBezierSpan3dH(spanIndex, bezier);
+                if (!bezier)
+                    break;
+                if (this._worldToLocalPerspective)
+                    bezier.tryMultiplyMatrix4dInPlace(this._worldToLocalPerspective);
+                else if (this._worldToLocalAffine)
+                    bezier.tryTransformInPlace(this._worldToLocalAffine);
+                univariateBezierG.zero();
+                bezier.poleProductsXYZW(coffF, axx, axy, axz, axw);
+                univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
+                bezier.poleProductsXYZW(coffF, ayx, ayy, ayz, ayw);
+                univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
+                bezier.poleProductsXYZW(coffF, awx, awy, awz, aww);
+                univariateBezierG.addSquaredSquaredBezier(coffF, -1.0);
+                const roots = univariateBezierG.roots(0.0, true);
+                if (roots) {
+                    for (const root of roots) {
+                        const fractionB = bezier.fractionToParentFraction(root);
+                        // The univariate bezier (which has been transformed by the view transform) evaluates into xyw space
+                        const bcurvePoint4d = bezier.fractionToPoint4d(root);
+                        const c = bcurvePoint4d.dotProductXYZW(axx, axy, axz, axw);
+                        const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
+                        const arcFraction = cpA.sweep.radiansToSignedFraction(Math.atan2(s, c), extendA0);
+                        if (this.acceptFraction(extendA0, arcFraction, extendA1) &&
+                            this.acceptFraction(extendB0, fractionB, extendB1)) {
+                            this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
                         }
                     }
                 }