@itwin/core-geometry 4.0.0-dev.4 → 4.0.0-dev.41

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

@@ -1 +1 @@
-{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,6CAAgG;AAChG,yEAAsE;AACtE,iDAAyD;AACzD,+DAAmE;AAEnE,2CAAqF;AACrF,iDAA8C;AAC9C,iCAA8B;AAE9B,6CAA0C;AAC1C,iEAA8D;AAC9D,0CAAuC;AAEvC,+CAA4C;AAC5C,+DAA4D;AAE5D,mDAAgD;AAChD,mCAAgC;AAChC,+CAAuD;AACvD,mEAAkE;AAClE,4FAAyF;AACzF,mDAAgD;AAChD,+CAA4C;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,MAAa,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,qCAAqC;YACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,yCAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,MAAM,YAAY,GAAG,oBAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,yCAAmB,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,qBAAS,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,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,qCAAqC;QACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA5KD,8DA4KC;AAED;;;GAGG;AACH,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,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,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE;YAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;gBACH,MAAM,MAAM,GAAG,eAAO,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,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,YAAY,2BAAY,EAAE;YACxD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YAC1D,qBAAS,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,yBAAW,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,6BAAa,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,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AAvED,kCAuEC;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,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,8BAAkB,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,qBAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,qDAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAE/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,qBAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,qDAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;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,WAAI,EAAE;oBAC5B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;iBACnC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,2BAAY,EAAE;oBAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;iBACjC;aACF;SACF;QAED,MAAM,GAAG,GAAG,aAAK,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,aAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,yBAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,6BAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;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,6BAAa,EAAE;oBAC1C,qBAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;iBACpC;aACF;SACF;QACD,6DAA6D;QAC7D,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,aAAa,CAAC,CAAC;QAClF,MAAM,KAAK,GAAG,qCAAiB,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,oBAAY,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,yCAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE;gBACpB,MAAM,YAAY,GAAG,oBAAY,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,8BAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE;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,yCAAmB,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAnPH,oDAoPC;AApNgB,qCAAgB,GAAG,0BAAQ,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,6BAAa,EAAE;YACzC,yCAAyC;SAC1C;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,aAAK,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,MAAa,cAAc;IAIzB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;;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,yCAAmB,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;AAlCD,wCAkCC;AACD;;GAEG;AACH,MAAa,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,yCAAmB,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;AAjBD,kDAiBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\r\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\r\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\r\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Loop } from \"./Loop\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { AnyRegion } from \"./CurveChain\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { Arc3d } from \"./Arc3d\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\n\r\n/**\r\n * base class for callbacks during region sweeps.\r\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\r\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\r\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\r\n *   * facePathStack[0] is the outermost node of the path from the outer face.\r\n *   * facePathStack[1] is its inside mate.\r\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\r\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\r\n *   * newFaceNode is the entry node (redundant of stack tip)\r\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\r\n *  * At end of component, `finishComponent (node)` is called.\r\n * * The base class is fully implemented to do nothing during the sweep.\r\n * @internal\r\n */\r\nabstract class RegionOpsFaceToFaceSearchCallbacks {\r\n  /** Announce a representative node on the outer face of a component */\r\n  public startComponent(_node: HalfEdge): boolean { return true; }\r\n  /** Announce return to outer face */\r\n  public finishComponent(_node: HalfEdge): boolean { return true; }\r\n  /** Announce face entry */\r\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\r\n  /** Announce face exit */\r\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\r\n}\r\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\r\n * @internal\r\n */\r\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\r\n/** Function signature ot announce classification of a face.\r\n * The `faceType` parameters are\r\n * * -1 for a fully exterior face.  This is a negative area face.\r\n * * 0 for a positive area face classified as \"out\" for the boolean.\r\n * * 1 for a positive area face classified as \"in\" for the boolean.\r\n */\r\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\r\n/**\r\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\r\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\r\n * * This assumes the each node in the graph has edgeTag set to:\r\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\r\n *     * for example, an edge added by regularization\r\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\r\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\r\n * * constructor\r\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\r\n *    * sets the in/out status of both terms to false.\r\n * * `startComponent` marks the entire outer face as `EXTERIOR`\r\n * * `enterFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\r\n *    * if out, set the `EXTERIOR` mask around the face.\r\n * * `leaveFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n * * `finishComponent` is not reimplemented.\r\n * @internal\r\n */\r\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\r\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\r\n  private _inComponent: boolean[];\r\n  private _exteriorMask: HalfEdgeMask;\r\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\r\n    super();\r\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\r\n    this._exteriorMask = exteriorMask;\r\n    this._faceSelectFunction = acceptFaceFunction;\r\n  }\r\n  /** Mark this face as exterior */\r\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   * * if indicated, mark this face exterior.\r\n   */\r\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\r\n      node.setMaskAroundFace(this._exteriorMask);\r\n    return true;\r\n  }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   */\r\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    return true;\r\n  }\r\n}\r\n/**\r\n * Low level graph search for face classification.\r\n * @internal\r\n */\r\nexport class RegionOpsFaceToFaceSearch {\r\n  /**\r\n   * run a DFS with face-to-face step announcements.\r\n   * * false return from any function terminates search immediately.\r\n   * * all reachable nodes assumed to have both visit masks clear.\r\n   * @param graph containing graph.\r\n   * @param seed first node to visit.\r\n   * @param faceHasBeenVisited mask marking faces that have been seen.\r\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\r\n   *\r\n   */\r\n  public static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks) {\r\n    if (seed.isMaskSet(faceHasBeenVisited))\r\n      return;\r\n    if (!callbacks.startComponent(seed))\r\n      return;\r\n    const facePathStack = [];\r\n    seed.setMaskAroundFace(faceHasBeenVisited);\r\n    let faceWalker = seed;\r\n    do {\r\n      let entryNode = faceWalker;\r\n      let mate = faceWalker.edgeMate;\r\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n        // the faceWalker seed is always on the base of the stack.\r\n        // the stack then contains even-odd pairs of (entryNode, currentNode)\r\n        // * entryNode is the node where a face was entered.\r\n        // * faceNode is another node around that face.\r\n        facePathStack.push(faceWalker);\r\n        facePathStack.push(mate);\r\n        let faceNode = mate.faceSuccessor;\r\n        mate.setMaskAroundFace(faceHasBeenVisited);\r\n        entryNode = mate;\r\n        if (callbacks.enterFace(facePathStack, mate)) {\r\n          for (; ;) {\r\n            mate = faceNode.edgeMate;\r\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n              mate.setMaskAroundFace(faceHasBeenVisited);\r\n              if (!callbacks.enterFace(facePathStack, mate))\r\n                return;\r\n              facePathStack.push(faceNode);\r\n              facePathStack.push(mate);\r\n              faceNode = mate;\r\n              entryNode = mate;\r\n            }\r\n            faceNode.setMask(nodeHasBeenVisited);\r\n            faceNode = faceNode.faceSuccessor;\r\n            if (faceNode === entryNode) {\r\n              callbacks.leaveFace(facePathStack, faceNode);\r\n              if (facePathStack.length <= 2) {\r\n                break;\r\n              }\r\n              facePathStack.pop();\r\n              faceNode = facePathStack[facePathStack.length - 1];\r\n              facePathStack.pop();\r\n              entryNode = facePathStack[facePathStack.length - 1];\r\n            }\r\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\r\n              // this is disaster !!!\r\n              return;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      // continue at outermost level .....\r\n      faceWalker = faceWalker.faceSuccessor;\r\n    } while (faceWalker !== seed);\r\n    callbacks.finishComponent(seed);\r\n  }\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * Each of the binary input terms is a collection of loops\r\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   */\r\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\r\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\r\n    if (graphCheckPoint)\r\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\r\n    if (seedA || seedB) {\r\n      // split edges where they cross . . .\r\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\r\n      // sort radially around vertices.\r\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\r\n      // add edges to connect various components  (e.g. holes!!!)\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\r\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n      const faceVisitedMask = graph.grabMask();\r\n      const nodeVisitedMask = graph.grabMask();\r\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\r\n      graph.clearMask(allMasksToClear);\r\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\r\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\r\n      graph.dropMask(faceVisitedMask);\r\n      graph.dropMask(nodeVisitedMask);\r\n      return graph;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * the manyLoopsAndParitySets input is an array.\r\n   * * Each entry is one or more loops.\r\n   * * An entry that is \"just points\" is a simple loop.\r\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\r\n   *    * typically the first is an outer loop an others are holes.\r\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with index to the outer array.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   *   * assign inside/outside by parity within each set and overall union.\r\n   */\r\n  public static doBinaryBooleanBetweenMultiLoopInputs(\r\n    dataA: MultiLineStringDataVariant[],\r\n    opA: RegionGroupOpType,\r\n    binaryOp: RegionBinaryOpType,\r\n    dataB: MultiLineStringDataVariant[],\r\n    opB: RegionGroupOpType,\r\n    purgeSliverExteriorFaces: boolean\r\n  ): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const callbacks = RegionBooleanContext.create(opA, opB);\r\n    callbacks.graph = graph;\r\n    callbacks.faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\r\n\r\n    // Add all the members in groupA ..\r\n    for (const data of dataA) {\r\n      if (data.length > 2){\r\n      const member = new RegionGroupMember(data, callbacks.groupA);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    for (const data of dataB) {\r\n      if (data.length > 2){\r\n      const member = new RegionGroupMember(data, callbacks.groupB);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    // split edges where they cross . . .\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n    // sort radially around vertices.\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n    // add edges to connect various components  (e.g. holes!!!)\r\n    const context = new RegularizationContext(graph);\r\n    context.regularizeGraph(true, true);\r\n    callbacks.runClassificationSweep(binaryOp);\r\n    if (purgeSliverExteriorFaces)\r\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\r\n    return graph;\r\n  }\r\n}\r\n\r\n/**\r\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\r\n * @internal\r\n */\r\nexport enum RegionGroupOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  NonBounding = -1,\r\n}\r\n/**\r\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\r\n * * the Loop or parityRegion object\r\n * * a numeric indication of the sweep state (parity) during the classification search.\r\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\r\n * @internal\r\n */\r\nclass RegionGroupMember {\r\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\r\n  public sweepState: number;\r\n  public parentGroup: RegionGroup;\r\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\r\n    this.region = region;\r\n    this.parentGroup = parentGroup;\r\n    this.sweepState = 0;\r\n  }\r\n  public clearState() { this.sweepState = 0; }\r\n}\r\n/**\r\n * A `RegionGroup` is\r\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\r\n * * The `RegionGroupOpType` to be applied among those members.\r\n * * Pointer to the containing context\r\n * * The count of number of regions known to be \"in\" as the search progresses.\r\n * @internal\r\n */\r\nexport class RegionGroup {\r\n  public members: RegionGroupMember[];\r\n  public groupOpType: RegionGroupOpType;\r\n  public parent: RegionBooleanContext;\r\n  private _numIn: number;\r\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\r\n    this.members = [];\r\n    this.parent = parent;\r\n    this.groupOpType = groupOpType;\r\n    this._numIn = 0;\r\n  }\r\n  /** deep clear of state data -- group header plus all members */\r\n  public clearState() {\r\n    for (const member of this.members)\r\n      member.clearState();\r\n    this._numIn = 0;\r\n  }\r\n  public range(): Range3d {\r\n    const range = Range3d.createNull();\r\n    for (const m of this.members) {\r\n      if (m.region instanceof GeometryQuery)\r\n        m.region.extendRange(range);\r\n      else {\r\n        const range1 = Range3d.createFromVariantData(m.region);\r\n        range.extendRange(range1);\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type.\r\n   */\r\n  public getInOut(): boolean {\r\n    // UNION is true if one or more members are IN\r\n    if (this.groupOpType === RegionGroupOpType.Union)\r\n      return this._numIn > 0;\r\n    // PARITY is true if an odd number of regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Parity)\r\n      return Geometry.isOdd(this._numIn);\r\n    // INTERSECTION is true if ALL the regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Intersection)\r\n      return this._numIn === this.members.length;\r\n    return false;\r\n  }\r\n  // push new members into the group.\r\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\r\n    if (data instanceof Loop || data instanceof ParityRegion) {\r\n      const cleanerData = data.clone() as (ParityRegion | Loop);\r\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\r\n      this.members.push(new RegionGroupMember(cleanerData, this));\r\n    } else if (data instanceof UnionRegion) {\r\n      for (const child of data.children) {\r\n        this.addMember(child);\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      for (const item of data) {\r\n        this.addMember(item);\r\n      }\r\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\r\n      this.members.push(new RegionGroupMember(data, this));\r\n\r\n    }\r\n  }\r\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\r\n  public recordMemberStateChange(oldState: number, newState: number) {\r\n    const oldIn = Geometry.isOdd(oldState);\r\n    const newIn = Geometry.isOdd(newState);\r\n    if (!oldIn && newIn)\r\n      this._numIn++;\r\n    else if (oldIn && !newIn)\r\n      this._numIn--;\r\n  }\r\n}\r\n/**\r\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\r\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\r\n *     are each a composite union, difference, or parity among multiple inputs, i.e.\r\n *   * (operationA among Ai) OP (operationB among Bi)\r\n *   * where the Ai are one set of regions, being combined by operationA\r\n *   * and the Bi are the another set of regions, being combined by operationB\r\n * * Each group of Ai and Bi is a `RegionGroup`\r\n * * This is an extremely delicate structure.\r\n * * Members are public because of the unique variety of queries, but should only be used for queries.\r\n * * The graph and curves in the booleans are connected by an extended pointer chain:\r\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail\r\n *    * (CurveLocationDetail).curve points to a curve\r\n *    * (Curve).parent points to RegionGroupMember\r\n *    * (RegionGroupMember) points to RegionGroup\r\n *    * (RegionGroup) points to RegionBooleanBinaryContext\r\n * * So..when a graph sweep crosses an edge,\r\n *    * the chain leads to a parity count in the RegionGroupMember\r\n *    * that can change the number of members active in the RegionGroup\r\n *    * which can change the state of the context.\r\n * @internal\r\n */\r\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\r\n  public groupA!: RegionGroup;\r\n  public groupB!: RegionGroup;\r\n  public extraGeometry!: RegionGroup;\r\n  public graph!: HalfEdgeGraph;\r\n  public faceAreaFunction!: NodeToNumberFunction;\r\n  public binaryOp: RegionBinaryOpType;\r\n\r\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\r\n    this.groupA = new RegionGroup(this, groupTypeA);\r\n    this.groupB = new RegionGroup(this, groupTypeB);\r\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\r\n    this.binaryOp = RegionBinaryOpType.Union; // it will be revised on can calls.\r\n  }\r\n  /**\r\n   * Create a context with both A and B groups empty.\r\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\r\n   * @param groupTypeA\r\n   * @param groupTypeB\r\n   */\r\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\r\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\r\n  }\r\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\r\n    this.groupA.addMember(dataA);\r\n    this.groupB.addMember(dataB);\r\n    // const doConnectives = 1;\r\n    // if (doConnectives !== 0)\r\n      this.addConnectives();\r\n  }\r\n\r\n  private _workSegment?: LineSegment3d;\r\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\r\n  /**\r\n   * The sweep operations require access to all geometry by edge crossings and face walk.\r\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\r\n   * This method:\r\n   * * finds the total range\r\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\r\n   * * places those lines in the extraGeometry group\r\n   */\r\n  public addConnectives() {\r\n    const rangeA = this.groupA.range();\r\n    const rangeB = this.groupB.range();\r\n    const rangeAB = rangeA.union(rangeB);\r\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\r\n    let margin = 0.1;\r\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\r\n    if (this._workSegment)\r\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\r\n\r\n    const maxPoints: Point3d[] = [];\r\n    const findExtremePointsInLoop = (region: Loop) => {\r\n      const area = RegionOps.computeXYArea(region);\r\n      if (area === undefined || Math.abs(area) < areaTol)\r\n        return;   // avoid bridging trivial faces\r\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\r\n      if (this._workSegment)\r\n        maxPoints.push(this._workSegment.point1Ref);\r\n    };\r\n\r\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\r\n      for (const m of groupMembers) {\r\n        if (m.region instanceof Loop) {\r\n          findExtremePointsInLoop(m.region);\r\n        } else if (m.region instanceof ParityRegion) {\r\n          for (const loop of m.region.children)\r\n            findExtremePointsInLoop(loop);\r\n        }\r\n      }\r\n    }\r\n\r\n    const ray = Ray3d.createZero();\r\n    for (const p of maxPoints) {\r\n      // Make a line from...\r\n      //  1) exactly the max point of the loops to\r\n      //  2) a point clearly outside the big range\r\n      // If p came from some inner loop this will...\r\n      //  1) create a bridge from the inner loop through any containing loops (always)\r\n      //  2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\r\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\r\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\r\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\r\n      this.extraGeometry.addMember(bridgeLine, true);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Markup and assembly steps for geometry in the RegionGroups.\r\n   * * Annotate connection from group to curves.\r\n   *    * groups with point data but no curves get no further annotation.\r\n   * * compute intersections.\r\n   * * assemble and merge the HalfEdgeGraph.\r\n   */\r\n  public annotateAndMergeCurvesInGraph() {\r\n    const allPrimitives: CurvePrimitive[] = [];\r\n    // ASSUME loops have fine-grained types -- no linestrings !!\r\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\r\n      for (const member of group.members) {\r\n        let k = allPrimitives.length;\r\n        if (member.region instanceof GeometryQuery) {\r\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\r\n          for (; k < allPrimitives.length; k++)\r\n            allPrimitives[k].parent = member;\r\n        }\r\n      }\r\n    }\r\n    //    const range = RegionOps.curveArrayRange(allPrimitives);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections);\r\n    this.graph = graph;\r\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\r\n  }\r\n  private _announceFaceFunction?: AnnounceClassifiedFace;\r\n  /**\r\n   * Sweep through the graph to assign in/out classifications to all faces.\r\n   * * the classification is announced in two ways:\r\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\r\n   *   * the announceFaceFunction is called once for each face.\r\n   * @param binaryOp\r\n   * @param announceFaceFunction\r\n   */\r\n  public runClassificationSweep(\r\n    binaryOp: RegionBinaryOpType,\r\n    announceFaceFunction?: AnnounceClassifiedFace) {\r\n    this._announceFaceFunction = announceFaceFunction;\r\n    this.binaryOp = binaryOp;\r\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\r\n    for (const group of [this.groupA, this.groupB]) {\r\n      group.clearState();\r\n    }\r\n    const faceHasBeenVisitedMask = this.graph.grabMask();\r\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\r\n    const componentArray = GraphComponentArray.create(this.graph);\r\n    for (const component of componentArray.components) {\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\r\n      if (exteriorHalfEdge) {\r\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\r\n        this.graph.clearMask(allMasksToClear);\r\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);\r\n      }\r\n    }\r\n    this.graph.dropMask(faceHasBeenVisitedMask);\r\n    this.graph.dropMask(nodeHasBeenVisitedMask);\r\n  }\r\n  // search the graph for faces with\r\n  // .. exactly 2 edges\r\n  // .. both with given mask\r\n  // .. at least one mate is not exterior.\r\n  // .. clear that mark\r\n  public unmaskMaskedNullFaces(mask: number) {\r\n    for (const nodeA of this.graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      if (nodeB.faceSuccessor === nodeA) {\r\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\r\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\r\n            nodeA.clearMask(mask);\r\n            nodeB.clearMask(mask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private getInOut(): boolean {\r\n    if (this.binaryOp === RegionBinaryOpType.Union)\r\n      return this.groupA.getInOut() || this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\r\n      return this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\r\n      return this.groupA.getInOut() && !this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\r\n      return !this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Parity)\r\n      return this.groupA.getInOut() !== this.groupB.getInOut();\r\n    return false;\r\n  }\r\n  /**\r\n   * Record transition across an edge as entry or exit from a RegionGroup.\r\n   * * Work backward from the node to a RegionGroup.  This path can be:\r\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\r\n   *      * node points to CurveLocation Detail\r\n   *      * CurveLocationDetail points to curve\r\n   *      * curve points to RegionGroupMember\r\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\r\n   * @param node\r\n   * @param delta\r\n   */\r\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\r\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\r\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        return member;  // no transition across a bridge edge\r\n      if (delta !== 0) {\r\n        const oldSweepState = member.sweepState;\r\n        member.sweepState += delta;\r\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\r\n      }\r\n      return member;\r\n    };\r\n\r\n    const data = node.edgeTag;\r\n    if (data instanceof RegionGroupMember)\r\n      return updateRegionGroupMemberState(data);\r\n\r\n    if (data instanceof CurveLocationDetail) {\r\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\r\n      const member = data.curve!.parent;\r\n      if (member instanceof RegionGroupMember)\r\n        return updateRegionGroupMemberState(member);\r\n    }\r\n    return undefined;\r\n  }\r\n  // obligations to act as sweep callback ...\r\n  /** Announce a representative node on the outer face of a component */\r\n  public startComponent(outerFaceNode: HalfEdge): boolean {\r\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce return to outer face */\r\n  public finishComponent(_node: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /** Announce entry to a graph face.\r\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\r\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\r\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\r\n   * * Crossing a bridge edge does not change the parity count.\r\n   */\r\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\r\n    const state = this.getInOut();\r\n    if (!state)\r\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce face exit */\r\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\r\n    return true;\r\n  }\r\n}\r\n/** return xy area between a (part of a) curve and the x axis through a reference point.\r\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area\r\n */\r\nfunction areaUnderPartialCurveXY(detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY): number {\r\n  // area between trapezoid and axis\r\n  let trapezoidArea;\r\n  if (detail && detail.point1) {\r\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\r\n  } else {\r\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\r\n  }\r\n  let areaToChord = 0.0;\r\n  if (detail && detail.curve && detail.hasFraction1) {\r\n\r\n    if (detail.curve instanceof LineSegment3d) {\r\n      // ah .. nothing to do for a line segment\r\n    } else if (detail.curve instanceof Arc3d) {\r\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\r\n    }\r\n  }\r\n  return trapezoidArea + areaToChord;\r\n}\r\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves */\r\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\r\n  let area = 0.0;\r\n  let edge = faceSeed;\r\n  do {\r\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\r\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\r\n  return area;\r\n}\r\n\r\n/**\r\n * Function to accumulate area under edges\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\r\n/**\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport class GraphComponent {\r\n  public faces: HalfEdge[];\r\n  public faceAreas: number[];\r\n  public range: Range2d;\r\n  public constructor(faces: HalfEdge[]) {\r\n    this.faces = faces;\r\n    this.range = Range2d.createNull();\r\n    this.faceAreas = [];\r\n  }\r\n  /**\r\n   * visit all vertices and edges in the component to build face area array and composite range.\r\n   *\r\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\r\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\r\n   */\r\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\r\n    const vertexFunction = (node: HalfEdge) => {\r\n      if (extendRangeForEdge)\r\n        extendRangeForEdge(node, this.range);\r\n      else\r\n        this.range.extendXY(node.x, node.y);\r\n      return 0;\r\n    };\r\n    this.range.setNull();\r\n    for (const f of this.faces) {\r\n      f.sumAroundFace(vertexFunction);\r\n    }\r\n    this.faceAreas.length = 0;\r\n    if (!faceAreaFunction)\r\n      faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\r\n    for (const f of this.faces) {\r\n      this.faceAreas.push(faceAreaFunction(f));\r\n    }\r\n  }\r\n}\r\n/** build and hold an array of component data for a HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class GraphComponentArray {\r\n  public components: GraphComponent[];\r\n  public graph: HalfEdgeGraph;\r\n  private constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.components = [];\r\n  }\r\n  public static create(graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void): GraphComponentArray {\r\n    const result = new GraphComponentArray(graph);\r\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    for (const componentFaces of componentArrays) {\r\n      const component = new GraphComponent(componentFaces);\r\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\r\n      result.components.push(component);\r\n    }\r\n    return result;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,6CAAgG;AAChG,yEAAsE;AACtE,iDAAyD;AACzD,+DAAmE;AAEnE,2CAAqF;AACrF,iDAA8C;AAC9C,iCAA8B;AAE9B,6CAA0C;AAC1C,iEAA8D;AAC9D,0CAAuC;AAEvC,+CAA4C;AAC5C,+DAA4D;AAE5D,mDAAgD;AAChD,mCAAgC;AAChC,+CAAuD;AACvD,mEAAkE;AAClE,4FAAyF;AACzF,mDAAgD;AAChD,+CAA4C;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,MAAa,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE;YAClB,qCAAqC;YACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,yCAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,oBAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,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,qBAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,oBAAY,CAAC,aAAa,GAAG,oBAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,yCAAmB,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,qBAAS,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,qBAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;aACrE;SACF;QACD,qCAAqC;QACrC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA9KD,8DA8KC;AAED;;;GAGG;AACH,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,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,MAAa,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,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE;YAC5B,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;gBACH,MAAM,MAAM,GAAG,eAAO,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,mBAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,YAAY,2BAAY,EAAE;YACxD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YAC1D,qBAAS,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,yBAAW,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,6BAAa,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,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AAvED,kCAuEC;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,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,8BAAkB,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,qBAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,qDAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAE/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,qBAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,qDAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;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,WAAI,EAAE;oBAC5B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;iBACnC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,2BAAY,EAAE;oBAC3C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;iBACjC;aACF;SACF;QAED,MAAM,GAAG,GAAG,aAAK,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,aAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,yBAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,6BAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;SAChD;IACH,CAAC;IAED;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,mBAAQ,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,6BAAa,EAAE;oBAC1C,qBAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;iBACpC;aACF;SACF;QACD,6DAA6D;QAC7D,MAAM,aAAa,GAAG,uBAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,qCAAiB,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,oBAAY,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,yCAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE;gBACpB,MAAM,YAAY,GAAG,oBAAY,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,8BAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,8BAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE;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,yCAAmB,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,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,oBAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AApPH,oDAqPC;AArNgB,qCAAgB,GAAG,0BAAQ,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,6BAAa,EAAE;YACzC,yCAAyC;SAC1C;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,aAAK,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,MAAa,cAAc;IAIzB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;;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,yCAAmB,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;AAlCD,wCAkCC;AACD;;GAEG;AACH,MAAa,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,yCAAmB,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;AAjBD,kDAiBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\r\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\r\nimport { MultiLineStringDataVariant } from \"../topology/Triangulation\";\r\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Loop } from \"./Loop\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { AnyRegion } from \"./CurveChain\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { Arc3d } from \"./Arc3d\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\n\r\n/**\r\n * base class for callbacks during region sweeps.\r\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\r\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\r\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\r\n *   * facePathStack[0] is the outermost node of the path from the outer face.\r\n *   * facePathStack[1] is its inside mate.\r\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\r\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\r\n *   * newFaceNode is the entry node (redundant of stack tip)\r\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\r\n *  * At end of component, `finishComponent (node)` is called.\r\n * * The base class is fully implemented to do nothing during the sweep.\r\n * @internal\r\n */\r\nabstract class RegionOpsFaceToFaceSearchCallbacks {\r\n  /** Announce a representative node on the outer face of a component */\r\n  public startComponent(_node: HalfEdge): boolean { return true; }\r\n  /** Announce return to outer face */\r\n  public finishComponent(_node: HalfEdge): boolean { return true; }\r\n  /** Announce face entry */\r\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\r\n  /** Announce face exit */\r\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\r\n}\r\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\r\n * @internal\r\n */\r\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\r\n/** Function signature ot announce classification of a face.\r\n * The `faceType` parameters are\r\n * * -1 for a fully exterior face.  This is a negative area face.\r\n * * 0 for a positive area face classified as \"out\" for the boolean.\r\n * * 1 for a positive area face classified as \"in\" for the boolean.\r\n */\r\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\r\n/**\r\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\r\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\r\n * * This assumes the each node in the graph has edgeTag set to:\r\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\r\n *     * for example, an edge added by regularization\r\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\r\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\r\n * * constructor\r\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\r\n *    * sets the in/out status of both terms to false.\r\n * * `startComponent` marks the entire outer face as `EXTERIOR`\r\n * * `enterFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\r\n *    * if out, set the `EXTERIOR` mask around the face.\r\n * * `leaveFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n * * `finishComponent` is not reimplemented.\r\n * @internal\r\n */\r\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\r\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\r\n  private _inComponent: boolean[];\r\n  private _exteriorMask: HalfEdgeMask;\r\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\r\n    super();\r\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\r\n    this._exteriorMask = exteriorMask;\r\n    this._faceSelectFunction = acceptFaceFunction;\r\n  }\r\n  /** Mark this face as exterior */\r\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   * * if indicated, mark this face exterior.\r\n   */\r\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\r\n      node.setMaskAroundFace(this._exteriorMask);\r\n    return true;\r\n  }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   */\r\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    return true;\r\n  }\r\n}\r\n/**\r\n * Low level graph search for face classification.\r\n * @internal\r\n */\r\nexport class RegionOpsFaceToFaceSearch {\r\n  /**\r\n   * run a DFS with face-to-face step announcements.\r\n   * * false return from any function terminates search immediately.\r\n   * * all reachable nodes assumed to have both visit masks clear.\r\n   * @param graph containing graph.\r\n   * @param seed first node to visit.\r\n   * @param faceHasBeenVisited mask marking faces that have been seen.\r\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\r\n   *\r\n   */\r\n  public static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks) {\r\n    if (seed.isMaskSet(faceHasBeenVisited))\r\n      return;\r\n    if (!callbacks.startComponent(seed))\r\n      return;\r\n    const facePathStack = [];\r\n    seed.setMaskAroundFace(faceHasBeenVisited);\r\n    let faceWalker = seed;\r\n    do {\r\n      let entryNode = faceWalker;\r\n      let mate = faceWalker.edgeMate;\r\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n        // the faceWalker seed is always on the base of the stack.\r\n        // the stack then contains even-odd pairs of (entryNode, currentNode)\r\n        // * entryNode is the node where a face was entered.\r\n        // * faceNode is another node around that face.\r\n        facePathStack.push(faceWalker);\r\n        facePathStack.push(mate);\r\n        let faceNode = mate.faceSuccessor;\r\n        mate.setMaskAroundFace(faceHasBeenVisited);\r\n        entryNode = mate;\r\n        if (callbacks.enterFace(facePathStack, mate)) {\r\n          for (; ;) {\r\n            mate = faceNode.edgeMate;\r\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n              mate.setMaskAroundFace(faceHasBeenVisited);\r\n              if (!callbacks.enterFace(facePathStack, mate))\r\n                return;\r\n              facePathStack.push(faceNode);\r\n              facePathStack.push(mate);\r\n              faceNode = mate;\r\n              entryNode = mate;\r\n            }\r\n            faceNode.setMask(nodeHasBeenVisited);\r\n            faceNode = faceNode.faceSuccessor;\r\n            if (faceNode === entryNode) {\r\n              callbacks.leaveFace(facePathStack, faceNode);\r\n              if (facePathStack.length <= 2) {\r\n                break;\r\n              }\r\n              facePathStack.pop();\r\n              faceNode = facePathStack[facePathStack.length - 1];\r\n              facePathStack.pop();\r\n              entryNode = facePathStack[facePathStack.length - 1];\r\n            }\r\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\r\n              // this is disaster !!!\r\n              return;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      // continue at outermost level .....\r\n      faceWalker = faceWalker.faceSuccessor;\r\n    } while (faceWalker !== seed);\r\n    callbacks.finishComponent(seed);\r\n  }\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * Each of the binary input terms is a collection of loops\r\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   */\r\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\r\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\r\n    if (graphCheckPoint)\r\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\r\n    if (seedA || seedB) {\r\n      // split edges where they cross . . .\r\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\r\n      // sort radially around vertices.\r\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\r\n      // add edges to connect various components  (e.g. holes!!!)\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\r\n      if (exteriorHalfEdge === undefined)\r\n        return undefined;\r\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n      const faceVisitedMask = graph.grabMask();\r\n      const nodeVisitedMask = graph.grabMask();\r\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\r\n      graph.clearMask(allMasksToClear);\r\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\r\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\r\n      graph.dropMask(faceVisitedMask);\r\n      graph.dropMask(nodeVisitedMask);\r\n      return graph;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * the manyLoopsAndParitySets input is an array.\r\n   * * Each entry is one or more loops.\r\n   * * An entry that is \"just points\" is a simple loop.\r\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\r\n   *    * typically the first is an outer loop an others are holes.\r\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with index to the outer array.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   *   * assign inside/outside by parity within each set and overall union.\r\n   */\r\n  public static doBinaryBooleanBetweenMultiLoopInputs(\r\n    dataA: MultiLineStringDataVariant[],\r\n    opA: RegionGroupOpType,\r\n    binaryOp: RegionBinaryOpType,\r\n    dataB: MultiLineStringDataVariant[],\r\n    opB: RegionGroupOpType,\r\n    purgeSliverExteriorFaces: boolean\r\n  ): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const callbacks = RegionBooleanContext.create(opA, opB);\r\n    callbacks.graph = graph;\r\n    callbacks.faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\r\n\r\n    // Add all the members in groupA ..\r\n    for (const data of dataA) {\r\n      if (data.length > 2){\r\n      const member = new RegionGroupMember(data, callbacks.groupA);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    for (const data of dataB) {\r\n      if (data.length > 2){\r\n      const member = new RegionGroupMember(data, callbacks.groupB);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    // split edges where they cross . . .\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n    // sort radially around vertices.\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n    // add edges to connect various components  (e.g. holes!!!)\r\n    const context = new RegularizationContext(graph);\r\n    context.regularizeGraph(true, true);\r\n    callbacks.runClassificationSweep(binaryOp);\r\n    if (purgeSliverExteriorFaces)\r\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\r\n    return graph;\r\n  }\r\n}\r\n\r\n/**\r\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\r\n * @internal\r\n */\r\nexport enum RegionGroupOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  NonBounding = -1,\r\n}\r\n/**\r\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\r\n * * the Loop or parityRegion object\r\n * * a numeric indication of the sweep state (parity) during the classification search.\r\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\r\n * @internal\r\n */\r\nclass RegionGroupMember {\r\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\r\n  public sweepState: number;\r\n  public parentGroup: RegionGroup;\r\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\r\n    this.region = region;\r\n    this.parentGroup = parentGroup;\r\n    this.sweepState = 0;\r\n  }\r\n  public clearState() { this.sweepState = 0; }\r\n}\r\n/**\r\n * A `RegionGroup` is\r\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\r\n * * The `RegionGroupOpType` to be applied among those members.\r\n * * Pointer to the containing context\r\n * * The count of number of regions known to be \"in\" as the search progresses.\r\n * @internal\r\n */\r\nexport class RegionGroup {\r\n  public members: RegionGroupMember[];\r\n  public groupOpType: RegionGroupOpType;\r\n  public parent: RegionBooleanContext;\r\n  private _numIn: number;\r\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\r\n    this.members = [];\r\n    this.parent = parent;\r\n    this.groupOpType = groupOpType;\r\n    this._numIn = 0;\r\n  }\r\n  /** deep clear of state data -- group header plus all members */\r\n  public clearState() {\r\n    for (const member of this.members)\r\n      member.clearState();\r\n    this._numIn = 0;\r\n  }\r\n  public range(): Range3d {\r\n    const range = Range3d.createNull();\r\n    for (const m of this.members) {\r\n      if (m.region instanceof GeometryQuery)\r\n        m.region.extendRange(range);\r\n      else {\r\n        const range1 = Range3d.createFromVariantData(m.region);\r\n        range.extendRange(range1);\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type.\r\n   */\r\n  public getInOut(): boolean {\r\n    // UNION is true if one or more members are IN\r\n    if (this.groupOpType === RegionGroupOpType.Union)\r\n      return this._numIn > 0;\r\n    // PARITY is true if an odd number of regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Parity)\r\n      return Geometry.isOdd(this._numIn);\r\n    // INTERSECTION is true if ALL the regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Intersection)\r\n      return this._numIn === this.members.length;\r\n    return false;\r\n  }\r\n  // push new members into the group.\r\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\r\n    if (data instanceof Loop || data instanceof ParityRegion) {\r\n      const cleanerData = data.clone() as (ParityRegion | Loop);\r\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\r\n      this.members.push(new RegionGroupMember(cleanerData, this));\r\n    } else if (data instanceof UnionRegion) {\r\n      for (const child of data.children) {\r\n        this.addMember(child);\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      for (const item of data) {\r\n        this.addMember(item);\r\n      }\r\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\r\n      this.members.push(new RegionGroupMember(data, this));\r\n\r\n    }\r\n  }\r\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\r\n  public recordMemberStateChange(oldState: number, newState: number) {\r\n    const oldIn = Geometry.isOdd(oldState);\r\n    const newIn = Geometry.isOdd(newState);\r\n    if (!oldIn && newIn)\r\n      this._numIn++;\r\n    else if (oldIn && !newIn)\r\n      this._numIn--;\r\n  }\r\n}\r\n/**\r\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\r\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\r\n *     are each a composite union, difference, or parity among multiple inputs, i.e.\r\n *   * (operationA among Ai) OP (operationB among Bi)\r\n *   * where the Ai are one set of regions, being combined by operationA\r\n *   * and the Bi are the another set of regions, being combined by operationB\r\n * * Each group of Ai and Bi is a `RegionGroup`\r\n * * This is an extremely delicate structure.\r\n * * Members are public because of the unique variety of queries, but should only be used for queries.\r\n * * The graph and curves in the booleans are connected by an extended pointer chain:\r\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail\r\n *    * (CurveLocationDetail).curve points to a curve\r\n *    * (Curve).parent points to RegionGroupMember\r\n *    * (RegionGroupMember) points to RegionGroup\r\n *    * (RegionGroup) points to RegionBooleanBinaryContext\r\n * * So..when a graph sweep crosses an edge,\r\n *    * the chain leads to a parity count in the RegionGroupMember\r\n *    * that can change the number of members active in the RegionGroup\r\n *    * which can change the state of the context.\r\n * @internal\r\n */\r\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\r\n  public groupA!: RegionGroup;\r\n  public groupB!: RegionGroup;\r\n  public extraGeometry!: RegionGroup;\r\n  public graph!: HalfEdgeGraph;\r\n  public faceAreaFunction!: NodeToNumberFunction;\r\n  public binaryOp: RegionBinaryOpType;\r\n\r\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\r\n    this.groupA = new RegionGroup(this, groupTypeA);\r\n    this.groupB = new RegionGroup(this, groupTypeB);\r\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\r\n    this.binaryOp = RegionBinaryOpType.Union; // it will be revised on can calls.\r\n  }\r\n  /**\r\n   * Create a context with both A and B groups empty.\r\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\r\n   * @param groupTypeA\r\n   * @param groupTypeB\r\n   */\r\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\r\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\r\n  }\r\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\r\n    this.groupA.addMember(dataA);\r\n    this.groupB.addMember(dataB);\r\n    // const doConnectives = 1;\r\n    // if (doConnectives !== 0)\r\n      this.addConnectives();\r\n  }\r\n\r\n  private _workSegment?: LineSegment3d;\r\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\r\n  /**\r\n   * The sweep operations require access to all geometry by edge crossings and face walk.\r\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\r\n   * This method:\r\n   * * finds the total range\r\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\r\n   * * places those lines in the extraGeometry group\r\n   */\r\n  public addConnectives() {\r\n    const rangeA = this.groupA.range();\r\n    const rangeB = this.groupB.range();\r\n    const rangeAB = rangeA.union(rangeB);\r\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\r\n    let margin = 0.1;\r\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\r\n    if (this._workSegment)\r\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\r\n\r\n    const maxPoints: Point3d[] = [];\r\n    const findExtremePointsInLoop = (region: Loop) => {\r\n      const area = RegionOps.computeXYArea(region);\r\n      if (area === undefined || Math.abs(area) < areaTol)\r\n        return;   // avoid bridging trivial faces\r\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\r\n      if (this._workSegment)\r\n        maxPoints.push(this._workSegment.point1Ref);\r\n    };\r\n\r\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\r\n      for (const m of groupMembers) {\r\n        if (m.region instanceof Loop) {\r\n          findExtremePointsInLoop(m.region);\r\n        } else if (m.region instanceof ParityRegion) {\r\n          for (const loop of m.region.children)\r\n            findExtremePointsInLoop(loop);\r\n        }\r\n      }\r\n    }\r\n\r\n    const ray = Ray3d.createZero();\r\n    for (const p of maxPoints) {\r\n      // Make a line from...\r\n      //  1) exactly the max point of the loops to\r\n      //  2) a point clearly outside the big range\r\n      // If p came from some inner loop this will...\r\n      //  1) create a bridge from the inner loop through any containing loops (always)\r\n      //  2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\r\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\r\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\r\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\r\n      this.extraGeometry.addMember(bridgeLine, true);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Markup and assembly steps for geometry in the RegionGroups.\r\n   * * Annotate connection from group to curves.\r\n   *    * groups with point data but no curves get no further annotation.\r\n   * * compute intersections.\r\n   * * assemble and merge the HalfEdgeGraph.\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   */\r\n  public annotateAndMergeCurvesInGraph(mergeTolerance: number = Geometry.smallMetricDistance) {\r\n    const allPrimitives: CurvePrimitive[] = [];\r\n    // ASSUME loops have fine-grained types -- no linestrings !!\r\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\r\n      for (const member of group.members) {\r\n        let k = allPrimitives.length;\r\n        if (member.region instanceof GeometryQuery) {\r\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\r\n          for (; k < allPrimitives.length; k++)\r\n            allPrimitives[k].parent = member;\r\n        }\r\n      }\r\n    }\r\n    //    const range = RegionOps.curveArrayRange(allPrimitives);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections);\r\n    this.graph = graph;\r\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\r\n  }\r\n  private _announceFaceFunction?: AnnounceClassifiedFace;\r\n  /**\r\n   * Sweep through the graph to assign in/out classifications to all faces.\r\n   * * the classification is announced in two ways:\r\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\r\n   *   * the announceFaceFunction is called once for each face.\r\n   * @param binaryOp\r\n   * @param announceFaceFunction\r\n   */\r\n  public runClassificationSweep(\r\n    binaryOp: RegionBinaryOpType,\r\n    announceFaceFunction?: AnnounceClassifiedFace) {\r\n    this._announceFaceFunction = announceFaceFunction;\r\n    this.binaryOp = binaryOp;\r\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\r\n    for (const group of [this.groupA, this.groupB]) {\r\n      group.clearState();\r\n    }\r\n    const faceHasBeenVisitedMask = this.graph.grabMask();\r\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\r\n    const componentArray = GraphComponentArray.create(this.graph);\r\n    for (const component of componentArray.components) {\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\r\n      if (exteriorHalfEdge) {\r\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\r\n        this.graph.clearMask(allMasksToClear);\r\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);\r\n      }\r\n    }\r\n    this.graph.dropMask(faceHasBeenVisitedMask);\r\n    this.graph.dropMask(nodeHasBeenVisitedMask);\r\n  }\r\n  // search the graph for faces with\r\n  // .. exactly 2 edges\r\n  // .. both with given mask\r\n  // .. at least one mate is not exterior.\r\n  // .. clear that mark\r\n  public unmaskMaskedNullFaces(mask: number) {\r\n    for (const nodeA of this.graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      if (nodeB.faceSuccessor === nodeA) {\r\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\r\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\r\n            nodeA.clearMask(mask);\r\n            nodeB.clearMask(mask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private getInOut(): boolean {\r\n    if (this.binaryOp === RegionBinaryOpType.Union)\r\n      return this.groupA.getInOut() || this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\r\n      return this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\r\n      return this.groupA.getInOut() && !this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\r\n      return !this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Parity)\r\n      return this.groupA.getInOut() !== this.groupB.getInOut();\r\n    return false;\r\n  }\r\n  /**\r\n   * Record transition across an edge as entry or exit from a RegionGroup.\r\n   * * Work backward from the node to a RegionGroup.  This path can be:\r\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\r\n   *      * node points to CurveLocation Detail\r\n   *      * CurveLocationDetail points to curve\r\n   *      * curve points to RegionGroupMember\r\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\r\n   * @param node\r\n   * @param delta\r\n   */\r\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\r\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\r\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        return member;  // no transition across a bridge edge\r\n      if (delta !== 0) {\r\n        const oldSweepState = member.sweepState;\r\n        member.sweepState += delta;\r\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\r\n      }\r\n      return member;\r\n    };\r\n\r\n    const data = node.edgeTag;\r\n    if (data instanceof RegionGroupMember)\r\n      return updateRegionGroupMemberState(data);\r\n\r\n    if (data instanceof CurveLocationDetail) {\r\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\r\n      const member = data.curve!.parent;\r\n      if (member instanceof RegionGroupMember)\r\n        return updateRegionGroupMemberState(member);\r\n    }\r\n    return undefined;\r\n  }\r\n  // obligations to act as sweep callback ...\r\n  /** Announce a representative node on the outer face of a component */\r\n  public startComponent(outerFaceNode: HalfEdge): boolean {\r\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce return to outer face */\r\n  public finishComponent(_node: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /** Announce entry to a graph face.\r\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\r\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\r\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\r\n   * * Crossing a bridge edge does not change the parity count.\r\n   */\r\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\r\n    const state = this.getInOut();\r\n    if (!state)\r\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce face exit */\r\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\r\n    return true;\r\n  }\r\n}\r\n/** return xy area between a (part of a) curve and the x axis through a reference point.\r\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area\r\n */\r\nfunction areaUnderPartialCurveXY(detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY): number {\r\n  // area between trapezoid and axis\r\n  let trapezoidArea;\r\n  if (detail && detail.point1) {\r\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\r\n  } else {\r\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\r\n  }\r\n  let areaToChord = 0.0;\r\n  if (detail && detail.curve && detail.hasFraction1) {\r\n\r\n    if (detail.curve instanceof LineSegment3d) {\r\n      // ah .. nothing to do for a line segment\r\n    } else if (detail.curve instanceof Arc3d) {\r\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\r\n    }\r\n  }\r\n  return trapezoidArea + areaToChord;\r\n}\r\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves */\r\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\r\n  let area = 0.0;\r\n  let edge = faceSeed;\r\n  do {\r\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\r\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\r\n  return area;\r\n}\r\n\r\n/**\r\n * Function to accumulate area under edges\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\r\n/**\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport class GraphComponent {\r\n  public faces: HalfEdge[];\r\n  public faceAreas: number[];\r\n  public range: Range2d;\r\n  public constructor(faces: HalfEdge[]) {\r\n    this.faces = faces;\r\n    this.range = Range2d.createNull();\r\n    this.faceAreas = [];\r\n  }\r\n  /**\r\n   * visit all vertices and edges in the component to build face area array and composite range.\r\n   *\r\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\r\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\r\n   */\r\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\r\n    const vertexFunction = (node: HalfEdge) => {\r\n      if (extendRangeForEdge)\r\n        extendRangeForEdge(node, this.range);\r\n      else\r\n        this.range.extendXY(node.x, node.y);\r\n      return 0;\r\n    };\r\n    this.range.setNull();\r\n    for (const f of this.faces) {\r\n      f.sumAroundFace(vertexFunction);\r\n    }\r\n    this.faceAreas.length = 0;\r\n    if (!faceAreaFunction)\r\n      faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;\r\n    for (const f of this.faces) {\r\n      this.faceAreas.push(faceAreaFunction(f));\r\n    }\r\n  }\r\n}\r\n/** build and hold an array of component data for a HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class GraphComponentArray {\r\n  public components: GraphComponent[];\r\n  public graph: HalfEdgeGraph;\r\n  private constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.components = [];\r\n  }\r\n  public static create(graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void): GraphComponentArray {\r\n    const result = new GraphComponentArray(graph);\r\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    for (const componentFaces of componentArrays) {\r\n      const component = new GraphComponent(componentFaces);\r\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\r\n      result.components.push(component);\r\n    }\r\n    return result;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/StrokeOptions.js

