@itwin/rpcinterface-full-stack-tests 5.0.0-dev.4 → 5.0.0-dev.5

package/lib/dist/bundled-tests.js

@@ -201726,6 +201726,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
 /* harmony import */ var _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/AngleSweep */ "../../core/geometry/lib/esm/geometry3d/AngleSweep.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_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndUnitNormal */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js");
 /* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
@@ -201735,13 +201736,13 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
 /* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
 /* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
-/* harmony import */ var _internalContexts_CurveOffsetXYHandler__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./internalContexts/CurveOffsetXYHandler */ "../../core/geometry/lib/esm/curve/internalContexts/CurveOffsetXYHandler.js");
-/* harmony import */ var _internalContexts_EllipticalArcApproximationContext__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./internalContexts/EllipticalArcApproximationContext */ "../../core/geometry/lib/esm/curve/internalContexts/EllipticalArcApproximationContext.js");
-/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
+/* harmony import */ var _internalContexts_CurveOffsetXYHandler__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./internalContexts/CurveOffsetXYHandler */ "../../core/geometry/lib/esm/curve/internalContexts/CurveOffsetXYHandler.js");
+/* harmony import */ var _internalContexts_EllipticalArcApproximationContext__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./internalContexts/EllipticalArcApproximationContext */ "../../core/geometry/lib/esm/curve/internalContexts/EllipticalArcApproximationContext.js");
+/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
-/* harmony import */ var _Path__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./Path */ "../../core/geometry/lib/esm/curve/Path.js");
+/* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
+/* harmony import */ var _Path__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ./Path */ "../../core/geometry/lib/esm/curve/Path.js");
 /* harmony import */ var _StrokeOptions__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -201767,6 +201768,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 /**
@@ -202505,7 +202507,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         const axy = this._matrix.columnXDotColumnY();
         return _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_8__.Angle.isPerpendicularDotSet(axx, ayy, axy) && _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.isSameCoordinateSquared(axx, ayy);
     }
-    /** Return radius if the vector0 and vector90 are of equal length and perpendicular. */
+    /** Return radius if the vector0 and vector90 are of equal length and perpendicular. Ignores z. */
     circularRadiusXY() {
         const ux = this._matrix.at(0, 0);
         const uy = this._matrix.at(1, 0);
@@ -202647,7 +202649,12 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     setVector0Vector90(vector0, vector90) {
         this._matrix.setColumns(vector0, vector90, vector0.unitCrossProductWithDefault(vector90, 0, 0, 0));
     }
-    /** Return the arc definition with rigid matrix form with axis radii. */
+    /**
+     * Return the symmetric definition of the arc, with rigid axes and radii.
+     * * The caller can send the returned data into [[createScaledXYColumns]] to construct the major-minor axis
+     * version of the instance arc. This formulation of the arc has the same shape, but has perpendicular axes,
+     * from which the arc's symmetry is readily apparent.
+     */
     toScaledMatrix3d() {
         const angleData = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_8__.Angle.dotProductsToHalfAngleTrigValues(this._matrix.columnXMagnitudeSquared(), this._matrix.columnYMagnitudeSquared(), this._matrix.columnXDotColumnY(), true);
         const vector0A = this._matrix.multiplyXY(angleData.c, angleData.s);
@@ -202787,9 +202794,9 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     }
     /**
      * Return an arc whose basis vectors are rotated by given angle within the current basis space.
-     * * the result arc will have its zero-degree point (new `vector0`) at the current.
-     * `vector0 * cos(theta) + vector90 * sin(theta)`.
-     * * the result sweep is adjusted so all fractional coordinates (e.g. start and end) evaluate to the same xyz.
+     * * The returned arc will have `vector0 = this.vector0 * cos(theta) + this.vector90 * sin(theta)`.
+     * * The returned arc has the same shape as the instance.
+     *   * In other words, the arc's sweep is adjusted so that all fractional parameters evaluate to the same points.
      *   * Specifically, theta is subtracted from the original start and end angles.
      * @param theta the angle (in the input arc space) which is to become the 0-degree point in the new arc.
      */
@@ -202802,6 +202809,39 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         const arcB = Arc3d.create(this._center.clone(), vector0, vector90, newSweep);
         return arcB;
     }
+    /**
+     * Return a cloned arc with basis rotated to align with the global axes. The arc's shape is unchanged.
+     * * This method is most useful when the instance is an xy-circular arc, for then the aligned arc's stored sweep
+     * angles can be understood as being measured from the global positive x-axis to the arc's start/end. This is *not*
+     * the case for xy-elliptical arcs: the parameter angle difference between two points on an ellipse is in general
+     * not the same as the angle measured between their radials.
+     * * For an xy instance, the output arc will have:
+     *   * vector0 is in the same direction as the positive x-axis
+     *   * perpendicularVector is in the same direction as the positive z-axis
+     * * For a general instance, the output arc will have:
+     *   * vector0 is in the same direction as the projection of the positive x-axis vector onto the arc plane
+     *   * perpendicularVector lies in the halfspace z >= 0
+     * @returns cloned arc, or undefined (if the instance normal is parallel to the x-axis, or its matrix is singular)
+     */
+    cloneAxisAligned() {
+        const plane = _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_17__.Plane3dByOriginAndUnitNormal.create(this.center, this.perpendicularVector.crossProduct(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Vector3d.unitX()));
+        if (!plane)
+            return undefined;
+        const axisPts = [];
+        if (2 !== this.appendPlaneIntersectionPoints(plane, axisPts))
+            return undefined;
+        const iAxisPt = plane.getNormalRef().dotProduct(this.perpendicularVector.crossProductStartEnd(this.center, axisPts[0].point)) > 0.0 ? 0 : 1;
+        const toUnitX = this.sweep.fractionToAngle(axisPts[iAxisPt].fraction);
+        const arc1 = this.cloneInRotatedBasis(toUnitX); // rotate in arc's plane
+        if (this.perpendicularVector.dotProduct(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_4__.Vector3d.unitZ()) < -_Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.smallAngleRadians) {
+            if (this.matrixRef.isSingular())
+                return undefined;
+            const flip = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createRowValues(1, 0, 0, 0, -1, 0, 0, 0, -1); // rotate 180 degrees around arc's local x-axis
+            arc1.matrixRef.multiplyMatrixMatrix(flip, arc1.matrixRef);
+            arc1.sweep.setStartEndDegrees(-arc1.sweep.startDegrees, -arc1.sweep.endDegrees); // rotation alone is insufficient to flip
+        }
+        return arc1;
+    }
     /**
      * Find intervals of this CurvePrimitive that are interior to a clipper.
      * @param clipper clip structure (e.g.clip planes).
@@ -202901,7 +202941,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
      * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object.
      */
     constructOffsetXY(offsetDistanceOrOptions) {
-        const options = _OffsetOptions__WEBPACK_IMPORTED_MODULE_17__.OffsetOptions.create(offsetDistanceOrOptions);
+        const options = _OffsetOptions__WEBPACK_IMPORTED_MODULE_18__.OffsetOptions.create(offsetDistanceOrOptions);
         if (this.isCircular || options.preserveEllipticalArcs) {
             const arcXY = this.cloneAtZ();
             const sign = arcXY.sweep.sweepRadians * arcXY.matrixRef.coffs[8] >= 0.0 ? 1.0 : -1.0;
@@ -202923,7 +202963,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
             }
         }
         // default impl
-        const handler = new _internalContexts_CurveOffsetXYHandler__WEBPACK_IMPORTED_MODULE_18__.CurveOffsetXYHandler(this, options.leftOffsetDistance);
+        const handler = new _internalContexts_CurveOffsetXYHandler__WEBPACK_IMPORTED_MODULE_19__.CurveOffsetXYHandler(this, options.leftOffsetDistance);
         this.emitStrokableParts(handler, options.strokeOptions);
         return handler.claimResult();
     }
@@ -202934,7 +202974,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
      * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
      */
     projectedParameterRange(ray, lowHigh) {
-        return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_19__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
+        return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_20__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
     }
     /**
      * Construct a circular arc chain approximation to the instance elliptical arc.
@@ -202944,10 +202984,10 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     constructCircularArcChainApproximation(options) {
         if (!options)
             options = EllipticalArcApproximationOptions.create();
-        const context = _internalContexts_EllipticalArcApproximationContext__WEBPACK_IMPORTED_MODULE_20__.EllipticalArcApproximationContext.create(this);
+        const context = _internalContexts_EllipticalArcApproximationContext__WEBPACK_IMPORTED_MODULE_21__.EllipticalArcApproximationContext.create(this);
         const result = context.constructCircularArcChainApproximation(options);
         if (!result && this.isCircular)
-            return (this.sweep.isFullCircle && options.forcePath) ? _Path__WEBPACK_IMPORTED_MODULE_21__.Path.create(this) : this;
+            return (this.sweep.isFullCircle && options.forcePath) ? _Path__WEBPACK_IMPORTED_MODULE_22__.Path.create(this) : this;
         return result;
     }
 }
@@ -204113,6 +204153,11 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
         }
         return detailA;
     }
+    /** Reverse the collection's data so that each child curve's fractional stroking moves in the opposite direction. */
+    reverseInPlace() {
+        for (const curve of this.children)
+            curve.reverseInPlace();
+    }
     /**
      * Return the max gap between adjacent primitives in Path and Loop collections.
      * * In a Path, gaps are computed between consecutive primitives.
@@ -204352,14 +204397,18 @@ class CurveChain extends CurveCollection {
             curve.extendRange(range, transform);
     }
     /**
-     * Reverse each child curve (in place)
-     * Reverse the order of the children in the CurveChain array.
+     * Reverse each child curve (in place).
+     * Reverse the order of the children array.
      */
     reverseChildrenInPlace() {
         for (const curve of this._curves)
             curve.reverseInPlace();
         this._curves.reverse();
     }
+    /** Same as [[reverseChildrenInPlace]]. */
+    reverseInPlace() {
+        this.reverseChildrenInPlace();
+    }
     /**
      * Return the index where target is found in the array of children.
      * @param alsoSearchProxies whether to also check proxy curves of the children
@@ -207624,34 +207673,34 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePri
     }
     /**
      * Return array of fraction parameters.
-     * * These Are only present during certain constructions such as faceting.
+     * * These are only present during certain constructions such as faceting.
      * * When present, these fractions are fractions of some other curve being stroked, and are NOT related to the
      * linestring fraction parameters.
      */
     get fractions() {
         return this._fractions;
     }
-    /** Return the (optional) array of derivatives. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of derivatives. These are only present during certain constructions such as faceting. */
     get packedDerivatives() {
         return this._derivatives;
     }
-    /** Return the (optional) array of uv params. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of uv parameters. These are only present during certain constructions such as faceting. */
     get packedUVParams() {
         return this._uvParams;
     }
