@itwin/ecschema-rpcinterface-tests 3.5.0-dev.35 → 3.5.0-dev.41

package/lib/dist/bundled-tests.js

@@ -106973,6 +106973,20 @@ class AccuSnap {
         const currSnap = this.getCurrSnapDetail();
         return !currSnap ? false : currSnap.isHot;
     }
+    /** Optional ids to never flash. Useful for tools like "trim curve" that won't want a flashed segment to obscure a result preview.
+     * @note Cleared when a primitive or view tool is started and saved/restored when a primitive tool is suspended/unsuspended.
+     * @public
+     */
+    neverFlash(ids) {
+        if (undefined === ids) {
+            this.toolState.neverFlash = undefined;
+            return;
+        }
+        const newIds = new Set();
+        for (const id of _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Id64.iterable(ids))
+            newIds.add(id);
+        this.toolState.neverFlash = (0 !== newIds.size ? newIds : undefined);
+    }
     /** @internal */
     destroy() {
         this.currHit = undefined;
@@ -107202,6 +107216,8 @@ class AccuSnap {
             return false;
         if (hit.isModelHit || hit.isMapHit)
             return false; // Avoid annoying flashing of reality models.
+        if (this.toolState.neverFlash && this.toolState.neverFlash.has(hit.sourceId))
+            return false;
         const snap = AccuSnap.toSnapDetail(hit);
         return !snap || snap.isHot || this._settings.hiliteColdHits;
     }
@@ -107231,7 +107247,10 @@ class AccuSnap {
         }
         return hit;
     }
-    initCmdState() { this.toolState.suspended = 0; }
+    initCmdState() {
+        this.toolState.suspended = 0;
+        this.toolState.neverFlash = undefined;
+    }
     /** @internal */
     suspend(doSuspend) {
         const previousDoSnapping = this._doSnapping;
@@ -107635,8 +107654,11 @@ class AccuSnap {
             return;
         }
         const hit = _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.getCurrSnap();
-        if (hit && !(hit.isModelHit || hit.isMapHit)) // Don't hilite reality models.
-            hit.draw(context);
+        if (!hit || hit.isModelHit || hit.isMapHit)
+            return; // Don't hilite reality models.
+        if (this.toolState.neverFlash && this.toolState.neverFlash.has(hit.sourceId))
+            return;
+        hit.draw(context);
     }
     /** @internal */
     decorate(context) {
@@ -107730,6 +107752,7 @@ class TentativeOrAccuSnap {
             this.enabled = other.enabled;
             this.locate = other.locate;
             this.suspended = other.suspended;
+            this.neverFlash = other.neverFlash;
         }
         clone() {
             const val = new ToolState();
@@ -188996,7 +189019,8 @@ var EditManipulator;
         init() {
             // Set this.receivedDownEvent to still get up events sent to this tool instance when installed from another tool's down event (ex. onModelStartDrag).
             this.receivedDownEvent = true;
-            // Override inherited tool state from suspended primitive tool...
+            // Override inherited tool state from suspended primitive tool.
+            _IModelApp__WEBPACK_IMPORTED_MODULE_2__.IModelApp.accuSnap.onStartTool();
             if (this.wantAccuSnap)
                 this.initLocateElements(false, true, undefined, _Tool__WEBPACK_IMPORTED_MODULE_3__.CoordinateLockOverrides.None);
             else
@@ -194705,6 +194729,7 @@ class ToolAdmin {
         }
         if (_IModelApp__WEBPACK_IMPORTED_MODULE_5__.IModelApp.accuDraw.onPreButtonEvent(ev))
             return;
+        let updateDynamics = false;
         switch (ev.button) {
             case _Tool__WEBPACK_IMPORTED_MODULE_13__.BeButton.Data: {
                 if (undefined === tool) {
@@ -194722,10 +194747,7 @@ class ToolAdmin {
                 // Lock tool to target model of this view on first data button
                 if (tool instanceof _PrimitiveTool__WEBPACK_IMPORTED_MODULE_12__.PrimitiveTool)
                     tool.autoLockTarget();
-                // Process the active tool's pending hints from onDataButtonDown before calling updateDynamics...
-                _IModelApp__WEBPACK_IMPORTED_MODULE_5__.IModelApp.accuDraw.processHints();
-                // Update tool dynamics. Use last data button location which was potentially adjusted by onDataButtonDown and not current event
-                this.updateDynamics(undefined, true, true);
+                updateDynamics = true; // AccuDraw.onPostButtonEvent needs to process the active tool's pending hints from onDataButtonDown before calling updateDynamics...
                 break;
             }
             case _Tool__WEBPACK_IMPORTED_MODULE_13__.BeButton.Reset: {
@@ -194755,6 +194777,10 @@ class ToolAdmin {
         }
         _IModelApp__WEBPACK_IMPORTED_MODULE_5__.IModelApp.tentativePoint.onButtonEvent(ev);
         _IModelApp__WEBPACK_IMPORTED_MODULE_5__.IModelApp.accuDraw.onPostButtonEvent(ev);
+        if (!updateDynamics)
+            return;
+        // Update tool dynamics. Use last data button location which was potentially adjusted by onDataButtonDown and not current event
+        this.updateDynamics(undefined, true, true);
     }
     async onButtonDown(vp, pt2d, button, inputSource) {
         const filtered = this.filterViewport(vp);
@@ -201072,7 +201098,7 @@ class BSplineCurve3dBase extends _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_
      * * If the space point is exactly on the curve, this is the reverse of fractionToPoint.
      * * Since CurvePrimitive should always have start and end available as candidate points, this method should always succeed
      * @param spacePoint point in space
-     * @param extend true to extend the curve (if possible)
+     * @param _extend ignored. A BSplineCurve3dBase cannot be extended.
      * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
      */
     closestPoint(spacePoint, _extend) {
@@ -205515,11 +205541,13 @@ class KnotVector {
     /** Convert localFraction within the interval following an indexed knot to a knot value. */
     baseKnotFractionToKnot(knotIndex0, localFraction) {
         const knot0 = this.knots[knotIndex0];
+        localFraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.clamp(localFraction, 0, 1);
         return knot0 + localFraction * (this.knots[knotIndex0 + 1] - knot0);
     }
     /** Convert localFraction within an indexed bezier span to a knot value. */
     spanFractionToKnot(spanIndex, localFraction) {
         const k = this.spanIndexToLeftKnotIndex(spanIndex);
+        localFraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.clamp(localFraction, 0, 1);
         return this.knots[k] + localFraction * (this.knots[k + 1] - this.knots[k]);
     }
     /** Convert localFraction within an indexed bezier span to fraction of active knot range. */
@@ -205529,6 +205557,7 @@ class KnotVector {
     }
     /** Return fraction of active knot range to knot value. */
     fractionToKnot(fraction) {
+        fraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.clamp(fraction, 0, 1); // B-splines are not extendable
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.interpolate(this.knots[this.degree - 1], fraction, this.knots[this.knots.length - this.degree]);
     }
     /**
@@ -212772,9 +212801,9 @@ class PathFragment {
     }
     /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction
      */
-    chainDistanceToAccurateChildFraction(chainDistance) {
+    chainDistanceToAccurateChildFraction(chainDistance, allowExtrapolation) {
         // The fragments are really expected to do good mappings in their distance range ...
-        const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, false);
+        const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation !== null && allowExtrapolation !== void 0 ? allowExtrapolation : false);
         return childDetail.fraction;
     }
     /** Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
@@ -212797,12 +212826,16 @@ class PathFragment {
         this.chainDistance0 = totalDistance - d1;
         this.chainDistance1 = totalDistance - d0;
     }
+    /** @deprecated Use childFractionToChainDistance */
+    childFractionTChainDistance(fraction) {
+        return this.childFractionToChainDistance(fraction);
+    }
     /**
      * convert a fractional position on the childCurve to distance in the chain space.
      * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.
      * @param fraction fraction along the curve within this fragment
      */
-    childFractionTChainDistance(fraction) {
+    childFractionToChainDistance(fraction) {
         let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);
         if (fraction < this.childFraction0)
             d = -d;
@@ -212835,7 +212868,7 @@ class DistanceIndexConstructionContext {
             let f1;
             for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {
                 f1 = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
-                point0.interpolate(fraction1, point1, fragmentPoint1);
+                point0.interpolate(f1, point1, fragmentPoint1);
                 d0 = this._accumulatedDistance;
                 this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));
                 this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.create(fragmentPoint0, fragmentPoint1)));
@@ -212903,37 +212936,41 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         return CurveChainWithDistanceIndex.createCapture(c);
     }
     /** Return a deep clone */
-    clonePartialCurve(_fractionA, _fractionB) {
-        if (_fractionA === _fractionB)
+    clonePartialCurve(fractionA, fractionB) {
+        if (fractionA === fractionB)
             return undefined;
-        let fractionA = _fractionA;
-        let fractionB = _fractionB;
-        const reversed = _fractionA > _fractionB;
+        let fracA = fractionA;
+        let fracB = fractionB;
+        const reversed = fractionA > fractionB;
         if (reversed) {
-            fractionA = _fractionB;
-            fractionB = _fractionA;
+            fracA = fractionB;
+            fracB = fractionA;
         }
-        const chainDistanceA = fractionA * this._totalLength;
-        const chainDistanceB = fractionB * this._totalLength;
-        const newPath = _Path__WEBPACK_IMPORTED_MODULE_4__.Path.create();
+        const chainDistanceA = fracA * this._totalLength;
+        const chainDistanceB = fracB * this._totalLength;
         const fragmentA = this.chainDistanceToFragment(chainDistanceA, true);
+        if (undefined === fragmentA)
+            return undefined;
         const fragmentB = this.chainDistanceToFragment(chainDistanceB, true);
-        if (!fragmentA || !fragmentB)
+        if (undefined === fragmentB)
             return undefined;
-        const childCurveIndexA = this._path.childIndex(fragmentA.childCurve);
-        const childCurveIndexB = this._path.childIndex(fragmentB.childCurve);
-        const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA);
-        const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB);
-        if (childCurveIndexA === undefined || childCurveIndexB === undefined)
+        const childCurveIndexA = this._path.childIndex(fragmentA.childCurve, true);
+        if (undefined === childCurveIndexA)
             return undefined;
+        const childCurveIndexB = this._path.childIndex(fragmentB.childCurve, true);
+        if (undefined === childCurveIndexB)
+            return undefined;
+        const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);
+        const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);
         // add a (possibly reversed) partial clone to newPath
+        const newPath = _Path__WEBPACK_IMPORTED_MODULE_4__.Path.create();
         const addPartialChild = (childCurve, childFraction0, childFraction1, reversedClone) => {
-            if (fractionA === fractionB)
+            if (childFraction0 === childFraction1)
                 return false;
             let newCurve;
-            if (fractionA === 0.0 && fractionB === 1.0) {
+            if (childFraction0 === 0.0 && childFraction1 === 1.0) {
                 newCurve = childCurve.clone();
-                if (reversed)
+                if (reversedClone)
                     newCurve.reverseInPlace();
             }
             else {
@@ -213064,7 +213101,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * Capture (not clone) a path into a new `CurveChainWithDistanceIndex`
-     * @param primitives primitive array to be CAPTURED (not cloned)
+     * @param path primitive array to be CAPTURED (not cloned)
      */
     static createCapture(path, options) {
         const fragments = DistanceIndexConstructionContext.createPathFragmentIndex(path, options);
@@ -213161,7 +213198,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         const chainDistance = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(chainDistance, true);
         if (fragment) {
-            const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance);
+            const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);
             return fragment.childCurve.fractionToPoint(childFraction, result);
         }
         // no fragment found.  Use _fragments[0]
@@ -213179,7 +213216,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     fractionToPointAndDerivative(fraction, result) {
         const distanceAlongPath = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
         result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
         const a = this._totalLength / result.direction.magnitude();
         result.direction.scaleInPlace(a);
@@ -213194,7 +213231,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     fractionToPointAndUnitTangent(fraction, result) {
         const distanceAlongPath = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
         result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
         result.direction.normalizeInPlace();
         return result;
@@ -213209,7 +213246,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         const totalLength = this._totalLength;
         const distanceAlongPath = fraction * totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath);
+        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
         result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);
         if (!result)
             return undefined;
@@ -213338,7 +213375,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
             return undefined;
         const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);
         if (fragment) {
-            const chainDistance = fragment.childFractionTChainDistance(childDetail.fraction);
+            const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);
             const chainFraction = this.chainDistanceToChainFraction(chainDistance);
             const chainDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_7__.CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);
             chainDetail.childDetail = childDetail;
@@ -213400,6 +213437,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _internalContexts_SumLengthsContext__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internalContexts/SumLengthsContext */ "../../core/geometry/lib/esm/curve/internalContexts/SumLengthsContext.js");
 /* harmony import */ var _internalContexts_TransformInPlaceContext__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./internalContexts/TransformInPlaceContext */ "../../core/geometry/lib/esm/curve/internalContexts/TransformInPlaceContext.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _ProxyCurve__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./ProxyCurve */ "../../core/geometry/lib/esm/curve/ProxyCurve.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -213418,6 +213456,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
  * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:
  * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive ` joining head-to-tail.  The two instantiable forms of `CurveChain` are
@@ -213642,12 +213681,23 @@ class CurveChain extends CurveCollection {
             curve.reverseInPlace();
         this._curves.reverse();
     }
-    /** Return the index where target is found in the array of children */
-    childIndex(target) {
+    /** Return the index where target is found in the array of children
+     * @param alsoSearchProxies whether to also check proxy curves of the children
+    */
+    childIndex(target, alsoSearchProxies) {
         for (let i = 0; i < this._curves.length; i++) {
             if (this._curves[i] === target)
                 return i;
         }
+        if (alsoSearchProxies !== null && alsoSearchProxies !== void 0 ? alsoSearchProxies : false) {
+            for (let i = 0; i < this._curves.length; i++) {
+                const childCurve = this._curves[i];
+                if (childCurve instanceof _ProxyCurve__WEBPACK_IMPORTED_MODULE_11__.ProxyCurve) {
+                    if (childCurve.proxyCurve === target)
+                        return i;
+                }
+            }
+        }
         return undefined;
     }
     /** Evaluate an indexed curve at a fraction.  Return as a CurveLocationDetail that indicates the primitive.
@@ -217258,19 +217308,26 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "CurvePrimitive": () => (/* binding */ CurvePrimitive)
 /* harmony export */ });
-/* harmony import */ var _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../curve/Query/StrokeCountMap */ "../../core/geometry/lib/esm/curve/Query/StrokeCountMap.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Matrix3d */ "../../core/geometry/lib/esm/geometry3d/Matrix3d.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
-/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
-/* harmony import */ var _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../numerics/BezierPolynomials */ "../../core/geometry/lib/esm/numerics/BezierPolynomials.js");
-/* harmony import */ var _numerics_Newton__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../numerics/Newton */ "../../core/geometry/lib/esm/numerics/Newton.js");
-/* harmony import */ var _numerics_Quadrature__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../numerics/Quadrature */ "../../core/geometry/lib/esm/numerics/Quadrature.js");
-/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../curve/Query/StrokeCountMap */ "../../core/geometry/lib/esm/curve/Query/StrokeCountMap.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Matrix3d */ "../../core/geometry/lib/esm/geometry3d/Matrix3d.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
+/* harmony import */ var _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./internalContexts/AppendPlaneIntersectionStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js");
+/* harmony import */ var _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./internalContexts/ClosestPointStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js");
+/* harmony import */ var _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./internalContexts/CurveLengthContext */ "../../core/geometry/lib/esm/curve/internalContexts/CurveLengthContext.js");
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
 
 
 
@@ -217298,7 +217355,7 @@ __webpack_require__.r(__webpack_exports__);
  * For fractions outside 0..1, the curve primitive class may either (a) return the near endpoint or (b) evaluate an extended curve.
  * @public
  */
-class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.GeometryQuery {
+class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.GeometryQuery {
     constructor() {
         super();
         /** String name for schema properties */
@@ -217324,7 +217381,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
         const cross = data.vectorU.crossProduct(data.vectorV);
         const a = cross.magnitude();
         const b = data.vectorU.magnitude();
-        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideFraction(a, b * b * b);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideFraction(a, b * b * b);
     }
     /** Construct a frenet frame:
      * * origin at the point on the curve
@@ -217336,14 +217393,14 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
         const plane = this.fractionToPointAnd2Derivatives(fraction);
         if (!plane)
             return undefined;
-        let axes = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createRigidFromColumns(plane.vectorU, plane.vectorV, _Geometry__WEBPACK_IMPORTED_MODULE_1__.AxisOrder.XYZ);
+        let axes = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createRigidFromColumns(plane.vectorU, plane.vectorV, _Geometry__WEBPACK_IMPORTED_MODULE_2__.AxisOrder.XYZ);
         if (axes)
-            return _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__.Transform.createRefs(plane.origin, axes, result);
+            return _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_4__.Transform.createRefs(plane.origin, axes, result);
         // 2nd derivative not distinct -- do arbitrary headsUP ...
-        const perpVector = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createPerpendicularVectorFavorXYPlane(plane.vectorU, plane.vectorV);
-        axes = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createRigidFromColumns(plane.vectorU, perpVector, _Geometry__WEBPACK_IMPORTED_MODULE_1__.AxisOrder.XYZ);
+        const perpVector = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createPerpendicularVectorFavorXYPlane(plane.vectorU, plane.vectorV);
+        axes = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createRigidFromColumns(plane.vectorU, perpVector, _Geometry__WEBPACK_IMPORTED_MODULE_2__.AxisOrder.XYZ);
         if (axes)
-            return _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__.Transform.createRefs(plane.origin, axes, result);
+            return _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_4__.Transform.createRefs(plane.origin, axes, result);
         return undefined;
     }
     /** Construct signed distance from a point on the curve to its center of curvature (in xy only).
@@ -217359,7 +217416,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
         const b = plane.vectorU.magnitude();
         if (b === 0.0)
             return 0.0;
-        const r = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideCoordinate(b * b * b, cross);
+        const r = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideCoordinate(b * b * b, cross);
         if (r !== undefined)
             return r;
         return 0.0;
@@ -217378,7 +217435,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * * Curve length is always positive.
      */
     curveLength() {
-        const context = new CurveLengthContext();
+        const context = new _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_5__.CurveLengthContext();
         this.emitStrokableParts(context);
         return context.getSum();
     }
@@ -217398,7 +217455,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
             const totalLength = this.curveLength();
             return Math.abs((fraction1 - fraction0) * totalLength);
         }
-        const context = new CurveLengthContext(fraction0, fraction1);
+        const context = new _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_5__.CurveLengthContext(fraction0, fraction1);
         this.emitStrokableParts(context);
         return Math.abs(context.getSum());
     }
@@ -217415,11 +217472,11 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      */
     rangeBetweenFractionsByClone(fraction0, fraction1, transform) {
         if (fraction0 === fraction1)
-            return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.create(this.fractionToPoint(fraction0));
+            return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__.Range3d.create(this.fractionToPoint(fraction0));
         const fragment = this.clonePartialCurve(fraction0, fraction1);
         if (fragment)
             return fragment.range(transform);
-        return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createNull();
+        return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__.Range3d.createNull();
     }
     /**
      * Returns an approximate range based on a fixed number of evaluations
@@ -217433,8 +217490,8 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * @param extrapolationFactor if positive, evaluate again at interval midpoints and apply this fraction multiplier to any increase in size.
      */
     rangeBetweenFractionsByCount(fraction0, fraction1, count, transform, extrapolationFactor = 0.0) {
-        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createNull();
-        const workPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.create();
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__.Range3d.createNull();
+        const workPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
         range.extendPoint(this.startPoint(workPoint));
         range.extendPoint(this.endPoint(workPoint));
         // Evaluate at count fractions (fraction0 + i * fractionStep)
@@ -217484,7 +217541,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
             fraction0 = fraction1;
             fraction1 = fSave;
         }
-        const context = new CurveLengthContext(fraction0, fraction1, numGauss);
+        const context = new _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_5__.CurveLengthContext(fraction0, fraction1, numGauss);
         context.announceIntervalForUniformStepStrokes(this, numInterval, fraction0, fraction1);
         return Math.abs(context.getSum());
     }
@@ -217493,9 +217550,8 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * * (Attempt to) find a position on the curve at a signed distance from start fraction.
      * * Return the position as a CurveLocationDetail.
      * * In the `CurveLocationDetail`, record:
-     *   * `fractional` position
-     *   * `fraction` = coordinates of the point
-     *   * `search
+     *   * `fraction` = fractional position
+     *   * `point` = coordinates of the point
      *   * `a` = (signed!) distance moved.   If `allowExtension` is false and the move reached the start or end of the curve, this distance is smaller than the requested signedDistance.
      *   * `curveSearchStatus` indicates one of:
      *     * `error` (unusual) computation failed not supported for this curve.
@@ -217524,11 +217580,11 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
             // We are in luck! simple proportions determine it all  !!!
             // (for example, a LineSegment3d or a circular arc)
             const totalLength = this.curveLength();
-            const signedFractionMove = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideFraction(signedDistance, totalLength);
+            const signedFractionMove = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideFraction(signedDistance, totalLength);
             if (signedFractionMove === undefined) {
-                return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPointDistanceCurveSearchStatus(this, startFraction, this.fractionToPoint(startFraction), 0.0, _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveSearchStatus.error);
+                return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createCurveFractionPointDistanceCurveSearchStatus(this, startFraction, this.fractionToPoint(startFraction), 0.0, _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveSearchStatus.error);
             }
-            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, startFraction + signedFractionMove, signedDistance, result);
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, startFraction + signedFractionMove, signedDistance, result);
         }
         return this.moveSignedDistanceFromFractionGeneric(startFraction, signedDistance, allowExtension, result);
     }
@@ -217550,19 +217606,45 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * @param result
      */
     moveSignedDistanceFromFractionGeneric(startFraction, signedDistance, allowExtension, result) {
-        const limitFraction = signedDistance > 0.0 ? 1.0 : 0.0;
+        let limitFraction;
+        const slackFraction = 0.1; // slack to use when integration would otherwise have no room to work
+        if (signedDistance === 0.0)
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result); // no movement, just evaluate at startFraction
+        if (signedDistance > 0.0) {
+            limitFraction = 1.0;
+            if (startFraction >= 1.0) {
+                const newStartFraction = 1.0 - slackFraction;
+                signedDistance += this.curveLengthBetweenFractions(newStartFraction, startFraction);
+                startFraction = newStartFraction;
+            }
+        }
+        else { // signedDistance < 0.0
+            limitFraction = 0.0;
+            if (startFraction <= 0.0) {
+                const newStartFraction = 0.0 + slackFraction;
+                signedDistance -= this.curveLengthBetweenFractions(startFraction, newStartFraction);
+                startFraction = newStartFraction;
+            }
+        }
+        const availableLength = this.curveLengthBetweenFractions(startFraction, limitFraction);
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(availableLength > 0.0);
         const absDistance = Math.abs(signedDistance);
-        const directionFactor = signedDistance < 0.0 ? -1.0 : 1.0;
-        const availableLength = this.curveLengthBetweenFractions(startFraction, limitFraction); // that is always positive
         if (availableLength < absDistance && !allowExtension)
-            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, limitFraction, signedDistance, result);
-        const fractionStep = absDistance / availableLength;
-        let fractionB = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(startFraction, fractionStep, limitFraction);
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, limitFraction, signedDistance, result);
+        const fractionStep = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideCoordinate(absDistance, availableLength);
+        if (undefined === fractionStep) {
+            // no available length!
+            result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);
+            result.curveSearchStatus = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveSearchStatus.error;
+            return result;
+        }
+        const directionFactor = signedDistance < 0.0 ? -1.0 : 1.0;
+        let fractionB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(startFraction, fractionStep, limitFraction);
         let fractionA = startFraction;
         let distanceA = 0.0;
         const tol = 1.0e-12 * availableLength;
         let numConverged = 0;
-        const tangent = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.createXAxis();
+        const tangent = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_9__.Ray3d.createXAxis();
         // on each loop entry:
         // fractionA is the most recent endOfInterval.  (It may have been reached by a mixture of forward and backward step.)
         // distanceA is the distance to (the point at) fractionA
@@ -217591,10 +217673,9 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
             distanceA = distance0B;
         }
         if (numConverged > 1)
-            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createConditionalMoveSignedDistance(false, this, startFraction, fractionB, signedDistance, result);
-        result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);
-        result.a = 0.0;
-        result.curveSearchStatus = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveSearchStatus.error;
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, fractionB, signedDistance, result);
+        result = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createCurveEvaluatedFraction(this, startFraction, result);
+        result.curveSearchStatus = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveSearchStatus.error;
         return result;
     }
     /**
@@ -217615,7 +217696,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
      */
     closestPoint(spacePoint, extend) {
-        const strokeHandler = new ClosestPointStrokeHandler(spacePoint, extend);
+        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_10__.ClosestPointStrokeHandler(spacePoint, extend);
         this.emitStrokableParts(strokeHandler);
         return strokeHandler.claimResult();
     }
@@ -217637,7 +217718,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
         return undefined;
     }
     /**
-     * * If the curve primitive has distance-along-curve strictly proportional to curve fraction, return true
+     * * If the curve primitive has distance-along-curve strictly proportional to curve fraction, return the scale factor.
      * * If distance-along-the-curve is not proportional, return undefined.
      * * When defined, the scale factor is always the length of the curve.
      * * This scale factor is typically available for these curve types:
@@ -217662,7 +217743,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * @returns Return the number of CurveLocationDetail's added to the result array.
      */
     appendPlaneIntersectionPoints(plane, result) {
-        const strokeHandler = new AppendPlaneIntersectionStrokeHandler(plane, result);
+        const strokeHandler = new _internalContexts_AppendPlaneIntersectionStrokeHandler__WEBPACK_IMPORTED_MODULE_11__.AppendPlaneIntersectionStrokeHandler(plane, result);
         const n0 = result.length;
         this.emitStrokableParts(strokeHandler);
         return result.length - n0;
@@ -217677,17 +217758,17 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
      * @param startEndXYZTolerance if nonzero, adjust to endpoint with this tolerance.
      * @internal
      */
-    static snapAndRestrictDetails(details, allowExtend = true, applySnappedCoordinates = false, startEndFractionTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallAngleRadians, startEndXYZTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+    static snapAndRestrictDetails(details, allowExtend = true, applySnappedCoordinates = false, startEndFractionTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallAngleRadians, startEndXYZTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
         const n0 = details.length;
         let acceptIndex = 0;
-        const point0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.create();
-        const point1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.create();
+        const point0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+        const point1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
         let snappedCoordinates;
         for (let candidateIndex = 0; candidateIndex < n0; candidateIndex++) {
             snappedCoordinates = undefined;
             const detail = details[candidateIndex];
             let fraction = detail.fraction;
-            let accept = allowExtend || _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isIn01(fraction);
+            let accept = allowExtend || _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fraction);
             if (detail.curve) {
                 detail.curve.startPoint(point0);
                 detail.curve.endPoint(point1);
@@ -217696,13 +217777,13 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
                 if (Math.abs(fraction) < startEndFractionTolerance) {
                     fraction = 0.0;
                     accept = true;
-                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveIntervalRole.isolatedAtVertex;
+                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveIntervalRole.isolatedAtVertex;
                     snappedCoordinates = point0;
                 }
                 if (Math.abs(fraction - 1.0) < startEndFractionTolerance) {
                     fraction = 1.0;
                     accept = true;
-                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveIntervalRole.isolatedAtVertex;
+                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveIntervalRole.isolatedAtVertex;
                     snappedCoordinates = point1;
                     if (detail.curve)
                         snappedCoordinates = detail.curve.startPoint(point1);
@@ -217712,12 +217793,12 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
                 // REMARK: always test both endpoints.   If there is a cyclic fraction space, an intersection marked as "after" the end might have wrapped all the way to the beginning.
                 if (detail.point.distance(point0) <= startEndXYZTolerance) {
                     fraction = 0.0;
-                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveIntervalRole.isolatedAtVertex;
+                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveIntervalRole.isolatedAtVertex;
                     snappedCoordinates = point0;
                 }
                 else if (detail.point.distance(point1) <= startEndXYZTolerance) {
                     fraction = 1.0;
-                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveIntervalRole.isolatedAtVertex;
+                    detail.intervalRole = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveIntervalRole.isolatedAtVertex;
                     snappedCoordinates = point1;
                 }
             }
@@ -217754,7 +217835,7 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
     computeAndAttachRecursiveStrokeCounts(options, parentMap) {
         const n = this.computeStrokeCountForOptions(options);
         const a = this.curveLength();
-        CurvePrimitive.installStrokeCountMap(this, _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_8__.StrokeCountMap.createWithCurvePrimitive(this, n, a, 0, a), parentMap);
+        CurvePrimitive.installStrokeCountMap(this, _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_12__.StrokeCountMap.createWithCurvePrimitive(this, n, a, 0, a), parentMap);
     }
     /**
      * * evaluate strokes at fractions indicated in a StrokeCountMap.
@@ -217810,326 +217891,6 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geometr
         return results;
     }
 }
-/** Intermediate class for managing the parentCurve announcements from an IStrokeHandler */
-class NewtonRotRStrokeHandler extends _numerics_Newton__WEBPACK_IMPORTED_MODULE_9__.NewtonEvaluatorRtoR {
-    constructor() {
-        super();
-        this._parentCurvePrimitive = undefined;
-    }
-    /** retain the parentCurvePrimitive.
-     * * Calling this method tells the handler that the parent curve is to be used for detail searches.
-     * * Example: Transition spiral search is based on linestring first, then the exact spiral.
-     * * Example: CurveChainWithDistanceIndex does NOT do this announcement -- the constituents act independently.
-     */
-    startParentCurvePrimitive(curve) { this._parentCurvePrimitive = curve; }
-    /** Forget the parentCurvePrimitive */
-    endParentCurvePrimitive(_curve) { this._parentCurvePrimitive = undefined; }
-}
-class AppendPlaneIntersectionStrokeHandler extends NewtonRotRStrokeHandler {
-    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);
-        this._ray = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.createZero();
-        this._newtonSolver = new _numerics_Newton__WEBPACK_IMPORTED_MODULE_9__.Newton1dUnboundedApproximateDerivative(this);
-    }
-    // Return the first defined curve among: this.parentCurvePrimitive, this.curve;
-    effectiveCurve() {
-        if (this._parentCurvePrimitive)
-            return this._parentCurvePrimitive;
-        return this._curve;
-    }
-    get getDerivativeB() { return this._derivativeB; } // <--- DerivativeB is not currently used anywhere. Provided getter to suppress lint error
-    startCurvePrimitive(curve) {
-        this._curve = curve;
-        this._fractionA = 0.0;
-        this._numThisCurve = 0;
-        this._functionA = 0.0;
-        // this.derivativeA = 0.0;
-    }
-    endCurvePrimitive() { }
-    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__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, i * df, fraction1);
-            cp.fractionToPointAndDerivative(fraction, this._ray);
-            this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);
-        }
-    }
-    announceSegmentInterval(_cp, point0, point1, _numStrokes, fraction0, fraction1) {
-        const h0 = this._plane.altitude(point0);
-        const h1 = this._plane.altitude(point1);
-        if (h0 * h1 > 0.0)
-            return;
-        const fraction01 = _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_10__.Order2Bezier.solveCoffs(h0, h1);
-        // let numIntersection = 0;
-        if (fraction01 !== undefined) {
-            // numIntersection++;
-            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, fraction01, fraction1);
-            this._newtonSolver.setX(fraction);
-            if (this._newtonSolver.runIterations()) {
-                this.announceSolutionFraction(this._newtonSolver.getX());
-            }
-            // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));
-        }
-    }
-    announceSolutionFraction(fraction) {
-        const curve = this.effectiveCurve();
-        if (curve) {
-            this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);
-            this._intersections.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));
-        }
-    }
-    evaluate(fraction) {
-        const curve = this.effectiveCurve();
-        if (!curve)
-            return false;
-        this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));
-        return true;
-    }
-    /**
-     * * ASSUME both the "A" and "B"  evaluations (fraction, function, and derivative) are known.
-     * * If function value changed sign between, interpolate an approximate root and improve it with
-     *     the newton solver.
-     */
-    searchInterval() {
-        if (this._functionA * this._functionB > 0)
-            return;
-        if (this._functionA === 0)
-            this.announceSolutionFraction(this._fractionA);
-        if (this._functionB === 0)
-            this.announceSolutionFraction(this._fractionB);
-        if (this._functionA * this._functionB < 0) {
-            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_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());
-            }
-        }
-    }
-    /** Evaluate and save _functionB, _derivativeB, and _fractionB. */
-    evaluateB(xyz, fraction, tangent) {
-        this._functionB = this._plane.altitude(xyz);
-        this._derivativeB = this._plane.velocity(tangent);
-        this._fractionB = fraction;
-    }
-    /**
-     * Announce point and tangent for evaluations.
-     * * The function evaluation is saved as the "B" function point.
-     * * The function point count is incremented
-     * * If function point count is greater than 1, the current interval is searched.
-     * * The just-evaluated point ("B") is saved as the "old" ("A") evaluation point.
-     * @param xyz
-     * @param fraction
-     * @param tangent
-     */
-    announcePointTangent(xyz, fraction, tangent) {
-        this.evaluateB(xyz, fraction, tangent);
-        if (this._numThisCurve++ > 0)
-            this.searchInterval();
-        this._functionA = this._functionB;
-        this._fractionA = this._fractionB;
-    }
-}
-class CurveLengthContext {
-    constructor(fraction0 = 0.0, fraction1 = 1.0, numGaussPoints = 5) {
-        this.startCurvePrimitive(undefined);
-        this._summedLength = 0.0;
-        this._ray = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.createZero();
-        if (fraction0 < fraction1) {
-            this._fraction0 = fraction0;
-            this._fraction1 = fraction1;
-        }
-        else {
-            this._fraction0 = fraction1;
-            this._fraction1 = fraction0;
-        }
-        this._gaussMapper = new _numerics_Quadrature__WEBPACK_IMPORTED_MODULE_11__.GaussMapper(numGaussPoints);
-    }
-    tangentMagnitude(fraction) {
-        this._ray = this._curve.fractionToPointAndDerivative(fraction, this._ray);
-        return this._ray.direction.magnitude();
-    }
-    getSum() { return this._summedLength; }
-    startCurvePrimitive(curve) {
-        this._curve = curve;
-    }
-    startParentCurvePrimitive(_curve) { }
-    endParentCurvePrimitive(_curve) { }
-    endCurvePrimitive() { }
-    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
-        if (fraction0 < this._fraction0)
-            fraction0 = this._fraction0;
-        if (fraction1 > this._fraction1)
-            fraction1 = this._fraction1;
-        if (fraction1 > fraction0) {
-            this.startCurvePrimitive(cp);
-            if (numStrokes < 1)
-                numStrokes = 1;
-            const df = 1.0 / numStrokes;
-            for (let i = 1; i <= numStrokes; i++) {
-                const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, (i - 1) * df, fraction1);
-                const fractionB = i === numStrokes ? fraction1 : _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, (i) * df, fraction1);
-                const numGauss = this._gaussMapper.mapXAndW(fractionA, fractionB);
-                for (let k = 0; k < numGauss; k++) {
-                    this._summedLength += this._gaussMapper.gaussW[k] * this.tangentMagnitude(this._gaussMapper.gaussX[k]);
-                }
-            }
-        }
-    }
-    announceSegmentInterval(_cp, point0, point1, _numStrokes, fraction0, fraction1) {
-        const segmentLength = point0.distance(point1);
-        if (this._fraction0 <= fraction0 && fraction1 <= this._fraction1)
-            this._summedLength += segmentLength;
-        else {
-            let g0 = fraction0;
-            let g1 = fraction1;
-            if (g0 < this._fraction0)
-                g0 = this._fraction0;
-            if (g1 > this._fraction1)
-                g1 = this._fraction1;
-            if (g1 > g0) {
-                this._summedLength += segmentLength * (g1 - g0) / (fraction1 - fraction0);
-            }
-        }
-    }
-    announcePointTangent(_xyz, _fraction, _tangent) {
-        // uh oh -- need to retain point for next interval
-    }
-}
-// context for searching for closest point .. .
-class ClosestPointStrokeHandler extends NewtonRotRStrokeHandler {
-    constructor(spacePoint, extend) {
-        super();
-        this._fractionA = 0;
-        this._functionA = 0;
-        this._functionB = 0;
-        this._fractionB = 0;
-        this._numThisCurve = 0;
-        this._spacePoint = spacePoint;
-        this._workPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.create();
-        this._workRay = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.createZero();
-        this._closestPoint = undefined;
-        this._extend = extend;
-        this.startCurvePrimitive(undefined);
-        this._newtonSolver = new _numerics_Newton__WEBPACK_IMPORTED_MODULE_9__.Newton1dUnboundedApproximateDerivative(this);
-    }
-    claimResult() {
-        if (this._closestPoint) {
-            this._newtonSolver.setX(this._closestPoint.fraction);
-            this._curve = this._closestPoint.curve;
-            if (this._newtonSolver.runIterations()) {
-                let fraction = this._newtonSolver.getX();
-                fraction = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_12__.CurveExtendOptions.correctFraction(this._extend, fraction);
-                this.announceSolutionFraction(fraction);
-            }
-        }
-        return this._closestPoint;
-    }
-    needPrimaryGeometryForStrokes() { return true; }
-    startCurvePrimitive(curve) {
-        this._curve = curve;
-        this._fractionA = 0.0;
-        this._numThisCurve = 0;
-        this._functionA = 0.0;
-    }
-    endCurvePrimitive() { }
-    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
-        this.startCurvePrimitive(cp);
-        this.announceSolutionFraction(0.0); // test start point as closest
-        this.announceSolutionFraction(1.0); // test end point as closest
-        if (numStrokes < 1)
-            numStrokes = 1;
-        const df = 1.0 / numStrokes;
-        for (let i = 0; i <= numStrokes; i++) {
-            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, i * df, fraction1);
-            cp.fractionToPointAndDerivative(fraction, this._workRay);
-            this.announceRay(fraction, this._workRay);
-        }
-    }
-    announceCandidate(cp, fraction, point) {
-        const distance = this._spacePoint.distance(point);
-        if (this._closestPoint && distance > this._closestPoint.a)
-            return;
-        this._closestPoint = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);
-        this._closestPoint.a = distance;
-        if (this._parentCurvePrimitive !== undefined)
-            this._closestPoint.curve = this._parentCurvePrimitive;
-    }
-    announceSegmentInterval(cp, point0, point1, _numStrokes, fraction0, fraction1) {
-        let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);
-        // only consider extending the segment if the immediate caller says we are at endpoints ...
-        if (!this._extend)
-            localFraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.clampToStartEnd(localFraction, 0.0, 1.0);
-        else {
-            if (fraction0 !== 0.0)
-                localFraction = Math.max(localFraction, 0.0);
-            if (fraction1 !== 1.0)
-                localFraction = Math.min(localFraction, 1.0);
-        }
-        this._workPoint = point0.interpolate(localFraction, point1);
-        const globalFraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, localFraction, fraction1);
-        this.announceCandidate(cp, globalFraction, this._workPoint);
-    }
-    searchInterval() {
-        if (this._functionA * this._functionB > 0)
-            return;
-        if (this._functionA === 0)
-            this.announceSolutionFraction(this._fractionA);
-        if (this._functionB === 0)
-            this.announceSolutionFraction(this._fractionB);
-        if (this._functionA * this._functionB < 0) {
-            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_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());
-            }
-        }
-    }
-    evaluateB(fractionB, dataB) {
-        this._functionB = dataB.dotProductToPoint(this._spacePoint);
-        this._fractionB = fractionB;
-    }
-    announceSolutionFraction(fraction) {
-        if (this._curve)
-            this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));
-    }
-    evaluate(fraction) {
-        let curve = this._curve;
-        if (this._parentCurvePrimitive)
-            curve = this._parentCurvePrimitive;
-        if (curve) {
-            this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);
-            this.currentF = this._workRay.dotProductToPoint(this._spacePoint);
-            return true;
-        }
-        return false;
-    }
-    announceRay(fraction, data) {
-        this.evaluateB(fraction, data);
-        if (this._numThisCurve++ > 0)
-            this.searchInterval();
-        this._functionA = this._functionB;
-        this._fractionA = this._fractionB;
-    }
-    announcePointTangent(point, fraction, tangent) {
-        this._workRay.set(point, tangent);
-        this.announceRay(fraction, this._workRay);
-    }
-}
 
 
 /***/ }),
