@itwin/rpcinterface-full-stack-tests 4.2.0-dev.31 → 4.2.0-dev.33

package/lib/dist/bundled-tests.js

@@ -173063,8 +173063,8 @@ class Geometry {
         return result;
     }
     /**
-     * For a line `f(x)` where `f(x0) = f0` and `f(x1) = f1`, return the `x` value at which `f(x) = fTarget`
-     * Return `defaultResult` if `(fTarget - f0) / (f1 - f0)` exceeds `Geometry.largeFractionResult`
+     * For a line `f(x)` where `f(x0) = f0` and `f(x1) = f1`, return the `x` value at which `f(x) = fTarget`.
+     * Return `defaultResult` if `(fTarget - f0) / (f1 - f0)` exceeds `Geometry.largeFractionResult`.
      */
     static inverseInterpolate(x0, f0, x1, f1, fTarget = 0, defaultResult) {
         /**
@@ -185737,17 +185737,18 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   CurveChainWithDistanceIndex: () => (/* binding */ CurveChainWithDistanceIndex),
 /* harmony export */   PathFragment: () => (/* binding */ PathFragment)
 /* harmony export */ });
-/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
-/* harmony import */ var _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../curve/Query/StrokeCountMap */ "../../core/geometry/lib/esm/curve/Query/StrokeCountMap.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
-/* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
-/* harmony import */ var _Path__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Path */ "../../core/geometry/lib/esm/curve/Path.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
+/* harmony import */ var _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/Query/StrokeCountMap */ "../../core/geometry/lib/esm/curve/Query/StrokeCountMap.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
+/* harmony import */ var _CurveExtendMode__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ./CurveExtendMode */ "../../core/geometry/lib/esm/curve/CurveExtendMode.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ./CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./internalContexts/PlaneAltitudeRangeContext */ "../../core/geometry/lib/esm/curve/internalContexts/PlaneAltitudeRangeContext.js");
+/* harmony import */ var _OffsetOptions__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./OffsetOptions */ "../../core/geometry/lib/esm/curve/OffsetOptions.js");
+/* harmony import */ var _Path__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Path */ "../../core/geometry/lib/esm/curve/Path.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -185766,15 +185767,16 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
- * Annotation of an interval of a curve.
+ * Annotation of a fragment, i.e. 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
+ * * * fraction0, fraction1 = fraction parameters along the child curve.
+ * * * distance0, distance1 = distances within containing CurveChainWithDistanceIndex.
  * @public
  */
 class PathFragment {
-    /** Create a fragment with complete fraction, distance and child data. */
+    /** Create a fragment with complete fraction, distance, and child data. */
     constructor(childFraction0, childFraction1, distance0, distance1, childCurve, range) {
         this.childFraction0 = childFraction0;
         this.childFraction1 = childFraction1;
@@ -185784,68 +185786,64 @@ class PathFragment {
         this.range = range;
         this.a = 0;
     }
-    /**
-     * Return true if the distance is within the distance limits of this fragment.
-     * @param distance
-     */
+    /** Return true if the distance is within the distance limits of this fragment. */
     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 minimum distance from spacePoint to the curve.
+     * * The returned distance is to the curve's range box if defined; otherwise, the true distance is computed.
+     * * Thus the returned distance may be SMALLER than the true distance to the curve, but not larger.
+     */
     quickMinDistanceToChildCurve(spacePoint) {
-        if (this.range) {
+        if (this.range)
             return this.range.distanceToPoint(spacePoint);
-        }
-        // ugh.  have to do real computation ..
         const detail = this.childCurve.closestPoint(spacePoint, false);
         if (detail)
             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 input path fragments, sorted smallest to largest on the "a" value,
+     * initialized with `quickMinDistanceToChildCurve`
      */
     static collectSortedQuickMinDistances(fragments, spacePoint) {
         const sortedFragments = [];
-        for (const f of fragments) {
-            f.a = f.quickMinDistanceToChildCurve(spacePoint);
-            sortedFragments.push(f);
+        for (const frag of fragments) {
+            frag.a = frag.quickMinDistanceToChildCurve(spacePoint);
+            sortedFragments.push(frag);
         }
-        sortedFragments.sort((a, b) => a.a - b.a);
+        sortedFragments.sort((frag1, frag2) => frag1.a - frag2.a);
         return sortedFragments;
     }
-    /**
-     * Return true if this fragment addresses `curve` and brackets `fraction`
-     * @param distance
-     */
+    /** Return true if `this` fragment addresses `curve` and brackets `fraction`. */
     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.
-     * Note that proportional calculation does NOT account for nonuniform parameterization in the child curve.
+     * Convert distance to local fraction and apply that to interpolate between the stored curve fractions.
+     * Note that proportional calculation does NOT account for non-uniform 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 . ..
+        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.inverseInterpolate(this.childFraction0, this.chainDistance0, this.childFraction1, this.chainDistance1, distance, this.childFraction0); // the interval must have nonzero length so division should be safe
     }
-    /** Convert chainDistance to true chidFraction, using detailed moveSignedDistanceFromFraction */
+    /** Convert the given chainDistance to a fraction along this childCurve using `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
-     * @param globalDistance total length of the global curve.
+     * 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.
-     * * each child fraction `f` is replaced by `1-f`
-     * * each `chainDistance` is replaced by `totalDistance-chainDistance`
+     * * Each child fraction `f` is replaced by `1-f`
+     * * Each `chainDistance` is replaced by `totalDistance - chainDistance`
+     * @param totalDistance the total distance
      */
     reverseFractionsAndDistances(totalDistance) {
         const f0 = this.childFraction0;
@@ -185857,14 +185855,14 @@ class PathFragment {
         this.chainDistance0 = totalDistance - d1;
         this.chainDistance1 = totalDistance - d0;
     }
-    /** @deprecated in 3.x. Use childFractionToChainDistance */
+    /** @deprecated in 3.x. Use `PathFragment.childFractionToChainDistance`. */
     childFractionTChainDistance(fraction) {
         return this.childFractionToChainDistance(fraction);
     }
     /**
-     * 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
+     * Convert a fractional position on the childCurve of this fragment to distance on the curve chain.
+     * * Return value is SIGNED and will be negative when `fraction < this.childFraction0`.
+     * @param fraction the fractional position on the childCurve of this fragment
      */
     childFractionToChainDistance(fraction) {
         let d = this.childCurve.curveLengthBetweenFractions(this.childFraction0, fraction);
@@ -185873,7 +185871,7 @@ class PathFragment {
         return this.chainDistance0 + d;
     }
 }
-/** Non-instantiable class to build a distance index for a path. */
+/** Non-instantiable class to build a distance index for a curve chain. */
 class DistanceIndexConstructionContext {
     constructor() {
         this._accumulatedDistance = 0;
@@ -185885,23 +185883,22 @@ class DistanceIndexConstructionContext {
     endParentCurvePrimitive(_cp) { }
     endCurvePrimitive(_cp) { }
     announcePointTangent(_xyz, _fraction, _tangent) { }
-    /** Announce numPoints interpolated between point0 and point1, with associated fractions */
     announceSegmentInterval(cp, point0, point1, numStrokes, fraction0, fraction1) {
         const fragmentPoint0 = point0.clone();
         const fragmentPoint1 = point1.clone();
         let d0 = this._accumulatedDistance;
         if (numStrokes <= 1) {
             this._accumulatedDistance += point0.distance(point1);
-            this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp, _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.create(fragmentPoint0, fragmentPoint1)));
+            this._fragments.push(new PathFragment(fraction0, fraction1, d0, this._accumulatedDistance, cp, _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__.Range3d.create(fragmentPoint0, fragmentPoint1)));
         }
         else {
             let f1;
             for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {
-                f1 = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
+                f1 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
                 point0.interpolate(f1, point1, fragmentPoint1);
                 d0 = this._accumulatedDistance;
                 this._accumulatedDistance += (Math.abs(f1 - f0) * point0.distance(point1));
-                this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, _geometry3d_Range__WEBPACK_IMPORTED_MODULE_1__.Range3d.create(fragmentPoint0, fragmentPoint1)));
+                this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, _geometry3d_Range__WEBPACK_IMPORTED_MODULE_2__.Range3d.create(fragmentPoint0, fragmentPoint1)));
                 fragmentPoint0.setFrom(fragmentPoint1);
             }
         }
@@ -185909,7 +185906,7 @@ class DistanceIndexConstructionContext {
     announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
         let f1, d, d0;
         for (let i = 1, f0 = fraction0; i <= numStrokes; i++, f0 = f1) {
-            f1 = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
+            f1 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
             d = cp.curveLengthBetweenFractions(f0, f1);
             d0 = this._accumulatedDistance;
             this._accumulatedDistance += d;
@@ -185917,7 +185914,10 @@ class DistanceIndexConstructionContext {
             this._fragments.push(new PathFragment(f0, f1, d0, this._accumulatedDistance, cp, range));
         }
     }
-    needPrimaryGeometryForStrokes() { return true; }
+    needPrimaryGeometryForStrokes() {
+        return true;
+    }
+    /** Create an array of PathFragment from input curve chain. */
     static createPathFragmentIndex(path, options) {
         const handler = new DistanceIndexConstructionContext();
         for (const curve of path.children) {
@@ -185932,12 +185932,11 @@ class DistanceIndexConstructionContext {
  * 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`
+ * * 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` */
+class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_3__.CurvePrimitive {
+    /** Test if `other` is a `CurveChainWithDistanceIndex` */
     isSameGeometryClass(other) {
         return other instanceof CurveChainWithDistanceIndex;
     }
@@ -185956,13 +185955,13 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      */
     cloneTransformed(transform) {
         const c = this._path.clone();
-        if (c instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_3__.CurveChain && c.tryTransformInPlace(transform))
+        if (c instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_4__.CurveChain && c.tryTransformInPlace(transform))
             return CurveChainWithDistanceIndex.createCapture(c);
         return undefined;
     }
     /**
      * Reference to the contained path.
-     * * Do not modify the path.  The distance index will be wrong.
+     * * Do not modify the path. The distance index will be wrong.
      */
     get path() {
         return this._path;
@@ -186007,7 +186006,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         const childFractionA = fragmentA.chainDistanceToAccurateChildFraction(chainDistanceA, true);
         const childFractionB = fragmentB.chainDistanceToAccurateChildFraction(chainDistanceB, true);
         // add a (possibly reversed) partial clone to newPath
-        const newPath = _Path__WEBPACK_IMPORTED_MODULE_4__.Path.create();
+        const newPath = _Path__WEBPACK_IMPORTED_MODULE_5__.Path.create();
         const addPartialChild = (childCurve, childFraction0, childFraction1, reversedClone) => {
             if (childFraction0 === childFraction1)
                 return false;
@@ -186056,19 +186055,19 @@ 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 `this` curve. */
     startPoint(result) {
         const c = this._path.cyclicCurvePrimitive(0);
         if (c)
             return c.startPoint(result);
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.createZero(result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.createZero(result);
     }
-    /** Return the end point of the primitive. The default implementation returns fractionToPoint(1.0) */
+    /** Return the end point of of `this` curve. */
     endPoint(result) {
         const c = this._path.cyclicCurvePrimitive(-1);
         if (c)
             return c.endPoint(result);
-        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Point3d.createZero(result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.createZero(result);
     }
     /** Add strokes to caller-supplied linestring */
     emitStrokes(dest, options) {
@@ -186099,7 +186098,7 @@ 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 smallestPossiblePrimitives if true, recurse on the 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]].
      */
@@ -186119,28 +186118,24 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * @param parentStrokeMap evolving parent map.
      */
     computeAndAttachRecursiveStrokeCounts(options, parentStrokeMap) {
-        const myMap = _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_6__.StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);
+        const myMap = _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_7__.StrokeCountMap.createWithCurvePrimitiveAndOptionalParent(this, parentStrokeMap);
         for (const c of this._path.children) {
             c.computeAndAttachRecursiveStrokeCounts(options, myMap);
         }
-        _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__.CurvePrimitive.installStrokeCountMap(this, myMap, parentStrokeMap);
+        _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_3__.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);
+        return handler.handleCurveChainWithDistanceIndex(this);
     }
-    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */
+    /** Extend `rangeToExtend` as needed to include these curves (optionally transformed) */
     extendRange(rangeToExtend, transform) {
         this._path.extendRange(rangeToExtend, transform);
     }
-    /**
-     * Curve length is always positive.
-     * @returns Returns a (high accuracy) length of the curve between fractional positions
-     * @returns Returns the length of the curve.
-     */
+    /** Return a (high accuracy and positive) length of the curve between fractional positions */
     curveLengthBetweenFractions(fraction0, fraction1) {
         return Math.abs(fraction1 - fraction0) * this._totalLength;
     }
@@ -186154,9 +186149,10 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         return result;
     }
     /**
-     * Resolve a fraction of the CurveChain to a PathFragment
-     * @param distance
-     * @param allowExtrapolation
+     * Return the PathFragment object at the given `distance` along the chain.
+     * @param distance distance along the chain.
+     * @param allowExtrapolation if `true`, returns first fragment for negative distances and returns last fragment
+     * for distances larger than curve length. If `false` returns `undefined` for those out of bound distances.
      */
     chainDistanceToFragment(distance, allowExtrapolation = false) {
         const i = this.chainDistanceToFragmentIndex(distance, allowExtrapolation);
@@ -186165,9 +186161,10 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         return undefined;
     }
     /**
-     * Resolve a fraction of the CurveChain to a PathFragment index
-     * @param distance
-     * @param allowExtrapolation
+     * Return the index of the PathFragment at the given `distance` along the chain.
+     * @param distance distance along the chain.
+     * @param allowExtrapolation if `true`, returns 0 for negative distances and returns last fragment index for
+     * distances larger than curve length. If `false` returns `undefined` for those out of bound distances.
      */
     chainDistanceToFragmentIndex(distance, allowExtrapolation = false) {
         const numFragments = this._fragments.length;
@@ -186177,7 +186174,7 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
                 return allowExtrapolation ? 0 : undefined;
             if (distance > this._totalLength)
                 return allowExtrapolation ? (numFragments - 1) : undefined;
-            // humbug, linear search
+            // linear search (opportunity for improvement)
             for (let i = 0; i < numFragments; i++) {
                 if (fragments[i].containsChainDistance(distance))
                     return i;
@@ -186187,33 +186184,29 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * Convert distance along the chain to fraction along the chain.
-     * @param distance distance along the chain
+     * @param distance distance along the chain.
      */
     chainDistanceToChainFraction(distance) {
         return distance / this._totalLength;
     }
-    /**
-     * Resolve a fraction within a specific curve to a fragment.
-     * @param curve
-     * @param fraction
-     */
+    /** Return the PathFragment object containing the point at the given `fraction` of the given child curve. */
     curveAndChildFractionToFragment(curve, fraction) {
         const numFragments = this._fragments.length;
         const fragments = this._fragments;
         if (numFragments > 0) {
-            // humbug, linear search
+            if (fraction < 0)
+                return fragments[0];
+            if (fraction > 1.0)
+                return fragments[numFragments - 1];
+            // linear search (opportunity for improvement)
             for (const fragment of fragments) {
                 if (fragment.containsChildCurveAndChildFraction(curve, fraction))
                     return fragment;
             }
-            if (fraction <= 0)
-                return fragments[0];
-            if (fraction > 1.0)
-                return fragments[numFragments - 1];
         }
         return undefined;
     }
-    /** Returns the total length of curves. */
+    /** Returns the total length of `this` curve. */
     curveLength() {
         return this._totalLength;
     }
@@ -186226,52 +186219,59 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * Return the point (x,y,z) on the curve at fractional position along the chain.
-     * @param fraction fractional position along the geometry.
-     * @returns Returns a point on the curve.
+     * @param fraction fractional position along the curve.
+     * @returns a point on the curve.
      */
     fractionToPoint(fraction, result) {
-        const chainDistance = fraction * this._totalLength;
-        const fragment = this.chainDistanceToFragment(chainDistance, true);
+        const distanceAlongPath = fraction * this._totalLength;
+        const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
         if (fragment) {
-            const childFraction = fragment.chainDistanceToAccurateChildFraction(chainDistance, true);
+            const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
             return fragment.childCurve.fractionToPoint(childFraction, result);
         }
-        // no fragment found.  Use _fragments[0]
-        //    fragment = this.chainDistanceToFragment(chainDistance, true);
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(false); // we never expect to get here
+        // no fragment found. just return the first point on the curve.
         return this._fragments[0].childCurve.fractionToPoint(0.0, result);
     }
     /**
      * 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.
+     * * Note that the derivative is "derivative of xyz with respect to fraction".
+     * * The derivative shows the speed of the "fractional point" moving along the curve.
+     * * The derivative is not generally a unit vector. Use `fractionToPointAndUnitTangent` for a unit vector.
      * @param fraction fractional position along the geometry.
-     * @returns Returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.
+     * @param result optional receiver for the result.
+     * @returns a ray whose origin is the curve point and direction is the derivative with respect to the fraction.
      */
     fractionToPointAndDerivative(fraction, result) {
         const distanceAlongPath = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
-        result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
-        // Fractional arc length parameterization for the curve C is f=f(t)=s(t)/L, where
-        // L is total length of C, f'=||C'||/L, and inverse t=t(f), t'=1/f'=L/||C'||.
-        // Then d/df(C(t(f)))=C't'=C'L/||C'||. The fragment gave us C', so the
-        // derivative we seek is just a scale away.
-        const a = this._totalLength / result.direction.magnitude();
+        const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
+        result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);
+        // Recall the standard arclength formula s(t) for the curve C = C(t), with derivative s'(t) = ||C'||.
+        // Define fractional arclength for C by f = f(t) = s(t)/L, where L is the total length of C. Then f' = ||C'||/L.
+        // Denote the inverse of f by t = t(f). Then C = C(t(f)) is a parameterization of C by its fractional arclength f.
+        // Since the derivative of t is t'=1/f'=L/||C'||, the derivative we seek is d/df(C(t(f))) = C' t' = C' L/||C'||.
+        // The fragment gives us C', so we're just a scale away.
+        // Math details can be found at core/geometry/internaldocs/Curve.md
+        const a = this._totalLength / result.direction.magnitude(); // L/||C'||
         result.direction.scaleInPlace(a);
         return result;
     }
     /**
-     * Returns a ray whose origin is the curve point and direction is the unit tangent.
+     * Return the point (x,y,z) and normalized derivative on the curve at fractional position.
+     * * Note that the derivative is "derivative of xyz with respect to fraction".
+     * * The un-normalized derivative shows the speed of the "fractional point" moving along the curve.
+     * * To find the un-normalized derivative, use `fractionToPointAndDerivative`.
      * @param fraction fractional position on the curve
      * @param result optional receiver for the result.
-     * Returns a ray whose origin is the curve point and direction is the unit tangent.
+     * @returns a ray whose origin is the curve point and direction is the normalized derivative with respect to
+     * the fraction.
      */
     fractionToPointAndUnitTangent(fraction, result) {
         const distanceAlongPath = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
-        result = fragment.childCurve.fractionToPointAndDerivative(curveFraction, result);
+        const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
+        result = fragment.childCurve.fractionToPointAndDerivative(childFraction, result);
         result.direction.normalizeInPlace();
         return result;
     }
@@ -186280,34 +186280,39 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * * 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.
-     * * vectorV is the second derivative, i.e.derivative of vectorU.
+     * * vectorV is the second derivative, i.e. derivative of vectorU which points in the direction of the curve's
+     * derivative's change.
      */
     fractionToPointAnd2Derivatives(fraction, result) {
         const distanceAlongPath = fraction * this._totalLength;
         const fragment = this.chainDistanceToFragment(distanceAlongPath, true);
-        const curveFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
-        result = fragment.childCurve.fractionToPointAnd2Derivatives(curveFraction, result);
+        const childFraction = fragment.chainDistanceToAccurateChildFraction(distanceAlongPath, true);
+        result = fragment.childCurve.fractionToPointAnd2Derivatives(childFraction, result);
         if (!result)
             return undefined;
-        // See fractionToPointAndDerivative for derivation of d/df(C(t(f)))=L C'/||C'||.
-        // For the 2nd deriv, use quotient rule, d/dt||x(t)||=x.x'/||x|| and ||x||^2=x.x :
-        // d2/df2(C(t(f))) = L d/df(C'/||C'||)
-        //  = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2
+        // See fractionToPointAndDerivative, where we show d/df(C(t(f))) = L C'/||C'||.
+        // Here we seek the 2nd derivative. We'll use the quotient rule, and the identities
+        // d/dt||x(t)|| = x.x'/||x|| and ||x||^2 = x.x, where "." is the dot product.
+        // d2/df2(C(t(f))) = L d/df(C'/||C'||) = L (||C'|| d/df(C') - C' d/df||C'||) / ||C'||^2
         //  = L (||C'|| C" L/||C'|| - C' C'.C"/||C'|| L/||C'||) / ||C'||^2
-        //  = (L/||C'||)^2 (C" - C' C'.C"/C'.C' )
-        // We have C' and C" from the fragment.
-        const magU = result.vectorU.magnitude();
-        const dotUU = magU * magU;
-        const dotUV = result.vectorU.dotProduct(result.vectorV);
-        result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU);
-        const scale = this._totalLength / magU;
-        result.vectorU.scaleInPlace(scale);
-        result.vectorV.scaleInPlace(scale * scale);
+        //  = (L/||C'||)^2 (C" - C' C'.C"/C'.C' ), where C' and C" are given by the fragment.
+        // The second derivative that fractionToPointAnd2Derivatives returns is C", so the second
+        // derivative we seek is just few scales away.
+        // Math details can be found at core/geometry/internaldocs/Curve.md
+        const magU = result.vectorU.magnitude(); // ||C'||
+        const dotUU = magU * magU; // ||C'||^2
+        const dotUV = result.vectorU.dotProduct(result.vectorV); // C'.C"
+        result.vectorV.addScaledInPlace(result.vectorU, -dotUV / dotUU); // add -(C'*C'.C")/(||C'||^2) to vectorV
+        const scale = this._totalLength / magU; // L/||C'||
+        result.vectorU.scaleInPlace(scale); // scale vectorU by L/||C'||
+        result.vectorV.scaleInPlace(scale * scale); // scale vectorV by (L/||C'(t)||)^2
         return result;
     }
     /**
      * Attempt to transform in place.
-     * * Warning: If any child fails, this object becomes invalid.  But that should never happen.
+     * * Warning: If any child transform fails, `this` object becomes invalid but that should never happen.
+     * @param transform the transform to be applied.
+     * @returns true if all of child transforms succeed and false otherwise.
      */
     tryTransformInPlace(transform) {
         let numFail = 0;
@@ -186320,48 +186325,45 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     /** Reverse the curve's data so that its fractional stroking moves in the opposite direction. */
     reverseInPlace() {
         this._path.reverseChildrenInPlace();
-        const totalLength = this._totalLength;
         for (const fragment of this._fragments) {
-            fragment.reverseFractionsAndDistances(totalLength);
+            fragment.reverseFractionsAndDistances(this._totalLength);
         }
         this._fragments.reverse();
     }
     /**
-     * Test for equality conditions:
-     * * Mismatched totalLength is a quick exit condition
-     * * If totalLength matches, recurse to the path for matching primitives.
-     * @param other
+     * Test for equality conditions.
+     * * Mismatched total length is a quick exit condition.
+     * * If total length matches, recurse to the path for matching primitives.
      */
     isAlmostEqual(other) {
         if (other instanceof CurveChainWithDistanceIndex) {
-            return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this._totalLength, other._totalLength)
-                && this._path.isAlmostEqual(other._path);
+            return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this._totalLength, other._totalLength) && this._path.isAlmostEqual(other._path);
         }
         return false;
     }
     /**
-     * Implement moveSignedDistanceFromFraction.
-     * * See `CurvePrimitive` for parameter details.
-     * * The returned location directly identifies fractional position along the CurveChainWithDistanceIndex, and
+     * (Attempt to) find a position on the curve at a signed distance from start fraction.
+     * * See `CurvePrimitive.moveSignedDistanceFromFraction` for parameter details.
+     * * 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;
         const distanceB = distanceA + signedDistance;
         const fragmentB = this.chainDistanceToFragment(distanceB, true);
-        const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result);
+        const childDetail = fragmentB.childCurve.moveSignedDistanceFromFraction(fragmentB.childFraction0, distanceB - fragmentB.chainDistance0, allowExtension, result); // local detail related to the child curve
         const endFraction = startFraction + (signedDistance / this._totalLength);
-        const chainDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_7__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result);
+        const chainDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createConditionalMoveSignedDistance(allowExtension, this, startFraction, endFraction, signedDistance, result); // global detail related to the curve chain
         chainDetail.childDetail = childDetail;
         return chainDetail;
     }
     /**
+     * Return an object summarizing closest point test counts.
      * The returned object has
      * * numCalls = number of times closestPoint was called.
-     * * numCurvesTested = number of curves tested with full closestPoint
-     * * numAssigned = number of times a new minimum value was recorded
+     * * numCurvesTested = number of curves tested with full closestPoint.
+     * * numAssigned = number of times a new minimum value was recorded.
      * * numCandidate = number of curves that would be tested in worst case.
-     * return an object summarizing closest point test counts
      * @param clear if true, counts are cleared after the return object is formed.
      */
     static getClosestPointTestCounts(clear = true) {
@@ -186378,13 +186380,13 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
     }
     /**
      * 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
+     * * 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.
      * @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.
+     * @returns a CurveLocationDetail structure that holds the details of the close point.
      */
     closestPoint(spacePoint, extend) {
         let childDetail;
@@ -186395,52 +186397,51 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
         }
         else {
             const sortedFragments = PathFragment.collectSortedQuickMinDistances(this._fragments, spacePoint);
-            const extend0 = [_CurveExtendMode__WEBPACK_IMPORTED_MODULE_8__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0), _CurveExtendMode__WEBPACK_IMPORTED_MODULE_8__.CurveExtendMode.None];
-            const extend1 = [_CurveExtendMode__WEBPACK_IMPORTED_MODULE_8__.CurveExtendMode.None, _CurveExtendMode__WEBPACK_IMPORTED_MODULE_8__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1)];
+            const extend0 = [
+                _CurveExtendMode__WEBPACK_IMPORTED_MODULE_9__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 0),
+                _CurveExtendMode__WEBPACK_IMPORTED_MODULE_9__.CurveExtendMode.None,
+            ];
+            const extend1 = [
+                _CurveExtendMode__WEBPACK_IMPORTED_MODULE_9__.CurveExtendMode.None,
+                _CurveExtendMode__WEBPACK_IMPORTED_MODULE_9__.CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extend, 1),
+            ];
             const fragment0 = this._fragments[0];
             const fragment1 = this._fragments[this._fragments.length - 1];
             CurveChainWithDistanceIndex._numCalls++;
             CurveChainWithDistanceIndex._numCandidate += sortedFragments.length;
-            for (const f of sortedFragments) {
-                if (f.a > aMin)
+            let detailA;
+            for (const sortedFragment of sortedFragments) {
+                if (sortedFragment.a > aMin)
+                    // sortedFragments help early exit because it is likely that one of the first few fragments
+                    // in sortedFragments is the fragment with minimum distance from space point to the curve.
                     break;
                 CurveChainWithDistanceIndex._numTested++;
-                const child = f.childCurve;
-                const detailA = child.closestPoint(spacePoint, f === fragment0 ? extend0 : f === fragment1 ? extend1 : false);
+                const child = sortedFragment.childCurve;
+                detailA = child.closestPoint(spacePoint, sortedFragment === fragment0 ? extend0 : sortedFragment === fragment1 ? extend1 : false, detailA);
                 if (detailA && detailA.a < aMin) {
                     aMin = detailA.a;
-                    childDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_7__.CurveLocationDetail.createCurveFractionPoint(detailA.curve, detailA.fraction, detailA.point, childDetail);
-                    childDetail.a = detailA.a;
+                    childDetail = detailA.clone(childDetail);
                     CurveChainWithDistanceIndex._numAssigned++;
                 }
             }
         }
         if (!childDetail)
             return undefined;
-        const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);
-        if (fragment) {
-            const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);
-            const chainFraction = this.chainDistanceToChainFraction(chainDistance);
-            const chainDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_7__.CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);
-            chainDetail.childDetail = childDetail;
-            chainDetail.a = childDetail.a;
-            return chainDetail;
-        }
-        return undefined;
+        return this.computeChainDetail(childDetail);
     }
     /**
      * 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
+     * * 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
+     * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve) or offset options object.
      */
     constructOffsetXY(offsetDistanceOrOptions) {
-        const options = _OffsetOptions__WEBPACK_IMPORTED_MODULE_9__.OffsetOptions.create(offsetDistanceOrOptions);
+        const options = _OffsetOptions__WEBPACK_IMPORTED_MODULE_10__.OffsetOptions.create(offsetDistanceOrOptions);
         const offsets = [];
         for (const prim of this.collectCurvePrimitives(undefined, true, true)) {
             const offset = prim.constructOffsetXY(options);
             if (offset !== undefined) {
-                if (offset instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__.CurvePrimitive)
+                if (offset instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_3__.CurvePrimitive)
                     offsets.push(offset);
                 else if (Array.isArray(offset))
                     offset.forEach((cp) => offsets.push(cp));
@@ -186452,12 +186453,31 @@ class CurveChainWithDistanceIndex extends _curve_CurvePrimitive__WEBPACK_IMPORTE
      * 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
+     * @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.
      */
     projectedParameterRange(ray, lowHigh) {
-        return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_10__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
+        return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_11__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
+    }
+    /**
+     * Compute the global chain detail corresponding to a local child detail.
+     * @param childDetail the local detail, with respect to a child of this chain.
+     * @returns the global detail, with respect to this chain.
+     */
+    computeChainDetail(childDetail) {
+        if (!childDetail.curve)
+            return undefined;
+        const fragment = this.curveAndChildFractionToFragment(childDetail.curve, childDetail.fraction);
+        if (fragment) {
+            const chainDistance = fragment.childFractionToChainDistance(childDetail.fraction);
+            const chainFraction = this.chainDistanceToChainFraction(chainDistance);
+            const chainDetail = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_8__.CurveLocationDetail.createCurveFractionPoint(this, chainFraction, childDetail.point);
+            chainDetail.childDetail = childDetail;
+            chainDetail.a = childDetail.a;
+            return chainDetail;
+        }
+        return undefined;
     }
 }
 CurveChainWithDistanceIndex._numCalls = 0;
@@ -186913,10 +186933,10 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ });
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
+/* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
 /* harmony import */ var _internalContexts_CurveCurveCloseApproachXY__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./internalContexts/CurveCurveCloseApproachXY */ "../../core/geometry/lib/esm/curve/internalContexts/CurveCurveCloseApproachXY.js");
 /* harmony import */ var _internalContexts_CurveCurveIntersectXY__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./internalContexts/CurveCurveIntersectXY */ "../../core/geometry/lib/esm/curve/internalContexts/CurveCurveIntersectXY.js");
 /* harmony import */ var _internalContexts_CurveCurveIntersectXYZ__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./internalContexts/CurveCurveIntersectXYZ */ "../../core/geometry/lib/esm/curve/internalContexts/CurveCurveIntersectXYZ.js");
