@itwin/rpcinterface-full-stack-tests 5.3.0-dev.5 → 5.3.0-dev.7

package/lib/dist/bundled-tests.js

@@ -230680,16 +230680,14 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     }
     /** Return the (signed) area between (a fractional portion of) the arc and the chord between those points. */
     areaToChordXY(fraction0, fraction1) {
-        let detJ = _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.crossProductXYXY(this._matrix.coffs[0], this._matrix.coffs[3], this._matrix.coffs[1], this._matrix.coffs[4]);
-        // areas in arc of unit circle with radians limits
+        const detJ = _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.crossProductXYXY(this._matrix.coffs[0], this._matrix.coffs[3], this._matrix.coffs[1], this._matrix.coffs[4]); // area scale factor from local to world
         const radians0 = this._sweep.fractionToRadians(fraction0);
         const radians1 = this._sweep.fractionToRadians(fraction1);
-        // const midRadians = 0.5 * (radians0 + radians1);
-        const alpha = 0.5 * (radians1 - radians0);
-        if (alpha < 0.0)
-            detJ = -detJ;
+        const alpha = 0.5 * (radians1 - radians0); // signed area of local sector
+        // Compute signed area of local triangle ("wedge") formed by origin and arc endpoints p0, p1:
+        // (p0 x p1)/2 = (cos(r0)sin(r1)-cos(r1)sin(r0))/2 = sin(r1-r0)/2 = cos(a)sin(a)
         const wedgeArea = Math.cos(alpha) * Math.sin(alpha);
-        return (alpha - wedgeArea) * detJ;
+        return (alpha - wedgeArea) * detJ; // to world
     }
     /**
      * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).
@@ -234116,8 +234114,7 @@ class CurveOps {
     /**
      * Check whether or not the curves are planar, and if so, return a localToWorld frame.
      * @param curves input geometry: curves or points.
-     * @param tolerance optional maximum allowable planar deviation, default [[Geometry.smallMetricDistance]].
-     * @param result optional pre-allocated object to populate and return.
+     * @param options bundle of options.
      * @returns localToWorld frame `T` for coplanar curves, or undefined if they are not coplanar.
      * `T` satisfies:
      * * `T.origin` is in the plane.
@@ -234137,9 +234134,7 @@ class CurveOps {
      * Check whether or not the curves lie in a straight line, and if so, return a colinear ray.
      * * This test does not take curve traversal or point order into account.
      * @param curves input geometry: curves or points.
-     * @param xyOnly whether to ignore z-coordinates of input geometry.
-     * @param tolerance optional maximum allowable linear deviation, default [[Geometry.smallMetricDistance]].
-     * @param result optional pre-allocated object to populate and return.
+     * @param options bundle of options.
      * @returns ray colinear with input, or undefined if input is not colinear.
      */
     static isColinear(curves, options) {
@@ -238828,17 +238823,18 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ });
 /* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
+/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
 /* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
 /* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
 /* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
-/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
-/* harmony import */ var _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../RegionOpsClassificationSweeps */ "../../core/geometry/lib/esm/curve/RegionOpsClassificationSweeps.js");
+/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
+/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../RegionOpsClassificationSweeps */ "../../core/geometry/lib/esm/curve/RegionOpsClassificationSweeps.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -238856,9 +238852,29 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /** @packageDocumentation
  * @module Curve
  */
+function computeSortAngle(curve, fraction, reverse) {
+    const ray = curve.fractionToPointAndDerivative(fraction);
+    const s = reverse ? -1.0 : 1.0;
+    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
+}
+function getFractionOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA.fraction;
+    if (pair.detailB.curve === curve)
+        return pair.detailB.fraction;
+    return undefined;
+}
+function getDetailOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA;
+    if (pair.detailB.curve === curve)
+        return pair.detailB;
+    return undefined;
+}
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     primitiveToPair = new Map();
     // index assigned to this primitive (for debugging)