-    /** Return the (optional) array of surface normals. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of surface normals. These are only present during certain constructions such as faceting. */
     get packedSurfaceNormals() {
         return this._surfaceNormals;
     }
-    /** Return the (optional) array of normal indices. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of normal indices. These are only present during certain constructions such as faceting. */
     get normalIndices() {
         return this._normalIndices;
     }
-    /** Return the (optional) array of param indices. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of uv parameter indices. These are only present during certain constructions such as faceting. */
     get paramIndices() {
         return this._uvIndices;
     }
-    /** Return the (optional) array of point indices. These Are only present during certain constructions such as faceting. */
+    /** Return the (optional) array of point indices. These are only present during certain constructions such as faceting. */
     get pointIndices() {
         return this._pointIndices;
     }
@@ -208233,11 +208282,32 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePri
     reverseInPlace() {
         if (this._points.length >= 2) {
             this._points.reverseInPlace();
+            if (this._fractions) {
+                this._fractions.reverseInPlace();
+                for (let i = 0; i < this._fractions.length; ++i)
+                    this._fractions.reassign(i, 1.0 - this._fractions.atUncheckedIndex(i));
+            }
             if (this._uvParams)
                 this._uvParams.reverseInPlace();
+            if (this._derivatives) {
+                this._derivatives.reverseInPlace();
+                this._derivatives.scaleInPlace(-1.0);
+            }
+            if (this._surfaceNormals)
+                this._surfaceNormals.reverseInPlace();
+            if (this._pointIndices)
+                this._pointIndices.reverseInPlace();
+            if (this._uvIndices)
+                this._uvIndices.reverseInPlace();
+            if (this._normalIndices)
+                this._normalIndices.reverseInPlace();
         }
     }