-/* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -186959,6 +186979,7 @@ class CurveCurve {
     }
     /**
      * Return xy intersections of 2 projected curves.
+     * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections.
      * @param curveA first curve
      * @param extendA true to allow curveA to extend
      * @param curveB second curve
@@ -186971,19 +186992,20 @@ class CurveCurve {
         return handler.grabPairedResults();
     }
     /**
-     * Return full 3d xyz intersections of 2 curves.
-     *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
-     *  * Not Implemented for bspline and bezier curves.
-     * @beta
-     * @param curveA first curve
-     * @param extendA true to allow curveA to extend
-     * @param curveB second curve
-     * @param extendB true to allow curveB to extend
-     */
-    static intersectionXYZ(curveA, extendA, curveB, extendB) {
+   * Return full 3d xyz intersections of 2 curves.
+   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
+   *  * Not Implemented for bspline and bezier curves.
+   * @beta
+   * @param curveA first curve
+   * @param extendA true to allow curveA to extend
+   * @param curveB second curve
+   * @param extendB true to allow curveB to extend
+   * @returns array of intersections structured as CurveLocationDetailPair[]
+   */
+    static intersectionXYZPairs(curveA, extendA, curveB, extendB) {
         const handler = new _internalContexts_CurveCurveIntersectXYZ__WEBPACK_IMPORTED_MODULE_4__.CurveCurveIntersectXYZ(extendA, curveB, extendB);
         curveA.dispatchToGeometryHandler(handler);
-        return handler.grabResults();
+        return handler.grabPairedResults();
     }
     /**
      * Return xy intersections of input curves.
@@ -188213,7 +188235,8 @@ class CurveLocationDetailPair {
     }
 }
 /**
- * Data bundle for a pair of arrays of CurveLocationDetail structures such as produced by [[CurveCurve.intersectionXYZ]].
+ * Data bundle for a pair of arrays of CurveLocationDetail structures.
+ * @deprecated in 4.x. Use CurveLocationDetailPair[] instead.
  * @public
  */
 class CurveLocationDetailArrayPair {
@@ -188824,8 +188847,8 @@ class CurvePrimitive extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_1__.Geometr
      * directions), or array of distinct CurveExtendOptions for start and end.
      * @returns Returns a CurveLocationDetail structure that holds the details of the close point.
      */
-    closestPoint(spacePoint, extend) {
-        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_10__.ClosestPointStrokeHandler(spacePoint, extend);
+    closestPoint(spacePoint, extend, result) {
+        const strokeHandler = new _internalContexts_ClosestPointStrokeHandler__WEBPACK_IMPORTED_MODULE_10__.ClosestPointStrokeHandler(spacePoint, extend, result);
         this.emitStrokableParts(strokeHandler);
         return strokeHandler.claimResult();
     }
@@ -196180,7 +196203,7 @@ __webpack_require__.r(__webpack_exports__);
  * @internal
  */
 class ClosestPointStrokeHandler extends _NewtonRtoRStrokeHandler__WEBPACK_IMPORTED_MODULE_0__.NewtonRtoRStrokeHandler {
-    constructor(spacePoint, extend) {
+    constructor(spacePoint, extend, result) {
         super();
         this._fractionA = 0;
         this._functionA = 0;
@@ -196190,7 +196213,7 @@ class ClosestPointStrokeHandler extends _NewtonRtoRStrokeHandler__WEBPACK_IMPORT
         this._spacePoint = spacePoint;
         this._workPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
         this._workRay = _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_2__.Ray3d.createZero();
-        this._closestPoint = undefined;
+        this._closestPoint = result;
         this._extend = extend;
         this.startCurvePrimitive(undefined);
         this._newtonSolver = new _numerics_Newton__WEBPACK_IMPORTED_MODULE_3__.Newton1dUnboundedApproximateDerivative(this);
@@ -196366,18 +196389,20 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   CurveCurveCloseApproachXY: () => (/* binding */ CurveCurveCloseApproachXY)
 /* harmony export */ });
-/* harmony import */ var _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../../bspline/BSplineCurve */ "../../core/geometry/lib/esm/bspline/BSplineCurve.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
-/* harmony import */ var _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../geometry3d/GrowableFloat64Array */ "../../core/geometry/lib/esm/geometry3d/GrowableFloat64Array.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../numerics/Polynomials */ "../../core/geometry/lib/esm/numerics/Polynomials.js");
-/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
-/* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
+/* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
+/* harmony import */ var _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../../bspline/BSplineCurve */ "../../core/geometry/lib/esm/bspline/BSplineCurve.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
+/* harmony import */ var _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../geometry3d/GrowableFloat64Array */ "../../core/geometry/lib/esm/geometry3d/GrowableFloat64Array.js");
+/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../numerics/Polynomials */ "../../core/geometry/lib/esm/numerics/Polynomials.js");
+/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
+/* harmony import */ var _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../CurveChainWithDistanceIndex */ "../../core/geometry/lib/esm/curve/CurveChainWithDistanceIndex.js");
+/* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
+/* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -196397,6 +196422,8 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
+
 // cspell:word XYRR
 /**
  * Handler class for XY close approach between _geometryB and another geometry.
@@ -196412,12 +196439,12 @@ __webpack_require__.r(__webpack_exports__);
  * * geometryB is saved for later reference.
  * @internal
  */