@@ -219365,7 +219126,8 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
     /**
      * Convert a segment index and local fraction to a global fraction.
      * @param index index of segment being evaluated
-     * @param localFraction local fraction within that segment
+     * @param localFraction local fraction in [0,1] within the segment
+     * @return global fraction f in [0,1] such that the segment is parameterized by index/N <= f <= (index+1)/N.
      */
     segmentIndexAndLocalFractionToGlobalFraction(index, localFraction) {
         const numSegment = this._points.length - 1;
@@ -219373,6 +219135,25 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
             return 0.0;
         return (index + localFraction) / numSegment;
     }
+    /**
+     * Convert a global fraction to a segment index and local fraction.
+     * @param globalFraction a fraction f in [0,1] in the linestring parameterization, where the i_th segment (0 <= i < N) is parameterized by i/N <= f <= (i+1)/N.
+     */
+    globalFractionToSegmentIndexAndLocalFraction(globalFraction) {
+        const numSegment = this._points.length - 1;
+        if (numSegment < 1)
+            return { index: 0, fraction: 0.0 };
+        const scaledGlobalFraction = globalFraction * numSegment;
+        let segmentIndex;
+        if (globalFraction < 0)
+            segmentIndex = 0;
+        else if (globalFraction > 1)
+            segmentIndex = numSegment - 1;
+        else // globalFraction in [0,1]
+            segmentIndex = Math.floor(scaledGlobalFraction);
+        const localFraction = scaledGlobalFraction - segmentIndex;
+        return { index: segmentIndex, fraction: localFraction };
+    }
     /** Return a frenet frame, using nearby points to estimate a plane. */
     fractionToFrenetFrame(fraction, result) {
         const n = this._points.length;
@@ -219606,7 +219387,6 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
             if (numPoints > 1) {
                 let segmentFraction = 0;
                 let d = 0;
-                const df = 1.0 / lastIndex;
                 for (let i = 1; i < numPoints; i++) {
                     segmentFraction = spacePoint.fractionOfProjectionToLine(this._points.getPoint3dAtUncheckedPointIndex(i - 1), this._points.getPoint3dAtUncheckedPointIndex(i));
                     if (segmentFraction < 0) {
@@ -219620,7 +219400,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
                     this._points.getPoint3dAtUncheckedPointIndex(i - 1).interpolate(segmentFraction, this._points.getPoint3dAtUncheckedPointIndex(i), result.pointQ);
                     d = result.pointQ.distance(spacePoint);
                     if (d < result.a) {
-                        result.setFP((i - 1 + segmentFraction) * df, result.pointQ, undefined, d);
+                        result.setFP(this.segmentIndexAndLocalFractionToGlobalFraction(i - 1, segmentFraction), result.pointQ, undefined, d);
                     }
                 }
             }
@@ -219953,6 +219733,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
         }
         return status;
     }
+    /** @param fraction used to interpolate between points at index and index + 1 */
     addResolvedPoint(index, fraction, dest) {
         const n = this._points.length;
         if (n === 0)
@@ -219993,49 +219774,36 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.CurvePri
             if (fractionB > 1)
                 fractionB = 1;
         }
-        const numEdge = n - 1;
-        let indexA; // left index of first extended/partial segment of clone
-        let indexB; // left index of last extended/partial segment of clone
         let index0, index1; // range of original vertices to copy into clone
-        let localFractionA = fractionA;
-        let localFractionB = fractionB;
+        const localA = this.globalFractionToSegmentIndexAndLocalFraction(fractionA);
+        const localB = this.globalFractionToSegmentIndexAndLocalFraction(fractionB);
         if (fractionA < 0) {
-            indexA = 0;
             index0 = 1; // first original vertex is not in clone
         }
         else if (0 <= fractionA && fractionA <= 1) {
-            const gA = fractionA * numEdge;
-            indexA = Math.floor(gA);
-            localFractionA = gA - indexA;
-            index0 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallRelative(1 - localFractionA) ? indexA + 2 : indexA + 1;
+            index0 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallRelative(1 - localA.fraction) ? localA.index + 2 : localA.index + 1;
         }
         else { // 1 < fractionA
-            indexA = n - 2;
             index0 = n; // no original vertices in clone
         }
         if (fractionB < 0) {
-            indexB = 0;
             index1 = -1; // no original vertices in clone
         }
         else if (0 <= fractionB && fractionB <= 1) {
-            const gB = fractionB * numEdge;
-            indexB = Math.floor(gB);
-            localFractionB = gB - indexB;
-            index1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallRelative(localFractionB) ? indexB - 1 : indexB;
+            index1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallRelative(localB.fraction) ? localB.index - 1 : localB.index;
         }
         else { // 1 < fractionB
-            indexB = n - 2;
             index1 = n - 2; // last original vertex is not in clone
         }
         const result = LineString3d.create();
-        this.addResolvedPoint(indexA, localFractionA, result._points);
+        this.addResolvedPoint(localA.index, localA.fraction, result._points);
         for (let index = index0; index <= index1; index++) {
             if (this._points.isIndexValid(index)) {
                 this._points.getPoint3dAtUncheckedPointIndex(index, LineString3d._workPointA);
                 result._points.push(LineString3d._workPointA);
             }
         }
-        this.addResolvedPoint(indexB, localFractionB, result._points);
+        this.addResolvedPoint(localB.index, localB.fraction, result._points);
         return result;
     }
     /** Return (if possible) a specific segment of the linestring */
@@ -220146,7 +219914,7 @@ LineString3d._workPointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_
 LineString3d._workPointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
 LineString3d._workPointC = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
 LineString3d._workRay = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__.Ray3d.createXAxis();
-LineString3d._indexPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create(); // private point for indexAndFractionToPoint.
+LineString3d._indexPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create(); // private point for addResolvedPoint
 /** An AnnotatedLineString3d is a linestring with additional surface-related data attached to each point
  * * This is useful in facet construction.
  * @internal
@@ -224133,6 +223901,165 @@ class UnionRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCol
 }
 
 
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js":
+/*!**************************************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.js ***!
+  \**************************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "AppendPlaneIntersectionStrokeHandler": () => (/* binding */ AppendPlaneIntersectionStrokeHandler)
+/* harmony export */ });
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../numerics/BezierPolynomials */ "../../core/geometry/lib/esm/numerics/BezierPolynomials.js");
+/* harmony import */ var _numerics_Newton__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../numerics/Newton */ "../../core/geometry/lib/esm/numerics/Newton.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _NewtonRtoRStrokeHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./NewtonRtoRStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js");
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+
+
+
+
+
+
+/**
+ * Context for computing intersections of a CurvePrimitive with a plane.
+ * @internal
+ */
+class AppendPlaneIntersectionStrokeHandler extends _NewtonRtoRStrokeHandler__WEBPACK_IMPORTED_MODULE_0__.NewtonRtoRStrokeHandler {
+    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);
+        this._ray = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_1__.Ray3d.createZero();
+        this._newtonSolver = new _numerics_Newton__WEBPACK_IMPORTED_MODULE_2__.Newton1dUnboundedApproximateDerivative(this);
+    }
+    // Return the first defined curve among: this.parentCurvePrimitive, this.curve;
+    effectiveCurve() {
+        if (this._parentCurvePrimitive)
+            return this._parentCurvePrimitive;
+        return this._curve;
+    }
+    get getDerivativeB() {
+        return this._derivativeB; // <--- _derivativeB is not currently used anywhere. Provided getter to suppress lint error
+    }
+    startCurvePrimitive(curve) {
+        this._curve = curve;
+        this._fractionA = 0.0;
+        this._numThisCurve = 0;
+        this._functionA = 0.0;
+        // this.derivativeA = 0.0;
+    }
+    endCurvePrimitive() {
+    }
+    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__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fraction0, i * df, fraction1);
+            cp.fractionToPointAndDerivative(fraction, this._ray);
+            this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);
+        }
+    }
+    announceSegmentInterval(_cp, point0, point1, _numStrokes, fraction0, fraction1) {
+        const h0 = this._plane.altitude(point0);
+        const h1 = this._plane.altitude(point1);
+        if (h0 * h1 > 0.0)
+            return;
+        const fraction01 = _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_4__.Order2Bezier.solveCoffs(h0, h1);
+        // let numIntersection = 0;
+        if (fraction01 !== undefined) {
+            // numIntersection++;
+            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fraction0, fraction01, fraction1);
+            this._newtonSolver.setX(fraction);
+            if (this._newtonSolver.runIterations()) {
+                this.announceSolutionFraction(this._newtonSolver.getX());
+            }
+            // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));
+        }
+    }
+    announceSolutionFraction(fraction) {
+        const curve = this.effectiveCurve();
+        if (curve) {
+            this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);
+            this._intersections.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));
+        }
+    }
+    evaluate(fraction) {
+        const curve = this.effectiveCurve();
+        if (!curve)
+            return false;
+        this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));
+        return true;
+    }
+    /**
+     * * ASSUME both the "A" and "B"  evaluations (fraction, function, and derivative) are known.
+     * * If function value changed sign between, interpolate an approximate root and improve it with
+     *     the newton solver.
+     */
+    searchInterval() {
+        if (this._functionA * this._functionB > 0)
+            return;
+        if (this._functionA === 0)
+            this.announceSolutionFraction(this._fractionA);
+        if (this._functionB === 0)
+            this.announceSolutionFraction(this._fractionB);
+        if (this._functionA * this._functionB < 0) {
+            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_3__.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());
+            }
+        }
+    }
+    /** Evaluate and save _functionB, _derivativeB, and _fractionB. */
+    evaluateB(xyz, fraction, tangent) {
+        this._functionB = this._plane.altitude(xyz);
+        this._derivativeB = this._plane.velocity(tangent);
+        this._fractionB = fraction;
+    }
+    /**
+     * Announce point and tangent for evaluations.
+     * * The function evaluation is saved as the "B" function point.
+     * * The function point count is incremented
+     * * If function point count is greater than 1, the current interval is searched.
+     * * The just-evaluated point ("B") is saved as the "old" ("A") evaluation point.
+     * @param xyz
+     * @param fraction
+     * @param tangent
+     */
+    announcePointTangent(xyz, fraction, tangent) {
+        this.evaluateB(xyz, fraction, tangent);
+        if (this._numThisCurve++ > 0)
+            this.searchInterval();
+        this._functionA = this._functionB;
+        this._fractionA = this._fractionB;
+    }
+}
+
+
 /***/ }),
 
 /***/ "../../core/geometry/lib/esm/curve/internalContexts/CloneCurvesContext.js":
