@itwin/core-geometry 5.0.0-dev.32 → 5.0.0-dev.34

package/lib/esm/clipping/AlternatingConvexClipTree.js

@@ -412,6 +412,8 @@ export class AlternatingCCTreeNodeCurveClipper {
     isTopOfStackEmpty() {
         return this._topOfStack.length === 0;
     }
+    // Is re-used by method calls
+    static { this._fractionIntervals = []; }
     appendSingleClipToStack(planes, insideSegments) {
         const fractionIntervals = AlternatingCCTreeNodeCurveClipper._fractionIntervals;
         if (this._curve instanceof LineSegment3d) {
@@ -518,6 +520,4 @@ export class AlternatingCCTreeNodeCurveClipper {
         }
     }
 }
-// Is re-used by method calls
-AlternatingCCTreeNodeCurveClipper._fractionIntervals = [];
 //# sourceMappingURL=AlternatingConvexClipTree.js.map

package/lib/esm/clipping/AlternatingConvexClipTree.js.map

@@ -1 +1 @@
-{"version":3,"file":"AlternatingConvexClipTree.js","sourceRoot":"","sources":["../../../src/clipping/AlternatingConvexClipTree.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAkB,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,qBAAqB;IAOhC;QANO,WAAM,GAAc,EAAE,CAAC;QACvB,WAAM,GAAuB,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAC9D,aAAQ,GAA4B,EAAE,CAAC;QACvC,aAAQ,GAAW,CAAC,CAAC,CAAC,CAAI,iEAAiE;QAC3F,cAAS,GAAW,CAAC,CAAC,CAAC,CAAG,4CAA4C;IAErD,CAAC;IAEzB,2EAA2E;IACpE,MAAM,CAAC,iBAAiB,CAAC,MAAc,EAAE,SAAiB,EAAE,MAA8B;QAC/F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC;QACzB,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;QAC7B,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB,EAAE,MAA8B;QAClF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,GAAG,wBAAwB,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACjE,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAE,oCAAoC;QACpE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,uEAAuE;IAChE,MAAM,CAAC,6BAA6B,CAAC,MAAiB,EAAE,MAA8B;QAC3F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,GAAG,wBAAwB,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACjE,OAAO,CAAC,4BAA4B,CAAC,MAAM,CAAC,CAAC,CAAE,oCAAoC;QACnF,OAAO,MAAM,CAAC;IAChB,CAAC;IACO,cAAc,CAAC,KAAkB;QACvC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;YAC3B,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACI,YAAY;QACjB,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0EAA0E;IACnE,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,2GAA2G;IACpG,KAAK,CAAC,MAA8B;QACzC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YACpC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qEAAqE;IAC9D,aAAa,CAAC,MAAc,EAAE,SAAiB;QACpD,MAAM,OAAO,GAAG,qBAAqB,CAAC,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,6CAA6C;IACtC,QAAQ,CAAC,KAAgB;QAC9B,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IACD,oDAAoD;IAC7C,iBAAiB,CAAC,KAAc;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAChC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,KAA4B;QACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,sFAAsF;IAC/E,iCAAiC,CACtC,KAAqB,EAAE,eAA0C,EAAE,gBAA2C;QAE9G,MAAM,OAAO,GAAG,IAAI,iCAAiC,EAAE,CAAC;QACxD,OAAO,CAAC,yBAAyB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;IACpF,CAAC;IACD,sFAAsF;IAC/E,kCAAkC,CACvC,MAAuB,EAAE,eAA0C,EAAE,gBAA2C;QAEhH,MAAM,OAAO,GAAG,IAAI,iCAAiC,EAAE,CAAC;QACxD,OAAO,CAAC,yBAAyB,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;OAOG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,oBAAoB;QACpB,+CAA+C;QAC/C,kCAAkC;QAClC,MAAM,eAAe,GAAG,gBAAgB,CAAC,MAAM,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,GAAG,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QACvF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,aAAa,CAAC,uCAAuC,CAAC,gBAAgB,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QAC5G,CAAC;aAAM,CAAC;YACN,IAAI,aAAa,GAAG,CAAC,SAAS,CAAC,CAAC;YAChC,IAAI,aAAa,GAAuB,EAAE,CAAC;YAC3C,IAAI,MAAM,CAAC;YACX,IAAI,KAAK,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;gBACzB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,mDAAmD;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;oBACxE,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,MAAM,GAAG,aAAa,CAAC;gBACvB,aAAa,GAAG,aAAa,CAAC,CAAE,oBAAoB;gBACpD,aAAa,GAAG,MAAM,CAAC;YACzB,CAAC;YACD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBACnD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IACM,KAAK;QACV,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,OAAO,GAAG,aAAa,CAAC;IACjC,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,wBAAwB;IAInC;QAHQ,YAAO,GAAc,EAAE,CAAC;QACxB,WAAM,GAAa,EAAE,CAAC;IAEN,CAAC;IAElB,MAAM,CAAC,eAAe,CAAC,MAAiB,EAAE,MAAiC;QAChF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,wBAAwB,EAAE,CAAC;QAC1D,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC;QACxB,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG;YACjC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IACM,UAAU,CAAC,CAAS;QACzB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACvC,CAAC;IACM,WAAW,CAAC,CAAS;QAC1B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7D,CAAC;IACM,SAAS,CAAC,iBAAyB;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACtC,CAAC;IACO,MAAM,CAAC,KAAK,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe;QACpE,OAAO,MAAM,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IACD;;;;MAIE;IACK,gBAAgB,CAAC,WAAmB;QACzC,IAAI,UAAkB,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,WAAW,GAAG,CAAC;YACjB,UAAU,GAAG,WAAW,CAAC;;YAEzB,UAAU,GAAG,WAAW,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QAC/C,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IACzC,CAAC;IACM,gBAAgB,CAAC,UAAkB,EAAE,IAAY;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACxC,OAAO,IAAI,GAAG,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACH,IAAW,WAAW;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+DAA+D;IACxD,eAAe,CAAC,CAAS,EAAE,IAAY,EAAE,aAAsB;QACpE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG;YACnE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACpB,IAAI,aAAa;YACf,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACM,gBAAgB,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY;QAChE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,MAAM,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACM,wBAAwB,CAAC,MAAiB,EAAE,MAAc,EAAE,IAAY,EAAE,KAAa;QAC5F,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,MAAM,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACO,eAAe,CACrB,IAA2B,EAAE,cAAuB,EAAE,oBAA6B,IAAI;QAEvF,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC;gBACrB,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,IAAI,EAAE,KAAK,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC/B,qEAAqE;oBACrE,MAAM,KAAK,GAAG,SAAS,CAAC,qBAAqB,CAC3C,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CACzE,CAAC;oBACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;wBACxB,IAAI,cAAc;4BAChB,KAAK,CAAC,aAAa,EAAE,CAAC;wBACxB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,EAAE,GAAG,EAAE;wBACT,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC;oBACpB,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,iBAAiB,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAC/B,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,cAAc,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAC/B,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9G,CAAC;QACD,OAAO,IAAI,CAAC,CAAI,8DAA8D;IAChF,CAAC;IACD;;;;;;;;OAQG;IACI,4BAA4B,CAAC,IAA2B;QAC7D,qBAAqB,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IACD;;;;;;;;OAQG;IACI,aAAa,CAAC,IAA2B;QAC9C,qBAAqB,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF;AAED,MAAM,OAAO,iCAAiC;IAK5C;QACE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAC3B,CAAC;IAEO,WAAW,CAAC,KAAqB,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IAC3D,eAAe;QACrB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,aAAa;YAC7C,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACO,iBAAiB;QACvB,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC;YACzB,IAAI,CAAC,eAAe,EAAE,CAAC,CAAK,mCAAmC;IACnE,CAAC;IACO,qBAAqB;QAC3B,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW;YAClD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,IAAY,WAAW,KAAgB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,0EAA0E;IAC1E,IAAY,WAAW,CAAC,KAAgB;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YACP,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IACvC,CAAC;IACD,4CAA4C;IACpC,UAAU,CAAC,OAAe;QAChC,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW;YAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;;YAE3D,OAAO,EAAE,CAAC;IACd,CAAC;IACO,iBAAiB;QACvB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;IACvC,CAAC;IAGO,uBAAuB,CAAC,MAA0B,EAAE,cAAyB;QACnF,MAAM,iBAAiB,GAAG,iCAAiC,CAAC,kBAAkB,CAAC;QAE/E,IAAI,IAAI,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;YAC5B,IAAI,EAAU,CAAC;YACf,IAAI,EAAU,CAAC;YACf,IAAI,OAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClH,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAG,EAAE,EAAG,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,KAAK,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,GAAG,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;gBAChF,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBAClD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClF,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;YAC/B,IAAI,EAAU,CAAC;YACf,IAAI,EAAU,CAAC;YACf,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;YACzC,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,OAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClH,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,cAAc,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;gBACnF,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBAClD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,OAAO,CAAC,IAA2B;QACzC,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,iBAAiB,EAAE;YAC1B,OAAO;QACT,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,CAAC;YACD,IAAI,IAAI,CAAC,iBAAiB,EAAE;gBAC1B,MAAM;QACV,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,IAA2B,EAAE,KAAqB,EACjF,eAA0C,EAAE,iBAA4C;QACxF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;YACxB,OAAO;QACT,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC;QACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC;YACxB,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;YACvC,eAAe,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,CACxD,mBAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,EAC7D,mBAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAC9D,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,IAA2B,EAAE,KAAsB,EAClF,eAA0C,EAAE,gBAA2C;QACvF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,EAAE,YAAY,cAAc;gBAC9B,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;iBACzE,IAAI,EAAE,YAAY,eAAe;gBACpC,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;;AA9GD,6BAA6B;AACd,oDAAkB,GAAa,EAAE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range1d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Range1dArray } from \"../numerics/Range1dArray\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipUtilities, PolygonClipper } from \"./ClipUtils\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\n\n/**\n * An AlternatingConvexClipTreeNode is a node in a tree structure in which\n *   <ul>\n *   <li>Each node contains a ConvexClipPlaneSet.\n *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.\n *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if\n *   <ul>\n *   <li>It is IN the node's ConvexClipPlaneSet.\n *   <li>It is NOT IN any of the children.\n *   </ul>\n *   <li>Applying \"NOT IN any of the children\" locally to children at each level means that the ConvexClipPlaneSet\n *       at adjacent levels flip between being positive areas and holes.\n *   <li>Use an AlternatingConvexClipTreeNodeBuilder to construct the tree from a polygon.\n *   <li>It is possible for the root clip plane set to be empty.  An empty clip plane set returns \"true\"\n *         for all point tests, so the meaning is just that holes are to be subtracted from the rest\n *         of space.\n *   <li>Although the interpretation of in/out alternates with tree levels, the ConvexClipPlaneSets\n *         at each level are all \"enclosing\" planes in the usual way.\n *   </ul>\n */\nexport class AlternatingCCTreeNode implements PolygonClipper {\n  public points: Point3d[] = [];\n  public planes: ConvexClipPlaneSet = ConvexClipPlaneSet.createEmpty();\n  public children: AlternatingCCTreeNode[] = [];\n  public startIdx: number = -1;    // Start index into the master array (not the local points array)\n  public numPoints: number = -1;   // Number of points used in the master array\n\n  private constructor() { }\n\n  /** Initialize this node with index data referencing the parent polygon. */\n  public static createWithIndices(index0: number, numPoints: number, result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.startIdx = index0;\n    result.numPoints = numPoints;\n    result.children.length = 0;\n    return result;\n  }\n  /**\n   * <ul>\n   * <li>Build the tree for a polygon.\n   * <li>Caller creates the root node with empty constructor AlternatingConvexClipTreeNode.\n   * </ul>\n   */\n  public static createTreeForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.empty();\n    const builder = AlternatingCCTreeBuilder.createPointsRef(points);\n    builder.buildHullTree(result);  // <-- Currently ALWAYS returns true\n    return result;\n  }\n  /** Build the outer convex hull with inlets as first level children. */\n  public static createHullAndInletsForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.empty();\n    const builder = AlternatingCCTreeBuilder.createPointsRef(points);\n    builder.buildHullAndInletsForPolygon(result);  // <-- Currently ALWAYS returns true\n    return result;\n  }\n  private extractLoopsGo(loops: Point3d[][]) {\n    loops.push(Point3dArray.clonePoint3dArray(this.points));\n    for (const c of this.children)\n      c.extractLoopsGo(loops);\n  }\n  /**\n   * Return an array with all the loops in the tree.\n   * This loses the alternating structure of the tree, but the collection still matches well-formed polygons by\n   * parity rules.\n   */\n  public extractLoops(): Point3d[][] {\n    const loops: Point3d[][] = [];\n    this.extractLoopsGo(loops);\n    return loops;\n  }\n  /** Resets this AlternatingConvexClipTreeNode to a newly-created state. */\n  public empty() {\n    this.points.length = 0;\n    this.planes.planes.length = 0;\n    this.children.length = 0;\n    this.startIdx = -1;\n    this.numPoints = -1;\n  }\n  /** Creates a deep copy of this node (expensive - copies Geometry, and is recursive for children array). */\n  public clone(result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    for (const point of this.points)\n      result.points.push(point.clone());\n    result.planes = ConvexClipPlaneSet.createEmpty();\n    for (const plane of this.planes.planes)\n      result.planes.planes.push(plane.clone());\n    for (const node of this.children)\n      result.children.push(node.clone());\n    result.startIdx = this.startIdx;\n    result.numPoints = this.numPoints;\n    return result;\n  }\n  /** Add a new child that has an empty plane set and given indices. */\n  public addEmptyChild(index0: number, numPoints: number) {\n    const newNode = AlternatingCCTreeNode.createWithIndices(index0, numPoints);\n    this.children.push(newNode);\n  }\n  /** Add a plane to the ConvexClipPlaneSet. */\n  public addPlane(plane: ClipPlane) {\n    this.planes.addPlaneToConvexSet(plane);\n  }\n  /** Search with alternating in and out semantics. */\n  public isPointOnOrInside(point: Point3d): boolean {\n    const inRoot = this.planes.isPointOnOrInside(point, 0.0);\n    if (!inRoot)\n      return false;\n    for (const child of this.children) {\n      if (child.isPointOnOrInside(point))\n        return false;\n    }\n    return true;\n  }\n  /**\n   * Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.\n   * * The child pointer is pushed directly to the tree -- not cloned.\n   */\n  public captureConvexClipPlaneSetAsVoid(child: AlternatingCCTreeNode) {\n    this.children.push(child);\n  }\n  /** Append start-end positions for curve intervals classified as inside or outside. */\n  public appendCurvePrimitiveClipIntervals(\n    curve: CurvePrimitive, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[],\n  ): void {\n    const clipper = new AlternatingCCTreeNodeCurveClipper();\n    clipper.appendSingleClipPrimitive(this, curve, insideIntervals, outsideIntervals);\n  }\n  /** Append start-end positions for curve intervals classified as inside or outside. */\n  public appendCurveCollectionClipIntervals(\n    curves: CurveCollection, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[],\n  ): void {\n    const clipper = new AlternatingCCTreeNodeCurveClipper();\n    clipper.appendCurveCollectionClip(this, curves, insideIntervals, outsideIntervals);\n  }\n  /**\n   * @param xyz input polygon. This is not changed.\n   * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n   * the cache. This is NOT cleared.\n   * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param arrayCache cache for reusable GrowableXYZArray.\n   */\n  public appendPolygonClip(\n    xyz: IndexedXYZCollection,\n    insideFragments: GrowableXYZArray[],\n    outsideFragments: GrowableXYZArray[],\n    arrayCache: GrowableXYZArrayCache,\n  ): void {\n    // At first level ..\n    // newInside is subject to re-clip by children.\n    // outside is definitively outside\n    const oldOutsideCount = outsideFragments.length;\n    const newInside = this.planes.clipInsidePushOutside(xyz, outsideFragments, arrayCache);\n    if (newInside === undefined) {\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(outsideFragments, oldOutsideCount, xyz, arrayCache);\n    } else {\n      let carryForwardA = [newInside];\n      let carryForwardB: GrowableXYZArray[] = [];\n      let tempAB;\n      let shard;\n      for (const c of this.children) {\n        carryForwardB.length = 0;\n        while (undefined !== (shard = carryForwardA.pop())) {\n          // Anything inside this child is truly outside  ...\n          c.appendPolygonClip(shard, outsideFragments, carryForwardB, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        tempAB = carryForwardB;\n        carryForwardB = carryForwardA;  // and that is empty\n        carryForwardA = tempAB;\n      }\n      while (undefined !== (shard = carryForwardA.pop())) {\n        insideFragments.push(shard);\n      }\n    }\n  }\n  public depth(): number {\n    const myDepth = 1;\n    let maxChildDepth = 0;\n    for (const c of this.children) {\n      maxChildDepth = Math.max(maxChildDepth, c.depth());\n    }\n    return myDepth + maxChildDepth;\n  }\n}\n\n/**\n *  Context structure for building an AlternatingConvexClipTreeNode from a polygon.\n *  <ul>\n *  <li> The polygon is copied to the local m_points structure.\n *  <li> During construction, m_stack contains indices of a sequence of points with uniform concavity.\n *  </ul>\n */\nexport class AlternatingCCTreeBuilder {\n  private _points: Point3d[] = [];\n  private _stack: number[] = [];\n\n  private constructor() { }\n\n  public static createPointsRef(points: Point3d[], result?: AlternatingCCTreeBuilder): AlternatingCCTreeBuilder {\n    result = result ? result : new AlternatingCCTreeBuilder();\n    result._points = points;\n    if (PolygonOps.areaXY(points) < 0.0)\n      result._points.reverse();\n    if (result._points[result._points.length - 1].isAlmostEqualMetric(result._points[0]))\n      result._points.pop();\n    return result;\n  }\n  public get period(): number {\n    return this._points.length;\n  }\n  public indexAfter(i: number) {\n    return (i + 1) % this._points.length;\n  }\n  public indexBefore(i: number) {\n    return (i + this._points.length - 1) % this._points.length;\n  }\n  public pushIndex(primaryPointIndex: number) {\n    this._stack.push(primaryPointIndex);\n  }\n  private static cross(pointA: Point3d, pointB: Point3d, pointC: Point3d): number {\n    return pointA.crossProductToPointsXY(pointB, pointC);\n  }\n  /*\n    public isInsideTurn(pointA: Point3d, pointB: Point3d, pointC: Point3d, sign: number) {\n      return sign * AlternatingCCTreeBuilder.cross(pointA, pointB, pointC) > 0;\n    }\n  */\n  public cyclicStackPoint(cyclicIndex: number): Point3d {  // SIGNED index -- but negatives must be in first 10 periods?\n    let stackIndex: number;\n    const stack = this._stack;\n    if (cyclicIndex > 0)\n      stackIndex = cyclicIndex;\n    else\n      stackIndex = cyclicIndex + 10 * stack.length;\n    stackIndex = stackIndex % stack.length;\n    return this._points[stack[stackIndex]];\n  }\n  public signFromStackTip(pointIndex: number, sign: number) {\n    const pointA = this.cyclicStackPoint(-2);\n    const pointB = this.cyclicStackPoint(-1);\n    const pointC = this._points[pointIndex];\n    return sign * AlternatingCCTreeBuilder.cross(pointA, pointB, pointC) >= 0.0 ? 1 : -1;\n  }\n  /*\n   * Test of xyz is in the convex region bounded by stack points:\n   * <ul>\n   *   <li>polygon[i0]..polygon[i1]\n   *   <li>polygon[j0]..polygon[j1]\n   *   <li>polygon[i0]..polygon[i1]\n   * </ul>\n   * with \"inside\" controlled by sign multiplier.\n  public isConvexContinuation(point: Point3d, i0: number, i1: number, j0: number, j1: number, sign: number): boolean {\n    const points = this.points;\n    const stack = this.stack;\n    return this.isInsideTurn(points[stack[i0]], points[stack[i1]], point, sign)\n        && this.isInsideTurn(points[stack[i0]], points[stack[j0]], point, sign)\n        && this.isInsideTurn(points[stack[j1]], points[stack[i1]], point, sign);\n  }\n   */\n  public get indexOfMaxX() {\n    let k = 0;\n    const points = this._points;\n    const nPoints = this._points.length;\n    for (let i = 1; i < nPoints; i++) {\n      if (points[i].x > points[k].x)\n        k = i;\n    }\n    return k;\n  }\n  /** Pop from the stack until the sign condition is satisfied */\n  public extendHullChain(k: number, sign: number, pushAfterPops: boolean) {\n    while (this._stack.length > 1 && this.signFromStackTip(k, sign) < 0.0)\n      this._stack.pop();\n    if (pushAfterPops)\n      this.pushIndex(k);\n  }\n  public collectHullChain(kStart: number, numK: number, sign: number) {\n    this._stack.length = 0;\n    if (numK > 2) {\n      let k = kStart;\n      for (let i = 0; i < numK; i++) {\n        this.extendHullChain(k, sign, true);\n        k = this.indexAfter(k);\n      }\n    }\n  }\n  public collectHullPointsInArray(points: Point3d[], kStart: number, numK: number, _sign: number) {\n    points.length = 0;\n    if (numK > 2) {\n      let k = kStart;\n      for (let i = 0; i < numK; i++) {\n        points.push(this._points[k]);\n        k = this.indexAfter(k);\n      }\n    }\n  }\n  private buildHullTreeGo(\n    root: AlternatingCCTreeNode, isPositiveArea: boolean, recurseToChildren: boolean = true,\n  ): boolean {\n    this.collectHullChain(root.startIdx, root.numPoints, isPositiveArea ? 1.0 : -1.0);\n    root.points.length = 0;\n    const stack = this._stack;\n    const points = this._points;\n    const stackLen = stack.length;\n\n    for (let i = 0; i < stackLen; i++) {\n      const k0 = stack[i];\n      root.points.push(points[k0]);\n      if (i + 1 < stackLen) {\n        let k1 = stack[i + 1];\n        if (k1 === this.indexAfter(k0)) {\n          // two original points in sequence -- need a clip plane right here!!!\n          const plane = ClipPlane.createEdgeAndUpVector(\n            points[k0], points[k1], Vector3d.create(0, 0, 1), Angle.createRadians(0),\n          );\n          if (plane !== undefined) {\n            if (isPositiveArea)\n              plane.negateInPlace();\n            root.addPlane(plane);\n          }\n        } else {\n          if (k1 < k0)\n            k1 += this.period;\n          root.addEmptyChild(k0, k1 - k0 + 1);\n        }\n      }\n    }\n    if (recurseToChildren) {\n      for (const child of root.children)\n        this.buildHullTreeGo(child, !isPositiveArea);\n    } else {\n      for (const child of root.children)\n        this.collectHullPointsInArray(child.points, child.startIdx, child.numPoints, isPositiveArea ? -1.0 : 1.0);\n    }\n    return true;    // Are there failure modes? What happens with crossing data?..\n  }\n  /**\n   * <ul>\n   * <li> Input a ClipTreeRoot that has start and count data\n   * <li> Build the hull for that data range\n   * <li> Store the hull points in the root\n   * <li> Add children with start and count data\n   * <li> Recursively move to children\n   * </ul>\n   */\n  public buildHullAndInletsForPolygon(root: AlternatingCCTreeNode): boolean {\n    AlternatingCCTreeNode.createWithIndices(this.indexOfMaxX, this.period + 1, root);\n    return this.buildHullTreeGo(root, true, false);\n  }\n  /**\n   * <ul>\n   * <li> Input a ClipTreeRoot that has start and count data\n   * <li> Build the hull for that data range\n   * <li> Store the hull points in the root\n   * <li> Add children with start and count data\n   * <li> Recursively move to children\n   * </ul>\n   */\n  public buildHullTree(root: AlternatingCCTreeNode): boolean {\n    AlternatingCCTreeNode.createWithIndices(this.indexOfMaxX, this.period + 1, root);\n    return this.buildHullTreeGo(root, true);\n  }\n}\n\nexport class AlternatingCCTreeNodeCurveClipper {\n  private _curve: CurvePrimitive | undefined;\n  private _intervalStack: Range1d[][];\n  private _stackDepth: number;\n\n  public constructor() {\n    this._stackDepth = 0;\n    this._intervalStack = [];\n  }\n\n  private setCurveRef(curve: CurvePrimitive) { this._curve = curve; }\n  private popSegmentFrame() {\n    if (this._stackDepth > 0) {\n      this._topOfStack.length = 0;    // formality.\n      this._stackDepth -= 1;\n    }\n  }\n  private clearSegmentStack() {\n    while (this._stackDepth > 0)\n      this.popSegmentFrame();     // and that will reduce stack depth\n  }\n  private pushEmptySegmentFrame() {\n    this._stackDepth += 1;\n    while (this._intervalStack.length < this._stackDepth)\n      this._intervalStack.push([]);\n    this._topOfStack.length = 0;\n  }\n  private get _topOfStack(): Range1d[] { return this._intervalStack[this._stackDepth - 1]; }\n  // set the top of the stack (as defined by stackDepth -- not array length)\n  private set _topOfStack(value: Range1d[]) {\n    const n = this._stackDepth;\n    if (n > 0)\n      this._intervalStack[n - 1] = value;\n  }\n  /** Access entry [topOfStack() - numSkip] */\n  private stackEntry(numSkip: number): Range1d[] {\n    if (numSkip <= this._stackDepth)\n      return this._intervalStack[this._stackDepth - 1 - numSkip];\n    else\n      return [];\n  }\n  private isTopOfStackEmpty(): boolean {\n    return this._topOfStack.length === 0;\n  }\n  // Is re-used by method calls\n  private static _fractionIntervals: number[] = [];\n  private appendSingleClipToStack(planes: ConvexClipPlaneSet, insideSegments: Range1d[]): boolean {\n    const fractionIntervals = AlternatingCCTreeNodeCurveClipper._fractionIntervals;\n\n    if (this._curve instanceof LineSegment3d) {\n      const segment = this._curve;\n      let f0: number;\n      let f1: number;\n      if (segment.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => { f0 = a0; f1 = a1; })) {\n        insideSegments.push(Range1d.createXX(f0!, f1!));\n      }\n      return true;\n\n    } else if (this._curve instanceof Arc3d) {\n      const arc = this._curve;\n      fractionIntervals.length = 0;\n      arc.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => {\n        fractionIntervals.push(a0); fractionIntervals.push(a1);\n      });\n      for (let i = 0; i < fractionIntervals.length; i += 2)\n        insideSegments.push(Range1d.createXX(fractionIntervals[i], fractionIntervals[i + 1]));\n      return true;\n\n    } else if (this._curve instanceof LineString3d && (this._curve).points.length > 1) {\n      const linestring = this._curve;\n      let f0: number;\n      let f1: number;\n      const nPoints = linestring.points.length;\n      const df = 1.0 / (nPoints - 1);\n      for (let i = 0; i < nPoints - 1; i++) {\n        const segment = LineSegment3d.create(linestring.points[i], linestring.points[i + 1]);\n        if (segment.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => { f0 = a0; f1 = a1; })) {\n          insideSegments.push(Range1d.createXX((i + f0!) * df, (i + f1!) * df));\n        }\n      }\n      return true;\n\n    } else if (this._curve instanceof BSplineCurve3d) {\n      const bcurve = this._curve;\n      fractionIntervals.length = 0;\n      bcurve.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => {\n        fractionIntervals.push(a0); fractionIntervals.push(a1);\n      });\n      for (let i = 0; i < fractionIntervals.length; i += 2)\n        insideSegments.push(Range1d.createXX(fractionIntervals[i], fractionIntervals[i + 1]));\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack\n   * has clip for this node (expensive -- must clone items of arrays during \"swaps\").\n   */\n  private recurse(node: AlternatingCCTreeNode) {\n    this.pushEmptySegmentFrame();\n    this.appendSingleClipToStack(node.planes, this._topOfStack);\n    Range1dArray.sort(this._topOfStack);\n    if (this.isTopOfStackEmpty())\n      return;\n    for (const child of node.children) {\n      this.recurse(child);\n      if (!this.isTopOfStackEmpty()) {\n        const ranges = Range1dArray.differenceSorted(this.stackEntry(1), this.stackEntry(0));\n        this.popSegmentFrame();\n        this._topOfStack = ranges;\n      } else {\n        this.popSegmentFrame();\n      }\n      if (this.isTopOfStackEmpty())\n        break;\n    }\n  }\n  /**\n   * Modifies the insideIntervals array given in place.\n   * Note: curve given is passed by reference and stored.\n   */\n  public appendSingleClipPrimitive(root: AlternatingCCTreeNode, curve: CurvePrimitive,\n    insideIntervals: CurveLocationDetailPair[], _outsideIntervals: CurveLocationDetailPair[]) {\n    this.setCurveRef(curve);\n    this.clearSegmentStack();\n    this.recurse(root);\n    if (this._stackDepth !== 1)\n      return;\n    const intervals = this._topOfStack;\n    for (const interval of intervals) {\n      const f0 = interval.low;\n      const f1 = interval.high;\n      const xyz0 = curve.fractionToPoint(f0);\n      const xyz1 = curve.fractionToPoint(f1);\n      insideIntervals.push(CurveLocationDetailPair.createCapture(\n        CurveLocationDetail.createCurveFractionPoint(curve, f0, xyz0),\n        CurveLocationDetail.createCurveFractionPoint(curve, f1, xyz1),\n      ));\n    }\n    this.popSegmentFrame();\n  }\n  /**\n   * Modifies the insideIntervals array given in place.\n   * Note: curve given is passed by reference and stored.\n   */\n  public appendCurveCollectionClip(root: AlternatingCCTreeNode, curve: CurveCollection,\n    insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]) {\n    for (const cp of curve.children) {\n      if (cp instanceof CurvePrimitive)\n        this.appendSingleClipPrimitive(root, cp, insideIntervals, outsideIntervals);\n      else if (cp instanceof CurveCollection)\n        this.appendCurveCollectionClip(root, cp, insideIntervals, outsideIntervals);\n    }\n  }\n}\n"]}
+{"version":3,"file":"AlternatingConvexClipTree.js","sourceRoot":"","sources":["../../../src/clipping/AlternatingConvexClipTree.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAE,aAAa,EAAkB,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,qBAAqB;IAOhC;QANO,WAAM,GAAc,EAAE,CAAC;QACvB,WAAM,GAAuB,kBAAkB,CAAC,WAAW,EAAE,CAAC;QAC9D,aAAQ,GAA4B,EAAE,CAAC;QACvC,aAAQ,GAAW,CAAC,CAAC,CAAC,CAAI,iEAAiE;QAC3F,cAAS,GAAW,CAAC,CAAC,CAAC,CAAG,4CAA4C;IAErD,CAAC;IAEzB,2EAA2E;IACpE,MAAM,CAAC,iBAAiB,CAAC,MAAc,EAAE,SAAiB,EAAE,MAA8B;QAC/F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC;QACzB,MAAM,CAAC,SAAS,GAAG,SAAS,CAAC;QAC7B,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB,EAAE,MAA8B;QAClF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,GAAG,wBAAwB,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACjE,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAE,oCAAoC;QACpE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,uEAAuE;IAChE,MAAM,CAAC,6BAA6B,CAAC,MAAiB,EAAE,MAA8B;QAC3F,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,GAAG,wBAAwB,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACjE,OAAO,CAAC,4BAA4B,CAAC,MAAM,CAAC,CAAC,CAAE,oCAAoC;QACnF,OAAO,MAAM,CAAC;IAChB,CAAC;IACO,cAAc,CAAC,KAAkB;QACvC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;YAC3B,CAAC,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD;;;;OAIG;IACI,YAAY;QACjB,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0EAA0E;IACnE,KAAK;QACV,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,2GAA2G;IACpG,KAAK,CAAC,MAA8B;QACzC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAC7B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,GAAG,kBAAkB,CAAC,WAAW,EAAE,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YACpC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ;YAC9B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qEAAqE;IAC9D,aAAa,CAAC,MAAc,EAAE,SAAiB;QACpD,MAAM,OAAO,GAAG,qBAAqB,CAAC,iBAAiB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,6CAA6C;IACtC,QAAQ,CAAC,KAAgB;QAC9B,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC;IACD,oDAAoD;IAC7C,iBAAiB,CAAC,KAAc;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM;YACT,OAAO,KAAK,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAChC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,KAA4B;QACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IACD,sFAAsF;IAC/E,iCAAiC,CACtC,KAAqB,EAAE,eAA0C,EAAE,gBAA2C;QAE9G,MAAM,OAAO,GAAG,IAAI,iCAAiC,EAAE,CAAC;QACxD,OAAO,CAAC,yBAAyB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;IACpF,CAAC;IACD,sFAAsF;IAC/E,kCAAkC,CACvC,MAAuB,EAAE,eAA0C,EAAE,gBAA2C;QAEhH,MAAM,OAAO,GAAG,IAAI,iCAAiC,EAAE,CAAC;QACxD,OAAO,CAAC,yBAAyB,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;OAOG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,oBAAoB;QACpB,+CAA+C;QAC/C,kCAAkC;QAClC,MAAM,eAAe,GAAG,gBAAgB,CAAC,MAAM,CAAC;QAChD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,GAAG,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QACvF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,aAAa,CAAC,uCAAuC,CAAC,gBAAgB,EAAE,eAAe,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC;QAC5G,CAAC;aAAM,CAAC;YACN,IAAI,aAAa,GAAG,CAAC,SAAS,CAAC,CAAC;YAChC,IAAI,aAAa,GAAuB,EAAE,CAAC;YAC3C,IAAI,MAAM,CAAC;YACX,IAAI,KAAK,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC9B,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;gBACzB,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;oBACnD,mDAAmD;oBACnD,CAAC,CAAC,iBAAiB,CAAC,KAAK,EAAE,gBAAgB,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC;oBACxE,UAAU,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;gBAChC,CAAC;gBACD,MAAM,GAAG,aAAa,CAAC;gBACvB,aAAa,GAAG,aAAa,CAAC,CAAE,oBAAoB;gBACpD,aAAa,GAAG,MAAM,CAAC;YACzB,CAAC;YACD,OAAO,SAAS,KAAK,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBACnD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IACM,KAAK;QACV,MAAM,OAAO,GAAG,CAAC,CAAC;QAClB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,OAAO,GAAG,aAAa,CAAC;IACjC,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,wBAAwB;IAInC;QAHQ,YAAO,GAAc,EAAE,CAAC;QACxB,WAAM,GAAa,EAAE,CAAC;IAEN,CAAC;IAElB,MAAM,CAAC,eAAe,CAAC,MAAiB,EAAE,MAAiC;QAChF,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,wBAAwB,EAAE,CAAC;QAC1D,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC;QACxB,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG;YACjC,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAClF,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IACM,UAAU,CAAC,CAAS;QACzB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IACvC,CAAC;IACM,WAAW,CAAC,CAAS;QAC1B,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7D,CAAC;IACM,SAAS,CAAC,iBAAyB;QACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACtC,CAAC;IACO,MAAM,CAAC,KAAK,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe;QACpE,OAAO,MAAM,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IACD;;;;MAIE;IACK,gBAAgB,CAAC,WAAmB;QACzC,IAAI,UAAkB,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,WAAW,GAAG,CAAC;YACjB,UAAU,GAAG,WAAW,CAAC;;YAEzB,UAAU,GAAG,WAAW,GAAG,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC;QAC/C,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;IACzC,CAAC;IACM,gBAAgB,CAAC,UAAkB,EAAE,IAAY;QACtD,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACxC,OAAO,IAAI,GAAG,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACH,IAAW,WAAW;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,CAAC,GAAG,CAAC,CAAC;QACV,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,+DAA+D;IACxD,eAAe,CAAC,CAAS,EAAE,IAAY,EAAE,aAAsB;QACpE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,GAAG;YACnE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACpB,IAAI,aAAa;YACf,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IACM,gBAAgB,CAAC,MAAc,EAAE,IAAY,EAAE,IAAY;QAChE,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,MAAM,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;gBACpC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACM,wBAAwB,CAAC,MAAiB,EAAE,MAAc,EAAE,IAAY,EAAE,KAAa;QAC5F,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,GAAG,MAAM,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IACO,eAAe,CACrB,IAA2B,EAAE,cAAuB,EAAE,oBAA6B,IAAI;QAEvF,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClF,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC;gBACrB,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtB,IAAI,EAAE,KAAK,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC/B,qEAAqE;oBACrE,MAAM,KAAK,GAAG,SAAS,CAAC,qBAAqB,CAC3C,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CACzE,CAAC;oBACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;wBACxB,IAAI,cAAc;4BAChB,KAAK,CAAC,aAAa,EAAE,CAAC;wBACxB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;oBACvB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,EAAE,GAAG,EAAE;wBACT,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC;oBACpB,IAAI,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,iBAAiB,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAC/B,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,cAAc,CAAC,CAAC;QACjD,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;gBAC/B,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9G,CAAC;QACD,OAAO,IAAI,CAAC,CAAI,8DAA8D;IAChF,CAAC;IACD;;;;;;;;OAQG;IACI,4BAA4B,CAAC,IAA2B;QAC7D,qBAAqB,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACjD,CAAC;IACD;;;;;;;;OAQG;IACI,aAAa,CAAC,IAA2B;QAC9C,qBAAqB,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;CACF;AAED,MAAM,OAAO,iCAAiC;IAK5C;QACE,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;IAC3B,CAAC;IAEO,WAAW,CAAC,KAAqB,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IAC3D,eAAe;QACrB,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,aAAa;YAC7C,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IACO,iBAAiB;QACvB,OAAO,IAAI,CAAC,WAAW,GAAG,CAAC;YACzB,IAAI,CAAC,eAAe,EAAE,CAAC,CAAK,mCAAmC;IACnE,CAAC;IACO,qBAAqB;QAC3B,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW;YAClD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9B,CAAC;IACD,IAAY,WAAW,KAAgB,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,0EAA0E;IAC1E,IAAY,WAAW,CAAC,KAAgB;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC;YACP,IAAI,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IACvC,CAAC;IACD,4CAA4C;IACpC,UAAU,CAAC,OAAe;QAChC,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW;YAC7B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;;YAE3D,OAAO,EAAE,CAAC;IACd,CAAC;IACO,iBAAiB;QACvB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,6BAA6B;aACd,uBAAkB,GAAa,EAAE,CAAC;IACzC,uBAAuB,CAAC,MAA0B,EAAE,cAAyB;QACnF,MAAM,iBAAiB,GAAG,iCAAiC,CAAC,kBAAkB,CAAC;QAE/E,IAAI,IAAI,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;YACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;YAC5B,IAAI,EAAU,CAAC;YACf,IAAI,EAAU,CAAC;YACf,IAAI,OAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClH,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAG,EAAE,EAAG,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,KAAK,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,GAAG,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;gBAChF,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBAClD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClF,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;YAC/B,IAAI,EAAU,CAAC;YACf,IAAI,EAAU,CAAC;YACf,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;YACzC,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,OAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClH,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,EAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QAEd,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,YAAY,cAAc,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;gBACnF,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC;YACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;gBAClD,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,OAAO,CAAC,IAA2B;QACzC,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5D,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,iBAAiB,EAAE;YAC1B,OAAO;QACT,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,YAAY,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrF,IAAI,CAAC,eAAe,EAAE,CAAC;gBACvB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,eAAe,EAAE,CAAC;YACzB,CAAC;YACD,IAAI,IAAI,CAAC,iBAAiB,EAAE;gBAC1B,MAAM;QACV,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,IAA2B,EAAE,KAAqB,EACjF,eAA0C,EAAE,iBAA4C;QACxF,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC;YACxB,OAAO;QACT,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC;QACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC;YACxB,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC;YACzB,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;YACvC,eAAe,CAAC,IAAI,CAAC,uBAAuB,CAAC,aAAa,CACxD,mBAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,EAC7D,mBAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,CAC9D,CAAC,CAAC;QACL,CAAC;QACD,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,IAA2B,EAAE,KAAsB,EAClF,eAA0C,EAAE,gBAA2C;QACvF,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,EAAE,YAAY,cAAc;gBAC9B,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;iBACzE,IAAI,EAAE,YAAY,eAAe;gBACpC,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,eAAe,EAAE,gBAAgB,CAAC,CAAC;QAChF,CAAC;IACH,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range1d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Range1dArray } from \"../numerics/Range1dArray\";\nimport { ClipPlane } from \"./ClipPlane\";\nimport { ClipUtilities, PolygonClipper } from \"./ClipUtils\";\nimport { ConvexClipPlaneSet } from \"./ConvexClipPlaneSet\";\n\n/**\n * An AlternatingConvexClipTreeNode is a node in a tree structure in which\n *   <ul>\n *   <li>Each node contains a ConvexClipPlaneSet.\n *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.\n *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if\n *   <ul>\n *   <li>It is IN the node's ConvexClipPlaneSet.\n *   <li>It is NOT IN any of the children.\n *   </ul>\n *   <li>Applying \"NOT IN any of the children\" locally to children at each level means that the ConvexClipPlaneSet\n *       at adjacent levels flip between being positive areas and holes.\n *   <li>Use an AlternatingConvexClipTreeNodeBuilder to construct the tree from a polygon.\n *   <li>It is possible for the root clip plane set to be empty.  An empty clip plane set returns \"true\"\n *         for all point tests, so the meaning is just that holes are to be subtracted from the rest\n *         of space.\n *   <li>Although the interpretation of in/out alternates with tree levels, the ConvexClipPlaneSets\n *         at each level are all \"enclosing\" planes in the usual way.\n *   </ul>\n */\nexport class AlternatingCCTreeNode implements PolygonClipper {\n  public points: Point3d[] = [];\n  public planes: ConvexClipPlaneSet = ConvexClipPlaneSet.createEmpty();\n  public children: AlternatingCCTreeNode[] = [];\n  public startIdx: number = -1;    // Start index into the master array (not the local points array)\n  public numPoints: number = -1;   // Number of points used in the master array\n\n  private constructor() { }\n\n  /** Initialize this node with index data referencing the parent polygon. */\n  public static createWithIndices(index0: number, numPoints: number, result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.startIdx = index0;\n    result.numPoints = numPoints;\n    result.children.length = 0;\n    return result;\n  }\n  /**\n   * <ul>\n   * <li>Build the tree for a polygon.\n   * <li>Caller creates the root node with empty constructor AlternatingConvexClipTreeNode.\n   * </ul>\n   */\n  public static createTreeForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.empty();\n    const builder = AlternatingCCTreeBuilder.createPointsRef(points);\n    builder.buildHullTree(result);  // <-- Currently ALWAYS returns true\n    return result;\n  }\n  /** Build the outer convex hull with inlets as first level children. */\n  public static createHullAndInletsForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    result.empty();\n    const builder = AlternatingCCTreeBuilder.createPointsRef(points);\n    builder.buildHullAndInletsForPolygon(result);  // <-- Currently ALWAYS returns true\n    return result;\n  }\n  private extractLoopsGo(loops: Point3d[][]) {\n    loops.push(Point3dArray.clonePoint3dArray(this.points));\n    for (const c of this.children)\n      c.extractLoopsGo(loops);\n  }\n  /**\n   * Return an array with all the loops in the tree.\n   * This loses the alternating structure of the tree, but the collection still matches well-formed polygons by\n   * parity rules.\n   */\n  public extractLoops(): Point3d[][] {\n    const loops: Point3d[][] = [];\n    this.extractLoopsGo(loops);\n    return loops;\n  }\n  /** Resets this AlternatingConvexClipTreeNode to a newly-created state. */\n  public empty() {\n    this.points.length = 0;\n    this.planes.planes.length = 0;\n    this.children.length = 0;\n    this.startIdx = -1;\n    this.numPoints = -1;\n  }\n  /** Creates a deep copy of this node (expensive - copies Geometry, and is recursive for children array). */\n  public clone(result?: AlternatingCCTreeNode): AlternatingCCTreeNode {\n    result = result ? result : new AlternatingCCTreeNode();\n    for (const point of this.points)\n      result.points.push(point.clone());\n    result.planes = ConvexClipPlaneSet.createEmpty();\n    for (const plane of this.planes.planes)\n      result.planes.planes.push(plane.clone());\n    for (const node of this.children)\n      result.children.push(node.clone());\n    result.startIdx = this.startIdx;\n    result.numPoints = this.numPoints;\n    return result;\n  }\n  /** Add a new child that has an empty plane set and given indices. */\n  public addEmptyChild(index0: number, numPoints: number) {\n    const newNode = AlternatingCCTreeNode.createWithIndices(index0, numPoints);\n    this.children.push(newNode);\n  }\n  /** Add a plane to the ConvexClipPlaneSet. */\n  public addPlane(plane: ClipPlane) {\n    this.planes.addPlaneToConvexSet(plane);\n  }\n  /** Search with alternating in and out semantics. */\n  public isPointOnOrInside(point: Point3d): boolean {\n    const inRoot = this.planes.isPointOnOrInside(point, 0.0);\n    if (!inRoot)\n      return false;\n    for (const child of this.children) {\n      if (child.isPointOnOrInside(point))\n        return false;\n    }\n    return true;\n  }\n  /**\n   * Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.\n   * * The child pointer is pushed directly to the tree -- not cloned.\n   */\n  public captureConvexClipPlaneSetAsVoid(child: AlternatingCCTreeNode) {\n    this.children.push(child);\n  }\n  /** Append start-end positions for curve intervals classified as inside or outside. */\n  public appendCurvePrimitiveClipIntervals(\n    curve: CurvePrimitive, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[],\n  ): void {\n    const clipper = new AlternatingCCTreeNodeCurveClipper();\n    clipper.appendSingleClipPrimitive(this, curve, insideIntervals, outsideIntervals);\n  }\n  /** Append start-end positions for curve intervals classified as inside or outside. */\n  public appendCurveCollectionClipIntervals(\n    curves: CurveCollection, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[],\n  ): void {\n    const clipper = new AlternatingCCTreeNodeCurveClipper();\n    clipper.appendCurveCollectionClip(this, curves, insideIntervals, outsideIntervals);\n  }\n  /**\n   * @param xyz input polygon. This is not changed.\n   * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed from\n   * the cache. This is NOT cleared.\n   * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param arrayCache cache for reusable GrowableXYZArray.\n   */\n  public appendPolygonClip(\n    xyz: IndexedXYZCollection,\n    insideFragments: GrowableXYZArray[],\n    outsideFragments: GrowableXYZArray[],\n    arrayCache: GrowableXYZArrayCache,\n  ): void {\n    // At first level ..\n    // newInside is subject to re-clip by children.\n    // outside is definitively outside\n    const oldOutsideCount = outsideFragments.length;\n    const newInside = this.planes.clipInsidePushOutside(xyz, outsideFragments, arrayCache);\n    if (newInside === undefined) {\n      ClipUtilities.restoreSingletonInPlaceOfMultipleShards(outsideFragments, oldOutsideCount, xyz, arrayCache);\n    } else {\n      let carryForwardA = [newInside];\n      let carryForwardB: GrowableXYZArray[] = [];\n      let tempAB;\n      let shard;\n      for (const c of this.children) {\n        carryForwardB.length = 0;\n        while (undefined !== (shard = carryForwardA.pop())) {\n          // Anything inside this child is truly outside  ...\n          c.appendPolygonClip(shard, outsideFragments, carryForwardB, arrayCache);\n          arrayCache.dropToCache(shard);\n        }\n        tempAB = carryForwardB;\n        carryForwardB = carryForwardA;  // and that is empty\n        carryForwardA = tempAB;\n      }\n      while (undefined !== (shard = carryForwardA.pop())) {\n        insideFragments.push(shard);\n      }\n    }\n  }\n  public depth(): number {\n    const myDepth = 1;\n    let maxChildDepth = 0;\n    for (const c of this.children) {\n      maxChildDepth = Math.max(maxChildDepth, c.depth());\n    }\n    return myDepth + maxChildDepth;\n  }\n}\n\n/**\n *  Context structure for building an AlternatingConvexClipTreeNode from a polygon.\n *  <ul>\n *  <li> The polygon is copied to the local m_points structure.\n *  <li> During construction, m_stack contains indices of a sequence of points with uniform concavity.\n *  </ul>\n */\nexport class AlternatingCCTreeBuilder {\n  private _points: Point3d[] = [];\n  private _stack: number[] = [];\n\n  private constructor() { }\n\n  public static createPointsRef(points: Point3d[], result?: AlternatingCCTreeBuilder): AlternatingCCTreeBuilder {\n    result = result ? result : new AlternatingCCTreeBuilder();\n    result._points = points;\n    if (PolygonOps.areaXY(points) < 0.0)\n      result._points.reverse();\n    if (result._points[result._points.length - 1].isAlmostEqualMetric(result._points[0]))\n      result._points.pop();\n    return result;\n  }\n  public get period(): number {\n    return this._points.length;\n  }\n  public indexAfter(i: number) {\n    return (i + 1) % this._points.length;\n  }\n  public indexBefore(i: number) {\n    return (i + this._points.length - 1) % this._points.length;\n  }\n  public pushIndex(primaryPointIndex: number) {\n    this._stack.push(primaryPointIndex);\n  }\n  private static cross(pointA: Point3d, pointB: Point3d, pointC: Point3d): number {\n    return pointA.crossProductToPointsXY(pointB, pointC);\n  }\n  /*\n    public isInsideTurn(pointA: Point3d, pointB: Point3d, pointC: Point3d, sign: number) {\n      return sign * AlternatingCCTreeBuilder.cross(pointA, pointB, pointC) > 0;\n    }\n  */\n  public cyclicStackPoint(cyclicIndex: number): Point3d {  // SIGNED index -- but negatives must be in first 10 periods?\n    let stackIndex: number;\n    const stack = this._stack;\n    if (cyclicIndex > 0)\n      stackIndex = cyclicIndex;\n    else\n      stackIndex = cyclicIndex + 10 * stack.length;\n    stackIndex = stackIndex % stack.length;\n    return this._points[stack[stackIndex]];\n  }\n  public signFromStackTip(pointIndex: number, sign: number) {\n    const pointA = this.cyclicStackPoint(-2);\n    const pointB = this.cyclicStackPoint(-1);\n    const pointC = this._points[pointIndex];\n    return sign * AlternatingCCTreeBuilder.cross(pointA, pointB, pointC) >= 0.0 ? 1 : -1;\n  }\n  /*\n   * Test of xyz is in the convex region bounded by stack points:\n   * <ul>\n   *   <li>polygon[i0]..polygon[i1]\n   *   <li>polygon[j0]..polygon[j1]\n   *   <li>polygon[i0]..polygon[i1]\n   * </ul>\n   * with \"inside\" controlled by sign multiplier.\n  public isConvexContinuation(point: Point3d, i0: number, i1: number, j0: number, j1: number, sign: number): boolean {\n    const points = this.points;\n    const stack = this.stack;\n    return this.isInsideTurn(points[stack[i0]], points[stack[i1]], point, sign)\n        && this.isInsideTurn(points[stack[i0]], points[stack[j0]], point, sign)\n        && this.isInsideTurn(points[stack[j1]], points[stack[i1]], point, sign);\n  }\n   */\n  public get indexOfMaxX() {\n    let k = 0;\n    const points = this._points;\n    const nPoints = this._points.length;\n    for (let i = 1; i < nPoints; i++) {\n      if (points[i].x > points[k].x)\n        k = i;\n    }\n    return k;\n  }\n  /** Pop from the stack until the sign condition is satisfied */\n  public extendHullChain(k: number, sign: number, pushAfterPops: boolean) {\n    while (this._stack.length > 1 && this.signFromStackTip(k, sign) < 0.0)\n      this._stack.pop();\n    if (pushAfterPops)\n      this.pushIndex(k);\n  }\n  public collectHullChain(kStart: number, numK: number, sign: number) {\n    this._stack.length = 0;\n    if (numK > 2) {\n      let k = kStart;\n      for (let i = 0; i < numK; i++) {\n        this.extendHullChain(k, sign, true);\n        k = this.indexAfter(k);\n      }\n    }\n  }\n  public collectHullPointsInArray(points: Point3d[], kStart: number, numK: number, _sign: number) {\n    points.length = 0;\n    if (numK > 2) {\n      let k = kStart;\n      for (let i = 0; i < numK; i++) {\n        points.push(this._points[k]);\n        k = this.indexAfter(k);\n      }\n    }\n  }\n  private buildHullTreeGo(\n    root: AlternatingCCTreeNode, isPositiveArea: boolean, recurseToChildren: boolean = true,\n  ): boolean {\n    this.collectHullChain(root.startIdx, root.numPoints, isPositiveArea ? 1.0 : -1.0);\n    root.points.length = 0;\n    const stack = this._stack;\n    const points = this._points;\n    const stackLen = stack.length;\n\n    for (let i = 0; i < stackLen; i++) {\n      const k0 = stack[i];\n      root.points.push(points[k0]);\n      if (i + 1 < stackLen) {\n        let k1 = stack[i + 1];\n        if (k1 === this.indexAfter(k0)) {\n          // two original points in sequence -- need a clip plane right here!!!\n          const plane = ClipPlane.createEdgeAndUpVector(\n            points[k0], points[k1], Vector3d.create(0, 0, 1), Angle.createRadians(0),\n          );\n          if (plane !== undefined) {\n            if (isPositiveArea)\n              plane.negateInPlace();\n            root.addPlane(plane);\n          }\n        } else {\n          if (k1 < k0)\n            k1 += this.period;\n          root.addEmptyChild(k0, k1 - k0 + 1);\n        }\n      }\n    }\n    if (recurseToChildren) {\n      for (const child of root.children)\n        this.buildHullTreeGo(child, !isPositiveArea);\n    } else {\n      for (const child of root.children)\n        this.collectHullPointsInArray(child.points, child.startIdx, child.numPoints, isPositiveArea ? -1.0 : 1.0);\n    }\n    return true;    // Are there failure modes? What happens with crossing data?..\n  }\n  /**\n   * <ul>\n   * <li> Input a ClipTreeRoot that has start and count data\n   * <li> Build the hull for that data range\n   * <li> Store the hull points in the root\n   * <li> Add children with start and count data\n   * <li> Recursively move to children\n   * </ul>\n   */\n  public buildHullAndInletsForPolygon(root: AlternatingCCTreeNode): boolean {\n    AlternatingCCTreeNode.createWithIndices(this.indexOfMaxX, this.period + 1, root);\n    return this.buildHullTreeGo(root, true, false);\n  }\n  /**\n   * <ul>\n   * <li> Input a ClipTreeRoot that has start and count data\n   * <li> Build the hull for that data range\n   * <li> Store the hull points in the root\n   * <li> Add children with start and count data\n   * <li> Recursively move to children\n   * </ul>\n   */\n  public buildHullTree(root: AlternatingCCTreeNode): boolean {\n    AlternatingCCTreeNode.createWithIndices(this.indexOfMaxX, this.period + 1, root);\n    return this.buildHullTreeGo(root, true);\n  }\n}\n\nexport class AlternatingCCTreeNodeCurveClipper {\n  private _curve: CurvePrimitive | undefined;\n  private _intervalStack: Range1d[][];\n  private _stackDepth: number;\n\n  public constructor() {\n    this._stackDepth = 0;\n    this._intervalStack = [];\n  }\n\n  private setCurveRef(curve: CurvePrimitive) { this._curve = curve; }\n  private popSegmentFrame() {\n    if (this._stackDepth > 0) {\n      this._topOfStack.length = 0;    // formality.\n      this._stackDepth -= 1;\n    }\n  }\n  private clearSegmentStack() {\n    while (this._stackDepth > 0)\n      this.popSegmentFrame();     // and that will reduce stack depth\n  }\n  private pushEmptySegmentFrame() {\n    this._stackDepth += 1;\n    while (this._intervalStack.length < this._stackDepth)\n      this._intervalStack.push([]);\n    this._topOfStack.length = 0;\n  }\n  private get _topOfStack(): Range1d[] { return this._intervalStack[this._stackDepth - 1]; }\n  // set the top of the stack (as defined by stackDepth -- not array length)\n  private set _topOfStack(value: Range1d[]) {\n    const n = this._stackDepth;\n    if (n > 0)\n      this._intervalStack[n - 1] = value;\n  }\n  /** Access entry [topOfStack() - numSkip] */\n  private stackEntry(numSkip: number): Range1d[] {\n    if (numSkip <= this._stackDepth)\n      return this._intervalStack[this._stackDepth - 1 - numSkip];\n    else\n      return [];\n  }\n  private isTopOfStackEmpty(): boolean {\n    return this._topOfStack.length === 0;\n  }\n  // Is re-used by method calls\n  private static _fractionIntervals: number[] = [];\n  private appendSingleClipToStack(planes: ConvexClipPlaneSet, insideSegments: Range1d[]): boolean {\n    const fractionIntervals = AlternatingCCTreeNodeCurveClipper._fractionIntervals;\n\n    if (this._curve instanceof LineSegment3d) {\n      const segment = this._curve;\n      let f0: number;\n      let f1: number;\n      if (segment.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => { f0 = a0; f1 = a1; })) {\n        insideSegments.push(Range1d.createXX(f0!, f1!));\n      }\n      return true;\n\n    } else if (this._curve instanceof Arc3d) {\n      const arc = this._curve;\n      fractionIntervals.length = 0;\n      arc.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => {\n        fractionIntervals.push(a0); fractionIntervals.push(a1);\n      });\n      for (let i = 0; i < fractionIntervals.length; i += 2)\n        insideSegments.push(Range1d.createXX(fractionIntervals[i], fractionIntervals[i + 1]));\n      return true;\n\n    } else if (this._curve instanceof LineString3d && (this._curve).points.length > 1) {\n      const linestring = this._curve;\n      let f0: number;\n      let f1: number;\n      const nPoints = linestring.points.length;\n      const df = 1.0 / (nPoints - 1);\n      for (let i = 0; i < nPoints - 1; i++) {\n        const segment = LineSegment3d.create(linestring.points[i], linestring.points[i + 1]);\n        if (segment.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => { f0 = a0; f1 = a1; })) {\n          insideSegments.push(Range1d.createXX((i + f0!) * df, (i + f1!) * df));\n        }\n      }\n      return true;\n\n    } else if (this._curve instanceof BSplineCurve3d) {\n      const bcurve = this._curve;\n      fractionIntervals.length = 0;\n      bcurve.announceClipIntervals(planes, (a0: number, a1: number, _cp: CurvePrimitive) => {\n        fractionIntervals.push(a0); fractionIntervals.push(a1);\n      });\n      for (let i = 0; i < fractionIntervals.length; i += 2)\n        insideSegments.push(Range1d.createXX(fractionIntervals[i], fractionIntervals[i + 1]));\n      return true;\n    }\n\n    return false;\n  }\n  /**\n   * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack\n   * has clip for this node (expensive -- must clone items of arrays during \"swaps\").\n   */\n  private recurse(node: AlternatingCCTreeNode) {\n    this.pushEmptySegmentFrame();\n    this.appendSingleClipToStack(node.planes, this._topOfStack);\n    Range1dArray.sort(this._topOfStack);\n    if (this.isTopOfStackEmpty())\n      return;\n    for (const child of node.children) {\n      this.recurse(child);\n      if (!this.isTopOfStackEmpty()) {\n        const ranges = Range1dArray.differenceSorted(this.stackEntry(1), this.stackEntry(0));\n        this.popSegmentFrame();\n        this._topOfStack = ranges;\n      } else {\n        this.popSegmentFrame();\n      }\n      if (this.isTopOfStackEmpty())\n        break;\n    }\n  }\n  /**\n   * Modifies the insideIntervals array given in place.\n   * Note: curve given is passed by reference and stored.\n   */\n  public appendSingleClipPrimitive(root: AlternatingCCTreeNode, curve: CurvePrimitive,\n    insideIntervals: CurveLocationDetailPair[], _outsideIntervals: CurveLocationDetailPair[]) {\n    this.setCurveRef(curve);\n    this.clearSegmentStack();\n    this.recurse(root);\n    if (this._stackDepth !== 1)\n      return;\n    const intervals = this._topOfStack;\n    for (const interval of intervals) {\n      const f0 = interval.low;\n      const f1 = interval.high;\n      const xyz0 = curve.fractionToPoint(f0);\n      const xyz1 = curve.fractionToPoint(f1);\n      insideIntervals.push(CurveLocationDetailPair.createCapture(\n        CurveLocationDetail.createCurveFractionPoint(curve, f0, xyz0),\n        CurveLocationDetail.createCurveFractionPoint(curve, f1, xyz1),\n      ));\n    }\n    this.popSegmentFrame();\n  }\n  /**\n   * Modifies the insideIntervals array given in place.\n   * Note: curve given is passed by reference and stored.\n   */\n  public appendCurveCollectionClip(root: AlternatingCCTreeNode, curve: CurveCollection,\n    insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]) {\n    for (const cp of curve.children) {\n      if (cp instanceof CurvePrimitive)\n        this.appendSingleClipPrimitive(root, cp, insideIntervals, outsideIntervals);\n      else if (cp instanceof CurveCollection)\n        this.appendCurveCollectionClip(root, cp, insideIntervals, outsideIntervals);\n    }\n  }\n}\n"]}

package/lib/esm/clipping/ClipPlane.js

@@ -362,6 +362,7 @@ export class ClipPlane extends Plane3d {
         const gamma = this.velocity(arcVectors.vector90);
         AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, undefined, undefined, intersectionRadians);
     }
