@itwin/core-geometry 3.7.0-dev.1 → 3.7.0-dev.3

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

@@ -1 +1 @@
-{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAY,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,sEAAsE;IAC/D,cAAc,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAChE,oCAAoC;IAC7B,eAAe,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IACjE,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAC9F,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAC/F;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAInF,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAqB,EAAE,IAAc,EAAE,kBAAgC,EAAE,kBAAgC,EAAE,SAA6C;QAClM,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;YACD,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;gBACvC,0DAA0D;gBAC1D,qEAAqE;gBACrE,oDAAoD;gBACpD,+CAA+C;gBAC/C,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;oBAC5C,SAAU;wBACR,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;4BACvC,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;yBAClB;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE;4BAC1B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE;gCAC7B,MAAM;6BACP;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;yBACrD;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;4BAC1C,uBAAuB;4BACvB,OAAO;yBACR;qBACF;iBACF;aACF;YACD,oCAAoC;YACpC,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;SACvC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,mBAAmB,CAAC,cAAc,CAAC;QAEhE,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC3D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC3D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AACD;;;;;;GAMG;AACH,MAAM,iBAAiB;IAIrB,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,KAAK,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7C;AACD;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IAKtB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE;YAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;gBACH,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aAC3B;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;OACG;IACI,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE;YACxD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YAC1D,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE;YACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;aACvB;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE;YAC5D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;SAEtD;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IAQ/B,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,mCAAmC;IAC/E,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,2BAA2B;QAC3B,2BAA2B;QACzB,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1B,CAAC;IAID;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAE/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QAEF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;YACrE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE;gBAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE;oBAC5B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;iBACnC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE;oBAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;iBACjC;aACF;SACF;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,sBAAsB;YACtB,4CAA4C;YAC5C,4CAA4C;YAC5C,8CAA8C;YAC9C,gFAAgF;YAChF,yGAAyG;YACzG,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;SAChD;IACH,CAAC;IAED;;;;;;OAMG;IACI,6BAA6B;QAClC,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,4DAA4D;QAC5D,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE;YAClE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE;gBAClC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE;oBAC1C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;iBACpC;aACF;SACF;QACD,6DAA6D;QAC7D,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,CAAC,CAAC;QAClF,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QACpF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACI,sBAAsB,CAC3B,QAA4B,EAC5B,oBAA6C;QAC7C,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE;YAC9C,KAAK,CAAC,UAAU,EAAE,CAAC;SACpB;QACD,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;YACjD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE;gBACpB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBACtC,yBAAyB,CAAC,6BAA6B,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CAAC,CAAC;aAC7I;SACF;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;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE;gBACjC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBAC9C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;wBAClE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;qBACvB;iBACF;aACF;SACF;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE;gBACf,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;aAC9E;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE;YACvC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,sEAAsE;IAC/D,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oCAAoC;IAC7B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAnNc,qCAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;AAqNvI;;GAEG;AACH,SAAS,uBAAuB,CAAC,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAC3H,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE;QAC3B,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;KACrH;SAAM;QACL,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;KAC3F;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE;QAEjD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE;YACzC,yCAAyC;SAC1C;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE;YACxC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;SAC9E;KACF;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,iHAAiH;AACjH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG;QACD,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;KACxI,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAIzB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;;OAKG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;YAC1B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,mBAAmB,CAAC,cAAc,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;YAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1C;IACH,CAAC;CACF;AACD;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAG9B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,kBAA6D;QACtG,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE;YAC5C,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;SACnC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { Loop } from \"./Loop\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { Geometry } from \"../Geometry\";\nimport { AnyRegion } from \"./CurveChain\";\nimport { UnionRegion } from \"./UnionRegion\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { Arc3d } from \"./Arc3d\";\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\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 { return true; }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean { return true; }\n  /** Announce face entry */\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n}\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\n * @internal\n */\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\n/** Function signature ot announce classification of a face.\n * The `faceType` parameters are\n * * -1 for a fully exterior face.  This is a negative area face.\n * * 0 for a positive area face classified as \"out\" for the boolean.\n * * 1 for a positive area face classified as \"in\" for the boolean.\n */\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\n/**\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\n * * This assumes the each node in the graph has edgeTag set to:\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\n *     * for example, an edge added by regularization\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\n * * constructor\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\n *    * sets the in/out status of both terms to false.\n * * `startComponent` marks the entire outer face as `EXTERIOR`\n * * `enterFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\n *    * if out, set the `EXTERIOR` mask around the face.\n * * `leaveFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n * * `finishComponent` is not reimplemented.\n * @internal\n */\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\n  private _inComponent: boolean[];\n  private _exteriorMask: HalfEdgeMask;\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\n    super();\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\n    this._exteriorMask = exteriorMask;\n    this._faceSelectFunction = acceptFaceFunction;\n  }\n  /** Mark this face as exterior */\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\n  /**\n   * * If necessary, toggle a term state.\n   * * if indicated, mark this face exterior.\n   */\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\n      node.setMaskAroundFace(this._exteriorMask);\n    return true;\n  }\n  /**\n   * * If necessary, toggle a term state.\n   */\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    return true;\n  }\n}\n/**\n * Low level graph search for face classification.\n * @internal\n */\nexport class RegionOpsFaceToFaceSearch {\n  /**\n   * run a DFS with face-to-face step announcements.\n   * * false return from any function terminates search immediately.\n   * * all reachable nodes assumed to have both visit masks clear.\n   * @param graph containing graph.\n   * @param seed first node to visit.\n   * @param faceHasBeenVisited mask marking faces that have been seen.\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\n   *\n   */\n  public static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks) {\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, currentNode)\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      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const faceVisitedMask = graph.grabMask();\n      const nodeVisitedMask = graph.grabMask();\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\n      graph.clearMask(allMasksToClear);\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\n      graph.dropMask(faceVisitedMask);\n      graph.dropMask(nodeVisitedMask);\n      return graph;\n    }\n    return undefined;\n  }\n\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 = HalfEdgeGraphSearch.signedFaceArea;\n\n    // Add all the members in groupA ..\n    for (const data of dataA) {\n      if (data.length > 2){\n      const member = new RegionGroupMember(data, callbacks.groupA);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    for (const data of dataB) {\n      if (data.length > 2){\n      const member = new RegionGroupMember(data, callbacks.groupB);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    // split edges where they cross . . .\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n    // sort radially around vertices.\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n    // add edges to connect various components  (e.g. holes!!!)\n    const context = new RegularizationContext(graph);\n    context.regularizeGraph(true, true);\n    callbacks.runClassificationSweep(binaryOp);\n    if (purgeSliverExteriorFaces)\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\n    return graph;\n  }\n}\n\n/**\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\n * @internal\n */\nexport enum RegionGroupOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  NonBounding = -1,\n}\n/**\n * 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 */\nclass 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() { this.sweepState = 0; }\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   */\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      const cleanerData = data.clone() as (ParityRegion | Loop);\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\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  }\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  public extraGeometry!: RegionGroup;\n  public graph!: HalfEdgeGraph;\n  public faceAreaFunction!: NodeToNumberFunction;\n  public binaryOp: RegionBinaryOpType;\n\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; // it will be revised on can calls.\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    // const doConnectives = 1;\n    // if (doConnectives !== 0)\n      this.addConnectives();\n  }\n\n  private _workSegment?: LineSegment3d;\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\n  /**\n   * The sweep operations require access to all geometry by edge crossings and face walk.\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\n   * This method:\n   * * finds the total range\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\n   * * places those lines in the extraGeometry group\n   */\n  public addConnectives() {\n    const rangeA = this.groupA.range();\n    const rangeB = this.groupB.range();\n    const rangeAB = rangeA.union(rangeB);\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\n    let margin = 0.1;\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\n    if (this._workSegment)\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\n\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\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\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  /**\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   */\n  public annotateAndMergeCurvesInGraph() {\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 range = RegionOps.curveArrayRange(allPrimitives);\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections);\n    this.graph = graph;\n    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(\n    binaryOp: RegionBinaryOpType,\n    announceFaceFunction?: AnnounceClassifiedFace) {\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    }\n    const faceHasBeenVisitedMask = this.graph.grabMask();\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\n    const componentArray = GraphComponentArray.create(this.graph);\n    for (const component of componentArray.components) {\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\n      if (exteriorHalfEdge) {\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\n        this.graph.clearMask(allMasksToClear);\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);\n      }\n    }\n    this.graph.dropMask(faceHasBeenVisitedMask);\n    this.graph.dropMask(nodeHasBeenVisitedMask);\n  }\n  // search the graph for faces with\n  // .. exactly 2 edges\n  // .. both with given mask\n  // .. at least one mate is not exterior.\n  // .. clear that mark\n  public unmaskMaskedNullFaces(mask: number) {\n    for (const nodeA of this.graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      if (nodeB.faceSuccessor === nodeA) {\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\n            nodeA.clearMask(mask);\n            nodeB.clearMask(mask);\n          }\n        }\n      }\n    }\n  }\n  private getInOut(): boolean {\n    if (this.binaryOp === RegionBinaryOpType.Union)\n      return this.groupA.getInOut() || this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\n      return this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\n      return this.groupA.getInOut() && !this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\n      return !this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Parity)\n      return this.groupA.getInOut() !== this.groupB.getInOut();\n    return false;\n  }\n  /**\n   * Record transition across an edge as entry or exit from a RegionGroup.\n   * * Work backward from the node to a RegionGroup.  This path can be:\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\n   *      * node points to CurveLocation Detail\n   *      * CurveLocationDetail points to curve\n   *      * curve points to RegionGroupMember\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\n   * @param node\n   * @param delta\n   */\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n        return member;  // no transition across a bridge edge\n      if (delta !== 0) {\n        const oldSweepState = member.sweepState;\n        member.sweepState += delta;\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\n      }\n      return member;\n    };\n\n    const data = node.edgeTag;\n    if (data instanceof RegionGroupMember)\n      return updateRegionGroupMemberState(data);\n\n    if (data instanceof CurveLocationDetail) {\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\n      const member = data.curve!.parent;\n      if (member instanceof RegionGroupMember)\n        return updateRegionGroupMemberState(member);\n    }\n    return undefined;\n  }\n  // obligations to act as sweep callback ...\n  /** Announce a representative node on the outer face of a component */\n  public startComponent(outerFaceNode: HalfEdge): boolean {\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\n    return true;\n  }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** 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/** return xy area between a (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(detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY): number {\n  // area between trapezoid and axis\n  let trapezoidArea;\n  if (detail && detail.point1) {\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\n  } else {\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\n  }\n  let areaToChord = 0.0;\n  if (detail && detail.curve && detail.hasFraction1) {\n\n    if (detail.curve instanceof LineSegment3d) {\n      // ah .. nothing to do for a line segment\n    } else if (detail.curve instanceof Arc3d) {\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\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   *\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\n   */\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\n    const vertexFunction = (node: HalfEdge) => {\n      if (extendRangeForEdge)\n        extendRangeForEdge(node, this.range);\n      else\n        this.range.extendXY(node.x, node.y);\n      return 0;\n    };\n    this.range.setNull();\n    for (const f of this.faces) {\n      f.sumAroundFace(vertexFunction);\n    }\n    this.faceAreas.length = 0;\n    if (!faceAreaFunction)\n      faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\n    for (const f of this.faces) {\n      this.faceAreas.push(faceAreaFunction(f));\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(graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void): 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;AACH,OAAO,EAAY,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,sEAAsE;IAC/D,cAAc,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAChE,oCAAoC;IAC7B,eAAe,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IACjE,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAC9F,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAC/F;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAInF,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAqB,EAAE,IAAc,EAAE,kBAAgC,EAAE,kBAAgC,EAAE,SAA6C;QAClM,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;YACD,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;gBACvC,0DAA0D;gBAC1D,qEAAqE;gBACrE,oDAAoD;gBACpD,+CAA+C;gBAC/C,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;oBAC5C,SAAU;wBACR,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;4BACvC,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;yBAClB;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE;4BAC1B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE;gCAC7B,MAAM;6BACP;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;yBACrD;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE;4BAC1C,uBAAuB;4BACvB,OAAO;yBACR;qBACF;iBACF;aACF;YACD,oCAAoC;YACpC,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;SACvC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,mBAAmB,CAAC,cAAc,CAAC;QAEhE,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC3D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;YACxB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC3D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AACD;;;;;;GAMG;AACH,MAAM,iBAAiB;IAIrB,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,KAAK,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7C;AACD;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IAKtB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE;YAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;gBACH,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aAC3B;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;OACG;IACI,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE;YACxD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YAC1D,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE;YACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;aACvB;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE;YAC5D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;SAEtD;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IAQ/B,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,mCAAmC;IAC/E,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,2BAA2B;QAC3B,2BAA2B;QACzB,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1B,CAAC;IAID;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAE/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QAEF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;YACrE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE;gBAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE;oBAC5B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;iBACnC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE;oBAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;iBACjC;aACF;SACF;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,sBAAsB;YACtB,4CAA4C;YAC5C,4CAA4C;YAC5C,8CAA8C;YAC9C,gFAAgF;YAChF,yGAAyG;YACzG,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;SAChD;IACH,CAAC;IAED;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,QAAQ,CAAC,mBAAmB;QACxF,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,4DAA4D;QAC5D,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE;YAClE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE;gBAClC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE;oBAC1C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;iBACpC;aACF;SACF;QACD,6DAA6D;QAC7D,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;QACpF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACI,sBAAsB,CAC3B,QAA4B,EAC5B,oBAA6C;QAC7C,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE;YAC9C,KAAK,CAAC,UAAU,EAAE,CAAC;SACpB;QACD,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;YACjD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE;gBACpB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBACtC,yBAAyB,CAAC,6BAA6B,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CAAC,CAAC;aAC7I;SACF;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;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE;gBACjC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBAC9C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;wBAClE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;qBACvB;iBACF;aACF;SACF;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE;gBACf,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;aAC9E;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE;YACvC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,sEAAsE;IAC/D,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oCAAoC;IAC7B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AApNc,qCAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;AAsNvI;;GAEG;AACH,SAAS,uBAAuB,CAAC,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAC3H,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE;QAC3B,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;KACrH;SAAM;QACL,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;KAC3F;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE;QAEjD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE;YACzC,yCAAyC;SAC1C;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE;YACxC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;SAC9E;KACF;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,iHAAiH;AACjH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG;QACD,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;KACxI,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAIzB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;;OAKG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;YAC1B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,mBAAmB,CAAC,cAAc,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;YAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1C;IACH,CAAC;CACF;AACD;;GAEG;AACH,MAAM,OAAO,mBAAmB;IAG9B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,kBAA6D;QACtG,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE;YAC5C,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;SACnC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { Loop } from \"./Loop\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { Geometry } from \"../Geometry\";\nimport { AnyRegion } from \"./CurveChain\";\nimport { UnionRegion } from \"./UnionRegion\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { Arc3d } from \"./Arc3d\";\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\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 { return true; }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean { return true; }\n  /** Announce face entry */\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n}\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\n * @internal\n */\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\n/** Function signature ot announce classification of a face.\n * The `faceType` parameters are\n * * -1 for a fully exterior face.  This is a negative area face.\n * * 0 for a positive area face classified as \"out\" for the boolean.\n * * 1 for a positive area face classified as \"in\" for the boolean.\n */\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\n/**\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\n * * This assumes the each node in the graph has edgeTag set to:\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\n *     * for example, an edge added by regularization\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\n * * constructor\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\n *    * sets the in/out status of both terms to false.\n * * `startComponent` marks the entire outer face as `EXTERIOR`\n * * `enterFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\n *    * if out, set the `EXTERIOR` mask around the face.\n * * `leaveFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n * * `finishComponent` is not reimplemented.\n * @internal\n */\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\n  private _inComponent: boolean[];\n  private _exteriorMask: HalfEdgeMask;\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\n    super();\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\n    this._exteriorMask = exteriorMask;\n    this._faceSelectFunction = acceptFaceFunction;\n  }\n  /** Mark this face as exterior */\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\n  /**\n   * * If necessary, toggle a term state.\n   * * if indicated, mark this face exterior.\n   */\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\n      node.setMaskAroundFace(this._exteriorMask);\n    return true;\n  }\n  /**\n   * * If necessary, toggle a term state.\n   */\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    return true;\n  }\n}\n/**\n * Low level graph search for face classification.\n * @internal\n */\nexport class RegionOpsFaceToFaceSearch {\n  /**\n   * run a DFS with face-to-face step announcements.\n   * * false return from any function terminates search immediately.\n   * * all reachable nodes assumed to have both visit masks clear.\n   * @param graph containing graph.\n   * @param seed first node to visit.\n   * @param faceHasBeenVisited mask marking faces that have been seen.\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\n   *\n   */\n  public static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks) {\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, currentNode)\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      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const faceVisitedMask = graph.grabMask();\n      const nodeVisitedMask = graph.grabMask();\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\n      graph.clearMask(allMasksToClear);\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\n      graph.dropMask(faceVisitedMask);\n      graph.dropMask(nodeVisitedMask);\n      return graph;\n    }\n    return undefined;\n  }\n\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 = HalfEdgeGraphSearch.signedFaceArea;\n\n    // Add all the members in groupA ..\n    for (const data of dataA) {\n      if (data.length > 2){\n      const member = new RegionGroupMember(data, callbacks.groupA);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    for (const data of dataB) {\n      if (data.length > 2){\n      const member = new RegionGroupMember(data, callbacks.groupB);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    // split edges where they cross . . .\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n    // sort radially around vertices.\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n    // add edges to connect various components  (e.g. holes!!!)\n    const context = new RegularizationContext(graph);\n    context.regularizeGraph(true, true);\n    callbacks.runClassificationSweep(binaryOp);\n    if (purgeSliverExteriorFaces)\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\n    return graph;\n  }\n}\n\n/**\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\n * @internal\n */\nexport enum RegionGroupOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  NonBounding = -1,\n}\n/**\n * 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 */\nclass 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() { this.sweepState = 0; }\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   */\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      const cleanerData = data.clone() as (ParityRegion | Loop);\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\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  }\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  public extraGeometry!: RegionGroup;\n  public graph!: HalfEdgeGraph;\n  public faceAreaFunction!: NodeToNumberFunction;\n  public binaryOp: RegionBinaryOpType;\n\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; // it will be revised on can calls.\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    // const doConnectives = 1;\n    // if (doConnectives !== 0)\n      this.addConnectives();\n  }\n\n  private _workSegment?: LineSegment3d;\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\n  /**\n   * The sweep operations require access to all geometry by edge crossings and face walk.\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\n   * This method:\n   * * finds the total range\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\n   * * places those lines in the extraGeometry group\n   */\n  public addConnectives() {\n    const rangeA = this.groupA.range();\n    const rangeB = this.groupB.range();\n    const rangeAB = rangeA.union(rangeB);\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\n    let margin = 0.1;\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\n    if (this._workSegment)\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\n\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\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\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  /**\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 range = RegionOps.curveArrayRange(allPrimitives);\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections);\n    this.graph = graph;\n    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(\n    binaryOp: RegionBinaryOpType,\n    announceFaceFunction?: AnnounceClassifiedFace) {\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    }\n    const faceHasBeenVisitedMask = this.graph.grabMask();\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\n    const componentArray = GraphComponentArray.create(this.graph);\n    for (const component of componentArray.components) {\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\n      if (exteriorHalfEdge) {\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\n        this.graph.clearMask(allMasksToClear);\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);\n      }\n    }\n    this.graph.dropMask(faceHasBeenVisitedMask);\n    this.graph.dropMask(nodeHasBeenVisitedMask);\n  }\n  // search the graph for faces with\n  // .. exactly 2 edges\n  // .. both with given mask\n  // .. at least one mate is not exterior.\n  // .. clear that mark\n  public unmaskMaskedNullFaces(mask: number) {\n    for (const nodeA of this.graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      if (nodeB.faceSuccessor === nodeA) {\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\n            nodeA.clearMask(mask);\n            nodeB.clearMask(mask);\n          }\n        }\n      }\n    }\n  }\n  private getInOut(): boolean {\n    if (this.binaryOp === RegionBinaryOpType.Union)\n      return this.groupA.getInOut() || this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\n      return this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\n      return this.groupA.getInOut() && !this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\n      return !this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Parity)\n      return this.groupA.getInOut() !== this.groupB.getInOut();\n    return false;\n  }\n  /**\n   * Record transition across an edge as entry or exit from a RegionGroup.\n   * * Work backward from the node to a RegionGroup.  This path can be:\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\n   *      * node points to CurveLocation Detail\n   *      * CurveLocationDetail points to curve\n   *      * curve points to RegionGroupMember\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\n   * @param node\n   * @param delta\n   */\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n        return member;  // no transition across a bridge edge\n      if (delta !== 0) {\n        const oldSweepState = member.sweepState;\n        member.sweepState += delta;\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\n      }\n      return member;\n    };\n\n    const data = node.edgeTag;\n    if (data instanceof RegionGroupMember)\n      return updateRegionGroupMemberState(data);\n\n    if (data instanceof CurveLocationDetail) {\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\n      const member = data.curve!.parent;\n      if (member instanceof RegionGroupMember)\n        return updateRegionGroupMemberState(member);\n    }\n    return undefined;\n  }\n  // obligations to act as sweep callback ...\n  /** Announce a representative node on the outer face of a component */\n  public startComponent(outerFaceNode: HalfEdge): boolean {\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\n    return true;\n  }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** 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/** return xy area between a (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(detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY): number {\n  // area between trapezoid and axis\n  let trapezoidArea;\n  if (detail && detail.point1) {\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\n  } else {\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\n  }\n  let areaToChord = 0.0;\n  if (detail && detail.curve && detail.hasFraction1) {\n\n    if (detail.curve instanceof LineSegment3d) {\n      // ah .. nothing to do for a line segment\n    } else if (detail.curve instanceof Arc3d) {\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\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   *\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\n   */\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\n    const vertexFunction = (node: HalfEdge) => {\n      if (extendRangeForEdge)\n        extendRangeForEdge(node, this.range);\n      else\n        this.range.extendXY(node.x, node.y);\n      return 0;\n    };\n    this.range.setNull();\n    for (const f of this.faces) {\n      f.sumAroundFace(vertexFunction);\n    }\n    this.faceAreas.length = 0;\n    if (!faceAreaFunction)\n      faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\n    for (const f of this.faces) {\n      this.faceAreas.push(faceAreaFunction(f));\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(graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void): GraphComponentArray {\n    const result = new GraphComponentArray(graph);\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    for (const componentFaces of componentArrays) {\n      const component = new GraphComponent(componentFaces);\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\n      result.components.push(component);\n    }\n    return result;\n  }\n}\n"]}