@@ -224264,6 +224191,169 @@ class CloneWithExpandedLineStrings extends _CloneCurvesContext__WEBPACK_IMPORTED
 }
 
 
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js":
+/*!***************************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/curve/internalContexts/ClosestPointStrokeHandler.js ***!
+  \***************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "ClosestPointStrokeHandler": () => (/* binding */ ClosestPointStrokeHandler)
+/* harmony export */ });
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _numerics_Newton__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../numerics/Newton */ "../../core/geometry/lib/esm/numerics/Newton.js");
+/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _NewtonRtoRStrokeHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./NewtonRtoRStrokeHandler */ "../../core/geometry/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js");
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+
+
+
+
+
+
+
+/**
+ * Context for searching for the closest point to a CurvePrimitive.
+ * @internal
+ */
+class ClosestPointStrokeHandler extends _NewtonRtoRStrokeHandler__WEBPACK_IMPORTED_MODULE_0__.NewtonRtoRStrokeHandler {
+    constructor(spacePoint, extend) {
+        super();
+        this._fractionA = 0;
+        this._functionA = 0;
+        this._functionB = 0;
+        this._fractionB = 0;
+        this._numThisCurve = 0;
+        this._spacePoint = spacePoint;
+        this._workPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
+        this._workRay = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_2__.Ray3d.createZero();
+        this._closestPoint = undefined;
+        this._extend = extend;
+        this.startCurvePrimitive(undefined);
+        this._newtonSolver = new _numerics_Newton__WEBPACK_IMPORTED_MODULE_3__.Newton1dUnboundedApproximateDerivative(this);
+    }
+    claimResult() {
+        if (this._closestPoint) {
+            this._newtonSolver.setX(this._closestPoint.fraction);
+            this._curve = this._closestPoint.curve;
+            if (this._newtonSolver.runIterations()) {
+                let fraction = this._newtonSolver.getX();
+                fraction = _CurveExtendMode__WEBPACK_IMPORTED_MODULE_4__.CurveExtendOptions.correctFraction(this._extend, fraction);
+                this.announceSolutionFraction(fraction);
+            }
+        }
+        return this._closestPoint;
+    }
+    needPrimaryGeometryForStrokes() {
+        return true;
+    }
+    startCurvePrimitive(curve) {
+        this._curve = curve;
+        this._fractionA = 0.0;
+        this._numThisCurve = 0;
+        this._functionA = 0.0;
+    }
+    endCurvePrimitive() {
+    }
+    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
+        this.startCurvePrimitive(cp);
+        this.announceSolutionFraction(0.0); // test start point as closest
+        this.announceSolutionFraction(1.0); // test end point as closest
+        if (numStrokes < 1)
+            numStrokes = 1;
+        const df = 1.0 / numStrokes;
+        for (let i = 0; i <= numStrokes; i++) {
+            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.interpolate(fraction0, i * df, fraction1);
+            cp.fractionToPointAndDerivative(fraction, this._workRay);
+            this.announceRay(fraction, this._workRay);
+        }
+    }
+    announceCandidate(cp, fraction, point) {
+        const distance = this._spacePoint.distance(point);
+        if (this._closestPoint && distance > this._closestPoint.a)
+            return;
+        this._closestPoint = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_6__.CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);
+        this._closestPoint.a = distance;
+        if (this._parentCurvePrimitive !== undefined)
+            this._closestPoint.curve = this._parentCurvePrimitive;
+    }
+    announceSegmentInterval(cp, point0, point1, _numStrokes, fraction0, fraction1) {
+        let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);
+        // only consider extending the segment if the immediate caller says we are at endpoints ...
+        if (!this._extend)
+            localFraction = _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.clampToStartEnd(localFraction, 0.0, 1.0);
+        else {
+            if (fraction0 !== 0.0)
+                localFraction = Math.max(localFraction, 0.0);
+            if (fraction1 !== 1.0)
+                localFraction = Math.min(localFraction, 1.0);
+        }
+        this._workPoint = point0.interpolate(localFraction, point1);
+        const globalFraction = _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.interpolate(fraction0, localFraction, fraction1);
+        this.announceCandidate(cp, globalFraction, this._workPoint);
+    }
+    searchInterval() {
+        if (this._functionA * this._functionB > 0)
+            return;
+        if (this._functionA === 0)
+            this.announceSolutionFraction(this._fractionA);
+        if (this._functionB === 0)
+            this.announceSolutionFraction(this._fractionB);
+        if (this._functionA * this._functionB < 0) {
+            const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_5__.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());
+            }
+        }
+    }
+    evaluateB(fractionB, dataB) {
+        this._functionB = dataB.dotProductToPoint(this._spacePoint);
+        this._fractionB = fractionB;
+    }
+    announceSolutionFraction(fraction) {
+        if (this._curve)
+            this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));
+    }
+    evaluate(fraction) {
+        let curve = this._curve;
+        if (this._parentCurvePrimitive)
+            curve = this._parentCurvePrimitive;
+        if (curve) {
+            this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);
+            this.currentF = this._workRay.dotProductToPoint(this._spacePoint);
+            return true;
+        }
+        return false;
+    }
+    announceRay(fraction, data) {
+        this.evaluateB(fraction, data);
+        if (this._numThisCurve++ > 0)
+            this.searchInterval();
+        this._functionA = this._functionB;
+        this._fractionA = this._fractionB;
+    }
+    announcePointTangent(point, fraction, tangent) {
+        this._workRay.set(point, tangent);
+        this.announceRay(fraction, this._workRay);
+    }
+}
+
+
 /***/ }),
 
 /***/ "../../core/geometry/lib/esm/curve/internalContexts/CountLinearPartsSearchContext.js":
@@ -224313,6 +224403,110 @@ class CountLinearPartsSearchContext extends _CurveProcessor__WEBPACK_IMPORTED_MO
 }
 
 
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/curve/internalContexts/CurveLengthContext.js":
+/*!********************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/curve/internalContexts/CurveLengthContext.js ***!
+  \********************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "CurveLengthContext": () => (/* binding */ CurveLengthContext)
+/* harmony export */ });
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _numerics_Quadrature__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../numerics/Quadrature */ "../../core/geometry/lib/esm/numerics/Quadrature.js");
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+
+
+
+/**
+ * Context for computing the length of a CurvePrimitive.
+ * @internal
+ */
+class CurveLengthContext {
+    constructor(fraction0 = 0.0, fraction1 = 1.0, numGaussPoints = 5) {
+        this.startCurvePrimitive(undefined);
+        this._summedLength = 0.0;
+        this._ray = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_0__.Ray3d.createZero();
+        if (fraction0 < fraction1) {
+            this._fraction0 = fraction0;
+            this._fraction1 = fraction1;
+        }
+        else {
+            this._fraction0 = fraction1;
+            this._fraction1 = fraction0;
+        }
+        this._gaussMapper = new _numerics_Quadrature__WEBPACK_IMPORTED_MODULE_1__.GaussMapper(numGaussPoints);
+    }
+    tangentMagnitude(fraction) {
+        this._ray = this._curve.fractionToPointAndDerivative(fraction, this._ray);
+        return this._ray.direction.magnitude();
+    }
+    /** Return the fraction0 installed at construction time. */
+    get getFraction0() {
+        return this._fraction0;
+    }
+    /** Return the fraction1 installed at construction time. */
+    get getFraction1() {
+        return this._fraction1;
+    }
+    getSum() {
+        return this._summedLength;
+    }
+    startCurvePrimitive(curve) {
+        this._curve = curve;
+    }
+    startParentCurvePrimitive(_curve) {
+    }
+    endParentCurvePrimitive(_curve) {
+    }
+    endCurvePrimitive() {
+    }
+    announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__.Range1d.createXX(fraction0, fraction1);
+        range.intersectRangeXXInPlace(this._fraction0, this._fraction1);
+        if (!range.isNull) {
+            this.startCurvePrimitive(cp);
+            if (numStrokes < 1)
+                numStrokes = 1;
+            const df = 1.0 / numStrokes;
+            for (let i = 1; i <= numStrokes; i++) {
+                const fractionA = range.fractionToPoint((i - 1) * df);
+                const fractionB = i === numStrokes ? range.high : range.fractionToPoint(i * df);
+                const numGauss = this._gaussMapper.mapXAndW(fractionA, fractionB);
+                for (let k = 0; k < numGauss; k++) {
+                    this._summedLength += this._gaussMapper.gaussW[k] * this.tangentMagnitude(this._gaussMapper.gaussX[k]);
+                }
+            }
+        }
+    }
+    announceSegmentInterval(_cp, point0, point1, _numStrokes, fraction0, fraction1) {
+        const segmentLength = point0.distance(point1);
+        if (this._fraction0 <= fraction0 && fraction1 <= this._fraction1)
+            this._summedLength += segmentLength;
+        else {
+            const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__.Range1d.createXX(fraction0, fraction1);
+            range.intersectRangeXXInPlace(this._fraction0, this._fraction1);
+            if (!range.isNull)
+                this._summedLength += segmentLength * range.length() / (fraction1 - fraction0);
+        }
+    }
+    announcePointTangent(_xyz, _fraction, _tangent) {
+        // uh oh -- need to retain point for next interval
+    }
+}
+
+
 /***/ }),
 
 /***/ "../../core/geometry/lib/esm/curve/internalContexts/CurveOffsetXYHandler.js":
@@ -224905,6 +225099,51 @@ class OffsetHelpers {
 }
 
 
+/***/ }),
+
+/***/ "../../core/geometry/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js":
+/*!*************************************************************************************!*\
+  !*** ../../core/geometry/lib/esm/curve/internalContexts/NewtonRtoRStrokeHandler.js ***!
+  \*************************************************************************************/
+/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => {
+
+"use strict";
+__webpack_require__.r(__webpack_exports__);
+/* harmony export */ __webpack_require__.d(__webpack_exports__, {
+/* harmony export */   "NewtonRtoRStrokeHandler": () => (/* binding */ NewtonRtoRStrokeHandler)
+/* harmony export */ });
+/* harmony import */ var _numerics_Newton__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../numerics/Newton */ "../../core/geometry/lib/esm/numerics/Newton.js");
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+
+/** Intermediate class for managing the parentCurve announcements from an IStrokeHandler.
+ * @internal
+ */
+class NewtonRtoRStrokeHandler extends _numerics_Newton__WEBPACK_IMPORTED_MODULE_0__.NewtonEvaluatorRtoR {
+    constructor() {
+        super();
+        this._parentCurvePrimitive = undefined;
+    }
+    /** retain the parentCurvePrimitive.
+     * * Calling this method tells the handler that the parent curve is to be used for detail searches.
+     * * Example: Transition spiral search is based on linestring first, then the exact spiral.
+     * * Example: CurveChainWithDistanceIndex does NOT do this announcement -- the constituents act independently.
+     */
+    startParentCurvePrimitive(curve) {
+        this._parentCurvePrimitive = curve;
+    }
+    /** Forget the parentCurvePrimitive */
+    endParentCurvePrimitive(_curve) {
+        this._parentCurvePrimitive = undefined;
+    }
+}
+
+
 /***/ }),
 
 /***/ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js":
@@ -226595,15 +226834,16 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ });
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../geometry3d/Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
+/* harmony import */ var _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../internalContexts/CurveLengthContext */ "../../core/geometry/lib/esm/curve/internalContexts/CurveLengthContext.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _StrokeOptions__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
+/* harmony import */ var _AustralianRailCorpXYEvaluator__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./AustralianRailCorpXYEvaluator */ "../../core/geometry/lib/esm/curve/spiral/AustralianRailCorpXYEvaluator.js");
 /* harmony import */ var _ClothoidSeries__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./ClothoidSeries */ "../../core/geometry/lib/esm/curve/spiral/ClothoidSeries.js");
 /* harmony import */ var _CzechSpiralEvaluator__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./CzechSpiralEvaluator */ "../../core/geometry/lib/esm/curve/spiral/CzechSpiralEvaluator.js");
 /* harmony import */ var _DirectHalfCosineSpiralEvaluator__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./DirectHalfCosineSpiralEvaluator */ "../../core/geometry/lib/esm/curve/spiral/DirectHalfCosineSpiralEvaluator.js");
-/* harmony import */ var _AustralianRailCorpXYEvaluator__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./AustralianRailCorpXYEvaluator */ "../../core/geometry/lib/esm/curve/spiral/AustralianRailCorpXYEvaluator.js");
-/* harmony import */ var _TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./TransitionSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/TransitionSpiral3d.js");
 /* harmony import */ var _MXCubicAlongArcSpiralEvaluator__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./MXCubicAlongArcSpiralEvaluator */ "../../core/geometry/lib/esm/curve/spiral/MXCubicAlongArcSpiralEvaluator.js");
 /* harmony import */ var _PolishCubicSpiralEvaluator__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./PolishCubicSpiralEvaluator */ "../../core/geometry/lib/esm/curve/spiral/PolishCubicSpiralEvaluator.js");
+/* harmony import */ var _TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./TransitionSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/TransitionSpiral3d.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -226622,6 +226862,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
 * DirectSpiral3d acts like a TransitionSpiral3d for serialization purposes, but implements spiral types that have "direct" xy calculations without the integrations required
 * for IntegratedSpiral3d.
@@ -226972,13 +227213,19 @@ class DirectSpiral3d extends _TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_0__.Tr
         const n = this.computeStrokeCountForOptions(options);
         const activeStrokes = this.activeStrokes;
         dest.startParentCurvePrimitive(this);
-        if (n <= activeStrokes.numPoints()) {
-            // this.activeStrokes.emitStrokableParts(dest, options);
-            dest.announceIntervalForUniformStepStrokes(this, 2 * activeStrokes.numPoints(), 0.0, 1.0);
-        }
-        else {
-            dest.announceIntervalForUniformStepStrokes(this, n, 0.0, 1.0);
-        }
+        // hack: specify the extended range so we can compute length of an extended spiral
+        let globalFraction0 = 0.0;
+        let globalFraction1 = 1.0;
+        if (dest instanceof _internalContexts_CurveLengthContext__WEBPACK_IMPORTED_MODULE_11__.CurveLengthContext) {
+            if (dest.getFraction0 < 0.0)
+                globalFraction0 = dest.getFraction0;
+            if (dest.getFraction1 > 1.0)
+                globalFraction1 = dest.getFraction1;
+        }
+        if (n <= activeStrokes.numPoints())
+            dest.announceIntervalForUniformStepStrokes(this, 2 * activeStrokes.numPoints(), globalFraction0, globalFraction1);
+        else
+            dest.announceIntervalForUniformStepStrokes(this, n, globalFraction0, globalFraction1);
         dest.endParentCurvePrimitive(this);
     }
     /**
@@ -228581,38 +228828,53 @@ class Angle {
      * Test if two radians values are equivalent, allowing shift by full circle (i.e. by a multiple of `2*PI`)
      * @param radiansA first radians value
      * @param radiansB second radians value
+     * @param radianTol radian tolerance with default value of Geometry.smallAngleRadians
      */
