@itwin/rpcinterface-full-stack-tests 5.13.0-dev.3 → 5.13.0-dev.5

package/lib/dist/bundled-tests.js

@@ -227374,7 +227374,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_14__.CurvePrimitive
     }
     /**
      * Returns a (high accuracy) range of the curve between fractional positions.
-     * * Default implementation returns teh range of the curve from clonePartialCurve.
+     * * Default implementation returns the range of the curve from clonePartialCurve.
      */
     rangeBetweenFractions(fraction0, fraction1, transform) {
         const sweep = _geometry3d_AngleSweep__WEBPACK_IMPORTED_MODULE_3__.AngleSweep.createStartEndRadians(this.sweep.fractionToRadians(fraction0), this.sweep.fractionToRadians(fraction1));
@@ -230289,6 +230289,7 @@ class CurveFactory {
         const closureTolerance = haveBoolean ? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance : allowCuspOrOptions.closureTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
         const cuspTolerance = haveBoolean ? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance : allowCuspOrOptions.cuspTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
         const cuspSegments = haveBoolean ? true : allowCuspOrOptions.cuspSegments ?? true;
+        const simplifyPath = haveBoolean ? false : allowCuspOrOptions.simplifyPath ?? false;
         let n = points.length;
         if (filletClosure && points.almostEqualIndexIndex(0, n - 1, closureTolerance))
             n--; // ignore closure point
@@ -230362,7 +230363,16 @@ class CurveFactory {
                 this.addPartialSegment(path, cuspSegments, b0.point, b1.point, b0.fraction12, 1 - b1.fraction10);
             }
         }
-        return path;
+        if (!simplifyPath)
+            return path;
+        // remove tiny children, merge adjacent arcs
+        const distTol2 = closureTolerance * closureTolerance;
+        const sufficientlyLargeChildren = path.children.filter((c) => c.range().diagonalLengthSquared(true) >= distTol2);
+        if (sufficientlyLargeChildren.length === 0)
+            return undefined;
+        const simplerPath = _Path__WEBPACK_IMPORTED_MODULE_24__.Path.create(...sufficientlyLargeChildren);
+        _RegionOps__WEBPACK_IMPORTED_MODULE_25__.RegionOps.consolidateAdjacentPrimitives(simplerPath, { consolidateLoopSeam: true, duplicatePointTolerance: closureTolerance, colinearPointTolerance: closureTolerance });
+        return simplerPath;
     }
     /** If an open filletedLineString starts/ends with an arc, add a zero-length line segment to its start/end. */
     static validateOpenPathStartEnd(filletedLineString) {
@@ -233186,6 +233196,13 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_11__.CurveP
         }
         return this._point1.clone();
     }
