@itwin/rpcinterface-full-stack-tests 5.0.0-dev.13 → 5.0.0-dev.16

package/lib/dist/bundled-tests.js

@@ -191998,11 +191998,12 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "BSplineCurveOps": () => (/* binding */ BSplineCurveOps)
 /* harmony export */ });
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
 /* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
+/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/PointHelpers */ "../../core/geometry/lib/esm/geometry3d/PointHelpers.js");
+/* harmony import */ var _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../geometry3d/PointHelpers */ "../../core/geometry/lib/esm/geometry3d/PointHelpers.js");
 /* harmony import */ var _numerics_BandedSystem__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../numerics/BandedSystem */ "../../core/geometry/lib/esm/numerics/BandedSystem.js");
 /* harmony import */ var _BSplineCurve__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./BSplineCurve */ "../../core/geometry/lib/esm/bspline/BSplineCurve.js");
 /* harmony import */ var _KnotVector__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./KnotVector */ "../../core/geometry/lib/esm/bspline/KnotVector.js");
@@ -192021,6 +192022,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
  * A class with static methods for creating B-spline curves.
  * @public
@@ -192147,28 +192149,24 @@ class BSplineCurveOps {
         static removeDuplicateFitPoints(options) {
             if (undefined !== options.knots && options.knots.length !== options.fitPoints.length)
                 options.knots = undefined;
-            // get indices of duplicate points to be removed
-            const newPts = _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_0__.GrowableXYZArray.create(options.fitPoints);
-            const indices = newPts.findOrderedDuplicates();
-            newPts.clear();
-            // remove duplicate fit points
-            for (let iRead = 0, iIndex = 0; iRead < options.fitPoints.length; ++iRead) {
-                if (iRead === indices[iIndex])
-                    ++iIndex; // skip the duplicate
-                else
-                    newPts.push(options.fitPoints[iRead].clone());
-            }
-            options.fitPoints = newPts.getPoint3dArray();
-            // remove params corresponding to removed fit points
-            if (undefined !== options.knots) {
-                const newKnots = [];
-                for (let iRead = 0, iIndex = 0; iRead < options.knots.length; ++iRead) {
-                    if (iRead === indices[iIndex])
-                        ++iIndex; // skip
-                    else
-                        newKnots.push(options.knots[iRead]);
+            const carrier = new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_6__.Point3dArrayCarrier(options.fitPoints);
+            const indices = carrier.findOrderedDuplicates(undefined, true); // use default tolerance
+            if (indices.length > 0) {
+                // remove duplicate fit points, and their corresponding params
+                let iWrite = 0;
+                for (let iRead = 0, iIndex = 0; iRead < options.fitPoints.length; ++iRead) {
+                    if (iIndex < indices.length && iRead === indices[iIndex])
+                        ++iIndex; // skip the duplicate
+                    else {
+                        options.fitPoints[iWrite] = options.fitPoints[iRead];
+                        if (options.knots)
+                            options.knots[iWrite] = options.knots[iRead];
+                        ++iWrite;
+                    }
                 }
-                options.knots = newKnots.slice();
+                options.fitPoints.splice(iWrite);
+                if (options.knots)
+                    options.knots.splice(iWrite);
             }
             return true;
         }
@@ -192618,25 +192616,25 @@ class BSplineCurveOps {
             let tmp = 0.0;
             // first forward substitution
             for (let i = 1; i < numIntervals; ++i) {
-                if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.conditionalDivideFraction(-alpha[i], beta[i - 1])))
+                if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.conditionalDivideFraction(-alpha[i], beta[i - 1])))
                     return undefined;
                 beta[i] += tmp * gamma[i - 1];
                 alpha[i] = tmp * alpha[i - 1];
                 leftPts[i].addScaledInPlace(leftPts[i - 1], tmp);
             }
             // first backward substitution
-            if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.conditionalDivideFraction(1.0, beta[numIntervals - 1] + alpha[numIntervals - 1])))
+            if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.conditionalDivideFraction(1.0, beta[numIntervals - 1] + alpha[numIntervals - 1])))
                 return undefined;
             gamma[numIntervals - 1] *= tmp;
             leftPts[numIntervals - 1].scaleInPlace(tmp);
             for (let i = numIntervals - 2; i >= 0; --i) {
-                if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.conditionalDivideFraction(1.0, beta[i])))
+                if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.conditionalDivideFraction(1.0, beta[i])))
                     return undefined;
                 _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.createScale(leftPts[i].plus2Scaled(leftPts[i + 1], -gamma[i], leftPts[numIntervals - 1], -alpha[i]), tmp, leftPts[i]);
                 gamma[i] = -(gamma[i] * gamma[i + 1] + alpha[i] * gamma[numIntervals - 1]) * tmp;
             }
             // second forward substitution
-            if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.conditionalDivideFraction(1.0, 1.0 + gamma[0])))
+            if (undefined === (tmp = _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.conditionalDivideFraction(1.0, 1.0 + gamma[0])))
                 return undefined;
             poles.push(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.createScale(leftPts[0], tmp));
             for (let i = 1; i < numIntervals; ++i) {
@@ -192757,7 +192755,7 @@ class BSplineCurveOps {
                 props.knots = this.convertFitParamsToCubicKnotVector(props.knots, props.closed, true);
             }
             else {
-                props.knots = this.constructFitParametersFromPoints(_geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_7__.Point3dArray.clonePoint3dArray(props.fitPoints), props.isChordLenKnots, props.closed);
+                props.knots = this.constructFitParametersFromPoints(_geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_8__.Point3dArray.clonePoint3dArray(props.fitPoints), props.isChordLenKnots, props.closed);
                 props.knots = this.convertFitParamsToCubicKnotVector(props.knots, props.closed, true);
             }
         }
@@ -201953,10 +201951,17 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     isSameGeometryClass(other) {
         return other instanceof Arc3d;
     }
-    /** Read property for (clone of) center. */
+    /** Read/write the center. Getter returns clone. */
     get center() {
         return this._center.clone();
     }