-    static isAlmostEqualRadiansAllowPeriodShift(radiansA, radiansB) {
-        // try to get simple conclusions with un-shifted radians ...
+    static isAlmostEqualRadiansAllowPeriodShift(radiansA, radiansB, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
         const delta = Math.abs(radiansA - radiansB);
-        if (delta <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians)
+        if (delta <= radianTol)
             return true;
         const period = Math.PI * 2.0;
-        if (Math.abs(delta - period) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians)
+        if (Math.abs(delta - period) <= radianTol)
             return true;
         const numPeriod = Math.round(delta / period);
         const delta1 = delta - numPeriod * period;
-        return Math.abs(delta1) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians;
+        return Math.abs(delta1) <= radianTol;
     }
     /**
-     * Test if this angle and other are equivalent, allowing shift by full circle (i.e. by a multiple of 360 degrees)
+     * Test if this angle and other are equivalent, allowing shift by full circle (i.e., multiples of `2 * PI`).
+     * @param other the other angle
+     * @param radianTol radian tolerance with default value of Geometry.smallAngleRadians
      */
-    isAlmostEqualAllowPeriodShift(other) {
-        return Angle.isAlmostEqualRadiansAllowPeriodShift(this._radians, other._radians);
+    isAlmostEqualAllowPeriodShift(other, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
+        return Angle.isAlmostEqualRadiansAllowPeriodShift(this._radians, other._radians, radianTol);
     }
     /**
-     * Test if two this angle and other are almost equal, NOT allowing shift by full circle multiples of 360 degrees.
+     * Test if two angle (in radians)  almost equal, NOT allowing shift by full circle (i.e., multiples of `2 * PI`).
+     * @param radiansA first radians value
+     * @param radiansB second radians value
+     * @param radianTol radian tolerance with default value of Geometry.smallAngleRadians
      */
-    isAlmostEqualNoPeriodShift(other) { return Math.abs(this._radians - other._radians) < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians; }
+    static isAlmostEqualRadiansNoPeriodShift(radiansA, radiansB, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
+        return Math.abs(radiansA - radiansB) < radianTol;
+    }
     /**
-     * Test if two angle (in radians)  almost equal, NOT allowing shift by full circle multiples of `2 * PI`.
-     * * (Same test as isAlmostEqualRadiansNoPeriodShift)
+     * Test if two this angle and other are almost equal, NOT allowing shift by full circle (i.e., multiples of `2 * PI`).
+     * @param other the other angle
+     * @param radianTol radian tolerance with default value of Geometry.smallAngleRadians
      */
-    isAlmostEqual(other) { return this.isAlmostEqualNoPeriodShift(other); }
+    isAlmostEqualNoPeriodShift(other, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
+        return Angle.isAlmostEqualRadiansNoPeriodShift(this._radians, other._radians, radianTol);
+    }
     /**
-     * Test if two angle (in radians)  almost equal, NOT allowing shift by full circle multiples of `2 * PI`.
+     * Test if two this angle and other are almost equal, NOT allowing shift by full circle (i.e., multiples of `2 * PI`).
+     * * This function is same as isAlmostEqualRadiansNoPeriodShift. Please use isAlmostEqualRadiansNoPeriodShift.
+     * @param other the other angle
+     * @param radianTol radian tolerance with default value of Geometry.smallAngleRadians
      */
-    static isAlmostEqualRadiansNoPeriodShift(radiansA, radiansB) { return Math.abs(radiansA - radiansB) < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians; }
+    isAlmostEqual(other, radianTol = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
+        return this.isAlmostEqualNoPeriodShift(other, radianTol);
+    }
     /**
      * Test if dot product values indicate non-zero length perpendicular vectors.
      * @param dotUU dot product of vectorU with itself
@@ -234974,7 +235236,7 @@ class Matrix3d {
      * Factor this as a product C * U where C has mutually perpendicular columns and
      * U is orthogonal.
      * @param matrixC (allocate by caller, computed here)
-     * @param factor  (allocate by caller, computed here)
+     * @param matrixU (allocate by caller, computed here)
      */
     factorPerpendicularColumns(matrixC, matrixU) {
         matrixC.setFrom(this);
@@ -234993,6 +235255,46 @@ class Matrix3d {
         }
         return false;
     }
+    /**
+     * Factor this matrix M as a product M = V * D * U where V and U are orthogonal, and D is diagonal (scale matrix).
+     * @param matrixV left orthogonal factor (allocate by caller, computed here)
+     * @param scale diagonal entries of D (allocate by caller, computed here)
+     * @param matrixU right orthogonal factor (allocate by caller, computed here)
+     */
+    factorOrthogonalScaleOrthogonal(matrixV, scale, matrixU) {
+        const matrixVD = Matrix3d.createZero();
+        if (!this.factorPerpendicularColumns(matrixVD, matrixU))
+            return false;
+        const column = [];
+        column.push(matrixVD.getColumn(0));
+        column.push(matrixVD.getColumn(1));
+        column.push(matrixVD.getColumn(2));
+        scale.set(column[0].magnitude(), column[1].magnitude(), column[2].magnitude());
+        const det = matrixVD.determinant();
+        if (det < 0)
+            scale.z = -scale.z;
+        const almostZero = 1.0e-15;
+        const scaleXIsZero = Math.abs(scale.x) < almostZero;
+        const scaleYIsZero = Math.abs(scale.y) < almostZero;
+        const scaleZIsZero = Math.abs(scale.z) < almostZero;
+        // ASSUME: any zero-magnitude column(s) of matrixVD are last
+        if (!scaleXIsZero && !scaleYIsZero && !scaleZIsZero) { // full rank
+            matrixV = matrixVD.scaleColumns(1 / scale.x, 1 / scale.y, 1 / scale.z, matrixV);
+        }
+        else if (!scaleXIsZero && !scaleYIsZero) { // rank 2
+            column[0].scaleInPlace(1 / scale.x);
+            column[1].scaleInPlace(1 / scale.y);
+            column[2] = column[0].unitCrossProduct(column[1], column[2]);
+            matrixV.setColumns(column[0], column[1], column[2]);
+        }
+        else if (!scaleXIsZero) { // rank 1
+            matrixV = Matrix3d.createRigidHeadsUp(column[0], _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.XYZ, matrixV); // preserve column0
+        }
+        else { // rank 0
+            matrixV.setIdentity();
+        }
+        return true;
+    }
     /** Apply a jacobi step to lambda which evolves towards diagonal. */
     applySymmetricJacobi(i, j, lambda) {
         const uDotU = lambda.at(i, i);
@@ -235883,7 +236185,7 @@ class Matrix3d {
         this.inverseState = InverseMatrixState.unknown;
     }
     /** create a Matrix3d whose columns are scaled copies of this Matrix3d.
-     * @param scaleX scale factor for columns x
+     * @param scaleX scale factor for column x
      * @param scaleY scale factor for column y
      * @param scaleZ scale factor for column z
      * @param result optional result.
@@ -235891,11 +236193,10 @@ class Matrix3d {
     scaleColumns(scaleX, scaleY, scaleZ, result) {
         return Matrix3d.createRowValues(this.coffs[0] * scaleX, this.coffs[1] * scaleY, this.coffs[2] * scaleZ, this.coffs[3] * scaleX, this.coffs[4] * scaleY, this.coffs[5] * scaleZ, this.coffs[6] * scaleX, this.coffs[7] * scaleY, this.coffs[8] * scaleZ, result);
     }
-    /** create a Matrix3d whose columns are scaled copies of this Matrix3d.
-     * @param scaleX scale factor for columns x
+    /** Scale the columns of this Matrix3d.
+     * @param scaleX scale factor for column x
      * @param scaleY scale factor for column y
      * @param scaleZ scale factor for column z
-     * @param result optional result.
      */
     scaleColumnsInPlace(scaleX, scaleY, scaleZ) {
         this.coffs[0] *= scaleX;
@@ -236071,7 +236372,9 @@ class Matrix3d {
     sumSkewSquares() {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1] - this.coffs[3], this.coffs[2] - this.coffs[6], this.coffs[5] - this.coffs[7]);
     }
-    /** Test if the matrix is a pure rotation. */
+    /** Test if the matrix is a pure rotation.
+     * @param allowMirror whether to widen the test to return true if the matrix is orthogonal (a pure rotation or a mirror)
+    */
     isRigid(allowMirror = false) {
         return this.testPerpendicularUnitRowsAndColumns() && (allowMirror || this.determinant() > 0);
     }
@@ -236141,18 +236444,29 @@ class Matrix3d {
         }
         return undefined;
     }
-    /** create a new orthogonal matrix (perpendicular columns, unit length, transpose is inverse).
-     * columns are taken from the source Matrix3d in order indicated by the axis order.
+    /** Adjust the matrix in place so that:
+     * * columns are perpendicular and have unit length
+     * * transpose equals inverse
+     * * mirroring is removed
+     * @param axisOrder how to reorder the matrix columns
+     * @return whether the instance is rigid on return
      */
-    static createRigidFromMatrix3d(source, axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.XYZ, result) {
-        result = source.clone(result);
-        const maxAbs = result.maxAbs();
+    makeRigid(axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.XYZ) {
+        const maxAbs = this.maxAbs();
         if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(maxAbs))
-            return undefined;
+            return false;
         const scale = 1.0 / maxAbs;
-        result.scaleColumnsInPlace(scale, scale, scale);
-        result.axisOrderCrossProductsInPlace(axisOrder);
-        if (result.normalizeColumnsInPlace())
+        this.scaleColumnsInPlace(scale, scale, scale);
+        this.axisOrderCrossProductsInPlace(axisOrder);
+        return this.normalizeColumnsInPlace();
+    }
+    /** Create a new orthogonal matrix (perpendicular columns, unit length, transpose is inverse).
+     * * Columns are taken from the source Matrix3d in order indicated by the axis order.
+     * * Mirroring in the matrix is removed.
+     */
+    static createRigidFromMatrix3d(source, axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.XYZ, result) {
+        result = source.clone(result);
+        if (result.makeRigid(axisOrder))
             return result;
         return undefined;
     }
@@ -237585,9 +237899,19 @@ class Vector2d extends XY {
     }
     /** vector cross product {this CROSS vectorB} */
     crossProduct(vectorB) { return this.x * vectorB.y - this.y * vectorB.x; }
-    /** return the (signed) angle from this to vectorB.   This is positive if the shortest turn is counterclockwise, negative if clockwise. */
+    /**
+     * return the (radians as a simple number, not strongly typed Angle) signed angle from this to vectorB.
+     * This is positive if the shortest turn is counterclockwise, negative if clockwise.
+     */
+    radiansTo(vectorB) {
+        return Math.atan2(this.crossProduct(vectorB), this.dotProduct(vectorB));
+    }
+    /**
+     * return the (strongly typed) signed angle from this to vectorB.
+     * This is positive if the shortest turn is counterclockwise, negative if clockwise.
+     */
     angleTo(vectorB) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createAtan2(this.crossProduct(vectorB), this.dotProduct(vectorB));
+        return _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(this.radiansTo(vectorB));
     }
     /*  smallerUnorientedAngleTo(vectorB: Vector2d): Angle { }
       signedAngleTo(vectorB: Vector2d, upVector: Vector2d): Angle { }
@@ -237597,16 +237921,21 @@ class Vector2d extends XY {
       isInCCWSector(vectorA: Vector2d, vectorB: Vector2d, upVector: Vector2d): boolean { }
       */
     /**
-     * Test if `this` and `other` area parallel, with angle tolerance `Geometry.smallAngleRadiansSquared`.
+     * Test if this vector is parallel to other.
+     * * The input tolerances in `options`, if given, are considered to be squared for efficiency's sake,
+     * so if you have a distance or angle tolerance t, you should pass in t * t.
      * @param other second vector for comparison.
-     * @param oppositeIsParallel if true, treat vectors 180 opposite as parallel.  If false, treat those as non-parallel.
+     * @param oppositeIsParallel whether to consider diametrically opposed vectors as parallel.
+     * @param options optional radian and distance tolerances.
      */
-    isParallelTo(other, oppositeIsParallel = false) {
+    isParallelTo(other, oppositeIsParallel = false, returnValueIfAnInputIsZeroLength = false, options) {
+        var _a, _b;
+        const radianSquaredTol = (_a = options === null || options === void 0 ? void 0 : options.radianSquaredTol) !== null && _a !== void 0 ? _a : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared;
+        const distanceSquaredTol = (_b = options === null || options === void 0 ? void 0 : options.distanceSquaredTol) !== null && _b !== void 0 ? _b : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared;
         const a2 = this.magnitudeSquared();
         const b2 = other.magnitudeSquared();
-        // we know both are 0 or positive -- no need for
-        if (a2 < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared || b2 < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared)
-            return false;
+        if (a2 < distanceSquaredTol || b2 < distanceSquaredTol)
+            return returnValueIfAnInputIsZeroLength;
         const dot = this.dotProduct(other);
         if (dot < 0.0 && !oppositeIsParallel)
             return false;
@@ -237614,14 +237943,26 @@ class Vector2d extends XY {
         /* a2,b2,cross2 are squared lengths of respective vectors */
         /* cross2 = sin^2(theta) * a2 * b2 */
         /* For small theta, sin^2(theta)~~theta^2 */
-        return cross * cross <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared * a2 * b2;
+        return cross * cross <= radianSquaredTol * a2 * b2;
     }
     /**
-     * Returns `true` if `this` vector is perpendicular to `other`.
-     * @param other second vector.
+     * Test if this vector is perpendicular to other.
+     * * The input tolerances in `options`, if given, are considered to be squared for efficiency's sake,
+     * so if you have a distance or angle tolerance t, you should pass in t * t.
+     * @param other second vector in comparison.
+     * @param returnValueIfAnInputIsZeroLength if either vector is near zero length, return this value.
+     * @param options optional radian and distance tolerances.
      */
-    isPerpendicularTo(other) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.isPerpendicularDotSet(this.magnitudeSquared(), other.magnitudeSquared(), this.dotProduct(other));
+    isPerpendicularTo(other, returnValueIfAnInputIsZeroLength = false, options) {
+        var _a, _b;
+        const radianSquaredTol = (_a = options === null || options === void 0 ? void 0 : options.radianSquaredTol) !== null && _a !== void 0 ? _a : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared;
+        const distanceSquaredTol = (_b = options === null || options === void 0 ? void 0 : options.distanceSquaredTol) !== null && _b !== void 0 ? _b : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared;
+        const aa = this.magnitudeSquared();
+        const bb = other.magnitudeSquared();
+        if (aa < distanceSquaredTol || bb < distanceSquaredTol)
+            return returnValueIfAnInputIsZeroLength;
+        const ab = this.dotProduct(other);
+        return ab * ab <= radianSquaredTol * aa * bb;
     }
 }
 
@@ -237912,24 +238253,42 @@ __webpack_require__.r(__webpack_exports__);
  * @public
  */
 class XYZ {
-    constructor(x = 0, y = 0, z = 0) { this.x = x; this.y = y; this.z = z; }
+    constructor(x = 0, y = 0, z = 0) {
+        this.x = x;
+        this.y = y;
+        this.z = z;
+    }
     /**
      * Set the x,y,z  parts.
      * @param x (optional) x part
      * @param y (optional) y part
      * @param z (optional) z part
      */
-    set(x = 0, y = 0, z = 0) { this.x = x; this.y = y; this.z = z; }
+    set(x = 0, y = 0, z = 0) {
+        this.x = x;
+        this.y = y;
+        this.z = z;
+    }
     /** Set the x,y,z parts to zero. */
-    setZero() { this.x = 0; this.y = 0; this.z = 0; }
+    setZero() {
+        this.x = 0;
+        this.y = 0;
+        this.z = 0;
+    }
     /** Type guard for XAndY.
      * @note this will return true for an XYAndZ. If you wish to distinguish between the two, call isXYAndZ first.
      */
-    static isXAndY(arg) { return arg.x !== undefined && arg.y !== undefined; }
+    static isXAndY(arg) {
+        return arg.x !== undefined && arg.y !== undefined;
+    }
     /** Type guard to determine whether an object has a member called "z" */
-    static hasZ(arg) { return arg.z !== undefined; }
+    static hasZ(arg) {
+        return arg.z !== undefined;
+    }
     /** Type guard for XYAndZ.  */
-    static isXYAndZ(arg) { return this.isXAndY(arg) && this.hasZ(arg); }
+    static isXYAndZ(arg) {
+        return this.isXAndY(arg) && this.hasZ(arg);
+    }
     /** Test if arg is any of:
      * * XAndY
      * * XYAndZ
@@ -238012,6 +238371,7 @@ class XYZ {
     /**
      * Set the x,y,z parts from a Vector3d
      * This is the same effect as `setFrom(other)` with no pretesting of variant input type
+     * * Set to zeros if `other` is undefined.
      */
     setFromVector3d(other) {
         if (other) {
@@ -238042,13 +238402,21 @@ class XYZ {
             && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this.y, other.y, tol);
     }
     /** Return a JSON object as array `[x,y,z]` */
-    toJSON() { return this.toArray(); }
+    toJSON() {
+        return this.toArray();
+    }
     /** Return as an array `[x,y,z]` */
-    toArray() { return [this.x, this.y, this.z]; }
+    toArray() {
+        return [this.x, this.y, this.z];
+    }
     /** Return a JSON object as key value pairs `{x: value, y: value, z: value}` */
-    toJSONXYZ() { return { x: this.x, y: this.y, z: this.z }; }
+    toJSONXYZ() {
+        return { x: this.x, y: this.y, z: this.z };
+    }
     /** Pack the x,y,z values in a Float64Array. */
-    toFloat64Array() { return Float64Array.of(this.x, this.y, this.z); }
+    toFloat64Array() {
+        return Float64Array.of(this.x, this.y, this.z);
+    }
     /**
      * Set the x,y,z properties from one of several json forms:
      *
@@ -238134,28 +238502,54 @@ class XYZ {
     }
     /** Return true if the x,y,z components are all nearly zero to tolerance Geometry.smallMetricDistance */
     get isAlmostZero() {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.x) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.y) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.z);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.x) &&
+            _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.y) &&
+            _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this.z);
     }
     /** Return true if the x,y,z components are all exactly zero */