@@ -238921,8 +238937,11 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
  */
 class PlanarSubdivision {
     /**
-     * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
-     * Z-coordinates are ignored.
+     * Create a graph from curves and precomputed intersections.
+     * * Z-coordinates are ignored.
+     * @param primitives input curves
+     * @param allPairs array of curve-curve xy-intersections
+     * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         // map from key CurvePrimitive to CurveLocationDetailPair
@@ -238968,31 +238987,45 @@ class PlanarSubdivision {
         return graph;
     }
     /**
-     * Create a pair of mated half edges referencing an interval of a primitive.
-     * * no action if start and end points are identical.
+     * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
+     * * Different metrics are employed for expedience.
+    */
+    static isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance) {
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSmallRelative(fraction0 - fraction1))
+            return true;
+        if (!(p instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_3__.LineSegment3d)) {
+            const p0 = p.clonePartialCurve(fraction0, fraction1);
+            if (p0?.tryTransformInPlace(_geometry3d_Transform__WEBPACK_IMPORTED_MODULE_8__.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten
+                return p0.curveLength() <= mergeTolerance; // Euclidean
+        }
+        return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan
+    }
+    /**
+     * Create a pair of mated half edges referencing a non-trivial interval of a primitive.
      * @param graph containing graph
      * @param p the curve
      * @param point0 start point
      * @param fraction0 starting fraction
      * @param point1 end point
      * @param fraction1 end fraction
-     * @returns end point and fraction, or start point and fraction if no action
+     * @param mergeTolerance optional maximum xy-length of a trivial edge
+     * @returns end point and fraction
      */
     static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
-        if (point0.isAlmostEqualXY(point1, mergeTolerance))
-            return { point: point0, fraction: fraction0 };
-        const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
-        if (p.parent && p.parent instanceof _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_8__.RegionGroupMember && p.parent.parentGroup.groupOpType === _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_8__.RegionGroupOpType.NonBounding)
-            halfEdge.setMaskAroundEdge(_topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.BRIDGE_EDGE);
-        const detail01 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
-        const mate = halfEdge.edgeMate;
-        halfEdge.edgeTag = detail01;
-        halfEdge.sortData = 1.0;
-        mate.edgeTag = detail01;
-        mate.sortData = -1.0;
-        halfEdge.sortAngle = sortAngle(p, fraction0, false);
-        mate.sortAngle = sortAngle(p, fraction1, true);
-        return { point: point1, fraction: fraction1 };
+        if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {
+            const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+            if (p.parent && p.parent instanceof _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_9__.RegionGroupMember && p.parent.parentGroup.groupOpType === _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_9__.RegionGroupOpType.NonBounding)
+                halfEdge.setMaskAroundEdge(_topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.BRIDGE_EDGE);
+            const detail01 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
+            const mate = halfEdge.edgeMate;
+            halfEdge.edgeTag = detail01;
+            halfEdge.sortData = 1.0;
+            mate.edgeTag = detail01;
+            mate.sortData = -1.0;
+            halfEdge.sortAngle = computeSortAngle(p, fraction0, false);
+            mate.sortAngle = computeSortAngle(p, fraction1, true);
+        }
+        return { point: point1, fraction: fraction1 }; // where the next curve fragment starts
     }
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,
@@ -239002,7 +239035,7 @@ class PlanarSubdivision {
      * @returns the area (forced to zero if within tolerance)
      */
     static collectSignedLoop(loop, outLoops, zeroAreaTolerance = 1.0e-10, isSliverFace) {
-        let area = isSliverFace ? 0.0 : _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.computeXYArea(loop);
+        let area = isSliverFace ? 0.0 : _RegionOps__WEBPACK_IMPORTED_MODULE_10__.RegionOps.computeXYArea(loop);
         if (area === undefined)
             area = 0;
         if (Math.abs(area) < zeroAreaTolerance)
@@ -239028,32 +239061,31 @@ class PlanarSubdivision {
         return undefined;
     }
     /** Create the geometry for a topological edge. */
-    static createCurveInEdge(edge) {
+    static createCurveInEdge(edge, z) {
+        let result;
         const info = this.extractGeometryFromEdge(edge);
-        if (info) {
-            if (info.reversed)
-                return info.detail.curve.clonePartialCurve(info.detail.fraction1, info.detail.fraction);
-            return info.detail.curve.clonePartialCurve(info.detail.fraction, info.detail.fraction1);
+        if (info && info.detail.curve && info.detail.fraction1) {
+            const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;
+            const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;
+            result = info.detail.curve.clonePartialCurve(f0, f1);
+            if (result && z !== undefined)
+                result.tryTransformInPlace(_geometry3d_Transform__WEBPACK_IMPORTED_MODULE_8__.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));
         }
-        return undefined;
+        return result;
     }
     /**
      * Create a [[Loop]] for the given face or super face.
      * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
-     * @param announce optional callback invoked on each edge/curve of the face/Loop.
-     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
-     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
+     * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face, announce, compress = false, closureTol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
-        if (announce)
-            compress = false;
-        const loop = _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop.create();
-        const addEdgeCurve = (he) => {
-            const curve = this.createCurveInEdge(he);
+    static createLoopInFace(face, options) {
+        const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing
+        const loop = _Loop__WEBPACK_IMPORTED_MODULE_11__.Loop.create();
+        const addEdgeCurve = (edge) => {
+            const curve = this.createCurveInEdge(edge, options?.z);
             if (curve) {
-                announce?.(he, curve, loop);
+                options?.announceEdge?.(edge, curve, loop);
                 loop.tryAddChild(curve);
             }
         };
@@ -239061,12 +239093,12 @@ class PlanarSubdivision {
             face.forEach(addEdgeCurve);
         else
             face.announceEdgesInFace(addEdgeCurve);
-        if (compress) {
-            const options = new _RegionOps__WEBPACK_IMPORTED_MODULE_9__.ConsolidateAdjacentCurvePrimitivesOptions();
-            options.consolidateLoopSeam = true;
-            _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.consolidateAdjacentPrimitives(loop, options);
+        if (consolidate) {
+            const consolidateOptions = new _RegionOps__WEBPACK_IMPORTED_MODULE_10__.ConsolidateAdjacentCurvePrimitivesOptions();
+            consolidateOptions.consolidateLoopSeam = true;
+            _RegionOps__WEBPACK_IMPORTED_MODULE_10__.RegionOps.consolidateAdjacentPrimitives(loop, consolidateOptions);
         }
-        if (loop.isPhysicallyClosedCurve(closureTol, true))
+        if (loop.isPhysicallyClosedCurve(options?.closureTol, true))
             return loop;
         (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(() => false, "face is not physically closed");
         return undefined;
@@ -239075,17 +239107,19 @@ class PlanarSubdivision {
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
      * @param face a node in the face loop.
-     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
-     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
-     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed
+     * @param options bundle of options.
+     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face, bridgeMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.BRIDGE_EDGE, visitMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.VISITED, closureTol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+    static createLoopOrParityRegionInFace(face, options) {
         let region;
-        if (face.isSplitWasherFace(bridgeMask)) {
+        const visitMask = options?.visitMask ?? _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.VISITED;
+        const bridgeMask = options?.bridgeMask ?? _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.BRIDGE_EDGE;
+        let startBridgeEdge;
+        // is it a split-washer face?
+        if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {
             const loops = [];
             const loopEdges = [];
-            const bridgeStack = [face.findMaskAroundFace(bridgeMask, true)];
+            const bridgeStack = [startBridgeEdge];
             const announceEdge = (he) => { he.setMask(visitMask); loopEdges.push(he); };
             const announceBridge = (he) => { if (!he.isMaskSet(visitMask))
                 bridgeStack.push(he); };
@@ -239099,7 +239133,7 @@ class PlanarSubdivision {
                         continue;
                     loopEdges.length = 0;
                     if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {
-                        const loop = this.createLoopInFace(loopEdges, undefined, true, closureTol);
+                        const loop = this.createLoopInFace(loopEdges, options);
                         if (loop) {
                             loops.push(loop);
                             continue;
@@ -239107,13 +239141,13 @@ class PlanarSubdivision {
                     }
                 }
             }
-            region = _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.sortOuterAndHoleLoopsXY(loops);
-            region = _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.simplifyRegion(region);
+            region = _RegionOps__WEBPACK_IMPORTED_MODULE_10__.RegionOps.sortOuterAndHoleLoopsXY(loops);
+            region = _RegionOps__WEBPACK_IMPORTED_MODULE_10__.RegionOps.simplifyRegion(region);
         }
         else {
-            region = this.createLoopInFace(face, undefined, true, closureTol);
+            region = this.createLoopInFace(face, options);
         }
-        return (region && (region instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop || region instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_11__.ParityRegion)) ? region : undefined;
+        return (region && (region instanceof _Loop__WEBPACK_IMPORTED_MODULE_11__.Loop || region instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_12__.ParityRegion)) ? region : undefined;
     }
     /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     static isNullFace(he) {
@@ -239140,7 +239174,7 @@ class PlanarSubdivision {
         return e1;
     }
     static collectSignedLoopSetsInHalfEdgeGraph(graph, zeroAreaTolerance = 1.0e-10) {
-        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_12__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
+        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_13__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
         const result = [];
         const edgeMap = new Map();
         for (const faceSeeds of q) {
@@ -239148,24 +239182,23 @@ class PlanarSubdivision {
             const edges = [];
             for (const faceSeed of faceSeeds) {
                 const isNullFace = this.isNullFace(faceSeed);
-                const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
-                    if (!isNullFace) {
-                        const mate = this.getNonNullEdgeMate(graph, he);
-                        if (mate !== undefined) {
-                            const e = edgeMap.get(mate);
-                            if (e === undefined) {
-                                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
-                                const e1 = new _Loop__WEBPACK_IMPORTED_MODULE_10__.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
-                                edgeMap.set(he, e1);
-                            }
-                            else if (e instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.LoopCurveLoopCurve) {
-                                e.setB(loopC, curveC);
-                                edges.push(e);
-                                edgeMap.delete(mate);
-                            }
+                const announceEdge = isNullFace ? undefined : (he, curveC, loopC) => {
+                    const mate = this.getNonNullEdgeMate(graph, he);
+                    if (mate !== undefined) {
+                        const e = edgeMap.get(mate);
+                        if (e === undefined) {
+                            // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
+                            const e1 = new _Loop__WEBPACK_IMPORTED_MODULE_11__.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                            edgeMap.set(he, e1);
+                        }
+                        else if (e instanceof _Loop__WEBPACK_IMPORTED_MODULE_11__.LoopCurveLoopCurve) {
+                            e.setB(loopC, curveC);
+                            edges.push(e);
+                            edgeMap.delete(mate);
                         }
                     }
-                });
+                };
+                const loop = this.createLoopInFace(faceSeed, { announceEdge });
                 if (loop)
                     this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
             }
@@ -239176,25 +239209,6 @@ class PlanarSubdivision {
         return result;
     }
 }
-function sortAngle(curve, fraction, reverse) {
-    const ray = curve.fractionToPointAndDerivative(fraction);
-    const s = reverse ? -1.0 : 1.0;
-    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
-}
-function getFractionOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA.fraction;
-    if (pair.detailB.curve === curve)
-        return pair.detailB.fraction;
-    return undefined;
-}
-function getDetailOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA;
-    if (pair.detailB.curve === curve)
-        return pair.detailB;
-    return undefined;
-}
 
 
 /***/ }),
@@ -240020,7 +240034,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   RegionOps: () => (/* binding */ RegionOps)
 /* harmony export */ });
 /* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __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 _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
 /* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
 /* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
@@ -240032,7 +240046,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
 /* harmony import */ var _geometry3d_SortablePolygon__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ../geometry3d/SortablePolygon */ "../../core/geometry/lib/esm/geometry3d/SortablePolygon.js");
 /* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
-/* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
+/* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
 /* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
 /* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
 /* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
@@ -240057,7 +240071,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _Query_CurveSplitContext__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ./Query/CurveSplitContext */ "../../core/geometry/lib/esm/curve/Query/CurveSplitContext.js");
 /* harmony import */ var _Query_InOutTests__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ./Query/InOutTests */ "../../core/geometry/lib/esm/curve/Query/InOutTests.js");
 /* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
-/* harmony import */ var _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./RegionMomentsXY */ "../../core/geometry/lib/esm/curve/RegionMomentsXY.js");
+/* harmony import */ var _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./RegionMomentsXY */ "../../core/geometry/lib/esm/curve/RegionMomentsXY.js");
 /* harmony import */ var _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ./RegionOpsClassificationSweeps */ "../../core/geometry/lib/esm/curve/RegionOpsClassificationSweeps.js");
 /* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /*---------------------------------------------------------------------------------------------
@@ -240109,7 +240123,29 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /**
- * Enumeration of the binary operation types for a booleans among regions
+ * * Options to control method [[RegionOps.consolidateAdjacentPrimitives]].
+ * @public
+ */
+class ConsolidateAdjacentCurvePrimitivesOptions {
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
+    consolidateLinearGeometry = true;
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
+    consolidateCompatibleArcs = true;
+    /**
+     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
+     * allowing location of the seam to change.
+     */
+    consolidateLoopSeam = false;
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression = false;
+    /** Tolerance for detecting identical points. */
+    duplicatePointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
+    colinearPointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
+}
+/**
+ * Enumeration of the binary operation types for Boolean operations.
+ * @see [[RegionOps.regionBooleanXY]], [[RegionOps.polygonBooleanXYToLoops]], [[RegionOps.polygonBooleanXYToPolyface]].
  * @public
  */
 var RegionBinaryOpType;