+    set center(center) {
+        this._center.setFrom(center);
+    }
+    /** Read property for (reference to) center. */
+    get centerRef() {
+        return this._center;
+    }
     /** Read property for (clone of) vector0. */
     get vector0() {
         return this._matrix.columnX();
@@ -201977,7 +201982,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     get matrixRef() {
         return this._matrix;
     }
-    /** Sweep of the angle. */
+    /** Read/write the sweep. Getter returns reference. */
     get sweep() {
         return this._sweep;
     }
@@ -204936,7 +204941,7 @@ var MiteredSweepOutputSelect;
  * @public
  */
 class CurveFactory {
-    /** (cautiously) construct and save a line segment between fractional positions. */
+    /** (Cautiously) construct and save a line segment between fractional positions. */
     static addPartialSegment(path, allowBackup, pointA, pointB, fraction0, fraction1) {
         if (allowBackup || (fraction1 > fraction0)) {
             if (pointA !== undefined && pointB !== undefined && !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(fraction0, fraction1))
@@ -205033,10 +205038,11 @@ class CurveFactory {
         }
         return path;
     }
-    /** Create a `Loop` with given xy corners and fixed z.
+    /**
+     * Create a `Loop` with given xy corners and fixed z.
      * * The corners always proceed counter clockwise from lower left.
      * * If the radius is too large for the outer rectangle size, it is reduced to half of the the smaller x or y size.
-    */
+     */
     static createRectangleXY(x0, y0, x1, y1, z = 0, filletRadius) {
         let radius = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.correctSmallMetricDistance(filletRadius);
         const xMin = Math.min(x0, x1);
@@ -205045,7 +205051,13 @@ class CurveFactory {
         const yMax = Math.max(y0, y1);
         radius = Math.min(Math.abs(radius), 0.5 * (xMax - xMin), 0.5 * (yMax - yMin));
         if (radius === 0.0)
-            return _Loop__WEBPACK_IMPORTED_MODULE_6__.Loop.createPolygon([_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMin, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMax, yMin, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMax, yMax, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMax, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMin, z)]);
+            return _Loop__WEBPACK_IMPORTED_MODULE_6__.Loop.createPolygon([
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMin, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMax, yMin, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMax, yMax, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMax, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(xMin, yMin, z),
+            ]);
         else {
             const vectorU = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create(radius, 0, 0);
             const vectorV = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create(0, radius, 0);
@@ -205053,7 +205065,12 @@ class CurveFactory {
             const y0A = yMin + radius;
             const x1A = xMax - radius;
             const y1A = yMax - radius;
-            const centers = [_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x1A, y1A, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x0A, y1A, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x0A, y0A, z), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x1A, y0A, z)];
+            const centers = [
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x1A, y1A, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x0A, y1A, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x0A, y0A, z),
+                _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create(x1A, y0A, z),
+            ];
             const loop = _Loop__WEBPACK_IMPORTED_MODULE_6__.Loop.create();
             for (let i = 0; i < 4; i++) {
                 const center = centers[i];
@@ -205073,10 +205090,10 @@ class CurveFactory {
     /**
      * If `arcB` is a continuation of `arcA`, extend `arcA` (in place) to include the range of `arcB`
      * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.
-     * @param arcA first arc, modified in place
-     * @param arcB second arc, unmodified
-     * @param allowReversed whether to consolidate even when second arc is reversed
-     * @returns whether `arcA` was modified
+     * @param arcA first arc, modified in place.
+     * @param arcB second arc, unmodified.
+     * @param allowReversed whether to consolidate even when second arc is reversed.
+     * @returns whether `arcA` was modified.
      */
     static appendToArcInPlace(arcA, arcB, allowReverse = false) {
         if (arcA.center.isAlmostEqual(arcB.center)) {
@@ -205092,7 +205109,7 @@ class CurveFactory {
                 arcA.sweep.setStartEndRadians(arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians + sweepSign * arcB.sweep.sweepRadians);
                 return true;
             }
-            // Also ok if negated tangent . ..
+            // Also ok if negated tangent
             if (allowReverse) {
                 startB.direction.scaleInPlace(-1.0);
                 if (endA.isAlmostEqual(startB)) {
@@ -205105,7 +205122,8 @@ class CurveFactory {
     }
     /**
      * Return a `Path` containing arcs are on the surface of an ellipsoid and pass through a sequence of points.
-     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at given `fractionForIntermediateNormal`
+     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at
+     * given `fractionForIntermediateNormal`
      * @param ellipsoid
      * @param pathPoints
      * @param fractionForIntermediateNormal fractional position for surface normal used to create the section plane.
@@ -205128,7 +205146,7 @@ class CurveFactory {
     }
     /**
      * Create solid primitives for pipe segments (e.g. Cone or TorusPipe) around line and arc primitives.
-     * @param centerline centerline geometry/
+     * @param centerline centerline geometry.
      * @param pipeRadius radius of pipe.
      */
     static createPipeSegments(centerline, pipeRadius) {
@@ -205154,16 +205172,22 @@ class CurveFactory {
         return undefined;
     }
     /**
-     * * Create section arcs for mitered pipe.
-     * * At each end of each pipe, the pipe is cut by the plane that bisects the angle between successive pipe centerlines.
-     * * The arc definitions are constructed so that lines between corresponding fractional positions on the arcs are
-     *     axial lines on the pipes.
-     * * This means that each arc definition axes (aka vector0 and vector90) are _not_ perpendicular to each other.
-     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis lengths, or a full Arc3d.
-     *    * For semi-axis length input, x corresponds to an ellipse local axis nominally situated parallel to the xy-plane.
-     *    * The center of Arc3d input is translated to the centerline start point to act as initial cross section.
-     * @param centerline centerline of pipe
-     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d
+     * Create section arcs for mitered pipe.
+     * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive
+     * centerline segments.
+     * * The section arcs are constructed so that lines between corresponding fractional positions on the arcs are
+     *   axial lines on the pipes.
+     * * This means that the initial arc's vector0 and vector90 lengths and angular separation are _not_ preserved in
+     * the section arcs.
+     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis
+     * lengths, or an Arc3d:
+     *    * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the
+     * start tangent.
+     *    * For Arc3d input, the center is translated to the centerline start point, but otherwise the arc is used as-is
+     * for the first section. For best results, the arc should be perpendicular to the centerline start tangent.
+     * @param centerline centerline of pipe. For best results, ensure no successive duplicate points with e.g.,
+     * [[GrowableXYZArray.createCompressed]].
+     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d (if not full, function makes it full).
      */
     static createMiteredPipeSections(centerline, sectionData) {
         const arcs = [];
@@ -205172,15 +205196,15 @@ class CurveFactory {
         const vector0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create();
         const vector90 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create();
         const vectorBC = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create();
-        const currentCenter = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
-        centerline.vectorIndexIndex(0, 1, vectorBC);
-        centerline.getPoint3dAtUncheckedPointIndex(0, currentCenter);
-        let initialSection;
+        const sweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_8__.AngleSweep.create360();
+        centerline.vectorIndexIndex(0, 1, vectorBC); // initially, the start tangent
         if (sectionData instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
-            initialSection = sectionData.clone();
-            initialSection.center.setFrom(currentCenter);
             vector0.setFrom(sectionData.vector0);
             vector90.setFrom(sectionData.vector90);
+            sweep.setFrom(sectionData.sweep); // allow e.g., half-pipe
+            const sectionFacesForward = sectionData.matrixRef.columnDotXYZ(_Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisIndex.Z, vectorBC.x, vectorBC.y, vectorBC.z) > 0;
+            if (sectionFacesForward !== sectionData.sweep.isCCW)
+                sweep.reverseInPlace();
         }
         else if (typeof sectionData === "number" || _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.isXAndY(sectionData)) {
             const length0 = (typeof sectionData === "number") ? sectionData : sectionData.x;
@@ -205188,31 +205212,31 @@ class CurveFactory {
             const baseFrame = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_15__.Matrix3d.createRigidHeadsUp(vectorBC, _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.ZXY);
             baseFrame.columnX(vector0).scaleInPlace(length0);
             baseFrame.columnY(vector90).scaleInPlace(length90);
-            initialSection = _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d.create(currentCenter, vector0, vector90, _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_8__.AngleSweep.create360());
         }
         else {
             return [];
         }
+        // ASSUME: initial section normal points toward sweep direction for subsequent facet creation
+        const initialSection = _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d.create(undefined, vector0, vector90, sweep);
+        centerline.getPoint3dAtUncheckedPointIndex(0, initialSection.centerRef);
         arcs.push(initialSection);
         const vectorAB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create();
         const bisector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.create();
+        const center = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
         for (let i = 1; i < centerline.length; i++) {
             vectorAB.setFromVector3d(vectorBC);
-            centerline.getPoint3dAtUncheckedPointIndex(i, currentCenter);
-            if (i + 1 < centerline.length) {
+            centerline.getPoint3dAtUncheckedPointIndex(i, center);
+            if (i + 1 < centerline.length)
                 centerline.vectorIndexIndex(i, i + 1, vectorBC);
-            }
-            else {
+            else
                 vectorBC.setFromVector3d(vectorAB);
-            }
             if (vectorAB.normalizeInPlace() && vectorBC.normalizeInPlace()) {
                 vectorAB.interpolate(0.5, vectorBC, bisector);
-                // On the end ellipse for this pipe section. ..
-                // center comes directly from centerline[i]
-                // vector0 and vector90 are obtained by sweeping the corresponding vectors of the start ellipse to the split plane.
+                // At pipe end, the ellipse center comes directly from centerline[i], and vector0/vector90 are
+                // obtained by sweeping the corresponding vectors of the pipe start ellipse to the bisector plane.
                 moveVectorToPlane(vector0, vectorAB, bisector, vector0);
                 moveVectorToPlane(vector90, vectorAB, bisector, vector90);
-                arcs.push(_Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d.create(currentCenter, vector0, vector90, _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_8__.AngleSweep.create360()));
+                arcs.push(_Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d.create(center, vector0, vector90, sweep));
             }
         }
         return arcs;
@@ -205221,21 +205245,38 @@ class CurveFactory {
      * Sweep the initialSection along each segment of the centerLine until it hits the bisector plane at the next vertex.
      * * The caller should place the initialSection on a plane perpendicular to the first edge.
      *   * This plane is commonly (but not necessarily) through the start point itself.
-     *   * If the geometry is not "on a perpendicular plane", the output geometry will still be flattened onto the various planes.
-     * * In the "open path" case (i.e when wrapIfPhysicallyClosed is false or the path does not have matched first and last points)
-     *       the first/last output plane will be at the start/end of the first/last edge and on a perpendicular plane.
-     * * In the "closed path" case, the output plane for the first and last point is the bisector of the start and end planes from the "open path" case,
-     *    and the first/last section geometry may be different from `initialSection`.
-     * * The centerline path does NOT have to be planar, however twisting effects effects will appear in the various bisector planes.
-     * @param centerline sweep path, e.g., as stroked from a smooth centerline curve
-     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the first segment of the centerline.
-     * @param options options for computation and output
+     *   * If the initialSection is not "on a perpendicular plane", the output geometry will still be flattened onto the
+     *     various planes.
+     * * In the "open path" case (i.e when `wrapIfPhysicallyClosed` is false or the path does not have matched first and
+     *   last points), the first/last output plane will be at the start/end of the first/last edge and on a perpendicular
+     *   plane.
+     * * In the "closed path" case, if start/edn tangents are not provided in the `options`, then the output plane for the
+     *   first and last point is the bisector of the start and end planes from the "open path" case, and the first/last
+     *   section geometry may be different from `initialSection`.
+     * * The centerline path does NOT have to be planar, however twisting effects effects will appear in the various bisector
+     *   planes.
+     * @param centerline sweep path, e.g., as stroked from a smooth centerline curve.
+     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the
+     * first segment of the centerline.
+     * @param options options for computation and output.
      * @return array of sections, starting with `initialSection` projected along the first edge to the first plane.
      */
     static createMiteredSweepSections(centerline, initialSection, options) {
         const sectionData = { sections: [], planes: [] };
         const planes = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_16__.PolylineOps.createBisectorPlanesForDistinctPoints(centerline, options.wrapIfPhysicallyClosed);
+        // apply start/end tangent options
         if (planes !== undefined && planes.length > 1) {
+            const firstPlane = planes[0];
+            const lastPlane = planes[planes.length - 1];
+            const startTang = options.startTangent;
+            const endTang = options.endTangent;
+            if (!firstPlane.getOriginRef().isAlmostEqual(lastPlane.getOriginRef()) ||
+                (startTang && endTang && startTang.isAlmostEqual(endTang, 0.0))) {
+                if (startTang?.tryNormalizeInPlace())
+                    firstPlane.getNormalRef().setFrom(startTang);
+                if (endTang?.tryNormalizeInPlace())
+                    lastPlane.getNormalRef().setFrom(endTang);
+            }
             // Projection to target plane, constructing sweep direction from two given planes.
             // If successful, push the target plane and swept section to the output arrays and return the swept section.
             // If unsuccessful, leave the output arrays alone and return the input section.
@@ -205244,12 +205285,12 @@ class CurveFactory {
                 const transform = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_17__.Transform.createFlattenAlongVectorToPlane(sweepVector, targetPlane.getOriginRef(), targetPlane.getNormalRef());
                 if (transform === undefined)
                     return section;
-                const section1 = section.cloneTransformed(transform);
-                if (section1 === undefined)
+                const transformedSection = section.cloneTransformed(transform);
+                if (transformedSection === undefined)
                     return section;
                 sectionData.planes.push(targetPlane);
-                sectionData.sections.push(section1);
-                return section1;
+                sectionData.sections.push(transformedSection);
+                return transformedSection;
             };
             let currentSection = doSweepToPlane(planes[0], planes[1], planes[0], initialSection);
             for (let i = 1; i < planes.length; i++) {
@@ -205285,11 +205326,11 @@ class CurveFactory {
     /**
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * First spiral begins at given start point.
-     * * first tangent aims at shoulder
+     * * first tangent aims at shoulder.
      * * outbound spiral joins line from shoulder to target.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param startPoint inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralSpiralLine(spiralType, startPoint, shoulderPoint, targetPoint) {
@@ -205327,9 +205368,9 @@ class CurveFactory {
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * Spiral length is given.
      * * tangency points float on both lines.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @param spiralLength for each part of the spiral pair.
      * @return array with the computed spirals, or undefined if failure.
      */
@@ -205367,12 +205408,12 @@ class CurveFactory {
     }
     /**
      * Compute 2 spirals and an arc (all in XY) for a symmetric line-to-line transition.
-     * Spiral lengths and arc radius are given.   (e.g. from design speed standards.)
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * Spiral lengths and arc radius are given (e.g., from design speed standards).
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies
-     * @param lengthA inbound spiral length
-     * @param lengthB outbound spiral length
+     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies.
+     * @param lengthA inbound spiral length.
+     * @param lengthB outbound spiral length.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralArcSpiralLine(spiralType, pointA, pointB, pointC, lengthA, lengthB, arcRadius) {
@@ -205422,12 +205463,7 @@ class CurveFactory {
         }
         return undefined;
     }
-    /**
-     * Return the intersection point of 3 planes.
-     * @param planeA
-     * @param planeB
-     * @param planeC
-     */
+    /** Return the intersection point of 3 planes. */
     static planePlaneIntersectionRay(planeA, planeB) {
         const altitudeA = planeA.altitudeXYZ(0, 0, 0);
         const altitudeB = planeB.altitudeXYZ(0, 0, 0);
@@ -205447,9 +205483,7 @@ class CurveFactory {
         return undefined;
     }
 }
-/**
- * Starting at vectorR, move parallel to vectorV until perpendicular to planeNormal
- */
+/** Starting at vectorR, move parallel to vectorV until perpendicular to planeNormal. */
 function moveVectorToPlane(vectorR, vectorV, planeNormal, result) {
     // find s such that (vectorR + s * vectorV) DOT planeNormal = 0.
     const dotRN = vectorR.dotProduct(planeNormal);
@@ -222827,7 +222861,7 @@ class AngleSweep {
         this._radians0 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.clampToStartEnd(this._radians0, -limit, limit);
         this._radians1 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.clampToStartEnd(this._radians1, -limit, limit);
     }
-    /** Ask if the sweep is counterclockwise, i.e. positive sweep */
+    /** Ask if the sweep is counterclockwise, i.e. positive sweep. */
     get isCCW() {
         return this._radians1 >= this._radians0;
     }
@@ -227486,11 +227520,11 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "GrowableXYZArray": () => (/* binding */ GrowableXYZArray)
 /* harmony export */ });
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.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 _PointStreaming__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./PointStreaming */ "../../core/geometry/lib/esm/geometry3d/PointStreaming.js");
+/* harmony import */ var _Point2dVector2d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
+/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _PointStreaming__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./PointStreaming */ "../../core/geometry/lib/esm/geometry3d/PointStreaming.js");
 /* harmony import */ var _Range__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
 /* harmony import */ var _Transform__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /*---------------------------------------------------------------------------------------------
@@ -227606,6 +227640,54 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         result._xyzInUse = this.length;
         return result;
     }
+    /**
+     * Clone the input array with each successive duplicate point removed.
+     * * First and last points are always preserved.
+     * @param source the source array
+     * @param tolerance optional distance tol for compression (default [[Geometry.smallMetricDistance]])
+     * @param result optional pre-allocated object to populate and return. Can be a reference to `source`, in
+     * which case the array is compressed in place and returned.
+     * @see [[cloneCompressed]], [[compressInPlace]], [[PolylineOps.compressShortEdges]]
+     */
+    static createCompressed(source, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, result) {
+        const dupIndices = source.findOrderedDuplicates(tolerance, true);
+        const newSize = source.length - dupIndices.length;
+        if (!result)
+            result = new GrowableXYZArray(newSize);
+        if (result !== source) {
+            result.clear();
+            result.resize(newSize, true);
+        }
+        for (let iRead = 0, iWrite = 0, iDup = 0; iRead < source.length; ++iRead) {
+            if (iDup < dupIndices.length && iRead === dupIndices[iDup])
+                ++iDup; // skip the duplicate
+            else
+                result.transferFromGrowableXYZArray(iWrite++, source, iRead);
+        }
+        result.resize(newSize);
+        return result;
+    }
+    /**
+     * Clone the instance array with each successive duplicate point removed.
+     * * First and last points are always preserved.
+     * @param tolerance optional distance tol for compression (default [[Geometry.smallMetricDistance]])
+     * @param result optional pre-allocated object to populate and return. Can be a reference to the instance array, in
+     * which case the array is compressed in place and returned.
+     * @see [[createCompressed]], [[compressInPlace]], [[PolylineOps.compressShortEdges]]
+     */
+    cloneCompressed(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, result) {
+        return GrowableXYZArray.createCompressed(this, tolerance, result);
+    }
+    /**
+     * Compress the input array by removing successive duplicate points.
+     * * First and last points are always preserved.
+     * @param tolerance optional distance tol for compression (default [[Geometry.smallMetricDistance]])
+     * @returns the instance array.
+     * @see [[createCompressed]], [[cloneCompressed]], [[PolylineOps.compressShortEdges]]
+     */
+    compressInPlace(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        return GrowableXYZArray.createCompressed(this, tolerance, this);
+    }
     /** Create an array from various point data formats.
      * Valid inputs are:
      * * Point2d
@@ -227633,8 +227715,8 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     }
     /** Restructure MultiLineStringDataVariant as array of GrowableXYZArray */
     static createArrayOfGrowableXYZArray(data) {
-        const collector = new _PointStreaming__WEBPACK_IMPORTED_MODULE_1__.PointStreamGrowableXYZArrayCollector();
-        _PointStreaming__WEBPACK_IMPORTED_MODULE_1__.VariantPointDataStream.streamXYZ(data, collector);
+        const collector = new _PointStreaming__WEBPACK_IMPORTED_MODULE_2__.PointStreamGrowableXYZArrayCollector();
+        _PointStreaming__WEBPACK_IMPORTED_MODULE_2__.VariantPointDataStream.streamXYZ(data, collector);
         return collector.claimArrayOfGrowableXYZArray();
     }
     /** push a point to the end of the array */
@@ -227660,30 +227742,30 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      * * An array of any of the above
      */
     pushFrom(p) {
-        if (p instanceof _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d)
+        if (p instanceof _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d)
             this.pushXYZ(p.x, p.y, p.z);
         else if (p instanceof GrowableXYZArray)
             this.pushFromGrowableXYZArray(p);
-        else if (p instanceof _Point2dVector2d__WEBPACK_IMPORTED_MODULE_3__.Point2d)
+        else if (p instanceof _Point2dVector2d__WEBPACK_IMPORTED_MODULE_4__.Point2d)
             this.pushXYZ(p.x, p.y, 0.0);
-        else if (_Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isNumberArray(p, 4) || p instanceof Float64Array) {
+        else if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isNumberArray(p, 4) || p instanceof Float64Array) {
             const xyzToAdd = Math.trunc(p.length / 3);
             this.ensureCapacity(this._xyzInUse + xyzToAdd, false);
             this.copyData(p, xyzToAdd, this._xyzInUse);
             this._xyzInUse += xyzToAdd;
         }
-        else if (_Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isNumberArray(p, 3))
+        else if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isNumberArray(p, 3))
             this.pushXYZ(p[0], p[1], p[2]);
-        else if (_Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isNumberArray(p, 2))
+        else if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isNumberArray(p, 2))
             this.pushXYZ(p[0], p[1], 0.0);
         else if (Array.isArray(p)) {
             // direct recursion re-wraps p and goes infinite. Unroll here.
             for (const q of p)
                 this.pushFrom(q);
         }
-        else if (_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.isXYAndZ(p))
+        else if (_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.isXYAndZ(p))
             this.pushXYZ(p.x, p.y, p.z);
-        else if (_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.isXAndY(p))
+        else if (_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.isXAndY(p))
             this.pushXYZ(p.x, p.y, 0.0);
         else if (p instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0__.IndexedXYZCollection) {
             const n = p.length;
@@ -227762,15 +227844,6 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         if (this._xyzInUse > 0)
             this._xyzInUse--;
     }
-    /**
-     * Test if index is valid for an xyz (point or vector) within this array
-     * @param index xyz index to test.
-     */
-    isIndexValid(index) {
-        if (index >= this._xyzInUse || index < 0)
-            return false;
-        return true;
-    }
     /**
      * Clear all xyz data, but leave capacity unchanged.
      */
@@ -227784,7 +227857,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      */
     getPoint3dAtUncheckedPointIndex(pointIndex, result) {
         const index = 3 * pointIndex;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
     }
     /**
      * Get a point by index, strongly typed as a Point2d.  This is unchecked.  Use [[getPoint2dAtCheckedPointIndex]] to have validity test.
@@ -227793,7 +227866,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      */
     getPoint2dAtUncheckedPointIndex(pointIndex, result) {
         const index = 3 * pointIndex;
-        return _Point2dVector2d__WEBPACK_IMPORTED_MODULE_3__.Point2d.create(this._data[index], this._data[index + 1], result);
+        return _Point2dVector2d__WEBPACK_IMPORTED_MODULE_4__.Point2d.create(this._data[index], this._data[index + 1], result);
     }
     /**
      * Get a vector by index, strongly typed as a Vector3d.  This is unchecked.  Use [[getVector3dAtCheckedVectorIndex]] to have validity test.
@@ -227802,13 +227875,13 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      */
     getVector3dAtUncheckedVectorIndex(vectorIndex, result) {
         const index = 3 * vectorIndex;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
     }
     /** copy xyz into strongly typed Point3d */
     getPoint3dAtCheckedPointIndex(pointIndex, result) {
         if (this.isIndexValid(pointIndex)) {
             const index = 3 * pointIndex;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
         }
         return undefined;
     }
@@ -227831,7 +227904,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     getPoint2dAtCheckedPointIndex(pointIndex, result) {
         if (this.isIndexValid(pointIndex)) {
             const index = 3 * pointIndex;
-            return _Point2dVector2d__WEBPACK_IMPORTED_MODULE_3__.Point2d.create(this._data[index], this._data[index + 1], result);
+            return _Point2dVector2d__WEBPACK_IMPORTED_MODULE_4__.Point2d.create(this._data[index], this._data[index + 1], result);
         }
         return undefined;
     }
@@ -227839,7 +227912,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     getVector3dAtCheckedVectorIndex(vectorIndex, result) {
         if (this.isIndexValid(vectorIndex)) {
             const index = 3 * vectorIndex;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.create(this._data[index], this._data[index + 1], this._data[index + 2], result);
         }
         return undefined;
     }
@@ -227853,10 +227926,9 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     transferFromGrowableXYZArray(destIndex, source, sourceIndex) {
         if (this.isIndexValid(destIndex) && source.isIndexValid(sourceIndex)) {
             const i = destIndex * 3;
-            const j = sourceIndex * 3;
-            this._data[i] = source._data[j];
-            this._data[i + 1] = source._data[j + 1];
-            this._data[i + 2] = source._data[j + 2];
+            this._data[i] = source.getXAtUncheckedPointIndex(sourceIndex);
+            this._data[i + 1] = source.getYAtUncheckedPointIndex(sourceIndex);
+            this._data[i + 2] = source.getZAtUncheckedPointIndex(sourceIndex);
             return true;
         }
         return false;
@@ -227922,7 +227994,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         const result = [];
         const data = this._data;
         for (let i = 0; i < n; i += 3)
-            result.push(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(data[i], data[i + 1], data[i + 2]));
+            result.push(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(data[i], data[i + 1], data[i + 2]));
         return result;
     }
     /** multiply each point by the transform, replace values. */
@@ -228008,7 +228080,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         if (!matrix.computeCachedInverse(true))
             return false;
         const coffs = matrix.inverseCoffs;
-        const tol = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.smallFloatingPoint;
+        const tol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallFloatingPoint;
         let x = 0;
         let y = 0;
         let z = 0;
@@ -228051,7 +228123,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     multiplyMatrix4dAndQuietRenormalizeMatrix4d(matrix) {
         const data = this._data;
         const nDouble = this.float64Length;
-        const xyz1 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create();
+        const xyz1 = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create();
         for (let i = 0; i + 2 <= nDouble; i += 3) {
             matrix.multiplyXYZWQuietRenormalize(data[i], data[i + 1], data[i + 2], 1.0, xyz1);
             data[i] = xyz1.x;
@@ -228115,7 +228187,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         const n = 3 * (this._xyzInUse - 1); // Length already takes into account what specifically is in use
         const data = this._data;
         for (let i = 0; i < n; i += 3)
-            sum += _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseXYZ(data[i + 3] - data[i], data[i + 4] - data[i + 1], data[i + 5] - data[i + 2]);
+            sum += _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(data[i + 3] - data[i], data[i + 4] - data[i + 1], data[i + 5] - data[i + 2]);
         return sum;
     }
     /**
@@ -228130,7 +228202,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         }
     }
     /** test if all points are within tolerance of a plane. */
-    isCloseToPlane(plane, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.smallMetricDistance) {
+    isCloseToPlane(plane, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         const numCoordinate = 3 * this._xyzInUse;
         const data = this._data;
         for (let i = 0; i < numCoordinate; i += 3)
@@ -228143,7 +228215,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      * * If already closed within tolerance, force exact copy
      * * otherwise leave unchanged.
      */
-    forceClosure(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.smallMetricDistance) {
+    forceClosure(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         const d = this.distanceIndexIndex(0, this.length - 1);
         // leave the empty array alone.
         // Note that singleton will generate 0 distance and do nothing.
@@ -228165,7 +228237,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
             const data = this._data;
             i = 3 * i;
             j = 3 * j;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(fraction0 * data[i] + fraction * data[j], fraction0 * data[i + 1] + fraction * data[j + 1], fraction0 * data[i + 2] + fraction * data[j + 2], result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Point3d.create(fraction0 * data[i] + fraction * data[j], fraction0 * data[i + 1] + fraction * data[j + 1], fraction0 * data[i + 2] + fraction * data[j + 2], result);
         }
         return undefined;
     }
@@ -228196,37 +228268,37 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
             for (let i = 3; i < n; i += 3, dx1 = dx2, dy1 = dy2) {
                 dx2 = this._data[i] - x0;
                 dy2 = this._data[i + 1] - y0;
-                area += _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.crossProductXYXY(dx1, dy1, dx2, dy2);
+                area += _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.crossProductXYXY(dx1, dy1, dx2, dy2);
             }
         }
         return 0.5 * area;
     }
-    /** Compute a vector from index origin i to indexed target j  */
+    /** Compute a vector from index origin i to indexed target j. */
     vectorIndexIndex(i, j, result) {
         if (!this.isIndexValid(i) || !this.isIndexValid(j))
             return undefined;
         const data = this._data;
         i = 3 * i;
         j = 3 * j;
-        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(data[j] - data[i], data[j + 1] - data[i + 1], data[j + 2] - data[i + 2], result);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.create(data[j] - data[i], data[j + 1] - data[i + 1], data[j + 2] - data[i + 2], result);
     }
-    /** Compute a vector from origin to indexed target j */
+    /** Compute a vector from origin to indexed target j. */
     vectorXYAndZIndex(origin, j, result) {
         if (this.isIndexValid(j)) {
             const data = this._data;
             j = 3 * j;
-            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(data[j] - origin.x, data[j + 1] - origin.y, data[j + 2] - origin.z, result);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_3__.Vector3d.create(data[j] - origin.x, data[j + 1] - origin.y, data[j + 2] - origin.z, result);
         }
         return undefined;
     }
-    /** Compute the cross product of vectors from from indexed origin to indexed targets i and j */
+    /** Compute the cross product of vectors from from indexed origin to indexed targets i and j. */
     crossProductIndexIndexIndex(originIndex, targetAIndex, targetBIndex, result) {
         if (this.isIndexValid(originIndex) && this.isIndexValid(targetAIndex) && this.isIndexValid(targetBIndex)) {
             const i = originIndex * 3;
             const j = targetAIndex * 3;
             const k = targetBIndex * 3;
             const data = this._data;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.crossProductXYZXYZ(data[j] - data[i], data[j + 1] - data[i + 1], data[j + 2] - data[i + 2], data[k] - data[i], data[k + 1] - data[i + 1], data[k + 2] - data[i + 2], result);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.crossProductXYZXYZ(data[j] - data[i], data[j + 1] - data[i + 1], data[j + 2] - data[i + 2], data[k] - data[i], data[k + 1] - data[i + 1], data[k + 2] - data[i + 2], result);
         }
         return undefined;
     }
@@ -228274,7 +228346,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
             const j = targetAIndex * 3;
             const k = targetBIndex * 3;
             const data = this._data;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.crossProductXYZXYZ(data[j] - origin.x, data[j + 1] - origin.y, data[j + 2] - origin.z, data[k] - origin.x, data[k + 1] - origin.y, data[k + 2] - origin.z, result);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.crossProductXYZXYZ(data[j] - origin.x, data[j + 1] - origin.y, data[j + 2] - origin.z, data[k] - origin.x, data[k + 1] - origin.y, data[k + 2] - origin.z, result);
         }
         return undefined;
     }
@@ -228282,7 +228354,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     distanceIndexToPoint(i, spacePoint) {
         if (this.isIndexValid(i)) {
             const i0 = 3 * i;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseXYZ(spacePoint.x - this._data[i0], spacePoint.y - this._data[i0 + 1], spacePoint.z - this._data[i0 + 2]);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(spacePoint.x - this._data[i0], spacePoint.y - this._data[i0 + 1], spacePoint.z - this._data[i0 + 2]);
         }
         return undefined;
     }
@@ -228295,7 +228367,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         if (this.isIndexValid(i) && this.isIndexValid(j)) {
             const i0 = 3 * i;
             const j0 = 3 * j;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseSquaredXYZ(this._data[j0] - this._data[i0], this._data[j0 + 1] - this._data[i0 + 1], this._data[j0 + 2] - this._data[i0 + 2]);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseSquaredXYZ(this._data[j0] - this._data[i0], this._data[j0 + 1] - this._data[i0 + 1], this._data[j0 + 2] - this._data[i0 + 2]);
         }
         return undefined;
     }
@@ -228308,7 +228380,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         if (this.isIndexValid(i) && this.isIndexValid(j)) {
             const i0 = 3 * i;
             const j0 = 3 * j;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseXYZ(this._data[j0] - this._data[i0], this._data[j0 + 1] - this._data[i0 + 1], this._data[j0 + 2] - this._data[i0 + 2]);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(this._data[j0] - this._data[i0], this._data[j0 + 1] - this._data[i0 + 1], this._data[j0 + 2] - this._data[i0 + 2]);
         }
         return undefined;
     }
@@ -228317,7 +228389,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         if (arrayA.isIndexValid(i) && arrayB.isIndexValid(j)) {
             const i0 = 3 * i;
             const j0 = 3 * j;
-            return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseXYZ(arrayB._data[j0] - arrayA._data[i0], arrayB._data[j0 + 1] - arrayA._data[i0 + 1], arrayB._data[j0 + 2] - arrayA._data[i0 + 2]);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(arrayB._data[j0] - arrayA._data[i0], arrayB._data[j0 + 1] - arrayA._data[i0 + 1], arrayB._data[j0 + 2] - arrayA._data[i0 + 2]);
         }
         return undefined;
     }
@@ -228399,7 +228471,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         const range = _Range__WEBPACK_IMPORTED_MODULE_5__.Range1d.createNull();
         while (i < n) {
             k0 = 3 * i;
-            range.extendX(_Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.hypotenuseXYZ(dataA[k0] - dataB[k0], dataA[k0 + 1] - dataB[k0 + 1], dataA[k0 + 2] - dataB[k0 + 2]));
+            range.extendX(_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(dataA[k0] - dataB[k0], dataA[k0 + 1] - dataB[k0 + 1], dataA[k0 + 2] - dataB[k0 + 2]));
             i++;
         }
         return range;
@@ -228409,7 +228481,7 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
      * @param points
      * @param tolerance
      */
-    static removeClosure(points, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.smallMetricDistance) {
+    static removeClosure(points, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         while (points.length > 1 && points.distanceIndexIndex(0, points.length - 1) < tolerance)
             points.pop();
     }
@@ -228768,6 +228840,13 @@ class IndexedXYZCollection {
             return undefined;
         return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseSquaredXYZ(target.x - this.getXAtUncheckedPointIndex(index0), target.y - this.getYAtUncheckedPointIndex(index0), target.z - this.getZAtUncheckedPointIndex(index0));
     }
+    /**
+     * Test if index is valid for an xyz within this array.
+     * @param index xyz index to test.
+     */
+    isIndexValid(index) {
+        return index >= 0 && index < this.length;
+    }
     /** Adjust index into range by modulo with the length. */
     cyclicIndex(i) {
         return (i % this.length);
@@ -228784,24 +228863,31 @@ class IndexedXYZCollection {
         return range;
     }
     /**
-     * For each run of points with indices i+1 to i+n within distance tolerance of points[i], return the indices i+1, ..., i+n.
+     * For each subset of `k` successive points within tolerance of the first point in the subset, return the indices of
+     * the last `k-1` duplicates.
+     * * Index `0` is never returned.
+     * @param tolerance optional distance tol for compression (default [[Geometry.smallMetricDistance]])
+     * @param preserveLast if the last `k < this.length` points of the instance are duplicates, whether to return the
+     * indices of the *first* `k-1` duplicates for this last run. If true, index `this.length - 1` is not returned
+     * unless all points are duplicates, in which case all indices but `0` are returned. Default value is false.
      * @return ordered array of 0-based indices of duplicate points
      */
-    findOrderedDuplicates(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
-        const tol2 = tolerance * tolerance;
+    findOrderedDuplicates(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, preserveLast = false) {
         const indices = [];
         if (this.length > 1) {
             for (let i = 0; i < this.length - 1;) {
                 let j = i + 1;
-                for (; j < this.length; ++j) {
-                    const dist2 = this.distanceSquaredIndexIndex(i, j);
-                    if (dist2 !== undefined && dist2 < tol2)
-                        indices.push(j);
-                    else
-                        break;
-                }
+                for (; this.almostEqualIndexIndex(i, j, tolerance); ++j)
+                    indices.push(j);
                 i = j; // found next unique point
             }
+            if (preserveLast && indices.length > 0 && indices.length < this.length - 1) { // not all points are duplicate
+                let numLastRun = 0;
+                for (; numLastRun <= indices.length - 1 && indices[indices.length - 1 - numLastRun] === this.length - 1 - numLastRun; ++numLastRun)
+                    ;
+                for (let i = 0; i < numLastRun; ++i)
+                    indices[indices.length - 1 - i] -= 1; // decrement the indices of the last run so that the last point is preserved
+            }
         }
         return indices;
     }
@@ -229700,12 +229786,11 @@ class Matrix3d {
         return undefined;
     }
     /**
-     * Construct a rigid matrix (orthogonal matrix with +1 determinant) using vectorA and its 2 perpendicular.
+     * Construct a rigid matrix (orthogonal matrix with determinant 1) using vectorA and its 2 perpendiculars.
      * * If axisOrder is not passed then `AxisOrder = AxisOrder.ZXY` is used as default.
      * * This function internally uses createPerpendicularVectorFavorXYPlane and createRigidFromColumns.
-     * * If you want to rotate a given plane (which contains (0,0,0)) to the xy-plane, pass the normal vector of
-     * your plane into createRigidHeadsUp. The transpose of the returned Matrix3d can be used to rotate your plane
-     * to the xy-plane. If plane does not contain (0,0,0) then the plane is rotated to a plane parallel to the xy-plane.
+     * * Passing the normal of a plane P into this method returns a matrix whose transpose rotates geometry in P
+     * to the xy-plane if P contains the origin, or to a plane parallel to the xy-plane if P does not contain the origin.
      * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/2PerpendicularVectorsTo1Vector
      */
     static createRigidHeadsUp(vectorA, axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.ZXY, result) {
@@ -233780,7 +233865,7 @@ class Point3dArrayCarrier extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE
     }
     /** Test if `index` is a valid index into the array. */
     isValidIndex(index) {
-        return index >= 0 && index < this.data.length;
+        return this.isIndexValid(index);
     }
     /**
      * Access by index, returning strongly typed Point3d
@@ -235043,10 +235128,10 @@ class Vector3d extends XYZ {
         return unitNormal ? unitNormal.crossProduct(this).plusScaled(unitNormal, unitNormal.dotProduct(this), result) : undefined;
     }
     /**
-     * Return a vector computed at fractional position between this vector and vectorB
-     * @param fraction fractional position.  0 is at `this`.  1 is at `vectorB`.
-     *                 True fractions are "between", negatives are "before this", beyond 1 is "beyond vectorB".
-     * @param vectorB second vector
+     * Return a vector computed at fractional position between this vector and vectorB.
+     * @param fraction fractional position. 0 is at `this`. 1 is at `vectorB`. True fractions are "between",
+     * negatives are "before this", beyond 1 is "beyond vectorB".
+     * @param vectorB second vector.
      * @param result optional preallocated result.
      */
     interpolate(fraction, vectorB, result) {
@@ -238953,6 +239038,7 @@ class PolylineOps {
      * * This is a local search, with a single pass over the data.
      * @param source input points
      * @param maxEdgeLength
+     * @see [[GrowableXYZArray.cloneCompressed]]
      */
     static compressShortEdges(source, maxEdgeLength) {
         const dest = _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_2__.GrowableXYZArray.create(source);
@@ -239124,13 +239210,15 @@ class PolylineOps {
     }
     /** Create an array of planes.
      * * First plane has origin at first centerline point, with unit normal directed at the next point.
-     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors along the incoming and outgoing segments.
+     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors
+     *   along the incoming and outgoing segments.
      * * Last plane has origin at last centerline point, with unit normal directed from previous point.
      * * All sets of adjacent coincident points are reduced to a single point.
      *    * Hence the output array may have fewer points than the centerline.
-     * * If there are one or fewer distinct input points, the return is undefined
-     * @param centerline points to reside in output planes
-     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last output planes are averaged and equated (cloned).
+     * * If there are one or fewer distinct input points, the return is undefined.
+     * @param centerline points to reside in output planes.
+     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last
+     * output planes are averaged and equated (cloned).
      */
     static createBisectorPlanesForDistinctPoints(centerline, wrapIfPhysicallyClosed = false) {
         const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance); // double the tolerance to ensure normalized vectors exist.
@@ -253866,29 +253954,28 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "PolyfaceBuilder": () => (/* binding */ PolyfaceBuilder)
 /* harmony export */ });
+/* harmony import */ var _curve_Arc3d__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../curve/Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
 /* harmony import */ var _curve_ConstructCurveBetweenCurves__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ../curve/ConstructCurveBetweenCurves */ "../../core/geometry/lib/esm/curve/ConstructCurveBetweenCurves.js");
 /* harmony import */ var _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../curve/CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
 /* harmony import */ var _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ../curve/CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
 /* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
-/* harmony import */ var _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ../curve/GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
 /* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /* harmony import */ var _curve_Query_CylindricalRange__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../curve/Query/CylindricalRange */ "../../core/geometry/lib/esm/curve/Query/CylindricalRange.js");
 /* harmony import */ var _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ../curve/Query/StrokeCountChain */ "../../core/geometry/lib/esm/curve/Query/StrokeCountChain.js");
 /* harmony import */ var _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../curve/StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
+/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
 /* harmony import */ var _geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../geometry3d/BilinearPatch */ "../../core/geometry/lib/esm/geometry3d/BilinearPatch.js");
 /* harmony import */ var _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
 /* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
 /* harmony import */ var _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../geometry3d/GrowableFloat64Array */ "../../core/geometry/lib/esm/geometry3d/GrowableFloat64Array.js");
 /* harmony import */ var _geometry3d_GrowableXYArray__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ../geometry3d/GrowableXYArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYArray.js");
 /* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
-/* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
 /* harmony import */ var _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../geometry3d/Matrix3d */ "../../core/geometry/lib/esm/geometry3d/Matrix3d.js");
 /* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
 /* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
-/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
+/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
@@ -253901,15 +253988,17 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /* harmony import */ var _BoxTopology__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./BoxTopology */ "../../core/geometry/lib/esm/polyface/BoxTopology.js");
 /* harmony import */ var _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./GreedyTriangulationBetweenLineStrings */ "../../core/geometry/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js");
-/* harmony import */ var _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_38__ = __webpack_require__(/*! ./IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
-/* harmony import */ var _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
+/* harmony import */ var _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
+/* harmony import */ var _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
 /* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
-/* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
+/* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
-
+/** @packageDocumentation
+ * @module Polyface
+ */
 
 
 
@@ -255734,16 +255823,25 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         const context = _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_30__.GreedyTriangulationBetweenLineStrings.createContext();
         context.emitTriangles(resolveToIndexedXYZCollectionOrCarrier(pointsA), resolveToIndexedXYZCollectionOrCarrier(pointsB), (triangle) => { this.addTriangleFacet(triangle.points); });
     }
-    addMiteredPipesFromPoints(centerline, sectionData, numFacetAround = 12) {
+    /** Doc is same as `addMiteredPipes` doc. */
+    addMiteredPipesFromPoints(centerline, sectionData, numFacetAround = 12, capped = false) {
         const sections = _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_31__.CurveFactory.createMiteredPipeSections(centerline, sectionData);
         const pointA0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         const pointA1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         const pointB0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         const pointB1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+        const wantCaps = capped && (!(sectionData instanceof _curve_Arc3d__WEBPACK_IMPORTED_MODULE_32__.Arc3d) || sectionData.sweep.isFullCircle);
         if (numFacetAround < 3)
             numFacetAround = 3;
         const df = 1.0 / numFacetAround;
-        for (let i = 1; i < sections.length; i++) {
+        if (wantCaps) { // start cap facets
+            const startLineString = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d.create();
+            for (let i = 0; i < numFacetAround; i++)
+                startLineString.addPoint(sections[0].fractionToPoint(i * df));
+            this.addTrianglesInUncheckedConvexPolygon(startLineString, true);
+            this.endFace();
+        }
+        for (let i = 1; i < sections.length; i++) { // side facets
             const arcA = sections[i - 1];
             const arcB = sections[i];
             arcA.fractionToPoint(0.0, pointA0);
@@ -255752,38 +255850,44 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
                 const f = k * df;
                 arcA.fractionToPoint(f, pointA1);
                 arcB.fractionToPoint(f, pointB1);
-                this.addQuadFacet([pointA0, pointB0, pointB1, pointA1]);
+                this.addQuadFacet([pointA0, pointA1, pointB1, pointB0]); // ASSUME: CCW section traversal wrt rail tangent
             }
         }
+        if (wantCaps) { // end cap facets
+            const endLineString = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d.create();
+            for (let i = 0; i < numFacetAround; i++)
+                endLineString.addPoint(sections[sections.length - 1].fractionToPoint(i * df));
+            this.addTrianglesInUncheckedConvexPolygon(endLineString, false);
+            this.endFace();
+        }
     }
     /**
      * Add quad facets along a mitered pipe that follows a centerline curve.
+     * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive
+     * centerline segments.
      * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis
-     * lengths, or a full Arc3d:
-     *    * For semi-axis length input, x corresponds to an ellipse local axis nominally situated parallel to the xy-plane.
-     *    * For Arc3d input, the center is translated to the centerline start point to act as initial cross section.
-     * @param centerline centerline of pipe. If curved, it will be stroked using the builder's StrokeOptions.
-     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d.
+     * lengths, or an Arc3d:
+     *    * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the
+     * start tangent.
+     *    * For Arc3d input, the center is translated to the centerline start point, but otherwise the arc is used as-is
+     * for the first section. For best results, the arc should be perpendicular to the centerline start tangent.
+     * @param centerline centerline of pipe. If curved, it will be stroked using the builder's StrokeOptions, otherwise
+     * for best results, ensure no successive duplicate points with e.g., [[GrowableXYZArray.createCompressed]].
+     * @param sectionData circle radius, ellipse semi-axis lengths, or Arc3d.
      * @param numFacetAround how many equal parameter-space chords around each section.
-     */
-    addMiteredPipes(centerline, sectionData, numFacetAround = 12) {
-        if (Array.isArray(centerline)) {
-            this.addMiteredPipesFromPoints(new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_32__.Point3dArrayCarrier(centerline), sectionData, numFacetAround);
-        }
-        else if (centerline instanceof _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__.GrowableXYZArray) {
-            this.addMiteredPipesFromPoints(centerline, sectionData, numFacetAround);
-        }
-        else if (centerline instanceof _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_33__.IndexedXYZCollection) {
-            this.addMiteredPipesFromPoints(centerline, sectionData, numFacetAround);
-        }
-        else if (centerline instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d) {
-            this.addMiteredPipesFromPoints(centerline.packedPoints, sectionData, numFacetAround);
-        }
-        else if (centerline instanceof _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_34__.GeometryQuery) {
+     * @param capped if `true`, add a cap at each end of the pipe; defaults to `false`.
+     */
+    addMiteredPipes(centerline, sectionData, numFacetAround = 12, capped = false) {
+        if (Array.isArray(centerline))
+            centerline = new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_33__.Point3dArrayCarrier(centerline);
+        else if (centerline instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d)
+            centerline = centerline.packedPoints;
+        else if (centerline instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_19__.CurvePrimitive) {
             const linestring = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d.create();
             centerline.emitStrokes(linestring, this._options);
-            this.addMiteredPipesFromPoints(linestring.packedPoints, sectionData, numFacetAround);
+            centerline = linestring.packedPoints;
         }
+        this.addMiteredPipesFromPoints(centerline, sectionData, numFacetAround, capped);
     }
     /** Return the polyface index array indices corresponding to the given edge, or `undefined` if error. */
     getEdgeIndices(edge) {
@@ -255855,10 +255959,10 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      */
     addSweptIndexedPolyface(source, sweepVector, triangulateSides = false) {
         let isSimpleSweep = true;
-        const totalProjectedArea = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_35__.PolyfaceQuery.sumFacetAreas(source, sweepVector);
+        const totalProjectedArea = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.sumFacetAreas(source, sweepVector);
         if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(0.0, totalProjectedArea))
             isSimpleSweep = false;
-        const partitionedIndices = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_35__.PolyfaceQuery.partitionFacetIndicesByVisibilityVector(source, sweepVector, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_36__.Angle.createDegrees(1.0e-3));
+        const partitionedIndices = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.partitionFacetIndicesByVisibilityVector(source, sweepVector, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_35__.Angle.createDegrees(1.0e-3));
         const numForwardFacets = partitionedIndices[0].length;
         const numBackwardFacets = partitionedIndices[1].length;
         const numSideFacets = partitionedIndices[2].length;
@@ -255875,15 +255979,15 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         // collect base edges added to the builder, and extract boundary
         const numBaseFacets = firstSweptFacet - firstBaseFacet;
         const baseFacetIndices = Array.from({ length: numBaseFacets }, (_, i) => firstBaseFacet + i);
-        const baseFacetVisitor = _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_37__.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, baseFacetIndices, 1);
-        const baseEdges = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_35__.PolyfaceQuery.createIndexedEdges(baseFacetVisitor);
+        const baseFacetVisitor = _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_36__.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, baseFacetIndices, 1);
+        const baseEdges = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.createIndexedEdges(baseFacetVisitor);
         const baseBoundaryEdges = [];
         baseEdges.sortAndCollectClusters(undefined, baseBoundaryEdges, undefined, undefined);
         // add a side face per boundary edge
         const oldShouldTriangulate = this._options.shouldTriangulate;
         this._options.shouldTriangulate = triangulateSides;
         for (const edgeOrCluster of baseBoundaryEdges) {
-            if (edgeOrCluster instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_38__.SortableEdge)
+            if (edgeOrCluster instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_37__.SortableEdge)
                 this.addSweptFace(edgeOrCluster, numBaseFacets);
             else if (Array.isArray(edgeOrCluster))
                 for (const edge of edgeOrCluster)
@@ -255898,7 +256002,7 @@ PolyfaceBuilder._workVectorFindOrAdd = _geometry3d_Point3dVector3d__WEBPACK_IMPO
 PolyfaceBuilder._workUVFindOrAdd = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Point2d.create();
 function resolveToIndexedXYZCollectionOrCarrier(points) {
     if (Array.isArray(points))
-        return new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_32__.Point3dArrayCarrier(points);
+        return new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_33__.Point3dArrayCarrier(points);
     if (points instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d)
         return points.packedPoints;
     return points;
@@ -270496,7 +270600,7 @@ class Sample {
         }
         return result;
     }
-    /** Create various orders of non-rational B-spline curves with helical poles */
+    /** Create various orders of non-rational B-spline curves with helical poles. */
     static createBsplineCurveHelices(radius, height, numTurns, numSamplesPerTurn) {
         const pts = [];
         const zDelta = (height / numTurns) / numSamplesPerTurn;
@@ -272186,11 +272290,11 @@ class Sample {
         return result;
     }
     /**
-     * Create points on a sine wave
-     * Point i is origin + (i * xStep, a *sin(theta0 + i * dTheta), b * sin(beta0 + i * dBeta))
-     * * Default b is zero, so it is a simple sine wave
+     * Create points on a sine wave.
+     * * Point i is origin + (i * xStep, a *sin(theta0 + i * dTheta), b * sin(beta0 + i * dBeta)).
+     * * Default b is zero, so it is a simple sine wave.
      * * If the dTheta and dBeta are equal, it is a sine wave in a tilted plane.
-     * * If dTheta and dBeta are different it is a non-planar curve
+     * * If dTheta and dBeta are different it is a non-planar curve.
      */
     static createPointSineWave(origin, numInterval = 24, xStep = Math.PI / 12, a = 1, thetaSweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_0__.AngleSweep.createStartEndDegrees(0, 360), b = 0, betaSweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_0__.AngleSweep.createStartEndDegrees(0, 180)) {
         return this.createPointsByIndexFunctions(numInterval, SteppedIndexFunctionFactory.createLinear(xStep, origin ? origin.x : 0), SteppedIndexFunctionFactory.createCosine(a, thetaSweep, origin ? origin.y : 0), SteppedIndexFunctionFactory.createCosine(b, betaSweep, origin ? origin.z : 0));
@@ -304294,7 +304398,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.13",
+            applicationVersion: "5.0.0-dev.16",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -331940,7 +332044,7 @@ function __rewriteRelativeImportExtension(path, preserveJsx) {
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"5.0.0-dev.13","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 --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.13","@itwin/core-bentley":"workspace:^5.0.0-dev.13","@itwin/core-common":"workspace:^5.0.0-dev.13","@itwin/core-geometry":"workspace:^5.0.0-dev.13","@itwin/core-orbitgt":"workspace:^5.0.0-dev.13","@itwin/core-quantity":"workspace:^5.0.0-dev.13"},"//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.16","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 --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.16","@itwin/core-bentley":"workspace:^5.0.0-dev.16","@itwin/core-common":"workspace:^5.0.0-dev.16","@itwin/core-geometry":"workspace:^5.0.0-dev.16","@itwin/core-orbitgt":"workspace:^5.0.0-dev.16","@itwin/core-quantity":"workspace:^5.0.0-dev.16"},"//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"}}');
 
 /***/ }),