-    get isZero() { return this.x === 0.0 && this.y === 0.0 && this.z === 0.0; }
+    get isZero() {
+        return this.x === 0.0 && this.y === 0.0 && this.z === 0.0;
+    }
     /** Return the largest absolute value of any component */
-    maxAbs() { return Math.max(Math.abs(this.x), Math.abs(this.y), Math.abs(this.z)); }
+    maxAbs() {
+        return Math.max(Math.abs(this.x), Math.abs(this.y), Math.abs(this.z));
+    }
     /** Return the sqrt of the sum of squared x,y,z parts */
-    magnitude() { return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z); }
+    magnitude() {
+        return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z);
+    }
     /** Return the sum of squared x,y,z parts */
-    magnitudeSquared() { return this.x * this.x + this.y * this.y + this.z * this.z; }
+    magnitudeSquared() {
+        return this.x * this.x + this.y * this.y + this.z * this.z;
+    }
     /** Return sqrt of the sum of squared x,y parts */
-    magnitudeXY() { return Math.sqrt(this.x * this.x + this.y * this.y); }
+    magnitudeXY() {
+        return Math.sqrt(this.x * this.x + this.y * this.y);
+    }
     /** Return the sum of squared x,y parts */
-    magnitudeSquaredXY() { return this.x * this.x + this.y * this.y; }
+    magnitudeSquaredXY() {
+        return this.x * this.x + this.y * this.y;
+    }
     /** exact equality test. */
-    isExactEqual(other) { return this.x === other.x && this.y === other.y && this.z === other.z; }
+    isExactEqual(other) {
+        return this.x === other.x && this.y === other.y && this.z === other.z;
+    }
     /** equality test with Geometry.smallMetricDistance tolerance */
-    isAlmostEqualMetric(other) { return this.maxDiff(other) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance; }
+    isAlmostEqualMetric(other) {
+        return this.maxDiff(other) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance;
+    }
     /** add x,y,z from other in place. */
-    addInPlace(other) { this.x += other.x; this.y += other.y; this.z += other.z; }
+    addInPlace(other) {
+        this.x += other.x;
+        this.y += other.y;
+        this.z += other.z;
+    }
     /** add x,y,z from other in place. */