+    /**
+     * Whether the start and end points are defined and within tolerance.
+     * * Always `false` for `LineSegment3d`.
+     */
+    isPhysicallyClosedCurve(_tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, _xyOnly = false) {
+        return false;
+    }
     /** Return the point and derivative vector at fractional position along the line segment. */
     fractionToPointAndDerivative(fraction, result) {
         result = result ? result : _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_6__.Ray3d.createZero();
@@ -233542,7 +233559,7 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_11__.CurveP
     }
     /**
      * Returns a (high accuracy) range of the curve between fractional positions
-     * * Default implementation returns teh range of the curve from clonePartialCurve
+     * * Default implementation returns the range of the curve from clonePartialCurve
      */
     rangeBetweenFractions(fraction0, fraction1, transform) {
         // (This is cheap -- don't bother testing for fraction0===fraction1)
@@ -236085,7 +236102,6 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _CurveFactory__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -236101,17 +236117,26 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-
 /**
- * * Implementation class for ConsolidateAdjacentCurvePrimitives.
+ * Implementation class for ConsolidateAdjacentCurvePrimitives.
  *
  * @internal
  */
 class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_1__.NullGeometryHandler {
-    _options;
+    _consolidateLinearGeometry;
+    _consolidateCompatibleArcs;
+    _consolidateLoopSeam;
+    _disableLinearCompression;
+    _duplicatePointTolerance;
+    _colinearPointTolerance;
     constructor(options) {
         super();
-        this._options = options ? options : new _RegionOps__WEBPACK_IMPORTED_MODULE_8__.ConsolidateAdjacentCurvePrimitivesOptions();
+        this._consolidateLinearGeometry = options?.consolidateLinearGeometry ?? true;
+        this._consolidateCompatibleArcs = options?.consolidateCompatibleArcs ?? true;
+        this._consolidateLoopSeam = options?.consolidateLoopSeam ?? false;
+        this._disableLinearCompression = options?.disableLinearCompression ?? false;
+        this._duplicatePointTolerance = options?.duplicatePointTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance;
+        this._colinearPointTolerance = options?.colinearPointTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance;
     }
     /** look for adjacent compatible primitives in a path or loop. */
     handleCurveChain(g) {
@@ -236123,7 +236148,7 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
         // numAccept is the number of children accepted (contiguously at front of children)
         for (let i0 = 0; i0 < numOriginal;) {
             const basePrimitive = g.children[i0];
-            if (this._options.consolidateLinearGeometry && (basePrimitive instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d || basePrimitive instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d)) {
+            if (this._consolidateLinearGeometry && (basePrimitive instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d || basePrimitive instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d)) {
                 points.length = 0;
                 let i1 = i0;
                 // on exit, i1 is beyond the block of linear primitives  . ..
@@ -236146,16 +236171,16 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                 if (points.length <= 1) {
                     g.children[numAccept++] = basePrimitive;
                 }
-                else if (this._options.disableLinearCompression) {
+                else if (this._disableLinearCompression) {
                     const pointsDeduped = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_3__.PolylineOps.compressShortEdges(points, _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallFloatingPoint); // remove only exact duplicate interior points
                     g.children[numAccept++] = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.createPoints(pointsDeduped);
                 }
                 else { // compress points
-                    const compressedPointsA = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_3__.PolylineOps.compressShortEdges(points, this._options.duplicatePointTolerance);
-                    const compressedPointsB = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_3__.PolylineOps.compressByChordError(compressedPointsA, this._options.colinearPointTolerance, true);
-                    if (i0 === 0 && i1 === numOriginal && this._options.consolidateLoopSeam) {
+                    const compressedPointsA = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_3__.PolylineOps.compressShortEdges(points, this._duplicatePointTolerance);
+                    const compressedPointsB = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_3__.PolylineOps.compressByChordError(compressedPointsA, this._colinearPointTolerance, true);
+                    if (i0 === 0 && i1 === numOriginal && this._consolidateLoopSeam) {
                         // points is the entire curve: if the curve is physically closed and end segments are colinear, re/move the seam
-                        _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_2__.PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._options.duplicatePointTolerance, this._options.colinearPointTolerance);
+                        _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_2__.PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._duplicatePointTolerance, this._colinearPointTolerance);
                     }
                     if (compressedPointsB.length < 2) {
                         // Collapsed to a point?  Make a single point linestring
@@ -236170,14 +236195,14 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                 }
                 i0 = i1;
             }
-            else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_4__.Arc3d) {
+            else if (this._consolidateCompatibleArcs && basePrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_4__.Arc3d) {
                 // subsume subsequent arcs into basePrimitive.
                 // always accept base primitive.
                 for (; ++i0 < g.children.length;) {
                     const nextPrimitive = g.children[i0];
                     if (!(nextPrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_4__.Arc3d))
                         break;
-                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_5__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive, false, this._options.duplicatePointTolerance))
+                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_5__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive, false, this._duplicatePointTolerance))
                         break;
                 }
                 // i0 has already advanced
@@ -236195,11 +236220,11 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
     }
     handleLoop(g) {
         this.handleCurveChain(g);
-        if (g.children.length > 1 && this._options.consolidateLoopSeam) {
+        if (g.children.length > 1 && this._consolidateLoopSeam) {
             const lastChild = g.children[g.children.length - 1];
             const firstChild = g.children[0];
             if ((lastChild instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d || lastChild instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) && (firstChild instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d || firstChild instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d)) {
-                if (this._options.consolidateLinearGeometry && !this._options.disableLinearCompression) {
+                if (this._consolidateLinearGeometry && !this._disableLinearCompression) {
                     const lastPoints = lastChild.points;
                     lastPoints.pop(); // the original start point survives as an interior point in the new first primitive
                     g.children[0] = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.createPoints([...lastPoints, ...firstChild.points]);
@@ -236207,8 +236232,8 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                 }
             }
             else if (lastChild instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_4__.Arc3d && firstChild instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_4__.Arc3d) {
-                if (this._options.consolidateCompatibleArcs) {
-                    if (_CurveFactory__WEBPACK_IMPORTED_MODULE_5__.CurveFactory.appendToArcInPlace(lastChild, firstChild, false, this._options.duplicatePointTolerance)) {
+                if (this._consolidateCompatibleArcs) {
+                    if (_CurveFactory__WEBPACK_IMPORTED_MODULE_5__.CurveFactory.appendToArcInPlace(lastChild, firstChild, false, this._duplicatePointTolerance)) {
                         g.children[0] = lastChild;
                         g.children.pop();
                     }
@@ -236911,9 +236936,7 @@ class PlanarSubdivision {
         else
             face.announceEdgesInFace(addEdgeCurve);
         if (consolidate) {
-            const consolidateOptions = new _RegionOps__WEBPACK_IMPORTED_MODULE_12__.ConsolidateAdjacentCurvePrimitivesOptions();
-            consolidateOptions.consolidateLoopSeam = true;
-            _RegionOps__WEBPACK_IMPORTED_MODULE_12__.RegionOps.consolidateAdjacentPrimitives(loop, consolidateOptions);
+            _RegionOps__WEBPACK_IMPORTED_MODULE_12__.RegionOps.consolidateAdjacentPrimitives(loop, { consolidateLoopSeam: true });
         }
         if (loop.isPhysicallyClosedCurve(options?.closureTol, true))
             return loop;
@@ -237939,7 +237962,8 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /**
- * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @deprecated in 5.11.13 - might be removed in next major version. Use [[ConsolidateAdjacentPrimitivesOptions]], which is more convenient as an interface, and has better name.
  * @public
  */
 class ConsolidateAdjacentCurvePrimitivesOptions {
@@ -242430,14 +242454,136 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             this.computeSegmentSegment3D(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed);
         }
     }
-    // Caller accesses data from a linestring or segment and passes it here.
-    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
-    // The fraction and extend parameters allow all combinations to be passed in.
-    dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
+    /** Implementation of dispatchSegmentArc under affine transform. KEEP IN SYNC WITH computeSegmentArcHomogeneous. */
+    computeSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
         const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
         const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
         const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const recordIfNearIntersection = (fA, fB, d2) => {
+            if (!_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(d2, tol2))
+                return false;
+            this.recordPointWithLocalFractions(fA, cpA, fractionA0, fractionA1, fB, arc, 0, 1, reversed);
+            return true;
+        };
+        const data = arc.toTransformedVectors(this._worldToLocalAffine);
+        let pointA0Local = pointA0;
+        let pointA1Local = pointA1;
+        const pointB0Local = arc.startPoint();
+        const pointB1Local = arc.endPoint();
+        if (this._worldToLocalAffine) {
+            pointA0Local = this._worldToLocalAffine.multiplyPoint3d(pointA0);
+            pointA1Local = this._worldToLocalAffine.multiplyPoint3d(pointA1);
+            this._worldToLocalAffine.multiplyXYAndZInPlace(pointB0Local);
+            this._worldToLocalAffine.multiplyXYAndZInPlace(pointB1Local);
+        }
+        const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1);
+        const beta = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0);
+        const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0);
+        // note really tight tol for tangency since below we check closest approach also
+        let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_11__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians, tol2);
+        const closeApproach = (0 === numRoots);
+        if (closeApproach)
+            numRoots = 1; // we returned the closest approach instead: first entry is the arc point, which is all we need
+        const roots = [];
+        for (let i = 0; i < numRoots; i++) {
+            const arcPt = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
+            const fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0); // exterior fraction sign based on extend flags
+            const fArcNearest01 = data.sweep.fractionToSignedPeriodicFraction(fArc, undefined); // exterior fraction sign based on proximity to 0/1
+            const fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_12__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPt);
+            if (fLine !== undefined) {
+                const linePt = pointA0Local.interpolate(fLine, pointA1Local);
+                roots.push({ fArc, fArcNearest01, fLine, arcPt, linePt });
+            }
+        }
+        // range-test and record roots
+        for (const root of roots) {
+            const { fArc, fArcNearest01, fLine, arcPt, linePt } = root;
+            if (closeApproach && !_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(arcPt.distanceSquaredXY(linePt), tol2)) {
+                continue;
+            }
+            if (this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1)) {
+                this.recordPointWithLocalFractions(fLine, cpA, fractionA0, fractionA1, fArc, arc, 0, 1, reversed);
+                continue;
+            }
+            // since line-arc chains are so common, look for near-endpoint intersections using distance tol, which is often relatively looser than fraction tol
+            const inArcRange = extendB0 || extendB1 || _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fArc);
+            const inLineRange = (extendA0 && fLine < 0) || (extendA1 && fLine > 1) || _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fLine);
+            let accepted = false;
+            if (inArcRange && !inLineRange) // check tangency near line endpoint
+                accepted = recordIfNearIntersection(fLine < 0 ? 0 : 1, fArc, (fLine < 0 ? pointA0Local : pointA1Local).distanceSquaredXY(arcPt));
+            else if (!inArcRange && inLineRange) // check tangency near arc endpoint
+                accepted = recordIfNearIntersection(fLine, fArcNearest01 < 0 ? 0 : 1, linePt.distanceSquaredXY(fArcNearest01 < 0 ? pointB0Local : pointB1Local));
+            if (!accepted) // check intersection between nearest endpoints
+                recordIfNearIntersection(fLine < 0.5 ? 0 : 1, fArcNearest01 < 0.5 ? 0 : 1, (fLine < 0.5 ? pointA0Local : pointA1Local).distanceSquaredXY(fArcNearest01 < 0.5 ? pointB0Local : pointB1Local));
+        }
+    }
+    /** Implementation of dispatchSegmentArc under perspective transform. KEEP IN SYNC WITH computeSegmentArc. */
+    computeSegmentArcHomogeneous(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
+        if (!this._worldToLocalPerspective)
+            return;
+        const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
+        const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const recordIfNearIntersection = (fA, fB, d2) => {
+            if (d2 === undefined || !_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(d2, tol2))
+                return false;
+            this.recordPointWithLocalFractions(fA, cpA, fractionA0, fractionA1, fB, arc, 0, 1, reversed);
+            return true;
+        };
+        const data = arc.toTransformedPoint4d(this._worldToLocalPerspective);
+        const pointA0H = this._worldToLocalPerspective.multiplyPoint3d(pointA0, 1);
+        const pointA1H = this._worldToLocalPerspective.multiplyPoint3d(pointA1, 1);
+        const pointB0H = this._worldToLocalPerspective.multiplyPoint3d(arc.startPoint(), 1);
+        const pointB1H = this._worldToLocalPerspective.multiplyPoint3d(arc.endPoint(), 1);
+        const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.center);
+        const beta = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector0);
+        const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector90);
+        // note really tight tol for tangency since below we check closest approach also
+        let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_11__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians, tol2);
+        const closeApproach = (0 === numRoots);
+        if (closeApproach)
+            numRoots = 1; // we returned the closest approach instead: first entry is the arc point, which is all we need
+        const roots = [];
+        for (let i = 0; i < numRoots; i++) {
+            const arcPt = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
+            const fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0); // exterior fraction sign based on extend flags
+            const fArcNearest01 = data.sweep.fractionToSignedPeriodicFraction(fArc, undefined); // exterior fraction sign based on proximity to 0/1
+            const fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_12__.SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPt);
+            if (fLine !== undefined) {
+                const linePt = pointA0H.interpolate(fLine, pointA1H);
+                roots.push({ fArc, fArcNearest01, fLine, arcPt, linePt });
+            }
+        }
+        // range-test and record roots
+        for (const root of roots) {
+            const { fArc, fArcNearest01, fLine, arcPt, linePt } = root;
+            if (closeApproach) {
+                const dist2 = arcPt.realDistanceSquaredXY(linePt);
+                if (dist2 === undefined || !_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(dist2, tol2))
+                    continue;
+            }
+            if (this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1)) {
+                this.recordPointWithLocalFractions(fLine, cpA, fractionA0, fractionA1, fArc, arc, 0, 1, reversed);
+                continue;
+            }
+            // since line-arc chains are so common, look for near-endpoint intersections using distance tol, which is often relatively looser than fraction tol
+            const inArcRange = extendB0 || extendB1 || _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fArc);
+            const inLineRange = (extendA0 && fLine < 0) || (extendA1 && fLine > 1) || _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isIn01(fLine);
+            let accepted = false;
+            if (inArcRange && !inLineRange) // check tangency near line endpoint
+                accepted = recordIfNearIntersection(fLine < 0 ? 0 : 1, fArc, (fLine < 0 ? pointA0H : pointA1H).realDistanceSquaredXY(arcPt));
+            else if (!inArcRange && inLineRange) // check tangency near arc endpoint
+                accepted = recordIfNearIntersection(fLine, fArcNearest01 < 0 ? 0 : 1, linePt.realDistanceSquaredXY(fArcNearest01 < 0 ? pointB0H : pointB1H));
+            if (!accepted) // check intersection between nearest endpoints
+                recordIfNearIntersection(fLine < 0.5 ? 0 : 1, fArcNearest01 < 0.5 ? 0 : 1, (fLine < 0.5 ? pointA0H : pointA1H).realDistanceSquaredXY(fArcNearest01 < 0.5 ? pointB0H : pointB1H));
+        }
+    }
+    // Caller accesses data from a linestring or segment and passes it here.
+    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
+    // The fraction and extend parameters allow all combinations to be passed in.
+    dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         // Arc:  X(theta) = C + cos(theta)·U + sin(theta)·V
         // Line:  contains points A0,A1
         // Arc point X is colinear (intersects) with line if det(A0, A1, X) = 0 with homogeneous xyw points and vectors