@@ -240143,9 +240179,9 @@ class RegionOps {
      * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].
      */
     static computeXYAreaMoments(region) {
-        const handler = new _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_1__.RegionMomentsXY();
+        const handler = new _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_2__.RegionMomentsXY();
         const result = region.dispatchToGeometryHandler(handler);
-        if (result instanceof _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_2__.MomentData) {
+        if (result instanceof _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_3__.MomentData) {
             result.shiftOriginAndSumsToCentroidOfSums();
             return result;
         }
@@ -240156,9 +240192,13 @@ class RegionOps {
      * @param range range of planar region to tolerance.
      * @param distanceTolerance optional absolute distance tolerance.
     */
-    static computeXYAreaTolerance(range, distanceTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
-        // if A = bh and e is distance tolerance, then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), so A'-A = e/2(b+h+e/2).
-        const halfDistTol = 0.5 * distanceTolerance;
+    static computeXYAreaTolerance(range, distanceTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        // ensure the result is nonzero: we never want to report a zero-area loop as a signed-area loop
+        if (distanceTolerance === 0)
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallFloatingPoint * 10; // observed area 2e-15 computed for a zero-area loop
+        // If A = bh and e is distance tolerance, let A' be the region with b and h extended by half the tolerance.
+        // Then A' := (b+e/2)(h+e/2) = A + e/2(b+h+e/2), which motivates our area tol = A'-A = e/2(b+h+e/2).
+        const halfDistTol = 0.5 * Math.abs(distanceTolerance);
         return halfDistTol * (range.xLength() + range.yLength() + halfDistTol);
     }
     /**
@@ -240169,9 +240209,9 @@ class RegionOps {
      * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].
      */
     static computeXYArea(region) {
-        const handler = new _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_1__.RegionMomentsXY();
+        const handler = new _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_2__.RegionMomentsXY();
         const result = region.dispatchToGeometryHandler(handler);
-        if (result instanceof _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_2__.MomentData) {
+        if (result instanceof _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_3__.MomentData) {
             return result.quantitySum;
         }
         return undefined;
@@ -240373,7 +240413,7 @@ class RegionOps {
      * * Regions without children are removed.
      * * No Boolean operations are performed.
      * @param region region to simplify in place
-     * @returns reference to the updated input region
+     * @returns reference to the updated input region, or `undefined` if no children.
      * @see [[simplifyRegionType]]
      */
     static simplifyRegion(region) {
@@ -240398,6 +240438,14 @@ class RegionOps {
             return region.children.splice(0, 1)[0];
         return region;
     }
+    /**
+     * Helper method to sample a z-coordinate from the input region(s).
+     * * The assumption is that the input is horizontal.
+     */
+    static getZCoordinate(xyRegion) {
+        const localToWorld = _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_5__.FrameBuilder.createRightHandedFrame(undefined, xyRegion);
+        return localToWorld ? localToWorld.origin.z : 0;
+    }
     /**
      * Return areas defined by a boolean operation.
      * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
@@ -240408,18 +240456,30 @@ class RegionOps {
      * @param loopsA first set of loops (treated as a union)
      * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
-     * @param mergeTolerance absolute distance tolerance for merging loops
+     * @param mergeToleranceOrOptions absolute distance tolerance for merging loops, or multiple options settings. Default value is [[Geometry.smallMetricDistance]].
      * @returns a region resulting from merging input loops and the boolean operation.
      */
-    static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
-        const result = _UnionRegion__WEBPACK_IMPORTED_MODULE_14__.UnionRegion.create();
+    static regionBooleanXY(loopsA, loopsB, operation, mergeToleranceOrOptions = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        let mergeTolerance;
+        let simplifyUnion;
+        if (typeof mergeToleranceOrOptions === "number") {
+            mergeTolerance = mergeToleranceOrOptions;
+            simplifyUnion = false;
+        }
+        else {
+            mergeTolerance = mergeToleranceOrOptions.mergeTolerance ?? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
+            simplifyUnion = mergeToleranceOrOptions.simplifyUnion ?? false;
+        }
+        let result = _UnionRegion__WEBPACK_IMPORTED_MODULE_14__.UnionRegion.create();
         const context = _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionBooleanContext.create(_RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union, _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union);
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
+        const bridgeMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.BRIDGE_EDGE;
         const visitMask = context.graph.grabMask(false);
         const range = context.groupA.range().union(context.groupB.range());
         const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
-        const bridgeMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.BRIDGE_EDGE;
+        const z = RegionOps.getZCoordinate(operation === RegionBinaryOpType.BMinusA ? loopsB : loopsA);
+        const options = { compress: true, closureTol: mergeTolerance, bridgeMask, visitMask, z };
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -240427,12 +240487,20 @@ class RegionOps {
             if (Math.abs(area) < areaTol)
                 return;
             if (faceType === 1) {
-                const loopOrParityRegion = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask, mergeTolerance);
+                const loopOrParityRegion = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.createLoopOrParityRegionInFace(face, options);
                 if (loopOrParityRegion)
                     result.tryAddChild(loopOrParityRegion);
             }
         });
         context.graph.dropMask(visitMask);
+        if (simplifyUnion && operation === RegionBinaryOpType.Union) {
+            const signedLoops = RegionOps.constructAllXYRegionLoops(result);
+            if (signedLoops) {
+                const outerLoops = signedLoops.map((component) => component.negativeAreaLoops).flat();
+                if (outerLoops.length > 0)
+                    result = _UnionRegion__WEBPACK_IMPORTED_MODULE_14__.UnionRegion.create(...outerLoops);
+            }
+        }
         return this.simplifyRegion(result);
     }
     /**
@@ -240534,11 +240602,11 @@ class RegionOps {
         let maxGap = 0.0;
         let isPath = false;
         if (wrap)
-            maxGap = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));
+            maxGap = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.maxXY(maxGap, curves[0].startPoint().distance(curves[n - 1].endPoint()));
         for (let i = 0; i + 1 < n; i++)
-            maxGap = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));
+            maxGap = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.maxXY(maxGap, curves[i].endPoint().distance(curves[i + 1].startPoint()));
         let collection;
-        if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSmallMetricDistance(maxGap)) {
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSmallMetricDistance(maxGap)) {
             collection = wrap ? _Loop__WEBPACK_IMPORTED_MODULE_8__.Loop.create() : _Path__WEBPACK_IMPORTED_MODULE_24__.Path.create();
             isPath = true;
         }
@@ -240608,7 +240676,7 @@ class RegionOps {
      * @param gapTolerance distance to be treated as "effectively zero" when assembling fragments head-to-tail
      * @returns chains, possibly wrapped in a [[BagOfCurves]].
      */
-    static collectChains(fragments, gapTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
+    static collectChains(fragments, gapTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         return _CurveOps__WEBPACK_IMPORTED_MODULE_22__.CurveOps.collectChains(fragments, gapTolerance);
     }
     /**
@@ -240661,7 +240729,7 @@ class RegionOps {
         else if (data instanceof _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_10__.IndexedXYZCollection) {
             let dataToUse;
             if (requireClosurePoint && data.length === 5) {
-                if (!_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)))
+                if (!_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSmallMetricDistance(data.distanceIndexIndex(0, 4)))
                     return undefined;
                 dataToUse = data;
             }
@@ -240673,7 +240741,7 @@ class RegionOps {
             }
             else {
                 dataToUse = _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_18__.GrowableXYZArray.create(data);
-                _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_29__.PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance);
+                _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_29__.PolylineCompressionContext.compressInPlaceByShortEdgeLength(dataToUse, _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance);
                 if (dataToUse.length < (requireClosurePoint ? 5 : 4))
                     return undefined;
             }
@@ -240753,7 +240821,7 @@ class RegionOps {
      * * Physically closed input curves are each returned wrapped in a Loop to facilitate xy-algorithms,
      * but outside this limited context, these Loops only makes sense if they are planar.
     */
-    static collectRegionsAndClosedPrimitives(curves, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
+    static collectRegionsAndClosedPrimitives(curves, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         const regions = [];
         if (!Array.isArray(curves))
             curves = [curves];
@@ -240794,7 +240862,7 @@ class RegionOps {
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent
      * to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance, addBridges = true) {
+    static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, addBridges = true) {
         let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
         primitives = _internalContexts_TransferWithSplitArcs__WEBPACK_IMPORTED_MODULE_34__.TransferWithSplitArcs.clone(_CurveCollection__WEBPACK_IMPORTED_MODULE_25__.BagOfCurves.create(...primitives)).children;
         const range = this.curveArrayRange(primitives);
@@ -240802,13 +240870,15 @@ class RegionOps {
         if (addBridges) { // generate a temp graph to extract its bridge edges
             const context = _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionBooleanContext.create(_RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union, _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union);
             const regions = this.collectRegionsAndClosedPrimitives(curvesAndRegions, tolerance);
-            context.addMembers(regions, undefined);
-            context.annotateAndMergeCurvesInGraph(tolerance);
-            context.graph.announceEdges((_graph, edge) => {
-                if (edge.isMaskSet(_topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.BRIDGE_EDGE))
-                    primitives.push(_LineSegment3d__WEBPACK_IMPORTED_MODULE_35__.LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
-                return true;
-            });
+            if (regions.length > 0) {
+                context.addMembers(regions, undefined);
+                context.annotateAndMergeCurvesInGraph(tolerance);
+                context.graph.announceEdges((_graph, edge) => {
+                    if (edge.isMaskSet(_topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.BRIDGE_EDGE))
+                        primitives.push(_LineSegment3d__WEBPACK_IMPORTED_MODULE_35__.LineSegment3d.create(edge.getPoint3d(), edge.faceSuccessor.getPoint3d()));
+                    return true;
+                });
+            }
         }
         const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_36__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
         const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
@@ -241025,27 +241095,6 @@ function pushToInOnOutArrays(curve, select, arrayNegative, array0, arrayPositive
     else
         array0.push(curve);
 }
-/**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
- * @public
- */
-class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d. */
-    consolidateLinearGeometry = true;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
-    consolidateCompatibleArcs = true;
-    /**
-     * True to attempt consolidation of the first and last primitives of a [[Loop]] or physically closed linestring data,
-     * allowing location of the seam to change.
-     */
-    consolidateLoopSeam = false;
-    /** Disable LineSegment3d and LineString3d point compression. */
-    disableLinearCompression = false;
-    /** Tolerance for detecting identical points. */
-    duplicatePointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance;
-    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
-    colinearPointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance;
-}
 
 
 /***/ }),
@@ -241722,13 +241771,11 @@ class RegionBooleanContext {
         const nodeHasBeenVisitedMask = this.graph.grabMask();
         const componentArray = GraphComponentArray.create(this.graph);
         for (const component of componentArray.components) {
-            const exteriorHalfEdge = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_4__.HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);
-            if (exteriorHalfEdge) {
-                const exteriorMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_0__.HalfEdgeMask.EXTERIOR;
-                const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;
-                this.graph.clearMask(allMasksToClear);
-                RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);
-            }
+            const exteriorHalfEdge = component.faces[component.faceAreas.indexOf(Math.min(...component.faceAreas))];
+            const exteriorMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_0__.HalfEdgeMask.EXTERIOR;
+            const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;
+            this.graph.clearMask(allMasksToClear);
+            RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);
         }
         this.graph.dropMask(faceHasBeenVisitedMask);
         this.graph.dropMask(nodeHasBeenVisitedMask);
@@ -241901,8 +241948,10 @@ class GraphComponent {
             f.sumAroundFace(vertexFunction);
         }
         this.faceAreas.length = 0;
+        if (faceAreaFunction === faceAreaFromCurvedEdgeData && !this.faces.every((he) => he.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail))
+            faceAreaFunction = undefined; // prerequisite CurveLocationDetails are absent, fall through to default
         if (!faceAreaFunction)
-            faceAreaFunction = (node) => _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_4__.HalfEdgeGraphSearch.signedFaceArea(node);
+            faceAreaFunction = (node) => _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_4__.HalfEdgeGraphSearch.signedFaceArea(node); // polygon area
         for (const f of this.faces) {
             this.faceAreas.push(faceAreaFunction(f));
         }
@@ -244401,7 +244450,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
     // The fraction and extend parameters allow all combinations to be passed in.
     dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
-        let dist2;
+        const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
+        const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
+        const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
         // Arc: X = C + cU + sV
         // Line:  contains points A0,A1
         // Arc point colinear with line if det (A0, A1, X) = 0
@@ -244421,27 +244472,30 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.center);
             const beta = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector0);
             const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductPoint4dXYW(pointA0H, pointA1H, data.vector90);
-            const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_10__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
-            if (numRoots <= 0)
-                return;
+            let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_10__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
+            const closeApproach = (0 === numRoots);
+            if (closeApproach)
+                numRoots = 1; // we returned the arc's closest approach as the first "root"; if within tolerance and at endpoints, we record it
+            const acceptSolution = (iRoot, checkOnlyEndPointDistance = false) => {
+                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(iRoot), data.vector90, sines.atUncheckedIndex(iRoot));
+                let fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(iRoot), extendB0);
+                let fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_8__.SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPoint);
+                if (fLine === undefined)
+                    return undefined;
+                if (!checkOnlyEndPointDistance && this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1))
+                    return { fLine, fArc };
+                // check for an endpoint intersection that is beyond parametric tolerance but within point tolerance
+                fLine = fLine < 0.5 ? 0 : 1;
+                fArc = data.sweep.fractionToSignedPeriodicFraction(fArc) < 0.5 ? 0 : 1;
+                const pointAH = fLine ? pointA1H : pointA0H;
+                const pointBH = fArc ? pointB1H : pointB0H;
+                const dist2 = pointAH.realDistanceSquaredXY(pointBH);
+                return (dist2 !== undefined && _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isDistanceWithinTol(dist2, tol2)) ? { fLine, fArc } : undefined;
+            };
             for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                let arcFraction = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const lineFraction = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_8__.SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, arcPoint);
