@itwin/core-geometry 5.0.0-dev.8 → 5.0.0-dev.82

package/lib/cjs/bspline/SurfaceLocationDetail.js

@@ -10,6 +10,14 @@ const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
  * @public
  */
 class UVSurfaceLocationDetail {
+    /** The surface being evaluated */
+    surface;
+    /** uv coordinates in the surface */
+    uv;
+    /** The point on the surface */
+    point;
+    /** A context-specific numeric value.  (E.g. a distance) */
+    a;
     /** Construct with empty data. */
     constructor(surface, uv, point) {
         this.surface = surface;
@@ -50,6 +58,10 @@ exports.UVSurfaceLocationDetail = UVSurfaceLocationDetail;
  * @public
  */
 class CurveAndSurfaceLocationDetail {
+    /** detailed location on the curve */
+    curveDetail;
+    /** detailed location on the surface */
+    surfaceDetail;
     /** CAPTURE both details . . */
     constructor(curveDetail, surfaceDetail) {
         this.curveDetail = curveDetail;

package/lib/cjs/bspline/SurfaceLocationDetail.js.map

@@ -1 +1 @@
-{"version":3,"file":"SurfaceLocationDetail.js","sourceRoot":"","sources":["../../../src/bspline/SurfaceLocationDetail.ts"],"names":[],"mappings":";;;AASA,mEAAwD;AACxD,mEAAwD;AAExD;;;;;GAKG;AACH,MAAa,uBAAuB;IASlC,iCAAiC;IACjC,YAAmB,OAAmB,EAAE,EAAY,EAAE,KAAe;QACnE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QAClD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA8B,EAAE,EAAW,EAAE,KAAc;QAC5F,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,EAAE;YACJ,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,OAA8B,EAAE,CAAS,EAAE,CAAS,EAAE,KAAc;QAC5G,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;CAEF;AA3CD,0DA2CC;AACD;;;GAGG;AACH,MAAa,6BAA6B;IAKxC,+BAA+B;IAC/B,YAAmB,WAAgC,EAAE,aAAsC;QACzF,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;CACF;AAVD,sEAUC","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 Curve\n */\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\nimport { UVSurface } from \"../geometry3d/GeometryHandler\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\n\n/**\n * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.\n * * These are returned by a variety of queries.\n * * Particular contents can vary among the queries.\n * @public\n */\nexport class UVSurfaceLocationDetail {\n  /** The surface being evaluated */\n  public surface?: UVSurface;\n  /** uv coordinates in the surface */\n  public uv: Point2d;\n  /** The point on the surface */\n  public point: Point3d;\n  /** A context-specific numeric value.  (E.g. a distance) */\n  public a: number;\n  /** Construct with empty data. */\n  public constructor(surface?: UVSurface, uv?: Point2d, point?: Point3d) {\n    this.surface = surface;\n    this.point = point ? point : Point3d.createZero();\n    this.uv = uv ? uv : Point2d.createZero();\n    this.a = 0.0;\n  }\n  /**\n   * Create a new detail structure.\n   * @param surface\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\n   * @param point coordinates to copy (not capture) into the `detail.point`\n   */\n  public static createSurfaceUVPoint(surface: UVSurface | undefined, uv: Point2d, point: Point3d): UVSurfaceLocationDetail {\n    const detail = new UVSurfaceLocationDetail(surface);\n    if (uv)\n      detail.uv.setFrom(uv);\n    detail.point.setFromPoint3d(point);\n    return detail;\n  }\n  /**\n   * Create a new detail structure.\n   * @param surface\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\n   * @param point coordinates to copy (not capture) into the `detail.point`\n   */\n  public static createSurfaceUVNumbersPoint(surface: UVSurface | undefined, u: number, v: number, point: Point3d): UVSurfaceLocationDetail {\n    const detail = new UVSurfaceLocationDetail(surface);\n    detail.uv.x = u;\n    detail.uv.y = v;\n    detail.point.setFromPoint3d(point);\n    return detail;\n  }\n\n}\n/**\n * Carrier for both curve and surface data, e.g. from intersection calculations.\n * @public\n */\nexport class CurveAndSurfaceLocationDetail {\n  /** detailed location on the curve */\n  public curveDetail: CurveLocationDetail;\n  /** detailed location on the surface */\n  public surfaceDetail: UVSurfaceLocationDetail;\n  /** CAPTURE both details . . */\n  public constructor(curveDetail: CurveLocationDetail, surfaceDetail: UVSurfaceLocationDetail) {\n    this.curveDetail = curveDetail;\n    this.surfaceDetail = surfaceDetail;\n  }\n}\n"]}
+{"version":3,"file":"SurfaceLocationDetail.js","sourceRoot":"","sources":["../../../src/bspline/SurfaceLocationDetail.ts"],"names":[],"mappings":";;;AASA,mEAAwD;AACxD,mEAAwD;AAExD;;;;;GAKG;AACH,MAAa,uBAAuB;IAClC,kCAAkC;IAC3B,OAAO,CAAa;IAC3B,oCAAoC;IAC7B,EAAE,CAAU;IACnB,+BAA+B;IACxB,KAAK,CAAU;IACtB,2DAA2D;IACpD,CAAC,CAAS;IACjB,iCAAiC;IACjC,YAAmB,OAAmB,EAAE,EAAY,EAAE,KAAe;QACnE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QAClD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,yBAAO,CAAC,UAAU,EAAE,CAAC;QACzC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA8B,EAAE,EAAW,EAAE,KAAc;QAC5F,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,IAAI,EAAE;YACJ,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,OAA8B,EAAE,CAAS,EAAE,CAAS,EAAE,KAAc;QAC5G,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;CAEF;AA3CD,0DA2CC;AACD;;;GAGG;AACH,MAAa,6BAA6B;IACxC,qCAAqC;IAC9B,WAAW,CAAsB;IACxC,uCAAuC;IAChC,aAAa,CAA0B;IAC9C,+BAA+B;IAC/B,YAAmB,WAAgC,EAAE,aAAsC;QACzF,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;CACF;AAVD,sEAUC","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 Curve\n */\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\nimport { UVSurface } from \"../geometry3d/GeometryHandler\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\n\n/**\n * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.\n * * These are returned by a variety of queries.\n * * Particular contents can vary among the queries.\n * @public\n */\nexport class UVSurfaceLocationDetail {\n  /** The surface being evaluated */\n  public surface?: UVSurface;\n  /** uv coordinates in the surface */\n  public uv: Point2d;\n  /** The point on the surface */\n  public point: Point3d;\n  /** A context-specific numeric value.  (E.g. a distance) */\n  public a: number;\n  /** Construct with empty data. */\n  public constructor(surface?: UVSurface, uv?: Point2d, point?: Point3d) {\n    this.surface = surface;\n    this.point = point ? point : Point3d.createZero();\n    this.uv = uv ? uv : Point2d.createZero();\n    this.a = 0.0;\n  }\n  /**\n   * Create a new detail structure.\n   * @param surface\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\n   * @param point coordinates to copy (not capture) into the `detail.point`\n   */\n  public static createSurfaceUVPoint(surface: UVSurface | undefined, uv: Point2d, point: Point3d): UVSurfaceLocationDetail {\n    const detail = new UVSurfaceLocationDetail(surface);\n    if (uv)\n      detail.uv.setFrom(uv);\n    detail.point.setFromPoint3d(point);\n    return detail;\n  }\n  /**\n   * Create a new detail structure.\n   * @param surface\n   * @param uv coordinates to copy (not capture) into the `detail.uv`\n   * @param point coordinates to copy (not capture) into the `detail.point`\n   */\n  public static createSurfaceUVNumbersPoint(surface: UVSurface | undefined, u: number, v: number, point: Point3d): UVSurfaceLocationDetail {\n    const detail = new UVSurfaceLocationDetail(surface);\n    detail.uv.x = u;\n    detail.uv.y = v;\n    detail.point.setFromPoint3d(point);\n    return detail;\n  }\n\n}\n/**\n * Carrier for both curve and surface data, e.g. from intersection calculations.\n * @public\n */\nexport class CurveAndSurfaceLocationDetail {\n  /** detailed location on the curve */\n  public curveDetail: CurveLocationDetail;\n  /** detailed location on the surface */\n  public surfaceDetail: UVSurfaceLocationDetail;\n  /** CAPTURE both details . . */\n  public constructor(curveDetail: CurveLocationDetail, surfaceDetail: UVSurfaceLocationDetail) {\n    this.curveDetail = curveDetail;\n    this.surfaceDetail = surfaceDetail;\n  }\n}\n"]}

package/lib/cjs/clipping/AlternatingConvexClipTree.js

@@ -45,13 +45,12 @@ const ConvexClipPlaneSet_1 = require("./ConvexClipPlaneSet");
  *   </ul>
  */
 class AlternatingCCTreeNode {
-    constructor() {
-        this.points = [];
-        this.planes = ConvexClipPlaneSet_1.ConvexClipPlaneSet.createEmpty();
-        this.children = [];
-        this.startIdx = -1; // Start index into the master array (not the local points array)
-        this.numPoints = -1; // Number of points used in the master array
-    }
+    points = [];
+    planes = ConvexClipPlaneSet_1.ConvexClipPlaneSet.createEmpty();
+    children = [];
+    startIdx = -1; // Start index into the master array (not the local points array)
+    numPoints = -1; // Number of points used in the master array
+    constructor() { }
     /** Initialize this node with index data referencing the parent polygon. */
     static createWithIndices(index0, numPoints, result) {
         result = result ? result : new AlternatingCCTreeNode();
@@ -211,10 +210,9 @@ exports.AlternatingCCTreeNode = AlternatingCCTreeNode;
  *  </ul>
  */
 class AlternatingCCTreeBuilder {
-    constructor() {
-        this._points = [];
-        this._stack = [];
-    }
+    _points = [];
+    _stack = [];
+    constructor() { }
     static createPointsRef(points, result) {
         result = result ? result : new AlternatingCCTreeBuilder();
         result._points = points;
@@ -379,6 +377,9 @@ class AlternatingCCTreeBuilder {
 }
 exports.AlternatingCCTreeBuilder = AlternatingCCTreeBuilder;
 class AlternatingCCTreeNodeCurveClipper {
+    _curve;
+    _intervalStack;
+    _stackDepth;
     constructor() {
         this._stackDepth = 0;
         this._intervalStack = [];
@@ -417,6 +418,8 @@ class AlternatingCCTreeNodeCurveClipper {
     isTopOfStackEmpty() {
         return this._topOfStack.length === 0;
     }
+    // Is re-used by method calls
+    static _fractionIntervals = [];
     appendSingleClipToStack(planes, insideSegments) {
         const fractionIntervals = AlternatingCCTreeNodeCurveClipper._fractionIntervals;
         if (this._curve instanceof LineSegment3d_1.LineSegment3d) {
@@ -524,6 +527,4 @@ class AlternatingCCTreeNodeCurveClipper {
     }
 }
 exports.AlternatingCCTreeNodeCurveClipper = AlternatingCCTreeNodeCurveClipper;
-// Is re-used by method calls
-AlternatingCCTreeNodeCurveClipper._fractionIntervals = [];
 //# sourceMappingURL=AlternatingConvexClipTree.js.map

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

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

package/lib/cjs/clipping/BooleanClipNode.js

@@ -25,6 +25,10 @@ const ClipUtils_1 = require("./ClipUtils");
  * @internal
  */
 class BooleanClipNode {
+    _clippers;
+    _intervalsA;
+    _intervalsB;
+    _keepInside;
     constructor(keepInside) {
         this._keepInside = keepInside;
         this._clippers = [];

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

@@ -1 +1 @@
-{"version":3,"file":"BooleanClipNode.js","sourceRoot":"","sources":["../../../src/clipping/BooleanClipNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAW/F,+CAA8C;AAE9C,2DAAwD;AACxD,2CAAqF;AAErF;;;;;;;;;;;;;;;GAeG;AACH,MAAsB,eAAe;IAMnC,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,kEAAkE;IAC3D,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,2CAA2C;IACjC,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,8DAA8D;IACvD,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,8FAA8F;IACvF,+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,+FAA+F;IACxF,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;CACF;AAjLD,0CAiLC;AAED;;;GAGG;AACH,MAAa,oBAAqB,SAAQ,eAAe;IACvD,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9E,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,8CAA8C;IACvC,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;AAlCD,oDAkCC;AAED;;;GAGG;AACH,MAAa,qBAAsB,SAAQ,eAAe;IACxD,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,oEAAoE;IAC7D,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;AA/BD,sDA+BC;AAED;;;GAGG;AACH,MAAa,2BAA4B,SAAQ,eAAe;IAC9D,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,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;AAnCD,kEAmCC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { 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/** 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 clip 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\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  /** Announce \"in\" portions of a line segment. See `Clipper.announceClippedSegmentIntervals` */\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  /** Announce \"in\" portions of a line segment.  See `Clipper.announceClippedSegmentIntervals` */\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}\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 { return this._keepInside ? \"OR\" : \"NOR\"; }\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 { return this._keepInside ? \"XOR\" : \"NXOR\"; }\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 { return this._keepInside ? \"AND\" : \"NAND\"; }\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"]}
+{"version":3,"file":"BooleanClipNode.js","sourceRoot":"","sources":["../../../src/clipping/BooleanClipNode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAW/F,+CAA8C;AAE9C,2DAAwD;AACxD,2CAAqF;AAErF;;;;;;;;;;;;;;;GAeG;AACH,MAAsB,eAAe;IACzB,SAAS,CAAY;IACrB,WAAW,CAAY;IACvB,WAAW,CAAY;IACvB,WAAW,CAAU;IAE/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,kEAAkE;IAC3D,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,2CAA2C;IACjC,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,8DAA8D;IACvD,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,8FAA8F;IACvF,+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,+FAA+F;IACxF,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;CACF;AAjLD,0CAiLC;AAED;;;GAGG;AACH,MAAa,oBAAqB,SAAQ,eAAe;IACvD,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9E,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,8CAA8C;IACvC,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;AAlCD,oDAkCC;AAED;;;GAGG;AACH,MAAa,qBAAsB,SAAQ,eAAe;IACxD,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,YAAmB,UAAmB;QACpC,KAAK,CAAC,UAAU,CAAC,CAAC;IACpB,CAAC;IACD,oEAAoE;IAC7D,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;AA/BD,sDA+BC;AAED;;;GAGG;AACH,MAAa,2BAA4B,SAAQ,eAAe;IAC9D,IAAW,aAAa,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,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;AAnCD,kEAmCC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { 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/** 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 clip 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\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  /** Announce \"in\" portions of a line segment. See `Clipper.announceClippedSegmentIntervals` */\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  /** Announce \"in\" portions of a line segment.  See `Clipper.announceClippedSegmentIntervals` */\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}\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 { return this._keepInside ? \"OR\" : \"NOR\"; }\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 { return this._keepInside ? \"XOR\" : \"NXOR\"; }\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 { return this._keepInside ? \"AND\" : \"NAND\"; }\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.js

@@ -34,6 +34,15 @@ const ClipUtils_1 = require("./ClipUtils");
  * @public
  */
 class ClipPlane extends Plane3d_1.Plane3d {
+    _inwardNormal;
+    /**
+     * Construct a parallel plane through the origin.
+     * * Move it to the actual position.
+     * * _distanceFromOrigin is the distance it moved, with the (inward) normal direction as positive
+     */
+    _distanceFromOrigin;
+    _invisible;
+    _interior;
     constructor(normal, distance, invisible, interior) {
         super();
         this._invisible = invisible;
@@ -365,6 +374,7 @@ class ClipPlane extends Plane3d_1.Plane3d {
         const gamma = this.velocity(arcVectors.vector90);
         Polynomials_1.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, undefined, undefined, intersectionRadians);
     }
+    static _clipArcFractionArray = new GrowableFloat64Array_1.GrowableFloat64Array();
     /**
      * Announce fractional intervals of arc clip.
      * * Each call to `announce(fraction0, fraction1, arc)` announces one interval that is inside the clip plane.
@@ -559,5 +569,4 @@ class ClipPlane extends Plane3d_1.Plane3d {
     }
 }
 exports.ClipPlane = ClipPlane;
-ClipPlane._clipArcFractionArray = new GrowableFloat64Array_1.GrowableFloat64Array();
 //# sourceMappingURL=ClipPlane.js.map