@itwin/rpcinterface-full-stack-tests 5.1.0-dev.51 → 5.1.0-dev.53

package/lib/dist/bundled-tests.js

@@ -72817,7 +72817,8 @@ class WhiteOnWhiteReversalSettings {
 "use strict";
 __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
-/* harmony export */   TextAnnotation: () => (/* binding */ TextAnnotation)
+/* harmony export */   TextAnnotation: () => (/* binding */ TextAnnotation),
+/* harmony export */   textAnnotationFrameShapes: () => (/* binding */ textAnnotationFrameShapes)
 /* harmony export */ });
 /* harmony import */ var _itwin_core_geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-geometry */ "../../core/geometry/lib/esm/core-geometry.js");
 /* harmony import */ var _TextBlock__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./TextBlock */ "../../core/common/lib/esm/annotation/TextBlock.js");
@@ -72830,6 +72831,10 @@ __webpack_require__.r(__webpack_exports__);
  */
 
 
+/** Set of predefined shapes that can be computed and drawn around the margins of a [[TextBlock]]
+ * @beta
+*/
+const textAnnotationFrameShapes = ["none", "line", "rectangle", "circle", "equilateralTriangle", "diamond", "square", "pentagon", "hexagon", "octagon", "capsule", "roundedRectangle"];
 /**
  * Represents a formatted block of text positioned in 2d or 3d space.
  * [TextAnnotation2d]($backend) and [TextAnnotation3d]($backend) elements store a single TextAnnotation from which their geometric representation is generated.
@@ -73988,6 +73993,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   readElementMeshes: () => (/* reexport safe */ _ElementMesh__WEBPACK_IMPORTED_MODULE_29__.readElementMeshes),
 /* harmony export */   readTileContentDescription: () => (/* reexport safe */ _tile_TileMetadata__WEBPACK_IMPORTED_MODULE_157__.readTileContentDescription),
 /* harmony export */   rpcOverIpcStrings: () => (/* reexport safe */ _ipc_IpcSession__WEBPACK_IMPORTED_MODULE_75__.rpcOverIpcStrings),
+/* harmony export */   textAnnotationFrameShapes: () => (/* reexport safe */ _annotation_TextAnnotation__WEBPACK_IMPORTED_MODULE_2__.textAnnotationFrameShapes),
 /* harmony export */   tileFormatFromNumber: () => (/* reexport safe */ _tile_TileIO__WEBPACK_IMPORTED_MODULE_156__.tileFormatFromNumber)
 /* harmony export */ });
 /* harmony import */ var _AmbientOcclusion__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./AmbientOcclusion */ "../../core/common/lib/esm/AmbientOcclusion.js");
@@ -114814,20 +114820,52 @@ class SnapshotConnection extends IModelConnection {
     /** The collection of [[CodeSpec]] entities for an [[IModelConnection]]. */
     class CodeSpecs {
         _iModel;
-        _loaded;
         /** @internal */
         constructor(_iModel) {
             this._iModel = _iModel;
         }
-        /** Loads all CodeSpec from the remote IModelDb. */
-        async _loadAllCodeSpecs() {
-            if (this._loaded)
-                return;
-            this._loaded = [];
-            const codeSpecArray = await _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelReadRpcInterface.getClientForRouting(this._iModel.routingContext.token).getAllCodeSpecs(this._iModel.getRpcProps());
-            for (const codeSpec of codeSpecArray) {
-                this._loaded.push(_itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.CodeSpec.createFromJson(this._iModel, _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Id64.fromString(codeSpec.id), codeSpec.name, codeSpec.jsonProperties));
+        _isCodeSpecProperties(x) {
+            if (!x || !x.scopeSpec || !Object.values(_itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.CodeScopeSpec.Type).includes(x.scopeSpec.type))
+                return false;
+            if (typeof x.scopeSpec.fGuidRequired !== "boolean" && typeof x.scopeSpec.fGuidRequired !== "undefined")
+                return false;
+            if (typeof x.scopeSpec.relationship !== "string" && typeof x.scopeSpec.relationship !== "undefined")
+                return false;
+            if (typeof x.spec?.isManagedWithDgnDb !== "boolean" && typeof x.spec?.isManagedWithDgnDb !== "undefined")
+                return false;
+            if (typeof x.version !== "string" && typeof x.version !== "undefined")
+                return false;
+            return true;
+        }
+        async _loadCodeSpec(identifier) {
+            const isNameDefined = identifier.name !== undefined;
+            const query = `
+        SELECT ECInstanceId AS Id, Name, JsonProperties
+        FROM BisCore.CodeSpec
+        WHERE ${isNameDefined ? `Name=:name` : `Id=:id`}`;
+            const params = new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.QueryBinder();
+            if (isNameDefined) {
+                params.bindString("name", identifier.name);
+            }
+            else {
+                params.bindId("id", identifier.id);
             }
+            const queryReader = this._iModel.createQueryReader(query, params, {
+                rowFormat: _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.QueryRowFormat.UseECSqlPropertyNames,
+            });
+            const queryResult = await queryReader.next();
+            if (queryResult.done)
+                throw new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelError(_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.IModelStatus.NotFound, "CodeSpec not found");
+            const codeSpecResult = queryResult.value;
+            if (typeof codeSpecResult.Id !== "string" ||
+                typeof codeSpecResult.Name !== "string" ||
+                typeof codeSpecResult.JsonProperties !== "string")
+                throw new Error("Invalid CodeSpec was returned");
+            const jsonProperties = JSON.parse(codeSpecResult.JsonProperties);
+            if (!this._isCodeSpecProperties(jsonProperties))
+                throw new Error("Invalid CodeSpecProperties returned in the CodeSpec");
+            const codeSpec = _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.CodeSpec.createFromJson(this._iModel, _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Id64.fromString(codeSpecResult.Id), codeSpecResult.Name, jsonProperties);
+            return codeSpec;
         }
         /** Look up a CodeSpec by Id.
          * @param codeSpecId The Id of the CodeSpec to load
@@ -114835,13 +114873,11 @@ class SnapshotConnection extends IModelConnection {
          * @throws [[IModelError]] if the Id is invalid or if no CodeSpec with that Id could be found.
          */
         async getById(codeSpecId) {
+            if (codeSpecId === "")
+                throw new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelError(_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.IModelStatus.NotFound, "CodeSpec not found");
             if (!_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.Id64.isValid(codeSpecId))
                 throw new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelError(_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.IModelStatus.InvalidId, "Invalid codeSpecId", () => ({ codeSpecId }));
-            await this._loadAllCodeSpecs(); // ensure all codeSpecs have been downloaded
-            const found = this._loaded.find((codeSpec) => codeSpec.id === codeSpecId);
-            if (!found)
-                throw new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelError(_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.IModelStatus.NotFound, "CodeSpec not found");
-            return found;
+            return this._loadCodeSpec({ id: codeSpecId });
         }
         /** Look up a CodeSpec by name.
          * @param name The name of the CodeSpec to load
@@ -114849,11 +114885,9 @@ class SnapshotConnection extends IModelConnection {
          * @throws [[IModelError]] if no CodeSpec with the specified name could be found.
          */
         async getByName(name) {
-            await this._loadAllCodeSpecs(); // ensure all codeSpecs have been downloaded
-            const found = this._loaded.find((codeSpec) => codeSpec.name === name);
-            if (!found)
+            if (name === "")
                 throw new _itwin_core_common__WEBPACK_IMPORTED_MODULE_1__.IModelError(_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.IModelStatus.NotFound, "CodeSpec not found");
-            return found;
+            return this._loadCodeSpec({ name });
         }
     }
     IModelConnection.CodeSpecs = CodeSpecs;
@@ -216017,7 +216051,6 @@ class BSplineSurface3d extends BSpline2dNd {
     getPointGridJSON() {
         const result = {
             points: _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_7__.Point3dArray.unpackNumbersToNestedArraysIJK(this.coffs, 3, this.numPolesUV(0)),
-            weighStyle: WeightStyle.WeightsAlreadyAppliedToCoordinates, // @deprecated in 4.x - will not be removed until after 2026-06-13. Use weightStyle instead.
             weightStyle: WeightStyle.UnWeighted,
             numCartesianDimensions: 3,
         };
@@ -216430,7 +216463,6 @@ class BSplineSurface3dH extends BSpline2dNd {
         const result = {
             points: _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_7__.Point3dArray.unpackNumbersToNestedArraysIJK(this.coffs, 4, this.numPolesUV(0)),
             numCartesianDimensions: 3,
-            weighStyle: WeightStyle.WeightsAlreadyAppliedToCoordinates, // @deprecated in 4.x - will not be removed until after 2026-06-13. Use weightStyle instead.
             weightStyle: WeightStyle.WeightsAlreadyAppliedToCoordinates,
         };
         return result;
@@ -227444,6 +227476,17 @@ class CurveChain extends CurveCollection {
         else
             return undefined;
     }
+    /**
+     * Whether the chain start and end points are defined and within tolerance.
+     * * Does not check for planarity or degeneracy.
+     * @param tolerance optional distance tolerance (default is [[Geometry.smallMetricDistance]])
+     * @param xyOnly if true, ignore z coordinate (default is `false`)
+     */
+    isPhysicallyClosedCurve(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_6__.Geometry.smallMetricDistance, xyOnly = false) {
+        const p0 = this.startPoint();
+        const p1 = this.endPoint();
+        return p0 !== undefined && p1 !== undefined && (xyOnly ? p0.isAlmostEqualXY(p1, tolerance) : p0.isAlmostEqual(p1, tolerance));
+    }
     /**
      * Return the start point and derivative of the first child of the curve chain.
      * * For queries interior to the chain, use [[CurveChainWithDistanceIndex.fractionToPointAndDerivative]].
@@ -228174,11 +228217,12 @@ class CurveFactory {
      * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.
      * @param arcA first arc, modified in place.
      * @param arcB second arc, unmodified.
-     * @param allowReversed whether to consolidate even when second arc is reversed.
+     * @param allowReversed whether to consolidate even when second arc is reversed (default is `false`).
+     * @param tolerance optional coordinate tolerance for point equality (default is `Geometry.smallMetricDistance`).
      * @returns whether `arcA` was modified.
      */
-    static appendToArcInPlace(arcA, arcB, allowReverse = false) {
-        if (arcA.center.isAlmostEqual(arcB.center)) {
+    static appendToArcInPlace(arcA, arcB, allowReverse = false, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+        if (arcA.center.isAlmostEqual(arcB.center, tolerance)) {
             const sweepSign = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.split3WaySign(arcA.sweep.sweepRadians * arcB.sweep.sweepRadians, -1, 0, 1);
             // evaluate derivatives wrt radians (not fraction!), but adjust direction for sweep signs
             const endA = arcA.angleToPointAndDerivative(arcA.sweep.fractionToAngle(1.0));
@@ -228187,14 +228231,14 @@ class CurveFactory {
             const startB = arcB.angleToPointAndDerivative(arcB.sweep.fractionToAngle(0.0));
             if (arcB.sweep.sweepRadians < 0)
                 startB.direction.scaleInPlace(-1.0);
-            if (endA.isAlmostEqual(startB)) {
+            if (endA.isAlmostEqual(startB, tolerance)) {
                 arcA.sweep.setStartEndRadians(arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians + sweepSign * arcB.sweep.sweepRadians);
                 return true;
             }
             // Also ok if negated tangent
             if (allowReverse) {
                 startB.direction.scaleInPlace(-1.0);
-                if (endA.isAlmostEqual(startB)) {
+                if (endA.isAlmostEqual(startB, tolerance)) {
                     arcA.sweep.setStartEndRadians(arcA.sweep.startRadians, arcA.sweep.startRadians + arcA.sweep.sweepRadians - sweepSign * arcB.sweep.sweepRadians);
                     return true;
                 }
@@ -228741,7 +228785,12 @@ class CurveLocationDetail {
     setIntervalRole(value) {
         this.intervalRole = value;
     }
-    /** Set the (optional) fraction1 and point1, using direct assignment (capture!) to point1. */
+    /** Set the `fraction` and `point`, using direct assignment (capture!) to `point`. */
+    captureFractionPoint(fraction, point) {
+        this.fraction = fraction;
+        this.point = point;
+    }
+    /** Set the (optional) `fraction1` and `point1`, using direct assignment (capture!) to `point1`. */
     captureFraction1Point1(fraction1, point1) {
         this.fraction1 = fraction1;
         this.point1 = point1;
@@ -229961,6 +230010,17 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.Geometr
     endPoint(result) {
         return this.fractionToPoint(1.0, result);
     }
+    /**
+     * Whether the start and end points are defined and within tolerance.
+     * * Does not check for planarity or degeneracy.
+     * @param tolerance optional distance tolerance (default is [[Geometry.smallMetricDistance]])
+     * @param xyOnly if true, ignore z coordinate (default is `false`)
+     */
+    isPhysicallyClosedCurve(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance, xyOnly = false) {
+        const p0 = this.startPoint();
+        const p1 = this.endPoint();
+        return p0 !== undefined && p1 !== undefined && (xyOnly ? p0.isAlmostEqualXY(p1, tolerance) : p0.isAlmostEqual(p1, tolerance));
+    }
     /**
      * Attach StrokeCountMap structure to this primitive (and recursively to any children)
      * * Base class implementation (here) gets the simple count from computeStrokeCountForOptions and attaches it.
@@ -230448,6 +230508,10 @@ class LineSegment3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePr
     get point1Ref() {
         return this._point1;
     }
+    /** Return a copy of the start and end points in an array. */
+    get points() {
+        return [this._point0.clone(), this._point1.clone()];
+    }
     /** A LineSegment3d extends along its infinite line. */
     get isExtensibleFractionSpace() {
         return true;
@@ -232228,8 +232292,7 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePri
         this.addResolvedPoint(localA.index, localA.fraction, result._points);
         for (let index = index0; index <= index1; index++) {
             if (this._points.isIndexValid(index)) {
-                this._points.getPoint3dAtUncheckedPointIndex(index, LineString3d._workPointA);
-                result._points.push(LineString3d._workPointA);
+                result._points.pushFromGrowableXYZArray(this._points, index);
             }
         }
         this.addResolvedPoint(localB.index, localB.fraction, result._points);
@@ -232241,9 +232304,22 @@ class LineString3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePri
             return _LineSegment3d__WEBPACK_IMPORTED_MODULE_15__.LineSegment3d.create(this._points.getPoint3dAtCheckedPointIndex(index), this._points.getPoint3dAtCheckedPointIndex(index + 1), result);
         return undefined;
     }
+    /**
+     * Whether the start and end points are defined and within tolerance.
+     * * Does not check for planarity or degeneracy.
+     * @param tolerance optional distance tolerance (default is [[Geometry.smallMetricDistance]])
+     * @param xyOnly if true, ignore z coordinate (default is `false`)
+     */
+    isPhysicallyClosedCurve(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance, xyOnly = false) {
+        if (!this._points.length)
+            return false;
+        if (xyOnly)
+            return this._points.almostEqualXYIndexIndex(0, this._points.length - 1, tolerance); // we know the indices are valid
+        return this._points.almostEqualIndexIndex(0, this._points.length - 1, tolerance);
+    }
     /** Returns true if first and last points are within metric tolerance. */
     get isPhysicallyClosed() {
-        return this._points.length > 0 && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(this._points.distanceIndexIndex(0, this._points.length - 1));
+        return this.isPhysicallyClosedCurve();
     }
     /**
      * Evaluate strokes at fractions indicated in a StrokeCountMap.
@@ -233424,7 +233500,7 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
         const numOriginal = children.length;
         const points = [];
         let numAccept = 0;
-        // i0 <=i < i1 is a range of child indices.
+        // i0 <= i < i1 is a range of child indices.
         // numAccept is the number of children accepted (contiguously at front of children)
         for (let i0 = 0; i0 < numOriginal;) {
             const basePrimitive = g.children[i0];
@@ -233482,7 +233558,7 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                     const nextPrimitive = g.children[i0];
                     if (!(nextPrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_7__.Arc3d))
                         break;
-                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_8__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive)) // TODO: use this._options.duplicatePointTolerance
+                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_8__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive, false, this._options.duplicatePointTolerance))
                         break;
                 }
                 // i0 has already advanced
@@ -233495,8 +233571,32 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
         }
         g.children.length = numAccept;
     }
-    handlePath(g) { return this.handleCurveChain(g); }
-    handleLoop(g) { return this.handleCurveChain(g); }
+    handlePath(g) {
+        return this.handleCurveChain(g);
+    }
+    handleLoop(g) {
+        this.handleCurveChain(g);
+        if (g.children.length > 1 && this._options.consolidateLoopSeam) {
+            const lastChild = g.children[g.children.length - 1];
+            const firstChild = g.children[0];
+            if ((lastChild instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d || lastChild instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d) && (firstChild instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d || firstChild instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d)) {
+                if (this._options.consolidateLinearGeometry && !this._options.disableLinearCompression) {
+                    const lastPoints = lastChild.points;
+                    lastPoints.pop(); // the original start point survives as an interior point in the new first primitive
+                    g.children[0] = _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.createPoints([...lastPoints, ...firstChild.points]);
+                    g.children.pop();
+                }
+            }
+            else if (lastChild instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_7__.Arc3d && firstChild instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_7__.Arc3d) {
+                if (this._options.consolidateCompatibleArcs) {
+                    if (_CurveFactory__WEBPACK_IMPORTED_MODULE_8__.CurveFactory.appendToArcInPlace(lastChild, firstChild, false, this._options.duplicatePointTolerance)) {
+                        g.children[0] = lastChild;
+                        g.children.pop();
+                    }
+                }
+            }
+        }
+    }
     handleParityRegion(g) {
         for (const child of g.children)
             child.dispatchToGeometryHandler(this);
@@ -233925,16 +234025,19 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   PlanarSubdivision: () => (/* binding */ PlanarSubdivision)
 /* harmony export */ });
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
-/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
-/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
-/* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.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_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");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -233949,6 +234052,9 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
+
+
 /** @packageDocumentation
  * @module Curve
  */
@@ -233991,19 +234097,19 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
      * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we
      * introduce two intersections for each half, which allows the primitive to be represented in the map.
      */
-    splitAndAppendMissingClosedPrimitives(primitives, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+    splitAndAppendMissingClosedPrimitives(primitives, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         for (const p of primitives) {
             let closedCurveSplitCandidate = false;
-            if (p instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d)
+            if (p instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d)
                 closedCurveSplitCandidate = p.sweep.isFullCircle;
-            else if (!(p instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d) && !(p instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.
+            else if (!(p instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_3__.LineSegment3d) && !(p instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_4__.LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.
                 closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);
             if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {
                 const p0 = p.clonePartialCurve(0.0, 0.5);
                 const p1 = p.clonePartialCurve(0.5, 1.0);
                 if (p0 && p1) {
-                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0)));
-                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0)));
+                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0)));
+                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0)));
                 }
             }
         }
@@ -234017,7 +234123,7 @@ class PlanarSubdivision {
      * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
      * Z-coordinates are ignored.
      */
-    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         // map from key CurvePrimitive to CurveLocationDetailPair
         const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();
         for (const pair of allPairs)
@@ -234026,7 +234132,7 @@ class PlanarSubdivision {
             // otherwise, these single-primitive loops are missing from the graph
             detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);
         }
-        const graph = new _topology_Graph__WEBPACK_IMPORTED_MODULE_5__.HalfEdgeGraph();
+        const graph = new _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraph();
         for (const entry of detailByPrimitive.primitiveToPair.entries()) {
             const p = entry[0];
             // convert each interval intersection into two isolated intersections
@@ -234034,12 +234140,12 @@ class PlanarSubdivision {
                 if (!detailPair.detailA.hasFraction1)
                     return [...accumulator, detailPair];
                 const detail = getDetailOnCurve(detailPair, p);
-                const detail0 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);
-                const detail1 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);
+                const detail0 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);
+                const detail1 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);
                 return [
                     ...accumulator,
-                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detail0, detail0),
-                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detail1, detail1),
+                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetailPair.createCapture(detail0, detail0),
+                    _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetailPair.createCapture(detail1, detail1),
                 ];
             }, []);
             // lexical sort on p intersection fraction
