@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/curve/CurveChainWithDistanceIndex.js

@@ -0,0 +1,513 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurvePrimitive } from "../curve/CurvePrimitive";
+import { StrokeCountMap } from "../curve/Query/StrokeCountMap";
+import { Geometry } from "../Geometry";
+import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
+import { CurveChain } from "./CurveCollection";
+import { CurveExtendMode, CurveExtendOptions } from "./CurveExtendMode";
+import { CurveLocationDetail } from "./CurveLocationDetail";
+/**
+ * * 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
+ * @public
+ */
+export class PathFragment {
+    /** Create a fragment with complete fraction, distance and child data. */
+    constructor(childFraction0, childFraction1, distance0, distance1, childCurve) {
+        this.childFraction0 = childFraction0;
+        this.childFraction1 = childFraction1;
+        this.chainDistance0 = distance0;
+        this.chainDistance1 = distance1;
+        this.childCurve = childCurve;
+    }
+    /**
+     * Return true if the distance is within the distance limits of this fragment.
+     * @param distance
+     */
+    containsChainDistance(distance) {
+        return distance >= this.chainDistance0 && distance <= this.chainDistance1;
+    }
+    /**
+     * Return true if this fragment addresses `curve` and brackets `fraction`
+     * @param distance
+     */
+    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.
+     * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.
+     */
+    chainDistanceToInterpolatedChildFraction(distance) {
+        return 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
+     */
+    chainDistanceToAccurateChildFraction(chainDistance) {
+        // The fragments are really expected to do good mappings in their distance range ...
+        const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, false);
+        return childDetail.fraction;
+    }
+    /** 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.
+     * * each child fraction `f` is replaced by `1-f`
+     * * each `chainDistance` is replaced by `totalDistance-chainDistance`
+     */
+    reverseFractionsAndDistances(totalDistance) {
+        const f0 = this.childFraction0;
+        const f1 = this.childFraction1;
+        const d0 = this.chainDistance0;
+        const d1 = this.chainDistance1;
+        this.childFraction0 = 1.0 - f1;
+        this.childFraction1 = 1.0 - f0;
+        this.chainDistance0 = totalDistance - d1;
+        this.chainDistance1 = totalDistance - d0;
+    }
+    /**
+     * 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
+     */
+    childFractionTChainDistance(fraction) {
+        let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);
+        if (fraction < this.childFraction0)
+            d = -d;
+        return this.chainDistance0 + d;
+    }
+}
+/** Non-instantiable class to build a distance index for a path. */
+class DistanceIndexConstructionContext {
+    constructor() {
+        this._accumulatedDistance = 0;
+        this._fragments = [];
+    }
+    // ignore curve announcements -- they are repeated in stroke announcements
+    startParentCurvePrimitive(_cp) { }
+    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) {
+        let d0 = this._accumulatedDistance;
+        if (numStrokes <= 1) {
+            this._accumulatedDistance += point0.distance(point1);
+            this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp));
+        }
+        else {
+            let f1;
+            for (let i = 1, f0 = 0.0; i <= numStrokes; i++, f0 = f1) {
+                f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);
+                d0 = this._accumulatedDistance;
+                this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));
+                this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp));
+            }
+        }
+    }
+    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
+        let f1, d, d0;
+        for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {
+            f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);
+            d = cp.curveLengthBetweenFractions(f0, f1);
+            d0 = this._accumulatedDistance;
+            this._accumulatedDistance += d;
+            this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp));
+        }
+    }
+    static createPathFragmentIndex(path, options) {
+        const handler = new DistanceIndexConstructionContext();
+        for (const curve of path.children) {
+            curve.emitStrokableParts(handler, options);
+        }
+        const fragments = handler._fragments;
+        return fragments;
+    }
+}
+/**
+ * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true
+ * distance along a CurveChain.
+ * * The curve chain can be any type derived from CurveChain.
+ * * * i.e. either a `Path` or a `Loop`
+ * @public
+ */
+export class CurveChainWithDistanceIndex extends CurvePrimitive {
+    // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.
+    constructor(path, fragments) {
+        super();
+        /** String name for schema properties */
+        this.curvePrimitiveType = "curveChainWithDistanceIndex";
+        this._path = path;
+        this._fragments = fragments;
+        this._totalLength = fragments[fragments.length - 1].chainDistance1;
+    }
+    /** Test if other is a `CurveChainWithDistanceIndex` */
+    isSameGeometryClass(other) { return other instanceof CurveChainWithDistanceIndex; }
+    /**
+     * Create a clone, transformed and with its own distance index.
+     * @param transform transform to apply in the clone.
+     */
+    cloneTransformed(transform) {
+        const c = this._path.clone();
+        if (c !== undefined && c instanceof CurveChain && c.tryTransformInPlace(transform))
+            return CurveChainWithDistanceIndex.createCapture(c);
+        return undefined;
+    }
+    /** Reference to the contained path.
+     * * Do not modify the path.  The distance index will be wrong.
+     */
+    get path() { return this._path; }
+    /** Return a deep clone */
+    clone() {
+        const c = this._path.clone();
+        if (c !== undefined && c instanceof CurveChain)
+            return CurveChainWithDistanceIndex.createCapture(c);
+        return undefined;
+    }
+    /** 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) {
+        for (const c of this._path.children) {
+            if (!c.isInPlane(plane))
+                return false;
+        }
+        return true;
+    }
+    /** return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */
+    startPoint(result) {
+        const c = this._path.cyclicCurvePrimitive(0);
+        if (c)
+            return c.startPoint(result);
+        return Point3d.createZero(result);
+    }
+    /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */
+    endPoint(result) {
+        const c = this._path.cyclicCurvePrimitive(-1);
+        if (c)
+            return c.endPoint(result);
+        return Point3d.createZero(result);
+    }
+    /** Add strokes to caller-supplied linestring */
+    emitStrokes(dest, options) {
+        for (const c of this._path.children) {
+            c.emitStrokes(dest, options);
+        }
+    }
+    /** 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) {
+        for (const c of this._path.children) {
+            c.emitStrokableParts(dest, options);
+        }
+    }
+    /**
+     * return the stroke count required for given options.
+     * @param options StrokeOptions that determine count
+     */
+    computeStrokeCountForOptions(options) {
+        let numStroke = 0;
+        for (const c of this._path.children) {
+            numStroke += c.computeStrokeCountForOptions(options);
+        }
+        return numStroke;
+    }
+    /**
+     * Return an array containing only the curve primitives.
+     * * This DEFAULT simply pushes `this` to the collectorArray.
+     * * CurvePrimitiveWithDistanceIndex optionally collects its members.
+     * @param collectorArray array to receive primitives (pushed -- the array is not cleared)
+     * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself.  If true, it recurses to its (otherwise hidden) children.
+     */
+    collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives) {
+        if (smallestPossiblePrimitives) {
+            for (const c of this._path.children) {
+                c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives);
+            }
+        }
+        else {
+            collectorArray.push(this);
+        }
+    }
+    /**
+     * 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.
+     */
+    computeAndAttachRecursiveStrokeCounts(options, parentStrokeMap) {
+        const myMap = StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);
+        for (const c of this._path.children) {
+            c.computeAndAttachRecursiveStrokeCounts(options, myMap);
+        }
+        CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);
+    }
+    /** 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)
+     */
+    extendRange(rangeToExtend, transform) {
+        this._path.extendRange(rangeToExtend, transform);
+    }
+    /**
+     *
+     * * Curve length is always positive.
+     * @returns Returns a (high accuracy) length of the curve between fractional positions
+     * @returns Returns the length of the curve.
+     */
+    curveLengthBetweenFractions(fraction0, fraction1) {
+        return Math.abs(fraction1 - fraction0) * this._totalLength;
+    }
+    /**
+     * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`
+     * @param primitives primitive array to be CAPTURED (not cloned)
+     */
+    static createCapture(path, options) {
+        if (path.children.length === 0)
+            return undefined;
+        const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);
+        const result = new CurveChainWithDistanceIndex(path, fragments);
+        return result;
+    }
+    /**
+     * Resolve a fraction of the CurveChain to a PathFragment
+     * @param distance
+     * @param allowExtrapolation
+     */
+    chainDistanceToFragment(distance, allowExtrapolation = false) {
+        const numFragments = this._fragments.length;
+        const fragments = this._fragments;
+        if (numFragments > 0) {
+            if (distance < 0.0)
+                return allowExtrapolation ? fragments[0] : undefined;
+            if (distance >= this._totalLength)
+                return allowExtrapolation ? fragments[numFragments - 1] : undefined;
+            // humbug, linear search
+            for (const fragment of fragments) {
+                if (fragment.containsChainDistance(distance))
+                    return fragment;
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Convert distance along the chain to fraction along the chain.
+     * @param distance distance along the chain
+     */
+    chainDistanceToChainFraction(distance) { return distance / this._totalLength; }
+    /**
+     * Resolve a fraction within a specific curve to a fragment.
+     * @param curve
+     * @param fraction
+     */
+    curveAndChildFractionToFragment(curve, fraction) {
+        const numFragments = this._fragments.length;
+        const fragments = this._fragments;
+        if (numFragments > 0) {
+            // humbug, linear search
+            for (const fragment of fragments) {
+                if (fragment.containsChildCurveAndChildFraction(curve, fraction))
+                    return fragment;
+            }
+            if (fraction <= 0)
+                return fragments[0];
+            if (fraction > 1.0)
+                return fragments[numFragments - 1];
+        }
+        return undefined;
+    }
+    /**
+     * Returns the total length of curves.
+     */
+    curveLength() {
+        return this._totalLength;
+    }
+    /**
+     * Returns the total length of the path.
+     * * This is exact (and simple property lookup) because the true lengths were summed at construction time.
+     */
+    quickLength() {
+        return this._totalLength;
+    }
+    /**
+     * Return the point (x,y,z) on the curve at fractional position along the chain.
+     * @param fraction fractional position along the geometry.
+     * @returns Returns a point on the curve.
+     */
+    fractionToPoint(fraction, result) {
+        const chainDistance = fraction * this._totalLength;
+        const fragment = this.chainDistanceToFragment(chainDistance, true);
+        if (fragment) {
+            const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance);
+            return fragment.childCurve.fractionToPoint(childFraction, result);
+        }
+        // no fragment found.  Use _fragments[0]
+        //    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.
+     *
+     * * 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.
+     * @param fraction fractional position along the geometry.
+     * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.
+     */
+    fractionToPointAndDerivative(fraction, result) {
+        const distanceAlongPath = fraction * this._totalLength;
+        const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
+        const a = this._totalLength / result.direction.magnitude();
+        result.direction.scaleInPlace(a);
+        return result;
+    }
+    /**
+     * Returns a ray whose origin is the curve point and direction is the unit tangent.
+     * @param fraction fractional position on the curve
+     * @param result optional receiver for the result.
+     * Returns a ray whose origin is the curve point and direction is the unit tangent.
+     */
+    fractionToPointAndUnitTangent(fraction, result) {
+        const distanceAlongPath = fraction * this._totalLength;
+        const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
+        result.direction.normalizeInPlace();
+        return result;
+    }
+    /** 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.
+     * * vectorV is the second derivative, i.e.derivative of vectorU.
+     */
+    fractionToPointAnd2Derivatives(fraction, result) {
+        const totalLength = this._totalLength;
+        const distanceAlongPath = fraction * totalLength;
+        const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);
+        if (!result)
+            return undefined;
+        const dotUU = result.vectorU.magnitudeSquared();
+        const magU = Math.sqrt(dotUU);
+        const dotUV = result.vectorU.dotProduct(result.vectorV);
+        const duds = 1.0 / magU;
+        const a = duds * duds;
+        Vector3d.createAdd2Scaled(result.vectorV, a, result.vectorU, -a * dotUV / dotUU, result.vectorV); // IN PLACE update to vectorV.
+        result.vectorU.scale(duds);
+        // scale for 0..1 parameterization ....
+        result.vectorU.scaleInPlace(totalLength);
+        result.vectorV.scaleInPlace(totalLength * totalLength);
+        return result;
+    }
+    /** Attempt to transform in place.
+     * * Warning: If any child fails, this object becomes invalid.  But that should never happen.
+     */
+    tryTransformInPlace(transform) {
+        let numFail = 0;
+        for (const c of this._path.children) {
+            if (!c.tryTransformInPlace(transform))
+                numFail++;
+        }
+        return numFail === 0;
+    }
+    /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */
+    reverseInPlace() {
+        this._path.reverseChildrenInPlace();
+        const totalLength = this._totalLength;
+        for (const fragment of this._fragments)
+            fragment.reverseFractionsAndDistances(totalLength);
+        for (let i = 0, j = this._fragments.length - 1; i < j; i++, j--) {
+            const fragment = this._fragments[i];
+            this._fragments[i] = this._fragments[j];
+            this._fragments[j] = fragment;
+        }
+    }
+    /**
+     * Test for equality conditions:
+     * * Mismatched totalLength is a quick exit condition
+     * * If totalLength matches, recurse to the path for matching primitives.
+     * @param other
+     */
+    isAlmostEqual(other) {
+        if (other instanceof CurveChainWithDistanceIndex) {
+            return Geometry.isSameCoordinate(this._totalLength, other._totalLength)
+                && this._path.isAlmostEqual(other._path);
+        }
+        return false;
+    }
+    /** 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.
+     */
+    moveSignedDistanceFromFraction(startFraction, signedDistance, allowExtension, result) {
+        const distanceA = startFraction * this._totalLength;
+        const distanceB = distanceA + signedDistance;
+        const fragmentB = this.chainDistanceToFragment(distanceB, true);
+        const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);
+        const endFraction = startFraction + (signedDistance / this._totalLength);
+        const chainDetail = CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);
+        chainDetail.childDetail = childDetail;
+        return chainDetail;
+    }
+    /** 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.
+     * @param spacePoint point in space
+     * @param extend true to extend the curve (NOT USED)
+     * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
+     */
+    closestPoint(spacePoint, extend) {
+        // umm... to "extend", would require selective extension of first, last
+        let childDetail;
+        let aMin = Number.MAX_VALUE;
+        const numChildren = this.path.children.length;
+        if (numChildren === 1) {
+            childDetail = this.path.children[0].closestPoint(spacePoint, extend);
+        }
+        else {
+            const extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];
+            const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];
+            for (let childIndex = 0; childIndex < numChildren; childIndex++) {
+                const child = this.path.children[childIndex];
+                const detailA = child.closestPoint(spacePoint, childIndex === 0 ? extend0 : childIndex + 1 === numChildren ? extend1 : false);
+                if (detailA && detailA.a < aMin) {
+                    aMin = detailA.a;
+                    childDetail = CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail);
+                    childDetail.a = detailA.a;
+                }
+            }
+        }
+        if (!childDetail)
+            return undefined;
+        const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);
+        if (fragment) {
+            const chainDistance = fragment.childFractionTChainDistance(childDetail.fraction);
+            const chainFraction = this.chainDistanceToChainFraction(chainDistance);
+            const chainDetail = CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);
+            chainDetail.childDetail = childDetail;
+            return chainDetail;
+        }
+        return undefined;
+    }
+}
+//# sourceMappingURL=CurveChainWithDistanceIndex.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CurveChainWithDistanceIndex.js","sourceRoot":"","sources":["../../../src/curve/CurveChainWithDistanceIndex.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,cAAc,EAAE,MAAM,+BAA+B,CAAC;AAC/D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAIvC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAIlE,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAA+B,MAAM,mBAAmB,CAAC;AACrG,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAK5D;;;;;;GAMG;AACH,MAAM,OAAO,YAAY;IAWvB,yEAAyE;IACzE,YAAmB,cAAsB,EAAE,cAAsB,EAAE,SAAiB,EAAE,SAAiB,EAAE,UAA0B;QACjI,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;IAC/B,CAAC;IACD;;;OAGG;IACI,qBAAqB,CAAC,QAAgB;QAC3C,OAAO,QAAQ,IAAI,IAAI,CAAC,cAAc,IAAI,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC;IAC5E,CAAC;IAED;;;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,QAAQ,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;QAC/D,oFAAoF;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,8BAA8B,CAChE,IAAI,CAAC,cAAc,EAAE,aAAa,GAAG,IAAI,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;QACnE,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;;;;OAIG;IACI,2BAA2B,CAAC,QAAgB;QACjD,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;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,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,CAAC,CAAC,CAAC;SACjG;aAAM;YACL,IAAI,EAAE,CAAC;YACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE;gBACvD,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;gBAChE,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,CAAC,CAAC,CAAC;aACnF;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,QAAQ,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,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC,CAAC;SACnF;IACH,CAAC;IACM,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,MAAM,OAAO,2BAA4B,SAAQ,cAAc;IAS7D,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,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;IACrE,CAAC;IARD,uDAAuD;IAChD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,2BAA2B,CAAC,CAAC,CAAC;IAQlH;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,YAAY,UAAU,IAAI,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC;YAChF,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,0BAA0B;IACnB,KAAK;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,YAAY,UAAU;YAC5C,OAAO,2BAA2B,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACtD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;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,OAAO,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,OAAO,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;;;;;;OAMG;IACa,wBAAwB,CAAC,cAAgC,EAAE,0BAAmC;QAC5G,IAAI,0BAA0B,EAAE;YAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE;gBACnC,CAAC,CAAC,wBAAwB,CAAC,cAAc,EAAE,0BAA0B,CAAC,CAAC;aACxE;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,cAAc,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,cAAc,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,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAC5B,OAAO,SAAS,CAAC;QACnB,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;IACO,uBAAuB,CAAC,QAAgB,EAAE,qBAA8B,KAAK;QACrF,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,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACvD,IAAI,QAAQ,IAAI,IAAI,CAAC,YAAY;gBAC/B,OAAO,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YACtE,wBAAwB;YACxB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;oBAAE,OAAO,QAAQ,CAAC;aAC/D;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,4BAA4B,CAAC,QAAgB,IAAY,OAAO,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;IACtG;;;;OAIG;IACO,+BAA+B,CAAC,KAAqB,EAAE,QAAgB;QAC/E,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;oBAAE,OAAO,QAAQ,CAAC;aACnF;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,CAAC,CAAC;YACnF,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,CAAC,CAAC;QACvF,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACjF,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,CAAC,CAAC;QACvF,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,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QACtC,MAAM,iBAAiB,GAAG,QAAQ,GAAG,WAAW,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,uBAAuB,CAAC,iBAAiB,EAAE,IAAI,CAAE,CAAC;QACxE,MAAM,aAAa,GAAG,QAAQ,CAAC,oCAAoC,CAAC,iBAAiB,CAAC,CAAC;QACvF,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,8BAA8B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,GAAG,GAAG,IAAI,CAAC;QACxB,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;QACtB,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAG,8BAA8B;QAClI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,uCAAuC;QACvC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;QACvD,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;YACpC,QAAQ,CAAC,4BAA4B,CAAC,WAAW,CAAC,CAAC;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;SAC/B;IACH,CAAC;IACD;;;;;OAKG;IACa,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,2BAA2B,EAAE;YAChD,OAAO,QAAQ,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,mBAAmB,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;;;;;;;OAOG;IACa,YAAY,CAAC,UAAmB,EAAE,MAAmC;QACnF,uEAAuE;QACvE,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,OAAO,GAAG,CAAC,kBAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;YAC1H,MAAM,OAAO,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,kBAAkB,CAAC,mDAAmD,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;YAC1H,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,WAAW,EAAE,UAAU,EAAE,EAAE;gBAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;gBAC7C,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBAC9H,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,EAAE;oBAC/B,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC;oBACjB,WAAW,GAAG,mBAAmB,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;iBAC3B;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,2BAA2B,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YACjF,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,aAAa,CAAC,CAAC;YACvE,MAAM,WAAW,GAAG,mBAAmB,CAAC,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC;YACzG,WAAW,CAAC,WAAW,GAAG,WAAW,CAAC;YACtC,OAAO,WAAW,CAAC;SACpB;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","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 { 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 { LineString3d } from \"./LineString3d\";\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 */\r\n  public childCurve: CurvePrimitive;\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    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  }\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\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): 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, 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  /**\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 childFractionTChainDistance(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    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    } else {\r\n      let f1;\r\n      for (let i = 1, f0 = 0.0; i <= numStrokes; i++, f0 = f1) {\r\n        f1 = Geometry.interpolate(fraction0, i / numStrokes, fraction1);\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      }\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      this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp));\r\n    }\r\n  }\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 _path: CurveChain;\r\n  private _fragments: PathFragment[];\r\n  private _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[fragments.length - 1].chainDistance1;\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): CurvePrimitive | undefined {\r\n    const c = this._path.clone();\r\n    if (c !== undefined && 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  /** Return a deep clone */\r\n  public clone(): CurvePrimitive | undefined {\r\n    const c = this._path.clone();\r\n    if (c !== undefined && c instanceof CurveChain)\r\n      return CurveChainWithDistanceIndex.createCapture(c);\r\n    return undefined;\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   * * This DEFAULT simply pushes `this` to the collectorArray.\r\n   * * CurvePrimitiveWithDistanceIndex optionally collects its members.\r\n   * @param collectorArray array to receive primitives (pushed -- the array is not cleared)\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself.  If true, it recurses to its (otherwise hidden) children.\r\n   */\r\n  public override collectCurvePrimitivesGo(collectorArray: CurvePrimitive[], smallestPossiblePrimitives: boolean) {\r\n    if (smallestPossiblePrimitives) {\r\n      for (const c of this._path.children) {\r\n        c.collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives);\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 primitives primitive array to be CAPTURED (not cloned)\r\n   */\r\n  public static createCapture(path: CurveChain, options?: StrokeOptions): CurveChainWithDistanceIndex | undefined {\r\n    if (path.children.length === 0)\r\n      return undefined;\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  protected chainDistanceToFragment(distance: number, allowExtrapolation: boolean = false): PathFragment | 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 ? fragments[0] : undefined;\r\n      if (distance >= this._totalLength)\r\n        return allowExtrapolation ? fragments[numFragments - 1] : undefined;\r\n      // humbug, linear search\r\n      for (const fragment of fragments) {\r\n        if (fragment.containsChainDistance(distance)) return fragment;\r\n      }\r\n    }\r\n    return undefined;\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  protected 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)) 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);\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);\r\n    result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);\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);\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 totalLength = this._totalLength;\r\n    const distanceAlongPath = fraction * totalLength;\r\n    const fragment = this.chainDistanceToFragment(distanceAlongPath, true)!;\r\n    const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);\r\n    result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);\r\n    if (!result)\r\n      return undefined;\r\n    const dotUU = result.vectorU.magnitudeSquared();\r\n    const magU = Math.sqrt(dotUU);\r\n    const dotUV = result.vectorU.dotProduct(result.vectorV);\r\n    const duds = 1.0 / magU;\r\n    const a = duds * duds;\r\n    Vector3d.createAdd2Scaled(result.vectorV, a, result.vectorU, -a * dotUV / dotUU, result.vectorV);   // IN PLACE update to vectorV.\r\n    result.vectorU.scale(duds);\r\n    // scale for 0..1 parameterization ....\r\n    result.vectorU.scaleInPlace(totalLength);\r\n    result.vectorV.scaleInPlace(totalLength * totalLength);\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    for (let i = 0, j = this._fragments.length - 1; i < j; i++, j--) {\r\n      const fragment = this._fragments[i];\r\n      this._fragments[i] = this._fragments[j];\r\n      this._fragments[j] = fragment;\r\n    }\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  /** 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 (NOT USED)\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    // umm... to \"extend\", would require selective extension of first, last\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 extend0 = [CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), CurveExtendMode.None];\r\n      const extend1 = [CurveExtendMode.None, CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];\r\n      for (let childIndex = 0; childIndex < numChildren; childIndex++) {\r\n        const child = this.path.children[childIndex];\r\n        const detailA = child.closestPoint(spacePoint, childIndex === 0 ? extend0 : childIndex + 1 === numChildren ? 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        }\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.childFractionTChainDistance(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      return chainDetail;\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}