@itwin/core-geometry 5.0.0-dev.11 → 5.0.0-dev.111

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

@@ -0,0 +1,181 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AnnounceTangentStrokeHandler = void 0;
+const core_bentley_1 = require("@itwin/core-bentley");
+const Geometry_1 = require("../../Geometry");
+const Point3dVector3d_1 = require("../../geometry3d/Point3dVector3d");
+const Ray3d_1 = require("../../geometry3d/Ray3d");
+const Newton_1 = require("../../numerics/Newton");
+const CurveLocationDetail_1 = require("../CurveLocationDetail");
+const NewtonRtoRStrokeHandler_1 = require("./NewtonRtoRStrokeHandler");
+/**
+ * Context for searching for the tangent(s) to a CurvePrimitive.
+ * @internal
+ */
+class AnnounceTangentStrokeHandler extends NewtonRtoRStrokeHandler_1.NewtonRtoRStrokeHandler {
+    _curve;
+    _announceTangent;
+    _spacePoint;
+    _vectorToEye;
+    _distanceTol;
+    _distanceTolSquared;
+    // fraction and function value on one side of an interval that may bracket a root
+    _fractionA = 0;
+    _functionA = 0;
+    // fraction and function value on the other side of an interval that may bracket a root
+    _fractionB = 0;
+    _functionB = 0;
+    _numThisCurve = 0;
+    // scratch vars to use within methods
+    _fractionMRU;
+    _curveMRU;
+    _workRay;
+    _workDetail;
+    _newtonSolver;
+    /** Constructor */
+    constructor(spacePoint, announceTangent, options) {
+        super();
+        this._announceTangent = announceTangent;
+        this._spacePoint = spacePoint;
+        this._vectorToEye = options?.vectorToEye ?? Point3dVector3d_1.Vector3d.unitZ();
+        this._distanceTol = options?.distanceTol ?? Geometry_1.Geometry.smallMetricDistance;
+        this._distanceTolSquared = this._distanceTol * this._distanceTol;
+        this._workRay = Ray3d_1.Ray3d.createZero();
+        this.startCurvePrimitive(undefined);
+        this._newtonSolver = new Newton_1.Newton1dUnboundedApproximateDerivative(this);
+    }
+    /** Specified by IStrokeHandler. */
+    needPrimaryGeometryForStrokes() {
+        return true;
+    }
+    /** Specified by IStrokeHandler. */
+    startCurvePrimitive(curve) {
+        this._curve = curve;
+        this._fractionA = 0.0;
+        this._numThisCurve = 0;
+        this._functionA = 0.0;
+    }
+    /** Specified by IStrokeHandler. */
+    endCurvePrimitive() {
+    }
+    /** Specified by IStrokeHandler. */
+    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
+        this.startCurvePrimitive(cp);
+        if (numStrokes < 1)
+            numStrokes = 1;
+        const df = 1.0 / numStrokes;
+        for (let i = 0; i <= numStrokes; i++) {
+            const fraction = Geometry_1.Geometry.interpolate(fraction0, i * df, fraction1);
+            cp.fractionToPointAndDerivative(fraction, this._workRay);
+            this.announceRay(fraction, this._workRay);
+        }
+    }
+    announceCandidate(cp, fraction, point) {
+        if (this._parentCurvePrimitive)
+            cp = this._parentCurvePrimitive;
+        if (this._curveMRU === cp && Geometry_1.Geometry.isAlmostEqualOptional(this._fractionMRU, fraction, Geometry_1.Geometry.smallFloatingPoint))
+            return; // avoid announcing duplicate tangents in succession (e.g., at interior stroke point)
+        this._workDetail = CurveLocationDetail_1.CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._workDetail);
+        this._announceTangent(this._workDetail);
+        this._fractionMRU = fraction;
+        this._curveMRU = cp;
+    }
+    /** Specified by IStrokeHandler. */
+    announceSegmentInterval(cp, point0, point1, _numStrokes, fraction0, fraction1) {
+        let fraction;
+        let point;
+        const distance0 = this._spacePoint.distanceSquared(point0);
+        const distance1 = this._spacePoint.distanceSquared(point1);
+        if (distance0 < distance1) {
+            fraction = fraction0;
+            point = point0;
+        }
+        else {
+            fraction = fraction1;
+            point = point1;
+        }
+        // evaluate at midpoint; the endpoints may be at corners, which have ambiguous tangent
+        const value = this.evaluateFunction(undefined, (fraction0 + fraction1) / 2, cp);
+        if (value !== undefined && Geometry_1.Geometry.isDistanceWithinTol(value, this._distanceTol))
+            this.announceCandidate(cp, fraction, point);
+    }
+    /**
+     * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this
+     * fractional interval.
+     * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and
+     * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke
+     * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,
+     * this method can miss a root of `f`.
+     */
+    searchInterval() {
+        // directly announce at endpoint if we are extra certain it's a root; Newton can miss it if it has multiplicity > 1
+        if (Geometry_1.Geometry.isDistanceWithinTol(this._functionA, this._distanceTolSquared))
+            this.announceSolutionFraction(this._fractionA);
+        if (Geometry_1.Geometry.isDistanceWithinTol(this._functionB, this._distanceTolSquared))
+            this.announceSolutionFraction(this._fractionB);
+        if (this._functionA * this._functionB < 0) {
+            // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.
+            const fraction = Geometry_1.Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);
+            if (fraction) {
+                this._newtonSolver.setX(fraction);
+                if (this._newtonSolver.runIterations())
+                    this.announceSolutionFraction(this._newtonSolver.getX());
+            }
+        }
+    }
+    announceSolutionFraction(fraction) {
+        if (this._curve)
+            this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));
+    }
+    /**
+     * Evaluate the univariate real-valued function for which we are finding roots.
+     * * For finding the tangents to curve `X` from point `Q` as seen in a view plane with normal `N`, this
+     * function is `f(t) := (Q - X(t)) dot (X'(t) cross N)`. The second vector in the dot product defines a
+     * _tangent plane_ at `X(t)`.
+     * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.
+     * @param pointAndDerivative pre-evaluated curve
+     * @param fraction fraction at which to evaluate `curve`
+     * @param curve curve to evaluate at `fraction`
+     * @returns distance of `Q` from the tangent plane at `X(t)`.
+    */
+    evaluateFunction(pointAndDerivative, fraction, curve) {
+        if (pointAndDerivative)
+            this._workRay.setFrom(pointAndDerivative);
+        else if (fraction !== undefined && curve)
+            this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);
+        else
+            return undefined;
+        const cross = this._vectorToEye.unitCrossProduct(this._workRay.direction); // normalized so we return true distance
+        return cross ? cross.dotProductStartEnd(this._workRay.origin, this._spacePoint) : undefined;
+    }
+    /** Specified by NewtonRtoRStrokeHandler. */
+    evaluate(fraction) {
+        const curve = this._parentCurvePrimitive ?? this._curve;
+        const value = this.evaluateFunction(undefined, fraction, curve);
+        if (value === undefined)
+            return false;
+        this.currentF = value;
+        return true;
+    }
+    announceRay(fraction, data) {
+        this._functionB = this.evaluateFunction(data);
+        this._fractionB = fraction;
+        if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval
+            this.searchInterval();
+        this._functionA = this._functionB;
+        this._fractionA = this._fractionB;
+    }
+    /** Specified by IStrokeHandler. */
+    announcePointTangent(_point, _fraction, _tangent) {
+        (0, core_bentley_1.assert)(false, "No callers expected. IStrokeHandler probably didn't need to specify this method.");
+    }
+}
+exports.AnnounceTangentStrokeHandler = AnnounceTangentStrokeHandler;
+//# sourceMappingURL=AnnounceTangentStrokeHandler.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"AnnounceTangentStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/AnnounceTangentStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,6CAA0C;AAE1C,sEAAqE;AACrE,kDAA+C;AAC/C,kDAA+E;AAC/E,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,4BAA6B,SAAQ,iDAAuB;IAC/D,MAAM,CAA6B;IACnC,gBAAgB,CAAwC;IACxD,WAAW,CAAU;IACrB,YAAY,CAAW;IACvB,YAAY,CAAS;IACrB,mBAAmB,CAAS;IACpC,iFAAiF;IACzE,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,uFAAuF;IAC/E,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,qCAAqC;IAC7B,YAAY,CAAU;IACtB,SAAS,CAAkB;IAC3B,QAAQ,CAAQ;IAChB,WAAW,CAAuB;IAClC,aAAa,CAAyC;IAC9D,kBAAkB;IAClB,YAAmB,UAAmB,EAAE,eAAsD,EAAE,OAAwB;QACtH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;QACxC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,OAAO,EAAE,WAAW,IAAI,0BAAQ,CAAC,KAAK,EAAE,CAAC;QAC7D,IAAI,CAAC,YAAY,GAAG,OAAO,EAAE,WAAW,IAAI,mBAAQ,CAAC,mBAAmB,CAAC;QACzE,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACjE,IAAI,CAAC,QAAQ,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACD,mCAAmC;IAC5B,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mCAAmC;IAC5B,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IACD,mCAAmC;IAC5B,iBAAiB;IACxB,CAAC;IACD,mCAAmC;IAC5B,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,IAAI,IAAI,CAAC,qBAAqB;YAC5B,EAAE,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAClC,IAAI,IAAI,CAAC,SAAS,KAAK,EAAE,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,EAAE,mBAAQ,CAAC,kBAAkB,CAAC;YACnH,OAAO,CAAC,qFAAqF;QAC/F,IAAI,CAAC,WAAW,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACvG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACxC,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAC7B,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,mCAAmC;IAC5B,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAE/G,IAAI,QAAgB,CAAC;QACrB,IAAI,KAAc,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1B,QAAQ,GAAG,SAAS,CAAC;YACrB,KAAK,GAAG,MAAM,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,SAAS,CAAC;YACrB,KAAK,GAAG,MAAM,CAAC;QACjB,CAAC;QACD,sFAAsF;QACtF,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,CAAC,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAChF,IAAI,KAAK,KAAK,SAAS,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC;YAC/E,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChD,CAAC;IACD;;;;;;;OAOG;IACK,cAAc;QACpB,mHAAmH;QACnH,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,mBAAmB,CAAC;YACzE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,mBAAmB,CAAC;YACzE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,yGAAyG;YACzG,MAAM,QAAQ,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACO,wBAAwB,CAAC,QAAgB;QAC/C,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IACD;;;;;;;;;;MAUE;IACM,gBAAgB,CAAC,kBAA0B,EAAE,QAAiB,EAAE,KAAsB;QAC5F,IAAI,kBAAkB;YACpB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;aACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK;YACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;;YAE5E,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,wCAAwC;QACnH,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC9F,CAAC;IACD,4CAA4C;IACrC,QAAQ,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,MAAM,CAAC;QACxD,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACO,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC/C,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAE,CAAC;QAC/C,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,oFAAoF;YAChH,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IACD,mCAAmC;IAC5B,oBAAoB,CAAC,MAAe,EAAE,SAAiB,EAAE,QAAkB;QAChF,IAAA,qBAAM,EAAC,KAAK,EAAE,kFAAkF,CAAC,CAAC;IACpG,CAAC;CACF;AAhKD,oEAgKC","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/** @packageDocumentation\n * @module Curve\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../../Geometry\";\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\nimport { CurvePrimitive, TangentOptions } from \"../CurvePrimitive\";\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\n\n/**\n * Context for searching for the tangent(s) to a CurvePrimitive.\n * @internal\n */\nexport class AnnounceTangentStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\n  private _curve: CurvePrimitive | undefined;\n  private _announceTangent: (tangent: CurveLocationDetail) => any;\n  private _spacePoint: Point3d;\n  private _vectorToEye: Vector3d;\n  private _distanceTol: number;\n  private _distanceTolSquared: number;\n  // fraction and function value on one side of an interval that may bracket a root\n  private _fractionA: number = 0;\n  private _functionA: number = 0;\n  // fraction and function value on the other side of an interval that may bracket a root\n  private _fractionB: number = 0;\n  private _functionB: number = 0;\n  private _numThisCurve: number = 0;\n  // scratch vars to use within methods\n  private _fractionMRU?: number;\n  private _curveMRU?: CurvePrimitive;\n  private _workRay: Ray3d;\n  private _workDetail?: CurveLocationDetail;\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\n  /** Constructor */\n  public constructor(spacePoint: Point3d, announceTangent: (tangent: CurveLocationDetail) => any, options?: TangentOptions) {\n    super();\n    this._announceTangent = announceTangent;\n    this._spacePoint = spacePoint;\n    this._vectorToEye = options?.vectorToEye ?? Vector3d.unitZ();\n    this._distanceTol = options?.distanceTol ?? Geometry.smallMetricDistance;\n    this._distanceTolSquared = this._distanceTol * this._distanceTol;\n    this._workRay = Ray3d.createZero();\n    this.startCurvePrimitive(undefined);\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\n  }\n  /** Specified by IStrokeHandler. */\n  public needPrimaryGeometryForStrokes() {\n    return true;\n  }\n  /** Specified by IStrokeHandler. */\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\n    this._curve = curve;\n    this._fractionA = 0.0;\n    this._numThisCurve = 0;\n    this._functionA = 0.0;\n  }\n  /** Specified by IStrokeHandler. */\n  public endCurvePrimitive() {\n  }\n  /** Specified by IStrokeHandler. */\n  public announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    this.startCurvePrimitive(cp);\n    if (numStrokes < 1)\n      numStrokes = 1;\n    const df = 1.0 / numStrokes;\n    for (let i = 0; i <= numStrokes; i++) {\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\n      this.announceRay(fraction, this._workRay);\n    }\n  }\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\n    if (this._parentCurvePrimitive)\n      cp = this._parentCurvePrimitive;\n    if (this._curveMRU === cp && Geometry.isAlmostEqualOptional(this._fractionMRU, fraction, Geometry.smallFloatingPoint))\n      return; // avoid announcing duplicate tangents in succession (e.g., at interior stroke point)\n    this._workDetail = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._workDetail);\n    this._announceTangent(this._workDetail);\n    this._fractionMRU = fraction;\n    this._curveMRU = cp;\n  }\n  /** Specified by IStrokeHandler. */\n  public announceSegmentInterval(\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    let fraction: number;\n    let point: Point3d;\n    const distance0 = this._spacePoint.distanceSquared(point0);\n    const distance1 = this._spacePoint.distanceSquared(point1);\n    if (distance0 < distance1) {\n      fraction = fraction0;\n      point = point0;\n    } else {\n      fraction = fraction1;\n      point = point1;\n    }\n    // evaluate at midpoint; the endpoints may be at corners, which have ambiguous tangent\n    const value = this.evaluateFunction(undefined, (fraction0 + fraction1) / 2, cp);\n    if (value !== undefined && Geometry.isDistanceWithinTol(value, this._distanceTol))\n      this.announceCandidate(cp, fraction, point);\n  }\n  /**\n   * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this\n   * fractional interval.\n   * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and\n   * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke\n   * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,\n   * this method can miss a root of `f`.\n   */\n  private searchInterval() {\n    // directly announce at endpoint if we are extra certain it's a root; Newton can miss it if it has multiplicity > 1\n    if (Geometry.isDistanceWithinTol(this._functionA, this._distanceTolSquared))\n      this.announceSolutionFraction(this._fractionA);\n    if (Geometry.isDistanceWithinTol(this._functionB, this._distanceTolSquared))\n      this.announceSolutionFraction(this._fractionB);\n    if (this._functionA * this._functionB < 0) {\n      // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\n      if (fraction) {\n        this._newtonSolver.setX(fraction);\n        if (this._newtonSolver.runIterations())\n          this.announceSolutionFraction(this._newtonSolver.getX());\n      }\n    }\n  }\n  private announceSolutionFraction(fraction: number) {\n    if (this._curve)\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\n  }\n  /**\n   * Evaluate the univariate real-valued function for which we are finding roots.\n   * * For finding the tangents to curve `X` from point `Q` as seen in a view plane with normal `N`, this\n   * function is `f(t) := (Q - X(t)) dot (X'(t) cross N)`. The second vector in the dot product defines a\n   * _tangent plane_ at `X(t)`.\n   * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.\n   * @param pointAndDerivative pre-evaluated curve\n   * @param fraction fraction at which to evaluate `curve`\n   * @param curve curve to evaluate at `fraction`\n   * @returns distance of `Q` from the tangent plane at `X(t)`.\n  */\n  private evaluateFunction(pointAndDerivative?: Ray3d, fraction?: number, curve?: CurvePrimitive): number | undefined {\n    if (pointAndDerivative)\n      this._workRay.setFrom(pointAndDerivative);\n    else if (fraction !== undefined && curve)\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\n    else\n      return undefined;\n    const cross = this._vectorToEye.unitCrossProduct(this._workRay.direction); // normalized so we return true distance\n    return cross ? cross.dotProductStartEnd(this._workRay.origin, this._spacePoint) : undefined;\n  }\n  /** Specified by NewtonRtoRStrokeHandler. */\n  public evaluate(fraction: number): boolean {\n    const curve = this._parentCurvePrimitive ?? this._curve;\n    const value = this.evaluateFunction(undefined, fraction, curve);\n    if (value === undefined)\n      return false;\n    this.currentF = value;\n    return true;\n  }\n  private announceRay(fraction: number, data: Ray3d): void {\n    this._functionB = this.evaluateFunction(data)!;\n    this._fractionB = fraction;\n    if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval\n      this.searchInterval();\n    this._functionA = this._functionB;\n    this._fractionA = this._fractionB;\n  }\n  /** Specified by IStrokeHandler. */\n  public announcePointTangent(_point: Point3d, _fraction: number, _tangent: Vector3d) {\n    assert(false, \"No callers expected. IStrokeHandler probably didn't need to specify this method.\");\n  }\n}\n"]}

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

