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

package/lib/cjs/curve/internalContexts/MultiChainCollector.js

@@ -4,53 +4,51 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.OffsetHelpers = exports.MultiChainCollector = void 0;
+exports.MultiChainCollector = void 0;
 /** @packageDocumentation
  * @module Curve
  */
-const Arc3d_1 = require("../../curve/Arc3d");
-const CurveCollection_1 = require("../../curve/CurveCollection");
-const CurvePrimitive_1 = require("../../curve/CurvePrimitive");
-const GeometryQuery_1 = require("../../curve/GeometryQuery");
-const LineSegment3d_1 = require("../../curve/LineSegment3d");
-const LineString3d_1 = require("../../curve/LineString3d");
-const Loop_1 = require("../../curve/Loop");
-const Path_1 = require("../../curve/Path");
-const RegionOps_1 = require("../../curve/RegionOps");
 const Geometry_1 = require("../../Geometry");
-const CurveCurve_1 = require("../../curve/CurveCurve");
-const PolygonOffsetContext_1 = require("./PolygonOffsetContext");
 const FrameBuilder_1 = require("../../geometry3d/FrameBuilder");
+const Arc3d_1 = require("../Arc3d");
+const CurveCollection_1 = require("../CurveCollection");
+const CurveCurve_1 = require("../CurveCurve");
+const CurvePrimitive_1 = require("../CurvePrimitive");
+const LineSegment3d_1 = require("../LineSegment3d");
+const LineString3d_1 = require("../LineString3d");
+const Loop_1 = require("../Loop");
+const Path_1 = require("../Path");
+const RegionOps_1 = require("../RegionOps");
 /**
  * Manage a growing array of arrays of curve primitives that are to be joined "head to tail" in paths.
  * * The caller makes a sequence of calls to announce individual primitives.
- * * This collector (unlike the simpler "ChainCollector") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
- *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).
- * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.
+ * * This collector (unlike the simpler [[ChainCollectorContext]]) expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
+ * * When all curves have been announced, the call to `grabResults` restructures the various active chains into Paths (and optionally, Loops).
+ * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.
  * * Usage pattern is
- *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`
- *   * many times
- *       * `   context.captureCurve (anyCurve, searchAllPaths)`
- *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`
- *   * end:        ` result = context.grabResult (formLoopsIfClosed)`
+ *   * initialization: `context = new MultiChainCollector(gapTol, planeTol)`
+ *   * many times:
+ *       * `context.captureCurve(anyCurve)`
+ *       * `context.captureCurvePrimitive(primitive)`
+ *   * end: `result = context.grabResult(makeLoopIfClosed)`
  * @internal
  */
 class MultiChainCollector {
     /** Initialize with an empty array of chains.
-     * @param endPointShiftTolerance tolerance for calling endpoints identical
-     * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.
+     * @param gapTolerance tolerance for calling endpoints identical
+     * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
      */
-    constructor(endPointShiftTolerance = Geometry_1.Geometry.smallMetricDistance, planeTolerance = Geometry_1.Geometry.smallMetricDistance) {
+    constructor(gapTolerance = Geometry_1.Geometry.smallMetricDistance, planeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         this._chains = [];
-        this._endPointShiftTolerance = endPointShiftTolerance;
-        this._endPointHitTolerance = Geometry_1.Geometry.smallMetricDistance;
-        this._planarityTolerance = planeTolerance;
+        this._gapTolerance = gapTolerance;
+        this._snapTolerance = Geometry_1.Geometry.smallMetricDistance;
+        this._planeTolerance = planeTolerance;
     }
     /**
      * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
-     * @param xyz
-     * @param tolerance
-     * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.
+     * @param xyz endpoint to check
+     * @param tolerance absolute distance tolerance for equating endpoints
+     * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.
      */
     findAnyChainToConnect(xyz, tolerance, exceptChainIndex = -1) {
         for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {
@@ -70,21 +68,22 @@ class MultiChainCollector {
      * Insert a single curve primitive into the active chains.
      * * The primitive is captured (not cloned)
      * * The primitive may be reversed in place
-     * @param candidate
+     * @param candidate curve to add to the context
      */
     captureCurvePrimitive(candidate) {
-        if (this.attachPrimitiveToAnyChain(candidate, this._endPointHitTolerance))
-            return;
-        if (this.attachPrimitiveToAnyChain(candidate, this._endPointShiftTolerance))
+        if (this._snapTolerance < this._gapTolerance) {
+            if (this.attachPrimitiveToAnyChain(candidate, this._snapTolerance))
+                return;
+        }
+        if (this.attachPrimitiveToAnyChain(candidate, this._gapTolerance))
             return;
         this._chains.push([candidate]);
-        return;
     }
     /**
      * Insert any curve into the collection.
      * * This recurses into Path, Loop, BagOfCurves etc
-     * * The all primitives are captured, and may be reversed in place.
-     * @param candidate
+     * * All primitives are captured, and may be reversed in place.
+     * @param candidate curve to add to the context
      */
     captureCurve(candidate) {
         if (candidate instanceof CurvePrimitive_1.CurvePrimitive)
@@ -95,6 +94,65 @@ class MultiChainCollector {
             }
         }
     }
+    /** If allowed by the geometry type, move an endpoint. */
+    static simpleEndPointMove(curve, atEnd, to) {
+        if (curve instanceof (LineSegment3d_1.LineSegment3d)) {
+            if (atEnd) {
+                curve.point1Ref.setFrom(to);
+            }
+            else {
+                curve.point0Ref.setFrom(to);
+            }
+            return true;
+        }
+        else if (curve instanceof LineString3d_1.LineString3d && curve.numPoints() > 0) {
+            const i = atEnd ? curve.numPoints() - 1 : 0;
+            curve.packedPoints.setAtCheckedPointIndex(i, to);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * Try to move the end of curve0 and/or the start of curve1 to a common point.
+     * * All z-coordinates are ignored.
+     * @param curve0 first curve, assumed to end close to the start of curve1
+     * @param curve1 second curve, assumed to start close to the end of curve0
+     * @param gapTolerance max distance to move a curve start/end point
+     * @returns whether curve start/end point(s) moved
+     */
+    static moveHeadOrTail(curve0, curve1, gapTolerance) {
+        const xyz0 = curve0.endPoint();
+        const xyz1 = curve1.startPoint();
+        const minShift = Geometry_1.Geometry.smallMetricDistance * 0.001;
+        const d01 = xyz0.distanceXY(xyz1);
+        if (d01 < minShift)
+            return false;
+        // try lines and linestrings
+        if (d01 < gapTolerance) {
+            if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))
+                return true;
+        }
+        // try other primitive types
+        const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(curve0, true, curve1, true);
+        const shiftFactor = 5.0;
+        for (const pair of intersections) {
+            const detail0 = pair.detailA;
+            const detail1 = pair.detailB;
+            const distance0 = detail0.point.distanceXY(xyz0);
+            const distance1 = detail1.point.distanceXY(xyz1);
+            if (distance0 < shiftFactor * gapTolerance && distance1 < shiftFactor * gapTolerance) {
+                if (curve0 instanceof Arc3d_1.Arc3d && curve1 instanceof Arc3d_1.Arc3d) {
+                    const radians0End = curve0.sweep.fractionToRadians(detail0.fraction);
+                    curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);
+                    const radians1Start = curve1.sweep.fractionToRadians(detail1.fraction);
+                    curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);
+                    return true;
+                }
+                // TODO: other combinations of types
+            }
+        }
+        return false;
+    }
     /** Announce a curve primitive
      * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
      * * Otherwise start a new chain.
@@ -108,7 +166,7 @@ class MultiChainCollector {
                     const chain = this._chains[connect.chainIndex];
                     const index0 = chain.length - 1;
                     this._chains[connect.chainIndex].push(candidate);
-                    OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);
+                    MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
                     this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
                     return true;
                 }
@@ -116,7 +174,7 @@ class MultiChainCollector {
                     candidate.reverseInPlace();
                     const chain = this._chains[connect.chainIndex];
                     chain.splice(0, 0, candidate);
-                    OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);
+                    MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
                     this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
                     return true;
                 }
@@ -124,20 +182,20 @@ class MultiChainCollector {
             else {
                 this._xyzWork0 = candidate.endPoint(this._xyzWork0);
                 connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);
-                if (connect) { // START of new primitive ..
+                if (connect) {
                     if (connect.atEnd) {
                         candidate.reverseInPlace();
                         const chain = this._chains[connect.chainIndex];
                         const index0 = chain.length - 1;
                         this._chains[connect.chainIndex].push(candidate);
-                        OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);
+                        MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);
                         this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
                         return true;
                     }
                     else {
                         const chain = this._chains[connect.chainIndex];
                         chain.splice(0, 0, candidate);
-                        OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);
+                        MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);
                         this.searchAndMergeChainIndex(connect.chainIndex, tolerance);
                         return true;
                     }
@@ -147,10 +205,13 @@ class MultiChainCollector {
         return false;
     }
     /**
-     * * Move each primitive from chainB to the end of  chainA.
-     * * clear chainB.
-     * * move the final chain to chainB index.
-     * * reduce the _chain.length by 1.
+     * Merge two entries in the chain array.
+     * * Move each primitive from chainB to the end of chainA.
+     * * Clear chainB.
+     * * Move the final chain to chainB index.
+     * * Decrement the array length.
+     * @param chainIndexA index of chainA
+     * @param chainIndexB index of chainB
      */
     mergeChainsForwardForward(chainIndexA, chainIndexB) {
         const chainA = this._chains[chainIndexA];
@@ -158,30 +219,26 @@ class MultiChainCollector {
         for (const p of chainB) {
             chainA.push(p);
         }
-        // chainIndexB is unused.
-        chainB.length = 0;
+        chainB.length = 0; // chainIndexB is unused
         const lastChainIndex = this._chains.length - 1;
-        if (chainIndexB !== lastChainIndex) {
+        if (chainIndexB !== lastChainIndex)
             this._chains[chainIndexB] = this._chains[lastChainIndex];
-            this._chains.pop();
-        }
-        else {
-            this._chains.pop();
-        }
+        this._chains.pop();
     }
+    /** Reverse the curve chain in place. */
     reverseChain(chainIndex) {
         const chain = this._chains[chainIndex];
         chain.reverse();
         for (const p of chain)
             p.reverseInPlace();
     }
-    // see if the head or tail of chainIndex matches any existing chain.  If so, merge
+    /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */
     searchAndMergeChainIndex(chainIndex, tolerance) {
         // ASSUME valid index of non-empty chain
         const chain = this._chains[chainIndex];
         const lastIndexInChain = chain.length - 1;
         this._xyzWork0 = chain[0].startPoint(this._xyzWork0);
-        // this start with any other chain ..
+        // try start with any other chain
         let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);
         if (connect) {
             if (!connect.atEnd)
@@ -199,9 +256,11 @@ class MultiChainCollector {
             return;
         }
     }
-    /** turn an array of curve primitives into the simplest possible strongly typed curve structure.
-     * * The input array is assumed to be connected appropriately to act as the curves of a Path.
-     * * When a path is created the curves array is CAPTURED.
+    /**
+     * Convert an array of curve primitives into the simplest possible strongly typed curve structure.
+     * @param curves input array, assembled correctly into a single contiguous path, captured by returned object
+     * @param makeLoopIfClosed whether to return a Loop from physically closed curves array, otherwise Path
+     * @return Loop or Path if multiple curves; the primitive if only one curve; undefined if no curves
      */
     promoteArrayToCurves(curves, makeLoopIfClosed) {
         if (curves.length === 0)
@@ -211,20 +270,18 @@ class MultiChainCollector {
             const primitiveN = curves[curves.length - 1];
             MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
             MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
-            const distanceAToB = MultiChainCollector._staticPointA.distance(MultiChainCollector._staticPointB);
-            if (distanceAToB < this._endPointShiftTolerance) {
-                // adjust for closure (and get the corrected coordinates)
-                OffsetHelpers.moveHeadOrTail(primitiveN, primitive0, this._endPointShiftTolerance);
+            if (MultiChainCollector.moveHeadOrTail(primitiveN, primitive0, this._gapTolerance)) {
+                // get the corrected coordinates
                 MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);
                 MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);
             }
-            if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB)) {
+            if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB, this._gapTolerance)) {
                 const localToWorld = FrameBuilder_1.FrameBuilder.createRightHandedLocalToWorld(curves);
                 if (localToWorld) {
                     const worldToLocal = localToWorld.inverse();
                     if (worldToLocal) {
                         const range = RegionOps_1.RegionOps.curveArrayRange(curves, worldToLocal);
-                        if (this._planarityTolerance !== undefined && range.zLength() <= this._planarityTolerance) {
+                        if (this._planeTolerance !== undefined && range.zLength() <= this._planeTolerance) {
                             return Loop_1.Loop.createArray(curves);
                         }
                     }
@@ -236,14 +293,14 @@ class MultiChainCollector {
             return curves[0];
         return Path_1.Path.createArray(curves);
     }
-    chainToLineString3d(curves) {
-        if (curves.length === 0)
+    /** Stroke the curve chain to a line string, de-duplicate the points. */
+    chainToLineString3d(chain, options) {
+        if (chain.length === 0)
             return undefined;
         const linestring = LineString3d_1.LineString3d.create();
-        for (const curve of curves) {
-            curve.emitStrokes(linestring);
-            linestring.removeDuplicatePoints();
-        }
+        for (const curve of chain)
+            curve.emitStrokes(linestring, options);
+        linestring.removeDuplicatePoints(this._gapTolerance);
         return linestring;
     }
     /** Return the collected results, structured as the simplest possible type. */
@@ -261,16 +318,16 @@ class MultiChainCollector {
         return bag;
     }
     /** Return chains as individual calls to announceChain. */
-    announceChainsAsLineString3d(announceChain) {
+    announceChainsAsLineString3d(announceChain, options) {
         const chains = this._chains;
         if (chains.length === 1) {
-            const ls = this.chainToLineString3d(chains[0]);
+            const ls = this.chainToLineString3d(chains[0], options);
             if (ls)
                 announceChain(ls);
         }
         else if (chains.length > 1) {
             for (const chain of chains) {
-                const ls = this.chainToLineString3d(chain);
+                const ls = this.chainToLineString3d(chain, options);
                 if (ls)
                     announceChain(ls);
             }
@@ -278,151 +335,4 @@ class MultiChainCollector {
     }
 }
 exports.MultiChainCollector = MultiChainCollector;
-// static methods to assist offset sequences ....
-class OffsetHelpers {
-    // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.
-    static sumLengths(data) {
-        let mySum = 0;
-        if (data instanceof CurvePrimitive_1.CurvePrimitive) {
-            mySum += data.curveLength();
-        }
-        else if (data instanceof CurveCollection_1.CurveCollection) {
-            mySum += data.sumLengths();
-        }
-        else if (Array.isArray(data)) {
-            for (const data1 of data)
-                mySum += this.sumLengths(data1);
-        }
-        return mySum;
-    }
-    // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.
-    static extendRange(range, data) {
-        if (data instanceof GeometryQuery_1.GeometryQuery) {
-            data.extendRange(range);
-        }
-        else if (Array.isArray(data)) {
-            for (const data1 of data)
-                this.extendRange(range, data1);
-        }
-        return range;
-    }
-    // construct (separately) the offsets of each entry of data (Path, Loop, BagOfCurve, or Array of those)
-    // push all offset geometry into the result array
-    // return summed length
-    static appendOffsets(data, offset, result) {
-        let summedLengths = 0;
-        if (data instanceof CurvePrimitive_1.CurvePrimitive) {
-            const resultA = PolygonOffsetContext_1.CurveChainWireOffsetContext.constructCurveXYOffset(Path_1.Path.create(data), offset);
-            if (resultA) {
-                summedLengths += this.sumLengths(resultA);
-                result.push(resultA);
-            }
-        }
-        else if (data instanceof Loop_1.Loop || data instanceof Path_1.Path) {
-            const resultA = PolygonOffsetContext_1.CurveChainWireOffsetContext.constructCurveXYOffset(data, offset);
-            if (resultA) {
-                summedLengths += this.sumLengths(resultA);
-                result.push(resultA);
-            }
-        }
-        else if (data instanceof CurveCollection_1.BagOfCurves) {
-            for (const q of data.children)
-                summedLengths += this.appendOffsets(q, offset, result);
-        }
-        else if (Array.isArray(data)) {
-            for (const q of data)
-                summedLengths += this.appendOffsets(q, offset, result);
-        }
-        return summedLengths;
-    }
-    /**
-     * * Restructure curve fragments as chains and offsets
-     * * Return object with named chains, insideOffsets, outsideOffsets
-     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
-     * @param fragments fragments to be chained
-     * @param offsetDistance offset distance.
-     */
-    static collectInsideAndOutsideOffsets(fragments, offsetDistance, gapTolerance) {
-        const collector = new MultiChainCollector(gapTolerance);
-        for (const s of fragments) {
-            collector.captureCurve(s);
-        }
-        const myChains = collector.grabResult(true);
-        const myOffsetA = [];
-        const myOffsetB = [];
-        const offsetLengthA = OffsetHelpers.appendOffsets(myChains, offsetDistance, myOffsetA);
-        const offsetLengthB = OffsetHelpers.appendOffsets(myChains, -offsetDistance, myOffsetB);
-        if (offsetLengthA > offsetLengthB) {
-            return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains: myChains };
-        }
-        else {
-            return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains: myChains };
-        }
-    }
-    /**
-     * * Restructure curve fragments as chains and offsets
-     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
-     * @param fragments fragments to be chained
-     * @param gapTolerance distance to be treated as "effectively zero" when joining head-to-tail.
-     */
-    static collectChains(fragments, gapTolerance, planarTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const collector = new MultiChainCollector(gapTolerance, planarTolerance);
-        for (const s of fragments) {
-            collector.captureCurve(s);
-        }
-        return collector.grabResult(true);
-    }
-    /** If allowed by the geometry type, move an endpoint.
-     *
-     */
-    static simpleEndPointMove(g, atEnd, to) {
-        if (g instanceof (LineSegment3d_1.LineSegment3d)) {
-            if (atEnd) {
-                g.point1Ref.setFrom(to);
-            }
-            else {
-                g.point0Ref.setFrom(to);
-            }
-            return true;
-        }
-        else if (g instanceof LineString3d_1.LineString3d && g.numPoints() > 0) {
-            const i = atEnd ? g.numPoints() - 1 : 0;
-            g.packedPoints.setAtCheckedPointIndex(i, to);
-            return true;
-        }
-        return false;
-    }
-    // Try to move move head (end) of g0 and tail (beginning) of g1 together.
-    static moveHeadOrTail(g0, g1, maxShift) {
-        const xyz0 = g0.endPoint();
-        const xyz1 = g1.startPoint();
-        const minShift = Geometry_1.Geometry.smallMetricDistance * 0.001;
-        const d01 = xyz0.distanceXY(xyz1);
-        if (d01 < minShift)
-            return true;
-        if (this.simpleEndPointMove(g1, false, xyz0) || this.simpleEndPointMove(g0, true, xyz1))
-            return true;
-        //    const detail1On0 = g0.closestPoint(xyz1);
-        //    const detail0On1 = g1.closestPoint(xyz0);
-        const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(g0, true, g1, true);
-        const shiftFactor = 5.0;
-        for (const pair of intersections) {
-            const detail0 = pair.detailA;
-            const detail1 = pair.detailB;
-            const distance0 = detail0.point.distanceXY(xyz0);
-            const distance1 = detail1.point.distanceXY(xyz1);
-            if (distance0 < shiftFactor * maxShift && distance1 < shiftFactor * maxShift) {
-                if (g0 instanceof Arc3d_1.Arc3d && g1 instanceof Arc3d_1.Arc3d) {
-                    const radians0End = g0.sweep.fractionToRadians(detail0.fraction);
-                    g0.sweep.setStartEndRadians(g0.sweep.startRadians, radians0End);
-                    const radians1Start = g1.sweep.fractionToRadians(detail1.fraction);
-                    g1.sweep.setStartEndRadians(radians1Start, g1.sweep.endRadians);
-                    return true;
-                }
-            }
-        }
-        return false;
-    }
-}
-exports.OffsetHelpers = OffsetHelpers;
 //# sourceMappingURL=MultiChainCollector.js.map

package/lib/cjs/curve/internalContexts/MultiChainCollector.js.map

@@ -1 +1 @@
-{"version":3,"file":"MultiChainCollector.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,6CAA0C;AAE1C,iEAA2E;AAC3E,+DAA4D;AAC5D,6DAA0D;AAC1D,6DAA0D;AAC1D,2DAAwD;AACxD,2CAAwC;AACxC,2CAAwC;AACxC,qDAA8D;AAC9D,6CAA0C;AAC1C,uDAAoD;AACpD,iEAAqE;AAIrE,gEAA6D;AAE7D;;;;;;;;;;;;;GAaG;AACH,MAAa,mBAAmB;IAY9B;;;OAGG;IACH,YAAmB,sBAAsB,GAAG,mBAAQ,CAAC,mBAAmB,EAAE,iBAAqC,mBAAQ,CAAC,mBAAmB;QACzI,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,uBAAuB,GAAG,sBAAsB,CAAC;QACtD,IAAI,CAAC,qBAAqB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC1D,IAAI,CAAC,mBAAmB,GAAG,cAAc,CAAC;IAC5C,CAAC;IAGD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAY,EAAE,SAAiB,EAAE,mBAA2B,CAAC,CAAC;QAE1F,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;YAC1E,IAAI,gBAAgB,KAAK,WAAW;gBAClC,SAAS;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC;gBAC9C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC;gBAC9C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;SACpD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;OAKG;IACI,qBAAqB,CAAC,SAAyB;QACpD,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,CAAC;YAAE,OAAO;QAClF,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,uBAAuB,CAAC;YAAE,OAAO;QACpF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/B,OAAO;IACT,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,SAAwB;QAC1C,IAAI,SAAS,YAAY,+BAAc;YACrC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;aACnC,IAAI,SAAS,YAAY,iCAAe,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EAAE;YACjF,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE;gBAClC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;aACtB;SACF;IACH,CAAC;IAED;;;OAGG;IACK,yBAAyB,CAAC,SAAyB,EAAE,SAAiB;QAC5E,IAAI,SAAS,EAAE;YACb,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACpE,IAAI,OAAO,EAAE;gBACX,IAAI,OAAO,CAAC,KAAK,EAAE;oBACjB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACjD,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBAC7F,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,SAAS,CAAC,cAAc,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC9B,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;oBAC/E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM;gBACL,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAChE,IAAI,OAAO,EAAE,EAAG,4BAA4B;oBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE;wBACjB,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;wBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACjD,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;wBAC7F,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;yBAAM;wBACL,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC9B,aAAa,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;wBAC/E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;iBACF;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACK,yBAAyB,CAAC,WAAmB,EAAE,WAAmB;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAChB;QACD,yBAAyB;QACzB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,IAAI,WAAW,KAAK,cAAc,EAAE;YAClC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzD,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;SACpB;aAAM;YACL,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;SACpB;IACH,CAAC;IACO,YAAY,CAAC,UAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,KAAK;YACnB,CAAC,CAAC,cAAc,EAAE,CAAC;IACvB,CAAC;IACD,kFAAkF;IAC1E,wBAAwB,CAAC,UAAkB,EAAE,SAAiB;QACpE,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,qCAAqC;QACrC,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAChF,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,OAAO,CAAC,KAAK;gBAChB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC/D,OAAO;SACR;QACD,+BAA+B;QAC/B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClE,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAC5E,IAAI,OAAO,EAAE;YACX,IAAI,OAAO,CAAC,KAAK;gBACf,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC/D,OAAO;SACR;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE;YACpB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC3F,MAAM,YAAY,GAAG,mBAAmB,CAAC,aAAa,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YACnG,IAAI,YAAY,GAAG,IAAI,CAAC,uBAAuB,EAAE;gBAC/C,yDAAyD;gBACzD,aAAa,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,uBAAuB,CAAC,CAAC;gBACnF,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;aAC5F;YACD,IAAI,mBAAmB,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,aAAa,CAAC,EAAE;gBACtF,MAAM,YAAY,GAAG,2BAAY,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC;gBACxE,IAAI,YAAY,EAAE;oBAChB,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;oBAC5C,IAAI,YAAY,EAAE;wBAChB,MAAM,KAAK,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9D,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,mBAAmB,EAAE;4BACzF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;yBACjC;qBACF;iBACF;gBACD,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aACjC;SACF;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACO,mBAAmB,CAAC,MAAwB;QAClD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,EAAG,CAAC;QAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAC;YACzB,KAAK,CAAC,WAAW,CAAE,UAAU,CAAC,CAAC;YAC/B,UAAU,CAAC,qBAAqB,EAAG,CAAC;SACrC;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACH,0DAA0D;IACnD,4BAA4B,CAAC,aAAyC;QAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAC;YACtB,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,IAAI,EAAE;gBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;SACrB;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAC;YAC3B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;gBAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;gBAC3C,IAAI,EAAE;oBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;aACnB;SACF;IACH,CAAC;CACF;AA7PD,kDA6PC;AACD,iDAAiD;AACjD,MAAa,aAAa;IACxB,oGAAoG;IAC7F,MAAM,CAAC,UAAU,CAAC,IAAS;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,YAAY,+BAAc,EAAE;YAClC,KAAK,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;SAC7B;aAAM,IAAI,IAAI,YAAY,iCAAe,EAAE;YAC1C,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;SAC5B;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI;gBACtB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;SACnC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oGAAoG;IAC7F,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,IAAS;QACjD,IAAI,IAAI,YAAY,6BAAa,EAAE;YACjC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SACzB;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,KAAK,IAAI,IAAI;gBACtB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAClC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uGAAuG;IACvG,iDAAiD;IACjD,uBAAuB;IAChB,MAAM,CAAC,aAAa,CAAC,IAAuC,EAAE,MAAc,EAAE,MAAkB;QACrG,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,YAAY,+BAAc,EAAE;YAClC,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,WAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;YAC9F,IAAI,OAAO,EAAE;gBACX,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,IAAI,YAAY,WAAI,IAAI,IAAI,YAAY,WAAI,EAAE;YACvD,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACjF,IAAI,OAAO,EAAE;gBACX,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACtB;SACF;aAAM,IAAI,IAAI,YAAY,6BAAW,EAAE;YACtC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;gBAC3B,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;SAC1D;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI;gBAClB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;SAC1D;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAC9G,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SAC3B;QACD,MAAM,QAAQ,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAC,QAAQ,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QACvF,MAAM,aAAa,GAAG,aAAa,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QACxF,IAAI,aAAa,GAAG,aAAa,EAAE;YACjC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;SAClF;aAAM;YACL,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;SAClF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,YAAoB,EAAE,kBAA0B,mBAAQ,CAAC,mBAAmB;QAC7H,MAAM,SAAS,GAAG,IAAI,mBAAmB,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;QACzE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SAC3B;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,kBAAkB,CAAC,CAAiB,EAAE,KAAc,EAAE,EAAU;QAC5E,IAAI,CAAC,YAAY,CAAC,6BAAa,CAAC,EAAE;YAChC,IAAI,KAAK,EAAE;gBACT,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACzB;iBAAM;gBACL,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACzB;YACD,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,CAAC,YAAY,2BAAY,IAAI,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE;YACzD,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,EAAkB,EAAE,EAAkB,EAAE,QAAgB;QACnF,MAAM,IAAI,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;QAC7B,MAAM,QAAQ,GAAG,mBAAQ,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,QAAQ;YAChB,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC;YACrF,OAAO,IAAI,CAAC;QACd,+CAA+C;QAC/C,+CAA+C;QAC/C,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,GAAG,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,SAAS,GAAG,WAAW,GAAG,QAAQ,IAAI,SAAS,GAAG,WAAW,GAAG,QAAQ,EAAE;gBAC5E,IAAI,EAAE,YAAY,aAAK,IAAI,EAAE,YAAY,aAAK,EAAE;oBAC9C,MAAM,WAAW,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjE,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;oBAChE,MAAM,aAAa,GAAG,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACnE,EAAE,CAAC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBAChE,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA1ID,sCA0IC","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\nimport { Arc3d } from \"../../curve/Arc3d\";\r\nimport { AnyCurve } from \"../../curve/CurveChain\";\r\nimport { BagOfCurves, CurveCollection } from \"../../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../../curve/LineString3d\";\r\nimport { Loop } from \"../../curve/Loop\";\r\nimport { Path } from \"../../curve/Path\";\r\nimport { ChainTypes, RegionOps } from \"../../curve/RegionOps\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { CurveCurve } from \"../../curve/CurveCurve\";\r\nimport { CurveChainWireOffsetContext } from \"./PolygonOffsetContext\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { XYAndZ } from \"../../geometry3d/XYZProps\";\r\nimport { FrameBuilder } from \"../../geometry3d/FrameBuilder\";\r\n\r\n/**\r\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\r\n * * The caller makes a sequence of calls to announce individual primitives.\r\n * * This collector (unlike the simpler \"ChainCollector\") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.\r\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\r\n * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.\r\n * * Usage pattern is\r\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\r\n *   * many times\r\n *       * `   context.captureCurve (anyCurve, searchAllPaths)`\r\n *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`\r\n *   * end:        ` result = context.grabResult (formLoopsIfClosed)`\r\n * @internal\r\n */\r\nexport class MultiChainCollector {\r\n  private _chains: CurvePrimitive[][];\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n\r\n  /** LOOSE tolerance for snap to end */\r\n  private _endPointShiftTolerance: number;\r\n  /** TIGHT tolerance for snap to end */\r\n  private _endPointHitTolerance: number;\r\n  /** tolerance for choosing Path or Loop.   If undefined, ALWAYS PATH */\r\n  private _planarityTolerance: number | undefined;\r\n  /** Initialize with an empty array of chains.\r\n   * @param endPointShiftTolerance tolerance for calling endpoints identical\r\n   * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.\r\n   */\r\n  public constructor(endPointShiftTolerance = Geometry.smallMetricDistance, planeTolerance: number | undefined = Geometry.smallMetricDistance) {\r\n    this._chains = [];\r\n    this._endPointShiftTolerance = endPointShiftTolerance;\r\n    this._endPointHitTolerance = Geometry.smallMetricDistance;\r\n    this._planarityTolerance = planeTolerance;\r\n  }\r\n\r\n  private _xyzWork0?: Point3d;\r\n  /**\r\n   * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz\r\n   * @param xyz\r\n   * @param tolerance\r\n   * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.\r\n   */\r\n  private findAnyChainToConnect(xyz: Point3d, tolerance: number, exceptChainIndex: number = -1): { chainIndex: number, atEnd: boolean } | undefined {\r\n\r\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\r\n      if (exceptChainIndex === chainIndexA)\r\n        continue;\r\n      const chain = this._chains[chainIndexA];\r\n      this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz, tolerance))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = chain[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz, tolerance))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  private _xyzWork1?: Point3d;\r\n  /**\r\n   * Insert a single curve primitive into the active chains.\r\n   * * The primitive is captured (not cloned)\r\n   * * The primitive may be reversed in place\r\n   * @param candidate\r\n   */\r\n  public captureCurvePrimitive(candidate: CurvePrimitive) {\r\n    if (this.attachPrimitiveToAnyChain(candidate, this._endPointHitTolerance)) return;\r\n    if (this.attachPrimitiveToAnyChain(candidate, this._endPointShiftTolerance)) return;\r\n    this._chains.push([candidate]);\r\n    return;\r\n  }\r\n\r\n  /**\r\n   * Insert any curve into the collection.\r\n   * * This recurses into Path, Loop, BagOfCurves etc\r\n   * * The all primitives are captured, and may be reversed in place.\r\n   * @param candidate\r\n   */\r\n  public captureCurve(candidate: GeometryQuery) {\r\n    if (candidate instanceof CurvePrimitive)\r\n      this.captureCurvePrimitive(candidate);\r\n    else if (candidate instanceof CurveCollection && candidate.children !== undefined) {\r\n      for (const c of candidate.children) {\r\n        this.captureCurve(c);\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Announce a curve primitive\r\n   * * If a \"nearby\" connection is possible, insert the candidate in the chain and force endpoint match.\r\n   * * Otherwise start a new chain.\r\n   */\r\n  private attachPrimitiveToAnyChain(candidate: CurvePrimitive, tolerance: number): boolean {\r\n    if (candidate) {\r\n      this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n      let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\r\n      if (connect) {\r\n        if (connect.atEnd) {\r\n          const chain = this._chains[connect.chainIndex];\r\n          const index0 = chain.length - 1;\r\n          this._chains[connect.chainIndex].push(candidate);\r\n          OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n          return true;\r\n        } else {\r\n          candidate.reverseInPlace();\r\n          const chain = this._chains[connect.chainIndex];\r\n          chain.splice(0, 0, candidate);\r\n          OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);\r\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n          return true;\r\n        }\r\n      } else {\r\n        this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n        connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\r\n        if (connect) {  // START of new primitive ..\r\n          if (connect.atEnd) {\r\n            candidate.reverseInPlace();\r\n            const chain = this._chains[connect.chainIndex];\r\n            const index0 = chain.length - 1;\r\n            this._chains[connect.chainIndex].push(candidate);\r\n            OffsetHelpers.moveHeadOrTail(chain[index0], chain[index0 + 1], this._endPointShiftTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n            return true;\r\n          } else {\r\n            const chain = this._chains[connect.chainIndex];\r\n            chain.splice(0, 0, candidate);\r\n            OffsetHelpers.moveHeadOrTail(chain[0], chain[1], this._endPointShiftTolerance);\r\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\r\n            return true;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * * Move each primitive from chainB to the end of  chainA.\r\n   * * clear chainB.\r\n   * * move the final chain to chainB index.\r\n   * * reduce the _chain.length by 1.\r\n   */\r\n  private mergeChainsForwardForward(chainIndexA: number, chainIndexB: number) {\r\n    const chainA = this._chains[chainIndexA];\r\n    const chainB = this._chains[chainIndexB];\r\n    for (const p of chainB) {\r\n      chainA.push(p);\r\n    }\r\n    // chainIndexB is unused.\r\n    chainB.length = 0;\r\n    const lastChainIndex = this._chains.length - 1;\r\n    if (chainIndexB !== lastChainIndex) {\r\n      this._chains[chainIndexB] = this._chains[lastChainIndex];\r\n      this._chains.pop();\r\n    } else {\r\n      this._chains.pop();\r\n    }\r\n  }\r\n  private reverseChain(chainIndex: number) {\r\n    const chain = this._chains[chainIndex];\r\n    chain.reverse();\r\n    for (const p of chain)\r\n      p.reverseInPlace();\r\n  }\r\n  // see if the head or tail of chainIndex matches any existing chain.  If so, merge\r\n  private searchAndMergeChainIndex(chainIndex: number, tolerance: number): void {\r\n    // ASSUME valid index of non-empty chain\r\n    const chain = this._chains[chainIndex];\r\n    const lastIndexInChain = chain.length - 1;\r\n    this._xyzWork0 = chain[0].startPoint(this._xyzWork0);\r\n    // this start with any other chain ..\r\n    let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);\r\n    if (connect) {\r\n      if (!connect.atEnd)\r\n        this.reverseChain(connect.chainIndex);\r\n      this.mergeChainsForwardForward(connect.chainIndex, chainIndex);\r\n      return;\r\n    }\r\n    // try end with any other chain\r\n    this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);\r\n    connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);\r\n    if (connect) {\r\n      if (connect.atEnd)\r\n        this.reverseChain(connect.chainIndex);\r\n      this.mergeChainsForwardForward(chainIndex, connect.chainIndex);\r\n      return;\r\n    }\r\n  }\r\n  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\r\n   * * When a path is created the curves array is CAPTURED.\r\n   */\r\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    if (makeLoopIfClosed) {\r\n      const primitive0 = curves[0];\r\n      const primitiveN = curves[curves.length - 1];\r\n      MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\r\n      MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\r\n      const distanceAToB = MultiChainCollector._staticPointA.distance(MultiChainCollector._staticPointB);\r\n      if (distanceAToB < this._endPointShiftTolerance) {\r\n        // adjust for closure (and get the corrected coordinates)\r\n        OffsetHelpers.moveHeadOrTail(primitiveN, primitive0, this._endPointShiftTolerance);\r\n        MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\r\n        MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\r\n      }\r\n      if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB)) {\r\n        const localToWorld = FrameBuilder.createRightHandedLocalToWorld(curves);\r\n        if (localToWorld) {\r\n          const worldToLocal = localToWorld.inverse();\r\n          if (worldToLocal) {\r\n            const range = RegionOps.curveArrayRange(curves, worldToLocal);\r\n            if (this._planarityTolerance !== undefined && range.zLength() <= this._planarityTolerance) {\r\n              return Loop.createArray(curves);\r\n            }\r\n          }\r\n        }\r\n        return Path.createArray(curves);\r\n      }\r\n    }\r\n    if (curves.length === 1)\r\n      return curves[0];\r\n    return Path.createArray(curves);\r\n  }\r\n  private chainToLineString3d(curves: CurvePrimitive[]): LineString3d | undefined{\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    const linestring = LineString3d.create ();\r\n    for (const curve of curves){\r\n      curve.emitStrokes (linestring);\r\n      linestring.removeDuplicatePoints ();\r\n    }\r\n    return linestring;\r\n  }\r\n\r\n  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): ChainTypes {\r\n    const chains = this._chains;\r\n    if (chains.length === 0)\r\n      return undefined;\r\n    if (chains.length === 1)\r\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\r\n    const bag = BagOfCurves.create();\r\n    for (const chain of chains) {\r\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\r\n      bag.tryAddChild(q);\r\n    }\r\n    return bag;\r\n  }\r\n/** Return chains as individual calls to announceChain. */\r\npublic announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void): void {\r\n  const chains = this._chains;\r\n  if (chains.length === 1){\r\n    const ls = this.chainToLineString3d(chains[0]);\r\n    if (ls)\r\n      announceChain(ls);\r\n  } else if (chains.length > 1){\r\n    for (const chain of chains) {\r\n      const ls = this.chainToLineString3d(chain);\r\n      if (ls)\r\n        announceChain(ls);\r\n      }\r\n    }\r\n  }\r\n}\r\n// static methods to assist offset sequences ....\r\nexport class OffsetHelpers {\r\n  // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.\r\n  public static sumLengths(data: any): number {\r\n    let mySum = 0;\r\n    if (data instanceof CurvePrimitive) {\r\n      mySum += data.curveLength();\r\n    } else if (data instanceof CurveCollection) {\r\n      mySum += data.sumLengths();\r\n    } else if (Array.isArray(data)) {\r\n      for (const data1 of data)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  // recursively sum lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level.\r\n  public static extendRange(range: Range3d, data: any): Range3d {\r\n    if (data instanceof GeometryQuery) {\r\n      data.extendRange(range);\r\n    } else if (Array.isArray(data)) {\r\n      for (const data1 of data)\r\n        this.extendRange(range, data1);\r\n    }\r\n    return range;\r\n  }\r\n\r\n  // construct (separately) the offsets of each entry of data (Path, Loop, BagOfCurve, or Array of those)\r\n  // push all offset geometry into the result array\r\n  // return summed length\r\n  public static appendOffsets(data: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number {\r\n    let summedLengths = 0;\r\n    if (data instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(data), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (data instanceof Loop || data instanceof Path) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(data, offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (data instanceof BagOfCurves) {\r\n      for (const q of data.children)\r\n        summedLengths += this.appendOffsets(q, offset, result);\r\n    } else if (Array.isArray(data)) {\r\n      for (const q of data)\r\n        summedLengths += this.appendOffsets(q, offset, result);\r\n    }\r\n    return summedLengths;\r\n  }\r\n\r\n  /**\r\n   * * Restructure curve fragments as chains and offsets\r\n   * * Return object with named chains, insideOffsets, outsideOffsets\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\r\n   * @param offsetDistance offset distance.\r\n   */\r\n  public static collectInsideAndOutsideOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains: ChainTypes } {\r\n    const collector = new MultiChainCollector(gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const myChains = collector.grabResult(true);\r\n    const myOffsetA: CurveCollection[] = [];\r\n    const myOffsetB: CurveCollection[] = [];\r\n    const offsetLengthA = OffsetHelpers.appendOffsets(myChains, offsetDistance, myOffsetA);\r\n    const offsetLengthB = OffsetHelpers.appendOffsets(myChains, -offsetDistance, myOffsetB);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains: myChains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains: myChains };\r\n    }\r\n  }\r\n  /**\r\n   * * Restructure curve fragments as chains and offsets\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\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail.\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number, planarTolerance: number = Geometry.smallMetricDistance): ChainTypes {\r\n    const collector = new MultiChainCollector(gapTolerance, planarTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n\r\n  /** If allowed by the geometry type, move an endpoint.\r\n   *\r\n   */\r\n  public static simpleEndPointMove(g: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean {\r\n    if (g instanceof (LineSegment3d)) {\r\n      if (atEnd) {\r\n        g.point1Ref.setFrom(to);\r\n      } else {\r\n        g.point0Ref.setFrom(to);\r\n      }\r\n      return true;\r\n    } else if (g instanceof LineString3d && g.numPoints() > 0) {\r\n      const i = atEnd ? g.numPoints() - 1 : 0;\r\n      g.packedPoints.setAtCheckedPointIndex(i, to);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  // Try to move move head (end) of g0 and tail (beginning) of g1 together.\r\n  public static moveHeadOrTail(g0: CurvePrimitive, g1: CurvePrimitive, maxShift: number): boolean {\r\n    const xyz0 = g0.endPoint();\r\n    const xyz1 = g1.startPoint();\r\n    const minShift = Geometry.smallMetricDistance * 0.001;\r\n    const d01 = xyz0.distanceXY(xyz1);\r\n    if (d01 < minShift)\r\n      return true;\r\n    if (this.simpleEndPointMove(g1, false, xyz0) || this.simpleEndPointMove(g0, true, xyz1))\r\n      return true;\r\n    //    const detail1On0 = g0.closestPoint(xyz1);\r\n    //    const detail0On1 = g1.closestPoint(xyz0);\r\n    const intersections = CurveCurve.intersectionXYPairs(g0, true, g1, true);\r\n    const shiftFactor = 5.0;\r\n    for (const pair of intersections) {\r\n      const detail0 = pair.detailA;\r\n      const detail1 = pair.detailB;\r\n      const distance0 = detail0.point.distanceXY(xyz0);\r\n      const distance1 = detail1.point.distanceXY(xyz1);\r\n      if (distance0 < shiftFactor * maxShift && distance1 < shiftFactor * maxShift) {\r\n        if (g0 instanceof Arc3d && g1 instanceof Arc3d) {\r\n          const radians0End = g0.sweep.fractionToRadians(detail0.fraction);\r\n          g0.sweep.setStartEndRadians(g0.sweep.startRadians, radians0End);\r\n          const radians1Start = g1.sweep.fractionToRadians(detail1.fraction);\r\n          g1.sweep.setStartEndRadians(radians1Start, g1.sweep.endRadians);\r\n          return true;\r\n        }\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"MultiChainCollector.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,6CAA0C;AAC1C,gEAA6D;AAG7D,oCAAiC;AAEjC,wDAAkE;AAClE,8CAA2C;AAC3C,sDAAmD;AACnD,oDAAiD;AACjD,kDAA+C;AAC/C,kCAA+B;AAC/B,kCAA+B;AAC/B,4CAAqD;AAGrD;;;;;;;;;;;;;GAaG;AACH,MAAa,mBAAmB;IAe9B;;;OAGG;IACH,YAAmB,YAAY,GAAG,mBAAQ,CAAC,mBAAmB,EAAE,iBAAqC,mBAAQ,CAAC,mBAAmB;QAC/H,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,cAAc,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QACnD,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;IACxC,CAAC;IACD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAY,EAAE,SAAiB,EAAE,mBAA2B,CAAC,CAAC;QAC1F,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;YAC1E,IAAI,gBAAgB,KAAK,WAAW;gBAClC,SAAS;YACX,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACxC,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC;gBAC9C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACrD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC;gBAC9C,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;SACpD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,SAAyB;QACpD,IAAI,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,aAAa,EAAE;YAC5C,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,cAAc,CAAC;gBAChE,OAAO;SACV;QACD,IAAI,IAAI,CAAC,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC;YAC/D,OAAO;QACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACjC,CAAC;IACD;;;;;OAKG;IACI,YAAY,CAAC,SAAmB;QACrC,IAAI,SAAS,YAAY,+BAAc;YACrC,IAAI,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;aACnC,IAAI,SAAS,YAAY,iCAAe,IAAI,SAAS,CAAC,QAAQ,KAAK,SAAS,EAAE;YACjF,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE;gBAClC,IAAI,CAAC,YAAY,CAAC,CAAa,CAAC,CAAC;aAClC;SACF;IACH,CAAC;IACD,yDAAyD;IACjD,MAAM,CAAC,kBAAkB,CAAC,KAAqB,EAAE,KAAc,EAAE,EAAU;QACjF,IAAI,KAAK,YAAY,CAAC,6BAAa,CAAC,EAAE;YACpC,IAAI,KAAK,EAAE;gBACT,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aAC7B;iBAAM;gBACL,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aAC7B;YACD,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,KAAK,YAAY,2BAAY,IAAI,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE;YACjE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,KAAK,CAAC,YAAY,CAAC,sBAAsB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,cAAc,CAAC,MAAsB,EAAE,MAAsB,EAAE,YAAoB;QAChG,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,mBAAmB,GAAG,KAAK,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,GAAG,QAAQ;YAChB,OAAO,KAAK,CAAC;QACf,4BAA4B;QAC5B,IAAI,GAAG,GAAG,YAAY,EAAE;YACtB,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC;gBAC7F,OAAO,IAAI,CAAC;SACf;QACD,4BAA4B;QAC5B,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACjF,MAAM,WAAW,GAAG,GAAG,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;YAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,SAAS,GAAG,WAAW,GAAG,YAAY,IAAI,SAAS,GAAG,WAAW,GAAG,YAAY,EAAE;gBACpF,IAAI,MAAM,YAAY,aAAK,IAAI,MAAM,YAAY,aAAK,EAAE;oBACtD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACrE,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC;oBACxE,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACvE,MAAM,CAAC,KAAK,CAAC,kBAAkB,CAAC,aAAa,EAAE,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACxE,OAAO,IAAI,CAAC;iBACb;gBACD,oCAAoC;aACrC;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,yBAAyB,CAAC,SAAyB,EAAE,SAAiB;QAC5E,IAAI,SAAS,EAAE;YACb,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACpE,IAAI,OAAO,EAAE;gBACX,IAAI,OAAO,CAAC,KAAK,EAAE;oBACjB,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;oBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACjD,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;oBACzF,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;qBAAM;oBACL,SAAS,CAAC,cAAc,EAAE,CAAC;oBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;oBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC9B,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;oBAC3E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;oBAC7D,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM;gBACL,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBAChE,IAAI,OAAO,EAAE;oBACX,IAAI,OAAO,CAAC,KAAK,EAAE;wBACjB,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;wBAChC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACjD,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;wBACzF,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;yBAAM;wBACL,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBAC/C,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC9B,mBAAmB,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;wBAC3E,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;wBAC7D,OAAO,IAAI,CAAC;qBACb;iBACF;aACF;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;OAQG;IACK,yBAAyB,CAAC,WAAmB,EAAE,WAAmB;QACxE,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACzC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;YACtB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SAChB;QACD,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,wBAAwB;QAC3C,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/C,IAAI,WAAW,KAAK,cAAc;YAChC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAC3D,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC;IACrB,CAAC;IACD,wCAAwC;IAChC,YAAY,CAAC,UAAkB;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,KAAK,CAAC,OAAO,EAAE,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,KAAK;YACnB,CAAC,CAAC,cAAc,EAAE,CAAC;IACvB,CAAC;IACD,qGAAqG;IAC7F,wBAAwB,CAAC,UAAkB,EAAE,SAAiB;QACpE,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,iCAAiC;QACjC,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAChF,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,OAAO,CAAC,KAAK;gBAChB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YAC/D,OAAO;SACR;QACD,+BAA+B;QAC/B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,gBAAgB,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClE,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAC5E,IAAI,OAAO,EAAE;YACX,IAAI,OAAO,CAAC,KAAK;gBACf,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YACxC,IAAI,CAAC,yBAAyB,CAAC,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;YAC/D,OAAO;SACR;IACH,CAAC;IACD;;;;;OAKG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE;YACpB,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC7C,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;YAC3F,IAAI,mBAAmB,CAAC,cAAc,CAAC,UAAU,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE;gBAClF,gCAAgC;gBAChC,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;gBAC7F,mBAAmB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,mBAAmB,CAAC,aAAa,CAAC,CAAC;aAC5F;YACD,IAAI,mBAAmB,CAAC,aAAa,CAAC,aAAa,CAAC,mBAAmB,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE;gBAC1G,MAAM,YAAY,GAAG,2BAAY,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC;gBACxE,IAAI,YAAY,EAAE;oBAChB,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;oBAC5C,IAAI,YAAY,EAAE;wBAChB,MAAM,KAAK,GAAG,qBAAS,CAAC,eAAe,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;wBAC9D,IAAI,IAAI,CAAC,eAAe,KAAK,SAAS,IAAI,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,eAAe,EAAE;4BACjF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;yBACjC;qBACF;iBACF;gBACD,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;aACjC;SACF;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,wEAAwE;IAChE,mBAAmB,CAAC,KAAuB,EAAE,OAAuB;QAC1E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,KAAK;YACvB,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACzC,UAAU,CAAC,qBAAqB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrD,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACpB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,0DAA0D;IACnD,4BAA4B,CAAC,aAAyC,EAAE,OAAuB;QACpG,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACxD,IAAI,EAAE;gBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;SACrB;aAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC5B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;gBAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBACpD,IAAI,EAAE;oBACJ,aAAa,CAAC,EAAE,CAAC,CAAC;aACrB;SACF;IACH,CAAC;CACF;AApTD,kDAoTC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../../Geometry\";\nimport { FrameBuilder } from \"../../geometry3d/FrameBuilder\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { XYAndZ } from \"../../geometry3d/XYZProps\";\nimport { Arc3d } from \"../Arc3d\";\nimport { AnyCurve } from \"../CurveChain\";\nimport { BagOfCurves, CurveCollection } from \"../CurveCollection\";\nimport { CurveCurve } from \"../CurveCurve\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop } from \"../Loop\";\nimport { Path } from \"../Path\";\nimport { ChainTypes, RegionOps } from \"../RegionOps\";\nimport { StrokeOptions } from \"../StrokeOptions\";\n\n/**\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\n * * The caller makes a sequence of calls to announce individual primitives.\n * * This collector (unlike the simpler [[ChainCollectorContext]]) expects to have inputs arriving in random order, leaving multiple open chains in play at any time.\n * * When all curves have been announced, the call to `grabResults` restructures the various active chains into Paths (and optionally, Loops).\n * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\n * * Usage pattern is\n *   * initialization: `context = new MultiChainCollector(gapTol, planeTol)`\n *   * many times:\n *       * `context.captureCurve(anyCurve)`\n *       * `context.captureCurvePrimitive(primitive)`\n *   * end: `result = context.grabResult(makeLoopIfClosed)`\n * @internal\n */\nexport class MultiChainCollector {\n  /** accumulated chains */\n  private _chains: CurvePrimitive[][];\n  /** largest gap distance to close */\n  private _gapTolerance: number;\n  /** end point snap tolerance (assumed to be as tight or tighter than gapTolerance) */\n  private _snapTolerance: number;\n  /** tolerance for choosing Path or Loop. If undefined, always Path. */\n  private _planeTolerance: number | undefined;\n\n  private static _staticPointA: Point3d;\n  private static _staticPointB: Point3d;\n  private _xyzWork0?: Point3d;\n  private _xyzWork1?: Point3d;\n\n  /** Initialize with an empty array of chains.\n   * @param gapTolerance tolerance for calling endpoints identical\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\n   */\n  public constructor(gapTolerance = Geometry.smallMetricDistance, planeTolerance: number | undefined = Geometry.smallMetricDistance) {\n    this._chains = [];\n    this._gapTolerance = gapTolerance;\n    this._snapTolerance = Geometry.smallMetricDistance;\n    this._planeTolerance = planeTolerance;\n  }\n  /**\n   * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz\n   * @param xyz endpoint to check\n   * @param tolerance absolute distance tolerance for equating endpoints\n   * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.\n   */\n  private findAnyChainToConnect(xyz: Point3d, tolerance: number, exceptChainIndex: number = -1): { chainIndex: number, atEnd: boolean } | undefined {\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\n      if (exceptChainIndex === chainIndexA)\n        continue;\n      const chain = this._chains[chainIndexA];\n      this._xyzWork1 = chain[chain.length - 1].endPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz, tolerance))\n        return { chainIndex: chainIndexA, atEnd: true };\n      this._xyzWork1 = chain[0].startPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz, tolerance))\n        return { chainIndex: chainIndexA, atEnd: false };\n    }\n    return undefined;\n  }\n  /**\n   * Insert a single curve primitive into the active chains.\n   * * The primitive is captured (not cloned)\n   * * The primitive may be reversed in place\n   * @param candidate curve to add to the context\n   */\n  public captureCurvePrimitive(candidate: CurvePrimitive) {\n    if (this._snapTolerance < this._gapTolerance) {\n      if (this.attachPrimitiveToAnyChain(candidate, this._snapTolerance))\n        return;\n    }\n    if (this.attachPrimitiveToAnyChain(candidate, this._gapTolerance))\n      return;\n    this._chains.push([candidate]);\n  }\n  /**\n   * Insert any curve into the collection.\n   * * This recurses into Path, Loop, BagOfCurves etc\n   * * All primitives are captured, and may be reversed in place.\n   * @param candidate curve to add to the context\n   */\n  public captureCurve(candidate: AnyCurve) {\n    if (candidate instanceof CurvePrimitive)\n      this.captureCurvePrimitive(candidate);\n    else if (candidate instanceof CurveCollection && candidate.children !== undefined) {\n      for (const c of candidate.children) {\n        this.captureCurve(c as AnyCurve);\n      }\n    }\n  }\n  /** If allowed by the geometry type, move an endpoint. */\n  private static simpleEndPointMove(curve: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean {\n    if (curve instanceof (LineSegment3d)) {\n      if (atEnd) {\n        curve.point1Ref.setFrom(to);\n      } else {\n        curve.point0Ref.setFrom(to);\n      }\n      return true;\n    } else if (curve instanceof LineString3d && curve.numPoints() > 0) {\n      const i = atEnd ? curve.numPoints() - 1 : 0;\n      curve.packedPoints.setAtCheckedPointIndex(i, to);\n      return true;\n    }\n    return false;\n  }\n  /**\n   * Try to move the end of curve0 and/or the start of curve1 to a common point.\n   * * All z-coordinates are ignored.\n   * @param curve0 first curve, assumed to end close to the start of curve1\n   * @param curve1 second curve, assumed to start close to the end of curve0\n   * @param gapTolerance max distance to move a curve start/end point\n   * @returns whether curve start/end point(s) moved\n   */\n  private static moveHeadOrTail(curve0: CurvePrimitive, curve1: CurvePrimitive, gapTolerance: number): boolean {\n    const xyz0 = curve0.endPoint();\n    const xyz1 = curve1.startPoint();\n    const minShift = Geometry.smallMetricDistance * 0.001;\n    const d01 = xyz0.distanceXY(xyz1);\n    if (d01 < minShift)\n      return false;\n    // try lines and linestrings\n    if (d01 < gapTolerance) {\n      if (this.simpleEndPointMove(curve1, false, xyz0) || this.simpleEndPointMove(curve0, true, xyz1))\n        return true;\n    }\n    // try other primitive types\n    const intersections = CurveCurve.intersectionXYPairs(curve0, true, curve1, true);\n    const shiftFactor = 5.0;\n    for (const pair of intersections) {\n      const detail0 = pair.detailA;\n      const detail1 = pair.detailB;\n      const distance0 = detail0.point.distanceXY(xyz0);\n      const distance1 = detail1.point.distanceXY(xyz1);\n      if (distance0 < shiftFactor * gapTolerance && distance1 < shiftFactor * gapTolerance) {\n        if (curve0 instanceof Arc3d && curve1 instanceof Arc3d) {\n          const radians0End = curve0.sweep.fractionToRadians(detail0.fraction);\n          curve0.sweep.setStartEndRadians(curve0.sweep.startRadians, radians0End);\n          const radians1Start = curve1.sweep.fractionToRadians(detail1.fraction);\n          curve1.sweep.setStartEndRadians(radians1Start, curve1.sweep.endRadians);\n          return true;\n        }\n        // TODO: other combinations of types\n      }\n    }\n    return false;\n  }\n  /** Announce a curve primitive\n   * * If a \"nearby\" connection is possible, insert the candidate in the chain and force endpoint match.\n   * * Otherwise start a new chain.\n   */\n  private attachPrimitiveToAnyChain(candidate: CurvePrimitive, tolerance: number): boolean {\n    if (candidate) {\n      this._xyzWork0 = candidate.startPoint(this._xyzWork0);\n      let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\n      if (connect) {\n        if (connect.atEnd) {\n          const chain = this._chains[connect.chainIndex];\n          const index0 = chain.length - 1;\n          this._chains[connect.chainIndex].push(candidate);\n          MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\n          return true;\n        } else {\n          candidate.reverseInPlace();\n          const chain = this._chains[connect.chainIndex];\n          chain.splice(0, 0, candidate);\n          MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);\n          this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\n          return true;\n        }\n      } else {\n        this._xyzWork0 = candidate.endPoint(this._xyzWork0);\n        connect = this.findAnyChainToConnect(this._xyzWork0, tolerance);\n        if (connect) {\n          if (connect.atEnd) {\n            candidate.reverseInPlace();\n            const chain = this._chains[connect.chainIndex];\n            const index0 = chain.length - 1;\n            this._chains[connect.chainIndex].push(candidate);\n            MultiChainCollector.moveHeadOrTail(chain[index0], chain[index0 + 1], this._gapTolerance);\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\n            return true;\n          } else {\n            const chain = this._chains[connect.chainIndex];\n            chain.splice(0, 0, candidate);\n            MultiChainCollector.moveHeadOrTail(chain[0], chain[1], this._gapTolerance);\n            this.searchAndMergeChainIndex(connect.chainIndex, tolerance);\n            return true;\n          }\n        }\n      }\n    }\n    return false;\n  }\n  /**\n   * Merge two entries in the chain array.\n   * * Move each primitive from chainB to the end of chainA.\n   * * Clear chainB.\n   * * Move the final chain to chainB index.\n   * * Decrement the array length.\n   * @param chainIndexA index of chainA\n   * @param chainIndexB index of chainB\n   */\n  private mergeChainsForwardForward(chainIndexA: number, chainIndexB: number) {\n    const chainA = this._chains[chainIndexA];\n    const chainB = this._chains[chainIndexB];\n    for (const p of chainB) {\n      chainA.push(p);\n    }\n    chainB.length = 0; // chainIndexB is unused\n    const lastChainIndex = this._chains.length - 1;\n    if (chainIndexB !== lastChainIndex)\n      this._chains[chainIndexB] = this._chains[lastChainIndex];\n    this._chains.pop();\n  }\n  /** Reverse the curve chain in place. */\n  private reverseChain(chainIndex: number) {\n    const chain = this._chains[chainIndex];\n    chain.reverse();\n    for (const p of chain)\n      p.reverseInPlace();\n  }\n  /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */\n  private searchAndMergeChainIndex(chainIndex: number, tolerance: number): void {\n    // ASSUME valid index of non-empty chain\n    const chain = this._chains[chainIndex];\n    const lastIndexInChain = chain.length - 1;\n    this._xyzWork0 = chain[0].startPoint(this._xyzWork0);\n    // try start with any other chain\n    let connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);\n    if (connect) {\n      if (!connect.atEnd)\n        this.reverseChain(connect.chainIndex);\n      this.mergeChainsForwardForward(connect.chainIndex, chainIndex);\n      return;\n    }\n    // try end with any other chain\n    this._xyzWork0 = chain[lastIndexInChain].endPoint(this._xyzWork0);\n    connect = this.findAnyChainToConnect(this._xyzWork0, tolerance, chainIndex);\n    if (connect) {\n      if (connect.atEnd)\n        this.reverseChain(connect.chainIndex);\n      this.mergeChainsForwardForward(chainIndex, connect.chainIndex);\n      return;\n    }\n  }\n  /**\n   * Convert an array of curve primitives into the simplest possible strongly typed curve structure.\n   * @param curves input array, assembled correctly into a single contiguous path, captured by returned object\n   * @param makeLoopIfClosed whether to return a Loop from physically closed curves array, otherwise Path\n   * @return Loop or Path if multiple curves; the primitive if only one curve; undefined if no curves\n   */\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\n    if (curves.length === 0)\n      return undefined;\n    if (makeLoopIfClosed) {\n      const primitive0 = curves[0];\n      const primitiveN = curves[curves.length - 1];\n      MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\n      MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\n      if (MultiChainCollector.moveHeadOrTail(primitiveN, primitive0, this._gapTolerance)) {\n        // get the corrected coordinates\n        MultiChainCollector._staticPointA = primitive0.startPoint(MultiChainCollector._staticPointA);\n        MultiChainCollector._staticPointB = primitiveN.endPoint(MultiChainCollector._staticPointB);\n      }\n      if (MultiChainCollector._staticPointA.isAlmostEqual(MultiChainCollector._staticPointB, this._gapTolerance)) {\n        const localToWorld = FrameBuilder.createRightHandedLocalToWorld(curves);\n        if (localToWorld) {\n          const worldToLocal = localToWorld.inverse();\n          if (worldToLocal) {\n            const range = RegionOps.curveArrayRange(curves, worldToLocal);\n            if (this._planeTolerance !== undefined && range.zLength() <= this._planeTolerance) {\n              return Loop.createArray(curves);\n            }\n          }\n        }\n        return Path.createArray(curves);\n      }\n    }\n    if (curves.length === 1)\n      return curves[0];\n    return Path.createArray(curves);\n  }\n  /** Stroke the curve chain to a line string, de-duplicate the points. */\n  private chainToLineString3d(chain: CurvePrimitive[], options?: StrokeOptions): LineString3d | undefined {\n    if (chain.length === 0)\n      return undefined;\n    const linestring = LineString3d.create();\n    for (const curve of chain)\n      curve.emitStrokes(linestring, options);\n    linestring.removeDuplicatePoints(this._gapTolerance);\n    return linestring;\n  }\n  /** Return the collected results, structured as the simplest possible type. */\n  public grabResult(makeLoopIfClosed: boolean = false): ChainTypes {\n    const chains = this._chains;\n    if (chains.length === 0)\n      return undefined;\n    if (chains.length === 1)\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\n    const bag = BagOfCurves.create();\n    for (const chain of chains) {\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\n      bag.tryAddChild(q);\n    }\n    return bag;\n  }\n  /** Return chains as individual calls to announceChain. */\n  public announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void, options?: StrokeOptions): void {\n    const chains = this._chains;\n    if (chains.length === 1) {\n      const ls = this.chainToLineString3d(chains[0], options);\n      if (ls)\n        announceChain(ls);\n    } else if (chains.length > 1) {\n      for (const chain of chains) {\n        const ls = this.chainToLineString3d(chain, options);\n        if (ls)\n          announceChain(ls);\n      }\n    }\n  }\n}\n"]}