-class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__.RecurseToCurvesGeometryHandler {
+class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_1__.RecurseToCurvesGeometryHandler {
     setGeometryB(geometryB) {
         this._geometryB = geometryB;
         this._circularArcB = undefined;
         this._circularRadiusB = undefined;
-        if (geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d) {
+        if (geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
             const r = geometryB.circularRadiusXY();
             if (r !== undefined) {
                 this._circularRadiusB = r;
@@ -196425,9 +196452,6 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
             }
         }
     }
-    reinitialize() {
-        this._results = [];
-    }
     /**
      * Constructor.
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
@@ -196435,8 +196459,8 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     constructor(geometryB) {
         super();
         this.setGeometryB(geometryB);
-        this._maxDistanceSquared = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistanceSquared;
-        this.reinitialize();
+        this._maxDistanceSquared = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistanceSquared;
+        this._results = [];
     }
     /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */
     set maxDistanceToAccept(value) {
@@ -196471,12 +196495,12 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     grabPairedResults(reinitialize = false) {
         const result = this._results;
         if (reinitialize)
-            this.reinitialize();
+            this._results = [];
         return result;
     }
     /** Returns `true` if `detail` has same curve and fraction. */
     sameCurveAndFraction(cp, fraction, detail) {
-        return cp === detail.curve && _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(fraction, detail.fraction);
+        return cp === detail.curve && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isAlmostEqualNumber(fraction, detail.fraction);
     }
     /**
      * If distance between pointA and pointB is less than maxDistance, record CurveLocationDetailPair which is
@@ -196485,9 +196509,9 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     testAndRecordPointPairApproach(cpA, fA, pointA, cpB, fB, pointB, reversed) {
         const d2 = pointA.distanceSquaredXY(pointB);
         if (d2 < this._maxDistanceSquared) {
-            const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(cpA, fA, pointA);
-            const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(cpB, fB, pointB);
-            const pair = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailA, detailB);
+            const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(cpA, fA, pointA);
+            const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(cpB, fB, pointB);
+            const pair = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detailA, detailB);
             if (reversed)
                 pair.swapDetails();
             this._results.push(pair);
@@ -196503,7 +196527,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * @param cpB the second curve
      * @param fractionB0 start of the second curve
      * @param fractionB1 end of the second curve
-     * @param reversed true to have order reversed in final structures
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      * @param intervalDetails optional CurveLocationDetailPair
      */
     recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, cpB, fractionB0, fractionB1, reversed, intervalDetails) {
@@ -196513,14 +196537,14 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
             intervalDetails.detailA.hasFraction1 &&
             intervalDetails.detailB.hasFraction1;
         if (isInterval) {
-            globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction, fractionA1);
-            globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionB0, intervalDetails.detailB.fraction, fractionB1);
-            globalFractionA1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction1, fractionA1);
-            globalFractionB1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionB0, intervalDetails.detailB.fraction1, fractionB1);
+            globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction, fractionA1);
+            globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionB0, intervalDetails.detailB.fraction, fractionB1);
+            globalFractionA1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionA0, intervalDetails.detailA.fraction1, fractionA1);
+            globalFractionB1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionB0, intervalDetails.detailB.fraction1, fractionB1);
         }
         else {
-            globalFractionA = globalFractionA1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionA0, localFractionA, fractionA1);
-            globalFractionB = globalFractionB1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionB0, localFractionB, fractionB1);
+            globalFractionA = globalFractionA1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionA0, localFractionA, fractionA1);
+            globalFractionB = globalFractionB1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionB0, localFractionB, fractionB1);
         }
         // ignore duplicate of most recent approach
         const numPrevious = this._results.length;
@@ -196538,8 +196562,8 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
                     return;
             }
         }
-        const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(cpA, globalFractionA, cpA.fractionToPoint(globalFractionA));
-        const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(cpB, globalFractionB, cpB.fractionToPoint(globalFractionB));
+        const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(cpA, globalFractionA, cpA.fractionToPoint(globalFractionA));
+        const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(cpB, globalFractionB, cpB.fractionToPoint(globalFractionB));
         if (isInterval) {
             detailA.captureFraction1Point1(globalFractionA1, cpA.fractionToPoint(globalFractionA1));
             detailB.captureFraction1Point1(globalFractionB1, cpB.fractionToPoint(globalFractionB1));
@@ -196548,14 +196572,14 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
             const d2 = detailA.point.distanceSquaredXY(detailB.point);
             if (d2 > this._maxDistanceSquared)
                 return;
-            detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveIntervalRole.isolated);
-            detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveIntervalRole.isolated);
+            detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveIntervalRole.isolated);
+            detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveIntervalRole.isolated);
         }
         if (reversed) {
-            this._results.push(new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair(detailB, detailA));
+            this._results.push(new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair(detailB, detailA));
         }
         else {
-            this._results.push(new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair(detailA, detailB));
+            this._results.push(new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair(detailA, detailB));
         }
     }
     /**
@@ -196569,11 +196593,11 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * @param cpB curveB
      * @param fractionB0 global start fraction on curveB
      * @param fractionB1 global end fraction on curveB
-     * @param reversed whether to reverse the details in the pair
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      */
     capturePairWithLocalFractions(pair, cpA, fractionA0, fractionA1, cpB, fractionB0, fractionB1, reversed) {
-        const globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionA0, pair.detailA.fraction, fractionA1);
-        const globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionB0, pair.detailB.fraction, fractionB1);
+        const globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionA0, pair.detailA.fraction, fractionA1);
+        const globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionB0, pair.detailB.fraction, fractionB1);
         // ignore duplicate of most recent pair
         const numPrevious = this._results.length;
         if (numPrevious > 0) {
@@ -196590,13 +196614,13 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
                     return;
             }
         }
+        // recompute the points just in case
+        _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(cpA, globalFractionA, pair.detailA);
+        _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(cpB, globalFractionB, pair.detailB);
+        pair.detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveIntervalRole.isolated);
+        pair.detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveIntervalRole.isolated);
         if (reversed)
             pair.swapDetails();
-        // recompute the points just in case
-        _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveEvaluatedFraction(cpA, globalFractionA, pair.detailA);
-        _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveEvaluatedFraction(cpB, globalFractionB, pair.detailB);
-        pair.detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveIntervalRole.isolated);
-        pair.detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveIntervalRole.isolated);
         this._results.push(pair);
     }
     /**
@@ -196604,7 +196628,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * @param cpA first curve primitive (possibly different from curve in detailA, but fraction compatible)
      * @param cpB second curve primitive (possibly different from curve in detailA, but fraction compatible)
      * @param pairs array of pairs
-     * @param reversed true to have order reversed in final structures.
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      */
     recordPairs(cpA, cpB, pairs, reversed) {
         if (pairs !== undefined) {
@@ -196617,15 +196641,15 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * Record fully assembled (but possibly reversed) detail pair.
      * @param detailA first detail
      * @param detailB second detail
-     * @param reversed true to have order reversed in final structures.
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      */
     captureDetailPair(detailA, detailB, reversed) {
         if (detailA && detailB) {
             if (reversed) {
-                this._results.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB, detailA));
+                this._results.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detailB, detailA));
             }
             else {
-                this._results.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailA, detailB));
+                this._results.push(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detailA, detailB));
             }
         }
     }