-                if (lineFraction !== undefined) {
-                    if (this.acceptFraction(extendA0, lineFraction, extendA1) && this.acceptFraction(extendB0, arcFraction, extendB1)) {
-                        this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
-                    }
-                    else { // check for endpoint intersections beyond parametric tolerance but within point tolerance
-                        const pointAH = lineFraction < 0.5 ? pointA0H : pointA1H;
-                        const pointBH = (arcFraction = data.sweep.fractionToSignedPeriodicFraction(arcFraction)) < 0.5 ? pointB0H : pointB1H;
-                        if ((dist2 = pointAH.realDistanceSquaredXY(pointBH)) !== undefined && _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isDistanceWithinTol(dist2, tol2))
-                            this.recordPointWithLocalFractions(lineFraction < 0.5 ? 0 : 1, cpA, fractionA0, fractionA1, arcFraction < 0.5 ? 0 : 1, arc, 0, 1, reversed);
-                    }
-                }
+                const result = acceptSolution(i, closeApproach);
+                if (result)
+                    this.recordPointWithLocalFractions(result.fLine, cpA, fractionA0, fractionA1, result.fArc, arc, 0, 1, reversed);
             }
         }
         else {
@@ -244459,27 +244513,30 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1);
             const beta = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0);
             const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0);