-    /** Apply `transform` to each point of this linestring. */
+    /**
+     * Apply `transform` to each point of this linestring.
+     * * Note that this method always returns true. If transforming the surface normals fails (due to singular matrix or zero
+     * normal), the original normal(s) are left unchanged.
+    */
     tryTransformInPlace(transform) {
         this._points.multiplyTransformInPlace(transform);
         if (this._derivatives)
@@ -209063,7 +209133,6 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
     isSameGeometryClass(other) {
         return other instanceof Loop;
     }
-    /** Test if `other` is an instance of `Loop` */
     constructor() {
         super();
         /** String name for schema properties */
@@ -209072,8 +209141,10 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         this.isInner = false;
     }
     /**
-     * Create a loop from variable length list of CurvePrimitives
-     * @param curves array of individual curve primitives
+     * Create a loop from a variable length list of [[CurvePrimitive]]s.
+     * * A significant gap between the end of one curve and the start of the next, or between chain start and end,
+     * is not bridged and may cause unexpected behavior.
+     * @param curves array of individual curve primitives, assumed to form a closed planar loop.
      */
     static create(...curves) {
         const result = new Loop();
@@ -209086,13 +209157,18 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         return result;
     }
     /**
-     * Create a loop from an array of curve primitives
-     * @param curves array of individual curve primitives
+     * Create a loop from an array of [[CurvePrimitive]]s.
+     * * A significant gap between the end of one curve and the start of the next, or between chain start and end,
+     * is not bridged and may cause unexpected behavior.
+     * @param curves array of individual curve primitives, assumed to form a closed planar loop.
      */
     static createArray(curves) {
         return this.create(...curves);
     }
-    /** Create a loop from an array of points */
+    /**
+     * Create a loop from an array of coplanar points.
+     * @param points vertices of polygon, closure point optional.
+    */
     static createPolygon(points) {
         const linestring = _LineString3d__WEBPACK_IMPORTED_MODULE_2__.LineString3d.create(points);
         linestring.addClosurePoint();
@@ -210257,14 +210333,16 @@ class CylindricalRangeQuery extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         return accumulator._perpVector.clone();
     }
     /**
-     * Recurse through geometry.children to find linestrings.
-     * In each linestring, compute the surface normal annotation from
+     * Recurse through `geometry.children` to find linestrings.
+     * For each linestring, compute and store the normal of the rotational surface resulting from sweeping the
+     * geometry around `axis` through a positive angle, using:
      *  * the curve tangent stored in the linestring
      *  * the axis of rotation
-     *  * a default V vector to be used when the linestring point is close to the axis.
-     * @param geometry
-     * @param axis
-     * @param defaultVectorV
+     *  * a default V vector to be used when the linestring point is close to the axis
+     * @param geometry profile curve (e.g., linestring, parity region). The orientation of the curve should be such that
+     * the computed normal lies in the same half-space as the rotational sweep direction.
+     * @param axis rotational axis
+     * @param defaultVectorFromAxis default vector perpendicular to `axis` (e.g., sweepVector)
      */
     static buildRotationalNormalsInLineStrings(geometry, axis, defaultVectorFromAxis) {
         if (geometry instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d) {
@@ -210273,18 +210351,20 @@ class CylindricalRangeQuery extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             const normals = geometry.ensureEmptySurfaceNormals();
             if (derivatives && normals) {
                 const vectorU = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
-                const vectorV = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(); // v direction (forwward along sweep) for surface of rotation.
+                const vectorV = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
                 const xyz = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
                 const n = points.length;
                 for (let i = 0; i < n; i++) {
                     points.getPoint3dAtUncheckedPointIndex(i, xyz);
                     axis.perpendicularPartOfVectorToTarget(xyz, vectorU);
+                    // compute the positive sweep direction. ASSUME: the rotational sweep angle is positive!
                     if (vectorU.isAlmostZero)
                         axis.direction.crossProduct(defaultVectorFromAxis, vectorV);
                     else
                         axis.direction.crossProduct(vectorU, vectorV);
-                    geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vector U as curve derivative
-                    vectorU.crossProduct(vectorV, vectorV); // reuse vector V as normal!
+                    // ASSUME: orientation-based profile normal is in the same half-space as vectorV
+                    geometry.packedDerivatives.getVector3dAtCheckedVectorIndex(i, vectorU); // reuse vectorU
+                    vectorU.crossProduct(vectorV, vectorV); // reuse vectorV
                     vectorV.normalizeInPlace();
                     normals.push(vectorV);
                 }
@@ -217298,16 +217378,19 @@ class ArcChainErrorProcessor extends QuadrantFractionsProcessor {
     }
 }
 /**
- * Processor for refining a single Q1 ordered interval [f0,f1] by perturbing an interior fraction f.
- * * This processor expects to repeatedly process a QuadrantFractions `q` with `q.quadrant` = 1 and fractions array
- * [fPrev, f0, f, f1], where fPrev is from the previously processed (possibly refined) adjacent interval; however, if
- * `q.interpolateStartTangent === true`, then no fPrev is necessary and [f0, f, f1] is expected.
- * * This is enough info to compute the two circular arcs spanning [f0,f] and [f,f1] and compare their approximation
- * errors.
- * * The basic idea is to perturb f so that the difference in the two arcs' errors is minimized.
- * * This processor keeps track of a bracket containing f so that when the caller repeatedly processes `q` via
- * [[EllipticalArcApproximationContext.processQuadrantFractions]], a bisection algorithm plays out, informed by the
- * heuristic that moving f toward one end of its bracket decreases the error of the approximating arc on that side of f.
+ * Processor for computing an optimal refinement of a single Q1 ordered interval [f0,f1] by perturbing an interior
+ * seed fraction f.
+ * * Typically the caller (cf. [[AdaptiveSubdivisionQ1ErrorProcessor.announceArc]] processes a
+ * QuadrantFractions `q` with `q.quadrant` = 1 until convergence. The `q.fractions` array is expected to have
+ * one of two forms:
+ *   * [fPrev, f0, f, f1], where fPrev is from the adjacent interval (possibly just refined), or
+ *   * [f0, f, f1], if `q.interpolateStartTangent === true`.
+ * * This processor implements a bisection algorithm that iteratively shrinks a sub-interval that brackets f,
+ * starting with [f0,f1]:
+ *   * During processing, `announceArc` will be called twice to compute the approximation errors of the circular
+ * arcs on either side of f in the current bracket.
+ *   * In `announceQuadrantEnd` if these two errors are almost equal, we are done refining [f0,f1]. Otherwise,
+ * we move f halfway to the endpoint of the bracket that decreases the error delta, and shrink our bracket.
  * @internal
  */
 class AdaptiveSubdivisionQ1IntervalErrorProcessor extends QuadrantFractionsProcessor {
@@ -217379,14 +217462,17 @@ class AdaptiveSubdivisionQ1IntervalErrorProcessor extends QuadrantFractionsProce
 /**
  * Processor for computing samples in Q1 for a subdivision-based arc chain approximation.
  * * The basic idea is to build a refinement of `q.fractions` for a QuadrantFractions q with q.quadrant = 1.
- *   * Start off the refinement with a copy of `q.fractions`.
- *   * When an announced arc exceeds a given maximum approximation error, compute a fraction f in the span
- * such that the error of arcs on either side of f would be almost equal, then add f to the refinement.
- *   * If the announced arc does not exceed the maxError, its associated fraction span remains unchanged---no
- * additional samples are needed to decrease approximation error.
- *   * After `q` processing completes, `q.fractions` is updated in place with the computed refinement.
- *   * The caller typically re-processes `q` until `isRefined` returns false, at which point construction of an
- * approximation that is guaranteed not to exceed the desired error can commence.
+ *   * In `announceQuadrantBegin` we start off the refinement with a copy of `q.fractions`.
+ *   * In `announceArc` we are called to process the interval [f0,f1] in `q.fractions`. First we test if the
+ * announced arc's approximation error over [f0,f1] exceeds maxError.
+ *     * If so, we employ [[AdaptiveSubdivisionQ1IntervalErrorProcessor]] to compute an interior fraction f
+ * that best refines the interval, which becomes [f0,f,f1].
+ *     * Otherwise, the fraction span [f0,f1] is unchanged---no additional samples are needed to decrease the
+ * approximation error.
+ *   * In `announceQuadrantEnd`, `q.fractions` is updated in place with the computed refinement.
+ *   * The caller (e.g., [[AdaptiveSubdivisionSampler.computeRadiansStrictlyInsideQuadrant1]]) typically
+ * re-processes `q` until `isRefined` returns false, at which point construction of an approximation that is
+ * guaranteed not to exceed the desired error can commence.
  * @internal
  */
 class AdaptiveSubdivisionQ1ErrorProcessor extends QuadrantFractionsProcessor {
@@ -223538,16 +223624,22 @@ class BarycentricTriangle {
     }
     /**
      * Compute the intersection of a line (parameterized as a ray) with the plane of this triangle.
-     * * This method is slower than `Ray3d.intersectionWithTriangle`.
+     * * Intersection data is returned for the line-plane intersection.
+     * * No intersection is returned if the line is parallel to the plane.
+     * * As for the *ray*, it intersects this triangle if and only if the returned detail `d` has
+     * `d.isValid === true` and `d.a >= 0` and `d.isInsideOrOn === true`.
+     * * This method is slower than `Ray3d.intersectionWithTriangle` but returns more information about the intersection.
      * @param ray infinite line to intersect, as a ray
      * @param result optional pre-allocated object to fill and return
-     * @returns details d of the line-plane intersection point `d.world`:
-     * * `d.a` is the intersection parameter along the ray.
-     * * The line intersects the plane of the triangle if and only if `d.isValid` returns true.
-     * * The ray intersects the plane of the triangle if and only if `d.isValid` returns true and `d.a` >= 0.
-     * * The ray intersects the triangle if and only if `d.isValid` returns true, `d.a` >= 0, and `d.isInsideOrOn`
-     * returns true.
-     * * `d.classify` can be used to determine where the intersection lies with respect to the triangle.
+     * @returns details `d` of the intersection point `p` of the line and the plane of this triangle:
+     * * `d.isValid`: false if and only if `ray.direction` is parallel to the plane, or the ray or triangle is degenerate.
+     * * `d.world`: coordinates of `p`.
+     * * `d.local`: barycentric coordinates of `p`.
+     * * `d.a`: the intersection parameter of `p` along the ray. Negative means `p` is behind the ray origin.
+     * * `d.classify`: where `p` lies with respect to the triangle.
+     * * `d.isInsideOrOn`: whether `p` is inside or on the triangle.
+     * * `d.closestEdgeIndex`: the index of the triangle edge `e` onto which `p` projects.
+     * * `d.closestEdgeParam`: the edge parameter at which `p` projects onto `e`.
      * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/RayTriangleIntersection
      * @see [[pointToFraction]]
     */
@@ -223564,6 +223656,9 @@ class BarycentricTriangle {
         const d = ray.direction;
         const u = BarycentricTriangle._workVector0 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(this.points[0], this.points[1], BarycentricTriangle._workVector0);
         const v = BarycentricTriangle._workVector1 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(this.points[0], this.points[2], BarycentricTriangle._workVector1);
+        const scaledVolume = d.tripleProduct(u, v);
+        if (scaledVolume * scaledVolume <= u.dotProduct(u) * v.dotProduct(v) * d.dotProduct(d) * _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallAngleRadiansSquared)
+            return result; // parallel (no solution)
         const M = BarycentricTriangle._workMatrix = _Matrix3d__WEBPACK_IMPORTED_MODULE_4__.Matrix3d.createColumns(u, v, d, BarycentricTriangle._workMatrix);
         const c = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(this.points[0], r0, BarycentricTriangle._workVector0); // reuse workVector0
         const solution = BarycentricTriangle._workVector1; // reuse workVector1
@@ -226605,6 +226700,10 @@ class GrowableFloat64Array {
         }
         this._inUse = numAccepted;
     }
+    /** reverse the order of values. */
+    reverseInPlace() {
+        this._data.reverse();
+    }
 }
 
 
@@ -228880,9 +228979,9 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ });
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry4d/Point4d */ "../../core/geometry/lib/esm/geometry4d/Point4d.js");
-/* harmony import */ var _Angle__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
+/* harmony import */ var _Angle__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
 /* harmony import */ var _Point2dVector2d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
-/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _Transform__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -229182,32 +229281,35 @@ class Matrix3d {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isDistanceWithinTol(max, tol);
     }
     /**
-     * Test if `this` and `other` have almost equal Z column and have X and Y columns differing only by a
-     * rotation of the same angle around that Z.
-     * * **WARNING:** X and Y columns have to be perpendicular to Z column in both `this` and `other`.
-     * @param tol optional tolerance for comparisons by Geometry.isDistanceWithinTol
+     * A matrix equivalence test, returning true if and only if the matrices are almost equal,
+     * or all of the following column comparisons hold:
+     * * z columns are almost equal, and
+     * * x columns differ only by a rotation of angle t around the z column, and
+     * * y columns differ only by a rotation of the same angle t around the z column.
+     * @param other matrix to compare
+     * @param tol optional distance tolerance, for comparisons by Geometry.isDistanceWithinTol
+     * @return whether matrices are almost equal modulo a rotation around their common nonzero z-column.
      */
     isAlmostEqualAllowZRotation(other, tol) {
         if (this.isAlmostEqual(other, tol))
             return true;
-        if (this.isAlmostEqualColumn(_Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisIndex.Z, other, tol)) {
-            const radians = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.radiansBetweenVectorsXYZ(this.coffs[0], this.coffs[3], this.coffs[6], other.coffs[0], other.coffs[3], other.coffs[6]);
-            const angle = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(radians); // angle between X columns in `this` and `other`
-            const columnX = this.columnX();
-            const columnY = this.columnY();
-            const columnZ = this.columnZ();
-            /**
-             * Here we rotate this.columnX() around this.columnZ() by "angle" and expect to get other.columnX().
-             * Then we rotate this.columnY() around this.columnZ() by the same "angle" and if we get other.columnY(),
-             * that means `this` and `other` have X and Y columns differing only by a rotation around column Z.
-             */
-            let column = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createRotateVectorAroundVector(columnX, columnZ, angle);
-            if (other.isAlmostEqualColumnXYZ(0, column.x, column.y, column.z, tol)) {
-                column = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createRotateVectorAroundVector(columnY, columnZ, angle);
-                return other.isAlmostEqualColumnXYZ(1, column.x, column.y, column.z, tol);
-            }
-        }
-        return false;
+        if (!this.isAlmostEqualColumn(_Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisIndex.Z, other, tol))
+            return false;
+        const columnX = this.columnX();
+        const columnY = this.columnY();
+        const columnZ = this.columnZ();
+        const toOtherColumnX = columnX.signedAngleTo(other.columnX(), columnZ);
+        let testColumn = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createRotateVectorAroundVector(columnX, columnZ, toOtherColumnX);
+        if (!testColumn)
+            return false; // columnZ is zero length
+        if (!other.isAlmostEqualColumnXYZ(0, testColumn.x, testColumn.y, testColumn.z, tol))
+            return false; // columnX rotated around columnZ by angle doesn't end up at other.columnX
+        testColumn = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createRotateVectorAroundVector(columnY, columnZ, toOtherColumnX);
+        if (!testColumn)
+            return false;
+        if (!other.isAlmostEqualColumnXYZ(1, testColumn.x, testColumn.y, testColumn.z, tol))
+            return false; // columnY rotated around columnZ by angle doesn't end up at other.columnY
+        return true;
     }
     /** Test for exact (bitwise) equality with other. */
     isExactEqual(other) {
@@ -229483,10 +229585,10 @@ class Matrix3d {
         const b = a / scale;
         // if vectorA is close to the Z axis
         if (Math.abs(vectorA.x) < b && Math.abs(vectorA.y) < b) {
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createCrossProduct(vectorA.x, vectorA.y, vectorA.z, 0, -1, 0, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createCrossProduct(vectorA.x, vectorA.y, vectorA.z, 0, -1, 0, result);
         }
         // if vectorA is NOT close to the Z axis
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createCrossProduct(0, 0, 1, vectorA.x, vectorA.y, vectorA.z, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createCrossProduct(0, 0, 1, vectorA.x, vectorA.y, vectorA.z, result);
     }
     /**
      * Return a vector that is perpendicular to the input `vectorA`.
@@ -229707,7 +229809,7 @@ class Matrix3d {
                 let c = Math.sqrt(0.5);
                 let s = leftNoneRight < 0.0 ? -c : c;
                 if (Math.abs(leftNoneRight) !== 1.0) {
-                    const radians = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.degreesToRadians(45.0 * leftNoneRight);
+                    const radians = _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.degreesToRadians(45.0 * leftNoneRight);
                     c = Math.cos(radians);
                     s = Math.sin(radians);
                 }
@@ -229801,7 +229903,7 @@ class Matrix3d {
         const sij = lambda.at(i, j);
         if (Math.abs(sij) < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFloatingPoint * (sii + sjj))
             return 0.0;
-        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
+        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
         const c = jacobi.c;
         const s = jacobi.s;
         /**
@@ -229881,7 +229983,7 @@ class Matrix3d {
         const sij = this.coffs[indexIJ];
         if (Math.abs(sij) < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFloatingPoint * (sii + sjj))
             return 0.0;
-        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
+        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.trigValuesToHalfAngleTrigValues(sii - sjj, 2.0 * sij);
         const c = jacobi.c;
         const s = jacobi.s;
         const cc = c * c;
@@ -229945,12 +230047,12 @@ class Matrix3d {
         const e = c * c + s * s - 1.0; // s^2 + c^2 = 1
         // if s^2 + c^2 != 1 then we have a bad matrix so return false
         if (Math.abs(e) > _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
-            return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(0), ok: false };
+            return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(0), ok: false };
         }
         // sin is close to 0 then we got to special cases (angle 0 or 180) which needs to be handled differently
         if (Math.abs(s) < _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians) {
             if (c > 0) // sin = 0 and cos = 1 so angle = 0 (i.e., no rotation)
-                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(0), ok: true };
+                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(0), ok: true };
             /**
              * If sin = 0 and cos = -1 then angle = 180 (i.e., 180 degree rotation around some axis)
              * then the rotation matrix becomes
@@ -229968,34 +230070,34 @@ class Matrix3d {
             const azz = this.coffs[8];
             // Look for a pair of "-1" entries on the diagonal (for rotation around the basis X,Y,Z axis)
             if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1.0, ayy) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1, azz)) {
-                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(1, 0, 0), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createDegrees(180), ok: true };
+                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(1, 0, 0), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(180), ok: true };
             }
             else if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1.0, axx) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1, azz)) {
-                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 1, 0), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createDegrees(180), ok: true };
+                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 1, 0), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(180), ok: true };
             }
             else if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1.0, axx) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(-1, ayy)) {
-                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createDegrees(180), ok: true };
+                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(180), ok: true };
             }
             // Look for eigenvector with eigenvalue = 1
             const eigenvectors = Matrix3d.createIdentity();
-            const eigenvalues = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 0);
+            const eigenvalues = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 0);
             if (this.fastSymmetricEigenvalues(eigenvectors, eigenvalues)) { // note: this matrix is "symmetric"
                 for (let axisIndex = 0; axisIndex < 2; axisIndex++) {
                     const lambda = eigenvalues.at(axisIndex);
                     if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(1, lambda))
-                        return { axis: eigenvectors.getColumn(axisIndex), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createDegrees(180), ok: true };
+                        return { axis: eigenvectors.getColumn(axisIndex), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(180), ok: true };
                 }
                 // if no eigenvalue = 1 was found return false
-                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(0), ok: false };
+                return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(0), ok: false };
             }
             // if no axis was found return false
-            return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(0), ok: false };
+            return { axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1), angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(0), ok: false };
         }
         // good matrix and non-zero sine
         const a = 1.0 / (2.0 * s);
         const result = {
-            axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(skewYZ * a, skewZX * a, skewXY * a),
-            angle: _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createAtan2(s, c),
+            axis: _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(skewYZ * a, skewZX * a, skewXY * a),
+            angle: _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createAtan2(s, c),
             ok: true,
         };
         return result;
@@ -230019,7 +230121,7 @@ class Matrix3d {
         const uDotV = this.coffs[i] * this.coffs[j]
             + this.coffs[i + 3] * this.coffs[j + 3]
             + this.coffs[i + 6] * this.coffs[j + 6];
-        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.trigValuesToHalfAngleTrigValues(uDotU - vDotV, 2.0 * uDotV);
+        const jacobi = _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.trigValuesToHalfAngleTrigValues(uDotU - vDotV, 2.0 * uDotV);
         const c = jacobi.c;
         const s = jacobi.s;
         if (Math.abs(s) < 2.0e-15)
@@ -230107,7 +230209,7 @@ class Matrix3d {
         let upVector = vectorA.unitCrossProduct(vectorB);
         // the usual case (both vectors and also their cross product is non-zero)
         if (upVector) {
-            return Matrix3d.createRotationAroundVector(upVector, _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(fraction * vectorA.planarAngleTo(vectorB, upVector).radians));
+            return Matrix3d.createRotationAroundVector(upVector, _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(fraction * vectorA.planarAngleTo(vectorB, upVector).radians));
         }
         // if either vector is zero
         if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(vectorA.magnitude())
@@ -230118,7 +230220,7 @@ class Matrix3d {
             return Matrix3d.createIdentity(result);
         // opposing vectors (cross product = 0, dot product < 0)
         upVector = Matrix3d.createPerpendicularVectorFavorPlaneContainingZ(vectorA, upVector);
-        return Matrix3d.createRotationAroundVector(upVector, _Angle__WEBPACK_IMPORTED_MODULE_1__.Angle.createRadians(fraction * Math.PI));
+        return Matrix3d.createRotationAroundVector(upVector, _Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(fraction * Math.PI));
     }
     /** Returns a matrix that rotates from vectorA to vectorB. */
     static createRotationVectorToVector(vectorA, vectorB, result) {
@@ -230145,15 +230247,15 @@ class Matrix3d {
     }
     /** Return (a copy of) the X column */
     columnX(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[0], this.coffs[3], this.coffs[6], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[0], this.coffs[3], this.coffs[6], result);
     }
     /** Return (a copy of) the Y column */
     columnY(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[1], this.coffs[4], this.coffs[7], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[1], this.coffs[4], this.coffs[7], result);
     }
     /** Return (a copy of) the Z column */
     columnZ(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[2], this.coffs[5], this.coffs[8], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[2], this.coffs[5], this.coffs[8], result);
     }
     /** Return the X column magnitude squared */
     columnXMagnitudeSquared() {
@@ -230225,15 +230327,15 @@ class Matrix3d {
     }
     /** Return (a copy of) the X row */
     rowX(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[0], this.coffs[1], this.coffs[2], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[0], this.coffs[1], this.coffs[2], result);
     }
     /** Return (a copy of) the Y row */
     rowY(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[3], this.coffs[4], this.coffs[5], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[3], this.coffs[4], this.coffs[5], result);
     }
     /** Return (a copy of) the Z row */
     rowZ(result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[6], this.coffs[7], this.coffs[8], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[6], this.coffs[7], this.coffs[8], result);
     }
     /** Return the dot product of the vector parameter with the X column. */
     dotColumnX(vector) {
@@ -230330,7 +230432,7 @@ class Matrix3d {
      */
     getColumn(columnIndex, result) {
         const index = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.cyclic3dAxis(columnIndex);
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[index], this.coffs[index + 3], this.coffs[index + 6], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[index], this.coffs[index + 3], this.coffs[index + 6], result);
     }
     /**
      * Return a (copy of) a row of the matrix.
@@ -230339,7 +230441,7 @@ class Matrix3d {
      */
     getRow(columnIndex, result) {
         const index = 3 * _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.cyclic3dAxis(columnIndex);
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[index], this.coffs[index + 1], this.coffs[index + 2], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[index], this.coffs[index + 1], this.coffs[index + 2], result);
     }
     /**
      * Create a matrix from row vectors.
@@ -230421,7 +230523,7 @@ class Matrix3d {
         const x = point.x;
         const y = point.y;
         const z = point.z;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this.coffs[0] * x + this.coffs[1] * y + this.coffs[2] * z, this.coffs[3] * x + this.coffs[4] * y + this.coffs[5] * z, this.coffs[6] * x + this.coffs[7] * y + this.coffs[8] * z, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(this.coffs[0] * x + this.coffs[1] * y + this.coffs[2] * z, this.coffs[3] * x + this.coffs[4] * y + this.coffs[5] * z, this.coffs[6] * x + this.coffs[7] * y + this.coffs[8] * z, result);
     }
     /**
      * Multiply `matrix * vector`, treating the vector is a column vector on the right.
@@ -230435,7 +230537,7 @@ class Matrix3d {
         const x = vectorU.x;
         const y = vectorU.y;
         const z = vectorU.z;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.coffs[0] * x + this.coffs[1] * y + this.coffs[2] * z, this.coffs[3] * x + this.coffs[4] * y + this.coffs[5] * z, this.coffs[6] * x + this.coffs[7] * y + this.coffs[8] * z, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.coffs[0] * x + this.coffs[1] * y + this.coffs[2] * z, this.coffs[3] * x + this.coffs[4] * y + this.coffs[5] * z, this.coffs[6] * x + this.coffs[7] * y + this.coffs[8] * z, result);
     }
     /**
      * Multiply `matrix * vector` in place for vector in the array, i.e. treating the vector is a column
@@ -230451,7 +230553,7 @@ class Matrix3d {
         const x = vector.x;
         const y = vector.y;
         const z = vector.z;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(origin.x - (matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z), origin.y - (matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z), origin.z - (matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z), result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(origin.x - (matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z), origin.y - (matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z), origin.z - (matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z), result);
     }
     /** Compute `origin + matrix * vector`  using only the xy parts of the inputs. */
     static xyPlusMatrixTimesXY(origin, matrix, vector, result) {
@@ -230464,7 +230566,7 @@ class Matrix3d {
         const x = vector.x;
         const y = vector.y;
         const z = vector.z;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(origin.x + matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z, origin.y + matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z, origin.z + matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(origin.x + matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z, origin.y + matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z, origin.z + matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z, result);
     }
     /** Updates vector to be `origin + matrix * vector` using all xyz parts of the inputs. */
     static xyzPlusMatrixTimesXYZInPlace(origin, matrix, vector) {
@@ -230477,7 +230579,7 @@ class Matrix3d {
     }
     /** Compute `origin + matrix * vector` where the final vector is given as direct x,y,z coordinates */
     static xyzPlusMatrixTimesCoordinates(origin, matrix, x, y, z, result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(origin.x + matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z, origin.y + matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z, origin.z + matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(origin.x + matrix.coffs[0] * x + matrix.coffs[1] * y + matrix.coffs[2] * z, origin.y + matrix.coffs[3] * x + matrix.coffs[4] * y + matrix.coffs[5] * z, origin.z + matrix.coffs[6] * x + matrix.coffs[7] * y + matrix.coffs[8] * z, result);
     }
     /**
      * Treat the 3x3 matrix and origin as upper 3x4 part of a 4x4 matrix, with 0001 as the final row.
@@ -230556,7 +230658,7 @@ class Matrix3d {
      * @param result the vector result (optional)
      */
     multiplyTransposeVector(vector, result) {
-        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
+        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d();
         const x = vector.x;
         const y = vector.y;
         const z = vector.z;
@@ -230570,7 +230672,7 @@ class Matrix3d {
      * @param result the vector result (optional)
      */
     multiplyXYZ(x, y, z, result) {
-        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
+        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d();
         result.x = this.coffs[0] * x + this.coffs[1] * y + this.coffs[2] * z;
         result.y = this.coffs[3] * x + this.coffs[4] * y + this.coffs[5] * z;
         result.z = this.coffs[6] * x + this.coffs[7] * y + this.coffs[8] * z;
@@ -230595,7 +230697,7 @@ class Matrix3d {
      * @param result the vector result (optional)
      */
     multiplyXY(x, y, result) {
-        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
+        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d();
         result.x = this.coffs[0] * x + this.coffs[1] * y;
         result.y = this.coffs[3] * x + this.coffs[4] * y;
         result.z = this.coffs[6] * x + this.coffs[7] * y;
@@ -230606,7 +230708,7 @@ class Matrix3d {
      * @param result the Point3d result (optional)
      */
     originPlusMatrixTimesXY(origin, x, y, result) {
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(origin.x + this.coffs[0] * x + this.coffs[1] * y, origin.y + this.coffs[3] * x + this.coffs[4] * y, origin.z + this.coffs[6] * x + this.coffs[7] * y, result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(origin.x + this.coffs[0] * x + this.coffs[1] * y, origin.y + this.coffs[3] * x + this.coffs[4] * y, origin.z + this.coffs[6] * x + this.coffs[7] * y, result);
     }
     /**
      * Multiply the matrix * (x,y,z) in place, i.e. the vector (x,y,z) is a column vector on the right and
@@ -230649,7 +230751,7 @@ class Matrix3d {
      * @param result the vector result (optional)
      */
     multiplyTransposeXYZ(x, y, z, result) {
-        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
+        result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d();
         result.x = this.coffs[0] * x + this.coffs[3] * y + this.coffs[6] * z;
         result.y = this.coffs[1] * x + this.coffs[4] * y + this.coffs[7] * z;
         result.z = this.coffs[2] * x + this.coffs[5] * y + this.coffs[8] * z;
@@ -230666,7 +230768,7 @@ class Matrix3d {
             const x = vector.x;
             const y = vector.y;
             const z = vector.z;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
         }
         return undefined;
     }
@@ -230681,7 +230783,7 @@ class Matrix3d {
             const x = vector.x;
             const y = vector.y;
             const z = vector.z;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[3] * y + this.inverseCoffs[6] * z, this.inverseCoffs[1] * x + this.inverseCoffs[4] * y + this.inverseCoffs[7] * z, this.inverseCoffs[2] * x + this.inverseCoffs[5] * y + this.inverseCoffs[8] * z, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[3] * y + this.inverseCoffs[6] * z, this.inverseCoffs[1] * x + this.inverseCoffs[4] * y + this.inverseCoffs[7] * z, this.inverseCoffs[2] * x + this.inverseCoffs[5] * y + this.inverseCoffs[8] * z, result);
         }
         return undefined;
     }
@@ -230694,7 +230796,7 @@ class Matrix3d {
     multiplyInverseXYZAsVector3d(x, y, z, result) {
         this.computeCachedInverse(true);
         if (this.inverseCoffs) {
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
         }
         return undefined;
     }
@@ -230719,7 +230821,7 @@ class Matrix3d {
     multiplyInverseXYZAsPoint3d(x, y, z, result) {
         this.computeCachedInverse(true);
         if (this.inverseCoffs) {
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(this.inverseCoffs[0] * x + this.inverseCoffs[1] * y + this.inverseCoffs[2] * z, this.inverseCoffs[3] * x + this.inverseCoffs[4] * y + this.inverseCoffs[5] * z, this.inverseCoffs[6] * x + this.inverseCoffs[7] * y + this.inverseCoffs[8] * z, result);
         }
         return undefined;
     }
@@ -237612,7 +237714,10 @@ class PolygonOps {
      * * Compare to [[closestPoint]].
      * @param polygon points of the polygon, closure point optional
      * @param testPoint point p to project onto the polygon edges. Works best when p is in the plane of the polygon.
-     * @param tolerance optional distance tolerance to determine point-vertex and point-edge coincidence.
+     * @param tolerance optional tolerance(s) to determine point-vertex and point-edge coincidence. A single number
+     * is interpreted as distance tolerance. If an array is given, the first number is interpreted as distance tolerance;
+     * the second, as parametric tolerance. Default values are [[Geometry.smallMetricDistance]] for distance tolerance
+     * and 0.0 for parameter tolerance.
      * @param result optional pre-allocated object to fill and return
      * @returns details d of the closest point `d.point`:
      * * `d.isValid()` returns true if and only if the polygon is nontrivial.
@@ -237624,7 +237729,9 @@ class PolygonOps {
     static closestPointOnBoundary(polygon, testPoint, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance, result) {
         if (!(polygon instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_5__.IndexedXYZCollection))
             return this.closestPointOnBoundary(new _Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_4__.Point3dArrayCarrier(polygon), testPoint, tolerance, result);
-        const distTol2 = tolerance * tolerance;
+        const distTol = Array.isArray(tolerance) ? tolerance[0] : tolerance;
+        const paramTol = Array.isArray(tolerance) ? Math.abs(tolerance[1]) : 0.0;
+        const distTol2 = distTol * distTol;
         let numPoints = polygon.length;
         while (numPoints > 1) {
             if (polygon.distanceSquaredIndexIndex(0, numPoints - 1) > distTol2)
@@ -237634,29 +237741,59 @@ class PolygonOps {
         result = PolygonLocationDetail.create(result);
         if (0 === numPoints)
             return result; // invalid
-        if (1 === numPoints) {
-            polygon.getPoint3dAtUncheckedPointIndex(0, result.point);
+        const constructSingletonPoint = (index) => {
+            polygon.getPoint3dAtUncheckedPointIndex(index, result.point);
             result.a = result.point.distance(testPoint);
             result.v.setZero();
             result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex;
-            result.closestEdgeIndex = 0;
+            result.closestEdgeIndex = index;
             result.closestEdgeParam = 0.0;
             return result;
-        }
+        };
+        if (1 === numPoints)
+            return constructSingletonPoint(0);
+        // lambda for computing edge parameter at which testPoint projects onto the edge starting at iEdgeStart
+        const projectToEdge = (iEdgeStart) => {
+            let isValid = false;
+            let edgeParam = 0.0;
+            let uDotU = 0.0;
+            let vDotV = 0.0;
+            if (iEdgeStart >= 0 && iEdgeStart < numPoints) {
+                let iEdgeEnd = iEdgeStart + 1;
+                if (iEdgeEnd === numPoints)
+                    iEdgeEnd = 0;
+                uDotU = polygon.distanceSquaredIndexIndex(iEdgeStart, iEdgeEnd);
+                if (uDotU > distTol2) { // nontrivial edge
+                    vDotV = polygon.distanceSquaredIndexXYAndZ(iEdgeStart, testPoint);
+                    const uDotV = polygon.dotProductIndexIndexXYAndZ(iEdgeStart, iEdgeEnd, testPoint);
+                    edgeParam = uDotV / uDotU; // param of projection of testPoint onto edge [iEdgeStart, iEdgeEnd]
+                    isValid = true;
+                }
+            }
+            return { isValid, edgeParam, uDotU, vDotV };
+        };
+        // find the previous nontrivial edge's projection status before processing the first edge
+        let projBeyondPrevEdge = false;
         let iPrev = numPoints - 1;
+        for (; iPrev > 0; --iPrev) {
+            const projData = projectToEdge(iPrev);
+            if (projData.isValid) {
+                projBeyondPrevEdge = projData.edgeParam > 1.0 + paramTol;
+                break;
+            }
+        }
+        if (iPrev <= 0) // all segments trivial, so treat like single point case
+            return constructSingletonPoint(0);
         let minDist2 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.largeCoordinateResult;
         for (let iBase = 0; iBase < numPoints; ++iBase) {
             let iNext = iBase + 1;
             if (iNext === numPoints)
                 iNext = 0;
-            const uDotU = polygon.distanceSquaredIndexIndex(iBase, iNext);
-            if (uDotU <= distTol2)
-                continue; // ignore trivial polygon edge (keep iPrev)
-            const vDotV = polygon.distanceSquaredIndexXYAndZ(iBase, testPoint);
-            const uDotV = polygon.dotProductIndexIndexXYAndZ(iBase, iNext, testPoint);
-            const edgeParam = uDotV / uDotU; // param of projection of testPoint onto this edge
-            if (edgeParam <= 0.0) { // testPoint projects to/before edge start
-                const distToStart2 = vDotV;
+            const projData = projectToEdge(iBase);
+            if (!projData.isValid)
+                continue; // ignore trivial polygon edge (keep iPrev, projBeyondPrevEdge)
+            if (projData.edgeParam <= paramTol) { // testPoint projects to/before edge start
+                const distToStart2 = projData.vDotV;
                 if (distToStart2 <= distTol2) {
                     // testPoint is at edge start; we are done
                     polygon.getPoint3dAtUncheckedPointIndex(iBase, result.point);
@@ -237667,25 +237804,25 @@ class PolygonOps {
                     result.closestEdgeParam = 0.0;
                     return result;
                 }
-                if (distToStart2 < minDist2) {
-                    if (polygon.dotProductIndexIndexXYAndZ(iBase, iPrev, testPoint) <= 0.0) {
-                        // update candidate (to edge start) only if testPoint projected beyond previous edge end
-                        polygon.getPoint3dAtUncheckedPointIndex(iBase, result.point);
-                        result.a = Math.sqrt(distToStart2);
-                        polygon.crossProductIndexIndexIndex(iBase, iPrev, iNext, result.v);
-                        result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex;
-                        result.closestEdgeIndex = iBase;
-                        result.closestEdgeParam = 0.0;
-                        minDist2 = distToStart2;
-                    }
+                if (distToStart2 < minDist2 && projBeyondPrevEdge) {
+                    // update candidate (to edge start) only if testPoint projected beyond previous edge end
+                    polygon.getPoint3dAtUncheckedPointIndex(iBase, result.point);
+                    result.a = Math.sqrt(distToStart2);
+                    polygon.crossProductIndexIndexIndex(iBase, iPrev, iNext, result.v);
+                    result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex;
+                    result.closestEdgeIndex = iBase;
+                    result.closestEdgeParam = 0.0;
+                    minDist2 = distToStart2;
                 }
+                projBeyondPrevEdge = false;
             }
-            else if (edgeParam <= 1.0) { // testPoint projects inside edge, or to edge end
-                const projDist2 = vDotV - edgeParam * edgeParam * uDotU;
+            else if (projData.edgeParam <= 1.0 + paramTol) { // testPoint projects inside edge, or to edge end
+                projData.edgeParam = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.clamp(projData.edgeParam, 0.0, 1.0);
+                const projDist2 = projData.vDotV - projData.edgeParam * projData.edgeParam * projData.uDotU;
                 if (projDist2 <= distTol2) {
                     // testPoint is on edge; we are done
-                    const distToStart2 = vDotV;
-                    if (edgeParam <= 0.5 && distToStart2 <= distTol2) {
+                    const distToStart2 = projData.vDotV;
+                    if (projData.edgeParam <= 0.5 && distToStart2 <= distTol2) {
                         // testPoint is at edge start
                         polygon.getPoint3dAtUncheckedPointIndex(iBase, result.point);
                         result.a = Math.sqrt(distToStart2);
@@ -237695,8 +237832,8 @@ class PolygonOps {
                         result.closestEdgeParam = 0.0;
                         return result;
                     }
-                    const distToEnd2 = projDist2 + (1.0 - edgeParam) * (1.0 - edgeParam) * uDotU;
-                    if (edgeParam > 0.5 && distToEnd2 <= distTol2) {
+                    const distToEnd2 = projDist2 + (1.0 - projData.edgeParam) * (1.0 - projData.edgeParam) * projData.uDotU;
+                    if (projData.edgeParam > 0.5 && distToEnd2 <= distTol2) {
                         // testPoint is at edge end
                         polygon.getPoint3dAtUncheckedPointIndex(iNext, result.point);
                         result.a = Math.sqrt(distToEnd2);
@@ -237707,27 +237844,29 @@ class PolygonOps {
                         return result;
                     }
                     // testPoint is on edge interior
-                    polygon.interpolateIndexIndex(iBase, edgeParam, iNext, result.point);
+                    polygon.interpolateIndexIndex(iBase, projData.edgeParam, iNext, result.point);
                     result.a = Math.sqrt(projDist2);
                     result.v.setZero();
                     result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior;
                     result.closestEdgeIndex = iBase;
-                    result.closestEdgeParam = edgeParam;
+                    result.closestEdgeParam = projData.edgeParam;
                     return result;
                 }
                 if (projDist2 < minDist2) {
-                    // update candidate (to edge interior)
-                    polygon.interpolateIndexIndex(iBase, edgeParam, iNext, result.point);
+                    // update candidate
+                    polygon.interpolateIndexIndex(iBase, projData.edgeParam, iNext, result.point);
                     result.a = Math.sqrt(projDist2);
                     polygon.crossProductIndexIndexXYAndZ(iBase, iNext, testPoint, result.v);
-                    result.code = _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior;
+                    result.code = projData.edgeParam < 1.0 ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex;
+                    ;
                     result.closestEdgeIndex = iBase;
-                    result.closestEdgeParam = edgeParam;
+                    result.closestEdgeParam = projData.edgeParam;
                     minDist2 = projDist2;
                 }
+                projBeyondPrevEdge = false;
             }
-            else { // edgeParam > 1.0
-                // NOOP: testPoint projects beyond edge end, handled by next edge
+            else {
+                projBeyondPrevEdge = true; // to be handled by next edge
             }
             iPrev = iBase;
         }
@@ -237771,7 +237910,10 @@ class PolygonOps {
     /** Compute the intersection of a line (parameterized as a ray) with the plane of this polygon.
      * @param polygon points of the polygon, closure point optional
      * @param ray infinite line to intersect, as a ray
-     * @param tolerance optional distance tolerance to determine point-vertex and point-edge coincidence.
+     * @param tolerance optional tolerance(s) to determine point-vertex and point-edge coincidence. A single number
+     * is interpreted as distance tolerance. If an array is given, the first number is interpreted as distance tolerance;
+     * the second, as parametric tolerance. Default values are [[Geometry.smallMetricDistance]] for distance tolerance
+     * and 0.0 for parameter tolerance.
      * @param result optional pre-allocated object to fill and return
      * @returns details d of the line-plane intersection `d.point`:
      * * `d.isValid()` returns true if and only if the line intersects the plane.
@@ -237798,11 +237940,18 @@ class PolygonOps {
                 // NOOP: intersectionPoint is on the polygon, so result.code already classifies it
             }
             else {
-                // intersectionPoint is not on polygon, so result.code refers to the closest point. Update it to refer to intersectionPoint.
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex === result.code)
-                    result.code = (dot > 0.0) ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToVertex : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OutsidePolygonProjectsToVertex;
-                else if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior === result.code)
-                    result.code = (dot > 0.0) ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToEdgeInterior : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OutsidePolygonProjectsToEdgeInterior;
+                // intersectionPoint is not on the polygon, so result.code refers to the closest point;
+                // update it to refer to intersectionPoint.
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonVertex === result.code) {
+                    result.code = (dot > 0.0)
+                        ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToVertex
+                        : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OutsidePolygonProjectsToVertex;
+                }
+                else if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OnPolygonEdgeInterior === result.code) {
+                    result.code = (dot > 0.0)
+                        ? _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.InsidePolygonProjectsToEdgeInterior
+                        : _Geometry__WEBPACK_IMPORTED_MODULE_2__.PolygonLocation.OutsidePolygonProjectsToEdgeInterior;
+                }
             }
         }
         return result;
@@ -249121,11 +249270,11 @@ class AnalyticRoots {
      *   * -1 -- beta, gamma are zero, alpha is not.There is no line defined.There are no solutions.
      *   * 0 -- the line is well defined, but passes completely outside the unit circle.
      *     * In this case, (c1, s1) is the circle point closest to the line and(c2, s2) is the line point closest to the circle.
-     * * 1 -- the line is tangent to the unit circle.
-     *   * Tangency is determined by tolerances, which calls a "close approach" point a tangency.
-     *    * (c1, s1) is the closest circle point
-     *    * (c2, s2) is the line point.
-     * * 2 -- two simple intersections.
+     *   * 1 -- the line is tangent to the unit circle.
+     *     * Tangency is determined by tolerances, which calls a "close approach" point a tangency.
+     *       * (c1, s1) is the closest circle point
+     *       * (c2, s2) is the line point.
+     *   * 2 -- two simple intersections.
      * @param alpha constant coefficient on line
      * @param beta x cosine coefficient on line
      * @param gamma y sine coefficient on line
@@ -249257,7 +249406,7 @@ class TrigPolynomial {
             degree--;
         const roots = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_6__.GrowableFloat64Array();
         if (degree === -1) {
-            // do nothing
+            // p(t) is identically zero (degenerate); do nothing.
         }
         else {
             if (degree === 0) {
@@ -251136,8 +251285,8 @@ var AuxChannelDataType;
      * When the host Polyface is transformed the displacements are rotated and scaled accordingly.
      */
     AuxChannelDataType[AuxChannelDataType["Vector"] = 2] = "Vector";
-    /** (X, Y, Z) normal vectors that replace the host [[Polyface]]'s own normals.
-     * When the Polyface is transformed the normals are rotated accordingly.
+    /** (X, Y, Z) unit normal vectors that replace the host [[Polyface]]'s own normals.
+     * When the Polyface is transformed the normals are rotated and renormalized accordingly.
      */
     AuxChannelDataType[AuxChannelDataType["Normal"] = 3] = "Normal";
 })(AuxChannelDataType || (AuxChannelDataType = {}));
@@ -251326,7 +251475,15 @@ class PolyfaceAuxData {
                         inverseRot = inverseRot ?? rot.inverse();
                         if (!inverseRot)
                             return false;
-                        transformPoints(data.values, (point) => inverseRot.multiplyTransposeVectorInPlace(point));
+                        transformPoints(data.values, (point) => {
+                            inverseRot.multiplyTransposeVectorInPlace(point);
+                            const dot = point.magnitudeSquared();
+                            const tol = 1.0e-15; // cf. GrowableXYZArray.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace
+                            if (dot > tol && Math.abs(dot - 1.0) > tol) { // only renormalize if magnitude is not near 0 or 1
+                                const mag = 1.0 / Math.sqrt(dot);
+                                point.scaleInPlace(mag);
+                            }
+                        });
                         break;
                     }
                     case AuxChannelDataType.Vector: {
@@ -253175,20 +253332,14 @@ class IndexedPolyface extends Polyface {
     }
     /**
      * Transform the mesh.
-     * * Apply the transform to points.
-     * * Apply the (inverse transpose of the) matrix part to normals.
-     * * If determinant of the transform matrix is negative, also
-     *   * negate normals
-     *   * reverse index order around each facet.
+     * * If `transform` is a mirror, also reverse the index order around each facet.
+     * * Note that this method always returns true. If transforming the normals fails (due to singular matrix or zero
+     * normal), the original normal(s) are left unchanged.
      */
     tryTransformInPlace(transform) {
-        if (!this.data.tryTransformInPlace(transform))
-            return false;
-        const determinant = transform.matrix.determinant();
-        if (determinant < 0) {
+        this.data.tryTransformInPlace(transform);
+        if (transform.matrix.determinant() < 0)
             this.reverseIndices();
-            this.reverseNormals();
-        }
         return true;
     }
     /** Reverse indices for a single facet. */
@@ -253197,8 +253348,7 @@ class IndexedPolyface extends Polyface {
     }
     /** Return a deep clone. */
     clone() {
-        const result = new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());
-        return result;
+        return new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());
     }
     /**
      * Return a deep clone with transformed points and normals.
@@ -254779,17 +254929,28 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     }
     /** Construct facets for a rotational sweep. */
     addRotationalSweep(surface) {
-        const contour = surface.getCurves();
-        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour, this._options);
+        const contour = surface.getSweepContourRef();
+        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour.getCurves(), this._options);
         const baseStrokes = section0.getStrokes();
+        // ensure sweep is positive for buildRotationalNormalsInLineStrings
         const axis = surface.cloneAxisRay();
+        const sweepAngle = surface.getSweep();
+        if (sweepAngle.radians < 0.0) {
+            axis.direction.scaleInPlace(-1);
+            sweepAngle.setRadians(-sweepAngle.radians);
+        }
+        // swingVector points in the direction of positive sweep
         const perpendicularVector = _curve_Query_CylindricalRange__WEBPACK_IMPORTED_MODULE_17__.CylindricalRangeQuery.computeMaxVectorFromRay(axis, baseStrokes);
         const swingVector = axis.direction.crossProduct(perpendicularVector);
+        // ensure contour computed normal is aligned with swingVector for buildRotationalNormalsInLineStrings
+        const contourNormalAgreesWithSwingDir = contour.localToWorld.matrix.dotColumnZ(swingVector) > 0;
+        if (!contourNormalAgreesWithSwingDir)
+            baseStrokes.reverseInPlace();
         if (this._options.needNormals)
             _curve_Query_CylindricalRange__WEBPACK_IMPORTED_MODULE_17__.CylindricalRangeQuery.buildRotationalNormalsInLineStrings(baseStrokes, axis, swingVector);
         const maxDistance = perpendicularVector.magnitude();
-        const maxPath = Math.abs(maxDistance * surface.getSweep().radians);
-        let numStep = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_4__.StrokeOptions.applyAngleTol(this._options, 1, surface.getSweep().radians, undefined);
+        const maxPath = Math.abs(maxDistance * sweepAngle.radians);
+        let numStep = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_4__.StrokeOptions.applyAngleTol(this._options, 1, sweepAngle.radians, undefined);
         numStep = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_4__.StrokeOptions.applyMaxEdgeLength(this._options, numStep, maxPath);
         for (let i = 1; i <= numStep; i++) {
             const transformA = surface.getFractionalRotationTransform((i - 1) / numStep);
@@ -254797,11 +254958,10 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
             this.addBetweenRotatedStrokeSets(baseStrokes, transformA, i - 1, transformB, i);
         }
         if (surface.capped) {
-            const capContour = surface.getSweepContourRef();
-            capContour.purgeFacets();
-            capContour.emitFacets(this, true, undefined);
-            // final loop pass left transformA at end
-            capContour.emitFacets(this, false, surface.getFractionalRotationTransform(1.0));
+            contour.purgeFacets();
+            const reverseNearCap = contourNormalAgreesWithSwingDir;
+            contour.emitFacets(this, reverseNearCap, undefined);
+            contour.emitFacets(this, !reverseNearCap, surface.getFractionalRotationTransform(1.0));
         }
     }
     /** Construct facets for any planar region. */
@@ -254865,9 +255025,9 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
             const normalIndices = ls.ensureEmptyNormalIndices();
             const normalIndex0 = this.findOrAddNormalInLineString(ls, 0, transform);
             normalIndices.push(normalIndex0);
-            let normalIndexA = normalIndex0;
-            let normalIndexB;
             if (n > 1) {
+                let normalIndexA = normalIndex0;
+                let normalIndexB;
                 for (let i = 1; i + 1 < n; i++) {
                     normalIndexB = this.findOrAddNormalInLineString(ls, i, transform, normalIndexA);
                     normalIndices.push(normalIndexB);
@@ -254882,9 +255042,9 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
             const uvIndices = ls.ensureEmptyUVIndices();
             const uvIndex0 = this.findOrAddParamInLineString(ls, 0, vParam);
             uvIndices.push(uvIndex0);
-            let uvIndexA = uvIndex0;
-            let uvIndexB;
             if (n > 1) {
+                let uvIndexA = uvIndex0;
+                let uvIndexB;
                 for (let i = 1; i + 1 < n; i++) {
                     uvIndexB = this.findOrAddParamInLineString(ls, i, vParam, uvIndexA);
                     uvIndices.push(uvIndexB);
@@ -256813,15 +256973,32 @@ class PolyfaceData {
         return result;
     }
     /**
-     * Apply `transform` to point and normal arrays and to auxData.
-     * * IMPORTANT This base class is just a data carrier. It does not know if the index order and normal directions
-     * have special meaning, i.e., caller must separately reverse index order and normal direction if needed.
+     * Apply a transform to the mesh data.
+     * * Transform the data as follows:
+     *   * apply `transform` to points.
+     *   * apply inverse transpose of `transform` to normals and renormalize. This preserves normals perpendicular
+     * to transformed facets, and keeps them pointing outward, e.g, if the mesh is closed. If the transform is not
+     * invertible or a normal has zero length, the normal(s) are left unchanged, and this error is silently ignored.
+     *   * apply `transform` to auxData.
+     *   * scale faceData distances by the cube root of the absolute value of the determinant of `transform.matrix`.
+     * * Note that if the transform is a mirror, this method does NOT reverse index order. This is the caller's
+     * responsibility. This base class is just a data carrier: PolyfaceData does not know if the index order has
+     * special meaning.
+    * * Note that this method always returns true. If transforming normals fails (due to singular matrix or zero
+     * normal), the original normal(s) are left unchanged.
      */
     tryTransformInPlace(transform) {
         this.point.multiplyTransformInPlace(transform);
         if (this.normal && !transform.matrix.isIdentity)
             this.normal.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace(transform.matrix);
-        return undefined === this.auxData || this.auxData.tryTransformInPlace(transform);
+        if (this.face.length > 0) {
+            const distScale = Math.cbrt(Math.abs(transform.matrix.determinant()));
+            for (const faceData of this.face)
+                faceData.scaleDistances(distScale);
+        }
+        if (this.auxData)
+            this.auxData.tryTransformInPlace(transform);
+        return true;
     }
     /**
      * Compress the instance by equating duplicate data.
@@ -258757,8 +258934,8 @@ class PolyfaceQuery {
     /**
      * Search facets for the first one that intersects the infinite line.
      * * To process _all_ intersections, callers can supply an `options.acceptIntersection` callback that always
-     * returns `false`.
-     * In this case, `intersectRay3d` will return `undefined`, but the callback will be invoked for each intersection.
+     * returns `false`. In this case, `intersectRay3d` will return `undefined`, but the callback will be invoked for
+     * each intersection.
      * * Example callback logic:
      *    * Accept the first found facet that intersects the half-line specified by the ray: `return detail.a >= 0.0;`
      *    * Collect all intersections: `myIntersections.push(detail.clone()); return false;` Then after `intersectRay3d`
@@ -258776,6 +258953,7 @@ class PolyfaceQuery {
         if (visitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
             return PolyfaceQuery.intersectRay3d(visitor.createVisitor(0), ray, options);
         let detail;
+        const tol = options ? [options.distanceTolerance, options.parameterTolerance] : undefined;
         visitor.setNumWrap(0);
         while (visitor.moveToNextFacet()) {
             const numEdges = visitor.pointCount; // #vertices = #edges since numWrap is zero
@@ -258787,7 +258965,7 @@ class PolyfaceQuery {
                 detail = this._workFacetDetail3 = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__.TriangularFacetLocationDetail.create(visitor.currentReadIndex(), detail3, this._workFacetDetail3);
             }
             else {
-                const detailN = this._workPolyDetail = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.intersectRay3d(vertices, ray, options?.distanceTolerance, this._workPolyDetail);
+                const detailN = this._workPolyDetail = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.intersectRay3d(vertices, ray, tol, this._workPolyDetail);
                 if (_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.isConvex(vertices))
                     detail = this._workFacetDetailC = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__.ConvexFacetLocationDetail.create(visitor.currentReadIndex(), numEdges, detailN, this._workFacetDetailC);
                 else
@@ -274450,8 +274628,10 @@ class Box extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
     getConstructiveFrame() {
         return this._localToWorld.cloneRigid();
     }
-    /** Apply the transform to the box's `localToWorld` frame.
+    /**
+     * Apply the transform to the box's `localToWorld` frame.
      * * Note that this may make the frame nonrigid.
+     * * This fails if the transformation is singular.
      */
     tryTransformInPlace(transform) {
         if (transform.matrix.isSingular())
@@ -274459,11 +274639,14 @@ class Box extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
         transform.multiplyTransformTransform(this._localToWorld, this._localToWorld);
         return true;
     }
-    /** Clone the box and immediately apply `transform` to the local frame of the clone. */
+    /**
+     * Clone the box and immediately apply `transform` to the local frame of the clone.
+     * * Note that this may make the frame nonrigid.
+     * * This fails if the transformation is singular.
+    */
     cloneTransformed(transform) {
         const result = this.clone();
-        transform.multiplyTransformTransform(result._localToWorld, result._localToWorld);
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /**
      * Create a new box from vector and size daa.
@@ -274498,7 +274681,7 @@ class Box extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
     }
     /**
      * Create an axis-aligned `Box` primitive for a range.
-     * @param range range corners Origin of base rectangle
+     * @param range range low point is origin of base rectangle, range extents are box extents
      * @param capped true to define top and bottom closure caps
      */
     static createRange(range, capped) {
@@ -274706,7 +274889,7 @@ class Cone extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
     getConstructiveFrame() {
         return this._localToWorld.cloneRigid();
     }
-    /** Apply the transform to this cone's locla to world coordinates.
+    /** Apply the transform to this cone's local to world coordinates.
      * * Note that the radii are not changed.  Scaling is absorbed into the frame.
      * * This fails if the transformation is singular.
      */
@@ -274718,11 +274901,11 @@ class Cone extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive {
     }
     /**
      * Create a clone and immediately transform the clone.
+     * * This fails if the transformation is singular.
      */
     cloneTransformed(transform) {
         const result = this.clone();
-        transform.multiplyTransformTransform(result._localToWorld, result._localToWorld);
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** create a cylinder or cone from two endpoints and their radii.   The circular cross sections are perpendicular to the axis line
      * from start to end point.
@@ -275021,7 +275204,10 @@ class LinearSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrim
     clone() {
         return new LinearSweep(this._contour.clone(), this._direction.clone(), this.capped);
     }
-    /** apply a transform to the curves and sweep vector */
+    /**
+     * Apply a transform to the curves and sweep vector
+     * * This fails if the transformation is singular.
+     */
     tryTransformInPlace(transform) {
         if (transform.matrix.isSingular())
             return false;
@@ -275039,11 +275225,13 @@ class LinearSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrim
     getConstructiveFrame() {
         return this._contour.localToWorld.cloneRigid();
     }
-    /** Return a transformed clone */
+    /**
+     * Return a transformed clone.
+     * * This fails if the transformation is singular.
+     */
     cloneTransformed(transform) {
         const result = this.clone();
-        result.tryTransformInPlace(transform);
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** Test for near-equality of coordinates in `other` */
     isAlmostEqual(other) {
@@ -275142,7 +275330,12 @@ class RotationalSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.Solid
         this.capped = capped;
         this._sweepAngle = sweepAngle;
     }
-    /** Create a rotational sweep. */
+    /** Create a rotational sweep.
+     * @param contour profile to sweep, coplanar with axis. CAPTURED
+     * @param axis rotation axis
+     * @param sweepAngle signed angular sweep
+     * @param capped whether to cap the surface to make a solid
+     */
     static create(contour, axis, sweepAngle, capped) {
         if (!axis.direction.normalizeInPlace())
             return undefined;
@@ -275187,20 +275380,28 @@ class RotationalSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.Solid
     clone() {
         return new RotationalSweep(this._contour.clone(), this._normalizedAxis.clone(), this._sweepAngle.clone(), this.capped);
     }
-    /** Transform the contour and axis */
+    /**
+     * Transform the contour and axis.
+     * * This fails if the transformation is singular.
+     */
     tryTransformInPlace(transform) {
-        if (!transform.matrix.isSingular()
-            && this._contour.tryTransformInPlace(transform)) {
+        if (transform.matrix.isSingular())
+            return false;
+        if (this._contour.tryTransformInPlace(transform)) {
             this._normalizedAxis.transformInPlace(transform);
+            if (transform.matrix.determinant() < 0.0)
+                this._sweepAngle.setRadians(-this._sweepAngle.radians);
             return this._normalizedAxis.direction.normalizeInPlace();
         }
         return false;
     }
-    /** return a cloned transform. */
+    /**
+     * Return a transformed clone.
+     * * This fails if the transformation is singular.
+     */
     cloneTransformed(transform) {
         const result = this.clone();
-        result.tryTransformInPlace(transform);
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** Dispatch to strongly typed handler  `handler.handleRotationalSweep(this)` */
     dispatchToGeometryHandler(handler) {
@@ -275336,20 +275537,26 @@ class RuledSweep extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimi
     clone() {
         return new RuledSweep(this.cloneSweepContours(), this.capped);
     }
-    /** Transform all contours in place. */
+    /**
+     * Transform all contours in place.
+     * * This fails if the transformation is singular.
+     */
     tryTransformInPlace(transform) {
         if (transform.matrix.isSingular())
             return false;
         for (const contour of this._contours) {
-            contour.tryTransformInPlace(transform);
+            if (!contour.tryTransformInPlace(transform))
+                return false;
         }
         return true;
     }
-    /** Return a cloned transform. */
+    /**
+     * Return a transformed clone.
+     * * This fails if the transformation is singular.
+     */
     cloneTransformed(transform) {
         const result = this.clone();
-        result.tryTransformInPlace(transform);
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** Return a coordinate frame (right handed unit vectors)
      * * origin on base contour
@@ -275530,12 +275737,12 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
 /* harmony import */ var _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../curve/StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/AngleSweep */ "../../core/geometry/lib/esm/geometry3d/AngleSweep.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_AngleSweep__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/AngleSweep */ "../../core/geometry/lib/esm/geometry3d/AngleSweep.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_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
 /* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.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_Transform__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /* harmony import */ var _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./SolidPrimitive */ "../../core/geometry/lib/esm/solid/SolidPrimitive.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -275579,32 +275786,32 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
         /** String name for schema properties */
         this.solidPrimitiveType = "sphere";
         this._localToWorld = localToWorld;
-        this._latitudeSweep = latitudeSweep ? latitudeSweep : _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_1__.AngleSweep.createFullLatitude();
+        this._latitudeSweep = latitudeSweep;
         this._latitudeSweep.capLatitudeInPlace();
     }
     /** return a deep clone */
     clone() {
         return new Sphere(this._localToWorld.clone(), this._latitudeSweep.clone(), this.capped);
     }
-    /** Transform the sphere in place.
+    /**
+     * Transform the sphere in place.
      * * Fails if the transform is singular.
      */
     tryTransformInPlace(transform) {
         if (transform.matrix.isSingular())
             return false;
         transform.multiplyTransformTransform(this._localToWorld, this._localToWorld);
+        if (transform.matrix.determinant() < 0.0)
+            this._latitudeSweep.reverseInPlace();
         return true;
     }
-    /** Return a transformed clone. */
+    /**
+     * Return a transformed clone.
+     * * Fails if the transform is singular.
+    */
     cloneTransformed(transform) {
-        const sphere1 = this.clone();
-        transform.multiplyTransformTransform(sphere1._localToWorld, sphere1._localToWorld);
-        if (transform.matrix.determinant() < 0.0) {
-            if (sphere1._latitudeSweep !== undefined) {
-                sphere1._latitudeSweep.reverseInPlace();
-            }
-        }
-        return sphere1;
+        const result = this.clone();
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** Return a coordinate frame (right handed, unit axes)
      * * origin at sphere center
@@ -275618,8 +275825,8 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
     get latitudeSweepFraction() { return this._latitudeSweep.sweepRadians / Math.PI; }
     /** Create from center and radius, with optional restricted latitudes. */
     static createCenterRadius(center, radius, latitudeSweep) {
-        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createOriginAndMatrix(center, _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createUniformScale(radius));
-        return new Sphere(localToWorld, latitudeSweep ? latitudeSweep.clone() : _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_1__.AngleSweep.createFullLatitude(), false);
+        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__.Transform.createOriginAndMatrix(center, _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createUniformScale(radius));
+        return new Sphere(localToWorld, latitudeSweep ? latitudeSweep.clone() : _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_3__.AngleSweep.createFullLatitude(), false);
     }
     /** Create an ellipsoid which is a unit sphere mapped to position by an (arbitrary, possibly skewed and scaled) transform. */
     static createEllipsoid(localToWorld, latitudeSweep, capped) {
@@ -275629,18 +275836,18 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
     static createDgnSphere(center, vectorX, vectorZ, radiusXY, radiusZ, latitudeSweep, capped) {
         const vectorY = vectorX.rotate90Around(vectorZ);
         if (vectorY && !vectorX.isParallelTo(vectorZ)) {
-            const matrix = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_3__.Matrix3d.createColumns(vectorX, vectorY, vectorZ);
+            const matrix = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createColumns(vectorX, vectorY, vectorZ);
             matrix.scaleColumns(radiusXY, radiusXY, radiusZ, matrix);
-            const frame = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createOriginAndMatrix(center, matrix);
+            const frame = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__.Transform.createOriginAndMatrix(center, matrix);
             return new Sphere(frame, latitudeSweep.clone(), capped);
         }
         return undefined;
     }
     /** Create a sphere from the typical parameters of the Dgn file */
     static createFromAxesAndScales(center, axes, radiusX, radiusY, radiusZ, latitudeSweep, capped) {
-        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createOriginAndMatrix(center, axes);
+        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_1__.Transform.createOriginAndMatrix(center, axes);
         localToWorld.matrix.scaleColumnsInPlace(radiusX, radiusY, radiusZ);
-        return new Sphere(localToWorld, latitudeSweep ? latitudeSweep.clone() : _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_1__.AngleSweep.createFullLatitude(), capped);
+        return new Sphere(localToWorld, latitudeSweep ? latitudeSweep.clone() : _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_3__.AngleSweep.createFullLatitude(), capped);
     }
     /** return (copy of) sphere center */
     cloneCenter() { return this._localToWorld.getOrigin(); }
@@ -275686,10 +275893,16 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
         return false;
     }
     /**
-     *  return strokes for a cross-section (elliptic arc) at specified fraction v along the axis.
-     * * if strokeOptions is supplied, it is applied to the equator radii.
-     * @param v fractional position along the cone axis
-     * @param strokes stroke count or options.
+     * Return strokes for the elliptical arc cross-section at latitude sweep fraction v.
+     * * Optional inputs control the number of strokes along the cross-section:
+     *   * If `fixedStrokeCount` is supplied, it is taken as the cross-section stroke count.
+     *   * If `fixedStrokeCount` is undefined, stroke count is computed by applying `options` to the cross-section.
+     *   * If neither input is supplied, the stroke count default is 16.
+     *   * In any case, stroke count is clamped to the interval [4,64].
+     * @param v fractional position along the sphere axis
+     * @param fixedStrokeCount optional stroke count in u-direction
+     * @param options optional stroke options in u-direction
+     * @return strokes as line string
      */
     strokeConstantVSection(v, fixedStrokeCount, options) {
         let strokeCount = 16;
@@ -275705,7 +275918,7 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
         const c1 = Math.cos(phi);
         const s1 = Math.sin(phi);
         let c0, s0;
-        const result = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_6__.LineString3d.createForStrokes(fixedStrokeCount, options);
+        const result = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_6__.LineString3d.createForStrokes(strokeCount, options);
         const deltaRadians = Math.PI * 2.0 / strokeCount;
         const fractions = result.fractions; // possibly undefined !!!
         const derivatives = result.packedDerivatives; // possibly undefined !!!
@@ -275932,7 +276145,7 @@ class SweepContour {
         return undefined;
     }
     /** Create for rotational sweep.
-     * @param contour curve to sweep, CAPTURED. For best results, contour should be planar.
+     * @param contour curve to sweep, CAPTURED. For best results, contour should be coplanar with axis.
      * @param axis rotation axis
      */
     static createForRotation(contour, axis) {
@@ -276190,19 +276403,23 @@ class TorusPipe extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimit
         result._isReversed = this._isReversed;
         return result;
     }
-    /** Apply `transform` to the local coordinate system. */
+    /**
+     * Apply `transform` to the local coordinate system.
+     * * Fails if the transformation is singular.
+     */
     tryTransformInPlace(transform) {
         if (transform.matrix.isSingular())
             return false;
         transform.multiplyTransformTransform(this._localToWorld, this._localToWorld);
         return true;
     }
-    /** Clone this TorusPipe and transform the clone */
+    /**
+     * Clone this TorusPipe and transform the clone.
+     * * Fails if the transformation is singular.
+     */
     cloneTransformed(transform) {
         const result = this.clone();
-        if (!result.tryTransformInPlace(transform))
-            return undefined;
-        return result;
+        return result.tryTransformInPlace(transform) ? result : undefined;
     }
     /** Create a new `TorusPipe`
      * @param frame local to world transformation. For best results, the matrix part should be a pure rotation.
@@ -304022,7 +304239,7 @@ class TestContext {
         this.initializeRpcInterfaces({ title: this.settings.Backend.name, version: this.settings.Backend.version });
         const iModelClient = new imodels_client_management_1.IModelsClient({ api: { baseUrl: `https://${process.env.IMJS_URL_PREFIX ?? ""}api.bentley.com/imodels` } });
         await core_frontend_1.NoRenderApp.startup({
-            applicationVersion: "5.0.0-dev.4",
+            applicationVersion: "5.0.0-dev.5",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -312494,13 +312711,13 @@ class FavoritePropertiesManager {
             if (missingClasses.size === 0) {
                 return baseClasses;
             }
-            const query = `
-    SELECT (derivedSchema.Name || ':' || derivedClass.Name) AS "ClassFullName", (baseSchema.Name || ':' || baseClass.Name) AS "BaseClassFullName"
-    FROM ECDbMeta.ClassHasAllBaseClasses baseClassRels
-    INNER JOIN ECDbMeta.ECClassDef derivedClass ON derivedClass.ECInstanceId = baseClassRels.SourceECInstanceId
-    INNER JOIN ECDbMeta.ECSchemaDef derivedSchema ON derivedSchema.ECInstanceId = derivedClass.Schema.Id
-    INNER JOIN ECDbMeta.ECClassDef baseClass ON baseClass.ECInstanceId = baseClassRels.TargetECInstanceId
-    INNER JOIN ECDbMeta.ECSchemaDef baseSchema ON baseSchema.ECInstanceId = baseClass.Schema.Id
+            const query = `
+    SELECT (derivedSchema.Name || ':' || derivedClass.Name) AS "ClassFullName", (baseSchema.Name || ':' || baseClass.Name) AS "BaseClassFullName"
+    FROM ECDbMeta.ClassHasAllBaseClasses baseClassRels
+    INNER JOIN ECDbMeta.ECClassDef derivedClass ON derivedClass.ECInstanceId = baseClassRels.SourceECInstanceId
+    INNER JOIN ECDbMeta.ECSchemaDef derivedSchema ON derivedSchema.ECInstanceId = derivedClass.Schema.Id
+    INNER JOIN ECDbMeta.ECClassDef baseClass ON baseClass.ECInstanceId = baseClassRels.TargetECInstanceId
+    INNER JOIN ECDbMeta.ECSchemaDef baseSchema ON baseSchema.ECInstanceId = baseClass.Schema.Id
     WHERE (derivedSchema.Name || ':' || derivedClass.Name) IN (${[...missingClasses].map((className) => `'${className}'`).join(",")})`;
             const reader = imodel.createQueryReader(query, undefined, { rowFormat: _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.QueryRowFormat.UseJsPropertyNames });
             while (await reader.step()) {
@@ -331591,7 +331808,7 @@ function __disposeResources(env) {
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"5.0.0-dev.4","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 && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","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","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/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-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run --coverage","test:debug":"vitest --run","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^5.0.0-dev.4","@itwin/core-bentley":"workspace:^5.0.0-dev.4","@itwin/core-common":"workspace:^5.0.0-dev.4","@itwin/core-geometry":"workspace:^5.0.0-dev.4","@itwin/core-orbitgt":"workspace:^5.0.0-dev.4","@itwin/core-quantity":"workspace:^5.0.0-dev.4"},"//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/eslint-plugin":"5.0.0-dev.1","@types/chai-as-promised":"^7","@vitest/browser":"^2.1.0","@vitest/coverage-v8":"^2.1.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","cpx2":"^3.0.0","eslint":"^9.13.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^3.0.2","source-map-loader":"^4.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^2.1.0","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"1.0.6","webpack":"^5.76.0"},"//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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.2.5","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","meshoptimizer":"~0.20.0","wms-capabilities":"0.4.0"}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"5.0.0-dev.5","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 && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","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","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/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-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run --coverage","test:debug":"vitest --run","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^5.0.0-dev.5","@itwin/core-bentley":"workspace:^5.0.0-dev.5","@itwin/core-common":"workspace:^5.0.0-dev.5","@itwin/core-geometry":"workspace:^5.0.0-dev.5","@itwin/core-orbitgt":"workspace:^5.0.0-dev.5","@itwin/core-quantity":"workspace:^5.0.0-dev.5"},"//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/eslint-plugin":"5.0.0-dev.1","@types/chai-as-promised":"^7","@vitest/browser":"^2.1.0","@vitest/coverage-v8":"^2.1.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","cpx2":"^3.0.0","eslint":"^9.13.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^3.0.2","source-map-loader":"^4.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^2.1.0","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"1.0.6","webpack":"^5.76.0"},"//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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.2.5","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","meshoptimizer":"~0.20.0","wms-capabilities":"0.4.0"}}');
 
 /***/ }),