@@ -196646,7 +196670,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     }
     /**
      * Return fractions of close approach within maxDistance between two line segments (a0,a1) and (b0,b1).
-     * * Math details can be found at docs/learning/geometry/CurveCurve.md
+     * * Math details can be found at core/geometry/internaldocs/Curve.md
      * @param a0 start point of line a
      * @param a1 end point of line a
      * @param b0 start point of line b
@@ -196666,38 +196690,38 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         const e01y = b1.y - a0.y;
         const e10x = b0.x - a1.x;
         const e10y = b0.y - a1.y;
-        const hab0 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(ux, uy, e00x, e00y);
-        const hab1 = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(ux, uy, e01x, e01y);
-        const hba0 = -_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(vx, vy, e00x, e00y);
-        const hba1 = -_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.crossProductXYXY(vx, vy, e10x, e10y);
+        const hab0 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(ux, uy, e00x, e00y);
+        const hab1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(ux, uy, e01x, e01y);
+        const hba0 = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(vx, vy, e00x, e00y);
+        const hba1 = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.crossProductXYXY(vx, vy, e10x, e10y);
         if (hab0 * hab1 < 0.0 && hba0 * hba1 < 0.0) { // true intersection, strictly within both segments
             const fractionA = -hba0 / (hba1 - hba0);
             const fractionB = -hab0 / (hab1 - hab0);
-            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(undefined, fractionA, a0.interpolate(fractionA, a1)), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(undefined, fractionB, b0.interpolate(fractionB, b1)));
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(undefined, fractionA, a0.interpolate(fractionA, a1)), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(undefined, fractionB, b0.interpolate(fractionB, b1)));
         }
         // there's no intersection, so find the closest approach within maxDistance from an endpoint
-        const closestApproach = new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair();
+        const closestApproach = new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair();
         closestApproach.detailA.a = 2 * maxDistanceSquared; // init to an approach that's too far away
         let reversed = false;
-        const uu = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.hypotenuseSquaredXY(ux, uy);
+        const uu = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.hypotenuseSquaredXY(ux, uy);
         if (hab0 * hab0 <= maxDistanceSquared * uu) { // test distance of b0 to u
-            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.dotProductXYXY(ux, uy, e00x, e00y) / uu;
+            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e00x, e00y) / uu;
             if (this.updatePointToSegmentDistance(0, b0, a0, a1, fractionA, maxDistanceSquared, closestApproach))
                 reversed = true;
         }
         if (hab1 * hab1 <= maxDistanceSquared * uu) { // test distance of b1 to u
-            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.dotProductXYXY(ux, uy, e01x, e01y) / uu;
+            const fractionA = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(ux, uy, e01x, e01y) / uu;
             if (this.updatePointToSegmentDistance(1, b1, a0, a1, fractionA, maxDistanceSquared, closestApproach))
                 reversed = true;
         }
-        const vv = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.hypotenuseSquaredXY(vx, vy);
+        const vv = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.hypotenuseSquaredXY(vx, vy);
         if (hba0 * hba0 <= maxDistanceSquared * vv) { // test distance of a0 to v
-            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.dotProductXYXY(vx, vy, e00x, e00y) / vv;
+            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e00x, e00y) / vv;
             if (this.updatePointToSegmentDistance(0, a0, b0, b1, fractionB, maxDistanceSquared, closestApproach))
                 reversed = false;
         }
         if (hba1 * hba1 <= maxDistanceSquared * vv) { // test distance of a1 to v
-            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.dotProductXYXY(vx, vy, e10x, e10y) / vv;
+            const fractionB = -_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.dotProductXYXY(vx, vy, e10x, e10y) / vv;
             if (this.updatePointToSegmentDistance(1, a1, b0, b1, fractionB, maxDistanceSquared, closestApproach))
                 reversed = false;
         }
@@ -196719,7 +196743,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * @param fB0 fraction0 on curveB
      * @param fB1 fraction0 on curveB
      * @param testProjectionOnB whether to record projections of the given curveA points onto curveB
-     * @param reversed true to have order reversed in final structures.
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      */
     testAndRecordFractionalPairApproach(cpA, fA0, fA1, testProjectionOnA, cpB, fB0, fB1, testProjectionOnB, reversed) {
         const pointA0 = cpA.fractionToPoint(fA0);
@@ -196744,7 +196768,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         // NO NO NO -- this is 3D closest point --- need 2d !!
         const detail = cpB.closestPoint(pointA, false);
         if (detail) {
-            const fB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.restrictToInterval(detail.fraction, fB0, fB1);
+            const fB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.restrictToInterval(detail.fraction, fB0, fB1);
             if (fB === detail.fraction) { // if fraction is within fB0 and fB1
                 this.testAndRecordPointPairApproach(cpA, fA, pointA, cpB, detail.fraction, detail.point, reversed);
             }
@@ -196783,7 +196807,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
      * @param pointA1 end point of the segment
      * @param fractionA1 fraction of the end of the segment
      * @param arc the arc
-     * @param reversed true to have order reversed in final structures
+     * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to geometryB).
      */
     dispatchSegmentArc(cpA, pointA0, fractionA0, pointA1, fractionA1, arc, reversed) {
         // 1) intersection between arc and segment
@@ -196799,18 +196823,18 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         const data = arc.toTransformedVectors();
         const pointA0Local = pointA0;
         const pointA1Local = pointA1;
-        const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1); //  det(A0, A1, C)
-        const beta = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0); // det(A0, A1, U)
-        const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0); // det(A0, A1, V)
-        const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_4__.GrowableFloat64Array(2);
-        const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_4__.GrowableFloat64Array(2);
-        const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_4__.GrowableFloat64Array(2);
-        const numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_5__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(// solve the equation
+        const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.center, 1); //  det(A0, A1, C)
+        const beta = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector0, 0); // det(A0, A1, U)
+        const gamma = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.tripleProductXYW(pointA0Local, 1, pointA1Local, 1, data.vector90, 0); // det(A0, A1, V)
+        const cosines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const sines = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const radians = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_5__.GrowableFloat64Array(2);
+        const numRoots = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_6__.AnalyticRoots.appendImplicitLineUnitCircleIntersections(// solve the equation
         alpha, beta, gamma, cosines, sines, radians);
         for (let i = 0; i < numRoots; i++) {
             const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));
             const arcFraction = data.sweep.radiansToSignedPeriodicFraction(radians.atUncheckedIndex(i));
-            const lineFraction = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_5__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
+            const lineFraction = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_6__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
             // only add if the point is within the start and end fractions of both line segment and arc
             if (lineFraction !== undefined && this.acceptFraction(lineFraction) && this.acceptFraction(arcFraction)) {
                 this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
@@ -196830,7 +196854,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         for (const radians1 of [parallelRadians, parallelRadians + Math.PI]) {
             const arcPoint = data.center.plus2Scaled(data.vector0, Math.cos(radians1), data.vector90, Math.sin(radians1));
             const arcFraction = data.sweep.radiansToSignedPeriodicFraction(radians1);
-            const lineFraction = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_5__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
+            const lineFraction = _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_6__.SmallSystem.lineSegment3dXYClosestPointUnbounded(pointA0Local, pointA1Local, arcPoint);
             // only add if the point is within the start and end fractions of both line segment and arc
             if (lineFraction !== undefined && this.acceptFraction(lineFraction) && this.acceptFraction(arcFraction)) {
                 this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1, arcFraction, arc, 0, 1, reversed);
@@ -196840,15 +196864,15 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     /** Low level dispatch of circular arc with circular arc. radiusA must be larger than or equal to radiusB. */
     dispatchCircularCircularOrdered(cpA, radiusA, cpB, radiusB, reversed) {
         const c = cpA.center.distance(cpB.center);
-        const e = this._maxDistanceToAccept !== undefined ? this._maxDistanceToAccept : _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance;
+        const e = this._maxDistanceToAccept !== undefined ? this._maxDistanceToAccept : _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance;
         if (c > radiusA + radiusB + e) // distance between circles is more than max distance
             return;
         // TODO: 1) intersection between arcs
         // 2) endpoints to endpoints
         this.testAndRecordFractionalPairApproach(cpA, 0, 1, false, cpB, 0, 1, false, reversed);
         // 3) line from one arc to another (perpendicular to arc tangents along center-center line)
-        if (!_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isSmallMetricDistance(c)) {
-            const vectorAB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Vector3d.createStartEnd(cpA.center, cpB.center);
+        if (!_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSmallMetricDistance(c)) {
+            const vectorAB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Vector3d.createStartEnd(cpA.center, cpB.center);
             vectorAB.scaleInPlace(1.0 / c);
             for (const rA of [-radiusA, radiusA]) {
                 for (const rB of [-radiusB, radiusB]) {
@@ -196873,7 +196897,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         const radians = Math.atan2(s, c);
         const fraction = arc.sweep.radiansToPositivePeriodicFraction(radians, 0);
         if (fraction < 1.0)
-            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveEvaluatedFraction(arc, fraction);
+            return _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(arc, fraction);
         return undefined;
     }
     /** Low level dispatch of arc with arc. Only circular arcs are supported. */
@@ -196897,34 +196921,34 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     }
     /** Low level dispatch of arc with (beziers of) a bspline curve */
     dispatchArcBsplineCurve3d(cpA, cpB, reversed) {
-        const ls = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const ls = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         cpB.emitStrokes(ls);
         this.computeArcLineString(cpA, ls, reversed);
     }
     /** Low level dispatch of (beziers of) a bspline curve with (beziers of) a bspline curve */
     dispatchBSplineCurve3dBSplineCurve3d(bcurveA, bcurveB, reversed) {
-        const lsA = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const lsA = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         bcurveA.emitStrokes(lsA);
-        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         bcurveB.emitStrokes(lsB);
         this.computeLineStringLineString(lsA, lsB, reversed);
     }
     /** Low level dispatch of linestring with (beziers of) a bspline curve */
     dispatchLineStringBSplineCurve(lsA, curveB, reversed) {
-        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         curveB.emitStrokes(lsB);
         this.computeLineStringLineString(lsA, lsB, reversed);
     }
     /** Low level dispatch of segment with (beziers of) a bspline curve */
     dispatchSegmentBsplineCurve(segA, curveB, reversed) {
-        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d.create();
+        const lsB = _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d.create();
         curveB.emitStrokes(lsB);
         this.computeSegmentLineString(segA, lsB, reversed);
     }
     /** Detail computation for segment approaching linestring. */
     computeSegmentLineString(segA, lsB, reversed) {
         const numB = lsB.numPoints();
-        const deltaFracB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.safeDivideFraction(1, numB - 1, 0);
+        const deltaFracB = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.safeDivideFraction(1, numB - 1, 0);
         const pointA0 = segA.point0Ref;
         const pointA1 = segA.point1Ref;
         const pointB0 = CurveCurveCloseApproachXY._workPointBB0;
@@ -196964,7 +196988,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     /** Low level dispatch of curve collection. */
     dispatchCurveCollection(geomA, geomAHandler) {
         const geomB = this._geometryB; // save
-        if (!geomB || !geomB.children || !(geomB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_8__.CurveCollection))
+        if (!geomB || !geomB.children || !(geomB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_9__.CurveCollection))
             return;
         for (const child of geomB.children) {
             this.resetGeometry(child);
@@ -196972,24 +196996,60 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         }
         this._geometryB = geomB; // restore
     }
+    /**
+     * Given a parent chain, convert the corresponding child details so that they refer to the chain's global parameterization.
+     * * It is assumed that `this._results[i].detailA.curve` is a child of chainA, and similarly for detailB/chainB.
+     * @param chainA convert each detailA to the global parameterization of chainA
+     * @param chainB convert each detailB to the global parameterization of chainB
+     */
+    convertChildDetailToChainDetail(chainA, chainB) {
+        for (const childDetailPair of this._results) {
+            if (chainA) {
+                const chainDetail = chainA.computeChainDetail(childDetailPair.detailA);
+                if (chainDetail)
+                    childDetailPair.detailA = chainDetail;
+            }
+            if (chainB) {
+                const chainDetail = chainB.computeChainDetail(childDetailPair.detailB);
+                if (chainDetail)
+                    childDetailPair.detailB = chainDetail;
+            }
+        }
+    }
+    /** Low level dispatch to geomA given a CurveChainWithDistanceIndex in geometryB. */
+    dispatchCurveChainWithDistanceIndex(geomA, geomAHandler) {
+        if (!this._geometryB || !(this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex))
+            return;
+        const geomB = this._geometryB; // save
+        for (const child of geomB.path.children) {
+            this.resetGeometry(child);
+            geomAHandler(geomA);
+        }
+        this.resetGeometry(geomB); // restore
+        (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(!(geomA instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex));
+        this.convertChildDetailToChainDetail(undefined, geomB);
+    }
     /** Double dispatch handler for strongly typed segment. */
     handleLineSegment3d(segmentA) {
-        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_9__.LineSegment3d) {
+        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__.LineSegment3d) {
             const segmentB = this._geometryB;
             this.dispatchSegmentSegment(segmentA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0, segmentB, segmentB.point0Ref, 0.0, segmentB.point1Ref, 1.0, false);
         }
-        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) {
+        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d) {
             this.computeSegmentLineString(segmentA, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d) {
+        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
             this.dispatchSegmentArc(segmentA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_10__.BSplineCurve3d) {
+        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_12__.BSplineCurve3d) {
             this.dispatchSegmentBsplineCurve(segmentA, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_8__.CurveCollection) {
+        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_9__.CurveCollection) {
             this.dispatchCurveCollection(segmentA, this.handleLineSegment3d.bind(this));
         }
+        else if (this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(segmentA, this.handleLineSegment3d.bind(this));
+        }
         return undefined;
     }
     /**
@@ -197030,7 +197090,7 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
             return;
         let bitB0;
         let bitB1;
-        const rangeA1 = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_11__.Range3d.createNull();
+        const rangeA1 = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_13__.Range3d.createNull();
         const pointA0 = CurveCurveCloseApproachXY._workPointAA0;
         const pointA1 = CurveCurveCloseApproachXY._workPointAA1;
         const pointB0 = CurveCurveCloseApproachXY._workPointBB0;
@@ -197070,62 +197130,76 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
     }
     /** Double dispatch handler for strongly typed linestring. */
     handleLineString3d(lsA) {
-        if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) {
+        if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d) {
             const lsB = this._geometryB;
             this.computeLineStringLineString(lsA, lsB, false);
         }
-        else if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_9__.LineSegment3d) {
+        else if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__.LineSegment3d) {
             this.computeSegmentLineString(this._geometryB, lsA, true);
         }
-        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d) {
+        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
             this.computeArcLineString(this._geometryB, lsA, true);
         }
-        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_10__.BSplineCurve3d) {
+        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_12__.BSplineCurve3d) {
             this.dispatchLineStringBSplineCurve(lsA, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_8__.CurveCollection) {
+        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_9__.CurveCollection) {
             this.dispatchCurveCollection(lsA, this.handleLineString3d.bind(this));
         }
+        else if (this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(lsA, this.handleLineString3d.bind(this));
+        }
         return undefined;
     }
     /** Double dispatch handler for strongly typed arc. */
     handleArc3d(arc0) {
-        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_9__.LineSegment3d) {
+        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__.LineSegment3d) {
             this.dispatchSegmentArc(this._geometryB, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, arc0, true);
         }
-        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) {
+        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d) {
             this.computeArcLineString(arc0, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d) {
+        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
             this.dispatchArcArc(arc0, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_10__.BSplineCurve3d) {
+        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_12__.BSplineCurve3d) {
             this.dispatchArcBsplineCurve3d(arc0, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_8__.CurveCollection) {
+        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_9__.CurveCollection) {
             this.dispatchCurveCollection(arc0, this.handleArc3d.bind(this));
         }
+        else if (this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(arc0, this.handleArc3d.bind(this));
+        }
         return undefined;
     }
     /** Double dispatch handler for strongly typed bspline curve. */
     handleBSplineCurve3d(curve) {
-        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_9__.LineSegment3d) {
+        if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__.LineSegment3d) {
             this.dispatchSegmentBsplineCurve(this._geometryB, curve, true);
         }
-        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) {
+        else if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_8__.LineString3d) {
             this.dispatchLineStringBSplineCurve(this._geometryB, curve, true);
         }
-        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d) {
+        else if (this._geometryB instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_2__.Arc3d) {
             this.dispatchArcBsplineCurve3d(this._geometryB, curve, true);
         }
-        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_10__.BSplineCurve3dBase) {
+        else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_12__.BSplineCurve3dBase) {
             this.dispatchBSplineCurve3dBSplineCurve3d(curve, this._geometryB, false);
         }
-        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_8__.CurveCollection) {
+        else if (this._geometryB instanceof _CurveCollection__WEBPACK_IMPORTED_MODULE_9__.CurveCollection) {
             this.dispatchCurveCollection(curve, this.handleBSplineCurve3d.bind(this));
         }
+        else if (this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(curve, this.handleBSplineCurve3d.bind(this));
+        }
         return undefined;
     }
+    /** Double dispatch handler for strongly typed CurveChainWithDistanceIndex. */
+    handleCurveChainWithDistanceIndex(chain) {
+        super.handleCurveChainWithDistanceIndex(chain);
+        this.convertChildDetailToChainDetail(chain, this._geometryB instanceof _CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_10__.CurveChainWithDistanceIndex ? this._geometryB : undefined);
+    }
     /** Double dispatch handler for strongly typed homogeneous bspline curve .. */
     handleBSplineCurve3dH(_curve) {
         /*
@@ -197144,11 +197218,11 @@ class CurveCurveCloseApproachXY extends _geometry3d_GeometryHandler__WEBPACK_IMP
         return undefined;
     }
 }
-CurveCurveCloseApproachXY._workPointAA0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
-CurveCurveCloseApproachXY._workPointAA1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
-CurveCurveCloseApproachXY._workPointBB0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
-CurveCurveCloseApproachXY._workPointBB1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
-CurveCurveCloseApproachXY._workPointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_6__.Point3d.create();
+CurveCurveCloseApproachXY._workPointAA0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+CurveCurveCloseApproachXY._workPointAA1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+CurveCurveCloseApproachXY._workPointBB0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+CurveCurveCloseApproachXY._workPointBB1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
+CurveCurveCloseApproachXY._workPointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_7__.Point3d.create();
 
 
 
@@ -197232,15 +197306,13 @@ class BezierBezierIntersectionXYRRToRRD extends _numerics_Newton__WEBPACK_IMPORT
  * @internal
  */
 class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_2__.NullGeometryHandler {
-    reinitialize() {
-        this._results = [];
-    }
     /**
+     * The constructor.
      * @param worldToLocal optional transform (possibly perspective) to project to xy plane for intersection.
-     * @param extendA flag to enable using extension of the other geometry.
-     * @param geometryB second curve for intersection.  Saved for reference by specific handler methods.
+     * @param extendA flag for extension of the other geometry.
+     * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
      * @param extendB flag for extension of geometryB.
-     * @param tolerance optional distance tolerance for coincidence
+     * @param tolerance optional distance tolerance for coincidence.
      */
     constructor(worldToLocal, extendA, geometryB, extendB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
         super();
@@ -197255,7 +197327,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
                 this._worldToLocalPerspective = worldToLocal.clone();
         }
         this._coincidentGeometryContext = _geometry3d_CoincidentGeometryOps__WEBPACK_IMPORTED_MODULE_4__.CoincidentGeometryQuery.create(tolerance);
-        this.reinitialize();
+        this._results = [];
     }
     /** Reset the geometry and flags, leaving all other parts unchanged (and preserving accumulated intersections) */
     resetGeometry(extendA, geometryB, extendB) {
@@ -197270,10 +197342,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             return false;
         return true;
     }
-    /**
-     * Test the fraction by strict parameter, but allow toleranced distance test at ends.
-     * @param tolerance optional distance tolerance to check proximity to start/end point
-     */
+    /** Test the fraction by strict parameter, but allow toleranced distance test at ends. */
     acceptFractionOnLine(extend0, fraction, extend1, pointA, pointB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance) {
         if (!extend0 && fraction < 0) {
             return _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isDistanceWithinTol(fraction * pointA.distanceXY(pointB), tolerance);
@@ -197283,25 +197352,32 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         return true;
     }
     /**
-     * * Return the results structure for the intersection calculation, structured as an array of CurveLocationDetailPair
+     * Return the results structure for the intersection calculation, structured as an array of CurveLocationDetailPair
      * @param reinitialize if true, a new results structure is created for use by later calls.
      */
     grabPairedResults(reinitialize = false) {
         const result = this._results;
         if (reinitialize)
-            this.reinitialize();
+            this._results = [];
         return result;
     }
     sameCurveAndFraction(cp, fraction, detail) {
         return cp === detail.curve && _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isAlmostEqualNumber(fraction, detail.fraction);
     }
     /**
-     * Compute intersection of two line segments.
-     * Filter by extension rules.
-     * Record with fraction mapping.
+     * Record the pre-computed intersection between two curves. Filter by extension rules. Record with fraction mapping.
+     * @param localFractionA intersection fraction local to the subcurve of cpA between fractionA0 and fractionA1
+     * @param cpA the first curve
+     * @param fractionA0 start of the subcurve of cpA
+     * @param fractionA1 end of the subcurve of cpA
+     * @param localFractionB intersection fraction local to the subcurve of cpB between fractionB0 and fractionB1
+     * @param cpB the second curve
+     * @param fractionB0 start of the subcurve of cpB
+     * @param fractionB1 end of the subcurve of cpB
+     * @param reversed whether to reverse the details in the recorded intersection pair
+     * @param intervalDetails optional data for a coincident segment intersection
      */
-    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, // Computed intersection fraction
-    cpB, fractionB0, fractionB1, reversed, intervalDetails) {
+    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, cpB, fractionB0, fractionB1, reversed, intervalDetails) {
         let globalFractionA, globalFractionB;
         let globalFractionA1, globalFractionB1;
         const isInterval = intervalDetails !== undefined &&
@@ -197317,7 +197393,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             globalFractionA = globalFractionA1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionA0, localFractionA, fractionA1);
             globalFractionB = globalFractionB1 = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fractionB0, localFractionB, fractionB1);
         }
-        // ignore duplicate of most recent point .  ..
+        // ignore duplicate of most recent pair
         const numPrevious = this._results.length;
         if (numPrevious > 0 && !isInterval) {
             const oldDetailA = this._results[numPrevious - 1].detailA;
@@ -197351,10 +197427,10 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     /**
-     * Emit recordPoint for multiple pairs (on full curve!)
-     * @param cpA first curve primitive (possibly different from curve in detailA, but fraction compatible)
-     * @param cpB second curve primitive (possibly different from curve in detailA, but fraction compatible)
-     * @param pairs array of pairs
+     * Emit recordPoint for multiple pairs (on full curve).
+     * @param cpA first curve primitive (possibly different from curve in detailA, but fraction compatible).
+     * @param cpB second curve primitive (possibly different from curve in detailA, but fraction compatible).
+     * @param pairs array of pairs.
      * @param reversed true to have order reversed in final structures.
      */
     recordPairs(cpA, cpB, pairs, reversed) {
@@ -197364,11 +197440,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             }
         }
     }
-    /**
-     * Compute intersection of two line segments.
-     * Filter by extension rules.
-     * Record with fraction mapping.
-     */
+    /** Compute intersection of two line segments. Filter by extension rules. Record with fraction mapping. */
     computeSegmentSegment3D(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed) {
         const uv = CurveCurveIntersectXY._workVector2dA;
         // Problem: Normal practice is to do the (quick, simple) transverse intersection first
@@ -197386,7 +197458,10 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             }
         }
     }