+    static { this._clipArcFractionArray = new GrowableFloat64Array(); }
     /**
      * Announce fractional intervals of arc clip.
      * * Each call to `announce(fraction0, fraction1, arc)` announces one interval that is inside the clip plane.
@@ -555,5 +556,4 @@ export class ClipPlane extends Plane3d {
         return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);
     }
 }
-ClipPlane._clipArcFractionArray = new GrowableFloat64Array();
 //# sourceMappingURL=ClipPlane.js.map

package/lib/esm/clipping/ClipPlane.js.map

@@ -1 +1 @@
-{"version":3,"file":"ClipPlane.js","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAElD,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,8BAA8B,EAAE,MAAM,0BAA0B,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGpD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAW,aAAa,EAAkB,MAAM,aAAa,CAAC;AAkBrE;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,SAAU,SAAQ,OAAO;IAWpC,YAAoB,MAAgB,EAAE,QAAgB,EAAE,SAAkB,EAAE,QAAiB;QAC3F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,CAAC,mBAAmB,GAAG,QAAQ,CAAC;IACtC,CAAC;IACD;;;;;MAKE;IACF;;;OAGG;IACI,aAAa,CAAC,KAAgB;QACnC,OAAO,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,CAAC;eAChF,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;eACrD,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;eAClC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;IAC5C,CAAC;IACD,4BAA4B;IACrB,KAAK;QACV,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,mBAAmB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,YAAY;QACjB,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,mBAAmB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACnH,KAAK,CAAC,aAAa,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,4DAA4D;IACrD,MAAM,CAAC,WAAW,CACvB,KAAmC,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE9G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACvE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;YAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;YAC5B,MAAM,CAAC,aAAa,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACpF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAgB,EAAE,QAAgB,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE7G,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC;gBAClC,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,KAAc,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE3G,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC;gBAClC,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EACf,OAAiB,EACjB,OAAiB,EACjB,YAAqB,KAAK,EAC1B,WAAoB,KAAK,EACzB,MAAkB;QAElB,MAAM,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACpF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,0BAA0B,CACtC,OAAe,EAAE,OAAe,EAAE,OAAe,EACjD,OAAe,EAAE,OAAe,EAAE,OAAe,EACjD,YAAqB,KAAK,EAAE,WAAoB,KAAK,EACrD,MAAkB;QAElB,MAAM,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3F,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;YACtE,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACrG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM;QACX,MAAM,KAAK,GAAmB;YAC5B,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE;YACrC,IAAI,EAAE,IAAI,CAAC,QAAQ;SACpB,CAAC;QACF,IAAI,IAAI,CAAC,QAAQ;YACf,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;QACxB,IAAI,IAAI,CAAC,SAAS;YAChB,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8CAA8C;IACvC,MAAM,CAAC,QAAQ,CAAC,IAAoB,EAAE,MAAkB;QAC7D,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9E,OAAO,SAAS,CAAC,uBAAuB,CACtC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAC7E,CAAC;QACJ,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtF,CAAC;IACD,iDAAiD;IAC1C,QAAQ,CAAC,SAAkB,EAAE,QAAiB;QACnD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC5B,CAAC;IACD,qDAAqD;IACrD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IACD,kDAAkD;IAClD,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD,0CAA0C;IAC1C,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,qBAAqB,CACjC,MAAe,EAAE,MAAe,EAAE,QAAkB,EAAE,SAAiB,EAAE,MAAkB;QAE3F,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAE7D,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC;gBACvD,MAAM,UAAU,GAAG,QAAQ,CAAC,8BAA8B,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBAC1F,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtB,OAAO,SAAS,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0FAA0F;IACnF,MAAM,CAAC,YAAY,CAAC,MAAe,EAAE,MAAe,EAAE,MAAkB;QAC7E,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,MAAM,CAAC,gBAAgB,EAAE;YAC3B,OAAO,SAAS,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,UAAU;QACf,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACnC,yDAAyD;QACzD,OAAO,4BAA4B,CAAC,MAAM,CACxC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5F,IAAI,CAAC,aAAa,CAClB,CAAC;IACL,CAAC;IACD;;;;OAIG;IACI,UAAU;QACf,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAE,IAAI,CAAC,mBAAmB,CAC7F,CAAC;IACJ,CAAC;IACD;;;;;;OAMG;IACI,UAAU,CAAC,KAAc;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,KAAc;QACpC,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACjC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,KAAc;QAC5B,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACjC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,IAAI,CAAC,mBAAmB,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC3B,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACxB,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACxB,IAAI,CAAC,mBAAmB,CAAC;IAC/B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,6GAA6G;IACtG,QAAQ,CAAC,MAAgB;QAC9B,OAAO,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC7G,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxF,CAAC;IACD;;;OAGG;IACI,0BAA0B,CAAC,KAAc;QAC9C,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1G,CAAC;IACD;;;;OAIG;IACI,iBAAiB,CAAC,UAAmB,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAC5F,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACtC,IAAI,SAAS,EAAE,CAAC;YAAC,KAAK,IAAI,SAAS,CAAC;QAAC,CAAC;QACtC,OAAO,KAAK,IAAI,GAAG,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,KAAc,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QACnF,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAS,EAAE,CAAC;YAAC,KAAK,IAAI,SAAS,CAAC;QAAC,CAAC;QACtC,OAAO,KAAK,GAAG,GAAG,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,SAAS,CAAC,KAAc,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,yBAAyB,CAAC,GAAU,EAAE,mBAAyC;QACpF,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjD,aAAa,CAAC,yCAAyC,CACrD,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,mBAAmB,CAC9D,CAAC;IACJ,CAAC;IAED;;;OAGG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,MAAM,MAAM,GAAG,SAAS,CAAC,qBAAqB,CAAC;QAC/C,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,yBAAyB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5C,GAAG,CAAC,KAAK,CAAC,uCAAuC,CAAC,MAAM,CAAC,CAAC;QAC1D,OAAO,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD;;;;;OAKG;IACI,mCAAmC,CAAC,MAAe,EAAE,MAAe;QACzE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,CAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,qGAAqG;IAC9F,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,KAAK,GAAiC,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAa,SAAS,CAAC,MAAM,CAAC;QAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,eAAe,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACjE,gEAAgE;QAChE,uGAAuG;QACvG,MAAM,SAAS,GAAG,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,SAAS;YACZ,OAAO,KAAK,CAAC;QAEf,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;QACtD,IAAI,CAAC,UAAU;YACb,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,aAAa,GAAG,UAAU,CAAC;QAChC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QAC/E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,YAAY,CAAC,SAAkB;QACpC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,0EAA0E;IACnE,aAAa;QAClB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,mBAAmB,GAAG,CAAE,IAAI,CAAC,mBAAmB,CAAC;IACxD,CAAC;IACD;;;OAGG;IACI,cAAc,CAAC,MAAc;QAClC,IAAI,CAAC,mBAAmB,IAAI,MAAM,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAqB,EACrB,IAAsB,EACtB,SAAkB,IAAI,EACtB,YAAoB,QAAQ,CAAC,mBAAmB;QAEhD,OAAO,8BAA8B,CAAC,wBAAwB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACrG,CAAC;IACD;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QAChG,MAAM,KAAK,GAAY,IAAI,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,OAAO;gBACT,OAAO,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACjE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,SAAS;YACX,MAAM,CAAC,wBAAwB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;;YAE9C,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAAyD;QAEnH,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,MAAM,EAAE,GAAG,CAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,CAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC,CAAC,wCAAwC;YAC7D,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;gBAAC,IAAI,QAAQ;oBAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBAAC,OAAO,IAAI,CAAC;YAAC,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB;YAClC,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,kBAAkB;YAClB,IAAI,CAAC,GAAG,EAAE;gBACR,EAAE,GAAG,CAAC,CAAC;QACX,CAAC;QACD,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ;YAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,QAAQ;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACnC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5G,MAAM,MAAM,GAAG,QAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;QAC9E,OAAO,SAAS,CAAC,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,KAAc,EAAE,kBAA2B,KAAK;QACpE,IAAI,KAAK,CAAC,MAAM;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACrC,YAAY,CAAC,kCAAkC,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG;YAC5C,OAAO,SAAS,CAAC;QACnB,kCAAkC;QAClC,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACtC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC;QAC9C,8BAA8B,CAAC,kCAAkC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,eAAe;YACjB,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,MAAM,kBAAkB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC9C,8BAA8B,CAAC,oCAAoC,CACjE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,CACrD,CAAC;QACF,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QACvE,aAAa,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC3E,CAAC;IACD,6CAA6C;IACtC,mBAAmB,CAAC,UAAmB,EAAE,MAAgB;QAC9D,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACrC,OAAO,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAClH,CAAC;;AAxMc,+BAAqB,GAAG,IAAI,oBAAoB,EAAE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AxisOrder, Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Plane3d } from \"../geometry3d/Plane3d\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { IndexedXYZCollectionPolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XYZProps } from \"../geometry3d/XYZProps\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { AnalyticRoots } from \"../numerics/Polynomials\";\nimport { Clipper, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\n\n/**\n * Wire format describing a [[ClipPlane]].\n * If either [[normal]] or [[dist]] are omitted, defaults to a normal of [[Vector3d.unitZ]] and a distance of zero.\n * @public\n */\nexport interface ClipPlaneProps {\n  /** The plane's inward normal. */\n  normal?: XYZProps;\n  /** The plane's signed distance from the origin. */\n  dist?: number;\n  /** Defaults to `false`. */\n  invisible?: boolean;\n  /** Defaults to `false`. */\n  interior?: boolean;\n}\n\n/**\n * A ClipPlane is a single plane represented as\n * * An inward unit normal (u,v,w)\n * * A signedDistance\n * More details can be found at docs/learning/geometry/Clipping.md\n *\n * Hence\n * * The halfspace function evaluation for \"point\" (x,y,z) is `(x,y,z) DOT (u,v,w) - signedDistance`.\n * * POSITIVE values of the halfspace function are \"inside\".\n * * ZERO value of the halfspace function is \"on\".\n * * NEGATIVE value of the halfspace function is \"outside\".\n * * A representative point on the plane is (signedDistance * u, signedDistance * v, signedDistance * w).\n * * Given a point on the plane and the inward normal of the plane, `signedDistance = point DOT normal`.\n * @public\n */\nexport class ClipPlane extends Plane3d implements Clipper, PolygonClipper {\n  private _inwardNormal: Vector3d;\n  /**\n   * Construct a parallel plane through the origin.\n   * * Move it to the actual position.\n   * * _distanceFromOrigin is the distance it moved, with the (inward) normal direction as positive\n   */\n  private _distanceFromOrigin: number;\n  private _invisible: boolean;\n  private _interior: boolean;\n\n  private constructor(normal: Vector3d, distance: number, invisible: boolean, interior: boolean) {\n    super();\n    this._invisible = invisible;\n    this._interior = interior;\n    this._inwardNormal = normal;\n    this._distanceFromOrigin = distance;\n  }\n  /*\n    private safeSetXYZDistance(nx: number, ny: number, nz: number, d: number) {\n      this._inwardNormal.set(nx, ny, nz);\n      this._distanceFromOrigin = d;\n    }\n  */\n  /**\n   * Return true if all members are almostEqual to corresponding members of other.\n   * @param other clip plane to compare\n   */\n  public isAlmostEqual(other: ClipPlane): boolean {\n    return Geometry.isSameCoordinate(this._distanceFromOrigin, other._distanceFromOrigin)\n      && this._inwardNormal.isAlmostEqual(other._inwardNormal)\n      && this._interior === other._interior\n      && this._invisible === other._invisible;\n  }\n  /** Return a cloned plane */\n  public clone(): ClipPlane {\n    const result = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);\n    return result;\n  }\n  /** Return a cloned plane with coordinate data negated. */\n  public cloneNegated(): ClipPlane {\n    const plane = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);\n    plane.negateInPlace();\n    return plane;\n  }\n  /** Create a ClipPlane from Plane3dByOriginAndUnitNormal. */\n  public static createPlane(\n    plane: Plane3dByOriginAndUnitNormal, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane {\n    const distance = plane.getNormalRef().dotProduct(plane.getOriginRef());\n    if (result) {\n      result._invisible = invisible;\n      result._interior = interior;\n      result._inwardNormal = plane.getNormalRef().clone();\n      result._distanceFromOrigin = distance;\n      return result;\n    }\n    return new ClipPlane(plane.getNormalRef().clone(), distance, invisible, interior);\n  }\n  /**\n   * Create a ClipPlane with direct normal and signedDistance.\n   * * The vector is normalized for storage.\n   */\n  public static createNormalAndDistance(\n    normal: Vector3d, distance: number, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = normal.normalize();\n    if (normalized) {\n      if (result) {\n        result._invisible = invisible;\n        result._interior = interior;\n        result._inwardNormal = normalized;\n        result._distanceFromOrigin = distance;\n      }\n      return new ClipPlane(normalized, distance, invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Create a ClipPlane\n   * * \"normal\" is the inward normal of the plane (it is internally normalized).\n   * * \"point\" is any point of the plane.\n   * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz as\n   * a vector from the origin.)\n   */\n  public static createNormalAndPoint(\n    normal: Vector3d, point: Point3d, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = normal.normalize();\n    if (normalized) {\n      const distance = normalized.dotProduct(point);\n      if (result) {\n        result._invisible = invisible;\n        result._interior = interior;\n        result._inwardNormal = normalized;\n        result._distanceFromOrigin = distance;\n      }\n      return new ClipPlane(normalized, distance, invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Create a clip plane\n   * @param origin any point on the plane.\n   * @param vectorA any vector in the plane\n   * @param vectorB any vector in the plane\n   * @return undefined if the vectors are not independent.\n   * * The stored inward normal is vectorB.crossProduct(vectorA).\n   * * That is, the vectors are considered as a right-handed pair when viewed from the outside.\n   */\n  public static createOriginAndVectors(\n    origin: Point3d,\n    vectorA: Vector3d,\n    vectorB: Vector3d,\n    invisible: boolean = false,\n    interior: boolean = false,\n    result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = vectorB.crossProduct(vectorA);\n    return this.createNormalAndPoint(normalized, origin, invisible, interior, result);\n  }\n  /**\n   * Create a ClipPlane\n   * * \"normal\" (normalX, normalY, normalZ) is the inward normal of the plane.\n   * * \"point\" (originX,originY,originZ) is any point of the plane.\n   * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz\n   * as a vector from the origin.)\n   */\n  public static createNormalAndPointXYZXYZ(\n    normalX: number, normalY: number, normalZ: number,\n    originX: number, originY: number, originZ: number,\n    invisible: boolean = false, interior: boolean = false,\n    result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const q = Geometry.hypotenuseXYZ(normalX, normalY, normalZ);\n    const r = Geometry.conditionalDivideFraction(1, q);\n    if (r !== undefined) {\n      if (result) {\n        result._inwardNormal.set(normalX * r, normalY * r, normalZ * r);\n        result._distanceFromOrigin = result._inwardNormal.dotProductXYZ(originX, originY, originZ);\n        result._invisible = invisible;\n        result._interior = interior;\n        return result;\n      }\n      const normal = Vector3d.create(normalX * r, normalY * r, normalZ * r);\n      return new ClipPlane(normal, normal.dotProductXYZ(originX, originY, originZ), invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Return a json object of the form\n   * `{\"normal\":[u,v,w],\"dist\":signedDistanceValue,\"interior\":true,\"invisible\":true}`\n   */\n  public toJSON(): ClipPlaneProps {\n    const props: ClipPlaneProps = {\n      normal: this.inwardNormalRef.toJSON(),\n      dist: this.distance,\n    };\n    if (this.interior)\n      props.interior = true;\n    if (this.invisible)\n      props.invisible = true;\n    return props;\n  }\n  /** Parse json object to ClipPlane instance */\n  public static fromJSON(json: ClipPlaneProps, result?: ClipPlane): ClipPlane | undefined {\n    if (json && json.normal && undefined !== json.dist && Number.isFinite(json.dist))\n      return ClipPlane.createNormalAndDistance(\n        Vector3d.fromJSON(json.normal), json.dist, !!json.invisible, !!json.interior,\n      );\n    return ClipPlane.createNormalAndDistance(Vector3d.unitZ(), 0, false, false, result);\n  }\n  /** Set both the invisible and interior flags. */\n  public setFlags(invisible: boolean, interior: boolean) {\n    this._invisible = invisible;\n    this._interior = interior;\n  }\n  /** Return the stored distanceFromOrigin property. */\n  public get distance() {\n    return this._distanceFromOrigin;\n  }\n  /** * Return the stored inward normal property. */\n  public get inwardNormalRef(): Vector3d {\n    return this._inwardNormal;\n  }\n  /**  Return the \"interior\" property bit */\n  public get interior() {\n    return this._interior;\n  }\n  /**  Return the \"invisible\" property bit. */\n  public get invisible() {\n    return this._invisible;\n  }\n  /**\n   * Create a plane defined by two points, an up vector, and a tilt angle relative to the up vector.\n   * @param point0 start point of the edge\n   * @param point1 end point of the edge\n   * @param upVector vector perpendicular to the plane\n   * @param tiltAngle angle to tilt the plane around the edge in the direction of the up vector.\n   * @param result optional preallocated plane\n   */\n  public static createEdgeAndUpVector(\n    point0: Point3d, point1: Point3d, upVector: Vector3d, tiltAngle?: Angle, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const edgeVector = Vector3d.createFrom(point1.minus(point0));\n    let normal = (upVector.crossProduct(edgeVector)).normalize();\n\n    if (normal) {\n      if (tiltAngle !== undefined && !tiltAngle.isAlmostZero) {\n        const tiltNormal = Vector3d.createRotateVectorAroundVector(normal, edgeVector, tiltAngle);\n        if (tiltNormal) {\n          normal = tiltNormal.clone();\n        }\n      }\n      normal.negate(normal);\n      return ClipPlane.createNormalAndPoint(normal, point0, false, false, result);\n    }\n    return undefined;\n  }\n  /** Create a plane perpendicular to the edge between the xy parts of point0 and point1. */\n  public static createEdgeXY(point0: Point3d, point1: Point3d, result?: ClipPlane): ClipPlane | undefined {\n    const normal = Vector3d.create(point0.y - point1.y, point1.x - point0.x);\n    if (normal.normalizeInPlace())\n      return ClipPlane.createNormalAndPoint(normal, point0, false, false, result);\n    return undefined;\n  }\n  /**\n   * Return the Plane3d form of the plane.\n   * * The plane origin is the point `distance * inwardNormal`\n   * * The plane normal is the inward normal of the ClipPlane.\n   */\n  public getPlane3d(): Plane3dByOriginAndUnitNormal {\n    const d = this._distanceFromOrigin;\n    // normal should be normalized, will not return undefined\n    return Plane3dByOriginAndUnitNormal.create(\n      Point3d.create(this._inwardNormal.x * d, this._inwardNormal.y * d, this._inwardNormal.z * d),\n      this._inwardNormal,\n    )!;\n  }\n  /**\n   * Return the Point4d d form of the plane.\n   * * The homogeneous xyz are the inward normal xyz.\n   * * The homogeneous weight is the negated ClipPlane distance.\n   */\n  public getPlane4d(): Point4d {\n    return Point4d.create(\n      this._inwardNormal.x, this._inwardNormal.y, this._inwardNormal.z, - this._distanceFromOrigin,\n    );\n  }\n  /**\n   * Set the plane from DPoint4d style plane.\n   * * The saved plane has its direction normalized.\n   * * This preserves the plane itself as a zero set but make plane evaluations act as true distances (even if the\n   * plane coefficients are scaled otherwise).\n   * @param plane the DPoint4d style plane.\n   */\n  public setPlane4d(plane: Point4d) {\n    const a = Math.sqrt(plane.x * plane.x + plane.y * plane.y + plane.z * plane.z);\n    const r = a === 0.0 ? 1.0 : 1.0 / a;\n    this._inwardNormal.x = r * plane.x;\n    this._inwardNormal.y = r * plane.y;\n    this._inwardNormal.z = r * plane.z;\n    this._distanceFromOrigin = -r * plane.w;\n  }\n  /**\n   * Evaluate the altitude in weighted space, i.e. (dot product with inward normal) minus distance, with point.w\n   * scale applied to distance.\n   * @param point space point to test.\n   */\n  public weightedAltitude(point: Point4d): number {\n    return point.x * this._inwardNormal.x\n      + point.y * this._inwardNormal.y\n      + point.z * this._inwardNormal.z\n      - point.w * this._distanceFromOrigin;\n  }\n  /**\n   * Evaluate the distance from the plane to a point in space, i.e. (dot product with inward normal) minus distance.\n   * @param point space point to test.\n   */\n  public altitude(point: Point3d): number {\n    return point.x * this._inwardNormal.x\n      + point.y * this._inwardNormal.y\n      + point.z * this._inwardNormal.z\n      - this._distanceFromOrigin;\n  }\n  /**\n   * Evaluate the distance from the plane to a point in space with point given as x,y,z, i.e. (dot product with\n   * inward normal) minus distance.\n   * @param point space point to test.\n   */\n  public altitudeXYZ(x: number, y: number, z: number): number {\n    return x * this._inwardNormal.x\n      + y * this._inwardNormal.y\n      + z * this._inwardNormal.z\n      - this._distanceFromOrigin;\n  }\n  /** Return the x component of the normal used to evaluate altitude. */\n  public normalX(): number {\n    return this._inwardNormal.x;\n  }\n  /** Return the x component of the normal used to evaluate altitude. */\n  public normalY(): number {\n    return this._inwardNormal.y;\n  }\n  /** Return the z component of the normal used to evaluate altitude. */\n  public normalZ(): number {\n    return this._inwardNormal.z;\n  }\n  /** Return the dot product of the plane normal with the vector (NOT using the plane's distanceFromOrigin). */\n  public velocity(vector: Vector3d): number {\n    return vector.x * this._inwardNormal.x + vector.y * this._inwardNormal.y + vector.z * this._inwardNormal.z;\n  }\n  /**\n   * Return the dot product of the plane normal with the x,yz, vector components (NOT using the plane's\n   * distanceFromOrigin).\n   */\n  public velocityXYZ(x: number, y: number, z: number): number {\n    return x * this._inwardNormal.x + y * this._inwardNormal.y + z * this._inwardNormal.z;\n  }\n  /**\n   * Return the dot product of the plane normal with the point (treating the point xyz as a vector, and NOT\n   * using the plane's distanceFromOrigin).\n   */\n  public dotProductPlaneNormalPoint(point: Point3d): number {\n    return point.x * this._inwardNormal.x + point.y * this._inwardNormal.y + point.z * this._inwardNormal.z;\n  }\n  /**\n   * Return true if spacePoint is inside or on the plane, with tolerance applied to \"on\".\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointOnOrInside(spacePoint: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    let value = this.altitude(spacePoint);\n    if (tolerance) { value += tolerance; }\n    return value >= 0.0;\n  }\n  /**\n   * Return true if spacePoint is strictly inside the halfspace, with tolerance applied to \"on\".\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointInside(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    let value = this.altitude(point);\n    if (tolerance) { value -= tolerance; }\n    return value > 0.0;\n  }\n  /**\n   * Return true if spacePoint is strictly on the plane, within tolerance\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointOn(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    return Math.abs(this.altitude(point)) <= tolerance;\n  }\n  /**\n   * Compute intersections of an (UNBOUNDED) arc with the plane.  Append them (as radians) to a growing array.\n   * @param arc arc to test.  The angle limits of the arc are NOT considered.\n   * @param intersectionRadians array to receive results\n   */\n  public appendIntersectionRadians(arc: Arc3d, intersectionRadians: GrowableFloat64Array) {\n    const arcVectors = arc.toVectors();\n    const alpha = this.altitude(arc.center);\n    const beta = this.velocity(arcVectors.vector0);\n    const gamma = this.velocity(arcVectors.vector90);\n    AnalyticRoots.appendImplicitLineUnitCircleIntersections(\n      alpha, beta, gamma, undefined, undefined, intersectionRadians,\n    );\n  }\n  private static _clipArcFractionArray = new GrowableFloat64Array();\n  /**\n   * Announce fractional intervals of arc clip.\n   * * Each call to `announce(fraction0, fraction1, arc)` announces one interval that is inside the clip plane.\n   */\n  public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n    const breaks = ClipPlane._clipArcFractionArray;\n    breaks.clear();\n    this.appendIntersectionRadians(arc, breaks);\n    arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);\n    return ClipUtilities.selectIntervals01(arc, breaks, this, announce);\n  }\n  /**\n   * Compute intersection of (unbounded) segment with the plane.\n   * * If the ends are on the same side of the plane, return undefined.\n   * * If the intersection is an endpoint or interior to the segment return the fraction.\n   * * If both ends are on, return undefined.\n   */\n  public getBoundedSegmentSimpleIntersection(pointA: Point3d, pointB: Point3d): number | undefined {\n    const h0 = this.altitude(pointA);\n    const h1 = this.altitude(pointB);\n    if (h0 * h1 > 0.0)\n      return undefined;\n    if (h0 === 0.0 && h1 === 0.0) {\n      return undefined;\n    }\n    return - h0 / (h1 - h0);\n  }\n  /** Apply transform to the origin. Apply inverse transpose of the matrix part to th normal vector. */\n  public transformInPlace(transform: Transform): boolean {\n    const plane: Plane3dByOriginAndUnitNormal = this.getPlane3d();\n    const matrix: Matrix3d = transform.matrix;\n    const newPoint = transform.multiplyPoint3d(plane.getOriginRef());\n    // Normal transforms as the inverse transpose of the matrix part\n    // BTW: If the matrix is orthogonal, this is a long way to multiply by the matrix part (mumble grumble)\n    const newNormal = matrix.multiplyInverseTranspose(plane.getNormalRef());\n    if (!newNormal)\n      return false;\n\n    plane.set(newPoint, newNormal);\n    const normalized = (plane.getNormalRef()).normalize();\n    if (!normalized)\n      return false;\n    this._inwardNormal = normalized;\n    this._distanceFromOrigin = this._inwardNormal.dotProduct(plane.getOriginRef());\n    return true;\n  }\n  /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */\n  public setInvisible(invisible: boolean) {\n    this._invisible = invisible;\n  }\n  /** Reverse the sign of all coefficients, so outside and inside reverse */\n  public negateInPlace() {\n    this._inwardNormal = this._inwardNormal.negate();\n    this._distanceFromOrigin = - this._distanceFromOrigin;\n  }\n  /**\n   * Move the plane INWARD by given distance\n   * @param offset distance of shift inwards\n   */\n  public offsetDistance(offset: number) {\n    this._distanceFromOrigin += offset;\n  }\n  /**\n   * Clip a polygon to the inside or outside of the plane.\n   * * Results with 2 or fewer points are ignored.\n   * * Other than ensuring capacity in the arrays, there are no object allocations during execution of this function.\n   * @param xyz input points.\n   * @param work work buffer\n   * @param tolerance tolerance for \"on plane\" decision.\n   */\n  public clipConvexPolygonInPlace(\n    xyz: GrowableXYZArray,\n    work: GrowableXYZArray,\n    inside: boolean = true,\n    tolerance: number = Geometry.smallMetricDistance,\n  ) {\n    return IndexedXYZCollectionPolygonOps.clipConvexPolygonInPlace(this, xyz, work, inside, tolerance);\n  }\n  /**\n   * Multiply the ClipPlane's DPoint4d by matrix.\n   * @param matrix matrix to apply.\n   * @param invert if true, use in verse of the matrix.\n   * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\n   * @param matrix matrix to apply\n   * @return false if unable to invert\n   * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding\n   * effect on the plane is the inverse transpose of matrixA\n   * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\n   * * Both params default to true to get the full effect of transforming space.\n   */\n  public multiplyPlaneByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\n    const plane: Point4d = this.getPlane4d();\n    if (invert) {\n      const inverse = matrix.createInverse();\n      if (inverse)\n        return this.multiplyPlaneByMatrix4d(inverse, false, transpose);\n      return false;\n    }\n    if (transpose)\n      matrix.multiplyTransposePoint4d(plane, plane);\n    else\n      matrix.multiplyPoint4d(plane, plane);\n    this.setPlane4d(plane);\n    return true;\n  }\n  /** Announce the interval (if any) where a line is within the clip plane half space. */\n  public announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: (fraction0: number, fraction1: number) => void,\n  ): boolean {\n    if (f1 < f0)\n      return false;\n    const h0 = - this.altitude(pointA);\n    const h1 = - this.altitude(pointB);\n    const delta = h1 - h0;\n    const f = Geometry.conditionalDivideFraction(-h0, delta);\n    if (f === undefined) { // The segment is parallel to the plane.\n      if (h0 <= 0.0) { if (announce) announce(f0, f1); return true; }\n      return false;\n    }\n    if (delta > 0) { // segment aims OUT\n      if (f < f1) f1 = f;\n    } else {\n      // segment aims IN\n      if (f > f0)\n        f0 = f;\n    }\n    if (f1 < f0)\n      return false;\n    if (announce) announce(f0, f1);\n    return true;\n  }\n  /**\n   * Return a coordinate frame with\n   * * origin at closest point to global origin\n   * * z axis points in\n   * * x and y are \"in plane\"\n   */\n  public getFrame(): Transform {\n    const d = this._distanceFromOrigin;\n    const origin = Point3d.create(this._inwardNormal.x * d, this._inwardNormal.y * d, this._inwardNormal.z * d);\n    const matrix = Matrix3d.createRigidHeadsUp(this._inwardNormal, AxisOrder.ZXY);\n    return Transform.createOriginAndMatrix(origin, matrix);\n  }\n  /**\n   * Return the intersection of the plane with a range cube.\n   * @param range\n   * @param xyzOut intersection polygon.  This is convex.\n   */\n  public intersectRange(range: Range3d, addClosurePoint: boolean = false): GrowableXYZArray | undefined {\n    if (range.isNull)\n      return undefined;\n    const corners = range.corners();\n    const frameOnPlane = this.getFrame();\n    frameOnPlane.multiplyInversePoint3dArrayInPlace(corners);\n    const localRange = Range3d.createArray(corners);\n    if (localRange.low.z * localRange.high.z > 0.0)\n      return undefined;\n    // oversized polygon on local z= 0\n    const xyzOut = new GrowableXYZArray();\n    xyzOut.pushXYZ(localRange.low.x, localRange.low.y, 0);\n    xyzOut.pushXYZ(localRange.high.x, localRange.low.y, 0);\n    xyzOut.pushXYZ(localRange.high.x, localRange.high.y, 0);\n    xyzOut.pushXYZ(localRange.low.x, localRange.high.y, 0);\n    xyzOut.multiplyTransformInPlace(frameOnPlane);\n    IndexedXYZCollectionPolygonOps.intersectRangeConvexPolygonInPlace(range, xyzOut);\n    if (xyzOut.length === 0)\n      return undefined;\n    if (addClosurePoint)\n      xyzOut.pushWrap(1);\n    return xyzOut;\n  }\n  /**\n   * Implement appendPolygonClip, as defined in interface PolygonClipper.\n   * @param xyz convex polygon. This is not changed.\n   * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param arrayCache cache for reusable GrowableXYZArray.\n   */\n  public appendPolygonClip(\n    xyz: IndexedXYZCollection,\n    insideFragments: GrowableXYZArray[],\n    outsideFragments: GrowableXYZArray[],\n    arrayCache: GrowableXYZArrayCache,\n  ): void {\n    const perpendicularRange = Range1d.createNull();\n    const newInside = arrayCache.grabFromCache();\n    const newOutside = arrayCache.grabFromCache();\n    IndexedXYZCollectionPolygonOps.splitConvexPolygonInsideOutsidePlane(\n      this, xyz, newInside, newOutside, perpendicularRange,\n    );\n    ClipUtilities.captureOrDrop(newInside, 3, insideFragments, arrayCache);\n    ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);\n  }\n  /** Project a point in space to the plane. */\n  public projectPointToPlane(spacePoint: Point3d, result?: Point3d): Point3d {\n    const d = -this.altitude(spacePoint);\n    return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);\n  }\n}\n"]}
+{"version":3,"file":"ClipPlane.js","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAElD,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,8BAA8B,EAAE,MAAM,0BAA0B,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGpD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAW,aAAa,EAAkB,MAAM,aAAa,CAAC;AAkBrE;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,SAAU,SAAQ,OAAO;IAWpC,YAAoB,MAAgB,EAAE,QAAgB,EAAE,SAAkB,EAAE,QAAiB;QAC3F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,CAAC,mBAAmB,GAAG,QAAQ,CAAC;IACtC,CAAC;IACD;;;;;MAKE;IACF;;;OAGG;IACI,aAAa,CAAC,KAAgB;QACnC,OAAO,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,mBAAmB,EAAE,KAAK,CAAC,mBAAmB,CAAC;eAChF,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,KAAK,CAAC,aAAa,CAAC;eACrD,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;eAClC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;IAC5C,CAAC;IACD,4BAA4B;IACrB,KAAK;QACV,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,mBAAmB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpH,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,YAAY;QACjB,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,mBAAmB,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACnH,KAAK,CAAC,aAAa,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,4DAA4D;IACrD,MAAM,CAAC,WAAW,CACvB,KAAmC,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE9G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACvE,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;YAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;YAC5B,MAAM,CAAC,aAAa,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,CAAC;YACpD,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACtC,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,SAAS,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IACpF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAgB,EAAE,QAAgB,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE7G,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC;gBAClC,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,KAAc,EAAE,YAAqB,KAAK,EAAE,WAAoB,KAAK,EAAE,MAAkB;QAE3G,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QACtC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,QAAQ,GAAG,UAAU,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,MAAM,CAAC,aAAa,GAAG,UAAU,CAAC;gBAClC,MAAM,CAAC,mBAAmB,GAAG,QAAQ,CAAC;YACxC,CAAC;YACD,OAAO,IAAI,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAe,EACf,OAAiB,EACjB,OAAiB,EACjB,YAAqB,KAAK,EAC1B,WAAoB,KAAK,EACzB,MAAkB;QAElB,MAAM,UAAU,GAAG,OAAO,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC,oBAAoB,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACpF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,0BAA0B,CACtC,OAAe,EAAE,OAAe,EAAE,OAAe,EACjD,OAAe,EAAE,OAAe,EAAE,OAAe,EACjD,YAAqB,KAAK,EAAE,WAAoB,KAAK,EACrD,MAAkB;QAElB,MAAM,CAAC,GAAG,QAAQ,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QAC5D,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC,aAAa,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3F,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC9B,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;gBAC5B,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;YACtE,OAAO,IAAI,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;QACrG,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,MAAM;QACX,MAAM,KAAK,GAAmB;YAC5B,MAAM,EAAE,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE;YACrC,IAAI,EAAE,IAAI,CAAC,QAAQ;SACpB,CAAC;QACF,IAAI,IAAI,CAAC,QAAQ;YACf,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;QACxB,IAAI,IAAI,CAAC,SAAS;YAChB,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8CAA8C;IACvC,MAAM,CAAC,QAAQ,CAAC,IAAoB,EAAE,MAAkB;QAC7D,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9E,OAAO,SAAS,CAAC,uBAAuB,CACtC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAC7E,CAAC;QACJ,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IACtF,CAAC;IACD,iDAAiD;IAC1C,QAAQ,CAAC,SAAkB,EAAE,QAAiB;QACnD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC5B,CAAC;IACD,qDAAqD;IACrD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IACD,kDAAkD;IAClD,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD,0CAA0C;IAC1C,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,qBAAqB,CACjC,MAAe,EAAE,MAAe,EAAE,QAAkB,EAAE,SAAiB,EAAE,MAAkB;QAE3F,MAAM,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,IAAI,MAAM,GAAG,CAAC,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QAE7D,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,SAAS,KAAK,SAAS,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC;gBACvD,MAAM,UAAU,GAAG,QAAQ,CAAC,8BAA8B,CAAC,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;gBAC1F,IAAI,UAAU,EAAE,CAAC;oBACf,MAAM,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtB,OAAO,SAAS,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0FAA0F;IACnF,MAAM,CAAC,YAAY,CAAC,MAAe,EAAE,MAAe,EAAE,MAAkB;QAC7E,MAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACzE,IAAI,MAAM,CAAC,gBAAgB,EAAE;YAC3B,OAAO,SAAS,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;QAC9E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,UAAU;QACf,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACnC,yDAAyD;QACzD,OAAO,4BAA4B,CAAC,MAAM,CACxC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,EAC5F,IAAI,CAAC,aAAa,CAClB,CAAC;IACL,CAAC;IACD;;;;OAIG;IACI,UAAU;QACf,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAE,IAAI,CAAC,mBAAmB,CAC7F,CAAC;IACJ,CAAC;IACD;;;;;;OAMG;IACI,UAAU,CAAC,KAAc;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,KAAc;QACpC,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACjC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,KAAc;QAC5B,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACjC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC9B,IAAI,CAAC,mBAAmB,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cAC3B,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACxB,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;cACxB,IAAI,CAAC,mBAAmB,CAAC;IAC/B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,sEAAsE;IAC/D,OAAO;QACZ,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,6GAA6G;IACtG,QAAQ,CAAC,MAAgB;QAC9B,OAAO,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC7G,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,OAAO,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IACxF,CAAC;IACD;;;OAGG;IACI,0BAA0B,CAAC,KAAc;QAC9C,OAAO,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC1G,CAAC;IACD;;;;OAIG;IACI,iBAAiB,CAAC,UAAmB,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAC5F,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACtC,IAAI,SAAS,EAAE,CAAC;YAAC,KAAK,IAAI,SAAS,CAAC;QAAC,CAAC;QACtC,OAAO,KAAK,IAAI,GAAG,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,KAAc,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QACnF,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,SAAS,EAAE,CAAC;YAAC,KAAK,IAAI,SAAS,CAAC;QAAC,CAAC;QACtC,OAAO,KAAK,GAAG,GAAG,CAAC;IACrB,CAAC;IACD;;;;OAIG;IACI,SAAS,CAAC,KAAc,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,yBAAyB,CAAC,GAAU,EAAE,mBAAyC;QACpF,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACjD,aAAa,CAAC,yCAAyC,CACrD,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,mBAAmB,CAC9D,CAAC;IACJ,CAAC;aACc,0BAAqB,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,MAAM,MAAM,GAAG,SAAS,CAAC,qBAAqB,CAAC;QAC/C,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,IAAI,CAAC,yBAAyB,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC5C,GAAG,CAAC,KAAK,CAAC,uCAAuC,CAAC,MAAM,CAAC,CAAC;QAC1D,OAAO,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;IACtE,CAAC;IACD;;;;;OAKG;IACI,mCAAmC,CAAC,MAAe,EAAE,MAAe;QACzE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YAC7B,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,CAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IAC1B,CAAC;IACD,qGAAqG;IAC9F,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,KAAK,GAAiC,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9D,MAAM,MAAM,GAAa,SAAS,CAAC,MAAM,CAAC;QAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,eAAe,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACjE,gEAAgE;QAChE,uGAAuG;QACvG,MAAM,SAAS,GAAG,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,SAAS;YACZ,OAAO,KAAK,CAAC;QAEf,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;QACtD,IAAI,CAAC,UAAU;YACb,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,aAAa,GAAG,UAAU,CAAC;QAChC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC,CAAC;QAC/E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,YAAY,CAAC,SAAkB;QACpC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,0EAA0E;IACnE,aAAa;QAClB,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,mBAAmB,GAAG,CAAE,IAAI,CAAC,mBAAmB,CAAC;IACxD,CAAC;IACD;;;OAGG;IACI,cAAc,CAAC,MAAc;QAClC,IAAI,CAAC,mBAAmB,IAAI,MAAM,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAqB,EACrB,IAAsB,EACtB,SAAkB,IAAI,EACtB,YAAoB,QAAQ,CAAC,mBAAmB;QAEhD,OAAO,8BAA8B,CAAC,wBAAwB,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACrG,CAAC;IACD;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAgB,EAAE,SAAkB,IAAI,EAAE,YAAqB,IAAI;QAChG,MAAM,KAAK,GAAY,IAAI,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,IAAI,OAAO;gBACT,OAAO,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACjE,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,SAAS;YACX,MAAM,CAAC,wBAAwB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;;YAE9C,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,uFAAuF;IAChF,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAAyD;QAEnH,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,MAAM,EAAE,GAAG,CAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,CAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,EAAE,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC,CAAC,wCAAwC;YAC7D,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;gBAAC,IAAI,QAAQ;oBAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBAAC,OAAO,IAAI,CAAC;YAAC,CAAC;YAC/D,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,mBAAmB;YAClC,IAAI,CAAC,GAAG,EAAE;gBAAE,EAAE,GAAG,CAAC,CAAC;QACrB,CAAC;aAAM,CAAC;YACN,kBAAkB;YAClB,IAAI,CAAC,GAAG,EAAE;gBACR,EAAE,GAAG,CAAC,CAAC;QACX,CAAC;QACD,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ;YAAE,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,QAAQ;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACnC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5G,MAAM,MAAM,GAAG,QAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC;QAC9E,OAAO,SAAS,CAAC,qBAAqB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACzD,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,KAAc,EAAE,kBAA2B,KAAK;QACpE,IAAI,KAAK,CAAC,MAAM;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACrC,YAAY,CAAC,kCAAkC,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG;YAC5C,OAAO,SAAS,CAAC;QACnB,kCAAkC;QAClC,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACtC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC;QAC9C,8BAA8B,CAAC,kCAAkC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,eAAe;YACjB,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,MAAM,kBAAkB,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,SAAS,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,UAAU,GAAG,UAAU,CAAC,aAAa,EAAE,CAAC;QAC9C,8BAA8B,CAAC,oCAAoC,CACjE,IAAI,EAAE,GAAG,EAAE,SAAS,EAAE,UAAU,EAAE,kBAAkB,CACrD,CAAC;QACF,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,CAAC,EAAE,eAAe,EAAE,UAAU,CAAC,CAAC;QACvE,aAAa,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;IAC3E,CAAC;IACD,6CAA6C;IACtC,mBAAmB,CAAC,UAAmB,EAAE,MAAgB;QAC9D,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACrC,OAAO,UAAU,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAClH,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumberCurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { AxisOrder, Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GrowableFloat64Array } from \"../geometry3d/GrowableFloat64Array\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Plane3d } from \"../geometry3d/Plane3d\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { IndexedXYZCollectionPolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XYZProps } from \"../geometry3d/XYZProps\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { AnalyticRoots } from \"../numerics/Polynomials\";\nimport { Clipper, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\n\n/**\n * Wire format describing a [[ClipPlane]].\n * If either [[normal]] or [[dist]] are omitted, defaults to a normal of [[Vector3d.unitZ]] and a distance of zero.\n * @public\n */\nexport interface ClipPlaneProps {\n  /** The plane's inward normal. */\n  normal?: XYZProps;\n  /** The plane's signed distance from the origin. */\n  dist?: number;\n  /** Defaults to `false`. */\n  invisible?: boolean;\n  /** Defaults to `false`. */\n  interior?: boolean;\n}\n\n/**\n * A ClipPlane is a single plane represented as\n * * An inward unit normal (u,v,w)\n * * A signedDistance\n * More details can be found at docs/learning/geometry/Clipping.md\n *\n * Hence\n * * The halfspace function evaluation for \"point\" (x,y,z) is `(x,y,z) DOT (u,v,w) - signedDistance`.\n * * POSITIVE values of the halfspace function are \"inside\".\n * * ZERO value of the halfspace function is \"on\".\n * * NEGATIVE value of the halfspace function is \"outside\".\n * * A representative point on the plane is (signedDistance * u, signedDistance * v, signedDistance * w).\n * * Given a point on the plane and the inward normal of the plane, `signedDistance = point DOT normal`.\n * @public\n */\nexport class ClipPlane extends Plane3d implements Clipper, PolygonClipper {\n  private _inwardNormal: Vector3d;\n  /**\n   * Construct a parallel plane through the origin.\n   * * Move it to the actual position.\n   * * _distanceFromOrigin is the distance it moved, with the (inward) normal direction as positive\n   */\n  private _distanceFromOrigin: number;\n  private _invisible: boolean;\n  private _interior: boolean;\n\n  private constructor(normal: Vector3d, distance: number, invisible: boolean, interior: boolean) {\n    super();\n    this._invisible = invisible;\n    this._interior = interior;\n    this._inwardNormal = normal;\n    this._distanceFromOrigin = distance;\n  }\n  /*\n    private safeSetXYZDistance(nx: number, ny: number, nz: number, d: number) {\n      this._inwardNormal.set(nx, ny, nz);\n      this._distanceFromOrigin = d;\n    }\n  */\n  /**\n   * Return true if all members are almostEqual to corresponding members of other.\n   * @param other clip plane to compare\n   */\n  public isAlmostEqual(other: ClipPlane): boolean {\n    return Geometry.isSameCoordinate(this._distanceFromOrigin, other._distanceFromOrigin)\n      && this._inwardNormal.isAlmostEqual(other._inwardNormal)\n      && this._interior === other._interior\n      && this._invisible === other._invisible;\n  }\n  /** Return a cloned plane */\n  public clone(): ClipPlane {\n    const result = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);\n    return result;\n  }\n  /** Return a cloned plane with coordinate data negated. */\n  public cloneNegated(): ClipPlane {\n    const plane = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);\n    plane.negateInPlace();\n    return plane;\n  }\n  /** Create a ClipPlane from Plane3dByOriginAndUnitNormal. */\n  public static createPlane(\n    plane: Plane3dByOriginAndUnitNormal, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane {\n    const distance = plane.getNormalRef().dotProduct(plane.getOriginRef());\n    if (result) {\n      result._invisible = invisible;\n      result._interior = interior;\n      result._inwardNormal = plane.getNormalRef().clone();\n      result._distanceFromOrigin = distance;\n      return result;\n    }\n    return new ClipPlane(plane.getNormalRef().clone(), distance, invisible, interior);\n  }\n  /**\n   * Create a ClipPlane with direct normal and signedDistance.\n   * * The vector is normalized for storage.\n   */\n  public static createNormalAndDistance(\n    normal: Vector3d, distance: number, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = normal.normalize();\n    if (normalized) {\n      if (result) {\n        result._invisible = invisible;\n        result._interior = interior;\n        result._inwardNormal = normalized;\n        result._distanceFromOrigin = distance;\n      }\n      return new ClipPlane(normalized, distance, invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Create a ClipPlane\n   * * \"normal\" is the inward normal of the plane (it is internally normalized).\n   * * \"point\" is any point of the plane.\n   * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz as\n   * a vector from the origin.)\n   */\n  public static createNormalAndPoint(\n    normal: Vector3d, point: Point3d, invisible: boolean = false, interior: boolean = false, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = normal.normalize();\n    if (normalized) {\n      const distance = normalized.dotProduct(point);\n      if (result) {\n        result._invisible = invisible;\n        result._interior = interior;\n        result._inwardNormal = normalized;\n        result._distanceFromOrigin = distance;\n      }\n      return new ClipPlane(normalized, distance, invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Create a clip plane\n   * @param origin any point on the plane.\n   * @param vectorA any vector in the plane\n   * @param vectorB any vector in the plane\n   * @return undefined if the vectors are not independent.\n   * * The stored inward normal is vectorB.crossProduct(vectorA).\n   * * That is, the vectors are considered as a right-handed pair when viewed from the outside.\n   */\n  public static createOriginAndVectors(\n    origin: Point3d,\n    vectorA: Vector3d,\n    vectorB: Vector3d,\n    invisible: boolean = false,\n    interior: boolean = false,\n    result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const normalized = vectorB.crossProduct(vectorA);\n    return this.createNormalAndPoint(normalized, origin, invisible, interior, result);\n  }\n  /**\n   * Create a ClipPlane\n   * * \"normal\" (normalX, normalY, normalZ) is the inward normal of the plane.\n   * * \"point\" (originX,originY,originZ) is any point of the plane.\n   * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz\n   * as a vector from the origin.)\n   */\n  public static createNormalAndPointXYZXYZ(\n    normalX: number, normalY: number, normalZ: number,\n    originX: number, originY: number, originZ: number,\n    invisible: boolean = false, interior: boolean = false,\n    result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const q = Geometry.hypotenuseXYZ(normalX, normalY, normalZ);\n    const r = Geometry.conditionalDivideFraction(1, q);\n    if (r !== undefined) {\n      if (result) {\n        result._inwardNormal.set(normalX * r, normalY * r, normalZ * r);\n        result._distanceFromOrigin = result._inwardNormal.dotProductXYZ(originX, originY, originZ);\n        result._invisible = invisible;\n        result._interior = interior;\n        return result;\n      }\n      const normal = Vector3d.create(normalX * r, normalY * r, normalZ * r);\n      return new ClipPlane(normal, normal.dotProductXYZ(originX, originY, originZ), invisible, interior);\n    }\n    return undefined;\n  }\n  /**\n   * Return a json object of the form\n   * `{\"normal\":[u,v,w],\"dist\":signedDistanceValue,\"interior\":true,\"invisible\":true}`\n   */\n  public toJSON(): ClipPlaneProps {\n    const props: ClipPlaneProps = {\n      normal: this.inwardNormalRef.toJSON(),\n      dist: this.distance,\n    };\n    if (this.interior)\n      props.interior = true;\n    if (this.invisible)\n      props.invisible = true;\n    return props;\n  }\n  /** Parse json object to ClipPlane instance */\n  public static fromJSON(json: ClipPlaneProps, result?: ClipPlane): ClipPlane | undefined {\n    if (json && json.normal && undefined !== json.dist && Number.isFinite(json.dist))\n      return ClipPlane.createNormalAndDistance(\n        Vector3d.fromJSON(json.normal), json.dist, !!json.invisible, !!json.interior,\n      );\n    return ClipPlane.createNormalAndDistance(Vector3d.unitZ(), 0, false, false, result);\n  }\n  /** Set both the invisible and interior flags. */\n  public setFlags(invisible: boolean, interior: boolean) {\n    this._invisible = invisible;\n    this._interior = interior;\n  }\n  /** Return the stored distanceFromOrigin property. */\n  public get distance() {\n    return this._distanceFromOrigin;\n  }\n  /** * Return the stored inward normal property. */\n  public get inwardNormalRef(): Vector3d {\n    return this._inwardNormal;\n  }\n  /**  Return the \"interior\" property bit */\n  public get interior() {\n    return this._interior;\n  }\n  /**  Return the \"invisible\" property bit. */\n  public get invisible() {\n    return this._invisible;\n  }\n  /**\n   * Create a plane defined by two points, an up vector, and a tilt angle relative to the up vector.\n   * @param point0 start point of the edge\n   * @param point1 end point of the edge\n   * @param upVector vector perpendicular to the plane\n   * @param tiltAngle angle to tilt the plane around the edge in the direction of the up vector.\n   * @param result optional preallocated plane\n   */\n  public static createEdgeAndUpVector(\n    point0: Point3d, point1: Point3d, upVector: Vector3d, tiltAngle?: Angle, result?: ClipPlane,\n  ): ClipPlane | undefined {\n    const edgeVector = Vector3d.createFrom(point1.minus(point0));\n    let normal = (upVector.crossProduct(edgeVector)).normalize();\n\n    if (normal) {\n      if (tiltAngle !== undefined && !tiltAngle.isAlmostZero) {\n        const tiltNormal = Vector3d.createRotateVectorAroundVector(normal, edgeVector, tiltAngle);\n        if (tiltNormal) {\n          normal = tiltNormal.clone();\n        }\n      }\n      normal.negate(normal);\n      return ClipPlane.createNormalAndPoint(normal, point0, false, false, result);\n    }\n    return undefined;\n  }\n  /** Create a plane perpendicular to the edge between the xy parts of point0 and point1. */\n  public static createEdgeXY(point0: Point3d, point1: Point3d, result?: ClipPlane): ClipPlane | undefined {\n    const normal = Vector3d.create(point0.y - point1.y, point1.x - point0.x);\n    if (normal.normalizeInPlace())\n      return ClipPlane.createNormalAndPoint(normal, point0, false, false, result);\n    return undefined;\n  }\n  /**\n   * Return the Plane3d form of the plane.\n   * * The plane origin is the point `distance * inwardNormal`\n   * * The plane normal is the inward normal of the ClipPlane.\n   */\n  public getPlane3d(): Plane3dByOriginAndUnitNormal {\n    const d = this._distanceFromOrigin;\n    // normal should be normalized, will not return undefined\n    return Plane3dByOriginAndUnitNormal.create(\n      Point3d.create(this._inwardNormal.x * d, this._inwardNormal.y * d, this._inwardNormal.z * d),\n      this._inwardNormal,\n    )!;\n  }\n  /**\n   * Return the Point4d d form of the plane.\n   * * The homogeneous xyz are the inward normal xyz.\n   * * The homogeneous weight is the negated ClipPlane distance.\n   */\n  public getPlane4d(): Point4d {\n    return Point4d.create(\n      this._inwardNormal.x, this._inwardNormal.y, this._inwardNormal.z, - this._distanceFromOrigin,\n    );\n  }\n  /**\n   * Set the plane from DPoint4d style plane.\n   * * The saved plane has its direction normalized.\n   * * This preserves the plane itself as a zero set but make plane evaluations act as true distances (even if the\n   * plane coefficients are scaled otherwise).\n   * @param plane the DPoint4d style plane.\n   */\n  public setPlane4d(plane: Point4d) {\n    const a = Math.sqrt(plane.x * plane.x + plane.y * plane.y + plane.z * plane.z);\n    const r = a === 0.0 ? 1.0 : 1.0 / a;\n    this._inwardNormal.x = r * plane.x;\n    this._inwardNormal.y = r * plane.y;\n    this._inwardNormal.z = r * plane.z;\n    this._distanceFromOrigin = -r * plane.w;\n  }\n  /**\n   * Evaluate the altitude in weighted space, i.e. (dot product with inward normal) minus distance, with point.w\n   * scale applied to distance.\n   * @param point space point to test.\n   */\n  public weightedAltitude(point: Point4d): number {\n    return point.x * this._inwardNormal.x\n      + point.y * this._inwardNormal.y\n      + point.z * this._inwardNormal.z\n      - point.w * this._distanceFromOrigin;\n  }\n  /**\n   * Evaluate the distance from the plane to a point in space, i.e. (dot product with inward normal) minus distance.\n   * @param point space point to test.\n   */\n  public altitude(point: Point3d): number {\n    return point.x * this._inwardNormal.x\n      + point.y * this._inwardNormal.y\n      + point.z * this._inwardNormal.z\n      - this._distanceFromOrigin;\n  }\n  /**\n   * Evaluate the distance from the plane to a point in space with point given as x,y,z, i.e. (dot product with\n   * inward normal) minus distance.\n   * @param point space point to test.\n   */\n  public altitudeXYZ(x: number, y: number, z: number): number {\n    return x * this._inwardNormal.x\n      + y * this._inwardNormal.y\n      + z * this._inwardNormal.z\n      - this._distanceFromOrigin;\n  }\n  /** Return the x component of the normal used to evaluate altitude. */\n  public normalX(): number {\n    return this._inwardNormal.x;\n  }\n  /** Return the x component of the normal used to evaluate altitude. */\n  public normalY(): number {\n    return this._inwardNormal.y;\n  }\n  /** Return the z component of the normal used to evaluate altitude. */\n  public normalZ(): number {\n    return this._inwardNormal.z;\n  }\n  /** Return the dot product of the plane normal with the vector (NOT using the plane's distanceFromOrigin). */\n  public velocity(vector: Vector3d): number {\n    return vector.x * this._inwardNormal.x + vector.y * this._inwardNormal.y + vector.z * this._inwardNormal.z;\n  }\n  /**\n   * Return the dot product of the plane normal with the x,yz, vector components (NOT using the plane's\n   * distanceFromOrigin).\n   */\n  public velocityXYZ(x: number, y: number, z: number): number {\n    return x * this._inwardNormal.x + y * this._inwardNormal.y + z * this._inwardNormal.z;\n  }\n  /**\n   * Return the dot product of the plane normal with the point (treating the point xyz as a vector, and NOT\n   * using the plane's distanceFromOrigin).\n   */\n  public dotProductPlaneNormalPoint(point: Point3d): number {\n    return point.x * this._inwardNormal.x + point.y * this._inwardNormal.y + point.z * this._inwardNormal.z;\n  }\n  /**\n   * Return true if spacePoint is inside or on the plane, with tolerance applied to \"on\".\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointOnOrInside(spacePoint: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    let value = this.altitude(spacePoint);\n    if (tolerance) { value += tolerance; }\n    return value >= 0.0;\n  }\n  /**\n   * Return true if spacePoint is strictly inside the halfspace, with tolerance applied to \"on\".\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointInside(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    let value = this.altitude(point);\n    if (tolerance) { value -= tolerance; }\n    return value > 0.0;\n  }\n  /**\n   * Return true if spacePoint is strictly on the plane, within tolerance\n   * @param spacePoint point to test.\n   * @param tolerance tolerance for considering \"near plane\" to be \"on plane\"\n   */\n  public isPointOn(point: Point3d, tolerance: number = Geometry.smallMetricDistance): boolean {\n    return Math.abs(this.altitude(point)) <= tolerance;\n  }\n  /**\n   * Compute intersections of an (UNBOUNDED) arc with the plane.  Append them (as radians) to a growing array.\n   * @param arc arc to test.  The angle limits of the arc are NOT considered.\n   * @param intersectionRadians array to receive results\n   */\n  public appendIntersectionRadians(arc: Arc3d, intersectionRadians: GrowableFloat64Array) {\n    const arcVectors = arc.toVectors();\n    const alpha = this.altitude(arc.center);\n    const beta = this.velocity(arcVectors.vector0);\n    const gamma = this.velocity(arcVectors.vector90);\n    AnalyticRoots.appendImplicitLineUnitCircleIntersections(\n      alpha, beta, gamma, undefined, undefined, intersectionRadians,\n    );\n  }\n  private static _clipArcFractionArray = new GrowableFloat64Array();\n  /**\n   * Announce fractional intervals of arc clip.\n   * * Each call to `announce(fraction0, fraction1, arc)` announces one interval that is inside the clip plane.\n   */\n  public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n    const breaks = ClipPlane._clipArcFractionArray;\n    breaks.clear();\n    this.appendIntersectionRadians(arc, breaks);\n    arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);\n    return ClipUtilities.selectIntervals01(arc, breaks, this, announce);\n  }\n  /**\n   * Compute intersection of (unbounded) segment with the plane.\n   * * If the ends are on the same side of the plane, return undefined.\n   * * If the intersection is an endpoint or interior to the segment return the fraction.\n   * * If both ends are on, return undefined.\n   */\n  public getBoundedSegmentSimpleIntersection(pointA: Point3d, pointB: Point3d): number | undefined {\n    const h0 = this.altitude(pointA);\n    const h1 = this.altitude(pointB);\n    if (h0 * h1 > 0.0)\n      return undefined;\n    if (h0 === 0.0 && h1 === 0.0) {\n      return undefined;\n    }\n    return - h0 / (h1 - h0);\n  }\n  /** Apply transform to the origin. Apply inverse transpose of the matrix part to th normal vector. */\n  public transformInPlace(transform: Transform): boolean {\n    const plane: Plane3dByOriginAndUnitNormal = this.getPlane3d();\n    const matrix: Matrix3d = transform.matrix;\n    const newPoint = transform.multiplyPoint3d(plane.getOriginRef());\n    // Normal transforms as the inverse transpose of the matrix part\n    // BTW: If the matrix is orthogonal, this is a long way to multiply by the matrix part (mumble grumble)\n    const newNormal = matrix.multiplyInverseTranspose(plane.getNormalRef());\n    if (!newNormal)\n      return false;\n\n    plane.set(newPoint, newNormal);\n    const normalized = (plane.getNormalRef()).normalize();\n    if (!normalized)\n      return false;\n    this._inwardNormal = normalized;\n    this._distanceFromOrigin = this._inwardNormal.dotProduct(plane.getOriginRef());\n    return true;\n  }\n  /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */\n  public setInvisible(invisible: boolean) {\n    this._invisible = invisible;\n  }\n  /** Reverse the sign of all coefficients, so outside and inside reverse */\n  public negateInPlace() {\n    this._inwardNormal = this._inwardNormal.negate();\n    this._distanceFromOrigin = - this._distanceFromOrigin;\n  }\n  /**\n   * Move the plane INWARD by given distance\n   * @param offset distance of shift inwards\n   */\n  public offsetDistance(offset: number) {\n    this._distanceFromOrigin += offset;\n  }\n  /**\n   * Clip a polygon to the inside or outside of the plane.\n   * * Results with 2 or fewer points are ignored.\n   * * Other than ensuring capacity in the arrays, there are no object allocations during execution of this function.\n   * @param xyz input points.\n   * @param work work buffer\n   * @param tolerance tolerance for \"on plane\" decision.\n   */\n  public clipConvexPolygonInPlace(\n    xyz: GrowableXYZArray,\n    work: GrowableXYZArray,\n    inside: boolean = true,\n    tolerance: number = Geometry.smallMetricDistance,\n  ) {\n    return IndexedXYZCollectionPolygonOps.clipConvexPolygonInPlace(this, xyz, work, inside, tolerance);\n  }\n  /**\n   * Multiply the ClipPlane's DPoint4d by matrix.\n   * @param matrix matrix to apply.\n   * @param invert if true, use in verse of the matrix.\n   * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)\n   * @param matrix matrix to apply\n   * @return false if unable to invert\n   * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding\n   * effect on the plane is the inverse transpose of matrixA\n   * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.\n   * * Both params default to true to get the full effect of transforming space.\n   */\n  public multiplyPlaneByMatrix4d(matrix: Matrix4d, invert: boolean = true, transpose: boolean = true): boolean {\n    const plane: Point4d = this.getPlane4d();\n    if (invert) {\n      const inverse = matrix.createInverse();\n      if (inverse)\n        return this.multiplyPlaneByMatrix4d(inverse, false, transpose);\n      return false;\n    }\n    if (transpose)\n      matrix.multiplyTransposePoint4d(plane, plane);\n    else\n      matrix.multiplyPoint4d(plane, plane);\n    this.setPlane4d(plane);\n    return true;\n  }\n  /** Announce the interval (if any) where a line is within the clip plane half space. */\n  public announceClippedSegmentIntervals(\n    f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: (fraction0: number, fraction1: number) => void,\n  ): boolean {\n    if (f1 < f0)\n      return false;\n    const h0 = - this.altitude(pointA);\n    const h1 = - this.altitude(pointB);\n    const delta = h1 - h0;\n    const f = Geometry.conditionalDivideFraction(-h0, delta);\n    if (f === undefined) { // The segment is parallel to the plane.\n      if (h0 <= 0.0) { if (announce) announce(f0, f1); return true; }\n      return false;\n    }\n    if (delta > 0) { // segment aims OUT\n      if (f < f1) f1 = f;\n    } else {\n      // segment aims IN\n      if (f > f0)\n        f0 = f;\n    }\n    if (f1 < f0)\n      return false;\n    if (announce) announce(f0, f1);\n    return true;\n  }\n  /**\n   * Return a coordinate frame with\n   * * origin at closest point to global origin\n   * * z axis points in\n   * * x and y are \"in plane\"\n   */\n  public getFrame(): Transform {\n    const d = this._distanceFromOrigin;\n    const origin = Point3d.create(this._inwardNormal.x * d, this._inwardNormal.y * d, this._inwardNormal.z * d);\n    const matrix = Matrix3d.createRigidHeadsUp(this._inwardNormal, AxisOrder.ZXY);\n    return Transform.createOriginAndMatrix(origin, matrix);\n  }\n  /**\n   * Return the intersection of the plane with a range cube.\n   * @param range\n   * @param xyzOut intersection polygon.  This is convex.\n   */\n  public intersectRange(range: Range3d, addClosurePoint: boolean = false): GrowableXYZArray | undefined {\n    if (range.isNull)\n      return undefined;\n    const corners = range.corners();\n    const frameOnPlane = this.getFrame();\n    frameOnPlane.multiplyInversePoint3dArrayInPlace(corners);\n    const localRange = Range3d.createArray(corners);\n    if (localRange.low.z * localRange.high.z > 0.0)\n      return undefined;\n    // oversized polygon on local z= 0\n    const xyzOut = new GrowableXYZArray();\n    xyzOut.pushXYZ(localRange.low.x, localRange.low.y, 0);\n    xyzOut.pushXYZ(localRange.high.x, localRange.low.y, 0);\n    xyzOut.pushXYZ(localRange.high.x, localRange.high.y, 0);\n    xyzOut.pushXYZ(localRange.low.x, localRange.high.y, 0);\n    xyzOut.multiplyTransformInPlace(frameOnPlane);\n    IndexedXYZCollectionPolygonOps.intersectRangeConvexPolygonInPlace(range, xyzOut);\n    if (xyzOut.length === 0)\n      return undefined;\n    if (addClosurePoint)\n      xyzOut.pushWrap(1);\n    return xyzOut;\n  }\n  /**\n   * Implement appendPolygonClip, as defined in interface PolygonClipper.\n   * @param xyz convex polygon. This is not changed.\n   * @param insideFragments Array to receive \"inside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param outsideFragments Array to receive \"outside\" fragments. Each fragment is a GrowableXYZArray grabbed\n   * from the cache. This is NOT cleared.\n   * @param arrayCache cache for reusable GrowableXYZArray.\n   */\n  public appendPolygonClip(\n    xyz: IndexedXYZCollection,\n    insideFragments: GrowableXYZArray[],\n    outsideFragments: GrowableXYZArray[],\n    arrayCache: GrowableXYZArrayCache,\n  ): void {\n    const perpendicularRange = Range1d.createNull();\n    const newInside = arrayCache.grabFromCache();\n    const newOutside = arrayCache.grabFromCache();\n    IndexedXYZCollectionPolygonOps.splitConvexPolygonInsideOutsidePlane(\n      this, xyz, newInside, newOutside, perpendicularRange,\n    );\n    ClipUtilities.captureOrDrop(newInside, 3, insideFragments, arrayCache);\n    ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);\n  }\n  /** Project a point in space to the plane. */\n  public projectPointToPlane(spacePoint: Point3d, result?: Point3d): Point3d {\n    const d = -this.altitude(spacePoint);\n    return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);\n  }\n}\n"]}

package/lib/esm/clipping/ClipUtils.js

@@ -74,6 +74,7 @@ export var ClipStatus;
  * @public
  */
 export class ClipUtilities {
+    static { this._selectIntervals01TestPoint = Point3d.create(); }
     /**
      * Augment the unsortedFractionsArray with 0 and 1
      * * sort
@@ -961,7 +962,6 @@ export class ClipUtilities {
         return UnionOfConvexClipPlaneSets.createConvexSets(newClippers);
     }
 }
-ClipUtilities._selectIntervals01TestPoint = Point3d.create();
 function moveFragments(fragments, destination, arrayCache) {
     if (destination === undefined)
         arrayCache.dropAllToCache(fragments);