-            const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_9__.GrowableFloat64Array(2);
-            const numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_10__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
-            if (numRoots <= 0)
-                return;
+            let numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_10__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);
+            const closeApproach = (0 === numRoots);
+            if (closeApproach)
+                numRoots = 1; // we returned the arc's closest approach as the first "root"; if within tolerance and at endpoints, we record it
+            const acceptSolution = (iRoot, checkOnlyEndPointDistance = false) => {
+                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(iRoot), data.vector90, sines.atUncheckedIndex(iRoot));
+                let fArc = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(iRoot), extendB0);
+                let fLine = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_8__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
+                if (fLine === undefined)
+                    return undefined;
+                if (!checkOnlyEndPointDistance && this.acceptFraction(extendA0, fLine, extendA1) && this.acceptFraction(extendB0, fArc, extendB1))
+                    return { fLine, fArc };
+                // check for an endpoint intersection that is beyond parametric tolerance but within point tolerance
+                fLine = fLine < 0.5 ? 0 : 1;
+                fArc = data.sweep.fractionToSignedPeriodicFraction(fArc) < 0.5 ? 0 : 1;
+                const pointALocal = fLine ? pointA1Local : pointA0Local;
+                const pointBLocal = fArc ? pointB1Local : pointB0Local;
+                const dist2 = pointALocal.distanceSquaredXY(pointBLocal);
+                return _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isDistanceWithinTol(dist2, tol2) ? { fLine, fArc } : undefined;
+            };
             for (let i = 0; i < numRoots; i++) {
-                const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
-                let arcFraction = data.sweep.radiansToSignedFraction(radians.atUncheckedIndex(i), extendB0);
-                const lineFraction = _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_8__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
-                if (lineFraction !== undefined) {
-                    if (this.acceptFraction(extendA0, lineFraction, extendA1) && this.acceptFraction(extendB0, arcFraction, extendB1)) {
-                        this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
-                    }
-                    else { // check for endpoint intersections beyond parametric tolerance but within point tolerance
-                        const pointALocal = lineFraction < 0.5 ? pointA0Local : pointA1Local;
-                        const pointBLocal = (arcFraction = data.sweep.fractionToSignedPeriodicFraction(arcFraction)) < 0.5 ? pointB0Local : pointB1Local;
-                        if ((dist2 = pointALocal.distanceSquaredXY(pointBLocal)) !== undefined && _Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isDistanceWithinTol(dist2, tol2))
-                            this.recordPointWithLocalFractions(lineFraction < 0.5 ? 0 : 1, cpA, fractionA0, fractionA1, arcFraction < 0.5 ? 0 : 1, arc, 0, 1, reversed);
-                    }
-                }
+                const result = acceptSolution(i, closeApproach);
+                if (result)
+                    this.recordPointWithLocalFractions(result.fLine, cpA, fractionA0, fractionA1, result.fArc, arc, 0, 1, reversed);
             }
         }
     }