@@ -242446,107 +242592,10 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         // or
         // alpha + beta cos(theta) + gamma sin(theta) = 0
         // solve for theta; evaluate points; project back to line
-        if (this._worldToLocalPerspective) {
-            const data = arc.toTransformedPoint4d(this._worldToLocalPerspective);
-            const pointA0H = this._worldToLocalPerspective.multiplyPoint3d(pointA0, 1);
-            const pointA1H = this._worldToLocalPerspective.multiplyPoint3d(pointA1, 1);
-            const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.center);
-            const beta = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector0);
-            const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector90);
-            let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_11__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians, tol2);
-            const closeApproach = (0 === numRoots);
-            if (closeApproach)
-                numRoots = 1; // arc closest approach is the first entry
-            let numAccepted = 0;
-            for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                const fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_12__.SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPoint);
-                if (fLine === undefined)
-                    continue;
-                if (closeApproach) {
-                    const linePoint = pointA0H.interpolate(fLine, pointA1H);
-                    const dist2 = arcPoint.realDistanceSquaredXY(linePoint);
-                    if (dist2 === undefined || !_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(dist2, tol2))
-                        continue;
-                }
-                if (this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1)) {
-                    this.recordPointWithLocalFractions(fLine, cpA, fractionA0, fractionA1, fArc, arc, 0, 1, reversed);
-                    numAccepted++;
-                }
-            }
-            if (numAccepted === 0 && !arc.sweep.isFullCircle) {
-                // check for endpoint intersection beyond parametric tolerance but within point tolerance
-                const pointB0H = this._worldToLocalPerspective.multiplyPoint3d(arc.startPoint(), 1);
-                const pointB1H = this._worldToLocalPerspective.multiplyPoint3d(arc.endPoint(), 1);
-                const dist2 = [];
-                let d2 = pointA0H.realDistanceSquaredXY(pointB0H);
-                if (d2 !== undefined)
-                    dist2.push({ d2, fA: 0, fB: 0 });
-                d2 = pointA0H.realDistanceSquaredXY(pointB1H);
-                if (d2 !== undefined)
-                    dist2.push({ d2, fA: 0, fB: 1 });
-                d2 = pointA1H.realDistanceSquaredXY(pointB0H);
-                if (d2 !== undefined)
-                    dist2.push({ d2, fA: 1, fB: 0 });
-                d2 = pointA1H.realDistanceSquaredXY(pointB1H);
-                if (d2 !== undefined)
-                    dist2.push({ d2, fA: 1, fB: 1 });
-                dist2.sort((a, b) => a.d2 - b.d2);
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(dist2[0].d2, tol2))
-                    this.recordPointWithLocalFractions(dist2[0].fA, cpA, fractionA0, fractionA1, dist2[0].fB, arc, 0, 1, reversed);
-            }
-        }
-        else {
-            const data = arc.toTransformedVectors(this._worldToLocalAffine);
-            let pointA0Local = pointA0;
-            let pointA1Local = pointA1;
-            if (this._worldToLocalAffine) {
-                pointA0Local = this._worldToLocalAffine.multiplyPoint3d(pointA0);
-                pointA1Local = this._worldToLocalAffine.multiplyPoint3d(pointA1);
-            }
-            const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1);
-            const beta = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0);
-            const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0);
-            let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_11__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians, tol2);
-            const closeApproach = (0 === numRoots);
-            if (closeApproach)
-                numRoots = 1; // arc closest approach is the first entry
-            let numAccepted = 0;
-            for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                const fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_12__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
-                if (fLine === undefined)
-                    continue;
-                if (closeApproach) {
-                    const linePoint = pointA0Local.interpolate(fLine, pointA1Local);
-                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(arcPoint.distanceSquaredXY(linePoint), tol2))
-                        continue;
-                }
-                if (this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1)) {
-                    this.recordPointWithLocalFractions(fLine, cpA, fractionA0, fractionA1, fArc, arc, 0, 1, reversed);
-                    numAccepted++;
-                }
-            }
-            if (numAccepted === 0 && !arc.sweep.isFullCircle) {
-                // check for endpoint intersection beyond parametric tolerance but within point tolerance
-                const pointB0Local = arc.startPoint();
-                const pointB1Local = arc.endPoint();
-                if (this._worldToLocalAffine) {
-                    this._worldToLocalAffine.multiplyXYAndZInPlace(pointB0Local);
-                    this._worldToLocalAffine.multiplyXYAndZInPlace(pointB1Local);
-                }
-                const dist2 = [];
-                dist2.push({ d2: pointA0Local.distanceSquaredXY(pointB0Local), fA: 0, fB: 0 });
-                dist2.push({ d2: pointA0Local.distanceSquaredXY(pointB1Local), fA: 0, fB: 1 });
-                dist2.push({ d2: pointA1Local.distanceSquaredXY(pointB0Local), fA: 1, fB: 0 });
-                dist2.push({ d2: pointA1Local.distanceSquaredXY(pointB1Local), fA: 1, fB: 1 });
-                dist2.sort((a, b) => a.d2 - b.d2);
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isDistanceWithinTol(dist2[0].d2, tol2))
-                    this.recordPointWithLocalFractions(dist2[0].fA, cpA, fractionA0, fractionA1, dist2[0].fB, arc, 0, 1, reversed);
-            }
-        }
+        if (this._worldToLocalPerspective)
+            this.computeSegmentArcHomogeneous(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed);
+        else
+            this.computeSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed);
     }
     /**
      * Compute the intersection of two xy-arcs.
@@ -243042,7 +243091,8 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             let converged = newtonSearcher.runIterations();
             const fractionA = newtonSearcher.getU();
             const fractionB = newtonSearcher.getV();
-            if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(false, fractionB, false)) {
+            // note looser tol for spiral, which can have high order tangency at start/end
+            if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(false, fractionB, false, _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallFraction)) {
                 const pointA = curveA.fractionToPoint(fractionA, CurveCurveIntersectXY._workPointA0);
                 const pointB = spiralB.fractionToPoint(fractionB, CurveCurveIntersectXY._workPointB0);
                 if (!converged) // Newton may have found close points even if it didn't converge parametrically
@@ -251560,6 +251610,13 @@ class TransitionSpiral3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_4__.Cu
     get spiralType() {
         return this._spiralType;
     }
+    /**
+     * Whether the start and end points are defined and within tolerance.
+     * * Always `false` for `TransitionSpiral3d`.
+     */
+    isPhysicallyClosedCurve(_tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance, _xyOnly = false) {
+        return false;
+    }
     /** Return 1/r with convention that exact zero input returns 0 (straight line, zero curvature, infinite radius). */
     static radiusToCurvature(radius) {
         return (radius === 0.0) ? 0.0 : 1.0 / radius;
@@ -252679,7 +252736,7 @@ class AngleSweep {
      * @param toNegativeFraction exterior fraction handling:
      * * if true, return `fraction` period-shifted to within one period of the start
      * * if false, return `fraction` period-shifted to within one period of the end
-     * * if undefined, return the period-shift of `fraction` closest to [0,1].
+     * * if undefined, return the period-shift of `fraction` closest in fraction space to [0,1].
      * @returns period-shifted fraction. If `fraction` is already in [0,1], or the sweep is empty, then `fraction` is
      * returned unchanged.
      */
@@ -252711,7 +252768,7 @@ class AngleSweep {
      * @param toNegativeFraction exterior fraction handling:
      * * if true, return `fraction` period-shifted to within one period of the start
      * * if false, return `fraction` period-shifted to within one period of the end
-     * * if undefined, return the period-shift of `fraction` closest to [0,1].
+     * * if undefined, return the period-shift of `fraction` closest in fraction space to [0,1].
      * @returns period-shifted fraction. If `fraction` is already in [0,1], or the sweep is empty, then `fraction` is
      * returned unchanged.
      */
@@ -270504,6 +270561,14 @@ class Range3d extends RangeBase {
     diagonal(result) {
         return this.low.vectorTo(this.high, result);
     }
+    /** Return the length of the range diagonal, optionally ignoring z extent. */
+    diagonalLength(ignoreZ = false) {
+        return ignoreZ ? this.low.distanceXY(this.high) : this.low.distance(this.high);
+    }
+    /** Return the squared length of the range diagonal, optionally ignoring z extent. */
+    diagonalLengthSquared(ignoreZ = false) {
+        return ignoreZ ? this.low.distanceSquaredXY(this.high) : this.low.distanceSquared(this.high);
+    }
     /**
      * Return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very
      * large negative coordinates.
@@ -271557,6 +271622,14 @@ class Range2d extends RangeBase {
     diagonal(result) {
         return this.low.vectorTo(this.high, result);
     }
+    /** Return the length of the range diagonal. */
+    diagonalLength() {
+        return this.low.distance(this.high);
+    }
+    /** Return the squared length of the range diagonal. */
+    diagonalLengthSquared() {
+        return this.low.distanceSquared(this.high);
+    }
     /**
      * Return the point at the specified fraction along the diagonal vector. There is no check for isNull -- if the
      * range isNull(), the vector will have very large negative coordinates.
@@ -342228,7 +342301,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.13.0-dev.3",
+            applicationVersion: "5.13.0-dev.5",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.serviceAuthToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -367065,7 +367138,7 @@ var loadLanguages = instance.loadLanguages;
 (module) {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.13.0-dev.3","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 && npm run -s copy:draco","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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","copy:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./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 && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","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","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","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","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:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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":{"@bentley/aec-units-schema":"^1.0.3","@bentley/formats-schema":"^1.0.0","@bentley/units-schema":"^1.0.10","@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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"^3.0.4","@itwin/eslint-plugin":"^6.0.0","@types/chai-as-promised":"^7","@types/draco3d":"^1.4.10","@types/node":"~20.17.0","@types/sinon":"^17.0.2","@vitest/browser-playwright":"^4.1.10","@vitest/coverage-v8":"^4.1.10","cpx2":"^8.0.0","eslint":"^9.31.0","glob":"^13.0.6","playwright":"~1.56.1","rimraf":"^6.0.1","sinon":"^17.0.2","source-map-loader":"^5.0.0","typescript":"~5.6.2","vitest":"^4.1.10","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"2.2.0","webpack":"^5.97.1"},"//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/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"~4.3.4","@loaders.gl/draco":"~4.3.4","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
+module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.13.0-dev.5","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s build:workers && npm run -s copy:draco","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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:draco":"cpx \\"./node_modules/@loaders.gl/draco/dist/libs/*\\" ./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 && npm run -s extract","extract":"betools extract --fileExt=ts --extractFrom=./src/test/example-code --recursive --out=../../generated-docs/extract","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","lint-deprecation":"eslint --fix -f visualstudio --no-inline-config -c ../../common/config/eslint/eslint.config.deprecation-policy.js \\"./src/**/*.ts\\"","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run build:test-worker && vitest --run","cover":"npm run build:test-worker && vitest --run","build:test-worker":"vite build --config ./src/test/worker/vite.config.mts 1>&2","build:workers":"rimraf lib/workers/webpack && vite build --config ./src/workers/ImdlParser/vite.config.mts 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:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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":{"@bentley/aec-units-schema":"^1.0.3","@bentley/formats-schema":"^1.0.0","@bentley/units-schema":"^1.0.10","@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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/object-storage-core":"^3.0.4","@itwin/eslint-plugin":"^6.0.0","@types/chai-as-promised":"^7","@types/draco3d":"^1.4.10","@types/node":"~20.17.0","@types/sinon":"^17.0.2","@vitest/browser-playwright":"^4.1.10","@vitest/coverage-v8":"^4.1.10","cpx2":"^8.0.0","eslint":"^9.31.0","playwright":"~1.56.1","rimraf":"^6.0.1","sinon":"^17.0.2","typescript":"~5.6.2","vite":"^6.4.3","vitest":"^4.1.10","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"2.2.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/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"~4.3.4","@loaders.gl/draco":"~4.3.4","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
 
 /***/ },