@@ -19,6 +19,19 @@ const NewtonRtoRStrokeHandler_1 = require("./NewtonRtoRStrokeHandler");
  * @internal
  */
 class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler_1.NewtonRtoRStrokeHandler {
+    _curve;
+    _plane;
+    _intersections;
+    _fractionA = 0;
+    _functionA = 0;
+    // private derivativeA: number;   <---- Not currently used
+    _functionB = 0;
+    _fractionB = 0;
+    _derivativeB = 0;
+    _numThisCurve = 0;
+    // scratch vars for use within methods.
+    _ray;
+    _newtonSolver;
     // Return the first defined curve among: this.parentCurvePrimitive, this.curve;
     effectiveCurve() {
         if (this._parentCurvePrimitive)
@@ -30,13 +43,6 @@ class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler_1.New
     }
     constructor(plane, intersections) {
         super();
-        this._fractionA = 0;
-        this._functionA = 0;
-        // private derivativeA: number;   <---- Not currently used
-        this._functionB = 0;
-        this._fractionB = 0;
-        this._derivativeB = 0;
-        this._numThisCurve = 0;
         this._plane = plane;
         this._intersections = intersections;
         this.startCurvePrimitive(undefined);

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

@@ -1 +1 @@
-{"version":3,"file":"AppendPlaneIntersectionStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAAkE;AAGlE,kDAA+C;AAC/C,wEAAgE;AAChE,kDAA+E;AAC/E,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,oCAAqC,SAAQ,iDAAuB;IAe/E,+EAA+E;IACxE,cAAc;QACnB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,OAAO,IAAI,CAAC,qBAAqB,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAI,2FAA2F;IAC1H,CAAC;IAED,YAAmB,KAA6B,EAAE,aAAoC;QACpF,KAAK,EAAE,CAAC;QAvBF,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QAC/B,0DAA0D;QAClD,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QACvB,iBAAY,GAAW,CAAC,CAAC;QACzB,kBAAa,GAAW,CAAC,CAAC;QAkBhC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,0BAA0B;IAC5B,CAAC;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACrD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,SAAiB,EACjB,SAAiB;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO;QACT,MAAM,UAAU,GAAG,gCAAY,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,2BAA2B;QAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,qBAAqB;YACrB,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;YACxE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,qHAAqH;QACvH,CAAC;IACH,CAAC;IAEO,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,yCAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IAED,kEAAkE;IAC1D,SAAS,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QACjE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACI,oBAAoB,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QAC3E,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;CACF;AA/ID,oFA+IC","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/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry, PlaneAltitudeEvaluator } from \"../../Geometry\";\r\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Order2Bezier } from \"../../numerics/BezierPolynomials\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for computing intersections of a CurvePrimitive with a plane.\r\n * @internal\r\n */\r\nexport class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _plane: PlaneAltitudeEvaluator;\r\n  private _intersections: CurveLocationDetail[];\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  // private derivativeA: number;   <---- Not currently used\r\n  private _functionB: number = 0;\r\n  private _fractionB: number = 0;\r\n  private _derivativeB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars for use within methods.\r\n  private _ray: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n\r\n  // Return the first defined curve among: this.parentCurvePrimitive, this.curve;\r\n  public effectiveCurve(): CurvePrimitive | undefined {\r\n    if (this._parentCurvePrimitive)\r\n      return this._parentCurvePrimitive;\r\n    return this._curve;\r\n  }\r\n\r\n  public get getDerivativeB() {\r\n    return this._derivativeB;    // <--- _derivativeB is not currently used anywhere. Provided getter to suppress lint error\r\n  }\r\n\r\n  public constructor(plane: PlaneAltitudeEvaluator, intersections: CurveLocationDetail[]) {\r\n    super();\r\n    this._plane = plane;\r\n    this._intersections = intersections;\r\n    this.startCurvePrimitive(undefined);\r\n    this._ray = Ray3d.createZero();\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n    // this.derivativeA = 0.0;\r\n  }\r\n\r\n  public endCurvePrimitive() {\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    this.startCurvePrimitive(cp);\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._ray);\r\n      this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);\r\n    }\r\n  }\r\n\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 h0 = this._plane.altitude(point0);\r\n    const h1 = this._plane.altitude(point1);\r\n    if (h0 * h1 > 0.0)\r\n      return;\r\n    const fraction01 = Order2Bezier.solveCoffs(h0, h1);\r\n    // let numIntersection = 0;\r\n    if (fraction01 !== undefined) {\r\n      // numIntersection++;\r\n      const fraction = Geometry.interpolate(fraction0, fraction01, fraction1);\r\n      this._newtonSolver.setX(fraction);\r\n      if (this._newtonSolver.runIterations()) {\r\n        this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n      // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));\r\n    }\r\n  }\r\n\r\n  private announceSolutionFraction(fraction: number) {\r\n    const curve = this.effectiveCurve();\r\n    if (curve) {\r\n      this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);\r\n      this._intersections.push(CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));\r\n    }\r\n  }\r\n\r\n  public evaluate(fraction: number): boolean {\r\n    const curve = this.effectiveCurve();\r\n    if (!curve)\r\n      return false;\r\n    this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * ASSUME both the \"A\" and \"B\"  evaluations (fraction, function, and derivative) are known.\r\n   * * If function value changed sign between, interpolate an approximate root and improve it with\r\n   *     the newton solver.\r\n   */\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0) return;\r\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Evaluate and save _functionB, _derivativeB, and _fractionB. */\r\n  private evaluateB(xyz: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._functionB = this._plane.altitude(xyz);\r\n    this._derivativeB = this._plane.velocity(tangent);\r\n    this._fractionB = fraction;\r\n  }\r\n\r\n  /**\r\n   * Announce point and tangent for evaluations.\r\n   * * The function evaluation is saved as the \"B\" function point.\r\n   * * The function point count is incremented\r\n   * * If function point count is greater than 1, the current interval is searched.\r\n   * * The just-evaluated point (\"B\") is saved as the \"old\" (\"A\") evaluation point.\r\n   * @param xyz\r\n   * @param fraction\r\n   * @param tangent\r\n   */\r\n  public announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void {\r\n    this.evaluateB(xyz, fraction, tangent);\r\n    if (this._numThisCurve++ > 0) this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"AppendPlaneIntersectionStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAAkE;AAGlE,kDAA+C;AAC/C,wEAAgE;AAChE,kDAA+E;AAC/E,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,oCAAqC,SAAQ,iDAAuB;IACvE,MAAM,CAA6B;IACnC,MAAM,CAAyB;IAC/B,cAAc,CAAwB;IACtC,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,0DAA0D;IAClD,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,YAAY,GAAW,CAAC,CAAC;IACzB,aAAa,GAAW,CAAC,CAAC;IAClC,uCAAuC;IAC/B,IAAI,CAAQ;IACZ,aAAa,CAAyC;IAE9D,+EAA+E;IACxE,cAAc;QACnB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,OAAO,IAAI,CAAC,qBAAqB,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAI,2FAA2F;IAC1H,CAAC;IAED,YAAmB,KAA6B,EAAE,aAAoC;QACpF,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,0BAA0B;IAC5B,CAAC;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACrD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,SAAiB,EACjB,SAAiB;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO;QACT,MAAM,UAAU,GAAG,gCAAY,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,2BAA2B;QAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,qBAAqB;YACrB,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;YACxE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,qHAAqH;QACvH,CAAC;IACH,CAAC;IAEO,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,yCAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IAED,kEAAkE;IAC1D,SAAS,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QACjE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACI,oBAAoB,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QAC3E,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;CACF;AA/ID,oFA+IC","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/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry, PlaneAltitudeEvaluator } from \"../../Geometry\";\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\nimport { Order2Bezier } from \"../../numerics/BezierPolynomials\";\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\n\n/**\n * Context for computing intersections of a CurvePrimitive with a plane.\n * @internal\n */\nexport class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\n  private _curve: CurvePrimitive | undefined;\n  private _plane: PlaneAltitudeEvaluator;\n  private _intersections: CurveLocationDetail[];\n  private _fractionA: number = 0;\n  private _functionA: number = 0;\n  // private derivativeA: number;   <---- Not currently used\n  private _functionB: number = 0;\n  private _fractionB: number = 0;\n  private _derivativeB: number = 0;\n  private _numThisCurve: number = 0;\n  // scratch vars for use within methods.\n  private _ray: Ray3d;\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\n\n  // Return the first defined curve among: this.parentCurvePrimitive, this.curve;\n  public effectiveCurve(): CurvePrimitive | undefined {\n    if (this._parentCurvePrimitive)\n      return this._parentCurvePrimitive;\n    return this._curve;\n  }\n\n  public get getDerivativeB() {\n    return this._derivativeB;    // <--- _derivativeB is not currently used anywhere. Provided getter to suppress lint error\n  }\n\n  public constructor(plane: PlaneAltitudeEvaluator, intersections: CurveLocationDetail[]) {\n    super();\n    this._plane = plane;\n    this._intersections = intersections;\n    this.startCurvePrimitive(undefined);\n    this._ray = Ray3d.createZero();\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\n  }\n\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\n    this._curve = curve;\n    this._fractionA = 0.0;\n    this._numThisCurve = 0;\n    this._functionA = 0.0;\n    // this.derivativeA = 0.0;\n  }\n\n  public endCurvePrimitive() {\n  }\n\n  public announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive,\n    numStrokes: number,\n    fraction0: number,\n    fraction1: number): void {\n    this.startCurvePrimitive(cp);\n    if (numStrokes < 1) numStrokes = 1;\n    const df = 1.0 / numStrokes;\n    for (let i = 0; i <= numStrokes; i++) {\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\n      cp.fractionToPointAndDerivative(fraction, this._ray);\n      this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);\n    }\n  }\n\n  public announceSegmentInterval(\n    _cp: CurvePrimitive,\n    point0: Point3d,\n    point1: Point3d,\n    _numStrokes: number,\n    fraction0: number,\n    fraction1: number): void {\n    const h0 = this._plane.altitude(point0);\n    const h1 = this._plane.altitude(point1);\n    if (h0 * h1 > 0.0)\n      return;\n    const fraction01 = Order2Bezier.solveCoffs(h0, h1);\n    // let numIntersection = 0;\n    if (fraction01 !== undefined) {\n      // numIntersection++;\n      const fraction = Geometry.interpolate(fraction0, fraction01, fraction1);\n      this._newtonSolver.setX(fraction);\n      if (this._newtonSolver.runIterations()) {\n        this.announceSolutionFraction(this._newtonSolver.getX());\n      }\n      // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));\n    }\n  }\n\n  private announceSolutionFraction(fraction: number) {\n    const curve = this.effectiveCurve();\n    if (curve) {\n      this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);\n      this._intersections.push(CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));\n    }\n  }\n\n  public evaluate(fraction: number): boolean {\n    const curve = this.effectiveCurve();\n    if (!curve)\n      return false;\n    this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));\n    return true;\n  }\n\n  /**\n   * * ASSUME both the \"A\" and \"B\"  evaluations (fraction, function, and derivative) are known.\n   * * If function value changed sign between, interpolate an approximate root and improve it with\n   *     the newton solver.\n   */\n  private searchInterval() {\n    if (this._functionA * this._functionB > 0) return;\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\n    if (this._functionA * this._functionB < 0) {\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\n      if (fraction) {\n        this._newtonSolver.setX(fraction);\n        if (this._newtonSolver.runIterations())\n          this.announceSolutionFraction(this._newtonSolver.getX());\n      }\n    }\n  }\n\n  /** Evaluate and save _functionB, _derivativeB, and _fractionB. */\n  private evaluateB(xyz: Point3d, fraction: number, tangent: Vector3d) {\n    this._functionB = this._plane.altitude(xyz);\n    this._derivativeB = this._plane.velocity(tangent);\n    this._fractionB = fraction;\n  }\n\n  /**\n   * Announce point and tangent for evaluations.\n   * * The function evaluation is saved as the \"B\" function point.\n   * * The function point count is incremented\n   * * If function point count is greater than 1, the current interval is searched.\n   * * The just-evaluated point (\"B\") is saved as the \"old\" (\"A\") evaluation point.\n   * @param xyz\n   * @param fraction\n   * @param tangent\n   */\n  public announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void {\n    this.evaluateB(xyz, fraction, tangent);\n    if (this._numThisCurve++ > 0) this.searchInterval();\n    this._functionA = this._functionB;\n    this._fractionA = this._fractionB;\n  }\n}\n"]}

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

@@ -30,6 +30,10 @@ const Path_1 = require("../Path");
  * @internal
  */
 class ChainCollectorContext {
+    _chains;
+    _makeClones;
+    static _staticPointA;
+    static _staticPointB;
     /**
      * Push a new chain with an optional first primitive.
      */
@@ -44,6 +48,7 @@ class ChainCollectorContext {
             this.pushNewChain();
         return this._chains[this._chains.length - 1];
     }
+    _xyzWork0;
     findAnyChainToConnect(xyz) {
         for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {
             const path = this._chains[chainIndexA];
@@ -63,6 +68,7 @@ class ChainCollectorContext {
         this._chains = [];
         this._makeClones = makeClones;
     }
+    _xyzWork1;
     /** Announce a curve primitive
      * * searchAllChains controls the extent of search for connecting points.
      *   * false ==> only consider connection to most recent chain.

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

@@ -1 +1 @@
-{"version":3,"file":"ChainCollectorContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ChainCollectorContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAM/F,wDAAiD;AACjD,sDAAmD;AACnD,kCAA+B;AAC/B,kCAA+B;AAE/B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,qBAAqB;IAOhC;;OAEG;IACK,YAAY,CAAC,SAA0B;QAC7C,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,IAAI,SAAS;YACX,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACO,qBAAqB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEO,qBAAqB,CAAC,GAAY;QAExC,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAmB,UAAmB;QACpC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAID;;;;;OAKG;IACI,sBAAsB,CAAC,SAAyB,EAAE,kBAA2B,KAAK;QACvF,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC;oBACxD,OAAO;gBACT,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC3C,SAAS,GAAG,UAAU,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC;oBAC/H,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;oBAE5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACnD,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrD,IAAI,OAAO,EAAE,CAAC,CAAE,4BAA4B;wBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;4BAClB,SAAS,CAAC,cAAc,EAAE,CAAC;4BAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC3D,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,yEAAyE;IACjE,cAAc,CAAC,MAAsB,EAAE,IAAoB;QACjE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAChG,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAC9G,IAAI,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC;gBACxF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,UAAsC,EAAE,UAAsC,EAAE,WAAoB,KAAK;QAChJ,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,OAAO,IAAI,CAAC;QACd,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QAC/F,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QACjG,OAAO,QAAQ;YACb,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,eAAe,CAAC,qBAAqB,CAAC,aAAa,CAAC;YAC3F,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9F,CAAC;CACF;AAxJD,sDAwJC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { BagOfCurves } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\r\n * * The caller makes a sequence of calls to announce individual primitives.\r\n *    * The collector has 2 use cases in mind, controlled by `searchAllPaths` flag on `chainCollectorContext.announceCurvePrimitive`\r\n *    * (a) \"simple chains\" -- the caller has the curve primitives in order and just needs to have them monitored for coordinate breaks that indicate transition to a new chain.\r\n *        * The collector needs to watch for connection to the most recent path but not search for prior paths to join to instead.\r\n *    * (b)  \"mixed\" primitives -- primitive order is NOT significant for chain assembly.\r\n *        * The collector needs to search all prior paths at both start and end, and consider connection to both the start and end of each new primitive.\r\n * * The per-curve announcement is\r\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\r\n * * When all curves have been announced, the call to grab the paths option\r\n *    * formLoopsIfClosed\r\n *       * If true, convert closed paths to `Loop`, open paths to `Path`\r\n *       * If false, convert all paths (open or not) to `Path`\r\n * * Usage pattern is\r\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\r\n *   * many times: `   context.announceCurvePrimitive (primitive, searchAllPaths)`\r\n *   * end:        ` result = context.grabResults (formLoopsIfClosed)`\r\n * @internal\r\n */\r\nexport class ChainCollectorContext {\r\n  private _chains: CurvePrimitive[][];\r\n  private _makeClones: boolean;\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n\r\n  /**\r\n   * Push a new chain with an optional first primitive.\r\n   */\r\n  private pushNewChain(primitive?: CurvePrimitive) {\r\n    const chain = [];\r\n    if (primitive)\r\n      chain.push(primitive);\r\n    this._chains.push(chain);\r\n  }\r\n  private findOrCreateTailChain(): CurvePrimitive[] {\r\n    if (this._chains.length === 0)\r\n      this.pushNewChain();\r\n    return this._chains[this._chains.length - 1];\r\n  }\r\n  private _xyzWork0?: Point3d;\r\n  private findAnyChainToConnect(xyz: Point3d): { chainIndex: number, atEnd: boolean } | undefined {\r\n\r\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\r\n      const path = this._chains[chainIndexA];\r\n      this._xyzWork1 = path[path.length - 1].endPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = path[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Initialize with an empty array of chains.\r\n   * @param makeClones if true, all CurvePrimitives sent to `announceCurvePrimitive` is immediately cloned.  If false, the reference to the original curve is maintained.\r\n   */\r\n  public constructor(makeClones: boolean) {\r\n    this._chains = [];\r\n    this._makeClones = makeClones;\r\n  }\r\n\r\n  private _xyzWork1?: Point3d;\r\n\r\n  /** Announce a curve primitive\r\n   * * searchAllChains controls the extent of search for connecting points.\r\n   *   * false ==> only consider connection to most recent chain.\r\n   *   * true ==> search for any connection, reversing direction as needed.\r\n   * * Otherwise start a new chain.\r\n   */\r\n  public announceCurvePrimitive(candidate: CurvePrimitive, searchAllChains: boolean = false) {\r\n    if (candidate) {\r\n      if (this._makeClones) {\r\n        const candidate1 = candidate.clone();\r\n        if (!candidate1 || !(candidate1 instanceof CurvePrimitive))\r\n          return;\r\n        this.transferMarkup(candidate, candidate1);\r\n        candidate = candidate1;\r\n      }\r\n      if (!searchAllChains) {\r\n        const activeChain = this.findOrCreateTailChain();\r\n        if (activeChain.length === 0 || !ChainCollectorContext.needBreakBetweenPrimitives(activeChain[activeChain.length - 1], candidate))\r\n          activeChain.push(candidate);\r\n        else\r\n          this.pushNewChain(candidate);\r\n      } else {\r\n        this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n        let connect = this.findAnyChainToConnect(this._xyzWork0);\r\n        if (connect) {\r\n          if (connect.atEnd) {\r\n            this._chains[connect.chainIndex].push(candidate);\r\n          } else {\r\n            candidate.reverseInPlace();\r\n            this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n          }\r\n        } else {\r\n          this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n          connect = this.findAnyChainToConnect(this._xyzWork0);\r\n          if (connect) {  // START of new primitive ..\r\n            if (connect.atEnd) {\r\n              candidate.reverseInPlace();\r\n              this._chains[connect.chainIndex].push(candidate);\r\n            } else {\r\n              this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n            }\r\n          } else {\r\n            this._chains.push([candidate]);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Transfer markup (e.g. startCut, endCut) from source to destination */\r\n  private transferMarkup(source: CurvePrimitive, dest: CurvePrimitive) {\r\n    if (source && dest) {\r\n      dest.startCut = source.startCut;\r\n      dest.endCut = source.endCut;\r\n    }\r\n  }\r\n  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\r\n   * * When a path is created the curves array is CAPTURED.\r\n   */\r\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    if (makeLoopIfClosed) {\r\n      ChainCollectorContext._staticPointA = curves[0].startPoint(ChainCollectorContext._staticPointA);\r\n      ChainCollectorContext._staticPointB = curves[curves.length - 1].endPoint(ChainCollectorContext._staticPointB);\r\n      if (ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB))\r\n        return Loop.createArray(curves);\r\n    }\r\n    if (curves.length === 1)\r\n      return curves[0];\r\n    return Path.createArray(curves);\r\n  }\r\n  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): CurvePrimitive | Path | BagOfCurves | Loop | undefined {\r\n    const chains = this._chains;\r\n    if (chains.length === 0)\r\n      return undefined;\r\n    if (chains.length === 1)\r\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\r\n    const bag = BagOfCurves.create();\r\n    for (const chain of chains) {\r\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\r\n      bag.tryAddChild(q);\r\n    }\r\n    return bag;\r\n  }\r\n  /** test if there is a break between primitiveA and primitiveB, due to any condition such as\r\n   * * primitiveA.endCut\r\n   * * primitiveB.startCut\r\n   * * physical gap between primitives.\r\n   */\r\n  public static needBreakBetweenPrimitives(primitiveA: CurvePrimitive | undefined, primitiveB: CurvePrimitive | undefined, isXYOnly: boolean = false): boolean {\r\n    if (primitiveA === undefined)\r\n      return true;\r\n    if (primitiveB === undefined)\r\n      return true;\r\n    if (primitiveA.endCut !== undefined)\r\n      return true;\r\n    if (primitiveB.startCut !== undefined)\r\n      return true;\r\n    ChainCollectorContext._staticPointA = primitiveA.endPoint(ChainCollectorContext._staticPointA);\r\n    ChainCollectorContext._staticPointB = primitiveB.startPoint(ChainCollectorContext._staticPointB);\r\n    return isXYOnly\r\n      ? !ChainCollectorContext._staticPointA.isAlmostEqualXY(ChainCollectorContext._staticPointB)\r\n      : !ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ChainCollectorContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ChainCollectorContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAM/F,wDAAiD;AACjD,sDAAmD;AACnD,kCAA+B;AAC/B,kCAA+B;AAE/B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,qBAAqB;IACxB,OAAO,CAAqB;IAC5B,WAAW,CAAU;IAErB,MAAM,CAAC,aAAa,CAAU;IAC9B,MAAM,CAAC,aAAa,CAAU;IAEtC;;OAEG;IACK,YAAY,CAAC,SAA0B;QAC7C,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,IAAI,SAAS;YACX,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACO,qBAAqB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACO,SAAS,CAAW;IACpB,qBAAqB,CAAC,GAAY;QAExC,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAmB,UAAmB;QACpC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAEO,SAAS,CAAW;IAE5B;;;;;OAKG;IACI,sBAAsB,CAAC,SAAyB,EAAE,kBAA2B,KAAK;QACvF,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC;oBACxD,OAAO;gBACT,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC3C,SAAS,GAAG,UAAU,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC;oBAC/H,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;oBAE5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACnD,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrD,IAAI,OAAO,EAAE,CAAC,CAAE,4BAA4B;wBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;4BAClB,SAAS,CAAC,cAAc,EAAE,CAAC;4BAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC3D,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,yEAAyE;IACjE,cAAc,CAAC,MAAsB,EAAE,IAAoB;QACjE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAChG,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAC9G,IAAI,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC;gBACxF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,UAAsC,EAAE,UAAsC,EAAE,WAAoB,KAAK;QAChJ,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,OAAO,IAAI,CAAC;QACd,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QAC/F,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QACjG,OAAO,QAAQ;YACb,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,eAAe,CAAC,qBAAqB,CAAC,aAAa,CAAC;YAC3F,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9F,CAAC;CACF;AAxJD,sDAwJC","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 */\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { BagOfCurves } from \"../CurveCollection\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { Loop } from \"../Loop\";\nimport { Path } from \"../Path\";\n\n/**\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\n * * The caller makes a sequence of calls to announce individual primitives.\n *    * The collector has 2 use cases in mind, controlled by `searchAllPaths` flag on `chainCollectorContext.announceCurvePrimitive`\n *    * (a) \"simple chains\" -- the caller has the curve primitives in order and just needs to have them monitored for coordinate breaks that indicate transition to a new chain.\n *        * The collector needs to watch for connection to the most recent path but not search for prior paths to join to instead.\n *    * (b)  \"mixed\" primitives -- primitive order is NOT significant for chain assembly.\n *        * The collector needs to search all prior paths at both start and end, and consider connection to both the start and end of each new primitive.\n * * The per-curve announcement is\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\n * * When all curves have been announced, the call to grab the paths option\n *    * formLoopsIfClosed\n *       * If true, convert closed paths to `Loop`, open paths to `Path`\n *       * If false, convert all paths (open or not) to `Path`\n * * Usage pattern is\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\n *   * many times: `   context.announceCurvePrimitive (primitive, searchAllPaths)`\n *   * end:        ` result = context.grabResults (formLoopsIfClosed)`\n * @internal\n */\nexport class ChainCollectorContext {\n  private _chains: CurvePrimitive[][];\n  private _makeClones: boolean;\n\n  private static _staticPointA: Point3d;\n  private static _staticPointB: Point3d;\n\n  /**\n   * Push a new chain with an optional first primitive.\n   */\n  private pushNewChain(primitive?: CurvePrimitive) {\n    const chain = [];\n    if (primitive)\n      chain.push(primitive);\n    this._chains.push(chain);\n  }\n  private findOrCreateTailChain(): CurvePrimitive[] {\n    if (this._chains.length === 0)\n      this.pushNewChain();\n    return this._chains[this._chains.length - 1];\n  }\n  private _xyzWork0?: Point3d;\n  private findAnyChainToConnect(xyz: Point3d): { chainIndex: number, atEnd: boolean } | undefined {\n\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\n      const path = this._chains[chainIndexA];\n      this._xyzWork1 = path[path.length - 1].endPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz))\n        return { chainIndex: chainIndexA, atEnd: true };\n      this._xyzWork1 = path[0].startPoint(this._xyzWork1);\n      if (this._xyzWork1.isAlmostEqual(xyz))\n        return { chainIndex: chainIndexA, atEnd: false };\n    }\n    return undefined;\n  }\n\n  /** Initialize with an empty array of chains.\n   * @param makeClones if true, all CurvePrimitives sent to `announceCurvePrimitive` is immediately cloned.  If false, the reference to the original curve is maintained.\n   */\n  public constructor(makeClones: boolean) {\n    this._chains = [];\n    this._makeClones = makeClones;\n  }\n\n  private _xyzWork1?: Point3d;\n\n  /** Announce a curve primitive\n   * * searchAllChains controls the extent of search for connecting points.\n   *   * false ==> only consider connection to most recent chain.\n   *   * true ==> search for any connection, reversing direction as needed.\n   * * Otherwise start a new chain.\n   */\n  public announceCurvePrimitive(candidate: CurvePrimitive, searchAllChains: boolean = false) {\n    if (candidate) {\n      if (this._makeClones) {\n        const candidate1 = candidate.clone();\n        if (!candidate1 || !(candidate1 instanceof CurvePrimitive))\n          return;\n        this.transferMarkup(candidate, candidate1);\n        candidate = candidate1;\n      }\n      if (!searchAllChains) {\n        const activeChain = this.findOrCreateTailChain();\n        if (activeChain.length === 0 || !ChainCollectorContext.needBreakBetweenPrimitives(activeChain[activeChain.length - 1], candidate))\n          activeChain.push(candidate);\n        else\n          this.pushNewChain(candidate);\n      } else {\n        this._xyzWork0 = candidate.startPoint(this._xyzWork0);\n        let connect = this.findAnyChainToConnect(this._xyzWork0);\n        if (connect) {\n          if (connect.atEnd) {\n            this._chains[connect.chainIndex].push(candidate);\n          } else {\n            candidate.reverseInPlace();\n            this._chains[connect.chainIndex].splice(0, 0, candidate);\n          }\n        } else {\n          this._xyzWork0 = candidate.endPoint(this._xyzWork0);\n          connect = this.findAnyChainToConnect(this._xyzWork0);\n          if (connect) {  // START of new primitive ..\n            if (connect.atEnd) {\n              candidate.reverseInPlace();\n              this._chains[connect.chainIndex].push(candidate);\n            } else {\n              this._chains[connect.chainIndex].splice(0, 0, candidate);\n            }\n          } else {\n            this._chains.push([candidate]);\n          }\n        }\n      }\n    }\n  }\n  /** Transfer markup (e.g. startCut, endCut) from source to destination */\n  private transferMarkup(source: CurvePrimitive, dest: CurvePrimitive) {\n    if (source && dest) {\n      dest.startCut = source.startCut;\n      dest.endCut = source.endCut;\n    }\n  }\n  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\n   * * When a path is created the curves array is CAPTURED.\n   */\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\n    if (curves.length === 0)\n      return undefined;\n    if (makeLoopIfClosed) {\n      ChainCollectorContext._staticPointA = curves[0].startPoint(ChainCollectorContext._staticPointA);\n      ChainCollectorContext._staticPointB = curves[curves.length - 1].endPoint(ChainCollectorContext._staticPointB);\n      if (ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB))\n        return Loop.createArray(curves);\n    }\n    if (curves.length === 1)\n      return curves[0];\n    return Path.createArray(curves);\n  }\n  /** Return the collected results, structured as the simplest possible type. */\n  public grabResult(makeLoopIfClosed: boolean = false): CurvePrimitive | Path | BagOfCurves | Loop | undefined {\n    const chains = this._chains;\n    if (chains.length === 0)\n      return undefined;\n    if (chains.length === 1)\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\n    const bag = BagOfCurves.create();\n    for (const chain of chains) {\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\n      bag.tryAddChild(q);\n    }\n    return bag;\n  }\n  /** test if there is a break between primitiveA and primitiveB, due to any condition such as\n   * * primitiveA.endCut\n   * * primitiveB.startCut\n   * * physical gap between primitives.\n   */\n  public static needBreakBetweenPrimitives(primitiveA: CurvePrimitive | undefined, primitiveB: CurvePrimitive | undefined, isXYOnly: boolean = false): boolean {\n    if (primitiveA === undefined)\n      return true;\n    if (primitiveB === undefined)\n      return true;\n    if (primitiveA.endCut !== undefined)\n      return true;\n    if (primitiveB.startCut !== undefined)\n      return true;\n    ChainCollectorContext._staticPointA = primitiveA.endPoint(ChainCollectorContext._staticPointA);\n    ChainCollectorContext._staticPointB = primitiveB.startPoint(ChainCollectorContext._staticPointB);\n    return isXYOnly\n      ? !ChainCollectorContext._staticPointA.isAlmostEqualXY(ChainCollectorContext._staticPointB)\n      : !ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB);\n  }\n}\n"]}

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

@@ -16,6 +16,8 @@ const CurveProcessor_1 = require("../CurveProcessor");
  * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent
  */
 class CloneCurvesContext extends CurveProcessor_1.RecursiveCurveProcessorWithStack {
+    _result;
+    _transform;
     constructor(transform) {
         super();
         this._transform = transform;

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

@@ -1 +1 @@
-{"version":3,"file":"CloneCurvesContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneCurvesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,wDAA8E;AAE9E,sDAAqE;AAErE;;;;GAIG;AACH,MAAa,kBAAmB,SAAQ,iDAAgC;IAGtE,YAAsB,SAAqB;QACzC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACM,MAAM,CAAC,KAAK,CAAC,MAAuB,EAAE,SAAqB;QAChE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IACe,KAAK,CAAC,CAAkB;QACtC,IAAI,CAAC,YAAY,iCAAe;YAC9B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;IACpC,CAAC;IACe,KAAK;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,mCAAmC;gBAC/D,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;iBACnB,oCAAoC;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,iGAAiG;IACvF,OAAO,CAAC,SAAyB;QACzC,IAAI,IAAI,CAAC,UAAU;YACjB,OAAO,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACe,sBAAsB,CAAC,SAAyB,EAAE,cAAsB;QACtF,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,IAAI,MAAM,YAAY,6BAAW;gBAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBACnB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC;QACL,CAAC;IACH,CAAC;CACF;AA/CD,gDA+CC","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/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n/**\r\n * Algorithmic class for cloning curve collections.\r\n * * recurse through collection nodes, building image nodes as needed and inserting clones of children.\r\n * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent\r\n */\r\nexport class CloneCurvesContext extends RecursiveCurveProcessorWithStack {\r\n  protected _result: CurveCollection | undefined;\r\n  private _transform: Transform | undefined;\r\n  protected constructor(transform?: Transform) {\r\n    super();\r\n    this._transform = transform;\r\n    this._result = undefined;\r\n  }\r\n  public static clone(target: CurveCollection, transform?: Transform): CurveCollection | undefined {\r\n    const context = new CloneCurvesContext(transform);\r\n    target.announceToCurveProcessor(context);\r\n    return context._result;\r\n  }\r\n  public override enter(c: CurveCollection) {\r\n    if (c instanceof CurveCollection)\r\n      super.enter(c.cloneEmptyPeer());\r\n  }\r\n  public override leave(): CurveCollection | undefined {\r\n    const result = super.leave();\r\n    if (result) {\r\n      if (this._stack.length === 0) // this should only happen once !!!\r\n        this._result = result;\r\n      else // push this result to top of stack.\r\n        this._stack[this._stack.length - 1].tryAddChild(result);\r\n    }\r\n    return result;\r\n  }\r\n  // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)\r\n  protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    if (this._transform)\r\n      return primitive.cloneTransformed(this._transform);\r\n    return primitive.clone();\r\n  }\r\n  public override announceCurvePrimitive(primitive: CurvePrimitive, _indexInParent: number): void {\r\n    const c = this.doClone(primitive);\r\n    if (c !== undefined && this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain || parent instanceof BagOfCurves)\r\n        if (Array.isArray(c)) {\r\n          for (const c1 of c) {\r\n            parent.tryAddChild(c1);\r\n          }\r\n        } else {\r\n          parent.tryAddChild(c);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CloneCurvesContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneCurvesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,wDAA8E;AAE9E,sDAAqE;AAErE;;;;GAIG;AACH,MAAa,kBAAmB,SAAQ,iDAAgC;IAC5D,OAAO,CAA8B;IACvC,UAAU,CAAwB;IAC1C,YAAsB,SAAqB;QACzC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACM,MAAM,CAAC,KAAK,CAAC,MAAuB,EAAE,SAAqB;QAChE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IACe,KAAK,CAAC,CAAkB;QACtC,IAAI,CAAC,YAAY,iCAAe;YAC9B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;IACpC,CAAC;IACe,KAAK;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,mCAAmC;gBAC/D,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;iBACnB,oCAAoC;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,iGAAiG;IACvF,OAAO,CAAC,SAAyB;QACzC,IAAI,IAAI,CAAC,UAAU;YACjB,OAAO,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACe,sBAAsB,CAAC,SAAyB,EAAE,cAAsB;QACtF,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,IAAI,MAAM,YAAY,6BAAW;gBAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBACnB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC;QACL,CAAC;IACH,CAAC;CACF;AA/CD,gDA+CC","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/** @packageDocumentation\n * @module Curve\n */\n\nimport { Transform } from \"../../geometry3d/Transform\";\nimport { BagOfCurves, CurveChain, CurveCollection } from \"../CurveCollection\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\n\n/**\n * Algorithmic class for cloning curve collections.\n * * recurse through collection nodes, building image nodes as needed and inserting clones of children.\n * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent\n */\nexport class CloneCurvesContext extends RecursiveCurveProcessorWithStack {\n  protected _result: CurveCollection | undefined;\n  private _transform: Transform | undefined;\n  protected constructor(transform?: Transform) {\n    super();\n    this._transform = transform;\n    this._result = undefined;\n  }\n  public static clone(target: CurveCollection, transform?: Transform): CurveCollection | undefined {\n    const context = new CloneCurvesContext(transform);\n    target.announceToCurveProcessor(context);\n    return context._result;\n  }\n  public override enter(c: CurveCollection) {\n    if (c instanceof CurveCollection)\n      super.enter(c.cloneEmptyPeer());\n  }\n  public override leave(): CurveCollection | undefined {\n    const result = super.leave();\n    if (result) {\n      if (this._stack.length === 0) // this should only happen once !!!\n        this._result = result;\n      else // push this result to top of stack.\n        this._stack[this._stack.length - 1].tryAddChild(result);\n    }\n    return result;\n  }\n  // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)\n  protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\n    if (this._transform)\n      return primitive.cloneTransformed(this._transform);\n    return primitive.clone();\n  }\n  public override announceCurvePrimitive(primitive: CurvePrimitive, _indexInParent: number): void {\n    const c = this.doClone(primitive);\n    if (c !== undefined && this._stack.length > 0) {\n      const parent = this._stack[this._stack.length - 1];\n      if (parent instanceof CurveChain || parent instanceof BagOfCurves)\n        if (Array.isArray(c)) {\n          for (const c1 of c) {\n            parent.tryAddChild(c1);\n          }\n        } else {\n          parent.tryAddChild(c);\n        }\n    }\n  }\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"CloneWithExpandedLineStrings.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneWithExpandedLineStrings.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,oDAAiD;AACjD,kDAA+C;AAC/C,6DAA0D;AAE1D;;;GAGG;AACH,MAAa,4BAA6B,SAAQ,uCAAkB;IAClE;QACE,4BAA4B;QAC5B,KAAK,CAAC,SAAS,CAAC,CAAC;IACnB,CAAC;IACD,mCAAmC;IAChB,OAAO,CAAC,SAAyB;QAClD,IAAI,SAAS,YAAY,2BAAY,IAAI,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;YACnE,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9B,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,QAAQ,CAAC,IAAI,CAAC,6BAAa,CAAC,aAAa,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnJ,CAAC;YACD,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACM,MAAM,CAAU,KAAK,CAAC,MAAuB;QAClD,MAAM,OAAO,GAAG,IAAI,4BAA4B,EAAE,CAAC;QACnD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAA0B,CAAC;IAC5C,CAAC;CACF;AAvBD,oEAuBC","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 { CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { CloneCurvesContext } from \"./CloneCurvesContext\";\r\n\r\n/**\r\n * Algorithmic class for cloning with linestrings expanded to line segments\r\n * @internal\r\n */\r\nexport class CloneWithExpandedLineStrings extends CloneCurvesContext {\r\n  public constructor() {\r\n    // we have no transform ....\r\n    super(undefined);\r\n  }\r\n  // We know we have no transform !!!\r\n  protected override doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] {\r\n    if (primitive instanceof LineString3d && primitive.numPoints() > 1) {\r\n      const packedPoints = primitive.packedPoints;\r\n      const n = packedPoints.length;\r\n      const segments = [];\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        segments.push(LineSegment3d.createCapture(packedPoints.getPoint3dAtUncheckedPointIndex(i), packedPoints.getPoint3dAtUncheckedPointIndex(i + 1)));\r\n      }\r\n      return segments;\r\n    }\r\n    return primitive.clone();\r\n  }\r\n  public static override clone(target: CurveCollection): CurveCollection {\r\n    const context = new CloneWithExpandedLineStrings();\r\n    target.announceToCurveProcessor(context);\r\n    return context._result as CurveCollection;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CloneWithExpandedLineStrings.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneWithExpandedLineStrings.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,oDAAiD;AACjD,kDAA+C;AAC/C,6DAA0D;AAE1D;;;GAGG;AACH,MAAa,4BAA6B,SAAQ,uCAAkB;IAClE;QACE,4BAA4B;QAC5B,KAAK,CAAC,SAAS,CAAC,CAAC;IACnB,CAAC;IACD,mCAAmC;IAChB,OAAO,CAAC,SAAyB;QAClD,IAAI,SAAS,YAAY,2BAAY,IAAI,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC;YACnE,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9B,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,QAAQ,CAAC,IAAI,CAAC,6BAAa,CAAC,aAAa,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnJ,CAAC;YACD,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACM,MAAM,CAAU,KAAK,CAAC,MAAuB;QAClD,MAAM,OAAO,GAAG,IAAI,4BAA4B,EAAE,CAAC;QACnD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAA0B,CAAC;IAC5C,CAAC;CACF;AAvBD,oEAuBC","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 { CurveCollection } from \"../CurveCollection\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { CloneCurvesContext } from \"./CloneCurvesContext\";\n\n/**\n * Algorithmic class for cloning with linestrings expanded to line segments\n * @internal\n */\nexport class CloneWithExpandedLineStrings extends CloneCurvesContext {\n  public constructor() {\n    // we have no transform ....\n    super(undefined);\n  }\n  // We know we have no transform !!!\n  protected override doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] {\n    if (primitive instanceof LineString3d && primitive.numPoints() > 1) {\n      const packedPoints = primitive.packedPoints;\n      const n = packedPoints.length;\n      const segments = [];\n      for (let i = 0; i + 1 < n; i++) {\n        segments.push(LineSegment3d.createCapture(packedPoints.getPoint3dAtUncheckedPointIndex(i), packedPoints.getPoint3dAtUncheckedPointIndex(i + 1)));\n      }\n      return segments;\n    }\n    return primitive.clone();\n  }\n  public static override clone(target: CurveCollection): CurveCollection {\n    const context = new CloneWithExpandedLineStrings();\n    target.announceToCurveProcessor(context);\n    return context._result as CurveCollection;\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.d.ts

@@ -3,7 +3,6 @@
  */
 import { IStrokeHandler } from "../../geometry3d/GeometryHandler";
 import { Point3d, Vector3d } from "../../geometry3d/Point3dVector3d";
-import { Ray3d } from "../../geometry3d/Ray3d";
 import { VariantCurveExtendParameter } from "../CurveExtendMode";
 import { CurveLocationDetail } from "../CurveLocationDetail";
 import { CurvePrimitive } from "../CurvePrimitive";
@@ -19,13 +18,14 @@ export declare class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler i
     private _extend;
     private _fractionA;
     private _functionA;
-    private _functionB;
     private _fractionB;
+    private _functionB;
     private _numThisCurve;
     private _workPoint;
     private _workRay;
     private _newtonSolver;
-    constructor(spacePoint: Point3d, extend: VariantCurveExtendParameter, result?: CurveLocationDetail);
+    /** Constructor */
+    constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail);
     claimResult(): CurveLocationDetail | undefined;
     needPrimaryGeometryForStrokes(): boolean;
     startCurvePrimitive(curve: CurvePrimitive | undefined): void;
@@ -33,11 +33,27 @@ export declare class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler i
     announceIntervalForUniformStepStrokes(cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number): void;
     private announceCandidate;
     announceSegmentInterval(cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number): void;
+    /**
+     * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this
+     * fractional interval.
+     * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and
+     * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke
+     * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,
+     * this method can miss a root of `f`.
+     */
     private searchInterval;
-    private evaluateB;
     private announceSolutionFraction;
+    /**
+     * Evaluate the univariate real-valued function for which we are finding roots.
+     * * For finding the closest point to curve X from point Q, this function is `f(t) := Q-X(t) dot X'(t)`.
+     * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.
+     * @param pointAndDerivative pre-evaluated curve
+     * @param fraction fraction at which to evaluate `curve`
+     * @param curve curve to evaluate at `fraction`
+     */
+    private evaluateFunction;
     evaluate(fraction: number): boolean;
-    announceRay(fraction: number, data: Ray3d): void;
+    private announceRay;
     announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d): void;
 }
 //# sourceMappingURL=ClosestPointStrokeHandler.d.ts.map

package/lib/cjs/curve/internalContexts/ClosestPointStrokeHandler.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ClosestPointStrokeHandler.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAsB,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,uBAAwB,YAAW,cAAc;IAC9F,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,aAAa,CAAkC;IACvD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,OAAO,CAA8B;IAC7C,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,aAAa,CAAa;IAElC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,QAAQ,CAAQ;IACxB,OAAO,CAAC,aAAa,CAAyC;gBAE3C,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,2BAA2B,EAAE,MAAM,CAAC,EAAE,mBAAmB;IAWlG,WAAW,IAAI,mBAAmB,GAAG,SAAS;IAa9C,6BAA6B;IAI7B,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS;IAOrD,iBAAiB;IAGjB,qCAAqC,CAAC,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAahI,OAAO,CAAC,iBAAiB;IAUlB,uBAAuB,CAAC,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAgBrJ,OAAO,CAAC,cAAc;IActB,OAAO,CAAC,SAAS;IAKjB,OAAO,CAAC,wBAAwB;IAKzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAYnC,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI;IAOhD,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;CAIhF"}
+{"version":3,"file":"ClosestPointStrokeHandler.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,kCAAkC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAGrE,OAAO,EAAsB,2BAA2B,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE;;;GAGG;AACH,qBAAa,yBAA0B,SAAQ,uBAAwB,YAAW,cAAc;IAC9F,OAAO,CAAC,MAAM,CAA6B;IAC3C,OAAO,CAAC,aAAa,CAAkC;IACvD,OAAO,CAAC,WAAW,CAAU;IAC7B,OAAO,CAAC,OAAO,CAA8B;IAE7C,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAE/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,UAAU,CAAa;IAC/B,OAAO,CAAC,aAAa,CAAa;IAElC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,QAAQ,CAAQ;IACxB,OAAO,CAAC,aAAa,CAAyC;IAC9D,kBAAkB;gBACC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,2BAA2B,EAAE,MAAM,CAAC,EAAE,mBAAmB;IAUnG,WAAW,IAAI,mBAAmB,GAAG,SAAS;IAY9C,6BAA6B;IAG7B,mBAAmB,CAAC,KAAK,EAAE,cAAc,GAAG,SAAS;IAMrD,iBAAiB;IAEjB,qCAAqC,CAC1C,EAAE,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC3E,IAAI;IAaP,OAAO,CAAC,iBAAiB;IASlB,uBAAuB,CAC5B,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAC9G,IAAI;IAeP;;;;;;;OAOG;IACH,OAAO,CAAC,cAAc;IAiBtB,OAAO,CAAC,wBAAwB;IAIhC;;;;;;;OAOG;IACH,OAAO,CAAC,gBAAgB;IASjB,QAAQ,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IAU1C,OAAO,CAAC,WAAW;IAQZ,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ;CAIhF"}