@@ -244502,12 +244559,23 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             localB.coffs[0], localB.coffs[3], localB.coffs[6], // vector0 xyw
             localB.coffs[1], localB.coffs[4], localB.coffs[7], // vector90 xyw
             ellipseRadians, circleRadians);
+            const tol2 = this._coincidentGeometryContext.tolerance * this._coincidentGeometryContext.tolerance;
             // the intersections are transform-invariant, so the solution angles apply directly to the input arcs
             for (let i = 0; i < ellipseRadians.length; i++) {
-                const fractionA = cpA.sweep.radiansToSignedFraction(circleRadians[i], extendA0);
-                const fractionB = cpB.sweep.radiansToSignedFraction(ellipseRadians[i], extendB0);
-                if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(extendB0, fractionB, extendB1))
+                let fractionA = cpA.sweep.radiansToSignedFraction(circleRadians[i], extendA0);
+                let fractionB = cpB.sweep.radiansToSignedFraction(ellipseRadians[i], extendB0);
+                if (this.acceptFraction(extendA0, fractionA, extendA1) && this.acceptFraction(extendB0, fractionB, extendB1)) {
                     this.recordPointWithLocalFractions(fractionA, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
+                }
+                else { // check for endpoint intersection beyond angular tolerance but within point tolerance
+                    fractionA = cpA.sweep.fractionToSignedPeriodicFraction(fractionA) < 0.5 ? 0 : 1;
+                    fractionB = cpB.sweep.fractionToSignedPeriodicFraction(fractionB) < 0.5 ? 0 : 1;
+                    const endPointA = cpA.fractionToPoint(fractionA, CurveCurveIntersectXY._workPointAA0);
+                    const endPointB = cpB.fractionToPoint(fractionB, CurveCurveIntersectXY._workPointBB0);
+                    const dist2 = endPointA.distanceSquaredXY(endPointB);
+                    if (_Geometry__WEBPACK_IMPORTED_MODULE_4__.Geometry.isDistanceWithinTol(dist2, tol2))
+                        this.recordPointWithLocalFractions(fractionA, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
+                }
             }
         }
     }
