@itwin/ecschema-rpcinterface-tests 4.1.0-dev.70 → 4.1.0-dev.72

package/lib/dist/bundled-tests.js

@@ -21,10 +21,10 @@
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.9/node_modules/@itwin/certa/lib/utils/CallbackUtils.js":
-/*!********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.9/node_modules/@itwin/certa/lib/utils/CallbackUtils.js ***!
-  \********************************************************************************************************************/
+/***/ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.11/node_modules/@itwin/certa/lib/utils/CallbackUtils.js":
+/*!*********************************************************************************************************************!*\
+  !*** ../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.11/node_modules/@itwin/certa/lib/utils/CallbackUtils.js ***!
+  \*********************************************************************************************************************/
 /***/ ((__unused_webpack_module, exports, __webpack_require__) => {
 
 "use strict";
@@ -2825,7 +2825,7 @@ exports.getAccessTokenFromBackend = exports.getTokenCallbackName = void 0;
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
-const CallbackUtils_1 = __webpack_require__(/*! @itwin/certa/lib/utils/CallbackUtils */ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.9/node_modules/@itwin/certa/lib/utils/CallbackUtils.js");
+const CallbackUtils_1 = __webpack_require__(/*! @itwin/certa/lib/utils/CallbackUtils */ "../../common/temp/node_modules/.pnpm/@itwin+certa@3.7.11/node_modules/@itwin/certa/lib/utils/CallbackUtils.js");
 // Shared by both the frontend and backend side of the tests
 exports.getTokenCallbackName = "getToken";
 async function getAccessTokenFromBackend(user, oidcConfig) {
@@ -18151,8 +18151,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ Browser)
 /* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/createClass.js");
 
 
 
@@ -73168,17 +73168,25 @@ class AccuSnap {
         }
     }
 }
-/** @internal */
+/** TentativeOrAccuSnap returns information about an active snap generated by either [[AccuSnap]] or [[TentativePoint]].
+ * @public
+ */
 class TentativeOrAccuSnap {
+    /** @return true if AccuSnap is *hot* or TentativePoint is active and snapped to pickable geometry. */
     static get isHot() { return _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.isHot || _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.isSnapped; }
+    /** Get the current snap from either AccuSnap or TentativePoint.
+     * @param checkIsHot true to only return the snap from AccuSnap when it is *hot*.
+     * @return The current snap from AccuSnap, TentativePoint, or undefined.
+     */
     static getCurrentSnap(checkIsHot = true) {
-        // Checking for a hot AccuSnap hit before checking tentative is probably necessary for extended intersections?
+        // Checking for a hot AccuSnap before checking TentativePoint is done to support extended intersections...
         if (_IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.isHot)
             return _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.getCurrSnapDetail();
         if (_IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.isSnapped)
             return _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.currSnap;
         return (checkIsHot ? undefined : _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.getCurrSnapDetail());
     }
+    /** @return The current snap location from AccuSnap or TentativePoint */
     static getCurrentPoint() {
         if (_IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.isHot) {
             const snap = _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.getCurrSnapDetail();
@@ -73187,6 +73195,7 @@ class TentativeOrAccuSnap {
         }
         return _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.getPoint();
     }
+    /** @return The current snap Viewport from AccuSnap or TentativePoint */
     static getCurrentView() {
         const snap = _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.accuSnap.getCurrSnapDetail();
         return snap ? snap.viewport : _IModelApp__WEBPACK_IMPORTED_MODULE_4__.IModelApp.tentativePoint.viewport;
@@ -95297,7 +95306,7 @@ class GltfParser {
         if (dracoMeshes.length === 0)
             return;
         try {
-            const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_4_node_modules_loaders_gl_draco_di-6aa0d4"), __webpack_require__.e("_05e2")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.4/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
+            const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_7_node_modules_loaders_gl_draco_di-02c2bd"), __webpack_require__.e("_0062")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.7/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
             await Promise.all(dracoMeshes.map(async (x) => this.decodeDracoMesh(x, dracoLoader)));
         }
         catch (err) {
@@ -138411,7 +138420,7 @@ class GltfReader {
         if (dracoMeshes.length === 0)
             return;
         try {
-            const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_4_node_modules_loaders_gl_draco_di-6aa0d4"), __webpack_require__.e("_05e2")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.4/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
+            const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_7_node_modules_loaders_gl_draco_di-02c2bd"), __webpack_require__.e("_0062")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.7/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
             await Promise.all(dracoMeshes.map(async (x) => this.decodeDracoMesh(x, dracoLoader)));
         }
         catch (err) {
@@ -141289,7 +141298,7 @@ function readPnts(stream, dataOffset, pnts) {
 }
 async function decodeDracoPointCloud(buf) {
     try {
-        const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_4_node_modules_loaders_gl_draco_di-6aa0d4"), __webpack_require__.e("_05e2")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.4/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
+        const dracoLoader = (await Promise.all(/*! import() */[__webpack_require__.e("vendors-common_temp_node_modules_pnpm_loaders_gl_draco_3_4_7_node_modules_loaders_gl_draco_di-02c2bd"), __webpack_require__.e("_0062")]).then(__webpack_require__.bind(__webpack_require__, /*! @loaders.gl/draco */ "../../common/temp/node_modules/.pnpm/@loaders.gl+draco@3.4.7/node_modules/@loaders.gl/draco/dist/esm/index.js"))).DracoLoader;
         const mesh = await dracoLoader.parse(buf, {});
         if (mesh.topology !== "point-list")
             return undefined;
@@ -175740,7 +175749,7 @@ __webpack_require__.r(__webpack_exports__);
 /**
  * An AlternatingConvexClipTreeNode is a node in a tree structure in which
  *   <ul>
- *   <li>Each node contains a ConvexClipPlaneSet
+ *   <li>Each node contains a ConvexClipPlaneSet.
  *   <li>Each node contains an array of children which are also AlternatingConvexClipTreeNode.
  *   <li>The rule for an in/out decision is that a point is IN the subtree under a node if
  *   <ul>
@@ -175786,9 +175795,7 @@ class AlternatingCCTreeNode {
         builder.buildHullTree(result); // <-- Currently ALWAYS returns true
         return result;
     }
-    /**
-     * Build the outer convex hull will inlets as first level children
-     */
+    /** Build the outer convex hull with inlets as first level children. */
     static createHullAndInletsForPolygon(points, result) {
         result = result ? result : new AlternatingCCTreeNode();
         result.empty();
@@ -175803,14 +175810,15 @@ class AlternatingCCTreeNode {
     }
     /**
      * Return an array with all the loops in the tree.
-     * This looses the alternating structure of the tree, but the collection still matches well-formed polygons by parity rules.
+     * This loses the alternating structure of the tree, but the collection still matches well-formed polygons by
+     * parity rules.
      */
     extractLoops() {
         const loops = [];
         this.extractLoopsGo(loops);
         return loops;
     }
-    /** Resets this AlternatingConvexClipTreeNode to a newly-created state */
+    /** Resets this AlternatingConvexClipTreeNode to a newly-created state. */
     empty() {
         this.points.length = 0;
         this.planes.planes.length = 0;
@@ -175837,7 +175845,7 @@ class AlternatingCCTreeNode {
         const newNode = AlternatingCCTreeNode.createWithIndices(index0, numPoints);
         this.children.push(newNode);
     }
-    /** Add a plane to the ConvexClipPlaneSet */
+    /** Add a plane to the ConvexClipPlaneSet. */
     addPlane(plane) {
         this.planes.addPlaneToConvexSet(plane);
     }
@@ -175852,7 +175860,8 @@ class AlternatingCCTreeNode {
         }
         return true;
     }
-    /** Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
+    /**
+     * Add an AlternatingConvexClipTreeNode as a child of this one -- i.e. a hole.
      * * The child pointer is pushed directly to the tree -- not cloned.
      */
     captureConvexClipPlaneSetAsVoid(child) {
@@ -175869,10 +175878,11 @@ class AlternatingCCTreeNode {
         clipper.appendCurveCollectionClip(this, curves, insideIntervals, outsideIntervals);
     }
     /**
-     *
-     * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param xyz input polygon. This is not changed.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed
+     * from the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
@@ -175905,9 +175915,6 @@ class AlternatingCCTreeNode {
             }
         }
     }
-    /**
-     *
-     */
     depth() {
         const myDepth = 1;
         let maxChildDepth = 0;
@@ -175938,9 +175945,15 @@ class AlternatingCCTreeBuilder {
             result._points.pop();
         return result;
     }
-    get period() { return this._points.length; }
-    indexAfter(i) { return (i + 1) % this._points.length; }
-    indexBefore(i) { return (i + this._points.length - 1) % this._points.length; }
+    get period() {
+        return this._points.length;
+    }
+    indexAfter(i) {
+        return (i + 1) % this._points.length;
+    }
+    indexBefore(i) {
+        return (i + this._points.length - 1) % this._points.length;
+    }
     pushIndex(primaryPointIndex) {
         this._stack.push(primaryPointIndex);
     }
@@ -176174,8 +176187,8 @@ class AlternatingCCTreeNodeCurveClipper {
         return false;
     }
     /**
-     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack has clip for this node
-     * (expensive -- must clone items of arrays during "swaps")
+     * Run one level of recursion. On return, the stack is one level deeper than at entry and the new top of the stack
+     * has clip for this node (expensive -- must clone items of arrays during "swaps").
      */
     recurse(node) {
         this.pushEmptySegmentFrame();
@@ -176265,25 +176278,26 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
+/**
+ * A BooleanClipFactory is a factory to create objects that implement interior nodes of a tree of boolean clip operations.
  * * These methods create specific clip tree types:
  *   * Union
  *   * Intersection
  *   * Parity
  *   * Difference
- * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection, parity, or difference:
- *   * if `keepInside === true`, accept the "inside" of the initial result
- *   * if `keepInside === false`, accept the "outside"  of the initial result
- * * These methods create various other specialized clippers
- *   *
+ * * Each construction has a `keepInside` flag that optionally negates the initial result of the parity, intersection,
+ * parity, or difference:
+ *   * if `keepInside === true`, accept the "inside" of the initial result.
+ *   * if `keepInside === false`, accept the "outside"  of the initial result.
+ * * These methods create various other specialized clippers.
  * @public
  */
 class BooleanClipFactory {
     /**
-     * Create a boolean clipper which performs a union over its children
-     * * if `keepInside === true`, accept the "inside" of the union result
-     * * if `keepInside === false`, accept the "outside" of the union result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a union over its children.
+     * * if `keepInside === true`, accept the "inside" of the union result.
+     * * if `keepInside === false`, accept the "outside" of the union result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureUnion(clippers, keepInside) {
@@ -176292,10 +176306,10 @@ class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs an intersection over its children
-     * * if `keepInside === true`, accept the "inside" of the intersection result
-     * * if `keepInside === false`, accept the "outside" of the intersection result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs an intersection over its children.
+     * * if `keepInside === true`, accept the "inside" of the intersection result.
+     * * if `keepInside === false`, accept the "outside" of the intersection result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureIntersection(clippers, keepInside) {
@@ -176304,10 +176318,10 @@ class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs a parity over its children
-     * * if `keepInside === true`, accept the "inside" of the parity result
-     * * if `keepInside === false`, accept the "outside" of the parity result
-     * @param clippers clip objects to capture
+     * Create a boolean clipper which performs a parity over its children.
+     * * if `keepInside === true`, accept the "inside" of the parity result.
+     * * if `keepInside === false`, accept the "outside" of the parity result.
+     * @param clippers clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureParity(clippers, keepInside) {
@@ -176316,10 +176330,11 @@ class BooleanClipFactory {
         return result;
     }
     /**
-     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and "outside `excludedClipper`"
-     * * if `keepInside === true`, accept the "inside" of the difference
-     * * if `keepInside === false`, accept the "outside" of the difference
-     * @param primaryClipper any clip object whose output is treated as positive
+     * Create a boolean clipper which performs a difference operation for points "inside `primaryClipper`" and
+     * "outside `excludedClipper`".
+     * * if `keepInside === true`, accept the "inside" of the difference.
+     * * if `keepInside === false`, accept the "outside" of the difference.
+     * @param primaryClipper any clip object whose output is treated as positive.
      * @param excludeClip any clipper whose output is treated as negative.
      * @param keepInside flag to select results inside or outside the initial `primary minus excludeClipper` clippers.
      */
@@ -176328,19 +176343,17 @@ class BooleanClipFactory {
         return this.createCaptureIntersection([primaryClipper, mask], keepInside);
     }
     /**
-     * Create a boolean clipper which performs the reverse of that of `primaryClipper`
-     * @param primaryClipper clip objects to capture
+     * Create a boolean clipper which performs the reverse of that of `primaryClipper`.
+     * @param primaryClipper clip objects to capture.
      * @param keepInside flag to select results inside or outside the clippers.
      */
     static createCaptureClipOutside(primaryClipper) {
         return this.createCaptureUnion([primaryClipper], false);
     }
     /**
-     * convert `source` to an array of clipper objects.
+     * Convert `source` to an array of clipper objects.
      * * ANY TYPE OF Clipper is accepted.
      * * REMARK: This is normally called only from the primary public method `parseToClipper`.
-     * @param source
-     * @param internal
      */
     static parseToClipperArray(source) {
         if (Array.isArray(source)) {
@@ -176364,7 +176377,7 @@ class BooleanClipFactory {
         return undefined;
     }
     /**
-     * look for content that represents a clipper.
+     * Look for content that represents a clipper.
      * * Possible outputs are
      *   * `ClipPlane`
      *   * `ConvexClipPlaneSet`
@@ -176524,7 +176537,7 @@ class BooleanClipNode {
             this._clippers.push(child);
         }
     }
-    /** toggle the "keepInside" behavior.  Return the prior value.  */
+    /** Toggle the "keepInside" behavior.  Return the prior value.  */
     toggleResult() {
         return this.selectResult(!this._keepInside);
     }
@@ -176535,7 +176548,7 @@ class BooleanClipNode {
         return s;
     }
     /**
-     * * Conditionally (if a1 > a0 strictly) call announce (a0, a1).
+     * Conditionally (if a1 > a0 strictly) call announce (a0, a1).
      * * Return 0 if not called, 1 if called.
      */
     testedAnnounceNN(a0, a1, announce) {
@@ -176547,7 +176560,7 @@ class BooleanClipNode {
         return 0;
     }
     /**
-     * * Conditionally (if a1 > a0 strictly) call announce (a0, a1, cp).
+     * Conditionally (if a1 > a0 strictly) call announce (a0, a1, cp).
      * * Return 0 if not called, 1 if called.
      */
     testedAnnounceNNC(a0, a1, cp, announce) {
@@ -176565,8 +176578,8 @@ class BooleanClipNode {
         this._intervalsB = q;
     }
     /**
-     * * announce all "outside intervals" --not masked by intervals
-     * * return true if any intervals announced.
+     * Announce all "outside intervals" --not masked by intervals
+     * * Return true if any intervals announced.
      */
     announcePartsNN(keepInside, intervals, f0, f1, announce) {
         let numAnnounce = 0;
@@ -176587,8 +176600,8 @@ class BooleanClipNode {
         return numAnnounce > 0;
     }
     /**
-     * * announce all "outside intervals" --not masked by intervals
-     * * return true if any intervals announced.
+     * Announce all "outside intervals" --not masked by intervals
+     * * Return true if any intervals announced.
      */
     announcePartsNNC(keepInside, intervals, f0, f1, cp, announce) {
         let numAnnounce = 0;
@@ -176613,7 +176626,7 @@ class BooleanClipNode {
         const q = this.isPointOnOrInsideChildren(point);
         return this._keepInside ? q : !q;
     }
-    /** Announce "in" portions of a line segment.  See `Clipper.announceClippedSegmentIntervals` */
+    /** Announce "in" portions of a line segment. See `Clipper.announceClippedSegmentIntervals` */
     announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce) {
         this._intervalsA.length = 0;
         const announceIntervalB = (a0, a1) => {
@@ -176671,7 +176684,7 @@ class BooleanClipNodeUnion extends BooleanClipNode {
     constructor(keepInside) {
         super(keepInside);
     }
-    /** return true if inside any child clipper */
+    /** Return true if inside any child clipper */
     isPointOnOrInsideChildren(point) {
         for (const clipper of this._clippers) {
             if (clipper.isPointOnOrInside(point))
@@ -176695,7 +176708,7 @@ class BooleanClipNodeParity extends BooleanClipNode {
     constructor(keepInside) {
         super(keepInside);
     }
-    /** return true if inside an odd number of clippers child clipper */
+    /** Return true if inside an odd number of clippers child clipper */
     isPointOnOrInsideChildren(point) {
         let q = false;
         for (const clipper of this._clippers) {
@@ -176720,7 +176733,7 @@ class BooleanClipNodeIntersection extends BooleanClipNode {
     constructor(keepInside) {
         super(keepInside);
     }
-    /** return false if outside of any child clipper */
+    /** Return false if outside of any child clipper */
     isPointOnOrInsideChildren(point) {
         for (const clipper of this._clippers) {
             if (!clipper.isPointOnOrInside(point))
@@ -176780,17 +176793,18 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** A ClipPlane is a single plane represented as
+/**
+ * A ClipPlane is a single plane represented as
  * * An inward unit normal (u,v,w)
  * * A signedDistance
  *
  * Hence
- * * The halfspace function evaluation for "point" [x,y,z,] is: ([x,y,z] DOT (u,v,w)l - signedDistance)
- * * POSITIVE values of the halfspace function are "inside"
- * * ZERO value of the halfspace function is "on"
- * * NEGATIVE value of the halfspace function is "outside"
- * * A representative point on the plane is (signedDistance*u, signedDistance * v, signedDistance *w)
- * * Given a point and inward normal, the signedDistance is (point DOT normal)
+ * * The halfspace function evaluation for "point" (x,y,z) is `(x,y,z) DOT (u,v,w) - signedDistance`.
+ * * POSITIVE values of the halfspace function are "inside".
+ * * ZERO value of the halfspace function is "on".
+ * * NEGATIVE value of the halfspace function is "outside".
+ * * A representative point on the plane is (signedDistance * u, signedDistance * v, signedDistance * w).
+ * * Given a point on the plane and the inward normal of the plane, `signedDistance = point DOT normal`.
  * @public
  */
 class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d {
@@ -176817,12 +176831,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
             && this._interior === other._interior
             && this._invisible === other._invisible;
     }
-    /** return a cloned plane */
+    /** Return a cloned plane */
     clone() {
         const result = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);
         return result;
     }
-    /** return Return a cloned plane with coordinate data negated. */
+    /** Return a cloned plane with coordinate data negated. */
     cloneNegated() {
         const plane = new ClipPlane(this._inwardNormal.clone(), this._distanceFromOrigin, this._invisible, this._interior);
         plane.negateInPlace();
@@ -176841,7 +176855,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         return new ClipPlane(plane.getNormalRef().clone(), distance, invisible, interior);
     }
     /**
-     * * Create a ClipPlane with direct normal and signedDistance.
+     * Create a ClipPlane with direct normal and signedDistance.
      * * The vector is normalized for storage.
      */
     static createNormalAndDistance(normal, distance, invisible = false, interior = false, result) {
@@ -176857,10 +176871,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         }
         return undefined;
     }
-    /** Create a ClipPlane
-     * * "normal" is the inward normal of the plane. (It is internally normalized)
+    /**
+     * Create a ClipPlane
+     * * "normal" is the inward normal of the plane (it is internally normalized).
      * * "point" is any point of the plane.
-     * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz as a vector from the origin.)
+     * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz as
+     * a vector from the origin.)
      */
     static createNormalAndPoint(normal, point, invisible = false, interior = false, result) {
         const normalized = normal.normalize();
@@ -176876,11 +176892,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         }
         return undefined;
     }
-    /** Create a clip plane
+    /**
+     * Create a clip plane
      * @param origin any point on the plane.
      * @param vectorA any vector in the plane
      * @param vectorB any vector in the plane
-     * * returns undefined if the vectors are not independent.
+     * Returns undefined if the vectors are not independent.
      * * The stored inward normal is vectorB.crossProduct(vectorA).
      * * That is, the vectors are considered as a right-handed pair when viewed from the outside.
      */
@@ -176888,11 +176905,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         const normalized = vectorB.crossProduct(vectorA);
         return this.createNormalAndPoint(normalized, origin, invisible, interior, result);
     }
-    /** Create a ClipPlane
-     * * "normal" (normalX, normalY, nz) is the inward normal of the plane.
-     * * The given (normalX,normalY,normalZ)
-     * * "point" is any point of the plane.
-     * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz as a vector from the origin.)
+    /**
+     * Create a ClipPlane
+     * * "normal" (normalX, normalY, normalZ) is the inward normal of the plane.
+     * * "point" (originX,originY,originZ) is any point of the plane.
+     * * The stored distance for the plane is the dot product of the point with the normal (i.e. treat the point's xyz
+     * as a vector from the origin.)
      */
     static createNormalAndPointXYZXYZ(normalX, normalY, normalZ, originX, originY, originZ, invisible = false, interior = false, result) {
         const q = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXYZ(normalX, normalY, normalZ);
@@ -176911,7 +176929,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         return undefined;
     }
     /**
-     * return a json object of the form
+     * Return a json object of the form
      * `{"normal":[u,v,w],"dist":signedDistanceValue,"interior":true,"invisible":true}`
      */
     toJSON() {
@@ -176925,7 +176943,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
             props.invisible = true;
         return props;
     }
-    /** parse json object to ClipPlane instance */
+    /** Parse json object to ClipPlane instance */
     static fromJSON(json, result) {
         if (json && json.normal && undefined !== json.dist && Number.isFinite(json.dist))
             return ClipPlane.createNormalAndDistance(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.fromJSON(json.normal), json.dist, !!json.invisible, !!json.interior);
@@ -176936,22 +176954,22 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         this._invisible = invisible;
         this._interior = interior;
     }
-    /**
-     * Return the stored distanceFromOrigin property.
-     */
-    get distance() { return this._distanceFromOrigin; }
-    /**
-     * Return the stored inward normal property.
-     */
-    get inwardNormalRef() { return this._inwardNormal; }
-    /**
-     * Return the "interior" property bit
-     */
-    get interior() { return this._interior; }
-    /**
-     * Return the "invisible" property bit.
-     */
-    get invisible() { return this._invisible; }
+    /** Return the stored distanceFromOrigin property. */
+    get distance() {
+        return this._distanceFromOrigin;
+    }
+    /** * Return the stored inward normal property. */
+    get inwardNormalRef() {
+        return this._inwardNormal;
+    }
+    /**  Return the "interior" property bit */
+    get interior() {
+        return this._interior;
+    }
+    /**  Return the "invisible" property bit. */
+    get invisible() {
+        return this._invisible;
+    }
     /**
      * Create a plane defined by two points, an up vector, and a tilt angle relative to the up vector.
      * @param point0 start point of the edge
@@ -176975,9 +176993,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         }
         return undefined;
     }
-    /**
-     * Create a plane perpendicular to the edge between the xy parts of point0 and point1
-     */
+    /** Create a plane perpendicular to the edge between the xy parts of point0 and point1. */
     static createEdgeXY(point0, point1, result) {
         const normal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(point0.y - point1.y, point1.x - point0.x);
         if (normal.normalizeInPlace())
@@ -176991,7 +177007,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
      */
     getPlane3d() {
         const d = this._distanceFromOrigin;
-        // Normal should be normalized, will not return undefined
+        // normal should be normalized, will not return undefined
         return _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_3__.Plane3dByOriginAndUnitNormal.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(this._inwardNormal.x * d, this._inwardNormal.y * d, this._inwardNormal.z * d), this._inwardNormal);
     }
     /**
@@ -177005,8 +177021,9 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
     /**
      * Set the plane from DPoint4d style plane.
      * * The saved plane has its direction normalized.
-     * * This preserves the plane itself as a zero set but make plane evaluations act as true distances (even if the plane coefficients are scaled otherwise)
-     * @param plane
+     * * This preserves the plane itself as a zero set but make plane evaluations act as true distances (even if the
+     * plane coefficients are scaled otherwise).
+     * @param plane the DPoint4d style plane.
      */
     setPlane4d(plane) {
         const a = Math.sqrt(plane.x * plane.x + plane.y * plane.y + plane.z * plane.z);
@@ -177017,49 +177034,63 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         this._distanceFromOrigin = -r * plane.w;
     }
     /**
-     * Evaluate the altitude in weighted space, i.e. (dot product with inward normal) minus distance, with point.w scale applied to distance)
-     * @param point space point to test
+     * Evaluate the altitude in weighted space, i.e. (dot product with inward normal) minus distance, with point.w
+     * scale applied to distance.
+     * @param point space point to test.
      */
     weightedAltitude(point) {
-        return point.x * this._inwardNormal.x + point.y * this._inwardNormal.y + point.z * this._inwardNormal.z - point.w * this._distanceFromOrigin;
+        return point.x * this._inwardNormal.x
+            + point.y * this._inwardNormal.y
+            + point.z * this._inwardNormal.z
+            - point.w * this._distanceFromOrigin;
     }
     /**
-     * Evaluate the distance from the plane to a point in space, i.e. (dot product with inward normal) minus distance
-     * @param point space point to test
+     * Evaluate the distance from the plane to a point in space, i.e. (dot product with inward normal) minus distance.
+     * @param point space point to test.
      */
     altitude(point) {
-        return point.x * this._inwardNormal.x + point.y * this._inwardNormal.y + point.z * this._inwardNormal.z - this._distanceFromOrigin;
+        return point.x * this._inwardNormal.x
+            + point.y * this._inwardNormal.y
+            + point.z * this._inwardNormal.z
+            - this._distanceFromOrigin;
     }
     /**
-     * Evaluate the distance from the plane to a point in space with point given as x,y,z, i.e. (dot product with inward normal) minus distance
-     * @param point space point to test
+     * Evaluate the distance from the plane to a point in space with point given as x,y,z, i.e. (dot product with
+     * inward normal) minus distance.
+     * @param point space point to test.
      */
     altitudeXYZ(x, y, z) {
-        return x * this._inwardNormal.x + y * this._inwardNormal.y + z * this._inwardNormal.z - this._distanceFromOrigin;
+        return x * this._inwardNormal.x
+            + y * this._inwardNormal.y
+            + z * this._inwardNormal.z
+            - this._distanceFromOrigin;
     }
-    /**
-     * Return the x component of the normal used to evaluate altitude.
-     */
-    normalX() { return this._inwardNormal.x; }
-    /**
-     * Return the x component of the normal used to evaluate altitude.
-     */
-    normalY() { return this._inwardNormal.y; }
-    /**
-     * Return the z component of the normal used to evaluate altitude.
-     */
-    normalZ() { return this._inwardNormal.z; }
-    /** Return the dot product of the plane normal with the vector (NOT using the plane's distanceFromOrigin).
-     */
+    /** Return the x component of the normal used to evaluate altitude. */
+    normalX() {
+        return this._inwardNormal.x;
+    }
+    /** Return the x component of the normal used to evaluate altitude. */
+    normalY() {
+        return this._inwardNormal.y;
+    }
+    /** Return the z component of the normal used to evaluate altitude. */
+    normalZ() {
+        return this._inwardNormal.z;
+    }
+    /** Return the dot product of the plane normal with the vector (NOT using the plane's distanceFromOrigin). */
     velocity(vector) {
         return vector.x * this._inwardNormal.x + vector.y * this._inwardNormal.y + vector.z * this._inwardNormal.z;
     }
-    /** Return the dot product of the plane normal with the x,yz, vector components (NOT using the plane's distanceFromOrigin).
+    /**
+     * Return the dot product of the plane normal with the x,yz, vector components (NOT using the plane's
+     * distanceFromOrigin).
      */
     velocityXYZ(x, y, z) {
         return x * this._inwardNormal.x + y * this._inwardNormal.y + z * this._inwardNormal.z;
     }
-    /** Return the dot product of the plane normal with the point (treating the point xyz as a vector, and NOT using the plane's distanceFromOrigin).
+    /**
+     * Return the dot product of the plane normal with the point (treating the point xyz as a vector, and NOT
+     * using the plane's distanceFromOrigin).
      */
     dotProductPlaneNormalPoint(point) {
         return point.x * this._inwardNormal.x + point.y * this._inwardNormal.y + point.z * this._inwardNormal.z;
@@ -177108,7 +177139,8 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         const gamma = this.velocity(arcVectors.vector90);
         _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_5__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, undefined, undefined, intersectionRadians);
     }
-    /** Announce fractional intervals of arc clip.
+    /**
+     * Announce fractional intervals of arc clip.
      * * Each call to `announce(fraction0, fraction1, arc)` announces one interval that is inside the clip plane.
      */
     announceClippedArcIntervals(arc, announce) {
@@ -177119,7 +177151,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         return _ClipUtils__WEBPACK_IMPORTED_MODULE_6__.ClipUtilities.selectIntervals01(arc, breaks, this, announce);
     }
     /**
-     * * Compute intersection of (unbounded) segment with the plane.
+     * Compute intersection of (unbounded) segment with the plane.
      * * If the ends are on the same side of the plane, return undefined.
      * * If the intersection is an endpoint or interior to the segment return the fraction.
      * * If both ends are on, return undefined.
@@ -177134,7 +177166,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         }
         return -h0 / (h1 - h0);
     }
-    /** Apply transform to the origin.  Apply inverse transpose of the matrix part to th normal vector. */
+    /** Apply transform to the origin. Apply inverse transpose of the matrix part to th normal vector. */
     transformInPlace(transform) {
         const plane = this.getPlane3d();
         const matrix = transform.matrix;
@@ -177152,11 +177184,11 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         this._distanceFromOrigin = this._inwardNormal.dotProduct(plane.getOriginRef());
         return true;
     }
-    /** Set the invisible flag.   Interpretation of this is up to the use code algorithms. */
+    /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */
     setInvisible(invisible) {
         this._invisible = invisible;
     }
-    /**  reverse the sign of all coefficients, so outside and inside reverse */
+    /** Reverse the sign of all coefficients, so outside and inside reverse */
     negateInPlace() {
         this._inwardNormal = this._inwardNormal.negate();
         this._distanceFromOrigin = -this._distanceFromOrigin;
@@ -177184,11 +177216,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
      * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
-     * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
-     * * Both params default to true to get the full effect of transforming space.
      * @param matrix matrix to apply
      * @return false if unable to invert
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding
+     * effect on the plane is the inverse transpose of matrixA
+     * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
+     * * Both params default to true to get the full effect of transforming space.
      */
     multiplyPlaneByMatrix4d(matrix, invert = true, transpose = true) {
         const plane = this.getPlane4d();
@@ -177205,7 +177238,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         this.setPlane4d(plane);
         return true;
     }
-    /** announce the interval (if any) where a line is within the clip plane half space. */
+    /** Announce the interval (if any) where a line is within the clip plane half space. */
     announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce) {
         if (f1 < f0)
             return false;
@@ -177240,7 +177273,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
      * Return a coordinate frame with
      * * origin at closest point to global origin
      * * z axis points in
-     * x and y are "in plane"
+     * * x and y are "in plane"
      */
     getFrame() {
         const d = this._distanceFromOrigin;
@@ -177276,11 +177309,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
             xyzOut.pushWrap(1);
         return xyzOut;
     }
-    /** Implement appendPolygonClip, as defined in interface PolygonClipper.  /**
-     *
+    /** Implement appendPolygonClip, as defined in interface PolygonClipper.
      * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed
+     * from the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed
+     * from the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
@@ -177291,9 +177325,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         _ClipUtils__WEBPACK_IMPORTED_MODULE_6__.ClipUtilities.captureOrDrop(newInside, 3, insideFragments, arrayCache);
         _ClipUtils__WEBPACK_IMPORTED_MODULE_6__.ClipUtilities.captureOrDrop(newOutside, 3, outsideFragments, arrayCache);
     }
-    /**
-     * Project a point in space to the plane.
-     */
+    /** Project a point in space to the plane. */
     projectPointToPlane(spacePoint, result) {
         const d = -this.altitude(spacePoint);
         return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);
@@ -177382,17 +177414,18 @@ var ClipMaskXYZRangePlanes;
 })(ClipMaskXYZRangePlanes || (ClipMaskXYZRangePlanes = {}));
 /**
  * * ClipPrimitive is a base class for clipping implementations that use
- *   * A UnionOfConvexClipPlaneSets designated "clipPlanes"
- *   * an "invisible" flag
- * * When constructed directly, objects of type ClipPrimitive (directly, not through a derived class) will have just planes
+ *   * A UnionOfConvexClipPlaneSets designated "clipPlanes".
+ *   * An "invisible" flag.
+ * * When constructed directly, objects of type ClipPrimitive (directly, not through a derived class) will have just planes.
  * * Derived classes (e.g. ClipShape) carry additional data such as a swept shape.
  * * ClipPrimitive can be constructed with no planes.
  *     * Derived class is responsible for filling the plane sets.
- *     * At discretion of derived classes, plane construction can be done at construction time or "on demand when" queries call `ensurePlaneSets ()`
+ *     * At discretion of derived classes, plane construction can be done at construction time or "on demand when" queries
+ * call `ensurePlaneSets ()`
  * * ClipPrimitive can be constructed directly with planes (and no derived class).
  * * That the prevailing use is via a ClipShape derived class.
  *    * The ClipShape has an "isMask" property
- *       * isMask === false means the plane sets should cover the inside of its polygon
+ *       * isMask === false means the plane sets should cover the inside of its polygon.
  *       * isMask === true means the plane sets should cover the outside of its polygon.
  *  * Note that the ClipShape's `isMask` property and the ClipPrimitive's `isInvisible` property are distinct controls.
  *     * In normal usage, callers get "outside" clip behavior using ONLY the ClipShape isMask property.
@@ -177401,13 +177434,19 @@ var ClipMaskXYZRangePlanes;
  * @public
  */
 class ClipPrimitive {
-    /** Get a reference to the `UnionOfConvexClipPlaneSets`.
-     *  * It triggers construction of the sets by `this.ensurePlaneSets()`.
-     *  * Derived class typically caches the set on the first such call.
+    /**
+     * Get a reference to the `UnionOfConvexClipPlaneSets`.
+     * * It triggers construction of the sets by `this.ensurePlaneSets()`.
+     * * Derived class typically caches the set on the first such call.
      */
-    fetchClipPlanesRef() { this.ensurePlaneSets(); return this._clipPlanes; }
+    fetchClipPlanesRef() {
+        this.ensurePlaneSets();
+        return this._clipPlanes;
+    }
     /** Ask if this primitive is a hole. */
-    get invisible() { return this._invisible; }
+    get invisible() {
+        return this._invisible;
+    }
     constructor(planeSet, isInvisible = false) {
         this._clipPlanes = planeSet;
         this._invisible = isInvisible;
@@ -177436,26 +177475,30 @@ class ClipPrimitive {
     }
     /**
      * Returns true if the planes are present.
-     * * This can be false (for instance) if a ClipShape is holding a polygon but has not yet been asked to construct the planes.
+     * * This can be false (for instance) if a ClipShape is holding a polygon but has not yet been asked to construct
+     * the planes.
      */
     arePlanesDefined() {
         return this._clipPlanes !== undefined;
     }
-    /** Return a deep clone  */
+    /** Return a deep clone. */
     clone() {
         const newPlanes = this._clipPlanes ? this._clipPlanes.clone() : undefined;
         const result = new ClipPrimitive(newPlanes, this._invisible);
         return result;
     }
     /**
-     * * trigger (if needed)  computation of plane sets (if applicable) in the derived class.
+     * Trigger (if needed) computation of plane sets (if applicable) in the derived class.
      * * Base class is no op.
      * * In derived class, on first call create planes sets from defining data (e.g. swept shape).
      * * In derived class, if planes are present leave them alone.
      */
     ensurePlaneSets() { }
-    /** Return true if the point lies inside/on this polygon (or not inside/on if this polygon is a mask). Otherwise, return false.
-     * * Note that a derived class may choose to (a) implement its own test using its defining data, or (b) accept this implementation using planes that it inserted in the base class.
+    /**
+     * Return true if the point lies inside/on this polygon (or not inside/on if this polygon is a mask). Otherwise,
+     * return false.
+     * * Note that a derived class may choose to (a) implement its own test using its defining data, or (b) accept
+     * this implementation using planes that it inserted in the base class.
      */
     pointInside(point, onTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared) {
         this.ensurePlaneSets();
@@ -177464,7 +177507,8 @@ class ClipPrimitive {
             inside = this._clipPlanes.isPointOnOrInside(point, onTolerance);
         return inside;
     }
-    /** Method from [[Clipper]] interface.
+    /**
+     * Method from [[Clipper]] interface.
      * * Implement as dispatch to clipPlaneSets as supplied by derived class.
      */
     isPointOnOrInside(point, onTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared) {
@@ -177474,7 +177518,8 @@ class ClipPrimitive {
             inside = this._clipPlanes.isPointOnOrInside(point, onTolerance);
         return inside;
     }
-    /** Method from [[Clipper]] interface.
+    /**
+     * Method from [[Clipper]] interface.
      * * Implement as dispatch to clipPlaneSets as supplied by derived class.
      */
     announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce) {
@@ -177484,7 +177529,8 @@ class ClipPrimitive {
             hasInsideParts = this._clipPlanes.announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce);
         return hasInsideParts;
     }
-    /** Method from [[Clipper]] interface.
+    /**
+     * Method from [[Clipper]] interface.
      * * Implement as dispatch to clipPlaneSets as supplied by derived class.
      */
     announceClippedArcIntervals(arc, announce) {
@@ -177498,11 +177544,12 @@ class ClipPrimitive {
      * Multiply all ClipPlanes DPoint4d by matrix.
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
-     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter).
+     * @param matrix matrix to apply.
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding
+     * effect on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
-     * @param matrix matrix to apply
      */
     multiplyPlanesByMatrix4d(matrix, invert = true, transpose = true) {
         if (invert) { // form inverse once here, reuse for all planes
@@ -177515,7 +177562,7 @@ class ClipPrimitive {
             this._clipPlanes.multiplyPlanesByMatrix4d(matrix);
         return true;
     }
-    /** Apply a transform to the clipper (e.g. transform all planes) */
+    /** Apply a transform to the clipper (e.g. transform all planes). */
     transformInPlace(transform) {
         if (this._clipPlanes)
             this._clipPlanes.transformInPlace(transform);
@@ -177526,7 +177573,8 @@ class ClipPrimitive {
         this._invisible = invisible;
     }
     /**
-     * Return true if any plane of the primary clipPlanes has (a) non-zero z component in its normal vector and (b) finite distance from origin.
+     * Return true if any plane of the primary clipPlanes has (a) non-zero z component in its normal vector and
+     * (b) finite distance from origin.
      */
     containsZClip() {
         if (this.fetchClipPlanesRef() !== undefined)
@@ -177538,8 +177586,9 @@ class ClipPrimitive {
     }
     /**
      * Quick test of whether the given points fall completely inside or outside.
-     * @param points points to test
-     * @param ignoreInvisibleSetting if true, do the test with the clip planes and return that, ignoring the invisible setting.
+     * @param points points to test.
+     * @param ignoreInvisibleSetting if true, do the test with the clip planes and return that, ignoring the
+     * invisible setting.
      */
     classifyPointContainment(points, ignoreInvisibleSetting) {
         this.ensurePlaneSets();
@@ -177558,8 +177607,9 @@ class ClipPrimitive {
             }
         return inside;
     }
-    /** Promote json object form to class instance
-     * * First try to convert to a ClipShape
+    /**
+     * Promote json object form to class instance.
+     * * First try to convert to a ClipShape.
      * * then try as a standalone instance of the base class ClipPrimitive.
      */
     static fromJSON(json) {
@@ -177615,27 +177665,49 @@ class ClipShape extends ClipPrimitive {
         this.initSecondaryProps(isMask, zLow, zHigh, transform);
     }
     /** Returns true if this ClipShape is marked as invisible. */
-    get invisible() { return this._invisible; }
+    get invisible() {
+        return this._invisible;
+    }
     /** Return this transformFromClip, which may be undefined. */
-    get transformFromClip() { return this._transformFromClip; }
+    get transformFromClip() {
+        return this._transformFromClip;
+    }
     /** Return this transformToClip, which may be undefined. */
-    get transformToClip() { return this._transformToClip; }
+    get transformToClip() {
+        return this._transformToClip;
+    }
     /** Returns true if this ClipShape's transforms are currently set. */
-    get transformValid() { return this.transformFromClip !== undefined; }
+    get transformValid() {
+        return this.transformFromClip !== undefined;
+    }
     /** Returns true if this ClipShape's lower z boundary is set. */
-    get zLowValid() { return this._zLow !== undefined; }
+    get zLowValid() {
+        return this._zLow !== undefined;
+    }
     /** Returns true if this ClipShape's upper z boundary is set. */
-    get zHighValid() { return this._zHigh !== undefined; }
+    get zHighValid() {
+        return this._zHigh !== undefined;
+    }
     /** Return true if this ClipShape has a local to world transform */
-    get transformIsValid() { return this._transformFromClip !== undefined; }
+    get transformIsValid() {
+        return this._transformFromClip !== undefined;
+    }
     /** Return this zLow, which may be undefined. */
-    get zLow() { return this._zLow; }
+    get zLow() {
+        return this._zLow;
+    }
     /** Return this zHigh, which may be undefined. */
-    get zHigh() { return this._zHigh; }
+    get zHigh() {
+        return this._zHigh;
+    }
     /** Returns a reference to this ClipShape's polygon array. */
-    get polygon() { return this._polygon; }
+    get polygon() {
+        return this._polygon;
+    }
     /** Returns true if this ClipShape is a masking set. */
-    get isMask() { return this._isMask; }
+    get isMask() {
+        return this._isMask;
+    }
     /** Sets the polygon points array of this ClipShape to the array given (by reference). */
     setPolygon(polygon) {
         // Add closure point
@@ -177644,8 +177716,9 @@ class ClipShape extends ClipPrimitive {
         this._polygon = polygon;
     }
     /**
-     * * If the ClipShape's associated `UnionOfConvexClipPlaneSets` is defined, do nothing.
-     * * If the ClipShape's associated `UnionOfConvexClipPlaneSets` is undefined, generate it from the `ClipShape` and transform.
+     * If the ClipShape's associated `UnionOfConvexClipPlaneSets` is defined, do nothing.
+     * If the ClipShape's associated `UnionOfConvexClipPlaneSets` is undefined, generate it from the `ClipShape`
+     * and transform.
      */
     ensurePlaneSets() {
         if (this._clipPlanes !== undefined)
@@ -177657,7 +177730,7 @@ class ClipShape extends ClipPrimitive {
     }
     /**
      * Initialize the members of the ClipShape class that may at times be undefined.
-     * zLow and zHigh default to Number.MAX_VALUE, and the transform defaults to an identity transform
+     * zLow and zHigh default to Number.MAX_VALUE, and the transform defaults to an identity transform.
      */
     initSecondaryProps(isMask, zLow, zHigh, transform) {
         this._isMask = isMask;
@@ -177672,7 +177745,7 @@ class ClipShape extends ClipPrimitive {
             this._transformToClip = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_5__.Transform.createIdentity();
         }
     }
-    /** emit json object form */
+    /** Emit json object form */
     toJSON() {
         const shape = {
             points: this._polygon.map((pt) => pt.toJSON()),
@@ -177689,7 +177762,7 @@ class ClipShape extends ClipPrimitive {
             shape.zhigh = this.zHigh;
         return { shape };
     }
-    /** parse `json` to a clip shape. */
+    /** Parse `json` to a clip shape. */
     static fromClipShapeJSON(json, result) {
         const shape = json?.shape;
         if (!shape)
@@ -177751,7 +177824,7 @@ class ClipShape extends ClipPrimitive {
         blockPoints[1].x = blockPoints[2].x = high.x;
         blockPoints[0].y = blockPoints[1].y = blockPoints[4].y = low.y;
         blockPoints[2].y = blockPoints[3].y = high.y;
-        return ClipShape.createShape(blockPoints, (ClipMaskXYZRangePlanes.None !== (clipMask & ClipMaskXYZRangePlanes.ZLow)) ? low.z : undefined, ClipMaskXYZRangePlanes.None !== (clipMask & ClipMaskXYZRangePlanes.ZHigh) ? high.z : undefined, transform, isMask, invisible, result);
+        return ClipShape.createShape(blockPoints, (ClipMaskXYZRangePlanes.None !== (clipMask & ClipMaskXYZRangePlanes.ZLow)) ? low.z : undefined, (ClipMaskXYZRangePlanes.None !== (clipMask & ClipMaskXYZRangePlanes.ZHigh)) ? high.z : undefined, transform, isMask, invisible, result);
     }
     /** Creates a new ClipShape with undefined members and a polygon points array of zero length. */
     static createEmpty(isMask = false, invisible = false, transform, result) {
@@ -177772,11 +177845,14 @@ class ClipShape extends ClipPrimitive {
             return false;
         return true;
     }
-    /** Returns a deep copy of this instance of ClipShape, storing in an optional result */
+    /** Returns a deep copy of this instance of ClipShape, storing in an optional result. */
     clone(result) {
         return ClipShape.createFrom(this, result);
     }
-    /** Given the current polygon data, parses clip planes that together form an object, storing the result in the set given, either clipplanes or maskplanes. */
+    /**
+     * Given the current polygon data, parses clip planes that together form an object, storing the result in
+     * the set given, either clip planes or mask planes.
+     */
     parseClipPlanes(set) {
         const points = this._polygon;
         if (points.length === 3 && !this._isMask && points[0].isExactEqual(points[points.length - 1])) {
@@ -177795,7 +177871,10 @@ class ClipShape extends ClipPrimitive {
         this.parsePolygonPlanes(set, this._polygon, this.isMask);
         return true;
     }
-    /** Given a start and end point, populate the given UnionOfConvexClipPlaneSets with ConvexClipPlaneSets defining the bounded region of linear planes. Returns true if successful. */
+    /**
+     * Given a start and end point, populate the given UnionOfConvexClipPlaneSets with ConvexClipPlaneSets
+     * defining the bounded region of linear planes. Returns true if successful.
+     */
     parseLinearPlanes(set, start, end, cameraFocalLength) {
         // Handles the degenerate case of 2 distinct points (used by select by line).
         const normal = start.vectorTo(end);
@@ -177827,7 +177906,10 @@ class ClipShape extends ClipPrimitive {
         set.addConvexSet(convexSet);
         return true;
     }
-    /** Given a convex polygon defined as an array of points, populate the given UnionOfConvexClipPlaneSets with ConvexClipPlaneSets defining the bounded region. Returns true if successful. */
+    /**
+     * Given a convex polygon defined as an array of points, populate the given UnionOfConvexClipPlaneSets with
+     * ConvexClipPlaneSets defining the bounded region. Returns true if successful.
+     */
     parseConvexPolygonPlanes(set, polygon, direction, buildExteriorClipper, cameraFocalLength) {
         const samePointTolerance = 1.0e-8; // This could possibly be replaced with more widely used constants
         const edges = [];
@@ -177885,7 +177967,10 @@ class ClipShape extends ClipPrimitive {
         }
         return true;
     }
-    /** Given a (possibly non-convex) polygon defined as an array of points, populate the given UnionOfConvexClipPlaneSets with multiple ConvexClipPlaneSets defining the bounded region. Returns true if successful. */
+    /**
+     * Given a (possibly non-convex) polygon defined as an array of points, populate the given UnionOfConvexClipPlaneSets
+     * with multiple ConvexClipPlaneSets defining the bounded region. Returns true if successful.
+     */
     parsePolygonPlanes(set, polygon, isMask, cameraFocalLength) {
         const cleanPolygon = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_9__.PolylineOps.compressDanglers(polygon, true);
         const announceFace = (_graph, edge) => {
@@ -177932,17 +178017,19 @@ class ClipShape extends ClipPrimitive {
      * Multiply all ClipPlanes DPoint4d by matrix.
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
-     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter).
+     * @param matrix matrix to apply.
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect
+     * on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
-     * @param matrix matrix to apply
      */
     multiplyPlanesByMatrix4d(matrix, invert = true, transpose = true) {
         this.ensurePlaneSets();
         return super.multiplyPlanesByMatrix4d(matrix, invert, transpose);
     }
-    /** Apply `transform` to the local to world (`transformFromClip`) transform.
+    /**
+     * Apply `transform` to the local to world (`transformFromClip`) transform.
      * * The world to local transform (`transformToClip` is recomputed from the (changed) `transformToClip`
      * * the transform is passed to the base class to be applied to clip plane form of the clipper.
      */
@@ -177957,7 +178044,8 @@ class ClipShape extends ClipPrimitive {
         this._transformToClip = this._transformFromClip.inverse(); // could be undefined
         return true;
     }
-    /** Return true if
+    /**
+     * Return true if
      * * at least one point is defined
      * * The local to world transform (transformFromClip) either
      *   * is undefined
@@ -178039,44 +178127,47 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** Enumerated type for describing where geometry lies with respect to clipping planes.
+/**
+ * Enumerated type for describing where geometry lies with respect to clipping planes.
  * @public
  */
 var ClipPlaneContainment;
 (function (ClipPlaneContainment) {
-    /** All points inside */
+    /** All points inside. */
     ClipPlaneContainment[ClipPlaneContainment["StronglyInside"] = 1] = "StronglyInside";
     /** Inside/outside state unknown. */
     ClipPlaneContainment[ClipPlaneContainment["Ambiguous"] = 2] = "Ambiguous";
-    /** All points outside */
+    /** All points outside. */
     ClipPlaneContainment[ClipPlaneContainment["StronglyOutside"] = 3] = "StronglyOutside";
 })(ClipPlaneContainment || (ClipPlaneContainment = {}));
 /**
- * Enumeration of ways to handle an intermediate fragment from a clipping step
+ * Enumeration of ways to handle an intermediate fragment from a clipping step.
  * @public
  */
 var ClipStepAction;
 (function (ClipStepAction) {
-    /** Pass fragments directly to final accepted "in" state */
+    /** Pass fragments directly to final accepted "in" state. */
     ClipStepAction[ClipStepAction["acceptIn"] = 1] = "acceptIn";
-    /** Pass fragments directly to final accepted "out" state */
+    /** Pass fragments directly to final accepted "out" state. */
     ClipStepAction[ClipStepAction["acceptOut"] = -1] = "acceptOut";
-    /** forward fragments to subsequent steps. */
+    /** Forward fragments to subsequent steps. */
     ClipStepAction[ClipStepAction["passToNextStep"] = 0] = "passToNextStep";
 })(ClipStepAction || (ClipStepAction = {}));
-/** Enumerated type for describing what must yet be done to clip a piece of geometry.
+/**
+ * Enumerated type for describing what must yet be done to clip a piece of geometry.
  * @public
  */
 var ClipStatus;
 (function (ClipStatus) {
-    /** some geometry may cross the clip boundaries */
+    /** Some geometry may cross the clip boundaries */
     ClipStatus[ClipStatus["ClipRequired"] = 0] = "ClipRequired";
-    /** geometry is clearly outside */
+    /** Geometry is clearly outside */
     ClipStatus[ClipStatus["TrivialReject"] = 1] = "TrivialReject";
-    /** geometry is clearly inside */
+    /** Geometry is clearly inside */
     ClipStatus[ClipStatus["TrivialAccept"] = 2] = "TrivialAccept";
 })(ClipStatus || (ClipStatus = {}));
-/** Class whose various static methods are functions for clipping geometry
+/**
+ * Class whose various static methods are functions for clipping geometry
  * @public
  */
 class ClipUtilities {
@@ -178114,7 +178205,7 @@ class ClipUtilities {
         return false;
     }
     /**
-     * Announce triples of (low, high, cp) for each entry in intervals
+     * Announce triples of (low, high, cp) for each entry in intervals.
      * @param intervals source array
      * @param cp CurvePrimitive for announcement
      * @param announce function to receive data
@@ -178127,7 +178218,8 @@ class ClipUtilities {
         }
         return intervals.length > 0;
     }
-    /** Find portions of the curve that are within the clipper.
+    /**
+     * Find portions of the curve that are within the clipper.
      * Collect them into an array of curve primitives.
      */
     static collectClippedCurves(curve, clipper) {
@@ -178165,7 +178257,8 @@ class ClipUtilities {
         }
         return output;
     }
-    /** Given an array of points, test for trivial containment conditions.
+    /**
+     * Given an array of points, test for trivial containment conditions.
      * * ClipStatus.TrivialAccept if all points are in any one of the convexSet's.
      * * ClipStatus.ClipRequired if (in any single convexSet) there were points on both sides of any single plane.
      * * ClipStatus.TrivialReject if neither of those occurred.
@@ -178255,8 +178348,9 @@ class ClipUtilities {
         }
     }
     /**
-     * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set intersecting a range.
-     * * return zero length array for (a) null range or (b) no intersections
+     * Return a (possibly empty) array of geometry (Loops !!) which are facets of the intersection of the convex set
+     * intersecting a range.
+     * * Return zero length array for (a) null range or (b) no intersections
      * @param allClippers convex or union clipper
      * @param range range to intersect
      * @param includeConvexSetFaces if false, do not compute facets originating as convex set planes.
@@ -178426,7 +178520,8 @@ class ClipUtilities {
         }
         return false;
     }
-    /** Test for intersection of two ranges in different local coordinates.
+    /**
+     * Test for intersection of two ranges in different local coordinates.
      * * Useful for clash detection of elements in iModels, using their stored (tight) local ranges and placement transforms.
      * @param range0 range in local coordinates of first geometry
      * @param local0ToWorld placement transform for first geometry
@@ -178471,8 +178566,8 @@ class ClipUtilities {
      * * If there are more than baseCount+1 fragments:
      *   * drop them all to the cache
      *   * push a copy of the singleton.
-     * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments, and then be able to determine
-     *     that they really are the original pre-clip polygon unchanged.
+     * * The use case for this is that a multi-step clipper (e.g. UnionOfConvexClipPlaneSets) may produce many fragments,
+     * and then be able to determine that they really are the original pre-clip polygon unchanged.
      * * The baseCount+1 case is the case where the entire original singleton is still a singleton and can be left alone.
      * * Calling this replacer shuffles the original back into the fragment array, and drops the fragments.
      * * This determination is solely within the logic of the caller.
@@ -178505,8 +178600,7 @@ class ClipUtilities {
         }
         return _internalContexts_LineStringOffsetClipperContext__WEBPACK_IMPORTED_MODULE_12__.LineStringOffsetClipperContext.createClipBetweenOffsets(points, leftOffset, rightOffset, z0, z1);
     }
-    /** if data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache.
-     */
+    /** If data.length >= minLength threshold, push it to destination; if smaller drop it back to the cache. */
     static captureOrDrop(data, minLength, destination, cache) {
         if (data.length >= minLength)
             destination.push(data);
@@ -178703,8 +178797,8 @@ class ClipUtilities {
         const oldOutsideCount = acceptedOut ? acceptedOut.length : 0;
         let shard;
         // At each convex set, carryForwardA is all the fragments that have been outside all previous convex sets.
-        // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to the next clipper
-        // The final surviving carryForward really is out.
+        // Clip each such fragment to the current set, sending the outside parts to carryForwardB, which will got to
+        // the next clipper. The final surviving carryForward really is out.
         for (const c of clippers) {
             if (c.appendPolygonClip) {
                 while (undefined !== (shard = candidates.pop())) {
@@ -178728,9 +178822,7 @@ class ClipUtilities {
         if (acceptedIn?.length === oldInsideCount)
             ClipUtilities.restoreSingletonInPlaceOfMultipleShards(acceptedOut, oldOutsideCount, xyz, arrayCache);
     }
-    /**
-     * Pass polygon `xyz` through a sequence of PolygonClip steps with "parity" rules
-     */
+    /** Pass polygon `xyz` through a sequence of PolygonClip steps with "parity" rules */
     static doPolygonClipParitySequence(xyz, clippers, acceptedIn, acceptedOut, arrayCache) {
         if (arrayCache === undefined)
             arrayCache = new _geometry3d_ReusableObjectCache__WEBPACK_IMPORTED_MODULE_14__.GrowableXYZArrayCache();
@@ -178779,9 +178871,9 @@ class ClipUtilities {
             moveFragments(candidatesOut, acceptedOut, arrayCache);
         }
     }
-    /** For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that
+    /**
+     * For each plane of clipper, construct a UnionOfConvexClipPlaneSets for an outer (infinite) convex volume that
      * abuts the outer volume of the neighbor faces.
-     *
      */
     static createComplementaryClips(clipper) {
         const planes = clipper.planes;
@@ -178890,18 +178982,22 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** Class holding an array structure of shapes defined by `ClipPrimitive`
+/**
+ * Class holding an array structure of shapes defined by `ClipPrimitive`
  * * The `ClipVector` defines an intersection of the member `ClipPrimitive` regions.
- * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker flag indicating that the outside of each hole is live.
+ * * In the most common usage, one of the `ClipPrimitive` will be an outer region, and all others are holes with marker
+ * flag indicating that the outside of each hole is live.
  * @public
  */
 class ClipVector {
     /** Returns a reference to the array of ClipShapes. */
     get clips() { return this._clips; }
     constructor(clips) {
-        /** range acting as first filter.
+        /**
+         * Range acting as first filter.
          * * This is understood as overall range limit, not as precise planes.
-         * * applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming its planes.
+         * * Applying any rotation to the whole ClipVector generally expands this range, rather than exactly transforming
+         * its planes.
          */
         this.boundingRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.createNull();
         this._clips = clips ? clips : [];
@@ -178989,7 +179085,8 @@ class ClipVector {
     pointInside(point, onTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared) {
         return this.isPointOnOrInside(point, onTolerance);
     }
-    /** Method from [[Clipper]] interface.
+    /**
+     * Method from [[Clipper]] interface.
      * * Implement as dispatch to clipPlaneSets as supplied by derived class.
      */
     isPointOnOrInside(point, onTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared) {
@@ -179015,7 +179112,8 @@ class ClipVector {
         }
         return numChildren > 0;
     }
-    /** Method from [[Clipper]] interface.
+    /**
+     * Method from [[Clipper]] interface.
      * * Implement as dispatch to clipPlaneSets as supplied by derived class.
      */
     announceClippedSegmentIntervals(f0, f1, pointA, pointB, announce) {
@@ -179039,10 +179137,11 @@ class ClipVector {
         if (this._clipNodeProxy)
             this._clipNodeProxy.appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache);
     }
-    /** Transforms this ClipVector to a new coordinate-system.
-      * Note that if the transform has rotate and scale the boundingRange member expands.
-      * Returns true if successful.
-      */
+    /**
+     * Transforms this ClipVector to a new coordinate-system.
+     * Note that if the transform has rotate and scale the boundingRange member expands.
+     * Returns true if successful.
+     */
     transformInPlace(transform) {
         for (const clip of this._clips)
             if (clip.transformInPlace(transform) === false)
@@ -179054,15 +179153,13 @@ class ClipVector {
     /**
      * A simple way of packaging this ClipVector's ClipShape points into a multidimensional array, while also
      * taking into account each ClipPrimitive's individual transforms.
-     *
      * ClipPrimitives OTHER THAN ClipShape are ignored.
-     *
      * Information out:
-     *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure)
-     *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive
-     *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0
-     *  - The last valid zLow found is stored in the returned array at index 1
-     *  - The last valid zHigh found is stored in the returned array at index 2
+     *  - All of the loop points are stored in the multidimensional Point3d array given (will return unchanged upon failure).
+     *  - If given a transform, will be set from the transformFromClip of the first ClipPrimitive.
+     *  - The ClipMask of the final ClipPrimitive is stored in the returned array at index 0.
+     *  - The last valid zLow found is stored in the returned array at index 1.
+     *  - The last valid zHigh found is stored in the returned array at index 2.
      */
     extractBoundaryLoops(loopPoints, transform) {
         let clipM = _ClipPrimitive__WEBPACK_IMPORTED_MODULE_2__.ClipMaskXYZRangePlanes.None;
@@ -179117,7 +179214,10 @@ class ClipVector {
         for (const clip of this._clips)
             clip.setInvisible(invisible);
     }
-    /** For every clip, parse the member point array into the member clip plane object (only for clipPlanes member, not the mask) */
+    /**
+     * For every clip, parse the member point array into the member clip plane object (only for clipPlanes member,
+     * not the mask)
+     */
     parseClipPlanes() {
         for (const clip of this._clips)
             clip.fetchClipPlanesRef();
@@ -179146,8 +179246,9 @@ class ClipVector {
         return true;
     }
     /**
-     * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined by masking planes,
-     * checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the _clipPlanes member.
+     * Determines whether the given points fall inside or outside this set of ClipShapes. If any set is defined
+     * by masking planes, checks the mask planes only, provided that ignoreMasks is false. Otherwise, checks the
+     * _clipPlanes member.
      */
     classifyPointContainment(points, ignoreMasks = false) {
         let currentContainment = _ClipUtils__WEBPACK_IMPORTED_MODULE_6__.ClipPlaneContainment.Ambiguous;
@@ -179171,7 +179272,8 @@ class ClipVector {
         return this.classifyPointContainment(corners, ignoreMasks);
     }
     /**
-     * For an array of points (making up a LineString), tests whether the segment between each point lies inside the ClipVector.
+     * For an array of points (making up a LineString), tests whether the segment between each point lies inside the
+     * ClipVector.
      * If true, returns true immediately.
      */
     isAnyLineStringPointInside(points) {
@@ -179221,7 +179323,8 @@ class ClipVector {
         }
         return true;
     }
-    /** Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.
+    /**
+     * Serializes this ClipVector to a compact string representation appropriate for transmission as part of a URL.
      * Chiefly used for requesting [Tile]($frontend)s with section cut facets.
      * UnionOfConvexClipPlaneSets is obtained for each ClipPrimitive. The encoding is as follows:
      *  ClipVector:
@@ -179284,7 +179387,8 @@ class ClipVector {
 }
 ClipVector._TARGET_FRACTION_SUM = 0.99999999;
 
-/** Bundles a ClipVector with its compact string representation.
+/**
+ * Bundles a ClipVector with its compact string representation.
  * @note The string representation is computed once; the ClipVector is assumed not to be subsequently modified.
  * @alpha
  */
@@ -179362,7 +179466,8 @@ class ConvexClipPlaneSet {
         // this._parity = 1;
         this._planes = planes ? planes : [];
     }
-    /** Return an array containing all the planes of the convex set.
+    /**
+     * Return an array containing all the planes of the convex set.
      * * Note that this has no leading keyword identifying it as a ConvexClipPlaneSet.
      */
     toJSON() {
@@ -179371,7 +179476,8 @@ class ConvexClipPlaneSet {
             val.push(plane.toJSON());
         return val;
     }
-    /** Extract clip planes from a json array `[  clipPlane, clipPlane ]`.
+    /**
+     * Extract clip planes from a json array `[ clipPlane, clipPlane ]`.
      * * Non-clipPlane members are ignored.
      */
     static fromJSON(json, result) {
@@ -179387,7 +179493,7 @@ class ConvexClipPlaneSet {
         return result;
     }
     /**
-     * Return true if all members are almostEqual to corresponding members of other.  This includes identical order in array.
+     * Return true if all members are almostEqual to corresponding members of other. This includes identical order in array.
      * @param other clip plane to compare
      */
     isAlmostEqual(other) {
@@ -179398,7 +179504,8 @@ class ConvexClipPlaneSet {
                 return false;
         return true;
     }
-    /** create from an array of planes.
+    /**
+     * Create ConvexClipPlaneSet from an array of planes.
      * * Each plane reference in the `planes` array is taken into the result.
      * * The input array itself is NOT taken into the result.
      */
@@ -179441,7 +179548,7 @@ class ConvexClipPlaneSet {
             result.planes.push(_ClipPlane__WEBPACK_IMPORTED_MODULE_0__.ClipPlane.createNormalAndPointXYZXYZ(0, 0, -1, 0, 0, range.high.z));
         return result;
     }
-    /** create an empty `ConvexClipPlaneSet` */
+    /** Create an empty `ConvexClipPlaneSet` */
     static createEmpty(result) {
         if (result) {
             result._planes.length = 0;
@@ -179449,14 +179556,15 @@ class ConvexClipPlaneSet {
         }
         return new ConvexClipPlaneSet();
     }
-    /** negate all planes of the set. */
+    /** Negate all planes of the set. */
     negateAllPlanes() {
         for (const plane of this._planes)
             plane.negateInPlace();
     }
-    /** Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
+    /**
+     * Create a convex clip plane set that clips to `x0 <= x <= x1` and `y0 <= y <= y1`.
      * * Note that there is no test for the usual ordering `x0 <= x1` or `y0 <= y1`.
-     *    * if the usual ordering is violated, the convex set is an empty set.
+     * * if the usual ordering is violated, the convex set is an empty set.
      */
     static createXYBox(x0, y0, x1, y1, result) {
         result = result ? result : new ConvexClipPlaneSet();
@@ -179470,11 +179578,13 @@ class ConvexClipPlaneSet {
         }
         return result;
     }
-    /** Create a convex set containing a half space for each edge between points of a polyline.
+    /**
+     * Create a convex set containing a half space for each edge between points of a polyline.
      * * Caller is responsible for assuring the polyline is convex.
-     * @param points array of points.  Only xy parts are considered.
-     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the succeeding segment.   If this array is not provided, both are false.
-     * @param leftIsInside if true, the interior is "to the left" of the segments.  If false, interior is "to the right"
+     * @param points array of points. Only xy parts are considered.
+     * @param interior array whose boolean value is used as both the `interior` and `invisible` bits of the plane for the
+     * succeeding segment. If this array is not provided, both are false.
+     * @param leftIsInside if true, the interior is "to the left" of the segments. If false, interior is "to the right".
      */
     static createXYPolyLine(points, interior, leftIsInside, result) {
         result = result ? result : new ConvexClipPlaneSet();
@@ -179518,7 +179628,7 @@ class ConvexClipPlaneSet {
         return result;
     }
     /**
-     * (re)set a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
+     * Set (or reset) a plane and ConvexClipPlaneSet for a convex array, such as a convex facet used for xy clip.
      * * The planeOfPolygon is (re)initialized with the normal from 3 points, but not otherwise referenced.
      * * The ConvexClipPlaneSet is filled with outward normals of the facet edges as viewed to xy plane.
      * @param points
@@ -179562,7 +179672,7 @@ class ConvexClipPlaneSet {
      * Test if there is any intersection with a ray defined by origin and direction.
      * * Optionally record the range (null or otherwise) in caller-allocated result.
      * * If the ray is unbounded inside the clip, result can contain positive or negative
-     * "Geometry.largeCoordinateResult" values
+     *  "Geometry.largeCoordinateResult" values.
      * * If no result is provide, there are no object allocations.
      * @param result optional Range1d to receive parameters along the ray.
      */
@@ -179607,7 +179717,8 @@ class ConvexClipPlaneSet {
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
      * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect
+     * on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
      * @param matrix matrix to apply
@@ -179627,7 +179738,8 @@ class ConvexClipPlaneSet {
     /** Return true if `point` satisfies `point.isPointInside` for all planes */
     isPointInside(point) {
         for (const plane of this._planes) {
-            if (!plane.isPointInside(point)) // Defaults to strict inside check. Other clipping classes may use "on or inside" check for the "on" case
+            // Defaults to strict inside check. Other clipping classes may use "on or inside" check for the "on" case
+            if (!plane.isPointInside(point))
                 return false;
         }
         return true;
@@ -179655,13 +179767,15 @@ class ConvexClipPlaneSet {
         }
         return true;
     }
-    /** Find the parts of the line segment  (if any) that is within the convex clip volume.
-     * * The input fractional interval from fraction0 to fraction1 (increasing!!) is the active part to consider.
-     * * To clip to the usual bounded line segment, starts with fractions (0,1).
+    /**
+     * Find the parts of the line segment (if any) that is within the convex clip volume.
+     * * The line segment is defined by `pointA` and `pointB`.
+     * * The input fractional interval from `fraction0` to `fraction1` (increasing) is the active part to consider.
+     * * To clip to the usual bounded line segment, start with fractions (0,1).
      * If the clip volume is unbounded, the line interval may also be unbounded.
-     * * An unbounded line portion will have fraction coordinates positive or negative Number.MAX_VALUE.
-     * @param fraction0 fraction that is the initial lower fraction of the active interval. (e.g. 0.0 for bounded segment)
-     * @param fraction1 fraction that is the initial upper fraction of the active interval.  (e.g. 1.0 for bounded segment)
+     * * An unbounded line portion will have fraction coordinates positive or negative `Number.MAX_VALUE`.
+     * @param f0 fraction that is the initial lower fraction of the active interval (e.g., 0.0 for bounded segment).
+     * @param f1 fraction that is the initial upper fraction of the active interval (e.g., 1.0 for bounded segment).
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -179676,7 +179790,7 @@ class ConvexClipPlaneSet {
             const hB = -plane.altitude(pointB);
             fraction = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.conditionalDivideFraction(-hA, (hB - hA));
             if (fraction === undefined) {
-                // LIne parallel to the plane.  If positive, it is all OUT
+                // Line parallel to the plane. If positive, it is all OUT
                 if (hA > 0.0)
                     return false;
             }
@@ -179705,7 +179819,8 @@ class ConvexClipPlaneSet {
         }
         return false;
     }
-    /** Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
+    /**
+     * Find fractional parts of the arc that are within this ClipPlaneSet, and announce each as
      * * `announce(fraction, fraction, curve)`
      */
     announceClippedArcIntervals(arc, announce) {
@@ -179717,7 +179832,8 @@ class ConvexClipPlaneSet {
         arc.sweep.radiansArrayToPositivePeriodicFractions(breaks);
         return _ClipUtils__WEBPACK_IMPORTED_MODULE_4__.ClipUtilities.selectIntervals01(arc, breaks, this, announce);
     }
-    /** Find the parts of the (unbounded) line segment  (if any) that is within the convex clip volume.
+    /**
+     * Find the parts of the (unbounded) line segment (if any) that is within the convex clip volume.
      * @param pointA segment start (fraction 0)
      * @param pointB segment end (fraction 1)
      * @param announce function to be called to announce a fraction interval that is within the convex clip volume.
@@ -179747,7 +179863,8 @@ class ConvexClipPlaneSet {
                 return;
         }
     }
-    /** Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
+    /**
+     * Clip a convex polygon to (a single) inside part and (possibly many) outside parts.
      * @param xyz input polygon.
      * @param outsideFragments an array to receive (via push, with no preliminary clear) outside fragments
      * @param arrayCache cache for work arrays.
@@ -179790,14 +179907,15 @@ class ConvexClipPlaneSet {
         arrayCache.dropToCache(insidePart);
         return undefined;
     }
-    /** Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
+    /**
+     * Returns 1, 2, or 3 based on whether point array is strongly inside, ambiguous, or strongly outside respectively.
      * * This has a peculiar expected use case as a very fast pre-filter for more precise clipping.
      * * The expected point set is for a polygon.
      * * Hence any clipping will eventually have to consider the lines between the points.
      * * This method looks for the special case of a single clip plane that has all the points outside.
      * * In this case the whole polygon must be outside.
      * * Note that this does not detect a polygon that is outside but "crosses a corner" -- it is mixed with respect to
-     *     multiple planes.
+     * multiple planes.
      */
     classifyPointContainment(points, onIsOutside) {
         let allInside = true;
@@ -179819,7 +179937,8 @@ class ConvexClipPlaneSet {
     /**
      * * Create a convex clip set for a polygon swept with possible tilt angle.
      * * planes are constructed by ClipPlane.createEdgeAndUpVector, using successive points from the array.
-     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in reverse order.
+     * * If the first and last points match, the polygon area is checked.  If the area is negative, points are used in
+     * reverse order.
      * * If first and last points do not match, points are used in order given
      * @param points polygon points. (Closure point optional)
      * @param upVector primary sweep direction, as applied by ClipPlane.createEdgeAndUpVector
@@ -179867,7 +179986,7 @@ class ConvexClipPlaneSet {
             this._planes.push(_ClipPlane__WEBPACK_IMPORTED_MODULE_0__.ClipPlane.createPlane(plane));
     }
     /**
-     * test many points.  Distribute them to arrays depending on in/out result.
+     * Test many points. Distribute them to arrays depending on in/out result.
      * @param points points to test
      * @param inOrOn points that are in or on the set
      * @param out points that are out.
@@ -179887,8 +180006,10 @@ class ConvexClipPlaneSet {
     /**
      * Clip a polygon to the planes of the clip plane set.
      * * For a convex input polygon, the output is another convex polygon.
-     * * For a non-convex input, the output may have double-back edges along plane intersections.  This is still a valid clip in a parity sense.
-     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain the polygon
+     * * For a non-convex input, the output may have double-back edges along plane intersections. This is still a
+     * valid clip in a parity sense.
+     * * The containingPlane parameter allows callers within ConvexClipPlane set to bypass planes known to contain
+     * the polygon.
      * @param input input polygon, usually convex.
      * @param output output polygon
      * @param work work array.
@@ -179933,7 +180054,7 @@ class ConvexClipPlaneSet {
             const inwardNormal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createCrossProduct(sweepDirection.x, sweepDirection.y, sweepDirection.z, edgeVector.x, edgeVector.y, edgeVector.z);
             const inwardNormalNormalized = inwardNormal.normalize();
             let distance;
-            if (inwardNormalNormalized) { // Should never fail... simply a check due to the format of the normalize function return
+            if (inwardNormalNormalized) { // should never fail... simply a check due to the format of the normalize function return
                 distance = inwardNormalNormalized.dotProduct(xyz0);
                 const clipToAdd = _ClipPlane__WEBPACK_IMPORTED_MODULE_0__.ClipPlane.createNormalAndDistance(inwardNormalNormalized, distance, false, false);
                 if (clipToAdd) {
@@ -179962,13 +180083,16 @@ class ConvexClipPlaneSet {
      * * optionally throw out points that are not in the set.
      * * optionally push the points in the caller-supplied point array.
      * * optionally extend a caller supplied range.
-     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the range is the range of the convex set.
-     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the range is not a representative of the "range of all points in the set" .
+     * * In the common case where the convex set is (a) a slab or (b) a view frustum, there will be 8 points and the
+     * range is the range of the convex set.
+     * * If the convex set is unbounded, the range only contains the range of the accepted (corner) points, and the
+     * range is not a representative of the "range of all points in the set".
      * @param transform (optional) transform to apply to the points.
      * @param points (optional) array to which computed points are to be added.
      * @param range (optional) range to be extended by the computed points
      * @param transform (optional) transform to apply to the accepted points.
-     * @param testContainment if true, test each point to see if it is within the convex set.  (Send false if confident that the convex set is rectilinear set such as a slab.  Send true if chiseled corners are possible)
+     * @param testContainment if true, test each point to see if it is within the convex set. (send false if confident
+     * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).
      * @returns number of points.
      */
     computePlanePlanePlaneIntersections(points, rangeToExtend, transform, testContainment = true) {
@@ -180017,11 +180141,13 @@ class ConvexClipPlaneSet {
         if (zHigh !== undefined)
             this._planes.push(_ClipPlane__WEBPACK_IMPORTED_MODULE_0__.ClipPlane.createNormalAndDistance(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create(0, 0, -1), -zHigh, invisible));
     }
-    /** Implement appendPolygonClip, as defined in interface PolygonClipper.  /**
-     *
+    /**
+     * Implement appendPolygonClip, as defined in interface PolygonClipper.
      * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
@@ -180029,7 +180155,8 @@ class ConvexClipPlaneSet {
         if (newInside)
             insideFragments.push(newInside);
     }
-    /** Create a convex clip set from a convex mesh.
+    /**
+     * Create a convex clip set from a convex mesh.
      * * Create a plane for each facet.
      * * Assemble the planes as a single clip plane set.
      * * If the facets are closed by edge pairing, use the sign of the computed volume to point the plane normals inward.
@@ -180118,11 +180245,13 @@ __webpack_require__.r(__webpack_exports__);
  */
 class UnionOfConvexClipPlaneSets {
     /** (property accessor)  Return the (reference to the) array of `ConvexClipPlaneSet` */
-    get convexSets() { return this._convexSets; }
+    get convexSets() {
+        return this._convexSets;
+    }
     constructor() {
         this._convexSets = [];
     }
-    /** Return an array with the `toJSON` form of each  `ConvexClipPlaneSet` */
+    /** Return an array with the `toJSON` form of each `ConvexClipPlaneSet` */
     toJSON() {
         const val = [];
         for (const convex of this._convexSets)
@@ -180148,8 +180277,9 @@ class UnionOfConvexClipPlaneSets {
         return new UnionOfConvexClipPlaneSets();
     }
     /**
-     * Return true if all member convex sets are almostEqual to corresponding members of other.  This includes identical order in array.
-     * @param other clip plane to compare
+     * Return true if all member convex sets are almostEqual to corresponding members of other. This includes
+     * identical order in array.
+     * @param other clip plane to compare.
      */
     isAlmostEqual(other) {
         if (this._convexSets.length !== other._convexSets.length)
@@ -180159,14 +180289,14 @@ class UnionOfConvexClipPlaneSets {
                 return false;
         return true;
     }
-    /** Create a `UnionOfConvexClipPlaneSets` with given `ConvexClipPlaneSet` members */
+    /** Create a `UnionOfConvexClipPlaneSets` with given `ConvexClipPlaneSet` members. */
     static createConvexSets(convexSets, result) {
         result = result ? result : new UnionOfConvexClipPlaneSets();
         for (const set of convexSets)
             result._convexSets.push(set);
         return result;
     }
-    /** return a deep copy. */
+    /** Return a deep copy. */
     clone(result) {
         result = result ? result : new UnionOfConvexClipPlaneSets();
         result._convexSets.length = 0;
@@ -180174,7 +180304,8 @@ class UnionOfConvexClipPlaneSets {
             result._convexSets.push(convexSet.clone());
         return result;
     }
-    /** Append `toAdd` to the array of `ConvexClipPlaneSet`.
+    /**
+     * Append `toAdd` to the array of `ConvexClipPlaneSet`.
      * * undefined toAdd is ignored.
      */
     addConvexSet(toAdd) {
@@ -180185,7 +180316,7 @@ class UnionOfConvexClipPlaneSets {
      * Test if there is any intersection with a ray defined by origin and direction.
      * * Optionally record the range (null or otherwise) in caller-allocated result.
      * * If the ray is unbounded inside the clip, result can contain positive or negative
-     * "Geometry.largeCoordinateResult" values
+     * "Geometry.largeCoordinateResult" values.
      * * If no result is provide, there are no object allocations.
      * @param maximalRange optional Range1d to receive parameters along the ray.
      */
@@ -180206,7 +180337,10 @@ class UnionOfConvexClipPlaneSets {
         }
         return !maximalRange.isNull;
     }
-    /** Return true if true is returned for any contained convex set returns true for `convexSet.isPointInside (point, tolerance)`  */
+    /**
+     * Return true if true is returned for any contained convex set returns true for
+     * `convexSet.isPointInside (point, tolerance)`.
+     */
     isPointInside(point) {
         for (const convexSet of this._convexSets) {
             if (convexSet.isPointInside(point)) {
@@ -180215,7 +180349,10 @@ class UnionOfConvexClipPlaneSets {
         }
         return false;
     }
-    /** Return true if true is returned for any contained convex set returns true for `convexSet.isPointOnOrInside (point, tolerance)`  */
+    /**
+     * Return true if true is returned for any contained convex set returns true for
+     * `convexSet.isPointOnOrInside (point, tolerance)`.
+     */
     isPointOnOrInside(point, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
         for (const convexSet of this._convexSets) {
             if (convexSet.isPointOnOrInside(point, tolerance))
@@ -180223,7 +180360,10 @@ class UnionOfConvexClipPlaneSets {
         }
         return false;
     }
-    /** Return true if true is returned for any contained convex set returns true for `convexSet.isSphereOnOrInside (point, tolerance)`  */
+    /**
+     * Return true if true is returned for any contained convex set returns true for
+     * `convexSet.isSphereOnOrInside (point, tolerance)`.
+     */
     isSphereInside(point, radius) {
         for (const convexSet of this._convexSets) {
             if (convexSet.isSphereInside(point, radius))
@@ -180231,7 +180371,7 @@ class UnionOfConvexClipPlaneSets {
         }
         return false;
     }
-    /** test if any part of a line segment is within the volume */
+    /** Test if any part of a line segment is within the volume. */
     isAnyPointInOrOnFromSegment(segment) {
         for (const convexSet of this._convexSets) {
             if (convexSet.announceClippedSegmentIntervals(0.0, 1.0, segment.point0Ref, segment.point1Ref))
@@ -180241,19 +180381,19 @@ class UnionOfConvexClipPlaneSets {
     }
     // Intervals must be Segment1d array, as there may be multiple intervals along segment that pass through set regions,
     // and so splitting the intervals into segments aids in better organization
-    /** Returns the fractions of the segment that pass through the set region, as 1 dimensional pieces */
+    /** Returns the fractions of the segment that pass through the set region, as 1 dimensional pieces. */
     appendIntervalsFromSegment(segment, intervals) {
         for (const convexSet of this._convexSets) {
             convexSet.announceClippedSegmentIntervals(0.0, 1.0, segment.point0Ref, segment.point1Ref, (fraction0, fraction1) => intervals.push(_geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_3__.Segment1d.create(fraction0, fraction1)));
         }
     }
-    /** apply `transform` to all the ConvexClipPlaneSet's */
+    /** Apply `transform` to all the ConvexClipPlaneSet's. */
     transformInPlace(transform) {
         for (const convexSet of this._convexSets) {
             convexSet.transformInPlace(transform);
         }
     }
-    /** Returns 1, 2, or 3 based on whether point is strongly inside, ambiguous, or strongly outside respectively */
+    /** Returns 1, 2, or 3 based on whether point is strongly inside, ambiguous, or strongly outside respectively. */
     classifyPointContainment(points, onIsOutside) {
         for (const convexSet of this._convexSets) {
             const thisStatus = convexSet.classifyPointContainment(points, onIsOutside);
@@ -180262,7 +180402,10 @@ class UnionOfConvexClipPlaneSets {
         }
         return _ClipUtils__WEBPACK_IMPORTED_MODULE_4__.ClipPlaneContainment.StronglyOutside;
     }
-    /** Clip a polygon using this ClipPlaneSet, returning new polygon boundaries. Note that each polygon may lie next to the previous, or be disconnected. */
+    /**
+     * Clip a polygon using this ClipPlaneSet, returning new polygon boundaries. Note that each polygon may lie
+     * next to the previous, or be disconnected.
+     */
     polygonClip(input, output) {
         output.length = 0;
         if (Array.isArray(input))
@@ -180276,13 +180419,13 @@ class UnionOfConvexClipPlaneSets {
         }
     }
     /**
-     * * announce clipSegment() for each convexSet in this ClipPlaneSet.
-     * * all clipPlaneSets are inspected
+     * Announce clipSegment() for each convexSet in this ClipPlaneSet.
+     * * all clipPlaneSets are inspected.
      * * announced intervals are for each individual clipPlaneSet -- adjacent intervals are not consolidated.
      * @param f0 active interval start.
-     * @param f1 active interval end
-     * @param pointA line segment start
-     * @param pointB line segment end
+     * @param f1 active interval end.
+     * @param pointA line segment start.
+     * @param pointB line segment end.
      * @param announce function to announce interval.
      * @returns Return true if any announcements are made.
      */
@@ -180294,7 +180437,8 @@ class UnionOfConvexClipPlaneSets {
         }
         return numAnnounce > 0;
     }
-    /** Find parts of an arc that are inside any member clipper.
+    /**
+     * Find parts of an arc that are inside any member clipper.
      * Announce each with `announce(startFraction, endFraction, this)`
      */
     announceClippedArcIntervals(arc, announce) {
@@ -180310,12 +180454,12 @@ class UnionOfConvexClipPlaneSets {
     }
     /**
      * Collect the output from computePlanePlanePlaneIntersections in all the contained convex sets.
-     *
      * @param transform (optional) transform to apply to the points.
      * @param points (optional) array to which computed points are to be added.
-     * @param range (optional) range to be extended by the computed points
+     * @param range (optional) range to be extended by the computed points.
      * @param transform (optional) transform to apply to the accepted points.
-     * @param testContainment if true, test each point to see if it is within the convex set.  (Send false if confident that the convex set is rectilinear set such as a slab.  Send true if chiseled corners are possible)
+     * @param testContainment if true, test each point to see if it is within the convex set (send false if confident
+     * that the convex set is rectilinear set such as a slab. Send true if chiseled corners are possible).
      * @returns number of points.
      */
     computePlanePlanePlaneIntersectionsInAllConvexSets(points, rangeToExtend, transform, testContainment = true) {
@@ -180329,8 +180473,9 @@ class UnionOfConvexClipPlaneSets {
      * Multiply all ClipPlanes DPoint4d by matrix.
      * @param matrix matrix to apply.
      * @param invert if true, use in verse of the matrix.
-     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter)
-     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect on the plane is the inverse transpose of matrixA
+     * @param transpose if true, use the transpose of the matrix (or inverse, per invert parameter).
+     * * Note that if matrixA is applied to all of space, the matrix to send to this method to get a corresponding effect
+     * on the plane is the inverse transpose of matrixA.
      * * Callers that will apply the same matrix to many planes should pre-invert the matrix for efficiency.
      * * Both params default to true to get the full effect of transforming space.
      * @param matrix matrix to apply
@@ -180367,7 +180512,7 @@ class UnionOfConvexClipPlaneSets {
             this._convexSets.push(convexSet);
         }
     }
-    /** move convex sets from source.*/
+    /** Move convex sets from source.*/
     takeConvexSets(source) {
         let convexSet;
         while ((undefined !== (convexSet = source._convexSets.pop()))) {
@@ -180377,8 +180522,10 @@ class UnionOfConvexClipPlaneSets {
     /**
      *
      * @param xyz input polygon.  This is not changed.
-     * @param insideFragments Array to receive "inside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
-     * @param outsideFragments Array to receive "outside" fragments.  Each fragment is a GrowableXYZArray grabbed from the cache.  This is NOT cleared.
+     * @param insideFragments Array to receive "inside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
+     * @param outsideFragments Array to receive "outside" fragments. Each fragment is a GrowableXYZArray grabbed from
+     * the cache. This is NOT cleared.
      * @param arrayCache cache for reusable GrowableXYZArray.
      */
     appendPolygonClip(xyz, insideFragments, outsideFragments, arrayCache) {
@@ -180576,8 +180723,8 @@ class LineStringOffsetClipperContext {
      * @param points
      * @param positiveOffsetLeft offset to left.  0 is clip on the path.
      * @param positiveOffsetRight offset to the right.  0 is clip on the path.
-     * @param z0 z for lower clipping plane.  If undefined, unbounded in positive z
-     * @param z1 z for upper clipping plane.  If undefined, unbounded in negative z.
+     * @param z0 z for lower clipping plane. If undefined, unbounded in positive z
+     * @param z1 z for upper clipping plane. If undefined, unbounded in negative z.
      */
     static createClipBetweenOffsets(points, positiveOffsetLeft, positiveOffsetRight, z0, z1) {
         const context = new LineStringOffsetClipperContext(positiveOffsetLeft, positiveOffsetRight);
@@ -283013,9 +283160,9 @@ const gBase64 = {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js":
 /*!******************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js ***!
   \******************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283032,9 +283179,9 @@ function _arrayLikeToArray(arr, len) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283049,9 +283196,9 @@ function _arrayWithHoles(arr) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js":
 /*!***********************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js ***!
   \***********************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283069,9 +283216,9 @@ function _assertThisInitialized(self) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/classCallCheck.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/classCallCheck.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/classCallCheck.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/classCallCheck.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283088,9 +283235,9 @@ function _classCallCheck(instance, Constructor) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/createClass.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/createClass.js":
 /*!*************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/createClass.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/createClass.js ***!
   \*************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283099,7 +283246,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _createClass)
 /* harmony export */ });
-/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
 
 function _defineProperties(target, props) {
   for (var i = 0; i < props.length; i++) {
@@ -283121,9 +283268,9 @@ function _createClass(Constructor, protoProps, staticProps) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/defineProperty.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/defineProperty.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/defineProperty.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/defineProperty.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283132,7 +283279,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _defineProperty)
 /* harmony export */ });
-/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
+/* harmony import */ var _toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./toPropertyKey.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js");
 
 function _defineProperty(obj, key, value) {
   key = (0,_toPropertyKey_js__WEBPACK_IMPORTED_MODULE_0__["default"])(key);
@@ -283151,9 +283298,9 @@ function _defineProperty(obj, key, value) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283171,9 +283318,9 @@ function _getPrototypeOf(o) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/inherits.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/inherits.js":
 /*!**********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/inherits.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/inherits.js ***!
   \**********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283182,7 +283329,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _inherits)
 /* harmony export */ });
-/* harmony import */ var _setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./setPrototypeOf.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js");
+/* harmony import */ var _setPrototypeOf_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./setPrototypeOf.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js");
 
 function _inherits(subClass, superClass) {
   if (typeof superClass !== "function" && superClass !== null) {
@@ -283203,9 +283350,9 @@ function _inherits(subClass, superClass) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/iterableToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/iterableToArray.js":
 /*!*****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/iterableToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/iterableToArray.js ***!
   \*****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283220,9 +283367,9 @@ function _iterableToArray(iter) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js":
 /*!*****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js ***!
   \*****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283237,9 +283384,9 @@ function _nonIterableRest() {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js":
 /*!***************************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js ***!
   \***************************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283248,8 +283395,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _possibleConstructorReturn)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assertThisInitialized.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _assertThisInitialized_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./assertThisInitialized.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
 
 
 function _possibleConstructorReturn(self, call) {
@@ -283263,9 +283410,9 @@ function _possibleConstructorReturn(self, call) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js":
 /*!****************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/setPrototypeOf.js ***!
   \****************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283284,9 +283431,9 @@ function _setPrototypeOf(o, p) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toArray.js":
 /*!*********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toArray.js ***!
   \*********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283295,10 +283442,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _toArray)
 /* harmony export */ });
-/* harmony import */ var _arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithHoles.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js");
-/* harmony import */ var _iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/iterableToArray.js");
-/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
-/* harmony import */ var _nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableRest.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js");
+/* harmony import */ var _arrayWithHoles_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayWithHoles.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayWithHoles.js");
+/* harmony import */ var _iterableToArray_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./iterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/iterableToArray.js");
+/* harmony import */ var _unsupportedIterableToArray_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./unsupportedIterableToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js");
+/* harmony import */ var _nonIterableRest_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./nonIterableRest.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/nonIterableRest.js");
 
 
 
@@ -283309,9 +283456,9 @@ function _toArray(arr) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPrimitive.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPrimitive.js":
 /*!*************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPrimitive.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPrimitive.js ***!
   \*************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283320,7 +283467,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _toPrimitive)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js");
 
 function _toPrimitive(input, hint) {
   if ((0,_typeof_js__WEBPACK_IMPORTED_MODULE_0__["default"])(input) !== "object" || input === null) return input;
@@ -283335,9 +283482,9 @@ function _toPrimitive(input, hint) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js":
 /*!***************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPropertyKey.js ***!
   \***************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283346,8 +283493,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _toPropertyKey)
 /* harmony export */ });
-/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toPrimitive.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toPrimitive.js");
+/* harmony import */ var _typeof_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./typeof.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _toPrimitive_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./toPrimitive.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toPrimitive.js");
 
 
 function _toPropertyKey(arg) {
@@ -283357,9 +283504,9 @@ function _toPropertyKey(arg) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js":
 /*!********************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js ***!
   \********************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283380,9 +283527,9 @@ function _typeof(obj) {
 
 /***/ }),
 
-/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js":
+/***/ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js":
 /*!****************************************************************************************************************************************!*\
-  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js ***!
+  !*** ../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/unsupportedIterableToArray.js ***!
   \****************************************************************************************************************************************/
 /***/ ((__unused_webpack___webpack_module__, __webpack_exports__, __webpack_require__) => {
 
@@ -283391,7 +283538,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "default": () => (/* binding */ _unsupportedIterableToArray)
 /* harmony export */ });
-/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
+/* harmony import */ var _arrayLikeToArray_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./arrayLikeToArray.js */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/arrayLikeToArray.js");
 
 function _unsupportedIterableToArray(o, minLen) {
   if (!o) return;
@@ -283825,15 +283972,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   t: () => (/* binding */ t),
 /* harmony export */   use: () => (/* binding */ use)
 /* harmony export */ });
-/* harmony import */ var _babel_runtime_helpers_esm_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/typeof */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/typeof.js");
-/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
-/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/createClass.js");
-/* harmony import */ var _babel_runtime_helpers_esm_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/esm/assertThisInitialized */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
-/* harmony import */ var _babel_runtime_helpers_esm_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/esm/inherits */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/inherits.js");
-/* harmony import */ var _babel_runtime_helpers_esm_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/esm/possibleConstructorReturn */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
-/* harmony import */ var _babel_runtime_helpers_esm_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/esm/getPrototypeOf */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
-/* harmony import */ var _babel_runtime_helpers_esm_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/esm/defineProperty */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/defineProperty.js");
-/* harmony import */ var _babel_runtime_helpers_esm_toArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/esm/toArray */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.5/node_modules/@babel/runtime/helpers/esm/toArray.js");
+/* harmony import */ var _babel_runtime_helpers_esm_typeof__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @babel/runtime/helpers/esm/typeof */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/typeof.js");
+/* harmony import */ var _babel_runtime_helpers_esm_classCallCheck__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! @babel/runtime/helpers/esm/classCallCheck */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/classCallCheck.js");
+/* harmony import */ var _babel_runtime_helpers_esm_createClass__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! @babel/runtime/helpers/esm/createClass */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/createClass.js");
+/* harmony import */ var _babel_runtime_helpers_esm_assertThisInitialized__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! @babel/runtime/helpers/esm/assertThisInitialized */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/assertThisInitialized.js");
+/* harmony import */ var _babel_runtime_helpers_esm_inherits__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! @babel/runtime/helpers/esm/inherits */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/inherits.js");
+/* harmony import */ var _babel_runtime_helpers_esm_possibleConstructorReturn__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! @babel/runtime/helpers/esm/possibleConstructorReturn */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/possibleConstructorReturn.js");
+/* harmony import */ var _babel_runtime_helpers_esm_getPrototypeOf__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! @babel/runtime/helpers/esm/getPrototypeOf */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/getPrototypeOf.js");
+/* harmony import */ var _babel_runtime_helpers_esm_defineProperty__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! @babel/runtime/helpers/esm/defineProperty */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/defineProperty.js");
+/* harmony import */ var _babel_runtime_helpers_esm_toArray__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! @babel/runtime/helpers/esm/toArray */ "../../common/temp/node_modules/.pnpm/@babel+runtime@7.22.6/node_modules/@babel/runtime/helpers/esm/toArray.js");
 
 
 
@@ -286713,7 +286860,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.1.0-dev.70","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","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:^4.1.0-dev.70","@itwin/core-bentley":"workspace:^4.1.0-dev.70","@itwin/core-common":"workspace:^4.1.0-dev.70","@itwin/core-geometry":"workspace:^4.1.0-dev.70","@itwin/core-orbitgt":"workspace:^4.1.0-dev.70","@itwin/core-quantity":"workspace:^4.1.0-dev.70"},"//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/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.0.0","@itwin/object-storage-core":"^2.0.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.1.0-dev.72","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","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:^4.1.0-dev.72","@itwin/core-bentley":"workspace:^4.1.0-dev.72","@itwin/core-common":"workspace:^4.1.0-dev.72","@itwin/core-geometry":"workspace:^4.1.0-dev.72","@itwin/core-orbitgt":"workspace:^4.1.0-dev.72","@itwin/core-quantity":"workspace:^4.1.0-dev.72"},"//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/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.0.0","@itwin/object-storage-core":"^2.0.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
 
 /***/ })