-    // intersection of PROJECTED homogeneous segments ...  assumes caller knows the _worldToLocal is present
+    /**
+     * Compute intersection of projected homogeneous line segments. Filter by extension rules. Record with
+     * fraction mapping. Assumes caller knows the _worldToLocal is present.
+     */
     computeSegmentSegment3DH(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed) {
         const hA0 = CurveCurveIntersectXY._workPointA0H;
         const hA1 = CurveCurveIntersectXY._workPointA1H;
@@ -197407,8 +197482,8 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     // Caller accesses data from a line segment and passes to here.
-    // (The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
-    // The fraction and extend parameters allow all combinations to be passed in)
+    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
+    // The fraction and extend parameters allow all combinations to be passed in.
     // This method applies transform.
     dispatchSegmentSegment(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed) {
         if (this._worldToLocalAffine) {
@@ -197424,14 +197499,14 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     // Caller accesses data from a linestring or segment and passes it here.
-    // (The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
-    // The fraction and extend parameters allow all combinations to be passed in)
+    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
+    // The fraction and extend parameters allow all combinations to be passed in.
     dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         // Arc: X = C + cU + sV
         // Line:  contains points A0,A1
         // Arc point colinear with line if det (A0, A1, X) = 0
         // with homogeneous xyw points and vectors.
-        // With equational X:   det (A0, A1, C) + c det (A0, A1,U) + s det (A0, A1, V) = 0.
+        // With equational X: det (A0, A1, C) + c det (A0, A1,U) + s det (A0, A1, V) = 0.
         // solve for theta.
         // evaluate points.
         // project back to line.
@@ -197487,9 +197562,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     // Caller accesses data from two arcs.
-    // each matrix has [U V C] in (x,y,w) form from projection.
-    // invert the projection matrix matrixA.
-    // apply the inverse to matrixB. Then arc b is an ellipse in the circular space of A
+    // Each matrix has [U V C] in (x,y,w) form from projection.
+    // Invert the projection matrix matrixA.
+    // Apply the inverse to matrixB. Then arc b is an ellipse in the circular space of A.
     dispatchArcArcThisOrder(cpA, matrixA, // homogeneous xyw projection !!!
     extendA, cpB, matrixB, // homogeneous xyw projection !!!
     extendB, reversed) {
@@ -197513,8 +197588,8 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
+    // Selects the best conditioned arc (in xy parts) as "circle after inversion".
+    // Solves the arc-arc equations.
     dispatchArcArc(cpA, extendA, cpB, extendB, reversed) {
         // Arc: X = C + cU + sV
         // Line:  contains points A0,A1
@@ -197560,9 +197635,6 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
                 this.recordPairs(cpA, cpB, pairs, reversed);
         }
     }
-    // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
     dispatchArcBsplineCurve3d(cpA, extendA, cpB, extendB, reversed) {
         // Arc: X = C + cU + sV
         // implicitize the arc as viewed.  This "3d" matrix is homogeneous "XYW" not "xyz"
@@ -197633,7 +197705,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             }
         }
     }
-    /** Apply the transformation to bezier curves. optionally construct ranges. */
+    /** Apply the transformation to bezier curves. Optionally construct ranges. */
     transformBeziers(beziers) {
         if (this._worldToLocalAffine) {
             for (const bezier of beziers)
@@ -197673,8 +197745,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
             const arcFraction = cpA.sweep.radiansToSignedPeriodicFraction(Math.atan2(s, c));
             if (this.acceptFraction(extendA, arcFraction, extendA) && this.acceptFraction(extendB, fractionB, extendB)) {
-              this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1,
-                fractionB, cpB, 0, 1, reversed);
+              this.recordPointWithLocalFractions(
+                arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed,
+              );
             }
           }
         */
@@ -197690,7 +197763,7 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             bezierB.poleProductsXYZW(univariateBezierB.coffs, this._xyzwPlane.x, this._xyzwPlane.y, this._xyzwPlane.z, this._xyzwPlane.w);
             let errors = 0;
             const roots = univariateBezierB.roots(0.0, true);
-            if (roots)
+            if (roots) {
                 for (const r of roots) {
                     let bezierBFraction = r;
                     bezierB.fractionToPoint4d(bezierBFraction, this._xyzwB);
@@ -197727,11 +197800,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
                         }
                     }
                 }
+            }
         }
     }
-    // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
     dispatchBSplineCurve3dBSplineCurve3d(bcurveA, bcurveB, _reversed) {
         const bezierSpanA = bcurveA.collectBezierSpans(true);
         const bezierSpanB = bcurveB.collectBezierSpans(true);
@@ -197759,9 +197830,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
     }
     /**
-     * Apply the projection transform (if any) to (xyz, w)
+     * Apply the projection transform (if any) to (xyz, w).
      * @param xyz xyz parts of input point.
-     * @param w weight to use for homogeneous effects
+     * @param w weight to use for homogeneous effects.
      */
     projectPoint(xyz, w = 1.0) {
         if (this._worldToLocalPerspective)
@@ -197786,9 +197857,9 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
             npcPlane.clone(worldPlane);
         }
     }
-    // Caller accesses data from segment and bsplineCurve
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
+    // Caller accesses data from segment and bsplineCurve.
+    // Selects the best conditioned arc (in xy parts) as "circle after inversion".
+    // Solves the arc-arc equations.
     dispatchSegmentBsplineCurve(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, bcurve, extendB, reversed) {
         const pointA0H = this.projectPoint(pointA0);
         const pointA1H = this.projectPoint(pointA1);
@@ -197870,6 +197941,38 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         }
         return undefined;
     }
+    /** Detail computation for linestring intersecting linestring. */
+    computeLineStringLineString(lsA, lsB, reversed) {
+        const pointA0 = CurveCurveIntersectXY._workPointAA0;
+        const pointA1 = CurveCurveIntersectXY._workPointAA1;
+        const pointB0 = CurveCurveIntersectXY._workPointBB0;
+        const pointB1 = CurveCurveIntersectXY._workPointBB1;
+        const numA = lsA.numPoints();
+        const numB = lsB.numPoints();
+        if (numA > 1 && numB > 1) {
+            lsA.pointAt(0, pointA0);
+            const dfA = 1.0 / (numA - 1);
+            const dfB = 1.0 / (numB - 1);
+            let fA0 = 0.0;
+            let fB0;
+            let fA1;
+            let fB1;
+            const extendA = this._extendA;
+            const extendB = this._extendB;
+            lsA.pointAt(0, pointA0);
+            for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {
+                fA1 = ia * dfA;
+                fB0 = 0.0;
+                lsA.pointAt(ia, pointA1);
+                lsB.pointAt(0, pointB0);
+                for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1) {
+                    lsB.pointAt(ib, pointB1);
+                    fB1 = ib * dfB;
+                    this.dispatchSegmentSegment(lsA, ia === 1 && extendA, pointA0, fA0, pointA1, fA1, (ia + 1) === numA && extendA, lsB, ib === 1 && extendB, pointB0, fB0, pointB1, fB1, (ib + 1) === numB && extendB, reversed);
+                }
+            }
+        }
+    }
     static setTransformedWorkPoints(transform, pointA0, pointA1, pointB0, pointB1) {
         transform.multiplyPoint3d(pointA0, this._workPointA0);
         transform.multiplyPoint3d(pointA1, this._workPointA1);
@@ -197891,40 +197994,13 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
         else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_14__.BSplineCurve3d) {
             this.dispatchSegmentBsplineCurve(segmentA, this._extendA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0, this._extendA, this._geometryB, this._extendB, false);
         }
+        return undefined;
     }
     /** Double dispatch handler for strongly typed linestring. */
     handleLineString3d(lsA) {
         if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_12__.LineString3d) {
             const lsB = this._geometryB;
-            const pointA0 = CurveCurveIntersectXY._workPointAA0;
-            const pointA1 = CurveCurveIntersectXY._workPointAA1;
-            const pointB0 = CurveCurveIntersectXY._workPointBB0;
-            const pointB1 = CurveCurveIntersectXY._workPointBB1;
-            const numA = lsA.numPoints();
-            const numB = lsB.numPoints();
-            if (numA > 1 && numB > 1) {
-                lsA.pointAt(0, pointA0);
-                const dfA = 1.0 / (numA - 1);
-                const dfB = 1.0 / (numB - 1);
-                let fA0 = 0.0;
-                let fB0;
-                let fA1;
-                let fB1;
-                const extendA = this._extendA;
-                const extendB = this._extendB;
-                lsA.pointAt(0, pointA0);
-                for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {
-                    fA1 = ia * dfA;
-                    fB0 = 0.0;
-                    lsA.pointAt(ia, pointA1);
-                    lsB.pointAt(0, pointB0);
-                    for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1) {
-                        lsB.pointAt(ib, pointB1);
-                        fB1 = ib * dfB;
-                        this.dispatchSegmentSegment(lsA, ia === 1 && extendA, pointA0, fA0, pointA1, fA1, (ia + 1) === numA && extendA, lsB, ib === 1 && extendB, pointB0, fB0, pointB1, fB1, (ib + 1) === numB && extendB, false);
-                    }
-                }
-            }
+            this.computeLineStringLineString(lsA, lsB, false);
         }
         else if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_11__.LineSegment3d) {
             this.computeSegmentLineString(this._geometryB, this._extendB, lsA, this._extendA, true);
@@ -198017,14 +198093,14 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   CurveCurveIntersectXYZ: () => (/* binding */ CurveCurveIntersectXYZ)
 /* harmony export */ });
 /* harmony import */ var _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../../bspline/BSplineCurve */ "../../core/geometry/lib/esm/bspline/BSplineCurve.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
 /* harmony import */ var _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../geometry3d/Plane3dByOriginAndUnitNormal */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndUnitNormal.js");
 /* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../numerics/Polynomials */ "../../core/geometry/lib/esm/numerics/Polynomials.js");
 /* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /*---------------------------------------------------------------------------------------------
@@ -198053,9 +198129,6 @@ __webpack_require__.r(__webpack_exports__);
  * @internal
  */
 class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__.NullGeometryHandler {
-    reinitialize() {
-        this._results = new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveLocationDetailArrayPair();
-    }
     /**
      * @param extendA flag to enable using extension of the other geometry.
      * @param geometryB second curve for intersection.  Saved for reference by specific handler methods.
@@ -198066,16 +198139,16 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         this._extendA = extendA;
         this._geometryB = geometryB;
         this._extendB = extendB;
-        this.reinitialize();
+        this._results = [];
     }
     /**
-     * * Return the results structure for the intersection calculation.
+     * Return the results structure for the intersection calculation, structured as an array of CurveLocationDetailPair.
      * @param reinitialize if true, a new results structure is created for use by later calls.
      */
-    grabResults(reinitialize = false) {
+    grabPairedResults(reinitialize = false) {
         const result = this._results;
         if (reinitialize)
-            this.reinitialize();
+            this._results = [];
         return result;
     }
     acceptFraction(extend0, fraction, extend1) {
@@ -198091,23 +198164,22 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
      * Reject if evaluated points do not match coordinates (e.g. close approach point).
      * Record with fraction mapping.
      */
-    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, // Computed intersection fraction
-    cpB, fractionB0, fractionB1, reversed) {
-        const globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionA0, localFractionA, fractionA1);
-        const globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.interpolate(fractionB0, localFractionB, fractionB1);
+    recordPointWithLocalFractions(localFractionA, cpA, fractionA0, fractionA1, localFractionB, cpB, fractionB0, fractionB1, reversed) {
+        const globalFractionA = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fractionA0, localFractionA, fractionA1);
+        const globalFractionB = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolate(fractionB0, localFractionB, fractionB1);
         // ignore duplicate of most recent point .  ..
-        const numPrevious = this._results.dataA.length;
+        const numPrevious = this._results.length;
         if (numPrevious > 0) {
-            const topFractionA = this._results.dataA[numPrevious - 1].fraction;
-            const topFractionB = this._results.dataB[numPrevious - 1].fraction;
+            const topFractionA = this._results[numPrevious - 1].detailA.fraction;
+            const topFractionB = this._results[numPrevious - 1].detailB.fraction;
             if (reversed) {
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(topFractionA, globalFractionB) &&
-                    _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(topFractionB, globalFractionA))
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(topFractionA, globalFractionB) &&
+                    _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(topFractionB, globalFractionA))
                     return;
             }
             else {
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(topFractionA, globalFractionA) &&
-                    _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.isAlmostEqualNumber(topFractionB, globalFractionB))
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(topFractionA, globalFractionA) &&
+                    _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(topFractionB, globalFractionB))
                     return;
             }
         }
@@ -198115,17 +198187,17 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         const pointB = cpB.fractionToPoint(globalFractionB);
         if (!pointA.isAlmostEqualMetric(pointB))
             return;
-        const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveLocationDetail.createCurveFractionPoint(cpA, globalFractionA, pointA);
-        detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveIntervalRole.isolated);
-        const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveLocationDetail.createCurveFractionPoint(cpB, globalFractionB, pointB);
-        detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_1__.CurveIntervalRole.isolated);
+        const detailA = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(cpA, globalFractionA, pointA);
+        detailA.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveIntervalRole.isolated);
+        const detailB = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(cpB, globalFractionB, pointB);
+        detailB.setIntervalRole(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveIntervalRole.isolated);
         if (reversed) {
-            this._results.dataA.push(detailB);
-            this._results.dataB.push(detailA);
+            const pair = new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair(detailB, detailA);
+            this._results.push(pair);
         }
         else {
-            this._results.dataA.push(detailA);
-            this._results.dataB.push(detailB);
+            const pair = new _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair(detailA, detailB);
+            this._results.push(pair);
         }
     }
     /**
@@ -198141,8 +198213,8 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         }
     }
     // Caller accesses data from a line segment and passes to here.
-    // (The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.  The fraction and extend parameters
-    // allow all combinations to be passed in)
+    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
+    // The fraction and extend parameters allow all combinations to be passed in.
     // This method applies transform.
     dispatchSegmentSegment(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed) {
         this.computeSegmentSegment3D(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, cpB, extendB0, pointB0, fractionB0, pointB1, fractionB1, extendB1, reversed);
@@ -198157,12 +198229,12 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
      * @param origin plane origin
      * @param vectorA vector which must be in the plane.
      * @param cosineValue largest cosine of the angle theta between vectorA and vectorB to prefer their cross product, e.g.
-     *  passing 0.94 ~ cos(20deg) will switch to using vectorC in the cross product if theta < ~20deg or theta > ~160deg.
+     * passing 0.94 ~ cos(20deg) will switch to using vectorC in the cross product if theta < ~20deg or theta > ~160deg.
      * @param vectorB first candidate for additional in-plane vector
      * @param vectorC second candidate for additional in-plane vector
      */
     createPlaneWithPreferredPerpendicular(origin, vectorA, cosineValue, vectorB, vectorC) {
-        cosineValue = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.restrictToInterval(Math.abs(cosineValue), 0.0, 1.0 - _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallFraction);
+        cosineValue = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.restrictToInterval(Math.abs(cosineValue), 0.0, 1.0 - _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallFraction);
         const dotAA = vectorA.magnitudeSquared();
         const dotBB = vectorB.magnitudeSquared();
         const dotAB = Math.abs(vectorA.dotProduct(vectorB));
@@ -198172,8 +198244,8 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         return undefined;
     }
     // Caller accesses data from a linestring or segment and passes it here.
-    // (The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.  The fraction and extend parameters
-    // allow all combinations to be passed in)
+    // The line segment in question might be (a) a full line segment or (b) a fragment within a linestring.
+    // The fraction and extend parameters allow all combinations to be passed in.
     dispatchSegmentArc(cpA, extendA0, pointA0, fractionA0, pointA1, fractionA1, extendA1, arc, extendB0, extendB1, reversed) {
         const lineVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_5__.Vector3d.createStartEnd(pointA0, pointA1);
         const plane = this.createPlaneWithPreferredPerpendicular(pointA0, lineVector, 0.94, arc.perpendicularVector, arc.vector0);
@@ -198208,7 +198280,7 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
             _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_3__.TrigPolynomial.solveUnitCircleHomogeneousEllipseIntersection(otherVectors.center.x, otherVectors.center.y, 1.0, otherVectors.vector0.x, otherVectors.vector0.y, 0.0, otherVectors.vector90.x, otherVectors.vector90.y, 0.0, ellipseRadians, circleRadians);
             for (let i = 0; i < ellipseRadians.length; i++) {
                 const fractionA = cpA.sweep.radiansToSignedPeriodicFraction(circleRadians[i]);
-                const fractionB = cpA.sweep.radiansToSignedPeriodicFraction(ellipseRadians[i]);
+                const fractionB = cpB.sweep.radiansToSignedPeriodicFraction(ellipseRadians[i]);
                 // hm .. do we really need to check the fractions?  We know they are internal to the beziers
                 if (this.acceptFraction(extendA, fractionA, extendA) && this.acceptFraction(extendB, fractionB, extendB)) {
                     this.recordPointWithLocalFractions(fractionA, cpA, 0, 1, fractionB, cpB, 0, 1, reversed);
@@ -198217,13 +198289,13 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         }
     }
     // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
+    // Selects the best conditioned arc (in xy parts) as "circle after inversion".
+    // Solves the arc-arc equations.
     dispatchArcArc(cpA, extendA, cpB, extendB, reversed) {
         // If arcs are in different planes:
         // 1) Intersect each plane with the other arc (quadratic)
         // 2) accept points that appear in both intersection sets.
-        // If arcs are in parallel planes -- no intersections
+        // If arcs are in parallel planes -- no intersections.
         // If arcs are in the same plane -- xy intersection in that plane.
         const planeA = _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_4__.Plane3dByOriginAndUnitNormal.create(cpA.center, cpA.perpendicularVector);
         const planeB = _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_4__.Plane3dByOriginAndUnitNormal.create(cpB.center, cpB.perpendicularVector);
@@ -198231,7 +198303,7 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
             return;
         if (planeA.getNormalRef().isParallelTo(planeB.getNormalRef())) {
             if (planeA.isPointInPlane(planeB.getOriginRef()) && planeB.isPointInPlane(planeA.getOriginRef())) {
-                // coplanar !!!
+                // coplanar
                 this.dispatchArcArcInPlane(cpA, extendA, cpB, extendB, reversed);
             }
         }
@@ -198253,8 +198325,8 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         }
     }
     // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
+    // Selects the best conditioned arc (in xy parts) as "circle after inversion".
+    // Solves the arc-arc equations.
     dispatchArcBsplineCurve3d(_arc, _extendA, _cpB, _extendB, _reversed) {
         /*
         // Arc: X = C + cU + sV
@@ -198262,7 +198334,9 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         let matrixA: Matrix3d;
         if (this._worldToLocalPerspective) {
           const dataA = cpA.toTransformedPoint4d(this._worldToLocalPerspective);
-          matrixA = Matrix3d.createColumnsXYW(dataA.vector0, dataA.vector0.w, dataA.vector90, dataA.vector90.w, dataA.center, dataA.center.w);
+          matrixA = Matrix3d.createColumnsXYW(
+            dataA.vector0, dataA.vector0.w, dataA.vector90, dataA.vector90.w, dataA.center, dataA.center.w,
+          );
         } else {
           const dataA = cpA.toTransformedVectors(this._worldToLocalAffine);
           matrixA = Matrix3d.createColumnsXYW(dataA.vector0, 0, dataA.vector90, 0, dataA.center, 1);
@@ -198274,12 +198348,21 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         const matrixAInverse = matrixA.inverse();
         if (matrixAInverse) {
           const orderF = cpB.order; // order of the beziers for simple coordinates
-          const orderG = 2 * orderF - 1;  // order of the (single) bezier for squared coordinates.
+          const orderG = 2 * orderF - 1; // order of the (single) bezier for squared coordinates.
           const coffF = new Float64Array(orderF);
           const univariateBezierG = new UnivariateBezier(orderG);
-          const axx = matrixAInverse.at(0, 0); const axy = matrixAInverse.at(0, 1); const axz = 0.0; const axw = matrixAInverse.at(0, 2);
-          const ayx = matrixAInverse.at(1, 0); const ayy = matrixAInverse.at(1, 1); const ayz = 0.0; const ayw = matrixAInverse.at(1, 2);
-          const awx = matrixAInverse.at(2, 0); const awy = matrixAInverse.at(2, 1); const awz = 0.0; const aww = matrixAInverse.at(2, 2);
+          const axx = matrixAInverse.at(0, 0);
+          const axy = matrixAInverse.at(0, 1);
+          const axz = 0.0;
+          const axw = matrixAInverse.at(0, 2);
+          const ayx = matrixAInverse.at(1, 0);
+          const ayy = matrixAInverse.at(1, 1);
+          const ayz = 0.0;
+          const ayw = matrixAInverse.at(1, 2);
+          const awx = matrixAInverse.at(2, 0);
+          const awy = matrixAInverse.at(2, 1);
+          const awz = 0.0;
+          const aww = matrixAInverse.at(2, 2);
     
           if (matrixAInverse) {
             let bezier: BezierCurve3dH | undefined;
@@ -198306,9 +198389,11 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
                   const c = bcurvePoint4d.dotProductXYZW(axx, axy, axz, axw);
                   const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
                   const arcFraction = cpA.sweep.radiansToSignedPeriodicFraction(Math.atan2(s, c));
-                  if (this.acceptFraction(extendA, arcFraction, extendA) && this.acceptFraction(extendB, fractionB, extendB)) {
-                    this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1,
-                      fractionB, cpB, 0, 1, reversed);
+                  if (this.acceptFraction(extendA, arcFraction, extendA) &&
+                    this.acceptFraction(extendB, fractionB, extendB)) {
+                    this.recordPointWithLocalFractions(
+                      arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed,
+                    );
                   }
                 }
               }
@@ -198318,8 +198403,8 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         */
     }
     /*
-    // apply the transformation to bezier curves. optionally construct ranges.
-    private transformBeziers(beziers: BezierCurve3dH[]) {
+    // Apply the transformation to bezier curves. Optionally construct ranges.
+    private transformBeziers(beziers: BezierCurve3dH[]): void {
       if (this._worldToLocalAffine) {
         for (const bezier of beziers) bezier.tryTransformInPlace(this._worldToLocalAffine);
       } else if (this._worldToLocalPerspective) {
@@ -198336,11 +198421,6 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
       }
       return ranges;
     }
-    private _xyzwA0?: Point4d;
-    private _xyzwA1?: Point4d;
-    private _xyzwPlane?: Point4d;
-    private _xyzwB?: Point4d;
-  
     private dispatchBezierBezierStrokeFirst(
       bezierA: BezierCurve3dH,
       bcurveA: BSplineCurve3dBase,
@@ -198349,11 +198429,16 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
       bcurveB: BSplineCurve3dBase,
       _strokeCountB: number,
       univariateBezierB: UnivariateBezier,  // caller-allocated for univariate coefficients.
-      reversed: boolean) {
-      if (!this._xyzwA0) this._xyzwA0 = Point4d.create();
-      if (!this._xyzwA1) this._xyzwA1 = Point4d.create();
-      if (!this._xyzwPlane) this._xyzwPlane = Point4d.create();
-      if (!this._xyzwB) this._xyzwB = Point4d.create();
+      reversed: boolean,
+    ) {
+      if (!this._xyzwA0)
+        this._xyzwA0 = Point4d.create();
+      if (!this._xyzwA1)
+        this._xyzwA1 = Point4d.create();
+      if (!this._xyzwPlane)
+        this._xyzwPlane = Point4d.create();
+      if (!this._xyzwB)
+        this._xyzwB = Point4d.create();
       const roots = univariateBezierG.roots(0.0, true);
       if (roots) {
         for (const root of roots) {
@@ -198364,8 +198449,9 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
           const s = bcurvePoint4d.dotProductXYZW(ayx, ayy, ayz, ayw);
           const arcFraction = cpA.sweep.radiansToSignedPeriodicFraction(Math.atan2(s, c));
           if (this.acceptFraction(extendA, arcFraction, extendA) && this.acceptFraction(extendB, fractionB, extendB)) {
-            this.recordPointWithLocalFractions(arcFraction, cpA, 0, 1,
-              fractionB, cpB, 0, 1, reversed);
+            this.recordPointWithLocalFractions(
+              arcFraction, cpA, 0, 1, fractionB, cpB, 0, 1, reversed,
+            );
           }
         }
       bezierA.fractionToPoint4d(0.0, this._xyzwA0);
@@ -198377,7 +198463,9 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         f1 = i * df;
         bezierA.fractionToPoint4d(f1, this._xyzwA1);
         Point4d.createPlanePointPointZ(this._xyzwA0, this._xyzwA1, this._xyzwPlane);
-        bezierB.poleProductsXYZW(univariateBezierB.coffs, this._xyzwPlane.x, this._xyzwPlane.y, this._xyzwPlane.z, this._xyzwPlane.w);
+        bezierB.poleProductsXYZW(
+          univariateBezierB.coffs, this._xyzwPlane.x, this._xyzwPlane.y, this._xyzwPlane.z, this._xyzwPlane.w,
+        );
         let errors = 0;
         const roots = univariateBezierB.roots(0.0, true);
         if (roots)
@@ -198387,7 +198475,7 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
             const segmentAFraction = SmallSystem.lineSegment3dHXYClosestPointUnbounded(this._xyzwA0, this._xyzwA1, this._xyzwB);
             if (segmentAFraction && Geometry.isIn01WithTolerance(segmentAFraction, intervalTolerance)) {
               const bezierAFraction = Geometry.interpolate(f0, segmentAFraction, f1);
-              /*- TODO implement newton search
+              // TODO implement newton search
               const xyMatchingFunction = new BezierBezierIntersectionXYRRToRRD(bezierA, bezierB);
               const newtonSearcher = new Newton2dUnboundedWithDerivative(xyMatchingFunction);
               newtonSearcher.setUV(bezierAFraction, bezierBFraction);
@@ -198412,9 +198500,11 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
                 errors++;
               if (errors > 0 && !xyzA1.isAlmostEqual(xyzB1))
                 errors++;
-              if (this.acceptFraction(false, bcurveAFraction, false) && this.acceptFraction(false, bcurveBFraction, false)) {
-                this.recordPointWithLocalFractions(bcurveAFraction, bcurveA, 0, 1,
-                  bcurveBFraction, bcurveB, 0, 1, reversed);
+              if (this.acceptFraction(false, bcurveAFraction, false) &&
+                this.acceptFraction(false, bcurveBFraction, false)) {
+                this.recordPointWithLocalFractions(
+                  bcurveAFraction, bcurveA, 0, 1, bcurveBFraction, bcurveB, 0, 1, reversed,
+                );
               }
             }
           }
@@ -198422,8 +198512,8 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
     }
     */
     // Caller accesses data from two arcs.
-    // Selects the best conditioned arc (in xy parts) as "circle after inversion"
-    // Solves the arc-arc equations
+    // Selects the best conditioned arc (in xy parts) as "circle after inversion".
+    // Solves the arc-arc equations.
     dispatchBSplineCurve3dBSplineCurve3d(_bcurveA, _bcurveB, _reversed) {
         /*
         const bezierSpanA = bcurveA.collectBezierSpans(true) as BezierCurve3dH[];
@@ -198444,9 +198534,13 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
               const strokeCountA = bezierSpanA[a].computeStrokeCountForOptions();
               const strokeCountB = bezierSpanB[b].computeStrokeCountForOptions();
               if (strokeCountA < strokeCountB)
-                this.dispatchBezierBezierStrokeFirst(bezierSpanA[a], bcurveA, strokeCountA, bezierSpanB[b], bcurveB, strokeCountB, univariateCoffsB, !_reversed);
+                this.dispatchBezierBezierStrokeFirst(
+                  bezierSpanA[a], bcurveA, strokeCountA, bezierSpanB[b], bcurveB, strokeCountB, univariateCoffsB, _reversed,
+                );
               else
-                this.dispatchBezierBezierStrokeFirst(bezierSpanB[b], bcurveB, strokeCountB, bezierSpanA[a], bcurveA, strokeCountA, univariateCoffsA, _reversed);
+                this.dispatchBezierBezierStrokeFirst(
+                  bezierSpanB[b], bcurveB, strokeCountB, bezierSpanA[a], bcurveA, strokeCountA, univariateCoffsA, !_reversed,
+                );
             }
           }
         }
@@ -198454,9 +198548,9 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
     }
     /*
     /**
-     * Apply the projection transform (if any) to (xyz, w)
+     * Apply the projection transform (if any) to (xyz, w).
      * @param xyz xyz parts of input point.
-     * @param w   weight to use for homogeneous effects
+     * @param w weight to use for homogeneous effects.
      */
     /*
     private projectPoint(xyz: XYAndZ, w: number = 1.0): Point4d {
@@ -198493,16 +198587,19 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
           // NOW .. we have a plane in world space.  Intersect it with the bspline:
         const intersections: CurveLocationDetail[] = [];
         bcurve.appendPlaneIntersectionPoints(planeCoffs, intersections);
-          // intersections has WORLD points with bspline fractions.   (The bspline fractions are all good 0..1 fractions within the spline.)
+          // intersections has WORLD points with bspline fractions.
+          // (the bspline fractions are all good 0..1 fractions within the spline).
           // accept those that are within the segment range.
         for (const detail of intersections) {
           const fractionB = detail.fraction;
           const curvePoint = detail.point;
           const curvePointH = this.projectPoint(curvePoint);
           const lineFraction = SmallSystem.lineSegment3dHXYClosestPointUnbounded(pointA0H, pointA1H, curvePointH);
-          if (lineFraction !== undefined && this.acceptFraction(extendA0, lineFraction, extendA1) && this.acceptFraction(extendB, fractionB, extendB)) {
-            this.recordPointWithLocalFractions(lineFraction, cpA, fractionA0, fractionA1,
-              fractionB, bcurve, 0, 1, reversed);
+          if (lineFraction !== undefined && this.acceptFraction(extendA0, lineFraction, extendA1) &&
+            this.acceptFraction(extendB, fractionB, extendB)) {
+            this.recordPointWithLocalFractions(
+              lineFraction, cpA, fractionA0, fractionA1, fractionB, bcurve, 0, 1, reversed,
+            );
           }
         }
         */
@@ -198519,7 +198616,7 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
           const pointA0 = CurveCurveIntersectXYZ._workPointA0;
           const pointA1 = CurveCurveIntersectXYZ._workPointA1;
           lsA.pointAt(0, pointA0);
-          for (let iA = 1; iA < numA; iA++ , pointA0.setFrom(pointA1), fA0 = fA1) {
+          for (let iA = 1; iA < numA; iA++, pointA0.setFrom(pointA1), fA0 = fA1) {
             lsA.pointAt(iA, pointA1);
             fA1 = iA * dfA;
             this.dispatchSegmentBsplineCurve(
@@ -198570,6 +198667,38 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         }
         return undefined;
     }
+    /** Detail computation for linestring intersecting linestring. */
+    computeLineStringLineString(lsA, lsB, reversed) {
+        const pointA0 = CurveCurveIntersectXYZ._workPointAA0;
+        const pointA1 = CurveCurveIntersectXYZ._workPointAA1;
+        const pointB0 = CurveCurveIntersectXYZ._workPointBB0;
+        const pointB1 = CurveCurveIntersectXYZ._workPointBB1;
+        const numA = lsA.numPoints();
+        const numB = lsB.numPoints();
+        if (numA > 1 && numB > 1) {
+            lsA.pointAt(0, pointA0);
+            const dfA = 1.0 / (numA - 1);
+            const dfB = 1.0 / (numB - 1);
+            let fA0 = 0.0;
+            let fB0;
+            let fA1;
+            let fB1;
+            const extendA = this._extendA;
+            const extendB = this._extendB;
+            lsA.pointAt(0, pointA0);
+            for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {
+                fA1 = ia * dfA;
+                fB0 = 0.0;
+                lsA.pointAt(ia, pointA1);
+                lsB.pointAt(0, pointB0);
+                for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1) {
+                    lsB.pointAt(ib, pointB1);
+                    fB1 = ib * dfB;
+                    this.dispatchSegmentSegment(lsA, ia === 1 && extendA, pointA0, fA0, pointA1, fA1, (ia + 1) === numA && extendA, lsB, ib === 1 && extendB, pointB0, fB0, pointB1, fB1, (ib + 1) === numB && extendB, reversed);
+                }
+            }
+        }
+    }
     /** Double dispatch handler for strongly typed segment. */
     handleLineSegment3d(segmentA) {
         if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d) {
@@ -198585,38 +198714,13 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         else if (this._geometryB instanceof _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_9__.BSplineCurve3d) {
             this.dispatchSegmentBsplineCurve(segmentA, this._extendA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0, this._extendA, this._geometryB, this._extendB, false);
         }
+        return undefined;
     }
-    /** double dispatch handler for strongly typed linestring .. */
+    /** double dispatch handler for strongly typed linestring. */
     handleLineString3d(lsA) {
         if (this._geometryB instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_7__.LineString3d) {
             const lsB = this._geometryB;
-            const pointA0 = CurveCurveIntersectXYZ._workPointAA0;
-            const pointA1 = CurveCurveIntersectXYZ._workPointAA1;
-            const pointB0 = CurveCurveIntersectXYZ._workPointBB0;
-            const pointB1 = CurveCurveIntersectXYZ._workPointBB1;
-            const numA = lsA.numPoints();
-            const numB = lsB.numPoints();
-            if (numA > 1 && numB > 1) {
-                lsA.pointAt(0, pointA0);
-                const dfA = 1.0 / (numA - 1);
-                const dfB = 1.0 / (numB - 1);
-                let fA0 = 0.0;
-                let fA1, fB0, fB1;
-                const extendA = this._extendA;
-                const extendB = this._extendB;
-                lsA.pointAt(0, pointA0);
-                for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {
-                    fA1 = ia * dfA;
-                    fB0 = 0.0;
-                    lsA.pointAt(ia, pointA1);
-                    lsB.pointAt(0, pointB0);
-                    for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1) {
-                        lsB.pointAt(ib, pointB1);
-                        fB1 = ib * dfB;
-                        this.dispatchSegmentSegment(lsA, ia === 1 && extendA, pointA0, fA0, pointA1, fA1, (ia + 1) === numA && extendA, lsB, ib === 1 && extendB, pointB0, fB0, pointB1, fB1, (ib + 1) === numB && extendB, false);
-                    }
-                }
-            }
+            this.computeLineStringLineString(lsA, lsB, false);
         }
         else if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d) {
             this.computeSegmentLineString(this._geometryB, this._extendB, lsA, this._extendA, true);
@@ -198645,7 +198749,7 @@ class CurveCurveIntersectXYZ extends _geometry3d_GeometryHandler__WEBPACK_IMPORT
         }
         return undefined;
     }
-    /** Double dispatch handler for strongly typed bspline curve.. */
+    /** Double dispatch handler for strongly typed bspline curve. */
     handleBSplineCurve3d(curve) {
         if (this._geometryB instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_6__.LineSegment3d) {
             this.dispatchSegmentBsplineCurve(this._geometryB, this._extendB, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB, curve, this._extendA, true);
@@ -198804,11 +198908,11 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   CurveOffsetXYHandler: () => (/* binding */ CurveOffsetXYHandler)
 /* harmony export */ });
+/* harmony import */ var _bspline_BSplineCurveOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../bspline/BSplineCurveOps */ "../../core/geometry/lib/esm/bspline/BSplineCurveOps.js");
+/* harmony import */ var _bspline_InterpolationCurve3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../bspline/InterpolationCurve3d */ "../../core/geometry/lib/esm/bspline/InterpolationCurve3d.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
-/* harmony import */ var _bspline_InterpolationCurve3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../bspline/InterpolationCurve3d */ "../../core/geometry/lib/esm/bspline/InterpolationCurve3d.js");
-/* harmony import */ var _bspline_BSplineCurveOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../bspline/BSplineCurveOps */ "../../core/geometry/lib/esm/bspline/BSplineCurveOps.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -198846,13 +198950,16 @@ class CurveOffsetXYHandler {
         if (!_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSmallMetricDistance(tangent.x) || !_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.isSmallMetricDistance(tangent.y))
             this._fitOptions.fitPoints.push(xyz.plusScaled(tangent.unitPerpendicularXY(this._v0), this._offsetDistance));
     }