package/lib/esm/geometry3d/BarycentricTriangle.d.ts

@@ -1,14 +1,67 @@
 /** @packageDocumentation
  * @module CartesianGeometry
  */
-import { Point3d } from "./Point3dVector3d";
+import { PolygonLocation } from "../Geometry";
+import { Point3d, Vector3d } from "./Point3dVector3d";
+import { Ray3d } from "./Ray3d";
 /**
- * 3 points defining a triangle to be evaluated with Barycentric coordinates.
+ * Carries data about a location in the plane of a triangle.
+ * * Each instance carries both world and barycentric coordinates for the point, and provides query services on the latter.
+ * * No tolerance is used when querying barycentric coordinates (e.g., `isInsideOrOn`, `classify`). Use `snapLocalToEdge`
+ * to adjust the barycentric coordinates to a triangle edge if they lie within a parametric tolerance.
+ *
+ * Properties of the barycentric coordinates (b0, b1, b2) of a point p in the plane of a triangle T with vertices p0, p1, p2:
+ * * 1 = b0 + b1 + b2
+ * * p = b0 * p0 + b1 * p1 + b2 * p2
+ * * If T is spanned by the vectors U=p1-p0 and V=p2-p0, then the vector P=p-p0 can be written P = b1 * U + b2 * V.
+ * * The coordinates are all nonnegative if and only if p is inside or on T.
+ * * Exactly one coordinate is zero if and only if p lies on an (infinitely extended) edge of T.
+ * * Exactly two coordinates are zero if and only if p coincides with a vertex of T.
+ * @public
+ */
+export declare class TriangleLocationDetail {
+    /** The Cartesian coordinates of the point p. */
+    world: Point3d;
+    /** The barycentric coordinates of p with respect to the triangle. Assumed to sum to one. */
+    local: Point3d;
+    /** Application-specific number */
+    a: number;
+    /** Index of the triangle vertex at the base of the edge closest to p. */
+    closestEdgeIndex: number;
+    /** The parameter along the closest edge of the projection of p. */
+    closestEdgeParam: number;
+    private constructor();
+    /** Invalidate this detail. */
+    invalidate(): void;
+    /** Create an invalid detail.
+     * @param result optional pre-allocated object to fill and return
+     */
+    static create(result?: TriangleLocationDetail): TriangleLocationDetail;
+    /** Set the instance contents from the other detail.
+     * @param other detail to clone
+     */
+    copyContentsFrom(other: TriangleLocationDetail): void;
+    /** Whether this detail is invalid. */
+    get isValid(): boolean;
+    /** Queries the barycentric coordinates to determine whether this instance specifies a location inside or on the triangle.
+     * @see classify
+     */
+    get isInsideOrOn(): boolean;
+    /** Queries this detail to classify the location of this instance with respect to the triangle.
+     * @returns location code
+     * @see isInsideOrOn
+     */
+    get classify(): PolygonLocation;
+}
+/**
+ * 3 points defining a triangle to be evaluated with barycentric coordinates.
  * @public
  */
 export declare class BarycentricTriangle {
     /** Array of 3 point coordinates for the triangle. */
     points: Point3d[];
+    /** Edge length squared cache, indexed by opposite vertex index */
+    protected edgeLength2: number[];
     /** Constructor.
      * * Point references are CAPTURED
      */
@@ -26,18 +79,129 @@ export declare class BarycentricTriangle {
     get aspectRatio(): number;
     /** Return the area of the triangle. */
     get area(): number;
+    /** Return the perimeter of the triangle */
+    get perimeter(): number;
     /** Sum the points with given scales.
-     * * In normal use, the scales will add to 1 and the result point is in the plane of the triangle.
-     * * If scales do not add to 1, the point is in the triangle scaled (by the scale sum) from the origin.
+     * * If the scales sum to 1, they are barycentric coordinates, and hence the result point is in the plane of the triangle.
+     * * If the scales do not sum to 1, the point is in the triangle scaled (by the scale sum) from the origin.
+     * @param b0 scale to apply to vertex 0
+     * @param b1 scale to apply to vertex 1
+     * @param b2 scale to apply to vertex 2
+     * @param result optional pre-allocated point to fill and return
+     * @return linear combination of the vertices of this triangle
+     * @see pointToFraction
+     */
+    fractionToPoint(b0: number, b1: number, b2: number, result?: Point3d): Point3d;
+    private static _workPoint?;
+    private static _workVector0?;
+    private static _workVector1?;
+    private static _workRay?;
+    private static _workMatrix?;
+    /** Compute the projection of the given point onto the plane of this triangle.
+     * @param point point p to project
+     * @param result optional pre-allocated object to fill and return
+     * @returns details d of the projection point P = `d.point`:
+     * * `d.isValid` returns true if and only if `this.normal()` is defined.
+     * * `d.classify` can be used to determine where P lies with respect to the triangle.
+     * * `d.a` is the signed projection distance: P = p + a * `this.normal()`.
+     * @see fractionToPoint
+     */
+    pointToFraction(point: Point3d, result?: TriangleLocationDetail): TriangleLocationDetail;
+    /** Convert from opposite-vertex to start-vertex edge indexing. */
+    static edgeOppositeVertexIndexToStartVertexIndex(edgeIndex: number): number;
+    /** Convert from start-vertex to opposite-vertex edge indexing. */
+    static edgeStartVertexIndexToOppositeVertexIndex(startVertexIndex: number): number;
+    /** Examine a point's barycentric coordinates to determine if it lies inside the triangle but not on an edge/vertex.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns whether the point with barycentric coordinates is strictly inside the triangle.
+     */
+    static isInsideTriangle(b0: number, b1: number, b2: number): boolean;
+    /** Examine a point's barycentric coordinates to determine if it lies inside the triangle or on an edge/vertex.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns whether the point with barycentric coordinates is inside or on the triangle.
      */
-    fractionToPoint(a0: number, a1: number, a2: number, result?: Point3d): Point3d;
+    static isInsideOrOnTriangle(b0: number, b1: number, b2: number): boolean;
+    /** Examine a point's barycentric coordinates to determine if it lies "outside" an edge of the triangle.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns index of vertex/edge i for which b_i < 0 and b_j >= 0 and b_k >= 0, or -1
+     */
+    private static isInRegionBeyondEdge;
+    /** Examine a point's barycentric coordinates to determine if it lies "outside" a vertex of the triangle.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns index of vertex i for which and b_j < 0 and b_k < 0, or -1
+     */
+    private static isInRegionBeyondVertex;
+    /** Examine a point's barycentric coordinates to determine if it lies on a vertex of the triangle.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns index of vertex i for which b_i = 1 and b_j = b_k = 0, or -1
+     */
+    private static isOnVertex;
+    /** Examine a point's barycentric coordinates to determine if it lies on a bounded edge of the triangle.
+     * * No parametric tolerance is used.
+     * * It is assumed b0 + b1 + b2 = 1.
+     * @returns index of vertex/edge i for which b_i = 0 and b_j > 0 and b_k > 0, or -1
+     */
+    private static isOnBoundedEdge;
+    /** @returns edge/vertex index (0,1,2) for which the function has a minimum value */
+    private static indexOfMinimum;
+    /** Return the index of the closest triangle vertex to the point given by its barycentric coordinates. */
+    closestVertexIndex(b0: number, b1: number, b2: number): number;
+    /** Compute the projection of barycentric point p onto the (unbounded) edge e_k(v_i,v_j) of the triangle T(v_i,v_j,v_k).
+     * @param k vertex v_k is opposite the edge e_k
+     * @param b barycentric coordinates of point to project
+     * @returns parameter s along e_k, such that:
+     * * the projection point is q = v_i + s * (v_j - v_i)
+     * * the barycentric coords of the projection are q_ijk = (1 - s, s, 0)
+     */
+    private computeProjectionToEdge;
+    /** Compute the projection of a barycentric point p to the triangle T(v_0,v_1,v_2).
+     * @param b0 barycentric coordinate of p corresponding to v_0
+     * @param b1 barycentric coordinate of p corresponding to v_1
+     * @param b2 barycentric coordinate of p corresponding to v_2
+     * @returns closest edge start vertex index i and projection parameter u such that the projection q = v_i + u * (v_j - v_i).
+     */
+    closestPoint(b0: number, b1: number, b2: number): {
+        closestEdgeIndex: number;
+        closestEdgeParam: number;
+    };
+    /** Compute the intersection of a line (parameterized as a ray) with the plane of this triangle.
+     * @param ray infinite line to intersect, as a ray
+     * @param result optional pre-allocated object to fill and return
+     * @returns details d of the line-plane intersection `d.point`:
+     * * `d.isValid` returns true if and only if the line intersects the plane.
+     * * `d.classify` can be used to determine where the intersection lies with respect to the triangle.
+     * * `d.a` is the intersection parameter. If `d.a` >= 0, the ray intersects the plane of the triangle.
+     * @see pointToFraction
+    */
+    intersectRay3d(ray: Ray3d, result?: TriangleLocationDetail): TriangleLocationDetail;
+    /** Compute the intersection of a line (parameterized as a line segment) with the plane of this triangle.
+     * @param point0 start point of segment on line to intersect
+     * @param point1 end point of segment on line to intersect
+     * @param result optional pre-allocated object to fill and return
+     * @returns details d of the line-plane intersection `d.point`:
+     * * `d.isValid` returns true if and only if the line intersects the plane.
+     * * `d.classify` can be used to determine where the intersection lies with respect to the triangle.
+     * * `d.a` is the intersection parameter. If `d.a` is in [0,1], the segment intersects the plane of the triangle.
+     * @see intersectRay3d
+    */
+    intersectSegment(point0: Point3d, point1: Point3d, result?: TriangleLocationDetail): TriangleLocationDetail;
+    /** Adjust the location to an edge of the triangle if within either given tolerance.
+     * @param location details of a point in the plane of the triangle, `location.local` and `location.world` possibly updated to lie on a triangle edge
+     * @param distanceTolerance absolute distance tolerance (or zero to ignore)
+     * @param parameterTolerance barycentric coordinate fractional tolerance (or zero to ignore)
+     * @return whether the location was adjusted
+     */
+    snapLocationToEdge(location: TriangleLocationDetail, distanceTolerance?: number, parameterTolerance?: number): boolean;
     /** Copy all values from `other`
      */
     setFrom(other: BarycentricTriangle): void;
-    /** copy contents of (not pointers to) the given points. */
+    /** Copy contents of (not pointers to) the given points. A vertex is zeroed if its corresponding input point is undefined. */
     set(point0: Point3d | undefined, point1: Point3d | undefined, point2: Point3d | undefined): void;
-    private static _workVector0?;
-    private static _workVector1?;
     /**
      * * For `this` and `other` BarycentricTriangles, compute cross products of vectors from point0 to point1 and from point0 to point2.
      * * return the dot product of those two
@@ -45,7 +209,30 @@ export declare class BarycentricTriangle {
     dotProductOfCrossProductsFromOrigin(other: BarycentricTriangle): number;
     /** Return the centroid of the 3 points. */
     centroid(result?: Point3d): Point3d;
+    /** Return the incenter of the triangle. */
+    incenter(result?: Point3d): Point3d;
+    /** Return the circumcenter of the triangle. */
+    circumcenter(result?: Point3d): Point3d;
+    /** Return the unit normal of the triangle.
+     * @param result optional pre-allocated vector to fill and return.
+     * @returns unit normal, or undefined if cross product length is too small.
+     */
+    normal(result?: Vector3d): Vector3d | undefined;
     /** test for point-by-point `isAlmostEqual` relationship. */
     isAlmostEqual(other: BarycentricTriangle): boolean;
+    /** Compute length of the triangle edge opposite the vertex with the given index.
+     * @see edgeStartVertexIndexToOppositeVertexIndex
+     */
+    edgeLength(oppositeVertexIndex: number): number;
+    /** Compute squared length of the triangle edge opposite the vertex with the given index.
+     * @see edgeStartVertexIndexToOppositeVertexIndex
+    */
+    edgeLengthSquared(oppositeVertexIndex: number): number;
+    /** Compute dot product of the edge vectors based at the vertex with the given index. */
+    dotProductOfEdgeVectorsAtVertex(baseVertexIndex: number): number;
+    /** Compute the squared distance between two points given by their barycentric coordinates.
+     * * It is assumed that a0 + a1 + a2 = b0 + b1 + b2 = 1.
+     */
+    distanceSquared(a0: number, a1: number, a2: number, b0: number, b1: number, b2: number): number;
 }
 //# sourceMappingURL=BarycentricTriangle.d.ts.map

package/lib/esm/geometry3d/BarycentricTriangle.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BarycentricTriangle.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/BarycentricTriangle.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAEtD;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B,qDAAqD;IAC9C,MAAM,EAAE,OAAO,EAAE,CAAC;IACzB;;OAEG;IACH,SAAS,aAAa,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAOvE;;;OAGG;WACW,eAAe,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAO5L,mEAAmE;WACrD,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAM1H,oEAAoE;IAC7D,KAAK,CAAC,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAI/D,qDAAqD;IACrD,IAAW,WAAW,IAAI,MAAM,CAG/B;IACD,uCAAuC;IACvC,IAAW,IAAI,IAAI,MAAM,CAExB;IACD;;;OAGG;IACI,eAAe,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAIrF;OACG;IACI,OAAO,CAAC,KAAK,EAAE,mBAAmB;IAKzC,2DAA2D;IACpD,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,EAAE,MAAM,EAAE,OAAO,GAAG,SAAS,EAAE,MAAM,EAAE,OAAO,GAAG,SAAS;IAMhG,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAW;IACvC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAW;IACvC;;;OAGG;IACI,mCAAmC,CAAC,KAAK,EAAE,mBAAmB,GAAG,MAAM;IAK9E,2CAA2C;IACpC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAS1C,4DAA4D;IACrD,aAAa,CAAC,KAAK,EAAE,mBAAmB,GAAG,OAAO;CAK1D"}
+{"version":3,"file":"BarycentricTriangle.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/BarycentricTriangle.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAY,eAAe,EAAE,MAAM,aAAa,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC;;;;;;;;;;;;;;GAcG;AACH,qBAAa,sBAAsB;IACjC,gDAAgD;IACzC,KAAK,EAAE,OAAO,CAAC;IACtB,4FAA4F;IACrF,KAAK,EAAE,OAAO,CAAC;IACtB,kCAAkC;IAC3B,CAAC,EAAE,MAAM,CAAC;IACjB,yEAAyE;IAClE,gBAAgB,EAAE,MAAM,CAAC;IAChC,mEAAmE;IAC5D,gBAAgB,EAAE,MAAM,CAAC;IAEhC,OAAO;IAOP,8BAA8B;IACvB,UAAU;IAOjB;;OAEG;WACW,MAAM,CAAC,MAAM,CAAC,EAAE,sBAAsB,GAAG,sBAAsB;IAO7E;;OAEG;IACI,gBAAgB,CAAC,KAAK,EAAE,sBAAsB;IAOrD,sCAAsC;IACtC,IAAW,OAAO,IAAI,OAAO,CAE5B;IACD;;OAEG;IACH,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD;;;OAGG;IACH,IAAW,QAAQ,IAAI,eAAe,CAkBrC;CACF;AAED;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B,qDAAqD;IAC9C,MAAM,EAAE,OAAO,EAAE,CAAC;IAEzB,kEAAkE;IAClE,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAEhC;;OAEG;IACH,SAAS,aAAa,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAWvE;;;OAGG;WACW,eAAe,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAO5L,mEAAmE;WACrD,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAM1H,oEAAoE;IAC7D,KAAK,CAAC,MAAM,CAAC,EAAE,mBAAmB,GAAG,mBAAmB;IAI/D,qDAAqD;IACrD,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,uCAAuC;IACvC,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,2CAA2C;IAC3C,IAAW,SAAS,IAAI,MAAM,CAE7B;IAED;;;;;;;;;OASG;IACI,eAAe,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAIrF,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAU;IACpC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAW;IACvC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAW;IACvC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAQ;IAChC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAW;IAEtC;;;;;;;;OAQG;IACI,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,sBAAsB,GAAG,sBAAsB;IAQ/F,kEAAkE;WACpD,yCAAyC,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAIlF,kEAAkE;WACpD,yCAAyC,CAAC,gBAAgB,EAAE,MAAM,GAAG,MAAM;IAIzF;;;;OAIG;WACW,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAI3E;;;;OAIG;WACW,oBAAoB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAI/E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAUnC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAUrC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,UAAU;IAUzB;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAU9B,oFAAoF;IACpF,OAAO,CAAC,MAAM,CAAC,cAAc;IAa7B,yGAAyG;IAClG,kBAAkB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAQrE;;;;;;OAMG;IACH,OAAO,CAAC,uBAAuB;IAU/B;;;;;OAKG;IACI,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG;QAAE,gBAAgB,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE;IA2C/G;;;;;;;;MAQE;IACK,cAAc,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,sBAAsB,GAAG,sBAAsB;IAyB1F;;;;;;;;;MASE;IACK,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,sBAAsB,GAAG,sBAAsB;IAKlH;;;;;OAKG;IACI,kBAAkB,CAAC,QAAQ,EAAE,sBAAsB,EAAE,iBAAiB,GAAE,MAAqC,EAAE,kBAAkB,GAAE,MAA+B,GAAG,OAAO;IA8CnL;OACG;IACI,OAAO,CAAC,KAAK,EAAE,mBAAmB;IAMzC,6HAA6H;IACtH,GAAG,CAAC,MAAM,EAAE,OAAO,GAAG,SAAS,EAAE,MAAM,EAAE,OAAO,GAAG,SAAS,EAAE,MAAM,EAAE,OAAO,GAAG,SAAS;IAQhG;;;OAGG;IACI,mCAAmC,CAAC,KAAK,EAAE,mBAAmB,GAAG,MAAM;IAK9E,2CAA2C;IACpC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAU1C,2CAA2C;IACpC,QAAQ,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAQ1C,+CAA+C;IACxC,YAAY,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAW9C;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAOtD,4DAA4D;IACrD,aAAa,CAAC,KAAK,EAAE,mBAAmB,GAAG,OAAO;IAMzD;;OAEG;IACI,UAAU,CAAC,mBAAmB,EAAE,MAAM,GAAG,MAAM;IAItD;;MAEE;IACK,iBAAiB,CAAC,mBAAmB,EAAE,MAAM,GAAG,MAAM;IAI7D,wFAAwF;IACjF,+BAA+B,CAAC,eAAe,EAAE,MAAM,GAAG,MAAM;IAQvE;;OAEG;IACI,eAAe,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;CAIvG"}