-    subtractInPlace(other) { this.x -= other.x; this.y -= other.y; this.z -= other.z; }
+    subtractInPlace(other) {
+        this.x -= other.x;
+        this.y -= other.y;
+        this.z -= other.z;
+    }
     /** add (in place) the scaled x,y,z of other */
     addScaledInPlace(other, scale) {
         this.x += scale * other.x;
@@ -238163,11 +238557,21 @@ class XYZ {
         this.z += scale * other.z;
     }
     /** Multiply the x, y, z parts by scale. */
-    scaleInPlace(scale) { this.x *= scale; this.y *= scale; this.z *= scale; }
+    scaleInPlace(scale) {
+        this.x *= scale;
+        this.y *= scale;
+        this.z *= scale;
+    }
     /** add to x, y, z parts */
-    addXYZInPlace(dx = 0.0, dy = 0.0, dz = 0.0) { this.x += dx; this.y += dy; this.z += dz; }
+    addXYZInPlace(dx = 0.0, dy = 0.0, dz = 0.0) {
+        this.x += dx;
+        this.y += dy;
+        this.z += dz;
+    }
     /** Clone strongly typed as Point3d */
-    cloneAsPoint3d() { return Point3d.create(this.x, this.y, this.z); }
+    cloneAsPoint3d() {
+        return Point3d.create(this.x, this.y, this.z);
+    }
     /** Return a (full length) vector from this point to other */
     vectorTo(other, result) {
         return Vector3d.create(other.x - this.x, other.y - this.y, other.z - this.z, result);
@@ -238180,9 +238584,13 @@ class XYZ {
      * @param other target of created vector.
      * @param result optional result vector.
      */
-    unitVectorTo(target, result) { return this.vectorTo(target, result).normalize(result); }
+    unitVectorTo(target, result) {
+        return this.vectorTo(target, result).normalize(result);
+    }
     /** Freeze this XYZ */
-    freeze() { return Object.freeze(this); }
+    freeze() {
+        return Object.freeze(this);
+    }
     /** access x part of XYZProps (which may be .x or [0]) */
     static x(xyz, defaultValue = 0) {
         if (xyz === undefined)
@@ -238219,7 +238627,9 @@ class XYZ {
  */
 class Point3d extends XYZ {
     /** Constructor for Point3d */
-    constructor(x = 0, y = 0, z = 0) { super(x, y, z); }
+    constructor(x = 0, y = 0, z = 0) {
+        super(x, y, z);
+    }
     /**
      * Convert json to Point3d.  Accepted forms are:
      * * `[1,2,3]` --- array of numbers
@@ -238227,9 +238637,15 @@ class Point3d extends XYZ {
      * *  object with x,y, and (optional) z as numeric properties {x: xValue, y: yValue, z: zValue}
      * @param json json value.
      */
-    static fromJSON(json) { const val = new Point3d(); val.setFromJSON(json); return val; }
+    static fromJSON(json) {
+        const val = new Point3d();
+        val.setFromJSON(json);
+        return val;
+    }
     /** Return a new Point3d with the same coordinates */
-    clone(result) { return Point3d.create(this.x, this.y, this.z, result); }
+    clone(result) {
+        return Point3d.create(this.x, this.y, this.z, result);
+    }
     /** Create a new Point3d with given coordinates
      * @param x x part
      * @param y y part
@@ -238275,7 +238691,7 @@ class Point3d extends XYZ {
     /**
      * Copy and unweight xyzw.
      * @param xyzData flat array of x,y,z,w,x,y,z,w for multiple points
-     * @param pointIndex index of point to extract.   This index is multiplied by 4 to obtain starting index in the array.
+     * @param pointIndex index of point to extract. This index is multiplied by 4 to obtain starting index in the array.
      * @param result optional result point.
      */
     static createFromPackedXYZW(xyzData, pointIndex, result) {
@@ -238300,7 +238716,9 @@ class Point3d extends XYZ {
         return result;
     }
     /** Create a new point with 000 xyz */
-    static createZero(result) { return Point3d.create(0, 0, 0, result); }
+    static createZero(result) {
+        return Point3d.create(0, 0, 0, result);
+    }
     /** Return the cross product of the vectors from this to pointA and pointB
      *
      * *  the result is a vector
@@ -238318,7 +238736,7 @@ class Point3d extends XYZ {
     /** Return the triple product of the vectors from this to pointA, pointB, pointC
      *
      * * This is a scalar (number)
-     * *  This is 6 times the (signed) volume of the tetrahedron on the 4 points.
+     * * This is 6 times the (signed) volume of the tetrahedron on the 4 points.
      */
     tripleProductToPoints(pointA, pointB, pointC) {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.tripleProduct(pointA.x - this.x, pointA.y - this.y, pointA.z - this.z, pointB.x - this.x, pointB.y - this.y, pointB.z - this.z, pointC.x - this.x, pointC.y - this.y, pointC.z - this.z);
@@ -238415,9 +238833,7 @@ class Point3d extends XYZ {
             (targetA.y - this.y) * (targetB.y - this.y) +
             (targetA.z - this.z) * (targetB.z - this.z);
     }
-    /** Return the fractional projection of this onto a line between points.
-     *
-     */
+    /** Return the fractional projection of this onto a line between points. */
     fractionOfProjectionToLine(startPoint, endPoint, defaultFraction = 0) {
         const denominator = startPoint.distanceSquared(endPoint);
         if (denominator < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared)
@@ -238429,7 +238845,9 @@ class Point3d extends XYZ {
  * @public
  */
 class Vector3d extends XYZ {
-    constructor(x = 0, y = 0, z = 0) { super(x, y, z); }
+    constructor(x = 0, y = 0, z = 0) {
+        super(x, y, z);
+    }
     /**
      * Return an array of vectors constructed from groups of 3 entries in a Float64Array.
      * Any incomplete group at the tail of the array is ignored.
@@ -238444,7 +238862,9 @@ class Vector3d extends XYZ {
      * Copy xyz from this instance to a new (or optionally reused) Vector3d
      * @param result optional instance to reuse.
      */
-    clone(result) { return Vector3d.create(this.x, this.y, this.z, result); }
+    clone(result) {
+        return Vector3d.create(this.x, this.y, this.z, result);
+    }
     /**
      * return a Vector3d (new or reused from optional result)
      * @param x x component
@@ -238533,7 +238953,11 @@ class Vector3d extends XYZ {
      * *  object with x,y, and (optional) z as numeric properties {x: xValue, y: yValue, z: zValue}
      * @param json json value.
      */
-    static fromJSON(json) { const val = new Vector3d(); val.setFromJSON(json); return val; }
+    static fromJSON(json) {
+        const val = new Vector3d();
+        val.setFromJSON(json);
+        return val;
+    }
     /** Copy contents from another Point3d, Point2d, Vector2d, or Vector3d */
     static createFrom(data, result) {
         if (data instanceof Float64Array) {
@@ -238609,7 +239033,7 @@ class Vector3d extends XYZ {
         return undefined;
     }
     /**
-     * Set (replace) xzz components so they are a vector from point0 to point1
+     * Set (replace) xyz components so they are a vector from point0 to point1
      * @param point0 start point of computed vector
      * @param point1 end point of computed vector.
      */
@@ -238619,13 +239043,21 @@ class Vector3d extends XYZ {
         this.z = point1.z - point0.z;
     }
     /** Return a vector with 000 xyz parts. */
-    static createZero(result) { return Vector3d.create(0, 0, 0, result); }
+    static createZero(result) {
+        return Vector3d.create(0, 0, 0, result);
+    }
     /** Return a unit X vector optionally multiplied by a scale  */
-    static unitX(scale = 1) { return new Vector3d(scale, 0, 0); }
-    /** Return a unit Y vector  */
-    static unitY(scale = 1) { return new Vector3d(0, scale, 0); }
-    /** Return a unit Z vector  */
-    static unitZ(scale = 1) { return new Vector3d(0, 0, scale); }
+    static unitX(scale = 1) {
+        return new Vector3d(scale, 0, 0);
+    }
+    /** Return a unit Y vector optionally multiplied by a scale  */
+    static unitY(scale = 1) {
+        return new Vector3d(0, scale, 0);
+    }
+    /** Return a unit Z vector optionally multiplied by a scale  */
+    static unitZ(scale = 1) {
+        return new Vector3d(0, 0, scale);
+    }
     /** Divide by denominator, but return undefined if denominator is zero. */
     safeDivideOrNull(denominator, result) {
         if (denominator !== 0.0) {
@@ -238634,8 +239066,8 @@ class Vector3d extends XYZ {
         return undefined;
     }
     /**
-     * Return a pair object containing (a) property `v` which is a unit vector in the direction
-     * of the input and (b) property mag which is the magnitude (length) of the input (instance) prior to normalization.
+     * Return a pair object containing (a) property `v` which is a unit vector in the direction of the input
+     * and (b) property mag which is the magnitude (length) of the input (instance) prior to normalization.
      * If the instance (input) is a near zero length the `v` property of the output is undefined.
      * @param result optional result.
      */
@@ -238648,7 +239080,9 @@ class Vector3d extends XYZ {
      * Return a unit vector parallel with this.  Return undefined if this.magnitude is near zero.
      * @param result optional result.
      */
-    normalize(result) { return this.normalizeWithLength(result).v; }
+    normalize(result) {
+        return this.normalizeWithLength(result).v;
+    }
     /**
      * If this vector has nonzero length, divide by the length to change to a unit vector.
      * @returns true if normalization completed.
@@ -238683,7 +239117,7 @@ class Vector3d extends XYZ {
     /** Return a vector same length as this but rotate 90 degrees CCW */
     rotate90CCWXY(result) {
         result = result ? result : new Vector3d();
-        // save x,y to allow aliasing ..
+        // save x,y to allow aliasing ("this" can be passed to the function as "result")
         const xx = this.x;
         const yy = this.y;
         result.x = -yy;
@@ -238729,17 +239163,23 @@ class Vector3d extends XYZ {
         return result;
     }
     /**
-     * Return a (new or optionally preallocated) vector that is rotated 90 degrees in the plane of this vector and the target vector.
+     * Return a (new or optionally preallocated) vector that is rotated 90 degrees in
+     * the plane of this vector and the target vector.
      * @param target Second vector which defines the plane of rotation.
      * @param result optional preallocated vector for result.
-     * @returns rotated vector, or undefined if the cross product of this and the the target cannot be normalized (i.e. if the target and this are colinear)
+     * @returns rotated vector, or undefined if the cross product of this and
+     *          the the target cannot be normalized (i.e. if the target and this are colinear)
      */
     rotate90Towards(target, result) {
         const normal = this.crossProduct(target).normalize();
         return normal ? normal.crossProduct(this, result) : undefined;
     }
     /** Rotate this vector 90 degrees around an axis vector.
-     * @returns the (new or optionally reused result) rotated vector, or undefined if the axis vector cannot be normalized.
+     * * Note that simple cross is in the plane perpendicular to axis -- it loses the part
+     * of "this" that is along the axis. The unit and scale is supposed to fix that.
+     * This matches with Rodrigues' rotation formula because cos(theta) = 0 and sin(theta) = 1
+     * @returns the (new or optionally reused result) rotated vector, or undefined if the axis
+     * vector cannot be normalized.
      */
     rotate90Around(axis, result) {
         const unitNormal = axis.normalize();
@@ -238747,7 +239187,8 @@ class Vector3d extends XYZ {
     }
     /**
      * Return a vector computed at fractional position between this vector and vectorB
-     * @param fraction fractional position.  0 is at `this`.  1 is at `vectorB`.  True fractions are "between", negatives are "before this", beyond 1 is "beyond vectorB".
+     * @param fraction fractional position.  0 is at `this`.  1 is at `vectorB`.
+     *                 True fractions are "between", negatives are "before this", beyond 1 is "beyond vectorB".
      * @param vectorB second vector
      * @param result optional preallocated result.
      */
@@ -238818,7 +239259,8 @@ class Vector3d extends XYZ {
     static createAdd2Scaled(vectorA, scaleA, vectorB, scaleB, result) {
         return Vector3d.create(vectorA.x * scaleA + vectorB.x * scaleB, vectorA.y * scaleA + vectorB.y * scaleB, vectorA.z * scaleA + vectorB.z * scaleB, result);
     }
-    /** Return the (strongly typed Vector3d) `thisVector3d + vectorA * scalarA + vectorB * scalarB` with all components presented as numbers */
+    /** Return the (strongly typed Vector3d) `thisVector3d + vectorA * scalarA + vectorB * scalarB`
+     * with all components presented as numbers */
     static createAdd2ScaledXYZ(ax, ay, az, scaleA, bx, by, bz, scaleB, result) {
         return Vector3d.create(ax * scaleA + bx * scaleB, ay * scaleA + by * scaleB, az * scaleA + bz * scaleB, result);
     }
@@ -238853,7 +239295,8 @@ class Vector3d extends XYZ {
         return this.crossProduct(vectorB, result).normalize(result);
     }
     /**
-     * Compute the cross product of this vector with `vectorB`.   Normalize it, using given xyz as default if length is zero.
+     * Compute the cross product of this vector with `vectorB`.   Normalize it, using given xyz as
+     * default if length is zero.
      * @param vectorB second vector of cross product
      * @param x x value for default result
      * @param y y value for default result
@@ -238986,17 +239429,18 @@ class Vector3d extends XYZ {
         return this.x * (pointB.x - pointA.x)
             + this.y * (pointB.y - pointA.y);
     }
-    /** Dot product with vector from pointA to pointB, with pointB given as (weighted) x,y,z,w
-     * * pointB is a homogeneous point that has to be unweighted
+    /** Dot product with vector from pointA to pointB, with pointB given as (weighted) wx,wy,wz,w
+     * * We need to unweight pointB (which is a homogeneous point) to be able to participate in the
+     * vector dot product
      * * if the weight is near zero metric, the return is zero.
      */
-    dotProductStartEndXYZW(pointA, x, y, z, w) {
+    dotProductStartEndXYZW(pointA, wx, wy, wz, w) {
         if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(w))
             return 0.0;
         const dw = 1.0 / w;
-        return this.x * (dw * x - pointA.x)
-            + this.y * (dw * y - pointA.y)
-            + this.z * (dw * z - pointA.z);
+        return this.x * (dw * wx - pointA.x)
+            + this.y * (dw * wy - pointA.y)
+            + this.z * (dw * wz - pointA.z);
     }
     /** Return the dot product of the instance and vectorB, using only the x and y parts. */
     dotProductXY(vectorB) {
@@ -239038,46 +239482,93 @@ class Vector3d extends XYZ {
         return Vector3d.createCrossProduct(this.x, this.y, this.z, x, y, z, result);
     }
     /**
-     * Return the (Strongly typed) angle from this vector to vectorB.
+   * Return the (radians as a simple number, not strongly typed Angle) angle from this vector to vectorB.
+   * * The returned angle is always positive and no larger than 180 degrees (PI radians)
+   * * The returned angle is "in the plane containing the two vectors"
+   * * Use `planarRadiansTo` and `signedRadiansTo` to take have angle measured in specific plane.
+   * @param vectorB target vector of rotation.
+   */
+    radiansTo(vectorB) {
+        // ||axb|| = ||a|| ||b|| |sin(t)| and a.b = ||a|| ||b|| cos(t) ==>
+        // ||axb|| / a.b = sin(t)/cos(t) = tan(t) ==> t = arctan(||axb|| / a.b).
+        return Math.atan2(this.crossProductMagnitude(vectorB), this.dotProduct(vectorB));
+    }
+    /**
+     * Return the (strongly typed) angle from this vector to vectorB.
      * * The returned angle is always positive and no larger than 180 degrees (PI radians)
      * * The returned angle is "in the plane containing the two vectors"
-     * * Use `planarAngleTo`, `signedAngleTo`, `angleToXY` to take have angle measured in specific plane.
+     * * Use `planarAngleTo` and `signedAngleTo` to take have angle measured in specific plane.
      * @param vectorB target vector of rotation.
      */
     angleTo(vectorB) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createAtan2(this.crossProductMagnitude(vectorB), this.dotProduct(vectorB));
+        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.radiansTo(vectorB));
     }
     /**
-     * Return the (Strongly typed) angle from this vector to the plane perpendicular to planeNormal.
+     * Return the (strongly typed) angle from this vector to the plane perpendicular to planeNormal.
      * * The returned vector is signed
-     * * The returned vector is (as degrees) always less than or equal to 90 degrees.
-     * @param planeNormal a normal vector to the plane
+     * * The returned vector is (as degrees) always between -90 and 90 degrees.
+     * * The function returns "PI/2 - angleTo(planeNormal)"
+     * @param planeNormal a normal vector to the plane.
      */
-    angleFromPerpendicular(vectorB) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createAtan2(this.dotProduct(vectorB), this.crossProductMagnitude(vectorB));
+    angleFromPerpendicular(planeNormal) {
+        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createAtan2(this.dotProduct(planeNormal), this.crossProductMagnitude(planeNormal));
     }
     /**
-     * Return the (Strongly typed) angle from this vector to vectorB,using only the xy parts.
-     * * The returned angle can range from negative 180 degrees (negative PI radians) to positive 180 degrees (positive PI radians), not closed on the negative side.
-     * * Use `planarAngleTo`, `signedAngleTo`, `angleToXY` to take have angle measured in other planes.
+     * Return the (Strongly typed) angle from this vector to vectorB, using only the xy parts.
+     * * The returned angle can range from negative 180 degrees (negative PI radians) to positive 180
+     * * degrees (positive PI radians), not closed on the negative side.
+     * * Use `planarAngleTo` and `signedAngleTo` to take have angle measured in other planes.
      * @param vectorB target vector of rotation.
      */
     angleToXY(vectorB) {
         return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createAtan2(this.crossProductXY(vectorB), this.dotProductXY(vectorB));
     }
+    /**
+   * Return the (simple number of radians, not Strongly typed Angle) angle from this vector to vectorB, measured
+   * in the plane containing both, with vectorW indicating which side to view to control sign of the angle.
+   * * The returned angle can range from negative PI to positive PI (not closed on negative side)
+   * * The returned angle is "in the plane containing the two vectors"
+   * * The returned angle has the same sign as vectorW dot product (thisVector cross vectorB)
+   * * vectorW does not have to be perpendicular to the plane.
+   * @param vectorB target vector of rotation.
+   * @param vectorW distinguishes between the sides of the plane.
+   */
+    signedRadiansTo(vectorB, vectorW) {
+        const p = this.crossProduct(vectorB);
+        const theta = Math.atan2(p.magnitude(), this.dotProduct(vectorB));
+        if (vectorW.dotProduct(p) < 0.0)
+            return -theta;
+        else
+            return theta;
+    }
+    /**
+   * Return the (strongly typed Angle) angle from this vector to vectorB, measured in the plane containing both,
+   * with vectorW indicating which side to view to control sign of the angle.
+   * * The returned angle can range from negative 180 degrees (negative PI radians) to positive 180 degrees
+   * * (positive PI radians), not closed on the negative side.
+   * * The returned angle is "in the plane containing the two vectors"
+   * * `vectorW` distinguishes between the sides of the plane, but does not have to be perpendicular.
+   * * The returned angle has the same sign as vectorW dot product (thisVector cross vectorB)
+   * @param vectorB target vector of rotation.
+   * @param vectorW distinguishes between the sides of the plane.
+   */
+    signedAngleTo(vectorB, vectorW) {
+        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.signedRadiansTo(vectorB, vectorW));
+    }
     /**
      * Return the (radians as a simple number, not strongly typed Angle) radians from this vector to vectorB.
      * * The returned angle can be positive or negative, with magnitude no larger than PI radians
      * * Use signedRadiansTo` to take have angle measured in other planes.
      * @param vectorB target vector of rotation.
+     * @param planeNormal a normal vector to the plane.
      */
-    planarRadiansTo(vector, planeNormal) {
+    planarRadiansTo(vectorB, planeNormal) {
         const square = planeNormal.dotProduct(planeNormal);
         if (square === 0.0)
             return 0.0;
         const factor = 1.0 / square;
         const projection0 = this.plusScaled(planeNormal, -this.dotProduct(planeNormal) * factor);
-        const projection1 = vector.plusScaled(planeNormal, -vector.dotProduct(planeNormal) * factor);
+        const projection1 = vectorB.plusScaled(planeNormal, -vectorB.dotProduct(planeNormal) * factor);
         return projection0.signedRadiansTo(projection1, planeNormal);
     }
     /**
@@ -239085,86 +239576,67 @@ class Vector3d extends XYZ {
      * * The returned angle can range from negative PI to positive PI (not closed on negative side)
      * * Use signedRadiansTo` to take have angle measured in other planes.
      * @param vectorB target vector of rotation.
+     * @param planeNormal a normal vector to the plane.
      */
-    planarAngleTo(vector, planeNormal) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.planarRadiansTo(vector, planeNormal));
-    }
-    /**
-     * Return the (simple number of radians, not Strongly typed Angle) angle from this vector to vectorB, measured in the plane containing both, with vectorW indicating which side to view to control sign of the angle.
-     * * The returned angle can range from negative PI to positive PI (not closed on negative side)
-     * * The returned angle is "in the plane containing the two vectors"
-     * * `vectorW` distinguishes between the sides of the plane, but does not have to be perpendicular.
-     * * The returned angle has the same sign as vectorW dot product (thisVector cross vectorB)
-     * @param vectorB target vector of rotation.
-     */
-    signedRadiansTo(vector1, vectorW) {
-        const p = this.crossProduct(vector1);
-        const theta = Math.atan2(p.magnitude(), this.dotProduct(vector1));
-        if (vectorW.dotProduct(p) < 0.0)
-            return -theta;
-        else
-            return theta;
-    }
-    /**
-     * Return the (strongly typed Angle) angle from this vector to vectorB, measured in the plane containing both, with vectorW indicating which side to view to control sign of the angle.
-     * * The returned angle can range from negative 180 degrees (negative PI radians) to positive 180 degrees (positive PI radians), not closed on the negative side.
-     * * The returned angle is "in the plane containing the two vectors"
-     * * `vectorW` distinguishes between the sides of the plane, but does not have to be perpendicular.
-     * * The returned angle has the same sign as vectorW dot product (thisVector cross vectorB)
-     * @param vectorB target vector of rotation.
-     */
-    signedAngleTo(vector1, vectorW) { return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.signedRadiansTo(vector1, vectorW)); }
-    /** Return the smallest (strongly typed) angle from the (bidirectional) line containing `this` to the (bidirectional) line containing `vectorB` */
-    smallerUnorientedAngleTo(vectorB) {
-        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.smallerUnorientedRadiansTo(vectorB));
+    planarAngleTo(vectorB, planeNormal) {
+        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.planarRadiansTo(vectorB, planeNormal));
     }
-    /** Return the smallest angle (in radians) from the (bidirectional) line containing `this` to the (bidirectional) line containing `vectorB` */
+    /** Return the smallest angle (in radians) from the (bidirectional) line containing `this`
+   * to the (bidirectional) line containing `vectorB` */
     smallerUnorientedRadiansTo(vectorB) {
         const c = this.dotProduct(vectorB);
         const s = this.crossProductMagnitude(vectorB);
         return Math.atan2(Math.abs(s), Math.abs(c));
     }
-    /*
-      signedAngleTo(vectorB: Vector3d, upVector: Vector3d): Angle { }
-      // sectors
-      isInSmallerSector(vectorA: Vector3d, vectorB: Vector3d): boolean { }
-      isInCCWSector(vectorA: Vector3d, vectorB: Vector3d, upVector: Vector3d): boolean { }
-      */
+    /** Return the smallest (strongly typed) angle from the (bidirectional) line containing `this`
+     * to the (bidirectional) line containing `vectorB` */
+    smallerUnorientedAngleTo(vectorB) {
+        return _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(this.smallerUnorientedRadiansTo(vectorB));
+    }
     /**
      * Test if this vector is parallel to other.
+     * * The input tolerances in `options`, if given, are considered to be squared for efficiency's sake,
+     * so if you have a distance or angle tolerance t, you should pass in t * t.
      * @param other second vector in comparison
-     * @param oppositeIsParallel if the vectors are on the same line but in opposite directions, return this value.
+     * @param oppositeIsParallel whether to consider diametrically opposed vectors as parallel
      * @param returnValueIfAnInputIsZeroLength if either vector is near zero length, return this value.
+     * @param options optional radian and distance tolerances.
      */
-    isParallelTo(other, oppositeIsParallel = false, returnValueIfAnInputIsZeroLength = false) {
+    isParallelTo(other, oppositeIsParallel = false, returnValueIfAnInputIsZeroLength = false, options) {
+        var _a, _b;
+        const radianSquaredTol = (_a = options === null || options === void 0 ? void 0 : options.radianSquaredTol) !== null && _a !== void 0 ? _a : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared;
+        const distanceSquaredTol = (_b = options === null || options === void 0 ? void 0 : options.distanceSquaredTol) !== null && _b !== void 0 ? _b : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared;
         const a2 = this.magnitudeSquared();
         const b2 = other.magnitudeSquared();
-        // we know both are 0 or positive -- no need for
-        if (a2 < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared || b2 < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared)
+        if (a2 < distanceSquaredTol || b2 < distanceSquaredTol)
             return returnValueIfAnInputIsZeroLength;
         const dot = this.dotProduct(other);
         if (dot < 0.0 && !oppositeIsParallel)
-            return returnValueIfAnInputIsZeroLength;
+            return false;
         const cross2 = this.crossProductMagnitudeSquared(other);
         /* a2,b2,cross2 are squared lengths of respective vectors */
         /* cross2 = sin^2(theta) * a2 * b2 */
         /* For small theta, sin^2(theta)~~theta^2 */
-        return cross2 <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared * a2 * b2;
+        return cross2 <= radianSquaredTol * a2 * b2;
     }
     /**
      * Test if this vector is perpendicular to other.
+     * * The input tolerances in `options`, if given, are considered to be squared for efficiency's sake,
+     * so if you have a distance or angle tolerance t, you should pass in t * t.
      * @param other second vector in comparison
      * @param returnValueIfAnInputIsZeroLength if either vector is near zero length, return this value.
+     * @param options optional radian and distance tolerances.
      */
-    isPerpendicularTo(other, returnValueIfAnInputIsZeroLength = false) {
+    isPerpendicularTo(other, returnValueIfAnInputIsZeroLength = false, options) {
+        var _a, _b;
+        const radianSquaredTol = (_a = options === null || options === void 0 ? void 0 : options.radianSquaredTol) !== null && _a !== void 0 ? _a : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared;
+        const distanceSquaredTol = (_b = options === null || options === void 0 ? void 0 : options.distanceSquaredTol) !== null && _b !== void 0 ? _b : _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared;
         const aa = this.magnitudeSquared();
-        if (aa < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared)
-            return returnValueIfAnInputIsZeroLength;
         const bb = other.magnitudeSquared();
-        if (bb < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistanceSquared)
+        if (aa < distanceSquaredTol || bb < distanceSquaredTol)
             return returnValueIfAnInputIsZeroLength;
         const ab = this.dotProduct(other);
-        return ab * ab <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadiansSquared * aa * bb;
+        return ab * ab <= radianSquaredTol * aa * bb;
     }
 }
 
@@ -243025,7 +243497,6 @@ class Range1d extends RangeBase {
         return Range1d.createXXOrCorrectToNull(Math.max(this.low, other.low), Math.min(this.high, other.high), result);
     }
     /** Return the union of ranges. */
-    /** Return the intersection of ranges. */
     union(other, result) {
         // we trust null ranges have EXTREME values, so a null in either input leads to expected results.
         return Range1d.createXX(Math.min(this.low, other.low), Math.max(this.high, other.high), result);
@@ -270745,8 +271216,8 @@ var IModelJson;
             // optional specific X
             const radiusX = Reader.parseNumberProperty(json, "radiusX", radius);
             // missing Y and Z both pick up radiusX  (which may have already been defaulted from unqualified radius)
-            const radiusY = Reader.parseNumberProperty(json, "radiusX", radiusX);
-            const radiusZ = Reader.parseNumberProperty(json, "radiusX", radiusX);
+            const radiusY = Reader.parseNumberProperty(json, "radiusY", radiusX);
+            const radiusZ = Reader.parseNumberProperty(json, "radiusZ", radiusX);
             const latitudeStartEnd = Reader.parseAngleSweepProps(json, "latitudeStartEnd"); // this may be undefined!!
             const axes = Reader.parseOrientation(json, true);
             const capped = Reader.parseBooleanProperty(json, "capped", false);
@@ -270771,7 +271242,7 @@ var IModelJson;
         }
         /** Parse TorusPipe props to TorusPipe instance. */
         static parseTorusPipe(json) {
-            const axes = Reader.parseOrientation(json, true);
+            const axes = Reader.parseOrientation(json, true); // force frame to be pure rotation (no scale or mirror)!
             const center = Reader.parsePoint3dProperty(json, "center");
             const radiusA = Reader.parseNumberProperty(json, "majorRadius");
             const radiusB = Reader.parseNumberProperty(json, "minorRadius");
@@ -271103,6 +271574,7 @@ var IModelJson;
             const radiusB = data.getMinorRadius();
             const sweep = data.getSweepAngle();
             if (data.getIsReversed()) {
+                // the TorusPipe was created with negative sweep that was forced positive; restore original values
                 vectorY.scaleInPlace(-1.0);
                 sweep.setRadians(-sweep.radians);
             }
@@ -272866,16 +273338,16 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
         const factors = this._localToWorld.matrix.factorRigidWithSignedScale();
         if (!factors)
             return undefined;
-        if (factors && factors.scale > 0)
+        if (factors && factors.scale > 0) // why do we rule out mirror?
             return factors.scale;
         return undefined;
     }
     /**
-     * Return the larger of the primary xyz axis radii
+     * Return the largest of the primary xyz axis radii
      */
     maxAxisRadius() {
         const matrix = this._localToWorld.matrix;
-        return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.maxXYZ(matrix.columnXMagnitude(), matrix.columnYMagnitude(), matrix.columnYMagnitude());
+        return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.maxXYZ(matrix.columnXMagnitude(), matrix.columnYMagnitude(), matrix.columnZMagnitude());
     }
     /**
      * Return a (clone of) the sphere's local to world transformation.
@@ -273364,13 +273836,13 @@ __webpack_require__.r(__webpack_exports__);
  * A torus pipe is a partial torus (donut).  In a local coordinate system
  * * The z axis passes through the hole.
  * * The "major hoop" arc has
- *   * vectorTheta0 = (radiusA,0,0)
- *   * vectorTheta90 = (0, radiusA,0)
+ *   * vectorTheta0 = (radiusA, 0, 0)
+ *   * vectorTheta90 = (0, radiusA, 0)
  *   * The major arc point at angle theta is `C(theta) = vectorTheta0 * cos(theta) + vectorTheta90 * sin(theta)
  * * The minor hoop at theta various with phi "around the minor hoop"
- *    * (x,y,z) = C(theta) + (radiusB *cos(theta), radiusB * sin(theta)) * cos(phi) + (0,radiusB,0) * sin(phi)
+ *    * (x,y,z) = C(theta) + (radiusB * cos(theta), radiusB * sin(theta), 0) * cos(phi) + (0, 0, radiusB) * sin(phi)
  * * The stored form of the torus pipe is oriented for positive volume:
- *   * Both radii are positive, with r0 >= r1 > 0
+ *   * Both radii are positive, with radiusA >= radiusB > 0
  *   * The sweep is positive
  *   * The coordinate system has positive determinant.
  * * For uv parameterization,
@@ -273381,6 +273853,7 @@ __webpack_require__.r(__webpack_exports__);
  * @public
  */
 class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
+    // constructor captures the pointers!
     constructor(map, radiusA, radiusB, sweep, capped) {
         super(capped);
         /** String name for schema properties */
@@ -273407,11 +273880,12 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
     /** Clone this TorusPipe and transform the clone */
     cloneTransformed(transform) {
         const result = this.clone();
-        transform.multiplyTransformTransform(result._localToWorld, result._localToWorld);
+        if (!result.tryTransformInPlace(transform))
+            return undefined;
         return result;
     }
     /** Create a new `TorusPipe`
-     * @param frame local to world transformation
+     * @param frame local to world transformation. For best results, the matrix part should be a pure rotation.
      * @param majorRadius major hoop radius
      * @param minorRadius minor hoop radius
      * @param sweep sweep angle for major circle, with positive sweep from x axis towards y axis.
@@ -273429,12 +273903,12 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
             return undefined;
         if (sweep.isAlmostZero)
             return undefined;
-        const xScale = 1.0;
+        // remove mirror and negative sweep
         let yScale = 1.0;
         let zScale = 1.0;
+        let isReversed = false;
         if (frame.matrix.determinant() < 0.0)
             zScale *= -1.0;
-        let isReversed = false;
         const sweep1 = sweep.clone();
         if (sweep.radians < 0.0) {
             sweep1.setRadians(-sweep.radians);
@@ -273443,15 +273917,14 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
             isReversed = true;
         }
         const frame1 = frame.clone();
-        frame1.matrix.scaleColumns(xScale, yScale, zScale, frame1.matrix);
+        frame1.matrix.scaleColumnsInPlace(1, yScale, zScale);
         const result = new TorusPipe(frame1, majorRadius, minorRadius, sweep1, capped);
         result._isReversed = isReversed;
         return result;
     }
     /** Create a TorusPipe from the typical parameters of the Dgn file */
     static createDgnTorusPipe(center, vectorX, vectorY, majorRadius, minorRadius, sweep, capped) {
-        const vectorZ = vectorX.crossProduct(vectorY);
-        vectorZ.scaleToLength(vectorX.magnitude(), vectorZ);
+        const vectorZ = vectorX.unitCrossProductWithDefault(vectorY, 0, 0, 1);
         const frame = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createOriginAndMatrixColumns(center, vectorX, vectorY, vectorZ);
         return TorusPipe.createInFrame(frame, majorRadius, minorRadius, sweep, capped);
     }
@@ -273466,28 +273939,41 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
     }
     /** Return a coordinate frame (right handed, unit axes)
      * * origin at center of major circle
-     * * major circle in xy plane
-     * * z axis perpendicular
+     * * major circle in plane of first two columns
+     * * last column perpendicular to first two
      */
     getConstructiveFrame() {
         return this._localToWorld.cloneRigid();
     }
     /** Return the center of the torus pipe (inside the donut hole) */
     cloneCenter() { return this._localToWorld.getOrigin(); }
-    /** return the vector along the x axis (in the major hoops plane) */
-    cloneVectorX() { return this._localToWorld.matrix.columnX(); }
-    /** return the vector along the y axis (in the major hoop plane) */
-    cloneVectorY() { return this._localToWorld.matrix.columnY(); }
-    /** get the minor hoop radius (`radiusA`) */
-    getMinorRadius() { return this._radiusB; }
-    /** get the major hoop radius (`radiusB`) */
-    getMajorRadius() { return this._radiusA; }
+    /** return unit vector along the x axis (in the major hoop plane) */
+    cloneVectorX() {
+        const xAxis = this._localToWorld.matrix.columnX();
+        return xAxis.normalizeWithDefault(1, 0, 0, xAxis);
+    }
+    /** return unit vector along the y axis (in the major hoop plane) */
+    cloneVectorY() {
+        const yAxis = this._localToWorld.matrix.columnY();
+        return yAxis.normalizeWithDefault(0, 1, 0, yAxis);
+    }
+    /** return unit vector along the z axis */
+    cloneVectorZ() {
+        const zAxis = this._localToWorld.matrix.columnZ();
+        return zAxis.normalizeWithDefault(0, 0, 1, zAxis);
+    }
+    /** get the major hoop radius (`radiusA`) in world coordinates */
+    getMajorRadius() { return this._radiusA * this._localToWorld.matrix.columnXMagnitude(); }
+    /** get the minor hoop radius (`radiusB`) in world coordinates */
+    getMinorRadius() { return this._radiusB * this._localToWorld.matrix.columnZMagnitude(); }
     /** get the sweep angle along the major circle. */
     getSweepAngle() { return this._sweep.clone(); }
     /** Ask if this TorusPipe is labeled as reversed */
     getIsReversed() { return this._isReversed; }
     /** Return the sweep angle as a fraction of full 360 degrees (2PI radians) */
     getThetaFraction() { return this._sweep.radians / (Math.PI * 2.0); }
+    /** Return a (clone of) the TorusPipe's local to world transformation. */
+    cloneLocalToWorld() { return this._localToWorld.clone(); }
     /** ask if `other` is an instance of `TorusPipe` */
     isSameGeometryClass(other) { return other instanceof TorusPipe; }
     /** test if `this` and `other` have nearly equal geometry */
@@ -273495,11 +273981,24 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
         if (other instanceof TorusPipe) {
             if ((!this._sweep.isFullCircle) && this.capped !== other.capped)
                 return false;
-            if (!this._localToWorld.isAlmostEqual(other._localToWorld))
+            // Compare getter output so that we can equate TorusPipes created/transformed in equivalent ways.
+            // In particular, the column vectors contribute their scale to the radii, so we ignore their length.
+            if (!this.cloneCenter().isAlmostEqual(other.cloneCenter()))
                 return false;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this._radiusA, other._radiusA)
-                && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this._radiusB, other._radiusB)
-                && this._sweep.isAlmostEqualNoPeriodShift(other._sweep);
+            if (!this.cloneVectorX().isAlmostEqual(other.cloneVectorX()))
+                return false;
+            if (!this.cloneVectorY().isAlmostEqual(other.cloneVectorY()))
+                return false;
+            if (!this.cloneVectorZ().isAlmostEqual(other.cloneVectorZ()))
+                return false;
+            if (!_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getMinorRadius(), other.getMinorRadius()))
+                return false;
+            if (!_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getMajorRadius(), other.getMajorRadius()))
+                return false;
+            if (!this.getSweepAngle().isAlmostEqualNoPeriodShift(other.getSweepAngle()))
+                return false;
+            // ignore _isReversed; it doesn't affect geometry
+            return true;
         }
         return false;
     }
@@ -273518,19 +274017,19 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
         const thetaRadians = this.vFractionToRadians(v);
         const c0 = Math.cos(thetaRadians);
         const s0 = Math.sin(thetaRadians);
-        const majorRadius = this.getMajorRadius();
-        const minorRadius = this.getMinorRadius();
+        const majorRadius = this._radiusA;
+        const minorRadius = this._radiusB;
         const center = this._localToWorld.multiplyXYZ(majorRadius * c0, majorRadius * s0, 0);
         const vector0 = this._localToWorld.multiplyVectorXYZ(minorRadius * c0, minorRadius * s0, 0);
         const vector90 = this._localToWorld.multiplyVectorXYZ(0, 0, minorRadius);
         return _curve_Loop__WEBPACK_IMPORTED_MODULE_4__.Loop.create(_curve_Arc3d__WEBPACK_IMPORTED_MODULE_5__.Arc3d.create(center, vector0, vector90));
     }
-    /** Return an arc at constant u, and arc sweep  matching this TorusPipe sweep. */
+    /** Return an arc at constant u, and arc sweep matching this TorusPipe sweep. */
     constantUSection(uFraction) {
         const theta1Radians = this._sweep.radians;
-        const phiRadians = uFraction * Math.PI;
-        const majorRadius = this.getMajorRadius();
-        const minorRadius = this.getMinorRadius();
+        const phiRadians = uFraction * 2 * Math.PI;
+        const majorRadius = this._radiusA;
+        const minorRadius = this._radiusB;
         const transform = this._localToWorld;
         const axes = transform.matrix;
         const center = this._localToWorld.multiplyXYZ(0, 0, minorRadius * Math.sin(phiRadians));
@@ -273542,8 +274041,8 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
     /** extend `rangeToExtend` to include this `TorusPipe` */
     extendRange(rangeToExtend, transform) {
         const theta1Radians = this._sweep.radians;
-        const majorRadius = this.getMajorRadius();
-        const minorRadius = this.getMinorRadius();
+        const majorRadius = this._radiusA;
+        const minorRadius = this._radiusB;
         const transform0 = this._localToWorld;
         const numThetaSample = Math.ceil(theta1Radians / (Math.PI / 16.0));
         const numHalfPhiSample = 16;
@@ -273583,7 +274082,7 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
             else {
                 for (j = 0; j <= numPhiSample; j++) {
                     phi = phi0 + j * dPhi;
-                    rxy = majorRadius + minorRadius * Math.sin(phi);
+                    rxy = majorRadius + minorRadius * Math.cos(phi);
                     rangeToExtend.extendTransformedXYZ(transform0, cosTheta * rxy, sinTheta * rxy, Math.sin(phi) * minorRadius);
                 }
             }
@@ -273598,8 +274097,9 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
         const phiRadians = u * Math.PI * 2.0;
         const cosTheta = Math.cos(thetaRadians);
         const sinTheta = Math.sin(thetaRadians);
-        const minorRadius = this.getMinorRadius();
-        const rxy = this.getMajorRadius() + Math.cos(phiRadians) * minorRadius;
+        const majorRadius = this._radiusA;
+        const minorRadius = this._radiusB;
+        const rxy = majorRadius + Math.cos(phiRadians) * minorRadius;
         return this._localToWorld.multiplyXYZ(rxy * cosTheta, rxy * sinTheta, minorRadius * Math.sin(phiRadians), result);
     }
     /** Evaluate as a uv surface, returning point and two vectors.
@@ -273615,8 +274115,9 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
         const sinTheta = Math.sin(thetaRadians);
         const sinPhi = Math.sin(phiRadians);
         const cosPhi = Math.cos(phiRadians);
-        const minorRadius = this.getMinorRadius();
-        const rxy = this.getMajorRadius() + Math.cos(phiRadians) * minorRadius;
+        const majorRadius = this._radiusA;
+        const minorRadius = this._radiusB;
+        const rxy = majorRadius + Math.cos(phiRadians) * minorRadius;
         const rSinPhi = minorRadius * sinPhi;
         const rCosPhi = minorRadius * cosPhi; // appears only as derivative of rSinPhi.
         return _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_8__.Plane3dByOriginAndVectors.createOriginAndVectors(this._localToWorld.multiplyXYZ(cosTheta * rxy, sinTheta * rxy, rSinPhi), this._localToWorld.multiplyVectorXYZ(-cosTheta * rSinPhi * fPhi, -sinTheta * rSinPhi * fPhi, rCosPhi * fPhi), this._localToWorld.multiplyVectorXYZ(-rxy * sinTheta * fTheta, rxy * cosTheta * fTheta, 0), result);
@@ -274465,7 +274966,7 @@ class HalfEdge {
     }
     /**
      * Pinch this half edge out of its base vertex loop.
-     * * if this  the half edge (possibly undefined)
+     * @return the surviving HalfEdge in the vertex loop, or undefined if the instance HalfEdge is already dangling
      */
     yankFromVertexLoop() {
         const other = this.edgeMate.faceSuccessor;
@@ -278178,7 +278679,7 @@ __webpack_require__.r(__webpack_exports__);
  */
 class Triangulator {
     /** Given the six nodes that make up two bordering triangles, "pinch" and relocate the nodes to flip them
-     * * The shared edge mates are a and d.
+     * * The shared edge mates are c and e.
      * * (abc) are a triangle in CCW order
      * * (dfe) are a triangle in CCW order. (!! node dfe instead of def.)
      */
@@ -310089,7 +310590,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"3.5.0-dev.35","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs","build:ci":"npm run -s build && npm run -s build:esm","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^3.5.0-dev.35","@itwin/core-bentley":"workspace:^3.5.0-dev.35","@itwin/core-common":"workspace:^3.5.0-dev.35","@itwin/core-geometry":"workspace:^3.5.0-dev.35","@itwin/core-orbitgt":"workspace:^3.5.0-dev.35","@itwin/core-quantity":"workspace:^3.5.0-dev.35","@itwin/webgl-compatibility":"workspace:^3.5.0-dev.35"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/lodash":"^4.14.0","@types/mocha":"^8.2.2","@types/node":"16.11.59","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"~1.4.0","@itwin/cloud-agnostic-core":"~1.4.0","@itwin/object-storage-core":"~1.4.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","deep-assign":"^2.0.0","fuse.js":"^3.3.0","lodash":"^4.17.10","qs":"^6.5.1","semver":"^7.3.5","superagent":"7.1.3","wms-capabilities":"0.4.0","xml-js":"~1.6.11","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"3.5.0-dev.41","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs","build:ci":"npm run -s build && npm run -s build:esm","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^3.5.0-dev.41","@itwin/core-bentley":"workspace:^3.5.0-dev.41","@itwin/core-common":"workspace:^3.5.0-dev.41","@itwin/core-geometry":"workspace:^3.5.0-dev.41","@itwin/core-orbitgt":"workspace:^3.5.0-dev.41","@itwin/core-quantity":"workspace:^3.5.0-dev.41","@itwin/webgl-compatibility":"workspace:^3.5.0-dev.41"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/lodash":"^4.14.0","@types/mocha":"^8.2.2","@types/node":"16.11.59","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"~1.4.0","@itwin/cloud-agnostic-core":"~1.4.0","@itwin/object-storage-core":"~1.4.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","deep-assign":"^2.0.0","fuse.js":"^3.3.0","lodash":"^4.17.10","qs":"^6.5.1","semver":"^7.3.5","superagent":"7.1.3","wms-capabilities":"0.4.0","xml-js":"~1.6.11","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ })