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

package/lib/cjs/curve/CurveChainWithDistanceIndex.js

@@ -17,10 +17,10 @@ const CurveCollection_1 = require("./CurveCollection");
 const CurveExtendMode_1 = require("./CurveExtendMode");
 const CurveLocationDetail_1 = require("./CurveLocationDetail");
 const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
-const PolygonOffsetContext_1 = require("./internalContexts/PolygonOffsetContext");
+const OffsetOptions_1 = require("./OffsetOptions");
 const Path_1 = require("./Path");
 /**
- * * Annotation of an interval of a curve.
+ * Annotation of an interval of a curve.
  * * The interval is marked with two pairs of numbers:
  * * * fraction0, fraction1 = fraction parameters along the child curve
  * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex
@@ -44,8 +44,7 @@ class PathFragment {
     containsChainDistance(distance) {
         return distance >= this.chainDistance0 && distance <= this.chainDistance1;
     }
-    // Return a quick distance to the curve.   This may be SMALLER than true distance but may
-    // not be larger.
+    /** Return a quick distance to the curve.  This may be SMALLER than true distance but may not be larger */
     quickMinDistanceToChildCurve(spacePoint) {
         if (this.range) {
             return this.range.distanceToPoint(spacePoint);
@@ -56,8 +55,10 @@ class PathFragment {
             return detail.a;
         return 0;
     }
-    // Return an array with (references to) all the path fragments, sorted smallest to largest on
-    //   the "a" value equal to the quick min distance to the fragment
+    /**
+     * Return an array with (references to) all the path fragments, sorted smallest to largest on the "a" value
+     * equal to the quick min distance to the fragment
+     */
     static collectSortedQuickMinDistances(fragments, spacePoint) {
         const sortedFragments = [];
         for (const f of fragments) {
@@ -74,26 +75,28 @@ class PathFragment {
     containsChildCurveAndChildFraction(curve, fraction) {
         return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;
     }
-    /** Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.
+    /**
+     * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.
      * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.
      */
     chainDistanceToInterpolatedChildFraction(distance) {
         return Geometry_1.Geometry.inverseInterpolate(this.childFraction0, this.chainDistance0, this.childFraction1, this.chainDistance1, distance, this.childFraction0); // the interval "must" have nonzero length, division should be safe . ..
     }
-    /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction
-     */
+    /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */
     chainDistanceToAccurateChildFraction(chainDistance, allowExtrapolation) {
         // The fragments are really expected to do good mappings in their distance range ...
         const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);
         return childDetail.fraction;
     }
-    /** Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
+    /**
+     * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
      * @param globalDistance total length of the global curve.
      */
     fractionScaleFactor(globalDistance) {
         return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);
     }
-    /** Reverse the fraction and distance data.
+    /**
+     * Reverse the fraction and distance data.
      * * each child fraction `f` is replaced by `1-f`
      * * each `chainDistance` is replaced by `totalDistance-chainDistance`
      */
@@ -112,7 +115,7 @@ class PathFragment {
         return this.childFractionToChainDistance(fraction);
     }
     /**
-     * convert a fractional position on the childCurve to distance in the chain space.
+     * Convert a fractional position on the childCurve to distance in the chain space.
      * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.
      * @param fraction fraction along the curve within this fragment
      */
@@ -135,7 +138,6 @@ class DistanceIndexConstructionContext {
     startCurvePrimitive(_cp) { }
     endParentCurvePrimitive(_cp) { }
     endCurvePrimitive(_cp) { }
-    // um .. we need to see curves? how to reject?
     announcePointTangent(_xyz, _fraction, _tangent) { }
     /** Announce numPoints interpolated between point0 and point1, with associated fractions */
     announceSegmentInterval(cp, point0, point1, numStrokes, fraction0, fraction1) {
@@ -182,13 +184,17 @@ class DistanceIndexConstructionContext {
 /**
  * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true
  * distance along a CurveChain.
+ * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`
+ * to `t1` is easily computed as `L*(t1-t0)`.
  * * The curve chain can be any type derived from CurveChain.
  * * * i.e. either a `Path` or a `Loop`
  * @public
  */
 class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
     /** Test if other is a `CurveChainWithDistanceIndex` */
-    isSameGeometryClass(other) { return other instanceof CurveChainWithDistanceIndex; }
+    isSameGeometryClass(other) {
+        return other instanceof CurveChainWithDistanceIndex;
+    }
     // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.
     constructor(path, fragments) {
         super();
@@ -208,14 +214,20 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
             return CurveChainWithDistanceIndex.createCapture(c);
         return undefined;
     }
-    /** Reference to the contained path.
+    /**
+     * Reference to the contained path.
      * * Do not modify the path.  The distance index will be wrong.
      */
-    get path() { return this._path; }
-    /** Reference to the fragments array.
+    get path() {
+        return this._path;
+    }
+    /**
+     * Reference to the fragments array.
      * * Do not modify.
      */
-    get fragments() { return this._fragments; }
+    get fragments() {
+        return this._fragments;
+    }
     /** Return a deep clone */
     clone() {
         const c = this._path.clone();
@@ -287,7 +299,8 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
             newPath.children.reverse();
         return CurveChainWithDistanceIndex.createCapture(newPath);
     }
-    /** Ask if the curve is within tolerance of a plane.
+    /**
+     * Ask if the curve is within tolerance of a plane.
      * @returns Returns true if the curve is completely within tolerance of the plane.
      */
     isInPlane(plane) {
@@ -297,7 +310,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         return true;
     }
-    /** return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */
+    /** Return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */
     startPoint(result) {
         const c = this._path.cyclicCurvePrimitive(0);
         if (c)
@@ -317,7 +330,8 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
             c.emitStrokes(dest, options);
         }
     }
-    /** Ask the curve to announce points and simple subcurve fragments for stroking.
+    /**
+     * Ask the curve to announce points and simple subcurve fragments for stroking.
      * See IStrokeHandler for description of the sequence of the method calls.
      */
     emitStrokableParts(dest, options) {
@@ -326,7 +340,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
     }
     /**
-     * return the stroke count required for given options.
+     * Return the stroke count required for given options.
      * @param options StrokeOptions that determine count
      */
     computeStrokeCountForOptions(options) {
@@ -340,7 +354,8 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
      * Return an array containing only the curve primitives.
      * @param collectorArray array to receive primitives (pushed -- the array is not cleared)
      * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.
-     * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].
+     * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each
+     * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].
      */
     collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives = false, explodeLineStrings = false) {
         if (smallestPossiblePrimitives) {
@@ -353,7 +368,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
     }
     /**
-     * construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.
+     * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.
      * @param options StrokeOptions that determine count
      * @param parentStrokeMap evolving parent map.
      */
@@ -364,20 +379,19 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         CurvePrimitive_1.CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);
     }
-    /** Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`
+    /**
+     * Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`
      * * Note that this exposes the children individually to the handler.
      */
     dispatchToGeometryHandler(handler) {
         return this._path.dispatchToGeometryHandler(handler);
     }
-    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed)
-     */
+    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */
     extendRange(rangeToExtend, transform) {
         this._path.extendRange(rangeToExtend, transform);
     }
     /**
-     *
-     * * Curve length is always positive.
+     * Curve length is always positive.
      * @returns Returns a (high accuracy) length of the curve between fractional positions
      * @returns Returns the length of the curve.
      */
@@ -429,7 +443,9 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
      * Convert distance along the chain to fraction along the chain.
      * @param distance distance along the chain
      */
-    chainDistanceToChainFraction(distance) { return distance / this._totalLength; }
+    chainDistanceToChainFraction(distance) {
+        return distance / this._totalLength;
+    }
     /**
      * Resolve a fraction within a specific curve to a fragment.
      * @param curve
@@ -451,9 +467,7 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         return undefined;
     }
-    /**
-     * Returns the total length of curves.
-     */
+    /** Returns the total length of curves. */
     curveLength() {
         return this._totalLength;
     }
@@ -480,8 +494,8 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         //    fragment = this.chainDistanceToFragment(chainDistance, true);
         return this._fragments[0].childCurve.fractionToPoint(0.0, result);
     }
-    /** Return the point (x,y,z) and derivative on the curve at fractional position.
-     *
+    /**
+     * Return the point (x,y,z) and derivative on the curve at fractional position.
      * * Note that this derivative is "derivative of xyz with respect to fraction."
      * * this derivative shows the speed of the "fractional point" moving along the curve.
      * * this is not generally a unit vector.  use fractionToPointAndUnitTangent for a unit vector.
@@ -515,10 +529,11 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         result.direction.normalizeInPlace();
         return result;
     }
-    /** Return a plane with
-     *
+    /**
+     * Return a plane with
      * * origin at fractional position along the curve
-     * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to the fraction.
+     * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to
+     * the fraction.
      * * vectorV is the second derivative, i.e.derivative of vectorU.
      */
     fractionToPointAnd2Derivatives(fraction, result) {
@@ -544,7 +559,8 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         result.vectorV.scaleInPlace(scale * scale);
         return result;
     }
-    /** Attempt to transform in place.
+    /**
+     * Attempt to transform in place.
      * * Warning: If any child fails, this object becomes invalid.  But that should never happen.
      */
     tryTransformInPlace(transform) {
@@ -577,9 +593,11 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         return false;
     }
-    /** Implement moveSignedDistanceFromFraction.
+    /**
+     * Implement moveSignedDistanceFromFraction.
      * * See `CurvePrimitive` for parameter details.
-     * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.
+     * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and
+     * has pointer to an additional detail for the child curve.
      */
     moveSignedDistanceFromFraction(startFraction, signedDistance, allowExtension, result) {
         const distanceA = startFraction * this._totalLength;
@@ -592,7 +610,6 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         return chainDetail;
     }
     /**
-     *
      * The returned object has
      * * numCalls = number of times closestPoint was called.
      * * numCurvesTested = number of curves tested with full closestPoint
@@ -613,10 +630,12 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         return a;
     }
-    /** Search for the curve point that is closest to the spacePoint.
+    /**
+     * Search for the curve point that is closest to the spacePoint.
      * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which
      *     (via a handler) determines a CurveLocation detail among the children.
-     * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.
+     * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and
+     * has pointer to an additional detail for the child curve.
      * @param spacePoint point in space
      * @param extend true to extend the curve
      * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
@@ -665,11 +684,12 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
     }
     /**
      * Construct an offset of each child as viewed in the xy-plane (ignoring z).
-     * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully joined offset.
+     * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully
+     * joined offset.
      * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object
      */
     constructOffsetXY(offsetDistanceOrOptions) {
-        const options = PolygonOffsetContext_1.OffsetOptions.create(offsetDistanceOrOptions);
+        const options = OffsetOptions_1.OffsetOptions.create(offsetDistanceOrOptions);
         const offsets = [];
         for (const prim of this.collectCurvePrimitives(undefined, true, true)) {
             const offset = prim.constructOffsetXY(options);
@@ -682,10 +702,13 @@ class CurveChainWithDistanceIndex extends CurvePrimitive_1.CurvePrimitive {
         }
         return offsets;
     }
-    /** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
+    /**
+     * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of
+     * projection.
      * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
      * @param lowHigh optional receiver for output
-     * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
+     * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the
+     * end of the ray.
      */
     projectedParameterRange(ray, lowHigh) {
         return PlaneAltitudeRangeContext_1.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);

package/lib/cjs/curve/CurveChainWithDistanceIndex.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AACzF,kFAAwE;AAExE,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YAAmB,cAAsB,EAAE,cAAsB,EAAE,SAAiB,EAAE,SAAiB,EAAE,UAA0B,EACjI,KAAe;QACf,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD,yFAAyF;IACzF,iBAAiB;IACV,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SAC/C;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,6FAA6F;IAC7F,kEAAkE;IAC3D,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACjD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IAED;;OAEG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAI,wEAAwE;IAChH,CAAC;IACD;OACG;IACI,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2DAA2D;IACpD,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AApHD,oCAoHC;AACD,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IACjD,8CAA8C;IACvC,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAClB,MAAe,EACf,MAAe,EACf,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;GAMG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAO7D,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC;IAClH,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAVV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAUjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACH,IAAW,IAAI,KAAiB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAEpD;;OAEG;IACH,IAAW,SAAS,KAAqB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAElE,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CAAC,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EAAW,EAAE;YACtI,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QAEF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAG,wDAAwD;YACvH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,wBAAwB,CAAC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QACzJ,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IAED;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;OAEG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD;OACG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;;OAKG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,4BAA4B,CAAC,QAAgB,IAAY,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IACtG;;;;OAIG;IACI,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACa,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IAED;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,iFAAiF;QACjF,6EAA6E;QAC7E,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,8BAA8B,CAAC,QAAgB,EAAE,MAAkC;QACxF,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,gFAAgF;QAChF,kFAAkF;QAClF,qCAAqC;QACrC,oDAAoD;QACpD,kEAAkE;QAClE,yCAAyC;QACzC,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;SACpD;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACa,8BAA8B,CAAC,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QACjJ,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;;;;OASG;IACI,MAAM,CAAC,yBAAyB,CAAC,QAAiB,IAAI;QAC3D,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QAEF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;OAOG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC;QACnF,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;oBACZ,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SAEF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,oCAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AAnFc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AAhctB,kEAA2B","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 { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { CurveChain } from \"./CurveCollection\";\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { OffsetOptions } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * Annotation of an interval of a curve.\r\n * * The interval is marked with two pairs of numbers:\r\n * * * fraction0, fraction1 = fraction parameters along the child curve\r\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\r\n * @public\r\n */\r\nexport class PathFragment {\r\n  /** distance along parent to this fragment start */\r\n  public chainDistance0: number;\r\n  /** distance along parent to this fragment end */\r\n  public chainDistance1: number;\r\n  /** Fractional position of this fragment start within its curve primitive. */\r\n  public childFraction0: number;\r\n  /** Fractional position of this fragment end within its curve primitive.. */\r\n  public childFraction1: number;\r\n  /** Curve primitive of this fragment, as presented in stroker.  Note that this might have become a proxy. */\r\n  public childCurve: CurvePrimitive;\r\n  /** optional range */\r\n  public range?: Range3d;\r\n  /** working var for use in searches. */\r\n  public a: number;\r\n  /** Create a fragment with complete fraction, distance and child data. */\r\n  public constructor(childFraction0: number, childFraction1: number, distance0: number, distance1: number, childCurve: CurvePrimitive,\r\n    range?: Range3d) {\r\n    this.childFraction0 = childFraction0;\r\n    this.childFraction1 = childFraction1;\r\n    this.chainDistance0 = distance0;\r\n    this.chainDistance1 = distance1;\r\n    this.childCurve = childCurve;\r\n    this.range = range;\r\n    this.a = 0;\r\n  }\r\n  /**\r\n   * Return true if the distance is within the distance limits of this fragment.\r\n   * @param distance\r\n   */\r\n  public containsChainDistance(distance: number): boolean {\r\n    return distance >= this.chainDistance0 && distance <= this.chainDistance1;\r\n  }\r\n  // Return a quick distance to the curve.   This may be SMALLER than true distance but may\r\n  // not be larger.\r\n  public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\r\n    if (this.range) {\r\n      return this.range.distanceToPoint(spacePoint);\r\n    }\r\n    // ugh.  have to do real computation ..\r\n    const detail = this.childCurve.closestPoint(spacePoint, false);\r\n    if (detail)\r\n      return detail.a;\r\n    return 0;\r\n  }\r\n  // Return an array with (references to) all the path fragments, sorted smallest to largest on\r\n  //   the \"a\" value equal to the quick min distance to the fragment\r\n  public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\r\n    const sortedFragments: PathFragment[] = [];\r\n    for (const f of fragments) {\r\n      f.a = f.quickMinDistanceToChildCurve(spacePoint);\r\n      sortedFragments.push(f);\r\n    }\r\n    sortedFragments.sort((a: PathFragment, b: PathFragment) => a.a - b.a);\r\n    return sortedFragments;\r\n  }\r\n  /**\r\n   * Return true if this fragment addresses `curve` and brackets `fraction`\r\n   * @param distance\r\n   */\r\n  public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\r\n    return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\r\n  }\r\n\r\n  /** Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\r\n   * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\r\n   */\r\n  public chainDistanceToInterpolatedChildFraction(distance: number): number {\r\n    return Geometry.inverseInterpolate(\r\n      this.childFraction0, this.chainDistance0,\r\n      this.childFraction1, this.chainDistance1,\r\n      distance, this.childFraction0)!;    // the interval \"must\" have nonzero length, division should be safe . ..\r\n  }\r\n  /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction\r\n   */\r\n  public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\r\n    // The fragments are really expected to do good mappings in their distance range ...\r\n    const childDetail = this.childCurve.moveSignedDistanceFromFraction(\r\n      this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\r\n    return childDetail.fraction;\r\n  }\r\n  /** Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives\r\n   * @param globalDistance total length of the global curve.\r\n   */\r\n  public fractionScaleFactor(globalDistance: number): number {\r\n    return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\r\n  }\r\n  /** Reverse the fraction and distance data.\r\n   * * each child fraction `f` is replaced by `1-f`\r\n   * * each `chainDistance` is replaced by `totalDistance-chainDistance`\r\n   */\r\n  public reverseFractionsAndDistances(totalDistance: number) {\r\n    const f0 = this.childFraction0;\r\n    const f1 = this.childFraction1;\r\n    const d0 = this.chainDistance0;\r\n    const d1 = this.chainDistance1;\r\n    this.childFraction0 = 1.0 - f1;\r\n    this.childFraction1 = 1.0 - f0;\r\n    this.chainDistance0 = totalDistance - d1;\r\n    this.chainDistance1 = totalDistance - d0;\r\n  }\r\n  /** @deprecated in 3.x. Use childFractionToChainDistance */\r\n  public childFractionTChainDistance(fraction: number): number {\r\n    return this.childFractionToChainDistance(fraction);\r\n  }\r\n  /**\r\n   * convert a fractional position on the childCurve to distance in the chain space.\r\n   * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\r\n   * @param fraction fraction along the curve within this fragment\r\n   */\r\n  public childFractionToChainDistance(fraction: number): number {\r\n    let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\r\n    if (fraction < this.childFraction0)\r\n      d = -d;\r\n    return this.chainDistance0 + d;\r\n  }\r\n}\r\n/** Non-instantiable class to build a distance index for a path. */\r\nclass DistanceIndexConstructionContext implements IStrokeHandler {\r\n  private _fragments: PathFragment[];\r\n  private _accumulatedDistance: number;\r\n  private constructor() {\r\n    this._accumulatedDistance = 0;\r\n    this._fragments = [];\r\n  }\r\n  // ignore curve announcements -- they are repeated in stroke announcements\r\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\r\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\r\n  // um .. we need to see curves? how to reject?\r\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\r\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n  public announceSegmentInterval(\r\n    cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    const fragmentPoint0 = point0.clone();\r\n    const fragmentPoint1 = point1.clone();\r\n    let d0 = this._accumulatedDistance;\r\n    if (numStrokes <= 1) {\r\n      this._accumulatedDistance += point0.distance(point1);\r\n      this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\r\n        Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n    } else {\r\n      let f1;\r\n      for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n        f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n        point0.interpolate(f1, point1, fragmentPoint1);\r\n        d0 = this._accumulatedDistance;\r\n        this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\r\n        this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\r\n          Range3d.create(fragmentPoint0, fragmentPoint1)));\r\n        fragmentPoint0.setFrom(fragmentPoint1);\r\n      }\r\n    }\r\n  }\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    let f1, d, d0;\r\n    for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\r\n      f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\r\n      d = cp.curveLengthBetweenFractions(f0, f1);\r\n      d0 = this._accumulatedDistance;\r\n      this._accumulatedDistance += d;\r\n      const range = cp.rangeBetweenFractions(f0, f1);\r\n      this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\r\n    }\r\n  }\r\n  public needPrimaryGeometryForStrokes?(): boolean { return true; }\r\n  public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\r\n    const handler = new DistanceIndexConstructionContext();\r\n    for (const curve of path.children) {\r\n      curve.emitStrokableParts(handler, options);\r\n    }\r\n    const fragments = handler._fragments;\r\n    return fragments;\r\n  }\r\n}\r\n/**\r\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\r\n * distance along a CurveChain.\r\n * * The curve chain can be any type derived from CurveChain.\r\n * * * i.e. either a `Path` or a `Loop`\r\n * @public\r\n */\r\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\r\n  /** String name for schema properties */\r\n  public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\r\n\r\n  private readonly _path: CurveChain;\r\n  private readonly _fragments: PathFragment[];\r\n  private readonly _totalLength: number; // matches final fragment distance1.\r\n  /** Test if other is a `CurveChainWithDistanceIndex` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean { return other instanceof CurveChainWithDistanceIndex; }\r\n  // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\r\n  private constructor(path: CurveChain, fragments: PathFragment[]) {\r\n    super();\r\n    this._path = path;\r\n    this._fragments = fragments;\r\n    this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\r\n  }\r\n  /**\r\n   * Create a clone, transformed and with its own distance index.\r\n   * @param transform transform to apply in the clone.\r\n   */\r\n  public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\r\n    const c = this._path.clone();\r\n    if (c instanceof CurveChain && c.tryTransformInPlace(transform))\r\n      return CurveChainWithDistanceIndex.createCapture(c);\r\n    return undefined;\r\n  }\r\n  /** Reference to the contained path.\r\n   * * Do not modify the path.  The distance index will be wrong.\r\n   */\r\n  public get path(): CurveChain { return this._path; }\r\n\r\n  /** Reference to the fragments array.\r\n   * * Do not modify.\r\n   */\r\n  public get fragments(): PathFragment[] { return this._fragments; }\r\n\r\n  /** Return a deep clone */\r\n  public clone(): CurveChainWithDistanceIndex {\r\n    const c = this._path.clone() as CurveChain;\r\n    return CurveChainWithDistanceIndex.createCapture(c);\r\n  }\r\n\r\n  /** Return a deep clone */\r\n  public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\r\n    if (fractionA === fractionB)\r\n      return undefined;\r\n    let fracA = fractionA;\r\n    let fracB = fractionB;\r\n    const reversed = fractionA > fractionB;\r\n    if (reversed) {\r\n      fracA = fractionB;\r\n      fracB = fractionA;\r\n    }\r\n    const chainDistanceA = fracA * this._totalLength;\r\n    const chainDistanceB = fracB * this._totalLength;\r\n    const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\r\n    if (undefined === fragmentA)\r\n      return undefined;\r\n    const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\r\n    if (undefined === fragmentB)\r\n      return undefined;\r\n    const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\r\n    if (undefined === childCurveIndexA)\r\n      return undefined;\r\n    const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\r\n    if (undefined === childCurveIndexB)\r\n      return undefined;\r\n    const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\r\n    const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\r\n\r\n    // add a (possibly reversed) partial clone to newPath\r\n    const newPath = Path.create();\r\n    const addPartialChild = (childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean): boolean => {\r\n      if (childFraction0 === childFraction1)\r\n        return false;\r\n      let newCurve;\r\n      if (childFraction0 === 0.0 && childFraction1 === 1.0) {\r\n        newCurve = childCurve.clone();\r\n        if (reversedClone)\r\n          newCurve.reverseInPlace();\r\n      } else {\r\n        newCurve = reversedClone ?\r\n          childCurve.clonePartialCurve(childFraction1, childFraction0)\r\n          : childCurve.clonePartialCurve(childFraction0, childFraction1);\r\n      }\r\n      if (newCurve) {\r\n        newPath.children.push(newCurve);\r\n        return true;\r\n      }\r\n      return false;\r\n    };\r\n\r\n    if (fragmentA.childCurve === fragmentB.childCurve) {\r\n      // the two distances are within the same curve.\r\n      if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\r\n        return CurveChainWithDistanceIndex.createCapture(newPath);   // singleton -- children[] does not need to be reversed.\r\n      return undefined;\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\r\n    // at least two distinct children are impacted ....\r\n    for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\r\n      addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\r\n    }\r\n    addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\r\n    // This reverses array entries but not orientation within each curve ...\r\n    if (reversed)\r\n      newPath.children.reverse();\r\n    return CurveChainWithDistanceIndex.createCapture(newPath);\r\n  }\r\n\r\n  /** Ask if the curve is within tolerance of a plane.\r\n   * @returns Returns true if the curve is completely within tolerance of the plane.\r\n   */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    for (const c of this._path.children) {\r\n      if (!c.isInPlane(plane))\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */\r\n  public override startPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(0);\r\n    if (c)\r\n      return c.startPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\r\n  public override endPoint(result?: Point3d): Point3d {\r\n    const c = this._path.cyclicCurvePrimitive(-1);\r\n    if (c)\r\n      return c.endPoint(result);\r\n    return Point3d.createZero(result);\r\n  }\r\n  /** Add strokes to caller-supplied linestring */\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokes(dest, options);\r\n    }\r\n  }\r\n  /** Ask the curve to announce points and simple subcurve fragments for stroking.\r\n   * See IStrokeHandler for description of the sequence of the method calls.\r\n   */\r\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\r\n    for (const c of this._path.children) {\r\n      c.emitStrokableParts(dest, options);\r\n    }\r\n  }\r\n  /**\r\n   * return the stroke count required for given options.\r\n   * @param options StrokeOptions that determine count\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n    let numStroke = 0;\r\n    for (const c of this._path.children) {\r\n      numStroke += c.computeStrokeCountForOptions(options);\r\n    }\r\n    return numStroke;\r\n  }\r\n  /**\r\n   * Return an array containing only the curve primitives.\r\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n   * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.\r\n   * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\r\n   */\r\n  public override collectCurvePrimitivesGo(collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false) {\r\n    if (smallestPossiblePrimitives) {\r\n      for (const c of this._path.children) {\r\n        c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\r\n      }\r\n    } else {\r\n      collectorArray.push(this);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\r\n   * @param options StrokeOptions that determine count\r\n   * @param parentStrokeMap evolving parent map.\r\n   */\r\n  public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\r\n    const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\r\n    for (const c of this._path.children) {\r\n      c.computeAndAttachRecursiveStrokeCounts(options, myMap);\r\n    }\r\n    CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\r\n  }\r\n  /** Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`\r\n   * * Note that this exposes the children individually to the handler.\r\n   */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return this._path.dispatchToGeometryHandler(handler);\r\n  }\r\n  /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed)\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    this._path.extendRange(rangeToExtend, transform);\r\n  }\r\n  /**\r\n   *\r\n   * * Curve length is always positive.\r\n   * @returns Returns a (high accuracy) length of the curve between fractional positions\r\n   * @returns Returns the length of the curve.\r\n   */\r\n  public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\r\n    return Math.abs(fraction1 - fraction0) * this._totalLength;\r\n  }\r\n  /**\r\n   * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\r\n   * @param path primitive array to be CAPTURED (not cloned)\r\n   */\r\n  public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\r\n    const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\r\n    const result = new CurveChainWithDistanceIndex(path, fragments);\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Resolve a fraction of the CurveChain to a PathFragment\r\n   * @param distance\r\n   * @param allowExtrapolation\r\n   */\r\n  public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\r\n    const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\r\n    if (undefined !== i)\r\n      return this._fragments[i];\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Resolve a fraction of the CurveChain to a PathFragment index\r\n   * @param distance\r\n   * @param allowExtrapolation\r\n   */\r\n  protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      if (distance < 0.0)\r\n        return allowExtrapolation ? 0 : undefined;\r\n      if (distance > this._totalLength)\r\n        return allowExtrapolation ? (numFragments - 1) : undefined;\r\n      // humbug, linear search\r\n      for (let i = 0; i < numFragments; i++) {\r\n        if (fragments[i].containsChainDistance(distance)) return i;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Convert distance along the chain to fraction along the chain.\r\n   * @param distance distance along the chain\r\n   */\r\n  public chainDistanceToChainFraction(distance: number): number { return distance / this._totalLength; }\r\n  /**\r\n   * Resolve a fraction within a specific curve to a fragment.\r\n   * @param curve\r\n   * @param fraction\r\n   */\r\n  public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\r\n    const numFragments = this._fragments.length;\r\n    const fragments = this._fragments;\r\n    if (numFragments > 0) {\r\n      // humbug, linear search\r\n      for (const fragment of fragments) {\r\n        if (fragment.containsChildCurveAndChildFraction(curve, fraction))\r\n          return fragment;\r\n      }\r\n      if (fraction <= 0)\r\n        return fragments[0];\r\n      if (fraction > 1.0)\r\n        return fragments[numFragments - 1];\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Returns the total length of curves.\r\n   */\r\n  public override curveLength(): number {\r\n    return this._totalLength;\r\n  }\r\n  /**\r\n   * Returns the total length of the path.\r\n   * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\r\n   */\r\n  public quickLength(): number {\r\n    return this._totalLength;\r\n  }\r\n\r\n  /**\r\n   * Return the point (x,y,z) on the curve at fractional position along the chain.\r\n   * @param fraction fractional position along the geometry.\r\n   * @returns Returns a point on the curve.\r\n   */\r\n  public fractionToPoint(fraction: number, result?: Point3d): Point3d {\r\n    const chainDistance = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(chainDistance, true);\r\n    if (fragment) {\r\n      const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\r\n      return fragment.childCurve.fractionToPoint(childFraction, result);\r\n    }\r\n    // no fragment found.  Use _fragments[0]\r\n    //    fragment = this.chainDistanceToFragment(chainDistance, true);\r\n    return this._fragments[0].childCurve.fractionToPoint(0.0, result);\r\n  }\r\n\r\n  /** Return the point (x,y,z) and derivative on the curve at fractional position.\r\n   *\r\n   * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\r\n   * * this derivative shows the speed of the \"fractional point\" moving along the curve.\r\n   * * this is not generally a unit vector.  use fractionToPointAndUnitTangent for a unit vector.\r\n   * @param fraction fractional position along the geometry.\r\n   * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\r\n   */\r\n  public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n    // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where\r\n    // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.\r\n    // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the\r\n    // derivative we seek is just a scale away.\r\n    const a = this._totalLength / result.direction.magnitude();\r\n    result.direction.scaleInPlace(a);\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n   * @param fraction fractional position on the curve\r\n   * @param result optional receiver for the result.\r\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\r\n   */\r\n  public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\r\n    result.direction.normalizeInPlace();\r\n    return result;\r\n  }\r\n  /** Return a plane with\r\n   *\r\n   * * origin at fractional position along the curve\r\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to the fraction.\r\n   * * vectorV is the second derivative, i.e.derivative of vectorU.\r\n   */\r\n  public fractionToPointAnd2Derivatives(fraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors | undefined {\r\n    const distanceAlongPath = fraction * this._totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\r\n    result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n    if (!result)\r\n      return undefined;\r\n    // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.\r\n    // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :\r\n    // d/df(C'(t(f))) = L d/df(C'/||C'||)\r\n    //  = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\r\n    //  = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\r\n    //  = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' )\r\n    // We have C' and C\" from the fragment.\r\n    const magU = result.vectorU.magnitude();\r\n    const dotUU = magU * magU;\r\n    const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n    result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);\r\n    const scale = this._totalLength / magU;\r\n    result.vectorU.scaleInPlace(scale);\r\n    result.vectorV.scaleInPlace(scale * scale);\r\n    return result;\r\n  }\r\n  /** Attempt to transform in place.\r\n   * * Warning: If any child fails, this object becomes invalid.  But that should never happen.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    let numFail = 0;\r\n    for (const c of this._path.children) {\r\n      if (!c.tryTransformInPlace(transform))\r\n        numFail++;\r\n    }\r\n    return numFail === 0;\r\n  }\r\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\r\n  public reverseInPlace(): void {\r\n    this._path.reverseChildrenInPlace();\r\n    const totalLength = this._totalLength;\r\n    for (const fragment of this._fragments) {\r\n      fragment.reverseFractionsAndDistances(totalLength);\r\n    }\r\n    this._fragments.reverse();\r\n  }\r\n  /**\r\n   * Test for equality conditions:\r\n   * * Mismatched totalLength is a quick exit condition\r\n   * * If totalLength matches, recurse to the path for matching primitives.\r\n   * @param other\r\n   */\r\n  public override isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (other instanceof CurveChainWithDistanceIndex) {\r\n      return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\r\n        && this._path.isAlmostEqual(other._path);\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /** Implement moveSignedDistanceFromFraction.\r\n   * * See `CurvePrimitive` for parameter details.\r\n   * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n   */\r\n  public override moveSignedDistanceFromFraction(startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail): CurveLocationDetail {\r\n    const distanceA = startFraction * this._totalLength;\r\n    const distanceB = distanceA + signedDistance;\r\n    const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\r\n    const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\r\n    const endFraction = startFraction + (signedDistance / this._totalLength);\r\n    const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\r\n    chainDetail.childDetail = childDetail;\r\n    return chainDetail;\r\n  }\r\n\r\n  /**\r\n   *\r\n   * The returned object has\r\n   * * numCalls = number of times closestPoint was called.\r\n   * * numCurvesTested = number of curves tested with full closestPoint\r\n   * * numAssigned = number of times a new minimum value was recorded\r\n   * * numCandidate = number of curves that would be tested in worst case.\r\n   * return an object summarizing closest point test counts\r\n   * @param clear if true, counts are cleared after the return object is formed.\r\n   */\r\n  public static getClosestPointTestCounts(clear: boolean = true): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\r\n    const a = {\r\n      numCalls: this._numCalls,\r\n      numTested: this._numTested,\r\n      numAssigned: this._numAssigned,\r\n      numCandidate: this._numCandidate,\r\n    };\r\n\r\n    if (clear) {\r\n      this._numTested = this._numAssigned = this._numCandidate = 0;\r\n    }\r\n    return a;\r\n  }\r\n  private static _numCalls = 0;\r\n  private static _numTested = 0;\r\n  private static _numAssigned = 0;\r\n  private static _numCandidate = 0;\r\n  /** Search for the curve point that is closest to the spacePoint.\r\n   * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\r\n   *     (via a handler) determines a CurveLocation detail among the children.\r\n   * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.\r\n   * @param spacePoint point in space\r\n   * @param extend true to extend the curve\r\n   * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\r\n   */\r\n  public override closestPoint(spacePoint: Point3d, extend: VariantCurveExtendParameter): CurveLocationDetail | undefined {\r\n    let childDetail: CurveLocationDetail | undefined;\r\n    let aMin = Number.MAX_VALUE;\r\n    const numChildren = this.path.children.length;\r\n    if (numChildren === 1) {\r\n      childDetail = this.path.children[0].closestPoint(spacePoint, extend);\r\n    } else {\r\n      const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\r\n      const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n      const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n      const fragment0 = this._fragments[0];\r\n      const fragment1 = this._fragments[this._fragments.length - 1];\r\n      CurveChainWithDistanceIndex._numCalls++;\r\n      CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\r\n      for (const f of sortedFragments) {\r\n        if (f.a > aMin)\r\n          break;\r\n        CurveChainWithDistanceIndex._numTested++;\r\n        const child = f.childCurve;\r\n        const detailA = child.closestPoint(spacePoint,\r\n          f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\r\n        if (detailA && detailA.a < aMin) {\r\n          aMin = detailA.a;\r\n          childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\r\n          childDetail.a = detailA.a;\r\n          CurveChainWithDistanceIndex._numAssigned++;\r\n        }\r\n      }\r\n\r\n    }\r\n    if (!childDetail)\r\n      return undefined;\r\n    const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\r\n    if (fragment) {\r\n      const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\r\n      const chainFraction = this.chainDistanceToChainFraction(chainDistance);\r\n      const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\r\n      chainDetail.childDetail = childDetail;\r\n      chainDetail.a = childDetail.a;\r\n      return chainDetail;\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /**\r\n   * Construct an offset of each child as viewed in the xy-plane (ignoring z).\r\n   * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully joined offset.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n   */\r\n  public override constructOffsetXY(offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n    const offsets: CurvePrimitive[] = [];\r\n    for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\r\n      const offset = prim.constructOffsetXY(options);\r\n      if (offset !== undefined) {\r\n        if (offset instanceof CurvePrimitive)\r\n          offsets.push(offset);\r\n        else if (Array.isArray(offset))\r\n          offset.forEach((cp) => offsets.push(cp));\r\n      }\r\n    }\r\n    return offsets;\r\n  }\r\n\r\n  /** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.\r\n   */\r\n  public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,4DAAyD;AACzD,kEAA+D;AAC/D,0CAAuC;AAIvC,mEAAkE;AAClE,+CAAuD;AAGvD,uDAA+C;AAC/C,uDAAqG;AACrG,+DAA4D;AAE5D,4FAAyF;AAEzF,mDAAgD;AAChD,iCAA8B;AAG9B;;;;;;GAMG;AACH,MAAa,YAAY;IAevB,yEAAyE;IACzE,YACE,cAAsB,EAAE,cAAsB,EAC9C,SAAiB,EAAE,SAAiB,EACpC,UAA0B,EAAE,KAAe;QAE3C,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;QACrC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,SAAS,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACb,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IACD,0GAA0G;IACnG,4BAA4B,CAAC,UAAmB;QACrD,IAAI,IAAI,CAAC,KAAK,EAAE;YACd,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;SAC/C;QACD,uCAAuC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,8BAA8B,CAAC,SAAyB,EAAE,UAAmB;QACzF,MAAM,eAAe,GAAmB,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE;YACzB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,4BAA4B,CAAC,UAAU,CAAC,CAAC;YACjD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACzB;QACD,eAAe,CAAC,IAAI,CAAC,CAAC,CAAe,EAAE,CAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;OAGG;IACI,kCAAkC,CAAC,KAAqB,EAAE,QAAgB;QAC/E,OAAO,IAAI,CAAC,UAAU,KAAK,KAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,wCAAwC,CAAC,QAAgB;QAC9D,OAAO,mBAAQ,CAAC,kBAAkB,CAChC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,EACxC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAE,CAAC,CAAC,wEAAwE;IAC7G,CAAC;IACD,gGAAgG;IACzF,oCAAoC,CAAC,aAAqB,EAAE,kBAA4B;QAC7F,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,kBAAkB,IAAI,KAAK,CAAC,CAAC;QACzF,OAAO,WAAW,CAAC,QAAQ,CAAC;IAC9B,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,cAAsB;QAC/C,OAAO,cAAc,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC;IACpH,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,aAAqB;QACvD,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,GAAG,GAAG,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;QACzC,IAAI,CAAC,cAAc,GAAG,aAAa,GAAG,EAAE,CAAC;IAC3C,CAAC;IACD,2DAA2D;IACpD,2BAA2B,CAAC,QAAgB;QACjD,OAAO,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IACD;;;;OAIG;IACI,4BAA4B,CAAC,QAAgB;QAClD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,2BAA2B,CAAC,IAAI,CAAC,cAAc,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,QAAQ,GAAG,IAAI,CAAC,cAAc;YAChC,CAAC,GAAG,CAAC,CAAC,CAAC;QACT,OAAO,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;IACjC,CAAC;CACF;AAzHD,oCAyHC;AAED,mEAAmE;AACnE,MAAM,gCAAgC;IAGpC;QACE,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,0EAA0E;IACnE,yBAAyB,CAAC,GAAmB,IAAI,CAAC;IAClD,mBAAmB,CAAC,GAAmB,IAAI,CAAC;IAC5C,uBAAuB,CAAC,GAAmB,IAAI,CAAC;IAChD,iBAAiB,CAAC,GAAmB,IAAI,CAAC;IAC1C,oBAAoB,CAAC,IAAa,EAAE,SAAiB,EAAE,QAAkB,IAAI,CAAC;IACrF,2FAA2F;IACpF,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE9G,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,MAAM,cAAc,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACnC,IAAI,UAAU,IAAI,CAAC,EAAE;YACnB,IAAI,CAAC,oBAAoB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC3F,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;SACpD;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBAC/C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;gBAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3E,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAC7E,eAAO,CAAC,MAAM,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;gBACnD,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;aACxC;SACF;IACH,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;YAC7D,EAAE,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;YAChE,CAAC,GAAG,EAAE,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3C,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAC/B,IAAI,CAAC,oBAAoB,IAAI,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,EAAE,CAAC,qBAAqB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC/C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;SAC1F;IACH,CAAC;IACM,6BAA6B,KAAe,OAAO,IAAI,CAAC,CAAC,CAAC;IAC1D,MAAM,CAAC,uBAAuB,CAAC,IAAgB,EAAE,OAAuB;QAC7E,MAAM,OAAO,GAAG,IAAI,gCAAgC,EAAE,CAAC;QACvD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC5C;QACD,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,CAAC;QACrC,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;;;;;;GAQG;AACH,MAAa,2BAA4B,SAAQ,+BAAc;IAM7D,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,2BAA2B,CAAC;IACtD,CAAC;IACD,4FAA4F;IAC5F,YAAoB,IAAgB,EAAE,SAAyB;QAC7D,KAAK,EAAE,CAAC;QAXV,wCAAwC;QACxB,uBAAkB,GAAG,6BAA6B,CAAC;QAWjE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,YAAY,4BAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAC7D,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACH,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD;;;OAGG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAgB,CAAC;QAC3C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACpE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,IAAI,KAAK,GAAG,SAAS,CAAC;QACtB,MAAM,QAAQ,GAAG,SAAS,GAAG,SAAS,CAAC;QACvC,IAAI,QAAQ,EAAE;YACZ,KAAK,GAAG,SAAS,CAAC;YAClB,KAAK,GAAG,SAAS,CAAC;SACnB;QACD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,cAAc,GAAG,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACrE,IAAI,SAAS,KAAK,SAAS;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3E,IAAI,SAAS,KAAK,gBAAgB;YAChC,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAC5F,MAAM,cAAc,GAAG,SAAS,CAAC,oCAAoC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QAE5F,qDAAqD;QACrD,MAAM,OAAO,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,CACtB,UAA0B,EAAE,cAAsB,EAAE,cAAsB,EAAE,aAAsB,EACzF,EAAE;YACX,IAAI,cAAc,KAAK,cAAc;gBACnC,OAAO,KAAK,CAAC;YACf,IAAI,QAAQ,CAAC;YACb,IAAI,cAAc,KAAK,GAAG,IAAI,cAAc,KAAK,GAAG,EAAE;gBACpD,QAAQ,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;gBAC9B,IAAI,aAAa;oBACf,QAAQ,CAAC,cAAc,EAAE,CAAC;aAC7B;iBAAM;gBACL,QAAQ,GAAG,aAAa,CAAC,CAAC;oBACxB,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC;oBAC5D,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,cAAc,CAAC,CAAC;aAClE;YACD,IAAI,QAAQ,EAAE;gBACZ,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;QACF,IAAI,SAAS,CAAC,UAAU,KAAK,SAAS,CAAC,UAAU,EAAE;YACjD,+CAA+C;YAC/C,IAAI,eAAe,CAAC,SAAS,CAAC,UAAU,EAAE,cAAc,EAAE,cAAc,EAAE,QAAQ,CAAC;gBACjF,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,wDAAwD;YACrH,OAAO,SAAS,CAAC;SAClB;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACtF,mDAAmD;QACnD,KAAK,IAAI,UAAU,GAAG,gBAAgB,GAAG,CAAC,EAAE,UAAU,GAAG,gBAAgB,EAAE,UAAU,EAAE,EAAE;YACvF,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;SACtE;QACD,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,GAAG,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QACtF,wEAAwE;QACxE,IAAI,QAAQ;YACV,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;QAC7B,OAAO,2BAA2B,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD;;;OAGG;IACI,SAAS,CAAC,KAAmC;QAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC;gBACrB,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yGAAyG;IACzF,UAAU,CAAC,MAAgB;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,qGAAqG;IACrF,QAAQ,CAAC,MAAgB;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC;YACH,OAAO,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5B,OAAO,yBAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IACD,gDAAgD;IACzC,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SAC9B;IACH,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,IAAoB,EAAE,OAAuB;QACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;SACrC;IACH,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,OAAuB;QACzD,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,SAAS,IAAI,CAAC,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;SACtD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACa,wBAAwB,CACtC,cAAgC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAElH,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC5F;SACF;aAAM;YACL,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC3B;IACH,CAAC;IACD;;;;OAIG;IACa,qCAAqC,CAAC,OAAuB,EAAE,eAAgC;QAC7G,MAAM,KAAK,GAAG,+BAAc,CAAC,yCAAyC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAC9F,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,CAAC,CAAC,qCAAqC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;SACzD;QACD,+BAAc,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;IACrE,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,OAAwB;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,mGAAmG;IAC5F,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD;;;;OAIG;IACa,2BAA2B,CAAC,SAAiB,EAAE,SAAiB;QAC9E,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC;IAC7D,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAgB,EAAE,OAAuB;QACnE,MAAM,SAAS,GAAG,gCAAgC,CAAC,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC1F,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChE,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAClF,MAAM,CAAC,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC;QAC1E,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACO,4BAA4B,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QAC1F,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY;gBAC9B,OAAO,kBAAkB,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAC7D,wBAAwB;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACrC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,CAAC,CAAC;aAC5D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB;QAClD,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,YAAY,GAAG,CAAC,EAAE;YACpB,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,kCAAkC,CAAC,KAAK,EAAE,QAAQ,CAAC;oBAC9D,OAAO,QAAQ,CAAC;aACnB;YACD,IAAI,QAAQ,IAAI,CAAC;gBACf,OAAO,SAAS,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,GAAG;gBAChB,OAAO,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC;SACtC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0CAA0C;IAC1B,WAAW;QACzB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,EAAE,MAAgB;QACvD,MAAM,aAAa,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QACnE,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;YACzF,OAAO,QAAQ,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;SACnE;QACD,wCAAwC;QACxC,mEAAmE;QACnE,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACpE,CAAC;IACD;;;;;;;OAOG;IACI,4BAA4B,CAAC,QAAgB,EAAE,MAAc;QAClE,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,iFAAiF;QACjF,6EAA6E;QAC7E,sEAAsE;QACtE,2CAA2C;QAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,GAAG,MAAM,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACa,6BAA6B,CAAC,QAAgB,EAAE,MAAc;QAC5E,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,MAAM,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,8BAA8B,CACnC,QAAgB,EAAE,MAAkC;QAEpD,MAAM,iBAAiB,GAAG,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,EAAE,IAAI,CAAC,CAAC;QAC7F,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,gFAAgF;QAChF,kFAAkF;QAClF,qCAAqC;QACrC,oDAAoD;QACpD,kEAAkE;QAClE,yCAAyC;QACzC,uCAAuC;QACvC,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,CAAC,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;YACnC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;gBACnC,OAAO,EAAE,CAAC;SACb;QACD,OAAO,OAAO,KAAK,CAAC,CAAC;IACvB,CAAC;IACD,gGAAgG;IACzF,cAAc;QACnB,IAAI,CAAC,KAAK,CAAC,sBAAsB,EAAE,CAAC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE;YACtC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;SACpD;QACD,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAClE,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SAC5C;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACa,8BAA8B,CAC5C,aAAqB,EAAE,cAAsB,EAAE,cAAuB,EAAE,MAA4B;QAEpG,MAAM,SAAS,GAAG,aAAa,GAAG,IAAI,CAAC,YAAY,CAAC;QACpD,MAAM,SAAS,GAAG,SAAS,GAAG,cAAc,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,uBAAuB,CAAC,SAAS,EAAE,IAAI,CAAE,CAAC;QACjE,MAAM,WAAW,GAAG,SAAS,CAAC,UAAU,CAAC,8BAA8B,CAAC,SAAS,CAAC,cAAc,EAAE,SAAS,GAAG,SAAS,CAAC,cAAc,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QAChK,MAAM,WAAW,GAAG,aAAa,GAAG,CAAC,cAAc,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,yCAAmB,CAAC,mCAAmC,CAAC,cAAc,EAAE,IAAI,EAAE,aAAa,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,CAAC,CAAC;QACtJ,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;QACtC,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,yBAAyB,CACrC,QAAiB,IAAI;QAErB,MAAM,CAAC,GAAG;YACR,QAAQ,EAAE,IAAI,CAAC,SAAS;YACxB,SAAS,EAAE,IAAI,CAAC,UAAU;YAC1B,WAAW,EAAE,IAAI,CAAC,YAAY;YAC9B,YAAY,EAAE,IAAI,CAAC,aAAa;SACjC,CAAC;QACF,IAAI,KAAK,EAAE;YACT,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;SAC9D;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAKD;;;;;;;;;OASG;IACa,YAAY,CAC1B,UAAmB,EAAE,MAAmC;QAExD,IAAI,WAA4C,CAAC;QACjD,IAAI,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;SACtE;aAAM;YACL,MAAM,eAAe,GAAG,YAAY,CAAC,8BAA8B,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;YACjG,MAAM,OAAO,GAAG,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,oCAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,2BAA2B,CAAC,SAAS,EAAE,CAAC;YACxC,2BAA2B,CAAC,aAAa,IAAI,eAAe,CAAC,MAAM,CAAC;YACpE,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;gBAC/B,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI;oBACZ,MAAM;gBACR,2BAA2B,CAAC,UAAU,EAAE,CAAC;gBACzC,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC;gBAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAC3C,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAE,CAAC;oBACzH,WAAW,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;oBAC1B,2BAA2B,CAAC,YAAY,EAAE,CAAC;iBAC5C;aACF;SACF;QACD,IAAI,CAAC,WAAW;YACd,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,+BAA+B,CAAC,WAAW,CAAC,KAAM,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAC;QAChG,IAAI,QAAQ,EAAE;YACZ,MAAM,aAAa,GAAG,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAClF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,WAAW,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAC9B,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACa,iBAAiB,CAC/B,uBAA+C;QAE/C,MAAM,OAAO,GAAG,6BAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAqB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,sBAAsB,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YACrE,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;YAC/C,IAAI,MAAM,KAAK,SAAS,EAAE;gBACxB,IAAI,MAAM,YAAY,+BAAc;oBAClC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;qBAClB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;oBAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC5C;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;OAOG;IACa,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QAC9E,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;;AA1Fc,qCAAS,GAAG,CAAC,AAAJ,CAAK;AACd,sCAAU,GAAG,CAAC,AAAJ,CAAK;AACf,wCAAY,GAAG,CAAC,AAAJ,CAAK;AACjB,yCAAa,GAAG,CAAC,AAAJ,CAAK;AAtctB,kEAA2B","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 { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { StrokeCountMap } from \"../curve/Query/StrokeCountMap\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler, IStrokeHandler } from \"../geometry3d/GeometryHandler\";\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\nimport { Plane3dByOriginAndVectors } from \"../geometry3d/Plane3dByOriginAndVectors\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { CurveChain } from \"./CurveCollection\";\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"./CurveExtendMode\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { LineString3d } from \"./LineString3d\";\nimport { OffsetOptions } from \"./OffsetOptions\";\nimport { Path } from \"./Path\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\n/**\n * Annotation of an interval of a curve.\n * * The interval is marked with two pairs of numbers:\n * * * fraction0, fraction1 = fraction parameters along the child curve\n * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex\n * @public\n */\nexport class PathFragment {\n  /** Distance along parent to this fragment start */\n  public chainDistance0: number;\n  /** Distance along parent to this fragment end */\n  public chainDistance1: number;\n  /** Fractional position of this fragment start within its curve primitive. */\n  public childFraction0: number;\n  /** Fractional position of this fragment end within its curve primitive.. */\n  public childFraction1: number;\n  /** Curve primitive of this fragment, as presented in stroker.  Note that this might have become a proxy. */\n  public childCurve: CurvePrimitive;\n  /** Optional range */\n  public range?: Range3d;\n  /** Working var for use in searches. */\n  public a: number;\n  /** Create a fragment with complete fraction, distance and child data. */\n  public constructor(\n    childFraction0: number, childFraction1: number,\n    distance0: number, distance1: number,\n    childCurve: CurvePrimitive, range?: Range3d,\n  ) {\n    this.childFraction0 = childFraction0;\n    this.childFraction1 = childFraction1;\n    this.chainDistance0 = distance0;\n    this.chainDistance1 = distance1;\n    this.childCurve = childCurve;\n    this.range = range;\n    this.a = 0;\n  }\n  /**\n   * Return true if the distance is within the distance limits of this fragment.\n   * @param distance\n   */\n  public containsChainDistance(distance: number): boolean {\n    return distance >= this.chainDistance0 && distance <= this.chainDistance1;\n  }\n  /** Return a quick distance to the curve.  This may be SMALLER than true distance but may not be larger */\n  public quickMinDistanceToChildCurve(spacePoint: Point3d): number {\n    if (this.range) {\n      return this.range.distanceToPoint(spacePoint);\n    }\n    // ugh.  have to do real computation ..\n    const detail = this.childCurve.closestPoint(spacePoint, false);\n    if (detail)\n      return detail.a;\n    return 0;\n  }\n  /**\n   * Return an array with (references to) all the path fragments, sorted smallest to largest on the \"a\" value\n   * equal to the quick min distance to the fragment\n   */\n  public static collectSortedQuickMinDistances(fragments: PathFragment[], spacePoint: Point3d): PathFragment[] {\n    const sortedFragments: PathFragment[] = [];\n    for (const f of fragments) {\n      f.a = f.quickMinDistanceToChildCurve(spacePoint);\n      sortedFragments.push(f);\n    }\n    sortedFragments.sort((a: PathFragment, b: PathFragment) => a.a - b.a);\n    return sortedFragments;\n  }\n  /**\n   * Return true if this fragment addresses `curve` and brackets `fraction`\n   * @param distance\n   */\n  public containsChildCurveAndChildFraction(curve: CurvePrimitive, fraction: number): boolean {\n    return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;\n  }\n  /**\n   * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.\n   * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.\n   */\n  public chainDistanceToInterpolatedChildFraction(distance: number): number {\n    return Geometry.inverseInterpolate(\n      this.childFraction0, this.chainDistance0,\n      this.childFraction1, this.chainDistance1,\n      distance, this.childFraction0)!; // the interval \"must\" have nonzero length, division should be safe . ..\n  }\n  /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */\n  public chainDistanceToAccurateChildFraction(chainDistance: number, allowExtrapolation?: boolean): number {\n    // The fragments are really expected to do good mappings in their distance range ...\n    const childDetail = this.childCurve.moveSignedDistanceFromFraction(\n      this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);\n    return childDetail.fraction;\n  }\n  /**\n   * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives\n   * @param globalDistance total length of the global curve.\n   */\n  public fractionScaleFactor(globalDistance: number): number {\n    return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);\n  }\n  /**\n   * Reverse the fraction and distance data.\n   * * each child fraction `f` is replaced by `1-f`\n   * * each `chainDistance` is replaced by `totalDistance-chainDistance`\n   */\n  public reverseFractionsAndDistances(totalDistance: number) {\n    const f0 = this.childFraction0;\n    const f1 = this.childFraction1;\n    const d0 = this.chainDistance0;\n    const d1 = this.chainDistance1;\n    this.childFraction0 = 1.0 - f1;\n    this.childFraction1 = 1.0 - f0;\n    this.chainDistance0 = totalDistance - d1;\n    this.chainDistance1 = totalDistance - d0;\n  }\n  /** @deprecated in 3.x. Use childFractionToChainDistance */\n  public childFractionTChainDistance(fraction: number): number {\n    return this.childFractionToChainDistance(fraction);\n  }\n  /**\n   * Convert a fractional position on the childCurve to distance in the chain space.\n   * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.\n   * @param fraction fraction along the curve within this fragment\n   */\n  public childFractionToChainDistance(fraction: number): number {\n    let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);\n    if (fraction < this.childFraction0)\n      d = -d;\n    return this.chainDistance0 + d;\n  }\n}\n\n/** Non-instantiable class to build a distance index for a path. */\nclass DistanceIndexConstructionContext implements IStrokeHandler {\n  private _fragments: PathFragment[];\n  private _accumulatedDistance: number;\n  private constructor() {\n    this._accumulatedDistance = 0;\n    this._fragments = [];\n  }\n  // ignore curve announcements -- they are repeated in stroke announcements\n  public startParentCurvePrimitive(_cp: CurvePrimitive) { }\n  public startCurvePrimitive(_cp: CurvePrimitive) { }\n  public endParentCurvePrimitive(_cp: CurvePrimitive) { }\n  public endCurvePrimitive(_cp: CurvePrimitive) { }\n  public announcePointTangent(_xyz: Point3d, _fraction: number, _tangent: Vector3d) { }\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\n  public announceSegmentInterval(\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    const fragmentPoint0 = point0.clone();\n    const fragmentPoint1 = point1.clone();\n    let d0 = this._accumulatedDistance;\n    if (numStrokes <= 1) {\n      this._accumulatedDistance += point0.distance(point1);\n      this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp,\n        Range3d.create(fragmentPoint0, fragmentPoint1)));\n    } else {\n      let f1;\n      for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\n        f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\n        point0.interpolate(f1, point1, fragmentPoint1);\n        d0 = this._accumulatedDistance;\n        this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));\n        this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp,\n          Range3d.create(fragmentPoint0, fragmentPoint1)));\n        fragmentPoint0.setFrom(fragmentPoint1);\n      }\n    }\n  }\n  public announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    let f1, d, d0;\n    for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {\n      f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\n      d = cp.curveLengthBetweenFractions(f0, f1);\n      d0 = this._accumulatedDistance;\n      this._accumulatedDistance += d;\n      const range = cp.rangeBetweenFractions(f0, f1);\n      this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));\n    }\n  }\n  public needPrimaryGeometryForStrokes?(): boolean { return true; }\n  public static createPathFragmentIndex(path: CurveChain, options?: StrokeOptions): PathFragment[] {\n    const handler = new DistanceIndexConstructionContext();\n    for (const curve of path.children) {\n      curve.emitStrokableParts(handler, options);\n    }\n    const fragments = handler._fragments;\n    return fragments;\n  }\n}\n/**\n * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true\n * distance along a CurveChain.\n * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`\n * to `t1` is easily computed as `L*(t1-t0)`.\n * * The curve chain can be any type derived from CurveChain.\n * * * i.e. either a `Path` or a `Loop`\n * @public\n */\nexport class CurveChainWithDistanceIndex extends CurvePrimitive {\n  /** String name for schema properties */\n  public readonly curvePrimitiveType = \"curveChainWithDistanceIndex\";\n  private readonly _path: CurveChain;\n  private readonly _fragments: PathFragment[];\n  private readonly _totalLength: number; // matches final fragment distance1.\n  /** Test if other is a `CurveChainWithDistanceIndex` */\n  public isSameGeometryClass(other: GeometryQuery): boolean {\n    return other instanceof CurveChainWithDistanceIndex;\n  }\n  // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.\n  private constructor(path: CurveChain, fragments: PathFragment[]) {\n    super();\n    this._path = path;\n    this._fragments = fragments;\n    this._totalLength = fragments.length > 0 ? fragments[fragments.length - 1].chainDistance1 : 0;\n  }\n  /**\n   * Create a clone, transformed and with its own distance index.\n   * @param transform transform to apply in the clone.\n   */\n  public cloneTransformed(transform: Transform): CurveChainWithDistanceIndex | undefined {\n    const c = this._path.clone();\n    if (c instanceof CurveChain && c.tryTransformInPlace(transform))\n      return CurveChainWithDistanceIndex.createCapture(c);\n    return undefined;\n  }\n  /**\n   * Reference to the contained path.\n   * * Do not modify the path.  The distance index will be wrong.\n   */\n  public get path(): CurveChain {\n    return this._path;\n  }\n  /**\n   * Reference to the fragments array.\n   * * Do not modify.\n   */\n  public get fragments(): PathFragment[] {\n    return this._fragments;\n  }\n  /** Return a deep clone */\n  public clone(): CurveChainWithDistanceIndex {\n    const c = this._path.clone() as CurveChain;\n    return CurveChainWithDistanceIndex.createCapture(c);\n  }\n  /** Return a deep clone */\n  public override clonePartialCurve(fractionA: number, fractionB: number): CurveChainWithDistanceIndex | undefined {\n    if (fractionA === fractionB)\n      return undefined;\n    let fracA = fractionA;\n    let fracB = fractionB;\n    const reversed = fractionA > fractionB;\n    if (reversed) {\n      fracA = fractionB;\n      fracB = fractionA;\n    }\n    const chainDistanceA = fracA * this._totalLength;\n    const chainDistanceB = fracB * this._totalLength;\n    const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);\n    if (undefined === fragmentA)\n      return undefined;\n    const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);\n    if (undefined === fragmentB)\n      return undefined;\n    const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);\n    if (undefined === childCurveIndexA)\n      return undefined;\n    const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);\n    if (undefined === childCurveIndexB)\n      return undefined;\n    const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);\n    const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);\n\n    // add a (possibly reversed) partial clone to newPath\n    const newPath = Path.create();\n    const addPartialChild = (\n      childCurve: CurvePrimitive, childFraction0: number, childFraction1: number, reversedClone: boolean,\n    ): boolean => {\n      if (childFraction0 === childFraction1)\n        return false;\n      let newCurve;\n      if (childFraction0 === 0.0 && childFraction1 === 1.0) {\n        newCurve = childCurve.clone();\n        if (reversedClone)\n          newCurve.reverseInPlace();\n      } else {\n        newCurve = reversedClone ?\n          childCurve.clonePartialCurve(childFraction1, childFraction0)\n          : childCurve.clonePartialCurve(childFraction0, childFraction1);\n      }\n      if (newCurve) {\n        newPath.children.push(newCurve);\n        return true;\n      }\n      return false;\n    };\n    if (fragmentA.childCurve === fragmentB.childCurve) {\n      // the two distances are within the same curve.\n      if (addPartialChild(fragmentA.childCurve, childFractionA, childFractionB, reversed))\n        return CurveChainWithDistanceIndex.createCapture(newPath); // singleton -- children[] does not need to be reversed.\n      return undefined;\n    }\n    addPartialChild(this._path.children[childCurveIndexA], childFractionA, 1.0, reversed);\n    // at least two distinct children are impacted ....\n    for (let childIndex = childCurveIndexA + 1; childIndex < childCurveIndexB; childIndex++) {\n      addPartialChild(this._path.children[childIndex], 0.0, 1.0, reversed);\n    }\n    addPartialChild(this._path.children[childCurveIndexB], 0.0, childFractionB, reversed);\n    // This reverses array entries but not orientation within each curve ...\n    if (reversed)\n      newPath.children.reverse();\n    return CurveChainWithDistanceIndex.createCapture(newPath);\n  }\n  /**\n   * Ask if the curve is within tolerance of a plane.\n   * @returns Returns true if the curve is completely within tolerance of the plane.\n   */\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\n    for (const c of this._path.children) {\n      if (!c.isInPlane(plane))\n        return false;\n    }\n    return true;\n  }\n  /** Return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */\n  public override startPoint(result?: Point3d): Point3d {\n    const c = this._path.cyclicCurvePrimitive(0);\n    if (c)\n      return c.startPoint(result);\n    return Point3d.createZero(result);\n  }\n  /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */\n  public override endPoint(result?: Point3d): Point3d {\n    const c = this._path.cyclicCurvePrimitive(-1);\n    if (c)\n      return c.endPoint(result);\n    return Point3d.createZero(result);\n  }\n  /** Add strokes to caller-supplied linestring */\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\n    for (const c of this._path.children) {\n      c.emitStrokes(dest, options);\n    }\n  }\n  /**\n   * Ask the curve to announce points and simple subcurve fragments for stroking.\n   * See IStrokeHandler for description of the sequence of the method calls.\n   */\n  public emitStrokableParts(dest: IStrokeHandler, options?: StrokeOptions): void {\n    for (const c of this._path.children) {\n      c.emitStrokableParts(dest, options);\n    }\n  }\n  /**\n   * Return the stroke count required for given options.\n   * @param options StrokeOptions that determine count\n   */\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\n    let numStroke = 0;\n    for (const c of this._path.children) {\n      numStroke += c.computeStrokeCountForOptions(options);\n    }\n    return numStroke;\n  }\n  /**\n   * Return an array containing only the curve primitives.\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\n   * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.\n   * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each\n   * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].\n   */\n  public override collectCurvePrimitivesGo(\n    collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\n  ): void {\n    if (smallestPossiblePrimitives) {\n      for (const c of this._path.children) {\n        c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives, explodeLineStrings);\n      }\n    } else {\n      collectorArray.push(this);\n    }\n  }\n  /**\n   * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.\n   * @param options StrokeOptions that determine count\n   * @param parentStrokeMap evolving parent map.\n   */\n  public override computeAndAttachRecursiveStrokeCounts(options?: StrokeOptions, parentStrokeMap?: StrokeCountMap) {\n    const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);\n    for (const c of this._path.children) {\n      c.computeAndAttachRecursiveStrokeCounts(options, myMap);\n    }\n    CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);\n  }\n  /**\n   * Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`\n   * * Note that this exposes the children individually to the handler.\n   */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return this._path.dispatchToGeometryHandler(handler);\n  }\n  /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\n    this._path.extendRange(rangeToExtend, transform);\n  }\n  /**\n   * Curve length is always positive.\n   * @returns Returns a (high accuracy) length of the curve between fractional positions\n   * @returns Returns the length of the curve.\n   */\n  public override curveLengthBetweenFractions(fraction0: number, fraction1: number): number {\n    return Math.abs(fraction1 - fraction0) * this._totalLength;\n  }\n  /**\n   * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`\n   * @param path primitive array to be CAPTURED (not cloned)\n   */\n  public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex {\n    const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);\n    const result = new CurveChainWithDistanceIndex(path, fragments);\n    return result;\n  }\n  /**\n   * Resolve a fraction of the CurveChain to a PathFragment\n   * @param distance\n   * @param allowExtrapolation\n   */\n  public chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | undefined {\n    const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);\n    if (undefined !== i)\n      return this._fragments[i];\n    return undefined;\n  }\n  /**\n   * Resolve a fraction of the CurveChain to a PathFragment index\n   * @param distance\n   * @param allowExtrapolation\n   */\n  protected chainDistanceToFragmentIndex(distance: number, allowExtrapolation: boolean = false): number | undefined {\n    const numFragments = this._fragments.length;\n    const fragments = this._fragments;\n    if (numFragments > 0) {\n      if (distance < 0.0)\n        return allowExtrapolation ? 0 : undefined;\n      if (distance > this._totalLength)\n        return allowExtrapolation ? (numFragments - 1) : undefined;\n      // humbug, linear search\n      for (let i = 0; i < numFragments; i++) {\n        if (fragments[i].containsChainDistance(distance)) return i;\n      }\n    }\n    return undefined;\n  }\n  /**\n   * Convert distance along the chain to fraction along the chain.\n   * @param distance distance along the chain\n   */\n  public chainDistanceToChainFraction(distance: number): number {\n    return distance / this._totalLength;\n  }\n  /**\n   * Resolve a fraction within a specific curve to a fragment.\n   * @param curve\n   * @param fraction\n   */\n  public curveAndChildFractionToFragment(curve: CurvePrimitive, fraction: number): PathFragment | undefined {\n    const numFragments = this._fragments.length;\n    const fragments = this._fragments;\n    if (numFragments > 0) {\n      // humbug, linear search\n      for (const fragment of fragments) {\n        if (fragment.containsChildCurveAndChildFraction(curve, fraction))\n          return fragment;\n      }\n      if (fraction <= 0)\n        return fragments[0];\n      if (fraction > 1.0)\n        return fragments[numFragments - 1];\n    }\n    return undefined;\n  }\n  /** Returns the total length of curves. */\n  public override curveLength(): number {\n    return this._totalLength;\n  }\n  /**\n   * Returns the total length of the path.\n   * * This is exact (and simple property lookup) because the true lengths were summed at construction time.\n   */\n  public quickLength(): number {\n    return this._totalLength;\n  }\n  /**\n   * Return the point (x,y,z) on the curve at fractional position along the chain.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a point on the curve.\n   */\n  public fractionToPoint(fraction: number, result?: Point3d): Point3d {\n    const chainDistance = fraction * this._totalLength;\n    const fragment = this.chainDistanceToFragment(chainDistance, true);\n    if (fragment) {\n      const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);\n      return fragment.childCurve.fractionToPoint(childFraction, result);\n    }\n    // no fragment found.  Use _fragments[0]\n    //    fragment = this.chainDistanceToFragment(chainDistance, true);\n    return this._fragments[0].childCurve.fractionToPoint(0.0, result);\n  }\n  /**\n   * Return the point (x,y,z) and derivative on the curve at fractional position.\n   * * Note that this derivative is \"derivative of xyz with respect to fraction.\"\n   * * this derivative shows the speed of the \"fractional point\" moving along the curve.\n   * * this is not generally a unit vector.  use fractionToPointAndUnitTangent for a unit vector.\n   * @param fraction fractional position along the geometry.\n   * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.\n   */\n  public fractionToPointAndDerivative(fraction: number, result?: Ray3d): Ray3d {\n    const distanceAlongPath = fraction * this._totalLength;\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\n    // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where\n    // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.\n    // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the\n    // derivative we seek is just a scale away.\n    const a = this._totalLength / result.direction.magnitude();\n    result.direction.scaleInPlace(a);\n    return result;\n  }\n  /**\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\n   * @param fraction fractional position on the curve\n   * @param result optional receiver for the result.\n   * Returns a ray whose origin is the curve point and direction is the unit tangent.\n   */\n  public override fractionToPointAndUnitTangent(fraction: number, result?: Ray3d): Ray3d {\n    const distanceAlongPath = fraction * this._totalLength;\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\n    result.direction.normalizeInPlace();\n    return result;\n  }\n  /**\n   * Return a plane with\n   * * origin at fractional position along the curve\n   * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to\n   * the fraction.\n   * * vectorV is the second derivative, i.e.derivative of vectorU.\n   */\n  public fractionToPointAnd2Derivatives(\n    fraction: number, result?: Plane3dByOriginAndVectors,\n  ): Plane3dByOriginAndVectors | undefined {\n    const distanceAlongPath = fraction * this._totalLength;\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);\n    result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\n    if (!result)\n      return undefined;\n    // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.\n    // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :\n    // d/df(C'(t(f))) = L d/df(C'/||C'||)\n    //  = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2\n    //  = L (||C'|| C\" L/||C'|| - C' C'.C\"/||C'|| L/||C'||) / ||C'||^2\n    //  = (L/||C'||)^2 (C\" - C' C'.C\"/C'.C' )\n    // We have C' and C\" from the fragment.\n    const magU = result.vectorU.magnitude();\n    const dotUU = magU * magU;\n    const dotUV = result.vectorU.dotProduct(result.vectorV);\n    result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);\n    const scale = this._totalLength / magU;\n    result.vectorU.scaleInPlace(scale);\n    result.vectorV.scaleInPlace(scale * scale);\n    return result;\n  }\n  /**\n   * Attempt to transform in place.\n   * * Warning: If any child fails, this object becomes invalid.  But that should never happen.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    let numFail = 0;\n    for (const c of this._path.children) {\n      if (!c.tryTransformInPlace(transform))\n        numFail++;\n    }\n    return numFail === 0;\n  }\n  /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */\n  public reverseInPlace(): void {\n    this._path.reverseChildrenInPlace();\n    const totalLength = this._totalLength;\n    for (const fragment of this._fragments) {\n      fragment.reverseFractionsAndDistances(totalLength);\n    }\n    this._fragments.reverse();\n  }\n  /**\n   * Test for equality conditions:\n   * * Mismatched totalLength is a quick exit condition\n   * * If totalLength matches, recurse to the path for matching primitives.\n   * @param other\n   */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof CurveChainWithDistanceIndex) {\n      return Geometry.isSameCoordinate(this._totalLength, other._totalLength)\n        && this._path.isAlmostEqual(other._path);\n    }\n    return false;\n  }\n  /**\n   * Implement moveSignedDistanceFromFraction.\n   * * See `CurvePrimitive` for parameter details.\n   * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and\n   * has pointer to an additional detail for the child curve.\n   */\n  public override moveSignedDistanceFromFraction(\n    startFraction: number, signedDistance: number, allowExtension: boolean, result?: CurveLocationDetail,\n  ): CurveLocationDetail {\n    const distanceA = startFraction * this._totalLength;\n    const distanceB = distanceA + signedDistance;\n    const fragmentB = this.chainDistanceToFragment(distanceB, true)!;\n    const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);\n    const endFraction = startFraction + (signedDistance / this._totalLength);\n    const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);\n    chainDetail.childDetail = childDetail;\n    return chainDetail;\n  }\n  /**\n   * The returned object has\n   * * numCalls = number of times closestPoint was called.\n   * * numCurvesTested = number of curves tested with full closestPoint\n   * * numAssigned = number of times a new minimum value was recorded\n   * * numCandidate = number of curves that would be tested in worst case.\n   * return an object summarizing closest point test counts\n   * @param clear if true, counts are cleared after the return object is formed.\n   */\n  public static getClosestPointTestCounts(\n    clear: boolean = true,\n  ): { numCalls: number, numTested: number, numAssigned: number, numCandidate: number } {\n    const a = {\n      numCalls: this._numCalls,\n      numTested: this._numTested,\n      numAssigned: this._numAssigned,\n      numCandidate: this._numCandidate,\n    };\n    if (clear) {\n      this._numTested = this._numAssigned = this._numCandidate = 0;\n    }\n    return a;\n  }\n  private static _numCalls = 0;\n  private static _numTested = 0;\n  private static _numAssigned = 0;\n  private static _numCandidate = 0;\n  /**\n   * Search for the curve point that is closest to the spacePoint.\n   * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which\n   *     (via a handler) determines a CurveLocation detail among the children.\n   * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and\n   * has pointer to an additional detail for the child curve.\n   * @param spacePoint point in space\n   * @param extend true to extend the curve\n   * @returns Returns a CurveLocationDetail structure that holds the details of the close point.\n   */\n  public override closestPoint(\n    spacePoint: Point3d, extend: VariantCurveExtendParameter,\n  ): CurveLocationDetail | undefined {\n    let childDetail: CurveLocationDetail | undefined;\n    let aMin = Number.MAX_VALUE;\n    const numChildren = this.path.children.length;\n    if (numChildren === 1) {\n      childDetail = this.path.children[0].closestPoint(spacePoint, extend);\n    } else {\n      const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);\n      const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\n      const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\n      const fragment0 = this._fragments[0];\n      const fragment1 = this._fragments[this._fragments.length - 1];\n      CurveChainWithDistanceIndex._numCalls++;\n      CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;\n      for (const f of sortedFragments) {\n        if (f.a > aMin)\n          break;\n        CurveChainWithDistanceIndex._numTested++;\n        const child = f.childCurve;\n        const detailA = child.closestPoint(spacePoint,\n          f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);\n        if (detailA && detailA.a < aMin) {\n          aMin = detailA.a;\n          childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail)!;\n          childDetail.a = detailA.a;\n          CurveChainWithDistanceIndex._numAssigned++;\n        }\n      }\n    }\n    if (!childDetail)\n      return undefined;\n    const fragment = this.curveAndChildFractionToFragment(childDetail.curve!, childDetail.fraction);\n    if (fragment) {\n      const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);\n      const chainFraction = this.chainDistanceToChainFraction(chainDistance);\n      const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);\n      chainDetail.childDetail = childDetail;\n      chainDetail.a = childDetail.a;\n      return chainDetail;\n    }\n    return undefined;\n  }\n  /**\n   * Construct an offset of each child as viewed in the xy-plane (ignoring z).\n   * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully\n   * joined offset.\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\n   */\n  public override constructOffsetXY(\n    offsetDistanceOrOptions: number | OffsetOptions,\n  ): CurvePrimitive | CurvePrimitive[] | undefined {\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\n    const offsets: CurvePrimitive[] = [];\n    for (const prim of this.collectCurvePrimitives(undefined, true, true)) {\n      const offset = prim.constructOffsetXY(options);\n      if (offset !== undefined) {\n        if (offset instanceof CurvePrimitive)\n          offsets.push(offset);\n        else if (Array.isArray(offset))\n          offset.forEach((cp) => offsets.push(cp));\n      }\n    }\n    return offsets;\n  }\n  /**\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of\n   * projection.\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\n   * @param lowHigh optional receiver for output\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\n   * end of the ray.\n   */\n  public override projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\n  }\n}\n"]}