@itwin/core-geometry 5.12.0-dev.14 → 5.12.0-dev.16

package/lib/cjs/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,0CAAuC;AAEvC,mEAAkE;AAClE,+CAAuD;AACvD,+CAA4C;AAE5C,6CAAoG;AACpG,yEAAsE;AACtE,iDAAyD;AACzD,+DAAmE;AACnE,mCAAgC;AAChC,6CAA0C;AAC1C,+DAA4D;AAG5D,mDAAgD;AAChD,4FAAyF;AACzF,oFAAiF;AACjF,mDAAgD;AAChD,iCAA8B;AAC9B,iDAA8C;AAC9C,iEAA8D;AAC9D,2CAAqF;AACrF,+CAA4C;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,MAAa,yBAAyB;IACpC;;;;;;;;OAQG;IACI,MAAM,CAAC,6BAA6B,CACzC,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,qBAAS,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,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,4BAAkB,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,sCAAqB,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,yCAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,oBAAY,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,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YAClG,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,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,yCAAmB,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,qBAAS,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,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjLD,8DAiLC;AAED;;;GAGG;AACH,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,iCAAjB,iBAAiB,QAK5B;AAED;;;;;;GAMG;AACH,MAAa,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;AAZD,8CAYC;AAED;;;;;;;GAOG;AACH,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,eAAO,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,mBAAQ,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,WAAI,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACzD,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YACxD,qBAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,WAAW,GAAG,6CAAqB,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,yBAAW,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,6BAAa,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,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,mBAAQ,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;AAtED,kCAsEC;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IAC5B,mBAAmB;IACZ,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAA4B;IAC5C,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,8BAAkB,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;IACrC,oEAAoE;IAC5D,MAAM,CAAC,gBAAgB,GAAG,0BAAQ,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,qBAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,qDAAyB,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,qBAAS,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,qDAAyB,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,WAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,2BAAY,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,aAAK,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,aAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,yBAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,6BAAa,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;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,mBAAQ,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,6BAAa,EAAE,CAAC;oBAC3C,qBAAS,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,uBAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,qBAAS,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC,CAAC;IAC3H,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,oBAAY,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,oBAAY,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,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CACvE,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,8BAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,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,8BAAkB,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,8BAAkB,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,yCAAmB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACtD,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACjC,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,oBAAY,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,oBAAY,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;;AA1OH,oDA2OC;AACD;;;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,UAAU,EAAE,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa,EAAE,CAAC;YAC1C,mCAAmC;QACrC,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,aAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;QAC9E,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,EAAE,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChI,WAAW,GAAG,QAAQ,IAAI,CAAC,CAAC;QAC9B,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,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAsD;QAC/H,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,yCAAmB,CAAC;YACnI,gBAAgB,GAAG,SAAS,CAAC,CAAC,wEAAwE;QACxG,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAc,EAAE,EAAE,CAAC,yCAAmB,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;AAnCD,wCAmCC;AACD;;;GAGG;AACH,MAAa,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,yCAAmB,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;AAnBD,kDAmBC","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, HalfEdgeToNumberFunction } 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 seed first node to visit. Assumed to be in the exterior face.\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    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(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, // The RegionGroupMembers are not regions and therefore do not participate in parity rules\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!: HalfEdgeToNumberFunction;\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  // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\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   * 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    RegionOps.removeExtraneousBridgeEdges(this.graph = graph, undefined, this.faceAreaFunction = faceAreaFromCurvedEdgeData);\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        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 && data.curve) {\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.isInterval()) {\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      const loopArea = partial ? RegionOps.computeXYArea(Loop.create(partial, LineSegment3d.create(detail.point1, detail.point))) : 0;\n      areaToChord = loopArea ?? 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: HalfEdgeToNumberFunction | 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"]}
+{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AAEvC,mEAAkE;AAClE,+CAAuD;AACvD,+CAA4C;AAE5C,6CAAoG;AACpG,yEAAsE;AACtE,iDAAyD;AACzD,+DAAmE;AACnE,mCAAgC;AAChC,6CAA0C;AAC1C,+DAA4D;AAG5D,mDAAgD;AAChD,4FAAyF;AACzF,oFAAiF;AACjF,mDAAgD;AAChD,iCAA8B;AAC9B,iDAA8C;AAC9C,iEAA8D;AAC9D,2CAAqF;AACrF,+CAA4C;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,MAAa,yBAAyB;IACpC;;;;;;;;OAQG;IACI,MAAM,CAAC,6BAA6B,CACzC,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,qBAAS,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,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,4BAAkB,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,sCAAqB,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,yCAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,oBAAY,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,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YAClG,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,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,yCAAmB,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,qBAAS,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,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAjLD,8DAiLC;AAED;;;GAGG;AACH,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,iCAAjB,iBAAiB,QAK5B;AAED;;;;;;GAMG;AACH,MAAa,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;AAZD,8CAYC;AAED;;;;;;;GAOG;AACH,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,eAAO,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,mBAAQ,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,WAAI,IAAI,IAAI,YAAY,2BAAY,EAAE,CAAC;YACzD,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YACxD,qBAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,WAAW,GAAG,6CAAqB,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,yBAAW,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,6BAAa,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,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,mBAAQ,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;AAtED,kCAsEC;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IAC5B,mBAAmB;IACZ,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAA4B;IAC5C,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,8BAAkB,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;IACrC,oEAAoE;IAC5D,MAAM,CAAC,gBAAgB,GAAG,0BAAQ,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,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,qDAAyB,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,OAAO,GAAG,qBAAS,CAAC,kBAAkB,EAAE,CAAC,CAAC,gCAAgC;QAChF,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,qBAAS,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,qDAAyB,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,WAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,2BAAY,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,aAAK,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,aAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,yBAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,6BAAa,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;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,mBAAQ,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,6BAAa,EAAE,CAAC;oBAC3C,qBAAS,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,uBAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,qCAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,qBAAS,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC,CAAC;IAC3H,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,oBAAY,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,oBAAY,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,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CACvE,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,8BAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,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,8BAAkB,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,8BAAkB,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,yCAAmB,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACtD,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YACjC,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,oBAAY,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,oBAAY,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;;AA1OH,oDA2OC;AACD;;;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,UAAU,EAAE,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa,EAAE,CAAC;YAC1C,mCAAmC;QACrC,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,aAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;QAC9E,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;YAClF,MAAM,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,WAAI,CAAC,MAAM,CAAC,OAAO,EAAE,6BAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChI,WAAW,GAAG,QAAQ,IAAI,CAAC,CAAC;QAC9B,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,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAsD;QAC/H,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,yCAAmB,CAAC;YACnI,gBAAgB,GAAG,SAAS,CAAC,CAAC,wEAAwE;QACxG,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAc,EAAE,EAAE,CAAC,yCAAmB,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;AAnCD,wCAmCC;AACD;;;GAGG;AACH,MAAa,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,yCAAmB,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;AAnBD,kDAmBC","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, HalfEdgeToNumberFunction } 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 seed first node to visit. Assumed to be in the exterior face.\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    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(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, // The RegionGroupMembers are not regions and therefore do not participate in parity rules\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!: HalfEdgeToNumberFunction;\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  // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\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    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 areaTol = RegionOps.computeMinimumArea(); // TODO: default tolerance used!\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   * 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    RegionOps.removeExtraneousBridgeEdges(this.graph = graph, undefined, this.faceAreaFunction = faceAreaFromCurvedEdgeData);\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        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 && data.curve) {\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.isInterval()) {\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      const loopArea = partial ? RegionOps.computeXYArea(Loop.create(partial, LineSegment3d.create(detail.point1, detail.point))) : 0;\n      areaToChord = loopArea ?? 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: HalfEdgeToNumberFunction | 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/cjs/curve/internalContexts/MultiChainCollector.d.ts

@@ -21,8 +21,6 @@ export declare class MultiChainCollector {
     private _chains;
     /** Largest gap distance to close. */
     private _gapTolerance;
-    /** End point snap tolerance. Internally, this is an upper bound on gapTolerance. */
-    private _snapTolerance;
     /** Planarity tolerance, used to determine whether to return a Path or Loop in `grabResult(true)`. If undefined, always Path. */
     private _planeTolerance;
     private static _staticPointA;
@@ -31,13 +29,12 @@ export declare class MultiChainCollector {
     private _xyzWork1?;
     /** Initialize with an empty array of chains.
      * @param gapTolerance distance tolerance for calling endpoints identical
-     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
+     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within this tolerance of a plane.
      */
     constructor(gapTolerance?: number, planeTolerance?: number);
     /**
      * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
      * @param xyz endpoint to check
-     * @param distanceTol absolute distance tolerance for equating endpoints
      * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.
      */
     private findAnyChainToConnect;
@@ -56,16 +53,15 @@ export declare class MultiChainCollector {
      */
     captureCurve(candidate: AnyCurve): void;
     /** If allowed by the geometry type, move an endpoint. */
-    private static simpleEndPointMove;
+    private simpleEndPointMove;
     /**
      * Try to move the end of curve0 and/or the start of curve1 to a common point.
      * * All z-coordinates are ignored.
      * @param curve0 first curve, assumed to end close to the start of curve1
      * @param curve1 second curve, assumed to start close to the end of curve0
-     * @param gapTolerance max distance to move a curve start/end point
      * @returns whether curve start/end point(s) moved
      */
-    private static moveHeadOrTail;
+    private moveHeadOrTail;
     /** Announce a curve primitive
      * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
      * * Otherwise start a new chain.

package/lib/cjs/curve/internalContexts/MultiChainCollector.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEnD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,0BAA0B;IAC1B,OAAO,CAAC,OAAO,CAAqB;IACpC,qCAAqC;IACrC,OAAO,CAAC,aAAa,CAAS;IAC9B,oFAAoF;IACpF,OAAO,CAAC,cAAc,CAAS;IAC/B,gIAAgI;IAChI,OAAO,CAAC,eAAe,CAAqB;IAE5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAC,CAAU;IAE5B;;;OAGG;gBACgB,YAAY,SAA+B,EAAE,cAAc,CAAC,EAAE,MAAM;IAMvF;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAc7B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAStD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,QAAQ;IAQvC,yDAAyD;IACzD,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAejC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAiC7B;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA8CjC;;;;;;;;OAQG;IACH,OAAO,CAAC,yBAAyB;IAYjC,wCAAwC;IACxC,OAAO,CAAC,YAAY;IAMpB,qGAAqG;IACrG,OAAO,CAAC,wBAAwB;IAuBhC;;;;;OAKG;IACH,OAAO,CAAC,oBAAoB;IA+B5B,wEAAwE;IACxE,OAAO,CAAC,mBAAmB;IAS3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAa1E;;;MAGE;IACK,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;CAc9G"}
+{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEnD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,0BAA0B;IAC1B,OAAO,CAAC,OAAO,CAAqB;IACpC,qCAAqC;IACrC,OAAO,CAAC,aAAa,CAAS;IAC9B,gIAAgI;IAChI,OAAO,CAAC,eAAe,CAAqB;IAE5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAC,CAAU;IAE5B;;;OAGG;gBACgB,YAAY,SAA+B,EAAE,cAAc,CAAC,EAAE,MAAM;IAKvF;;;;OAIG;IACH,OAAO,CAAC,qBAAqB;IAc7B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAKtD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,QAAQ;IAQvC,yDAAyD;IACzD,OAAO,CAAC,kBAAkB;IAe1B;;;;;;OAMG;IACH,OAAO,CAAC,cAAc;IAuCtB;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA8CjC;;;;;;;;OAQG;IACH,OAAO,CAAC,yBAAyB;IAYjC,wCAAwC;IACxC,OAAO,CAAC,YAAY;IAMpB,qGAAqG;IACrG,OAAO,CAAC,wBAAwB;IAuBhC;;;;;OAKG;IACH,OAAO,CAAC,oBAAoB;IA+B5B,wEAAwE;IACxE,OAAO,CAAC,mBAAmB;IAS3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAa1E;;;MAGE;IACK,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;CAc9G"}

package/lib/cjs/curve/internalContexts/MultiChainCollector.js

@@ -38,8 +38,6 @@ class MultiChainCollector {
     _chains;
     /** Largest gap distance to close. */
     _gapTolerance;
-    /** End point snap tolerance. Internally, this is an upper bound on gapTolerance. */
-    _snapTolerance;
     /** Planarity tolerance, used to determine whether to return a Path or Loop in `grabResult(true)`. If undefined, always Path. */
     _planeTolerance;
     static _staticPointA;
@@ -48,30 +46,28 @@ class MultiChainCollector {
     _xyzWork1;
     /** Initialize with an empty array of chains.
      * @param gapTolerance distance tolerance for calling endpoints identical
-     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
+     * @param planeTolerance distance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within this tolerance of a plane.
      */
     constructor(gapTolerance = Geometry_1.Geometry.smallMetricDistance, planeTolerance) {
         this._chains = [];
         this._gapTolerance = gapTolerance;
-        this._snapTolerance = Geometry_1.Geometry.smallMetricDistance;
         this._planeTolerance = planeTolerance;
     }
     /**
      * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
      * @param xyz endpoint to check
-     * @param distanceTol absolute distance tolerance for equating endpoints
      * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.
      */
-    findAnyChainToConnect(xyz, distanceTol, exceptChainIndex = -1) {
+    findAnyChainToConnect(xyz, exceptChainIndex = -1) {
         for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {
             if (exceptChainIndex === chainIndexA)
                 continue;
             const chain = this._chains[chainIndexA];
             this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);
-            if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))
+            if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))
                 return { chainIndex: chainIndexA, atEnd: true };
             this._xyzWork1 = chain[0].startPoint(this._xyzWork1);
-            if (this._xyzWork1.isAlmostEqual(xyz, distanceTol))
+            if (this._xyzWork1.isAlmostEqual(xyz, this._gapTolerance))
                 return { chainIndex: chainIndexA, atEnd: false };
         }
         return undefined;
@@ -83,11 +79,7 @@ class MultiChainCollector {
      * @param candidate curve to add to the context
      */
     captureCurvePrimitive(candidate) {
-        if (this._snapTolerance < this._gapTolerance) {
-            if (this.attachPrimitiveToAnyChain(candidate, this._snapTolerance))
-                return;
-        }
-        if (this.attachPrimitiveToAnyChain(candidate, this._gapTolerance))
+        if (this.attachPrimitiveToAnyChain(candidate))
             return;
         this._chains.push([candidate]);
     }
@@ -106,7 +98,7 @@ class MultiChainCollector {
         }
     }
     /** If allowed by the geometry type, move an endpoint. */
-    static simpleEndPointMove(curve, atEnd, to) {
+    simpleEndPointMove(curve, atEnd, to) {
         if (curve instanceof (LineSegment3d_1.LineSegment3d)) {
             if (atEnd) {
                 curve.point1Ref.setFrom(to);
@@ -128,89 +120,92 @@ class MultiChainCollector {
      * * All z-coordinates are ignored.
      * @param curve0 first curve, assumed to end close to the start of curve1
      * @param curve1 second curve, assumed to start close to the end of curve0
-     * @param gapTolerance max distance to move a curve start/end point
      * @returns whether curve start/end point(s) moved
      */
-    static moveHeadOrTail(curve0, curve1, gapTolerance) {
+    moveHeadOrTail(curve0, curve1) {
         const xyz0 = curve0.endPoint();
         const xyz1 = curve1.startPoint();
         const minShift = Geometry_1.Geometry.smallMetricDistance * 0.001;
-        const d01 = xyz0.distanceXY(xyz1);
-        if (d01 < minShift)
+        let dist2 = xyz0.distanceSquaredXY(xyz1);
+        if (dist2 <= minShift * minShift)
+            return false; // if the move would be miniscule, don't bother
+        const gap2 = this._gapTolerance * this._gapTolerance;
+        if (dist2 > gap2)
             return false;
         // try lines and linestrings
-        if (d01 < gapTolerance) {
-            if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))
-                return true;
-        }
+        if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))
+            return true;
         // try other primitive types
+        if (!(curve0 instanceof Arc3d_1.Arc3d && curve1 instanceof Arc3d_1.Arc3d))
+            return false; // currently we only consider 2 arcs
         const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(curve0, true, curve1, true);
-        const shiftFactor = 5.0;
-        for (const pair of intersections) {
-            const detail0 = pair.detailA;
-            const detail1 = pair.detailB;
-            const distance0 = detail0.point.distanceXY(xyz0);
-            const distance1 = detail1.point.distanceXY(xyz1);
-            if (distance0 < shiftFactor * gapTolerance && distance1 < shiftFactor * gapTolerance) {
-                if (curve0 instanceof Arc3d_1.Arc3d && curve1 instanceof Arc3d_1.Arc3d) {
-                    const radians0End = curve0.sweep.fractionToRadians(detail0.fraction);
-                    curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);
-                    const radians1Start = curve1.sweep.fractionToRadians(detail1.fraction);
-                    curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);
-                    return true;
-                }
-                // TODO: other combinations of types
+        let iClosest = -1;
+        let minDist2 = Infinity;
+        for (let i = 0; i < intersections.length; ++i) { // find intersection closest to the joint
+            const dist20 = intersections[i].detailA.point.distanceSquaredXY(xyz0);
+            const dist21 = intersections[i].detailB.point.distanceSquaredXY(xyz1);
+            dist2 = dist20 + dist21;
+            if (dist20 <= gap2 && dist21 <= gap2 && dist2 < minDist2) {
+                minDist2 = dist2;
+                iClosest = i;
             }
         }
+        if (iClosest >= 0) { // move arc ends to the intersection point
+            const radians0End = curve0.sweep.fractionToRadians(intersections[iClosest].detailA.fraction);
+            curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);
+            const radians1Start = curve1.sweep.fractionToRadians(intersections[iClosest].detailB.fraction);
+            curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);
+            return true;
+        }
         return false;
     }
     /** Announce a curve primitive
      * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
      * * Otherwise start a new chain.
      */
-    attachPrimitiveToAnyChain(candidate, distanceTol) {
-        if (candidate.curveLength() < distanceTol) {
+    attachPrimitiveToAnyChain(candidate) {
+        if (candidate.curveLength() < this._gapTolerance) {
             return true;
         }
         else {
             this._xyzWork0 = candidate.startPoint(this._xyzWork0);
-            let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);
+            let connect = this.findAnyChainToConnect(this._xyzWork0);
             if (connect) {
                 if (connect.atEnd) {
                     const chain = this._chains[connect.chainIndex];
                     const index0 = chain.length - 1;
                     this._chains[connect.chainIndex].push(candidate);
-                    MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
-                    this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                    this.moveHeadOrTail(chain[index0], chain[index0 + 1]);
+                    this.searchAndMergeChainIndex(connect.chainIndex);
                     return true;
                 }
                 else {
                     candidate.reverseInPlace();
                     const chain = this._chains[connect.chainIndex];
                     chain.splice(0, 0, candidate);
-                    MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
-                    this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                    this.moveHeadOrTail(chain[0], chain[1]);
+                    this.searchAndMergeChainIndex(connect.chainIndex);
                     return true;
                 }
             }
             else {
                 this._xyzWork0 = candidate.endPoint(this._xyzWork0);
-                connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol);
+                connect = this.findAnyChainToConnect(this._xyzWork0);
                 if (connect) {
                     if (connect.atEnd) {
                         candidate.reverseInPlace();
                         const chain = this._chains[connect.chainIndex];
                         const index0 = chain.length - 1;
                         this._chains[connect.chainIndex].push(candidate);
-                        MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
-                        this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                        this.moveHeadOrTail(chain[index0], chain[index0 + 1]);
+                        this.searchAndMergeChainIndex(connect.chainIndex);
                         return true;
                     }
                     else {
                         const chain = this._chains[connect.chainIndex];
                         chain.splice(0, 0, candidate);
-                        MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
-                        this.searchAndMergeChainIndex(connect.chainIndex, distanceTol);
+                        this.moveHeadOrTail(chain[0], chain[1]);
+                        this.searchAndMergeChainIndex(connect.chainIndex);
                         return true;
                     }
                 }
@@ -247,13 +242,13 @@ class MultiChainCollector {
             p.reverseInPlace();
     }
     /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */
-    searchAndMergeChainIndex(chainIndex, distanceTol) {
+    searchAndMergeChainIndex(chainIndex) {
         // ASSUME valid index of non-empty chain
         const chain = this._chains[chainIndex];
         const lastIndexInChain = chain.length - 1;
         this._xyzWork0 = chain[0].startPoint(this._xyzWork0);
         // try start with any other chain
-        let connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);
+        let connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);
         if (connect) {
             if (!connect.atEnd)
                 this.reverseChain(connect.chainIndex);
@@ -262,7 +257,7 @@ class MultiChainCollector {
         }
         // try end with any other chain
         this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);
-        connect = this.findAnyChainToConnect(this._xyzWork0, distanceTol, chainIndex);
+        connect = this.findAnyChainToConnect(this._xyzWork0, chainIndex);
         if (connect) {
             if (connect.atEnd)
                 this.reverseChain(connect.chainIndex);
@@ -284,7 +279,7 @@ class MultiChainCollector {
             const primitiveN = curves[curves.length - 1];
             MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
             MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
-            if (MultiChainCollector.moveHeadOrTail(primitiveN, primitive0, this._gapTolerance)) {
+            if (this.moveHeadOrTail(primitiveN, primitive0)) {
                 // get the corrected coordinates
                 MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
                 MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);