@itwin/core-geometry 4.1.0-dev.8 → 4.1.0-dev.81

package/lib/esm/curve/RegionOps.js

@@ -19,16 +19,17 @@ import { PolyfaceBuilder } from "../polyface/PolyfaceBuilder";
 import { HalfEdgeMask } from "../topology/Graph";
 import { HalfEdgeGraphSearch } from "../topology/HalfEdgeGraphSearch";
 import { Triangulator } from "../topology/Triangulation";
-import { ChainCollectorContext } from "./ChainCollectorContext";
 import { BagOfCurves, CurveChain, CurveCollection } from "./CurveCollection";
 import { CurveCurve } from "./CurveCurve";
+import { CurveOps } from "./CurveOps";
 import { CurvePrimitive } from "./CurvePrimitive";
 import { CurveWireMomentsXYZ } from "./CurveWireMomentsXYZ";
 import { GeometryQuery } from "./GeometryQuery";
-import { OffsetHelpers } from "./internalContexts/MultiChainCollector";
-import { CurveChainWireOffsetContext, PolygonWireOffsetContext } from "./internalContexts/PolygonOffsetContext";
+import { ChainCollectorContext } from "./internalContexts/ChainCollectorContext";
+import { PolygonWireOffsetContext } from "./internalContexts/PolygonOffsetContext";
 import { LineString3d } from "./LineString3d";
 import { Loop } from "./Loop";
+import { OffsetOptions } from "./OffsetOptions";
 import { ParityRegion } from "./ParityRegion";
 import { Path } from "./Path";
 import { ConsolidateAdjacentCurvePrimitivesContext } from "./Query/ConsolidateAdjacentPrimitivesContext";
@@ -57,7 +58,8 @@ export var RegionBinaryOpType;
  *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.
  * The common "One outer loop and many Inner loops" is a parity region.
  *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.
- * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.
+ * * **NOTE:** Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has
+ * been rotated parallel to the xy-plane.
  * @public
  */
 export class RegionOps {
@@ -76,7 +78,8 @@ export class RegionOps {
         }
         return undefined;
     }
-    /** Return an area tolerance for a given xy-range and optional distance tolerance.
+    /**
+     * Return an area tolerance for a given xy-range and optional distance tolerance.
      * @param range range of planar region to tolerance
      * @param distanceTolerance optional absolute distance tolerance
     */
@@ -99,7 +102,8 @@ export class RegionOps {
         }
         return undefined;
     }
-    /** Return MomentData with the sums of wire moments.
+    /**
+     * Return MomentData with the sums of wire moments.
      * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with
      *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`
      * @param root any CurveCollection or CurvePrimitive.
@@ -112,7 +116,7 @@ export class RegionOps {
         return result;
     }
     /**
-     * * create loops in the graph.
+     * Create loops in the graph.
      * @internal
      */
     static addLoopsToGraph(graph, data, announceIsolatedLoop) {
@@ -156,7 +160,8 @@ export class RegionOps {
             }
         }
     }
-    /** Add multiple loops to a graph.
+    /**
+     * Add multiple loops to a graph.
      * * Apply edgeTag and mask to each edge.
      * @internal
      */
@@ -175,7 +180,6 @@ export class RegionOps {
     /**
      * Given a graph just produced by booleans, convert to a polyface
      * * "just produced" implies exterior face markup.
-     *
      * @param graph
      * @param triangulate
      */
@@ -236,7 +240,8 @@ export class RegionOps {
      * @param loopsB second set of loops
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
+     * to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = Geometry.smallMetricDistance) {
         const result = UnionRegion.create();
@@ -303,34 +308,33 @@ export class RegionOps {
         }
         return RegionOps.sortOuterAndHoleLoopsXY(allLoops);
     }
-    /** Construct a wire (not area!!) that is offset from given polyline or polygon.
-     * * This is a simple wire offset, not an area.
-     * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not guarantee a simple area offset.
-     * * The construction algorithm is subject to being changed, resulting in different (hopefully better) self-intersection behavior on the future.
+    /**
+     * Construct a wire that is offset from the given polyline or polygon.
+     * * This is a simple wire offset, not an area offset.
+     * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)
+     * the xy-plane.
+     * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not
+     * guarantee a simple area offset.
      * @param points a single loop or path
      * @param wrap true to include wraparound
-     * @param offsetDistance distance of offset from wire.  Positive is left.
+     * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions
+     * object.
      */
-    static constructPolygonWireXYOffset(points, wrap, offsetDistance) {
+    static constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions) {
         const context = new PolygonWireOffsetContext();
-        return context.constructPolygonWireXYOffset(points, wrap, offsetDistance);
+        return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);
     }
     /**
-   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
-   * * The construction will remove "some" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.
-   * * If offsetDistance is given as a number, default OffsetOptions are applied.
-   * * When the offset needs to do an "outside" turn, the first applicable construction is applied:
-   *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.
-   *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to single intersection point.
-   *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight lines that are:
-   *      * outside the arc
-   *      * have uniform turn angle less than `options.maxChamferDegrees`
-   *      * each line segment (except first and last) touches the arc at its midpoint.
-   * @param curves base curves.
-   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
-   */
+     * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
+     * * The construction will remove "some" local effects of features smaller than the offset distance, but will
+     * not detect self intersection among widely separated edges.
+     * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/Offset
+     * @param curves base curves.
+     * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
+     */
     static constructCurveXYOffset(curves, offsetDistanceOrOptions) {
-        return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);
+        const offsetOptions = OffsetOptions.create(offsetDistanceOrOptions);
+        return CurveOps.constructCurveXYOffset(curves, offsetOptions);
     }
     /**
      * Test if point (x,y) is IN, OUT or ON a region.
@@ -342,7 +346,8 @@ export class RegionOps {
     static testPointInOnOutRegionXY(curves, x, y) {
         return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);
     }
-    /** Create curve collection of subtype determined by gaps between the input curves.
+    /**
+     * Create curve collection of subtype determined by gaps between the input curves.
      * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.
      * * If all curves connect head-to-tail except for closure, return a `Path`.
      * * If there are internal gaps, return a `BagOfCurves`
@@ -379,7 +384,9 @@ export class RegionOps {
      * Announce Checkpoint function for use during booleans
      * @internal
      */
-    static setCheckPointFunction(f) { this._graphCheckPointFunction = f; }
+    static setCheckPointFunction(f) {
+        this._graphCheckPointFunction = f;
+    }
     /**
      * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.
      * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:
@@ -394,7 +401,8 @@ export class RegionOps {
     }
     /**
      * Create paths assembled from many curves.
-     * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by [[cloneCurvesWithXYSplits]].
+     * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by
+     * [[cloneCurvesWithXYSplits]].
      * * Return simplest form -- single primitive, single path, or bag of curves.
      */
     static splitToPathsBetweenBreaks(source, makeClones) {
@@ -411,27 +419,29 @@ export class RegionOps {
         return chainCollector.grabResult();
     }
     /**
-     * Restructure curve fragments as chains, and construct (left and right) chain offsets in the xy-plane.
-     * * BEWARE that if the input is not a loop, the classification of outputs is suspect.
-     * @param fragments fragments to be chained, z-coordinates ignored
-     * @param offsetDistance offset distance
-     * @param gapTolerance absolute endpoint tolerance for computing chains
+     * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.
+     * * If the inputs do not form Loop(s), the classification of offsets is suspect.
+     * * For best offset results, the inputs should be parallel to the xy-plane.
+     * @param fragments fragments to be chained and offset
+     * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.
+     * @param gapTolerance distance to be treated as "effectively zero" when assembling fragments head-to-tail
      * @returns object with named chains, insideOffsets, outsideOffsets
      */
     static collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance) {
-        return OffsetHelpers.collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance);
+        return CurveOps.collectInsideAndOutsideXYOffsets(fragments, offsetDistance, gapTolerance);
     }
     /**
-     * Restructure curve fragments as chains.
+     * Restructure curve fragments as Paths and Loops.
      * @param fragments fragments to be chained
-     * @param gapTolerance absolute endpoint tolerance for computing chains
-     * @returns chains, possibly wrapped in BagOfCurves if there multiple chains
+     * @param gapTolerance distance to be treated as "effectively zero" when assembling fragments head-to-tail
+     * @returns chains, possibly wrapped in a [[BagOfCurves]].
      */
     static collectChains(fragments, gapTolerance = Geometry.smallMetricDistance) {
-        return OffsetHelpers.collectChains(fragments, gapTolerance);
+        return CurveOps.collectChains(fragments, gapTolerance);
     }
     /**
-     * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments of `curvesToCut`.
+     * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments
+     * of `curvesToCut`.
      * * Break `curvesToCut` into parts inside, outside, and coincident.
      * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`
      */
@@ -457,7 +467,8 @@ export class RegionOps {
         }
         return result;
     }
-    /** If `data` is one of several forms of a rectangle, return its edge Transform.
+    /**
+     * If `data` is one of several forms of a rectangle, return its edge Transform.
      * * Points are considered a rectangle if, within the first 4 points:
      *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product
      *     * vectors from 0 to 3 and 1 to 2 are the same
@@ -468,7 +479,8 @@ export class RegionOps {
      *   * Array of Point3d[]
      *   * IndexedXYZCollection
      * @param requireClosurePoint whether to require a 5th point equal to the 1st point.
-     * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit normal in z column. If not a rectangle, return undefined.
+     * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit
+     * normal in z column. If not a rectangle, return undefined.
      */
     static rectangleEdgeTransform(data, requireClosurePoint = true) {
         if (data instanceof LineString3d) {
@@ -528,9 +540,10 @@ export class RegionOps {
      * * Contiguous `LineSegment3d` and `LineString3d` objects.
      *   * collect all points
      *   * eliminate duplicated points
-     *   * eliminate points colinear with surrounding points.
-     *   * Contiguous concentric circular or elliptic arcs
+     *   * eliminate points colinear with surrounding points
+     *   * contiguous concentric circular or elliptic arcs
      *   * combine angular ranges
+     * * This function can be used to compress adjacent LineSegment3ds into a LineString3d
      * @param curves Path or loop (or larger collection containing paths and loops) to be simplified
      * @param options options for tolerance and selective simplification.
      */
@@ -544,8 +557,10 @@ export class RegionOps {
      * @returns a region that captures the input pointers. This region is a:
      * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.
      * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.
-     * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented clockwise.
-     * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in the above cases.
+     * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented
+     * clockwise.
+     * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in
+     * the above cases.
      * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]
      */
     static sortOuterAndHoleLoopsXY(loops) {
@@ -562,17 +577,22 @@ export class RegionOps {
     }
     /**
      * Find all areas bounded by the unstructured, possibly intersecting curves.
-     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the input curves.
-     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless
-     * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that
-     * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.
-     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.
+     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
+     * input curves.
+     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
+     * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
+     * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
+     * SignedLoops object.
+     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
+     * primitives.
      * @param tolerance optional distance tolerance for coincidence
      * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
-     *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.
+     *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
+     * positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
      *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.
-     *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.
+     *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent
+     * to the edge and a constituent curve in each.
      */
     static constructAllXYRegionLoops(curvesAndRegions, tolerance = Geometry.smallMetricDistance) {
         const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
@@ -588,8 +608,10 @@ export class RegionOps {
      * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.
      * @param candidates input curves
      * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.
-     * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If false, push the [[CurveChainWithDistanceIndex]] instead.
-     * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false, push the [[LineString3d]] instead.
+     * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If
+     * false, push the [[CurveChainWithDistanceIndex]] instead.
+     * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,
+     * push the [[LineString3d]] instead.
      */
     static collectCurvePrimitives(candidates, collectorArray, smallestPossiblePrimitives = false, explodeLinestrings = false) {
         const results = collectorArray === undefined ? [] : collectorArray;
@@ -607,7 +629,8 @@ export class RegionOps {
         return results;
     }
     /**
-     * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed instances of [[LineSegment3d]].
+     * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed
+     * instances of [[LineSegment3d]].
      * @param candidates input curves
      * @return copied (captured) inputs except for the linestrings, which are exploded
      */

package/lib/esm/curve/RegionOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,0BAA0B,EAAE,MAAM,+CAA+C,CAAC;AAC3F,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAA2B,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAqD,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC5G,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAEhE,OAAO,EAAE,WAAW,EAA6C,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACxH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,wCAAwC,CAAC;AACvE,OAAO,EAAE,2BAA2B,EAA+B,wBAAwB,EAAE,MAAM,yCAAyC,CAAC;AAC7I,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAe,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,yCAAyC,EAAE,MAAM,8CAA8C,CAAC;AACzG,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,yBAAyB,EAAE,MAAM,iCAAiC,CAAC;AACrH,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAiB5C;;;GAGG;AACH,MAAM,CAAN,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,KAAlB,kBAAkB,QAM7B;AAED;;;;;;;;;GASG;AACH,MAAM,OAAO,SAAS;IACpB;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,IAAe;QAChD,MAAM,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,UAAU,EAAE;YAChC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;SACf;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;MAGE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,QAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,IAAe;QACzC,MAAM,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,UAAU,EAAE;YAChC,OAAO,MAAM,CAAC,WAAW,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,wBAAwB,CAAC,IAAc;QACnD,MAAM,OAAO,GAAG,IAAI,mBAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB,EAAE,IAAgC,EAAE,oBAAoE;QACxJ,IAAI,IAAI,YAAY,IAAI,EAAE;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,YAAY,EAAE;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;aAC7D;SACF;aAAM,IAAI,IAAI,YAAY,oBAAoB,EAAE;YAC/C,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SACzC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnB,IAAI,OAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;iBAEzC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,oBAAoB,EAAE;oBAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;wBACvB,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;qBACzC;iBACF;qBAAM;oBACL,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;qBAC1F;iBACF;aACF;SACF;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,0BAA0B,CAAC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAC/H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE;gBACR,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;aACvD;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE;YACT,IAAI,WAAW,EAAE;gBACf,YAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,OAAO,eAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QACtJ,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAClJ,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAAC,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QACvJ,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,EACrE,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,eAAe,CAAC,MAA2C,EAAE,MAA2C,EAAE,SAA6B,EAAE,iBAAyB,QAAQ,CAAC,mBAAmB;QAC1M,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,OAAO,CAAC,sBAAsB,CAAC,SAAS,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YACtH,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE;gBAClB,MAAM,IAAI,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACtD,IAAI,IAAI;oBACN,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aAC5B;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CAAC,MAAoC,EAAE,SAA6B,EAC1G,MAAoC,EAAE,cAAuB,KAAK;QAClE,MAAM,KAAK,GAAG,yBAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QACpC,MAAM,KAAK,GAAG,yBAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,mBAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE;YACjC,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAiB,EAAE,IAAa,EAAE,cAAsB;QACjG,MAAM,OAAO,GAAG,IAAI,wBAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;IAC5E,CAAC;IACD;;;;;;;;;;;;;KAaC;IACM,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA8D;QACtH,OAAO,2BAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,mBAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QACtI,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,QAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE;YAC1C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;SACf;aAAM;YACL,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IAGD;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B,IAAI,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC,CAAC,CAAC;IACvG;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CAAC,WAAiC,EAAE,YAA6B;QACpG,OAAO,iBAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,cAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;SAClD;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAC9G,OAAO,aAAa,CAAC,8BAA8B,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC/F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,QAAQ,CAAC,mBAAmB;QACpG,OAAO,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,2BAA2B,CAAC,WAAiC,EAAE,MAAiB;QAC5F,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,eAAe,EAAE;YACzC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE;gBACvC,MAAM,YAAY,GAAG,eAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;iBACtG;aACF;SACF;aAAM,IAAI,UAAU,YAAY,cAAc,EAAE;YAC/C,MAAM,YAAY,GAAG,eAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE;gBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;aAC3G;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAiD,EAAE,sBAA+B,IAAI;QACzH,IAAI,IAAI,YAAY,YAAY,EAAE;YAChC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACvD;aAAM,IAAI,IAAI,YAAY,oBAAoB,EAAE;YAC/C,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC5C,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpD,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACtD,OAAO,SAAS,CAAC;aAClB;iBAAM;gBACL,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,0BAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,QAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;aACpB;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE;gBACzC,OAAO,SAAS,CAAC,4BAA4B,CAAC,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;aAC/H;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SACzE;aAAM,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,UAAU,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE;oBACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;iBAC7C;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAuB,EAAE,OAAmD;QACtH,MAAM,OAAO,GAAG,IAAI,yCAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE;YAC7B,IAAI,SAAS,YAAY,IAAI;gBAC3B,eAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,oBAAoB,EAAE;gBAClD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,eAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;aAC7C;SACF;QACD,OAAO,eAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,MAAM,CAAC,yBAAyB,CAAC,gBAAuC,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAC/H,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,iBAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,UAAiC,EAAE,cAAiC,EACvG,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QACnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,cAAc,EAAE;YACxC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,UAAU,YAAY,eAAe,EAAE;YAChD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;gBAC1B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aACzF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;YAC1B,IAAI,CAAC,YAAY,YAAY,EAAE;gBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAClD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAClB;aACF;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAChB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,aAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;gBACpB,IAAI,CAAC,YAAY,aAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,OAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,gBAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED,gBAAgB;AAChB,SAAS,mBAAmB,CAAC,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IACpI,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { LineStringDataVariant, MultiLineStringDataVariant, Triangulator } from \"../topology/Triangulation\";\r\nimport { ChainCollectorContext } from \"./ChainCollectorContext\";\r\nimport { AnyCurve, AnyRegion } from \"./CurveChain\";\r\nimport { BagOfCurves, ConsolidateAdjacentCurvePrimitivesOptions, CurveChain, CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { OffsetHelpers } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext, JointOptions, OffsetOptions, PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop, SignedLoops } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\r\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\r\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\r\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Possible return types from [[splitToPathsBetweenBreaks]], [[collectInsideAndOutsideOffsets]] and [[collectChains]].\r\n * @public\r\n */\r\nexport type ChainTypes = CurvePrimitive | Path | BagOfCurves | Loop | undefined;\r\n\r\n/**\r\n * * `properties` is a string with special characters indicating\r\n *   * \"U\" -- contains unmerged stick data\r\n *   * \"M\" -- merged\r\n *   * \"R\" -- regularized\r\n *   * \"X\" -- has exterior markup\r\n * @internal\r\n */\r\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\r\n/**\r\n * Enumeration of the binary operation types for a booleans among regions\r\n * @public\r\n */\r\nexport enum RegionBinaryOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  AMinusB = 3,\r\n  BMinusA = 4,\r\n}\r\n\r\n/**\r\n * Class `RegionOps` has static members for calculations on regions (areas).\r\n * * Regions are represented by these `CurveCollection` subclasses:\r\n *   * `Loop` -- a single loop\r\n *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.\r\n * The common \"One outer loop and many Inner loops\" is a parity region.\r\n *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\r\n * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.\r\n * @public\r\n */\r\nexport class RegionOps {\r\n  /**\r\n   * Return moment sums for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYAreaMoments(root: AnyRegion): MomentData | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      result.shiftOriginAndSumsToCentroidOfSums();\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return an area tolerance for a given xy-range and optional distance tolerance.\r\n   * @param range range of planar region to tolerance\r\n   * @param distanceTolerance optional absolute distance tolerance\r\n  */\r\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\r\n    // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).\r\n    const halfDistTol = 0.5 * distanceTolerance;\r\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\r\n  }\r\n  /**\r\n   * Return an xy area for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYArea(root: AnyRegion): number | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      return result.quantitySum;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return MomentData with the sums of wire moments.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any CurveCollection or CurvePrimitive.\r\n   */\r\n  public static computeXYZWireMomentSums(root: AnyCurve): MomentData | undefined {\r\n    const handler = new CurveWireMomentsXYZ();\r\n    handler.visitLeaves(root);\r\n    const result = handler.momentData;\r\n    result.shiftOriginAndSumsToCentroidOfSums();\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * create loops in the graph.\r\n   * @internal\r\n   */\r\n  public static addLoopsToGraph(graph: HalfEdgeGraph, data: MultiLineStringDataVariant, announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void) {\r\n    if (data instanceof Loop) {\r\n      const points = data.getPackedStrokes();\r\n      if (points)\r\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n    } else if (data instanceof ParityRegion) {\r\n      for (const child of data.children) {\r\n        const points = child.getPackedStrokes();\r\n        if (points)\r\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n      }\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\r\n      if (loopSeed !== undefined)\r\n        announceIsolatedLoop(graph, loopSeed);\r\n    } else if (Array.isArray(data)) {\r\n      if (data.length > 0) {\r\n        if (Point3d.isAnyImmediatePointType(data[0])) {\r\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\r\n          if (loopSeed !== undefined)\r\n            announceIsolatedLoop(graph, loopSeed);\r\n\r\n        } else if (data[0] instanceof IndexedXYZCollection) {\r\n          for (const loop of data) {\r\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\r\n            if (loopSeed !== undefined)\r\n              announceIsolatedLoop(graph, loopSeed);\r\n          }\r\n        } else {\r\n          for (const child of data) {\r\n            if (Array.isArray(child))\r\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Add multiple loops to a graph.\r\n   * * Apply edgeTag and mask to each edge.\r\n   * @internal\r\n   */\r\n  public static addLoopsWithEdgeTagToGraph(graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any): HalfEdge[] | undefined {\r\n    const loopSeeds: HalfEdge[] = [];\r\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\r\n      if (seed) {\r\n        loopSeeds.push(seed);\r\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\r\n      }\r\n    });\r\n    if (loopSeeds.length > 0)\r\n      return loopSeeds;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Given a graph just produced by booleans, convert to a polyface\r\n   * * \"just produced\" implies exterior face markup.\r\n   *\r\n   * @param graph\r\n   * @param triangulate\r\n   */\r\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\r\n    if (graph) {\r\n      if (triangulate) {\r\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\r\n        Triangulator.flipTriangles(graph);\r\n      }\r\n      return PolyfaceBuilder.graphToPolyface(graph);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a polyface containing the area intersection of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaIntersectLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n\r\n  /**\r\n   * Return a polyface containing the area union of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaUnionLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA || inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area difference of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaDifferenceLoopsToPolyface(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(loopsA, loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && !inB),\r\n      this._graphCheckPointFunction);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n\r\n  /**\r\n   * Return areas defined by a boolean operation.\r\n   * * If there are multiple regions in loopsA, they are treated as a union.\r\n   * * If there are multiple regions in loopsB, they are treated as a union.\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.\r\n   */\r\n  public static regionBooleanXY(loopsA: AnyRegion | AnyRegion[] | undefined, loopsB: AnyRegion | AnyRegion[] | undefined, operation: RegionBinaryOpType, mergeTolerance: number = Geometry.smallMetricDistance): AnyRegion | undefined {\r\n    const result = UnionRegion.create();\r\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n    context.addMembers(loopsA, loopsB);\r\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\r\n    const range = context.groupA.range().union(context.groupB.range());\r\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\r\n    context.runClassificationSweep(operation, (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\r\n      // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\r\n      if (face.countEdgesAroundFace() < 2)\r\n        return;\r\n      if (Math.abs(area) < areaTol)\r\n        return;\r\n      if (faceType === 1) {\r\n        const loop = PlanarSubdivision.createLoopInFace(face);\r\n        if (loop)\r\n          result.tryAddChild(loop);\r\n      }\r\n    });\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Return a polyface whose facets are a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonBooleanXYToPolyface(inputA: MultiLineStringDataVariant[], operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[], triangulate: boolean = false): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union, true);\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   */\r\n  public static polygonBooleanXYToLoops(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[]): AnyRegion | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union, true);\r\n    if (!graph)\r\n      return undefined;\r\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\r\n    const allLoops: Loop[] = [];\r\n    for (const graphLoop of loopEdges) {\r\n      const points = new GrowableXYZArray();\r\n      for (const edge of graphLoop)\r\n        points.pushXYZ(edge.x, edge.y, edge.z);\r\n      points.pushWrap(1);\r\n      const loop = Loop.create();\r\n      loop.tryAddChild(LineString3d.createCapture(points));\r\n      allLoops.push(loop);\r\n    }\r\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\r\n  }\r\n\r\n  /** Construct a wire (not area!!) that is offset from given polyline or polygon.\r\n   * * This is a simple wire offset, not an area.\r\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not guarantee a simple area offset.\r\n   * * The construction algorithm is subject to being changed, resulting in different (hopefully better) self-intersection behavior on the future.\r\n   * @param points a single loop or path\r\n   * @param wrap true to include wraparound\r\n   * @param offsetDistance distance of offset from wire.  Positive is left.\r\n   */\r\n  public static constructPolygonWireXYOffset(points: Point3d[], wrap: boolean, offsetDistance: number): CurveCollection | undefined {\r\n    const context = new PolygonWireOffsetContext();\r\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistance);\r\n  }\r\n  /**\r\n * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n * * If offsetDistance is given as a number, default OffsetOptions are applied.\r\n * * When the offset needs to do an \"outside\" turn, the first applicable construction is applied:\r\n *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.\r\n *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to single intersection point.\r\n *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight lines that are:\r\n *      * outside the arc\r\n *      * have uniform turn angle less than `options.maxChamferDegrees`\r\n *      * each line segment (except first and last) touches the arc at its midpoint.\r\n * @param curves base curves.\r\n * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Test if point (x,y) is IN, OUT or ON a region.\r\n   * @return (1) for in, (-1) for OUT, (0) for ON\r\n   * @param curves input region\r\n   * @param x x coordinate of point to test\r\n   * @param y y coordinate of point to test\r\n   */\r\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\r\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\r\n  }\r\n  /** Create curve collection of subtype determined by gaps between the input curves.\r\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\r\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\r\n   * * If there are internal gaps, return a `BagOfCurves`\r\n   * * If input array has zero length, return undefined.\r\n   * @param curves input curves\r\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\r\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\r\n   */\r\n  public static createLoopPathOrBagOfCurves(curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false): CurveCollection | undefined {\r\n    const n = curves.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    let maxGap = 0.0;\r\n    let isPath = false;\r\n    if (wrap)\r\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\r\n    for (let i = 0; i + 1 < n; i++)\r\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\r\n    let collection: Loop | Path | BagOfCurves;\r\n    if (Geometry.isSmallMetricDistance(maxGap)) {\r\n      collection = wrap ? Loop.create() : Path.create();\r\n      isPath = true;\r\n    } else {\r\n      collection = BagOfCurves.create();\r\n    }\r\n    for (const c of curves)\r\n      collection.tryAddChild(c);\r\n    if (isPath && consolidateAdjacentPrimitives)\r\n      RegionOps.consolidateAdjacentPrimitives(collection);\r\n    return collection;\r\n  }\r\n\r\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\r\n  /**\r\n   * Announce Checkpoint function for use during booleans\r\n   * @internal\r\n   */\r\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) { this._graphCheckPointFunction = f; }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\r\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\r\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\r\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\r\n   * * All cutting is \"as viewed in the xy plane\"\r\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\r\n   * @param cutterCurves input curves to intersect with `curvesToCut`\r\n   */\r\n  public static cloneCurvesWithXYSplits(curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection): AnyCurve | undefined {\r\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\r\n  }\r\n  /**\r\n   * Create paths assembled from many curves.\r\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by [[cloneCurvesWithXYSplits]].\r\n   * * Return simplest form -- single primitive, single path, or bag of curves.\r\n   */\r\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): ChainTypes {\r\n    if (source === undefined)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive)\r\n      return source;\r\n    // source is a collection .  ..\r\n    const primitives = source.collectCurvePrimitives();\r\n    const chainCollector = new ChainCollectorContext(makeClones);\r\n    for (const primitive of primitives) {\r\n      chainCollector.announceCurvePrimitive(primitive);\r\n    }\r\n    return chainCollector.grabResult();\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains, and construct (left and right) chain offsets in the xy-plane.\r\n   * * BEWARE that if the input is not a loop, the classification of outputs is suspect.\r\n   * @param fragments fragments to be chained, z-coordinates ignored\r\n   * @param offsetDistance offset distance\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains: ChainTypes } {\r\n    return OffsetHelpers.collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as chains.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance absolute endpoint tolerance for computing chains\r\n   * @returns chains, possibly wrapped in BagOfCurves if there multiple chains\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    return OffsetHelpers.collectChains(fragments, gapTolerance);\r\n  }\r\n\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments of `curvesToCut`.\r\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\r\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\r\n   */\r\n  public static splitPathsByRegionInOnOutXY(curvesToCut: AnyCurve | undefined, region: AnyRegion): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\r\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\r\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\r\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\r\n    if (splitPaths instanceof CurveCollection) {\r\n      for (const child of splitPaths.children) {\r\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\r\n        if (pointOnChild) {\r\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n        }\r\n      }\r\n    } else if (splitPaths instanceof CurvePrimitive) {\r\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\r\n      if (pointOnChild) {\r\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /** If `data` is one of several forms of a rectangle, return its edge Transform.\r\n   * * Points are considered a rectangle if, within the first 4 points:\r\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\r\n   *     * vectors from 0 to 3 and 1 to 2 are the same\r\n   * @param data points in one of several formats:\r\n   *   * LineString\r\n   *   * Loop containing rectangle content\r\n   *   * Path containing rectangle content\r\n   *   * Array of Point3d[]\r\n   *   * IndexedXYZCollection\r\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\r\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit normal in z column. If not a rectangle, return undefined.\r\n   */\r\n  public static rectangleEdgeTransform(data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true): Transform | undefined {\r\n    if (data instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.packedPoints);\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      let dataToUse;\r\n      if (requireClosurePoint && data.length === 5) {\r\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\r\n          return undefined;\r\n        dataToUse = data;\r\n      } else if (!requireClosurePoint && data.length === 4) {\r\n        dataToUse = data;\r\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\r\n        return undefined;\r\n      } else {\r\n        dataToUse = GrowableXYZArray.create(data);\r\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\r\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\r\n          return undefined;\r\n      }\r\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\r\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\r\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\r\n      const normalVector = vector01.crossProduct(vector03);\r\n      if (normalVector.normalizeInPlace()\r\n        && vector12.isAlmostEqual(vector03)\r\n        && vector01.isPerpendicularTo(vector03)) {\r\n        return Transform.createOriginAndMatrixColumns(dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector);\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\r\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\r\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\r\n    } else if (data instanceof CurveChain) {\r\n      if (!data.checkForNonLinearPrimitives()) {\r\n        // const linestring = LineString3d.create();\r\n        const strokes = data.getPackedStrokes();\r\n        if (strokes) {\r\n          return this.rectangleEdgeTransform(strokes);\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Look for and simplify:\r\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\r\n   *   * collect all points\r\n   *   * eliminate duplicated points\r\n   *   * eliminate points colinear with surrounding points.\r\n   *   * Contiguous concentric circular or elliptic arcs\r\n   *   * combine angular ranges\r\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\r\n   * @param options options for tolerance and selective simplification.\r\n   */\r\n  public static consolidateAdjacentPrimitives(curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions) {\r\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\r\n    curves.dispatchToGeometryHandler(context);\r\n  }\r\n  /**\r\n   * Reverse and reorder loops in the xy-plane for consistency and containment.\r\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored\r\n   * @returns a region that captures the input pointers. This region is a:\r\n   * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.\r\n   * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.\r\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented clockwise.\r\n   * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in the above cases.\r\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\r\n   */\r\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\r\n    const loopAndArea: SortablePolygon[] = [];\r\n    for (const candidate of loops) {\r\n      if (candidate instanceof Loop)\r\n        SortablePolygon.pushLoop(loopAndArea, candidate);\r\n      else if (candidate instanceof IndexedXYZCollection) {\r\n        const loop = Loop.createPolygon(candidate);\r\n        SortablePolygon.pushLoop(loopAndArea, loop);\r\n      }\r\n    }\r\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\r\n  }\r\n  /**\r\n   * Find all areas bounded by the unstructured, possibly intersecting curves.\r\n   * * A common use case of this method is to assemble the bounding \"exterior\" loop (or loops) containing the input curves.\r\n   * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless\r\n   * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that\r\n   * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.\r\n   * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:\r\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.\r\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\r\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\r\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.\r\n   */\r\n  public static constructAllXYRegionLoops(curvesAndRegions: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance): SignedLoops[] {\r\n    const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\r\n    const range = this.curveArrayRange(primitives);\r\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\r\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\r\n  }\r\n\r\n  /**\r\n   * Collect all `CurvePrimitives` in loosely typed input.\r\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\r\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\r\n   * @param candidates input curves\r\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\r\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If false, push the [[CurveChainWithDistanceIndex]] instead.\r\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false, push the [[LineString3d]] instead.\r\n   */\r\n  public static collectCurvePrimitives(candidates: AnyCurve | AnyCurve[], collectorArray?: CurvePrimitive[],\r\n    smallestPossiblePrimitives: boolean = false,\r\n    explodeLinestrings: boolean = false): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    if (candidates instanceof CurvePrimitive) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (candidates instanceof CurveCollection) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (Array.isArray(candidates)) {\r\n      for (const c of candidates) {\r\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n    return results;\r\n  }\r\n  /**\r\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed instances of [[LineSegment3d]].\r\n   * @param candidates input curves\r\n   * @return copied (captured) inputs except for the linestrings, which are exploded\r\n   */\r\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    for (const c of candidates) {\r\n      if (c instanceof LineString3d) {\r\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\r\n          const q = c.getIndexedSegment(i);\r\n          if (q !== undefined)\r\n            result.push(q);\r\n        }\r\n      } else {\r\n        result.push(c);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the overall range of given curves.\r\n   * @param data candidate curves\r\n   * @param worldToLocal transform to apply to data before computing its range\r\n   */\r\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\r\n    const range = Range3d.create();\r\n    if (data instanceof GeometryQuery)\r\n      data.extendRange(range, worldToLocal);\r\n    else if (Array.isArray(data)) {\r\n      for (const c of data) {\r\n        if (c instanceof GeometryQuery)\r\n          c.extendRange(range, worldToLocal);\r\n        else if (c instanceof Point3d)\r\n          range.extendPoint(c, worldToLocal);\r\n        else if (c instanceof GrowableXYZArray)\r\n          range.extendRange(c.getRange(worldToLocal));\r\n        else if (Array.isArray(c))\r\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n}\r\n\r\n/** @internal */\r\nfunction pushToInOnOutArrays(curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[]) {\r\n  if (select > 0)\r\n    arrayPositive.push(curve);\r\n  else if (select < 0)\r\n    arrayNegative.push(curve);\r\n  else\r\n    array0.push(curve);\r\n}\r\n"]}
+{"version":3,"file":"RegionOps.js","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,0BAA0B,EAAE,MAAM,+CAA+C,CAAC;AAC3F,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,OAAO,EAA2B,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC1E,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAqD,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAE5G,OAAO,EAAE,WAAW,EAA6C,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACxH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,OAAO,EAAE,wBAAwB,EAAE,MAAM,yCAAyC,CAAC;AACnF,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAe,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAgB,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,yCAAyC,EAAE,MAAM,8CAA8C,CAAC;AACzG,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,yBAAyB,EAAE,MAAM,iCAAiC,CAAC;AACrH,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAmB5C;;;GAGG;AACH,MAAM,CAAN,IAAY,kBAMX;AAND,WAAY,kBAAkB;IAC5B,6DAAS,CAAA;IACT,+DAAU,CAAA;IACV,2EAAgB,CAAA;IAChB,iEAAW,CAAA;IACX,iEAAW,CAAA;AACb,CAAC,EANW,kBAAkB,KAAlB,kBAAkB,QAM7B;AAED;;;;;;;;;;GAUG;AACH,MAAM,OAAO,SAAS;IACpB;;;;;OAKG;IACI,MAAM,CAAC,oBAAoB,CAAC,IAAe;QAChD,MAAM,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,UAAU,EAAE;YAChC,MAAM,CAAC,kCAAkC,EAAE,CAAC;YAC5C,OAAO,MAAM,CAAC;SACf;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;MAIE;IACK,MAAM,CAAC,sBAAsB,CAAC,KAAc,EAAE,oBAA4B,QAAQ,CAAC,mBAAmB;QAC3G,+GAA+G;QAC/G,MAAM,WAAW,GAAG,GAAG,GAAG,iBAAiB,CAAC;QAC5C,OAAO,WAAW,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,GAAG,WAAW,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,IAAe;QACzC,MAAM,OAAO,GAAG,IAAI,eAAe,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,MAAM,YAAY,UAAU,EAAE;YAChC,OAAO,MAAM,CAAC,WAAW,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,wBAAwB,CAAC,IAAc;QACnD,MAAM,OAAO,GAAG,IAAI,mBAAmB,EAAE,CAAC;QAC1C,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;QAClC,MAAM,CAAC,kCAAkC,EAAE,CAAC;QAC5C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAC3B,KAAoB,EACpB,IAAgC,EAChC,oBAAoE;QAEpE,IAAI,IAAI,YAAY,IAAI,EAAE;YACxB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACvC,IAAI,MAAM;gBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;SAC7D;aAAM,IAAI,IAAI,YAAY,YAAY,EAAE;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,MAAM;oBACR,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,oBAAoB,CAAC,CAAC;aAC7D;SACF;aAAM,IAAI,IAAI,YAAY,oBAAoB,EAAE;YAC/C,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,QAAQ,KAAK,SAAS;gBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;SACzC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACnB,IAAI,OAAO,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA6B,CAAC,CAAC;oBACxG,IAAI,QAAQ,KAAK,SAAS;wBACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;iBAEzC;qBAAM,IAAI,IAAI,CAAC,CAAC,CAAC,YAAY,oBAAoB,EAAE;oBAClD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;wBACvB,MAAM,QAAQ,GAAG,YAAY,CAAC,mCAAmC,CAAC,KAAK,EAAE,IAA4B,CAAC,CAAC;wBACvG,IAAI,QAAQ,KAAK,SAAS;4BACxB,oBAAoB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;qBACzC;iBACF;qBAAM;oBACL,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;wBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;4BACtB,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,KAAmC,EAAE,oBAAoB,CAAC,CAAC;qBAC1F;iBACF;aACF;SACF;IACH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CACtC,KAAoB,EAAE,IAAgC,EAAE,IAAkB,EAAE,OAAY;QAExF,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAqB,EAAE,IAAc,EAAE,EAAE;YAC1E,IAAI,IAAI,EAAE;gBACR,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACrB,IAAI,CAAC,2BAA2B,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;aACvD;QACH,CAAC,CAAC,CAAC;QACH,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YACtB,OAAO,SAAS,CAAC;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAgC,EAAE,WAAoB;QACzF,IAAI,KAAK,EAAE;YACT,IAAI,WAAW,EAAE;gBACf,YAAY,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;gBACpD,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACnC;YACD,OAAO,eAAe,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;SAC/C;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CACjD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,iCAAiC,CAC7C,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,EAC5C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sCAAsC,CAClD,MAAkC,EAAE,MAAkC,EAAE,cAAuB,KAAK;QAEpG,MAAM,KAAK,GAAG,yBAAyB,CAAC,gBAAgB,CACtD,MAAM,EACN,MAAM,EACN,CAAC,GAAY,EAAE,GAAY,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAC7C,IAAI,CAAC,wBAAwB,CAC9B,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,MAA2C,EAC3C,MAA2C,EAC3C,SAA6B,EAC7B,iBAAyB,QAAQ,CAAC,mBAAmB;QAErD,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,oBAAoB,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,EAAE,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAC9F,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,6BAA6B,CAAC,cAAc,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,cAAc,CAAC,CAAC;QACnE,OAAO,CAAC,sBAAsB,CAC5B,SAAS,EACT,CAAC,MAAqB,EAAE,IAAc,EAAE,QAAoB,EAAE,IAAY,EAAE,EAAE;YAC5E,kFAAkF;YAClF,IAAI,IAAI,CAAC,oBAAoB,EAAE,GAAG,CAAC;gBACjC,OAAO;YACT,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAC1B,OAAO;YACT,IAAI,QAAQ,KAAK,CAAC,EAAE;gBAClB,MAAM,IAAI,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACtD,IAAI,IAAI;oBACN,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aAC5B;QACH,CAAC,CACF,CAAC;QACF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,0BAA0B,CACtC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC,EACpC,cAAuB,KAAK;QAE5B,MAAM,KAAK,GAAG,yBAAyB,CAAC,qCAAqC,CAC3E,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAC/B,SAAS,EACT,MAAM,EAAE,iBAAiB,CAAC,KAAK,EAC/B,IAAI,CACL,CAAC;QACF,OAAO,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,uBAAuB,CACnC,MAAoC,EACpC,SAA6B,EAC7B,MAAoC;QAEpC,MAAM,KAAK,GAAG,yBAAyB,CAAC,qCAAqC,CAC3E,MAAM,EACN,iBAAiB,CAAC,KAAK,EACvB,SAAS,EACT,MAAM,EACN,iBAAiB,CAAC,KAAK,EACvB,IAAI,CACL,CAAC;QACF,IAAI,CAAC,KAAK;YACR,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,mBAAmB,CAAC,mCAAmC,CAAC,KAAK,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxG,MAAM,QAAQ,GAAW,EAAE,CAAC;QAC5B,KAAK,MAAM,SAAS,IAAI,SAAS,EAAE;YACjC,MAAM,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,SAAS;gBAC1B,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;YACrD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACrB;QACD,OAAO,SAAS,CAAC,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,4BAA4B,CACxC,MAAiB,EAAE,IAAa,EAAE,uBAA8C;QAEhF,MAAM,OAAO,GAAG,IAAI,wBAAwB,EAAE,CAAC;QAC/C,OAAO,OAAO,CAAC,4BAA4B,CAAC,MAAM,EAAE,IAAI,EAAE,uBAAuB,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAClC,MAAmB,EAAE,uBAA8D;QAEnF,MAAM,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QACpE,OAAO,QAAQ,CAAC,sBAAsB,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAiB,EAAE,CAAS,EAAE,CAAS;QAC5E,OAAO,mBAAmB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,2BAA2B,CACvC,MAAwB,EAAE,OAAgB,IAAI,EAAE,gCAAyC,KAAK;QAE9F,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,IAAI,IAAI;YACN,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC5B,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7F,IAAI,UAAqC,CAAC;QAC1C,IAAI,QAAQ,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE;YAC1C,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAClD,MAAM,GAAG,IAAI,CAAC;SACf;aAAM;YACL,UAAU,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,MAAM,IAAI,6BAA6B;YACzC,SAAS,CAAC,6BAA6B,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CAAC,CAA2B;QAC7D,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,uBAAuB,CACnC,WAAiC,EAAE,YAA6B;QAEhE,OAAO,iBAAiB,CAAC,uBAAuB,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAC9E,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,yBAAyB,CAAC,MAA4B,EAAE,UAAmB;QACvF,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,cAAc;YAClC,OAAO,MAAM,CAAC;QAChB,+BAA+B;QAC/B,MAAM,UAAU,GAAG,MAAM,CAAC,sBAAsB,EAAE,CAAC;QACnD,MAAM,cAAc,GAAG,IAAI,qBAAqB,CAAC,UAAU,CAAC,CAAC;QAC7D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,cAAc,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;SAClD;QACD,OAAO,cAAc,CAAC,UAAU,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAC1C,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAEnE,OAAO,QAAQ,CAAC,gCAAgC,CAAC,SAAS,EAAE,cAAc,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,QAAQ,CAAC,mBAAmB;QACpG,OAAO,QAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IACzD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CACvC,WAAiC,EAAE,MAAiB;QAEpD,MAAM,MAAM,GAAG,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;QAC1E,MAAM,0BAA0B,GAAG,SAAS,CAAC,uBAAuB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAC1F,MAAM,UAAU,GAAG,SAAS,CAAC,yBAAyB,CAAC,0BAA0B,EAAE,IAAI,CAAC,CAAC;QACzF,IAAI,UAAU,YAAY,eAAe,EAAE;YACzC,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,QAAQ,EAAE;gBACvC,MAAM,YAAY,GAAG,eAAe,CAAC,4CAA4C,CAAC,KAAK,CAAC,CAAC;gBACzF,IAAI,YAAY,EAAE;oBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;oBACvG,mBAAmB,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;iBACtG;aACF;SACF;aAAM,IAAI,UAAU,YAAY,cAAc,EAAE;YAC/C,MAAM,YAAY,GAAG,eAAe,CAAC,4CAA4C,CAAC,UAAU,CAAC,CAAC;YAC9F,IAAI,YAAY,EAAE;gBAChB,MAAM,OAAO,GAAG,SAAS,CAAC,wBAAwB,CAAC,MAAM,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACvG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;aAC3G;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,sBAAsB,CAClC,IAAiD,EAAE,sBAA+B,IAAI;QAEtF,IAAI,IAAI,YAAY,YAAY,EAAE;YAChC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACvD;aAAM,IAAI,IAAI,YAAY,oBAAoB,EAAE;YAC/C,IAAI,SAAS,CAAC;YACd,IAAI,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBAC5C,IAAI,CAAC,QAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;oBACjE,OAAO,SAAS,CAAC;gBACnB,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;gBACpD,SAAS,GAAG,IAAI,CAAC;aAClB;iBAAM,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACtD,OAAO,SAAS,CAAC;aAClB;iBAAM;gBACL,SAAS,GAAG,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC1C,0BAA0B,CAAC,gCAAgC,CAAC,SAAS,EAAE,QAAQ,CAAC,mBAAmB,CAAC,CAAC;gBACrG,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClD,OAAO,SAAS,CAAC;aACpB;YACD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,SAAS,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YACnD,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,YAAY,CAAC,gBAAgB,EAAE;mBAC9B,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;mBAChC,QAAQ,CAAC,iBAAiB,CAAC,QAAQ,CAAC,EAAE;gBACzC,OAAO,SAAS,CAAC,4BAA4B,CAC3C,SAAS,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,YAAY,CAC/E,CAAC;aACH;SACF;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,mBAAmB,CAAC,IAAI,CAAC,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;SACzE;aAAM,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,YAAY,EAAE;YACzG,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE,mBAAmB,CAAC,CAAC;SACxF;aAAM,IAAI,IAAI,YAAY,UAAU,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,2BAA2B,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxC,IAAI,OAAO,EAAE;oBACX,OAAO,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;iBAC7C;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAuB,EAAE,OAAmD;QAE5E,MAAM,OAAO,GAAG,IAAI,yCAAyC,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,uBAAuB,CAAC,KAAyC;QAC7E,MAAM,WAAW,GAAsB,EAAE,CAAC;QAC1C,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE;YAC7B,IAAI,SAAS,YAAY,IAAI;gBAC3B,eAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;iBAC9C,IAAI,SAAS,YAAY,oBAAoB,EAAE;gBAClD,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;gBAC3C,eAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;aAC7C;SACF;QACD,OAAO,eAAe,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;IACtD,CAAC;IACD;;;;;;;;;;;;;;;;;;OAkBG;IACI,MAAM,CAAC,yBAAyB,CACrC,gBAAuC,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAEzF,MAAM,UAAU,GAAG,SAAS,CAAC,sBAAsB,CAAC,gBAAgB,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAC1F,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QAC5F,OAAO,iBAAiB,CAAC,oCAAoC,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAChF,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,sBAAsB,CAClC,UAAiC,EACjC,cAAiC,EACjC,6BAAsC,KAAK,EAC3C,qBAA8B,KAAK;QAEnC,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,UAAU,YAAY,cAAc,EAAE;YACxC,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,UAAU,YAAY,eAAe,EAAE;YAChD,UAAU,CAAC,sBAAsB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;SAC5F;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;YACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;gBAC1B,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aACzF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,UAA4B;QAC1D,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE;YAC1B,IAAI,CAAC,YAAY,YAAY,EAAE;gBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAClD,MAAM,CAAC,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,CAAC,KAAK,SAAS;wBACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;iBAClB;aACF;iBAAM;gBACL,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aAChB;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe,CAAC,IAAS,EAAE,YAAwB;QAC/D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,IAAI,YAAY,aAAa;YAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;aACnC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE;gBACpB,IAAI,CAAC,YAAY,aAAa;oBAC5B,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,OAAO;oBAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;qBAChC,IAAI,CAAC,YAAY,gBAAgB;oBACpC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;qBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;oBACvB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD,gBAAgB;AAChB,SAAS,mBAAmB,CAC1B,KAAe,EAAE,MAAc,EAAE,aAAyB,EAAE,MAAkB,EAAE,aAAyB;IAEzG,IAAI,MAAM,GAAG,CAAC;QACZ,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACvB,IAAI,MAAM,GAAG,CAAC;QACjB,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;QAE1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACvB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3dArrayCarrier } from \"../geometry3d/Point3dArrayCarrier\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"../geometry3d/PolylineCompressionByEdgeOffset\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { SortablePolygon } from \"../geometry3d/SortablePolygon\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { MomentData } from \"../geometry4d/MomentData\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { PolyfaceBuilder } from \"../polyface/PolyfaceBuilder\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { LineStringDataVariant, MultiLineStringDataVariant, Triangulator } from \"../topology/Triangulation\";\r\nimport { AnyCurve, AnyRegion } from \"./CurveChain\";\r\nimport { BagOfCurves, ConsolidateAdjacentCurvePrimitivesOptions, CurveChain, CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurveOps } from \"./CurveOps\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { CurveWireMomentsXYZ } from \"./CurveWireMomentsXYZ\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { ChainCollectorContext } from \"./internalContexts/ChainCollectorContext\";\r\nimport { PolygonWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop, SignedLoops } from \"./Loop\";\r\nimport { JointOptions, OffsetOptions } from \"./OffsetOptions\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { Path } from \"./Path\";\r\nimport { ConsolidateAdjacentCurvePrimitivesContext } from \"./Query/ConsolidateAdjacentPrimitivesContext\";\r\nimport { CurveSplitContext } from \"./Query/CurveSplitContext\";\r\nimport { PointInOnOutContext } from \"./Query/InOutTests\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { RegionMomentsXY } from \"./RegionMomentsXY\";\r\nimport { RegionBooleanContext, RegionGroupOpType, RegionOpsFaceToFaceSearch } from \"./RegionOpsClassificationSweeps\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * Possible return types from [[splitToPathsBetweenBreaks]], [[collectInsideAndOutsideOffsets]] and\r\n * [[collectChains]].\r\n * @public\r\n */\r\nexport type ChainTypes = CurvePrimitive | Path | BagOfCurves | Loop | undefined;\r\n\r\n/**\r\n * * `properties` is a string with special characters indicating\r\n *   * \"U\" -- contains unmerged stick data\r\n *   * \"M\" -- merged\r\n *   * \"R\" -- regularized\r\n *   * \"X\" -- has exterior markup\r\n * @internal\r\n */\r\nexport type GraphCheckPointFunction = (name: string, graph: HalfEdgeGraph, properties: string, extraData?: any) => any;\r\n\r\n/**\r\n * Enumeration of the binary operation types for a booleans among regions\r\n * @public\r\n */\r\nexport enum RegionBinaryOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  AMinusB = 3,\r\n  BMinusA = 4,\r\n}\r\n\r\n/**\r\n * Class `RegionOps` has static members for calculations on regions (areas).\r\n * * Regions are represented by these `CurveCollection` subclasses:\r\n *   * `Loop` -- a single loop\r\n *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.\r\n * The common \"One outer loop and many Inner loops\" is a parity region.\r\n *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.\r\n * * **NOTE:** Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has\r\n * been rotated parallel to the xy-plane.\r\n * @public\r\n */\r\nexport class RegionOps {\r\n  /**\r\n   * Return moment sums for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYAreaMoments(root: AnyRegion): MomentData | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      result.shiftOriginAndSumsToCentroidOfSums();\r\n      return result;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return an area tolerance for a given xy-range and optional distance tolerance.\r\n   * @param range range of planar region to tolerance\r\n   * @param distanceTolerance optional absolute distance tolerance\r\n  */\r\n  public static computeXYAreaTolerance(range: Range3d, distanceTolerance: number = Geometry.smallMetricDistance): number {\r\n    // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).\r\n    const halfDistTol = 0.5 * distanceTolerance;\r\n    return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);\r\n  }\r\n  /**\r\n   * Return an xy area for a loop, parity region, or union region.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any Loop, ParityRegion, or UnionRegion.\r\n   */\r\n  public static computeXYArea(root: AnyRegion): number | undefined {\r\n    const handler = new RegionMomentsXY();\r\n    const result = root.dispatchToGeometryHandler(handler);\r\n    if (result instanceof MomentData) {\r\n      return result.quantitySum;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return MomentData with the sums of wire moments.\r\n   * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with\r\n   *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`\r\n   * @param root any CurveCollection or CurvePrimitive.\r\n   */\r\n  public static computeXYZWireMomentSums(root: AnyCurve): MomentData | undefined {\r\n    const handler = new CurveWireMomentsXYZ();\r\n    handler.visitLeaves(root);\r\n    const result = handler.momentData;\r\n    result.shiftOriginAndSumsToCentroidOfSums();\r\n    return result;\r\n  }\r\n  /**\r\n   * Create loops in the graph.\r\n   * @internal\r\n   */\r\n  public static addLoopsToGraph(\r\n    graph: HalfEdgeGraph,\r\n    data: MultiLineStringDataVariant,\r\n    announceIsolatedLoop: (graph: HalfEdgeGraph, seed: HalfEdge) => void,\r\n  ): void {\r\n    if (data instanceof Loop) {\r\n      const points = data.getPackedStrokes();\r\n      if (points)\r\n        this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n    } else if (data instanceof ParityRegion) {\r\n      for (const child of data.children) {\r\n        const points = child.getPackedStrokes();\r\n        if (points)\r\n          this.addLoopsToGraph(graph, points, announceIsolatedLoop);\r\n      }\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data);\r\n      if (loopSeed !== undefined)\r\n        announceIsolatedLoop(graph, loopSeed);\r\n    } else if (Array.isArray(data)) {\r\n      if (data.length > 0) {\r\n        if (Point3d.isAnyImmediatePointType(data[0])) {\r\n          const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, data as LineStringDataVariant);\r\n          if (loopSeed !== undefined)\r\n            announceIsolatedLoop(graph, loopSeed);\r\n\r\n        } else if (data[0] instanceof IndexedXYZCollection) {\r\n          for (const loop of data) {\r\n            const loopSeed = Triangulator.directCreateFaceLoopFromCoordinates(graph, loop as IndexedXYZCollection);\r\n            if (loopSeed !== undefined)\r\n              announceIsolatedLoop(graph, loopSeed);\r\n          }\r\n        } else {\r\n          for (const child of data) {\r\n            if (Array.isArray(child))\r\n              this.addLoopsToGraph(graph, child as MultiLineStringDataVariant, announceIsolatedLoop);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Add multiple loops to a graph.\r\n   * * Apply edgeTag and mask to each edge.\r\n   * @internal\r\n   */\r\n  public static addLoopsWithEdgeTagToGraph(\r\n    graph: HalfEdgeGraph, data: MultiLineStringDataVariant, mask: HalfEdgeMask, edgeTag: any,\r\n  ): HalfEdge[] | undefined {\r\n    const loopSeeds: HalfEdge[] = [];\r\n    this.addLoopsToGraph(graph, data, (_graph: HalfEdgeGraph, seed: HalfEdge) => {\r\n      if (seed) {\r\n        loopSeeds.push(seed);\r\n        seed.setMaskAndEdgeTagAroundFace(mask, edgeTag, true);\r\n      }\r\n    });\r\n    if (loopSeeds.length > 0)\r\n      return loopSeeds;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Given a graph just produced by booleans, convert to a polyface\r\n   * * \"just produced\" implies exterior face markup.\r\n   * @param graph\r\n   * @param triangulate\r\n   */\r\n  private static finishGraphToPolyface(graph: HalfEdgeGraph | undefined, triangulate: boolean): Polyface | undefined {\r\n    if (graph) {\r\n      if (triangulate) {\r\n        Triangulator.triangulateAllPositiveAreaFaces(graph);\r\n        Triangulator.flipTriangles(graph);\r\n      }\r\n      return PolyfaceBuilder.graphToPolyface(graph);\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a polyface containing the area intersection of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaIntersectLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area union of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaUnionLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA || inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return a polyface containing the area difference of two XY regions.\r\n   * * Within each region, in and out is determined by parity rules.\r\n   *   * Any face that is an odd number of crossings from the far outside is IN\r\n   *   * Any face that is an even number of crossings from the far outside is OUT\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonXYAreaDifferenceLoopsToPolyface(\r\n    loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doPolygonBoolean(\r\n      loopsA,\r\n      loopsB,\r\n      (inA: boolean, inB: boolean) => (inA && !inB),\r\n      this._graphCheckPointFunction,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return areas defined by a boolean operation.\r\n   * * If there are multiple regions in loopsA, they are treated as a union.\r\n   * * If there are multiple regions in loopsB, they are treated as a union.\r\n   * @param loopsA first set of loops\r\n   * @param loopsB second set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added\r\n   * to connect interior loops to exterior loops.\r\n   */\r\n  public static regionBooleanXY(\r\n    loopsA: AnyRegion | AnyRegion[] | undefined,\r\n    loopsB: AnyRegion | AnyRegion[] | undefined,\r\n    operation: RegionBinaryOpType,\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): AnyRegion | undefined {\r\n    const result = UnionRegion.create();\r\n    const context = RegionBooleanContext.create(RegionGroupOpType.Union, RegionGroupOpType.Union);\r\n    context.addMembers(loopsA, loopsB);\r\n    context.annotateAndMergeCurvesInGraph(mergeTolerance);\r\n    const range = context.groupA.range().union(context.groupB.range());\r\n    const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);\r\n    context.runClassificationSweep(\r\n      operation,\r\n      (_graph: HalfEdgeGraph, face: HalfEdge, faceType: -1 | 0 | 1, area: number) => {\r\n        // ignore danglers and null faces, but not 2-edge \"banana\" faces with nonzero area\r\n        if (face.countEdgesAroundFace() < 2)\r\n          return;\r\n        if (Math.abs(area) < areaTol)\r\n          return;\r\n        if (faceType === 1) {\r\n          const loop = PlanarSubdivision.createLoopInFace(face);\r\n          if (loop)\r\n            result.tryAddChild(loop);\r\n        }\r\n      },\r\n    );\r\n    return result;\r\n  }\r\n  /**\r\n   * Return a polyface whose facets are a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   * @param triangulate whether to triangulate the result\r\n   */\r\n  public static polygonBooleanXYToPolyface(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[],\r\n    triangulate: boolean = false,\r\n  ): Polyface | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA, RegionGroupOpType.Union,\r\n      operation,\r\n      inputB, RegionGroupOpType.Union,\r\n      true,\r\n    );\r\n    return this.finishGraphToPolyface(graph, triangulate);\r\n  }\r\n  /**\r\n   * Return loops of linestrings around areas of a boolean operation between the input regions.\r\n   * * Each of the two inputs is an array of multiple loops or parity regions.\r\n   *   * Within each of these input arrays, the various entries (loop or set of loops) are interpreted as a union.\r\n   * * In each \"array of loops and parity regions\", each entry inputA[i] or inputB[i] is one of:\r\n   *    * A simple loop, e.g. array of Point3d.\r\n   *    * Several simple loops, each of which is an array of Point3d.\r\n   * @param inputA first set of loops\r\n   * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA\r\n   * @param inputB second set of loops\r\n   */\r\n  public static polygonBooleanXYToLoops(\r\n    inputA: MultiLineStringDataVariant[],\r\n    operation: RegionBinaryOpType,\r\n    inputB: MultiLineStringDataVariant[],\r\n  ): AnyRegion | undefined {\r\n    const graph = RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(\r\n      inputA,\r\n      RegionGroupOpType.Union,\r\n      operation,\r\n      inputB,\r\n      RegionGroupOpType.Union,\r\n      true,\r\n    );\r\n    if (!graph)\r\n      return undefined;\r\n    const loopEdges = HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, HalfEdgeMask.EXTERIOR);\r\n    const allLoops: Loop[] = [];\r\n    for (const graphLoop of loopEdges) {\r\n      const points = new GrowableXYZArray();\r\n      for (const edge of graphLoop)\r\n        points.pushXYZ(edge.x, edge.y, edge.z);\r\n      points.pushWrap(1);\r\n      const loop = Loop.create();\r\n      loop.tryAddChild(LineString3d.createCapture(points));\r\n      allLoops.push(loop);\r\n    }\r\n    return RegionOps.sortOuterAndHoleLoopsXY(allLoops);\r\n  }\r\n  /**\r\n   * Construct a wire that is offset from the given polyline or polygon.\r\n   * * This is a simple wire offset, not an area offset.\r\n   * * Since z-coordinates are ignored, for best results the input points should lie in (a plane parallel to)\r\n   * the xy-plane.\r\n   * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not\r\n   * guarantee a simple area offset.\r\n   * @param points a single loop or path\r\n   * @param wrap true to include wraparound\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or JointOptions\r\n   * object.\r\n   */\r\n  public static constructPolygonWireXYOffset(\r\n    points: Point3d[], wrap: boolean, offsetDistanceOrOptions: number | JointOptions,\r\n  ): CurveChain | undefined {\r\n    const context = new PolygonWireOffsetContext();\r\n    return context.constructPolygonWireXYOffset(points, wrap, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will\r\n   * not detect self intersection among widely separated edges.\r\n   * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/Offset\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(\r\n    curves: Path | Loop, offsetDistanceOrOptions: number | JointOptions | OffsetOptions,\r\n  ): CurveCollection | undefined {\r\n    const offsetOptions = OffsetOptions.create(offsetDistanceOrOptions);\r\n    return CurveOps.constructCurveXYOffset(curves, offsetOptions);\r\n  }\r\n  /**\r\n   * Test if point (x,y) is IN, OUT or ON a region.\r\n   * @return (1) for in, (-1) for OUT, (0) for ON\r\n   * @param curves input region\r\n   * @param x x coordinate of point to test\r\n   * @param y y coordinate of point to test\r\n   */\r\n  public static testPointInOnOutRegionXY(curves: AnyRegion, x: number, y: number): number {\r\n    return PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);\r\n  }\r\n  /**\r\n   * Create curve collection of subtype determined by gaps between the input curves.\r\n   * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.\r\n   * * If all curves connect head-to-tail except for closure, return a `Path`.\r\n   * * If there are internal gaps, return a `BagOfCurves`\r\n   * * If input array has zero length, return undefined.\r\n   * @param curves input curves\r\n   * @param wrap whether to create a Loop (true) or Path (false) if maximum gap is minimal\r\n   * @param consolidateAdjacentPrimitives whether to simplify the result by calling [[consolidateAdjacentPrimitives]]\r\n   */\r\n  public static createLoopPathOrBagOfCurves(\r\n    curves: CurvePrimitive[], wrap: boolean = true, consolidateAdjacentPrimitives: boolean = false,\r\n  ): CurveCollection | undefined {\r\n    const n = curves.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    let maxGap = 0.0;\r\n    let isPath = false;\r\n    if (wrap)\r\n      maxGap = Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));\r\n    for (let i = 0; i + 1 < n; i++)\r\n      maxGap = Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));\r\n    let collection: Loop | Path | BagOfCurves;\r\n    if (Geometry.isSmallMetricDistance(maxGap)) {\r\n      collection = wrap ? Loop.create() : Path.create();\r\n      isPath = true;\r\n    } else {\r\n      collection = BagOfCurves.create();\r\n    }\r\n    for (const c of curves)\r\n      collection.tryAddChild(c);\r\n    if (isPath && consolidateAdjacentPrimitives)\r\n      RegionOps.consolidateAdjacentPrimitives(collection);\r\n    return collection;\r\n  }\r\n  private static _graphCheckPointFunction?: GraphCheckPointFunction;\r\n  /**\r\n   * Announce Checkpoint function for use during booleans\r\n   * @internal\r\n   */\r\n  public static setCheckPointFunction(f?: GraphCheckPointFunction) {\r\n    this._graphCheckPointFunction = f;\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.\r\n   * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:\r\n   *    * if it is never cut by any `cutter` curve, it will be left unchanged.\r\n   *    * if cut, the input is downgraded to a set of `Path` curves joining at the cut points.\r\n   * * All cutting is \"as viewed in the xy plane\"\r\n   * @param curvesToCut input curves to be fragmented at intersections with `cutterCurves`\r\n   * @param cutterCurves input curves to intersect with `curvesToCut`\r\n   */\r\n  public static cloneCurvesWithXYSplits(\r\n    curvesToCut: AnyCurve | undefined, cutterCurves: CurveCollection,\r\n  ): AnyCurve | undefined {\r\n    return CurveSplitContext.cloneCurvesWithXYSplits(curvesToCut, cutterCurves);\r\n  }\r\n  /**\r\n   * Create paths assembled from many curves.\r\n   * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by\r\n   * [[cloneCurvesWithXYSplits]].\r\n   * * Return simplest form -- single primitive, single path, or bag of curves.\r\n   */\r\n  public static splitToPathsBetweenBreaks(source: AnyCurve | undefined, makeClones: boolean): ChainTypes {\r\n    if (source === undefined)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive)\r\n      return source;\r\n    // source is a collection .  ..\r\n    const primitives = source.collectCurvePrimitives();\r\n    const chainCollector = new ChainCollectorContext(makeClones);\r\n    for (const primitive of primitives) {\r\n      chainCollector.announceCurvePrimitive(primitive);\r\n    }\r\n    return chainCollector.grabResult();\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideOffsets(\r\n    fragments: AnyCurve[], offsetDistance: number, gapTolerance: number,\r\n  ): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains: ChainTypes } {\r\n    return CurveOps.collectInsideAndOutsideXYOffsets(fragments, offsetDistance, gapTolerance);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    return CurveOps.collectChains(fragments, gapTolerance);\r\n  }\r\n  /**\r\n   * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments\r\n   * of `curvesToCut`.\r\n   * * Break `curvesToCut` into parts inside, outside, and coincident.\r\n   * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`\r\n   */\r\n  public static splitPathsByRegionInOnOutXY(\r\n    curvesToCut: AnyCurve | undefined, region: AnyRegion,\r\n  ): { insideParts: AnyCurve[], outsideParts: AnyCurve[], coincidentParts: AnyCurve[] } {\r\n    const result = { insideParts: [], outsideParts: [], coincidentParts: [] };\r\n    const pathWithIntersectionMarkup = RegionOps.cloneCurvesWithXYSplits(curvesToCut, region);\r\n    const splitPaths = RegionOps.splitToPathsBetweenBreaks(pathWithIntersectionMarkup, true);\r\n    if (splitPaths instanceof CurveCollection) {\r\n      for (const child of splitPaths.children) {\r\n        const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(child);\r\n        if (pointOnChild) {\r\n          const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n          pushToInOnOutArrays(child, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n        }\r\n      }\r\n    } else if (splitPaths instanceof CurvePrimitive) {\r\n      const pointOnChild = CurveCollection.createCurveLocationDetailOnAnyCurvePrimitive(splitPaths);\r\n      if (pointOnChild) {\r\n        const inOnOut = RegionOps.testPointInOnOutRegionXY(region, pointOnChild.point.x, pointOnChild.point.y);\r\n        pushToInOnOutArrays(splitPaths, inOnOut, result.outsideParts, result.coincidentParts, result.insideParts);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * If `data` is one of several forms of a rectangle, return its edge Transform.\r\n   * * Points are considered a rectangle if, within the first 4 points:\r\n   *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product\r\n   *     * vectors from 0 to 3 and 1 to 2 are the same\r\n   * @param data points in one of several formats:\r\n   *   * LineString\r\n   *   * Loop containing rectangle content\r\n   *   * Path containing rectangle content\r\n   *   * Array of Point3d[]\r\n   *   * IndexedXYZCollection\r\n   * @param requireClosurePoint whether to require a 5th point equal to the 1st point.\r\n   * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit\r\n   * normal in z column. If not a rectangle, return undefined.\r\n   */\r\n  public static rectangleEdgeTransform(\r\n    data: AnyCurve | Point3d[] | IndexedXYZCollection, requireClosurePoint: boolean = true,\r\n  ): Transform | undefined {\r\n    if (data instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.packedPoints);\r\n    } else if (data instanceof IndexedXYZCollection) {\r\n      let dataToUse;\r\n      if (requireClosurePoint && data.length === 5) {\r\n        if (!Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)!))\r\n          return undefined;\r\n        dataToUse = data;\r\n      } else if (!requireClosurePoint && data.length === 4) {\r\n        dataToUse = data;\r\n      } else if (data.length < (requireClosurePoint ? 5 : 4)) {\r\n        return undefined;\r\n      } else {\r\n        dataToUse = GrowableXYZArray.create(data);\r\n        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, Geometry.smallMetricDistance);\r\n        if (dataToUse.length < (requireClosurePoint ? 5 : 4))\r\n          return undefined;\r\n      }\r\n      const vector01 = dataToUse.vectorIndexIndex(0, 1)!;\r\n      const vector03 = dataToUse.vectorIndexIndex(0, 3)!;\r\n      const vector12 = dataToUse.vectorIndexIndex(1, 2)!;\r\n      const normalVector = vector01.crossProduct(vector03);\r\n      if (normalVector.normalizeInPlace()\r\n        && vector12.isAlmostEqual(vector03)\r\n        && vector01.isPerpendicularTo(vector03)) {\r\n        return Transform.createOriginAndMatrixColumns(\r\n          dataToUse.getPoint3dAtUncheckedPointIndex(0), vector01, vector03, normalVector,\r\n        );\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      return this.rectangleEdgeTransform(new Point3dArrayCarrier(data), requireClosurePoint);\r\n    } else if (data instanceof Loop && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, true);\r\n    } else if (data instanceof Path && data.children.length === 1 && data.children[0] instanceof LineString3d) {\r\n      return this.rectangleEdgeTransform(data.children[0].packedPoints, requireClosurePoint);\r\n    } else if (data instanceof CurveChain) {\r\n      if (!data.checkForNonLinearPrimitives()) {\r\n        // const linestring = LineString3d.create();\r\n        const strokes = data.getPackedStrokes();\r\n        if (strokes) {\r\n          return this.rectangleEdgeTransform(strokes);\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Look for and simplify:\r\n   * * Contiguous `LineSegment3d` and `LineString3d` objects.\r\n   *   * collect all points\r\n   *   * eliminate duplicated points\r\n   *   * eliminate points colinear with surrounding points\r\n   *   * contiguous concentric circular or elliptic arcs\r\n   *   * combine angular ranges\r\n   * * This function can be used to compress adjacent LineSegment3ds into a LineString3d\r\n   * @param curves Path or loop (or larger collection containing paths and loops) to be simplified\r\n   * @param options options for tolerance and selective simplification.\r\n   */\r\n  public static consolidateAdjacentPrimitives(\r\n    curves: CurveCollection, options?: ConsolidateAdjacentCurvePrimitivesOptions,\r\n  ): void {\r\n    const context = new ConsolidateAdjacentCurvePrimitivesContext(options);\r\n    curves.dispatchToGeometryHandler(context);\r\n  }\r\n  /**\r\n   * Reverse and reorder loops in the xy-plane for consistency and containment.\r\n   * @param loops multiple loops in any order and orientation, z-coordinates ignored\r\n   * @returns a region that captures the input pointers. This region is a:\r\n   * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.\r\n   * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.\r\n   * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented\r\n   * clockwise.\r\n   * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in\r\n   * the above cases.\r\n   * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]\r\n   */\r\n  public static sortOuterAndHoleLoopsXY(loops: Array<Loop | IndexedXYZCollection>): AnyRegion {\r\n    const loopAndArea: SortablePolygon[] = [];\r\n    for (const candidate of loops) {\r\n      if (candidate instanceof Loop)\r\n        SortablePolygon.pushLoop(loopAndArea, candidate);\r\n      else if (candidate instanceof IndexedXYZCollection) {\r\n        const loop = Loop.createPolygon(candidate);\r\n        SortablePolygon.pushLoop(loopAndArea, loop);\r\n      }\r\n    }\r\n    return SortablePolygon.sortAsAnyRegion(loopAndArea);\r\n  }\r\n  /**\r\n   * Find all areas bounded by the unstructured, possibly intersecting curves.\r\n   * * A common use case of this method is to assemble the bounding \"exterior\" loop (or loops) containing the\r\n   * input curves.\r\n   * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,\r\n   * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]\r\n   * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same\r\n   * SignedLoops object.\r\n   * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve\r\n   * primitives.\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:\r\n   *    * `positiveAreaLoops` contains \"interior\" loops, _including holes in ParityRegion input_. These loops have\r\n   * positive area and counterclockwise orientation.\r\n   *    * `negativeAreaLoops` contains (probably just one) \"exterior\" loop which is ordered clockwise.\r\n   *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.\r\n   *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent\r\n   * to the edge and a constituent curve in each.\r\n   */\r\n  public static constructAllXYRegionLoops(\r\n    curvesAndRegions: AnyCurve | AnyCurve[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): SignedLoops[] {\r\n    const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);\r\n    const range = this.curveArrayRange(primitives);\r\n    const areaTol = this.computeXYAreaTolerance(range, tolerance);\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);\r\n    return PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);\r\n  }\r\n  /**\r\n   * Collect all `CurvePrimitives` in loosely typed input.\r\n   * * Always recurses into primitives within explicit collections (Path, Loop, ParityRegion, UnionRegion).\r\n   * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.\r\n   * @param candidates input curves\r\n   * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.\r\n   * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If\r\n   * false, push the [[CurveChainWithDistanceIndex]] instead.\r\n   * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,\r\n   * push the [[LineString3d]] instead.\r\n   */\r\n  public static collectCurvePrimitives(\r\n    candidates: AnyCurve | AnyCurve[],\r\n    collectorArray?: CurvePrimitive[],\r\n    smallestPossiblePrimitives: boolean = false,\r\n    explodeLinestrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    if (candidates instanceof CurvePrimitive) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (candidates instanceof CurveCollection) {\r\n      candidates.collectCurvePrimitives(results, smallestPossiblePrimitives, explodeLinestrings);\r\n    } else if (Array.isArray(candidates)) {\r\n      for (const c of candidates) {\r\n        this.collectCurvePrimitives(c, results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n    return results;\r\n  }\r\n  /**\r\n   * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed\r\n   * instances of [[LineSegment3d]].\r\n   * @param candidates input curves\r\n   * @return copied (captured) inputs except for the linestrings, which are exploded\r\n   */\r\n  public static expandLineStrings(candidates: CurvePrimitive[]): CurvePrimitive[] {\r\n    const result: CurvePrimitive[] = [];\r\n    for (const c of candidates) {\r\n      if (c instanceof LineString3d) {\r\n        for (let i = 0; i + 1 < c.packedPoints.length; i++) {\r\n          const q = c.getIndexedSegment(i);\r\n          if (q !== undefined)\r\n            result.push(q);\r\n        }\r\n      } else {\r\n        result.push(c);\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return the overall range of given curves.\r\n   * @param data candidate curves\r\n   * @param worldToLocal transform to apply to data before computing its range\r\n   */\r\n  public static curveArrayRange(data: any, worldToLocal?: Transform): Range3d {\r\n    const range = Range3d.create();\r\n    if (data instanceof GeometryQuery)\r\n      data.extendRange(range, worldToLocal);\r\n    else if (Array.isArray(data)) {\r\n      for (const c of data) {\r\n        if (c instanceof GeometryQuery)\r\n          c.extendRange(range, worldToLocal);\r\n        else if (c instanceof Point3d)\r\n          range.extendPoint(c, worldToLocal);\r\n        else if (c instanceof GrowableXYZArray)\r\n          range.extendRange(c.getRange(worldToLocal));\r\n        else if (Array.isArray(c))\r\n          range.extendRange(this.curveArrayRange(c, worldToLocal));\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n}\r\n/** @internal */\r\nfunction pushToInOnOutArrays(\r\n  curve: AnyCurve, select: number, arrayNegative: AnyCurve[], array0: AnyCurve[], arrayPositive: AnyCurve[],\r\n): void {\r\n  if (select > 0)\r\n    arrayPositive.push(curve);\r\n  else if (select < 0)\r\n    arrayNegative.push(curve);\r\n  else\r\n    array0.push(curve);\r\n}\r\n"]}

package/lib/esm/curve/RegionOpsClassificationSweeps.js

@@ -244,7 +244,7 @@ export class RegionOpsFaceToFaceSearch {
         const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;
         const callbacks = RegionBooleanContext.create(opA, opB);
         callbacks.graph = graph;
-        callbacks.faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;
+        callbacks.faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);
         // Add all the members in groupA ..
         for (const data of dataA) {
             if (data.length > 2) {
@@ -689,7 +689,7 @@ export class GraphComponent {
         }
         this.faceAreas.length = 0;
         if (!faceAreaFunction)
-            faceAreaFunction = HalfEdgeGraphSearch.signedFaceArea;
+            faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);
         for (const f of this.faces) {
             this.faceAreas.push(faceAreaFunction(f));
         }