@@ -234051,12 +234157,12 @@ class PlanarSubdivision {
             let last = { point: p.startPoint(), fraction: 0.0 };
             for (const detailPair of details) {
                 const detail = getDetailOnCurve(detailPair, p);
-                const detailFraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later
+                const detailFraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later
                 last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);
             }
             this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);
         }
-        _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
+        _topology_Merging__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
         return graph;
     }
     /**
@@ -234070,11 +234176,13 @@ class PlanarSubdivision {
      * @param fraction1 end fraction
      * @returns end point and fraction, or start point and fraction if no action
      */
-    static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+    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);
-        const detail01 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
+        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;
@@ -234092,7 +234200,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_7__.RegionOps.computeXYArea(loop);
+        let area = isSliverFace ? 0.0 : _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.computeXYArea(loop);
         if (area === undefined)
             area = 0;
         if (Math.abs(area) < zeroAreaTolerance)
@@ -234106,41 +234214,115 @@ class PlanarSubdivision {
             outLoops.slivers.push(loop);
         return area;
     }
-    static createLoopInFace(faceSeed, announce) {
-        let he = faceSeed;
-        const loop = _Loop__WEBPACK_IMPORTED_MODULE_8__.Loop.create();
-        do {
-            const detail = he.edgeTag;
-            if (detail) {
-                let curve;
-                if (he.sortData > 0)
-                    curve = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
-                else
-                    curve = detail.curve.clonePartialCurve(detail.fraction1, detail.fraction);
-                if (curve) {
-                    if (announce !== undefined)
-                        announce(he, curve, loop);
-                    loop.tryAddChild(curve);
+    /** Extract geometric info from a topological edge. */
+    static extractGeometryFromEdge(edge) {
+        if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_5__.CurveLocationDetail) {
+            const detail = edge.edgeTag;
+            if (detail.curve && detail.fraction1 !== undefined) {
+                const reversed = edge.sortData < 0;
+                return { detail, reversed };
+            }
+        }
+        return undefined;
+    }
+    /** Create the geometry for a topological edge. */
+    static createCurveInEdge(edge) {
+        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);
+        }
+        return undefined;
+    }
+    /**
+     * 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.
+     */
+    static createLoopInFace(face, announce, compress = false) {
+        if (announce)
+            compress = false;
+        const loop = _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop.create();
+        const addEdgeCurve = (he) => {
+            const curve = this.createCurveInEdge(he);
+            if (curve) {
+                announce?.(he, curve, loop);
+                loop.tryAddChild(curve);
+            }
+        };
+        if (Array.isArray(face))
+            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 (loop.isPhysicallyClosedCurve(undefined, true))
+            return loop;
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(false, "createLoopInFace: face is not physically closed");
+        return undefined;
+    }
+    /**
+     * 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`).
+     */
+    static createLoopOrParityRegionInFace(face, bridgeMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.BRIDGE_EDGE, visitMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeMask.VISITED) {
+        let region;
+        if (face.isSplitWasherFace(bridgeMask)) {
+            const loops = [];
+            const loopEdges = [];
+            const bridgeStack = [face.findMaskAroundFace(bridgeMask, true)];
+            const announceEdge = (he) => { he.setMask(visitMask); loopEdges.push(he); };
+            const announceBridge = (he) => { if (!he.isMaskSet(visitMask))
+                bridgeStack.push(he); };
+            face.clearMaskAroundFace(visitMask);
+            let bridge;
+            while (undefined !== (bridge = bridgeStack.pop())) {
+                bridge.setMask(visitMask);
+                const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop
+                if (loopSeed) {
+                    if (loopSeed.isMaskSet(visitMask))
+                        continue;
+                    loopEdges.length = 0;
+                    if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {
+                        const loop = this.createLoopInFace(loopEdges, undefined, true);
+                        if (loop) {
+                            loops.push(loop);
+                            continue;
+                        }
+                    }
                 }
             }
-            he = he.faceSuccessor;
-        } while (he !== faceSeed);
-        return loop;
+            region = _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.sortOuterAndHoleLoopsXY(loops);
+            region = _RegionOps__WEBPACK_IMPORTED_MODULE_9__.RegionOps.simplifyRegion(region);
+        }
+        else {
+            region = this.createLoopInFace(face, undefined, true);
+        }
+        return (region && (region instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.Loop || region instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_11__.ParityRegion)) ? region : undefined;
     }
-    // Return true if there are only two edges in the face loop, and their start curvatures are the same.
+    /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     static isNullFace(he) {
         const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);
         let faceIsBanana = false;
         if (faceHasTwoEdges) {
-            const c0 = _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.curvatureSortKey(he);
-            const c1 = _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);
-            if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(c0, c1)) // default tol!
+            const c0 = _topology_Merging__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraphMerge.curvatureSortKey(he);
+            const c1 = _topology_Merging__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);
+            if (!_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(c0, c1)) // default tol!
                 faceIsBanana = true; // heuristic: we could also check end curvatures, and/or higher derivatives...
         }
         return faceHasTwoEdges && !faceIsBanana;
     }