@@ -56,10 +56,9 @@ class StrokeOptions {
     get hasMaxEdgeLength() { return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0; }
     /** Return a deep clone  */
     clone() {
-        var _a;
         const options = new StrokeOptions();
         options.chordTol = this.chordTol;
-        options.angleTol = (_a = this.angleTol) === null || _a === void 0 ? void 0 : _a.clone();
+        options.angleTol = this.angleTol?.clone();
         options.maxEdgeLength = this.maxEdgeLength;
         options.needConvexFacets = this.needConvexFacets;
         options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;

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

@@ -1 +1 @@
-{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,aAAa;IAA1B;QAYE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QAe1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IA+HnC,CAAC;IA3IC,oCAAoC;IACpC,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtG,IAAW,UAAU,CAAC,KAAc,IAAI,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC;IACnE,oCAAoC;IACpC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzG,IAAW,WAAW,CAAC,KAAc,IAAI,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC;IACrE,qCAAqC;IACrC,IAAW,YAAY,KAAc,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5G,IAAW,YAAY,CAAC,KAAc,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC;IAKvE,mCAAmC;IACnC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAClH,mCAAmC;IACnC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;IAChG,wCAAwC;IACxC,IAAW,gBAAgB,KAAc,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,CAAC;IAE/G,2BAA2B;IACpB,KAAK;;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,MAAA,IAAI,CAAC,QAAQ,0CAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACjD,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,aAAa,CAAC,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QACjI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QACvG,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;OAEG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;OACG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AA5JD,sCA4JC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/** tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n * * angle is the angle between two contiguous strokes or across a facet edge.\r\n * * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n *\r\n * It is rare for all three to be active at once:\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n * * * For curves, 15 degrees is typical\r\n * * * For facets, 22.5 degrees is typical.\r\n * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n\r\n  /** distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /** caller expects convex facets.  */\r\n  public needConvexFacets?: boolean;\r\n  /** minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean { return this._needParams !== undefined ? this._needParams : false; }\r\n  public set needParams(value: boolean) { this._needParams = value; }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean { return this._needNormals !== undefined ? this._needNormals : false; }\r\n  public set needNormals(value: boolean) { this._needNormals = value; }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean { return this._needTwoSided !== undefined ? this._needTwoSided : false; }\r\n  public set needTwoSided(value: boolean) { this._needTwoSided = value; }\r\n  /** optional color request flag */\r\n  public needColors?: boolean;\r\n  /** default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean { return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0; }\r\n  /** ask if chordTol is specified */\r\n  public get hasChordTol(): boolean { return this.chordTol !== undefined && this.chordTol > 0.0; }\r\n  /** ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean { return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0; }\r\n\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.needConvexFacets = this.needConvexFacets;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    return options;\r\n  }\r\n\r\n  /** return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n\r\n  /**\r\n   * return stroke count which is the larger of the existing count or count needed for angle condition for given sweepRadians\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance from the options.\r\n   */\r\n  public static applyAngleTol(options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(options: StrokeOptions | undefined, minCount: number, edgeLength: number): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength, chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n\r\n  /** return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** return stroke count which is the larger of existing count or count needed for circular arc chord tol with given arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n\r\n  /** return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n\r\n  /** create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /** create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,aAAa;IAA1B;QAYE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QAe1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IA+HnC,CAAC;IA3IC,oCAAoC;IACpC,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtG,IAAW,UAAU,CAAC,KAAc,IAAI,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC;IACnE,oCAAoC;IACpC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzG,IAAW,WAAW,CAAC,KAAc,IAAI,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC,CAAC,CAAC;IACrE,qCAAqC;IACrC,IAAW,YAAY,KAAc,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5G,IAAW,YAAY,CAAC,KAAc,IAAI,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC;IAKvE,mCAAmC;IACnC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAClH,mCAAmC;IACnC,IAAW,WAAW,KAAc,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC;IAChG,wCAAwC;IACxC,IAAW,gBAAgB,KAAc,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,CAAC;IAE/G,2BAA2B;IACpB,KAAK;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACjD,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,aAAa,CAAC,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QACjI,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QACvG,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;OAEG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;OACG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AA5JD,sCA4JC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/** tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n * * angle is the angle between two contiguous strokes or across a facet edge.\r\n * * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n *\r\n * It is rare for all three to be active at once:\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n * * * For curves, 15 degrees is typical\r\n * * * For facets, 22.5 degrees is typical.\r\n * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n\r\n  /** distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /** caller expects convex facets.  */\r\n  public needConvexFacets?: boolean;\r\n  /** minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean { return this._needParams !== undefined ? this._needParams : false; }\r\n  public set needParams(value: boolean) { this._needParams = value; }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean { return this._needNormals !== undefined ? this._needNormals : false; }\r\n  public set needNormals(value: boolean) { this._needNormals = value; }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean { return this._needTwoSided !== undefined ? this._needTwoSided : false; }\r\n  public set needTwoSided(value: boolean) { this._needTwoSided = value; }\r\n  /** optional color request flag */\r\n  public needColors?: boolean;\r\n  /** default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean { return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0; }\r\n  /** ask if chordTol is specified */\r\n  public get hasChordTol(): boolean { return this.chordTol !== undefined && this.chordTol > 0.0; }\r\n  /** ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean { return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0; }\r\n\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.needConvexFacets = this.needConvexFacets;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    return options;\r\n  }\r\n\r\n  /** return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n\r\n  /**\r\n   * return stroke count which is the larger of the existing count or count needed for angle condition for given sweepRadians\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance from the options.\r\n   */\r\n  public static applyAngleTol(options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(options: StrokeOptions | undefined, minCount: number, edgeLength: number): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength, chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n\r\n  /** return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** return stroke count which is the larger of existing count or count needed for circular arc chord tol with given arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n\r\n  /** return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n\r\n  /** create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /** create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/spiral/DirectSpiral3d.js

@@ -322,8 +322,7 @@ class DirectSpiral3d extends TransitionSpiral3d_1.TransitionSpiral3d {
     }
     /** Deep clone of this spiral */
     clone() {
-        var _a, _b;
-        return new DirectSpiral3d(this.localToWorld.clone(), this._spiralType, (_a = this.designProperties) === null || _a === void 0 ? void 0 : _a.clone(), this._nominalL1, this._nominalR1, (_b = this._activeFractionInterval) === null || _b === void 0 ? void 0 : _b.clone(), this._evaluator.clone());
+        return new DirectSpiral3d(this.localToWorld.clone(), this._spiralType, this.designProperties?.clone(), this._nominalL1, this._nominalR1, this._activeFractionInterval?.clone(), this._evaluator.clone());
     }
     /** apply `transform` to this spiral's local to world transform. */
     tryTransformInPlace(transformA) {

package/lib/cjs/curve/spiral/DirectSpiral3d.js.map

@@ -1 +1 @@
-{"version":3,"file":"DirectSpiral3d.js","sourceRoot":"","sources":["../../../../src/curve/spiral/DirectSpiral3d.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,6CAA0C;AAO1C,0DAAuD;AAEvD,+EAA4E;AAC5E,kDAA+C;AAC/C,oDAAiD;AACjD,mFAAgF;AAChF,qDAA6D;AAC7D,iEAAsF;AACtF,uFAAoF;AACpF,qFAA4E;AAC5E,6EAAoE;AAEpE,6DAA0D;AAG1D;;;;;;;;;;;;;;;EAeE;AACF,MAAa,cAAe,SAAQ,uCAAkB;IA+BpD,sEAAsE;IACtE,iEAAiE;IACjE,YACE,YAAuB,EACvB,UAA8B,EAC9B,kBAA+D,EAC/D,SAAiB,EACjB,SAAiB,EACjB,sBAA6C,EAC7C,SAA2B;QAC3B,KAAK,CAAC,UAAU,EAAE,YAAY,EAAE,sBAAsB,EAAE,kBAAkB,CAAC,CAAC;QAvC9E,wCAAwC;QAExB,uBAAkB,GAAG,kBAAkB,CAAC;QAsCtD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,yFAAyF;QACzF,IAAI,CAAC,yBAAyB,EAAE,CAAC;IACnC,CAAC;IApCD,0EAA0E;IAC1E,IAAW,aAAa,KAAmB,OAAO,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAMlI,qCAAqC;IACrC,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,+DAA+D;IAC/D,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,uCAAuC;IACvC,IAAW,iBAAiB,KAAa,OAAO,uCAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACxG;;OAEG;IACH,IAAW,SAAS,KAAuB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAqBpE;;;;;OAKG;IACK,cAAc,CAAC,OAAqB,EAAE,SAAiB,EAAE,SAAiB,EAAE,WAAmB,EAAE,oBAA6B,IAAI;QACxI,IAAI,WAAW,GAAG,CAAC;YACjB,WAAW,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,mBAAmB,EAAE,CAAC;QAC9B,OAAO,CAAC,oBAAoB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,cAAe,CAAC;QAC1C,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,WAAW,EAAE,SAAS,CAAC,CAAC;YAC7E,MAAM,oBAAoB,GAAG,QAAQ,GAAG,qBAAqB,CAAC;YAC9D,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,EAChE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC,CAAC,4CAA4C;SAC/F;QACD,IAAI,iBAAiB;YACnB,OAAO,CAAC,mBAAmB,CAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,SAAS,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,aAAa,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC,kDAAkD;QAC9G,IAAI,aAAa,EAAE,SAAS,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE;YACrC,SAAS,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;YACnD,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,iCAAiC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxG,SAAS,CAAC,wBAAwB,CAAC,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;YAChE,SAAS,GAAG,SAAS,CAAC;YACtB,aAAa,GAAG,aAAa,CAAC;SAC/B;IAEH,CAAC;IACD,wBAAwB;IACR,yBAAyB;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC;QACzB,MAAM,WAAW,GAAG,6BAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;QACzF,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAC5D,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,GAAG,WAAW,CAAC,CAAC;QAChG,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,uBAAuB,CAAC,EAAE,EAAE,IAAI,CAAC,uBAAuB,CAAC,EAAE,EACvG,iBAAiB,CAAC,CAAC;IACvB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,UAAkB,EAClB,YAAuB,EACvB,QAAgB,EAAE,QAAgB,EAClC,kBAA+D,EAC/D,SAAiB,EAAE,SAAiB,EACpC,cAAqC;QACrC,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,MAAM,SAAS,GAAG,IAAI,0CAAyB,CAAC,SAAS,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,GAAG,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACpH,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,UAAU,EACV,kBAAkB,EAClB,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,eAAe,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAC5H,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,gBAAgB,CAC5B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,2CAAoB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,OAAO,EACP,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,aAAa,CACzB,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,6CAAsB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACtE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,SAAS,EACT,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,qBAAqB,CACjC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,yDAAwB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,iBAAiB,EACjB,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,iBAAiB,CAC7B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,iDAAoB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,aAAa,EACb,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,oBAAoB,CAChC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,6DAA6B,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,oBAAoB,EACpB,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAEM,MAAM,CAAC,sBAAsB,CAClC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EACzF,IAAI,iEAA+B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,WAAW,CACvB,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IACpH,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,kBAAkB,CAC9B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAC3H,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,mBAAmB,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAChI,CAAC;IACD;;;;;;;;;;;;;;;;;;OAkBG;IACI,MAAM,CAAC,yBAAyB,CACrC,UAAkB,EAClB,OAA2B,EAC3B,OAA2B,EAC3B,QAA2B,EAC3B,SAA4B,EAC5B,SAA6B,EAC7B,cAAqC,EACrC,YAAuB;QACvB,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,YAAY;YAClD,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,KAAK,SAAS,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC;YAClE,OAAO,SAAS,CAAC;QACnB,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC5E,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC;YACxD,OAAO,IAAI,CAAC,kBAAkB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACnF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,eAAe,CAAC;YACzD,OAAO,IAAI,CAAC,mBAAmB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACpF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,YAAY,CAAC;YACtD,OAAO,IAAI,CAAC,sBAAsB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACvF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC;YACjD,OAAO,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACjF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC;YACnD,OAAO,IAAI,CAAC,aAAa,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC9E,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,oBAAoB,CAAC;YAC9D,OAAO,IAAI,CAAC,oBAAoB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACrF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB,CAAC;YAC3D,OAAO,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACtF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,mBAAmB,CAAC;YAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACxF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,aAAa,CAAC;YACvD,OAAO,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAClF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gCAAgC;IAChB,KAAK;;QACnB,OAAO,IAAI,cAAc,CACvB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EACzB,IAAI,CAAC,WAAW,EAChB,MAAA,IAAI,CAAC,gBAAgB,0CAAE,KAAK,EAAE,EAC9B,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,EACf,MAAA,IAAI,CAAC,uBAAuB,0CAAE,KAAK,EAAE,EACrC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,mEAAmE;IAC5D,mBAAmB,CAAC,UAAqB;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAC;QAC7D,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;SAC9C;QACD,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qCAAqC;IACrB,UAAU,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACjF,mCAAmC;IACnB,QAAQ,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7E,mFAAmF;IAC5E,SAAS,CAAC,KAAmC;QAClD,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,MAAiB,CAAC;eAC3D,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;eACzF,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD;;OAEG;IACI,WAAW;QAChB,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,cAAe,CAAC;QACzD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QAC9B,OAAO,YAAY,CAAC,yBAAyB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IACD;;OAEG;IACH,gGAAgG;IAChG,6DAA6D;IACtD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,cAAc,CAAC,CAAC,CAAC;IAC3F;;;OAGG;IACI,WAAW,CAAC,IAAkB,EAAE,OAAuB,IAAU,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACxH,+CAA+C;IACxC,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QAErC,kFAAkF;QAClF,IAAI,eAAe,GAAG,GAAG,CAAC;QAC1B,IAAI,eAAe,GAAG,GAAG,CAAC;QAC1B,IAAI,IAAI,YAAY,uCAAkB,EAAE;YACtC,IAAI,IAAI,CAAC,YAAY,GAAG,GAAG;gBACzB,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC;YACtC,IAAI,IAAI,CAAC,YAAY,GAAG,GAAG;gBACzB,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC;SACvC;QAED,IAAI,CAAC,IAAI,aAAa,CAAC,SAAS,EAAE;YAChC,IAAI,CAAC,qCAAqC,CAAC,IAAI,EAAE,CAAC,GAAG,aAAa,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;;YAElH,IAAI,CAAC,qCAAqC,CAAC,IAAI,EAAE,CAAC,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;QAExF,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IAEI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,CAAC;QACd,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACjE,IAAI,OAAO,EAAE;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvC,SAAS,GAAG,OAAO,CAAC,oBAAoB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YAC/D,SAAS,GAAG,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YACtE,SAAS,GAAG,OAAO,CAAC,2BAA2B,CAAC,SAAS,CAAC,CAAC;SAC5D;aAAM;YACL,SAAS,GAAG,6BAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;SAC7E;QACD,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,GAAG,SAAS,CAAC,CAAC;QAChF,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IAEI,cAAc;QACnB,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS;YACnC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QACpD,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,CAAC;IACvC,CAAC;IACD,qDAAqD;IAC9C,eAAe,CAAC,cAAsB,EAAE,MAAgB;QAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,4BAA4B,CAAC,cAAsB,EAAE,MAAc;QACxE,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,4BAA4B,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAC9E,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,uBAAuB,CAAC,WAAW,EAAE,CAAC,CAAC;QAC1E,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IAEI,8BAA8B,CAAC,cAAsB,EAAE,MAAkC;QAC9F,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,EAAE,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mFAAmF;IAC5E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,4CAA4C;IAC5B,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,cAAc,EAAE;YACnC,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;mBAC9D,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;mBAC5D,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,CAAC;mBACnD,IAAI,CAAC,uBAAuB,CAAC,aAAa,CAAC,KAAK,CAAC,uBAAuB,CAAC;mBACzE,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;SACtD;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA1iBD,wCA0iBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Segment1d } from \"../../geometry3d/Segment1d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { CurveLengthContext } from \"../internalContexts/CurveLengthContext\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\nimport { AustralianRailCorpXYEvaluator } from \"./AustralianRailCorpXYEvaluator\";\r\nimport { ClothoidSeriesRLEvaluator } from \"./ClothoidSeries\";\r\nimport { CzechSpiralEvaluator, ItalianSpiralEvaluator } from \"./CzechSpiralEvaluator\";\r\nimport { DirectHalfCosineSpiralEvaluator } from \"./DirectHalfCosineSpiralEvaluator\";\r\nimport { MXCubicAlongArcEvaluator } from \"./MXCubicAlongArcSpiralEvaluator\";\r\nimport { PolishCubicEvaluator } from \"./PolishCubicSpiralEvaluator\";\r\nimport { TransitionConditionalProperties } from \"./TransitionConditionalProperties\";\r\nimport { TransitionSpiral3d } from \"./TransitionSpiral3d\";\r\nimport { XYCurveEvaluator } from \"./XYCurveEvaluator\";\r\n\r\n/**\r\n* DirectSpiral3d acts like a TransitionSpiral3d for serialization purposes, but implements spiral types that have \"direct\" xy calculations without the integrations required\r\n* for IntegratedSpiral3d.\r\n* * Each DirectSpiral3d carries an XYCurveEvaluator to give it specialized behavior.\r\n* * Direct spirals that flow through serialization to native imodel02 are create with these static methods:\r\n*   * createArema\r\n*   * createJapaneseCubic\r\n*   * createAustralianRail\r\n*   * createDirectHalfCosine\r\n*   * createChineseCubic\r\n*   * createCzechCubic\r\n*   * createPolishCubic\r\n*   * createItalian\r\n*   * createWesternAustralian\r\n* @public\r\n*/\r\nexport class DirectSpiral3d extends TransitionSpiral3d {\r\n\r\n  /** String name for schema properties */\r\n\r\n  public readonly curvePrimitiveType = \"transitionSpiral\";\r\n\r\n  /** stroked approximation of entire spiral. This is AFTER the localToWorld transform ... */\r\n  private _globalStrokes: LineString3d;\r\n  /** stroked approximation of active spiral.  This is AFTER the localToWorld transfomr ...\r\n   * * Same count as global -- possibly overly fine, but it gives some consistency between same clothoid constructed as partial versus complete.\r\n   * * If no trimming, this points to the same place as the _globalStrokes !!!  Don't double transform!!!\r\n   */\r\n  private _activeStrokes?: LineString3d;\r\n  /** Return the internal stroked form of the (possibly partial) spiral   */\r\n  public get activeStrokes(): LineString3d { return this._activeStrokes !== undefined ? this._activeStrokes : this._globalStrokes; }\r\n\r\n  private _nominalL1: number;\r\n  private _nominalR1: number;\r\n  private _evaluator: XYCurveEvaluator;\r\n\r\n  /** Return the nominal end radius. */\r\n  public get nominalR1(): number { return this._nominalR1; }\r\n  /** Return the nominal distance from inflection to endpoint. */\r\n  public get nominalL1(): number { return this._nominalL1; }\r\n  /** Return the nominal end curvature */\r\n  public get nominalCurvature1(): number { return TransitionSpiral3d.radiusToCurvature(this._nominalR1); }\r\n  /** Return the low level evaluator\r\n   * @internal\r\n   */\r\n  public get evaluator(): XYCurveEvaluator { return this._evaluator; }\r\n\r\n  // constructor demands radius1 and distance1 for nominal construction.\r\n  // caller is responsible for managing intervals of partial spiral\r\n  constructor(\r\n    localToWorld: Transform,\r\n    spiralType: string | undefined,\r\n    originalProperties: TransitionConditionalProperties | undefined,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeFractionInterval: Segment1d | undefined,\r\n    evaluator: XYCurveEvaluator) {\r\n    super(spiralType, localToWorld, activeFractionInterval, originalProperties);\r\n    this._nominalL1 = nominalL1;\r\n    this._nominalR1 = nominalR1;\r\n    this._evaluator = evaluator;\r\n    this._globalStrokes = LineString3d.create();\r\n    this._activeStrokes = LineString3d.create();\r\n    // initialize for compiler -- but this will be recomputed in refreshComputeProperties ...\r\n    this.refreshComputedProperties();\r\n  }\r\n  /**\r\n   * Compute stroke data in an interval.\r\n   * @param strokes strokes to clear and refill.\r\n   * @param fraction0 start fraction\r\n   * @param fraction1 end fraction\r\n   */\r\n  private computeStrokes(strokes: LineString3d, fractionA: number, fractionB: number, numInterval: number, applyLocalToWorld: boolean = true) {\r\n    if (numInterval < 1)\r\n      numInterval = 1;\r\n    strokes.clear();\r\n    strokes.ensureEmptyUVParams();\r\n    strokes.ensureEmptyFractions();\r\n    const distances = strokes.packedUVParams!;\r\n    const nominalIntervalLength = Math.abs(fractionB - fractionA) * this._nominalL1;\r\n    for (let i = 0; i <= numInterval; i++) {\r\n      const fraction = Geometry.interpolate(fractionA, i / numInterval, fractionB);\r\n      const nominalDistanceAlong = fraction * nominalIntervalLength;\r\n      strokes.packedPoints.pushXYZ(this._evaluator.fractionToX(fraction),\r\n        this._evaluator.fractionToY(fraction), 0);\r\n      distances.pushXY(fraction, nominalDistanceAlong); // the second distance will be updated below\r\n    }\r\n    if (applyLocalToWorld)\r\n      strokes.tryTransformInPlace (this._localToWorld);\r\n    let fraction0 = distances.getXAtUncheckedPointIndex(0);\r\n    let trueDistance0 = distances.getYAtUncheckedPointIndex(0); // whatever was assigned as start distance is fine\r\n    let trueDistance1, fraction1;\r\n    for (let i = 1; i <= numInterval; i++) {\r\n      fraction1 = distances.getXAtUncheckedPointIndex(i);\r\n      trueDistance1 = trueDistance0 + this._evaluator.integrateDistanceBetweenFractions(fraction0, fraction1);\r\n      distances.setXYAtCheckedPointIndex(i, fraction1, trueDistance1);\r\n      fraction0 = fraction1;\r\n      trueDistance0 = trueDistance1;\r\n    }\r\n\r\n  }\r\n  /** Recompute strokes */\r\n  public override refreshComputedProperties() {\r\n    const sweepRadians = this.nominalL1 / (2.0 * this.nominalR1);\r\n    const radiansStep = 0.02;\r\n    const numInterval = StrokeOptions.applyAngleTol(undefined, 4, sweepRadians, radiansStep);\r\n    this.computeStrokes(this._globalStrokes, 0, 1, numInterval);\r\n    const numActiveInterval = Math.ceil(this._activeFractionInterval.absoluteDelta() * numInterval);\r\n    this._activeStrokes = LineString3d.create();\r\n    this.computeStrokes(this._activeStrokes, this._activeFractionInterval.x0, this._activeFractionInterval.x1,\r\n      numActiveInterval);\r\n  }\r\n  /**\r\n   * Create a spiral object which uses numXTerm terms from the clothoid X series and numYTerm from the clothoid Y series.\r\n   * @param numXTerm  number of terms to use from X series\r\n   * @param numYTerm number of terms to use from Y series\r\n   * @param localToWorld placement frame.  Inflection point is at origin, initial direction is along x axis.\r\n   * @param nominalL1 design distance from inflection to end point.\r\n   * @param nominalR1 design radius at end point.\r\n   * @param activeInterval active interval (as fractions of nominalL1 !!!)\r\n   */\r\n  public static createTruncatedClothoid(\r\n    spiralType: string,\r\n    localToWorld: Transform,\r\n    numXTerm: number, numYTerm: number,\r\n    originalProperties: TransitionConditionalProperties | undefined,\r\n    nominalL1: number, nominalR1: number,\r\n    activeInterval: Segment1d | undefined): DirectSpiral3d | undefined {\r\n    if (numXTerm < 1)\r\n      numXTerm = 1;\r\n    if (numYTerm < 1)\r\n      numYTerm = 1;\r\n    const evaluator = new ClothoidSeriesRLEvaluator(nominalL1, 1.0 / (2.0 * nominalL1 * nominalR1), numXTerm, numYTerm);\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      spiralType,\r\n      originalProperties,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n  /**\r\n   * Create an Japanese spiral clothoid approximation\r\n   *   * X is 1 terms of the clothoid series as a function of nominal distance along.\r\n   *   * Y is 1 terms f the clothoid series as a function of nominal distance along.\r\n   *   * Remark: This is identical to the ChineseCubic\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createJapaneseCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"JapaneseCubic\", localToWorld, 1, 1, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create a czech cubic.\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * @param localToWorld\r\n   * @param nominalLx nominal length along x axis\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createCzechCubic(\r\n    localToWorld: Transform,\r\n    nominalLx: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = CzechSpiralEvaluator.create(nominalLx, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"Czech\",\r\n      undefined,\r\n      nominalLx, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n  /**\r\n   * Create an italian spiral\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * * L in gamma and m is the\r\n   * @param localToWorld\r\n   * @param nominalL1 nominal length along the spiral\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createItalian(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = ItalianSpiralEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"Italian\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create an MX Cubic whose nominal length is close to along the curve.\r\n   * This is y= m*x^3 with\r\n   * * m is 1/ (6RL1)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   * * L1 is an along-the-x-axis distance that is slightly LESS THAN the nominal length\r\n   * * x is axis position that is slightly LESS than nominal distance along\r\n   * * L1, x use the approximation   `x = s * ( 1 - s^4/ (40 R R L L))\r\n   * @param localToWorld\r\n   * @param nominalL1\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createMXCubicAlongArc(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = MXCubicAlongArcEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"MXCubicAlongArc\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create a polish cubic\r\n   * This is y= m*x^3 with\r\n   * * m is 1/ (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   * * L is nominal length\r\n   * * R is nominal end radius.\r\n   * * x ranges up to the x axis distance for which the polish distance series produces f(x)=L\r\n   * * The support class PolishCubicEvaluator has static methods for the distance series and its inversion.\r\n   */\r\n  public static createPolishCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = PolishCubicEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"PolishCubic\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create an AustralianRailCorp spiral\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * @param localToWorld\r\n   * @param nominalL1\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createAustralianRail(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = AustralianRailCorpXYEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"AustralianRailCorp\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  public static createDirectHalfCosine(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return new this(localToWorld, \"HalfCosine\", undefined, nominalL1, nominalR1, activeInterval,\r\n      new DirectHalfCosineSpiralEvaluator(nominalL1, nominalR1));\r\n  }\r\n  /**\r\n   * Create an Arema spiral clothoid approximation\r\n   *   * X is 2 terms of the clothoid series as a function of nominal distance along\r\n   *   * Y is 2 terms f the clothoid series as a function of nominal distance along\r\n   *   * Remark: This is identical to the ChineseCubic\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createArema(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"Arema\", localToWorld, 2, 2, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n\r\n  /**\r\n   * Create a Chinese clothoid approximation\r\n   *   * X is 2 terms of the clothoid series as a function of nominal distance along\r\n   *   * Y is 2 terms f the clothoid series as a function of nominal distance along\r\n   *   * Remark: This is identical to the Arema spiral\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createChineseCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"ChineseCubic\", localToWorld, 2, 2, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create a Western Australian direct spiral.\r\n   *   * X is 2 terms of the clothoid series as a function of distance along\r\n   *   * Y is 1 term (cubic in nominal distance along)\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createWesternAustralian(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"WesternAustralian\", localToWorld, 2, 1, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create (if possible) a DirectSpiral3d, applying various strict conditions appropriate to the spiral type.\r\n   * The parameter list includes extraneous values in order to directly match IntegratedSpiral3d.create, which has greater flexibility about\r\n   *    mixtures of values.\r\n   * * IMPORTANT RESTRICTIONS\r\n   *   * Direct spirals must have the inflection at the origin of their coordinate system, aligned with the x axis.\r\n   *      * hence bearing0 = 0\r\n   *      * hence radius0 = 0\r\n   *   * bearing1 is ignored\r\n   *   * radius1 must be given.\r\n   *   * arcLength must be given,\r\n   * @param spiralType one of the types in `DirectSpiralTypeNames`\r\n   * @param radius0 radius (or 0 for tangent to line) at start.   Must be ZERO or UNDEFINED\r\n   * @param radius1 radius (or 0 for tangent to line) at end.\r\n   * @param bearing0 bearing, measured CCW from x axis at start.   Must be ZERO or UNDEFINED\r\n   * @param bearing1 bearing, measured CCW from x axis at end.    IGNORED.\r\n   * @param fractionInterval optional fractional interval for an \"active\" portion of the curve.   if omitted, the full [0,1] is used.\r\n   * @param localToWorld placement transform\r\n   */\r\n  public static createFromLengthAndRadius(\r\n    spiralType: string,\r\n    radius0: number | undefined,\r\n    radius1: number | undefined,\r\n    bearing0: Angle | undefined,\r\n    _bearing1: Angle | undefined,\r\n    arcLength: number | undefined,\r\n    activeInterval: undefined | Segment1d,\r\n    localToWorld: Transform): TransitionSpiral3d | undefined {\r\n    if (bearing0 !== undefined && !bearing0.isAlmostZero)\r\n      return undefined;\r\n    if (radius0 !== undefined && !Geometry.isSmallMetricDistance(radius0))\r\n      return undefined;\r\n    if (radius1 === undefined || Geometry.isSmallMetricDistance(radius1))\r\n      return undefined;\r\n    if (arcLength === undefined)\r\n      return undefined;\r\n    if (Geometry.equalStringNoCase(spiralType, \"Arema\"))\r\n      return this.createArema(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"ChineseCubic\"))\r\n      return this.createChineseCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"JapaneseCubic\"))\r\n      return this.createJapaneseCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"HalfCosine\"))\r\n      return this.createDirectHalfCosine(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"Czech\"))\r\n      return this.createCzechCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"Italian\"))\r\n      return this.createItalian(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"AustralianRailCorp\"))\r\n      return this.createAustralianRail(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"MXCubicAlongArc\"))\r\n      return this.createMXCubicAlongArc(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"WesternAustralian\"))\r\n      return this.createWesternAustralian(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"PolishCubic\"))\r\n      return this.createPolishCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    return undefined;\r\n  }\r\n  /** Deep clone of this spiral */\r\n  public override clone(): DirectSpiral3d {\r\n    return new DirectSpiral3d(\r\n      this.localToWorld.clone(),\r\n      this._spiralType,\r\n      this.designProperties?.clone(),\r\n      this._nominalL1,\r\n      this._nominalR1,\r\n      this._activeFractionInterval?.clone(),\r\n      this._evaluator.clone());\r\n  }\r\n\r\n  /** apply `transform` to this spiral's local to world transform. */\r\n  public tryTransformInPlace(transformA: Transform): boolean {\r\n    const rigidData = this.applyRigidPartOfTransform(transformA);\r\n    if (rigidData !== undefined) {\r\n      this._nominalL1 *= rigidData.scale;\r\n      this._nominalR1 *= rigidData.scale;\r\n      this.evaluator.scaleInPlace(rigidData.scale);\r\n    }\r\n    this.refreshComputedProperties();\r\n    return true;\r\n  }\r\n\r\n  /** Return the spiral start point. */\r\n  public override startPoint(): Point3d { return this.activeStrokes.startPoint(); }\r\n  /** return the spiral end point. */\r\n  public override endPoint(): Point3d { return this.activeStrokes.endPoint(); }\r\n  /** test if the local to world transform places the spiral xy plane into `plane` */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    return plane.isPointInPlane(this.localToWorld.origin as Point3d)\r\n      && Geometry.isSameCoordinate(0.0, this.localToWorld.matrix.dotColumnX(plane.getNormalRef()))\r\n      && Geometry.isSameCoordinate(0.0, this.localToWorld.matrix.dotColumnY(plane.getNormalRef()));\r\n  }\r\n  /** Return quick length of the spiral.\r\n   * The tangent vector of a true clothoid is length 1 everywhere, so simple proportion of nominalL1 is a good approximation.\r\n   */\r\n  public quickLength() {\r\n    const distanceData = this._globalStrokes.packedUVParams!;\r\n    const n = distanceData.length;\r\n    return distanceData.getYAtUncheckedPointIndex(n - 1);\r\n  }\r\n  /** Return length of the spiral.\r\n   * * True length is stored at back of uvParams . . .\r\n   */\r\n  //   use the generic integrator ... public override curveLength() { return this.quickLength(); }\r\n  /** Test if `other` is an instance of `TransitionSpiral3d` */\r\n  public isSameGeometryClass(other: any): boolean { return other instanceof DirectSpiral3d; }\r\n  /** Add strokes from this spiral to `dest`.\r\n   * * Linestrings will usually stroke as just their points.\r\n   * * If maxEdgeLength is given, this will sub-stroke within the linestring -- not what we want.\r\n   */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void { this.activeStrokes.emitStrokes(dest, options); }\r\n  /** emit stroke fragments to `dest` handler. */\r\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n    const n = this.computeStrokeCountForOptions(options);\r\n    const activeStrokes = this.activeStrokes;\r\n    dest.startParentCurvePrimitive(this);\r\n\r\n    // hack: specify the extended range so we can compute length of an extended spiral\r\n    let globalFraction0 = 0.0;\r\n    let globalFraction1 = 1.0;\r\n    if (dest instanceof CurveLengthContext) {\r\n      if (dest.getFraction0 < 0.0)\r\n        globalFraction0 = dest.getFraction0;\r\n      if (dest.getFraction1 > 1.0)\r\n        globalFraction1 = dest.getFraction1;\r\n    }\r\n\r\n    if (n <= activeStrokes.numPoints())\r\n      dest.announceIntervalForUniformStepStrokes(this, 2 * activeStrokes.numPoints(), globalFraction0, globalFraction1);\r\n    else\r\n      dest.announceIntervalForUniformStepStrokes(this, n, globalFraction0, globalFraction1);\r\n\r\n    dest.endParentCurvePrimitive(this);\r\n  }\r\n\r\n  /**\r\n   * return the stroke count required for given options.\r\n   * @param options StrokeOptions that determine count\r\n   */\r\n\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    let numStroke;\r\n    const nominalRadians = this._nominalL1 / (2.0 * this._nominalR1);\r\n    if (options) {\r\n      const rMin = Math.abs(this._nominalR1);\r\n      numStroke = options.applyTolerancesToArc(rMin, nominalRadians);\r\n      numStroke = options.applyMaxEdgeLength(numStroke, this.quickLength());\r\n      numStroke = options.applyMinStrokesPerPrimitive(numStroke);\r\n    } else {\r\n      numStroke = StrokeOptions.applyAngleTol(undefined, 4, nominalRadians, 0.02);\r\n    }\r\n    numStroke = Math.ceil(this._activeFractionInterval.absoluteDelta() * numStroke);\r\n    return numStroke;\r\n  }\r\n\r\n  /** Reverse the active interval and active strokes.\r\n   * * Primary defining data remains unchanged !!!\r\n   */\r\n\r\n  public reverseInPlace(): void {\r\n    this._activeFractionInterval.reverseInPlace();\r\n    if (this._activeStrokes === undefined)\r\n      this._activeStrokes = this._globalStrokes.clone();\r\n    this._activeStrokes.reverseInPlace();\r\n  }\r\n  /** Evaluate curve point with respect to fraction. */\r\n  public fractionToPoint(activeFraction: number, result?: Point3d): Point3d {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPoint(globalFraction, result);\r\n    this.localToWorld.multiplyPoint3d(result, result);\r\n    return result;\r\n  }\r\n  /** Evaluate curve point and derivative with respect to fraction. */\r\n  public fractionToPointAndDerivative(activeFraction: number, result?: Ray3d): Ray3d {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPointAndDerivative(globalFraction, result);\r\n    result.direction.scaleInPlace(this._activeFractionInterval.signedDelta());\r\n    result.transformInPlace(this.localToWorld);\r\n    return result;\r\n  }\r\n\r\n  /** Return a plane with\r\n   *\r\n   * * origin at fractional position along the curve\r\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to the fraction.\r\n   * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n   */\r\n\r\n  public fractionToPointAnd2Derivatives(activeFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors | undefined {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPointAnd2Derivatives(globalFraction, result);\r\n    const a = this._activeFractionInterval.signedDelta();\r\n    result.vectorU.scaleInPlace(a);\r\n    result.vectorV.scaleInPlace(a * a);\r\n    result.transformInPlace(this.localToWorld);\r\n    return result;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleTransitionSpiral(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleTransitionSpiral(this);\r\n  }\r\n  /** compare various coordinate quantities */\r\n  public override isAlmostEqual(other: any): boolean {\r\n    if (other instanceof DirectSpiral3d) {\r\n      return Geometry.isSameCoordinate(this._nominalL1, other._nominalL1)\r\n        && Geometry.isSameCoordinate(this._nominalR1, other._nominalR1)\r\n        && this.localToWorld.isAlmostEqual(other.localToWorld)\r\n        && this._activeFractionInterval.isAlmostEqual(other._activeFractionInterval)\r\n        && this._evaluator.isAlmostEqual(other._evaluator);\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"DirectSpiral3d.js","sourceRoot":"","sources":["../../../../src/curve/spiral/DirectSpiral3d.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,6CAA0C;AAO1C,0DAAuD;AAEvD,+EAA4E;AAC5E,kDAA+C;AAC/C,oDAAiD;AACjD,mFAAgF;AAChF,qDAA6D;AAC7D,iEAAsF;AACtF,uFAAoF;AACpF,qFAA4E;AAC5E,6EAAoE;AAEpE,6DAA0D;AAG1D;;;;;;;;;;;;;;;EAeE;AACF,MAAa,cAAe,SAAQ,uCAAkB;IA+BpD,sEAAsE;IACtE,iEAAiE;IACjE,YACE,YAAuB,EACvB,UAA8B,EAC9B,kBAA+D,EAC/D,SAAiB,EACjB,SAAiB,EACjB,sBAA6C,EAC7C,SAA2B;QAC3B,KAAK,CAAC,UAAU,EAAE,YAAY,EAAE,sBAAsB,EAAE,kBAAkB,CAAC,CAAC;QAvC9E,wCAAwC;QAExB,uBAAkB,GAAG,kBAAkB,CAAC;QAsCtD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,yFAAyF;QACzF,IAAI,CAAC,yBAAyB,EAAE,CAAC;IACnC,CAAC;IApCD,0EAA0E;IAC1E,IAAW,aAAa,KAAmB,OAAO,IAAI,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAMlI,qCAAqC;IACrC,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,+DAA+D;IAC/D,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC1D,uCAAuC;IACvC,IAAW,iBAAiB,KAAa,OAAO,uCAAkB,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACxG;;OAEG;IACH,IAAW,SAAS,KAAuB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAqBpE;;;;;OAKG;IACK,cAAc,CAAC,OAAqB,EAAE,SAAiB,EAAE,SAAiB,EAAE,WAAmB,EAAE,oBAA6B,IAAI;QACxI,IAAI,WAAW,GAAG,CAAC;YACjB,WAAW,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,CAAC,mBAAmB,EAAE,CAAC;QAC9B,OAAO,CAAC,oBAAoB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,OAAO,CAAC,cAAe,CAAC;QAC1C,MAAM,qBAAqB,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,WAAW,EAAE,SAAS,CAAC,CAAC;YAC7E,MAAM,oBAAoB,GAAG,QAAQ,GAAG,qBAAqB,CAAC;YAC9D,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,EAChE,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,oBAAoB,CAAC,CAAC,CAAC,4CAA4C;SAC/F;QACD,IAAI,iBAAiB;YACnB,OAAO,CAAC,mBAAmB,CAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACnD,IAAI,SAAS,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,aAAa,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC,kDAAkD;QAC9G,IAAI,aAAa,EAAE,SAAS,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,WAAW,EAAE,CAAC,EAAE,EAAE;YACrC,SAAS,GAAG,SAAS,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC;YACnD,aAAa,GAAG,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,iCAAiC,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACxG,SAAS,CAAC,wBAAwB,CAAC,CAAC,EAAE,SAAS,EAAE,aAAa,CAAC,CAAC;YAChE,SAAS,GAAG,SAAS,CAAC;YACtB,aAAa,GAAG,aAAa,CAAC;SAC/B;IAEH,CAAC;IACD,wBAAwB;IACR,yBAAyB;QACvC,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,IAAI,CAAC;QACzB,MAAM,WAAW,GAAG,6BAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;QACzF,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC;QAC5D,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,GAAG,WAAW,CAAC,CAAC;QAChG,IAAI,CAAC,cAAc,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,uBAAuB,CAAC,EAAE,EAAE,IAAI,CAAC,uBAAuB,CAAC,EAAE,EACvG,iBAAiB,CAAC,CAAC;IACvB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,UAAkB,EAClB,YAAuB,EACvB,QAAgB,EAAE,QAAgB,EAClC,kBAA+D,EAC/D,SAAiB,EAAE,SAAiB,EACpC,cAAqC;QACrC,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,MAAM,SAAS,GAAG,IAAI,0CAAyB,CAAC,SAAS,EAAE,GAAG,GAAG,CAAC,GAAG,GAAG,SAAS,GAAG,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACpH,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,UAAU,EACV,kBAAkB,EAClB,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,mBAAmB,CAC/B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,eAAe,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAC5H,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,gBAAgB,CAC5B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,2CAAoB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,OAAO,EACP,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,aAAa,CACzB,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,6CAAsB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACtE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,SAAS,EACT,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,qBAAqB,CACjC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,yDAAwB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACxE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,iBAAiB,EACjB,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,iBAAiB,CAC7B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,iDAAoB,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,aAAa,EACb,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,oBAAoB,CAChC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,MAAM,SAAS,GAAG,6DAA6B,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC7E,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,cAAc,CACvB,YAAY,CAAC,KAAK,EAAE,EACpB,oBAAoB,EACpB,SAAS,EACT,SAAS,EAAE,SAAS,EACpB,cAAc,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACjF,CAAC;IAEM,MAAM,CAAC,sBAAsB,CAClC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,IAAI,CAAC,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,EACzF,IAAI,iEAA+B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;IAC/D,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,WAAW,CACvB,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IACpH,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,kBAAkB,CAC9B,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAC3H,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,YAAuB,EACvB,SAAiB,EACjB,SAAiB,EACjB,cAA0B;QAC1B,OAAO,IAAI,CAAC,uBAAuB,CAAC,mBAAmB,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,cAAc,CAAC,CAAC;IAChI,CAAC;IACD;;;;;;;;;;;;;;;;;;OAkBG;IACI,MAAM,CAAC,yBAAyB,CACrC,UAAkB,EAClB,OAA2B,EAC3B,OAA2B,EAC3B,QAA2B,EAC3B,SAA4B,EAC5B,SAA6B,EAC7B,cAAqC,EACrC,YAAuB;QACvB,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,YAAY;YAClD,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,KAAK,SAAS,IAAI,CAAC,mBAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,IAAI,OAAO,KAAK,SAAS,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC;YAClE,OAAO,SAAS,CAAC;QACnB,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC;YACjD,OAAO,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC5E,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,cAAc,CAAC;YACxD,OAAO,IAAI,CAAC,kBAAkB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACnF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,eAAe,CAAC;YACzD,OAAO,IAAI,CAAC,mBAAmB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACpF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,YAAY,CAAC;YACtD,OAAO,IAAI,CAAC,sBAAsB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACvF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,CAAC;YACjD,OAAO,IAAI,CAAC,gBAAgB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACjF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC;YACnD,OAAO,IAAI,CAAC,aAAa,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAC9E,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,oBAAoB,CAAC;YAC9D,OAAO,IAAI,CAAC,oBAAoB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACrF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,iBAAiB,CAAC;YAC3D,OAAO,IAAI,CAAC,qBAAqB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACtF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,mBAAmB,CAAC;YAC7D,OAAO,IAAI,CAAC,uBAAuB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QACxF,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,UAAU,EAAE,aAAa,CAAC;YACvD,OAAO,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC;QAClF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gCAAgC;IAChB,KAAK;QACnB,OAAO,IAAI,cAAc,CACvB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,EACzB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,gBAAgB,EAAE,KAAK,EAAE,EAC9B,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,uBAAuB,EAAE,KAAK,EAAE,EACrC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,mEAAmE;IAC5D,mBAAmB,CAAC,UAAqB;QAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,yBAAyB,CAAC,UAAU,CAAC,CAAC;QAC7D,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC,KAAK,CAAC;YACnC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;SAC9C;QACD,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qCAAqC;IACrB,UAAU,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACjF,mCAAmC;IACnB,QAAQ,KAAc,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC7E,mFAAmF;IAC5E,SAAS,CAAC,KAAmC;QAClD,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,MAAiB,CAAC;eAC3D,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;eACzF,mBAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD;;OAEG;IACI,WAAW;QAChB,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,cAAe,CAAC;QACzD,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;QAC9B,OAAO,YAAY,CAAC,yBAAyB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IACD;;OAEG;IACH,gGAAgG;IAChG,6DAA6D;IACtD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,cAAc,CAAC,CAAC,CAAC;IAC3F;;;OAGG;IACI,WAAW,CAAC,IAAkB,EAAE,OAAuB,IAAU,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;IACxH,+CAA+C;IACxC,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;QAErC,kFAAkF;QAClF,IAAI,eAAe,GAAG,GAAG,CAAC;QAC1B,IAAI,eAAe,GAAG,GAAG,CAAC;QAC1B,IAAI,IAAI,YAAY,uCAAkB,EAAE;YACtC,IAAI,IAAI,CAAC,YAAY,GAAG,GAAG;gBACzB,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC;YACtC,IAAI,IAAI,CAAC,YAAY,GAAG,GAAG;gBACzB,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC;SACvC;QAED,IAAI,CAAC,IAAI,aAAa,CAAC,SAAS,EAAE;YAChC,IAAI,CAAC,qCAAqC,CAAC,IAAI,EAAE,CAAC,GAAG,aAAa,CAAC,SAAS,EAAE,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;;YAElH,IAAI,CAAC,qCAAqC,CAAC,IAAI,EAAE,CAAC,EAAE,eAAe,EAAE,eAAe,CAAC,CAAC;QAExF,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IAEI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,CAAC;QACd,MAAM,cAAc,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;QACjE,IAAI,OAAO,EAAE;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvC,SAAS,GAAG,OAAO,CAAC,oBAAoB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;YAC/D,SAAS,GAAG,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;YACtE,SAAS,GAAG,OAAO,CAAC,2BAA2B,CAAC,SAAS,CAAC,CAAC;SAC5D;aAAM;YACL,SAAS,GAAG,6BAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;SAC7E;QACD,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,GAAG,SAAS,CAAC,CAAC;QAChF,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IAEI,cAAc;QACnB,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS;YACnC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QACpD,IAAI,CAAC,cAAc,CAAC,cAAc,EAAE,CAAC;IACvC,CAAC;IACD,qDAAqD;IAC9C,eAAe,CAAC,cAAsB,EAAE,MAAgB;QAC7D,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QACjE,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAClD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,4BAA4B,CAAC,cAAsB,EAAE,MAAc;QACxE,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,4BAA4B,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAC9E,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,uBAAuB,CAAC,WAAW,EAAE,CAAC,CAAC;QAC1E,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IAEI,8BAA8B,CAAC,cAAsB,EAAE,MAAkC;QAC9F,MAAM,cAAc,GAAG,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,cAAc,CAAC,CAAC;QACpF,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,EAAE,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,mFAAmF;IAC5E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IACD,4CAA4C;IAC5B,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,cAAc,EAAE;YACnC,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;mBAC9D,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;mBAC5D,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,CAAC;mBACnD,IAAI,CAAC,uBAAuB,CAAC,aAAa,CAAC,KAAK,CAAC,uBAAuB,CAAC;mBACzE,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;SACtD;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA1iBD,wCA0iBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Segment1d } from \"../../geometry3d/Segment1d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { CurveLengthContext } from \"../internalContexts/CurveLengthContext\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { StrokeOptions } from \"../StrokeOptions\";\r\nimport { AustralianRailCorpXYEvaluator } from \"./AustralianRailCorpXYEvaluator\";\r\nimport { ClothoidSeriesRLEvaluator } from \"./ClothoidSeries\";\r\nimport { CzechSpiralEvaluator, ItalianSpiralEvaluator } from \"./CzechSpiralEvaluator\";\r\nimport { DirectHalfCosineSpiralEvaluator } from \"./DirectHalfCosineSpiralEvaluator\";\r\nimport { MXCubicAlongArcEvaluator } from \"./MXCubicAlongArcSpiralEvaluator\";\r\nimport { PolishCubicEvaluator } from \"./PolishCubicSpiralEvaluator\";\r\nimport { TransitionConditionalProperties } from \"./TransitionConditionalProperties\";\r\nimport { TransitionSpiral3d } from \"./TransitionSpiral3d\";\r\nimport { XYCurveEvaluator } from \"./XYCurveEvaluator\";\r\n\r\n/**\r\n* DirectSpiral3d acts like a TransitionSpiral3d for serialization purposes, but implements spiral types that have \"direct\" xy calculations without the integrations required\r\n* for IntegratedSpiral3d.\r\n* * Each DirectSpiral3d carries an XYCurveEvaluator to give it specialized behavior.\r\n* * Direct spirals that flow through serialization to native imodel02 are create with these static methods:\r\n*   * createArema\r\n*   * createJapaneseCubic\r\n*   * createAustralianRail\r\n*   * createDirectHalfCosine\r\n*   * createChineseCubic\r\n*   * createCzechCubic\r\n*   * createPolishCubic\r\n*   * createItalian\r\n*   * createWesternAustralian\r\n* @public\r\n*/\r\nexport class DirectSpiral3d extends TransitionSpiral3d {\r\n\r\n  /** String name for schema properties */\r\n\r\n  public readonly curvePrimitiveType = \"transitionSpiral\";\r\n\r\n  /** stroked approximation of entire spiral. This is AFTER the localToWorld transform ... */\r\n  private _globalStrokes: LineString3d;\r\n  /** stroked approximation of active spiral.  This is AFTER the localToWorld transfomr ...\r\n   * * Same count as global -- possibly overly fine, but it gives some consistency between same clothoid constructed as partial versus complete.\r\n   * * If no trimming, this points to the same place as the _globalStrokes !!!  Don't double transform!!!\r\n   */\r\n  private _activeStrokes?: LineString3d;\r\n  /** Return the internal stroked form of the (possibly partial) spiral   */\r\n  public get activeStrokes(): LineString3d { return this._activeStrokes !== undefined ? this._activeStrokes : this._globalStrokes; }\r\n\r\n  private _nominalL1: number;\r\n  private _nominalR1: number;\r\n  private _evaluator: XYCurveEvaluator;\r\n\r\n  /** Return the nominal end radius. */\r\n  public get nominalR1(): number { return this._nominalR1; }\r\n  /** Return the nominal distance from inflection to endpoint. */\r\n  public get nominalL1(): number { return this._nominalL1; }\r\n  /** Return the nominal end curvature */\r\n  public get nominalCurvature1(): number { return TransitionSpiral3d.radiusToCurvature(this._nominalR1); }\r\n  /** Return the low level evaluator\r\n   * @internal\r\n   */\r\n  public get evaluator(): XYCurveEvaluator { return this._evaluator; }\r\n\r\n  // constructor demands radius1 and distance1 for nominal construction.\r\n  // caller is responsible for managing intervals of partial spiral\r\n  constructor(\r\n    localToWorld: Transform,\r\n    spiralType: string | undefined,\r\n    originalProperties: TransitionConditionalProperties | undefined,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeFractionInterval: Segment1d | undefined,\r\n    evaluator: XYCurveEvaluator) {\r\n    super(spiralType, localToWorld, activeFractionInterval, originalProperties);\r\n    this._nominalL1 = nominalL1;\r\n    this._nominalR1 = nominalR1;\r\n    this._evaluator = evaluator;\r\n    this._globalStrokes = LineString3d.create();\r\n    this._activeStrokes = LineString3d.create();\r\n    // initialize for compiler -- but this will be recomputed in refreshComputeProperties ...\r\n    this.refreshComputedProperties();\r\n  }\r\n  /**\r\n   * Compute stroke data in an interval.\r\n   * @param strokes strokes to clear and refill.\r\n   * @param fraction0 start fraction\r\n   * @param fraction1 end fraction\r\n   */\r\n  private computeStrokes(strokes: LineString3d, fractionA: number, fractionB: number, numInterval: number, applyLocalToWorld: boolean = true) {\r\n    if (numInterval < 1)\r\n      numInterval = 1;\r\n    strokes.clear();\r\n    strokes.ensureEmptyUVParams();\r\n    strokes.ensureEmptyFractions();\r\n    const distances = strokes.packedUVParams!;\r\n    const nominalIntervalLength = Math.abs(fractionB - fractionA) * this._nominalL1;\r\n    for (let i = 0; i <= numInterval; i++) {\r\n      const fraction = Geometry.interpolate(fractionA, i / numInterval, fractionB);\r\n      const nominalDistanceAlong = fraction * nominalIntervalLength;\r\n      strokes.packedPoints.pushXYZ(this._evaluator.fractionToX(fraction),\r\n        this._evaluator.fractionToY(fraction), 0);\r\n      distances.pushXY(fraction, nominalDistanceAlong); // the second distance will be updated below\r\n    }\r\n    if (applyLocalToWorld)\r\n      strokes.tryTransformInPlace (this._localToWorld);\r\n    let fraction0 = distances.getXAtUncheckedPointIndex(0);\r\n    let trueDistance0 = distances.getYAtUncheckedPointIndex(0); // whatever was assigned as start distance is fine\r\n    let trueDistance1, fraction1;\r\n    for (let i = 1; i <= numInterval; i++) {\r\n      fraction1 = distances.getXAtUncheckedPointIndex(i);\r\n      trueDistance1 = trueDistance0 + this._evaluator.integrateDistanceBetweenFractions(fraction0, fraction1);\r\n      distances.setXYAtCheckedPointIndex(i, fraction1, trueDistance1);\r\n      fraction0 = fraction1;\r\n      trueDistance0 = trueDistance1;\r\n    }\r\n\r\n  }\r\n  /** Recompute strokes */\r\n  public override refreshComputedProperties() {\r\n    const sweepRadians = this.nominalL1 / (2.0 * this.nominalR1);\r\n    const radiansStep = 0.02;\r\n    const numInterval = StrokeOptions.applyAngleTol(undefined, 4, sweepRadians, radiansStep);\r\n    this.computeStrokes(this._globalStrokes, 0, 1, numInterval);\r\n    const numActiveInterval = Math.ceil(this._activeFractionInterval.absoluteDelta() * numInterval);\r\n    this._activeStrokes = LineString3d.create();\r\n    this.computeStrokes(this._activeStrokes, this._activeFractionInterval.x0, this._activeFractionInterval.x1,\r\n      numActiveInterval);\r\n  }\r\n  /**\r\n   * Create a spiral object which uses numXTerm terms from the clothoid X series and numYTerm from the clothoid Y series.\r\n   * @param numXTerm  number of terms to use from X series\r\n   * @param numYTerm number of terms to use from Y series\r\n   * @param localToWorld placement frame.  Inflection point is at origin, initial direction is along x axis.\r\n   * @param nominalL1 design distance from inflection to end point.\r\n   * @param nominalR1 design radius at end point.\r\n   * @param activeInterval active interval (as fractions of nominalL1 !!!)\r\n   */\r\n  public static createTruncatedClothoid(\r\n    spiralType: string,\r\n    localToWorld: Transform,\r\n    numXTerm: number, numYTerm: number,\r\n    originalProperties: TransitionConditionalProperties | undefined,\r\n    nominalL1: number, nominalR1: number,\r\n    activeInterval: Segment1d | undefined): DirectSpiral3d | undefined {\r\n    if (numXTerm < 1)\r\n      numXTerm = 1;\r\n    if (numYTerm < 1)\r\n      numYTerm = 1;\r\n    const evaluator = new ClothoidSeriesRLEvaluator(nominalL1, 1.0 / (2.0 * nominalL1 * nominalR1), numXTerm, numYTerm);\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      spiralType,\r\n      originalProperties,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n  /**\r\n   * Create an Japanese spiral clothoid approximation\r\n   *   * X is 1 terms of the clothoid series as a function of nominal distance along.\r\n   *   * Y is 1 terms f the clothoid series as a function of nominal distance along.\r\n   *   * Remark: This is identical to the ChineseCubic\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createJapaneseCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"JapaneseCubic\", localToWorld, 1, 1, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create a czech cubic.\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * @param localToWorld\r\n   * @param nominalLx nominal length along x axis\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createCzechCubic(\r\n    localToWorld: Transform,\r\n    nominalLx: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = CzechSpiralEvaluator.create(nominalLx, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"Czech\",\r\n      undefined,\r\n      nominalLx, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n  /**\r\n   * Create an italian spiral\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * * L in gamma and m is the\r\n   * @param localToWorld\r\n   * @param nominalL1 nominal length along the spiral\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createItalian(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = ItalianSpiralEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"Italian\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create an MX Cubic whose nominal length is close to along the curve.\r\n   * This is y= m*x^3 with\r\n   * * m is 1/ (6RL1)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   * * L1 is an along-the-x-axis distance that is slightly LESS THAN the nominal length\r\n   * * x is axis position that is slightly LESS than nominal distance along\r\n   * * L1, x use the approximation   `x = s * ( 1 - s^4/ (40 R R L L))\r\n   * @param localToWorld\r\n   * @param nominalL1\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createMXCubicAlongArc(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = MXCubicAlongArcEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"MXCubicAlongArc\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create a polish cubic\r\n   * This is y= m*x^3 with\r\n   * * m is 1/ (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   * * L is nominal length\r\n   * * R is nominal end radius.\r\n   * * x ranges up to the x axis distance for which the polish distance series produces f(x)=L\r\n   * * The support class PolishCubicEvaluator has static methods for the distance series and its inversion.\r\n   */\r\n  public static createPolishCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = PolishCubicEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"PolishCubic\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  /**\r\n   * Create an AustralianRailCorp spiral\r\n   * This is y= m*x^3 with\r\n   * * x any point on the x axis\r\n   * * `fraction` along the spiral goes to `x = fraction * L`\r\n   * * m is gamma / (6RL)\r\n   *    * 1/(6RL) is the leading term of the sine series.\r\n   *    * `gamma = 2R/sqrt (4RR-LL)` pushes y up a little bit to simulate the lost series terms.\r\n   * @param localToWorld\r\n   * @param nominalL1\r\n   * @param nominalR1\r\n   * @param activeInterval\r\n   */\r\n  public static createAustralianRail(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    const evaluator = AustralianRailCorpXYEvaluator.create(nominalL1, nominalR1);\r\n    if (evaluator === undefined)\r\n      return undefined;\r\n    return new DirectSpiral3d(\r\n      localToWorld.clone(),\r\n      \"AustralianRailCorp\",\r\n      undefined,\r\n      nominalL1, nominalR1,\r\n      activeInterval ? activeInterval.clone() : Segment1d.create(0, 1), evaluator);\r\n  }\r\n\r\n  public static createDirectHalfCosine(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return new this(localToWorld, \"HalfCosine\", undefined, nominalL1, nominalR1, activeInterval,\r\n      new DirectHalfCosineSpiralEvaluator(nominalL1, nominalR1));\r\n  }\r\n  /**\r\n   * Create an Arema spiral clothoid approximation\r\n   *   * X is 2 terms of the clothoid series as a function of nominal distance along\r\n   *   * Y is 2 terms f the clothoid series as a function of nominal distance along\r\n   *   * Remark: This is identical to the ChineseCubic\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createArema(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"Arema\", localToWorld, 2, 2, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n\r\n  /**\r\n   * Create a Chinese clothoid approximation\r\n   *   * X is 2 terms of the clothoid series as a function of nominal distance along\r\n   *   * Y is 2 terms f the clothoid series as a function of nominal distance along\r\n   *   * Remark: This is identical to the Arema spiral\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createChineseCubic(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"ChineseCubic\", localToWorld, 2, 2, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create a Western Australian direct spiral.\r\n   *   * X is 2 terms of the clothoid series as a function of distance along\r\n   *   * Y is 1 term (cubic in nominal distance along)\r\n   * @param localToWorld axes with inflection at origin, tangent along x axis\r\n   * @param nominalL1 nominal length as used in series LR terms.\r\n   * @param nominalR1 nominal final radius as used in series LR terms\r\n   * @param activeInterval fractional interval with (0, nominalL1) range for nominal distance along\r\n   */\r\n  public static createWesternAustralian(\r\n    localToWorld: Transform,\r\n    nominalL1: number,\r\n    nominalR1: number,\r\n    activeInterval?: Segment1d): DirectSpiral3d | undefined {\r\n    return this.createTruncatedClothoid(\"WesternAustralian\", localToWorld, 2, 1, undefined, nominalL1, nominalR1, activeInterval);\r\n  }\r\n  /**\r\n   * Create (if possible) a DirectSpiral3d, applying various strict conditions appropriate to the spiral type.\r\n   * The parameter list includes extraneous values in order to directly match IntegratedSpiral3d.create, which has greater flexibility about\r\n   *    mixtures of values.\r\n   * * IMPORTANT RESTRICTIONS\r\n   *   * Direct spirals must have the inflection at the origin of their coordinate system, aligned with the x axis.\r\n   *      * hence bearing0 = 0\r\n   *      * hence radius0 = 0\r\n   *   * bearing1 is ignored\r\n   *   * radius1 must be given.\r\n   *   * arcLength must be given,\r\n   * @param spiralType one of the types in `DirectSpiralTypeNames`\r\n   * @param radius0 radius (or 0 for tangent to line) at start.   Must be ZERO or UNDEFINED\r\n   * @param radius1 radius (or 0 for tangent to line) at end.\r\n   * @param bearing0 bearing, measured CCW from x axis at start.   Must be ZERO or UNDEFINED\r\n   * @param bearing1 bearing, measured CCW from x axis at end.    IGNORED.\r\n   * @param fractionInterval optional fractional interval for an \"active\" portion of the curve.   if omitted, the full [0,1] is used.\r\n   * @param localToWorld placement transform\r\n   */\r\n  public static createFromLengthAndRadius(\r\n    spiralType: string,\r\n    radius0: number | undefined,\r\n    radius1: number | undefined,\r\n    bearing0: Angle | undefined,\r\n    _bearing1: Angle | undefined,\r\n    arcLength: number | undefined,\r\n    activeInterval: undefined | Segment1d,\r\n    localToWorld: Transform): TransitionSpiral3d | undefined {\r\n    if (bearing0 !== undefined && !bearing0.isAlmostZero)\r\n      return undefined;\r\n    if (radius0 !== undefined && !Geometry.isSmallMetricDistance(radius0))\r\n      return undefined;\r\n    if (radius1 === undefined || Geometry.isSmallMetricDistance(radius1))\r\n      return undefined;\r\n    if (arcLength === undefined)\r\n      return undefined;\r\n    if (Geometry.equalStringNoCase(spiralType, \"Arema\"))\r\n      return this.createArema(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"ChineseCubic\"))\r\n      return this.createChineseCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"JapaneseCubic\"))\r\n      return this.createJapaneseCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"HalfCosine\"))\r\n      return this.createDirectHalfCosine(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"Czech\"))\r\n      return this.createCzechCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"Italian\"))\r\n      return this.createItalian(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"AustralianRailCorp\"))\r\n      return this.createAustralianRail(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"MXCubicAlongArc\"))\r\n      return this.createMXCubicAlongArc(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"WesternAustralian\"))\r\n      return this.createWesternAustralian(localToWorld, arcLength, radius1, activeInterval);\r\n    if (Geometry.equalStringNoCase(spiralType, \"PolishCubic\"))\r\n      return this.createPolishCubic(localToWorld, arcLength, radius1, activeInterval);\r\n    return undefined;\r\n  }\r\n  /** Deep clone of this spiral */\r\n  public override clone(): DirectSpiral3d {\r\n    return new DirectSpiral3d(\r\n      this.localToWorld.clone(),\r\n      this._spiralType,\r\n      this.designProperties?.clone(),\r\n      this._nominalL1,\r\n      this._nominalR1,\r\n      this._activeFractionInterval?.clone(),\r\n      this._evaluator.clone());\r\n  }\r\n\r\n  /** apply `transform` to this spiral's local to world transform. */\r\n  public tryTransformInPlace(transformA: Transform): boolean {\r\n    const rigidData = this.applyRigidPartOfTransform(transformA);\r\n    if (rigidData !== undefined) {\r\n      this._nominalL1 *= rigidData.scale;\r\n      this._nominalR1 *= rigidData.scale;\r\n      this.evaluator.scaleInPlace(rigidData.scale);\r\n    }\r\n    this.refreshComputedProperties();\r\n    return true;\r\n  }\r\n\r\n  /** Return the spiral start point. */\r\n  public override startPoint(): Point3d { return this.activeStrokes.startPoint(); }\r\n  /** return the spiral end point. */\r\n  public override endPoint(): Point3d { return this.activeStrokes.endPoint(); }\r\n  /** test if the local to world transform places the spiral xy plane into `plane` */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    return plane.isPointInPlane(this.localToWorld.origin as Point3d)\r\n      && Geometry.isSameCoordinate(0.0, this.localToWorld.matrix.dotColumnX(plane.getNormalRef()))\r\n      && Geometry.isSameCoordinate(0.0, this.localToWorld.matrix.dotColumnY(plane.getNormalRef()));\r\n  }\r\n  /** Return quick length of the spiral.\r\n   * The tangent vector of a true clothoid is length 1 everywhere, so simple proportion of nominalL1 is a good approximation.\r\n   */\r\n  public quickLength() {\r\n    const distanceData = this._globalStrokes.packedUVParams!;\r\n    const n = distanceData.length;\r\n    return distanceData.getYAtUncheckedPointIndex(n - 1);\r\n  }\r\n  /** Return length of the spiral.\r\n   * * True length is stored at back of uvParams . . .\r\n   */\r\n  //   use the generic integrator ... public override curveLength() { return this.quickLength(); }\r\n  /** Test if `other` is an instance of `TransitionSpiral3d` */\r\n  public isSameGeometryClass(other: any): boolean { return other instanceof DirectSpiral3d; }\r\n  /** Add strokes from this spiral to `dest`.\r\n   * * Linestrings will usually stroke as just their points.\r\n   * * If maxEdgeLength is given, this will sub-stroke within the linestring -- not what we want.\r\n   */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void { this.activeStrokes.emitStrokes(dest, options); }\r\n  /** emit stroke fragments to `dest` handler. */\r\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n    const n = this.computeStrokeCountForOptions(options);\r\n    const activeStrokes = this.activeStrokes;\r\n    dest.startParentCurvePrimitive(this);\r\n\r\n    // hack: specify the extended range so we can compute length of an extended spiral\r\n    let globalFraction0 = 0.0;\r\n    let globalFraction1 = 1.0;\r\n    if (dest instanceof CurveLengthContext) {\r\n      if (dest.getFraction0 < 0.0)\r\n        globalFraction0 = dest.getFraction0;\r\n      if (dest.getFraction1 > 1.0)\r\n        globalFraction1 = dest.getFraction1;\r\n    }\r\n\r\n    if (n <= activeStrokes.numPoints())\r\n      dest.announceIntervalForUniformStepStrokes(this, 2 * activeStrokes.numPoints(), globalFraction0, globalFraction1);\r\n    else\r\n      dest.announceIntervalForUniformStepStrokes(this, n, globalFraction0, globalFraction1);\r\n\r\n    dest.endParentCurvePrimitive(this);\r\n  }\r\n\r\n  /**\r\n   * return the stroke count required for given options.\r\n   * @param options StrokeOptions that determine count\r\n   */\r\n\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    let numStroke;\r\n    const nominalRadians = this._nominalL1 / (2.0 * this._nominalR1);\r\n    if (options) {\r\n      const rMin = Math.abs(this._nominalR1);\r\n      numStroke = options.applyTolerancesToArc(rMin, nominalRadians);\r\n      numStroke = options.applyMaxEdgeLength(numStroke, this.quickLength());\r\n      numStroke = options.applyMinStrokesPerPrimitive(numStroke);\r\n    } else {\r\n      numStroke = StrokeOptions.applyAngleTol(undefined, 4, nominalRadians, 0.02);\r\n    }\r\n    numStroke = Math.ceil(this._activeFractionInterval.absoluteDelta() * numStroke);\r\n    return numStroke;\r\n  }\r\n\r\n  /** Reverse the active interval and active strokes.\r\n   * * Primary defining data remains unchanged !!!\r\n   */\r\n\r\n  public reverseInPlace(): void {\r\n    this._activeFractionInterval.reverseInPlace();\r\n    if (this._activeStrokes === undefined)\r\n      this._activeStrokes = this._globalStrokes.clone();\r\n    this._activeStrokes.reverseInPlace();\r\n  }\r\n  /** Evaluate curve point with respect to fraction. */\r\n  public fractionToPoint(activeFraction: number, result?: Point3d): Point3d {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPoint(globalFraction, result);\r\n    this.localToWorld.multiplyPoint3d(result, result);\r\n    return result;\r\n  }\r\n  /** Evaluate curve point and derivative with respect to fraction. */\r\n  public fractionToPointAndDerivative(activeFraction: number, result?: Ray3d): Ray3d {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPointAndDerivative(globalFraction, result);\r\n    result.direction.scaleInPlace(this._activeFractionInterval.signedDelta());\r\n    result.transformInPlace(this.localToWorld);\r\n    return result;\r\n  }\r\n\r\n  /** Return a plane with\r\n   *\r\n   * * origin at fractional position along the curve\r\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to the fraction.\r\n   * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n   */\r\n\r\n  public fractionToPointAnd2Derivatives(activeFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors | undefined {\r\n    const globalFraction = this._activeFractionInterval.fractionToPoint(activeFraction);\r\n    result = this._evaluator.fractionToPointAnd2Derivatives(globalFraction, result);\r\n    const a = this._activeFractionInterval.signedDelta();\r\n    result.vectorU.scaleInPlace(a);\r\n    result.vectorV.scaleInPlace(a * a);\r\n    result.transformInPlace(this.localToWorld);\r\n    return result;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleTransitionSpiral(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleTransitionSpiral(this);\r\n  }\r\n  /** compare various coordinate quantities */\r\n  public override isAlmostEqual(other: any): boolean {\r\n    if (other instanceof DirectSpiral3d) {\r\n      return Geometry.isSameCoordinate(this._nominalL1, other._nominalL1)\r\n        && Geometry.isSameCoordinate(this._nominalR1, other._nominalR1)\r\n        && this.localToWorld.isAlmostEqual(other.localToWorld)\r\n        && this._activeFractionInterval.isAlmostEqual(other._activeFractionInterval)\r\n        && this._evaluator.isAlmostEqual(other._evaluator);\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/spiral/IntegratedSpiral3d.js

@@ -186,8 +186,7 @@ class IntegratedSpiral3d extends TransitionSpiral3d_1.TransitionSpiral3d {
     }
     /** Deep clone of this spiral */
     clone() {
-        var _a;
-        return new IntegratedSpiral3d(this._spiralType, this._evaluator, this.radius01.clone(), this.bearing01.clone(), this.activeFractionInterval.clone(), this.localToWorld.clone(), this._arcLength01, (_a = this._designProperties) === null || _a === void 0 ? void 0 : _a.clone());
+        return new IntegratedSpiral3d(this._spiralType, this._evaluator, this.radius01.clone(), this.bearing01.clone(), this.activeFractionInterval.clone(), this.localToWorld.clone(), this._arcLength01, this._designProperties?.clone());
     }
     /** apply `transform` to this spiral's local to world transform. */
     tryTransformInPlace(transformA) {