npm - @itwin/core-geometry - Versions diffs - 5.10.2 → 5.11.0-dev.10 - Mend

@itwin/core-geometry 5.10.2 → 5.11.0-dev.10

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (82) hide show

package/CHANGELOG.md +1 -1
package/lib/cjs/bspline/BSplineCurve.d.ts +1 -1
package/lib/cjs/bspline/BSplineCurve.js +1 -1
package/lib/cjs/bspline/BSplineCurve.js.map +1 -1
package/lib/cjs/clipping/BooleanClipNode.d.ts +2 -2
package/lib/cjs/clipping/BooleanClipNode.js +2 -2
package/lib/cjs/clipping/BooleanClipNode.js.map +1 -1
package/lib/cjs/clipping/ClipPlane.d.ts +8 -2
package/lib/cjs/clipping/ClipPlane.d.ts.map +1 -1
package/lib/cjs/clipping/ClipPlane.js +8 -2
package/lib/cjs/clipping/ClipPlane.js.map +1 -1
package/lib/cjs/clipping/ClipPrimitive.d.ts +26 -24
package/lib/cjs/clipping/ClipPrimitive.d.ts.map +1 -1
package/lib/cjs/clipping/ClipPrimitive.js +44 -35
package/lib/cjs/clipping/ClipPrimitive.js.map +1 -1
package/lib/cjs/clipping/ClipUtils.js +1 -1
package/lib/cjs/clipping/ClipUtils.js.map +1 -1
package/lib/cjs/clipping/ClipVector.d.ts +4 -3
package/lib/cjs/clipping/ClipVector.d.ts.map +1 -1
package/lib/cjs/clipping/ClipVector.js +4 -3
package/lib/cjs/clipping/ClipVector.js.map +1 -1
package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts +2 -2
package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js +2 -2
package/lib/cjs/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
package/lib/cjs/curve/RegionOps.d.ts +1 -1
package/lib/cjs/curve/RegionOps.d.ts.map +1 -1
package/lib/cjs/curve/RegionOps.js +1 -1
package/lib/cjs/curve/RegionOps.js.map +1 -1
package/lib/cjs/serialization/BentleyGeometryFlatBuffer.d.ts +5 -2
package/lib/cjs/serialization/BentleyGeometryFlatBuffer.d.ts.map +1 -1
package/lib/cjs/serialization/BentleyGeometryFlatBuffer.js +5 -2
package/lib/cjs/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
package/lib/cjs/solid/RotationalSweep.d.ts +21 -5
package/lib/cjs/solid/RotationalSweep.d.ts.map +1 -1
package/lib/cjs/solid/RotationalSweep.js +27 -4
package/lib/cjs/solid/RotationalSweep.js.map +1 -1
package/lib/cjs/solid/SolidPrimitive.d.ts +7 -1
package/lib/cjs/solid/SolidPrimitive.d.ts.map +1 -1
package/lib/cjs/solid/SolidPrimitive.js +8 -1
package/lib/cjs/solid/SolidPrimitive.js.map +1 -1
package/lib/esm/bspline/BSplineCurve.d.ts +1 -1
package/lib/esm/bspline/BSplineCurve.js +1 -1
package/lib/esm/bspline/BSplineCurve.js.map +1 -1
package/lib/esm/clipping/BooleanClipNode.d.ts +2 -2
package/lib/esm/clipping/BooleanClipNode.js +2 -2
package/lib/esm/clipping/BooleanClipNode.js.map +1 -1
package/lib/esm/clipping/ClipPlane.d.ts +8 -2
package/lib/esm/clipping/ClipPlane.d.ts.map +1 -1
package/lib/esm/clipping/ClipPlane.js +8 -2
package/lib/esm/clipping/ClipPlane.js.map +1 -1
package/lib/esm/clipping/ClipPrimitive.d.ts +26 -24
package/lib/esm/clipping/ClipPrimitive.d.ts.map +1 -1
package/lib/esm/clipping/ClipPrimitive.js +44 -35
package/lib/esm/clipping/ClipPrimitive.js.map +1 -1
package/lib/esm/clipping/ClipUtils.js +1 -1
package/lib/esm/clipping/ClipUtils.js.map +1 -1
package/lib/esm/clipping/ClipVector.d.ts +4 -3
package/lib/esm/clipping/ClipVector.d.ts.map +1 -1
package/lib/esm/clipping/ClipVector.js +4 -3
package/lib/esm/clipping/ClipVector.js.map +1 -1
package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts +2 -2
package/lib/esm/clipping/UnionOfConvexClipPlaneSets.d.ts.map +1 -1
package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js +2 -2
package/lib/esm/clipping/UnionOfConvexClipPlaneSets.js.map +1 -1
package/lib/esm/curve/RegionOps.d.ts +1 -1
package/lib/esm/curve/RegionOps.d.ts.map +1 -1
package/lib/esm/curve/RegionOps.js +1 -1
package/lib/esm/curve/RegionOps.js.map +1 -1
package/lib/esm/serialization/BentleyGeometryFlatBuffer.d.ts +5 -2
package/lib/esm/serialization/BentleyGeometryFlatBuffer.d.ts.map +1 -1
package/lib/esm/serialization/BentleyGeometryFlatBuffer.js +5 -2
package/lib/esm/serialization/BentleyGeometryFlatBuffer.js.map +1 -1
package/lib/esm/solid/RotationalSweep.d.ts +21 -5
package/lib/esm/solid/RotationalSweep.d.ts.map +1 -1
package/lib/esm/solid/RotationalSweep.js +26 -4
package/lib/esm/solid/RotationalSweep.js.map +1 -1
package/lib/esm/solid/SolidPrimitive.d.ts +7 -1
package/lib/esm/solid/SolidPrimitive.d.ts.map +1 -1
package/lib/esm/solid/SolidPrimitive.js +6 -0
package/lib/esm/solid/SolidPrimitive.js.map +1 -1
package/package.json +3 -3

package/CHANGELOG.md CHANGED Viewed

@@ -1,6 +1,6 @@
 # Change Log - @itwin/core-geometry
-This log was last generated on Thu, 11 Jun 2026 21:09:38 GMT and should not be manually modified.
+This log was last generated on Thu, 11 Jun 2026 21:11:10 GMT and should not be manually modified.
 ## 5.10.2
 Thu, 11 Jun 2026 21:09:38 GMT

package/lib/cjs/bspline/BSplineCurve.d.ts CHANGED Viewed

@@ -98,7 +98,7 @@ export declare abstract class BSplineCurve3dBase extends CurvePrimitive {
     get order(): number;
     /**
      * Return the number of Bezier spans in the curve. Note that this number includes the number of null
-     * spans at repeated knows.
+     * spans at repeated knots.
      */
     get numSpan(): number;
     /** Return the number of poles. */

package/lib/cjs/bspline/BSplineCurve.js CHANGED Viewed

@@ -113,7 +113,7 @@ class BSplineCurve3dBase extends CurvePrimitive_1.CurvePrimitive {
     }
     /**
      * Return the number of Bezier spans in the curve. Note that this number includes the number of null
-     * spans at repeated knows.
+     * spans at repeated knots.
      */
     get numSpan() {
         return this._bcurve.numSpan;

package/lib/cjs/bspline/BSplineCurve.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"BSplineCurve.js","sourceRoot":"","sources":["../../../src/bspline/BSplineCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,sEAAsF;AACtF,4DAAyD;AACzD,yFAAsF;AACtF,mGAAgG;AAEhG,0DAAuD;AACvD,kEAA+D;AAE/D,0CAA+D;AAE/D,qEAAkE;AAElE,uFAAoF;AACpF,mEAAkE;AAClE,6DAA0D;AAC1D,+CAAuD;AACvD,+CAA4C;AAE5C,mDAAgD;AAChD,qEAAiE;AAEjE,6CAA0C;AAC1C,mDAAgD;AAChD,qDAAkD;AAElD,+CAA4C;AAC5C,uDAAoD;AAEpD,6CAA2D;AAE3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AACH,MAAsB,kBAAmB,SAAQ,+BAAc;IAC7D,yCAAyC;IACzB,kBAAkB,GAAG,cAAc,CAAC;IACpD,mEAAmE;IACzD,OAAO,CAAc;IACvB,eAAe,CAAO;IAC9B,IAAW,cAAc,CAAC,IAAS;QACjC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;IAC9B,CAAC;IACD,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD,YAAsB,aAAqB,EAAE,QAAgB,EAAE,KAAa,EAAE,KAAiB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,yBAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,aAAa,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IACD,gEAAgE;IAChE,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,4DAA4D;IAC5D,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAC9B,CAAC;IACD,kCAAkC;IAClC,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,CAAC;IACD,uDAAuD;IACvD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IACjC,CAAC;IACD,uDAAuD;IACvD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IACjC,CAAC;IACD,uHAAuH;IAChH,SAAS,CAAC,mBAA4B;QAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC3D,CAAC;IACD,sGAAsG;IAC/F,YAAY;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;IACtC,CAAC;IACD,sGAAsG;IAC/F,YAAY,CAAC,KAAsB;QACxC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;IACvC,CAAC;IACD;;;OAGG;IACH,IAAW,eAAe;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;QAC1C,IAAI,IAAI,KAAK,4BAAe,CAAC,IAAI;YAC/B,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC;YACxC,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC;YACzC,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAcD,kEAAkE;IAC3D,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/E,CAAC;IACD,2EAA2E;IACpE,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC/D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,8BAA8B,CAAC,QAAgB,EAAE,MAAkC;QACxF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,GAAG,IAAI,CAAC,0BAA0B,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC;QAC1C,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IAC3B,UAAU,CAAC,MAAgB;QACzC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,yCAAyC;IACzB,QAAQ,CAAC,MAAgB;QACvC,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IACD;;;;OAIG;IACI,cAAc;QACnB,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;IAChC,CAAC;IACD,0DAA0D;IACnD,kBAAkB,CAAC,SAAkB;QAC1C,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAC9D,IAAI,IAAI;oBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAyBD,8EAA8E;IACvE,oBAAoB,CAAC,SAAiB;QAC3C,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ;YAC7C,OAAO,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QAC7C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,UAAuC,KAAK,EAAE,MAA4B;QAE/F,8EAA8E;QAC9E,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,CAAC;QACpH,IAAI,IAAgC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,IAAI,GAAG,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAmB,CAAC;gBAC3E,IAAI,IAAI,EAAE,CAAC;oBACT,wFAAwF;oBACxF,IAAI,IAAI,CAAC,qCAAqC,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;wBAChF,qEAAqE;wBACrE,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;wBACpB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAGD,uCAAuC;IACvB,gBAAgB,CAAC,SAAoB;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,KAAK,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACa,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,KAAyB,CAAC;QAC9B,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1B,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrD,KAAK,CAAC,cAAc,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACrB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QACtD,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC1D,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC1D,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,YAAY,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;YACnD,OAAO,KAAK,CAAC,CAAC,aAAa;QAC7B,IAAI,KAAK,GAAG,KAAK;YACf,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAClC,yGAAyG;QACzG,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACrF,MAAM,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;QACzD,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,qBAAqB,GAAG,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACtG,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK;YAC9C,qBAAqB,GAAG,SAAS,GAAG,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,CAAC,qBAAqB,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,qBAAqB;QAC9F,MAAM,QAAQ,GAAG,qBAAqB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,qBAAqB;QAC5E,6CAA6C;QAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3F,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAChF,KAAK,CAAC,YAAY,CAAC,4BAAe,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACc,6BAA6B,CAAC,KAA6B,EAAE,MAA6B;QACxG,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,OAAO,GAAG,iBAAO,CAAC,MAAM,EAAE,CAAC;QACjC,4CAA4C;QAC5C,MAAM,MAAM,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAChC,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,oGAAoG;QACpG,kFAAkF;QAClF,6EAA6E;QAC7E,IAAI,gBAA8C,CAAC;QACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,gBAAgB,GAAG,CAAC,MAAM,CAAC;QAC/B,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,gCAAgC;oBACrF,uBAAuB;oBACvB,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,MAAM,CAAC,iBAAiB,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;oBACrD,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC1B,qDAAqD;wBACrD,gBAAgB,GAAG,oCAAgB,CAAC,iBAAiB,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;wBACpG,gCAAgC;wBAChC,uBAAU,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;wBACpF,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;wBAChD,IAAI,KAAK,EAAE,CAAC;4BACV,KAAK,MAAM,YAAY,IAAI,KAAK,EAAE,CAAC;gCACjC,uGAAuG;gCACvG,QAAQ,EAAE,CAAC;gCACX,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gCACpF,IAAI,CAAC,mBAAQ,CAAC,mBAAmB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,EAAE,CAAC;oCAC9D,MAAM,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oCAChF,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,QAAQ,CAAC;oCACjD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACpB,gBAAgB,GAAG,QAAQ,CAAC;gCAC9B,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAC3E,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AAtUD,gDAsUC;AACD;;;;GAIG;AACH,MAAa,cAAe,SAAQ,kBAAkB;IAC5C,WAAW,CAAiB;IAC5B,oBAAoB;QAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAChC,IAAI,CAAC,WAAW,GAAG,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,YAAoB,QAAgB,EAAE,KAAa,EAAE,KAAiB;QACpE,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,cAAc,CAAC;IACzC,CAAC;IACD,sCAAsC;IAC/B,mBAAmB,CAAC,SAAoB;QAC7C,2BAAY,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sCAAsC;IAC/B,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IACpC,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,OAAO,iBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,SAAiB,EAAE,YAAoB;QAC/D,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAClE,CAAC;IACD,gFAAgF;IACzE,UAAU;QACf,OAAO,2BAAY,CAAC,2BAA2B,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IACD,mDAAmD;IAC5C,sBAAsB;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IACD,uHAAuH;IACvG,SAAS,CAAC,mBAA4B;QACpD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC3D,CAAC;IACD,4CAA4C;IACrC,MAAM,CAAC,kBAAkB,CAC9B,KAAkD,EAAE,KAAa;QAEjE,MAAM,QAAQ,GAAG,KAAK,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QACjF,IAAI,KAAK,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK;YAC/B,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,uBAAU,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7E,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;aAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;YAC7C,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;QACxE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAkD,EAAE,KAAa;QAEjE,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ,GAAG,KAAK,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QAC/E,IAAI,QAAQ,GAAG,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,yBAAO,CAAC,UAAU,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,yBAAO,CAAC,UAAU,EAAE,CAAC;QACtC,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,GAAG,CAAC;YACF,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;gBAClC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1F,CAAC;iBAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;gBAC7C,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACrD,KAAK,CAAC,+BAA+B,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChE,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;YACD,IAAI,eAAe,GAAG,UAAU,CAAC,aAAa,CAAC,QAAQ,CAAC;gBACtD,EAAE,QAAQ,CAAC,CAAC,kCAAkC;QAClD,CAAC,QAAQ,eAAe,IAAI,QAAQ,GAAG,CAAC,EAAE;QAC1C,IAAI,QAAQ,GAAG,KAAK;YAClB,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;QACzB,MAAM,YAAY,GAAG,QAAQ,CAAC;QAC9B,MAAM,KAAK,GAAG,uBAAU,CAAC,oBAAoB,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9E,KAAK,CAAC,SAAS,GAAG,4BAAe,CAAC,yBAAyB,CAAC;QAC5D,iCAAiC;QACjC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClE,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;gBACjC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;gBACjC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,qCAAqC,CAAC,OAAoC;QACtF,OAAO,iCAAe,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6BAA6B,CAAC,OAA4B;QACtE,OAAO,iCAAe,CAAC,mBAAmB,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAE,YAAY;IACjF,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,MAAM,CAClB,SAAgD,EAAE,SAAkC,EAAE,KAAa;QAEnG,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,IAAI,SAAS,YAAY,YAAY;YACnC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACxD,IAAI,QAAQ,GAAG,KAAK;YAClB,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAClC,MAAM,gBAAgB,GAAG,CAAC,QAAQ,GAAG,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,mCAAmC;QAC7F,IAAI,CAAC,gBAAgB,IAAI,QAAQ,GAAG,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,eAAe;YACzE,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,uBAAU,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,SAAS,YAAY,YAAY,EAAE,CAAC;YACtC,KAAK,MAAM,UAAU,IAAI,SAAS;gBAChC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;QAC/C,CAAC;aAAM,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,yBAAO,EAAE,CAAC;YAC3C,KAAK,MAAM,CAAC,IAAI,SAAsB,EAAE,CAAC;gBACvC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,KAAK,MAAM,KAAK,IAAI,SAAuB;gBACzC,KAAK,MAAM,KAAK,IAAI,KAAK;oBACvB,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC,CAAC,4BAA4B;QAChD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2BAA2B;IACX,KAAK;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACxE,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,uEAAuE;IAChE,mBAAmB,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAgB;QAClF,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC5D,OAAO,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,gCAAgC,CAAC,SAAiB,EAAE,YAAoB;QAC7E,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7D,OAAO,aAAK,CAAC,aAAa,CACxB,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAC3C,0BAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAC9C,CAAC;IACJ,CAAC;IACD;;;;;OAKG;IACI,WAAW,CAAC,CAAS,EAAE,MAAgB;QAC5C,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD;;;;;OAKG;IACI,wBAAwB,CAAC,CAAS,EAAE,MAAc;QACvD,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM;YACT,OAAO,aAAK,CAAC,aAAa,CACxB,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAC3C,0BAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAC9C,CAAC;QACJ,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,0BAA0B,CAAC,CAAS,EAAE,MAAkC;QAC7E,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,qDAAyB,CAAC,yBAAyB,CACxD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAClF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EACrF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EACrF,MAAM,CACP,CAAC;IACJ,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;mBACvD,2BAAY,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACrF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2DAA2D;IACpD,SAAS,CAAC,KAAmC;QAClD,OAAO,2BAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,2BAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,OAAuB,EAAE,OAAuB;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,UAAU,CAAC;QACf,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAChF,IAAI,MAAM,EAAE,CAAC;gBACX,UAAU,GAAG,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC1D,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;oBAChC,OAAO,CAAC,mBAAmB,CACzB,MAAM,EACN,UAAU,EACV,IAAI,EACJ,SAAS,EACT,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAC1D,CAAC;gBAEJ,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,qCAAqC,CAC3C,IAAI,EACJ,UAAU,EACV,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAC1D,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM;gBACR,SAAS,IAAI,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;QACnG,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;gBAC/C,MAAM,kBAAkB,GAAG,UAAU,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC5E,MAAM,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACtE,CAAC;IACD,8CAA8C;IACvC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM;gBACR,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD;;;OAGG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,6BAA6B,CAClC,SAAiB,EAAE,SAAkB,EAAE,MAAwB;QAE/D,IAAI,SAAS;YACX,OAAO,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IACD;;;;OAIG;IACI,wBAAwB,CAAC,SAAiB,EAAE,MAAwB;QACzE,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,OAAO;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK;YACtF,MAAM,GAAG,6BAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,MAAuB,CAAC;QACvC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACzD,IAAI,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC;YACvD,OAAO,MAAM,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,yBAAyB,CAAC,SAAiB,EAAE,MAAwB;QAC1E,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,OAAO;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,+BAAc,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK;YACvF,MAAM,GAAG,+BAAc,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAwB,CAAC;QACxC,MAAM,CAAC,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC1E,IAAI,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC;YACvD,OAAO,MAAM,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,iFAAiF;IAC1E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;CACF;AAxbD,wCAwbC","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/** @packageDocumentation\n * @module Bspline\n /\n\nimport { VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\nimport { CurveIntervalRole, CurveLocationDetail } from \"../curve/CurveLocationDetail\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { CurveOffsetXYHandler } from \"../curve/internalContexts/CurveOffsetXYHandler\";\nimport { PlaneAltitudeRangeContext } from \"../curve/internalContexts/PlaneAltitudeRangeContext\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { OffsetOptions } from \"../curve/OffsetOptions\";\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { UnivariateBezier } from \"../numerics/BezierPolynomials\";\nimport { AkimaCurve3dOptions } from \"./AkimaCurve3d\";\nimport { Bezier1dNd } from \"./Bezier1dNd\";\nimport { BezierCurve3d } from \"./BezierCurve3d\";\nimport { BezierCurve3dH } from \"./BezierCurve3dH\";\nimport { BezierCurveBase } from \"./BezierCurveBase\";\nimport { BSpline1dNd } from \"./BSpline1dNd\";\nimport { BSplineCurveOps } from \"./BSplineCurveOps\";\nimport { InterpolationCurve3dOptions } from \"./InterpolationCurve3d\";\nimport { BSplineWrapMode, KnotVector } from \"./KnotVector\";\n\n/\n Base class for BSplineCurve3d and BSplineCurve3dH.\n * * A B-spline curve consists of an array of `knots`, an array of `poles`, and a `degree`.\n * * The knot array is a non-decreasing sequence of numbers. It is also called a \"knot vector\".\n * * The curve is a parametric function whose domain is a sub-range of its knots.\n * * The API sometimes refers to a domain parameter `u` as a \"knot\", even if `u` is not actually an entry in the\n * knot array.\n * * The curve loosely \"follows\" the line string formed by the poles, aka the \"control polygon\".\n * * The curve is a chain of polynomial segments, aka \"spans\" or \"fragments\". B-spline theory identifies these as\n * Bezier curves.\n * * The polynomial spans all have same `degree`.\n * * Each span is controlled by `order = degree + 1` contiguous points in the pole array.\n * * There is a strict relationship between knot and poles counts: `numPoles + order = numKnots + 2'.\n * * The number of spans is `numSpan = numPoles - degree`.\n * * For a span with index `spanIndex`:\n * * The `order` relevant poles begin at pole index `spanIndex`.\n * * The `2degree` relevant knots begin at knot index `spanIndex`.\n * The span domain is the knot range `[knot[spanIndex+degree-1], knot[spanIndex+degree]]`.\n * * The curve domain is the knot range `[knot[degree-1], knot[numSpan+degree-1]]`, or equivalently\n * `[knot[degree-1], knot[numPoles-1]]`. The API refers to this domain as the \"active knot interval\" of the curve.\n \n Nearly all B-spline curves are \"clamped\".\n * * This means that in the `knots` array, the first `degree` knots are equal, and the last `degree` knots are equal.\n * We say the smallest knot and the largest knot have multiplicity `degree`.\n * * Clamping make the curve pass through its first and last poles, with tangents directed along the first and\n * last edges of the control polygon.\n * * For instance, a cubic B-spline curve with knot vector `[0,0,0,1,2,3,3,3]`\n * * can be evaluated at parameter values in the range `[0, 3]`\n * * has 3 spans, with domains `[0, 1]`, `[1, 2]`, and `[2, 3]`\n * * has 6 poles\n * * passes through its first and last poles.\n * * The `create` methods may allow the classic convention that has an extra knot at the beginning and end of the\n * knot vector.\n * * These two extra knots are not actually needed to define the B-spline curve.\n * * When the `create` methods recognize the classic setup (`numPoles + order = numKnots`), the extra knots are\n * not saved with the BSplineCurve3dBase knots.\n \n * The weighted variant [[BSplineCurve3dH]] has the problem that `CurvePrimitive` 3D typing does not allow the\n * undefined result where a homogeneous pole has zero weight; the convention in this case is to return 000.\n \n * Note the class relationships:\n * * [[BSpline1dNd]] knows the definitional B-spline recurrence relation with no physical interpretation for the poles.\n * * BsplineCurve3dBase owns a protected BSpline1dNd.\n * * `BsplineCurve3dBase` is derived from [[CurvePrimitive]], which creates obligation to act as a 3D curve, e.g.,\n * * evaluate fraction to point and derivatives wrt fraction.\n * * compute intersection with plane.\n * * [[BSplineCurve3d]] and [[BSplineCurve3dH]] have variant logic driven by whether or not there are \"weights\" on the poles.\n * * For `BSplineCurve3d`, the xyz value of pole calculations are \"final\" values for 3d evaluation.\n * * For `BSplineCurve3dH`, various `BSpline1dNd` results with xyzw have to be normalized back to xyz.\n \n * These classes do not support \"periodic\" variants.\n * * Periodic curves historically have carried a flag (e.g., \"closed\") indicating that certain un-stored\n * leading/trailing knots and poles are understood to wrap around periodically.\n * * Instead, these classes carry no such flag. They represent such curves with explicitly wrapped knots/poles.\n \n * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/BSpline/\n * @public\n /\nexport abstract class BSplineCurve3dBase extends CurvePrimitive {\n /* String name for schema properties. /\n public readonly curvePrimitiveType = \"bsplineCurve\";\n /* The underlying blocked-pole spline, with simple x,y,z poles. /\n protected _bcurve: BSpline1dNd;\n private _definitionData?: any;\n public set definitionData(data: any) {\n this._definitionData = data;\n }\n public get definitionData(): any {\n return this._definitionData;\n }\n protected constructor(poleDimension: number, numPoles: number, order: number, knots: KnotVector) {\n super();\n this._bcurve = BSpline1dNd.create(numPoles, poleDimension, order, knots);\n }\n /* Return the degree (one less than the order) of the curve. /\n public get degree(): number {\n return this._bcurve.degree;\n }\n /* Return the order (one more than degree) of the curve. /\n public get order(): number {\n return this._bcurve.order;\n }\n /\n Return the number of Bezier spans in the curve. Note that this number includes the number of null\n * spans at repeated knows.\n /\n public get numSpan(): number {\n return this._bcurve.numSpan;\n }\n /* Return the number of poles. /\n public get numPoles(): number {\n return this._bcurve.numPoles;\n }\n /* Return live reference to the poles of the curve. /\n public get polesRef(): Float64Array {\n return this._bcurve.packedData;\n }\n /* Return live reference to the knots of the curve. /\n public get knotsRef(): Float64Array {\n return this._bcurve.knots.knots;\n }\n /\n Number of components per pole, e.g.,\n * * 3 for conventional (x,y,z) curve.\n * * 4 for weighted (wx,wy,wz,w) curve.\n /\n public get poleDimension(): number {\n return this._bcurve.poleLength;\n }\n /* Return a simple array form of the knots. Optionally replicate the first and last in classic over-clamped manner. /\n public copyKnots(includeExtraEndKnot: boolean): number[] {\n return this._bcurve.knots.copyKnots(includeExtraEndKnot);\n }\n /* Get the flag indicating the curve might be suitable for having wrapped \"closed\" interpretation. /\n public getWrappable(): BSplineWrapMode {\n return this._bcurve.knots.wrappable;\n }\n /* Set the flag indicating the curve might be suitable for having wrapped \"closed\" interpretation. /\n public setWrappable(value: BSplineWrapMode) {\n this._bcurve.knots.wrappable = value;\n }\n /\n Test knots and poles to determine if it is possible to close (aka \"wrap\") the curve.\n * @returns the manner in which it is possible to close the curve. See `BSplineWrapMode` for particulars of each mode.\n /\n public get isClosableCurve(): BSplineWrapMode {\n const mode = this._bcurve.knots.wrappable;\n if (mode === BSplineWrapMode.None)\n return BSplineWrapMode.None;\n if (!this._bcurve.knots.testClosable(mode))\n return BSplineWrapMode.None;\n if (!this._bcurve.testClosablePolygon(mode))\n return BSplineWrapMode.None;\n return mode;\n }\n /* Evaluate the curve at a fractional position within a given span. /\n public abstract evaluatePointInSpan(spanIndex: number, spanFraction: number, result?: Point3d): Point3d;\n /\n Evaluate the curve and derivative at a fractional position within a given span.\n * * The derivative is with respect to the span fractional parameter, _not_ to the curve's parameter or fractional parameter.\n /\n public abstract evaluatePointAndDerivativeInSpan(spanIndex: number, spanFraction: number, result?: Ray3d): Ray3d;\n /* Evaluate the curve at the given parameter. /\n public abstract knotToPoint(knot: number, result?: Point3d): Point3d;\n /* Evaluate the curve and derivative at the given parameter. /\n public abstract knotToPointAndDerivative(knot: number, result?: Ray3d): Ray3d;\n /* Evaluate the curve and two derivatives at the given parameter. /\n public abstract knotToPointAnd2Derivatives(knot: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;\n /* Evaluate the curve point at the given fractional parameter. /\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\n return this.knotToPoint(this._bcurve.knots.fractionToKnot(fraction), result);\n }\n /* Evaluate the curve and derivative at the given fractional parameter. /\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\n const knot = this._bcurve.knots.fractionToKnot(fraction);\n result = this.knotToPointAndDerivative(knot, result);\n result.direction.scaleInPlace(this._bcurve.knots.knotLength01);\n return result;\n }\n /* Evaluate the curve and two derivatives at the given fractional parameter. /\n public fractionToPointAnd2Derivatives(fraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\n const knot = this._bcurve.knots.fractionToKnot(fraction);\n result = this.knotToPointAnd2Derivatives(knot, result);\n const a = this._bcurve.knots.knotLength01;\n result.vectorU.scaleInPlace(a);\n result.vectorV.scaleInPlace(a a);\n return result;\n }\n /** Return the start point of the curve. /\n public override startPoint(result?: Point3d): Point3d {\n return this.evaluatePointInSpan(0, 0.0, result);\n }\n /* Return the end point of the curve. /\n public override endPoint(result?: Point3d): Point3d {\n return this.evaluatePointInSpan(this.numSpan - 1, 1.0, result);\n }\n /\n Reverse the curve in place.\n * * Poles are reversed.\n * * Knot values are mirrored around the middle of the knot array.\n /\n public reverseInPlace(): void {\n this._bcurve.reverseInPlace();\n }\n /* Return an array with this curve's Bezier fragments. /\n public collectBezierSpans(prefer3dH: boolean): BezierCurveBase[] {\n const result: BezierCurveBase[] = [];\n const numSpans = this.numSpan;\n for (let i = 0; i < numSpans; i++) {\n if (this._bcurve.knots.isIndexOfRealSpan(i)) {\n const span = this.getSaturatedBezierSpan3dOr3dH(i, prefer3dH);\n if (span)\n result.push(span);\n }\n }\n return result;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * * The concrete return type may be [[BezierCurve3d]] or [[BezierCurve3dH]] according to the instance type and `prefer3dH`.\n * @param spanIndex index of span.\n * @param prefer3dH true to force promotion to homogeneous.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public abstract getSaturatedBezierSpan3dOr3dH(\n spanIndex: number, prefer3dH: boolean, result?: BezierCurveBase,\n ): BezierCurveBase \| undefined;\n /\n Return a specified pole as a Point4d.\n * * BSplineCurve3d appends weight 1 to its xyz.\n * * BSplineCurve3dH with pole whose \"normalized\" point is (x,y,z) but has weight w returns the weighted form (wx,wy,wz,w).\n /\n public abstract getPolePoint4d(poleIndex: number, result?: Point4d): Point4d \| undefined;\n /\n Return a specified pole as a Point3d.\n * * BSplineCurve3d returns its simple xyz.\n * * BSplineCurve3dH attempts to normalize its (wx,wy,wz,w) back to (x,y,z), and returns undefined if weight is zero.\n * @param poleIndex index of the pole.\n * @param result optional result.\n /\n public abstract getPolePoint3d(poleIndex: number, result?: Point3d): Point3d \| undefined;\n /* Given a pole index, return the starting index for the contiguous array. /\n public poleIndexToDataIndex(poleIndex: number): number \| undefined {\n if (poleIndex >= 0 && poleIndex < this.numPoles)\n return poleIndex this._bcurve.poleLength;\n return undefined;\n }\n /*\n Search for the curve point that is closest to the spacePoint.\n * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n * succeed.\n * @param spacePoint point in space.\n * @param _extend ignored (pass false). A BSplineCurve3dBase cannot be extended.\n * @param result optional pre-allocated detail to populate and return.\n * @returns details of the closest point.\n /\n public override closestPoint(\n spacePoint: Point3d, _extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n ): CurveLocationDetail \| undefined {\n // seed at start point; final point comes with final bezier perpendicular step\n const point = this.fractionToPoint(0);\n result = CurveLocationDetail.createCurveFractionPointDistance(this, 0.0, point, point.distance(spacePoint), result);\n let span: BezierCurve3dH \| undefined;\n const numSpans = this.numSpan;\n for (let i = 0; i < numSpans; i++) {\n if (this._bcurve.knots.isIndexOfRealSpan(i)) {\n span = this.getSaturatedBezierSpan3dOr3dH(i, true, span) as BezierCurve3dH;\n if (span) {\n // if the B-spline is discontinuous, both ends should be tested; ignore that possibility\n if (span.updateClosestPointByTruePerpendicular(spacePoint, result, false, true)) {\n // the detail records the span bezier; promote it to the parent curve\n result.curve = this;\n result.fraction = span.fractionToParentFraction(result.fraction);\n }\n }\n }\n }\n return result;\n }\n /* Return a deep clone. /\n public abstract override clone(): BSplineCurve3dBase;\n /* Return a transformed deep clone. /\n public override cloneTransformed(transform: Transform): BSplineCurve3dBase {\n const curve = this.clone();\n curve.tryTransformInPlace(transform);\n return curve;\n }\n /\n Return a curve primitive which is a portion of this curve.\n * @param fractionA start fraction.\n * @param fractionB end fraction.\n /\n public override clonePartialCurve(fractionA: number, fractionB: number): BSplineCurve3dBase {\n let clone: BSplineCurve3dBase;\n if (fractionA > fractionB) {\n clone = this.clonePartialCurve(fractionB, fractionA);\n clone.reverseInPlace();\n return clone;\n }\n clone = this.clone();\n const origNumKnots = clone._bcurve.knots.knots.length;\n let knotA = clone._bcurve.knots.fractionToKnot(fractionA);\n let knotB = clone._bcurve.knots.fractionToKnot(fractionB);\n clone._bcurve.addKnot(knotA, clone.degree);\n clone._bcurve.addKnot(knotB, clone.degree);\n if (origNumKnots === clone._bcurve.knots.knots.length)\n return clone; // full curve\n if (knotA > knotB)\n [knotA, knotB] = [knotB, knotA];\n // choose first/last knot and pole such that knotA/knotB has degree multiplicity in the new knot sequence\n const iStartKnot = clone._bcurve.knots.knotToLeftKnotIndex(knotA) - clone.degree + 1;\n const iStartPole = iStartKnot clone._bcurve.poleLength;\n const iLastKnot = clone._bcurve.knots.knotToLeftKnotIndex(knotB);\n let iLastKnotLeftMultiple = iLastKnot - clone._bcurve.knots.getKnotMultiplicityAtIndex(iLastKnot) + 1;\n if (clone._bcurve.knots.knots[iLastKnot] < knotB)\n iLastKnotLeftMultiple = iLastKnot + 1;\n const iEndPole = (iLastKnotLeftMultiple + 1) * clone._bcurve.poleLength; // one past last pole\n const iEndKnot = iLastKnotLeftMultiple + clone.degree; // one past last knot\n // trim the arrays (leave knots unnormalized)\n clone._bcurve.knots.setKnotsCapture(clone._bcurve.knots.knots.slice(iStartKnot, iEndKnot));\n clone._bcurve.packedData = clone._bcurve.packedData.slice(iStartPole, iEndPole);\n clone.setWrappable(BSplineWrapMode.None); // always open\n return clone;\n }\n /*\n Implement `CurvePrimitive.appendPlaneIntersections` to compute intersections of the curve with a plane.\n * @param plane the plane with which to intersect the curve. Concrete types include [[Plane3dByOriginAndUnitNormal]],\n * [[Point4d]], etc.\n * @param result growing array of plane intersections.\n * @return number of intersections appended to the array.\n /\n public override appendPlaneIntersectionPoints(plane: PlaneAltitudeEvaluator, result: CurveLocationDetail[]): number {\n const numPole = this.numPoles;\n const order = this.order;\n const allCoffs = new Float64Array(numPole);\n const numSpan = this.numSpan;\n const point4d = Point4d.create();\n // compute all pole altitudes from the plane\n const minMax = Range1d.createNull();\n // put the altitudes of all the B-spline poles in one array\n for (let i = 0; i < numPole; i++) {\n this.getPolePoint4d(i, point4d);\n allCoffs[i] = plane.weightedAltitude(point4d);\n minMax.extendX(allCoffs[i]);\n }\n // A univariate B-spline through the altitude poles gives altitude as function of the B-spline knot.\n // The (bspline) altitude function for each span is `order` consecutive altitudes.\n // If those altitudes bracket zero, the span may potentially have a crossing.\n let univariateBezier: UnivariateBezier \| undefined;\n let numFound = 0;\n let previousFraction = -1000.0;\n if (minMax.containsX(0.0)) {\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n if (this._bcurve.knots.isIndexOfRealSpan(spanIndex)) { // ignore trivial knot intervals\n // outer range test ...\n minMax.setNull();\n minMax.extendArraySubset(allCoffs, spanIndex, order);\n if (minMax.containsX(0.0)) {\n // pack the B-spline support into a univariate bezier\n univariateBezier = UnivariateBezier.createArraySubset(allCoffs, spanIndex, order, univariateBezier);\n // saturate and solve the bezier\n Bezier1dNd.saturate1dInPlace(univariateBezier.coffs, this._bcurve.knots, spanIndex);\n const roots = univariateBezier.roots(0.0, true);\n if (roots) {\n for (const spanFraction of roots) {\n // promote each local bezier fraction to global fraction and save the curve evaluation at that fraction\n numFound++;\n const fraction = this._bcurve.knots.spanFractionToFraction(spanIndex, spanFraction);\n if (!Geometry.isAlmostEqualNumber(fraction, previousFraction)) {\n const detail = CurveLocationDetail.createCurveEvaluatedFraction(this, fraction);\n detail.intervalRole = CurveIntervalRole.isolated;\n result.push(detail);\n previousFraction = fraction;\n }\n }\n }\n }\n }\n }\n }\n return numFound;\n }\n /\n Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object.\n /\n public override constructOffsetXY(offsetDistanceOrOptions: number \| OffsetOptions): BSplineCurve3d \| undefined {\n const options = OffsetOptions.create(offsetDistanceOrOptions);\n const handler = new CurveOffsetXYHandler(this, options.leftOffsetDistance);\n this.emitStrokableParts(handler, options.strokeOptions);\n return handler.claimResult();\n }\n /\n Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\n * of projection.\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\n * @param lowHigh optional receiver for output.\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\n * end of the ray.\n /\n public override projectedParameterRange(ray: Vector3d \| Ray3d, lowHigh?: Range1d): Range1d \| undefined {\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\n }\n}\n/\n A BSplineCurve3d is a B-spline curve whose poles are Point3d.\n * See BSplineCurve3dBase for description of knots, order, degree, and poles.\n * @public\n /\nexport class BSplineCurve3d extends BSplineCurve3dBase {\n private _workBezier?: BezierCurve3d;\n private initializeWorkBezier(): BezierCurve3d {\n if (this._workBezier === undefined)\n this._workBezier = BezierCurve3d.createOrder(this.order);\n return this._workBezier;\n }\n private constructor(numPoles: number, order: number, knots: KnotVector) {\n super(3, numPoles, order, knots);\n }\n /* Test if `other` is an instance of BSplineCurve3d. /\n public isSameGeometryClass(other: any): boolean {\n return other instanceof BSplineCurve3d;\n }\n /* Apply `transform` to the poles. /\n public tryTransformInPlace(transform: Transform): boolean {\n Point3dArray.multiplyInPlace(transform, this._bcurve.packedData);\n return true;\n }\n /* Get a pole as a simple Point3d. /\n public getPolePoint3d(poleIndex: number, result?: Point3d): Point3d \| undefined {\n const k = this.poleIndexToDataIndex(poleIndex);\n if (k !== undefined) {\n const data = this._bcurve.packedData;\n return Point3d.create(data[k], data[k + 1], data[k + 2], result);\n }\n return undefined;\n }\n /* Get a pole as Point4d with weight 1. /\n public getPolePoint4d(poleIndex: number, result?: Point4d): Point4d \| undefined {\n const k = this.poleIndexToDataIndex(poleIndex);\n if (k !== undefined) {\n const data = this._bcurve.packedData;\n return Point4d.create(data[k], data[k + 1], data[k + 2], 1.0, result);\n }\n return undefined;\n }\n /\n Convert the fractional position in the given span to a knot.\n * * The returned value is not necessarily a knot, but it is a valid parameter in the domain of the B-spline curve.\n /\n public spanFractionToKnot(spanIndex: number, spanFraction: number): number {\n return this._bcurve.spanFractionToKnot(spanIndex, spanFraction);\n }\n /* Return a simple array of arrays with the poles as `[[x,y,z],[x,y,z],..]`. /\n public copyPoints(): any[] {\n return Point3dArray.unpackNumbersToNestedArrays(this._bcurve.packedData, 3);\n }\n /* Return a simple array of poles' coordinates. /\n public copyPointsFloat64Array(): Float64Array {\n return this._bcurve.packedData.slice();\n }\n /* Return a simple array form of the knots. Optionally replicate the first and last in classic over-clamped manner. /\n public override copyKnots(includeExtraEndKnot: boolean): number[] {\n return this._bcurve.knots.copyKnots(includeExtraEndKnot);\n }\n /* Create a B-spline with uniform knots. /\n public static createUniformKnots(\n poles: Point3d[] \| Float64Array \| GrowableXYZArray, order: number,\n ): BSplineCurve3d \| undefined {\n const numPoles = poles instanceof Float64Array ? poles.length / 3 : poles.length;\n if (order < 2 \|\| numPoles < order)\n return undefined;\n const knots = KnotVector.createUniformClamped(numPoles, order - 1, 0.0, 1.0);\n const curve = new BSplineCurve3d(numPoles, order, knots);\n if (poles instanceof Float64Array) {\n for (let i = 0; i < 3 numPoles; i++)\n curve._bcurve.packedData[i] = poles[i];\n } else if (poles instanceof GrowableXYZArray) {\n curve._bcurve.packedData = poles.float64Data().slice(0, 3 * numPoles);\n } else {\n let i = 0;\n for (const p of poles) {\n curve._bcurve.packedData[i++] = p.x;\n curve._bcurve.packedData[i++] = p.y;\n curve._bcurve.packedData[i++] = p.z;\n }\n }\n return curve;\n }\n /*\n Create a smoothly closed B-spline curve with uniform knots.\n * * Note that the curve does not start at the first pole.\n /\n public static createPeriodicUniformKnots(\n poles: Point3d[] \| Float64Array \| GrowableXYZArray, order: number,\n ): BSplineCurve3d \| undefined {\n if (order < 2)\n return undefined;\n let numPoles = poles instanceof Float64Array ? poles.length / 3 : poles.length;\n if (numPoles < 2)\n return undefined;\n const startPoint = Point3d.createZero();\n const endPoint = Point3d.createZero();\n let hasClosurePoint = false;\n do {\n if (poles instanceof Float64Array) {\n startPoint.set(poles[0], poles[1], poles[2]);\n endPoint.set(poles[3 numPoles - 3], poles[3 * numPoles - 2], poles[3 * numPoles - 1]);\n } else if (poles instanceof GrowableXYZArray) {\n poles.getPoint3dAtUncheckedPointIndex(0, startPoint);\n poles.getPoint3dAtUncheckedPointIndex(numPoles - 1, endPoint);\n } else {\n startPoint.setFromPoint3d(poles[0]);\n endPoint.setFromPoint3d(poles[numPoles - 1]);\n }\n if (hasClosurePoint = startPoint.isAlmostEqual(endPoint))\n --numPoles; // remove wraparound pole if found\n } while (hasClosurePoint && numPoles > 1);\n if (numPoles < order)\n return undefined;\n const degree = order - 1;\n const numIntervals = numPoles;\n const knots = KnotVector.createUniformWrapped(numIntervals, degree, 0.0, 1.0);\n knots.wrappable = BSplineWrapMode.OpenByAddingControlPoints;\n // append degree wraparound poles\n const curve = new BSplineCurve3d(numPoles + degree, order, knots);\n if (poles instanceof Float64Array) {\n let i = 0;\n for (let j = 0; j < 3 * numPoles; j++)\n curve._bcurve.packedData[i++] = poles[j];\n for (let j = 0; j < 3 * degree; j++)\n curve._bcurve.packedData[i++] = poles[j];\n } else if (poles instanceof GrowableXYZArray) {\n let i = 0;\n for (let j = 0; j < 3 * numPoles; j++)\n curve._bcurve.packedData[i++] = poles.float64Data()[j];\n for (let j = 0; j < 3 * degree; j++)\n curve._bcurve.packedData[i++] = poles.float64Data()[j];\n } else {\n let i = 0;\n for (let j = 0; j < numPoles; j++) {\n curve._bcurve.packedData[i++] = poles[j].x;\n curve._bcurve.packedData[i++] = poles[j].y;\n curve._bcurve.packedData[i++] = poles[j].z;\n }\n for (let j = 0; j < degree; j++) {\n curve._bcurve.packedData[i++] = poles[j].x;\n curve._bcurve.packedData[i++] = poles[j].y;\n curve._bcurve.packedData[i++] = poles[j].z;\n }\n }\n return curve;\n }\n /*\n Create a C2 cubic B-spline curve that interpolates the given points and optional end tangents.\n * @param options collection of points and end conditions.\n /\n public static createFromInterpolationCurve3dOptions(options: InterpolationCurve3dOptions): BSplineCurve3d \| undefined {\n return BSplineCurveOps.createThroughPointsC2Cubic(options);\n }\n /\n Create a B-spline curve from an Akima curve.\n * @param options collection of points and end conditions.\n /\n public static createFromAkimaCurve3dOptions(options: AkimaCurve3dOptions): BSplineCurve3d \| undefined {\n return BSplineCurveOps.createThroughPoints(options.fitPoints, 4); // temporary\n }\n /\n Create a B-spline curve with given knots.\n * * The poles have several variants:\n * * Float64Array(3 * numPoles) in blocks of [x,y,z].\n * * Point3d[].\n * * number[][], with inner dimension 3.\n * * Two count conditions are recognized:\n * * If poleArray.length + order === knotArray.length, the first and last are assumed to be the extraneous knots\n * of classic clamping.\n * * If poleArray.length + order === knotArray.length + 2, the knots are in modern form.\n * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/BSpline/\n /\n public static create(\n poleArray: Float64Array \| Point3d[] \| number[][], knotArray: Float64Array \| number[], order: number,\n ): BSplineCurve3d \| undefined {\n if (order < 2)\n return undefined;\n let numPoles = poleArray.length;\n if (poleArray instanceof Float64Array)\n numPoles = Math.floor(numPoles / 3); // blocked as xyz\n if (numPoles < order)\n return undefined;\n const numKnots = knotArray.length;\n const skipFirstAndLast = (numPoles + order === numKnots); // classic over-clamped input knots\n if (!skipFirstAndLast && numPoles + order !== numKnots + 2) // modern knots\n return undefined;\n const knots = KnotVector.create(knotArray, order - 1, skipFirstAndLast);\n const curve = new BSplineCurve3d(numPoles, order, knots);\n let i = 0;\n if (poleArray instanceof Float64Array) {\n for (const coordinate of poleArray)\n curve._bcurve.packedData[i++] = coordinate;\n } else if (poleArray[0] instanceof Point3d) {\n for (const p of poleArray as Point3d[]) {\n curve._bcurve.packedData[i++] = p.x;\n curve._bcurve.packedData[i++] = p.y;\n curve._bcurve.packedData[i++] = p.z;\n }\n } else if (Array.isArray(poleArray[0]) && poleArray[0].length === 3) {\n for (const point of poleArray as number[][])\n for (const coord of point)\n curve._bcurve.packedData[i++] = coord;\n } else {\n return undefined; // unexpected poleArray type\n }\n return curve;\n }\n /* Return a deep clone. /\n public override clone(): BSplineCurve3d {\n const knotVector = this._bcurve.knots.clone();\n const curve = new BSplineCurve3d(this.numPoles, this.order, knotVector);\n curve._bcurve.packedData = this._bcurve.packedData.slice();\n return curve;\n }\n /* Evaluate the curve at a fractional position within a given span. /\n public evaluatePointInSpan(spanIndex: number, spanFraction: number, result?: Point3d): Point3d {\n this._bcurve.evaluateBuffersInSpan(spanIndex, spanFraction);\n return Point3d.createFrom(this._bcurve.poleBuffer, result);\n }\n /\n Evaluate the curve and derivative at a fractional position within a given span.\n * * The derivative is with respect to the span fractional parameter, _not_ to the curve's parameter or fractional parameter.\n /\n public evaluatePointAndDerivativeInSpan(spanIndex: number, spanFraction: number): Ray3d {\n this._bcurve.evaluateBuffersInSpan1(spanIndex, spanFraction);\n return Ray3d.createCapture(\n Point3d.createFrom(this._bcurve.poleBuffer),\n Vector3d.createFrom(this._bcurve.poleBuffer1),\n );\n }\n /\n Evaluate the curve at the given parameter.\n * @param u parameter in curve domain.\n * @param result optional result.\n * @returns the point on the curve.\n /\n public knotToPoint(u: number, result?: Point3d): Point3d {\n this._bcurve.evaluateBuffersAtKnot(u);\n return Point3d.createFrom(this._bcurve.poleBuffer, result);\n }\n /\n Evaluate the curve and derivative at the given parameter.\n * @param u parameter in curve domain.\n * @param result optional result.\n * @returns the ray with origin at the curve point and direction as the derivative.\n /\n public knotToPointAndDerivative(u: number, result?: Ray3d): Ray3d {\n this._bcurve.evaluateBuffersAtKnot(u, 1);\n if (!result)\n return Ray3d.createCapture(\n Point3d.createFrom(this._bcurve.poleBuffer),\n Vector3d.createFrom(this._bcurve.poleBuffer1),\n );\n result.origin.setFrom(this._bcurve.poleBuffer);\n result.direction.setFrom(this._bcurve.poleBuffer1);\n return result;\n }\n /\n Evaluate the curve and two derivatives at the given parameter.\n * @param u parameter in the curve domain.\n * @param result optional result.\n * @returns the plane with origin at the curve point, vectorU as the 1st derivative, and vectorV as the 2nd derivative.\n /\n public knotToPointAnd2Derivatives(u: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\n this._bcurve.evaluateBuffersAtKnot(u, 2);\n return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(\n this._bcurve.poleBuffer[0], this._bcurve.poleBuffer[1], this._bcurve.poleBuffer[2],\n this._bcurve.poleBuffer1[0], this._bcurve.poleBuffer1[1], this._bcurve.poleBuffer1[2],\n this._bcurve.poleBuffer2[0], this._bcurve.poleBuffer2[1], this._bcurve.poleBuffer2[2],\n result,\n );\n }\n /* Test if `this` is almost the same curve as `other`. /\n public override isAlmostEqual(other: any): boolean {\n if (other instanceof BSplineCurve3d) {\n return this._bcurve.knots.isAlmostEqual(other._bcurve.knots)\n && Point3dArray.isAlmostEqual(this._bcurve.packedData, other._bcurve.packedData);\n }\n return false;\n }\n /* Test if this curve lies entirely in the given plane. /\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\n return Point3dArray.isCloseToPlane(this._bcurve.packedData, plane);\n }\n /\n Return the control polygon length as an approximation to the curve length.\n * * The returned length is always an overestimate.\n /\n public quickLength(): number {\n return Point3dArray.sumEdgeLengths(this._bcurve.packedData);\n }\n /* Emit Beziers or strokes (selected by the stroke options) to the handler. /\n public emitStrokableParts(handler: IStrokeHandler, options?: StrokeOptions): void {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n let numStrokes;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3dOr3dH(spanIndex, false, workBezier);\n if (bezier) {\n numStrokes = bezier.computeStrokeCountForOptions(options);\n if (handler.announceBezierCurve) {\n handler.announceBezierCurve(\n bezier,\n numStrokes,\n this,\n spanIndex,\n this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\n this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0),\n );\n\n } else {\n handler.announceIntervalForUniformStepStrokes(\n this,\n numStrokes,\n this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\n this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0),\n );\n }\n }\n }\n }\n /\n Assess length and turn to determine a stroke count.\n * @param options stroke options structure.\n /\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n let numStroke = 0;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier)\n numStroke += bezier.computeStrokeCountForOptions(options);\n }\n return numStroke;\n }\n /\n Compute individual segment stroke counts. Attach in a StrokeCountMap.\n * @param options StrokeOptions that determine count\n * @param parentStrokeMap evolving parent map.\n * @alpha\n /\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n const myData = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap, []);\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier) {\n const segmentLength = workBezier.curveLength();\n const numStrokeOnSegment = workBezier.computeStrokeCountForOptions(options);\n myData.addToCountAndLength(numStrokeOnSegment, segmentLength);\n }\n }\n CurvePrimitive.installStrokeCountMap(this, myData, parentStrokeMap);\n }\n /* Append strokes to the given linestring. /\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier)\n bezier.emitStrokes(dest, options);\n }\n }\n /\n Test knots and poles to determine if it is possible to close (aka \"wrap\") the curve.\n * @returns the manner in which it is possible to close the curve. See `BSplineWrapMode` for particulars of each mode.\n /\n public get isClosable(): BSplineWrapMode {\n return this.isClosableCurve;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * * The concrete return type may be [[BezierCurve3d]] or [[BezierCurve3dH]] according to the instance type and `prefer3dH`.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3dOr3dH(\n spanIndex: number, prefer3dH: boolean, result?: BezierCurveBase,\n ): BezierCurveBase \| undefined {\n if (prefer3dH)\n return this.getSaturatedBezierSpan3dH(spanIndex, result);\n return this.getSaturatedBezierSpan3d(spanIndex, result);\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3d(spanIndex: number, result?: BezierCurveBase): BezierCurve3d \| undefined {\n if (spanIndex < 0 \|\| spanIndex >= this.numSpan)\n return undefined;\n const order = this.order;\n if (result === undefined \|\| !(result instanceof BezierCurve3d) \|\| result.order !== order)\n result = BezierCurve3d.createOrder(order);\n const bezier = result as BezierCurve3d;\n bezier.loadSpanPoles(this._bcurve.packedData, spanIndex);\n if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))\n return bezier;\n return undefined;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3dH(spanIndex: number, result?: BezierCurveBase): BezierCurve3dH \| undefined {\n if (spanIndex < 0 \|\| spanIndex >= this.numSpan)\n return undefined;\n const order = this.order;\n if (result === undefined \|\| !(result instanceof BezierCurve3dH) \|\| result.order !== order)\n result = BezierCurve3dH.createOrder(order);\n const bezier = result as BezierCurve3dH;\n bezier.loadSpan3dPolesWithWeight(this._bcurve.packedData, spanIndex, 1.0);\n if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))\n return bezier;\n return undefined;\n }\n /* Second step of double dispatch: call `handler.handleBSplineCurve3d(this)`. /\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\n return handler.handleBSplineCurve3d(this);\n }\n /\n Extend a range so it contains the range of this curve.\n * * This computation is based on the poles, not the curve itself, so the returned range is generally larger than the\n * tightest possible range.\n * @param rangeToExtend range to extend.\n * @param transform transform to apply to the poles as they are entered into the range.\n */\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n const buffer = this._bcurve.packedData;\n const n = buffer.length - 2;\n if (transform) {\n for (let i0 = 0; i0 < n; i0 += 3)\n rangeToExtend.extendTransformedXYZ(transform, buffer[i0], buffer[i0 + 1], buffer[i0 + 2]);\n } else {\n for (let i0 = 0; i0 < n; i0 += 3)\n rangeToExtend.extendXYZ(buffer[i0], buffer[i0 + 1], buffer[i0 + 2]);\n }\n }\n}\n"]}
1	+ {"version":3,"file":"BSplineCurve.js","sourceRoot":"","sources":["../../../src/bspline/BSplineCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,sEAAsF;AACtF,4DAAyD;AACzD,yFAAsF;AACtF,mGAAgG;AAEhG,0DAAuD;AACvD,kEAA+D;AAE/D,0CAA+D;AAE/D,qEAAkE;AAElE,uFAAoF;AACpF,mEAAkE;AAClE,6DAA0D;AAC1D,+CAAuD;AACvD,+CAA4C;AAE5C,mDAAgD;AAChD,qEAAiE;AAEjE,6CAA0C;AAC1C,mDAAgD;AAChD,qDAAkD;AAElD,+CAA4C;AAC5C,uDAAoD;AAEpD,6CAA2D;AAE3D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyDG;AACH,MAAsB,kBAAmB,SAAQ,+BAAc;IAC7D,yCAAyC;IACzB,kBAAkB,GAAG,cAAc,CAAC;IACpD,mEAAmE;IACzD,OAAO,CAAc;IACvB,eAAe,CAAO;IAC9B,IAAW,cAAc,CAAC,IAAS;QACjC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC;IAC9B,CAAC;IACD,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD,YAAsB,aAAqB,EAAE,QAAgB,EAAE,KAAa,EAAE,KAAiB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,yBAAW,CAAC,MAAM,CAAC,QAAQ,EAAE,aAAa,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IACD,gEAAgE;IAChE,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IACD,4DAA4D;IAC5D,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC;IAC9B,CAAC;IACD,kCAAkC;IAClC,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,CAAC;IACD,uDAAuD;IACvD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IACjC,CAAC;IACD,uDAAuD;IACvD,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC;IAClC,CAAC;IACD;;;;OAIG;IACH,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;IACjC,CAAC;IACD,uHAAuH;IAChH,SAAS,CAAC,mBAA4B;QAC3C,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC3D,CAAC;IACD,sGAAsG;IAC/F,YAAY;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;IACtC,CAAC;IACD,sGAAsG;IAC/F,YAAY,CAAC,KAAsB;QACxC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC;IACvC,CAAC;IACD;;;OAGG;IACH,IAAW,eAAe;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;QAC1C,IAAI,IAAI,KAAK,4BAAe,CAAC,IAAI;YAC/B,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC;YACxC,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC;YACzC,OAAO,4BAAe,CAAC,IAAI,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAcD,kEAAkE;IAC3D,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/E,CAAC;IACD,2EAA2E;IACpE,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC/D,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,gFAAgF;IACzE,8BAA8B,CAAC,QAAgB,EAAE,MAAkC;QACxF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,GAAG,IAAI,CAAC,0BAA0B,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,YAAY,CAAC;QAC1C,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IAC3B,UAAU,CAAC,MAAgB;QACzC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IACD,yCAAyC;IACzB,QAAQ,CAAC,MAAgB;QACvC,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IACD;;;;OAIG;IACI,cAAc;QACnB,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;IAChC,CAAC;IACD,0DAA0D;IACnD,kBAAkB,CAAC,SAAkB;QAC1C,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAC9D,IAAI,IAAI;oBACN,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAyBD,8EAA8E;IACvE,oBAAoB,CAAC,SAAiB;QAC3C,IAAI,SAAS,IAAI,CAAC,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ;YAC7C,OAAO,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QAC7C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,UAAuC,KAAK,EAAE,MAA4B;QAE/F,8EAA8E;QAC9E,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,CAAC;QACpH,IAAI,IAAgC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC5C,IAAI,GAAG,IAAI,CAAC,6BAA6B,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAmB,CAAC;gBAC3E,IAAI,IAAI,EAAE,CAAC;oBACT,wFAAwF;oBACxF,IAAI,IAAI,CAAC,qCAAqC,CAAC,UAAU,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;wBAChF,qEAAqE;wBACrE,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC;wBACpB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAGD,uCAAuC;IACvB,gBAAgB,CAAC,SAAoB;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,KAAK,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACrC,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACa,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,KAAyB,CAAC;QAC9B,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1B,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrD,KAAK,CAAC,cAAc,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACrB,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;QACtD,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC1D,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC;QAC1D,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,YAAY,KAAK,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM;YACnD,OAAO,KAAK,CAAC,CAAC,aAAa;QAC7B,IAAI,KAAK,GAAG,KAAK;YACf,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAClC,yGAAyG;QACzG,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACrF,MAAM,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC;QACzD,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,qBAAqB,GAAG,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,0BAA0B,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACtG,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,KAAK;YAC9C,qBAAqB,GAAG,SAAS,GAAG,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,CAAC,qBAAqB,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,qBAAqB;QAC9F,MAAM,QAAQ,GAAG,qBAAqB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,qBAAqB;QAC5E,6CAA6C;QAC7C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3F,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAChF,KAAK,CAAC,YAAY,CAAC,4BAAe,CAAC,IAAI,CAAC,CAAC,CAAC,cAAc;QACxD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;MAME;IACc,6BAA6B,CAAC,KAA6B,EAAE,MAA6B;QACxG,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,OAAO,GAAG,iBAAO,CAAC,MAAM,EAAE,CAAC;QACjC,4CAA4C;QAC5C,MAAM,MAAM,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAChC,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,oGAAoG;QACpG,kFAAkF;QAClF,6EAA6E;QAC7E,IAAI,gBAA8C,CAAC;QACnD,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,gBAAgB,GAAG,CAAC,MAAM,CAAC;QAC/B,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,gCAAgC;oBACrF,uBAAuB;oBACvB,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,MAAM,CAAC,iBAAiB,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;oBACrD,IAAI,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC1B,qDAAqD;wBACrD,gBAAgB,GAAG,oCAAgB,CAAC,iBAAiB,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;wBACpG,gCAAgC;wBAChC,uBAAU,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;wBACpF,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;wBAChD,IAAI,KAAK,EAAE,CAAC;4BACV,KAAK,MAAM,YAAY,IAAI,KAAK,EAAE,CAAC;gCACjC,uGAAuG;gCACvG,QAAQ,EAAE,CAAC;gCACX,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gCACpF,IAAI,CAAC,mBAAQ,CAAC,mBAAmB,CAAC,QAAQ,EAAE,gBAAgB,CAAC,EAAE,CAAC;oCAC9D,MAAM,MAAM,GAAG,yCAAmB,CAAC,4BAA4B,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;oCAChF,MAAM,CAAC,YAAY,GAAG,uCAAiB,CAAC,QAAQ,CAAC;oCACjD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACpB,gBAAgB,GAAG,QAAQ,CAAC;gCAC9B,CAAC;4BACH,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAC3E,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AAtUD,gDAsUC;AACD;;;;GAIG;AACH,MAAa,cAAe,SAAQ,kBAAkB;IAC5C,WAAW,CAAiB;IAC5B,oBAAoB;QAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAChC,IAAI,CAAC,WAAW,GAAG,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,YAAoB,QAAgB,EAAE,KAAa,EAAE,KAAiB;QACpE,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,cAAc,CAAC;IACzC,CAAC;IACD,sCAAsC;IAC/B,mBAAmB,CAAC,SAAoB;QAC7C,2BAAY,CAAC,eAAe,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sCAAsC;IAC/B,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IACpC,cAAc,CAAC,SAAiB,EAAE,MAAgB;QACvD,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACpB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;YACrC,OAAO,iBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;QACxE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,SAAiB,EAAE,YAAoB;QAC/D,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAClE,CAAC;IACD,gFAAgF;IACzE,UAAU;QACf,OAAO,2BAAY,CAAC,2BAA2B,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IACD,mDAAmD;IAC5C,sBAAsB;QAC3B,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IACzC,CAAC;IACD,uHAAuH;IACvG,SAAS,CAAC,mBAA4B;QACpD,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;IAC3D,CAAC;IACD,4CAA4C;IACrC,MAAM,CAAC,kBAAkB,CAC9B,KAAkD,EAAE,KAAa;QAEjE,MAAM,QAAQ,GAAG,KAAK,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QACjF,IAAI,KAAK,GAAG,CAAC,IAAI,QAAQ,GAAG,KAAK;YAC/B,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,uBAAU,CAAC,oBAAoB,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7E,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;aAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;YAC7C,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC;QACxE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAkD,EAAE,KAAa;QAEjE,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ,GAAG,KAAK,YAAY,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;QAC/E,IAAI,QAAQ,GAAG,CAAC;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,yBAAO,CAAC,UAAU,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,yBAAO,CAAC,UAAU,EAAE,CAAC;QACtC,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,GAAG,CAAC;YACF,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;gBAClC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7C,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1F,CAAC;iBAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;gBAC7C,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;gBACrD,KAAK,CAAC,+BAA+B,CAAC,QAAQ,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YAChE,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpC,QAAQ,CAAC,cAAc,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;YACD,IAAI,eAAe,GAAG,UAAU,CAAC,aAAa,CAAC,QAAQ,CAAC;gBACtD,EAAE,QAAQ,CAAC,CAAC,kCAAkC;QAClD,CAAC,QAAQ,eAAe,IAAI,QAAQ,GAAG,CAAC,EAAE;QAC1C,IAAI,QAAQ,GAAG,KAAK;YAClB,OAAO,SAAS,CAAC;QACnB,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;QACzB,MAAM,YAAY,GAAG,QAAQ,CAAC;QAC9B,MAAM,KAAK,GAAG,uBAAU,CAAC,oBAAoB,CAAC,YAAY,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAC9E,KAAK,CAAC,SAAS,GAAG,4BAAe,CAAC,yBAAyB,CAAC;QAC5D,iCAAiC;QACjC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,GAAG,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClE,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;gBACjC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;aAAM,IAAI,KAAK,YAAY,mCAAgB,EAAE,CAAC;YAC7C,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;gBACnC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;YACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;gBACjC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,qCAAqC,CAAC,OAAoC;QACtF,OAAO,iCAAe,CAAC,0BAA0B,CAAC,OAAO,CAAC,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,6BAA6B,CAAC,OAA4B;QACtE,OAAO,iCAAe,CAAC,mBAAmB,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAE,YAAY;IACjF,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,MAAM,CAClB,SAAgD,EAAE,SAAkC,EAAE,KAAa;QAEnG,IAAI,KAAK,GAAG,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAChC,IAAI,SAAS,YAAY,YAAY;YACnC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACxD,IAAI,QAAQ,GAAG,KAAK;YAClB,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC;QAClC,MAAM,gBAAgB,GAAG,CAAC,QAAQ,GAAG,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,mCAAmC;QAC7F,IAAI,CAAC,gBAAgB,IAAI,QAAQ,GAAG,KAAK,KAAK,QAAQ,GAAG,CAAC,EAAE,eAAe;YACzE,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,uBAAU,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;QACxE,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,SAAS,YAAY,YAAY,EAAE,CAAC;YACtC,KAAK,MAAM,UAAU,IAAI,SAAS;gBAChC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;QAC/C,CAAC;aAAM,IAAI,SAAS,CAAC,CAAC,CAAC,YAAY,yBAAO,EAAE,CAAC;YAC3C,KAAK,MAAM,CAAC,IAAI,SAAsB,EAAE,CAAC;gBACvC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpE,KAAK,MAAM,KAAK,IAAI,SAAuB;gBACzC,KAAK,MAAM,KAAK,IAAI,KAAK;oBACvB,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC,CAAC,4BAA4B;QAChD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2BAA2B;IACX,KAAK;QACnB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACxE,KAAK,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD,uEAAuE;IAChE,mBAAmB,CAAC,SAAiB,EAAE,YAAoB,EAAE,MAAgB;QAClF,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC5D,OAAO,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,gCAAgC,CAAC,SAAiB,EAAE,YAAoB;QAC7E,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;QAC7D,OAAO,aAAK,CAAC,aAAa,CACxB,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAC3C,0BAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAC9C,CAAC;IACJ,CAAC;IACD;;;;;OAKG;IACI,WAAW,CAAC,CAAS,EAAE,MAAgB;QAC5C,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;IAC7D,CAAC;IACD;;;;;OAKG;IACI,wBAAwB,CAAC,CAAS,EAAE,MAAc;QACvD,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM;YACT,OAAO,aAAK,CAAC,aAAa,CACxB,yBAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAC3C,0BAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAC9C,CAAC;QACJ,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,0BAA0B,CAAC,CAAS,EAAE,MAAkC;QAC7E,IAAI,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,qDAAyB,CAAC,yBAAyB,CACxD,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAClF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EACrF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EACrF,MAAM,CACP,CAAC;IACJ,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,cAAc,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;mBACvD,2BAAY,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACrF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,2DAA2D;IACpD,SAAS,CAAC,KAAmC;QAClD,OAAO,2BAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,2BAAY,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,OAAuB,EAAE,OAAuB;QACxE,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,UAAU,CAAC;QACf,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,6BAA6B,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC;YAChF,IAAI,MAAM,EAAE,CAAC;gBACX,UAAU,GAAG,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC1D,IAAI,OAAO,CAAC,mBAAmB,EAAE,CAAC;oBAChC,OAAO,CAAC,mBAAmB,CACzB,MAAM,EACN,UAAU,EACV,IAAI,EACJ,SAAS,EACT,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAC1D,CAAC;gBAEJ,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,qCAAqC,CAC3C,IAAI,EACJ,UAAU,EACV,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACzD,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAC1D,CAAC;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM;gBACR,SAAS,IAAI,MAAM,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QAC9D,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;QACnG,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;gBAC/C,MAAM,kBAAkB,GAAG,UAAU,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;gBAC5E,MAAM,CAAC,mBAAmB,CAAC,kBAAkB,EAAE,aAAa,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,MAAM,EAAE,eAAe,CAAC,CAAC;IACtE,CAAC;IACD,8CAA8C;IACvC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpE,IAAI,MAAM;gBACR,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACtC,CAAC;IACH,CAAC;IACD;;;OAGG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,6BAA6B,CAClC,SAAiB,EAAE,SAAkB,EAAE,MAAwB;QAE/D,IAAI,SAAS;YACX,OAAO,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IACD;;;;OAIG;IACI,wBAAwB,CAAC,SAAiB,EAAE,MAAwB;QACzE,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,OAAO;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK;YACtF,MAAM,GAAG,6BAAa,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,MAAuB,CAAC;QACvC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACzD,IAAI,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC;YACvD,OAAO,MAAM,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,yBAAyB,CAAC,SAAiB,EAAE,MAAwB;QAC1E,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,OAAO;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,YAAY,+BAAc,CAAC,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK;YACvF,MAAM,GAAG,+BAAc,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,MAAwB,CAAC;QACxC,MAAM,CAAC,yBAAyB,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;QAC1E,IAAI,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC;YACvD,OAAO,MAAM,CAAC;QAChB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,iFAAiF;IAC1E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC;QACvC,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,SAAS,EAAE,CAAC;YACd,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC;gBAC9B,aAAa,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;CACF;AAxbD,wCAwbC","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/** @packageDocumentation\n * @module Bspline\n /\n\nimport { VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\nimport { CurveIntervalRole, CurveLocationDetail } from \"../curve/CurveLocationDetail\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { CurveOffsetXYHandler } from \"../curve/internalContexts/CurveOffsetXYHandler\";\nimport { PlaneAltitudeRangeContext } from \"../curve/internalContexts/PlaneAltitudeRangeContext\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { OffsetOptions } from \"../curve/OffsetOptions\";\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { UnivariateBezier } from \"../numerics/BezierPolynomials\";\nimport { AkimaCurve3dOptions } from \"./AkimaCurve3d\";\nimport { Bezier1dNd } from \"./Bezier1dNd\";\nimport { BezierCurve3d } from \"./BezierCurve3d\";\nimport { BezierCurve3dH } from \"./BezierCurve3dH\";\nimport { BezierCurveBase } from \"./BezierCurveBase\";\nimport { BSpline1dNd } from \"./BSpline1dNd\";\nimport { BSplineCurveOps } from \"./BSplineCurveOps\";\nimport { InterpolationCurve3dOptions } from \"./InterpolationCurve3d\";\nimport { BSplineWrapMode, KnotVector } from \"./KnotVector\";\n\n/\n Base class for BSplineCurve3d and BSplineCurve3dH.\n * * A B-spline curve consists of an array of `knots`, an array of `poles`, and a `degree`.\n * * The knot array is a non-decreasing sequence of numbers. It is also called a \"knot vector\".\n * * The curve is a parametric function whose domain is a sub-range of its knots.\n * * The API sometimes refers to a domain parameter `u` as a \"knot\", even if `u` is not actually an entry in the\n * knot array.\n * * The curve loosely \"follows\" the line string formed by the poles, aka the \"control polygon\".\n * * The curve is a chain of polynomial segments, aka \"spans\" or \"fragments\". B-spline theory identifies these as\n * Bezier curves.\n * * The polynomial spans all have same `degree`.\n * * Each span is controlled by `order = degree + 1` contiguous points in the pole array.\n * * There is a strict relationship between knot and poles counts: `numPoles + order = numKnots + 2'.\n * * The number of spans is `numSpan = numPoles - degree`.\n * * For a span with index `spanIndex`:\n * * The `order` relevant poles begin at pole index `spanIndex`.\n * * The `2degree` relevant knots begin at knot index `spanIndex`.\n * The span domain is the knot range `[knot[spanIndex+degree-1], knot[spanIndex+degree]]`.\n * * The curve domain is the knot range `[knot[degree-1], knot[numSpan+degree-1]]`, or equivalently\n * `[knot[degree-1], knot[numPoles-1]]`. The API refers to this domain as the \"active knot interval\" of the curve.\n \n Nearly all B-spline curves are \"clamped\".\n * * This means that in the `knots` array, the first `degree` knots are equal, and the last `degree` knots are equal.\n * We say the smallest knot and the largest knot have multiplicity `degree`.\n * * Clamping make the curve pass through its first and last poles, with tangents directed along the first and\n * last edges of the control polygon.\n * * For instance, a cubic B-spline curve with knot vector `[0,0,0,1,2,3,3,3]`\n * * can be evaluated at parameter values in the range `[0, 3]`\n * * has 3 spans, with domains `[0, 1]`, `[1, 2]`, and `[2, 3]`\n * * has 6 poles\n * * passes through its first and last poles.\n * * The `create` methods may allow the classic convention that has an extra knot at the beginning and end of the\n * knot vector.\n * * These two extra knots are not actually needed to define the B-spline curve.\n * * When the `create` methods recognize the classic setup (`numPoles + order = numKnots`), the extra knots are\n * not saved with the BSplineCurve3dBase knots.\n \n * The weighted variant [[BSplineCurve3dH]] has the problem that `CurvePrimitive` 3D typing does not allow the\n * undefined result where a homogeneous pole has zero weight; the convention in this case is to return 000.\n \n * Note the class relationships:\n * * [[BSpline1dNd]] knows the definitional B-spline recurrence relation with no physical interpretation for the poles.\n * * BsplineCurve3dBase owns a protected BSpline1dNd.\n * * `BsplineCurve3dBase` is derived from [[CurvePrimitive]], which creates obligation to act as a 3D curve, e.g.,\n * * evaluate fraction to point and derivatives wrt fraction.\n * * compute intersection with plane.\n * * [[BSplineCurve3d]] and [[BSplineCurve3dH]] have variant logic driven by whether or not there are \"weights\" on the poles.\n * * For `BSplineCurve3d`, the xyz value of pole calculations are \"final\" values for 3d evaluation.\n * * For `BSplineCurve3dH`, various `BSpline1dNd` results with xyzw have to be normalized back to xyz.\n \n * These classes do not support \"periodic\" variants.\n * * Periodic curves historically have carried a flag (e.g., \"closed\") indicating that certain un-stored\n * leading/trailing knots and poles are understood to wrap around periodically.\n * * Instead, these classes carry no such flag. They represent such curves with explicitly wrapped knots/poles.\n \n * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/BSpline/\n * @public\n /\nexport abstract class BSplineCurve3dBase extends CurvePrimitive {\n /* String name for schema properties. /\n public readonly curvePrimitiveType = \"bsplineCurve\";\n /* The underlying blocked-pole spline, with simple x,y,z poles. /\n protected _bcurve: BSpline1dNd;\n private _definitionData?: any;\n public set definitionData(data: any) {\n this._definitionData = data;\n }\n public get definitionData(): any {\n return this._definitionData;\n }\n protected constructor(poleDimension: number, numPoles: number, order: number, knots: KnotVector) {\n super();\n this._bcurve = BSpline1dNd.create(numPoles, poleDimension, order, knots);\n }\n /* Return the degree (one less than the order) of the curve. /\n public get degree(): number {\n return this._bcurve.degree;\n }\n /* Return the order (one more than degree) of the curve. /\n public get order(): number {\n return this._bcurve.order;\n }\n /\n Return the number of Bezier spans in the curve. Note that this number includes the number of null\n * spans at repeated knots.\n /\n public get numSpan(): number {\n return this._bcurve.numSpan;\n }\n /* Return the number of poles. /\n public get numPoles(): number {\n return this._bcurve.numPoles;\n }\n /* Return live reference to the poles of the curve. /\n public get polesRef(): Float64Array {\n return this._bcurve.packedData;\n }\n /* Return live reference to the knots of the curve. /\n public get knotsRef(): Float64Array {\n return this._bcurve.knots.knots;\n }\n /\n Number of components per pole, e.g.,\n * * 3 for conventional (x,y,z) curve.\n * * 4 for weighted (wx,wy,wz,w) curve.\n /\n public get poleDimension(): number {\n return this._bcurve.poleLength;\n }\n /* Return a simple array form of the knots. Optionally replicate the first and last in classic over-clamped manner. /\n public copyKnots(includeExtraEndKnot: boolean): number[] {\n return this._bcurve.knots.copyKnots(includeExtraEndKnot);\n }\n /* Get the flag indicating the curve might be suitable for having wrapped \"closed\" interpretation. /\n public getWrappable(): BSplineWrapMode {\n return this._bcurve.knots.wrappable;\n }\n /* Set the flag indicating the curve might be suitable for having wrapped \"closed\" interpretation. /\n public setWrappable(value: BSplineWrapMode) {\n this._bcurve.knots.wrappable = value;\n }\n /\n Test knots and poles to determine if it is possible to close (aka \"wrap\") the curve.\n * @returns the manner in which it is possible to close the curve. See `BSplineWrapMode` for particulars of each mode.\n /\n public get isClosableCurve(): BSplineWrapMode {\n const mode = this._bcurve.knots.wrappable;\n if (mode === BSplineWrapMode.None)\n return BSplineWrapMode.None;\n if (!this._bcurve.knots.testClosable(mode))\n return BSplineWrapMode.None;\n if (!this._bcurve.testClosablePolygon(mode))\n return BSplineWrapMode.None;\n return mode;\n }\n /* Evaluate the curve at a fractional position within a given span. /\n public abstract evaluatePointInSpan(spanIndex: number, spanFraction: number, result?: Point3d): Point3d;\n /\n Evaluate the curve and derivative at a fractional position within a given span.\n * * The derivative is with respect to the span fractional parameter, _not_ to the curve's parameter or fractional parameter.\n /\n public abstract evaluatePointAndDerivativeInSpan(spanIndex: number, spanFraction: number, result?: Ray3d): Ray3d;\n /* Evaluate the curve at the given parameter. /\n public abstract knotToPoint(knot: number, result?: Point3d): Point3d;\n /* Evaluate the curve and derivative at the given parameter. /\n public abstract knotToPointAndDerivative(knot: number, result?: Ray3d): Ray3d;\n /* Evaluate the curve and two derivatives at the given parameter. /\n public abstract knotToPointAnd2Derivatives(knot: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;\n /* Evaluate the curve point at the given fractional parameter. /\n public fractionToPoint(fraction: number, result?: Point3d): Point3d {\n return this.knotToPoint(this._bcurve.knots.fractionToKnot(fraction), result);\n }\n /* Evaluate the curve and derivative at the given fractional parameter. /\n public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\n const knot = this._bcurve.knots.fractionToKnot(fraction);\n result = this.knotToPointAndDerivative(knot, result);\n result.direction.scaleInPlace(this._bcurve.knots.knotLength01);\n return result;\n }\n /* Evaluate the curve and two derivatives at the given fractional parameter. /\n public fractionToPointAnd2Derivatives(fraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\n const knot = this._bcurve.knots.fractionToKnot(fraction);\n result = this.knotToPointAnd2Derivatives(knot, result);\n const a = this._bcurve.knots.knotLength01;\n result.vectorU.scaleInPlace(a);\n result.vectorV.scaleInPlace(a a);\n return result;\n }\n /** Return the start point of the curve. /\n public override startPoint(result?: Point3d): Point3d {\n return this.evaluatePointInSpan(0, 0.0, result);\n }\n /* Return the end point of the curve. /\n public override endPoint(result?: Point3d): Point3d {\n return this.evaluatePointInSpan(this.numSpan - 1, 1.0, result);\n }\n /\n Reverse the curve in place.\n * * Poles are reversed.\n * * Knot values are mirrored around the middle of the knot array.\n /\n public reverseInPlace(): void {\n this._bcurve.reverseInPlace();\n }\n /* Return an array with this curve's Bezier fragments. /\n public collectBezierSpans(prefer3dH: boolean): BezierCurveBase[] {\n const result: BezierCurveBase[] = [];\n const numSpans = this.numSpan;\n for (let i = 0; i < numSpans; i++) {\n if (this._bcurve.knots.isIndexOfRealSpan(i)) {\n const span = this.getSaturatedBezierSpan3dOr3dH(i, prefer3dH);\n if (span)\n result.push(span);\n }\n }\n return result;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * * The concrete return type may be [[BezierCurve3d]] or [[BezierCurve3dH]] according to the instance type and `prefer3dH`.\n * @param spanIndex index of span.\n * @param prefer3dH true to force promotion to homogeneous.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public abstract getSaturatedBezierSpan3dOr3dH(\n spanIndex: number, prefer3dH: boolean, result?: BezierCurveBase,\n ): BezierCurveBase \| undefined;\n /\n Return a specified pole as a Point4d.\n * * BSplineCurve3d appends weight 1 to its xyz.\n * * BSplineCurve3dH with pole whose \"normalized\" point is (x,y,z) but has weight w returns the weighted form (wx,wy,wz,w).\n /\n public abstract getPolePoint4d(poleIndex: number, result?: Point4d): Point4d \| undefined;\n /\n Return a specified pole as a Point3d.\n * * BSplineCurve3d returns its simple xyz.\n * * BSplineCurve3dH attempts to normalize its (wx,wy,wz,w) back to (x,y,z), and returns undefined if weight is zero.\n * @param poleIndex index of the pole.\n * @param result optional result.\n /\n public abstract getPolePoint3d(poleIndex: number, result?: Point3d): Point3d \| undefined;\n /* Given a pole index, return the starting index for the contiguous array. /\n public poleIndexToDataIndex(poleIndex: number): number \| undefined {\n if (poleIndex >= 0 && poleIndex < this.numPoles)\n return poleIndex this._bcurve.poleLength;\n return undefined;\n }\n /*\n Search for the curve point that is closest to the spacePoint.\n * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.\n * * Since CurvePrimitive should always have start and end available as candidate points, this method should always\n * succeed.\n * @param spacePoint point in space.\n * @param _extend ignored (pass false). A BSplineCurve3dBase cannot be extended.\n * @param result optional pre-allocated detail to populate and return.\n * @returns details of the closest point.\n /\n public override closestPoint(\n spacePoint: Point3d, _extend: VariantCurveExtendParameter = false, result?: CurveLocationDetail,\n ): CurveLocationDetail \| undefined {\n // seed at start point; final point comes with final bezier perpendicular step\n const point = this.fractionToPoint(0);\n result = CurveLocationDetail.createCurveFractionPointDistance(this, 0.0, point, point.distance(spacePoint), result);\n let span: BezierCurve3dH \| undefined;\n const numSpans = this.numSpan;\n for (let i = 0; i < numSpans; i++) {\n if (this._bcurve.knots.isIndexOfRealSpan(i)) {\n span = this.getSaturatedBezierSpan3dOr3dH(i, true, span) as BezierCurve3dH;\n if (span) {\n // if the B-spline is discontinuous, both ends should be tested; ignore that possibility\n if (span.updateClosestPointByTruePerpendicular(spacePoint, result, false, true)) {\n // the detail records the span bezier; promote it to the parent curve\n result.curve = this;\n result.fraction = span.fractionToParentFraction(result.fraction);\n }\n }\n }\n }\n return result;\n }\n /* Return a deep clone. /\n public abstract override clone(): BSplineCurve3dBase;\n /* Return a transformed deep clone. /\n public override cloneTransformed(transform: Transform): BSplineCurve3dBase {\n const curve = this.clone();\n curve.tryTransformInPlace(transform);\n return curve;\n }\n /\n Return a curve primitive which is a portion of this curve.\n * @param fractionA start fraction.\n * @param fractionB end fraction.\n /\n public override clonePartialCurve(fractionA: number, fractionB: number): BSplineCurve3dBase {\n let clone: BSplineCurve3dBase;\n if (fractionA > fractionB) {\n clone = this.clonePartialCurve(fractionB, fractionA);\n clone.reverseInPlace();\n return clone;\n }\n clone = this.clone();\n const origNumKnots = clone._bcurve.knots.knots.length;\n let knotA = clone._bcurve.knots.fractionToKnot(fractionA);\n let knotB = clone._bcurve.knots.fractionToKnot(fractionB);\n clone._bcurve.addKnot(knotA, clone.degree);\n clone._bcurve.addKnot(knotB, clone.degree);\n if (origNumKnots === clone._bcurve.knots.knots.length)\n return clone; // full curve\n if (knotA > knotB)\n [knotA, knotB] = [knotB, knotA];\n // choose first/last knot and pole such that knotA/knotB has degree multiplicity in the new knot sequence\n const iStartKnot = clone._bcurve.knots.knotToLeftKnotIndex(knotA) - clone.degree + 1;\n const iStartPole = iStartKnot clone._bcurve.poleLength;\n const iLastKnot = clone._bcurve.knots.knotToLeftKnotIndex(knotB);\n let iLastKnotLeftMultiple = iLastKnot - clone._bcurve.knots.getKnotMultiplicityAtIndex(iLastKnot) + 1;\n if (clone._bcurve.knots.knots[iLastKnot] < knotB)\n iLastKnotLeftMultiple = iLastKnot + 1;\n const iEndPole = (iLastKnotLeftMultiple + 1) * clone._bcurve.poleLength; // one past last pole\n const iEndKnot = iLastKnotLeftMultiple + clone.degree; // one past last knot\n // trim the arrays (leave knots unnormalized)\n clone._bcurve.knots.setKnotsCapture(clone._bcurve.knots.knots.slice(iStartKnot, iEndKnot));\n clone._bcurve.packedData = clone._bcurve.packedData.slice(iStartPole, iEndPole);\n clone.setWrappable(BSplineWrapMode.None); // always open\n return clone;\n }\n /*\n Implement `CurvePrimitive.appendPlaneIntersections` to compute intersections of the curve with a plane.\n * @param plane the plane with which to intersect the curve. Concrete types include [[Plane3dByOriginAndUnitNormal]],\n * [[Point4d]], etc.\n * @param result growing array of plane intersections.\n * @return number of intersections appended to the array.\n /\n public override appendPlaneIntersectionPoints(plane: PlaneAltitudeEvaluator, result: CurveLocationDetail[]): number {\n const numPole = this.numPoles;\n const order = this.order;\n const allCoffs = new Float64Array(numPole);\n const numSpan = this.numSpan;\n const point4d = Point4d.create();\n // compute all pole altitudes from the plane\n const minMax = Range1d.createNull();\n // put the altitudes of all the B-spline poles in one array\n for (let i = 0; i < numPole; i++) {\n this.getPolePoint4d(i, point4d);\n allCoffs[i] = plane.weightedAltitude(point4d);\n minMax.extendX(allCoffs[i]);\n }\n // A univariate B-spline through the altitude poles gives altitude as function of the B-spline knot.\n // The (bspline) altitude function for each span is `order` consecutive altitudes.\n // If those altitudes bracket zero, the span may potentially have a crossing.\n let univariateBezier: UnivariateBezier \| undefined;\n let numFound = 0;\n let previousFraction = -1000.0;\n if (minMax.containsX(0.0)) {\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n if (this._bcurve.knots.isIndexOfRealSpan(spanIndex)) { // ignore trivial knot intervals\n // outer range test ...\n minMax.setNull();\n minMax.extendArraySubset(allCoffs, spanIndex, order);\n if (minMax.containsX(0.0)) {\n // pack the B-spline support into a univariate bezier\n univariateBezier = UnivariateBezier.createArraySubset(allCoffs, spanIndex, order, univariateBezier);\n // saturate and solve the bezier\n Bezier1dNd.saturate1dInPlace(univariateBezier.coffs, this._bcurve.knots, spanIndex);\n const roots = univariateBezier.roots(0.0, true);\n if (roots) {\n for (const spanFraction of roots) {\n // promote each local bezier fraction to global fraction and save the curve evaluation at that fraction\n numFound++;\n const fraction = this._bcurve.knots.spanFractionToFraction(spanIndex, spanFraction);\n if (!Geometry.isAlmostEqualNumber(fraction, previousFraction)) {\n const detail = CurveLocationDetail.createCurveEvaluatedFraction(this, fraction);\n detail.intervalRole = CurveIntervalRole.isolated;\n result.push(detail);\n previousFraction = fraction;\n }\n }\n }\n }\n }\n }\n }\n return numFound;\n }\n /\n Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\n * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object.\n /\n public override constructOffsetXY(offsetDistanceOrOptions: number \| OffsetOptions): BSplineCurve3d \| undefined {\n const options = OffsetOptions.create(offsetDistanceOrOptions);\n const handler = new CurveOffsetXYHandler(this, options.leftOffsetDistance);\n this.emitStrokableParts(handler, options.strokeOptions);\n return handler.claimResult();\n }\n /\n Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\n * of projection.\n * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\n * @param lowHigh optional receiver for output.\n * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\n * end of the ray.\n /\n public override projectedParameterRange(ray: Vector3d \| Ray3d, lowHigh?: Range1d): Range1d \| undefined {\n return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\n }\n}\n/\n A BSplineCurve3d is a B-spline curve whose poles are Point3d.\n * See BSplineCurve3dBase for description of knots, order, degree, and poles.\n * @public\n /\nexport class BSplineCurve3d extends BSplineCurve3dBase {\n private _workBezier?: BezierCurve3d;\n private initializeWorkBezier(): BezierCurve3d {\n if (this._workBezier === undefined)\n this._workBezier = BezierCurve3d.createOrder(this.order);\n return this._workBezier;\n }\n private constructor(numPoles: number, order: number, knots: KnotVector) {\n super(3, numPoles, order, knots);\n }\n /* Test if `other` is an instance of BSplineCurve3d. /\n public isSameGeometryClass(other: any): boolean {\n return other instanceof BSplineCurve3d;\n }\n /* Apply `transform` to the poles. /\n public tryTransformInPlace(transform: Transform): boolean {\n Point3dArray.multiplyInPlace(transform, this._bcurve.packedData);\n return true;\n }\n /* Get a pole as a simple Point3d. /\n public getPolePoint3d(poleIndex: number, result?: Point3d): Point3d \| undefined {\n const k = this.poleIndexToDataIndex(poleIndex);\n if (k !== undefined) {\n const data = this._bcurve.packedData;\n return Point3d.create(data[k], data[k + 1], data[k + 2], result);\n }\n return undefined;\n }\n /* Get a pole as Point4d with weight 1. /\n public getPolePoint4d(poleIndex: number, result?: Point4d): Point4d \| undefined {\n const k = this.poleIndexToDataIndex(poleIndex);\n if (k !== undefined) {\n const data = this._bcurve.packedData;\n return Point4d.create(data[k], data[k + 1], data[k + 2], 1.0, result);\n }\n return undefined;\n }\n /\n Convert the fractional position in the given span to a knot.\n * * The returned value is not necessarily a knot, but it is a valid parameter in the domain of the B-spline curve.\n /\n public spanFractionToKnot(spanIndex: number, spanFraction: number): number {\n return this._bcurve.spanFractionToKnot(spanIndex, spanFraction);\n }\n /* Return a simple array of arrays with the poles as `[[x,y,z],[x,y,z],..]`. /\n public copyPoints(): any[] {\n return Point3dArray.unpackNumbersToNestedArrays(this._bcurve.packedData, 3);\n }\n /* Return a simple array of poles' coordinates. /\n public copyPointsFloat64Array(): Float64Array {\n return this._bcurve.packedData.slice();\n }\n /* Return a simple array form of the knots. Optionally replicate the first and last in classic over-clamped manner. /\n public override copyKnots(includeExtraEndKnot: boolean): number[] {\n return this._bcurve.knots.copyKnots(includeExtraEndKnot);\n }\n /* Create a B-spline with uniform knots. /\n public static createUniformKnots(\n poles: Point3d[] \| Float64Array \| GrowableXYZArray, order: number,\n ): BSplineCurve3d \| undefined {\n const numPoles = poles instanceof Float64Array ? poles.length / 3 : poles.length;\n if (order < 2 \|\| numPoles < order)\n return undefined;\n const knots = KnotVector.createUniformClamped(numPoles, order - 1, 0.0, 1.0);\n const curve = new BSplineCurve3d(numPoles, order, knots);\n if (poles instanceof Float64Array) {\n for (let i = 0; i < 3 numPoles; i++)\n curve._bcurve.packedData[i] = poles[i];\n } else if (poles instanceof GrowableXYZArray) {\n curve._bcurve.packedData = poles.float64Data().slice(0, 3 * numPoles);\n } else {\n let i = 0;\n for (const p of poles) {\n curve._bcurve.packedData[i++] = p.x;\n curve._bcurve.packedData[i++] = p.y;\n curve._bcurve.packedData[i++] = p.z;\n }\n }\n return curve;\n }\n /*\n Create a smoothly closed B-spline curve with uniform knots.\n * * Note that the curve does not start at the first pole.\n /\n public static createPeriodicUniformKnots(\n poles: Point3d[] \| Float64Array \| GrowableXYZArray, order: number,\n ): BSplineCurve3d \| undefined {\n if (order < 2)\n return undefined;\n let numPoles = poles instanceof Float64Array ? poles.length / 3 : poles.length;\n if (numPoles < 2)\n return undefined;\n const startPoint = Point3d.createZero();\n const endPoint = Point3d.createZero();\n let hasClosurePoint = false;\n do {\n if (poles instanceof Float64Array) {\n startPoint.set(poles[0], poles[1], poles[2]);\n endPoint.set(poles[3 numPoles - 3], poles[3 * numPoles - 2], poles[3 * numPoles - 1]);\n } else if (poles instanceof GrowableXYZArray) {\n poles.getPoint3dAtUncheckedPointIndex(0, startPoint);\n poles.getPoint3dAtUncheckedPointIndex(numPoles - 1, endPoint);\n } else {\n startPoint.setFromPoint3d(poles[0]);\n endPoint.setFromPoint3d(poles[numPoles - 1]);\n }\n if (hasClosurePoint = startPoint.isAlmostEqual(endPoint))\n --numPoles; // remove wraparound pole if found\n } while (hasClosurePoint && numPoles > 1);\n if (numPoles < order)\n return undefined;\n const degree = order - 1;\n const numIntervals = numPoles;\n const knots = KnotVector.createUniformWrapped(numIntervals, degree, 0.0, 1.0);\n knots.wrappable = BSplineWrapMode.OpenByAddingControlPoints;\n // append degree wraparound poles\n const curve = new BSplineCurve3d(numPoles + degree, order, knots);\n if (poles instanceof Float64Array) {\n let i = 0;\n for (let j = 0; j < 3 * numPoles; j++)\n curve._bcurve.packedData[i++] = poles[j];\n for (let j = 0; j < 3 * degree; j++)\n curve._bcurve.packedData[i++] = poles[j];\n } else if (poles instanceof GrowableXYZArray) {\n let i = 0;\n for (let j = 0; j < 3 * numPoles; j++)\n curve._bcurve.packedData[i++] = poles.float64Data()[j];\n for (let j = 0; j < 3 * degree; j++)\n curve._bcurve.packedData[i++] = poles.float64Data()[j];\n } else {\n let i = 0;\n for (let j = 0; j < numPoles; j++) {\n curve._bcurve.packedData[i++] = poles[j].x;\n curve._bcurve.packedData[i++] = poles[j].y;\n curve._bcurve.packedData[i++] = poles[j].z;\n }\n for (let j = 0; j < degree; j++) {\n curve._bcurve.packedData[i++] = poles[j].x;\n curve._bcurve.packedData[i++] = poles[j].y;\n curve._bcurve.packedData[i++] = poles[j].z;\n }\n }\n return curve;\n }\n /*\n Create a C2 cubic B-spline curve that interpolates the given points and optional end tangents.\n * @param options collection of points and end conditions.\n /\n public static createFromInterpolationCurve3dOptions(options: InterpolationCurve3dOptions): BSplineCurve3d \| undefined {\n return BSplineCurveOps.createThroughPointsC2Cubic(options);\n }\n /\n Create a B-spline curve from an Akima curve.\n * @param options collection of points and end conditions.\n /\n public static createFromAkimaCurve3dOptions(options: AkimaCurve3dOptions): BSplineCurve3d \| undefined {\n return BSplineCurveOps.createThroughPoints(options.fitPoints, 4); // temporary\n }\n /\n Create a B-spline curve with given knots.\n * * The poles have several variants:\n * * Float64Array(3 * numPoles) in blocks of [x,y,z].\n * * Point3d[].\n * * number[][], with inner dimension 3.\n * * Two count conditions are recognized:\n * * If poleArray.length + order === knotArray.length, the first and last are assumed to be the extraneous knots\n * of classic clamping.\n * * If poleArray.length + order === knotArray.length + 2, the knots are in modern form.\n * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/BSpline/\n /\n public static create(\n poleArray: Float64Array \| Point3d[] \| number[][], knotArray: Float64Array \| number[], order: number,\n ): BSplineCurve3d \| undefined {\n if (order < 2)\n return undefined;\n let numPoles = poleArray.length;\n if (poleArray instanceof Float64Array)\n numPoles = Math.floor(numPoles / 3); // blocked as xyz\n if (numPoles < order)\n return undefined;\n const numKnots = knotArray.length;\n const skipFirstAndLast = (numPoles + order === numKnots); // classic over-clamped input knots\n if (!skipFirstAndLast && numPoles + order !== numKnots + 2) // modern knots\n return undefined;\n const knots = KnotVector.create(knotArray, order - 1, skipFirstAndLast);\n const curve = new BSplineCurve3d(numPoles, order, knots);\n let i = 0;\n if (poleArray instanceof Float64Array) {\n for (const coordinate of poleArray)\n curve._bcurve.packedData[i++] = coordinate;\n } else if (poleArray[0] instanceof Point3d) {\n for (const p of poleArray as Point3d[]) {\n curve._bcurve.packedData[i++] = p.x;\n curve._bcurve.packedData[i++] = p.y;\n curve._bcurve.packedData[i++] = p.z;\n }\n } else if (Array.isArray(poleArray[0]) && poleArray[0].length === 3) {\n for (const point of poleArray as number[][])\n for (const coord of point)\n curve._bcurve.packedData[i++] = coord;\n } else {\n return undefined; // unexpected poleArray type\n }\n return curve;\n }\n /* Return a deep clone. /\n public override clone(): BSplineCurve3d {\n const knotVector = this._bcurve.knots.clone();\n const curve = new BSplineCurve3d(this.numPoles, this.order, knotVector);\n curve._bcurve.packedData = this._bcurve.packedData.slice();\n return curve;\n }\n /* Evaluate the curve at a fractional position within a given span. /\n public evaluatePointInSpan(spanIndex: number, spanFraction: number, result?: Point3d): Point3d {\n this._bcurve.evaluateBuffersInSpan(spanIndex, spanFraction);\n return Point3d.createFrom(this._bcurve.poleBuffer, result);\n }\n /\n Evaluate the curve and derivative at a fractional position within a given span.\n * * The derivative is with respect to the span fractional parameter, _not_ to the curve's parameter or fractional parameter.\n /\n public evaluatePointAndDerivativeInSpan(spanIndex: number, spanFraction: number): Ray3d {\n this._bcurve.evaluateBuffersInSpan1(spanIndex, spanFraction);\n return Ray3d.createCapture(\n Point3d.createFrom(this._bcurve.poleBuffer),\n Vector3d.createFrom(this._bcurve.poleBuffer1),\n );\n }\n /\n Evaluate the curve at the given parameter.\n * @param u parameter in curve domain.\n * @param result optional result.\n * @returns the point on the curve.\n /\n public knotToPoint(u: number, result?: Point3d): Point3d {\n this._bcurve.evaluateBuffersAtKnot(u);\n return Point3d.createFrom(this._bcurve.poleBuffer, result);\n }\n /\n Evaluate the curve and derivative at the given parameter.\n * @param u parameter in curve domain.\n * @param result optional result.\n * @returns the ray with origin at the curve point and direction as the derivative.\n /\n public knotToPointAndDerivative(u: number, result?: Ray3d): Ray3d {\n this._bcurve.evaluateBuffersAtKnot(u, 1);\n if (!result)\n return Ray3d.createCapture(\n Point3d.createFrom(this._bcurve.poleBuffer),\n Vector3d.createFrom(this._bcurve.poleBuffer1),\n );\n result.origin.setFrom(this._bcurve.poleBuffer);\n result.direction.setFrom(this._bcurve.poleBuffer1);\n return result;\n }\n /\n Evaluate the curve and two derivatives at the given parameter.\n * @param u parameter in the curve domain.\n * @param result optional result.\n * @returns the plane with origin at the curve point, vectorU as the 1st derivative, and vectorV as the 2nd derivative.\n /\n public knotToPointAnd2Derivatives(u: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors {\n this._bcurve.evaluateBuffersAtKnot(u, 2);\n return Plane3dByOriginAndVectors.createOriginAndVectorsXYZ(\n this._bcurve.poleBuffer[0], this._bcurve.poleBuffer[1], this._bcurve.poleBuffer[2],\n this._bcurve.poleBuffer1[0], this._bcurve.poleBuffer1[1], this._bcurve.poleBuffer1[2],\n this._bcurve.poleBuffer2[0], this._bcurve.poleBuffer2[1], this._bcurve.poleBuffer2[2],\n result,\n );\n }\n /* Test if `this` is almost the same curve as `other`. /\n public override isAlmostEqual(other: any): boolean {\n if (other instanceof BSplineCurve3d) {\n return this._bcurve.knots.isAlmostEqual(other._bcurve.knots)\n && Point3dArray.isAlmostEqual(this._bcurve.packedData, other._bcurve.packedData);\n }\n return false;\n }\n /* Test if this curve lies entirely in the given plane. /\n public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\n return Point3dArray.isCloseToPlane(this._bcurve.packedData, plane);\n }\n /\n Return the control polygon length as an approximation to the curve length.\n * * The returned length is always an overestimate.\n /\n public quickLength(): number {\n return Point3dArray.sumEdgeLengths(this._bcurve.packedData);\n }\n /* Emit Beziers or strokes (selected by the stroke options) to the handler. /\n public emitStrokableParts(handler: IStrokeHandler, options?: StrokeOptions): void {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n let numStrokes;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3dOr3dH(spanIndex, false, workBezier);\n if (bezier) {\n numStrokes = bezier.computeStrokeCountForOptions(options);\n if (handler.announceBezierCurve) {\n handler.announceBezierCurve(\n bezier,\n numStrokes,\n this,\n spanIndex,\n this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\n this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0),\n );\n\n } else {\n handler.announceIntervalForUniformStepStrokes(\n this,\n numStrokes,\n this._bcurve.knots.spanFractionToFraction(spanIndex, 0.0),\n this._bcurve.knots.spanFractionToFraction(spanIndex, 1.0),\n );\n }\n }\n }\n }\n /\n Assess length and turn to determine a stroke count.\n * @param options stroke options structure.\n /\n public computeStrokeCountForOptions(options?: StrokeOptions): number {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n let numStroke = 0;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier)\n numStroke += bezier.computeStrokeCountForOptions(options);\n }\n return numStroke;\n }\n /\n Compute individual segment stroke counts. Attach in a StrokeCountMap.\n * @param options StrokeOptions that determine count\n * @param parentStrokeMap evolving parent map.\n * @alpha\n /\n public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n const myData = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap, []);\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier) {\n const segmentLength = workBezier.curveLength();\n const numStrokeOnSegment = workBezier.computeStrokeCountForOptions(options);\n myData.addToCountAndLength(numStrokeOnSegment, segmentLength);\n }\n }\n CurvePrimitive.installStrokeCountMap(this, myData, parentStrokeMap);\n }\n /* Append strokes to the given linestring. /\n public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\n const workBezier = this.initializeWorkBezier();\n const numSpan = this.numSpan;\n for (let spanIndex = 0; spanIndex < numSpan; spanIndex++) {\n const bezier = this.getSaturatedBezierSpan3d(spanIndex, workBezier);\n if (bezier)\n bezier.emitStrokes(dest, options);\n }\n }\n /\n Test knots and poles to determine if it is possible to close (aka \"wrap\") the curve.\n * @returns the manner in which it is possible to close the curve. See `BSplineWrapMode` for particulars of each mode.\n /\n public get isClosable(): BSplineWrapMode {\n return this.isClosableCurve;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * * The concrete return type may be [[BezierCurve3d]] or [[BezierCurve3dH]] according to the instance type and `prefer3dH`.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3dOr3dH(\n spanIndex: number, prefer3dH: boolean, result?: BezierCurveBase,\n ): BezierCurveBase \| undefined {\n if (prefer3dH)\n return this.getSaturatedBezierSpan3dH(spanIndex, result);\n return this.getSaturatedBezierSpan3d(spanIndex, result);\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3d(spanIndex: number, result?: BezierCurveBase): BezierCurve3d \| undefined {\n if (spanIndex < 0 \|\| spanIndex >= this.numSpan)\n return undefined;\n const order = this.order;\n if (result === undefined \|\| !(result instanceof BezierCurve3d) \|\| result.order !== order)\n result = BezierCurve3d.createOrder(order);\n const bezier = result as BezierCurve3d;\n bezier.loadSpanPoles(this._bcurve.packedData, spanIndex);\n if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))\n return bezier;\n return undefined;\n }\n /\n Return the Bezier fragment corresponding to the given span of this curve.\n * @param spanIndex index of span.\n * @param result optional reusable curve. This will only be reused if its type and order matches.\n /\n public getSaturatedBezierSpan3dH(spanIndex: number, result?: BezierCurveBase): BezierCurve3dH \| undefined {\n if (spanIndex < 0 \|\| spanIndex >= this.numSpan)\n return undefined;\n const order = this.order;\n if (result === undefined \|\| !(result instanceof BezierCurve3dH) \|\| result.order !== order)\n result = BezierCurve3dH.createOrder(order);\n const bezier = result as BezierCurve3dH;\n bezier.loadSpan3dPolesWithWeight(this._bcurve.packedData, spanIndex, 1.0);\n if (bezier.saturateInPlace(this._bcurve.knots, spanIndex))\n return bezier;\n return undefined;\n }\n /* Second step of double dispatch: call `handler.handleBSplineCurve3d(this)`. /\n public dispatchToGeometryHandler(handler: GeometryHandler): any {\n return handler.handleBSplineCurve3d(this);\n }\n /\n Extend a range so it contains the range of this curve.\n * * This computation is based on the poles, not the curve itself, so the returned range is generally larger than the\n * tightest possible range.\n * @param rangeToExtend range to extend.\n * @param transform transform to apply to the poles as they are entered into the range.\n */\n public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n const buffer = this._bcurve.packedData;\n const n = buffer.length - 2;\n if (transform) {\n for (let i0 = 0; i0 < n; i0 += 3)\n rangeToExtend.extendTransformedXYZ(transform, buffer[i0], buffer[i0 + 1], buffer[i0 + 2]);\n } else {\n for (let i0 = 0; i0 < n; i0 += 3)\n rangeToExtend.extendXYZ(buffer[i0], buffer[i0 + 1], buffer[i0 + 2]);\n }\n }\n}\n"]}

package/lib/cjs/clipping/BooleanClipNode.d.ts CHANGED Viewed

@@ -70,7 +70,7 @@ export declare abstract class BooleanClipNode implements Clipper {
     announceClippedCurveIntervals(curve: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive): boolean;
 }
 /**
- * Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.
+ * Implement [BooleanClipNode] virtual methods for union (boolean OR) among children.
  * @internal
  */
 export declare class BooleanClipNodeUnion extends BooleanClipNode {
@@ -82,7 +82,7 @@ export declare class BooleanClipNodeUnion extends BooleanClipNode {
     appendPolygonClip(xyz: IndexedXYZCollection, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
 }
 /**
- * Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.
+ * Implement [BooleanClipNode] virtual methods for parity (boolean XOR) among children.
  * @internal
  */
 export declare class BooleanClipNodeParity extends BooleanClipNode {

package/lib/cjs/clipping/BooleanClipNode.js CHANGED Viewed

@@ -224,7 +224,7 @@ class BooleanClipNode {
 }
 exports.BooleanClipNode = BooleanClipNode;
 /**
- * Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.
+ * Implement [BooleanClipNode] virtual methods for union (boolean OR) among children.
  * @internal
  */
 class BooleanClipNodeUnion extends BooleanClipNode {
@@ -251,7 +251,7 @@ class BooleanClipNodeUnion extends BooleanClipNode {
 }
 exports.BooleanClipNodeUnion = BooleanClipNodeUnion;
 /**
- * Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.
+ * Implement [BooleanClipNode] virtual methods for parity (boolean XOR) among children.
  * @internal
  */
 class BooleanClipNodeParity extends BooleanClipNode {

package/lib/cjs/clipping/BooleanClipNode.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"BooleanClipNode.js","sourceRoot":"","sources":["../../../src/clipping/BooleanClipNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAM7C,+CAA8C;AAE9C,2DAAwD;AACxD,2CAAqF;AAErF;;;;;;;;;;;;;;;;GAgBG;AACH,MAAsB,eAAe;IACzB,SAAS,CAAY;IACrB,WAAW,CAAY;IACvB,WAAW,CAAY;IACvB,WAAW,CAAU;IAC/B,YAAmB,UAAmB;QACpC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IAIM,MAAM;QACX,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAQ,CAAC;YACpB,IAAI,EAAE,CAAC,MAAM;gBACX,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,gCAAgC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC7B,MAAM,IAAI,GAAgC,EAAE,CAAC;QAC7C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qDAAqD;IAC9C,YAAY,CAAC,KAA0B;QAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,iEAAiE;IAC1D,YAAY;QACjB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC;IACD,qCAAqC;IAC9B,YAAY,CAAC,UAAmB;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACO,gBAAgB,CAAC,EAAU,EAAE,EAAU,EAAE,QAA+B;QAChF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACO,iBAAiB,CACzB,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,QAA6C;QAEzF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,gDAAgD;IACtC,MAAM;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,CAAC;IACD;;;OAGG;IACO,eAAe,CACvB,UAAmB,EAAE,SAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,QAA+B;QAElG,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC1E,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC9B,CAAC;YACD,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,eAAe;gBACf,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD;;;OAGG;IACO,gBAAgB,CACxB,UAAmB,EAAE,SAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,QAA6C;QAEpI,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC/E,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC9B,CAAC;YACD,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,eAAe;gBACf,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,+DAA+D;IACxD,iBAAiB,CAAC,KAAc;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,yCAAyC;IAClC,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;YACnD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,YAAY;QACZ,yDAAyD;QACzD,sCAAsC;QACtC,8DAA8D;QAC9D,qCAAqC;QACrC,EAAE;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,+BAA+B,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;YAC7E,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IACpF,CAAC;IACD,yCAAyC;IAClC,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;YACnD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,2BAA2B,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;YACtD,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IACxF,CAAC;IACD,wCAAwC;IACjC,6BAA6B,CAAC,KAAqB,EAAE,QAA6C;QACvG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;YACxE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,6BAA6B,EAAE,CAAC,KAAK,EAAE,iBAAiB,CAAC,IAAI,IAAA,qBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,WAAW,CAAC,IAAI,6CAA6C,CAAC,CAAC;YAC9J,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC1F,CAAC;CACF;AApMD,0CAoMC;AAED;;;GAGG;AACH,MAAa,oBAAqB,SAAQ,eAAe;IACvD,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACzC,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,yBAAyB,CAAC,KAAc;QAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,yBAAa,CAAC,qBAAqB,CACjC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,SAAS,EACT,0BAAc,CAAC,QAAQ,EACvB,0BAAc,CAAC,cAAc,EAC7B,0BAAc,CAAC,SAAS,EACxB,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AApCD,oDAoCC;AAED;;;GAGG;AACH,MAAa,qBAAsB,SAAQ,eAAe;IACxD,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,qEAAqE;IAC9D,yBAAyB,CAAC,KAAc;QAC7C,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAClC,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,yBAAa,CAAC,2BAA2B,CACvC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AAjCD,sDAiCC;AAED;;;GAGG;AACH,MAAa,2BAA4B,SAAQ,eAAe;IAC9D,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,yBAAyB,CAAC,KAAc;QAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBACnC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAGjC,yBAAa,CAAC,qBAAqB,CACjC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,SAAS,EACT,0BAAc,CAAC,cAAc,EAC7B,0BAAc,CAAC,SAAS,EACxB,0BAAc,CAAC,QAAQ,EACvB,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AArCD,kEAqCC","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 { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Range1dArray } from \"../numerics/Range1dArray\";\nimport { Clipper, ClipStepAction, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\n\n/\n BooleanClipNode is an abstract base class for boolean actions by an array of clippers.\n * * Derived class must implement:\n * * The single point test `isPointOnOrInsideChildren`\n * * Boolean operation on 1d intervals `combineIntervals`\n * * The `keepInside` flag controls an additional optional flip of the boolean result:\n * * if `keepInside === true`, accept the \"inside\" of the child clippers.\n * * if `keepInside === false`, accept the \"outside\" of the child clippers.\n * * Hence the combinations of derived classes for (OR, AND, XOR) and keepInside are:\n * * (OR, true) = simple union (OR), i.e., \"in\" one or more clips.\n * * (OR, false) = complement of union (NOR), i.e., \"outside\" all clips.\n * * (AND, true) = simple intersection (AND), i.e., \"in\" all clips.\n * * (AND, false) = complement of intersection (NAND), i.e., \"outside\" one or more clips.\n * * (XOR, true) = simple parity, i.e., \"in\" an odd number of clips.\n * * (XOR, false) = complement of parity, i.e., \"in\" an even number of clips.\n * @internal\n /\nexport abstract class BooleanClipNode implements Clipper {\n protected _clippers: Clipper[];\n protected _intervalsA: Range1d[];\n protected _intervalsB: Range1d[];\n protected _keepInside: boolean;\n public constructor(keepInside: boolean) {\n this._keepInside = keepInside;\n this._clippers = [];\n this._intervalsA = [];\n this._intervalsB = [];\n }\n protected abstract isPointOnOrInsideChildren(point: Point3d): boolean;\n protected abstract combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[];\n public abstract get operationName(): string;\n public toJSON(): any {\n const data = [];\n for (const c of this._clippers) {\n const c1 = c as any;\n if (c1.toJSON)\n data.push(c1.toJSON());\n }\n // return this.formatJSON(data);\n const s = this.operationName;\n const json: { [opType: string]: any[] } = {};\n json[s] = data;\n return json;\n }\n /* Capture a (reference to a) child node or nodes /\n public captureChild(child: Clipper \| Clipper[]) {\n if (Array.isArray(child)) {\n for (const c of child) this.captureChild(c);\n } else {\n this._clippers.push(child);\n }\n }\n /* Toggle the \"keepInside\" behavior. Return the prior value. /\n public toggleResult(): boolean {\n return this.selectResult(!this._keepInside);\n }\n /* Set the \"keepInside\" behavior. /\n public selectResult(keepInside: boolean): boolean {\n const s = this._keepInside;\n this._keepInside = keepInside;\n return s;\n }\n /\n Conditionally (if a1 > a0 strictly) call `announce(a0, a1)`.\n * * Return 0 if not called, 1 if called.\n /\n protected testedAnnounceNN(a0: number, a1: number, announce?: AnnounceNumberNumber): number {\n if (a0 < a1) {\n if (announce)\n announce(a0, a1);\n return 1;\n }\n return 0;\n }\n /\n Conditionally (if a1 > a0 strictly) call `announce(a0, a1, cp)`.\n * * Return 0 if not called, 1 if called.\n /\n protected testedAnnounceNNC(\n a0: number, a1: number, cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n ): number {\n if (a0 < a1) {\n if (announce)\n announce(a0, a1, cp);\n return 1;\n }\n return 0;\n }\n /* Swap the `_intervalsA` and `_intervalsB`. /\n protected swapAB(): void {\n const q = this._intervalsA;\n this._intervalsA = this._intervalsB;\n this._intervalsB = q;\n }\n /\n Announce all \"outside intervals\" -- not masked by intervals.\n * * Return true if any intervals announced.\n /\n protected announcePartsNN(\n keepInside: boolean, intervals: Range1d[], f0: number, f1: number, announce?: AnnounceNumberNumber,\n ): boolean {\n let numAnnounce = 0;\n if (!keepInside) {\n let lowFraction = f0;\n for (const interval of intervals) {\n numAnnounce += this.testedAnnounceNN(lowFraction, interval.low, announce);\n lowFraction = interval.high;\n }\n numAnnounce += this.testedAnnounceNN(lowFraction, f1, announce);\n } else {\n for (const interval of intervals) {\n // use f0..f1 ?\n numAnnounce += this.testedAnnounceNN(interval.low, interval.high, announce);\n }\n }\n return numAnnounce > 0;\n }\n /\n Announce all \"outside intervals\" -- not masked by intervals.\n * * Return true if any intervals announced.\n /\n protected announcePartsNNC(\n keepInside: boolean, intervals: Range1d[], f0: number, f1: number, cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n ): boolean {\n let numAnnounce = 0;\n if (!keepInside) {\n let lowFraction = f0;\n for (const interval of intervals) {\n numAnnounce += this.testedAnnounceNNC(lowFraction, interval.low, cp, announce);\n lowFraction = interval.high;\n }\n numAnnounce += this.testedAnnounceNNC(lowFraction, f1, cp, announce);\n } else {\n for (const interval of intervals) {\n // use f0..f1 ?\n numAnnounce += this.testedAnnounceNNC(interval.low, interval.high, cp, announce);\n }\n }\n return numAnnounce > 0;\n }\n /* Invoke callback to test if a point is \"in\" this clipper. /\n public isPointOnOrInside(point: Point3d): boolean {\n const q = this.isPointOnOrInsideChildren(point);\n return this._keepInside ? q : !q;\n }\n /* Method from [[Clipper]] interface. /\n public announceClippedSegmentIntervals(\n f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\n ): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n // Strategy:\n // _intervalsA is the accumulated UNION of from clippers\n // _intervalsB is the current clipper.\n // announceIntervalB appends single new interval to _intervalB\n // at end, output gaps in _intervalsA\n //\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedSegmentIntervals(f0, f1, pointA, pointB, announceIntervalB);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNN(this._keepInside, this._intervalsA, f0, f1, announce);\n }\n /* Method from [[Clipper]] interface. /\n public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedArcIntervals(arc, announceIntervalB);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNNC(this._keepInside, this._intervalsA, 0, 1, arc, announce);\n }\n / Method from [[Clipper]] interface. /\n public announceClippedCurveIntervals(curve: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number, _cp: CurvePrimitive) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedCurveIntervals?.(curve, announceIntervalB) ?? assert(false, () => `Expect ${c.constructor.name} to implement announceClippedCurveIntervals`);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNNC(this._keepInside, this._intervalsA, 0, 1, curve, announce);\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.\n * @internal\n /\nexport class BooleanClipNodeUnion extends BooleanClipNode {\n public get operationName(): string {\n return this._keepInside ? \"OR\" : \"NOR\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return true if inside any child clipper. /\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n for (const clipper of this._clippers) {\n if (clipper.isPointOnOrInside(point))\n return true;\n }\n return false;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.unionSorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n ClipUtilities.doPolygonClipSequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n undefined,\n ClipStepAction.acceptIn,\n ClipStepAction.passToNextStep,\n ClipStepAction.acceptOut,\n arrayCache,\n );\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.\n * @internal\n /\nexport class BooleanClipNodeParity extends BooleanClipNode {\n public get operationName(): string {\n return this._keepInside ? \"XOR\" : \"NXOR\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return true if inside an odd number of clippers child clipper. /\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n let q = false;\n for (const clipper of this._clippers) {\n if (clipper.isPointOnOrInside(point))\n q = !q;\n }\n return q;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.paritySorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n ClipUtilities.doPolygonClipParitySequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n arrayCache,\n );\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.\n * @internal\n /\nexport class BooleanClipNodeIntersection extends BooleanClipNode implements PolygonClipper {\n public get operationName(): string {\n return this._keepInside ? \"AND\" : \"NAND\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return false if outside of any child clipper */\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n for (const clipper of this._clippers) {\n if (!clipper.isPointOnOrInside(point))\n return false;\n }\n return true;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.intersectSorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n\n ClipUtilities.doPolygonClipSequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n undefined,\n ClipStepAction.passToNextStep,\n ClipStepAction.acceptOut,\n ClipStepAction.acceptIn,\n arrayCache,\n );\n }\n}\n"]}
1	+ {"version":3,"file":"BooleanClipNode.js","sourceRoot":"","sources":["../../../src/clipping/BooleanClipNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAM7C,+CAA8C;AAE9C,2DAAwD;AACxD,2CAAqF;AAErF;;;;;;;;;;;;;;;;GAgBG;AACH,MAAsB,eAAe;IACzB,SAAS,CAAY;IACrB,WAAW,CAAY;IACvB,WAAW,CAAY;IACvB,WAAW,CAAU;IAC/B,YAAmB,UAAmB;QACpC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IAIM,MAAM;QACX,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAQ,CAAC;YACpB,IAAI,EAAE,CAAC,MAAM;gBACX,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3B,CAAC;QACD,gCAAgC;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;QAC7B,MAAM,IAAI,GAAgC,EAAE,CAAC;QAC7C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qDAAqD;IAC9C,YAAY,CAAC,KAA0B;QAC5C,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,KAAK;gBAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD,iEAAiE;IAC1D,YAAY;QACjB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC;IACD,qCAAqC;IAC9B,YAAY,CAAC,UAAmB;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACO,gBAAgB,CAAC,EAAU,EAAE,EAAU,EAAE,QAA+B;QAChF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACO,iBAAiB,CACzB,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,QAA6C;QAEzF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;YACZ,IAAI,QAAQ;gBACV,QAAQ,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD,gDAAgD;IACtC,MAAM;QACd,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,CAAC;IACD;;;OAGG;IACO,eAAe,CACvB,UAAmB,EAAE,SAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,QAA+B;QAElG,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;gBAC1E,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC9B,CAAC;YACD,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,WAAW,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;QAClE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,eAAe;gBACf,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC9E,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD;;;OAGG;IACO,gBAAgB,CACxB,UAAmB,EAAE,SAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,EAAkB,EAAE,QAA6C;QAEpI,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,IAAI,WAAW,GAAG,EAAE,CAAC;YACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,QAAQ,CAAC,GAAG,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC/E,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC9B,CAAC;YACD,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,eAAe;gBACf,WAAW,IAAI,IAAI,CAAC,iBAAiB,CAAC,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACnF,CAAC;QACH,CAAC;QACD,OAAO,WAAW,GAAG,CAAC,CAAC;IACzB,CAAC;IACD,+DAA+D;IACxD,iBAAiB,CAAC,KAAc;QACrC,MAAM,CAAC,GAAG,IAAI,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IACD,yCAAyC;IAClC,+BAA+B,CACpC,EAAU,EAAE,EAAU,EAAE,MAAe,EAAE,MAAe,EAAE,QAA+B;QAEzF,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;YACnD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,YAAY;QACZ,yDAAyD;QACzD,sCAAsC;QACtC,8DAA8D;QAC9D,qCAAqC;QACrC,EAAE;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,+BAA+B,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAC;YAC7E,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;IACpF,CAAC;IACD,yCAAyC;IAClC,2BAA2B,CAAC,GAAU,EAAE,QAA6C;QAC1F,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAE;YACnD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,2BAA2B,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC;YACtD,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IACxF,CAAC;IACD,wCAAwC;IACjC,6BAA6B,CAAC,KAAqB,EAAE,QAA6C;QACvG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,MAAM,iBAAiB,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,GAAmB,EAAE,EAAE;YACxE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,eAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QACF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;YAC5B,CAAC,CAAC,6BAA6B,EAAE,CAAC,KAAK,EAAE,iBAAiB,CAAC,IAAI,IAAA,qBAAM,EAAC,KAAK,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,WAAW,CAAC,IAAI,6CAA6C,CAAC,CAAC;YAC9J,2BAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC/E,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC1F,CAAC;CACF;AApMD,0CAoMC;AAED;;;GAGG;AACH,MAAa,oBAAqB,SAAQ,eAAe;IACvD,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IACzC,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,yBAAyB,CAAC,KAAc;QAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,yBAAa,CAAC,qBAAqB,CACjC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,SAAS,EACT,0BAAc,CAAC,QAAQ,EACvB,0BAAc,CAAC,cAAc,EAC7B,0BAAc,CAAC,SAAS,EACxB,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AApCD,oDAoCC;AAED;;;GAGG;AACH,MAAa,qBAAsB,SAAQ,eAAe;IACxD,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,qEAAqE;IAC9D,yBAAyB,CAAC,KAAc;QAC7C,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBAClC,CAAC,GAAG,CAAC,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAEjC,yBAAa,CAAC,2BAA2B,CACvC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AAjCD,sDAiCC;AAED;;;GAGG;AACH,MAAa,2BAA4B,SAAQ,eAAe;IAC9D,IAAW,aAAa;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;IAC3C,CAAC;IACD,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,yBAAyB,CAAC,KAAc;QAC7C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,KAAK,CAAC;gBACnC,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACM,gBAAgB,CAAC,QAAmB,EAAE,QAAmB;QAC9D,OAAO,2BAAY,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACM,iBAAiB,CACtB,GAAyB,EACzB,eAAmC,EACnC,gBAAoC,EACpC,UAAiC;QAGjC,yBAAa,CAAC,qBAAqB,CACjC,GAAG,EACH,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,gBAAgB,EACrD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,eAAe,EACrD,SAAS,EACT,0BAAc,CAAC,cAAc,EAC7B,0BAAc,CAAC,SAAS,EACxB,0BAAc,CAAC,QAAQ,EACvB,UAAU,CACX,CAAC;IACJ,CAAC;CACF;AArCD,kEAqCC","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 { assert } from \"@itwin/core-bentley\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { AnnounceNumberNumber, AnnounceNumberNumberCurvePrimitive, CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d } from \"../geometry3d/Range\";\nimport { GrowableXYZArrayCache } from \"../geometry3d/ReusableObjectCache\";\nimport { Range1dArray } from \"../numerics/Range1dArray\";\nimport { Clipper, ClipStepAction, ClipUtilities, PolygonClipper } from \"./ClipUtils\";\n\n/\n BooleanClipNode is an abstract base class for boolean actions by an array of clippers.\n * * Derived class must implement:\n * * The single point test `isPointOnOrInsideChildren`\n * * Boolean operation on 1d intervals `combineIntervals`\n * * The `keepInside` flag controls an additional optional flip of the boolean result:\n * * if `keepInside === true`, accept the \"inside\" of the child clippers.\n * * if `keepInside === false`, accept the \"outside\" of the child clippers.\n * * Hence the combinations of derived classes for (OR, AND, XOR) and keepInside are:\n * * (OR, true) = simple union (OR), i.e., \"in\" one or more clips.\n * * (OR, false) = complement of union (NOR), i.e., \"outside\" all clips.\n * * (AND, true) = simple intersection (AND), i.e., \"in\" all clips.\n * * (AND, false) = complement of intersection (NAND), i.e., \"outside\" one or more clips.\n * * (XOR, true) = simple parity, i.e., \"in\" an odd number of clips.\n * * (XOR, false) = complement of parity, i.e., \"in\" an even number of clips.\n * @internal\n /\nexport abstract class BooleanClipNode implements Clipper {\n protected _clippers: Clipper[];\n protected _intervalsA: Range1d[];\n protected _intervalsB: Range1d[];\n protected _keepInside: boolean;\n public constructor(keepInside: boolean) {\n this._keepInside = keepInside;\n this._clippers = [];\n this._intervalsA = [];\n this._intervalsB = [];\n }\n protected abstract isPointOnOrInsideChildren(point: Point3d): boolean;\n protected abstract combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[];\n public abstract get operationName(): string;\n public toJSON(): any {\n const data = [];\n for (const c of this._clippers) {\n const c1 = c as any;\n if (c1.toJSON)\n data.push(c1.toJSON());\n }\n // return this.formatJSON(data);\n const s = this.operationName;\n const json: { [opType: string]: any[] } = {};\n json[s] = data;\n return json;\n }\n /* Capture a (reference to a) child node or nodes /\n public captureChild(child: Clipper \| Clipper[]) {\n if (Array.isArray(child)) {\n for (const c of child) this.captureChild(c);\n } else {\n this._clippers.push(child);\n }\n }\n /* Toggle the \"keepInside\" behavior. Return the prior value. /\n public toggleResult(): boolean {\n return this.selectResult(!this._keepInside);\n }\n /* Set the \"keepInside\" behavior. /\n public selectResult(keepInside: boolean): boolean {\n const s = this._keepInside;\n this._keepInside = keepInside;\n return s;\n }\n /\n Conditionally (if a1 > a0 strictly) call `announce(a0, a1)`.\n * * Return 0 if not called, 1 if called.\n /\n protected testedAnnounceNN(a0: number, a1: number, announce?: AnnounceNumberNumber): number {\n if (a0 < a1) {\n if (announce)\n announce(a0, a1);\n return 1;\n }\n return 0;\n }\n /\n Conditionally (if a1 > a0 strictly) call `announce(a0, a1, cp)`.\n * * Return 0 if not called, 1 if called.\n /\n protected testedAnnounceNNC(\n a0: number, a1: number, cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n ): number {\n if (a0 < a1) {\n if (announce)\n announce(a0, a1, cp);\n return 1;\n }\n return 0;\n }\n /* Swap the `_intervalsA` and `_intervalsB`. /\n protected swapAB(): void {\n const q = this._intervalsA;\n this._intervalsA = this._intervalsB;\n this._intervalsB = q;\n }\n /\n Announce all \"outside intervals\" -- not masked by intervals.\n * * Return true if any intervals announced.\n /\n protected announcePartsNN(\n keepInside: boolean, intervals: Range1d[], f0: number, f1: number, announce?: AnnounceNumberNumber,\n ): boolean {\n let numAnnounce = 0;\n if (!keepInside) {\n let lowFraction = f0;\n for (const interval of intervals) {\n numAnnounce += this.testedAnnounceNN(lowFraction, interval.low, announce);\n lowFraction = interval.high;\n }\n numAnnounce += this.testedAnnounceNN(lowFraction, f1, announce);\n } else {\n for (const interval of intervals) {\n // use f0..f1 ?\n numAnnounce += this.testedAnnounceNN(interval.low, interval.high, announce);\n }\n }\n return numAnnounce > 0;\n }\n /\n Announce all \"outside intervals\" -- not masked by intervals.\n * * Return true if any intervals announced.\n /\n protected announcePartsNNC(\n keepInside: boolean, intervals: Range1d[], f0: number, f1: number, cp: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive,\n ): boolean {\n let numAnnounce = 0;\n if (!keepInside) {\n let lowFraction = f0;\n for (const interval of intervals) {\n numAnnounce += this.testedAnnounceNNC(lowFraction, interval.low, cp, announce);\n lowFraction = interval.high;\n }\n numAnnounce += this.testedAnnounceNNC(lowFraction, f1, cp, announce);\n } else {\n for (const interval of intervals) {\n // use f0..f1 ?\n numAnnounce += this.testedAnnounceNNC(interval.low, interval.high, cp, announce);\n }\n }\n return numAnnounce > 0;\n }\n /* Invoke callback to test if a point is \"in\" this clipper. /\n public isPointOnOrInside(point: Point3d): boolean {\n const q = this.isPointOnOrInsideChildren(point);\n return this._keepInside ? q : !q;\n }\n /* Method from [[Clipper]] interface. /\n public announceClippedSegmentIntervals(\n f0: number, f1: number, pointA: Point3d, pointB: Point3d, announce?: AnnounceNumberNumber,\n ): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n // Strategy:\n // _intervalsA is the accumulated UNION of from clippers\n // _intervalsB is the current clipper.\n // announceIntervalB appends single new interval to _intervalB\n // at end, output gaps in _intervalsA\n //\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedSegmentIntervals(f0, f1, pointA, pointB, announceIntervalB);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNN(this._keepInside, this._intervalsA, f0, f1, announce);\n }\n /* Method from [[Clipper]] interface. /\n public announceClippedArcIntervals(arc: Arc3d, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedArcIntervals(arc, announceIntervalB);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNNC(this._keepInside, this._intervalsA, 0, 1, arc, announce);\n }\n / Method from [[Clipper]] interface. /\n public announceClippedCurveIntervals(curve: CurvePrimitive, announce?: AnnounceNumberNumberCurvePrimitive): boolean {\n this._intervalsA.length = 0;\n const announceIntervalB = (a0: number, a1: number, _cp: CurvePrimitive) => {\n this._intervalsB.push(Range1d.createXX(a0, a1));\n };\n let i = 0;\n for (const c of this._clippers) {\n this._intervalsB.length = 0;\n c.announceClippedCurveIntervals?.(curve, announceIntervalB) ?? assert(false, () => `Expect ${c.constructor.name} to implement announceClippedCurveIntervals`);\n Range1dArray.simplifySortUnion(this._intervalsB);\n if (i === 0) {\n this.swapAB();\n } else {\n this._intervalsA = this.combineIntervals(this._intervalsA, this._intervalsB);\n }\n i++;\n }\n return this.announcePartsNNC(this._keepInside, this._intervalsA, 0, 1, curve, announce);\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for union (boolean OR) among children.\n * @internal\n /\nexport class BooleanClipNodeUnion extends BooleanClipNode {\n public get operationName(): string {\n return this._keepInside ? \"OR\" : \"NOR\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return true if inside any child clipper. /\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n for (const clipper of this._clippers) {\n if (clipper.isPointOnOrInside(point))\n return true;\n }\n return false;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.unionSorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n ClipUtilities.doPolygonClipSequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n undefined,\n ClipStepAction.acceptIn,\n ClipStepAction.passToNextStep,\n ClipStepAction.acceptOut,\n arrayCache,\n );\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for parity (boolean XOR) among children.\n * @internal\n /\nexport class BooleanClipNodeParity extends BooleanClipNode {\n public get operationName(): string {\n return this._keepInside ? \"XOR\" : \"NXOR\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return true if inside an odd number of clippers child clipper. /\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n let q = false;\n for (const clipper of this._clippers) {\n if (clipper.isPointOnOrInside(point))\n q = !q;\n }\n return q;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.paritySorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n ClipUtilities.doPolygonClipParitySequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n arrayCache,\n );\n }\n}\n\n/\n Implement [BooleanClipNode] virtual methods for intersection (boolean OR) among children.\n * @internal\n /\nexport class BooleanClipNodeIntersection extends BooleanClipNode implements PolygonClipper {\n public get operationName(): string {\n return this._keepInside ? \"AND\" : \"NAND\";\n }\n public constructor(keepInside: boolean) {\n super(keepInside);\n }\n /* Return false if outside of any child clipper */\n public isPointOnOrInsideChildren(point: Point3d): boolean {\n for (const clipper of this._clippers) {\n if (!clipper.isPointOnOrInside(point))\n return false;\n }\n return true;\n }\n public combineIntervals(operandA: Range1d[], operandB: Range1d[]): Range1d[] {\n return Range1dArray.intersectSorted(operandA, operandB);\n }\n public appendPolygonClip(\n xyz: IndexedXYZCollection,\n insideFragments: GrowableXYZArray[],\n outsideFragments: GrowableXYZArray[],\n arrayCache: GrowableXYZArrayCache,\n ) {\n\n ClipUtilities.doPolygonClipSequence(\n xyz,\n this._clippers,\n this._keepInside ? insideFragments : outsideFragments,\n this._keepInside ? outsideFragments : insideFragments,\n undefined,\n ClipStepAction.passToNextStep,\n ClipStepAction.acceptOut,\n ClipStepAction.acceptIn,\n arrayCache,\n );\n }\n}\n"]}

package/lib/cjs/clipping/ClipPlane.d.ts CHANGED Viewed

@@ -110,9 +110,15 @@ export declare class ClipPlane extends Plane3d implements Clipper, PolygonClippe
     get distance(): number;
     /** * Return the stored inward normal property. */
     get inwardNormalRef(): Vector3d;
-    /**  Return the "interior" property flag. Interpretation of this flag is algorithm-specific. */
+    /**
+     * Return the "interior" property flag. Interpretation of this flag is algorithm-specific.
+     * * One way this flag is used is to indicate a plane that has been added to partition the exterior region of a masked ClipShape.
+     */
     get interior(): boolean;
-    /**  Return the "invisible" property flag. Interpretation of this flag is algorithm-specific. */
+    /**
+     * Return the "invisible" property flag. Interpretation of this flag is algorithm-specific.
+     * * One way this flag is used is to indicate a plane that should not be used to compute intersection edges.
+     */
     get invisible(): boolean;
     /**
      * Create a plane defined by two points, an up vector, and a tilt angle relative to the up vector.

package/lib/cjs/clipping/ClipPlane.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"ClipPlane.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAEvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEnH,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,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;AAElE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAErE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,iCAAiC;IACjC,MAAM,CAAC,EAAE,QAAQ,CAAC;IAClB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8EAA8E;IAC9E,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,SAAU,SAAQ,OAAQ,YAAW,OAAO,EAAE,cAAc;IACvE,OAAO,CAAC,aAAa,CAAW;IAChC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAU;IAE3B,OAAO;IAaP;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;IAM/C,4BAA4B;IACrB,KAAK,IAAI,SAAS;IAIzB,0DAA0D;IACnD,YAAY,IAAI,SAAS;IAKhC,4DAA4D;WAC9C,WAAW,CACvB,KAAK,EAAE,4BAA4B,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC7G,SAAS;IAWZ;;;OAGG;WACW,uBAAuB,CACnC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC5G,SAAS,GAAG,SAAS;IAaxB;;;;;;OAMG;WACW,oBAAoB,CAChC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GACzG,SAAS,GAAG,SAAS;IAcxB;;;;;;;;OAQG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,SAAS,GAAE,OAAe,EAC1B,QAAQ,GAAE,OAAe,EACzB,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAIxB;;;;;;OAMG;WACW,0BAA0B,CACtC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EACrD,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAgBxB;;;OAGG;IACI,MAAM,IAAI,cAAc;IAW/B,8CAA8C;WAChC,QAAQ,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAOvF,iDAAiD;IAC1C,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IAIrD,qDAAqD;IACrD,IAAW,QAAQ,WAElB;IACD,kDAAkD;IAClD,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD~~,+FAA+F~~;~~IAC/F~~,IAAW,QAAQ,YAElB;IACD~~,gGAAgG~~;~~IAChG~~,IAAW,SAAS,YAEnB;IACD;;;;;;;OAOG;WACW,qBAAqB,CACjC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1F,SAAS,GAAG,SAAS;IAgBxB,0FAA0F;WAC5E,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAMrG;;;;OAIG;WACW,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAO7G;;;;OAIG;IACI,UAAU,IAAI,4BAA4B;IAQjD;;;;OAIG;IACI,UAAU,IAAI,OAAO;IAK5B;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,OAAO;IAQhC;;;;OAIG;IACI,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAM/C;;;OAGG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;OAIG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM3D,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,6GAA6G;IACtG,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM;IAGzC;;;OAGG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAGzD;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAKxG;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAK/F;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAG3F;;;;OAIG;IACI,yBAAyB,CAAC,GAAG,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB,GAAG,IAAI;IAS7F,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAA8B;IAC/D,yCAAyC;IAClC,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAOtG,yCAAyC;IAClC,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IASnH;;;;;OAKG;IACI,mCAAmC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAUhG,qGAAqG;IAC9F,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAkBtD,iFAAiF;IAC1E,YAAY,CAAC,SAAS,EAAE,OAAO;IAGtC,0EAA0E;IACnE,aAAa;IAIpB;;;OAGG;IACI,cAAc,CAAC,MAAM,EAAE,MAAM;IAGpC;;;;;;;;;;;;;OAaG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EACrB,IAAI,CAAC,EAAE,gBAAgB,EACvB,MAAM,GAAE,OAAc,EACtB,SAAS,GAAE,MAAqC,GAC/C,MAAM;IAGT;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAe5G,yCAAyC;IAClC,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO;IAuBV;;;;;OAKG;IACI,QAAQ,IAAI,SAAS;IAM5B;;;;OAIG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,eAAe,GAAE,OAAe,GAAG,gBAAgB,GAAG,SAAS;IAuBrG;;;;;;;;;OASG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAUP,6CAA6C;IACtC,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG1E,uDAAuD;IACvC,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAI9F"}
1	+ {"version":3,"file":"ClipPlane.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAEvC,OAAO,EAAE,oBAAoB,EAAE,kCAAkC,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAEnH,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,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;AAElE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAErE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,iCAAiC;IACjC,MAAM,CAAC,EAAE,QAAQ,CAAC;IAClB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8EAA8E;IAC9E,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,SAAU,SAAQ,OAAQ,YAAW,OAAO,EAAE,cAAc;IACvE,OAAO,CAAC,aAAa,CAAW;IAChC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAU;IAE3B,OAAO;IAaP;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;IAM/C,4BAA4B;IACrB,KAAK,IAAI,SAAS;IAIzB,0DAA0D;IACnD,YAAY,IAAI,SAAS;IAKhC,4DAA4D;WAC9C,WAAW,CACvB,KAAK,EAAE,4BAA4B,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC7G,SAAS;IAWZ;;;OAGG;WACW,uBAAuB,CACnC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC5G,SAAS,GAAG,SAAS;IAaxB;;;;;;OAMG;WACW,oBAAoB,CAChC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GACzG,SAAS,GAAG,SAAS;IAcxB;;;;;;;;OAQG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,SAAS,GAAE,OAAe,EAC1B,QAAQ,GAAE,OAAe,EACzB,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAIxB;;;;;;OAMG;WACW,0BAA0B,CACtC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EACrD,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAgBxB;;;OAGG;IACI,MAAM,IAAI,cAAc;IAW/B,8CAA8C;WAChC,QAAQ,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAOvF,iDAAiD;IAC1C,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IAIrD,qDAAqD;IACrD,IAAW,QAAQ,WAElB;IACD,kDAAkD;IAClD,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD;;;OAGG;IACH,IAAW,QAAQ,YAElB;IACD;;;OAGG;IACH,IAAW,SAAS,YAEnB;IACD;;;;;;;OAOG;WACW,qBAAqB,CACjC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1F,SAAS,GAAG,SAAS;IAgBxB,0FAA0F;WAC5E,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAMrG;;;;OAIG;WACW,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAO7G;;;;OAIG;IACI,UAAU,IAAI,4BAA4B;IAQjD;;;;OAIG;IACI,UAAU,IAAI,OAAO;IAK5B;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,OAAO;IAQhC;;;;OAIG;IACI,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAM/C;;;OAGG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;OAIG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM3D,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,6GAA6G;IACtG,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM;IAGzC;;;OAGG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAGzD;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAKxG;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAK/F;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAG3F;;;;OAIG;IACI,yBAAyB,CAAC,GAAG,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB,GAAG,IAAI;IAS7F,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAA8B;IAC/D,yCAAyC;IAClC,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAOtG,yCAAyC;IAClC,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IASnH;;;;;OAKG;IACI,mCAAmC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAUhG,qGAAqG;IAC9F,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAkBtD,iFAAiF;IAC1E,YAAY,CAAC,SAAS,EAAE,OAAO;IAGtC,0EAA0E;IACnE,aAAa;IAIpB;;;OAGG;IACI,cAAc,CAAC,MAAM,EAAE,MAAM;IAGpC;;;;;;;;;;;;;OAaG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EACrB,IAAI,CAAC,EAAE,gBAAgB,EACvB,MAAM,GAAE,OAAc,EACtB,SAAS,GAAE,MAAqC,GAC/C,MAAM;IAGT;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAe5G,yCAAyC;IAClC,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,oBAAoB,GACxF,OAAO;IAuBV;;;;;OAKG;IACI,QAAQ,IAAI,SAAS;IAM5B;;;;OAIG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,eAAe,GAAE,OAAe,GAAG,gBAAgB,GAAG,SAAS;IAuBrG;;;;;;;;;OASG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAUP,6CAA6C;IACtC,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG1E,uDAAuD;IACvC,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAI9F"}

package/lib/cjs/clipping/ClipPlane.js CHANGED Viewed

@@ -201,11 +201,17 @@ class ClipPlane extends Plane3d_1.Plane3d {
     get inwardNormalRef() {
         return this._inwardNormal;
     }
-    /**  Return the "interior" property flag. Interpretation of this flag is algorithm-specific. */
+    /**
+     * Return the "interior" property flag. Interpretation of this flag is algorithm-specific.
+     * * One way this flag is used is to indicate a plane that has been added to partition the exterior region of a masked ClipShape.
+     */
     get interior() {
         return this._interior;
     }
-    /**  Return the "invisible" property flag. Interpretation of this flag is algorithm-specific. */
+    /**
+     * Return the "invisible" property flag. Interpretation of this flag is algorithm-specific.
+     * * One way this flag is used is to indicate a plane that should not be used to compute intersection edges.
+     */
     get invisible() {
         return this._invisible;
     }