@itwin/ecschema-rpcinterface-tests 4.1.0-dev.12 → 4.1.0-dev.14

package/lib/dist/bundled-tests.js

@@ -28309,6 +28309,8 @@ __webpack_require__.r(__webpack_exports__);
  */
 var TypeOfChange;
 (function (TypeOfChange) {
+    /** Element contains no changes */
+    TypeOfChange[TypeOfChange["NoChange"] = 0] = "NoChange";
     /** A property in the element changed */
     TypeOfChange[TypeOfChange["Property"] = 1] = "Property";
     /** The geometry stream of a [GeometricElement]($backend) changed */
@@ -181145,7 +181147,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /**
- * * Annotation of an interval of a curve.
+ * Annotation of an interval of a curve.
  * * The interval is marked with two pairs of numbers:
  * * * fraction0, fraction1 = fraction parameters along the child curve
  * * * distance0,distance1 = distances within containing CurveChainWithDistanceIndex
@@ -181169,8 +181171,7 @@ class PathFragment {
     containsChainDistance(distance) {
         return distance >= this.chainDistance0 && distance <= this.chainDistance1;
     }
-    // Return a quick distance to the curve.   This may be SMALLER than true distance but may
-    // not be larger.
+    /** Return a quick distance to the curve.  This may be SMALLER than true distance but may not be larger */
     quickMinDistanceToChildCurve(spacePoint) {
         if (this.range) {
             return this.range.distanceToPoint(spacePoint);
@@ -181181,8 +181182,10 @@ class PathFragment {
             return detail.a;
         return 0;
     }
-    // Return an array with (references to) all the path fragments, sorted smallest to largest on
-    //   the "a" value equal to the quick min distance to the fragment
+    /**
+     * Return an array with (references to) all the path fragments, sorted smallest to largest on the "a" value
+     * equal to the quick min distance to the fragment
+     */
     static collectSortedQuickMinDistances(fragments, spacePoint) {
         const sortedFragments = [];
         for (const f of fragments) {
@@ -181199,26 +181202,28 @@ class PathFragment {
     containsChildCurveAndChildFraction(curve, fraction) {
         return this.childCurve === curve && fraction >= this.childFraction0 && fraction <= this.childFraction1;
     }
-    /** Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.
+    /**
+     * Convert distance to local fraction, and apply that to interpolate between the stored curve fractions.
      * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.
      */
     chainDistanceToInterpolatedChildFraction(distance) {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.inverseInterpolate(this.childFraction0, this.chainDistance0, this.childFraction1, this.chainDistance1, distance, this.childFraction0); // the interval "must" have nonzero length, division should be safe . ..
     }
-    /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction
-     */
+    /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */
     chainDistanceToAccurateChildFraction(chainDistance, allowExtrapolation) {
         // The fragments are really expected to do good mappings in their distance range ...
         const childDetail = this.childCurve.moveSignedDistanceFromFraction(this.childFraction0, chainDistance - this.chainDistance0, allowExtrapolation ?? false);
         return childDetail.fraction;
     }
-    /** Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
+    /**
+     * Return the scale factor to map childCurve fraction derivatives to chain fraction derivatives
      * @param globalDistance total length of the global curve.
      */
     fractionScaleFactor(globalDistance) {
         return globalDistance * (this.childFraction1 - this.childFraction0) / (this.chainDistance1 - this.chainDistance0);
     }
-    /** Reverse the fraction and distance data.
+    /**
+     * Reverse the fraction and distance data.
      * * each child fraction `f` is replaced by `1-f`
      * * each `chainDistance` is replaced by `totalDistance-chainDistance`
      */
@@ -181237,7 +181242,7 @@ class PathFragment {
         return this.childFractionToChainDistance(fraction);
     }
     /**
-     * convert a fractional position on the childCurve to distance in the chain space.
+     * Convert a fractional position on the childCurve to distance in the chain space.
      * * Return value is SIGNED -- will be negative when fraction < this.childFraction0.
      * @param fraction fraction along the curve within this fragment
      */
@@ -181259,7 +181264,6 @@ class DistanceIndexConstructionContext {
     startCurvePrimitive(_cp) { }
     endParentCurvePrimitive(_cp) { }
     endCurvePrimitive(_cp) { }
-    // um .. we need to see curves? how to reject?
     announcePointTangent(_xyz, _fraction, _tangent) { }
     /** Announce numPoints interpolated between point0 and point1, with associated fractions */
     announceSegmentInterval(cp, point0, point1, numStrokes, fraction0, fraction1) {
@@ -181306,13 +181310,17 @@ class DistanceIndexConstructionContext {
 /**
  * `CurveChainWithDistanceIndex` is a CurvePrimitive whose fractional parameterization is proportional to true
  * distance along a CurveChain.
+ * * For example if the total length of the chain is `L`, then the distance along the chain from parameters `t0`
+ * to `t1` is easily computed as `L*(t1-t0)`.
  * * The curve chain can be any type derived from CurveChain.
  * * * i.e. either a `Path` or a `Loop`
  * @public
  */
 class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__.CurvePrimitive {
     /** Test if other is a `CurveChainWithDistanceIndex` */
-    isSameGeometryClass(other) { return other instanceof CurveChainWithDistanceIndex; }
+    isSameGeometryClass(other) {
+        return other instanceof CurveChainWithDistanceIndex;
+    }
     // final assembly of CurveChainWithDistanceIndex -- caller must create valid fragment index.
     constructor(path, fragments) {
         super();
@@ -181332,14 +181340,20 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
             return CurveChainWithDistanceIndex.createCapture(c);
         return undefined;
     }
-    /** Reference to the contained path.
+    /**
+     * Reference to the contained path.
      * * Do not modify the path.  The distance index will be wrong.
      */
-    get path() { return this._path; }
-    /** Reference to the fragments array.
+    get path() {
+        return this._path;
+    }
+    /**
+     * Reference to the fragments array.
      * * Do not modify.
      */
-    get fragments() { return this._fragments; }
+    get fragments() {
+        return this._fragments;
+    }
     /** Return a deep clone */
     clone() {
         const c = this._path.clone();
@@ -181411,7 +181425,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
             newPath.children.reverse();
         return CurveChainWithDistanceIndex.createCapture(newPath);
     }
-    /** Ask if the curve is within tolerance of a plane.
+    /**
+     * Ask if the curve is within tolerance of a plane.
      * @returns Returns true if the curve is completely within tolerance of the plane.
      */
     isInPlane(plane) {
@@ -181421,7 +181436,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         return true;
     }
-    /** return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */
+    /** Return the start point of the primitive.  The default implementation returns fractionToPoint (0.0) */
     startPoint(result) {
         const c = this._path.cyclicCurvePrimitive(0);
         if (c)
@@ -181441,7 +181456,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
             c.emitStrokes(dest, options);
         }
     }
-    /** Ask the curve to announce points and simple subcurve fragments for stroking.
+    /**
+     * Ask the curve to announce points and simple subcurve fragments for stroking.
      * See IStrokeHandler for description of the sequence of the method calls.
      */
     emitStrokableParts(dest, options) {
@@ -181450,7 +181466,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
     }
     /**
-     * return the stroke count required for given options.
+     * Return the stroke count required for given options.
      * @param options StrokeOptions that determine count
      */
     computeStrokeCountForOptions(options) {
@@ -181464,7 +181480,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * Return an array containing only the curve primitives.
      * @param collectorArray array to receive primitives (pushed -- the array is not cleared)
      * @param smallestPossiblePrimitives if true, recurse on the (otherwise hidden) children. If false, only push `this`.
-     * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].
+     * @param explodeLinestrings (if smallestPossiblePrimitives is true) whether to push a [[LineSegment3d]] for each
+     * segment of a [[LineString3d]] child. If false, push only the [[LineString3d]].
      */
     collectCurvePrimitivesGo(collectorArray, smallestPossiblePrimitives = false, explodeLineStrings = false) {
         if (smallestPossiblePrimitives) {
@@ -181477,7 +181494,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
     }
     /**
-     * construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.
+     * Construct StrokeCountMap for each child, accumulating data to stroke count map for this primitive.
      * @param options StrokeOptions that determine count
      * @param parentStrokeMap evolving parent map.
      */
@@ -181488,20 +181505,19 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__.CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);
     }
-    /** Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`
+    /**
+     * Second step of double dispatch:  call `this._path.dispatchToGeometryHandler (handler)`
      * * Note that this exposes the children individually to the handler.
      */
     dispatchToGeometryHandler(handler) {
         return this._path.dispatchToGeometryHandler(handler);
     }
-    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed)
-     */
+    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */
     extendRange(rangeToExtend, transform) {
         this._path.extendRange(rangeToExtend, transform);
     }
     /**
-     *
-     * * Curve length is always positive.
+     * Curve length is always positive.
      * @returns Returns a (high accuracy) length of the curve between fractional positions
      * @returns Returns the length of the curve.
      */
@@ -181553,7 +181569,9 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * Convert distance along the chain to fraction along the chain.
      * @param distance distance along the chain
      */
-    chainDistanceToChainFraction(distance) { return distance / this._totalLength; }
+    chainDistanceToChainFraction(distance) {
+        return distance / this._totalLength;
+    }
     /**
      * Resolve a fraction within a specific curve to a fragment.
      * @param curve
@@ -181575,9 +181593,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         return undefined;
     }
-    /**
-     * Returns the total length of curves.
-     */
+    /** Returns the total length of curves. */
     curveLength() {
         return this._totalLength;
     }
@@ -181604,8 +181620,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         //    fragment = this.chainDistanceToFragment(chainDistance, true);
         return this._fragments[0].childCurve.fractionToPoint(0.0, result);
     }
-    /** Return the point (x,y,z) and derivative on the curve at fractional position.
-     *
+    /**
+     * Return the point (x,y,z) and derivative on the curve at fractional position.
      * * Note that this derivative is "derivative of xyz with respect to fraction."
      * * this derivative shows the speed of the "fractional point" moving along the curve.
      * * this is not generally a unit vector.  use fractionToPointAndUnitTangent for a unit vector.
@@ -181639,10 +181655,11 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         result.direction.normalizeInPlace();
         return result;
     }
-    /** Return a plane with
-     *
+    /**
+     * Return a plane with
      * * origin at fractional position along the curve
-     * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to the fraction.
+     * * vectorU is the first derivative, i.e. tangent vector with length equal to the rate of change with respect to
+     * the fraction.
      * * vectorV is the second derivative, i.e.derivative of vectorU.
      */
     fractionToPointAnd2Derivatives(fraction, result) {
@@ -181668,7 +181685,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         result.vectorV.scaleInPlace(scale * scale);
         return result;
     }
-    /** Attempt to transform in place.
+    /**
+     * Attempt to transform in place.
      * * Warning: If any child fails, this object becomes invalid.  But that should never happen.
      */
     tryTransformInPlace(transform) {
@@ -181701,9 +181719,11 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         return false;
     }
-    /** Implement moveSignedDistanceFromFraction.
+    /**
+     * Implement moveSignedDistanceFromFraction.
      * * See `CurvePrimitive` for parameter details.
-     * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.
+     * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and
+     * has pointer to an additional detail for the child curve.
      */
     moveSignedDistanceFromFraction(startFraction, signedDistance, allowExtension, result) {
         const distanceA = startFraction * this._totalLength;
@@ -181716,7 +181736,6 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         return chainDetail;
     }
     /**
-     *
      * The returned object has
      * * numCalls = number of times closestPoint was called.
      * * numCurvesTested = number of curves tested with full closestPoint
@@ -181737,10 +181756,12 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         return a;
     }
-    /** Search for the curve point that is closest to the spacePoint.
+    /**
+     * Search for the curve point that is closest to the spacePoint.
      * * The CurveChainWithDistanceIndex invokes the base class CurvePrimitive method, which
      *     (via a handler) determines a CurveLocation detail among the children.
-     * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and has pointer to an additional detail for the child curve.
+     * * The returned detail directly identifies fractional position along the CurveChainWithDistanceIndex, and
+     * has pointer to an additional detail for the child curve.
      * @param spacePoint point in space
      * @param extend true to extend the curve
      * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
@@ -181789,7 +181810,8 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * Construct an offset of each child as viewed in the xy-plane (ignoring z).
-     * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully joined offset.
+     * * No attempt is made to join the offset children. Use RegionOps.constructCurveXYOffset() to return a fully
+     * joined offset.
      * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object
      */
     constructOffsetXY(offsetDistanceOrOptions) {
@@ -181806,10 +181828,13 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         return offsets;
     }
-    /** Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
+    /**
+     * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of
+     * projection.
      * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
      * @param lowHigh optional receiver for output
-     * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the end of the ray.
+     * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the
+     * end of the ray.
      */
     projectedParameterRange(ray, lowHigh) {
         return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_10__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
@@ -188632,14 +188657,16 @@ __webpack_require__.r(__webpack_exports__);
  * @public
  */
 class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
-    /** test if `other` is a `Loop` */
-    isSameGeometryClass(other) { return other instanceof Loop; }
+    /** Test if `other` is a `Loop` */
+    isSameGeometryClass(other) {
+        return other instanceof Loop;
+    }
     /** Test if `other` is an instance of `Loop` */
     constructor() {
         super();
         /** String name for schema properties */
         this.curveCollectionType = "loop";
-        /** tag value that can be set to true for user code to mark inner and outer loops. */
+        /** Tag value that can be set to true for user code to mark inner and outer loops. */
         this.isInner = false;
     }
     /**
@@ -188684,13 +188711,22 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         return Loop.create(strokes);
     }
     /** Return the boundary type (2) of a corresponding  MicroStation CurveVector */
-    dgnBoundaryType() { return 2; } // (2) all "Loop" become "outer"
-    /** invoke `processor.announceLoop(this, indexInParent)` */
+    dgnBoundaryType() {
+        /**
+         * All "Loop" become "outer". TypeScript Loop object is equivalent to a native CurveVector with
+         * boundaryType = BOUNDARY_TYPE_Outer. In other words, TypeScript has no flavor of Loop that
+         * carries "hole" semantics.
+         */
+        return 2;
+    }
+    /** Invoke `processor.announceLoop(this, indexInParent)` */
     announceToCurveProcessor(processor, indexInParent = -1) {
         return processor.announceLoop(this, indexInParent);
     }
     /** Create a new `Loop` with no children */
-    cloneEmptyPeer() { return new Loop(); }
+    cloneEmptyPeer() {
+        return new Loop();
+    }
     /** Second step of double dispatch:  call `handler.handleLoop(this)` */
     dispatchToGeometryHandler(handler) {
         return handler.handleLoop(this);
@@ -188701,6 +188737,7 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
  * @public
  */
 class LoopCurveLoopCurve {
+    /** Constructor */
     constructor(loopA, curveA, loopB, curveB) {
         this.loopA = loopA;
         this.curveA = curveA;
@@ -188750,9 +188787,13 @@ __webpack_require__.r(__webpack_exports__);
  */
 class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCollection {
     /** Test if `other` is an instance of `ParityRegion` */
-    isSameGeometryClass(other) { return other instanceof ParityRegion; }
+    isSameGeometryClass(other) {
+        return other instanceof ParityRegion;
+    }
     /** Return the array of loops in this parity region. */
-    get children() { return this._children; }
+    get children() {
+        return this._children;
+    }
     /** Construct parity region with empty loop array */
     constructor() {
         super();
@@ -188760,9 +188801,7 @@ class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCo
         this.curveCollectionType = "parityRegion";
         this._children = [];
     }
-    /**
-     * Add loops (recursively) to this region's children
-     */
+    /** Add loops (recursively) to this region's children */
     addLoops(data) {
         if (data === undefined) {
         }
@@ -188777,7 +188816,8 @@ class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCo
             }
         }
     }
-    /** Return a single loop or parity region with given loops.
+    /**
+     * Return a single loop or parity region with given loops.
      * * The returned structure CAPTURES the loops.
      * * The loops are NOT reorganized by hole analysis.
      */
@@ -188797,8 +188837,10 @@ class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCo
         return result;
     }
     /** Return the boundary type (4) of a corresponding  MicroStation CurveVector */
-    dgnBoundaryType() { return 4; }
-    /** invoke `processor.announceParityRegion(this, indexInParent)` */
+    dgnBoundaryType() {
+        return 4;
+    }
+    /** Invoke `processor.announceParityRegion(this, indexInParent)` */
     announceToCurveProcessor(processor, indexInParent = -1) {
         return processor.announceParityRegion(this, indexInParent);
     }
@@ -188825,9 +188867,12 @@ class ParityRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCo
         return clone;
     }
     /** Create a new empty parity region. */
-    cloneEmptyPeer() { return new ParityRegion(); }
-    /** Add `child` to this parity region.
-     * * any child type other than `Loop` is ignored.
+    cloneEmptyPeer() {
+        return new ParityRegion();
+    }
+    /**
+     * Add `child` to this parity region.
+     * * Any child type other than `Loop` is ignored.
      */
     tryAddChild(child) {
         if (child && child instanceof _Loop__WEBPACK_IMPORTED_MODULE_1__.Loop) {
@@ -188876,14 +188921,16 @@ __webpack_require__.r(__webpack_exports__);
 
 /**
  * * A `Path` object is a collection of curves that join head-to-tail to form a path.
- * * A `Path` object does not bound a planar region.  Use `Loop` to indicate region bounding.
+ * * A `Path` object does not bound a planar region. Use `Loop` to indicate region bounding.
  * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.
  * @public
  */
 class Path extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
     /** Test if `other` is an instance of `Path` */
-    isSameGeometryClass(other) { return other instanceof Path; }
-    /** invoke `processor.announcePath(this, indexInParent)` */
+    isSameGeometryClass(other) {
+        return other instanceof Path;
+    }
+    /** Invoke `processor.announcePath(this, indexInParent)` */
     announceToCurveProcessor(processor, indexInParent = -1) {
         return processor.announcePath(this, indexInParent);
     }
@@ -188895,7 +188942,7 @@ class Path extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
     }
     /**
      * Create a path from a variable length list of curve primitives
-     * * CurvePrimitive params are captured !!!
+     * * CurvePrimitive params are captured.
      * @param curves variable length list of individual curve primitives or point arrays.
      */
     static create(...curves) {
@@ -188910,8 +188957,8 @@ class Path extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         return result;
     }
     /**
-     * Create a path from a an array of curve primitives
-     * @param curves array of individual curve primitives
+     * Create a path from a an array of curve primitives.
+     * @param curves array of individual curve primitives.
      */
     static createArray(curves) {
         const result = new Path();
@@ -188928,10 +188975,14 @@ class Path extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         return Path.create(strokes);
     }
     /** Return the boundary type (1) of a corresponding  MicroStation CurveVector */
-    dgnBoundaryType() { return 1; }
+    dgnBoundaryType() {
+        return 1;
+    }
     /** Clone as a new `Path` with no primitives */
-    cloneEmptyPeer() { return new Path(); }
-    /** Second step of double dispatch:  call `handler.handlePath(this)` */
+    cloneEmptyPeer() {
+        return new Path();
+    }
+    /** Second step of double dispatch: call `handler.handlePath(this)` */
     dispatchToGeometryHandler(handler) {
         return handler.handlePath(this);
     }
@@ -189153,11 +189204,9 @@ __webpack_require__.r(__webpack_exports__);
  */
 
 /**
- * A ProxyCurve is expected to be used as a base class for
- * curve types that use some existing curve (the proxy) for evaluation and display
- * but carry other defining data.
- * * The ProxyCurve implements all required CurvePrimitive methods by dispatching
- *    to the proxy.
+ * A ProxyCurve is expected to be used as a base class for curve types that use some existing curve (the proxy)
+ * for evaluation and display but carry other defining data.
+ * * The ProxyCurve implements all required CurvePrimitive methods by dispatching to the proxy.
  * * These methods presumably require support from the application class and are left abstract:
  *    * clone
  *    * curvePrimitiveType
@@ -189177,8 +189226,10 @@ class ProxyCurve extends _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_0__.Curv
         super();
         this._proxyCurve = proxyCurve;
     }
-    /** return the (pointer to) the proxy curve. */
-    get proxyCurve() { return this._proxyCurve; }
+    /** Return the (pointer to) the proxy curve. */
+    get proxyCurve() {
+        return this._proxyCurve;
+    }
     /** Implement by proxyCurve */
     computeStrokeCountForOptions(options) {
         return this._proxyCurve.computeStrokeCountForOptions(options);
@@ -190940,7 +190991,8 @@ var RegionBinaryOpType;
  *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.
  * The common "One outer loop and many Inner loops" is a parity region.
  *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.
- * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.
+ * * Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has been
+ * rotated parallel to the xy-plane.
  * @public
  */
 class RegionOps {
@@ -190959,7 +191011,8 @@ class RegionOps {
         }
         return undefined;
     }
-    /** Return an area tolerance for a given xy-range and optional distance tolerance.
+    /**
+     * Return an area tolerance for a given xy-range and optional distance tolerance.
      * @param range range of planar region to tolerance
      * @param distanceTolerance optional absolute distance tolerance
     */
@@ -190982,7 +191035,8 @@ class RegionOps {
         }
         return undefined;
     }
-    /** Return MomentData with the sums of wire moments.
+    /**
+     * Return MomentData with the sums of wire moments.
      * * If `rawMomentData` is the MomentData returned by computeXYAreaMoments, convert to principal axes and moments with
      *    call `principalMomentData = MomentData.inertiaProductsToPrincipalAxes (rawMomentData.origin, rawMomentData.sums);`
      * @param root any CurveCollection or CurvePrimitive.
@@ -190995,7 +191049,7 @@ class RegionOps {
         return result;
     }
     /**
-     * * create loops in the graph.
+     * Create loops in the graph.
      * @internal
      */
     static addLoopsToGraph(graph, data, announceIsolatedLoop) {
@@ -191039,7 +191093,8 @@ class RegionOps {
             }
         }
     }
-    /** Add multiple loops to a graph.
+    /**
+     * Add multiple loops to a graph.
      * * Apply edgeTag and mask to each edge.
      * @internal
      */
@@ -191058,7 +191113,6 @@ class RegionOps {
     /**
      * Given a graph just produced by booleans, convert to a polyface
      * * "just produced" implies exterior face markup.
-     *
      * @param graph
      * @param triangulate
      */
@@ -191119,7 +191173,8 @@ class RegionOps {
      * @param loopsB second set of loops
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
-     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
+     * to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
         const result = _UnionRegion__WEBPACK_IMPORTED_MODULE_11__.UnionRegion.create();
@@ -191186,10 +191241,13 @@ class RegionOps {
         }
         return RegionOps.sortOuterAndHoleLoopsXY(allLoops);
     }
-    /** Construct a wire (not area!!) that is offset from given polyline or polygon.
+    /**
+     * Construct a wire (not area!!) that is offset from given polyline or polygon.
      * * This is a simple wire offset, not an area.
-     * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not guarantee a simple area offset.
-     * * The construction algorithm is subject to being changed, resulting in different (hopefully better) self-intersection behavior on the future.
+     * * The construction algorithm attempts to eliminate some self-intersections within the offsets, but does not
+     * guarantee a simple area offset.
+     * * The construction algorithm is subject to being changed, resulting in different (hopefully better)
+     * self-intersection behavior on the future.
      * @param points a single loop or path
      * @param wrap true to include wraparound
      * @param offsetDistance distance of offset from wire.  Positive is left.
@@ -191199,19 +191257,22 @@ class RegionOps {
         return context.constructPolygonWireXYOffset(points, wrap, offsetDistance);
     }
     /**
-   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
-   * * The construction will remove "some" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.
-   * * If offsetDistance is given as a number, default OffsetOptions are applied.
-   * * When the offset needs to do an "outside" turn, the first applicable construction is applied:
-   *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.
-   *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to single intersection point.
-   *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight lines that are:
-   *      * outside the arc
-   *      * have uniform turn angle less than `options.maxChamferDegrees`
-   *      * each line segment (except first and last) touches the arc at its midpoint.
-   * @param curves base curves.
-   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
-   */
+     * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).
+     * * The construction will remove "some" local effects of features smaller than the offset distance, but will
+     * not detect self intersection among widely separated edges.
+     * * If offsetDistance is given as a number, default OffsetOptions are applied.
+     * * When the offset needs to do an "outside" turn, the first applicable construction is applied:
+     *   * If the turn is larger than `options.minArcDegrees`, a circular arc is constructed.
+     *   * If the turn is less than or equal to `options.maxChamferTurnDegrees`, extend curves along tangent to
+     * single intersection point.
+     *   * If the turn is larger than `options.maxChamferDegrees`, the turn is constructed as a sequence of straight
+     * lines that are:
+     *      * outside the arc
+     *      * have uniform turn angle less than `options.maxChamferDegrees`
+     *      * each line segment (except first and last) touches the arc at its midpoint.
+     * @param curves base curves.
+     * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.
+     */
     static constructCurveXYOffset(curves, offsetDistanceOrOptions) {
         return _internalContexts_PolygonOffsetContext__WEBPACK_IMPORTED_MODULE_17__.CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);
     }
@@ -191225,7 +191286,8 @@ class RegionOps {
     static testPointInOnOutRegionXY(curves, x, y) {
         return _Query_InOutTests__WEBPACK_IMPORTED_MODULE_18__.PointInOnOutContext.testPointInOnOutRegionXY(curves, x, y);
     }
-    /** Create curve collection of subtype determined by gaps between the input curves.
+    /**
+     * Create curve collection of subtype determined by gaps between the input curves.
      * * If (a) wrap is requested and (b) all curves connect head-to-tail (including wraparound), assemble as a `loop`.
      * * If all curves connect head-to-tail except for closure, return a `Path`.
      * * If there are internal gaps, return a `BagOfCurves`
@@ -191262,7 +191324,9 @@ class RegionOps {
      * Announce Checkpoint function for use during booleans
      * @internal
      */
-    static setCheckPointFunction(f) { this._graphCheckPointFunction = f; }
+    static setCheckPointFunction(f) {
+        this._graphCheckPointFunction = f;
+    }
     /**
      * Find all intersections among curves in `curvesToCut` and `cutterCurves` and return fragments of `curvesToCut`.
      * * For a `Loop`, `ParityRegion`, or `UnionRegion` in `curvesToCut`:
@@ -191277,7 +191341,8 @@ class RegionOps {
     }
     /**
      * Create paths assembled from many curves.
-     * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by [[cloneCurvesWithXYSplits]].
+     * * Assemble paths from consecutive curves NOT separated by either gaps or the split markup set by
+     * [[cloneCurvesWithXYSplits]].
      * * Return simplest form -- single primitive, single path, or bag of curves.
      */
     static splitToPathsBetweenBreaks(source, makeClones) {
@@ -191314,7 +191379,8 @@ class RegionOps {
         return _internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_24__.OffsetHelpers.collectChains(fragments, gapTolerance);
     }
     /**
-     * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments of `curvesToCut`.
+     * Find all intersections among curves in `curvesToCut` against the boundaries of `region` and return fragments
+     * of `curvesToCut`.
      * * Break `curvesToCut` into parts inside, outside, and coincident.
      * @returns output object with all fragments split among `insideParts`, `outsideParts`, and `coincidentParts`
      */
@@ -191340,7 +191406,8 @@ class RegionOps {
         }
         return result;
     }
-    /** If `data` is one of several forms of a rectangle, return its edge Transform.
+    /**
+     * If `data` is one of several forms of a rectangle, return its edge Transform.
      * * Points are considered a rectangle if, within the first 4 points:
      *     * vectors from 0 to 1 and 0 to 3 are perpendicular and have a non-zero cross product
      *     * vectors from 0 to 3 and 1 to 2 are the same
@@ -191351,7 +191418,8 @@ class RegionOps {
      *   * Array of Point3d[]
      *   * IndexedXYZCollection
      * @param requireClosurePoint whether to require a 5th point equal to the 1st point.
-     * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit normal in z column. If not a rectangle, return undefined.
+     * @returns Transform with origin at one corner, x and y columns extending along two adjacent sides, and unit
+     * normal in z column. If not a rectangle, return undefined.
      */
     static rectangleEdgeTransform(data, requireClosurePoint = true) {
         if (data instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_16__.LineString3d) {
@@ -191411,9 +191479,10 @@ class RegionOps {
      * * Contiguous `LineSegment3d` and `LineString3d` objects.
      *   * collect all points
      *   * eliminate duplicated points
-     *   * eliminate points colinear with surrounding points.
-     *   * Contiguous concentric circular or elliptic arcs
+     *   * eliminate points colinear with surrounding points
+     *   * contiguous concentric circular or elliptic arcs
      *   * combine angular ranges
+     * * This function can be used to compress adjacent LineSegment3ds into a LineString3d
      * @param curves Path or loop (or larger collection containing paths and loops) to be simplified
      * @param options options for tolerance and selective simplification.
      */
@@ -191427,8 +191496,10 @@ class RegionOps {
      * @returns a region that captures the input pointers. This region is a:
      * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.
      * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.
-     * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented clockwise.
-     * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in the above cases.
+     * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented
+     * clockwise.
+     * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in
+     * the above cases.
      * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]
      */
     static sortOuterAndHoleLoopsXY(loops) {
@@ -191445,17 +191516,22 @@ class RegionOps {
     }
     /**
      * Find all areas bounded by the unstructured, possibly intersecting curves.
-     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the input curves.
-     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop, regardless
-     * of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]] to add bridge edges so that
-     * [[constructAllXYRegionLoops]] will return outer and inner loops in the same SignedLoops object.
-     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve primitives.
+     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
+     * input curves.
+     * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
+     * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
+     * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
+     * SignedLoops object.
+     * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
+     * primitives.
      * @param tolerance optional distance tolerance for coincidence
      * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
-     *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have positive area and counterclockwise orientation.
+     *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
+     * positive area and counterclockwise orientation.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
      *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.
-     *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.
+     *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent
+     * to the edge and a constituent curve in each.
      */
     static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
         const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
@@ -191471,8 +191547,10 @@ class RegionOps {
      * * Optionally recurses into hidden primitives if `smallestPossiblePrimitives` is true.
      * @param candidates input curves
      * @param collectorArray optional pre-defined output array. If defined, it is NOT cleared: primitives are appended.
-     * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If false, push the [[CurveChainWithDistanceIndex]] instead.
-     * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false, push the [[LineString3d]] instead.
+     * @param smallestPossiblePrimitives if true, recurse into the children of a [[CurveChainWithDistanceIndex]]. If
+     * false, push the [[CurveChainWithDistanceIndex]] instead.
+     * @param explodeLinestrings if true, push a [[LineSegment3d]] for each segment of a [[LineString3d]]. If false,
+     * push the [[LineString3d]] instead.
      */
     static collectCurvePrimitives(candidates, collectorArray, smallestPossiblePrimitives = false, explodeLinestrings = false) {
         const results = collectorArray === undefined ? [] : collectorArray;
@@ -191490,7 +191568,8 @@ class RegionOps {
         return results;
     }
     /**
-     * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed instances of [[LineSegment3d]].
+     * Copy primitive pointers from candidates to result array, replacing each [[LineString3d]] by newly constructed
+     * instances of [[LineSegment3d]].
      * @param candidates input curves
      * @return copied (captured) inputs except for the linestrings, which are exploded
      */
@@ -192538,10 +192617,14 @@ __webpack_require__.r(__webpack_exports__);
  * @public
  */
 class UnionRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCollection {
-    /** test if `other` is a `UnionRegion` */
-    isSameGeometryClass(other) { return other instanceof UnionRegion; }
+    /** Test if `other` is a `UnionRegion` */
+    isSameGeometryClass(other) {
+        return other instanceof UnionRegion;
+    }
     /** Return the array of regions */
-    get children() { return this._children; }
+    get children() {
+        return this._children;
+    }
     /** Constructor -- initialize with no children */
     constructor() {
         super();
@@ -192557,9 +192640,11 @@ class UnionRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCol
         }
         return result;
     }
-    /** Return the boundary type (5) of a corresponding  MicroStation CurveVector */
-    dgnBoundaryType() { return 5; }
-    /** dispatch to more strongly typed  `processor.announceUnionRegion(this, indexInParent)` */
+    /** Return the boundary type (5) of a corresponding MicroStation CurveVector */
+    dgnBoundaryType() {
+        return 5;
+    }
+    /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */
     announceToCurveProcessor(processor, indexInParent = -1) {
         return processor.announceUnionRegion(this, indexInParent);
     }
@@ -192575,8 +192660,11 @@ class UnionRegion extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveCol
         return clone;
     }
     /** Return new empty `UnionRegion` */
-    cloneEmptyPeer() { return new UnionRegion(); }
-    /** add a child.
+    cloneEmptyPeer() {
+        return new UnionRegion();
+    }
+    /**
+     * Try to add a child.
      * * Returns false if the `AnyCurve` child is not a region type.
      */
     tryAddChild(child) {
@@ -193318,11 +193406,15 @@ __webpack_require__.r(__webpack_exports__);
 
 
 // import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from "./CurveSearches";
-/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+/**
+ * Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
  * @internal
  */
 class GapSearchContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_0__.RecursiveCurveProcessorWithStack {
-    constructor() { super(); this.maxGap = 0.0; }
+    constructor() {
+        super();
+        this.maxGap = 0.0;
+    }
     static maxGap(target) {
         const context = new GapSearchContext();
         target.announceToCurveProcessor(context);
@@ -193973,10 +194065,12 @@ class PlaneAltitudeRangeContext extends _geometry3d_GeometryHandler__WEBPACK_IMP
         }
         return undefined;
     }
-    /** Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction,
-     *   and return points at min and max altitude, packed into a `LineSegment3d`.
+    /**
+     * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and
+     * return points at min and max altitude, packed into a `LineSegment3d`.
      * @param geometry geometry to project
-     * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with zero origin.
+     * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with
+     * zero origin.
      * @param lowHigh optional receiver for output
     */
     static findExtremePointsInDirection(geometry, direction, lowHigh) {
@@ -193985,10 +194079,12 @@ class PlaneAltitudeRangeContext extends _geometry3d_GeometryHandler__WEBPACK_IMP
             return _LineSegment3d__WEBPACK_IMPORTED_MODULE_10__.LineSegment3d.create(context.lowPoint, context.highPoint, lowHigh);
         return undefined;
     }
-    /** Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction,
-     *   and return the min and max altitudes, packed into a Range1d.
+    /**
+     * Compute altitudes for the geometry (via dispatch) over the plane defined by the given direction, and return
+     * the min and max altitudes, packed into a Range1d.
      * @param geometry geometry to project
-     * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with zero origin.
+     * @param direction vector or ray on which to project the instance. A `Vector3d` is treated as a `Ray3d` with
+     * zero origin.
      * @param lowHigh optional receiver for output
     */
     static findExtremeAltitudesInDirection(geometry, direction, lowHigh) {
@@ -193997,9 +194093,11 @@ class PlaneAltitudeRangeContext extends _geometry3d_GeometryHandler__WEBPACK_IMP
             return _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range1d.createFrom(context.range, lowHigh);
         return undefined;
     }
-    /** Project geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
+    /**
+     * Project geometry (via dispatch) onto the given ray, and return the extreme fractional parameters of projection.
      * @param geometry geometry to project
-     * @param direction vector or ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.
+     * @param direction vector or ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with
+     * zero origin.
      * @param lowHigh optional receiver for output
      */
     static findExtremeFractionsAlongDirection(geometry, direction, lowHigh) {
@@ -194760,7 +194858,10 @@ __webpack_require__.r(__webpack_exports__);
  * @internal
  */
 class SumLengthsContext extends _CurveProcessor__WEBPACK_IMPORTED_MODULE_0__.RecursiveCurveProcessor {
-    constructor() { super(); this._sum = 0.0; }
+    constructor() {
+        super();
+        this._sum = 0.0;
+    }
     static sumLengths(target) {
         const context = new SumLengthsContext();
         target.announceToCurveProcessor(context);
@@ -213557,13 +213658,21 @@ __webpack_require__.r(__webpack_exports__);
  */
 class RangeBase {
     /** Return 0 if high<= low, otherwise `1/(high-low)` for use in fractionalizing */
-    static npcScaleFactor(low, high) { return (high <= low) ? 0.0 : 1.0 / (high - low); }
+    static npcScaleFactor(low, high) {
+        return (high <= low) ? 0.0 : 1.0 / (high - low);
+    }
     /** Return true if x is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
-    static isExtremeValue(x) { return Math.abs(x) >= RangeBase._EXTREME_POSITIVE; }
+    static isExtremeValue(x) {
+        return Math.abs(x) >= RangeBase._EXTREME_POSITIVE;
+    }
     /** Return true if any x or y or z is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
-    static isExtremePoint3d(xyz) { return RangeBase.isExtremeValue(xyz.x) || RangeBase.isExtremeValue(xyz.y) || RangeBase.isExtremeValue(xyz.z); }
+    static isExtremePoint3d(xyz) {
+        return RangeBase.isExtremeValue(xyz.x) || RangeBase.isExtremeValue(xyz.y) || RangeBase.isExtremeValue(xyz.z);
+    }
     /** Return true if either of x,y is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
-    static isExtremePoint2d(xy) { return RangeBase.isExtremeValue(xy.x) || RangeBase.isExtremeValue(xy.y); }
+    static isExtremePoint2d(xy) {
+        return RangeBase.isExtremeValue(xy.x) || RangeBase.isExtremeValue(xy.y);
+    }
     /**
      * Return the min absolute distance from any point of `[lowA,highA]' to any point of `[lowB,highB]'.
      * * Both low,high pairs have order expectations:  The condition `high < low` means null interval.
@@ -213586,7 +213695,8 @@ class RangeBase {
             return 0.0;
         return lowB - highA;
     }
-    /** Given a coordinate and pair of range limits, return the smallest distance to the range.
+    /**
+     * Given a coordinate and pair of range limits, return the smallest distance to the range.
      * * This is zero for any point inside the range
      * * This is _EXTREME_POSITIVE if the range limits are inverted
      * * Otherwise (i.e. x is outside a finite range) the distance to the near endpoint.
@@ -213601,7 +213711,7 @@ class RangeBase {
         return 0.0;
     }
     /**
-     * if a > 0, return (extrapolationFactor * a); otherwise return defaultValue
+     * If a > 0, return (extrapolationFactor * a); otherwise return defaultValue
      * @param q
      * @param factor multiplier for positive q values.
      */
@@ -213632,11 +213742,19 @@ class Range3d extends RangeBase {
         this.high.z = RangeBase._EXTREME_NEGATIVE;
     }
     /** Freeze this instance (and its members) so it is read-only */
-    freeze() { this.low.freeze(); this.high.freeze(); return Object.freeze(this); }
+    freeze() {
+        this.low.freeze();
+        this.high.freeze();
+        return Object.freeze(this);
+    }
     /** Flatten the low and high coordinates of any json object with low.x .. high.z into an array of 6 doubles */
-    static toFloat64Array(val) { return Float64Array.of(val.low.x, val.low.y, val.low.z, val.high.x, val.high.y, val.high.z); }
+    static toFloat64Array(val) {
+        return Float64Array.of(val.low.x, val.low.y, val.low.z, val.high.x, val.high.y, val.high.z);
+    }
     /** Flatten the low and high coordinates of this into an array of 6 doubles */
-    toFloat64Array() { return Range3d.toFloat64Array(this); }
+    toFloat64Array() {
+        return Range3d.toFloat64Array(this);
+    }
     /**
      * Construct a Range3d from an array of double-precision values
      * @param f64 the array, which should contain exactly 6 values in this order: lowX, lowY, lowZ, highX, highY, highZ
@@ -213648,11 +213766,14 @@ class Range3d extends RangeBase {
         return new this(f64[0], f64[1], f64[2], f64[3], f64[4], f64[5]);
     }
     /**
-     * Construct a Range3d from an un-typed array. This mostly useful when interpreting ECSQL query results of the 'blob' type, where you know that that result is a Range3d.
+     * Construct a Range3d from an un-typed array. This mostly useful when interpreting ECSQL query results of
+     * the 'blob' type, where you know that that result is a Range3d.
      * @param buffer untyped array
      * @return a new Range3d object
      */
-    static fromArrayBuffer(buffer) { return this.fromFloat64Array(new Float64Array(buffer)); }
+    static fromArrayBuffer(buffer) {
+        return this.fromFloat64Array(new Float64Array(buffer));
+    }
     // explicit ctor - no enforcement of value relationships
     constructor(lowX = RangeBase._EXTREME_POSITIVE, lowY = RangeBase._EXTREME_POSITIVE, lowZ = RangeBase._EXTREME_POSITIVE, highX = RangeBase._EXTREME_NEGATIVE, highY = RangeBase._EXTREME_NEGATIVE, highZ = RangeBase._EXTREME_NEGATIVE) {
         super();
@@ -213664,8 +213785,11 @@ class Range3d extends RangeBase {
         return (this.low.isAlmostEqual(other.low, tol) && this.high.isAlmostEqual(other.high, tol))
             || (this.isNull && other.isNull);
     }
-    /** copy low and high values from other. */
-    setFrom(other) { this.low.setFrom(other.low); this.high.setFrom(other.high); }
+    /** Copy low and high values from other. */
+    setFrom(other) {
+        this.low.setFrom(other.low);
+        this.high.setFrom(other.high);
+    }
     /** Return a new Range3d copied from a range or derived type */
     static createFrom(other, result) {
         if (result) {
@@ -213674,7 +213798,8 @@ class Range3d extends RangeBase {
         }
         return this.createXYZXYZOrCorrectToNull(other.low.x, other.low.y, other.low.z, other.high.x, other.high.y, other.high.z, result);
     }
-    /** set this range (in place) from json such as
+    /**
+     * Set this range (in place) from json such as
      * * key-value pairs: `{low:[1,2,3], high:[4,5,6]}`
      * * array of points: `[[1,2,3],[9,3,4],[-2,1,3] ...]`
      * * Lowest level points can be `[1,2,3]` or `{x:1,y:2,z:3}`
@@ -213698,10 +213823,13 @@ class Range3d extends RangeBase {
             this.extendPoint(high);
         }
     }
-    /** Return a JSON object `{low: ... , high: ...}`
+    /**
+     * Return a JSON object `{low: ... , high: ...}`
      * with points formatted by `Point3d.toJSON()`
      */
-    toJSON() { return { low: this.low.toJSON(), high: this.high.toJSON() }; }
+    toJSON() {
+        return { low: this.low.toJSON(), high: this.high.toJSON() };
+    }
     /** Use `setFromJSON` to parse `json` into a new Range3d instance. */
     static fromJSON(json) {
         const result = new this();
@@ -213729,7 +213857,8 @@ class Range3d extends RangeBase {
         result.setDirect(this.low.x, this.low.y, this.low.z, this.high.x, this.high.y, this.high.z, false);
         return result;
     }
-    /** Return a copy, translated by adding `shift` components in all directions.
+    /**
+     * Return a copy, translated by adding `shift` components in all directions.
      * * The translate of a null range is also a null range.
      */
     cloneTranslated(shift, result) {
@@ -213764,7 +213893,7 @@ class Range3d extends RangeBase {
         _PointStreaming__WEBPACK_IMPORTED_MODULE_1__.VariantPointDataStream.streamXYZ(data, collector);
         return collector.claimResult();
     }
-    /** create a Range3d enclosing the transformed points. */
+    /** Create a Range3d enclosing the transformed points. */
     static createTransformed(transform, ...point) {
         const result = this.createNull();
         let p;
@@ -213772,13 +213901,13 @@ class Range3d extends RangeBase {
             result.extendTransformedXYZ(transform, p.x, p.y, p.z);
         return result;
     }
-    /** create a Range3d enclosing the transformed points. */
+    /** Create a Range3d enclosing the transformed points. */
     static createTransformedArray(transform, points) {
         const result = this.createNull();
         result.extendArray(points, transform);
         return result;
     }
-    /** create a Range3d enclosing the points after inverse transform. */
+    /** Create a Range3d enclosing the points after inverse transform. */
     static createInverseTransformedArray(transform, points) {
         const result = this.createNull();
         result.extendInverseTransformedArray(points, transform);
@@ -213827,7 +213956,7 @@ class Range3d extends RangeBase {
             result.extendPoint(point);
         return result;
     }
-    /** extend a range around an array of points (optionally transformed) */
+    /** Extend a range around an array of points (optionally transformed) */
     extendArray(points, transform) {
         if (Array.isArray(points))
             if (transform)
@@ -213844,7 +213973,7 @@ class Range3d extends RangeBase {
             for (let i = 0; i < points.length; i++)
                 this.extendXYZ(points.getXAtUncheckedPointIndex(i), points.getYAtUncheckedPointIndex(i), points.getZAtUncheckedPointIndex(i));
     }
-    /** extend a range around an array of points (optionally transformed) */
+    /** Extend a range around an array of points (optionally transformed) */
     extendInverseTransformedArray(points, transform) {
         if (Array.isArray(points))
             for (const point of points)
@@ -213853,22 +213982,19 @@ class Range3d extends RangeBase {
             for (let i = 0; i < points.length; i++)
                 this.extendInverseTransformedXYZ(transform, points.getXAtUncheckedPointIndex(i), points.getYAtUncheckedPointIndex(i), points.getZAtUncheckedPointIndex(i));
     }
-    /** multiply the point x,y,z by transform and use the coordinate to extend this range.
-     */
+    /** Multiply the point x,y,z by transform and use the coordinate to extend this range. */
     extendTransformedXYZ(transform, x, y, z) {
         const origin = transform.origin;
         const coffs = transform.matrix.coffs;
         this.extendXYZ(origin.x + coffs[0] * x + coffs[1] * y + coffs[2] * z, origin.y + coffs[3] * x + coffs[4] * y + coffs[5] * z, origin.z + coffs[6] * x + coffs[7] * y + coffs[8] * z);
     }
-    /** multiply the point x,y,z,w by transform and use the coordinate to extend this range.
-     */
+    /** Multiply the point x,y,z,w by transform and use the coordinate to extend this range. */
     extendTransformedXYZW(transform, x, y, z, w) {
         const origin = transform.origin;
         const coffs = transform.matrix.coffs;
         this.extendXYZW(origin.x * w + coffs[0] * x + coffs[1] * y + coffs[2] * z, origin.y * w + coffs[3] * x + coffs[4] * y + coffs[5] * z, origin.z * w + coffs[6] * x + coffs[7] * y + coffs[8] * z, w);
     }
-    /** multiply the point x,y,z by transform and use the coordinate to extend this range.
-     */
+    /** Multiply the point x,y,z by transform and use the coordinate to extend this range. */
     extendInverseTransformedXYZ(transform, x, y, z) {
         const origin = transform.origin;
         if (!transform.matrix.computeCachedInverse(true))
@@ -213905,36 +214031,72 @@ class Range3d extends RangeBase {
             && this.high.z === this.low.z;
     }
     /** Return the midpoint of the diagonal.  No test for null range. */
-    get center() { return this.low.interpolate(.5, this.high); }
-    /** return the low x coordinate */
-    get xLow() { return this.low.x; }
-    /** return the low y coordinate */
-    get yLow() { return this.low.y; }
-    /** return the low z coordinate */
-    get zLow() { return this.low.z; }
-    /** return the high x coordinate */
-    get xHigh() { return this.high.x; }
-    /** return the high y coordinate */
-    get yHigh() { return this.high.y; }
-    /** return the high z coordinate */
-    get zHigh() { return this.high.z; }
+    get center() {
+        return this.low.interpolate(.5, this.high);
+    }
+    /** Return the low x coordinate */
+    get xLow() {
+        return this.low.x;
+    }
+    /** Return the low y coordinate */
+    get yLow() {
+        return this.low.y;
+    }
+    /** Return the low z coordinate */
+    get zLow() {
+        return this.low.z;
+    }
+    /** Return the high x coordinate */
+    get xHigh() {
+        return this.high.x;
+    }
+    /** Return the high y coordinate */
+    get yHigh() {
+        return this.high.y;
+    }
+    /** Return the high z coordinate */
+    get zHigh() {
+        return this.high.z;
+    }
     /**  Return the length of the box in the x direction */
-    xLength() { const a = this.high.x - this.low.x; return a > 0.0 ? a : 0.0; }
+    xLength() {
+        const a = this.high.x - this.low.x;
+        return a > 0.0 ? a : 0.0;
+    }
     /**  Return the length of the box in the y direction */
-    yLength() { const a = this.high.y - this.low.y; return a > 0.0 ? a : 0.0; }
+    yLength() {
+        const a = this.high.y - this.low.y;
+        return a > 0.0 ? a : 0.0;
+    }
     /**  Return the length of the box in the z direction */
-    zLength() { const a = this.high.z - this.low.z; return a > 0.0 ? a : 0.0; }
+    zLength() {
+        const a = this.high.z - this.low.z;
+        return a > 0.0 ? a : 0.0;
+    }
     /**  Return the largest of the x,y, z lengths of the range. */
-    maxLength() { return Math.max(this.xLength(), this.yLength(), this.zLength()); }
-    /** return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very large negative coordinates. */
-    diagonal(result) { return this.low.vectorTo(this.high, result); }
-    /**  Return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very large negative coordinates. */
-    diagonalFractionToPoint(fraction, result) { return this.low.interpolate(fraction, this.high, result); }
-    /**  Return a point given by fractional positions on the XYZ axes. This is done with no check for isNull !!! */
+    maxLength() {
+        return Math.max(this.xLength(), this.yLength(), this.zLength());
+    }
+    /**
+     * Return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very
+     * large negative coordinates.
+     */
+    diagonal(result) {
+        return this.low.vectorTo(this.high, result);
+    }
+    /**
+     * Return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very
+     * large negative coordinates.
+     */
+    diagonalFractionToPoint(fraction, result) {
+        return this.low.interpolate(fraction, this.high, result);
+    }
+    /** Return a point given by fractional positions on the XYZ axes. This is done with no check for isNull !!! */
     fractionToPoint(fractionX, fractionY, fractionZ = 0, result) {
         return this.low.interpolateXYZ(fractionX, fractionY, fractionZ, this.high, result);
     }
-    /**  Return a point given by fractional positions on the XYZ axes.
+    /**
+     * Return a point given by fractional positions on the XYZ axes.
      *  Returns undefined if the range is null.
      */
     localXYZToWorld(fractionX, fractionY, fractionZ, result) {
@@ -213942,13 +214104,15 @@ class Range3d extends RangeBase {
             return undefined;
         return this.low.interpolateXYZ(fractionX, fractionY, fractionZ, this.high, result);
     }
-    /** Return a point given by fractional positions on the XYZ axes.
+    /**
+     * Return a point given by fractional positions on the XYZ axes.
      * * Returns undefined if the range is null.
      */
     localToWorld(xyz, result) {
         return this.localXYZToWorld(xyz.x, xyz.y, xyz.z, result);
     }
-    /** Replace fractional coordinates by world coordinates.
+    /**
+     * Replace fractional coordinates by world coordinates.
      * @returns false if null range.
      */
     localToWorldArrayInPlace(points) {
@@ -213958,7 +214122,8 @@ class Range3d extends RangeBase {
             this.low.interpolateXYZ(p.x, p.y, p.z, this.high, p);
         return false;
     }
-    /** Return fractional coordinates of point within the range.
+    /**
+     * Return fractional coordinates of point within the range.
      * * returns undefined if the range is null.
      * * returns undefined if any direction (x,y,z) has zero length
      */
@@ -213970,7 +214135,8 @@ class Range3d extends RangeBase {
             return undefined;
         return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create((point.x - this.low.x) * ax, (point.y - this.low.y) * ay, (point.z - this.low.z) * az, result);
     }
-    /** Return fractional coordinates of point within the range.
+    /**
+     * Return fractional coordinates of point within the range.
      * * returns undefined if the range is null.
      * * returns undefined if any direction (x,y,z) has zero length
      */
@@ -213984,7 +214150,8 @@ class Range3d extends RangeBase {
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create((p.x - this.low.x) * ax, (p.y - this.low.y) * ay, (p.z - this.low.z) * az, p);
         return true;
     }
-    /** Return an array with the 8 corners on order wth "x varies fastest, then y, then z"
+    /**
+     * Return an array with the 8 corners on order wth "x varies fastest, then y, then z"
      * * points preallocated in `result` are reused if result.length >= 8.
      * * in reuse case, result.length is trimmed to 8
      */
@@ -214009,10 +214176,11 @@ class Range3d extends RangeBase {
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.low.y, this.high.z),
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.low.y, this.high.z),
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.high.y, this.high.z),
-            _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.high.y, this.high.z)
+            _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.high.y, this.high.z),
         ];
     }
-    /** Return an array with indices of the corners of a face
+    /**
+     * Return an array with indices of the corners of a face
      * * face 0 has negative x normal
      * * face 1 has positive x normal
      * * face 2 has negative y normal
@@ -214063,12 +214231,18 @@ class Range3d extends RangeBase {
             return 0.0;
         return Math.max(this.low.maxAbs(), this.high.maxAbs());
     }
-    /** returns true if the x direction size is nearly zero */
-    get isAlmostZeroX() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.xLength()); }
-    /** returns true if the y direction size is nearly zero */
-    get isAlmostZeroY() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.yLength()); }
-    /** returns true if the z direction size is nearly zero */
-    get isAlmostZeroZ() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.zLength()); }
+    /** Returns true if the x direction size is nearly zero */
+    get isAlmostZeroX() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.xLength());
+    }
+    /** Returns true if the y direction size is nearly zero */
+    get isAlmostZeroY() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.yLength());
+    }
+    /** Returns true if the z direction size is nearly zero */
+    get isAlmostZeroZ() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.zLength());
+    }
     /** Test if a point given as x,y,z is within the range. */
     containsXYZ(x, y, z) {
         return x >= this.low.x
@@ -214078,7 +214252,7 @@ class Range3d extends RangeBase {
             && y <= this.high.y
             && z <= this.high.z;
     }
-    /** Test if a point given as x,y is within the range.  (Ignoring z of range) */
+    /** Test if a point given as x,y is within the range (ignoring z of range). */
     containsXY(x, y) {
         return x >= this.low.x
             && y >= this.low.y
@@ -214086,7 +214260,9 @@ class Range3d extends RangeBase {
             && y <= this.high.y;
     }
     /** Test if a point is within the range. */
-    containsPoint(point) { return this.containsXYZ(point.x, point.y, point.z); }
+    containsPoint(point) {
+        return this.containsXYZ(point.x, point.y, point.z);
+    }
     /** Test if the x,y coordinates of a point are within the range. */
     containsPointXY(point) {
         return point.x >= this.low.x
@@ -214125,7 +214301,7 @@ class Range3d extends RangeBase {
             return RangeBase._EXTREME_POSITIVE;
         return Math.min(_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.hypotenuseXYZ(RangeBase.coordinateToRangeAbsoluteDistance(point.x, this.low.x, this.high.x), RangeBase.coordinateToRangeAbsoluteDistance(point.y, this.low.y, this.high.y), RangeBase.coordinateToRangeAbsoluteDistance(point.z, this.low.z, this.high.z)), RangeBase._EXTREME_POSITIVE);
     }
-    /** returns 0 if the ranges have any overlap, otherwise the shortest absolute distance from one to the other. */
+    /** Returns 0 if the ranges have any overlap, otherwise the shortest absolute distance from one to the other. */
     distanceToRange(other) {
         return Math.min(_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.hypotenuseXYZ(RangeBase.rangeToRangeAbsoluteDistance(this.low.x, this.high.x, other.low.x, other.high.x), RangeBase.rangeToRangeAbsoluteDistance(this.low.y, this.high.y, other.low.y, other.high.y), RangeBase.rangeToRangeAbsoluteDistance(this.low.z, this.high.z, other.low.z, other.high.z)), RangeBase._EXTREME_POSITIVE);
     }
@@ -214210,7 +214386,8 @@ class Range3d extends RangeBase {
             this.extendXYZ(other.high.x, other.high.y, other.high.z);
         }
     }
-    /** In each direction look at the difference between this range limit and that of interiorRange.
+    /**
+     * In each direction look at the difference between this range limit and that of interiorRange.
      * * If this range is larger, expand it by extrapolationFactor.
      */
     extendWhenLarger(other, extrapolationFactor) {
@@ -214239,7 +214416,7 @@ class Range3d extends RangeBase {
         return Range3d.createXYZXYZOrCorrectToNull(Math.min(this.low.x, other.low.x), Math.min(this.low.y, other.low.y), Math.min(this.low.z, other.low.z), Math.max(this.high.x, other.high.x), Math.max(this.high.y, other.high.y), Math.max(this.high.z, other.high.z), result);
     }
     /**
-     * move low and high points by scaleFactor around the center point.
+     * Move low and high points by scaleFactor around the center point.
      * @param scaleFactor scale factor applied to low, high distance from center.
      */
     scaleAboutCenterInPlace(scaleFactor) {
@@ -214258,7 +214435,7 @@ class Range3d extends RangeBase {
         }
     }
     /**
-     * move all limits by a fixed amount.
+     * Move all limits by a fixed amount.
      * * positive delta expands the range size
      * * negative delta reduces the range size
      * * if any dimension reduces below zero size, the whole range becomes null
@@ -214272,7 +214449,8 @@ class Range3d extends RangeBase {
         return _Transform__WEBPACK_IMPORTED_MODULE_3__.Transform.createOriginAndMatrix(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.low.y, this.low.z), _Matrix3d__WEBPACK_IMPORTED_MODULE_4__.Matrix3d.createRowValues(this.high.x - this.low.x, 0, 0, 0, this.high.y - this.low.y, 0, 0, 0, this.high.z - this.low.z), result);
     }
     /**
-     * Creates an NPC to world transformation to go from 000...111 to the globally aligned cube with diagonally opposite corners that are the
+     * Creates an NPC to world transformation to go from 000...111 to the globally aligned cube with diagonally
+     * opposite corners that are the
      * min and max of this range. The diagonal component for any degenerate direction is 1.
      */
     getNpcToWorldRangeTransform(result) {
@@ -214286,7 +214464,9 @@ class Range3d extends RangeBase {
             matrix.coffs[8] = 1;
         return transform;
     }
-    /** Ensure that the length of each dimension of this AxisAlignedBox3d is at least a minimum size. If not, expand to minimum about the center.
+    /**
+     * Ensure that the length of each dimension of this AxisAlignedBox3d is at least a minimum size. If not, expand
+     * to minimum about the center.
      * @param min The minimum length for each dimension.
      */
     ensureMinLengths(min = .001) {
@@ -214315,7 +214495,7 @@ class Range3d extends RangeBase {
  * @public
  */
 class Range1d extends RangeBase {
-    /** reset the low and high to null range state. */
+    /** Reset the low and high to null range state. */
     setNull() {
         this.low = RangeBase._EXTREME_POSITIVE;
         this.high = RangeBase._EXTREME_NEGATIVE;
@@ -214339,10 +214519,13 @@ class Range1d extends RangeBase {
         return (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(this.low, other.low) && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSameCoordinate(this.high, other.high))
             || (this.isNull && other.isNull);
     }
-    /** copy contents from other Range1d. */
-    setFrom(other) { this.low = other.low; this.high = other.high; }
-    /** Convert from a JSON object of one of these forms:
-     *
+    /** Copy contents from other Range1d. */
+    setFrom(other) {
+        this.low = other.low;
+        this.high = other.high;
+    }
+    /**
+     * Convert from a JSON object of one of these forms:
      * *  Any array of numbers: `[value,value, value]`
      * *  An object with low and high as properties: `{low:lowValue, high: highValue}`
      */
@@ -214367,16 +214550,20 @@ class Range1d extends RangeBase {
             result.setFromJSON(json);
         return result;
     }
-    /** Convert to a JSON object of form
+    /**
+     * Convert to a JSON object of form
      * ```
      *    [lowValue,highValue]
      * ```
      */
-    toJSON() { if (this.isNull)
-        return new Array();
-    else
-        return [this.low, this.high]; }
-    /** return a new Range1d with contents of this.
+    toJSON() {
+        if (this.isNull)
+            return new Array();
+        else
+            return [this.low, this.high];
+    }
+    /**
+     * Return a new Range1d with contents of this.
      * @param result optional result.
      */
     clone(result) {
@@ -214384,7 +214571,8 @@ class Range1d extends RangeBase {
         result.setDirect(this.low, this.high);
         return result;
     }
-    /** return a new Range1d with contents of this.
+    /**
+     * Return a new Range1d with contents of this.
      * @param result optional result.
      */
     static createFrom(other, result) {
@@ -214392,7 +214580,8 @@ class Range1d extends RangeBase {
         result.setDirect(other.low, other.high);
         return result;
     }
-    /** Create a range with no content.
+    /**
+     * Create a range with no content.
      * @param result optional result.
      */
     static createNull(result) {
@@ -214400,7 +214589,8 @@ class Range1d extends RangeBase {
         result.setNull();
         return result;
     }
-    /** create a range with `delta` added to low and high
+    /**
+     * Create a range with `delta` added to low and high
      * * If `this` is a null range, return a null range.
      */
     cloneTranslated(delta, result) {
@@ -214415,7 +214605,9 @@ class Range1d extends RangeBase {
      * Set this range to be a single value.
      * @param x value to use as both low and high.
      */
-    setX(x) { this.low = this.high = x; }
+    setX(x) {
+        this.low = this.high = x;
+    }
     /** Create a single point box */
     static createX(x, result) {
         result = result ? result : new this();
@@ -214437,10 +214629,12 @@ class Range1d extends RangeBase {
             this.high = x0;
         }
     }
+    /** Check if low is 0 and high is 1 */
     get isExact01() {
         return this.low === 0.0 && this.high === 1.0;
     }
-    /** Create a box from two values. Values are reversed if needed
+    /**
+     * Create a box from two values. Values are reversed if needed
      * @param xA first value
      * @param xB second value
      */
@@ -214449,7 +214643,8 @@ class Range1d extends RangeBase {
         result.setDirect(Math.min(xA, xB), Math.max(xA, xB));
         return result;
     }
-    /** Create a box from two values, but null range if the values are reversed
+    /**
+     * Create a box from two values, but null range if the values are reversed
      * @param xA first value
      * @param xB second value
      */
@@ -214460,7 +214655,8 @@ class Range1d extends RangeBase {
         result.setDirect(Math.min(xA, xB), Math.max(xA, xB));
         return result;
     }
-    /** Create a range containing all the values in an array.
+    /**
+     * Create a range containing all the values in an array.
      * @param values array of points to be contained in the range.
      * @param result optional result.
      */
@@ -214471,13 +214667,14 @@ class Range1d extends RangeBase {
             result.extendX(x);
         return result;
     }
-    /** extend to include an array of values */
+    /** Extend to include an array of values */
     extendArray(values) {
         let x;
         for (x of values)
             this.extendX(x);
     }
-    /** extend to include `values` at indices `beginIndex <= i < endIndex]`
+    /**
+     * Extend to include `values` at indices `beginIndex <= i < endIndex]`
      * @param values array of values
      * @param beginIndex first index to include
      * @param numValue number of values to access
@@ -214496,8 +214693,11 @@ class Range1d extends RangeBase {
         return this.high === this.low;
     }
     /** Return the length of the range in the x direction */
-    length() { const a = this.high - this.low; return a > 0.0 ? a : 0.0; }
-    /** return a point given by fractional positions within the range. This is done with no check for isNull !!! */
+    length() {
+        const a = this.high - this.low;
+        return a > 0.0 ? a : 0.0;
+    }
+    /** Return a point given by fractional positions within the range. This is done with no check for isNull !!! */
     fractionToPoint(fraction) {
         return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(this.low, fraction, this.high);
     }
@@ -214508,7 +214708,9 @@ class Range1d extends RangeBase {
         return Math.max(Math.abs(this.low), Math.abs(this.high));
     }
     /** Test if the x direction size is nearly zero */
-    get isAlmostZeroLength() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.length()); }
+    get isAlmostZeroLength() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.length());
+    }
     /** Test if a number is within the range. */
     containsX(x) {
         return x >= this.low
@@ -214528,7 +214730,6 @@ class Range1d extends RangeBase {
      * * For x1 > x0, that range is null, and the intersection is null.
      * * For x0 <= x1, the input is a non-null range.
      * * The intersection range replaces the contents of this.
-     *
      */
     intersectRangeXXInPlace(x0, x1) {
         if (x1 < x0 || x1 < this.low || x0 > this.high) {
@@ -214541,7 +214742,7 @@ class Range1d extends RangeBase {
                 this.low = x0;
         }
     }
-    /** returns 0 if the ranges have any overlap, otherwise the shortest absolute distance from one to the other. */
+    /** Returns 0 if the ranges have any overlap, otherwise the shortest absolute distance from one to the other. */
     distanceToRange(other) {
         return RangeBase.rangeToRangeAbsoluteDistance(this.low, this.high, other.low, other.high);
     }
@@ -214593,7 +214794,7 @@ class Range1d extends RangeBase {
         return Range1d.createXX(Math.min(this.low, other.low), Math.max(this.high, other.high), result);
     }
     /**
-     * move low and high points by scaleFactor around the center point.
+     * Move low and high points by scaleFactor around the center point.
      * @param scaleFactor scale factor applied to low, high distance from center.
      */
     scaleAboutCenterInPlace(scaleFactor) {
@@ -214606,7 +214807,7 @@ class Range1d extends RangeBase {
         }
     }
     /**
-     * move all limits by a fixed amount.
+     * Move all limits by a fixed amount.
      * * positive delta expands the range size
      * * negative delta reduces the range size
      * * if any dimension reduces below zero size, the whole range becomes null
@@ -214616,13 +214817,14 @@ class Range1d extends RangeBase {
         this.setDirect(this.low - delta, this.high + delta, true);
     }
     /**
-     * clip this range to a linear half space condition
+     * Clip this range to a linear half space condition
      * * if `limitA > limitB` the limit space is empty
      *   * make this range null
      *   * return false;
      * * otherwise (i.e `limitA <= limitB`)
      *   * solve `a + u * f = limitA' and `a + u * f = limitA`
-     *   * if unable to solve (i.e. u near zero), `a` alone determines whether to (a) leave this interval unchanged or (b) reduce to nothing.
+     *   * if unable to solve (i.e. u near zero), `a` alone determines whether to (a) leave this interval unchanged or
+     * (b) reduce to nothing.
      *   * the `f` values are an interval in the space of this `Range1d`
      *   * restrict the range to that interval (i.e intersect existing (low,high) with the fraction interval.
      *   * return true if the range is non-null after the clip.
@@ -214631,7 +214833,6 @@ class Range1d extends RangeBase {
      * @param limitA crossing value, assumed in range relation with limitB
      * @param limitB crossing value, assumed in range relation with limitB
      * @param limitIsHigh true if the limit is an upper limit on mapped values.
-     *
      */
     clipLinearMapToInterval(a, u, limitA, limitB) {
         // f = (limit - a) / u
@@ -214670,7 +214871,7 @@ class Range1d extends RangeBase {
  * @public
  */
 class Range2d extends RangeBase {
-    /** reset the low and high to null range state. */
+    /** Reset the low and high to null range state. */
     setNull() {
         this.low.x = RangeBase._EXTREME_POSITIVE;
         this.low.y = RangeBase._EXTREME_POSITIVE;
@@ -214678,9 +214879,13 @@ class Range2d extends RangeBase {
         this.high.y = RangeBase._EXTREME_NEGATIVE;
     }
     /** Flatten the low and high coordinates of any json object with low.x .. high.y into an array of 4 doubles */
-    static toFloat64Array(val) { return Float64Array.of(val.low.x, val.low.y, val.high.x, val.high.y); }
+    static toFloat64Array(val) {
+        return Float64Array.of(val.low.x, val.low.y, val.high.x, val.high.y);
+    }
     /** Flatten the low and high coordinates of this instance into an array of 4 doubles */
-    toFloat64Array() { return Range2d.toFloat64Array(this); }
+    toFloat64Array() {
+        return Range2d.toFloat64Array(this);
+    }
     /**
      * Construct a Range2d from an array of double-precision values
      * @param f64 the array, which should contain exactly 4 values in this order: lowX, lowY, highX, highY
@@ -214692,12 +214897,15 @@ class Range2d extends RangeBase {
         return new this(f64[0], f64[1], f64[2], f64[3]);
     }
     /**
-     * Construct a Range2d from an un-typed array. This mostly useful when interpreting ECSQL query results of the 'blob' type, where you know that that result is a Range3d.
+     * Construct a Range2d from an un-typed array. This mostly useful when interpreting ECSQL query results of
+     * the 'blob' type, where you know that that result is a Range3d.
      * @param buffer untyped array
      * @return a new Range2d object
      */
-    static fromArrayBuffer(buffer) { return this.fromFloat64Array(new Float64Array(buffer)); }
-    // explicit ctor - no enforcement of value relationships
+    static fromArrayBuffer(buffer) {
+        return this.fromFloat64Array(new Float64Array(buffer));
+    }
+    // explicit constructor - no enforcement of value relationships
     constructor(lowX = Range2d._EXTREME_POSITIVE, lowY = Range2d._EXTREME_POSITIVE, highX = Range2d._EXTREME_NEGATIVE, highY = Range2d._EXTREME_NEGATIVE) {
         super();
         this.low = _Point2dVector2d__WEBPACK_IMPORTED_MODULE_5__.Point2d.create(lowX, lowY);
@@ -214708,12 +214916,12 @@ class Range2d extends RangeBase {
         return (this.low.isAlmostEqual(other.low) && this.high.isAlmostEqual(other.high))
             || (this.isNull && other.isNull);
     }
-    /** copy all content from any `other` that has low and high xy data. */
+    /** Copy all content from any `other` that has low and high xy data. */
     setFrom(other) {
         this.low.set(other.low.x, other.low.y);
         this.high.set(other.high.x, other.high.y);
     }
-    /** create a new Range2d from any `other` that has low and high xy data. */
+    /** Create a new Range2d from any `other` that has low and high xy data. */
     static createFrom(other, result) {
         if (result) {
             result.setFrom(other);
@@ -214721,7 +214929,7 @@ class Range2d extends RangeBase {
         }
         return this.createXYXYOrCorrectToNull(other.low.x, other.low.y, other.high.x, other.high.y, result);
     }
-    /** treat any array of numbers as numbers to be inserted !!! */
+    /** Treat any array of numbers as numbers to be inserted !!! */
     setFromJSON(json) {
         this.setNull();
         if (Array.isArray(json)) {
@@ -214740,9 +214948,15 @@ class Range2d extends RangeBase {
         }
     }
     /** Freeze this instance (and its members) so it is read-only */
-    freeze() { this.low.freeze(); this.high.freeze(); return Object.freeze(this); }
-    /** return json array with two points as produced by `Point2d.toJSON` */
-    toJSON() { return this.isNull ? [] : [this.low.toJSON(), this.high.toJSON()]; }
+    freeze() {
+        this.low.freeze();
+        this.high.freeze();
+        return Object.freeze(this);
+    }
+    /** Return json array with two points as produced by `Point2d.toJSON` */
+    toJSON() {
+        return this.isNull ? [] : [this.low.toJSON(), this.high.toJSON()];
+    }
     /** Use `setFromJSON` to parse `json` into a new Range2d instance. */
     static fromJSON(json) {
         const result = new this();
@@ -214761,13 +214975,13 @@ class Range2d extends RangeBase {
                 this.setNull();
         }
     }
-    /** return a clone of this range (or copy to optional result) */
+    /** Return a clone of this range (or copy to optional result) */
     clone(result) {
         result = result ? result : new this.constructor();
         result.setDirect(this.low.x, this.low.y, this.high.x, this.high.y, false);
         return result;
     }
-    /** create a range with no content. */
+    /** Create a range with no content. */
     static createNull(result) {
         result = result ? result : new this();
         result.setNull();
@@ -214817,7 +215031,10 @@ class Range2d extends RangeBase {
         return this.high.x < this.low.x
             || this.high.y < this.low.y;
     }
-    /** Test if the box has high strictly less than low for any of x,y, condition. Note that a range around a single point is NOT null. */
+    /**
+     * Test if the box has high strictly less than low for any of x,y, condition. Note that a range around a
+     * single point is NOT null.
+     */
     static isNull(range) {
         return range.high.x < range.low.x
             || range.high.y < range.low.y;
@@ -214828,28 +215045,55 @@ class Range2d extends RangeBase {
             && this.high.y === this.low.y;
     }
     /** Return the midpoint of the diagonal.  No test for null range. */
-    get center() { return this.low.interpolate(.5, this.high); }
-    /** return the low x coordinate */
-    get xLow() { return this.low.x; }
-    /** return the low y coordinate */
-    get yLow() { return this.low.y; }
-    /** return the high x coordinate */
-    get xHigh() { return this.high.x; }
-    /** return the high y coordinate */
-    get yHigh() { return this.high.y; }
+    get center() {
+        return this.low.interpolate(.5, this.high);
+    }
+    /** Return the low x coordinate */
+    get xLow() {
+        return this.low.x;
+    }
+    /** Return the low y coordinate */
+    get yLow() {
+        return this.low.y;
+    }
+    /** Return the high x coordinate */
+    get xHigh() {
+        return this.high.x;
+    }
+    /** Return the high y coordinate */
+    get yHigh() {
+        return this.high.y;
+    }
     /** Length of the box in the x direction */
-    xLength() { const a = this.high.x - this.low.x; return a > 0.0 ? a : 0.0; }
+    xLength() {
+        const a = this.high.x - this.low.x;
+        return a > 0.0 ? a : 0.0;
+    }
     /** Length of the box in the y direction */
-    yLength() { const a = this.high.y - this.low.y; return a > 0.0 ? a : 0.0; }
-    /** return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very large negative coordinates. */
-    diagonal(result) { return this.low.vectorTo(this.high, result); }
-    /** return the point at the specified fraction along the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very large negative coordinates. */
-    diagonalFractionToPoint(fraction, result) { return this.low.interpolate(fraction, this.high, result); }
-    /** return a point given by fractional positions on the XY axes. This is done with no check for isNull !!! */
+    yLength() {
+        const a = this.high.y - this.low.y;
+        return a > 0.0 ? a : 0.0;
+    }
+    /**
+     * Return the diagonal vector. There is no check for isNull -- if the range isNull(), the vector will have very
+     * large negative coordinates.
+     */
+    diagonal(result) {
+        return this.low.vectorTo(this.high, result);
+    }
+    /**
+     * Return the point at the specified fraction along the diagonal vector. There is no check for isNull -- if the
+     * range isNull(), the vector will have very large negative coordinates.
+     */
+    diagonalFractionToPoint(fraction, result) {
+        return this.low.interpolate(fraction, this.high, result);
+    }
+    /** Return a point given by fractional positions on the XY axes. This is done with no check for isNull !!! */
     fractionToPoint(fractionX, fractionY, result) {
         return this.low.interpolateXY(fractionX, fractionY, this.high, result);
     }
-    /** Return an array with the 4 corners.
+    /**
+     * Return an array with the 4 corners.
      * * if asLoop is false, 4 corners are "x varies fastest, then y"
      * * if asLoop is true, 5 corners are in CCW order WITH CLOSURE
      */
@@ -214860,13 +215104,13 @@ class Range2d extends RangeBase {
                 _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.low.y, z),
                 _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.high.y, z),
                 _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.high.y, z),
-                _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.low.y, z)
+                _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.low.y, z),
             ];
         return [
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.low.y, z),
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.low.y, z),
             _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.low.x, this.high.y, z),
-            _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.high.y, z)
+            _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create(this.high.x, this.high.y, z),
         ];
     }
     /** Largest absolute value among any coordinates in the box corners. */
@@ -214876,10 +215120,14 @@ class Range2d extends RangeBase {
         return Math.max(this.low.maxAbs(), this.high.maxAbs());
     }
     /** Test if the x direction size is nearly zero */
-    get isAlmostZeroX() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.xLength()); }
+    get isAlmostZeroX() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.xLength());
+    }
     /** Test if the y direction size is nearly zero */
-    get isAlmostZeroY() { return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.yLength()); }
-    /** Test if a point given as x,y is within the range. */
+    get isAlmostZeroY() {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(this.yLength());
+    }
+    /** Test if a point given as x,y is within the range */
     containsXY(x, y) {
         return x >= this.low.x
             && y >= this.low.y
@@ -214887,7 +215135,9 @@ class Range2d extends RangeBase {
             && y <= this.high.y;
     }
     /** Test if a point is within the range. */
-    containsPoint(point) { return this.containsXY(point.x, point.y); }
+    containsPoint(point) {
+        return this.containsXY(point.x, point.y);
+    }
     /** Test of other range is within this range */
     containsRange(other) {
         return other.low.x >= this.low.x
@@ -214930,7 +215180,9 @@ class Range2d extends RangeBase {
         this.extendXY(x1, y1);
     }
     /** Expand this range to include a point. */
-    extendPoint(point) { this.extendXY(point.x, point.y); }
+    extendPoint(point) {
+        this.extendXY(point.x, point.y);
+    }
     /** Expand this range to include a range. */
     extendRange(other) {
         if (!Range2d.isNull(other)) {
@@ -214954,7 +215206,7 @@ class Range2d extends RangeBase {
         return Range2d.createXYXY(Math.min(this.low.x, other.low.x), Math.min(this.low.y, other.low.y), Math.max(this.high.x, other.high.x), Math.max(this.high.y, other.high.y), result);
     }
     /**
-     * move low and high points by scaleFactor around the center point.
+     * Move low and high points by scaleFactor around the center point.
      * @param scaleFactor scale factor applied to low, high distance from center.
      */
     scaleAboutCenterInPlace(scaleFactor) {
@@ -214970,7 +215222,7 @@ class Range2d extends RangeBase {
         }
     }
     /**
-     * move all limits by a fixed amount.
+     * Move all limits by a fixed amount.
      * * positive delta expands the range size
      * * negative delta reduces the range size
      * * if any dimension reduces below zero size, the whole range becomes null
@@ -214979,7 +215231,8 @@ class Range2d extends RangeBase {
     expandInPlace(delta) {
         this.setDirect(this.low.x - delta, this.low.y - delta, this.high.x + delta, this.high.y + delta, true);
     }
-    /** Return fractional coordinates of point within the range.
+    /**
+     * Return fractional coordinates of point within the range.
      * * returns undefined if the range is null.
      * * returns undefined if any direction (x,y) has zero length
      */
@@ -284230,7 +284483,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.12","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/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-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.12","@itwin/core-bentley":"workspace:^4.1.0-dev.12","@itwin/core-common":"workspace:^4.1.0-dev.12","@itwin/core-geometry":"workspace:^4.1.0-dev.12","@itwin/core-orbitgt":"workspace:^4.1.0-dev.12","@itwin/core-quantity":"workspace:^4.1.0-dev.12"},"//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.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","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.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","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/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.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","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.1.0-dev.14","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/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-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.14","@itwin/core-bentley":"workspace:^4.1.0-dev.14","@itwin/core-common":"workspace:^4.1.0-dev.14","@itwin/core-geometry":"workspace:^4.1.0-dev.14","@itwin/core-orbitgt":"workspace:^4.1.0-dev.14","@itwin/core-quantity":"workspace:^4.1.0-dev.14"},"//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.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","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.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","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/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.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","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ })