@itwin/core-geometry 4.1.0-dev.70 → 4.1.0-dev.72

package/lib/esm/clipping/AlternatingConvexClipTree.d.ts

@@ -10,7 +10,7 @@ import { GrowableXYZArrayCache } from "../geometry3d/ReusableObjectCache";
 /**
  * An AlternatingConvexClipTreeNode is a node in a tree structure in which
  *   <ul>
- *   <li>Each node contains a ConvexClipPlaneSet
+ *   <li>Each node contains a ConvexClipPlaneSet.
  *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.
  *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if
  *   <ul>
@@ -43,27 +43,27 @@ export declare class AlternatingCCTreeNode implements PolygonClipper {
      * </ul>
      */
     static createTreeForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
-    /**
-     * Build the outer convex hull will inlets as first level children
-     */
+    /** Build the outer convex hull with inlets as first level children. */
     static createHullAndInletsForPolygon(points: Point3d[], result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
     private extractLoopsGo;
     /**
      * Return an array with all the loops in the tree.
-     * This looses the alternating structure of the tree, but the collection still matches well-formed polygons by parity rules.
+     * This loses the alternating structure of the tree, but the collection still matches well-formed polygons by
+     * parity rules.
      */
     extractLoops(): Point3d[][];
-    /** Resets this AlternatingConvexClipTreeNode to a newly-created state */
+    /** Resets this AlternatingConvexClipTreeNode to a newly-created state. */
     empty(): void;
     /** Creates a deep copy of this node (expensive - copies Geometry, and is recursive for children array). */
     clone(result?: AlternatingCCTreeNode): AlternatingCCTreeNode;
     /** Add a new child that has an empty plane set and given indices. */
     addEmptyChild(index0: number, numPoints: number): void;
-    /** Add a plane to the ConvexClipPlaneSet */
+    /** Add a plane to the ConvexClipPlaneSet. */
     addPlane(plane: ClipPlane): void;
     /** Search with alternating in and out semantics. */
     isPointOnOrInside(point: Point3d): boolean;
-    /** Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
+    /**
+     * Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
      * * The child pointer is pushed directly to the tree -- not cloned.
      */
     captureConvexClipPlaneSetAsVoid(child: AlternatingCCTreeNode): void;
@@ -72,16 +72,14 @@ export declare class AlternatingCCTreeNode implements PolygonClipper {
     /** Append start-end positions for curve intervals classified as inside or outside. */
     appendCurveCollectionClipIntervals(curves: CurveCollection, insideIntervals: CurveLocationDetailPair[], outsideIntervals: CurveLocationDetailPair[]): void;
     /**
-     *
-     * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param xyz input polygon. This is not changed.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed
+     * from the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz: GrowableXYZArray, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
-    /**
-     *
-     */
     depth(): number;
 }
 /**
@@ -147,8 +145,8 @@ export declare class AlternatingCCTreeNodeCurveClipper {
     private static _fractionIntervals;
     private appendSingleClipToStack;
     /**
-     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack has clip for this node
-     * (expensive -- must clone items of arrays during "swaps")
+     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack
+     * has clip for this node (expensive -- must clone items of arrays during "swaps").
      */
     private recurse;
     /**

package/lib/esm/clipping/AlternatingConvexClipTree.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AlternatingConvexClipTree.d.ts","sourceRoot":"","sources":["../../../src/clipping/AlternatingConvexClipTree.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAuB,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAIzD,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAIlE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAG1E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,qBAAsB,YAAW,cAAc;IACnD,MAAM,EAAE,OAAO,EAAE,CAAM;IACvB,MAAM,EAAE,kBAAkB,CAAoC;IAC9D,QAAQ,EAAE,qBAAqB,EAAE,CAAM;IACvC,QAAQ,EAAE,MAAM,CAAM;IACtB,SAAS,EAAE,MAAM,CAAM;IAE9B,OAAO;IAEP,2EAA2E;WAC7D,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAQzH;;;;;OAKG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAQ5G;;OAEG;WACY,6BAA6B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAOtH,OAAO,CAAC,cAAc;IAKxB;;;OAGG;IACM,YAAY,IAAI,OAAO,EAAE,EAAE;IAKlC,yEAAyE;IAClE,KAAK;IAQZ,2GAA2G;IACpG,KAAK,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAcnE,qEAAqE;IAC9D,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAKtD,4CAA4C;IACrC,QAAQ,CAAC,KAAK,EAAE,SAAS;IAIhC,oDAAoD;IAC7C,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAYjD;;OAEG;IACI,+BAA+B,CAAC,KAAK,EAAE,qBAAqB;IAInE,sFAAsF;IAC/E,iCAAiC,CAAC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;IAKvJ,sFAAsF;IAC/E,kCAAkC,CAAC,MAAM,EAAE,eAAe,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;IAI1J;;;;;;OAMG;IACI,iBAAiB,CACtB,GAAG,EAAE,gBAAgB,EACrB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAAG,IAAI;IA6B1C;;OAEG;IACI,KAAK,IAAI,MAAM;CAQvB;AACD;;;;;;GAMG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,MAAM,CAAgB;IAE9B,OAAO;WAEO,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,wBAAwB,GAAG,wBAAwB;IAU7G,IAAW,MAAM,IAAI,MAAM,CAAgC;IAEpD,UAAU,CAAC,CAAC,EAAE,MAAM;IACpB,WAAW,CAAC,CAAC,EAAE,MAAM;IAErB,SAAS,CAAC,iBAAiB,EAAE,MAAM;IAI1C,OAAO,CAAC,MAAM,CAAC,KAAK;IAQb,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAW9C,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAwBxD,IAAW,WAAW,WASrB;IAED,+DAA+D;IACxD,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO;IAO/D,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAW3D,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAW9F,OAAO,CAAC,eAAe;IAuCvB;;;;;;;;OAQG;IACI,4BAA4B,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;IAIzE;;;;;;;;OAQG;IACK,aAAa,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;CAK5D;AAED,qBAAa,iCAAiC;IAC5C,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,cAAc,CAAc;IACpC,OAAO,CAAC,WAAW,CAAS;;IAO5B,OAAO,CAAC,WAAW;IAEnB,OAAO,CAAC,eAAe;IAOvB,OAAO,CAAC,iBAAiB;IAKzB,OAAO,CAAC,qBAAqB;IAO7B,OAAO,KAAK,WAAW,GAAmE;IAE1F,OAAO,KAAK,WAAW,QAItB;IAED,4CAA4C;IAC5C,OAAO,CAAC,UAAU;IAOlB,OAAO,CAAC,iBAAiB;IAKzB,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAAgB;IAEjD,OAAO,CAAC,uBAAuB;IAkD/B;;;OAGG;IACH,OAAO,CAAC,OAAO;IAqBf;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,cAAc,EACjF,eAAe,EAAE,uBAAuB,EAAE,EAAE,iBAAiB,EAAE,uBAAuB,EAAE;IAqB1F;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,eAAe,EAClF,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;CAQ1F"}
+{"version":3,"file":"AlternatingConvexClipTree.d.ts","sourceRoot":"","sources":["../../../src/clipping/AlternatingConvexClipTree.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAuB,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAC5F,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAIzD,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAIlE,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACxC,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAG1E;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,qBAAsB,YAAW,cAAc;IACnD,MAAM,EAAE,OAAO,EAAE,CAAM;IACvB,MAAM,EAAE,kBAAkB,CAAoC;IAC9D,QAAQ,EAAE,qBAAqB,EAAE,CAAM;IACvC,QAAQ,EAAE,MAAM,CAAM;IACtB,SAAS,EAAE,MAAM,CAAM;IAE9B,OAAO;IAEP,2EAA2E;WAC7D,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAOzH;;;;;OAKG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAO5G,uEAAuE;WACzD,6BAA6B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAOrH,OAAO,CAAC,cAAc;IAKtB;;;;OAIG;IACI,YAAY,IAAI,OAAO,EAAE,EAAE;IAKlC,0EAA0E;IACnE,KAAK;IAOZ,2GAA2G;IACpG,KAAK,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAanE,qEAAqE;IAC9D,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM;IAItD,6CAA6C;IACtC,QAAQ,CAAC,KAAK,EAAE,SAAS;IAGhC,oDAAoD;IAC7C,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAUjD;;;OAGG;IACI,+BAA+B,CAAC,KAAK,EAAE,qBAAqB;IAGnE,sFAAsF;IAC/E,iCAAiC,CACtC,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,GAC7G,IAAI;IAIP,sFAAsF;IAC/E,kCAAkC,CACvC,MAAM,EAAE,eAAe,EAAE,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE,GAC/G,IAAI;IAIP;;;;;;;OAOG;IACI,iBAAiB,CACtB,GAAG,EAAE,gBAAgB,EACrB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IA6BA,KAAK,IAAI,MAAM;CAQvB;AAED;;;;;;GAMG;AACH,qBAAa,wBAAwB;IACnC,OAAO,CAAC,OAAO,CAAiB;IAChC,OAAO,CAAC,MAAM,CAAgB;IAE9B,OAAO;WAEO,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,CAAC,EAAE,wBAAwB,GAAG,wBAAwB;IAS7G,IAAW,MAAM,IAAI,MAAM,CAE1B;IACM,UAAU,CAAC,CAAC,EAAE,MAAM;IAGpB,WAAW,CAAC,CAAC,EAAE,MAAM;IAGrB,SAAS,CAAC,iBAAiB,EAAE,MAAM;IAG1C,OAAO,CAAC,MAAM,CAAC,KAAK;IAQb,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAU9C,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAsBxD,IAAW,WAAW,WASrB;IACD,+DAA+D;IACxD,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO;IAM/D,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;IAU3D,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;IAU9F,OAAO,CAAC,eAAe;IAwCvB;;;;;;;;OAQG;IACI,4BAA4B,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;IAIzE;;;;;;;;OAQG;IACI,aAAa,CAAC,IAAI,EAAE,qBAAqB,GAAG,OAAO;CAI3D;AAED,qBAAa,iCAAiC;IAC5C,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,cAAc,CAAc;IACpC,OAAO,CAAC,WAAW,CAAS;;IAO5B,OAAO,CAAC,WAAW;IACnB,OAAO,CAAC,eAAe;IAMvB,OAAO,CAAC,iBAAiB;IAIzB,OAAO,CAAC,qBAAqB;IAM7B,OAAO,KAAK,WAAW,GAAmE;IAE1F,OAAO,KAAK,WAAW,QAItB;IACD,4CAA4C;IAC5C,OAAO,CAAC,UAAU;IAMlB,OAAO,CAAC,iBAAiB;IAIzB,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAAgB;IACjD,OAAO,CAAC,uBAAuB;IAiD/B;;;OAGG;IACH,OAAO,CAAC,OAAO;IAmBf;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,cAAc,EACjF,eAAe,EAAE,uBAAuB,EAAE,EAAE,iBAAiB,EAAE,uBAAuB,EAAE;IAmB1F;;;OAGG;IACI,yBAAyB,CAAC,IAAI,EAAE,qBAAqB,EAAE,KAAK,EAAE,eAAe,EAClF,eAAe,EAAE,uBAAuB,EAAE,EAAE,gBAAgB,EAAE,uBAAuB,EAAE;CAQ1F"}

package/lib/esm/clipping/AlternatingConvexClipTree.js

@@ -24,7 +24,7 @@ import { Point3dArray } from "../geometry3d/PointHelpers";
 /**
  * An AlternatingConvexClipTreeNode is a node in a tree structure in which
  *   <ul>
- *   <li>Each node contains a ConvexClipPlaneSet
+ *   <li>Each node contains a ConvexClipPlaneSet.
  *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.
  *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if
  *   <ul>
@@ -70,9 +70,7 @@ export class AlternatingCCTreeNode {
         builder.buildHullTree(result); // <-- Currently ALWAYS returns true
         return result;
     }
-    /**
-     * Build the outer convex hull will inlets as first level children
-     */
+    /** Build the outer convex hull with inlets as first level children. */
     static createHullAndInletsForPolygon(points, result) {
         result = result ? result : new AlternatingCCTreeNode();
         result.empty();
@@ -87,14 +85,15 @@ export class AlternatingCCTreeNode {
     }
     /**
      * Return an array with all the loops in the tree.
-     * This looses the alternating structure of the tree, but the collection still matches well-formed polygons by parity rules.
+     * This loses the alternating structure of the tree, but the collection still matches well-formed polygons by
+     * parity rules.
      */
     extractLoops() {
         const loops = [];
         this.extractLoopsGo(loops);
         return loops;
     }
-    /** Resets this AlternatingConvexClipTreeNode to a newly-created state */
+    /** Resets this AlternatingConvexClipTreeNode to a newly-created state. */
     empty() {
         this.points.length = 0;
         this.planes.planes.length = 0;
@@ -121,7 +120,7 @@ export class AlternatingCCTreeNode {
         const newNode = AlternatingCCTreeNode.createWithIndices(index0, numPoints);
         this.children.push(newNode);
     }
-    /** Add a plane to the ConvexClipPlaneSet */
+    /** Add a plane to the ConvexClipPlaneSet. */
     addPlane(plane) {
         this.planes.addPlaneToConvexSet(plane);
     }
@@ -136,7 +135,8 @@ export class AlternatingCCTreeNode {
         }
         return true;
     }
-    /** Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
+    /**
+     * Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
      * * The child pointer is pushed directly to the tree -- not cloned.
      */
     captureConvexClipPlaneSetAsVoid(child) {
@@ -153,10 +153,11 @@ export class AlternatingCCTreeNode {
         clipper.appendCurveCollectionClip(this, curves, insideIntervals, outsideIntervals);
     }
     /**
-     *
-     * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param xyz input polygon. This is not changed.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed
+     * from the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
@@ -189,9 +190,6 @@ export class AlternatingCCTreeNode {
             }
         }
     }
-    /**
-     *
-     */
     depth() {
         const myDepth = 1;
         let maxChildDepth = 0;
@@ -222,9 +220,15 @@ export class AlternatingCCTreeBuilder {
             result._points.pop();
         return result;
     }
-    get period() { return this._points.length; }
-    indexAfter(i) { return (i + 1) % this._points.length; }
-    indexBefore(i) { return (i + this._points.length - 1) % this._points.length; }
+    get period() {
+        return this._points.length;
+    }
+    indexAfter(i) {
+        return (i + 1) % this._points.length;
+    }
+    indexBefore(i) {
+        return (i + this._points.length - 1) % this._points.length;
+    }
     pushIndex(primaryPointIndex) {
         this._stack.push(primaryPointIndex);
     }
@@ -458,8 +462,8 @@ class AlternatingCCTreeNodeCurveClipper {
         return false;
     }
     /**
-     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack has clip for this node
-     * (expensive -- must clone items of arrays during "swaps")
+     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack
+     * has clip for this node (expensive -- must clone items of arrays during "swaps").
      */
     recurse(node) {
         this.pushEmptySegmentFrame();

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

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

package/lib/esm/clipping/BooleanClipFactory.d.ts

@@ -1,67 +1,67 @@
 import { Clipper } from "./ClipUtils";
-/** A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
+/**
+ * A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
  * * These methods create specific clip tree types:
  *   * Union
  *   * Intersection
  *   * Parity
  *   * Difference
- * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection, parity, or difference:
- *   * if `keepInside === true`, accept the "inside" of the initial result
- *   * if `keepInside === false`, accept the "outside"  of the initial result
- * * These methods create various other specialized clippers
- *   *
+ * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection,
+ * parity, or difference:
+ *   * if `keepInside === true`, accept the "inside" of the initial result.
+ *   * if `keepInside === false`, accept the "outside"  of the initial result.
+ * * These methods create various other specialized clippers.
  * @public
  */
 export declare class BooleanClipFactory {
     /**
-     * Create a boolean clipper which performs a union over its children
-     * * if `keepInside === true`, accept the "inside" of the union result
-     * * if `keepInside === false`, accept the "outside" of the union result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a union over its children.
+     * * if `keepInside === true`, accept the "inside" of the union result.
+     * * if `keepInside === false`, accept the "outside" of the union result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureUnion(clippers: Clipper | Clipper[], keepInside: boolean): Clipper;
     /**
-     * Create a boolean clipper which performs an intersection over its children
-     * * if `keepInside === true`, accept the "inside" of the intersection result
-     * * if `keepInside === false`, accept the "outside" of the intersection result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs an intersection over its children.
+     * * if `keepInside === true`, accept the "inside" of the intersection result.
+     * * if `keepInside === false`, accept the "outside" of the intersection result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureIntersection(clippers: Clipper | Clipper[], keepInside: boolean): Clipper;
     /**
-     * Create a boolean clipper which performs a parity over its children
-     * * if `keepInside === true`, accept the "inside" of the parity result
-     * * if `keepInside === false`, accept the "outside" of the parity result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a parity over its children.
+     * * if `keepInside === true`, accept the "inside" of the parity result.
+     * * if `keepInside === false`, accept the "outside" of the parity result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureParity(clippers: Clipper | Clipper[], keepInside: boolean): Clipper;
     /**
-     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and "outside `excludedClipper`"
-     * * if `keepInside === true`, accept the "inside" of the difference
-     * * if `keepInside === false`, accept the "outside" of the difference
-     * @param primaryClipper any clip object whose output is treated as positive
+     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and
+     * "outside `excludedClipper`".
+     * * if `keepInside === true`, accept the "inside" of the difference.
+     * * if `keepInside === false`, accept the "outside" of the difference.
+     * @param primaryClipper any clip object whose output is treated as positive.
      * @param excludeClip any clipper whose output is treated as negative.
      * @param keepInside flag to select results inside or outside the initial `primary minus excludeClipper` clippers.
      */
     static createCaptureDifference(primaryClipper: Clipper, excludedClipper: Clipper, keepInside: boolean): Clipper;
     /**
-     * Create a boolean clipper which performs the reverse of that of `primaryClipper`
-     * @param primaryClipper clip objects to capture
+     * Create a boolean clipper which performs the reverse of that of `primaryClipper`.
+     * @param primaryClipper clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureClipOutside(primaryClipper: Clipper): Clipper;
     /**
-     * convert `source` to an array of clipper objects.
+     * Convert `source` to an array of clipper objects.
      * * ANY TYPE OF Clipper is accepted.
      * * REMARK: This is normally called only from the primary public method `parseToClipper`.
-     * @param source
-     * @param internal
      */
     static parseToClipperArray(source: any): Clipper[] | undefined;
     /**
-     * look for content that represents a clipper.
+     * Look for content that represents a clipper.
      * * Possible outputs are
      *   * `ClipPlane`
      *   * `ConvexClipPlaneSet`

package/lib/esm/clipping/BooleanClipFactory.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"BooleanClipFactory.d.ts","sourceRoot":"","sources":["../../../src/clipping/BooleanClipFactory.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAiB,MAAM,aAAa,CAAC;AAIrD;;;;;;;;;;;;GAYG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;OAMG;WACW,kBAAkB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAK7F;;;;;;OAMG;WACW,yBAAyB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAKpG;;;;;;OAMG;WACW,mBAAmB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAK9F;;;;;;;OAOG;WACW,uBAAuB,CAAC,cAAc,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAItH;;;;OAIG;WACW,wBAAwB,CAAC,cAAc,EAAE,OAAO,GAAG,OAAO;IAIxE;;;;;;OAMG;WACW,mBAAmB,CAAC,MAAM,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,SAAS;IAoBrE;;;;;;;;;;;;OAYG;WACW,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IA0DlE,0DAA0D;WAC5C,gBAAgB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CAQ9D"}
+{"version":3,"file":"BooleanClipFactory.d.ts","sourceRoot":"","sources":["../../../src/clipping/BooleanClipFactory.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAiB,MAAM,aAAa,CAAC;AAIrD;;;;;;;;;;;;;GAaG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;OAMG;WACW,kBAAkB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAK7F;;;;;;OAMG;WACW,yBAAyB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAKpG;;;;;;OAMG;WACW,mBAAmB,CAAC,QAAQ,EAAE,OAAO,GAAG,OAAO,EAAE,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAK9F;;;;;;;;OAQG;WACW,uBAAuB,CAAC,cAAc,EAAE,OAAO,EAAE,eAAe,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,GAAG,OAAO;IAItH;;;;OAIG;WACW,wBAAwB,CAAC,cAAc,EAAE,OAAO,GAAG,OAAO;IAGxE;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,GAAG,GAAG,OAAO,EAAE,GAAG,SAAS;IAoBrE;;;;;;;;;;;;OAYG;WACW,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,GAAG,SAAS;IA0DlE,0DAA0D;WAC5C,gBAAgB,CAAC,OAAO,EAAE,GAAG,GAAG,GAAG,GAAG,SAAS;CAO9D"}

package/lib/esm/clipping/BooleanClipFactory.js

@@ -10,25 +10,26 @@ import { ClipPlane } from "./ClipPlane";
 import { ClipUtilities } from "./ClipUtils";
 import { ConvexClipPlaneSet } from "./ConvexClipPlaneSet";
 import { UnionOfConvexClipPlaneSets } from "./UnionOfConvexClipPlaneSets";
-/** A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
+/**
+ * A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
  * * These methods create specific clip tree types:
  *   * Union
  *   * Intersection
  *   * Parity
  *   * Difference
- * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection, parity, or difference:
- *   * if `keepInside === true`, accept the "inside" of the initial result
- *   * if `keepInside === false`, accept the "outside"  of the initial result
- * * These methods create various other specialized clippers
- *   *
+ * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection,
+ * parity, or difference:
+ *   * if `keepInside === true`, accept the "inside" of the initial result.
+ *   * if `keepInside === false`, accept the "outside"  of the initial result.
+ * * These methods create various other specialized clippers.
  * @public
  */
 export class BooleanClipFactory {
     /**
-     * Create a boolean clipper which performs a union over its children
-     * * if `keepInside === true`, accept the "inside" of the union result
-     * * if `keepInside === false`, accept the "outside" of the union result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a union over its children.
+     * * if `keepInside === true`, accept the "inside" of the union result.
+     * * if `keepInside === false`, accept the "outside" of the union result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureUnion(clippers, keepInside) {
@@ -37,10 +38,10 @@ export class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs an intersection over its children
-     * * if `keepInside === true`, accept the "inside" of the intersection result
-     * * if `keepInside === false`, accept the "outside" of the intersection result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs an intersection over its children.
+     * * if `keepInside === true`, accept the "inside" of the intersection result.
+     * * if `keepInside === false`, accept the "outside" of the intersection result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureIntersection(clippers, keepInside) {
@@ -49,10 +50,10 @@ export class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs a parity over its children
-     * * if `keepInside === true`, accept the "inside" of the parity result
-     * * if `keepInside === false`, accept the "outside" of the parity result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a parity over its children.
+     * * if `keepInside === true`, accept the "inside" of the parity result.
+     * * if `keepInside === false`, accept the "outside" of the parity result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureParity(clippers, keepInside) {
@@ -61,10 +62,11 @@ export class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and "outside `excludedClipper`"
-     * * if `keepInside === true`, accept the "inside" of the difference
-     * * if `keepInside === false`, accept the "outside" of the difference
-     * @param primaryClipper any clip object whose output is treated as positive
+     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and
+     * "outside `excludedClipper`".
+     * * if `keepInside === true`, accept the "inside" of the difference.
+     * * if `keepInside === false`, accept the "outside" of the difference.
+     * @param primaryClipper any clip object whose output is treated as positive.
      * @param excludeClip any clipper whose output is treated as negative.
      * @param keepInside flag to select results inside or outside the initial `primary minus excludeClipper` clippers.
      */
@@ -73,19 +75,17 @@ export class BooleanClipFactory {
         return this.createCaptureIntersection([primaryClipper, mask], keepInside);
     }
     /**
-     * Create a boolean clipper which performs the reverse of that of `primaryClipper`
-     * @param primaryClipper clip objects to capture
+     * Create a boolean clipper which performs the reverse of that of `primaryClipper`.
+     * @param primaryClipper clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureClipOutside(primaryClipper) {
         return this.createCaptureUnion([primaryClipper], false);
     }
     /**
-     * convert `source` to an array of clipper objects.
+     * Convert `source` to an array of clipper objects.
      * * ANY TYPE OF Clipper is accepted.
      * * REMARK: This is normally called only from the primary public method `parseToClipper`.
-     * @param source
-     * @param internal
      */
     static parseToClipperArray(source) {
         if (Array.isArray(source)) {
@@ -109,7 +109,7 @@ export class BooleanClipFactory {
         return undefined;
     }
     /**
-     * look for content that represents a clipper.
+     * Look for content that represents a clipper.
      * * Possible outputs are
      *   * `ClipPlane`
      *   * `ConvexClipPlaneSet`