-    needPrimaryGeometryForStrokes() { return true; }
+    needPrimaryGeometryForStrokes() {
+        return true;
+    }
     startParentCurvePrimitive(_cp) { }
     startCurvePrimitive(_cp) { }
     endCurvePrimitive(_cp) { }
     endParentCurvePrimitive(_cp) { }
     announceIntervalForUniformStepStrokes(cp, numStrokes, fraction0, fraction1) {
-        for (let i = 0; i <= numStrokes; ++i) { // announce both start and end; adjacent duplicates will be filtered by c2 cubic fit logic
+        // announce both start and end; adjacent duplicates will be filtered by c2 cubic fit logic
+        for (let i = 0; i <= numStrokes; ++i) {
             const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.interpolate(fraction0, i / numStrokes, fraction1);
             const ray = cp.fractionToPointAndDerivative(fraction, this._r0);
             this.pushOffsetPoint(ray.origin, ray.direction);
@@ -198861,7 +198968,8 @@ class CurveOffsetXYHandler {
     announceSegmentInterval(_cp, point0, point1, numStrokes, _fraction0, _fraction1) {
         if (numStrokes > 0) {
             const tangent = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.createStartEnd(point0, point1, this._v1);
-            for (let i = 0; i <= numStrokes; ++i) { // announce both start and end; adjacent duplicates will be filtered by c2 cubic fit logic
+            // announce both start and end; adjacent duplicates will be filtered by c2 cubic fit logic
+            for (let i = 0; i <= numStrokes; ++i) {
                 this.pushOffsetPoint(point0.interpolate(i / numStrokes, point1, this._p0), tangent);
             }
         }
@@ -206506,10 +206614,14 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   NullGeometryHandler: () => (/* binding */ NullGeometryHandler),
 /* harmony export */   RecurseToCurvesGeometryHandler: () => (/* binding */ RecurseToCurvesGeometryHandler)
 /* harmony export */ });
+/* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _curve_Path__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../curve/Path */ "../../core/geometry/lib/esm/curve/Path.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+
+
 /**
  * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.
  * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.
@@ -206520,26 +206632,34 @@ __webpack_require__.r(__webpack_exports__);
 class GeometryHandler {
     /** Handle strongly typed  [[CurveCollection]]  */
     handleCurveCollection(_g) { }
-    /** Handle strongly typed Path (base class method calls handleCurveCollection) */
+    /** Handle strongly typed [[Path]] (base class method calls [[handleCurveCollection]]) */
     handlePath(g) {
         return this.handleCurveCollection(g);
     }
-    /** Handle strongly typed  Loop (base class method calls handleCurveCollection) */
+    /** Handle strongly typed [[Loop]] (base class method calls [[handleCurveCollection]]) */
     handleLoop(g) {
         return this.handleCurveCollection(g);
     }
-    /** Handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */
+    /** Handle strongly typed [[ParityRegion]] (base class method calls [[handleCurveCollection]]) */
     handleParityRegion(g) {
         return this.handleCurveCollection(g);
     }
-    /** Handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */
+    /** Handle strongly typed [[UnionRegion]] (base class method calls [[handleCurveCollection]]) */
     handleUnionRegion(g) {
         return this.handleCurveCollection(g);
     }
-    /** Handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */
+    /** Handle strongly typed [[BagOfCurves]] (base class method calls [[handleCurveCollection]]) */
     handleBagOfCurves(g) {
         return this.handleCurveCollection(g);
     }
+    /** Handle strongly typed [[CurveChainWithDistanceIndex]] (base class method calls [[handlePath]] or [[handleLoop]]) */
+    handleCurveChainWithDistanceIndex(g) {
+        if (g.path instanceof _curve_Path__WEBPACK_IMPORTED_MODULE_0__.Path)
+            return this.handlePath(g.path);
+        if (g.path instanceof _curve_Loop__WEBPACK_IMPORTED_MODULE_1__.Loop)
+            return this.handleLoop(g.path);
+        return this.handleCurveCollection(g.path);
+    }
 }
 /**
  * `NullGeometryHandler` is a base class for dispatching various geometry types to application specific implementation
@@ -206571,6 +206691,10 @@ class NullGeometryHandler extends GeometryHandler {
         return undefined;
     }
     /** No-action implementation */
+    handleCurveChainWithDistanceIndex(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
     handleBSplineCurve3d(_g) {
         return undefined;
     }
@@ -206668,7 +206792,8 @@ class NullGeometryHandler extends GeometryHandler {
     }
 }
 /**
- * Implement GeometryHandler methods, with all curve collection methods recursing to children.
+ * Implement GeometryHandler methods, but override `handleCurveCollection` so that all methods
+ * that operate on a [[CurveCollection]] recurse to their children.
  * @public
  */
 class RecurseToCurvesGeometryHandler extends GeometryHandler {
@@ -206732,26 +206857,6 @@ class RecurseToCurvesGeometryHandler extends GeometryHandler {
     handleCurveCollection(g) {
         return this.handleChildren(g);
     }
-    /** Recurse to children */
-    handlePath(g) {
-        return this.handleChildren(g);
-    }
-    /** Recurse to children */
-    handleLoop(g) {
-        return this.handleChildren(g);
-    }
-    /** Recurse to children */
-    handleParityRegion(g) {
-        return this.handleChildren(g);
-    }
-    /** Recurse to children */
-    handleUnionRegion(g) {
-        return this.handleChildren(g);
-    }
-    /** Recurse to children */
-    handleBagOfCurves(g) {
-        return this.handleChildren(g);
-    }
     /** No-action implementation */
     handleSphere(_g) {
         return undefined;
@@ -223462,7 +223567,8 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/** Map4 carries two Matrix4d which are inverses of each other.
+/**
+ * Map4 carries two Matrix4d which are inverses of each other.
  * @public
  */
 class Map4d {
@@ -223471,16 +223577,23 @@ class Map4d {
         this._matrix1 = matrix1;
     }
     /** Return a reference to (not copy of) the "forward" Matrix4d */
-    get transform0() { return this._matrix0; }
+    get transform0() {
+        return this._matrix0;
+    }
     /** Return a reference to (not copy of) the "reverse" Matrix4d */
-    get transform1() { return this._matrix1; }
+    get transform1() {
+        return this._matrix1;
+    }
     /** Create a Map4d, capturing the references to the two matrices. */
     static createRefs(matrix0, matrix1) {
         return new Map4d(matrix0, matrix1);
     }
     /** Create an identity map. */
-    static createIdentity() { return new Map4d(_Matrix4d__WEBPACK_IMPORTED_MODULE_0__.Matrix4d.createIdentity(), _Matrix4d__WEBPACK_IMPORTED_MODULE_0__.Matrix4d.createIdentity()); }
-    /** Create a Map4d with given transform pair.
+    static createIdentity() {
+        return new Map4d(_Matrix4d__WEBPACK_IMPORTED_MODULE_0__.Matrix4d.createIdentity(), _Matrix4d__WEBPACK_IMPORTED_MODULE_0__.Matrix4d.createIdentity());
+    }
+    /**
+     * Create a Map4d with given transform pair.
      * @returns undefined if the transforms are not inverses of each other.
      */
     static createTransform(transform0, transform1) {
@@ -223514,11 +223627,19 @@ class Map4d {
         return undefined;
     }
     /** Copy contents from another Map4d */
-    setFrom(other) { this._matrix0.setFrom(other._matrix0), this._matrix1.setFrom(other._matrix1); }
+    setFrom(other) {
+        this._matrix0.setFrom(other._matrix0);
+        this._matrix1.setFrom(other._matrix1);
+    }
     /** Return a clone of this Map4d */
-    clone() { return new Map4d(this._matrix0.clone(), this._matrix1.clone()); }
+    clone() {
+        return new Map4d(this._matrix0.clone(), this._matrix1.clone());
+    }
     /** Reinitialize this Map4d as an identity. */
-    setIdentity() { this._matrix0.setIdentity(); this._matrix1.setIdentity(); }
+    setIdentity() {
+        this._matrix0.setIdentity();
+        this._matrix1.setIdentity();
+    }
     /** Set this map4d from a json object that the two Matrix4d values as properties named matrix0 and matrix1 */
     setFromJSON(json) {
         if (json.matrix0 && json.matrix1) {
@@ -223535,15 +223656,18 @@ class Map4d {
         return result;
     }
     /** Return a json object `{matrix0: value0, matrix1: value1}` */
-    toJSON() { return { matrix0: this._matrix0.toJSON(), matrix1: this._matrix1.toJSON() }; }
+    toJSON() {
+        return { matrix0: this._matrix0.toJSON(), matrix1: this._matrix1.toJSON() };
+    }
     /** Test if both matrices are almost equal to those */
     isAlmostEqual(other) {
         return this._matrix0.isAlmostEqual(other._matrix0) && this._matrix1.isAlmostEqual(other._matrix1);
     }
-    /** Create a map between a frustum and world coordinates.
+    /**
+     * Create a map between a frustum and world coordinates.
      * @param origin lower left of frustum
-     * @param uVector Vector from lower left rear to lower right rear
-     * @param vVector Vector from lower left rear to upper left rear
+     * @param uVector Vector from lower left rear to lower right rear.
+     * @param vVector Vector from lower left rear to upper left rear.
      * @param wVector Vector from lower left rear to lower left front, i.e. lower left rear towards eye.
      * @param fraction front size divided by rear size.
      */
@@ -223572,7 +223696,8 @@ class Map4d {
           */
         return result;
     }
-    /** multiply this*other. The output matrices are
+    /**
+     * Multiply this*other. The output matrices are
      * * output matrix0 = `this.matrix0 * other.matrix0`
      * * output matrix1 = 'other.matrix1 * this.matrix1`
      */
@@ -223585,19 +223710,21 @@ class Map4d {
         this._matrix0 = this._matrix1;
         this._matrix1 = temp;
     }
-    /** return a Map4d whose transform0 is
+    /**
+     * Return a Map4d whose transform0 is
      * other.transform0 * this.transform0 * other.transform1
      */
     sandwich0This1(other) {
         return new Map4d(other._matrix0.multiplyMatrixMatrix(this._matrix0.multiplyMatrixMatrix(other._matrix1)), other._matrix0.multiplyMatrixMatrix(this._matrix1.multiplyMatrixMatrix(other._matrix1)));
     }
-    /** return a Map4d whose transform0 is
+    /**
+     * Return a Map4d whose transform0 is
      * other.transform1 * this.transform0 * other.transform0
      */
     sandwich1This0(other) {
         return new Map4d(other._matrix1.multiplyMatrixMatrix(this._matrix0.multiplyMatrixMatrix(other._matrix0)), other._matrix1.multiplyMatrixMatrix(this._matrix1.multiplyMatrixMatrix(other._matrix0)));
     }
-} // Map4d
+}
 
 
 /***/ }),
@@ -233513,7 +233640,6 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-/* eslint-disable @typescript-eslint/naming-convention, @typescript-eslint/prefer-for-of */
 /**
  * A FacetSector
  * * initially holds coordinate data for a place where xyz and sectionDerivative are known
@@ -234656,16 +234782,14 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
             this.addBetweenLineStringsWithStoredIndices(strokeA, strokeB);
         }
         else if (stroke0 instanceof _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_12__.ParityRegion) {
-            for (let i = 0; i < stroke0.children.length; i++) { // eslint-disable-line @typescript-eslint/prefer-for-of
-                this.addBetweenRotatedStrokeSets(stroke0.children[i], transformA, vA, transformB, vB);
+            for (const child of stroke0.children) {
+                this.addBetweenRotatedStrokeSets(child, transformA, vA, transformB, vB);
             }
         }
         else if (stroke0 instanceof _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_13__.CurveChain) {
-            const chainA = stroke0.children;
-            for (let i = 0; i < chainA.length; i++) { // eslint-disable-line @typescript-eslint/prefer-for-of
-                const cpA = chainA[i];
-                if (cpA instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d) {
-                    this.addBetweenRotatedStrokeSets(cpA, transformA, vA, transformB, vB);
+            for (const child of stroke0.children) {
+                if (child instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d) {
+                    this.addBetweenRotatedStrokeSets(child, transformA, vA, transformB, vB);
                 }
             }
         }
@@ -234700,8 +234824,8 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         let stroke0;
         let stroke1;
         const sectionMaps = [];
-        for (let i = 0; i < contours.length; i++) { // eslint-disable-line @typescript-eslint/prefer-for-of
-            sectionMaps.push(_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contours[i].curves, this._options));
+        for (const contour of contours) {
+            sectionMaps.push(_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.createForParityRegionOrChain(contour.curves, this._options));
         }
         if (_curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.enforceStrokeCountCompatibility(sectionMaps)) {
             _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__.StrokeCountSection.enforceCompatibleDistanceSums(sectionMaps);
@@ -249556,7 +249680,13 @@ class Sample {
      * * direct spiral (half-cosine)
      */
     static createCurveChainWithDistanceIndex() {
-        const pointsA = [_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(0, 0, 0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(1, 3, 0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(2, 4, 0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(3, 3, 0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(4, 0, 0)];
+        const pointsA = [
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(0, 0, 0),
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(1, 3, 0),
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(2, 4, 0),
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(3, 3, 0),
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(4, 0, 0),
+        ];
         const result = [];
         // one singleton per basic curve type ...
         result.push(_curve_CurveChainWithDistanceIndex__WEBPACK_IMPORTED_MODULE_45__.CurveChainWithDistanceIndex.createCapture(_curve_Path__WEBPACK_IMPORTED_MODULE_22__.Path.create(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_20__.LineSegment3d.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(0, 0, 0), _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(5, 0, 0)))));
@@ -280425,7 +280555,7 @@ class TestContext {
         this.initializeRpcInterfaces({ title: this.settings.Backend.name, version: this.settings.Backend.version });
         const iModelClient = new imodels_client_management_1.IModelsClient({ api: { baseUrl: `https://${process.env.IMJS_URL_PREFIX ?? ""}api.bentley.com/imodels` } });
         await core_frontend_1.NoRenderApp.startup({
-            applicationVersion: "4.2.0-dev.31",
+            applicationVersion: "4.2.0-dev.33",
             applicationId: this.settings.gprid,
             authorizationClient: new frontend_1.TestFrontendAuthorizationClient(this.adminUserAccessToken),
             hubAccess: new imodels_access_frontend_1.FrontendIModelsAccess(iModelClient),
@@ -299833,7 +299963,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.2.0-dev.31","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.2.0-dev.31","@itwin/core-bentley":"workspace:^4.2.0-dev.31","@itwin/core-common":"workspace:^4.2.0-dev.31","@itwin/core-geometry":"workspace:^4.2.0-dev.31","@itwin/core-orbitgt":"workspace:^4.2.0-dev.31","@itwin/core-quantity":"workspace:^4.2.0-dev.31"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.1.0","@itwin/object-storage-core":"^2.1.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.2.0-dev.33","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.2.0-dev.33","@itwin/core-bentley":"workspace:^4.2.0-dev.33","@itwin/core-common":"workspace:^4.2.0-dev.33","@itwin/core-geometry":"workspace:^4.2.0-dev.33","@itwin/core-orbitgt":"workspace:^4.2.0-dev.33","@itwin/core-quantity":"workspace:^4.2.0-dev.33"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"4.0.0-dev.44","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"18.16.1","@types/sinon":"^10.0.15","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.3.10","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.44.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^15.0.4","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/cloud-agnostic-core":"^2.1.0","@itwin/object-storage-core":"^2.1.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"}}');
 
 /***/ }),