-    // Look across edge mates (possibly several) for a nonnull mate face.
-    static nonNullEdgeMate(_graph, e) {
+    /** Look across edge mates (possibly several) for a non-null mate face. */
+    static getNonNullEdgeMate(_graph, e) {
         if (this.isNullFace(e))
             return undefined;
         let e1 = e.edgeMate;
@@ -234152,7 +234334,7 @@ class PlanarSubdivision {
         return e1;
     }
     static collectSignedLoopSetsInHalfEdgeGraph(graph, zeroAreaTolerance = 1.0e-10) {
-        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_9__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
+        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_12__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
         const result = [];
         const edgeMap = new Map();
         for (const faceSeeds of q) {
@@ -234162,15 +234344,15 @@ class PlanarSubdivision {
                 const isNullFace = this.isNullFace(faceSeed);
                 const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
                     if (!isNullFace) {
-                        const mate = this.nonNullEdgeMate(graph, he);
+                        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_8__.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                                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_8__.LoopCurveLoopCurve) {
+                            else if (e instanceof _Loop__WEBPACK_IMPORTED_MODULE_10__.LoopCurveLoopCurve) {
                                 e.setB(loopC, curveC);
                                 edges.push(e);
                                 edgeMap.delete(mate);
@@ -234178,7 +234360,8 @@ class PlanarSubdivision {
                         }
                     }
                 });
-                this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
+                if (loop)
+                    this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
             }
             componentAreas.edges = edges;
             result.push(componentAreas);
@@ -234226,11 +234409,12 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   StrokeCountSection: () => (/* binding */ StrokeCountSection)
 /* harmony export */ });
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
+/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
+/* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /* harmony import */ var _StrokeCountMap__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./StrokeCountMap */ "../../core/geometry/lib/esm/curve/Query/StrokeCountMap.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -234246,6 +234430,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 // cspell:word remapa
 /**
  * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.
@@ -234376,6 +234561,7 @@ class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVi
  * * `parent` = parent CurveCollection.
  *
  * An instance is normally created with either a `Path` or `Loop` as the parent.
+ * @internal
  */
 class StrokeCountChain {
     maps;
@@ -234391,7 +234577,7 @@ class StrokeCountChain {
         this.maps = [];
         this.options = options;
     }
-    static createForCurveChain(chain, options) {
+    static create(chain, options) {
         const result = new StrokeCountChain(chain, options);
         result.parent = chain;
         // A chain can only contain primitives !!!!
@@ -234462,16 +234648,24 @@ class StrokeCountSection {
      * construct array of arrays of `StrokeCountMap`s
      * @param parent
      */
-    static createForParityRegionOrChain(parent, options) {
+    static create(parent, options) {
         const result = new StrokeCountSection(parent);
-        if (parent instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_3__.ParityRegion) {
+        const appendCurveChain = (chain) => result.chains.push(StrokeCountChain.create(chain, options));
+        const appendParityRegion = (region) => { for (const child of region.children)
+            appendCurveChain(child); };
+        if (parent instanceof _UnionRegion__WEBPACK_IMPORTED_MODULE_3__.UnionRegion) {
             for (const child of parent.children) {
-                const p = StrokeCountChain.createForCurveChain(child, options);
-                result.chains.push(p);
+                if (child instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_4__.ParityRegion)
+                    appendParityRegion(child);
+                else
+                    appendCurveChain(child);
             }
         }
-        else if (parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_4__.CurveChain) {
-            result.chains.push(StrokeCountChain.createForCurveChain(parent, options));
+        else if (parent instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_4__.ParityRegion) {
+            appendParityRegion(parent);
+        }
+        else if (parent instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_5__.CurveChain) {
+            appendCurveChain(parent);
         }
         return result;
     }
@@ -234550,11 +234744,12 @@ class StrokeCountSection {
         for (let chainIndex = 0; chainIndex < numChainPerSection; chainIndex++) {
             const numPrimitive = sections[0].chains[chainIndex].maps.length;
             for (let primitiveIndex = 0; primitiveIndex < numPrimitive; primitiveIndex++) {
-                if (sections[0].chains[chainIndex].maps[primitiveIndex].componentData) {
-                    const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData.length;
-                    for (let i = 0; i < numComponent; i++)
+                const numComponent = sections[0].chains[chainIndex].maps[primitiveIndex].componentData?.length ?? 0;
+                if (numComponent > 0) {
+                    for (let i = 0; i < numComponent; i++) {
                         if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, i, callback))
                             return false;
+                    }
                 }
                 else {
                     if (!this.applyMultipassVisitorCallbackNoComponents(sections, chainIndex, primitiveIndex, undefined, callback))
@@ -234602,11 +234797,11 @@ class StrokeCountSection {
             return this.chains[0].getStrokes();
         }
         else {
-            const region = _ParityRegion__WEBPACK_IMPORTED_MODULE_3__.ParityRegion.create();
+            const region = _ParityRegion__WEBPACK_IMPORTED_MODULE_4__.ParityRegion.create();
             for (const c of this.chains) {
                 const strokes = c.getStrokes();
                 if (strokes instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_2__.LineString3d)
-                    region.tryAddChild(_Loop__WEBPACK_IMPORTED_MODULE_5__.Loop.create(strokes));
+                    region.tryAddChild(_Loop__WEBPACK_IMPORTED_MODULE_6__.Loop.create(strokes));
             }
             return region;
         }
@@ -234628,8 +234823,8 @@ class StrokeCountSection {
             if (strokeB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_2__.LineString3d) {
                 if (strokeA.numPoints() === strokeB.numPoints()) {
                     const n = strokeA.numPoints();
-                    const pointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
-                    const pointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
+                    const pointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+                    const pointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
                     const allPointA = strokeA.packedPoints;
                     const allPointB = strokeB.packedPoints;
                     for (let i = 0; i < n; i++) {
@@ -234641,8 +234836,8 @@ class StrokeCountSection {
                 }
             }
         }
-        else if (strokeA instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_3__.ParityRegion) {
-            if (strokeB instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_3__.ParityRegion) {
+        else if (strokeA instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_4__.ParityRegion) {
+            if (strokeB instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_4__.ParityRegion) {
                 const childrenA = strokeA.children;
                 const childrenB = strokeB.children;
                 const n = childrenA.length;
@@ -234655,8 +234850,8 @@ class StrokeCountSection {
                 }
             }
         }
-        else if (strokeA instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_4__.CurveChain) {
-            if (strokeB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_4__.CurveChain) {
+        else if (strokeA instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_5__.CurveChain) {
+            if (strokeB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_5__.CurveChain) {
                 const childrenA = strokeA.children;
                 const childrenB = strokeB.children;
                 const n = childrenA.length;
@@ -234859,10 +235054,11 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
-/* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
-/* harmony import */ var _StrokeOptions__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
+/* harmony import */ var _StrokeOptions__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -234875,6 +235071,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
  * Implementation class for computing XY area moments.
  * @internal
@@ -234930,7 +235127,7 @@ class RegionMomentsXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         segment.endPoint(this._point1);
         momentData.accumulateTriangleMomentsXY(undefined, this._point0, this._point1);
     }
-    /** Accumulate integrals from origin to all primitives in the chain. */
+    /** Accumulate integrals from origin to all primitives in the loop. */
     handleLoop(loop) {
         const momentData = this._activeMomentData = _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_3__.MomentData.create();
         momentData.needOrigin = false;
@@ -234940,7 +235137,7 @@ class RegionMomentsXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         return momentData;
     }
     handleAnyRegion(region) {
-        // guarantee there is no overlapping children
+        // guarantee there are no overlapping children and parity loops have been properly oriented
         const merged = _RegionOps__WEBPACK_IMPORTED_MODULE_4__.RegionOps.regionBooleanXY(region, undefined, _RegionOps__WEBPACK_IMPORTED_MODULE_4__.RegionBinaryOpType.Union);
         if (!merged)
             return undefined;
@@ -234950,7 +235147,9 @@ class RegionMomentsXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         for (const child of merged.children) {
             const childMoments = child.dispatchToGeometryHandler(this);
             if (childMoments) {
-                const sign0 = childMoments.signFactor(1.0);
+                // parity region hole sums subtract; all other regions add
+                const scale = (merged instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_6__.ParityRegion && childMoments.quantitySum < 0) ? -1.0 : 1.0;
+                const sign0 = childMoments.signFactor(scale);
                 summedMoments.accumulateProducts(childMoments, sign0);
             }
         }
@@ -234968,7 +235167,7 @@ class RegionMomentsXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     getStrokeOptions() {
         if (this._strokeOptions)
             return this._strokeOptions;
-        const options = _StrokeOptions__WEBPACK_IMPORTED_MODULE_6__.StrokeOptions.createForCurves();
+        const options = _StrokeOptions__WEBPACK_IMPORTED_MODULE_7__.StrokeOptions.createForCurves();
         // this is unusually fine for stroking, but appropriate for sum.
         options.angleTol = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(5.0);
         this._strokeOptions = options;
@@ -234979,7 +235178,7 @@ class RegionMomentsXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * * Stroke the curve and accumulate stroke array.
      */
     handleCurvePrimitive(cp) {
-        const strokes = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const strokes = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         const options = this.getStrokeOptions();
         cp.emitStrokes(strokes, options);
         this.handleLineString3d(strokes);
@@ -235021,27 +235220,28 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
 /* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_38__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_39__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ../geometry3d/PolylineCompressionByEdgeOffset */ "../../core/geometry/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
 /* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
 /* harmony import */ var _geometry3d_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 _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_17__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
-/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_39__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.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");
+/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_40__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
 /* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ./CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
+/* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
 /* harmony import */ var _CurveOps__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ./CurveOps */ "../../core/geometry/lib/esm/curve/CurveOps.js");
 /* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
 /* harmony import */ var _CurveWireMomentsXYZ__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./CurveWireMomentsXYZ */ "../../core/geometry/lib/esm/curve/CurveWireMomentsXYZ.js");
-/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
+/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_38__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
 /* harmony import */ var _internalContexts_ChainCollectorContext__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ./internalContexts/ChainCollectorContext */ "../../core/geometry/lib/esm/curve/internalContexts/ChainCollectorContext.js");
 /* harmony import */ var _internalContexts_PolygonOffsetContext__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./internalContexts/PolygonOffsetContext */ "../../core/geometry/lib/esm/curve/internalContexts/PolygonOffsetContext.js");
 /* harmony import */ var _internalContexts_TransferWithSplitArcs__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./internalContexts/TransferWithSplitArcs */ "../../core/geometry/lib/esm/curve/internalContexts/TransferWithSplitArcs.js");
+/* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
 /* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
@@ -235050,7 +235250,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _Query_ConsolidateAdjacentPrimitivesContext__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./Query/ConsolidateAdjacentPrimitivesContext */ "../../core/geometry/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js");
 /* 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_15__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.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 _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");
@@ -235099,6 +235299,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 /**
@@ -235400,16 +235601,17 @@ class RegionOps {
      * @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
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
-     * to connect interior loops to exterior loops.
+     * @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) {
-        let result;
+        const 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 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;
         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)
@@ -235417,15 +235619,13 @@ class RegionOps {
             if (Math.abs(area) < areaTol)
                 return;
             if (faceType === 1) {
-                const loop = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_15__.PlanarSubdivision.createLoopInFace(face);
-                if (loop) {
-                    if (!result)
-                        result = _UnionRegion__WEBPACK_IMPORTED_MODULE_14__.UnionRegion.create();
-                    result.tryAddChild(loop);
-                }
+                const loopOrParityRegion = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.createLoopOrParityRegionInFace(face, bridgeMask, visitMask);
+                if (loopOrParityRegion)
+                    result.tryAddChild(loopOrParityRegion);
             }
         });
-        return result ? this.simplifyRegion(result) : undefined;
+        context.graph.dropMask(visitMask);
+        return this.simplifyRegion(result);
     }
     /**
      * Return a polyface whose facets are a boolean operation between the input regions.
@@ -235458,7 +235658,7 @@ class RegionOps {
         const graph = _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionOpsFaceToFaceSearch.doBinaryBooleanBetweenMultiLoopInputs(inputA, _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union, operation, inputB, _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_13__.RegionGroupOpType.Union, true);
         if (!graph)
             return undefined;
-        const loopEdges = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_16__.HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, _topology_Graph__WEBPACK_IMPORTED_MODULE_17__.HalfEdgeMask.EXTERIOR);
+        const loopEdges = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_17__.HalfEdgeGraphSearch.collectExtendedBoundaryLoopsInGraph(graph, _topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.EXTERIOR);
         const allLoops = [];
         for (const graphLoop of loopEdges) {
             const points = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_18__.GrowableXYZArray();
@@ -235740,19 +235940,45 @@ class RegionOps {
         }
         return _geometry3d_SortablePolygon__WEBPACK_IMPORTED_MODULE_33__.SortablePolygon.sortAsAnyRegion(loopAndArea);
     }
+    /**
+     * Collect inputs that are nominally closed: regions, and physically closed curves.
+     * * 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) {
+        const regions = [];
+        if (!Array.isArray(curves))
+            curves = [curves];
+        for (const curve of curves) {
+            if (curve instanceof _Loop__WEBPACK_IMPORTED_MODULE_8__.Loop || curve instanceof _ParityRegion__WEBPACK_IMPORTED_MODULE_9__.ParityRegion || curve instanceof _UnionRegion__WEBPACK_IMPORTED_MODULE_14__.UnionRegion) {
+                regions.push(curve);
+            }
+            else if (curve instanceof _Path__WEBPACK_IMPORTED_MODULE_24__.Path) {
+                if (curve.isPhysicallyClosedCurve(tolerance))
+                    regions.push(_Loop__WEBPACK_IMPORTED_MODULE_8__.Loop.create(...curve.children));
+            }
+            else if (curve instanceof _CurvePrimitive__WEBPACK_IMPORTED_MODULE_27__.CurvePrimitive) {
+                if (curve.isPhysicallyClosedCurve(tolerance))
+                    regions.push(_Loop__WEBPACK_IMPORTED_MODULE_8__.Loop.create(curve));
+            }
+        }
+        return regions;
+    }
     /**
      * Find all xy-areas bounded by the unstructured, possibly intersecting curves.
      * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.
-     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
-     * input curves. Note that "holes" implied by inputs are _not_ preserved in output.
-     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
-     * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
-     * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
-     * SignedLoops object.
-     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
-     * primitives, stripped of parity context. This means holes are _not_ preserved in output.
+     * * "Holes" implied/bounded by inputs are _not_ preserved/discovered in output; in particular [[ParityRegion]]
+     * hole loops are treated like any other positive area loops.
+     * * A common use case of this method is to assemble the bounding negative-area "exterior" loop for each connected
+     * component of input curves. Passing `addBridges = true` decreases the number of connected components for nested
+     * input [[Loop]]s, and thus increases the likelihood of returning exactly one exterior loop. (This is why the
+     * default value for `addBridges` is `true`.)
+     * @param curvesAndRegions Any collection of curves. Each [[AnyRegion]] contributes its children _stripped of
+     * parity context_.
      * @param tolerance optional distance tolerance for coincidence.
-     * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
+     * @param addBridges whether to add line segments to connect nested input [[Loop]]s (default is `true`). When `false`,
+     * no line segments are added to the input curves, but the number of output components may be greater than expected.
+     * @returns array of [[SignedLoops]], each entry of which describes the areas bounded by a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
      * positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
@@ -235760,14 +235986,25 @@ 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) {
+    static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.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);
         const areaTol = this.computeXYAreaTolerance(range, tolerance);
-        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_35__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
-        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_15__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
-        return _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_15__.PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);
+        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;
+            });
+        }
+        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_36__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
+        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
+        return _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);
     }
     /**
      * Collect all `CurvePrimitives` in loosely typed input.
@@ -235823,12 +236060,12 @@ class RegionOps {
      * @param worldToLocal transform to apply to data before computing its range
      */
     static curveArrayRange(data, worldToLocal) {
-        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_36__.Range3d.create();
-        if (data instanceof _GeometryQuery__WEBPACK_IMPORTED_MODULE_37__.GeometryQuery)
+        const range = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_37__.Range3d.create();
+        if (data instanceof _GeometryQuery__WEBPACK_IMPORTED_MODULE_38__.GeometryQuery)
             data.extendRange(range, worldToLocal);
         else if (Array.isArray(data)) {
             for (const c of data) {
-                if (c instanceof _GeometryQuery__WEBPACK_IMPORTED_MODULE_37__.GeometryQuery)
+                if (c instanceof _GeometryQuery__WEBPACK_IMPORTED_MODULE_38__.GeometryQuery)
                     c.extendRange(range, worldToLocal);
                 else if (c instanceof _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d)
                     range.extendPoint(c, worldToLocal);
@@ -235864,7 +236101,7 @@ class RegionOps {
                     for (const polygon of polygons)
                         writablePolygons.push(_geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_18__.GrowableXYZArray.create(polygon));
                 }
-                const sortedPolygons = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_38__.PolygonOps.sortOuterAndHoleLoopsXY(writablePolygons);
+                const sortedPolygons = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_39__.PolygonOps.sortOuterAndHoleLoopsXY(writablePolygons);
                 if (sortedPolygons.length === 1) { // below requires exactly one outer loop!
                     if (graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_11__.Triangulator.createTriangulatedGraphFromLoops(sortedPolygons[0]))
                         _topology_Triangulation__WEBPACK_IMPORTED_MODULE_11__.Triangulator.flipTriangles(graph);
@@ -235947,7 +236184,7 @@ class RegionOps {
         if (!graph)
             return undefined;
         if (options?.maximizeConvexFacets)
-            _topology_Merging__WEBPACK_IMPORTED_MODULE_39__.HalfEdgeGraphOps.expandConvexFaces(graph);
+            _topology_Merging__WEBPACK_IMPORTED_MODULE_40__.HalfEdgeGraphOps.expandConvexFaces(graph);
         return _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_12__.PolyfaceBuilder.graphToPolyface(graph, options);
     }
     /**
@@ -235961,10 +236198,10 @@ class RegionOps {
         if (!graph)
             return undefined;
         if (maximize)
-            _topology_Merging__WEBPACK_IMPORTED_MODULE_39__.HalfEdgeGraphOps.expandConvexFaces(graph);
+            _topology_Merging__WEBPACK_IMPORTED_MODULE_40__.HalfEdgeGraphOps.expandConvexFaces(graph);
         const convexPolygons = [];
         graph.announceFaceLoops((_graph, seed) => {
-            if (!seed.isMaskSet(_topology_Graph__WEBPACK_IMPORTED_MODULE_17__.HalfEdgeMask.EXTERIOR))
+            if (!seed.isMaskSet(_topology_Graph__WEBPACK_IMPORTED_MODULE_15__.HalfEdgeMask.EXTERIOR))
                 convexPolygons.push(_geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_18__.GrowableXYZArray.create(seed.collectAroundFace((node) => { return node.getPoint3d(); })));
             return true;
         });
@@ -235989,9 +236226,11 @@ class ConsolidateAdjacentCurvePrimitivesOptions {
     consolidateLinearGeometry = true;
     /** True to consolidate contiguous compatible arcs into a single Arc3d. */
     consolidateCompatibleArcs = true;
+    /** True to consolidate the first and last primitives of a [[Loop]], allowing the start/end point to change. */
+    consolidateLoopSeam = false;
     /** Disable LineSegment3d and LineString3d point compression. */
     disableLinearCompression = false;
-    /** Tolerance for collapsing identical points (if `!disableLinearCompression`). */
+    /** 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;
@@ -236013,6 +236252,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   GraphComponentArray: () => (/* binding */ GraphComponentArray),
 /* harmony export */   RegionBooleanContext: () => (/* binding */ RegionBooleanContext),
 /* harmony export */   RegionGroup: () => (/* binding */ RegionGroup),
+/* harmony export */   RegionGroupMember: () => (/* binding */ RegionGroupMember),
 /* harmony export */   RegionGroupOpType: () => (/* binding */ RegionGroupOpType),
 /* harmony export */   RegionOpsFaceToFaceSearch: () => (/* binding */ RegionOpsFaceToFaceSearch)
 /* harmony export */ });
@@ -236025,15 +236265,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
 /* harmony import */ var _topology_RegularizeFace__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../topology/RegularizeFace */ "../../core/geometry/lib/esm/topology/RegularizeFace.js");
 /* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
 /* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
 /* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
 /* harmony import */ var _internalContexts_TransferWithSplitArcs__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./internalContexts/TransferWithSplitArcs */ "../../core/geometry/lib/esm/curve/internalContexts/TransferWithSplitArcs.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
 /* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
-/* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
+/* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
 /* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
 /* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /*---------------------------------------------------------------------------------------------
@@ -236537,6 +236777,94 @@ class RegionBooleanContext {
             this.extraGeometry.addMember(bridgeLine, true);
         }
     }
+    /**
+     * Simplify the graph by removing bridge edges that do not serve to connect inner and outer loops, i.e.:
+     * * the bridge edge is dangling
+     * * the bridge edge is adjacent to multiple faces
+     * * the bridge edge is adjacent to a negative area face
+     * @returns the number of extraneous bridge edges removed from the graph.
+     */
+    removeExtraneousBridgeEdges() {
+        const toHeal = [];
+        const interiorBridges = [];
+        // lambda test for boundary edge. Relies only on face loop orientation. Doesn't use HalfEdgeMasks!
+        const isExteriorEdge = (node) => {
+            if (this.faceAreaFunction(node) < 0.0)
+                return true;
+            if (!node.findAroundFace(node.edgeMate))
+                return this.faceAreaFunction(node.edgeMate) < 0.0;
+            return false;
+        };
+        // isolate dangling bridges, bridges separating different faces, and "exterior" bridges in the negative area face
+        this.graph.announceEdges((_graph, node) => {
+            if (node.edgeTag !== undefined) {
+                if (node.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail) {
+                    if (node.edgeTag.curve) {
+                        if (node.edgeTag.curve.parent instanceof RegionGroupMember) {
+                            if (node.edgeTag.curve.parent.parentGroup === this.extraGeometry) {
+                                if (node.isDangling || node.edgeMate.isDangling || !node.findAroundFace(node.edgeMate) || this.faceAreaFunction(node) < 0.0) {
+                                    toHeal.push(node.vertexSuccessor);
+                                    toHeal.push(node.edgeMate.vertexSuccessor);
+                                    node.isolateEdge();
+                                }
+                                else {
+                                    interiorBridges.push(node);
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+            return true;
+        });
+        // At this point, all bridges that were exterior are isolated, but this may have caused formerly
+        // interior bridges to become exterior. Now we successively isolate exterior bridges until none remain.
+        let numIsolatedThisPass;
+        do {
+            numIsolatedThisPass = 0;
+            for (const node of interiorBridges) {
+                if (!node.isIsolatedEdge && isExteriorEdge(node)) {
+                    toHeal.push(node.vertexSuccessor);
+                    toHeal.push(node.edgeMate.vertexSuccessor);
+                    node.isolateEdge();
+                    numIsolatedThisPass++;
+                }
+            }
+        } while (numIsolatedThisPass > 0);
+        // lambda to extend the detail interval on a side of a healed edge
+        const mergeDetails = (he, newFraction, newPoint) => {
+            if (he && he.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail && he.sortData !== undefined && newFraction !== undefined && newPoint) {
+                if (he.sortData > 0)
+                    he.edgeTag.captureFraction1Point1(newFraction, newPoint);
+                else
+                    he.edgeTag.captureFractionPoint(newFraction, newPoint);
+            }
+        };
+        // At this point all removable bridges are isolated. Clean up their original vertex loops, if possible.
+        for (const doomedA of toHeal) {
+            const doomedB = doomedA.vertexSuccessor;
+            if ( // are the geometries mergeable?
+            doomedA !== doomedB &&
+                doomedA.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail && doomedA.sortData !== undefined &&
+                doomedB.edgeTag instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail && doomedB.sortData !== undefined &&
+                doomedA.edgeTag.curve === doomedB.edgeTag.curve &&
+                doomedA.edgeTag.hasFraction1 && doomedB.edgeTag.hasFraction1 &&
+                doomedA.sortData * doomedB.sortData < 0 &&
+                ((doomedA.sortData > 0 && _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.isSmallRelative(doomedA.edgeTag.fraction - doomedB.edgeTag.fraction1)) ||
+                    (doomedA.sortData < 0 && _Geometry__WEBPACK_IMPORTED_MODULE_7__.Geometry.isSmallRelative(doomedA.edgeTag.fraction1 - doomedB.edgeTag.fraction)))) {
+                const survivorA = _topology_Graph__WEBPACK_IMPORTED_MODULE_0__.HalfEdge.healEdge(doomedA, false);
+                if (survivorA) {
+                    const endFractionA = (doomedA.sortData > 0) ? doomedA.edgeTag.fraction1 : doomedA.edgeTag.fraction;
+                    const endPointA = (doomedA.sortData > 0) ? doomedA.edgeTag.point1 : doomedA.edgeTag.point;
+                    mergeDetails(survivorA, endFractionA, endPointA);
+                    const endFractionB = (doomedB.sortData > 0) ? doomedB.edgeTag.fraction1 : doomedB.edgeTag.fraction;
+                    const endPointB = (doomedB.sortData > 0) ? doomedB.edgeTag.point1 : doomedB.edgeTag.point;
+                    mergeDetails(survivorA.edgeMate, endFractionB, endPointB);
+                }
+            }
+        }
+        return this.graph.deleteIsolatedEdges();
+    }
     /**
      * Markup and assembly steps for geometry in the RegionGroups.
      * * Annotate connection from group to curves.
@@ -236558,10 +236886,11 @@ class RegionBooleanContext {
                 }
             }
         }
-        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_16__.CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
-        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_17__.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
+        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_17__.CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
+        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_18__.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
         this.graph = graph;
         this.faceAreaFunction = faceAreaFromCurvedEdgeData;
+        this.removeExtraneousBridgeEdges();
     }
     _announceFaceFunction;
     /**
@@ -236649,7 +236978,7 @@ class RegionBooleanContext {
         const data = node.edgeTag;
         if (data instanceof RegionGroupMember)
             return updateRegionGroupMemberState(data);
-        if (data instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_18__.CurveLocationDetail) {
+        if (data instanceof _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_16__.CurveLocationDetail) {
             // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.
             const member = data.curve.parent;
             if (member instanceof RegionGroupMember)
@@ -238419,23 +238748,23 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         let reversed = false;
         const uu = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.hypotenuseSquaredXY(ux, uy);
         if (hab0 * hab0 <= maxDistanceSquared * uu) { // test distance of b0 to u
-            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e00x, e00y) / uu;
+            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.safeDivideFraction(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e00x, e00y), uu, 0.0);
             if (this.updatePointToSegmentDistance(0, b0, a0, a1, fractionA, maxDistanceSquared, closestApproach))
                 reversed = true;
         }
         if (hab1 * hab1 <= maxDistanceSquared * uu) { // test distance of b1 to u
-            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e01x, e01y) / uu;
+            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.safeDivideFraction(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e01x, e01y), uu, 0.0);
             if (this.updatePointToSegmentDistance(1, b1, a0, a1, fractionA, maxDistanceSquared, closestApproach))
                 reversed = true;
         }
         const vv = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.hypotenuseSquaredXY(vx, vy);
         if (hba0 * hba0 <= maxDistanceSquared * vv) { // test distance of a0 to v
-            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e00x, e00y) / vv;
+            const fractionB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.safeDivideFraction(-_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e00x, e00y), vv, 0.0);
             if (this.updatePointToSegmentDistance(0, a0, b0, b1, fractionB, maxDistanceSquared, closestApproach))
                 reversed = false;
         }
         if (hba1 * hba1 <= maxDistanceSquared * vv) { // test distance of a1 to v
-            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e10x, e10y) / vv;
+            const fractionB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.safeDivideFraction(-_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e10x, e10y), vv, 0.0);
             if (this.updatePointToSegmentDistance(1, a1, b0, b1, fractionB, maxDistanceSquared, closestApproach))
                 reversed = false;
         }
@@ -238513,7 +238842,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         return undefined;
     }
     /**
-     * Find the closest approach between `pointA` and `cpB`. Add the approach if it's within `fB0` and `fB1`.
+     * Find the closest xy approach between `pointA` and `cpB`. Add the approach if it's within `fB0` and `fB1`.
      * * Does not test the endpoints of `cpB`.
      * * The only types supported for `cpB` are Arc3d, LineSegment3d, and LineString3d.
      * * If `cpB` is a LineString3d, then the interval `[fB0, fB1]` must correspond to a segment of the line string.
@@ -238538,7 +238867,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         }
     }
     /**
-     * Compute intersection of two line segments.
+     * Compute closest xy approach of two line segments.
      * Filter by extension rules.
      * Record with fraction mapping.
      * * The fraction mappings allow portions of a linestring to be passed here.
@@ -246814,7 +247143,7 @@ class AngleSweep {
         result.setStartEndRadians(startRadians, endRadians);
         return result;
     }
-    /** Return the angle obtained by subtracting radians from this angle. */
+    /** Return the AngleSweep obtained by subtracting radians from the start and end angles of this sweep. */
     cloneMinusRadians(radians) {
         return new AngleSweep(this._radians0 - radians, this._radians1 - radians);
     }
@@ -248505,7 +248834,7 @@ __webpack_require__.r(__webpack_exports__);
  * For the equator circle, phi=0, cos(phi) = 1, sin(phi)=0
  *           f = u * cos(theta) + v * sin(theta).
  * with derivative
- *          df / dTheta = = u * sin(theta) + v * cos(theta)
+ *          df / dTheta = - u * sin(theta) + v * cos(theta)
  * whose zero is            tan(theta) = v/u
  * (and that has two solutions 180 degrees apart)
  * Then with that theta let      A = u * cos(theta) + v * sin(theta)
@@ -253161,6 +253490,7 @@ class IndexedXYZCollection {
      * @param index0 index of first point
      * @param index1 index of second point
      * @param tolerance max coordinate difference to be considered equal. For exact test, pass 0. Defaults to `Geometry.smallMetricDistance`.
+     * @returns whether the points are equal within tolerance, or `undefined` if either index is invalid.
      */
     almostEqualIndexIndex(index0, index1, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         if (index0 < 0 || index0 >= this.length || index1 < 0 || index1 >= this.length)
@@ -253169,6 +253499,19 @@ class IndexedXYZCollection {
             && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getYAtUncheckedPointIndex(index0), this.getYAtUncheckedPointIndex(index1), tolerance)
             && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getZAtUncheckedPointIndex(index0), this.getZAtUncheckedPointIndex(index1), tolerance);
     }
+    /**
+     * Test whether the xy-coordinates of the indexed points are equal within tolerance. The z-coordinates are ignored.
+     * @param index0 index of first point
+     * @param index1 index of second point
+     * @param tolerance max coordinate difference to be considered equal. For exact test, pass 0. Defaults to `Geometry.smallMetricDistance`.
+     * @returns whether the xy-coordinates of the points are equal within tolerance, or `undefined` if either index is invalid.
+     */
+    almostEqualXYIndexIndex(index0, index1, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        if (index0 < 0 || index0 >= this.length || index1 < 0 || index1 >= this.length)
+            return undefined;
+        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getXAtUncheckedPointIndex(index0), this.getXAtUncheckedPointIndex(index1), tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.getYAtUncheckedPointIndex(index0), this.getYAtUncheckedPointIndex(index1), tolerance);
+    }
 }
 /**
  * abstract base class extends IndexedXYZCollection, adding methods to push, peek, and pop, and rewrite.
@@ -265707,13 +266050,11 @@ class Ray3d {
         return new Ray3d(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.createZero(), _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.createZero());
     }
     /**
-     * Test for nearly equal Ray3d objects.
-     * * This tests for near equality of origin and direction -- i.e. member-by-member comparison.
-     * * Use [[isAlmostEqualPointSet]] to allow origins to be anywhere along the common ray and to have to allow the
-     * directions to be scaled or opposing.
+     * Test for nearly equal Ray3d objects by comparing their origin and direction members.
+     * @see [[isAlmostEqualPointSet]] to test for rays on the same infinite line.
      */
-    isAlmostEqual(other) {
-        return this.origin.isAlmostEqual(other.origin) && this.direction.isAlmostEqual(other.direction);
+    isAlmostEqual(other, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        return this.origin.isAlmostEqual(other.origin, tolerance) && this.direction.isAlmostEqual(other.direction, tolerance);
     }
     /**
      * Return the dot product of the ray's direction vector with a vector from the ray origin
@@ -265741,27 +266082,19 @@ class Ray3d {
         return this.origin.plusScaled(this.direction, this.pointToFraction(spacePoint));
     }
     /**
-     * Test for nearly equal rays, allowing origin float and direction scaling.
-     * * Use [[isAlmostEqual]] to require member-by-member comparison.
+     * Test for rays that describe the same infinite line.
+     * @see [[isAlmostEqual]] for member-by-member comparison.
      */
-    isAlmostEqualPointSet(other) {
-        /**
-         * This function tests two rays to determine if they define the same infinite lines.
-         * So the origins can be different as long as they are on the infinite line (they can
-         * "float") but the directions must be parallel or antiparallel.
-         */
-        if (!this.direction.isParallelTo(other.direction, true))
+    isAlmostEqualPointSet(other, options) {
+        if (!this.direction.isParallelTo(other.direction, true, false, options))
             return false;
-        /**
-         * In exact math, we consider a ray to have an infinite line as direction (not a finite vector).
-         * Therefore, in exact math it is not possible for one origin to be on the other ray but not vice
-         * versa. However, we test both ways because first check may pass due to round-off errors.
-         */
+        const tol2 = options?.distanceSquaredTol ?? _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistanceSquared;
+        // theoretically, one test below is sufficient, but perform both in case the first passes because of round-off
         let workPoint = this.projectPointToRay(other.origin);
-        if (!other.origin.isAlmostEqualMetric(workPoint))
+        if (other.origin.distanceSquared(workPoint) > tol2)
             return false;
         workPoint = other.projectPointToRay(this.origin);
-        if (!this.origin.isAlmostEqualMetric(workPoint))
+        if (this.origin.distanceSquared(workPoint) > tol2)
             return false;
         return true;
     }
@@ -266456,19 +266789,25 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   SortablePolygon: () => (/* binding */ SortablePolygon)
 /* harmony export */ });
-/* harmony import */ var _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../curve/CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
-/* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
-/* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
-/* harmony import */ var _curve_RegionOps__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
-/* harmony import */ var _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../curve/UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
-/* harmony import */ var _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
-/* harmony import */ var _PolygonOps__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../curve/CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
+/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
+/* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
+/* harmony import */ var _curve_RegionOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../curve/RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../curve/UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
+/* harmony import */ var _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
+/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _PolygonOps__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _Ray3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+
 
 
 
@@ -266478,14 +266817,37 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** abstract base class for area-related queries of a loop.
- * * subclasses have particular logic for `Loop` and polygon data.
+
+/** Abstract base class for area-related queries of an xy-loop.
+ * * Subclasses have particular logic for `Loop` and polygon data.
  * @internal
  */
 class SimpleRegionCarrier {
+    /** Fractions for interior point search. */
+    searchFractions = [0.2349, 0.4142, 0.6587, 0.8193];
+    /**
+     * Given a region boundary tangent, construct a point interior to the region.
+     * @param ray point and tangent on an edge of the region (modified on return)
+     */
+    constructInteriorPoint(ray) {
+        ray.direction.z = 0.0;
+        if (!ray.direction.normalizeInPlace())
+            return undefined; // loop has zero length edge, or a vertical (gap) edge
+        ray.direction.rotate90CCWXY(ray.direction);
+        if (this.signedArea < 0.0)
+            ray.direction.scaleInPlace(-1.0); // aim toward the region interior
+        const refDistance = Math.sqrt(Math.abs(this.signedArea));
+        const candidatePoint = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+        for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {
+            ray.fractionToPoint(fraction * refDistance, candidatePoint);
+            if (1 === this.classifyPointXY(candidatePoint))
+                return candidatePoint;
+        }
+        return undefined;
+    }
 }
 /**
- * Implement `LoopCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`
+ * Implement `SimpleRegionCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`.
  */
 class PolygonCarrier extends SimpleRegionCarrier {
     data;
@@ -266494,7 +266856,7 @@ class PolygonCarrier extends SimpleRegionCarrier {
     constructor(data) {
         super();
         this.data = data;
-        this._signedArea = _PolygonOps__WEBPACK_IMPORTED_MODULE_0__.PolygonOps.areaXY(data);
+        this._signedArea = _PolygonOps__WEBPACK_IMPORTED_MODULE_1__.PolygonOps.areaXY(data);
     }
     /**
      * classify xy parts of point wrt this loop.
@@ -266502,22 +266864,22 @@ class PolygonCarrier extends SimpleRegionCarrier {
      * @internal
      */
     classifyPointXY(xy) {
-        return _PolygonOps__WEBPACK_IMPORTED_MODULE_0__.PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);
+        return _PolygonOps__WEBPACK_IMPORTED_MODULE_1__.PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);
     }
-    /** Return some point "inside"
-     * NEEDS WORK: this returns a point ON --
-     */
+    /** Return some point "inside". */
     getAnyInteriorPoint() {
         for (let childIndex = 0; childIndex < this.data.length; childIndex++) {
-            const q = this.constructInteriorPointNearEdge(childIndex, 0.2349);
-            if (q !== undefined)
-                return q;
+            for (const fraction of this.searchFractions) {
+                const q = this.constructInteriorPointNearEdge(childIndex, fraction);
+                if (q !== undefined)
+                    return q;
+            }
         }
         return undefined;
     }
     grabPolygon() { return this.data; }
     grabLoop() {
-        return _curve_Loop__WEBPACK_IMPORTED_MODULE_1__.Loop.createPolygon(this.data);
+        return _curve_Loop__WEBPACK_IMPORTED_MODULE_2__.Loop.createPolygon(this.data);
     }
     reverseForAreaSign(targetSign) {
         if (targetSign * this._signedArea < 0.0) {
@@ -266527,27 +266889,14 @@ class PolygonCarrier extends SimpleRegionCarrier {
     }
     constructInteriorPointNearEdge(edgeIndex, fractionAlong) {
         if (edgeIndex + 1 < this.data.length) {
-            const point0 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex);
-            const point1 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex + 1);
-            const vector = point0.vectorTo(point1);
-            const point = point0.interpolate(fractionAlong, point1);
-            vector.rotate90CCWXY(vector);
-            if (vector.normalizeInPlace()) {
-                if (this._signedArea < 0)
-                    vector.scaleInPlace(-1.0);
-                const refDistance = Math.sqrt(Math.abs(this._signedArea));
-                for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {
-                    const candidatePoint = point.plusScaled(vector, fraction * refDistance);
-                    if (1 === this.classifyPointXY(candidatePoint))
-                        return candidatePoint;
-                }
-            }
+            const ray = _Ray3d__WEBPACK_IMPORTED_MODULE_3__.Ray3d.createCapture(this.data.interpolateIndexIndex(edgeIndex, fractionAlong, edgeIndex + 1), this.data.vectorIndexIndex(edgeIndex, edgeIndex + 1));
+            return this.constructInteriorPoint(ray);
         }
         return undefined;
     }
 }
 /**
- * Implement `LoopCarrier` queries with the area as a strongly typed `Loop`
+ * Implement `SimpleRegionCarrier` queries with the area as a strongly typed `Loop`.
  */
 class LoopCarrier extends SimpleRegionCarrier {
     data;
@@ -266556,7 +266905,7 @@ class LoopCarrier extends SimpleRegionCarrier {
     constructor(data) {
         super();
         this.data = data;
-        const areaMoments = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_2__.RegionOps.computeXYAreaMoments(data);
+        const areaMoments = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_4__.RegionOps.computeXYAreaMoments(data);
         this._signedArea = areaMoments !== undefined ? areaMoments.quantitySum : 0.0;
     }
     /**
@@ -266565,41 +266914,32 @@ class LoopCarrier extends SimpleRegionCarrier {
      * @internal
      */
     classifyPointXY(xy) {
-        return _curve_RegionOps__WEBPACK_IMPORTED_MODULE_2__.RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);
+        return _curve_RegionOps__WEBPACK_IMPORTED_MODULE_4__.RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);
     }
     constructInteriorPointNearChild(childIndex, fractionAlong) {
         if (childIndex < this.data.children.length) {
-            const primitive = this.data.children[childIndex];
-            const ray = primitive.fractionToPointAndUnitTangent(fractionAlong);
-            ray.direction.rotate90CCWXY(ray.direction);
-            if (this._signedArea < 0.0)
-                ray.direction.scaleInPlace(-1.0);
-            const refDistance = Math.sqrt(Math.abs(this._signedArea));
-            for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {
-                const candidatePoint = ray.fractionToPoint(fraction * refDistance);
-                if (1 === this.classifyPointXY(candidatePoint))
-                    return candidatePoint;
-            }
+            const ray = this.data.children[childIndex].fractionToPointAndDerivative(fractionAlong);
+            return this.constructInteriorPoint(ray);
         }
         return undefined;
     }
-    /** Return some point "inside"
-     * NEEDS WORK: this returns a point ON --
-     */
+    /** Return some point "inside". */
     getAnyInteriorPoint() {
         for (let childIndex = 0; childIndex < this.data.children.length; childIndex++) {
-            const q = this.constructInteriorPointNearChild(childIndex, 0.2349);
-            if (q !== undefined)
-                return q;
+            for (const fraction of this.searchFractions) {
+                const q = this.constructInteriorPointNearChild(childIndex, fraction);
+                if (q !== undefined)
+                    return q;
+            }
         }
         return undefined;
     }
     grabPolygon() {
         const strokes = this.data.cloneStroked();
-        if (strokes instanceof _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_3__.CurveChain) {
-            const linestring = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_4__.LineString3d.create();
+        if (strokes instanceof _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_5__.CurveChain) {
+            const linestring = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_6__.LineString3d.create();
             for (const child of strokes.children) {
-                if (child instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_5__.CurvePrimitive) {
+                if (child instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_7__.CurvePrimitive) {
                     child.emitStrokes(linestring);
                 }
             }
@@ -266618,7 +266958,7 @@ class LoopCarrier extends SimpleRegionCarrier {
     }
 }
 /**
- * A `SortablePolygon` carries a (single) loop with data useful for sorting for inner-outer structure.
+ * A `SortablePolygon` carries a (single) xy-loop with data useful for sorting for inner-outer structure.
  * @internal
  */
 class SortablePolygon {
@@ -266634,7 +266974,7 @@ class SortablePolygon {
      * @param loop Loop to capture.
      */
     constructor(loop, range) {
-        if (loop instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_6__.IndexedReadWriteXYZCollection)
+        if (loop instanceof _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_8__.IndexedReadWriteXYZCollection)
             this._loopCarrier = new PolygonCarrier(loop);
         else
             this._loopCarrier = new LoopCarrier(loop);
@@ -266739,7 +267079,7 @@ class SortablePolygon {
                     const childData = loops[childIndex];
                     if (childData.parentIndex === candidateIndex) {
                         if (candidateParityRegion === undefined) {
-                            candidateParityRegion = _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_7__.ParityRegion.create();
+                            candidateParityRegion = _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_9__.ParityRegion.create();
                             candidateParityRegion.tryAddChild(candidateLoop);
                             childData._loopCarrier.reverseForAreaSign(-1.0);
                             candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());
@@ -266764,7 +267104,7 @@ class SortablePolygon {
         if (regions.length === 1)
             return regions[0];
         else {
-            const unionRegion = _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_8__.UnionRegion.create();
+            const unionRegion = _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_10__.UnionRegion.create();
             for (const region of regions)
                 unionRegion.tryAddChild(region);
             return unionRegion;
@@ -280449,7 +280789,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     /** Construct facets for a rotational sweep. */
     addRotationalSweep(surface) {
         const contour = surface.getSweepContourRef();
-        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour.getCurves(), this._options);
+        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.create(contour.getCurves(), this._options);
         const baseStrokes = section0.getStrokes();
         // ensure sweep is positive for buildRotationalNormalsInLineStrings
         const axis = surface.cloneAxisRay();
@@ -280599,7 +280939,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     /** Add facets from the linear sweep. */
     addLinearSweep(surface) {
         const contour = surface.getCurvesRef();
-        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour, this._options);
+        const section0 = _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.create(contour, this._options);
         const stroke0 = section0.getStrokes();
         const sweepVector = surface.cloneSweepVector();
         const sweepTransform = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_9__.Transform.createTranslation(sweepVector);
@@ -280621,7 +280961,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         let stroke1;
         const sectionMaps = [];
         for (const contour of contours)
-            sectionMaps.push(_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour.curves, this._options));
+            sectionMaps.push(_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.create(contour.curves, this._options));
         if (_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.enforceStrokeCountCompatibility(sectionMaps)) {
             _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.enforceCompatibleDistanceSums(sectionMaps);
             for (let i = 0; i < contours.length; i++) {
@@ -302156,7 +302496,7 @@ class Sphere extends _SolidPrimitive__WEBPACK_IMPORTED_MODULE_0__.SolidPrimitive
         const sinTheta = Math.sin(thetaRadians);
         const sinPhi = Math.sin(phiRadians);
         const cosPhi = Math.cos(phiRadians);
-        return _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_11__.Plane3dByOriginAndVectors.createOriginAndVectors(this._localToWorld.multiplyXYZ(cosTheta * cosPhi, sinTheta * cosPhi, sinPhi), this._localToWorld.matrix.multiplyXYZ(-fTheta * sinTheta, fTheta * cosTheta, 0), // !!! note cosTheta term is omitted -- scale is wrong, but remains non-zero at poles.
+        return _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_11__.Plane3dByOriginAndVectors.createOriginAndVectors(this._localToWorld.multiplyXYZ(cosTheta * cosPhi, sinTheta * cosPhi, sinPhi), this._localToWorld.matrix.multiplyXYZ(-fTheta * sinTheta, fTheta * cosTheta, 0), // NOTE: cosPhi scale is omitted, so the u-derivative scale is wrong but at least at the poles it's nonzero
         this._localToWorld.matrix.multiplyXYZ(-fPhi * cosTheta * sinPhi, -fPhi * sinTheta * sinPhi, fPhi * cosPhi), result);
     }
     /**
@@ -302411,7 +302751,7 @@ class SweepContour {
     /**
      * Emit facets to a function.
      * This method may cache and reuse facets over multiple calls.
-     * @param announce callback to receive the facet set.
+     * @param announce callback to receive the facet set. Called only once (if facets exist).
      * @param options how to stroke the contour.
      */
     announceFacets(announce, options) {
@@ -303177,13 +303517,14 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   HalfEdgeGraph: () => (/* binding */ HalfEdgeGraph),
 /* harmony export */   HalfEdgeMask: () => (/* binding */ HalfEdgeMask)
 /* harmony export */ });
-/* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
-/* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../numerics/SmallSystem */ "../../core/geometry/lib/esm/numerics/SmallSystem.js");
-/* harmony import */ var _MaskManager__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./MaskManager */ "../../core/geometry/lib/esm/topology/MaskManager.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
+/* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../numerics/SmallSystem */ "../../core/geometry/lib/esm/numerics/SmallSystem.js");
+/* harmony import */ var _MaskManager__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./MaskManager */ "../../core/geometry/lib/esm/topology/MaskManager.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -303198,9 +303539,9 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 // import { GraphChecker } from "../test/topology/Graph.test"; // used for debugging
 /* eslint-disable @typescript-eslint/no-this-alias */
-// cspell:word CONSTU CONSTV USEAM VSEAM internaldocs
 /**
  * * Each node of the graph has a mask member.
  * * The mask member is a number which is used as set of single bit boolean values.
@@ -303215,14 +303556,6 @@ __webpack_require__.r(__webpack_exports__);
  */
 var HalfEdgeMask;
 (function (HalfEdgeMask) {
-    // REMARK: Various mask names are COMMENTED here for reference to native legacy code.
-    // CONSTU_MASK = 0x00000004,
-    // CONSTV_MASK = 0x00000008,
-    // USEAM_MASK = 0x00000010,
-    // VSEAM_MASK = 0x00000020,
-    // BOUNDARY_VERTEX_MASK = 0x00000040,
-    // PRIMARY_VERTEX_MASK = 0x00000080,
-    // DIRECTED_EDGE_MASK = 0x00000100,
     /**
      * Mask commonly set consistently around exterior faces.
      * * A boundary edge with interior to one side, exterior to the other, will have EXTERIOR only on the outside.
@@ -303245,22 +303578,22 @@ var HalfEdgeMask;
      * BOUNDARY_EDGE nor EXTERIOR_EDGE.
      */
     HalfEdgeMask[HalfEdgeMask["PRIMARY_EDGE"] = 4] = "PRIMARY_EDGE";
-    /** Mask used for low level searches to identify previously-visited nodes. */
-    HalfEdgeMask[HalfEdgeMask["VISITED"] = 16] = "VISITED";
+    /** Mask set on both sides of a bridge edge added by algorithms to join loops. */
+    HalfEdgeMask[HalfEdgeMask["BRIDGE_EDGE"] = 8] = "BRIDGE_EDGE";
+    /** Mask set on both sides of an edge added during graph regularization. */
+    HalfEdgeMask[HalfEdgeMask["REGULARIZED_EDGE"] = 16] = "REGULARIZED_EDGE";
     /** Mask applied to triangles by earcut triangulator. */
     HalfEdgeMask[HalfEdgeMask["TRIANGULATED_FACE"] = 256] = "TRIANGULATED_FACE";
     /** Mask applied in a face with 2 edges. */
     HalfEdgeMask[HalfEdgeMask["NULL_FACE"] = 512] = "NULL_FACE";
+    /** Temporary mask used for low level searches to identify previously-visited nodes. */
+    HalfEdgeMask[HalfEdgeMask["VISITED"] = 65536] = "VISITED";
     /** No mask bits. */
     HalfEdgeMask[HalfEdgeMask["NULL_MASK"] = 0] = "NULL_MASK";
     /** The "upper 12" bits of 32 bit integer reserved for grab/drop. */
     HalfEdgeMask[HalfEdgeMask["ALL_GRAB_DROP_MASKS"] = 4293918720] = "ALL_GRAB_DROP_MASKS";
     /** All mask bits */
     HalfEdgeMask[HalfEdgeMask["ALL_MASK"] = 4294967295] = "ALL_MASK";
-    // informal convention on preassigned mask bit numbers:
-    // byte0 (EXTERIOR, BOUNDARY_EDGE, PRIMARY_EDGE) -- edge properties
-    // byte1 (VISITED, VISIT_A, WORK_MASK0, WORK_MASK1) -- temp masks for algorithms.
-    // byte2 (TRIANGULATED_FACE, NULL_FACE) -- face properties.
 })(HalfEdgeMask || (HalfEdgeMask = {}));
 /**
  * A HalfEdge is "one side of an edge" in a structure of faces, edges and vertices. From a node there are
@@ -303456,6 +303789,37 @@ class HalfEdge {
         }
         return newA;
     }
+    /**
+     * Reverse of [[splitEdge]]: remove the vertex at `doomed` and merge its two incident edges.
+     * @param doomed one of two nodes added by [[splitEdge]]. These nodes should form a vertex loop of two nodes.
+     * On successful return this node and its mate are isolated.
+     * @param checkParallel whether to check that the doomed edge and the preceding edge in its face loop are parallel.
+     * When passing `true` the assumption is that edge geometry is linear. If nonlinear edge geometry is attached, the
+     * caller should a) verify that the geometry on either side of the doomed vertex can be merged, and if so, they
+     * should b) call this method passing `false`, and c) adjust the geometry of the returned edge and its edge mate
+     * as appropriate.
+     * @returns the former (surviving) face predecessor of `doomed`, or undefined if the edge can't be healed.
+     */
+    static healEdge(doomed, checkParallel = true) {
+        if (doomed.isIsolatedEdge)
+            return undefined;
+        const doomed1 = doomed.vertexSuccessor;
+        if (doomed1.vertexSuccessor !== doomed)
+            return undefined; // v-loop not a 2-cycle
+        if (checkParallel && !doomed.vectorToFaceSuccessor().isParallelTo(doomed.facePredecessor.vectorToFaceSuccessor(), false, true))
+            return undefined; // removing this vertex does not leave a straight edge behind
+        const fPred = doomed.facePredecessor;
+        const fSucc = doomed.faceSuccessor;
+        const fPred1 = doomed1.facePredecessor;
+        const fSucc1 = doomed1.faceSuccessor;
+        this.setFaceLinks(fPred, fSucc);
+        this.setFaceLinks(fPred1, fSucc1);
+        this.setEdgeMates(fPred, fPred1);
+        this.setFaceLinks(doomed, doomed1);
+        this.setFaceLinks(doomed1, doomed);
+        this.setEdgeMates(doomed, doomed1);
+        return fPred;
+    }
     /**
      * Create a new sliver face "inside" an existing edge.
      * * This creates two nodes that are each face predecessor and successor to the other.
@@ -303483,14 +303847,14 @@ class HalfEdge {
         newB.copyDataFrom(baseB, true, true, false, false);
         return newA;
     }
-    /** Edge property masks. */
+    /** Masks copied when an edge is split. */
     static _edgePropertyMasks = [
-        HalfEdgeMask.BOUNDARY_EDGE, HalfEdgeMask.EXTERIOR, HalfEdgeMask.PRIMARY_EDGE, HalfEdgeMask.NULL_FACE,
+        HalfEdgeMask.EXTERIOR, HalfEdgeMask.BOUNDARY_EDGE, HalfEdgeMask.PRIMARY_EDGE, HalfEdgeMask.BRIDGE_EDGE, HalfEdgeMask.REGULARIZED_EDGE, HalfEdgeMask.NULL_FACE
     ];
     /**
      * Copy "edge based" content of `fromNode` to `toNode`:
      * * edgeTag
-     * * masks EXTERIOR, BOUNDARY_EDGE, NULL_FACE, PRIMARY_EDGE
+     * * edge masks
      */
     static transferEdgeProperties(fromNode, toNode) {
         toNode.edgeTag = fromNode.edgeTag;
@@ -303663,7 +304027,7 @@ class HalfEdge {
     /**
      * Returns the number of nodes that match (or do not match) the given mask value around this face loop.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     countMaskAroundFace(mask, value = true) {
         let count = 0;
@@ -303710,16 +304074,17 @@ class HalfEdge {
     }
     /**
      * Returns the first node that matches (or does not match) the given mask value around this vertex loop, starting
-     * with the instance node and proceeding via vertex successors.
+     * with the instance node and proceeding via `vertexSuccessor`.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
+     * @param reverse if true, search in reverse order via `vertexPredecessor`. Default is `false`.
      */
-    findMaskAroundVertex(mask, value = true) {
+    findMaskAroundVertex(mask, value = true, reverse = false) {
         let node = this;
         do {
             if (node.isMaskSet(mask) === value)
                 return node;
-            node = node.vertexSuccessor;
+            node = reverse ? node.vertexPredecessor : node.vertexSuccessor;
         } while (node !== this);
         return undefined;
     }
@@ -303727,7 +304092,7 @@ class HalfEdge {
      * Returns the first node that matches (or does not match) the given mask value around this face loop, starting
      * with the instance node and proceeding via face successors.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     findMaskAroundFace(mask, value = true) {
         let node = this;
@@ -303839,6 +304204,10 @@ class HalfEdge {
             predA._faceSuccessor = nodeB;
         }
     }
+    /** Return whether the edge is dangling at its base. */
+    get isDangling() {
+        return this.edgeMate.faceSuccessor === this;
+    }
     /**
      * Pinch this half edge out of its base vertex loop.
      * @return the surviving HalfEdge in the vertex loop or `undefined` if the instance HalfEdge is already dangling.
@@ -303908,17 +304277,17 @@ class HalfEdge {
     }
     /** Return Vector2d from `this` to face successor (with only xy coordinates). */
     vectorToFaceSuccessorXY(result) {
-        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Vector2d.create(this.faceSuccessor.x - this.x, this.faceSuccessor.y - this.y, result);
+        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create(this.faceSuccessor.x - this.x, this.faceSuccessor.y - this.y, result);
     }
     /** Return Vector3d from `this` to face successor. */
     vectorToFaceSuccessor(result) {
         const other = this.faceSuccessor;
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(other.x - this.x, other.y - this.y, other.z - this.z, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(other.x - this.x, other.y - this.y, other.z - this.z, result);
     }
     /** Return Vector3d from `this` to face successor. */
     vectorToFacePredecessor(result) {
         const other = this.facePredecessor;
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(other.x - this.x, other.y - this.y, other.z - this.z, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(other.x - this.x, other.y - this.y, other.z - this.z, result);
     }
     /**
      * Test if `spaceNode` is in the sector of `sectorNode`.
@@ -303969,15 +304338,15 @@ class HalfEdge {
     }
     /** Returns 2D cross product of vectors from `base` to `targetA` and from `base` to `targetB`. */
     static crossProductXYToTargets(base, targetA, targetB) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
     }
     /** Returns 2D dot product of vectors from `baseA` to `targetA` and from `baseB` to `targetB`. */
     static dotProductNodeToNodeVectorsXY(baseA, targetA, baseB, targetB) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.dotProductXYXY(targetA.x - baseA.x, targetA.y - baseA.y, targetB.x - baseB.x, targetB.y - baseB.y);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(targetA.x - baseA.x, targetA.y - baseA.y, targetB.x - baseB.x, targetB.y - baseB.y);
     }
     /** Return 2D cross product of vectors from `nodeA` to `nodeB` and from `nodeB` to `nodeC`. */
     static crossProductXYAlongChain(nodeA, nodeB, nodeC) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(nodeB.x - nodeA.x, nodeB.y - nodeA.y, nodeC.x - nodeB.x, nodeC.y - nodeB.y);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(nodeB.x - nodeA.x, nodeB.y - nodeA.y, nodeC.x - nodeB.x, nodeC.y - nodeB.y);
     }
     /**
      * Compute whether the sector defined by the chain of nodes is convex.
@@ -304014,7 +304383,7 @@ class HalfEdge {
      */
     isSectorConvex(signedAreaTol) {
         if (signedAreaTol === undefined)
-            signedAreaTol = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared * this.signedFaceArea();
+            signedAreaTol = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared * this.signedFaceArea();
         return HalfEdge.isSectorConvex(this.facePredecessor, this, this.faceSuccessor, signedAreaTol);
     }
     /**
@@ -304026,7 +304395,7 @@ class HalfEdge {
      * `Geometry.smallMetricDistanceSquared`. Pass 0 to skip toleranced computation.
      * @returns true iff this face is convex.
      */
-    isFaceConvex(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared) {
+    isFaceConvex(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared) {
         let node = this;
         const signedAreaTol = tolerance > 0.0 ? tolerance * node.signedFaceArea() : 0.0;
         do {
@@ -304042,7 +304411,10 @@ class HalfEdge {
         this.yankFromVertexLoop();
         mate.yankFromVertexLoop();
     }
-    /** Specify whether this edge is isolated from the rest of the graph. */
+    /**
+     * Specify whether this edge is isolated from the rest of the graph.
+     * * Both edge mates of an isolated edge return true for [[isDangling]].
+     */
     get isIsolatedEdge() {
         return this === this.vertexSuccessor && this.edgeMate === this.edgeMate.vertexSuccessor;
     }
@@ -304072,7 +304444,7 @@ class HalfEdge {
     static sectorSweepRadiansXYZ(node, normal) {
         const suc = node.faceSuccessor;
         const pred = node.facePredecessor;
-        return _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.orientedRadiansBetweenVectorsXYZ(suc.x - node.x, suc.y - node.y, suc.z - node.z, pred.x - node.x, pred.y - node.y, pred.z - node.z, normal.x, normal.y, normal.z, true);
+        return _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_4__.Angle.orientedRadiansBetweenVectorsXYZ(suc.x - node.x, suc.y - node.y, suc.z - node.z, pred.x - node.x, pred.y - node.y, pred.z - node.z, normal.x, normal.y, normal.z, true);
     }
     /** Returns true if the face has positive area in xy parts. */
     static testFacePositiveAreaXY(node) {
@@ -304084,11 +304456,76 @@ class HalfEdge {
     }
     /** Return distance between xy coordinates of `this` and `other` node. */
     distanceXY(other) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.distanceXYXY(this.x, this.y, other.x, other.y);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.distanceXYXY(this.x, this.y, other.x, other.y);
     }
     /** Return distance between xyz coordinates of `this` and `other` node. */
     distanceXYZ(other) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.distanceXYZXYZ(this.x, this.y, this.z, other.x, other.y, other.z);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.distanceXYZXYZ(this.x, this.y, this.z, other.x, other.y, other.z);
+    }
+    /**
+     * Search around the instance's face loop for nodes with the specified mask value.
+     * * Returned nodes satisfy `node.isMaskSet(mask) === value`.
+     * @param mask target mask.
+     * @param value target boolean value for mask on half edges (default `true`).
+     * @param result optional array to be cleared, populated with masked nodes, and returned.
+     * @return array of masked half edges
+     */
+    collectMaskedEdgesAroundFace(mask, value = true, result) {
+        if (result === undefined)
+            result = [];
+        else
+            result.length = 0;
+        let node = this;
+        do {
+            if (node.isMaskSet(mask) === value)
+                result.push(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+        return result;
+    }
+    /**
+     * Announce edges in the face loop, starting with the instance and proceeding in a `faceSuccessor` traversal.
+     * @param announceEdge function to call at each edge
+     */
+    announceEdgesInFace(announceEdge) {
+        let node = this;
+        do {
+            announceEdge(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+    }
+    /**
+     * Announce edges in the super face loop, starting with the instance.
+     * * A super face admits a `faceSuccessor` traversal, where the next edge at the far vertex is the first one lacking `skipMask` in a `vertexPredecessor` traversal.
+     * @param skipMask mask on edges to skip.
+     * @param announceEdge function to call at each edge that is not skipped.
+     * @param announceSkipped optional function to call at each edge that is skipped.
+     * @return whether a super face was found. Specifically, if a vertex loop has all edges with `skipMask` set, the return value is `false`.
+     */
+    announceEdgesInSuperFace(skipMask, announceEdge, announceSkipped) {
+        const maxIter = 1000; // safeguard against infinite loops
+        let iter = 0;
+        const findNextNodeAroundVertex = (he) => {
+            let vNode = he;
+            do {
+                if (!vNode.isMaskSet(skipMask))
+                    return vNode;
+                announceSkipped?.(vNode);
+                vNode = vNode.vertexPredecessor;
+            } while (vNode !== he);
+            return undefined;
+        };
+        const firstNode = findNextNodeAroundVertex(this);
+        if (!firstNode)
+            return false;
+        let node = firstNode;
+        do {
+            announceEdge(node);
+            node = findNextNodeAroundVertex(node.faceSuccessor);
+            if (!node)
+                return false;
+        } while (node !== firstNode && iter++ < maxIter);
+        return iter < maxIter;
     }
     /**
      * Evaluate `f(node)` at each node around `this` node's face loop. Collect the function values.
@@ -304229,7 +304666,7 @@ class HalfEdge {
      */
     fractionToPoint2d(fraction, result) {
         const suc = this.faceSuccessor;
-        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Point2d.create(this.x + (suc.x - this.x) * fraction, this.y + (suc.y - this.y) * fraction, result);
+        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Point2d.create(this.x + (suc.x - this.x) * fraction, this.y + (suc.y - this.y) * fraction, result);
     }
     /**
      * Interpolate xyz coordinates between `this` node and its face successor.
@@ -304238,7 +304675,7 @@ class HalfEdge {
      */
     fractionToPoint3d(fraction, result) {
         const suc = this.faceSuccessor;
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(this.x + (suc.x - this.x) * fraction, this.y + (suc.y - this.y) * fraction, this.z + (suc.z - this.z) * fraction, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this.x + (suc.x - this.x) * fraction, this.y + (suc.y - this.y) * fraction, this.z + (suc.z - this.z) * fraction, result);
     }
     /**
      * Interpolate xy coordinates at `fractionAlong` between this node and its face successor. Then shift perpendicular
@@ -304251,25 +304688,25 @@ class HalfEdge {
         const suc = this.faceSuccessor;
         const dx = suc.x - this.x;
         const dy = suc.y - this.y;
-        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Point2d.create(this.x + dx * fractionAlong - dy * fractionPerpendicular, this.y + dy * fractionAlong + dx * fractionPerpendicular, result);
+        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Point2d.create(this.x + dx * fractionAlong - dy * fractionPerpendicular, this.y + dy * fractionAlong + dx * fractionPerpendicular, result);
     }
     /** Return the 3d coordinates at this half edge. */
     getPoint3d(result) {
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(this.x, this.y, this.z, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this.x, this.y, this.z, result);
     }
     /** Return the 2d coordinates at this half edge. */
     getPoint2d(result) {
-        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Point2d.create(this.x, this.y, result);
+        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Point2d.create(this.x, this.y, result);
     }
     /** Return a 3d vector from start to end of this half edge. */
     getVector3dAlongEdge(result) {
         const suc = this.faceSuccessor;
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(suc.x - this.x, suc.y - this.y, suc.z - this.z, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(suc.x - this.x, suc.y - this.y, suc.z - this.z, result);
     }
     /** Return a 2d vector from start to end of this half edge. */
     getVector2dAlongEdge(result) {
         const suc = this.faceSuccessor;
-        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Vector2d.create(suc.x - this.x, suc.y - this.y, result);
+        return _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create(suc.x - this.x, suc.y - this.y, result);
     }
     /**
      * Return the interpolated x coordinate between `this` node and its face successor.
@@ -304307,12 +304744,12 @@ class HalfEdge {
         const nodeA1 = nodeA0.faceSuccessor;
         const nodeB1 = nodeB0.faceSuccessor;
         if (!result)
-            result = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_0__.Vector2d.create();
+            result = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create();
         // To find the fraction of intersection (ta,tb), you need to solve these 2 equations:
         // (nodeA1.x - nodeA0.x)ta + (nodeB0.x - nodeB1.x)tb = nodeB0.x - nodeA0.x
         // (nodeA1.y - nodeA0.y)ta + (nodeB0.y - nodeB1.y)tb = nodeB0.y - nodeA0.y
         // Proof can be found at geometry/internaldocs/Graph.md
-        if (_numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_4__.SmallSystem.linearSystem2d(nodeA1.x - nodeA0.x, nodeB0.x - nodeB1.x, nodeA1.y - nodeA0.y, nodeB0.y - nodeB1.y, nodeB0.x - nodeA0.x, nodeB0.y - nodeA0.y, result))
+        if (_numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_5__.SmallSystem.linearSystem2d(nodeA1.x - nodeA0.x, nodeB0.x - nodeB1.x, nodeA1.y - nodeA0.y, nodeB0.y - nodeB1.y, nodeB0.x - nodeA0.x, nodeB0.y - nodeA0.y, result))
             return result;
         return undefined;
     }
@@ -304326,13 +304763,13 @@ class HalfEdge {
     static horizontalScanFraction(node0, y) {
         const node1 = node0.faceSuccessor;
         const dy = node1.y - node0.y;
-        if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(y, node0.y) && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(y, node1.y))
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(y, node0.y) && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(y, node1.y))
             return node0;
-        if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(dy, 0.0))
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(dy, 0.0))
             return undefined;
         // parametric equation of line is (1-t)y0 + ty1 which is equal to y at the intersection so
         // (1-t)y0 + ty1 = y or t = (y-y0)/(y1-y0)
-        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideFraction(y - node0.y, dy);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.conditionalDivideFraction(y - node0.y, dy);
     }
     /**
      * Compute fractional position (inside 0..1) of the intersection of a horizontal line with an edge.
@@ -304344,11 +304781,11 @@ class HalfEdge {
     static horizontalScanFraction01(node0, y) {
         const node1 = node0.faceSuccessor;
         const dy = node1.y - node0.y;
-        if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(y, node0.y) && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(y, node1.y))
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(y, node0.y) && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(y, node1.y))
             return undefined;
-        if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(dy, 0.0))
+        if (_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSameCoordinate(dy, 0.0))
             return undefined;
-        const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.conditionalDivideFraction(y - node0.y, dy);
+        const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.conditionalDivideFraction(y - node0.y, dy);
         if (fraction !== undefined && fraction >= 0.0 && fraction <= 1.0)
             return fraction;
         return undefined;
@@ -304367,16 +304804,37 @@ class HalfEdge {
             this.y = source.y;
             this.z = source.z;
         }
-        if (copyVertexData) {
+        if (copyVertexData)
             this.i = source.i;
-        }
-        if (copyEdgeData) {
+        if (copyEdgeData)
             HalfEdge.transferEdgeProperties(source, this);
-            this.edgeTag = source.edgeTag;
-        }
-        if (copyFaceData) {
+        if (copyFaceData)
             this.faceTag = source.faceTag;
+    }
+    /**
+     * Is the instance's face loop a split-washer type face?
+     * * A split-washer face contains at least one bridge edge.
+     * * A bridge edge and its edge mate have the same `bridgeMask` and live in the same face loop.
+     * * By connecting hole/outer loops with bridge edges, a split-washer face can represent a parity region.
+     * @param bridgeMask mask preset on bridge edges (default is [[HalfEdgeMask.BRIDGE_EDGE]]).
+     */
+    isSplitWasherFace(bridgeMask = HalfEdgeMask.BRIDGE_EDGE) {
+        if (!this.countMaskAroundFace(HalfEdgeMask.BRIDGE_EDGE))
+            return false;
+        const bridges = new _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.OrderedSet((a, b) => a.id - b.id);
+        let node = this;
+        do {
+            if (node.isMaskSet(bridgeMask))
+                bridges.add(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+        if (bridges.size === 0)
+            return false;
+        for (const bridge of bridges) {
+            if (!bridges.has(bridge.edgeMate) || !bridge.edgeMate.isMaskSet(bridgeMask))
+                return false;
         }
+        return true;
     }
 }
 /**
@@ -304392,11 +304850,11 @@ class HalfEdgeGraph {
     _numNodesCreated = 0;
     constructor() {
         this.allHalfEdges = [];
-        this._maskManager = _MaskManager__WEBPACK_IMPORTED_MODULE_5__.MaskManager.create(HalfEdgeMask.ALL_GRAB_DROP_MASKS);
+        this._maskManager = _MaskManager__WEBPACK_IMPORTED_MODULE_6__.MaskManager.create(HalfEdgeMask.ALL_GRAB_DROP_MASKS);
     }
     /**
      * Ask for a mask (from the graph's free pool) for caller's use.
-     * * Optionally clear the mask throughout the graph.
+     * @param clearInAllHalfEdges optionally clear the mask throughout the graph (default `true`).
      */
     grabMask(clearInAllHalfEdges = true) {
         const mask = this._maskManager.grabMask();
@@ -304562,7 +305020,7 @@ class HalfEdgeGraph {
         const segments = [];
         for (const node of this.allHalfEdges) {
             if (node.id < node.edgeMate.id)
-                segments.push(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(node.x, node.y), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(node.faceSuccessor.x, node.faceSuccessor.y)));
+                segments.push(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_7__.LineSegment3d.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(node.x, node.y), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(node.faceSuccessor.x, node.faceSuccessor.y)));
         }
         return segments;
     }
@@ -305050,8 +305508,8 @@ class HalfEdgeGraphSearch {
      * pattern starting at the seed face, with each successive concentric ring of faces at constant topological
      * distance from the seed face receiving the opposite parity state of the previous ring.
      * @param parityMask (optional) mask to apply to the first face and faces that share the same parity as the
-     * first face, as determined by the parity rule. If this is `NULL_MASK`, there is no record of parity. If
-     * (non-null) parity mask is given, on return it is entirely set or entirely clear around each face.
+     * first face, as determined by the parity rule. If this is `NULL_MASK` (default), there is no record of parity.
+     * If (non-null) parity mask is given, on return it is entirely set or entirely clear around each face.
      * @returns the components of the graph, each component represented by an array of nodes, one node per face
      * of the component. In other words, entry [i][j] is a HalfEdge in the j_th face loop of the i_th component.
      */
@@ -307809,8 +308267,9 @@ class RegularizationContext {
         if (nodeA1 !== undefined && nodeB1 !== undefined) {
             _Graph__WEBPACK_IMPORTED_MODULE_1__.HalfEdge.pinch(nodeA1, nodeC);
             _Graph__WEBPACK_IMPORTED_MODULE_1__.HalfEdge.pinch(nodeB1, nodeC.edgeMate);
+            nodeC.setMaskAroundEdge(_Graph__WEBPACK_IMPORTED_MODULE_1__.HalfEdgeMask.REGULARIZED_EDGE);
             if (RegularizationContext.announceEdge)
-                RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);
+                RegularizationContext.announceEdge(this.graph, nodeC, nodeC.edgeMate, direction);
             return nodeC;
         }
         return undefined;
@@ -331259,7 +331718,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.1.0-dev.51",
+            applicationVersion: "5.1.0-dev.53",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.serviceAuthToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -356346,7 +356805,7 @@ var loadLanguages = instance.loadLanguages;
 /***/ ((module) => {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.1.0-dev.51","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module 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","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run","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.0.0-dev.1","@types/chai-as-promised":"^7","@types/sinon":"^17.0.2","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.13.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":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
+module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.1.0-dev.53","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module 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","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run","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.0.0-dev.1","@types/chai-as-promised":"^7","@types/sinon":"^17.0.2","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.13.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":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
 
 /***/ }),
 
@@ -357429,62 +357888,6 @@ describe("DevTools", () => {
 
 })();
 
-// This entry needs to be wrapped in an IIFE because it needs to be in strict mode.
-(() => {
-"use strict";
-var exports = {};
-/*!****************************************!*\
-  !*** ./lib/frontend/CodeSpecs.test.js ***!
-  \****************************************/
-
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-Object.defineProperty(exports, "__esModule", ({ value: true }));
-const chai = __webpack_require__(/*! chai */ "../../common/temp/node_modules/.pnpm/chai@4.3.10/node_modules/chai/index.js");
-const core_common_1 = __webpack_require__(/*! @itwin/core-common */ "../../core/common/lib/esm/core-common.js");
-const TestContext_1 = __webpack_require__(/*! ./setup/TestContext */ "./lib/frontend/setup/TestContext.js");
-const expect = chai.expect;
-describe("Get Code Specs", () => {
-    let testContext;
-    before(async function () {
-        testContext = await TestContext_1.TestContext.instance();
-        if (!testContext.settings.runiModelReadRpcTests)
-            this.skip();
-    });
-    const existing = {
-        name: core_common_1.BisCodeSpec.subject,
-        id: "0x1f",
-    };
-    /** verify that given codespec has expected properties */
-    function verifyCodeSpec(codeSpec, requestedIModel, requestedName, requestedId) {
-        expect(codeSpec).to.exist;
-        expect(codeSpec.id).to.exist;
-        expect(codeSpec.id).to.equal(requestedId);
-        expect(codeSpec.name).to.exist;
-        expect(codeSpec.name).to.equal(requestedName);
-        expect(codeSpec.iModel).to.exist;
-        expect(codeSpec.iModel.name).to.equal(requestedIModel.name);
-    }
-    it("should return code spec by name", async () => {
-        const iModel = await testContext.iModelWithChangesets.getConnection();
-        const codeSpecName = existing.name;
-        const codeSpecId = existing.id;
-        const codeSpec = await iModel.codeSpecs.getByName(codeSpecName);
-        verifyCodeSpec(codeSpec, iModel, codeSpecName, codeSpecId);
-    });
-    it("should return code spec by id", async () => {
-        const iModel = await testContext.iModelWithChangesets.getConnection();
-        const codeSpecName = existing.name;
-        const codeSpecId = existing.id;
-        const codeSpec = await iModel.codeSpecs.getById(codeSpecId);
-        verifyCodeSpec(codeSpec, iModel, codeSpecName, codeSpecId);
-    });
-});
-
-})();
-
 // This entry needs to be wrapped in an IIFE because it needs to be in strict mode.
 (() => {
 "use strict";