@@ -244520,6 +244588,15 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
      * 5- Convert intersection angles to fractions and record intersections.
      */
     dispatchArcArc(cpA, extendA0, extendA1, cpB, extendB0, extendB1, reversed) {
+        // overlap handling. perspective is not handled.
+        if (this._coincidentGeometryContext && !this._worldToLocalPerspective && !this._worldToLocalAffine) {
+            const pairs = this._coincidentGeometryContext.coincidentArcIntersectionXY(cpA, cpB, true);
+            if (pairs) {
+                this.recordPairs(cpA, cpB, pairs, reversed);
+                return;
+            }
+        }
+        // look for isolated intersections
         let matrixA;
         let matrixB;
         if (this._worldToLocalPerspective) {
@@ -244536,27 +244613,13 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
         const conditionA = matrixA.conditionNumber();
         const conditionB = matrixB.conditionNumber();
-        // pick the arc that is closest to circular.
+        // order the arcs so that the first one we pass in is closer to circular
         if (conditionA > conditionB)
             this.dispatchArcArcThisOrder(cpA, matrixA, extendA0, extendA1, cpB, matrixB, extendB0, extendB1, reversed);
         else
             this.dispatchArcArcThisOrder(cpB, matrixB, extendB0, extendB1, cpA, matrixA, extendA0, extendA1, !reversed);
-        // overlap handling. perspective is not handled.
-        if (!this._coincidentGeometryContext) {
-            // do nothing
-        }
-        else if (this._worldToLocalPerspective) {
-            // do nothing
-        }
-        else if (this._worldToLocalAffine) {
-            // do nothing
-        }
-        else {
-            const pairs = this._coincidentGeometryContext.coincidentArcIntersectionXY(cpA, cpB, true);
-            if (pairs !== undefined)
-                this.recordPairs(cpA, cpB, pairs, reversed);
-        }
     }
+    /** Compute the intersection of an arc and a B-spline curve. */
     dispatchArcBsplineCurve3d(cpA, extendA0, extendA1, cpB, extendB0, extendB1, reversed) {
         // Arc: X = C + cU + sV
         // implicitize the arc as viewed.  This "3d" matrix is homogeneous "XYW" not "xyz"
@@ -244571,8 +244634,6 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
         // The worldToLocal has moved the arc vectors into local space.
         // matrixA captures the xyw parts (ignoring z)
-        // for any point in world space,
-        // THIS CODE ONLY WORKS FOR
         const matrixAInverse = matrixA.inverse();
         if (matrixAInverse) {
             const orderF = cpB.order; // order of the beziers for simple coordinates
@@ -244591,36 +244652,34 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             const awy = matrixAInverse.at(2, 1);
             const awz = 0.0;
             const aww = matrixAInverse.at(2, 2);
-            if (matrixAInverse) {
-                let bezier;
-                for (let spanIndex = 0;; spanIndex++) {
-                    bezier = cpB.getSaturatedBezierSpan3dH(spanIndex, bezier);
-                    if (!bezier)
-                        break;
-                    if (this._worldToLocalPerspective)
-                        bezier.tryMultiplyMatrix4dInPlace(this._worldToLocalPerspective);
-                    else if (this._worldToLocalAffine)
-                        bezier.tryTransformInPlace(this._worldToLocalAffine);
-                    univariateBezierG.zero();
-                    bezier.poleProductsXYZW(coffF, axx, axy, axz, axw);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
-                    bezier.poleProductsXYZW(coffF, ayx, ayy, ayz, ayw);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
-                    bezier.poleProductsXYZW(coffF, awx, awy, awz, aww);
-                    univariateBezierG.addSquaredSquaredBezier(coffF, -1.0);
-                    const roots = univariateBezierG.roots(0.0, true);
-                    if (roots) {
-                        for (const root of roots) {
-                            const fractionB = bezier.fractionToParentFraction(root);
-                            // The univariate bezier (which has been transformed by the view transform) evaluates into xyw space
-                            const bcurvePoint4d = bezier.fractionToPoint4d(root);
-                            const c = bcurvePoint4d.dotProductXYZW(axx, axy, axz, axw);
-                            const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
-                            const arcFraction = cpA.sweep.radiansToSignedFraction(Math.atan2(s, c), extendA0);
-                            if (this.acceptFraction(extendA0, arcFraction, extendA1) &&
-                                this.acceptFraction(extendB0, fractionB, extendB1)) {
-                                this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
-                            }
+            let bezier;
+            for (let spanIndex = 0;; spanIndex++) {
+                bezier = cpB.getSaturatedBezierSpan3dH(spanIndex, bezier);
+                if (!bezier)
+                    break;
+                if (this._worldToLocalPerspective)
+                    bezier.tryMultiplyMatrix4dInPlace(this._worldToLocalPerspective);
+                else if (this._worldToLocalAffine)
+                    bezier.tryTransformInPlace(this._worldToLocalAffine);
+                univariateBezierG.zero();
+                bezier.poleProductsXYZW(coffF, axx, axy, axz, axw);
+                univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
+                bezier.poleProductsXYZW(coffF, ayx, ayy, ayz, ayw);
+                univariateBezierG.addSquaredSquaredBezier(coffF, 1.0);
+                bezier.poleProductsXYZW(coffF, awx, awy, awz, aww);
+                univariateBezierG.addSquaredSquaredBezier(coffF, -1.0);
+                const roots = univariateBezierG.roots(0.0, true);
+                if (roots) {
+                    for (const root of roots) {
+                        const fractionB = bezier.fractionToParentFraction(root);
+                        // The univariate bezier (which has been transformed by the view transform) evaluates into xyw space
+                        const bcurvePoint4d = bezier.fractionToPoint4d(root);
+                        const c = bcurvePoint4d.dotProductXYZW(axx, axy, axz, axw);
+                        const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
+                        const arcFraction = cpA.sweep.radiansToSignedFraction(Math.atan2(s, c), extendA0);
+                        if (this.acceptFraction(extendA0, arcFraction, extendA1) &&
+                            this.acceptFraction(extendB0, fractionB, extendB1)) {
+                            this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
                         }
                     }
                 }
@@ -256224,7 +256283,8 @@ class GrowableXYArray extends _IndexedXYCollection__WEBPACK_IMPORTED_MODULE_0__.
         newPoints._xyInUse = this.length;
         return newPoints;
     }
-    /** Create an array populated from
+    /**
+     * Create an array by copying data from various point formats.
      * Valid inputs are:
      * * Point2d
      * * Point3d
@@ -257002,7 +257062,8 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
     compressInPlace(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         return GrowableXYZArray.createCompressed(this, tolerance, this);
     }
-    /** Create an array from various point data formats.
+    /**
+     * Create an array by copying data from various point formats.
      * Valid inputs are:
      * * Point2d
      * * Point3d
@@ -258100,8 +258161,8 @@ class PointsIterator {
     [Symbol.iterator]() { return this; }
 }
 /**
- * abstract base class for read-only access to XYZ data with indexed reference.
- * * This allows algorithms to work with Point3d[] or GrowableXYZ.
+ * Abstract base class for read-only access to XYZ data with indexed reference.
+ * * This allows algorithms to work with Point3d[] or [[GrowableXYZArray]].
  *   * GrowableXYZArray implements these for its data.
  *   * Point3dArrayCarrier carries a (reference to) a Point3d[] and implements the methods with calls on that array reference.
  * * In addition to "point by point" accessors, other abstract members compute commonly useful vector data "between points".
@@ -258319,7 +258380,7 @@ class IndexedXYZCollection {
     }
 }
 /**
- * abstract base class extends IndexedXYZCollection, adding methods to push, peek, and pop, and rewrite.
+ * Abstract base class extends [[IndexedXYZCollection]] with methods that modify the collection.
  * @public
  */
 class IndexedReadWriteXYZCollection extends IndexedXYZCollection {
@@ -269013,8 +269074,8 @@ class PolylineOps {
      * Checks if all points are colinear.
      * * This test does not take point order into account.
      * @param points array of points to check.
-     * @param distanceTol tolerance for co-linearity check, default is Geometry.smallMetricDistance.
-     * @param xyOnly if true, only XY coordinates are used for the check, ignoring z coordinate.
+     * @param distanceTol maximum allowable distance that geometry can deviate from colinearity.Default is [[Geometry.smallMetricDistance]].
+     * @param xyOnly whether to ignore z-coordinates in the colinearity test.
      */
     static isColinear(points, distanceTol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance, xyOnly = false) {
         if (points.length < 3)
@@ -277100,9 +277161,9 @@ class ClusterableArray extends _geometry3d_GrowableBlockedArray__WEBPACK_IMPORTE
                     candidateBlockIndex = firstSort[j];
                     if (candidateBlockIndex === ClusterableArray.clusterTerminator)
                         continue; // nearby in sort direction but already in a cluster.
-                    if (this.component(candidateBlockIndex, 0) >= barrierU)
+                    if (this.component(candidateBlockIndex, 0) > barrierU)
                         break;
-                    if (this.distanceBetweenSubBlocks(clusterStartBlockIndex, candidateBlockIndex, k0, k1) < clusterTolerance) {
+                    if (this.distanceBetweenSubBlocks(clusterStartBlockIndex, candidateBlockIndex, k0, k1) <= clusterTolerance) {
                         clusterIndices[m++] = candidateBlockIndex; // The candidate is in the block
                         firstSort[j] = ClusterableArray.clusterTerminator; // and it will not be reused as future block base
                     }
@@ -312887,13 +312948,21 @@ class HalfEdgeGraphMerge {
     static isNullFace(node) {
         return node.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_3__.HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(_Graph__WEBPACK_IMPORTED_MODULE_3__.HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;
     }
-    /** Simplest merge algorithm:
-     * * collect array of (x,y,theta) at all nodes
-     * * lexical sort of the array.
-     * * twist all vertices together.
-     * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.
-     * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.
-     * * Mask.NULL_FACE is cleared throughout and applied within null faces.
+    /**
+     * Cluster the HalfEdges so that xy-coordinates within `mergeTolerance` are equated.
+     * * Note that any additional data (e.g., edgeTag, faceTag) on the HalfEdges are ignored. In particular,
+     * [[CurveLocationDetail]]s attached to clustered HalfEdges do *not* get their points adjusted.
+     * * This is a simple merge algorithm:
+     *   * untwist all edges from the vertex loops
+     *   * collect array of (x,y,theta) at all nodes
+     *   * lexical sort of the array
+     *   * twist all edges together in sort order around each vertex
+     *   * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.
+     *   * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.
+     *   * [[HalfEdgeMask.NULL_FACE]] is cleared throughout and applied within null faces.
+     * @param graph input graph
+     * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex
+     * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         const allNodes = graph.allHalfEdges;
@@ -312951,14 +313020,11 @@ class HalfEdgeGraphMerge {
         const unmatchedNullFaceNodes = [];
         k0 = 0;
         let thetaA, thetaB;
-        // GeometryCoreTestIO.consoleLog("START VERTEX LINKS");
         // now pinch each neighboring pair together
         for (let k1 = 0; k1 < numK; k1++) {
             if (order[k1] === _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_5__.ClusterableArray.clusterTerminator) {
                 // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.
                 if (k1 > k0) {
-                    // const xy = clusters.getPoint2d(order[k0]);
-                    // GeometryCoreTestIO.consoleLog({ k0, k1, x: xy.x, y: xy.y });
                     if (k1 > k0 + 1)
                         this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);
                     this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);
@@ -337481,18 +337547,18 @@ class Settings {
         }
     }
     toString() {
-        return `Configurations:
-      backend location: ${this.Backend.location},
-      backend name: ${this.Backend.name},
-      backend version: ${this.Backend.version},
-      oidc client id: ${this.oidcClientId},
-      oidc scopes: ${this.oidcScopes},
-      applicationId: ${this.gprid},
-      log level: ${this.logLevel},
-      testing iModelTileRpcTests: ${this.runiModelTileRpcTests},
-      testing PresentationRpcTest: ${this.runPresentationRpcTests},
-      testing iModelReadRpcTests: ${this.runiModelReadRpcTests},
-      testing DevToolsRpcTests: ${this.runDevToolsRpcTests},
+        return `Configurations:
+      backend location: ${this.Backend.location},
+      backend name: ${this.Backend.name},
+      backend version: ${this.Backend.version},
+      oidc client id: ${this.oidcClientId},
+      oidc scopes: ${this.oidcScopes},
+      applicationId: ${this.gprid},
+      log level: ${this.logLevel},
+      testing iModelTileRpcTests: ${this.runiModelTileRpcTests},
+      testing PresentationRpcTest: ${this.runPresentationRpcTests},
+      testing iModelReadRpcTests: ${this.runiModelReadRpcTests},
+      testing DevToolsRpcTests: ${this.runDevToolsRpcTests},
       testing iModelWriteRpcTests: ${this.runiModelWriteRpcTests}`;
     }
 }
@@ -337706,7 +337772,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.3.0-dev.5",
+            applicationVersion: "5.3.0-dev.7",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.serviceAuthToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -343916,7 +343982,7 @@ var Key;
     /**
      * Check if the supplied key is a `NodeKey`
      *
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     // eslint-disable-next-line @typescript-eslint/no-deprecated
@@ -343999,7 +344065,7 @@ class KeySet {
      *
      * **Warning**: getting node keys might be expensive for large KeySets.
      *
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     get nodeKeys() {
@@ -344013,7 +344079,7 @@ class KeySet {
     /**
      * Get node keys count
      *
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     get nodeKeysCount() {
@@ -347871,7 +347937,7 @@ const EC_js_1 = __webpack_require__(/*! ../EC.js */ "../../presentation/common/l
 /**
  * Standard node types
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 var StandardNodeTypes;
@@ -347883,7 +347949,7 @@ var StandardNodeTypes;
 })(StandardNodeTypes || (exports.StandardNodeTypes = StandardNodeTypes = {}));
 /**
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 // eslint-disable-next-line @typescript-eslint/no-redeclare
@@ -348569,7 +348635,7 @@ exports.SameLabelInstanceGroupApplicationStage = exports.GroupingSpecificationTy
 /**
  * Available types of [[GroupingSpecification]].
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 var GroupingSpecificationTypes;
@@ -348581,7 +348647,7 @@ var GroupingSpecificationTypes;
 /**
  * Specifies hierarchy creation stages used to apply [[SameLabelInstanceGroup]] grouping.
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 var SameLabelInstanceGroupApplicationStage;
@@ -348699,7 +348765,7 @@ exports.ChildNodeSpecificationTypes = void 0;
 /**
  * Used for serializing array of [[ChildNodeSpecification]]
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 var ChildNodeSpecificationTypes;
@@ -348755,7 +348821,7 @@ exports.QuerySpecificationTypes = void 0;
 /**
  * Used for serializing array of [[QuerySpecification]] to JSON.
  * @public
- * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+ * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
  * package for creating hierarchies.
  */
 var QuerySpecificationTypes;
@@ -349512,7 +349578,7 @@ class PresentationManager {
     /**
      * An event raised when hierarchies created using specific ruleset change.
      *
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     // eslint-disable-next-line @typescript-eslint/no-deprecated
@@ -349681,7 +349747,7 @@ class PresentationManager {
     /* eslint-disable @typescript-eslint/no-deprecated */
     /**
      * Returns an iterator that polls nodes asynchronously.
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     async getNodesIterator(requestOptions) {
@@ -349710,7 +349776,7 @@ class PresentationManager {
     }
     /**
      * Retrieves nodes count.
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     async getNodesCount(requestOptions) {
@@ -349733,7 +349799,7 @@ class PresentationManager {
     /**
      * Retrieves hierarchy level descriptor.
      * @public
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     async getNodesDescriptor(requestOptions) {
@@ -349751,7 +349817,7 @@ class PresentationManager {
     }
     /**
      * Retrieves paths from root nodes to children nodes according to specified keys. Intersecting paths will be merged.
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     async getNodePaths(requestOptions) {
@@ -349763,7 +349829,7 @@ class PresentationManager {
     }
     /**
      * Retrieves paths from root nodes to nodes containing filter text in their label.
-     * @deprecated in 5.2. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
+     * @deprecated in 5.2 - will not be removed until after 2026-10-01. Use the new [@itwin/presentation-hierarchies](https://github.com/iTwin/presentation/blob/master/packages/hierarchies/README.md)
      * package for creating hierarchies.
      */
     async getFilteredNodePaths(requestOptions) {
@@ -362973,7 +363039,7 @@ var loadLanguages = instance.loadLanguages;
 /***/ ((module) => {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.3.0-dev.5","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers && 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","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":{"@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/eslint-plugin":"5.2.2-dev.2","@types/chai-as-promised":"^7","@types/draco3d":"^1.4.10","@types/sinon":"^17.0.2","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.31.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^6.0.1","sinon":"^17.0.2","source-map-loader":"^5.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^3.0.6","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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.3.0","@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.3.0-dev.7","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","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":{"@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/eslint-plugin":"5.2.2-dev.2","@types/chai-as-promised":"^7","@types/draco3d":"^1.4.10","@types/sinon":"^17.0.2","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.31.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^6.0.1","sinon":"^17.0.2","source-map-loader":"^5.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^3.0.6","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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.3.0","@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"}}');
 
 /***/ }),